* Copyright (c) 1983 Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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
static char sccsid
[] = "@(#)pl_6.c 5.4 (Berkeley) 6/1/90";
register struct shipspecs
*ptr
= mc
;
#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()) {
Signal("No hands free to repair", (struct ship
*)0);
c
= sgetch("Repair (hull, guns, rigging)? ", (struct ship
*)0, 1);
Signal("Avast heaving!", (struct ship
*)0);
Write(W_HULL
, ms
, 0, ptr
->hull
, 0, 0, 0);
if (ptr
->gunL
< ptr
->gunR
) {
int max
= ptr
->guns
/5 - ptr
->carL
;
Write(W_GUNL
, ms
, 0, ptr
->gunL
,
int max
= ptr
->guns
/5 - ptr
->carR
;
Write(W_GUNR
, ms
, 0, ptr
->gunR
,
if (ptr
->rig4
>= 0 && ptr
->rig4
< X
) {
Write(W_RIG4
, ms
, 0, ptr
->rig4
, 0, 0, 0);
if (count
&& ptr
->rig3
< X
) {
Write(W_RIG3
, ms
, 0, ptr
->rig3
, 0, 0, 0);
if (count
&& ptr
->rig2
< X
) {
Write(W_RIG2
, ms
, 0, ptr
->rig2
, 0, 0, 0);
if (count
&& ptr
->rig1
< X
) {
Write(W_RIG1
, ms
, 0, ptr
->rig1
, 0, 0, 0);
Signal("Repairs completed.", (struct ship
*)0);
for (p
= movebuf
; *p
; p
++)
if (*p
== 'r' || *p
== 'l')
register loadL
, loadR
, ready
, load
;
Signal("Out of crew", (struct ship
*)0);
c
= sgetch("Load which broadside (left or right)? ",
if (!loadL
&& loadR
|| loadL
&& !loadR
) {
c
= sgetch("Reload with (round, double, chain, grape)? ",
Signal("Broadside not loaded.",
mf
->readyR
= ready
|R_LOADING
;
mf
->readyL
= ready
|R_LOADING
;