sail/pl_6.c

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