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

1234567891011>>

/freebsd-9.3-release/bin/date/
H A Dvary.c89 while (v->next)
90 v = v->next;
91 nextp = &v->next;
98 (*nextp)->next = NULL;
160 val += 11 - t->tm_mon; /* early next year */
262 val = 7 - t->tm_wday + val; /* early next week */
424 for (; v; v = v->next) {
502 n = v->next;
H A Dvary.h31 struct vary *next; member in struct:vary
/freebsd-9.3-release/bin/rcp/
H A Drcp.c367 goto next;
375 goto next;
380 goto next;
396 goto next;
403 goto next;
405 next: if (fd >= 0)
/freebsd-9.3-release/bin/setfacl/
H A Dsetfacl.c59 TAILQ_INSERT_TAIL(&filelist, file, next);
101 TAILQ_INSERT_TAIL(&entrylist, entry, next);
107 TAILQ_INSERT_TAIL(&entrylist, entry, next);
126 TAILQ_INSERT_TAIL(&entrylist, entry, next);
131 TAILQ_INSERT_TAIL(&entrylist, entry, next);
142 TAILQ_INSERT_TAIL(&entrylist, entry, next);
150 TAILQ_INSERT_TAIL(&entrylist, entry, next);
169 TAILQ_INSERT_TAIL(&entrylist, entry, next);
200 TAILQ_FOREACH(file, &filelist, next) {
252 TAILQ_FOREACH(entry, &entrylist, next) {
[all...]
H A Dsetfacl.h49 TAILQ_ENTRY(sf_entry) next; member in struct:sf_entry
56 TAILQ_ENTRY(sf_file) next; member in struct:sf_file
/freebsd-9.3-release/bin/sh/
H A Dalias.c67 for (ap = *app; ap; ap = ap->next) {
93 * alias value off the input before processing the next alias, we
103 * resulting token(s) is next checked for further alias sub. The
120 ap->next = *app;
133 for (ap = *app; ap; app = &(ap->next), ap = ap->next) {
146 *app = ap->next;
174 ap = ap->next;
187 for (; ap; ap = ap->next) {
231 for (ap = atab[i]; ap; ap = ap->next)
[all...]
H A Dalias.h39 struct alias *next; member in struct:alias
H A Deval.c195 union node *next; local
204 next = NULL;
214 next = n->nbinary.ch2;
221 next = n->nbinary.ch2;
227 next = n->nbinary.ch2;
244 next = n->nif.ifpart;
246 next = n->nif.elsepart;
262 defun(n->narg.text, n->narg.next);
283 n = next;
343 for (argp = n->nfor.args ; argp ; argp = argp->narg.next) {
[all...]
H A Dexec.c86 struct tblentry *next; /* next entry in hash chain */ member in struct:tblentry
245 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
345 /* Check for builtin next */
469 * Called when a cd is done. Marks all commands so the next time they
480 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
519 *pp = cmdp->next;
522 pp = &cmdp->next;
555 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) {
558 pp = &cmdp->next;
[all...]
H A Dexpand.c88 struct ifsregion *next; /* next region in list */ member in struct:ifsregion
176 ifsfirst.next = NULL;
200 exparg.lastp = &sp->next;
202 while (ifsfirst.next != NULL) {
205 ifsp = ifsfirst.next->next;
206 ckfree(ifsfirst.next);
207 ifsfirst.next = ifsp;
275 argbackq = argbackq->next;
[all...]
H A Dexpand.h37 struct strlist *next; member in struct:strlist
H A Djobs.c654 /* Relocate `next' pointers and list head */
658 if (jp[i].next != NULL)
659 jp[i].next = &jp[jp[i].next -
688 jp->next = NULL;
707 for (prev = NULL, jp = jobmru; jp != NULL; prev = jp, jp = jp->next) {
710 prev->next = jp->next;
712 jobmru = jp->next;
713 jp->next
[all...]
H A Djobs.h74 struct job *next; /* job used after this one */ member in struct:job
H A Dmkinit.c94 struct block *next; member in struct:block
424 text->last->next = bp;
441 for (bp = text->start ; bp != text->last ; bp = bp->next)
H A Dnodes.c.pat113 lp = lp->next;
140 lp = lp->next;
141 lpp = &(*lpp)->next;
H A Dparser.c83 struct heredoc *next; /* next here document in list */ member in struct:heredoc
90 struct parser_temp *next; member in struct:parser_temp
137 t->next = parser_temp;
169 parser_temp = t->next;
188 parser_temp = t->next;
367 prev->next = lp;
369 lp->next = NULL;
403 rpp = &n2->nfile.next;
471 app = &n2->narg.next;
[all...]
H A Dredir.c72 struct redirtab *next; member in struct:redirtab
122 sv->next = redirlist;
125 for (n = redir ; n ; n = n->nfile.next) {
310 redirlist = rp->next;
347 for (rp = redirlist ; rp ; rp = rp->next) {
H A Dshow.c101 for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {
103 if (lp->next)
130 for (np = cmd->ncmd.args ; np ; np = np->narg.next) {
136 for (np = cmd->ncmd.redirect ; np ; np = np->nfile.next) {
H A Dvar.c185 vp->next = *vpp;
195 vps1.next = *vpp;
394 vp->next = *vpp;
417 for (lp = list ; lp ; lp = lp->next) {
456 for (sp = cmdenviron ; sp ; sp = sp->next) {
482 for (lp = cmdenviron ; lp ; lp = lp->next) {
519 for (lp = cmdenviron ; lp ; lp = lp->next) {
563 for (vp = *vpp ; vp ; vp = vp->next)
569 for (vp = *vpp ; vp ; vp = vp->next)
613 for (vp = *vpp; vp; vp = vp->next) {
[all...]
H A Dvar.h53 struct var *next; /* next entry in hash list */ member in struct:var
64 struct localvar *next; /* next local variable in list */ member in struct:localvar
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/
H A DJDTrace.java249 record = itr.next();
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/funcs/
H A Dtst.ddi_pathname.d42 this->minor1->next = this->minor2;
45 this->minor2->next = this->minor3;
48 this->minor3->next = this->minor1;
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/sgs/include/
H A Dsgs.h81 * Macro to round to next double word boundary.
157 (void) (((N) = (N)->next) != NULL && ((D) = (N)->data) != NULL)
164 Listnode *next; /* the next element */ member in struct:listnode
179 Elf32_Addr next; /* the next element */ member in struct:listnode32
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/zdb/
H A Dzdb.c993 goto next;
998 goto next;
1004 goto next;
1019 next:
1652 dump_zap, /* DSL dataset next clones */
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c233 int64_t value = 1, next, step; local
244 next = value * factor;
245 step = next > nsteps ? next / nsteps : 1;
248 assert(value < next);
251 if ((value += step) != next)
254 next = value * factor;
255 step = next > nsteps ? next / nsteps : 1;
504 * next recor
1285 dt_ahashent_t *h, *next; local
1917 dt_ahashent_t *h, *next; local
[all...]

Completed in 153 milliseconds

1234567891011>>