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

  /src/sys/arch/mips/bonito/
bonitoreg.h 380 #define BONITO_PCIMAP_WIN(WIN,ADDR) ((((ADDR)>>26) & BONITO_PCIMAP_PCIMAP_LO0) << ((WIN)*6))
405 #define BONITO_PCIMEMBASECFGSIZE(WIN,SIZE) (((~((SIZE)-1))>>(BONITO_PCIMEMBASECFG_ASHIFT-BONITO_PCIMEMBASECFG_MEMBASE##WIN##_MASK_SHIFT)) & BONITO_PCIMEMBASECFG_MEMBASE##WIN##_MASK)
406 #define BONITO_PCIMEMBASECFGBASE(WIN,BASE) (((BASE)>>(BONITO_PCIMEMBASECFG_ASHIFT-BONITO_PCIMEMBASECFG_MEMBASE##WIN##_TRANS_SHIFT)) & BONITO_PCIMEMBASECFG_MEMBASE##WIN##_TRANS)
408 #define BONITO_PCIMEMBASECFG_SIZE(WIN,CFG) (((((~(CFG)) & BONITO_PCIMEMBASECFG_MEMBASE##WIN##_MASK)) << (BONITO_PCIMEMBASECFG_ASHIFT - BONITO_PCIMEMBASECFG_MEMBASE##WIN##_MASK_SHIFT)) | BONI (…)
    [all...]
  /src/games/rogue/
score.c 140 win(void) function in typeref:typename:void
160 put_scores(NULL, WIN);
481 case WIN:
503 if (other != WIN && has_amulet()) {
rogue.h 394 #define WIN 5
635 void win(void) __dead;
  /src/games/gomoku/
gomoku.h 76 #define WIN 3
85 * 'W' is the minimum number of moves needed to win once it can't be blocked.
91 * the intersection point. The number of moves to win is the number of moves
101 * fewest moves to win.
106 * complete which takes fewer or the same number of moves to win).
143 #define cv_win c.b /* # moves to win */
makemove.c 95 * WIN The winning move was just played.
159 return WIN;
main.c 257 case WIN:

Completed in 35 milliseconds