HomeSort by: relevance | last modified time | path
    Searched defs:nlines (Results 1 - 12 of 12) sorted by relevancy

  /src/sys/arch/ia64/stand/common/
pager.c 51 int nlines; local in function:pager_open
54 nlines = 24; /* sensible default */
56 nlines = strtol(cp, &lp, 0);
59 p_maxlines = nlines - 1;
  /src/lib/libcurses/
ripoffline.c 42 int nlines; member in struct:ripoff
62 ripoffs[nrips].nlines = line < 0 ? -1 : 1;
79 if (line < 1 && rip->nlines < 0)
80 n += -rip->nlines;
81 else if (line > 0 && rip->nlines > 0)
82 n += rip->nlines;
96 int i, nlines, rbot, rtop; local in function:__ripoffscreen
105 if (srip->nlines == 0)
107 nlines = srip->nlines < 0 ? -srip->nlines : srip->nlines
142 int rbot = screen->LINES, i, nlines, ret = OK; local in function:__ripoffresize
    [all...]
tstp.c 256 int nlines, ncols; local in function:__restartwin
289 nlines = LINES;
291 if (curscr->maxy != nlines || curscr->maxx != ncols)
292 wresize(curscr, nlines, ncols);
293 if (stdscr->maxy != nlines || stdscr->maxx != ncols)
294 wresize(stdscr, nlines, ncols);
resize.c 45 static int __resizeterm(WINDOW *win, int nlines, int ncols);
46 static int __resizewin(WINDOW *win, int nlines, int ncols);
55 int nlines = req_nlines; local in function:wresize
62 win, nlines, ncols);
67 if (win->begy + nlines > win->orig->begy + win->orig->maxy)
68 nlines = 0;
69 if (nlines <= 0)
70 nlines += win->orig->begy + win->orig->maxy - win->begy;
71 if (nlines < 1)
72 nlines = 1
    [all...]
curses_private.h 205 int nlines; member in struct:__ripoff
  /src/usr.bin/shuffle/
shuffle.c 109 size_t size, nlines = 0, maxlines = 128; local in function:get_lines
121 lines[nlines] = emalloc(size + 1);
122 (void)memcpy(lines[nlines], line, size);
123 lines[nlines++][size] = '\0';
124 if (nlines >= maxlines) {
129 lines[nlines] = NULL;
132 *nlinesp = nlines;
165 size_t nlines = 0, pick = 0, i; local in function:main
177 nlines = get_number(optarg, ch);
196 get_lines(fname, &lines, &nlines);
    [all...]
  /src/usr.bin/sortinfo/
sortinfo.c 53 size_t nlines; member in struct:section
68 slist[nsections].nlines = 0;
78 if (s->nlines == s->maxlines) {
82 s->lines[s->nlines++] = line;
107 for (i = 0; i < s->nlines; i++)
160 qsort(s->lines, s->nlines, sizeof(*s->lines), strptrcmp);
  /src/tests/lib/libc/stdlib/
h_sort.c 91 size_t nlines; local in function:main
174 nlines = 1;
178 nlines++;
185 error = reallocarr(&linepos, nlines, sizeof(linepos[0]));
194 assert(i == nlines);
199 error = reallocarr(&permutation, nlines, sizeof(permutation[0]));
202 for (i = 0; i < nlines; i++)
209 (*sortfn)(permutation, nlines, sizeof(permutation[0]), &cmp,
216 for (i = 0; i < nlines; i++) {
  /src/usr.bin/tset/
tset.c 57 int nlines, ncolumns; /* window size */ variable in typeref:typename:int
157 nlines = lines;
163 nlines = win.ws_row;
166 nlines > 0 && columns > 0) {
167 win.ws_row = nlines;
  /src/distrib/utils/more/
prim.c 360 int c, nlines; local in function:jump_back
385 for (nlines = 1; nlines < n; nlines++)
390 nlines - 1);
  /src/games/boggle/boggle/
mach.c 68 int nlines; variable in typeref:typename:int
571 nlines = LINES;
572 lastline = nlines - 1;
589 move(nlines - 1, 0);
632 move(nlines - 1, 0);
  /src/usr.bin/msgs/
msgs.c 99 #define NLINES 24 /* default number of lines/crt screen */
137 int nlines; variable in typeref:typename:int
463 Lpp = NLINES;
507 nlines = 2;
510 nlines++;
514 nlines++;
519 nlines++;
521 while (nlines < 6
525 nlines++;
586 prmesg(nlines + lct + (seensubj? 1 : 0))
    [all...]

Completed in 19 milliseconds