/osnet-11/usr/src/lib/libbrand/common/ |
H A D | libbrand.c | 458 node = node->next) { 778 for (node = node->xmlChildrenNode; node != NULL; node = node->next) { 856 for (node = node->xmlChildrenNode; node != NULL; node = node->next) { 932 for (node = node->xmlChildrenNode; node != NULL; node = node->next) { 982 for (node = node->xmlChildrenNode; node != NULL; node = node->next) { 994 goto next; 1001 goto next; 1011 goto next; 1017 next: 1078 for (node = node->xmlChildrenNode; node != NULL; node = node->next) { [all...] |
/osnet-11/usr/src/lib/libpp/common/ |
H A D | ppop.c | 171 for (dp = pp.firstdir->next; dp; dp = dp->next) 364 pp.lastop = (pp.lastop->next = newof(0, struct oplist, 1, 0)); 383 for (dp = pp.firstdir; dp; dp = dp->next) 392 for (dp = pp.firstdir; dp; dp = dp->next) 426 xp->next = pp.chop; 546 for (dp = pp.firstdir; dp; dp = dp->next) 559 for (dp = pp.firstdir; dp; dp = dp->next) 601 for (dp = pp.stddirs; dp = dp->next;) 618 if (!dp || dp == pp.lastdir->next) [all...] |
/osnet-11/usr/src/lib/libdiskmgt/common/ |
H A D | findevs.c | 294 bp->next = args->bus_listp; 435 cp->next = args->controller_listp; 861 for (cp = args->controller_listp; cp != NULL; cp = cp->next) { 1013 diskp->next = args->disk_listp; 1079 ap = ap->next; 1095 listp = listp->next; 1111 listp = listp->next; 1197 * NOTE: if ap->next != NULL have cluster 1277 listp = listp->next; 1458 listp = listp->next; [all...] |
H A D | inuse_lu.c | 52 struct lu_list *next; member in struct:lu_list 110 listp = listp->next; 140 sp->next = lu_listp; 155 nextp = listp->next;
|
H A D | inuse_vxvm.c | 67 struct vxvm_list *next; member in struct:vxvm_list 133 listp = listp->next; 161 sp->next = vxvm_listp; 245 nextp = listp->next;
|
/osnet-11/usr/src/lib/libpicltree/ |
H A D | picltree.c | 190 evt->next = NULL; 195 while (tmpp->next != NULL) 196 tmpp = tmpp->next; 197 tmpp->next = evt; 211 *qp = evtp->next; 245 ent->next = NULL; 257 while (iter->next != NULL) 258 iter = iter->next; 259 iter->next = ent; 285 evhdlrpp = &evhdlrp->next) { [all...] |
/osnet-11/usr/src/lib/libast/common/regex/ |
H A D | regnexec.c | 397 #define follow(e,r,c,s) ((r)->next?parse(e,(r)->next,c,s):(c)?parse(e,c,0,s):BEST) 435 catcher.next = rex->next; 815 Rex_t next; local 832 catcher.next = rex->next; 1015 next.type = REX_CONJ_RIGHT; 1016 next.re.conj_right.cont = cont; 1017 next [all...] |
/osnet-11/usr/src/lib/libresolv/ |
H A D | res_comp.c | 71 * fetch next label in domain name 266 goto next; 270 goto next; 276 goto next; 287 next: /*EMPTY*/;
|
/osnet-11/usr/src/lib/libresolv2/common/irs/ |
H A D | gen_p.h | 83 struct irs_rule * next; member in struct:irs_rule
|
/osnet-11/usr/src/lib/librstp/common/ |
H A D | stpm.h | 52 struct stpm_t* next; member in struct:stpm_t
|
/osnet-11/usr/src/lib/libshell/common/include/ |
H A D | fault.h | 91 struct openlist *next; member in struct:openlist
|
/osnet-11/usr/src/lib/libndr/common/ |
H A D | ndr_heap.c | 83 heap->next = base + sizeof (ndr_heap_t); 115 * exceeded, we allocate a new block and setup the next iov. Otherwise 116 * all we have to do is move the next pointer and update the current 133 p = heap->next; 150 heap->next = p + size; 293 avail += (heap->top - heap->next);
|
/osnet-11/usr/src/lib/libparted/common/libparted/fs/amiga/ |
H A D | amiga.h | 25 uint32_t pb_Next; /* Block number of the next PartitionBlock */ 65 struct AmigaIds *next; member in struct:AmigaIds
|
/osnet-11/usr/src/lib/libparted/common/libparted/fs/hfs/ |
H A D | cache.h | 55 by this value to allocate next tables */ 60 struct _HfsCPrivateExtent* next; member in struct:_HfsCPrivateExtent
|
/osnet-11/usr/src/lib/libparted/common/libparted/fs/jfs/ |
H A D | jfs.c | 97 .next = NULL,
|
/osnet-11/usr/src/lib/libcmd/common/ |
H A D | uniq.c | 90 int reclen,oreclen= -1,count=0,cwidth=0,sep,next; local 154 next = count; 158 next = 0; 213 if(count = next)
|
/osnet-11/usr/src/lib/libcmdutils/common/ |
H A D | decompress.c | 63 struct worker *next; member in struct:worker 185 wk->next = workers; 270 wk->next = workers; 342 nwk = wk->next;
|
/osnet-11/usr/src/lib/libdevinfo/ |
H A D | device_info.h | 86 struct devfs_prom_path *next; member in struct:devfs_prom_path
|
/osnet-11/usr/src/lib/libeti/form/common/ |
H A D | chg_field.c | 45 /* next - return next active field on page after f(user defined order) */ 47 next(FIELD *f) function 79 /* snext - return next active field on page after f(sorted order) */ 190 return (_set_current_field(f, next(C(f)))); 202 return (_set_current_field(f, next(last(f)))); 262 return (next(last(f)));
|
H A D | fieldtype.c | 56 #define Next(t) ((t)->next) 74 (PTF_int) 0, /* next */ 150 /* set_fieldtype_choice next & prev choice function */ 152 set_fieldtype_choice(FIELDTYPE *t, PTF_int next, PTF_int prev) argument 154 if (t && next && prev) { 156 Next(t) = next;
|
/osnet-11/usr/src/lib/libeti/panel/common/ |
H A D | delete.c | 113 obs = obs -> next;
|
/osnet-11/usr/src/lib/libeti/panel/inc/ |
H A D | panel.h | 38 struct _obscured_list *next; member in struct:_obscured_list
|
/osnet-11/usr/src/lib/libfsmgt/common/ |
H A D | fs_shares.c | 63 tmp = headp->next; 69 headp->next = NULL; 111 tailp->next = newp; 344 newp->next = NULL;
|
/osnet-11/usr/src/lib/libidmap/common/ |
H A D | utils.c | 65 if (udthandle->next >= udthandle->batch.idmap_update_batch_len) { 79 udthandle->batch.idmap_update_batch_val[udthandle->next].opnum = 92 if (gh->next >= len) { 123 iter->next = 0;
|
/osnet-11/usr/src/lib/fm/libldom/sparc/ |
H A D | ldom_xmpp_client.h | 93 struct client_info *next; member in struct:client_info
|