/illumos-gate/usr/src/uts/common/sys/ |
H A D | bofi_impl.h | 36 struct bofi_errent *next; /* next on in-use chain */ member in struct:bofi_errent 37 struct bofi_errent *cnext; /* next on clone chain */ 59 struct bofi_link *link; /* next on shadow handle chain */ 73 struct bofi_shadow *next; /* next on inuse chain */ member in struct:bofi_shadow 75 struct bofi_shadow *hnext; /* next on hhash chain */ 77 struct bofi_shadow *dnext; /* next on dhash chain */
|
/illumos-gate/usr/src/lib/libadm/inc/ |
H A D | devtab.h | 133 * struct attrval *next Pointer to the next item in the list 139 struct attrval *next; /* Next attrval in list */ member in struct:attrval 171 * next Ptr to next item in the list 176 struct member *next; /* Next member in the list */ member in struct:member 183 * _getdevtabent() Gets the next device table entry 191 * _getdgrptabent() Get the next device-group table entry
|
/illumos-gate/usr/src/lib/libast/common/hash/ |
H A D | hashlib.h | 67 Hash_root_t* next; /* next in list of all roots */ \ 74 Hash_table_t* next; /* root reference list link */
|
H A D | hashsize.c | 68 old_b = old_b->next; 71 new_b->next = new_s[index];
|
H A D | hashview.c | 63 for (b = *sp++; b; b = b->next) 78 for (b = *sp++; b; b = b->next)
|
/illumos-gate/usr/src/lib/libast/common/sfio/ |
H A D | sfgetd.c | 65 { f->next = s; 69 f->next = s;
|
H A D | sfgetl.c | 60 f->next = s; 65 f->next = s;
|
H A D | sfresize.c | 50 { if((f->flags&SF_MALLOC) && (f->next - f->data) <= size) 68 { if(f->next > f->data)
|
/illumos-gate/usr/src/cmd/mandoc/ |
H A D | libroff.h | 37 struct tbl_node *next; member in struct:tbl_node 43 struct eqn_node *next; /* singly linked list of equations */ member in struct:eqn_node
|
H A D | tbl_data.c | 47 /* Advance to the next layout cell, skipping spanners. */ 49 cp = dp->last == NULL ? dp->layout->first : dp->last->layout->next; 51 cp = cp->next; 71 for (cp = cp->next; cp != NULL; cp = cp->next) 80 dp->last->next = dat; 178 dp->prev->next = dp; 200 for (rp = tbl->last_span->layout->next; 202 rp = rp->next) {
|
H A D | man_validate.c | 112 man->last = man->last->next; 116 man->next = ROFF_NEXT_SIBLING; 186 else if (n->child->next != NULL && n->child->next->next != NULL) { 187 n = n->child->next->next; 274 n->child->next != NULL ? " ..." : ""); 343 n = n->next; 355 n = n->next; [all...] |
/illumos-gate/usr/src/boot/sys/boot/common/ |
H A D | console.c | 203 char *curpos, *dup, *next; local 205 dup = next = strdup(string); 207 while (next != NULL) { 208 curpos = strsep(&next, " ,"); 241 char *curpos, *dup, *next; local 249 dup = next = strdup(string); 251 while (next != NULL) { 252 curpos = strsep(&next, " ,");
|
/illumos-gate/usr/src/boot/sys/boot/fdt/dts/arm/ |
H A D | meson3.dtsi | 59 next-level-cache = <&L2>;
|
/illumos-gate/usr/src/uts/common/io/usb/usba/ |
H A D | usba.c | 49 struct usba_root_hub_ent *next; member in struct:usba_root_hub_ent 631 usba_evdata_t *next; local 634 next = evdata->ev_next; 636 evdata = next; 1010 ASSERT(head->next == NULL); 1021 usba_list_entry_t *next; local 1030 ASSERT(element->next == NULL); 1041 for (next = head->next; (next ! 1259 usba_list_entry_t *next; local 1291 usba_list_entry_t *next; local 3139 usb_client_dev_data_list_t *next; local [all...] |
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/profile/ |
H A D | prof_init.c | 47 /* if this file is missing, skip to the next */ 56 last->next = new_file; 96 COUNT_LINKED_LIST (size, prf_file_t, old_profile->first_file, next); 100 for (i = 0, file = old_profile->first_file; i < size; i++, file = file->next) 231 prf_file_t p, next; local 236 for (p = profile->first_file; p; p = next) { 237 next = p->next; 247 prf_file_t p, next; local 252 for (p = profile->first_file; p; p = next) { [all...] |
/illumos-gate/usr/src/lib/libtecla/common/ |
H A D | history.c | 67 GlhLineSeg *next; /* The next sub-string of the history line */ member in struct:GlhLineSeg 69 /* substring of a line, as indicated by 'next' */ 91 GlhHashNode *next; /* The next in the list of nodes within the */ member in struct:GlhHashNode 137 GlhLineNode *next; /* The next youngest line in the list */ member in struct:GlhLineNode 138 GlhLineNode *prev; /* The next oldest line in the list */ 193 unsigned long seq; /* The next ID to assign to a line node */ 220 GlhLineSeg *seg; /* The line segment that the next characte 1853 GlhLineNode *next; /* The line node that follows 'node' */ local [all...] |
/illumos-gate/usr/src/cmd/truss/ |
H A D | listopts.c | 90 char *next; local 100 sys = strtol(name, &next, 0); 102 if (sys < 0 || sys > PRMAXSYS || *next != '\0') 336 char *next; local 346 sig = strtol(name, &next, 0); 347 if (sig <= 0 || sig > PRMAXSIG || *next != '\0') { 410 char *next; local 420 flt = strtol(name, &next, 0); 421 if (flt <= 0 || flt > PRMAXFAULT || *next != '\0') { 483 char *next; local [all...] |
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/ |
H A D | rc_base.c | 31 struct krb5_rc_typelist *next; member in struct:krb5_rc_typelist 77 t_next = t->next; 91 for (t = typehead;t && strcmp(t->ops->type,ops->type);t = t->next) 102 t->next = typehead; 118 for (t = typehead;t && strcmp(t->ops->type,type);t = t->next)
|
/illumos-gate/usr/src/lib/libshell/common/sh/ |
H A D | fcin.c | 71 * If _Fcin.fclast!=0, performs an sfreserve() for the next buffer. 156 unsigned char *next; member in struct:Extra 165 if((c = mbsize(extra.next)) < 0) 174 *s = state[*extra.next++]; 179 c = mbchar(extra.next); 197 extra.next = extra.buff;
|
H A D | nvtree.c | 73 while(fp=fp->next) 136 for(fp=np->nvfun;fp;fp=fp->next) 146 char *next,*last; local 167 if(!(next=nextdot(last))) 169 *next = 0; 171 *next = '.'; 175 name = next+1; 205 next = 0; 206 else if(next= nextdot(last)) 208 c = *next; [all...] |
/illumos-gate/usr/src/lib/libfru/libfru/ |
H A D | Ancestor.cc | 43 next(NULL) 60 delete next; 77 if (next != NULL) { 78 next->print(); 166 while (tmp->next != NULL) { 167 tmp = tmp->next; 169 tmp->next = ant;
|
/illumos-gate/usr/src/lib/libresolv2/common/irs/ |
H A D | gen_ng.c | 86 ng->next = ng_next; 115 if ((*ng->next)(ng, host, user, domain) == 1) 119 pvt->rule = pvt->rule->next; 138 for (rule = pvt->rules; rule; rule = rule->next) { 167 for (rule = pvt->rules; rule != NULL; rule = rule->next) {
|
/illumos-gate/usr/src/lib/libbc/libc/gen/common/ |
H A D | drand48.c | 86 static void next(); 93 next(); 102 next(); 109 next(); 114 next() function
|
/illumos-gate/usr/src/cmd/acct/ |
H A D | acctdusg.c | 51 struct disk *next; /* next entry at same hash tbl index */ member in struct:disk 151 curdisk->next = usglist[key]; 165 curdisk != NULL; curdisk = curdisk->next) { 188 entry != NULL; entry = entry->next) { 275 entry != NULL; entry = entry->next) {
|
/illumos-gate/usr/src/uts/common/cpr/ |
H A D | cpr_driver.c | 146 dev_info_t *dip, *next, *last = NULL; local 153 next = ddi_get_next_sibling(dip); 154 while (next != last) { 155 dip = next; 156 next = ddi_get_next_sibling(dip);
|