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