/freebsd-11-stable/bin/date/ |
H A D | vary.c | 89 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 D | vary.h | 31 struct vary *next; member in struct:vary
|
/freebsd-11-stable/bin/rcp/ |
H A D | rcp.c | 367 goto next; 375 goto next; 380 goto next; 396 goto next; 403 goto next; 405 next: if (fd >= 0)
|
/freebsd-11-stable/bin/setfacl/ |
H A D | setfacl.c | 58 TAILQ_ENTRY(sf_entry) next; 65 TAILQ_ENTRY(sf_file) next; 88 TAILQ_INSERT_TAIL(&filelist, file, next); 130 TAILQ_INSERT_TAIL(&entrylist, entry, next); 136 TAILQ_INSERT_TAIL(&entrylist, entry, next); 155 TAILQ_INSERT_TAIL(&entrylist, entry, next); 160 TAILQ_INSERT_TAIL(&entrylist, entry, next); 171 TAILQ_INSERT_TAIL(&entrylist, entry, next); 179 TAILQ_INSERT_TAIL(&entrylist, entry, next); 198 TAILQ_INSERT_TAIL(&entrylist, entry, next); [all...] |
/freebsd-11-stable/bin/sh/ |
H A D | alias.c | 67 for (ap = *app; ap; ap = ap->next) { 82 ap->next = *app; 95 for (ap = *app; ap; app = &(ap->next), ap = ap->next) { 108 *app = ap->next; 136 ap = ap->next; 151 for (ap = *hashalias(name); ap; ap = ap->next) { 189 for (ap = atab[i]; ap; ap = ap->next)
|
H A D | alias.h | 39 struct alias *next; member in struct:alias
|
H A D | eval.c | 195 union node *next; local 206 next = NULL; 216 next = n->nbinary.ch2; 223 next = n->nbinary.ch2; 229 next = n->nbinary.ch2; 246 next = n->nif.ifpart; 248 next = n->nif.elsepart; 261 next = evalcase(n); 264 next = n->nclist.body; 272 next [all...] |
H A D | exec.c | 84 struct tblentry *next; /* next entry in hash chain */ member in struct:tblentry 246 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { 349 /* Check for builtin next */ 504 *pp = cmdp->next; 507 pp = &cmdp->next; 541 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { 544 pp = &cmdp->next; 550 cmdp->next = NULL; 570 *lastcmdentry = cmdp->next; [all...] |
H A D | expand.c | 316 argbackq = argbackq->next; 353 * returning the next position in the input string to process. 652 * Expand a variable, and return a pointer to the next character in the 815 argbackq = argbackq->next; 1229 * If a valid character class is recognized, a pointer to the next character 1535 for (n = args; n != NULL; n = n->narg.next) { 1543 for (n = args; n != NULL; n = n->narg.next)
|
H A D | parser.c | 82 struct heredoc *next; /* next here document in list */ member in struct:heredoc 89 struct parser_temp *next; member in struct:parser_temp 141 t->next = parser_temp; 173 parser_temp = t->next; 192 parser_temp = t->next; 261 pnext = &n->narg.next; 394 prev->next = lp; 396 lp->next = NULL; 430 rpp = &n2->nfile.next; [all...] |
H A D | redir.c | 70 struct redirtab *next; member in struct:redirtab 129 sv->next = redirlist; 134 for (n = redir ; n ; n = n->nfile.next) { 333 redirlist = rp->next; 355 for (rp = redirlist ; rp ; rp = rp->next) {
|
H A D | show.c | 101 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 D | var.c | 166 vp->next = *vpp; 176 vps1.next = *vpp; 382 vp->next = *vpp; 555 for (vp = *vpp ; vp ; vp = vp->next) 561 for (vp = *vpp ; vp ; vp = vp->next) 605 for (vp = *vpp; vp; vp = vp->next) { 615 for (vp = *vpp; vp; vp = vp->next) { 691 for (vp = *vpp ; vp ; vp = vp->next) { 779 lvp->next = localvars; 798 localvars = lvp->next; [all...] |
H A D | var.h | 53 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-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/ |
H A D | JDTrace.java | 249 record = itr.next();
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/funcs/ |
H A D | tst.ddi_pathname.d | 42 this->minor1->next = this->minor2; 45 this->minor2->next = this->minor3; 48 this->minor3->next = this->minor1;
|
/freebsd-11-stable/cddl/contrib/opensolaris/cmd/zdb/ |
H A D | zdb.c | 1341 goto next; 1346 goto next; 1352 goto next; 1367 next: 2071 dump_zap, /* DSL dataset next clones */
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 233 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 2167 dt_ahashent_t *h, *next; local [all...] |
H A D | dt_consume.c | 228 * subtrahend right by one bit for the next comparison. 282 * bring down the next two-digit group. 287 * The value x is the next digit in the square root. 297 * 9 27 (Subtract and bring down the next group.) 298 * 146 8 76 (2 * 7 * 10 * 6 + 6^2 == 876 => 6 is the next digit in 300 * 51 34 (Subtract and bring down the next group.) 301 * 1523 45 69 (2 * 76 * 10 * 3 + 3^2 == 4569 => 3 is the next digit in 317 * 101 1 01 (1 << 2 + 1 == 101 < 1001 => next bit is 1) 320 * 1101 11 01 (11 << 2 + 1 == 1101 < 10010 => next bit is 1) 342 * Bring down the next pai 423 dtrace_epid_t next, id = epd->dtepd_epid; local 1000 int64_t value = 1, next, step; local [all...] |
H A D | dt_ident.c | 680 dt_ident_t *idp, *next; local 684 for (idp = dhp->dh_hash[i]; idp != NULL; idp = next) { 685 next = idp->di_next; 691 for (idp = dhp->dh_hash[i]; idp != NULL; idp = next) { 692 next = idp->di_next;
|
H A D | dt_open.c | 920 * The first time around, get the string length. The next time, 1000 dt_provmod_t *next, *current; local 1002 for (current = *provmod; current != NULL; current = next) { 1003 next = current->dp_next; 1590 * Set up the default DTrace library path. Once set, the next call to
|
H A D | dt_program.c | 67 dt_stmt_t *stp, *next; local 70 for (stp = dt_list_next(&pgp->dp_stmts); stp != NULL; stp = next) { 71 next = dt_list_next(stp); 298 dt_stmt_t *stp, *next; local 301 for (stp = dt_list_next(&pgp->dp_stmts); stp != NULL; stp = next) { 302 next = dt_list_next(stp); 321 dtrace_actdesc_t *ap, *next; local 346 for (ap = sdp->dtsd_action; ap != NULL; ap = next) { 349 next = ap->dtad_next;
|
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libuutil/common/ |
H A D | uu_avl.c | 69 uu_avl_pool_t *pp, *next, *prev; local 104 pp->uap_next = next = &uu_null_apool; 105 pp->uap_prev = prev = next->uap_prev; 106 next->uap_prev = pp; 213 uu_avl_t *ap, *next, *prev; local 238 next = &pp->uap_null_avl; 239 prev = UU_PTR_DECODE(next->ua_prev_enc); 240 ap->ua_next_enc = UU_PTR_ENCODE(next); 242 next->ua_prev_enc = UU_PTR_ENCODE(ap); 311 uu_avl_walk_t *next, *pre local [all...] |
H A D | uu_list.c | 66 uu_list_pool_t *pp, *next, *prev; local 100 pp->ulp_next = next = &uu_null_lpool; 101 pp->ulp_prev = prev = next->ulp_prev; 102 next->ulp_prev = pp; 182 uu_list_t *lp, *next, *prev; local 219 next = &pp->ulp_null_list; 220 prev = UU_PTR_DECODE(next->ul_prev_enc); 221 lp->ul_next_enc = UU_PTR_ENCODE(next); 223 next->ul_prev_enc = UU_PTR_ENCODE(lp); 264 uu_list_node_impl_t *next) 263 list_insert(uu_list_t *lp, uu_list_node_impl_t *np, uu_list_node_impl_t *prev, uu_list_node_impl_t *next) argument 399 uu_list_walk_t *next, *prev; local 430 uu_list_node_impl_t *next; local [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libzfs/common/ |
H A D | libzfs_iter.c | 440 struct iter_stack_frame *next; member in struct:iter_stack_frame 470 for (f = ida->stack; f != NULL; f = f->next) { 493 isf.next = ida->stack; 500 ida->stack = isf.next;
|