Searched refs:next (Results 601 - 625 of 2472) sorted by relevance

<<21222324252627282930>>

/illumos-gate/usr/src/cmd/egrep/
H A Degrep.y1184 int j, next;
1202 next = current + 1;
1203 if(next + current + 2 >= maxwclin) {
1204 maxwclin += MAXLIN + next + current + 2;
1210 lower[next] = maxmin(WCHAR_CS2, 0);
1212 upper[next++] = maxmin(WCHAR_CS2, 1);
1214 lower[next] = maxmin(WCHAR_CS3, 0);
1215 upper[next++] = maxmin(WCHAR_CS3, 1);
1218 lower[next] = maxmin(lower[i] & WCHAR_CSMASK, 0);
1219 upper[next
[all...]
/illumos-gate/usr/src/cmd/mandoc/
H A Dmdoc_validate.c293 mdoc->last = mdoc->last->next;
297 mdoc->next = ROFF_NEXT_SIBLING;
699 nch = nch->next;
811 n->child->next->line, n->child->next->pos,
812 "Fo ... %s", n->child->next->string);
826 for (n = mdoc->last->child; n != NULL; n = n->next) {
901 mdoc->next = ROFF_NEXT_SIBLING;
943 mdoc->next = ROFF_NEXT_CHILD;
949 mdoc->next
1488 struct roff_node *np, *nch, *next, *prev; local
[all...]
/illumos-gate/usr/src/lib/pam_modules/unix_account/
H A Dunix_acct.c347 attr_pw[0].type = ATTR_REP_NAME; attr_pw[0].next = &attr_pw[1];
348 attr_pw[1].type = ATTR_UID; attr_pw[1].next = &attr_pw[2];
349 attr_pw[2].type = ATTR_PASSWD; attr_pw[2].next = NULL;
384 attr_spw[0].type = ATTR_LSTCHG; attr_spw[0].next = &attr_spw[1];
385 attr_spw[1].type = ATTR_MIN; attr_spw[1].next = &attr_spw[2];
386 attr_spw[2].type = ATTR_MAX; attr_spw[2].next = &attr_spw[3];
387 attr_spw[3].type = ATTR_WARN; attr_spw[3].next = &attr_spw[4];
388 attr_spw[4].type = ATTR_INACT; attr_spw[4].next = &attr_spw[5];
389 attr_spw[5].type = ATTR_EXPIRE; attr_spw[5].next = &attr_spw[6];
390 attr_spw[6].type = ATTR_FLAG; attr_spw[6].next
[all...]
/illumos-gate/usr/src/lib/libshell/common/sh/
H A Dpath.c252 if(flag) /* skip next case when non-zero flag */
310 ppnext = pp->next;
327 old->next = ppnext;
355 for( ;pp; pp=pp->next)
380 pp = pp->next;
406 for(oldpp=first; oldpp && oldpp!=pp; oldpp=oldpp->next)
425 * write the next path to search on the current stack
427 * the next pathcomp is returned.
439 if(ppnext=pp->next)
465 while(pp && pp!=last && (pp=pp->next))
1639 register Pathcomp_t *pp=first, *next, *pq; local
[all...]
/illumos-gate/usr/src/lib/libsldap/common/
H A Dns_connmgmt.c912 cm->next = NULL;
954 cm->cu_tail->next = cu;
975 cm->next = cmg->cm_head;
978 cmg->cm_tail->next = cm;
999 cu->next = NULL;
1006 cm->cu_head = cu->next;
1008 cu->next = NULL;
1013 for (u = cm->cu_head->next; u; u = u->next) {
1019 pu->next
[all...]
/illumos-gate/usr/src/lib/libsqlite/tool/
H A Dlemon.c163 struct rule *next; /* Next rule in the global list */ member in struct:rule
182 struct config *next; /* Next configuration in the state */ member in struct:config
183 struct config *bp; /* The next basis configuration */
203 struct action *next; /* Next action for this state */ member in struct:action
225 struct plink *next; /* The next propagate link */ member in struct:plink
344 for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1];
345 freelist[amt-1].next = 0;
348 freelist = freelist->next;
372 ap = (struct action *)msort((char *)ap,(char **)&ap->next,actioncm
3760 struct s_x1node *next; /* Next entry with the same hash */ member in struct:s_x1node
3922 struct s_x2node *next; /* Next entry with the same hash */ member in struct:s_x2node
4128 struct s_x3node *next; /* Next entry with the same hash */ member in struct:s_x3node
4274 struct s_x4node *next; /* Next entry with the same hash */ member in struct:s_x4node
[all...]
/illumos-gate/usr/src/lib/libnsl/yp/
H A Dyp_match.c61 struct cache *next; member in struct:cache
137 for (pp = &head, cnt = 0; (c = *pp) != 0; pp = &c->next, cnt++) {
146 *pp = c->next;
154 *pp = c->next;
155 c->next = head;
161 *pp = c->next;
281 c->next = head;
331 n = p->next;
336 n = p->next;
476 c->next
[all...]
/illumos-gate/usr/src/cmd/ldapcachemgr/
H A Dcachemgr_change.c138 info->chg_w_last->next = wl;
154 for (wl = info->chg_w_first; wl != NULL; wl = wl->next) {
156 if (wl->next == NULL) {
161 wl->prev->next = NULL;
166 wl->next->prev = NULL;
167 info->chg_w_first = wl->next;
169 wl->prev->next = wl->next;
170 wl->next->prev = wl->prev;
206 for (wl = info->chg_w_first; wl != NULL; wl = wl->next) {
[all...]
/illumos-gate/usr/src/lib/libast/common/tm/
H A Dtmxscan.c66 goto next; \
226 goto next;
241 goto next;
255 goto next;
311 goto next;
324 goto next;
398 goto next;
405 goto next;
408 goto next;
420 next
[all...]
/illumos-gate/usr/src/uts/sun4v/os/
H A Dhsvc.c86 struct hsvc *next; /* next group/free entry */ member in struct:hsvc
142 for (hsvcp = hsvc_groups; hsvcp != NULL; hsvcp = hsvcp->next) {
186 for (hsvcp = hsvc_groups; hsvcp != NULL; hsvcp = hsvcp->next) {
219 hsvc_avail = hsvcp->next;
238 hsvcp->next = hsvc_avail;
328 for (hsvcp = hsvc_groups; hsvcp != NULL; hsvcp = hsvcp->next)
439 hsvcp->next = hsvc_groups;
508 hsvcpp = &hsvcp->next) {
545 *hsvcpp = hsvcp->next;
[all...]
/illumos-gate/usr/src/lib/libc/port/locale/
H A Dcollate.c222 int next, compar, l; local
234 next = (low + high) / 2;
235 p = tab + next;
246 low = next + 1;
248 high = next - 1;
258 int next, compar; local
266 next = (low + high) / 2;
267 p = tab + next;
272 low = next + 1;
274 high = next
[all...]
/illumos-gate/usr/src/uts/common/io/ppm/
H A Dppm_subr.c117 for (domp = ppm_domain_p; domp; domp = domp->next) {
119 db = db->next;
137 for (domp = ppm_domain_p; domp; domp = domp->next) {
161 for (domp = ppm_domain_p; domp; domp = domp->next) {
168 for (dc = domp->dc; dc; dc = dc->next) {
181 domp && (domp->model != model); domp = domp->next) {
183 for (dc = domp->dc; dc; dc = dc->next) {
263 domp->next = ppm_domain_p;
276 for (domp = ppm_domain_p; domp; domp = domp->next) {
348 db->next
[all...]
/illumos-gate/usr/src/cmd/lvm/metassist/layout/
H A Dlayout_discovery.c364 for (iter = used_classes; iter != NULL; iter = iter->next) {
582 iter = iter->next) {
669 for (iter = disks; (iter != NULL) && (error == 0); iter = iter->next) {
684 iter1 = iter1->next) {
772 iter2 = iter2->next) {
834 iter = iter->next) {
864 iter2 = iter2->next, iter3 = iter3->next) {
947 aliases = aliases->next) {
1088 for (iter = disks; iter != NULL && error == 0; iter = iter->next) {
1464 dm_descriptor_t next = (uintptr_t)iter->next->obj; local
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/ccache/
H A Dcc_memory.c103 struct _krb5_mcc_link *next; member in struct:_krb5_mcc_link
115 struct krb5_mcc_list_node *next; member in struct:krb5_mcc_list_node
171 krb5_mcc_cursor curr,next; local
177 next = curr->next;
179 curr = next;
204 for (curr = &mcc_head; *curr; curr = &(*curr)->next) {
207 *curr = node->next;
265 for (ptr = mcc_head; ptr; ptr=ptr->next)
324 * Fills in creds with the "next" credental
[all...]
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dnsparse.c66 struct cons_cell_v1 *next; member in struct:cons_cell_v1
71 struct cons_cell *next; member in struct:cons_cell
170 lkq = &lkp->next;
221 /* p better be the next switch_err */
290 break; /* process next naming service */
364 lkq = &lkp->next;
407 /* p better be the next switch_err */
449 break; /* process next naming service */
597 * go ahead with the next line.
694 * go ahead with the next lin
[all...]
/illumos-gate/usr/src/lib/libast/common/sfio/
H A Dsfmode.c82 for(p = &_Sfpool; p; p = p->next)
102 ((f->mode&SF_WRITE) && f->next == f->data) )
320 p->ndata = f->endb-f->next;
332 memcpy((Void_t*)p->rdata,(Void_t*)f->next,p->ndata);
374 { f->next = f->endb = f->endr = f->data;
411 { f->next[-1] = f->getr;
457 f->next = f->endr = f->endw = f->data;
487 if(f->next > f->data && SFFLSBUF(f,-1) < 0)
495 f->next = f->endr = f->endw = f->endb = f->data;
519 f->endb = f->endr = f->endw = f->next
[all...]
/illumos-gate/usr/src/lib/libresolv2/include/
H A Dirs.h42 struct group * (*next) __P((struct irs_gr *)); member in struct:irs_gr
60 struct passwd * (*next) __P((struct irs_pw *)); member in struct:irs_pw
79 struct servent *(*next) __P((struct irs_sv *)); member in struct:irs_sv
95 struct protoent *(*next) __P((struct irs_pr *)); member in struct:irs_pr
113 struct hostent *(*next) __P((struct irs_ho *)); member in struct:irs_ho
131 struct nwent * (*next) __P((struct irs_nw *)); member in struct:irs_nw
145 int (*next) __P((struct irs_ng *, const char **, member in struct:irs_ng
/illumos-gate/usr/src/lib/libnsl/nss/
H A Dgetexecattr.c126 exec->next = NULL;
258 } while (lookups && (lookups = lookups->next));
296 if (_priv_exec->prev_exec->next = _dup_execstr(exec))
297 _priv_exec->prev_exec = _priv_exec->prev_exec->next;
365 new_exec->next = old_exec->next;
381 _free_execstr(exec->next);
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dev_streams.c78 new->next = ctx->streams;
112 new->next = ctx->streams;
160 old->prev->next = old->next;
162 ctx->streams = old->next;
163 if (old->next != NULL)
164 old->next->prev = old->prev;
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dhsearch.c121 struct node *next; member in struct:node
277 i = (i + c) % length; /* Advance to next slot */
393 q = &(p->next);
394 p = p->next;
414 * next: Link to next list item
418 build(NODE **last, NODE *next, ENTRY item) argument
425 p->next = next;
538 for(a = table[i]; a != NULL; a = a->next)
[all...]
/illumos-gate/usr/src/lib/libcommputil/common/
H A Dsdp_parse_helper.c93 next_list = list->next;
250 new->next = NULL;
272 while (tmp->next != NULL)
273 tmp = tmp->next;
274 tmp->next = new;
303 list = list->next;
321 list = list->next;
/illumos-gate/usr/src/cmd/cmd-crypto/kmfcfg/
H A Dutil.c63 n = n->next;
128 while (n->next != NULL)
129 n = n->next;
131 n->next = newitem;
132 newitem->next = NULL;
136 node = node->next;
510 ptr = ptr->next;
/illumos-gate/usr/src/cmd/stmfproxy/stmfproxy/
H A Dstmfproxy.c168 struct pppt_drv_queue *next; member in struct:pppt_drv_queue
197 pq_head = pq->next;
198 pq->next = NULL;
235 pq->next = NULL;
265 while (tmpq->next != NULL)
266 tmpq = tmpq->next;
267 tmpq->next = pq;
/illumos-gate/usr/src/cmd/tr/
H A Dstr.c57 next(s) function
80 return (next(s));
95 return (next(s));
100 return (next(s));
107 return (next(s));
117 return (next(s));
124 return (next(s));
180 s->lastch = -1; /* incremented before check in next() */
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/dk/
H A Dderive.c57 dknode = dknode->next;
85 while (dknode->next != NULL)
86 dknode = dknode->next;
87 dknode->next = MALLOC(sizeof(krb5_dk_node));
88 if (dknode->next == NULL)
90 dknode = dknode->next;
95 dknode->next = NULL;

Completed in 124 milliseconds

<<21222324252627282930>>