| /src/games/cribbage/ |
| score.c | 126 if (hand[i].rank == JACK) /* check for his nibs */
154 sorthand(h, n + 1); /* sort by rank */
199 i = hand->rank + 1;
241 if (h[i].rank == h[i - 1].rank) {
243 pair1 = h[i].rank;
246 if (h[i].rank == pair1) {
250 pair2 = h[i].rank;
262 if (h[i].rank == h[i - 1].rank + 1)
[all...] |
| cards.c | 65 d[k++].rank = i;
93 return ((a.rank == b.rank) && (a.suit == b.suit));
122 d[j].suit = d[j].rank = EMPTY;
137 if ((cp->rank < h->rank) ||
138 (cp->rank == h->rank && cp->suit < h->suit)) {
|
| deck.h | 54 #define ACE 0 /* value of each rank */
69 #define VAL(c) ( (c) < 9 ? (c)+1 : 10 ) /* val of rank */
78 int rank; member in struct:__anon446692140108
|
| support.c | 80 if (l > 1 || VAL(h[j].rank) != i)
92 VAL(h[j].rank) != 15 - tv[i])
101 l = s + VAL(h[i].rank);
112 l = s + VAL(h[i].rank);
301 j = hand[0].rank;
303 if (hand[i].rank < j)
304 j = hand[i].rank;
319 if (s + VAL(hand[i].rank) == t)
326 * return the number of cards in h having the given rank value
335 if (VAL(h[i].rank) == v
[all...] |
| io.c | 104 if (c.rank == EMPTY || c.suit == EMPTY)
107 addmsg("%1.1s", rankchar[c.rank]);
109 addmsg("%s", rankname[c.rank]);
136 if (c.rank == EMPTY)
145 mvwaddch(win, y + 1, x + 1, rankchar[c.rank][0]);
147 mvwaddch(win, y + 3, x + 4, rankchar[c.rank][0]);
189 if (hand[i].rank == crd.rank &&
199 if (crd.rank != EMPTY) {
201 if (hand[i].rank == crd.rank
[all...] |
| crib.c | 251 flag = (deck[i].rank == deck[j].rank);
258 compcrib = (deck[i].rank > deck[j].rank);
391 chand[4].rank = chand[4].suit = chand[5].rank = chand[5].suit = EMPTY;
417 if (turnover.rank == JACK) {
427 if (turnover.rank == JACK) {
531 sum += VAL(crd.rank);
573 if (sum + VAL(crd.rank) <= 31
[all...] |
| /src/games/hack/ |
| hack.end.c | 328 int rank, rank0 = -1, rank1 = 0; local in function:topten
378 for (rank = 1;;) {
387 rank0 = rank++;
408 rank1 = rank;
417 if (rank <= ENTRYMAX) {
419 rank++;
421 if (rank > ENTRYMAX) {
444 rank0 = rank;
448 for (rank = 1; t1->points != 0; rank++, t1 = t1->tt_next)
687 int rank; local in function:prscore
[all...] |
| /src/games/rogue/ |
| score.c | 212 * bytes 0-1 Rank (" 1" to "10")
310 write_score_entry(const struct score_entry *se, int rank, FILE *fp)
321 rank+1, se->gold, se->username, se->death);
338 short i, rank=-1, found_player = -1, numscores = 0; local in function:put_scores
390 rank = numscores;
395 rank = i;
400 if (rank < NUM_SCORE_ENTRIES) {
402 for (i = numscores; i > rank; i--) {
408 make_score(&scores[rank], monster, other);
428 mvaddstr(8, 0, "Rank Score Name")
[all...] |
| /src/usr.sbin/lpr/common_source/ |
| displayq.c | 80 static int rank; /* order to be printed (-1=none, 0=active) */ variable in typeref:typename:int
83 static const char head0[] = "Rank Owner Job Files";
105 rank = -1;
313 if (rank < 0)
314 rank = 0;
316 rank++;
328 prank(rank);
333 prank(rank);
463 * Print the job's rank in the queue,
|
| /src/games/canfield/canfield/ |
| canfield.c | 147 int rank; member in struct:cardtype
519 cards[i].rank = r;
568 if (cp->rank != 10)
572 switch (cp->rank) {
575 printw("%d", cp->rank);
644 if ((*cp)->rank == basecard->rank) {
755 printw("Rank");
820 * function to see if the rank of one card is less than another
825 if (cp2->rank == Ace
[all...] |
| /src/usr.bin/xlint/common/ |
| inittyp.c | 72 #define typeinfo(name, signed_type, unsigned_type, size_in_bits, rank, c) \
|
| /src/common/dist/zlib/ |
| trees.c | 835 int rank; /* index in bl_order */ local in function:send_all_trees
844 for (rank = 0; rank < blcodes; rank++) {
845 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
846 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
|
| /src/usr.sbin/rpc.pcnfsd/ |
| pcnfsd_print.c | 634 ** first record to determine if we should count it as rank 0 or rank 1,
723 char *rank; local in function:build_pr_queue
751 if (!strncasecmp(buff, "rank", 4))
766 rank = cp;
791 curr->position = atoi(rank); /* active -> 0 */
794 curr->status = strdup(rank);
|
| /src/sys/net/ |
| zlib.c | 2929 int rank; /* index in bl_order */ local in function:send_all_trees
2938 for (rank = 0; rank < blcodes; rank++) {
2939 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
2940 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
|
