/original-bsd/old/lisp/fp/fp.vax/ |
H A D | primFp.l | 22 (t (bottom)))) 34 (t (bottom)))) 47 (t (bottom)))) 63 (t (bottom)))) 80 (t (bottom)))) 111 (t (bottom)))) 147 (t (bottom)))) 154 (t (bottom)))) 161 (t (bottom)))) 469 (t (bottom)))) [all …]
|
H A D | codeGen.l | 46 then `#'(lambda (x) (bottom)) 70 then `#'(lambda (x) (bottom)) 219 (cond ((not (listp x)) (bottom))
|
/original-bsd/old/compact/uncompact/ |
H A D | uncompact.c | 41 bottom = dirp->pt = dict; 62 bottom->sons[RIGHT].top->next = flist; 63 bottom->sons[RIGHT].top = dirp; 201 in[NC].fp = in[EF].fp = dict[0].sons[LEFT].sp.p = bottom = dict + 1; 202 bottom->sons[LEFT].count = bottom->sons[RIGHT].count = 204 dirp->next = dict[0].sons[RIGHT].top = bottom->sons[LEFT].top = 205 bottom->sons[RIGHT].top = dirq = NEW; 208 dirq->pt = bottom->fath.fp = in[cp->integ].fp = dict; 212 bottom->fath.flags = (LLEAF | RLEAF); 216 bottom->sons[LEFT].sp.ch = NC; [all …]
|
/original-bsd/contrib/ed/ |
H A D | m.c | 92 if ((Start == top) && (End == bottom)) 99 l_old_bottom = bottom; 108 if (End == bottom) { 109 bottom = Start->above; 111 bottom->below = NULL; 135 bottom = End;
|
H A D | e.c | 76 End = bottom; 78 if (Start == NULL && bottom == NULL); 152 End = bottom; 163 gut_num = line_number(bottom) + 512;
|
H A D | u.c | 72 u_bottom = bottom; in undo() 91 bottom = l_bottom; in undo() 113 u_bottom = bottom; in u_clr_stk()
|
H A D | d.c | 91 if (End == bottom) { 92 bottom = Start->above; 93 current = bottom;
|
H A D | main.c | 67 LINE *top, *current, *bottom, *Start, *End; variable 112 top = bottom = NULL; 334 if ((current == bottom) && (End == NULL)) { 404 End = bottom; 420 End = bottom; 437 End = bottom;
|
H A D | t.c | 127 if (l_dest == bottom) { 128 bottom = l_te;
|
H A D | w.c | 50 End = bottom; 135 if ((Start == top) && (End == bottom))
|
H A D | equal.c | 38 Start = bottom;
|
H A D | g.c | 51 if (l_cl == bottom) 158 End = bottom; 249 if ((l_num = line_number(bottom)) > gut_num) {
|
H A D | search.c | 164 if (bottom != NULL) 165 l_temp = bottom;
|
H A D | c.c | 50 if (End == bottom)
|
H A D | edhup.c | 59 edwrite(l_fp, top, bottom); in do_hup()
|
/original-bsd/old/compact/compact/ |
H A D | compact.c | 42 bottom = dirp->pt = dict; 68 bottom->sons[RIGHT].top->next = flist; 69 bottom->sons[RIGHT].top = dirp; 312 in[NC].fp = in[EF].fp = dict[0].sons[LEFT].sp.p = bottom = dict + 1; 313 bottom->sons[LEFT].count = bottom->sons[RIGHT].count = 315 dirp->next = dict[0].sons[RIGHT].top = bottom->sons[LEFT].top = 316 bottom->sons[RIGHT].top = dirq = NEW; 319 dirq->pt = bottom->fath.fp = in[cp->integ].fp = dict; 323 bottom->fath.flags = (LLEAF | RLEAF); 327 bottom->sons[LEFT].sp.ch = NC; [all …]
|
/original-bsd/games/worms/ |
H A D | worms.c | 170 int CO, IN, LI, last, bottom, ch, length, number, trail, Wrap; local 241 bottom = LI - 1; 256 ref[bottom][last] = 1; 283 for (y = bottom; --y >= 0;) { 307 cursor(last - 1, bottom); 348 y = w->ypos[h] = bottom); 367 …? upleft : (y == bottom ? lowleft : left)) : (x == last ? (!y ? upright : (y == bottom ? lowright … 382 if (!Wrap || x != last || y != bottom)
|
/original-bsd/usr.bin/telnet/ |
H A D | ring.c | 51 #define ring_decrement(d,a,c) (((a)-(c) >= (d)->bottom)? \ 85 ring->supply = ring->consume = ring->bottom = buffer; 87 ring->top = ring->bottom+ring->size; 167 ring->bottom <= ring->clearto && 168 ring->bottom + ((ring->consume + count) - ring->top)) 177 ring->consume = ring->supply = ring->bottom; 320 (*encryptor)(ring->bottom, s - ring->bottom);
|
/original-bsd/old/compact/common_source/ |
H A D | tree.c | 16 pp = bottom++; 18 bson = &bottom->sons[LEFT]; 19 bottom->fath.fp = pp; 22 in[ch].fp = in[d.integ].fp = pson->sp.p = wt->pt = bottom; 23 bottom->fath.flags = (LLEAF | RLEAF | FBIT); 57 if (r == bottom) {
|
H A D | compact.h | 66 } dict[NF], *bottom; variable
|
/original-bsd/local/ditroff/ditroff.old.okeeffe/sunsrc/gremlin/ |
H A D | graphics2.c | 84 int bottom; /* how much to bleed line in "down" (right) direction */ local 135 bottom = (top - 1) / 2; 156 for (i=y0-top; i<=y0+bottom; i++) 169 for (i=y0-top; i<=y0+bottom; i++) 185 for (i = y0 - top; i <= y0 + bottom; i++) 214 for (i = x0 - top; i <= x0 + bottom; i++) 227 for (i=x0-top; i<=x0+bottom; i++) 243 for (i=x0-top; i<=x0+bottom; i++)
|
/original-bsd/usr.bin/make/ |
H A D | suff.c | 1909 bottom = SuffFindThem(srcs, slst); 1911 if (bottom == (Src *)NULL) { 2036 while (bottom && bottom->parent != NULL) { 2038 Lst_AtEnd(slst, (ClientData) bottom); 2040 bottom = bottom->parent; 2042 bottom = src; 2046 if (bottom == NULL) { 2065 if (bottom->node == NILGNODE) { 2066 bottom->node = Targ_FindNode(bottom->file, TARG_CREATE); 2119 if (bottom) [all …]
|
/original-bsd/usr.bin/window/ |
H A D | windowrc | 26 # The bottom one is MIN(24, total lines * 3 / 4) lines 59 "window r = $nrow / 2 + 1, l = bottom"
|
/original-bsd/sys/news3400/bm/ |
H A D | vt100.c | 424 scroll_up(top, bottom, revsw, fcol, bcol) in scroll_up() argument 426 int bottom; 431 move_lines(top + 1, bottom - top, top); 432 clear_lines(bottom, 1, revsw, fcol, bcol); 435 scroll_down(top, bottom, revsw, fcol, bcol) in scroll_down() argument 437 int bottom; 442 move_lines(top, bottom - top, top + 1);
|
/original-bsd/sys/vax/uba/ |
H A D | qevent.h | 86 short bottom; member
|