pl_6.c revision 1.3 1 1.3 cgd /* $NetBSD: pl_6.c,v 1.3 1995/04/22 10:37:15 cgd Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1983, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #ifndef lint
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)pl_6.c 8.1 (Berkeley) 5/31/93";
39 1.3 cgd #else
40 1.3 cgd static char rcsid[] = "$NetBSD: pl_6.c,v 1.3 1995/04/22 10:37:15 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif /* not lint */
43 1.1 cgd
44 1.1 cgd #include "player.h"
45 1.1 cgd
46 1.1 cgd repair()
47 1.1 cgd {
48 1.1 cgd char c;
49 1.1 cgd register char *repairs;
50 1.1 cgd register struct shipspecs *ptr = mc;
51 1.1 cgd register int count;
52 1.1 cgd
53 1.1 cgd #define FIX(x, m) (m - ptr->x > count \
54 1.1 cgd ? (ptr->x += count, count = 0) : (count -= m - ptr->x, ptr->x = m))
55 1.1 cgd
56 1.1 cgd if (repaired || loaded || fired || changed || turned()) {
57 1.1 cgd Signal("No hands free to repair", (struct ship *)0);
58 1.1 cgd return;
59 1.1 cgd }
60 1.1 cgd c = sgetch("Repair (hull, guns, rigging)? ", (struct ship *)0, 1);
61 1.1 cgd switch (c) {
62 1.1 cgd case 'h':
63 1.1 cgd repairs = &mf->RH;
64 1.1 cgd break;
65 1.1 cgd case 'g':
66 1.1 cgd repairs = &mf->RG;
67 1.1 cgd break;
68 1.1 cgd case 'r':
69 1.1 cgd repairs = &mf->RR;
70 1.1 cgd break;
71 1.1 cgd default:
72 1.1 cgd Signal("Avast heaving!", (struct ship *)0);
73 1.1 cgd return;
74 1.1 cgd }
75 1.1 cgd if (++*repairs >= 3) {
76 1.1 cgd count = 2;
77 1.1 cgd switch (c) {
78 1.1 cgd case 'h': {
79 1.1 cgd int max = ptr->guns/4;
80 1.1 cgd if (ptr->hull < max) {
81 1.1 cgd FIX(hull, max);
82 1.1 cgd Write(W_HULL, ms, 0, ptr->hull, 0, 0, 0);
83 1.1 cgd }
84 1.1 cgd break;
85 1.1 cgd }
86 1.1 cgd case 'g':
87 1.1 cgd if (ptr->gunL < ptr->gunR) {
88 1.1 cgd int max = ptr->guns/5 - ptr->carL;
89 1.1 cgd if (ptr->gunL < max) {
90 1.1 cgd FIX(gunL, max);
91 1.1 cgd Write(W_GUNL, ms, 0, ptr->gunL,
92 1.1 cgd ptr->carL, 0, 0);
93 1.1 cgd }
94 1.1 cgd } else {
95 1.1 cgd int max = ptr->guns/5 - ptr->carR;
96 1.1 cgd if (ptr->gunR < max) {
97 1.1 cgd FIX(gunR, max);
98 1.1 cgd Write(W_GUNR, ms, 0, ptr->gunR,
99 1.1 cgd ptr->carR, 0, 0);
100 1.1 cgd }
101 1.1 cgd }
102 1.1 cgd break;
103 1.1 cgd case 'r':
104 1.1 cgd #define X 2
105 1.1 cgd if (ptr->rig4 >= 0 && ptr->rig4 < X) {
106 1.1 cgd FIX(rig4, X);
107 1.1 cgd Write(W_RIG4, ms, 0, ptr->rig4, 0, 0, 0);
108 1.1 cgd }
109 1.1 cgd if (count && ptr->rig3 < X) {
110 1.1 cgd FIX(rig3, X);
111 1.1 cgd Write(W_RIG3, ms, 0, ptr->rig3, 0, 0, 0);
112 1.1 cgd }
113 1.1 cgd if (count && ptr->rig2 < X) {
114 1.1 cgd FIX(rig2, X);
115 1.1 cgd Write(W_RIG2, ms, 0, ptr->rig2, 0, 0, 0);
116 1.1 cgd }
117 1.1 cgd if (count && ptr->rig1 < X) {
118 1.1 cgd FIX(rig1, X);
119 1.1 cgd Write(W_RIG1, ms, 0, ptr->rig1, 0, 0, 0);
120 1.1 cgd }
121 1.1 cgd break;
122 1.1 cgd }
123 1.1 cgd if (count == 2) {
124 1.1 cgd Signal("Repairs completed.", (struct ship *)0);
125 1.1 cgd *repairs = 2;
126 1.1 cgd } else {
127 1.1 cgd *repairs = 0;
128 1.1 cgd blockalarm();
129 1.1 cgd draw_stat();
130 1.1 cgd unblockalarm();
131 1.1 cgd }
132 1.1 cgd }
133 1.1 cgd blockalarm();
134 1.1 cgd draw_slot();
135 1.1 cgd unblockalarm();
136 1.1 cgd repaired = 1;
137 1.1 cgd }
138 1.1 cgd
139 1.1 cgd turned()
140 1.1 cgd {
141 1.1 cgd register char *p;
142 1.1 cgd
143 1.1 cgd for (p = movebuf; *p; p++)
144 1.1 cgd if (*p == 'r' || *p == 'l')
145 1.1 cgd return 1;
146 1.1 cgd return 0;
147 1.1 cgd }
148 1.1 cgd
149 1.1 cgd loadplayer()
150 1.1 cgd {
151 1.1 cgd char c;
152 1.1 cgd register loadL, loadR, ready, load;
153 1.1 cgd
154 1.1 cgd if (!mc->crew3) {
155 1.1 cgd Signal("Out of crew", (struct ship *)0);
156 1.1 cgd return;
157 1.1 cgd }
158 1.1 cgd loadL = mf->loadL;
159 1.1 cgd loadR = mf->loadR;
160 1.1 cgd if (!loadL && !loadR) {
161 1.1 cgd c = sgetch("Load which broadside (left or right)? ",
162 1.1 cgd (struct ship *)0, 1);
163 1.1 cgd if (c == 'r')
164 1.1 cgd loadL = 1;
165 1.1 cgd else
166 1.1 cgd loadR = 1;
167 1.1 cgd }
168 1.1 cgd if (!loadL && loadR || loadL && !loadR) {
169 1.1 cgd c = sgetch("Reload with (round, double, chain, grape)? ",
170 1.1 cgd (struct ship *)0, 1);
171 1.1 cgd switch (c) {
172 1.1 cgd case 'r':
173 1.1 cgd load = L_ROUND;
174 1.1 cgd ready = 0;
175 1.1 cgd break;
176 1.1 cgd case 'd':
177 1.1 cgd load = L_DOUBLE;
178 1.1 cgd ready = R_DOUBLE;
179 1.1 cgd break;
180 1.1 cgd case 'c':
181 1.1 cgd load = L_CHAIN;
182 1.1 cgd ready = 0;
183 1.1 cgd break;
184 1.1 cgd case 'g':
185 1.1 cgd load = L_GRAPE;
186 1.1 cgd ready = 0;
187 1.1 cgd break;
188 1.1 cgd default:
189 1.1 cgd Signal("Broadside not loaded.",
190 1.1 cgd (struct ship *)0);
191 1.1 cgd return;
192 1.1 cgd }
193 1.1 cgd if (!loadR) {
194 1.1 cgd mf->loadR = load;
195 1.1 cgd mf->readyR = ready|R_LOADING;
196 1.1 cgd } else {
197 1.1 cgd mf->loadL = load;
198 1.1 cgd mf->readyL = ready|R_LOADING;
199 1.1 cgd }
200 1.1 cgd loaded = 1;
201 1.1 cgd }
202 1.1 cgd }
203