HomeSort by: relevance | last modified time | path
    Searched refs:LEFT (Results 1 - 25 of 52) sorted by relevancy

1 2 3

  /src/games/battlestar/
room.c 85 left = here.west;
92 left = here.east;
99 left = here.north;
106 left = here.south;
128 return ("left");
144 return ("left");
153 return ("left");
165 return ("left");
189 case LEFT:
202 case LEFT
    [all...]
words.c 124 { "left", LEFT, VERB, NULL },
125 { "l", LEFT, VERB, NULL },
cypher.c 94 case LEFT:
95 if (!moveplayer(left, LEFT))
command7.c 134 (rnd(2) ? "left" : "right"));
235 else if (left && position != left)
236 moveplayer(left, LEFT);
extern.h 139 #define LEFT 1005
288 extern int left, right, ahead, back;
  /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/external/cddl/osnet/dist/uts/common/sys/
debug.h 93 * and prints out the values of the left and right hand expressions as part of
101 #define VERIFY3_IMPL(LEFT, OP, RIGHT, TYPE) do { \
102 const TYPE __left = (TYPE)(LEFT); \
105 assfail3(#LEFT " " #OP " " #RIGHT, \
  /src/external/gpl3/binutils/dist/gas/config/
obj-macho.h 108 #define md_allow_local_subtract(LEFT, RIGHT, SECTION) \
109 obj_mach_o_allow_local_subtract (LEFT, RIGHT, SECTION)
  /src/external/gpl3/binutils.old/dist/gas/config/
obj-macho.h 108 #define md_allow_local_subtract(LEFT, RIGHT, SECTION) \
109 obj_mach_o_allow_local_subtract (LEFT, RIGHT, SECTION)
  /src/usr.bin/sdiff/
edit.c 70 eparse(const char *cmd, const char *left, const char *right)
90 if (left == NULL)
93 goto LEFT;
96 if (asprintf(&text, "%s\n%s\n", left, right) == -1)
101 LEFT:
102 /* Skip if there is no left column. */
103 if (left == NULL)
106 if (asprintf(&text, "%s\n", left) == -1)
  /src/external/gpl2/groff/dist/src/preproc/eqn/
eqn.y 51 %token LEFT
103 /* The original eqn manual says that `left' is right associative. It's lying.
104 Consider `left ( ~ left ( ~ right ) right )'. */
106 %right LEFT
107 %left RIGHT
110 %left SQRT OVER SMALLOVER
114 %left ACCENT UACCENT
219 | LEFT delim equation RIGHT delim
221 | LEFT delim equatio
    [all...]
  /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/external/bsd/nvi/dist/ex/
ex_shift.c 33 enum which {LEFT, RIGHT};
45 return (shift(sp, cmdp, LEFT));
  /src/games/rogue/
level.c 330 put_door(&rooms[room1], LEFT, &row1, &col1);
332 dir = LEFT;
336 put_door(&rooms[room2], LEFT, &row2, &col2);
410 case LEFT:
411 *col = (dir == LEFT) ? rm->left_col : rm->right_col;
433 if ((dir == LEFT) || (dir == RIGHT)) {
561 RIGHT : LEFT;
616 RIGHT : LEFT;
652 dirs[2] = LEFT;
687 case LEFT
    [all...]
  /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...]
  /src/external/gpl2/groff/dist/src/preproc/pic/
pic.y 100 %token LEFT
118 %token LEFT
212 %left '.'
215 %left PLOT
216 %left TEXT SPRINTF
222 %left LJUST RJUST ABOVE BELOW
224 %left LEFT RIGHT
226 precedence than left and right, so that eg `line chop left'
    [all...]
  /src/games/hunt/hunt/
otto.c 68 #undef LEFT
102 #define LEFT 1
133 #define litem flbr[LEFT]
469 rel_dir = LEFT;
  /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/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/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...]
  /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/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);

Completed in 64 milliseconds

1 2 3