monop/misc.c

   1 /*      $NetBSD: misc.c,v 1.4 1995/03/23 08:34:47 cgd 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 #ifndef lint
  37 #if 0
  38 static char sccsid[] = "@(#)misc.c      8.1 (Berkeley) 5/31/93";
  39 #else
  40 static char rcsid[] = "$NetBSD: misc.c,v 1.4 1995/03/23 08:34:47 cgd Exp $";
  41 #endif
  42 #endif /* not lint */
  43
  44 # include       "monop.ext"
  45 # include       <ctype.h>
  46 # include       <signal.h>
  47
  48 /*
  49  *      This routine executes a truncated set of commands until a
  50  * "yes or "no" answer is gotten.
  51  */
  52 getyn(prompt)
  53 reg char        *prompt; {
  54
  55         reg int com;
  56
  57         for (;;)
  58                 if ((com=getinp(prompt, yn)) < 2)
  59                         return com;
  60                 else
  61                         (*func[com-2])();
  62 }
  63 /*
  64  *      This routine tells the player if he's out of money.
  65  */
  66 notify() {
  67
  68         if (cur_p->money < 0)
  69                 printf("That leaves you $%d in debt\n", -cur_p->money);
  70         else if (cur_p->money == 0)
  71                 printf("that leaves you broke\n");
  72         else if (fixing && !told_em && cur_p->money > 0) {
  73                 printf("-- You are now Solvent ---\n");
  74                 told_em = TRUE;
  75         }
  76 }
  77 /*
  78  *      This routine switches to the next player
  79  */
  80 next_play() {
  81
  82         player = ++player % num_play;
  83         cur_p = &play[player];
  84         num_doub = 0;
  85 }
  86 /*
  87  *      This routine gets an integer from the keyboard after the
  88  * given prompt.
  89  */
  90 get_int(prompt)
  91 reg char        *prompt; {
  92
  93         reg int         num;
  94         reg char        *sp;
  95         char            buf[257];
  96
  97         for (;;) {
  98 inter:
  99                 printf(prompt);
 100                 num = 0;
 101                 for (sp = buf; (*sp=getchar()) != '\n'; sp++)
 102                         if (*sp == -1)  /* check for interrupted system call */
 103                                 goto inter;
 104                 if (sp == buf)
 105                         continue;
 106                 for (sp = buf; isspace(*sp); sp++)
 107                         continue;
 108                 for (; isdigit(*sp); sp++)
 109                         num = num * 10 + *sp - '0';
 110                 if (*sp == '\n')
 111                         return num;
 112                 else
 113                         printf("I can't understand that\n");
 114         }
 115 }
 116 /*
 117  *      This routine sets the monopoly flag from the list given.
 118  */
 119 set_ownlist(pl)
 120 int     pl; {
 121
 122         reg int num;            /* general counter              */
 123         reg MON *orig;          /* remember starting monop ptr  */
 124         reg OWN *op;            /* current owned prop           */
 125         OWN     *orig_op;               /* origianl prop before loop    */
 126
 127         op = play[pl].own_list;
 128 #ifdef DEBUG
 129         printf("op [%d] = play[pl [%d] ].own_list;\n", op, pl);
 130 #endif
 131         while (op) {
 132 #ifdef DEBUG
 133                 printf("op->sqr->type = %d\n", op->sqr->type);
 134 #endif
 135                 switch (op->sqr->type) {
 136                   case UTIL:
 137 #ifdef DEBUG
 138                         printf("  case UTIL:\n");
 139 #endif
 140                         for (num = 0; op && op->sqr->type == UTIL; op = op->next)
 141                                 num++;
 142                         play[pl].num_util = num;
 143 #ifdef DEBUG
 144                         printf("play[pl].num_util = num [%d];\n", num);
 145 #endif
 146                         break;
 147                   case RR:
 148 #ifdef DEBUG
 149                         printf("  case RR:\n");
 150 #endif
 151                         for (num = 0; op && op->sqr->type == RR; op = op->next) {
 152 #ifdef DEBUG
 153                                 printf("iter: %d\n", num);
 154                                 printf("op = %d, op->sqr = %d, op->sqr->type = %d\n", op, op->sqr, op->sqr->type);
 155 #endif
 156                                 num++;
 157                         }
 158                         play[pl].num_rr = num;
 159 #ifdef DEBUG
 160                         printf("play[pl].num_rr = num [%d];\n", num);
 161 #endif
 162                         break;
 163                   case PRPTY:
 164 #ifdef DEBUG
 165                         printf("  case PRPTY:\n");
 166 #endif
 167                         orig = op->sqr->desc->mon_desc;
 168                         orig_op = op;
 169                         num = 0;
 170                         while (op && op->sqr->desc->mon_desc == orig) {
 171 #ifdef DEBUG
 172                                 printf("iter: %d\n", num);
 173 #endif
 174                                 num++;
 175 #ifdef DEBUG
 176                                 printf("op = op->next ");
 177 #endif
 178                                 op = op->next;
 179 #ifdef DEBUG
 180                                 printf("[%d];\n", op);
 181 #endif
 182                         }
 183 #ifdef DEBUG
 184                         printf("num = %d\n");
 185 #endif
 186                         if (orig == 0) {
 187                                 printf("panic:  bad monopoly descriptor: orig = %d\n", orig);
 188                                 printf("player # %d\n", pl+1);
 189                                 printhold(pl);
 190                                 printf("orig_op = %d\n", orig_op);
 191                                 printf("orig_op->sqr->type = %d (PRPTY)\n", op->sqr->type);
 192                                 printf("orig_op->next = %d\n", op->next);
 193                                 printf("orig_op->sqr->desc = %d\n", op->sqr->desc);
 194                                 printf("op = %d\n", op);
 195                                 printf("op->sqr->type = %d (PRPTY)\n", op->sqr->type);
 196                                 printf("op->next = %d\n", op->next);
 197                                 printf("op->sqr->desc = %d\n", op->sqr->desc);
 198                                 printf("num = %d\n", num);
 199                         }
 200 #ifdef DEBUG
 201                         printf("orig->num_in = %d\n", orig->num_in);
 202 #endif
 203                         if (num == orig->num_in)
 204                                 is_monop(orig, pl);
 205                         else
 206                                 isnot_monop(orig);
 207                         break;
 208                 }
 209         }
 210 }
 211 /*
 212  *      This routine sets things up as if it is a new monopoly
 213  */
 214 is_monop(mp, pl)
 215 reg MON *mp;
 216 int     pl; {
 217
 218         reg char        *sp;
 219         reg int         i;
 220
 221         mp->owner = pl;
 222         mp->num_own = mp->num_in;
 223         for (i = 0; i < mp->num_in; i++)
 224                 mp->sq[i]->desc->monop = TRUE;
 225         mp->name = mp->mon_n;
 226 }
 227 /*
 228  *      This routine sets things up as if it is no longer a monopoly
 229  */
 230 isnot_monop(mp)
 231 reg MON *mp; {
 232
 233         reg char        *sp;
 234         reg int         i;
 235
 236         mp->owner = -1;
 237         for (i = 0; i < mp->num_in; i++)
 238                 mp->sq[i]->desc->monop = FALSE;
 239         mp->name = mp->not_m;
 240 }
 241 /*
 242  *      This routine gives a list of the current player's routine
 243  */
 244 list() {
 245
 246         printhold(player);
 247 }
 248 /*
 249  *      This routine gives a list of a given players holdings
 250  */
 251 list_all() {
 252
 253         reg int pl;
 254
 255         while ((pl=getinp("Whose holdings do you want to see? ", name_list)) < num_play)
 256                 printhold(pl);
 257 }
 258 /*
 259  *      This routine gives the players a chance before it exits.
 260  */
 261 void
 262 quit() {
 263
 264         putchar('\n');
 265         if (getyn("Do you all really want to quit? ", yn) == 0)
 266                 exit(0);
 267         signal(SIGINT, quit);
 268 }
 269 /*
 270  *      This routine copies one structure to another
 271  */
 272 cpy_st(s1, s2, size)
 273 reg int *s1, *s2, size; {
 274
 275         size /= 2;
 276         while (size--)
 277                 *s1++ = *s2++;
 278 }