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

  /src/external/bsd/nvi/dist/ex/
ex_shift.c 33 enum which {LEFT, RIGHT};
56 return (shift(sp, cmdp, RIGHT));
122 if (rl == RIGHT)
  /src/external/apache2/llvm/dist/llvm/utils/lit/lit/
ProgressBar.py 51 RIGHT = '' #: Move the cursor right one char
82 BOL=cr UP=cuu1 DOWN=cud1 LEFT=cub1 RIGHT=cuf1
  /src/games/hunt/hunt/
otto.c 70 #undef RIGHT
104 #define RIGHT 3
135 #define ritem flbr[RIGHT]
433 /* rotate ottolook's to be in right position */
471 rel_dir = RIGHT;
551 return false; /* until it's done right */
567 j = (RIGHT + i) % NUMDIRECTIONS;
  /src/lib/libm/noieee_src/
n_lgamma.c 91 #define RIGHT (x0 - .218)
166 if (x > 6 + RIGHT) {
220 if (x_int <= 2 && y > RIGHT) {
  /src/external/bsd/tmux/dist/
format-draw.c 169 u_int ocy, struct screen *left, struct screen *centre, struct screen *right,
176 width_right = right->cx;
180 * Try to keep as much of the left and right as possible at the expense
195 /* Write right at available - width_right. */
196 format_draw_put(octx, ocx, ocy, right, frs,
198 right->cx - width_right,
228 u_int ocy, struct screen *left, struct screen *centre, struct screen *right,
239 width_right = right->cx;
245 * Trim first the centre, then the list, then the right, then after the
272 right, abs_centre, frs)
    [all...]
popup.c 185 * ordered from left to right. Collect them in the output.
493 enum { NONE, LEFT, RIGHT, TOP, BOTTOM } border = NONE;
524 border = RIGHT;
  /src/external/gpl3/gcc/dist/gcc/text-art/
table.cc 86 case x_align::RIGHT:
262 # left?+ ??? X ??? + right?
282 const bool right = (cell_b != cell_d); local
283 return directions (up, down, left, right);
290 - plus a right-hand border
351 false /* right */));
356 true)); /* right */
391 /* Paint right-hand border of row. */
399 false))); /* right */
405 false))); /* right */
    [all...]
  /src/games/hunt/include/
hunt_common.h 156 #define RIGHT '}'
160 #define isplayer(c) (c == LEFTS || c == RIGHT ||\
163 #define isplayer(c) (c == LEFTS || c == RIGHT ||\
  /src/usr.bin/midiplay/
midiplay.c 839 #define RIGHT(i) ((i + 1) << 1)
853 rc = RIGHT(node);
855 if (rc >= ntrks) { /* no right child */
  /src/external/bsd/byacc/dist/
defs.h 118 ,RIGHT
  /src/external/bsd/top/dist/
ap_snprintf.c 658 LEFT, RIGHT
698 adjust = RIGHT;
1120 if (adjust_width && adjust == RIGHT && min_width > s_len) {
  /src/external/lgpl3/mpfr/dist/src/
vasprintf.c 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;
1741 /* don't want "0000nan", change to right justification padding
1753 /* don't want "0000inf", change to right justification padding
1828 /* change to right justification padding with left spaces */
2011 /* right justification padding with left spaces */
2023 /* right justification padding with leading zeros *
    [all...]
  /src/games/battlestar/
extern.h 138 #define RIGHT 1004
288 extern int left, right, ahead, back;
  /src/sys/arch/vax/include/
qdreg.h 203 #define RIGHT 3
244 u_short scroll_x_max; /* X scroll max - right boundary */
260 u_short x_clip_max; /* right clipping boundary */
  /src/sys/dev/qbus/
qdreg.h 201 #define RIGHT 3
242 u_short scroll_x_max; /* X scroll max - right boundary */
258 u_short x_clip_max; /* right clipping boundary */
  /src/external/gpl2/groff/dist/src/preproc/html/
pre-html.cpp 177 CENTERED, LEFT, RIGHT, INLINE
615 case RIGHT:
985 * getMaxX - Return the largest right-hand position for any image
  /src/external/mit/isl/dist/
isl_transitive_closure.c 1010 #define RIGHT 1
1014 * to the left and to the right.
1020 * then right[j] is set to 1. Otherwise, if
1024 * then right[j] is set to 0. Otherwise, composing to the right
1039 * is possible and with RIGHT if composing to the right is possible.
1042 isl_set **dom, isl_set **ran, int *left, int *right,
1048 ok = LEFT | RIGHT;
1054 if (ok & RIGHT) {
1314 int *right = 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,
203 char *adjusted_address = (char *)(node->right);
233 #define RIGHT(node) ((node)->right)
378 fixup_uppernodes_helper(RIGHT(node), uppernode);
577 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left, uintptr_t right,
617 if (temp_node.right != NULL) {
618 temp_node.right = (dns_rbtnode_t *)(right);
662 uintptr_t left = 0, right = 0, down = 0, data = 0; local
    [all...]
  /src/games/rogue/
rogue.h 399 #define RIGHT 2
  /src/external/gpl2/groff/dist/src/devices/grohtml/
post-html.cpp 62 typedef enum {CENTERED, LEFT, RIGHT, INLINE} TAG_ALIGNMENT;
929 element_list *right; 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),
1015 head = head->right;
1062 t->right = t;
1070 t->right = last;
1071 last->left->right = t;
1079 t->right = last->right;
    [all...]

Completed in 45 milliseconds