]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - trek/klmove.c
Warnsify and remove local implementations of libc functions.
[bsdgames-darwin.git] / trek / klmove.c
1 /* $NetBSD: klmove.c,v 1.4 1997/10/12 21:24:57 christos Exp $ */
2
3 /*
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)klmove.c 8.1 (Berkeley) 5/31/93";
40 #else
41 __RCSID("$NetBSD: klmove.c,v 1.4 1997/10/12 21:24:57 christos Exp $");
42 #endif
43 #endif /* not lint */
44
45 #include <stdio.h>
46 #include "trek.h"
47
48 /*
49 ** Move Klingons Around
50 **
51 ** This is a largely incomprehensible block of code that moves
52 ** Klingons around in a quadrant. It was written in a very
53 ** "program as you go" fashion, and is a prime candidate for
54 ** rewriting.
55 **
56 ** The flag `fl' is zero before an attack, one after an attack,
57 ** and two if you are leaving a quadrant. This serves to
58 ** change the probability and distance that it moves.
59 **
60 ** Basically, what it will try to do is to move a certain number
61 ** of steps either toward you or away from you. It will avoid
62 ** stars whenever possible. Nextx and nexty are the next
63 ** sector to move to on a per-Klingon basis; they are roughly
64 ** equivalent to Ship.sectx and Ship.secty for the starship. Lookx and
65 ** looky are the sector that you are going to look at to see
66 ** if you can move their. Dx and dy are the increment. Fudgex
67 ** and fudgey are the things you change around to change your
68 ** course around stars.
69 */
70
71 void
72 klmove(fl)
73 int fl;
74 {
75 int n;
76 struct kling *k;
77 double dx, dy;
78 int nextx, nexty;
79 int lookx, looky;
80 int motion;
81 int fudgex, fudgey;
82 int qx, qy;
83 double bigger;
84 int i;
85
86 # ifdef xTRACE
87 if (Trace)
88 printf("klmove: fl = %d, Etc.nkling = %d\n", fl, Etc.nkling);
89 # endif
90 for (n = 0; n < Etc.nkling; n++)
91 {
92 k = &Etc.klingon[n];
93 i = 100;
94 if (fl)
95 i = 100.0 * k->power / Param.klingpwr;
96 if (ranf(i) >= Param.moveprob[2 * Move.newquad + fl])
97 continue;
98 /* compute distance to move */
99 motion = ranf(75) - 25;
100 motion *= k->avgdist * Param.movefac[2 * Move.newquad + fl];
101 /* compute direction */
102 dx = Ship.sectx - k->x + ranf(3) - 1;
103 dy = Ship.secty - k->y + ranf(3) - 1;
104 bigger = dx;
105 if (dy > bigger)
106 bigger = dy;
107 if (bigger == 0.0)
108 bigger = 1.0;
109 dx = dx / bigger + 0.5;
110 dy = dy / bigger + 0.5;
111 if (motion < 0)
112 {
113 motion = -motion;
114 dx = -dx;
115 dy = -dy;
116 }
117 fudgex = fudgey = 1;
118 /* try to move the klingon */
119 nextx = k->x;
120 nexty = k->y;
121 for (; motion > 0; motion--)
122 {
123 lookx = nextx + dx;
124 looky = nexty + dy;
125 if (lookx < 0 || lookx >= NSECTS || looky < 0 || looky >= NSECTS)
126 {
127 /* new quadrant */
128 qx = Ship.quadx;
129 qy = Ship.quady;
130 if (lookx < 0)
131 qx -= 1;
132 else
133 if (lookx >= NSECTS)
134 qx += 1;
135 if (looky < 0)
136 qy -= 1;
137 else
138 if (looky >= NSECTS)
139 qy += 1;
140 if (qx < 0 || qx >= NQUADS || qy < 0 || qy >= NQUADS ||
141 Quad[qx][qy].stars < 0 || Quad[qx][qy].klings > MAXKLQUAD - 1)
142 break;
143 if (!damaged(SRSCAN))
144 {
145 printf("Klingon at %d,%d escapes to quadrant %d,%d\n",
146 k->x, k->y, qx, qy);
147 motion = Quad[qx][qy].scanned;
148 if (motion >= 0 && motion < 1000)
149 Quad[qx][qy].scanned += 100;
150 motion = Quad[Ship.quadx][Ship.quady].scanned;
151 if (motion >= 0 && motion < 1000)
152 Quad[Ship.quadx][Ship.quady].scanned -= 100;
153 }
154 Sect[k->x][k->y] = EMPTY;
155 Quad[qx][qy].klings += 1;
156 Etc.nkling -= 1;
157 *k = Etc.klingon[Etc.nkling];
158 Quad[Ship.quadx][Ship.quady].klings -= 1;
159 k = 0;
160 break;
161 }
162 if (Sect[lookx][looky] != EMPTY)
163 {
164 lookx = nextx + fudgex;
165 if (lookx < 0 || lookx >= NSECTS)
166 lookx = nextx + dx;
167 if (Sect[lookx][looky] != EMPTY)
168 {
169 fudgex = -fudgex;
170 looky = nexty + fudgey;
171 if (looky < 0 || looky >= NSECTS || Sect[lookx][looky] != EMPTY)
172 {
173 fudgey = -fudgey;
174 break;
175 }
176 }
177 }
178 nextx = lookx;
179 nexty = looky;
180 }
181 if (k && (k->x != nextx || k->y != nexty))
182 {
183 if (!damaged(SRSCAN))
184 printf("Klingon at %d,%d moves to %d,%d\n",
185 k->x, k->y, nextx, nexty);
186 Sect[k->x][k->y] = EMPTY;
187 Sect[k->x = nextx][k->y = nexty] = KLINGON;
188 }
189 }
190 compkldist(0);
191 }