| /onnv/onnv-gate/usr/src/lib/libbc/libc/gen/common/ |
| alarm.c | 37 struct itimerval it, oitv; local
38 struct itimerval *itp = ⁢
|
| _sprintf_sup.c | 249 int iz, it; local
253 for (it = 0; it <= iz; it++) {
254 pb->bsignificand[2 * (iz - it)] = pu->significand[it] & 0xffff;
255 pb->bsignificand[2 * (iz - it) + 1] = pu->significand[it] >> 16;
260 for (it = 1; it < pb->blength; it++
[all...] |
| /onnv/onnv-gate/usr/src/cmd/lms/ |
| ProtocolCompat.cpp | 122 ChannelMap::iterator it = _openChannels.find(msg->ConnectionId); local
123 if (it != _openChannels.end()) {
124 _closeMChannel(it->second);
125 _openChannels.erase(it);
137 ChannelMap::iterator it = _openChannels.find(msg->ConnectionId); local
138 if (it != _openChannels.end()) {
139 PRINT("[Compat]sending %d bytes from HECI connection %d to socket %d\n", ntohs(msg->DataLength), msg->ConnectionId, it->second->GetSocket());
140 if (-1 == _send(it->second->GetSocket(), (char *)msg->Data, ntohs(msg->DataLength), error)) {
142 _closeMChannel(it->second);
143 _openChannels.erase(it);
[all...] |
| /onnv/onnv-gate/usr/src/cmd/ypcmd/ |
| getlist.c | 51 listofnames *it; local
59 it = (listofnames *) malloc(sizeof (listofnames));
60 if (it == NULL) {
64 it->name = copy;
65 it->nextname = NULL;
66 return (it);
|
| /onnv/onnv-gate/usr/src/common/openssl/crypto/asn1/ |
| tasn_new.c | 67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
71 void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it)
76 if (ASN1_item_ex_new(&ret, it) > 0)
83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it)
85 return asn1_item_ex_combine_new(pval, it, 0);
88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
94 const ASN1_AUX *aux = it->funcs;
106 if (it->sname
268 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnsl/nis/gen/ |
| nis_hash.c | 35 * it hashes into a fixed size hash table of 64 entries. Collisions
75 NIS_HASH_ITEM *it; local
88 for (pp = &table->keys[key]; (it = *pp) != 0; pp = &it->next) {
89 if (strcasecmp(name, it->name) == 0) {
112 * to by table. It returns 1 if the item was inserted or 0 if the item
131 item->next = *pp; /* We know it's 0, but hey... */
149 * hash table. It returns either NULL if the item doesn't exist,
166 * returns it. (same as a remove item but doesn't require the user
167 * to pass it a name.
259 NIS_HASH_ITEM *it; local
352 NIS_HASH_ITEM *it; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/os/ |
| clock_realtime.c | 73 itimer_t *it = (itimer_t *)arg; local
74 timeout_id_t *tidp = it->it_arg;
77 proc_t *p = it->it_proc;
83 timer_fire(it);
85 val = &it->it_itime.it_value;
86 interval = &it->it_itime.it_interval;
99 * current time and add the interval; it would lead to
137 *tidp = realtime_timeout(clock_realtime_fire, it, ticks);
148 itimer_t *it = (itimer_t *)arg; local
150 timespec_t *val = &it->it_itime.it_value
[all...] |
| clock_highres.c | 67 clock_highres_timer_create(itimer_t *it, struct sigevent *ev)
76 it->it_arg = NULL;
80 it->it_arg = kmem_zalloc(sizeof (cyclic_id_t), KM_SLEEP);
88 itimer_t *it = (itimer_t *)arg; local
89 hrtime_t *addr = &it->it_hrtime;
96 timer_fire(it);
100 clock_highres_timer_settime(itimer_t *it, int flags,
103 cyclic_id_t cyc, *cycp = it->it_arg;
150 * side of (a) is minimized when i is small, it is sufficient to show
172 * removed (so it's not possible to run the machine ou
[all...] |
| panic.c | 27 * When the operating system detects that it is in an invalid state, a panic
31 * making it part of the crash dump), synchronizing the file systems to
56 * code it attempts to set each trigger; if it fails it moves on to the
60 * the loser look ahead to see if any other triggers are set; if not, it
62 * are panicking, it is not possible to know this with absolute certainty.
68 * or dump is not making progress, it will invoke panic() to force a timeout.
188 * panic subsystem that it should not attempt an initial debug_enter.
238 kthread_t *it = cp->cpu_intr_thread local
[all...] |
| timer.c | 49 * may _only_ be tuned in /etc/system or by patching the kernel binary; it
55 * timer_lock() locks the specified interval timer. It doesn't look at the
56 * ITLK_REMOVE bit; it's up to callers to look at this if they need to
57 * care. p_lock must be held on entry; it may be dropped and reaquired,
60 * Note that timer_create() doesn't call timer_lock(); it creates timers
64 timer_lock(proc_t *p, itimer_t *it)
68 while (it->it_lock & ITLK_LOCKED) {
69 it->it_blockers++;
70 cv_wait(&it->it_cv, &p->p_lock);
71 it->it_blockers--
200 itimer_t **itp, *it; local
381 itimer_t *it = (itimer_t *)sigq->sq_backptr; local
464 itimer_t *it, **itp; local
709 itimer_t *it; local
745 itimer_t *it; local
805 itimer_t *it; local
820 itimer_t *it; local
847 itimer_t *it, **itp; local
891 itimer_t *it, **itp; local
946 itimer_t *it = arg; local
984 itimer_t *it; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnisdb/ |
| nis_hashitem.c | 135 * locked the table, lock it. If the table already is
142 /* Already locked; find out if it's us */
148 /* It's us. No action. */
193 * Leave traverser_id as it is, so that it
207 * traversing the table, leave it locked.
236 __nis_hash_item_mt *it, **pp; local
248 for (pp = &table->keys[key]; (it = *pp) != 0; pp = &it->next) {
249 if (strcmp(name, it->name) == 0)
692 __nis_hash_item_mt *it; local
[all...] |
| ldap_nisdbquery.c | 72 * it here just in case. This means we usually waste a byte for
153 item *it; local
162 it = buildItem(old->components.components_val[i].index_value->
167 if (it == 0) {
173 new->components.components_val[i].index_value = it;
461 * so it's unclear if it's safe to call
509 * above, so it is in fact equivalent to case (4).
1037 * still go through the rest of the array, so that it's
1168 /* If no previous value, add it */
[all...] |
| /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/ext2/ |
| ext2_resize.c | 5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
10 This program is distributed in the hope that it will be useful,
527 _("Your file system is too full to resize it to %i "
538 "resize it to %i blocks. Sorry."), newsize);
600 blk_t it; local
604 it = start + fs->itoffset;
606 /*PED_DEBUG (0x21, "start = %d, it = %d", start, it);*/
611 bb = it - 2
[all...] |
| /onnv/onnv-gate/usr/src/cmd/pools/poold/com/sun/solaris/domain/pools/ |
| DecisionHistory.java | 39 * This class maintains history about previous decisions. It can be
532 Iterator it = decisions.keySet().iterator(); local
533 while (it.hasNext()) {
534 String dk = (String)it.next();
557 for (Iterator it = resourcesAwaitingImprovement.
558 keySet().iterator(); it.hasNext(); ) {
559 Resource res = (Resource)it.next();
576 it.remove();
587 ListIterator it = decisionList.listIterator(0); local
588 while (it.hasNext())
[all...] |
| StatisticList.java | 130 * @param it An iterator over the contained elements to be
135 private AggregateStatistic getSnapshot(Iterator it)
138 return (getSnapshotForInterval(it, null, null));
161 * @param it An iterator over the contained elements to be
168 private AggregateStatistic getSnapshotForInterval(Iterator it,
172 return (f.getSnapshotForInterval(it, start, end));
422 * listener object is invoked, and the StatisticEvent is passed to it.
526 Iterator it; local
529 it = statistics.iterator();
530 while (it.hasNext())
[all...] |
| /onnv/onnv-gate/usr/src/cmd/hal/tools/ |
| hal-device.c | 13 * This program is free software; you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
18 * This program is distributed in the hope that it will be useful,
226 LibHalPropertySetIterator it; local
239 for(libhal_psi_init(&it, props); libhal_psi_has_more(&it); libhal_psi_next(&it)) {
240 type = libhal_psi_get_type(&it);
244 libhal_psi_get_key(&it),
245 libhal_psi_get_string(&it)
[all...] |
| lshal.c | 11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by
16 * This program is distributed in the hope that it will be useful,
93 LibHalPropertySetIterator it; local
111 for (libhal_psi_init (&it, props); libhal_psi_has_more (&it); libhal_psi_next (&it)) {
112 type = libhal_psi_get_type (&it);
116 libhal_psi_get_key (&it),
117 libhal_psi_get_string (&it));
[all...] |
| /onnv/onnv-gate/usr/src/uts/sun4v/cpu/ |
| niagara2.c | 368 mem_node_iterator_t *it = cookie; local
373 if (it == ((mem_node_iterator_t *)(-1))) {
375 } else if (it != NULL) {
376 ASSERT(pfn >= it->mi_mblock_base && pfn <= it->mi_mblock_end);
377 pfn = pfn + it->mi_ra_to_pa;
461 (((pfn) & it->mi_mnode_pfn_mask) >> it->mi_mnode_pfn_shift)
468 mem_node_iterator_t *it = cookie; local
475 ASSERT(pfn >= it->mi_mblock_base && pfn <= it->mi_mblock_end)
653 mem_node_iterator_t it; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/i86pc/io/acpi/acpidev/ |
| acpidev_drv.c | 51 * connected to it.
351 /* Create the device node if it doesn't exist. */
421 /* Check whether it has already been initialized. */
538 * It will be called in single-threaded environment to enumerate devices in
593 acpidev_class_list_t *it; local
633 for (it = *(infop->awi_class_list); it != NULL; it = it->acl_next) {
634 if (it->acl_class->adc_pre_probe == NULL)
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/idm/ |
| idm_impl.c | 135 * in FFP we just don't know it yet -- to address this we
339 * just treat it as a normal PDU event. Client
450 idm_transport_t *it; local
454 it = &idm_transport_list[type];
456 if ((it->it_ops != NULL) && (it->it_type == tt))
459 ASSERT(it->it_type == tt);
460 if (it->it_type != tt)
472 ic->ic_transport_ops = it->it_ops;
528 idm_transport_t *it; local
560 idm_transport_t *it; local
599 idm_transport_t *it; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libidmap/common/ |
| namemaps.c | 41 * It can be overwritten by supplying a logger
236 * make it future-proof, especially standalone libsldap-proof
462 const char *it, *new_it; local
464 for (it = dns; it != NULL; it = strchr(it, '.')) {
465 it ++;
473 it = dns;
475 new_it = strchr(it, '.')
549 char *it = *name; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnisdb/yptol/ |
| dit_access.c | 149 /* It worked, return value irrelevant */
231 * The mapping failed and will fail again if it is
392 * we can recover it from the hash table. This makes hard work but
407 __nis_hash_item_mt *it; local
440 for (it = ldapMappingList.keys[i]; NULL != it; it = it->next) {
442 if ((target_len + domain_len + 1) > strlen(it->name))
444 if (0 != strncmp(it->name, target, target_len)
951 __nis_hash_item_mt *it; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/i86pc/os/ |
| intr.c | 80 * it assists in debugging when asserts that interrupts are enabled trip.
103 * (and *must* switch to it), non-zero if we are already on that stack.
200 * non-zero if there are more (in which case we should stay on it).
289 kthread_t *t, *volatile it; local
323 it = cpu->cpu_intr_thread;
324 cpu->cpu_intr_thread = it->t_link;
325 it->t_intr = t;
326 it->t_lwp = t->t_lwp;
330 * preset to TS_ONPROC, but it helps in debugging if
333 it->t_state = TS_ONPROC
356 kthread_t *it = cpu->cpu_thread; \/* curthread *\/ local
526 kthread_t *t, *volatile it; local
634 kthread_t *t, *it; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/pyzfs/common/ |
| ioctl.c | 557 const zprop_index_t *it = p->pd_table; local
560 for (j = 0; it[j].pi_name; j++) {
562 it[j].pi_name,
563 Py_BuildValue("K", it[j].pi_value));
|
| /onnv/onnv-gate/usr/src/uts/common/io/comstar/lu/stmf_sbd/ |
| sbd_pgr.c | 86 static void sbd_pgr_do_reserve(sbd_pgr_t *, sbd_pgr_key_t *, sbd_it_data_t *it,
216 /* Commands allowed for registered IT nexues but not reservation holder */
243 #define PGR_RESERVATION_HOLDER(pgr, key, it) ( \
246 ((key)->pgr_key_it) && ((key)->pgr_key_it == (it))))
521 sbd_it_data_t *it; local
525 for (it = slu->sl_it_list; it != NULL; it = it->sbd_it_next) {
526 it->pgr_key_ptr = NULL
560 sbd_it_data_t *it; local
601 sbd_it_data_t *it; local
636 sbd_it_data_t *it; local
657 sbd_it_data_t *it; local
720 sbd_it_data_t *it = slu->sl_it_list; local
786 sbd_it_data_t *it = (sbd_it_data_t *)task->task_lu_itl_handle; local
928 sbd_it_data_t *it = task->task_lu_itl_handle; local
1195 sbd_it_data_t *it = task->task_lu_itl_handle; local
1404 sbd_it_data_t *it = task->task_lu_itl_handle; local
1484 sbd_it_data_t *it = task->task_lu_itl_handle; local
1528 sbd_it_data_t *it = task->task_lu_itl_handle; local
1561 sbd_it_data_t *it = task->task_lu_itl_handle; local
1680 sbd_it_data_t *it = task->task_lu_itl_handle; local
1789 sbd_it_data_t *it; local
[all...] |
