Searched refs:next (Results 1 - 25 of 4011) sorted by path

1234567891011>>

/netbsd-6-1-5-RELEASE/bin/csh/
H A Dcsh.c1000 paraml.next = paraml.prev = &paraml;
1111 savet = syntax(paraml.next, &paraml, 0);
H A Dcsh.h124 int timflg; /* Time the next waited for command */
277 struct wordent *next; member in struct:wordent
287 * next character to be returned.
465 * at the next discarding since their event numbers are very negative.
H A Dexec.c610 lexw[0].next = &lexw[1];
611 lexw[1].next = &lexw[2];
612 lexw[2].next = &lexw[0];
646 sp = lexp->next;
650 sp = lexp->next;
H A Dexp.c568 hp->prev = hp->next = hp;
575 new->next = hp;
576 wdp->next = new;
582 t = syntax(paraml1.next, &paraml1, 0);
H A Dglob.c699 t = syntax(fparaml.next, &fparaml, 0);
H A Dhist.c63 if (sp->next->word[0] == '\n')
96 np->Hlex.next = lp->next;
97 lp->next->prev = &np->Hlex;
99 lp->prev->next = &np->Hlex;
H A Dlex.c144 hp->next = hp->prev = hp;
166 new->next = hp;
167 wdp->next = new;
180 sp = sp0->next;
183 sp = sp->next;
197 fp = fp->next;
203 new->next = hp;
204 wdp->next = new;
207 fp = fp->next;
217 while (vp->next !
[all...]
H A Dparse.c87 asyntax(lexp->next, lexp);
96 p1 = p1->next;
110 for (p = p1; p != p2; p = p->next)
121 if (p->next != p2 && eq(p->next->word, STRand))
122 p = p->next;
131 asyntax(p->next, p2);
151 if (p2 == p1->next)
153 asyn0(p1->next, p2);
169 if (p1->word[0] && eq(p1->word, alout.next
[all...]
/netbsd-6-1-5-RELEASE/bin/ksh/
H A Dalloc.c38 struct link *next; member in struct:link
54 l2 = l->next;
72 l->next = ap->freelist;
93 lnext = l->next;
99 lprev->next = l2;
120 l->prev->next = l->next;
122 ap->freelist = l->next;
123 if (l->next)
124 l->next
[all...]
H A Dc_ksh.c780 for (l = e->loc; l; l = l->next) {
794 for (l = e->loc; l; l = l->next) {
1352 if (e->loc->next == (struct block *) 0) {
1358 wp = e->loc->next->argv;
1360 *--wp = e->loc->next->argv[0];
H A Dedit.c688 for (l = e->loc; l; l = l->next)
H A Deval.c164 struct SubType *next; /* poped type (to avoid re-allocating) */ member in struct:SubType
215 st_head.next = (SubType *) 0;
318 if (!st->next) {
323 newst->next = (SubType *) 0;
325 st->next = newst;
327 st = st->next;
710 int state; /* next state: XBASE, XARG, XSUB, XNULLSUB */
1010 register char *np; /* next source component */
H A Dexec.c184 (void) ksh_dup2(pv[0], 0, FALSE); /* stdin of next */
895 for (l = e->loc; l; l = l->next) {
899 if (!l->next && create) {
H A Dio.c564 tp->next = *tlist;
H A Djobs.c104 Proc *next; /* next process in pipeline (if any) */ member in struct:proc
138 Job *next; /* next job in list */ member in struct:job
295 for (j = job_list; j != (Job *) 0; j = j->next) {
470 p->next = (Proc *) 0;
480 last_proc->next = p;
664 /* Ensure next child gets a (slightly) different $RANDOM sequence */
685 for (p = j->proc_list; p; p = p->next)
776 for (j = job_list; j; j = j->next)
[all...]
H A Dlex.c50 Lex_state *base; /* used to point to next state block */
194 s->next = source;
558 /* XXX chuck this state (and the next) - use
754 for (s = source; s->type == SALIAS; s = s->next)
761 s->next = source;
857 source = source->next;
886 s->next = NULL;
938 source = s->next;
944 source = s = s->next; /* pop source stack */
954 * to return the next characte
[all...]
H A Dlex.h30 Source *next; /* stacked source */ member in struct:source
H A Dmain.c605 if (s->next == NULL) {
815 *tprev = t->next;
818 tprev = &t->next;
822 for (; tp != NULL; tp = tp->next)
839 t->next = delayed_remove;
H A Dsh.h532 struct temp *next; member in struct:temp
H A Dsyn.c833 for (; s && s->type == SALIAS; s = s->next)
H A Dtable.c159 ts->next = tp->tbls;
167 struct tbl *p = *ts->next++;
H A Dtable.h123 struct block *next; /* enclosing block */ member in struct:block
134 struct tbl **next; member in struct:tstate
H A Dvar.c59 l->next = e->loc;
73 e->loc = l->next; /* pop block */
231 for (l = e->loc; ; l = l->next) {
239 if (l->next == NULL)
280 while ((ll = ll->next) && !(vq = tsearch(&ll->vars, n, h)))
879 for (l = e->loc; l != NULL; l = l->next)
888 for (l2 = l->next; l2 != NULL; l2 = l2->next) {
/netbsd-6-1-5-RELEASE/bin/pax/
H A Dftree.c106 * tree arg until one of its files is selected, then skips to the next file
118 static int ftree_skip; /* when set skip to next file arg */
267 * if -n we are done with this arg, force a skip to the next arg when
268 * pax asks for the next file in next_file().
319 * Get the next file arg for fts to process. Can be from either the linked
323 * 0 when the next arg is ready to go, -1 if out of file args (or EOF on
401 * supplies the next file to process in the supplied archd structure.
403 * 0 when contents of arcn have been set with the next file, -1 when done.
522 * find next node
529 if (ftnode->next !
[all...]
H A Dtables.c427 * try the next entry on the chain
775 static dev_t lastdev = 0; /* next device number to try */
1048 * no match, go to next one
1218 dblk->next = dirdata_head;
1281 dirdata_head = dblk->next;

Completed in 256 milliseconds

1234567891011>>