Lines Matching defs:rank
328 int rank, rank0 = -1, rank1 = 0;
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) {
457 if (rank > (int)flags.end_top &&
458 (rank < rank0 - (int)flags.end_around || rank > rank0 + (int)flags.end_around)
466 if (rank == rank0 - (int)flags.end_around &&
470 if (rank != rank0)
471 (void) outentry(rank, t1, 0);
473 (void) outentry(rank, t1, 1);
476 int t1lth = outentry(rank, t1, t0lth);
482 if (rank0 >= rank)
506 outentry(int rank, struct toptenentry *t1, int so)
515 if (rank)
516 Snprintf(linebuf+pos, sizeof(linebuf)-pos, "%3d", rank);
687 int rank;
738 for (rank = 1;; rank++) {
758 (digit(players[i][0]) && rank <= atoi(players[i])))
782 for (rank = 1; t1->points != 0; rank++, t1 = t2) {
795 (digit(players[i][0]) && rank <= atoi(players[i]))) {
798 (void) outentry(rank, t1, 0);