robots/score.c

   1 /*
   2  * Copyright (c) 1980 Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #ifndef lint
  35 /*static char sccsid[] = "from: @(#)score.c     5.6 (Berkeley) 6/1/90";*/
  36 static char rcsid[] = "$Id: score.c,v 1.2 1993/08/01 18:52:38 mycroft Exp $";
  37 #endif /* not lint */
  38
  39 # include       "robots.h"
  40 # include       <sys/types.h>
  41 # include       <pwd.h>
  42 # include       "pathnames.h"
  43
  44 typedef struct {
  45         int     s_uid;
  46         int     s_score;
  47         char    s_name[MAXNAME];
  48 } SCORE;
  49
  50 typedef struct passwd   PASSWD;
  51
  52 char    *Scorefile = _PATH_SCORE;
  53
  54 int     Max_per_uid = MAX_PER_UID;
  55
  56 static SCORE    Top[MAXSCORES];
  57
  58 /*
  59  * score:
  60  *      Post the player's score, if reasonable, and then print out the
  61  *      top list.
  62  */
  63 score()
  64 {
  65         register int    inf;
  66         register SCORE  *scp;
  67         register int    uid;
  68         register bool   done_show = FALSE;
  69         static int      numscores, max_uid;
  70
  71         Newscore = FALSE;
  72         if ((inf = open(Scorefile, 2)) < 0) {
  73                 perror(Scorefile);
  74                 return;
  75         }
  76
  77         if (read(inf, &max_uid, sizeof max_uid) == sizeof max_uid)
  78                 read(inf, Top, sizeof Top);
  79         else {
  80                 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
  81                         scp->s_score = -1;
  82                 max_uid = Max_per_uid;
  83         }
  84
  85         uid = getuid();
  86         if (Top[MAXSCORES-1].s_score <= Score) {
  87                 numscores = 0;
  88                 for (scp = Top; scp < &Top[MAXSCORES]; scp++)
  89                         if (scp->s_score < 0 ||
  90                             (scp->s_uid == uid && ++numscores == max_uid)) {
  91                                 if (scp->s_score > Score)
  92                                         break;
  93                                 scp->s_score = Score;
  94                                 scp->s_uid = uid;
  95                                 set_name(scp);
  96                                 Newscore = TRUE;
  97                                 break;
  98                         }
  99                 if (scp == &Top[MAXSCORES]) {
 100                         Top[MAXSCORES-1].s_score = Score;
 101                         Top[MAXSCORES-1].s_uid = uid;
 102                         set_name(&Top[MAXSCORES-1]);
 103                         Newscore = TRUE;
 104                 }
 105                 if (Newscore)
 106                         qsort(Top, MAXSCORES, sizeof Top[0], cmp_sc);
 107         }
 108
 109         if (!Newscore) {
 110                 Full_clear = FALSE;
 111                 close(inf);
 112                 return;
 113         }
 114         else
 115                 Full_clear = TRUE;
 116
 117         for (scp = Top; scp < &Top[MAXSCORES]; scp++) {
 118                 if (scp->s_score < 0)
 119                         break;
 120                 move((scp - Top) + 1, 15);
 121                 if (!done_show && scp->s_uid == uid && scp->s_score == Score)
 122                         standout();
 123                 printw(" %d\t%d\t%-8.8s ", (scp - Top) + 1, scp->s_score, scp->s_name);
 124                 if (!done_show && scp->s_uid == uid && scp->s_score == Score) {
 125                         standend();
 126                         done_show = TRUE;
 127                 }
 128         }
 129         Num_scores = scp - Top;
 130         refresh();
 131
 132         if (Newscore) {
 133                 lseek(inf, 0L, 0);
 134                 write(inf, &max_uid, sizeof max_uid);
 135                 write(inf, Top, sizeof Top);
 136         }
 137         close(inf);
 138 }
 139
 140 set_name(scp)
 141 register SCORE  *scp;
 142 {
 143         register PASSWD *pp;
 144
 145         if ((pp = getpwuid(scp->s_uid)) == NULL)
 146                 pp->pw_name = "???";
 147         strncpy(scp->s_name, pp->pw_name, MAXNAME);
 148 }
 149
 150 /*
 151  * cmp_sc:
 152  *      Compare two scores.
 153  */
 154 cmp_sc(s1, s2)
 155 register SCORE  *s1, *s2;
 156 {
 157         return s2->s_score - s1->s_score;
 158 }
 159
 160 /*
 161  * show_score:
 162  *      Show the score list for the '-s' option.
 163  */
 164 show_score()
 165 {
 166         register SCORE  *scp;
 167         register int    inf;
 168         static int      max_score;
 169
 170         if ((inf = open(Scorefile, 0)) < 0) {
 171                 perror(Scorefile);
 172                 return;
 173         }
 174
 175         for (scp = Top; scp < &Top[MAXSCORES]; scp++)
 176                 scp->s_score = -1;
 177
 178         read(inf, &max_score, sizeof max_score);
 179         read(inf, Top, sizeof Top);
 180         close(inf);
 181         inf = 1;
 182         for (scp = Top; scp < &Top[MAXSCORES]; scp++)
 183                 if (scp->s_score >= 0)
 184                         printf("%d\t%d\t%.*s\n", inf++, scp->s_score, sizeof scp->s_name, scp->s_name);
 185 }