| /coreutils/src/ |
| D | tr.c | 107 struct List_element *next; member
644 new->next = nullptr; in append_normal_char()
647 list->tail->next = new; in append_normal_char()
672 new->next = nullptr; in append_range()
676 list->tail->next = new; in append_range()
694 new->next = nullptr; in append_char_class()
697 list->tail->next = new; in append_char_class()
712 new->next = nullptr; in append_repeated_char()
716 list->tail->next = new; in append_repeated_char()
734 new->next = nullptr; in append_equiv_class()
[all …]
|
| D | csplit.c | 88 struct line *next; /* Next in linked list. */ member
104 struct buffer_record *next; member
294 p->next = nullptr; in new_line_control()
315 b->curr_line->next = new_line_control (); in keep_new_line()
316 b->curr_line = b->curr_line->next; in keep_new_line()
394 struct line *n = l->next; in free_buffer()
416 new_buffer->next = nullptr; in get_new_buffer()
429 buf->next = nullptr; in save_buffer()
436 for (p = head; p->next; p = p->next) in save_buffer()
438 p->next = buf; in save_buffer()
[all …]
|
| D | tsort.c | 47 struct successor *next; member
273 p->next = j->top; in record_relation()
354 *p = s->next; in detect_loop()
385 p = &(*p)->next; in detect_loop()
502 p = p->next; in tsort()
|
| D | tail.c | 613 struct linebuffer *next; in pipe_lines() member
623 first->next = nullptr; in pipe_lines()
635 tmp->next = nullptr; in pipe_lines()
665 last = last->next = tmp; in pipe_lines()
670 first = first->next; in pipe_lines()
703 for (tmp = first; total_lines - tmp->nlines > n_lines; tmp = tmp->next) in pipe_lines()
725 for (tmp = tmp->next; tmp; tmp = tmp->next) in pipe_lines()
731 tmp = first->next; in pipe_lines()
750 struct charbuffer *next; in pipe_bytes() member
761 first->next = nullptr; in pipe_bytes()
[all …]
|
| D | head.c | 506 struct linebuffer *next; in elide_tail_lines_pipe() member
517 first->next = nullptr; in elide_tail_lines_pipe()
538 tmp->next = nullptr; in elide_tail_lines_pipe()
569 last = last->next = tmp; in elide_tail_lines_pipe()
576 first = first->next; in elide_tail_lines_pipe()
600 for (tmp = first; n_elide < total_lines - tmp->nlines; tmp = tmp->next) in elide_tail_lines_pipe()
626 tmp = first->next; in elide_tail_lines_pipe()
|
| D | split.c | 940 bool next = false; in lines_chunk_split() local
948 next = true; in lines_chunk_split()
967 new_file_flag = next; in lines_chunk_split()
971 while (next || chunk_end <= n_written) in lines_chunk_split()
973 if (!next && bp == eob) in lines_chunk_split()
989 next = false; in lines_chunk_split()
1199 bool next = false; in lines_rr() local
1206 next = true; in lines_rr()
1223 if (next) in lines_rr()
1255 if (next && ++i_file == n) in lines_rr()
|
| D | fmt.c | 164 static COST line_cost (WORD *next, int len);
953 line_cost (WORD *next, int len) in line_cost() argument
958 if (next == word_limit) in line_cost()
962 if (next->next_break != word_limit) in line_cost()
964 n = len - next->line_length; in line_cost()
|
| D | ls.c | 379 struct pending *next; member
612 struct color_ext_type *next; /* Next in list */ member
700 struct ignore_pattern *next; member
1793 else if (n_files <= 1 && pending_dirs && pending_dirs->next == 0) in main()
1799 pending_dirs = pending_dirs->next; in main()
2140 hide->next = hide_patterns; in decode_switches()
2783 ext->next = color_ext_list; in parse_ls_color()
2866 e = e->next; in parse_ls_color()
2879 for (e1 = color_ext_list; e1 != nullptr; e1 = e1->next) in parse_ls_color()
2884 for (e2 = e1->next; e2 != nullptr; e2 = e2->next) in parse_ls_color()
[all …]
|
| D | join.c | 60 struct outlist *next; member
594 outlist = outlist_head.next; in prjoin()
621 o = o->next; in prjoin()
827 o->next = nullptr; in add_field()
830 outlist_end->next = o; in add_field()
|
| D | sort.c | 222 struct keyfield *next; /* Next keyfield to try. */ member
661 struct tempnode *volatile next; member
814 for (node = temphead; node; node = node->next) in cleanup()
859 node->next = nullptr; in create_temp_file()
869 temptail = &node->next; in create_temp_file()
1248 struct tempnode *next; in zaptemp() local
1253 for (pnode = &temphead; (node = *pnode)->name != name; pnode = &node->next) in zaptemp()
1260 next = node->next; in zaptemp()
1264 *pnode = next; in zaptemp()
1269 if (! next) in zaptemp()
[all …]
|
| D | od.c | 631 decode_one_format (char const *s_orig, char const *s, char const **next, in ATTRIBUTE_NONNULL()
880 *next = s; in ATTRIBUTE_NONNULL()
977 char const *next; in ATTRIBUTE_NONNULL() local
982 if (! decode_one_format (s_orig, s, &next, &spec[n_specs])) in ATTRIBUTE_NONNULL()
985 affirm (s != next); in ATTRIBUTE_NONNULL()
986 s = next; in ATTRIBUTE_NONNULL()
|
| D | cp.c | 55 struct dir_attr *next; member
318 for (p = attr_list; p; p = p->next) in re_protect()
472 new->next = *attr_list; in make_dir_parents_private()
770 attr_list = attr_list->next; in do_copy()
|
| D | numfmt.c | 1398 char *next; in process_line() local
1404 next = next_field (&line); in process_line()
1411 if (! process_field (next, field)) in process_line()
1421 if (! process_field (next, field)) in process_line()
|
| D | df.c | 52 struct devlist *next; member
814 devlist->next = device_list; in filter_mount_list()
836 struct devlist *next = device_list->next; in filter_mount_list() local
838 device_list = next; in filter_mount_list()
|
| /coreutils/ |
| D | README-hacking | 37 the package last synchronized to), do this next:
48 The next step is to get and check other files needed to build,
|
| D | TODO | 84 algorithm to try next should be merge insertion. See Knuth section
|
| D | HACKING | 149 the next-to-last change set.
372 " The next 3 lines below set the GNU indentation
572 state to the revision just before HEAD (i.e., next-to-last).
|
| D | THANKS.in | 173 Derek Clegg dclegg@next.com
|
| D | COPYING | 283 clear directions next to the object code saying where to find the
|
| D | NEWS | 3303 date -d 'next mon', when run on a Monday, now prints the date
|
| /coreutils/tests/ |
| D | filefrag-extent-compare | 42 and ++$i, next;
|
| /coreutils/doc/ |
| D | sort-version.texi | 148 The next section (@ref{Differences from Debian version
432 Tilde sorts before all others, hence the line @samp{1~} appears next.
|
| D | fdl.texi | 125 The Document may include Warranty Disclaimers next to the notice which
|
| D | coreutils.texi | 494 * Relative items in date strings:: @samp{next tuesday, 2 years ago}
2160 The next several options are shorthands for format specifications.
3070 /^==> .* <==$/ @{prefix=substr($0,5,length-8)":"; next@}
3322 when the next most significant position reaches the last character.
3585 create an output file containing the next @var{n} lines of the input
3590 including) the next line of the input file that contains a match for
3595 and the line after that begins the next section of input.
3989 next section) is preferable in new applications.
5879 Emacs @code{next-error} processing. In this default output format, each
10679 By default, @command{shred} rounds the size of a regular file up to the next
[all …]
|