HomeSort by: relevance | last modified time | path
    Searched defs:rank (Results 1 - 8 of 8) sorted by relevancy

  /src/games/cribbage/
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
  /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/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/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/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/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/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);

Completed in 20 milliseconds