sail/pl_6.c

   1 /*      $NetBSD: pl_6.c,v 1.3 1995/04/22 10:37:15 cgd Exp $     */
   2
   3 /*
   4  * Copyright (c) 1983, 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[] = "@(#)pl_6.c      8.1 (Berkeley) 5/31/93";
  39 #else
  40 static char rcsid[] = "$NetBSD: pl_6.c,v 1.3 1995/04/22 10:37:15 cgd Exp $";
  41 #endif
  42 #endif /* not lint */
  43
  44 #include "player.h"
  45
  46 repair()
  47 {
  48         char c;
  49         register char *repairs;
  50         register struct shipspecs *ptr = mc;
  51         register int count;
  52
  53 #define FIX(x, m) (m - ptr->x > count \
  54         ? (ptr->x += count, count = 0) : (count -= m - ptr->x, ptr->x = m))
  55
  56         if (repaired || loaded || fired || changed || turned()) {
  57                 Signal("No hands free to repair", (struct ship *)0);
  58                 return;
  59         }
  60         c = sgetch("Repair (hull, guns, rigging)? ", (struct ship *)0, 1);
  61         switch (c) {
  62                 case 'h':
  63                         repairs = &mf->RH;
  64                         break;
  65                 case 'g':
  66                         repairs = &mf->RG;
  67                         break;
  68                 case 'r':
  69                         repairs = &mf->RR;
  70                         break;
  71                 default:
  72                         Signal("Avast heaving!", (struct ship *)0);
  73                         return;
  74         }
  75         if (++*repairs >= 3) {
  76                 count = 2;
  77                 switch (c) {
  78                 case 'h': {
  79                         int max = ptr->guns/4;
  80                         if (ptr->hull < max) {
  81                                 FIX(hull, max);
  82                                 Write(W_HULL, ms, 0, ptr->hull, 0, 0, 0);
  83                         }
  84                         break;
  85                         }
  86                 case 'g':
  87                         if (ptr->gunL < ptr->gunR) {
  88                                 int max = ptr->guns/5 - ptr->carL;
  89                                 if (ptr->gunL < max) {
  90                                         FIX(gunL, max);
  91                                         Write(W_GUNL, ms, 0, ptr->gunL,
  92                                                 ptr->carL, 0, 0);
  93                                 }
  94                         } else {
  95                                 int max = ptr->guns/5 - ptr->carR;
  96                                 if (ptr->gunR < max) {
  97                                         FIX(gunR, max);
  98                                         Write(W_GUNR, ms, 0, ptr->gunR,
  99                                                 ptr->carR, 0, 0);
 100                                 }
 101                         }
 102                         break;
 103                 case 'r':
 104 #define X 2
 105                         if (ptr->rig4 >= 0 && ptr->rig4 < X) {
 106                                 FIX(rig4, X);
 107                                 Write(W_RIG4, ms, 0, ptr->rig4, 0, 0, 0);
 108                         }
 109                         if (count && ptr->rig3 < X) {
 110                                 FIX(rig3, X);
 111                                 Write(W_RIG3, ms, 0, ptr->rig3, 0, 0, 0);
 112                         }
 113                         if (count && ptr->rig2 < X) {
 114                                 FIX(rig2, X);
 115                                 Write(W_RIG2, ms, 0, ptr->rig2, 0, 0, 0);
 116                         }
 117                         if (count && ptr->rig1 < X) {
 118                                 FIX(rig1, X);
 119                                 Write(W_RIG1, ms, 0, ptr->rig1, 0, 0, 0);
 120                         }
 121                         break;
 122                 }
 123                 if (count == 2) {
 124                         Signal("Repairs completed.", (struct ship *)0);
 125                         *repairs = 2;
 126                 } else {
 127                         *repairs = 0;
 128                         blockalarm();
 129                         draw_stat();
 130                         unblockalarm();
 131                 }
 132         }
 133         blockalarm();
 134         draw_slot();
 135         unblockalarm();
 136         repaired = 1;
 137 }
 138
 139 turned()
 140 {
 141         register char *p;
 142
 143         for (p = movebuf; *p; p++)
 144                 if (*p == 'r' || *p == 'l')
 145                         return 1;
 146         return 0;
 147 }
 148
 149 loadplayer()
 150 {
 151         char c;
 152         register loadL, loadR, ready, load;
 153
 154         if (!mc->crew3) {
 155                 Signal("Out of crew", (struct ship *)0);
 156                 return;
 157         }
 158         loadL = mf->loadL;
 159         loadR = mf->loadR;
 160         if (!loadL && !loadR) {
 161                 c = sgetch("Load which broadside (left or right)? ",
 162                         (struct ship *)0, 1);
 163                 if (c == 'r')
 164                         loadL = 1;
 165                 else
 166                         loadR = 1;
 167         }
 168         if (!loadL && loadR || loadL && !loadR) {
 169                 c = sgetch("Reload with (round, double, chain, grape)? ",
 170                         (struct ship *)0, 1);
 171                 switch (c) {
 172                 case 'r':
 173                         load = L_ROUND;
 174                         ready = 0;
 175                         break;
 176                 case 'd':
 177                         load = L_DOUBLE;
 178                         ready = R_DOUBLE;
 179                         break;
 180                 case 'c':
 181                         load = L_CHAIN;
 182                         ready = 0;
 183                         break;
 184                 case 'g':
 185                         load = L_GRAPE;
 186                         ready = 0;
 187                         break;
 188                 default:
 189                         Signal("Broadside not loaded.",
 190                                 (struct ship *)0);
 191                         return;
 192                 }
 193                 if (!loadR) {
 194                         mf->loadR = load;
 195                         mf->readyR = ready|R_LOADING;
 196                 } else {
 197                         mf->loadL = load;
 198                         mf->readyL = ready|R_LOADING;
 199                 }
 200                 loaded = 1;
 201         }
 202 }