2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2010, 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 * path.c: Empire/A* Interface code.
30 * Known contributors to this file:
33 * Thomas Ruschak, 1993
38 * Define AS_STATS for A* statistics on stderr.
40 * Define AS_NO_PATH_CACHE to disable the path cache. The path cache
41 * saves a lot of work, but uses lots of memory. It should be a
42 * significant net win, unless you run out of memory.
53 #include "prototypes.h"
57 #define BP_ASHASHSIZE 128 /* A* queue hash table size */
58 #define BP_NEIGHBORS 6 /* max number of neighbors */
65 static int bp_path(struct as_path *pp, char *buf);
66 static int bp_neighbors(struct as_coord c, struct as_coord *cp, void *);
67 static double bp_lbcost(struct as_coord from, struct as_coord to, void *);
68 static double bp_realcost(struct as_coord from, struct as_coord to, void *);
69 static double bp_seccost(struct as_coord from, struct as_coord to, void *);
70 static int bp_coord_hash(struct as_coord c);
72 /* We use this for caching neighbors. It never changes except
73 * at reboot time (maybe) so we never need to free it */
74 static struct sctstr **neighsects;
81 bp = malloc(sizeof(*bp));
82 memset(bp, 0, sizeof(*bp));
83 bp->adp = as_init(BP_NEIGHBORS, BP_ASHASHSIZE, bp_coord_hash,
84 bp_neighbors, bp_lbcost, bp_realcost,
90 if (neighsects == NULL)
91 neighsects = calloc(WORLD_SZ() * 6, sizeof(struct sctstr *));
97 * Find the best path from sector to to sector, and put the Empire movement
98 * string in path. Return 0 on success, -1 on error.
99 * FIXME unsafe by design: assumes path[] has space; buffer overrun
100 * when path gets long!
103 best_path(struct sctstr *from, struct sctstr *to, char *path, int mob_type)
105 static struct bestp *mybestpath;
111 mybestpath = bp_init();
112 adp = mybestpath->adp;
113 #ifdef AS_NO_PATH_CACHE
116 ap = as_find_cachepath(from->sct_x, from->sct_y, to->sct_x, to->sct_y);
119 adp->from.x = from->sct_x;
120 adp->from.y = from->sct_y;
121 adp->to.x = to->sct_x;
122 adp->to.y = to->sct_y;
123 mybestpath->bp_mobtype = mob_type;
125 res = as_search(adp);
127 as_stats(adp, stderr);
128 fprintf(stderr, "neighbor cache %zu bytes\n",
129 WORLD_SZ() * 6 * sizeof(struct sctstr *));
136 if (bp_path(ap, path) < 0)
142 * Translate an A* path into an empire movement string. Return 0 on
143 * success, -1 on failure.
146 bp_path(struct as_path *pp, char *buf)
155 dx = np->c.x - pp->c.x;
156 /* deal with wraparound from non-neg coords */
161 dy = np->c.y - pp->c.y;
166 for (n = 1; n <= 6; n++)
167 if (dx == diroff[n][0] && dy == diroff[n][1])
181 * Find coords neighboring this sector; return number of such
182 * coords, and coordinartes themselves in an array pointed
184 * XXX need to check ownership, sector types, etc.
187 bp_neighbors(struct as_coord c, struct as_coord *cp, void *pp)
189 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
190 struct bestp *bp = pp;
194 struct sctstr *sp, *from, **ssp;
195 /* Six pointers, just in case our cache isn't there */
196 struct sctstr *tsp[] = { NULL, NULL, NULL, NULL, NULL, NULL };
203 offset = XYOFFSET(sx, sy);
204 from = §p[offset];
206 if (neighsects == NULL)
207 ssp = (struct sctstr **)&tsp[0];
209 ssp = (struct sctstr **)&neighsects[offset * 6];
210 for (i = 1; i <= 6; i++, ssp++) {
212 /* We haven't cached this neighbor yet */
213 nx = x + diroff[i][0];
214 ny = y + diroff[i][1];
217 offset = XYOFFSET(sx, sy);
222 sx = XNORM(sp->sct_x);
223 sy = YNORM(sp->sct_y);
225 /* No need to calculate cost each time, just make sure we can
226 move through it. We calculate it later. */
227 if (dchr[sp->sct_type].d_mob0 < 0)
229 if (bp->bp_mobtype == MOB_RAIL && !SCT_HAS_RAIL(sp))
231 if (sp->sct_own != from->sct_own)
241 * Compute a lower-bound on the cost from "from" to "to".
245 bp_lbcost(struct as_coord from, struct as_coord to, void *pp)
247 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
248 struct bestp *bp = pp;
249 int x, y, sx, sy, offset;
255 offset = XYOFFSET(sx, sy);
256 return sector_mcost(§p[offset], bp->bp_mobtype);
260 * Compute the real cost to move from "from" to "to".
263 bp_realcost(struct as_coord from, struct as_coord to, void *pp)
265 return bp_lbcost(from, to, pp);
269 * Tie breaker secondary metric (only used when lower bound costs
274 bp_seccost(struct as_coord from, struct as_coord to, void *pp)
276 return mapdist((coord)from.x, (coord)from.y,
277 (coord)to.x, (coord)to.y);
281 * Hash a coordinate into an integer.
284 bp_coord_hash(struct as_coord c)
286 return ((abs(c.x) + 1) << 3) ^ abs(c.y);
290 bp_enable_cachepath(void)
292 #ifndef AS_NO_PATH_CACHE
293 as_enable_cachepath();
298 bp_disable_cachepath(void)
300 #ifndef AS_NO_PATH_CACHE
301 as_disable_cachepath();
306 bp_clear_cachepath(void)
308 #ifndef AS_NO_PATH_CACHE
309 as_clear_cachepath();
314 pathcost(struct sctstr *start, char *path, int mob_type)
316 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
333 if (CANT_HAPPEN(i >= sizeof(dirindex) / sizeof(*dirindex)))
336 if (CANT_HAPPEN(o < 0))
342 offset = XYOFFSET(sx, sy);
344 cost += sector_mcost(sp, mob_type);
352 BestDistPath(char *path,
354 struct sctstr *to, double *cost)
356 return BestLandPath(path, from, to, cost, MOB_MOVE);
360 BestLandPath(char *path,
362 struct sctstr *to, double *cost, int mob_type)
368 if (best_path(from, to, path, mob_type) < 0)
370 *cost = pathcost(from, path, mob_type);
371 length = strlen(path);
373 path[length + 1] = '\0';
378 BestShipPath(char *path, int fx, int fy, int tx, int ty, int owner)
382 map = ef_ptr(EF_BMAP, owner);
385 return bestownedpath(path, map, fx, fy, tx, ty, owner);
389 BestAirPath(char *path, int fx, int fy, int tx, int ty)
391 return bestownedpath(path, NULL, fx, fy, tx, ty, -1);