/illumos-gate/usr/src/cmd/modload/ |
H A D | add_drv.c | 58 struct dev_list *next; member in struct:dev_list 498 char *next = data; local 507 next = strtok(data, MOD_SEP); 514 while (next != NULL) { 516 "%s/drv/%s/%s", next, curdir->direc, drv_name); 535 next = strtok((char *)NULL, MOD_SEP); 538 next = strtok(data, MOD_SEP); 539 curdir = curdir->next; 717 new_entry->next = conflict_lst; 801 ptr = ptr->next; [all...] |
/illumos-gate/usr/src/cmd/dlmgmtd/ |
H A D | dlmgmt_util.c | 175 dlmgmt_prefix_t *lpp, *next; local 177 for (lpp = dlmgmt_prefixlist.lp_next; lpp != NULL; lpp = next) { 178 next = lpp->lp_next; 203 dlmgmt_linkattr_t *next, *prev; local 205 next = attrp->lp_next; 207 if (next != NULL) 208 next->lp_prev = prev; 210 prev->lp_next = next; 212 *headp = next; 317 dlmgmt_linkattr_t *next, *attr local 502 dlmgmt_linkattr_t *next, *attrp; local 597 dlmgmt_linkattr_t *next, *attrp; local [all...] |
/illumos-gate/usr/src/lib/librstp/common/ |
H A D | port.c | 53 for (this = stpm->ports; this; this = this->next) { 176 pv = (void*) stater->next; 182 for (tmp = stpm->ports; tmp; tmp = tmp->next) { 185 prev->next = this->next; 187 stpm->ports = this->next; 210 for (stater = this->machines; stater; stater = stater->next) {
|
H A D | rolesel.c | 131 for (port = this->ports; port; port = port->next) { 141 for (port = this->ports; port; port = port->next) { 156 for (port = stpm->ports; port; port = port->next) { 212 for (port = stpm->ports; port; port = port->next) { 246 for (port = stpm->ports; port; port = port->next) { 302 for (port = this->ports; port; port = port->next) { 311 for (port = this->ports; port; port = port->next) { 362 for (port = stpm->ports; port; port = port->next) { 388 for (port = this->ports; port; port = port->next) {
|
/illumos-gate/usr/src/lib/libdiskmgt/common/ |
H A D | disks_private.h | 46 struct slice_info *next; member in struct:slice_info 58 struct alias_info *next; member in struct:alias_info 68 struct path *next; member in struct:path 78 struct bus_info *next; member in struct:bus_info 89 struct controller_info *next; member in struct:controller_info 103 struct disk *next; member in struct:disk 123 struct descriptor *next; member in struct:descriptor
|
H A D | events.c | 45 struct event_list *next; member in struct:event_list 121 tmpp = events->next; 282 events->next = NULL; 292 for (ep = events; ep->next != NULL; ep = ep->next); 299 new_event->next = NULL; 301 ep->next = new_event;
|
H A D | inuse_fs.c | 49 struct heuristic *next; member in struct:heuristic 57 struct vfstab_list *next; member in struct:vfstab_list 106 for (hp = hlist; hp; hp = hp->next) { 145 listp = listp->next; 263 hp->next = hlist; 332 vfsp->next = vfstab_listp; 344 nextp = listp->next;
|
/illumos-gate/usr/src/lib/libresolv2/common/irs/ |
H A D | gen_nw.c | 91 nw->next = nw_next; 127 rval = (*nw->next)(nw); 132 pvt->rule = pvt->rule->next; 151 for (rule = pvt->rules; rule; rule = rule->next) { 174 for (rule = pvt->rules; rule; rule = rule->next) { 206 for (rule = pvt->rules; rule != NULL; rule = rule->next) { 245 for (rule = pvt->rules; rule != NULL; rule = rule->next) {
|
H A D | gen_pr.c | 88 pr->next = pr_next; 116 rval = (*pr->next)(pr); 121 pvt->rule = pvt->rule->next; 138 for (rule = pvt->rules; rule; rule = rule->next) { 155 for (rule = pvt->rules; rule; rule = rule->next) { 181 for (rule = pvt->rules; rule != NULL; rule = rule->next) { 220 for (rule = pvt->rules; rule != NULL; rule = rule->next) {
|
H A D | gen_sv.c | 89 sv->next = sv_next; 117 rval = (*sv->next)(sv); 122 pvt->rule = pvt->rule->next; 139 for (rule = pvt->rules; rule; rule = rule->next) { 156 for (rule = pvt->rules; rule; rule = rule->next) { 182 for (rule = pvt->rules; rule != NULL; rule = rule->next) { 221 for (rule = pvt->rules; rule != NULL; rule = rule->next) {
|
/illumos-gate/usr/src/lib/libc/port/gen/ |
H A D | mon.c | 74 * prior<--| |-->next anchor 160 static char *countbase; /* addr of next pc,count cell to use in block */ 166 ANCHOR *next, *prior; /* forward, backward ptrs for list */ member in struct:anchor 311 newanchp->next = NULL; /* new, forward to NULL. */ 314 curAnchor->next = newanchp; /* old, forward to new. */ 377 for (sum.nfns = 0, ap = &firstAnchor; ap != NULL; ap = ap->next) { 395 for (ap = &firstAnchor; ok && ap != NULL; ap = ap->next) { 469 newanchp->next = NULL; /* new, forward to NULL. */ 472 curAnchor->next = newanchp; /* old, forward to new. */ 517 * NOTE: countbase points at the next availabl [all...] |
H A D | getgrnam_r.c | 318 char *p, *next; local 340 next = buffer; 347 group->gr_name = p = gettok(&next, ':'); 366 group->gr_passwd = p = gettok(&next, ':'); 374 p = next; /* gid */ 383 tmp = strtoul(p, &next, 10); 384 if (next == p || errno != 0) { 394 if (*next++ != ':') { 402 p = gettok(&next, ',');
|
/illumos-gate/usr/src/cmd/fm/modules/common/io-retire/ |
H A D | rio_main.c | 46 char *next; local 60 next = strchr(p, ':'); 62 if (next) 63 *next = '\0'; 71 if (next) { 72 *next = ':'; 73 p = next + 1;
|
/illumos-gate/usr/src/cmd/cmd-crypto/cryptoadm/ |
H A D | adm_kef_util.c | 69 pcur->next = ptmp; 70 pcur = pcur->next; 72 plist = plist->next; 94 plist = plist->next; 243 phead->next = pmech; 244 phead = phead->next; 351 pentlist->next = NULL; 355 while (pcur->next != NULL) 356 pcur = pcur->next; 357 pcur->next [all...] |
/illumos-gate/usr/src/uts/common/tnf/ |
H A D | tnf_res.c | 264 * switch to the next thread. 272 #define RUNSTATE(next, lwp) \ 273 ((((lwp = ttolwp(next)) != NULL) && \ 278 tnf_thread_switch(kthread_t *next) argument 340 tnf_kthread_id, tid, next, 341 tnf_microstate, state, RUNSTATE(next, lwp)); 344 tnf_kthread_id, tid, next, 345 tnf_microstate, state, RUNSTATE(next, lwp));
|
/illumos-gate/usr/src/uts/common/zmod/ |
H A D | inftrees.c | 29 on return points to the next available entry's address. bits is the 56 code FAR *next; /* next available space in table */ local 153 filled is at next and has curr index bits. The code being used is huff 206 next = *table; /* current table to fill in */ 237 min = fill; /* save offset to next table */ 240 next[(huff >> drop) + fill] = this; 254 /* go to next symbol, update count, len */ 268 next += min; /* here min is 1 << curr */ 270 /* determine length of next tabl [all...] |
/illumos-gate/usr/src/lib/libast/common/regex/ |
H A D | regcoll.c | 43 struct Ucs_map_s* next; member in struct:Ucs_map_s 102 w->next = 0; 109 w->next = 0; 112 while (a->next) 113 a = a->next; 114 a->next = w; 128 * if e!=0 it is set to point to the next char in s on return 244 for (a = z; a; a = a->next)
|
/illumos-gate/usr/src/cmd/mandoc/ |
H A D | tbl_layout.c | 265 case '\0': /* Next row on next input line. */ 293 for (rp = tbl->first_row; rp; rp = rp->next) { 303 if (rp->next != NULL && 304 rp->next->first == NULL) { 305 free(rp->next); 306 rp->next = NULL; 325 tbl->last_row->next = rp; 345 pp->next = p;
|
/illumos-gate/usr/src/lib/scsi/plugins/ses/ses2/common/ |
H A D | ses2.c | 45 nvpair_t *nvp, *next; local 48 nvp = next) { 49 next = nvlist_next_nvpair(props, nvp);
|
/illumos-gate/usr/src/lib/libsldap/common/ |
H A D | ns_connmgmt.h | 56 struct ns_conn_waiter *next, *prev; member in struct:ns_conn_waiter 103 struct ns_conn_user *next; /* next conn_user in the linked list */ member in struct:ns_conn_user 142 * management, waiting for the next user. It will be closed when 152 struct ns_conn_mt *next; /* next conn_mt in the linked list */ member in struct:ns_conn_mt
|
/illumos-gate/usr/src/lib/libcryptoutil/common/ |
H A D | config_parsing.c | 87 pentlist->next = NULL; 92 pcur->next = pentlist; 93 pcur = pcur->next; 343 pcur->next = pmech; 344 pcur = pcur->next; 376 pmech->next = NULL; 389 pnext = plist->next; 414 pnext = entrylist->next; 444 pcur->next = ptmp; 445 pcur = pcur->next; [all...] |
/illumos-gate/usr/src/lib/libeti/panel/common/ |
H A D | update.c | 54 if ((next_obs = obs->next) == panel -> obscured -> next) 130 touch_top(panel, screen_y, panel->obscured->next,
|
/illumos-gate/usr/src/lib/libfru/libfru/ |
H A D | nameSyntaxYacc.y | 97 $1->next = $3; 127 pathDef->next = NULL; 160 pathDef->next = NULL;
|
/illumos-gate/usr/src/lib/libtecla/common/ |
H A D | hash.c | 66 HashNode *next; /* The next hash-table entry in a bucket list */ member in struct:HashNode 380 node->next = bucket->head; 409 prev->next = node->next; 411 bucket->head = node->next; 499 node->next = NULL; 550 node->next = NULL; 610 last = node, node=node->next) 693 HashNode *next local [all...] |
/illumos-gate/usr/src/cmd/powertop/common/ |
H A D | display.c | 100 struct sb_slot *next; member in struct:sb_slot 317 n = n->next; 342 for (n = status_bar; n != NULL; n = n->next) { 346 n->prev->next = n->next; 350 if (n->next != NULL) { 351 n->next->prev = n->prev; 353 status_bar = n->next; 374 for (n = status_bar; n->next != NULL; n = n->next) [all...] |