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

  /src/external/bsd/nvi/dist/ex/
ex_shift.c 33 enum which {LEFT, RIGHT};
45 return (shift(sp, cmdp, LEFT));
  /src/external/apache2/llvm/dist/llvm/utils/lit/lit/
ProgressBar.py 50 LEFT = '' #: Move the cursor left one char
82 BOL=cr UP=cuu1 DOWN=cud1 LEFT=cub1 RIGHT=cuf1
  /src/lib/libm/noieee_src/
n_gamma.c 88 #define LEFT -.3955078125 /* left boundary for rat. approx */
151 } else if (x >= 1.0 + LEFT + x0) {
209 if (y <= 1.0 + (LEFT + x0)) {
219 for (ym1 = y-one; ym1 > LEFT + x0; y = ym1--, yy.a--) {
233 * Good on (0, 1+x0+LEFT]. Accurate to 1ulp.
240 if (x < x0 + LEFT) {
n_lgamma.c 90 #define LEFT (1.0 - (x0 + .25))
224 } else if (y < -LEFT) {
  /src/lib/libm/src/
b_tgamma.c 98 #define LEFT -.3955078125 /* left boundary for rat. approx */
144 } else if (x >= 1.0 + LEFT + x0)
195 if (y <= 1.0 + (LEFT + x0)) {
205 for (ym1 = y-one; ym1 > LEFT + x0; y = ym1--, yy.a--) {
219 * Good on (0, 1+x0+LEFT]. Accurate to 1ulp.
226 if (x < x0 + LEFT) {
  /src/games/hunt/hunt/
otto.c 68 #undef LEFT
102 #define LEFT 1
133 #define litem flbr[LEFT]
469 rel_dir = LEFT;
  /src/external/bsd/tmux/dist/
format-draw.c 169 u_int ocy, struct screen *left, struct screen *centre, struct screen *right,
174 width_left = left->cx;
180 * Try to keep as much of the left and right as possible at the expense
192 /* Write left. */
193 format_draw_put(octx, ocx, ocy, left, frs, 0, 0, width_left);
225 /* Draw format with list on the left. */
228 u_int ocy, struct screen *left, struct screen *centre, struct screen *right,
237 width_left = left->cx;
246 * list, then the left.
265 /* If there is no list left, pass off to the no list function. *
    [all...]
popup.c 185 * ordered from left to right. Collect them in the output.
493 enum { NONE, LEFT, RIGHT, TOP, BOTTOM } border = NONE;
522 border = LEFT;
532 (border == LEFT || border == TOP))
  /src/external/gpl3/gcc/dist/gcc/text-art/
table.cc 80 case x_align::LEFT:
262 # left?+ ??? X ??? + right?
281 const bool left = (cell_a != cell_c); local
283 return directions (up, down, left, right);
345 /* The per-table-cell left and top borders are either drawn or not,
350 false, /* left */
355 true, /* left */
367 /* Paint top-left corner of border, if any. */
371 /* Paint remainder of left border of cell, if any.
404 false, /* left */
    [all...]
types.h 484 LEFT,
501 directions (bool up, bool down, bool left, bool right)
502 : m_up (up), m_down (down), m_left (left), m_right (right)
  /src/usr.bin/midiplay/
midiplay.c 341 * l > 0. May as well test now whether we will be left 'insysex'
450 * left to read */
838 #define LEFT(i) ((i << 1) + 1)
852 lc = LEFT(node);
  /src/external/bsd/byacc/dist/
defs.h 117 ,LEFT
  /src/external/bsd/top/dist/
ap_snprintf.c 300 * adding '0's to the left of the string that is going
658 LEFT, RIGHT
714 adjust = LEFT;
739 adjust = LEFT;
1138 if (adjust_width && adjust == LEFT && min_width > s_len)
  /src/external/lgpl3/mpfr/dist/src/
vasprintf.c 125 left to 0.
199 unsigned int left:1; /* - flag */ member in struct:printf_spec
219 specinfo->left = 0;
307 specinfo->left = 1;
871 LEFT, /* spaces in left hand side for right justification */
873 RIGHT /* spaces in right hand side for left justification */
1707 /* WARNING: left justification means right space padding */
1708 np->pad_type = spec.left ? RIGHT : spec.pad == '0' ? LEADING_ZEROS : LEFT;
    [all...]
  /src/games/battlestar/
extern.h 139 #define LEFT 1005
288 extern int left, right, ahead, back;
  /src/sys/arch/vax/include/
qdreg.h 202 #define LEFT 2
243 u_short scroll_x_min; /* X scroll min - left boundary */
259 u_short x_clip_min; /* left clipping boundary */
  /src/sys/dev/qbus/
qdreg.h 200 #define LEFT 2
241 u_short scroll_x_min; /* X scroll min - left boundary */
257 u_short x_clip_min; /* left clipping boundary */
  /src/external/gpl2/groff/dist/src/preproc/html/
pre-html.cpp 177 CENTERED, LEFT, RIGHT, INLINE
612 case LEFT:
  /src/external/mit/isl/dist/
isl_transitive_closure.c 1009 #define LEFT 2
1014 * to the left and to the right.
1027 * Similar, for composing to the left, we have if
1031 * then left[j] is set to 1. Otherwise, if
1035 * then left[j] is set to 0. Otherwise, composing to the left
1038 * The return value is or'd with LEFT if composing to the left
1042 isl_set **dom, isl_set **ran, int *left, int *right,
1048 ok = LEFT | RIGHT
1313 int *left = NULL; local
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/dns/
rbt.c 140 * step two: walk the tree in a depth-first, left-right-down order, writing
166 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, uintptr_t right,
194 char *adjusted_address = (char *)(node->left);
232 #define LEFT(node) ((node)->left)
377 fixup_uppernodes_helper(LEFT(node), uppernode);
577 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, uintptr_t right,
613 if (temp_node.left != NULL) {
614 temp_node.left = (dns_rbtnode_t *)(left);
662 uintptr_t left = 0, right = 0, down = 0, data = 0; local
    [all...]
  /src/games/rogue/
rogue.h 403 #define LEFT 6
  /src/external/gpl2/groff/dist/src/devices/grohtml/
post-html.cpp 62 typedef enum {CENTERED, LEFT, RIGHT, INLINE} TAG_ALIGNMENT;
930 element_list *left; member in struct:element_list
944 : right(0), left(0), datum(0), lineno(0), minv(-1), minh(-1), maxv(-1), maxh(-1)
956 : right(0), left(0), datum(in), lineno(line_number),
1022 * is_less - returns TRUE if a is left of b if on the same line or
1061 t->left = t;
1067 last = last->left;
1071 last->left->right = t;
1072 t->left = last->left;
3517 int left = 0; local
    [all...]

Completed in 66 milliseconds