snscore.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131
  1. /* $NetBSD: snscore.c,v 1.15 2004/01/27 20:30:30 jsm Exp $ */
  2. /*
  3. * Copyright (c) 1980, 1993
  4. * The Regents of the University of California. All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions
  8. * are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the University nor the names of its contributors
  15. * may be used to endorse or promote products derived from this software
  16. * without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  20. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  21. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  22. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  23. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  24. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  25. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  26. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  27. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  28. * SUCH DAMAGE.
  29. */
  30. #include <sys/cdefs.h>
  31. #ifndef lint
  32. __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
  33. The Regents of the University of California. All rights reserved.\n");
  34. #endif /* not lint */
  35. #ifndef lint
  36. #if 0
  37. static char sccsid[] = "@(#)snscore.c 8.1 (Berkeley) 7/19/93";
  38. #else
  39. __RCSID("$NetBSD: snscore.c,v 1.15 2004/01/27 20:30:30 jsm Exp $");
  40. #endif
  41. #endif /* not lint */
  42. #include <sys/types.h>
  43. #include <err.h>
  44. #include <pwd.h>
  45. #include <stdio.h>
  46. #include <stdlib.h>
  47. #include <string.h>
  48. #include <unistd.h>
  49. #include "pathnames.h"
  50. const char *recfile = _PATH_RAWSCORES;
  51. #define MAXPLAYERS 65534
  52. struct player {
  53. short uids;
  54. short scores;
  55. char *name;
  56. } players[MAXPLAYERS], temp;
  57. int main(void);
  58. int
  59. main()
  60. {
  61. short uid, score;
  62. FILE *fd;
  63. int noplayers;
  64. int i, j, notsorted;
  65. short whoallbest, allbest;
  66. const char *q;
  67. struct passwd *p;
  68. /* Revoke setgid privileges */
  69. setregid(getgid(), getgid());
  70. fd = fopen(recfile, "r");
  71. if (fd == NULL)
  72. err(1, "opening `%s'", recfile);
  73. printf("Snake players scores to date\n");
  74. if (fread(&whoallbest, sizeof(short), 1, fd) == 0) {
  75. printf("No scores recorded yet!\n");
  76. exit(0);
  77. }
  78. fread(&allbest, sizeof(short), 1, fd);
  79. noplayers = 0;
  80. for (uid = 2; ;uid++) {
  81. if(fread(&score, sizeof(short), 1, fd) == 0)
  82. break;
  83. if (score > 0) {
  84. if (noplayers > MAXPLAYERS) {
  85. printf("too many players: %d\n", noplayers);
  86. exit(2);
  87. }
  88. players[noplayers].uids = uid;
  89. players[noplayers].scores = score;
  90. p = getpwuid(uid);
  91. if (p == NULL)
  92. continue;
  93. q = p -> pw_name;
  94. players[noplayers].name = strdup(q);
  95. if (players[noplayers].name == NULL)
  96. err(1, NULL);
  97. noplayers++;
  98. }
  99. }
  100. /* bubble sort scores */
  101. for (notsorted = 1; notsorted; ) {
  102. notsorted = 0;
  103. for (i = 0; i < noplayers - 1; i++)
  104. if (players[i].scores < players[i + 1].scores) {
  105. temp = players[i];
  106. players[i] = players[i + 1];
  107. players[i + 1] = temp;
  108. notsorted++;
  109. }
  110. }
  111. j = 1;
  112. for (i = 0; i < noplayers; i++) {
  113. printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
  114. if (players[i].scores > players[i + 1].scores)
  115. j = i + 2;
  116. }
  117. exit(0);
  118. }