2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2005, 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 the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * 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
51 static void fltp_to_list(struct fltheadstr *, struct emp_qelem *);
54 cost_ship(struct shpstr *sp, struct fltelemstr *ep, struct fltheadstr *fp)
60 if (sp->shp_effic > 0) {
61 mobcost = sp->shp_effic * sp->shp_speed * 0.01;
62 mobcost = 480.0 / (mobcost * (1 + (50 + sp->shp_tech) /
63 (double)(200 + sp->shp_tech)));
65 /* the next two lines are not necessary since shp_mobquota is unsigned
66 and therefore cannot be less than 0.
67 if (sp->shp_mobquota<0)
73 howfar = (int)sp->shp_mobil - (int)sp->shp_mobquota;
74 howfar = ceil((howfar / mobcost));
80 "Ship #%d can move %d spaces on mobility %d (cost/sect %f)\n",
81 sp->shp_uid, howfar, sp->shp_mobil, mobcost);
83 if ((unsigned int)howfar < fp->maxmoves)
84 fp->maxmoves = howfar;
86 ep->mobil = sp->shp_mobil;
87 ep->mobcost = mobcost;
91 sail_find_fleet(struct fltheadstr **head, struct shpstr *sp)
93 struct fltheadstr *fltp;
95 struct fltelemstr *this;
101 if (sp->shp_own == 0)
106 /* If this ship is following, find the head of the follow list. */
107 for (ap = sp; ap; len++, ap = getshipp(follow)) {
108 follow = ap->shp_follow;
110 if (ap->shp_own != sp->shp_own) {
112 "Ship #%d, following #%d, which you don't own.\n",
113 sp->shp_uid, ap->shp_uid);
116 /* Not a follower. */
117 if (ap->shp_path[0] != 'f')
119 /* Following itself */
120 if (follow == ap->shp_uid || follow == sp->shp_uid)
125 "Ship #%d, following #%d, which you don't own.\n",
126 sp->shp_uid, follow);
130 /* This should prevent infinite loops. */
133 "Ship #%d, too many follows (circular follow?).\n",
138 for (stop = 0, cp = ap->shp_path; (!stop) && (*cp); cp++) {
154 /* we found a non-valid char in the path. */
156 wu(0, ap->shp_own, "invalid char '\\%03o' in path of ship %d\n",
157 (unsigned char)*cp, ap->shp_uid);
161 /* if this ship is not sailing anywhere then ignore it. */
165 /* Find the fleet structure we belong to. */
166 for (fltp = (*head); (fltp && fltp->leader != follow);
170 fltp = malloc(sizeof(*fltp));
171 memset(fltp, 0, sizeof(*fltp));
174 fltp->next = (*head);
177 /* Set the leader. */
178 fltp->leader = ap->shp_uid;
179 fltp->real_q = LEADER_REAL;
182 fltp->own = ap->shp_own;
183 fltp->maxmoves = 500;
186 /* If the fleet is not in the same sector as us, no go. */
187 if ((fltp->x != sp->shp_x) || (fltp->y != sp->shp_y)) {
189 "Ship %d not in same sector as its sailing fleet\n",
191 fltp->real_q = LEADER_WRONGSECT;
195 this = malloc(sizeof(*this));
196 memset(this, 0, sizeof(*this));
197 this->num = sp->shp_uid;
198 this->own = sp->shp_own;
199 this->next = fltp->head;
201 cost_ship(sp, this, fltp);
207 sail_nav_fleet(struct fltheadstr *fltp)
209 struct fltelemstr *fe;
210 struct shpstr *sp, ship;
211 struct sctstr *sectp;
215 struct emp_qelem ship_list;
219 switch (fltp->real_q) {
226 case LEADER_WRONGSECT:
233 "Fleet lead by %d is %s, can go %d spaces\n contains ships:",
234 fltp->leader, s, fltp->maxmoves);
235 for (fe = fltp->head; fe; fe = fe->next)
236 wu(0, fltp->own, " %d", fe->num);
237 wu(0, fltp->own, "\n");
239 sectp = getsectp(fltp->x, fltp->y);
240 switch (check_nav(sectp)) {
243 case CN_CONSTRUCTION:
246 wu(0, fltp->own, "Your fleet lead by %d is trapped by land.\n",
250 for (fe = fltp->head; fe; fe = fe->next) {
251 sp = getshipp(fe->num);
252 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
254 " ship #%d (%s) is crewless and can't go on\n",
255 fe->num, cname(fe->own));
261 sp = getshipp(fltp->leader);
263 fltp_to_list(fltp, &ship_list); /* hack -KHS 1995 */
264 for (s = sp->shp_path; (*s) && (fltp->maxmoves > 0); s++) {
265 dir = chkdir(*s, DIR_STOP, DIR_LAST);
266 if (0 != (error = shp_nav_one_sector(&ship_list, dir, own, 0)))
270 shp_put(&ship_list, own);
271 getship(sp->shp_uid, &ship);
272 fltp->x = ship.shp_x;
273 fltp->y = ship.shp_y;
274 for (p = &ship.shp_path[0]; *s; p++, s++)
277 putship(ship.shp_uid, &ship);
279 if (sp->shp_path[0]) {
281 "Fleet lead by #%d nav'd to %s, path left = %s\n",
282 fltp->leader, xyas(fltp->x, fltp->y, fltp->own), &sp->shp_path);
285 "Fleet lead by #%d nav'd to %s, finished.\n",
286 fltp->leader, xyas(fltp->x, fltp->y, fltp->own));
287 wu(0, sp->shp_own, "Ship #%d has %d mobility now.\n",
288 fe->num, (int)fe->mobil);
297 struct fltheadstr *head = 0;
298 struct fltheadstr *fltp;
302 for (n = 0; NULL != (sp = getshipp(n)); n++)
303 if (sp->shp_own == cn) {
304 sail_find_fleet(&head, sp);
307 /* see what the fleets fall out into */
308 for (fltp = head; fltp; fltp = fltp->next) {
309 sail_nav_fleet(fltp);
310 wu(0, fltp->own, "Your fleet lead by ship #%d has reached %s.\n",
311 fltp->leader, xyas(fltp->x, fltp->y, fltp->own));
314 /* Free up the memory, 'cause I want to. */
315 for (fltp = head; fltp != 0;) {
316 struct fltelemstr *fe;
317 struct fltheadstr *saveh;
319 for (fe = fltp->head; fe != 0;) {
320 struct fltelemstr *saveel;
330 /* The following is a total hack by Ken Stevens to cut down dramatically on repeated code 1995 */
333 fltp_to_list(struct fltheadstr *fltp, struct emp_qelem *list)
335 struct fltelemstr *fe;
340 for (fe = fltp->head; fe; fe = fe->next) {
341 mlp = malloc(sizeof(struct mlist));
342 sp = getshipp(fe->num);
343 mlp->mcp = mchr + sp->shp_type;
345 mlp->mobil = fe->mobil;
346 emp_insque(&mlp->queue, list);