| /dragonfly/bin/cpdup/ |
| H A D | BACKUPS | 106 That way the next incremental backup will be based on the previous one.
|
| H A D | cpdup.c | 91 struct hlink *next; member
557 new->next = hltable[n]; in hltadd()
577 if (hl->next) in hltdelete()
579 hl->prev->next = hl->next; in hltdelete()
581 if (hl->next) in hltdelete()
582 hl->next->prev = NULL; in hltdelete()
1393 char *nl, *next; in ScanDir() local
1412 for (next = buf; (nl = strchr(next, '\n')); next = nl+1) { in ScanDir()
1414 AddList(list, next, 1, NULL); in ScanDir()
1416 bufused = strlen(next); in ScanDir()
[all …]
|
| H A D | hclink.c | 418 hnew->next = hd; in hcc_alloc_descriptor()
428 for (hd = hc->hostdescs; hd; hd = hd->next) { in hcc_get_descriptor()
441 for (hdp = &hc->hostdescs; (hd = *hdp) != NULL; hdp = &hd->next) { in hcc_set_descriptor()
447 *hdp = hd->next; in hcc_set_descriptor()
458 hd->next = hc->hostdescs; in hcc_set_descriptor()
|
| H A D | hclink.h | 14 struct HCHostDesc *next; member
|
| H A D | misc.c | 107 struct malloc_info *next; member
126 info->next = InfoList; in debug_malloc()
128 info->next->prev = info; in debug_malloc()
129 info->prev->next = info; in debug_malloc()
140 for (scan = DummyInfo.next; scan != &DummyInfo; scan = scan->next) { in debug_free()
144 info->next->prev = info->prev; in debug_free()
145 info->prev->next = info->next; in debug_free()
155 for (scan = DummyInfo.next; scan != &DummyInfo; scan = scan->next) { in debug_free()
|
| /dragonfly/bin/csh/csh/ |
| H A D | host.defs | 857 vendor : : "next"
858 hosttype: defined(mc68020) : "next"
|
| /dragonfly/bin/date/ |
| H A D | vary.c | 90 while (v->next) in vary_append()
91 v = v->next; in vary_append()
92 nextp = &v->next; in vary_append()
99 (*nextp)->next = NULL; in vary_append()
436 for (v = vb; v; v = v->next) { in vary_apply()
650 n = v->next; in vary_destroy()
|
| H A D | vary.h | 32 struct vary *next; member
|
| /dragonfly/bin/hostname/ |
| H A D | hostname.c | 111 char *buf, *next, *p; in main() local
193 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) { in main()
194 rtm = (struct rt_msghdr *)(void *)next; in main()
226 next = buf + needed; in main()
237 next = buf + needed; in main()
|
| /dragonfly/bin/mined/ |
| H A D | mined.h | 132 struct Line *next; member
|
| H A D | mined1.c | 531 for (line = header->next; line != tail; line = line->next) { in WT()
626 line = line->next; in proceed()
762 line = line->next; in move()
889 line = line->next; in reset()
964 line = line->next; in display()
1312 next_line = line->next; in initialize()
1318 line->next = line->prev = line; in initialize()
1394 cur_line = header->next; in load_file()
1721 LINE *line = header->next; in line_number()
1726 line = line->next; in line_number()
[all …]
|
| H A D | mined2.c | 485 delete(cur_line,cur_text, cur_line->next,cur_line->next->text); in DCC()
620 new_line->next = line->next; in line_insert()
621 line->next = new_line; in line_insert()
678 line->prev->next = line->next; in line_delete()
848 line = line->next; in file_insert()
864 page = page->next; in file_insert()
1009 for (line = header->next; line != tail; line = line->next) { in checkmark()
1070 line = line->next; in yank()
1297 line = line->next; in change()
1427 for (line = header->next; line != match_line; line = line->next) in find_y()
[all …]
|
| /dragonfly/bin/sh/ |
| H A D | TOUR | 117 CTLESC Escape next character
145 number). The parameter's name comes next, terminated by an equals
160 The character CTLESC escapes the next character, so that in case
|
| H A D | alias.c | 73 ap->next = *app; in setalias()
94 for (ap = *app; ap; app = &(ap->next), ap = ap->next) { in unalias()
107 *app = ap->next; in unalias()
132 app = &(*app)->next; in rmaliases()
134 *app = ap->next; in rmaliases()
150 for (ap = *hashalias(name); ap; ap = ap->next) { in lookupalias()
188 for (ap = atab[i]; ap; ap = ap->next) in printaliases()
|
| H A D | alias.h | 39 struct alias *next; member
|
| H A D | eval.c | 194 union node *next; in evaltree() local
205 next = NULL; in evaltree()
215 next = n->nbinary.ch2; in evaltree()
222 next = n->nbinary.ch2; in evaltree()
228 next = n->nbinary.ch2; in evaltree()
245 next = n->nif.ifpart; in evaltree()
260 next = evalcase(n); in evaltree()
263 next = n->nclist.body; in evaltree()
271 next = n->nclist.next; in evaltree()
297 n = next; in evaltree()
[all …]
|
| H A D | exec.c | 85 struct tblentry *next; /* next entry in hash chain */ member
279 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { in hashcmd()
538 *pp = cmdp->next; in clearcmdentry()
541 pp = &cmdp->next; in clearcmdentry()
575 for (cmdp = *pp ; cmdp ; cmdp = cmdp->next) { in cmdlookup()
578 pp = &cmdp->next; in cmdlookup()
584 cmdp->next = NULL; in cmdlookup()
604 *lastcmdentry = cmdp->next; in delete_cmd_entry()
|
| H A D | expand.c | 324 *argbackq = (*argbackq)->next; in argstr()
816 *argbackq = (*argbackq)->next; in evalvar()
1541 for (n = args; n != NULL; n = n->narg.next) { in wordexp2cmd()
1549 for (n = args; n != NULL; n = n->narg.next) in wordexp2cmd()
|
| H A D | jobs.c | 781 if (jp[i].next != NULL) in makejob()
782 jp[i].next = &jp[jp[i].next - in makejob()
813 jp->next = NULL; in makejob()
835 prev->next = jp->next; in setcurjob()
837 jobmru = jp->next; in setcurjob()
838 jp->next = jobmru; in setcurjob()
843 cj->next = jobmru; in setcurjob()
855 prev->next = jp->next; in deljob()
857 jobmru = jp->next; in deljob()
1417 if (lp->next) in cmdtxt()
[all …]
|
| H A D | nodes.c.pat | 120 lp = lp->next;
148 lp = lp->next;
149 lpp = &(*lpp)->next;
|
| H A D | nodetypes | 100 next nodeptr # the next case in list
106 NDEFUN narg # define a function. The "next" field contains
111 next nodeptr # next word in list
122 next nodeptr # next redirection in list
130 next nodeptr # next redirection in list
139 next nodeptr # next redirection in list
|
| H A D | parser.c | 146 t->next = parser_temp; in parser_temp_alloc()
178 parser_temp = t->next; in parser_temp_free_upto()
197 parser_temp = t->next; in parser_temp_free_all()
399 prev->next = lp; in pipeline()
401 lp->next = NULL; in pipeline()
708 n->narg.next = NULL; in makename()
774 here->next = NULL; in parsefname()
778 for (p = heredoclist ; p->next ; p = p->next); in parsefname()
779 p->next = here; in parsefname()
1222 here = here->next; in parsebackq()
[all …]
|
| H A D | redir.c | 72 struct redirtab *next; member
131 sv->next = redirlist; in redirect()
136 for (n = redir ; n ; n = n->nfile.next) { in redirect()
340 redirlist = rp->next; in popredir()
362 for (rp = redirlist ; rp ; rp = rp->next) { in clearredir()
|
| /dragonfly/bin/sh/pregenerated/ |
| H A D | nodes.c | 190 calcsize(n->narg.next, result); in calcsize()
198 calcsize(n->nfile.next, result); in calcsize()
203 calcsize(n->ndup.next, result); in calcsize()
224 lp = lp->next; in sizenodelist()
280 new->nclist.next = copynode(n->nclist.next, state); in copynode()
286 new->narg.next = copynode(n->narg.next, state); in copynode()
294 new->nfile.next = copynode(n->nfile.next, state); in copynode()
301 new->ndup.next = copynode(n->ndup.next, state); in copynode()
307 new->nhere.next = copynode(n->nhere.next, state); in copynode()
331 lp = lp->next; in copynodelist()
[all …]
|
| H A D | nodes.h | 88 union node *next; member
96 union node *next; member
105 union node *next; member
114 union node *next; member
123 union node *next; member
154 struct nodelist *next; member
|