2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * sail.c: Sail ships during the update
30 * Known contributors to this file:
34 * Steve McClure, 1998-2000
45 static void fltp_to_list(struct fltheadstr *, struct emp_qelem *);
48 cost_ship(struct shpstr *sp, struct fltelemstr *ep, struct fltheadstr *fp)
50 double mobcost = shp_mobcost(sp);
55 howfar = (int)sp->shp_mobil - (int)sp->shp_mobquota;
56 howfar = ceil((howfar / mobcost));
62 "Ship #%d can move %d spaces on mobility %d (cost/sect %f)\n",
63 sp->shp_uid, howfar, sp->shp_mobil, mobcost);
65 if ((unsigned)howfar < fp->maxmoves)
66 fp->maxmoves = howfar;
68 ep->mobil = sp->shp_mobil;
69 ep->mobcost = mobcost;
73 sail_find_fleet(struct fltheadstr **head, struct shpstr *sp)
75 struct fltheadstr *fltp;
77 struct fltelemstr *this;
88 /* If this ship is following, find the head of the follow list. */
89 for (ap = sp; ap; len++, ap = getshipp(follow)) {
90 follow = ap->shp_follow;
92 if (ap->shp_own != sp->shp_own) {
94 "Ship #%d, following #%d, which you don't own.\n",
95 sp->shp_uid, ap->shp_uid);
99 if (ap->shp_path[0] != 'f')
101 /* Following itself */
102 if (follow == ap->shp_uid || follow == sp->shp_uid)
107 "Ship #%d, following #%d, which you don't own.\n",
108 sp->shp_uid, follow);
112 /* This should prevent infinite loops. */
115 "Ship #%d, too many follows (circular follow?).\n",
120 for (stop = 0, cp = ap->shp_path; !stop && *cp; cp++) {
136 /* we found a non-valid char in the path. */
138 wu(0, ap->shp_own, "invalid char '\\%03o' in path of ship %d\n",
139 (unsigned char)*cp, ap->shp_uid);
143 /* if this ship is not sailing anywhere then ignore it. */
147 /* Find the fleet structure we belong to. */
148 for (fltp = *head; fltp && fltp->leader != follow; fltp = fltp->next) ;
151 fltp = malloc(sizeof(*fltp));
152 memset(fltp, 0, sizeof(*fltp));
158 /* Set the leader. */
159 fltp->leader = ap->shp_uid;
160 fltp->real_q = LEADER_REAL;
163 fltp->own = ap->shp_own;
164 fltp->maxmoves = 500;
167 /* If the fleet is not in the same sector as us, no go. */
168 if ((fltp->x != sp->shp_x) || (fltp->y != sp->shp_y)) {
170 "Ship %d not in same sector as its sailing fleet\n",
172 fltp->real_q = LEADER_WRONGSECT;
176 this = malloc(sizeof(*this));
177 memset(this, 0, sizeof(*this));
178 this->num = sp->shp_uid;
179 this->own = sp->shp_own;
180 this->next = fltp->head;
182 cost_ship(sp, this, fltp);
188 sail_nav_fleet(struct fltheadstr *fltp)
190 struct fltelemstr *fe;
191 struct shpstr *sp, ship;
192 struct sctstr *sectp;
196 struct emp_qelem ship_list;
200 switch (fltp->real_q) {
207 case LEADER_WRONGSECT:
214 "Fleet lead by %d is %s, can go %d spaces\n contains ships:",
215 fltp->leader, s, fltp->maxmoves);
216 for (fe = fltp->head; fe; fe = fe->next)
217 wu(0, fltp->own, " %d", fe->num);
218 wu(0, fltp->own, "\n");
220 sectp = getsectp(fltp->x, fltp->y);
221 for (fe = fltp->head; fe; fe = fe->next) {
222 sp = getshipp(fe->num);
223 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
225 " ship #%d (%s) is crewless and can't go on\n",
226 fe->num, cname(fe->own));
229 if ((shp_check_nav(sectp, sp) == CN_LANDLOCKED) &&
230 (dchr[sectp->sct_type].d_nav == NAV_CANAL)) {
232 "Your ship #%d (%s) is too big to fit through the canal.\n",
233 fe->num, cname(fe->own));
239 sp = getshipp(fltp->leader);
240 sectp = getsectp(fltp->x, fltp->y);
241 if (shp_check_nav(sectp, sp) != CN_NAVIGABLE)
242 wu(0, fltp->own, "Your fleet lead by %d is trapped by land.\n",
244 sp = getshipp(fltp->leader);
246 fltp_to_list(fltp, &ship_list); /* hack -KHS 1995 */
247 for (s = sp->shp_path; *s && fltp->maxmoves > 0; s++) {
249 if (0 != shp_nav_one_sector(&ship_list, dir, own, 0))
253 shp_put(&ship_list, own);
254 getship(sp->shp_uid, &ship);
255 fltp->x = ship.shp_x;
256 fltp->y = ship.shp_y;
257 for (p = &ship.shp_path[0]; *s; p++, s++)
260 putship(ship.shp_uid, &ship);
262 if (sp->shp_path[0]) {
264 "Fleet lead by #%d nav'd to %s, path left = %s\n",
265 fltp->leader, xyas(fltp->x, fltp->y, fltp->own), &sp->shp_path);
268 "Fleet lead by #%d nav'd to %s, finished.\n",
269 fltp->leader, xyas(fltp->x, fltp->y, fltp->own));
270 wu(0, sp->shp_own, "Ship #%d has %d mobility now.\n",
271 fe->num, (int)fe->mobil);
280 struct fltheadstr *head = 0;
281 struct fltheadstr *fltp;
285 for (n = 0; NULL != (sp = getshipp(n)); n++)
286 if (sp->shp_own == cn) {
287 sail_find_fleet(&head, sp);
290 /* see what the fleets fall out into */
291 for (fltp = head; fltp; fltp = fltp->next) {
292 if (sail_nav_fleet(fltp))
293 wu(0, fltp->own, "Your fleet lead by ship #%d has reached %s.\n",
294 fltp->leader, xyas(fltp->x, fltp->y, fltp->own));
297 /* Free up the memory, 'cause I want to. */
298 for (fltp = head; fltp != 0;) {
299 struct fltelemstr *fe;
300 struct fltheadstr *saveh;
302 for (fe = fltp->head; fe != 0;) {
303 struct fltelemstr *saveel;
313 /* The following is a total hack by Ken Stevens to cut down dramatically on repeated code 1995 */
316 fltp_to_list(struct fltheadstr *fltp, struct emp_qelem *list)
318 struct fltelemstr *fe;
323 for (fe = fltp->head; fe; fe = fe->next) {
324 mlp = malloc(sizeof(struct mlist));
325 sp = getshipp(fe->num);
326 mlp->mcp = mchr + sp->shp_type;
328 mlp->mobil = fe->mobil;
329 emp_insque(&mlp->queue, list);