Lines Matching refs:nlines

192   size_t nlines;		/* Number of lines in the line array.  */  member
1597 buf->used = buf->left = buf->nlines = 0; in initbuf()
1776 buf->nlines = 0; in fillbuf()
1783 struct line *line = linelim - buf->nlines; in fillbuf()
1784 size_t avail = (char *) linelim - buf->nlines * line_bytes - ptr; in fillbuf()
1785 char *line_start = buf->nlines ? line->text + line->length : buf->buf; in fillbuf()
1856 buf->nlines = buffer_linelim (buf) - line; in fillbuf()
1857 if (buf->nlines != 0) in fillbuf()
2917 struct line const *linebase = line - buf.nlines; in check()
2947 line_number += buf.nlines; in check()
3046 base[i] = linelim - buffer[i].nlines; in mergefps()
3130 base[ord[0]] = linelim - buffer[ord[0]].nlines; in mergefps()
3231 mergelines (struct line *restrict t, size_t nlines, in mergelines() argument
3234 size_t nlo = nlines / 2; in mergelines()
3235 size_t nhi = nlines - nlo; in mergelines()
3278 sequential_sort (struct line *restrict lines, size_t nlines, in sequential_sort() argument
3281 if (nlines == 2) in sequential_sort()
3301 size_t nlo = nlines / 2; in sequential_sort()
3302 size_t nhi = nlines - nlo; in sequential_sort()
3324 mergelines (dest, nlines, sorted_lo); in sequential_sort()
3336 merge_tree_init (size_t nthreads, size_t nlines, struct line *dest) in merge_tree_init() argument
3343 root->nlo = root->nhi = nlines; in merge_tree_init()
3349 init_node (root, root + 1, dest, nthreads, nlines, false); in merge_tree_init()
3382 size_t nlines = (is_lo_child ? parent->nlo : parent->nhi); in init_node() local
3383 size_t nlo = nlines / 2; in init_node()
3384 size_t nhi = nlines - nlo; in init_node()
3730 size_t nlines = node->nlo + node->nhi; in sortlines() local
3739 if (nthreads > 1 && SUBTHREAD_LINES_HEURISTIC <= nlines in sortlines()
4034 < (buf.alloc - buf.used - bytes_per_line * buf.nlines))) in sort()
4057 if (1 < buf.nlines) in sort()
4062 merge_tree_init (nthreads, buf.nlines, line); in sort()
4064 sortlines (line, nthreads, buf.nlines, merge_tree + 1, in sort()