Negative exit code cleanup: Replace exit(-x) with exit(x).

[bsdgames-darwin.git] / cribbage / support.c

diff --git a/cribbage/support.c b/cribbage/support.c
index a2064a213b7d574f9d9d59f3edee4f1124d86a67..2f3c076a95ed69b098db3576607ae96f8e1195b1 100644 (file)
--- a/cribbage/support.c
+++ b/cribbage/support.c
@@ -1,4 +1,4 @@
-/*     $NetBSD: support.c,v 1.3 1995/03/21 15:08:59 cgd Exp $  */
+/*     $NetBSD: support.c,v 1.5 1999/09/08 21:17:47 jsm Exp $  */
 
 /*-
  * Copyright (c) 1980, 1993
@@ -33,11 +33,12 @@
  * SUCH DAMAGE.
  */
 
+#include <sys/cdefs.h>
 #ifndef lint
 #if 0
 static char sccsid[] = "@(#)support.c  8.1 (Berkeley) 5/31/93";
 #else
-static char rcsid[] = "$NetBSD: support.c,v 1.3 1995/03/21 15:08:59 cgd Exp $";
+__RCSID("$NetBSD: support.c,v 1.5 1999/09/08 21:17:47 jsm Exp $");
 #endif
 #endif /* not lint */
 
@@ -51,7 +52,7 @@ static char rcsid[] = "$NetBSD: support.c,v 1.3 1995/03/21 15:08:59 cgd Exp $";
 #define        NTV     10              /* number scores to test */
 
 /* score to test reachability of, and order to test them in */
-int tv[NTV] = {8, 7, 9, 6, 11, 12, 13, 14, 10, 5};
+const int tv[NTV] = {8, 7, 9, 6, 11, 12, 13, 14, 10, 5};
 
 /*
  * computer chooses what to play in pegging...
@@ -59,10 +60,10 @@ int tv[NTV] = {8, 7, 9, 6, 11, 12, 13, 14, 10, 5};
  */
 int
 cchose(h, n, s)
-       CARD h[];
+       const CARD h[];
        int n, s;
 {
-       register int i, j, l;
+       int i, j, l;
 
        if (n <= 1)
                return (0);
@@ -128,12 +129,12 @@ cchose(h, n, s)
  */
 int
 plyrhand(hand, s)
-       CARD    hand[];
-       char   *s;
+       const CARD    hand[];
+       const char   *s;
 {
        static char prompt[BUFSIZ];
-       register int i, j;
-       register BOOLEAN win;
+       int i, j;
+       BOOLEAN win;
 
        prhand(hand, CINHAND, Playwin, FALSE);
        (void) sprintf(prompt, "Your %s scores ", s);
@@ -164,10 +165,10 @@ plyrhand(hand, s)
  */
 int
 comphand(h, s)
-       CARD h[];
-       char *s;
+       const CARD h[];
+       const char *s;
 {
-       register int j;
+       int j;
 
        j = scorehand(h, turnover, CINHAND, strcmp(s, "crib") == 0, FALSE);
        prhand(h, CINHAND, Compwin, FALSE);
@@ -190,8 +191,8 @@ chkscr(scr, inc)
 
        myturn = (scr == &cscore);
        if (inc != 0) {
-               prpeg(Lastscore[myturn], '.', myturn);
-               Lastscore[myturn] = *scr;
+               prpeg(Lastscore[(int)myturn], '.', myturn);
+               Lastscore[(int)myturn] = *scr;
                *scr += inc;
                prpeg(*scr, PEG, myturn);
                refresh();
@@ -206,11 +207,11 @@ chkscr(scr, inc)
  */
 void
 prpeg(score, peg, myturn)
-       register int score;
+       int score;
        int peg;
        BOOLEAN myturn;
 {
-       register int y, x;
+       int y, x;
 
        if (!myturn)
                y = SCORE_Y + 2;
@@ -248,7 +249,7 @@ cdiscard(mycrib)
        BOOLEAN mycrib;
 {
        CARD    d[CARDS], h[FULLHAND], cb[2];
-       register int i, j, k;
+       int i, j, k;
        int     nc, ns;
        long    sums[15];
        static int undo1[15] = {0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4};
@@ -298,10 +299,10 @@ cdiscard(mycrib)
  */
 int
 anymove(hand, n, sum)
-       CARD hand[];
+       const CARD hand[];
        int n, sum;
 {
-       register int i, j;
+       int i, j;
 
        if (n < 1)
                return (FALSE);
@@ -319,10 +320,10 @@ anymove(hand, n, sum)
  */
 int
 anysumto(hand, n, s, t)
-       CARD hand[];
+       const CARD hand[];
        int n, s, t;
 {
-       register int i;
+       int i;
 
        for (i = 0; i < n; i++) {
                if (s + VAL(hand[i].rank) == t)
@@ -336,10 +337,10 @@ anysumto(hand, n, s, t)
  */
 int
 numofval(h, n, v)
-       CARD h[];
+       const CARD h[];
        int n, v;
 {
-       register int i, j;
+       int i, j;
 
        j = 0;
        for (i = 0; i < n; i++) {
@@ -354,10 +355,10 @@ numofval(h, n, v)
  */
 void
 makeknown(h, n)
-       CARD h[];
+       const CARD h[];
        int n;
 {
-       register int i;
+       int i;
 
        for (i = 0; i < n; i++)
                known[knownum++] = h[i];