HomeSort by: relevance | last modified time | path
    Searched refs:opposite (Results 1 - 16 of 16) sorted by relevancy

  /src/games/mille/
table.c 62 "need", "opposite");
68 Numcards[i], count, Numneed[i], C_name[opposite(i)]);
comp.c 103 if (pp->battle == opposite(card) ||
144 oppos = opposite(pp->hand[i]);
168 Numneed[opposite(pp->battle)]++;
256 oppos = opposite(card);
310 oppos = opposite(card);
383 Numneed[opposite(pp->battle)]++;
470 if (pp->battle == opposite(card))
move.c 256 if (pp->battle != opposite(card))
305 if (pp->battle == opposite(card)
524 oppos = opposite(card);
mille.h 204 #define opposite(x) (Opposite[x]) macro
223 extern const CARD Opposite[NUM_CARDS];
  /src/games/hunt/huntd/
hunt.h 197 bool opposite(int, char);
shots.c 304 if (opposite(bp->b_face, Maze[y][x])) {
495 opposite(bp->b_face, Maze[bp->b_y][bp->b_x])) {
1039 * opposite:
1040 * Return true if the bullet direction faces the opposite direction
1044 opposite(int face, char dir) function
execute.c 238 else if (opposite(dir, pp->p_face))
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/
fp_add_impl.inc 70 // have opposite signs, we are performing a subtraction; otherwise addition.
  /src/external/bsd/tmux/dist/
layout.c 620 enum layout_type type, int change, int opposite)
629 opposite);
649 int opposite)
668 layout_resize_layout(wp->window, lc, type, change, opposite);
674 enum layout_type type, int needed, int opposite)
692 if (opposite && lcremove == NULL) {
  /src/sys/arch/sandpoint/
README 24 S3/S4 - Mode 1: PMC w/o IDE (switches opposite, one nearest PCI
  /src/external/gpl3/gcc.old/dist/libgcc/config/arm/
ieee754-sf.S 279 @ if opposite sign: return NAN
  /src/external/gpl3/gcc.old/dist/libgcc/config/m68k/
lb1sf68.S 1478 bra Ld$infty | the opposite sign
2871 bmi Lsubsf$0 | if negative a and b have opposite
3111 | opposite signs) things are more complicated: if both are INFINITY
3152 bra Lf$infty | the opposite sign
  /src/external/gpl3/gcc.old/dist/gcc/config/c6x/
c6x.cc 3611 /* In parallel with jump_cycles, this array records the opposite of
3701 and has the opposite condition of COND. */
3744 the opposite of the condition in which it branches. Otherwise,
3779 /* Return true iff COND1 and COND2 are exactly opposite conditions
4014 adjust_cost, since the stall occurs even for insns with opposite
4197 has a predicate opposite of the previous jump: the side effect
4439 rtx opposite = condjump_opposite_condition (insn);
4440 record_jump (ss.curr_sched_clock + cycles, opposite);
4421 rtx opposite = condjump_opposite_condition (insn); local
  /src/sys/arch/m68k/060sp/dist/
pfpsp.s 4311 # for predecrement mode, the bit string is the opposite of both control
5415 # do the opposite. Return this scale factor in d0. #
10299 # If you have a DENORM and a NORM with opposite signs, then use fcmp_norm, also.
11402 mov.b SRC_EX(%a0),%d0 # are the signs opposite
11416 # the ZEROes have opposite signs:
11860 # the signs are opposite, so, return a ZERO w/ the sign of the dst ZERO
13752 # of opposite sign in bindec.sa from Coonen).
fpsp.s 13867 # If you have a DENORM and a NORM with opposite signs, then use fcmp_norm, also.
14970 mov.b SRC_EX(%a0),%d0 # are the signs opposite
14984 # the ZEROes have opposite signs:
15428 # the signs are opposite, so, return a ZERO w/ the sign of the dst ZERO
15868 # do the opposite. Return this scale factor in d0. #
16695 # Therefore, the opposite branch type is used to jump to the decrement #
18261 # for predecrement mode, the bit string is the opposite of both control
23791 # of opposite sign in bindec.sa from Coonen).
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
iteration.d 2539 assert(!range.empty); // Opposite of refInputRange test
2550 assert(!range.empty); // Opposite of refInputRange test
4265 the same thing but with the opposite parameter order.

Completed in 141 milliseconds