Home
last modified time | relevance | path

Searched refs:rank (Results 1 – 25 of 54) sorted by relevance

123

/dragonfly/games/cribbage/
HDscore.c119 if (hand[i].rank == JACK) /* check for his nibs */ in scorehand()
190 i = hand->rank + 1; in fifteens()
232 if (h[i].rank == h[i - 1].rank) { in pairuns()
234 pair1 = h[i].rank; in pairuns()
237 if (h[i].rank == pair1) { in pairuns()
241 pair2 = h[i].rank; in pairuns()
253 if (h[i].rank == h[i - 1].rank + 1) { in pairuns()
289 sum += VAL(crd.rank); in pegscore()
299 while ((crd.rank == tbl[n - j].rank) && (n - j >= 0)) in pegscore()
305 lo = hi = crd.rank; in pegscore()
[all …]
HDcards.c53 d[k++].rank = i; in makedeck()
81 return ((a.rank == b.rank) && (a.suit == b.suit)); in eq()
110 d[j].suit = d[j].rank = EMPTY; in cremove()
125 if ((cp->rank < h->rank) || in sorthand()
126 (cp->rank == h->rank && cp->suit < h->suit)) { in sorthand()
HDio.c94 if (c.rank == EMPTY || c.suit == EMPTY) in msgcrd()
97 addmsg("%1.1s", rankchar[c.rank]); in msgcrd()
99 addmsg("%s", rankname[c.rank]); in msgcrd()
126 if (c.rank == EMPTY) in prcard()
135 mvwaddch(win, y + 1, x + 1, rankchar[c.rank][0]); in prcard()
137 mvwaddch(win, y + 3, x + 4, rankchar[c.rank][0]); in prcard()
179 if (hand[i].rank == crd.rank && in infrom()
189 if (crd.rank != EMPTY) { in infrom()
191 if (hand[i].rank == crd.rank) in infrom()
197 if (hand[j].rank == crd.rank) in infrom()
[all …]
HDsupport.c73 if (l > 1 || VAL(h[j].rank) != i) in cchose()
85 VAL(h[j].rank) != 15 - tv[i]) in cchose()
94 l = s + VAL(h[i].rank); in cchose()
105 l = s + VAL(h[i].rank); in cchose()
290 j = hand[0].rank; in anymove()
292 if (hand[i].rank < j) in anymove()
293 j = hand[i].rank; in anymove()
308 if (s + VAL(hand[i].rank) == t) in anysumto()
324 if (VAL(h[i].rank) == v) in numofval()
HDcrib.c218 flag = (deck[i].rank == deck[j].rank); in game()
225 compcrib = (deck[i].rank > deck[j].rank); in game()
352 chand[4].rank = chand[4].suit = chand[5].rank = chand[5].suit = EMPTY; in discard()
378 if (turnover.rank == JACK) { in cut()
388 if (turnover.rank == JACK) { in cut()
489 sum += VAL(crd.rank); in peg()
531 if (sum + VAL(crd.rank) <= 31) in peg()
539 sum += VAL(crd.rank); in peg()
HDcribbage.n18 The pack of 52. The cards in each suit rank: K (high), Q, J, 10,
45 Cards are drawn; the lower deals first. If cards of equal rank
95 Playing a card of same rank as that previously played pegs
96 2. Playing a third card of the same rank makes pair royal
97 and pegs 6. Playing the fourth card of the same rank
100 The tenth cards pair strictly by rank, a king with a king,
107 rank alone; the suits do not matter. Nor does the score
129 Each pair of cards of the same rank scores 2.
216 three apart in rank.
HDdeck.h72 int rank; member
/dragonfly/sys/dev/misc/ecc/
HDecc_e5.c181 int dimm, rank, error, cpuid; in ecc_e5_attach() local
202 rank = 0; in ecc_e5_attach()
305 if (rank >= PCI_E5_IMC_ERROR_RANK_MAX) { in ecc_e5_attach()
311 rk = &sc->ecc_rank[rank]; in ecc_e5_attach()
313 ++rank; in ecc_e5_attach()
316 sc->ecc_rank_cnt = rank; in ecc_e5_attach()
323 for (rank = 0; rank < sc->ecc_rank_cnt; ++rank) { in ecc_e5_attach()
324 const struct ecc_e5_rank *rk = &sc->ecc_rank[rank]; in ecc_e5_attach()
328 ofs = PCI_E5_IMC_ERROR_COR_ERR_TH(rank / 2); in ecc_e5_attach()
329 if (rank & 1) in ecc_e5_attach()
[all …]
HDecc_e3.c329 int rank, dimm; in ecc_e3_attach_ch() local
376 rank = 0; in ecc_e3_attach_ch()
398 KKASSERT(rank < ECC_E3_CHAN_RANK_MAX - 1); in ecc_e3_attach_ch()
399 rk = &chan->chan_rank[rank]; in ecc_e3_attach_ch()
400 rank++; in ecc_e3_attach_ch()
403 rk = &chan->chan_rank[rank]; in ecc_e3_attach_ch()
404 rank++; in ecc_e3_attach_ch()
408 chan->chan_rank_cnt = rank; in ecc_e3_attach_ch()
429 int rank; in ecc_e3_errlog_ch() local
435 rank = __SHIFTOUT(err0, MCH_E3_ERRLOG0_ERRRANK); in ecc_e3_errlog_ch()
[all …]
/dragonfly/games/hack/
HDhack.end.c323 int rank, rank0 = -1, rank1 = 0; in topten() local
373 for (rank = 1;;) { in topten()
382 rank0 = rank++; in topten()
403 rank1 = rank; in topten()
412 if (rank <= ENTRYMAX) { in topten()
414 rank++; in topten()
416 if (rank > ENTRYMAX) { in topten()
439 rank0 = rank; in topten()
443 for (rank = 1; t1->points != 0; rank++, t1 = t1->tt_next) { in topten()
452 if (rank > (int)flags.end_top && in topten()
[all …]
/dragonfly/games/rogue/
HDscore.c199 short i, n, rank = 10, x, ne = 0, found_player = -1; in put_scores() local
265 rank = i; in put_scores()
270 rank = 0; in put_scores()
271 } else if ((ne < 10) && (rank == 10)) { in put_scores()
272 rank = ne; in put_scores()
274 if (rank < 10) { in put_scores()
275 insert_score(scores, n_names, nick_name, rank, ne, monster, in put_scores()
293 if (i == rank) { in put_scores()
305 if (rank < 10) { in put_scores()
311 if (i == rank) { in put_scores()
[all …]
/dragonfly/contrib/gdb-7/gdb/
HDgdbtypes.h887 struct rank struct
889 short rank; member
904 struct rank *rank; member
1579 #define LENGTH_MATCH(bv) ((bv)->rank[0])
1582 extern const struct rank LENGTH_MISMATCH_BADNESS;
1585 extern const struct rank TOO_FEW_PARAMS_BADNESS;
1587 extern const struct rank INCOMPATIBLE_TYPE_BADNESS;
1590 extern const struct rank EXACT_MATCH_BADNESS;
1593 extern const struct rank INTEGER_PROMOTION_BADNESS;
1595 extern const struct rank FLOAT_PROMOTION_BADNESS;
[all …]
HDgdbtypes.c43 const struct rank LENGTH_MISMATCH_BADNESS = {100,0};
45 const struct rank TOO_FEW_PARAMS_BADNESS = {100,0};
46 const struct rank INCOMPATIBLE_TYPE_BADNESS = {100,0};
48 const struct rank EXACT_MATCH_BADNESS = {0,0};
50 const struct rank INTEGER_PROMOTION_BADNESS = {1,0};
51 const struct rank FLOAT_PROMOTION_BADNESS = {1,0};
52 const struct rank BASE_PTR_CONVERSION_BADNESS = {1,0};
53 const struct rank INTEGER_CONVERSION_BADNESS = {2,0};
54 const struct rank FLOAT_CONVERSION_BADNESS = {2,0};
55 const struct rank INT_FLOAT_CONVERSION_BADNESS = {2,0};
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
HDtree-ssa-reassoc.c177 unsigned int rank; member
293 propagate_rank (long rank, tree op) in propagate_rank() argument
298 return rank; in propagate_rank()
302 return MAX (rank, op_rank); in propagate_rank()
317 insert_operand_rank (tree e, long rank) in insert_operand_rank() argument
320 gcc_assert (rank > 0); in insert_operand_rank()
323 *slot = (void *) (intptr_t) rank; in insert_operand_rank()
375 long rank; in get_rank() local
395 rank = find_operand_rank (e); in get_rank()
396 if (rank != -1) in get_rank()
[all …]
HDsched-ebb.c65 static int rank (rtx, rtx);
239 rank (rtx insn1, rtx insn2) in rank() function
298 rank,
/dragonfly/games/fish/
HDfish.c400 int i, rank; in init() local
405 while (!deck[rank = nrandom(RANKS)]) in init()
407 ++userhand[rank]; in init()
408 --deck[rank]; in init()
411 while (!deck[rank = nrandom(RANKS)]) in init()
413 ++comphand[rank]; in init()
414 --deck[rank]; in init()
/dragonfly/usr.sbin/lpr/common_source/
HDdisplayq.c73 static int rank; /* order to be printed (-1=none, 0=active) */ variable
98 rank = -1; in displayq()
293 if (rank < 0) in inform()
294 rank = 0; in inform()
296 rank++; in inform()
322 prank(rank); in inform()
327 prank(rank); in inform()
/dragonfly/contrib/gcc-8.0/gcc/
HDtree-ssa-reassoc.c195 unsigned int rank; member
350 propagate_rank (long rank, tree op) in propagate_rank() argument
355 return rank; in propagate_rank()
359 return MAX (rank, op_rank); in propagate_rank()
374 insert_operand_rank (tree e, long rank) in insert_operand_rank() argument
376 gcc_assert (rank > 0); in insert_operand_rank()
377 gcc_assert (!operand_rank->put (e, rank)); in insert_operand_rank()
426 long rank; in get_rank() local
440 rank = find_operand_rank (e); in get_rank()
441 if (rank != -1) in get_rank()
[all …]
HDsched-ebb.c57 static int rank (rtx_insn *, rtx_insn *);
229 rank (rtx_insn *insn1, rtx_insn *insn2) in rank() function
286 rank,
/dragonfly/games/canfield/canfield/
HDcanfield.c133 int rank; member
515 cards[i].rank = r; in initdeck()
564 if (cp->rank != 10) in printrank()
568 switch (cp->rank) { in printrank()
571 printw("%d", cp->rank); in printrank()
640 if ((*cp)->rank == basecard->rank) { in fndbase()
821 if (cp2->rank == Ace) in ranklower()
822 if (cp1->rank == King) in ranklower()
826 else if (cp1->rank + 1 == cp2->rank) in ranklower()
1248 if (found[let]->rank == King) in rankhigher()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/cp/
HDcall.c86 conversion_rank rank; member
134 : (NODE)->rank)
139 : (NODE)->rank)
757 conversion_rank rank = CONVERSION_RANK (from); in build_conv() local
771 if (rank < cr_std) in build_conv()
772 rank = cr_std; in build_conv()
776 if (rank < cr_exact) in build_conv()
777 rank = cr_exact; in build_conv()
783 t->rank = rank; in build_conv()
824 t->rank = cr_exact; in build_list_conv()
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/tr1/
Dtype_traits353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/tr1/
Dtype_traits354 /// rank
356 struct rank
360 struct rank<_Tp[_Size]>
361 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
364 struct rank<_Tp[]>
365 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
/dragonfly/contrib/gcc-8.0/gcc/cp/
HDcall.c86 conversion_rank rank; member
136 : (NODE)->rank)
141 : (NODE)->rank)
762 conversion_rank rank = CONVERSION_RANK (from); in build_conv() local
776 if (rank < cr_std) in build_conv()
777 rank = cr_std; in build_conv()
782 if (rank < cr_exact) in build_conv()
783 rank = cr_exact; in build_conv()
789 t->rank = rank; in build_conv()
836 t->rank = cr_exact; in build_list_conv()
[all …]
/dragonfly/sbin/hammer2/zlib/
HDhammer2_zlib_trees.c847 int rank; /* index in bl_order */ in send_all_trees() local
856 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
857 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); in send_all_trees()
858 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); in send_all_trees()

123