BSD 4_4 release

[unix-history] / usr / src / games / snake / snscore / snscore.c

diff --git a/usr/src/games/snake/snscore/snscore.c b/usr/src/games/snake/snscore/snscore.c
index e0cb72f..1590404 100644 (file)
--- a/usr/src/games/snake/snscore/snscore.c
+++ b/usr/src/games/snake/snscore/snscore.c
@@ -1,52 +1,64 @@
 /*
 /*

- * Copyright (c) 1980 Regents of the University of California.
- * All rights reserved.
+ * Copyright (c) 1980, 1993
+ *     The Regents of the University of California.  All rights reserved.

  *
  *

- * Redistribution and use in source and binary forms are permitted
- * provided that: (1) source distributions retain this entire copyright
- * notice and comment, and (2) distributions including binaries display
- * the following acknowledgement:  ``This product includes software
- * developed by the University of California, Berkeley and its contributors''
- * in the documentation or other materials provided with the distribution
- * and in all advertising materials mentioning features or use of this
- * software. Neither the name of the University nor the names of its
- * contributors may be used to endorse or promote products derived
- * from this software without specific prior written permission.
- * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *     This product includes software developed by the University of
+ *     California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.

  */
 
 #ifndef lint
  */
 
 #ifndef lint

-char copyright[] =
-"@(#) Copyright (c) 1980 Regents of the University of California.\n\
- All rights reserved.\n";
+static char copyright[] =
+"@(#) Copyright (c) 1980, 1993\n\
+       The Regents of the University of California.  All rights reserved.\n";

 #endif /* not lint */
 
 #ifndef lint
 #endif /* not lint */
 
 #ifndef lint

-static char sccsid[] = "@(#)snscore.c  5.5 (Berkeley) 6/1/90";
+static char sccsid[] = "@(#)snscore.c  8.1 (Berkeley) 7/19/93";

 #endif /* not lint */
 
 #endif /* not lint */
 

-#include <stdio.h>

 #include <sys/types.h>
 #include <pwd.h>
 #include <sys/types.h>
 #include <pwd.h>

+#include <stdio.h>
+#include <stdlib.h>

 #include "pathnames.h"
 
 char *recfile = _PATH_RAWSCORES;
 #define MAXPLAYERS 256
 
 #include "pathnames.h"
 
 char *recfile = _PATH_RAWSCORES;
 #define MAXPLAYERS 256
 

-struct passwd  *getpwuid();
-char   *malloc();
-

 struct player  {
        short   uids;
        short   scores;
        char    *name;
 } players[MAXPLAYERS], temp;
 
 struct player  {
        short   uids;
        short   scores;
        char    *name;
 } players[MAXPLAYERS], temp;
 

+int

 main()
 {
 main()
 {

-       char    buf[80], cp;

        short   uid, score;
        FILE    *fd;
        int     noplayers;
        short   uid, score;
        FILE    *fd;
        int     noplayers;


@@ -63,7 +75,8 @@ main()
        printf("Snake players scores to date\n");
        fread(&whoallbest, sizeof(short), 1, fd);
        fread(&allbest, sizeof(short), 1, fd);
        printf("Snake players scores to date\n");
        fread(&whoallbest, sizeof(short), 1, fd);
        fread(&allbest, sizeof(short), 1, fd);

-       for (uid=2;;uid++) {
+       noplayers = 0;
+       for (uid = 2; ;uid++) {

                if(fread(&score, sizeof(short), 1, fd) == 0)
                        break;
                if (score > 0) {
                if(fread(&score, sizeof(short), 1, fd) == 0)
                        break;
                if (score > 0) {


@@ -77,29 +90,29 @@ main()
                        if (p == NULL)
                                continue;
                        q = p -> pw_name;
                        if (p == NULL)
                                continue;
                        q = p -> pw_name;

-                       players[noplayers].name = malloc(strlen(q)+1);
+                       players[noplayers].name = malloc(strlen(q) + 1);

                        strcpy(players[noplayers].name, q);
                        noplayers++;
                }
        }
 
        /* bubble sort scores */
                        strcpy(players[noplayers].name, q);
                        noplayers++;
                }
        }
 
        /* bubble sort scores */

-       for (notsorted=1; notsorted; ) {
+       for (notsorted = 1; notsorted; ) {

                notsorted = 0;
                notsorted = 0;

-               for (i=0; i<noplayers-1; i++)
-                       if (players[i].scores < players[i+1].scores) {
+               for (i = 0; i < noplayers - 1; i++)
+                       if (players[i].scores < players[i + 1].scores) {

                                temp = players[i];
                                temp = players[i];

-                               players[i] = players[i+1];
-                               players[i+1] = temp;
+                               players[i] = players[i + 1];
+                               players[i + 1] = temp;

                                notsorted++;
                        }
        }
 
        j = 1;
                                notsorted++;
                        }
        }
 
        j = 1;

-       for (i=0; i<noplayers; i++) {
+       for (i = 0; i < noplayers; i++) {

                printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);
                printf("%d:\t$%d\t%s\n", j, players[i].scores, players[i].name);

-               if (players[i].scores > players[i+1].scores)
-                       j = i+2;
+               if (players[i].scores > players[i + 1].scores)
+                       j = i + 2;

        }
        exit(0);
 }
        }
        exit(0);
 }