/illumos-gate/usr/src/uts/common/os/ |
H A D | contract.c | 1203 * Returns the next type contract after the specified id, visible from 1221 * Returns the next contract after the specified id, visible from the 1239 * Returns the next contract held by process p after the specified id, 1938 ct_kevent_t *e, *next; local 1947 next = l->ctl_position; 1948 while (e = cte_qmove(q, l, next)) { 1959 next = list_next(&q->ctq_events, e); 1981 next = list_next(&q->ctq_events, e); 2002 next = list_next(&q->ctq_events, e); 2009 next 2122 ct_kevent_t *e, *next; local 2166 ct_kevent_t *e, *next; local [all...] |
/illumos-gate/usr/src/uts/common/io/myri10ge/drv/ |
H A D | myri10ge.c | 408 while (j->next != NULL) 409 j = j->next; 429 jtail->next = jfree; 432 while (j->next != NULL) 433 j = j->next; 464 jpool->head = j->next; 498 j->next = jpool->head; 528 j->next = (void *)old; 619 j->next = jpool->head; 661 j = j->next; [all...] |
/illumos-gate/usr/src/uts/common/inet/sctp/ |
H A D | sctp_input.c | 63 * the next expected SSN to be present in the stream queue, we deliver any 82 p = s->next; 103 (*head)->prev = (*head)->next = NULL; 121 t->next = *head; 139 * 4a. p may now border p->next from less; if so, coalesce those 144 for (p = *head; ; p = p->next) { 150 t->next = p; 156 p->prev->next = t; 178 if (p->next != NULL && (tsn + 1) == p->next 2347 mblk_t *next; local [all...] |
/illumos-gate/usr/src/uts/common/pcmcia/cs/ |
H A D | cs.c | 289 ct->next = &client_types[1]; 291 ct = ct->next; 294 ct->next = &client_types[2]; 296 ct = ct->next; 299 ct->next = NULL; 984 * cs_get_firstnext_tuple - returns the first/next tuple of the specified type 1040 * be returned to the caller. Instead, the next tuple that matches 1140 * with get next tuple requests but we don't have any more 1149 * Point to the next tuple in the list. If we're searching for 1874 client = client->next; [all...] |
/illumos-gate/usr/src/uts/common/fs/nfs/ |
H A D | nfs4_stub_vnops.c | 941 * nfs_ext_u.nfs_extB.next. 964 struct nfs_args *next; local 969 * next: the newly-created element to be added 997 next = nargs->nfs_ext_u.nfs_extB.next; 999 nargs = next; 1021 next = nfs4_trigger_nargs_create(mi, svp, esi); 1025 nargs_head = next; 1031 nargs->nfs_ext_u.nfs_extB.next = next; 1072 struct nfs_args *next = local 2849 nfs4_ephemeral_tree_t *next; local [all...] |
/illumos-gate/usr/src/uts/common/io/ral/ |
H A D | rt2560.c | 578 ring->cur = ring->next = 0; 645 ring->cur = ring->next = 0; 704 ring->cur = ring->next = 0; 767 ring->cur = ring->next = 0; 1033 desc = &sc->txq.desc[sc->txq.next]; 1034 data = &sc->txq.data[sc->txq.next]; 1082 ral_debug(RAL_DBG_INTR, "tx done idx=%u\n", sc->txq.next); 1085 sc->txq.next = (sc->txq.next + 1) % RT2560_TX_RING_COUNT; 1119 desc = &sc->prioq.desc[sc->prioq.next]; 1715 mblk_t *next; local [all...] |
/illumos-gate/usr/src/lib/passwdutil/ |
H A D | files_attr.c | 233 for (p = items; p != NULL; p = p->next) { 412 attr.next = NULL; 487 for (w = items; res == PWU_SUCCESS && w != NULL; w = w->next) { 628 list = list->next; 662 for (p = items; p != NULL; p = p->next) { 784 p->data.val_i != -1 && max_present(p->next) == 0) 813 * the next time [s]he logs-in. 832 max_present(p->next) == 0)
|
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/support/ |
H A D | fake-addrinfo.c | 589 entry->next = krb5int_fac.data; 623 *fpp = fp->next; 628 fpp = &(*fpp)->next; 631 for (fp = krb5int_fac.data; fp; fp = fp->next) { 675 because the next lookup may not use the same constraints as 811 struct addrinfo *next; local 813 next = ai->ai_next; 819 ai = next;
|
/illumos-gate/usr/src/lib/libsip/common/ |
H A D | sip_ui.c | 47 * passed in will return next header of the same type. 49 * with no name but an old header will return the next header. 158 value = value->next; 167 * Return the next value of the header. 176 if (old_value == NULL || old_value->next == NULL) { 184 value = (sip_header_value_t)old_value->next; 186 value = value->next; 304 if (_sip_header_value->next == NULL) { 313 value = value->next; 325 value = value->next; [all...] |
/illumos-gate/usr/src/lib/libtecla/common/ |
H A D | pcache.c | 91 * is recorded in this byte, such that the next time it is looked 123 PathNode *next; /* The next directory in the path */ member in struct:PathNode 183 * Extract the next component of a colon separated list of directory 512 const char *pptr; /* A pointer to the next unprocessed character in path[] */ 539 * Extract the next pathname component into pc->path->name. 560 for(node=pc->head; node; node=node->next) { 568 * Extract the next directory path from a colon-separated list of 573 * path const char * A pointer to the start of the next component 576 * nextp const char ** A pointer to the next unprocesse [all...] |
/illumos-gate/usr/src/lib/libresolv2/common/irs/ |
H A D | dns_ho.c | 111 struct dns_res_target *next; member in struct:dns_res_target 201 ho->next = ho_next; 295 for (p = q; p; p = p->next) { 379 q->next = q2; 457 for (p = q; p; p = p->next) { 586 q->next = q2; 622 for (p = q; p; p = p->next) {
|
/illumos-gate/usr/src/lib/libc/sparcv9/gen/ |
H A D | strlcpy.s | 248 srlx %i5, 8, %i5 ! byte mask for next byte 273 ba .storebyte1421 ! next dword 291 ba .storebyte1241 ! next dword 307 ba .storehalfword ! next dword 309 nop ! align next loop to 16-byte boundary 310 nop ! align next loop to 16-byte boundary 323 ba .storeword2 ! next dword
|
/illumos-gate/usr/src/cmd/fm/eversholt/common/ |
H A D | ptree.c | 131 if (np->u.name.next) { 132 ASSERT(np->u.name.next->t == T_NAME); 137 ptree(flags, np->u.name.next, no_iterators, fileline); 604 name_pattern_match(np->u.name.next, 612 np = np->u.name.next; 721 for (np = Props; np; np = np->u.stmt.next) 726 for (np = Masks; np; np = np->u.stmt.next)
|
/illumos-gate/usr/src/cmd/fs.d/autofs/ |
H A D | autod_main.c | 383 for (ul = m; ul; ul = ul->next) 567 action_list *p, *next = NULL; local 570 for (p = alp; p != NULL; p = next) { 597 next = p->next; 628 if (args->next) 629 autofs_unmount_1_free_args(args->next);
|
/illumos-gate/usr/src/cmd/krb5/krb5kdc/ |
H A D | kdc_util.c | 579 char next[MAX_REALM_LN]; local 584 int clst, nlst; /* count of last character in current and next */ 676 /* read field into next */ 688 next[i++] = *otrans++; 694 next[i] = '\0'; 703 /* Is the next field compressed? If not, and if the new */ 706 /* current one. Note that we can not do this if the next*/ 710 /* subrealm of the next field too, and we will catch */ 715 assert(nlst < 0 || nlst < sizeof(next)); 716 if ((nlst < 0 || next[nls [all...] |
/illumos-gate/usr/src/cmd/svr4pkg/libinst/ |
H A D | pkgdbmerg.c | 313 struct pinfo *next; local 314 next = pkginfo->next; 316 pkginfo = next; 359 el_ent->cf_ent.pinfo->next = NULL; 1129 pp = pp->next; 1139 pp = pp->next;
|
/illumos-gate/usr/src/tools/ctf/dwarf/common/ |
H A D | dwarf_frame2.c | 1020 Dwarf_Cie next = 0; local 1027 for (next = head_cie_ptr; next; next = next->ci_next) { 1028 if (cie_ptr == next->ci_cie_start) { 1029 *cie_ptr_to_use_out = next;
|
/illumos-gate/usr/src/tools/ndrgen/ |
H A D | ndr_anal.c | 83 for (ti = typeinfo_list; ti; ti = ti->next) { 320 for (ti = typeinfo_list; ti; ti = ti->next) { 761 for (sym = symbol_list; sym; sym = sym->next) { 839 for (pp = &typeinfo_list; *pp; pp = &(*pp)->next) 843 ti->next = 0; 852 for (ti = typeinfo_list; ti; ti = ti->next) { 955 for (ti = typeinfo_list; ti; ti = ti->next) {
|
/illumos-gate/usr/src/lib/libast/common/sfio/ |
H A D | sfhdr.h | 32 #define _next next 665 { Sfpool_t* next; member in struct:_sfpool_s 738 Fmt_t* next; /* stack frame pointer */ member in struct:_fmt_s 863 ((f)->endb = (f)->endr = (f)->endw = (f)->next = \ 945 #define _SFAVAIL(f,s,n) ((n) = (f)->endb - ((s) = (f)->next) ) 947 ((n) = SFFILBUF(f,-1), (s) = (f)->next, (n)) ) 949 ((n) = SFFLSBUF(f,-1), (s) = (f)->next, (n)) ) 955 #define SFSTRSIZE(f) { Sfoff_t s = (f)->next - (f)->data; \
|
/illumos-gate/usr/src/cmd/make/lib/mksh/ |
H A D | macro.cc | 676 /* Then find the end of the next word. */ 865 macro_on_list = macro_on_list->next) { 879 new_macro->next = cond_macro_list; 1032 chain = chain->next) { 1036 if (chain->next != NULL) { 1160 chain = chain->next) { 1229 for (p = envvar; p != NULL; p = p->next) { 1239 p->next = envvar;
|
H A D | misc.cc | 248 for (Property next, p = name->prop; p != NULL; p = next) { 249 next = p->next; 607 for (; prop != NULL; insert = &prop->next, prop = *insert); 612 prop->next = NULL; 645 * Scan the property list of a Name to find the next property 660 for (; start != NULL; start = start->next) {
|
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/os/ |
H A D | locate_kdc.c | 631 if (head->next == 0 && head->host[0] == 0) { 658 struct srv_dns_entry *entry = NULL, *next; local 662 for (entry = head; entry != NULL; entry = entry->next) { 694 struct srv_dns_entry *entry = NULL, *next; local 698 for (entry = head; entry; entry = entry->next, c++) { 711 for (entry = head->next; entry; entry = entry->next) {
|
/illumos-gate/usr/src/lib/cfgadm_plugins/fp/common/ |
H A D | cfga_cs.c | 161 i++, lunlistp = lunlistp->next) { 193 lunlistp = lunlistp->next) { 226 lunlistp = lunlistp->next) { 296 lunlistp = lunlistp->next) { 434 lunlistp = lunlistp->next) { 521 lunlistp = lunlistp->next) { 654 lunlistp = lunlistp->next) { 659 for (temp = lunlistp->next; temp != NULL; 660 temp = temp->next) { 792 * then try the SCSI Inquiry on the next lu [all...] |
/illumos-gate/usr/src/cmd/picl/plugins/sun4u/psvc/psvcplugin/ |
H A D | psvcplugin.c | 75 struct interval_info *next; member in struct:interval_info 645 ip->next = NULL; 717 for (ip = first_interval; ip != NULL; ip = ip->next) { 726 for (ip = first_interval; ip != NULL; ip = ip->next) { 813 prev->next = ip; 1787 EInterval_t *ip, *next; local 1790 for (ip = first_interval; ip != 0; ip = next) { 1796 next = ip->next;
|
/illumos-gate/usr/src/uts/common/fs/udfs/ |
H A D | udf_bmap.c | 205 int32_t blkcount, next; local 260 next = end_req / mext_sz; 262 next = 1; 265 ((next / EXT_PER_MALLOC) + 1) * EXT_PER_MALLOC; 943 struct icb_ext *iext, *next; local 959 next = &ip->i_ext[index + 1]; 963 next->ib_count -= count; 964 next->ib_offset = iext->ib_offset + iext->ib_count; 966 next->ib_block = iext->ib_block +
|