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