snake/snscore/snscore.c

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