198 lines
4.5 KiB
C
198 lines
4.5 KiB
C
/* $NetBSD: pl_6.c,v 1.14 2009/03/15 03:33:56 dholland Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1983, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* 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. 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.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)pl_6.c 8.1 (Berkeley) 5/31/93";
|
|
#else
|
|
__RCSID("$NetBSD: pl_6.c,v 1.14 2009/03/15 03:33:56 dholland Exp $");
|
|
#endif
|
|
#endif /* not lint */
|
|
|
|
#include <signal.h>
|
|
#include "extern.h"
|
|
#include "player.h"
|
|
|
|
static int turned(void);
|
|
|
|
void
|
|
repair(void)
|
|
{
|
|
char c;
|
|
char *repairs;
|
|
struct shipspecs *ptr = mc;
|
|
int count;
|
|
|
|
#define FIX(x, m) (m - ptr->x > count \
|
|
? (ptr->x += count, count = 0) : (count -= m - ptr->x, ptr->x = m))
|
|
|
|
if (repaired || loaded || fired || changed || turned()) {
|
|
Msg("No hands free to repair");
|
|
return;
|
|
}
|
|
c = sgetch("Repair (hull, guns, rigging)? ", (struct ship *)0, 1);
|
|
switch (c) {
|
|
case 'h':
|
|
repairs = &mf->RH;
|
|
break;
|
|
case 'g':
|
|
repairs = &mf->RG;
|
|
break;
|
|
case 'r':
|
|
repairs = &mf->RR;
|
|
break;
|
|
default:
|
|
Msg("Avast heaving!");
|
|
return;
|
|
}
|
|
if (++*repairs >= 3) {
|
|
count = 2;
|
|
switch (c) {
|
|
case 'h': {
|
|
int max = ptr->guns/4;
|
|
if (ptr->hull < max) {
|
|
FIX(hull, max);
|
|
send_hull(ms, ptr->hull);
|
|
}
|
|
break;
|
|
}
|
|
case 'g':
|
|
if (ptr->gunL < ptr->gunR) {
|
|
int max = ptr->guns/5 - ptr->carL;
|
|
if (ptr->gunL < max) {
|
|
FIX(gunL, max);
|
|
send_gunl(ms, ptr->gunL, ptr->carL);
|
|
}
|
|
} else {
|
|
int max = ptr->guns/5 - ptr->carR;
|
|
if (ptr->gunR < max) {
|
|
FIX(gunR, max);
|
|
send_gunr(ms, ptr->gunR, ptr->carR);
|
|
}
|
|
}
|
|
break;
|
|
case 'r':
|
|
#define X 2
|
|
if (ptr->rig4 >= 0 && ptr->rig4 < X) {
|
|
FIX(rig4, X);
|
|
send_rig4(ms, ptr->rig4);
|
|
}
|
|
if (count && ptr->rig3 < X) {
|
|
FIX(rig3, X);
|
|
send_rig3(ms, ptr->rig3);
|
|
}
|
|
if (count && ptr->rig2 < X) {
|
|
FIX(rig2, X);
|
|
send_rig2(ms, ptr->rig2);
|
|
}
|
|
if (count && ptr->rig1 < X) {
|
|
FIX(rig1, X);
|
|
send_rig1(ms, ptr->rig1);
|
|
}
|
|
break;
|
|
}
|
|
if (count == 2) {
|
|
Msg("Repairs completed.");
|
|
*repairs = 2;
|
|
} else {
|
|
*repairs = 0;
|
|
}
|
|
}
|
|
repaired = 1;
|
|
}
|
|
|
|
static int
|
|
turned(void)
|
|
{
|
|
char *p;
|
|
|
|
for (p = movebuf; *p; p++)
|
|
if (*p == 'r' || *p == 'l')
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
loadplayer(void)
|
|
{
|
|
char c;
|
|
int loadL, loadR, ready, load;
|
|
|
|
if (!mc->crew3) {
|
|
Msg("Out of crew");
|
|
return;
|
|
}
|
|
loadL = mf->loadL;
|
|
loadR = mf->loadR;
|
|
if (!loadL && !loadR) {
|
|
c = sgetch("Load which broadside (left or right)? ",
|
|
(struct ship *)0, 1);
|
|
if (c == 'r')
|
|
loadL = 1;
|
|
else
|
|
loadR = 1;
|
|
}
|
|
if ((!loadL && loadR) || (loadL && !loadR)) {
|
|
c = sgetch("Reload with (round, double, chain, grape)? ",
|
|
(struct ship *)0, 1);
|
|
switch (c) {
|
|
case 'r':
|
|
load = L_ROUND;
|
|
ready = 0;
|
|
break;
|
|
case 'd':
|
|
load = L_DOUBLE;
|
|
ready = R_DOUBLE;
|
|
break;
|
|
case 'c':
|
|
load = L_CHAIN;
|
|
ready = 0;
|
|
break;
|
|
case 'g':
|
|
load = L_GRAPE;
|
|
ready = 0;
|
|
break;
|
|
default:
|
|
Msg("Broadside not loaded.");
|
|
return;
|
|
}
|
|
if (!loadR) {
|
|
mf->loadR = load;
|
|
mf->readyR = ready|R_LOADING;
|
|
} else {
|
|
mf->loadL = load;
|
|
mf->readyL = ready|R_LOADING;
|
|
}
|
|
loaded = 1;
|
|
}
|
|
}
|