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 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 * path.c: Empire/A* Interface code.
29 * Define AS_STATS for A* statistics.
31 * Known contributors to this file:
34 * Thomas Ruschak, 1993
52 #define BP_ASHASHSIZE 128 /* A* queue hash table size */
53 #define BP_NEIGHBORS 6 /* max number of neighbors */
62 static int bp_path(struct as_path *pp, s_char *buf);
63 static int bp_neighbors(struct as_coord c, struct as_coord *cp,
65 static double bp_lbcost(struct as_coord from, struct as_coord to,
67 static double bp_realcost(struct as_coord from, struct as_coord to,
69 static double bp_seccost(struct as_coord from, struct as_coord to,
71 static int bp_coord_hash(struct as_coord c);
73 /* We use this for caching neighbors. It never changes except
74 * at reboot time (maybe) so we never need to free it */
75 struct sctstr **neighsects = (struct sctstr **)0;
82 bp = malloc(sizeof(*bp));
83 memset(bp, 0, sizeof(*bp));
84 bp->adp = as_init(BP_NEIGHBORS, BP_ASHASHSIZE, bp_coord_hash,
85 bp_neighbors, bp_lbcost, bp_realcost,
86 bp_seccost, (s_char *)bp);
91 if (neighsects == (struct sctstr **)0)
92 neighsects = calloc(((WORLD_X * WORLD_Y) / 2) * 6,
93 sizeof(struct sctstr *));
99 * Find the best path from sector to to sector, and put the Empire movement
100 * string in path. Return 0 on success, -1 on error.
103 best_path(struct sctstr *from, struct sctstr *to, s_char *path,
106 static struct bestp *mybestpath;
111 mybestpath = (struct bestp *)bp_init();
112 adp = mybestpath->adp;
113 ap = as_find_cachepath(from->sct_x, from->sct_y, to->sct_x, to->sct_y);
115 adp->from.x = from->sct_x;
116 adp->from.y = from->sct_y;
117 adp->to.x = to->sct_x;
118 adp->to.y = to->sct_y;
119 mybestpath->bp_mobtype = mob_type;
121 if (as_search(adp) < 0)
126 if (bp_path(ap, path) < 0)
130 as_stats(adp, stderr);
131 #endif /* AS_STATS */
133 fprintf(stderr, "best path %s\n", path);
134 fprintf(stderr, "cache hits/misses: %d/%d\n",
135 bp->sctcache_hits, bp->sctcache_misses);
136 #endif /* BP_STATS */
141 * Translate an A* path into an empire movement string. Return 0 on
142 * success, -1 on failure.
145 bp_path(struct as_path *pp, s_char *buf)
154 dx = np->c.x - pp->c.x;
155 /* deal with wraparound from non-neg coords */
160 dy = np->c.y - pp->c.y;
165 for (n = 1; n <= 6; n++)
166 if (dx == diroff[n][0] && dy == diroff[n][1])
180 * Find coords neighboring this sector; return number of such
181 * coords, and coordinartes themselves in an array pointed
183 * XXX need to check ownership, sector types, etc.
186 bp_neighbors(struct as_coord c, struct as_coord *cp, s_char *pp)
188 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
192 struct sctstr *sp, *from, **ssp;
193 /* Six pointers, just in case our cache isn't there */
194 struct sctstr *tsp[] = { 0, 0, 0, 0, 0, 0 };
201 offset = (sy * WORLD_X + sx) / 2;
202 from = §p[offset];
204 if (neighsects == (struct sctstr **)0)
205 ssp = (struct sctstr **)&tsp[0];
207 ssp = (struct sctstr **)&neighsects[offset * 6];
208 for (q = 1; q <= 6; q++, ssp++) {
209 if (*ssp == (struct sctstr *)0) {
210 /* We haven't cached this neighbor yet */
211 nx = x + diroff[q][0];
212 ny = y + diroff[q][1];
215 offset = (sy * WORLD_X + sx) / 2;
220 sx = XNORM(sp->sct_x);
221 sy = YNORM(sp->sct_y);
223 /* No need to calculate cost each time, just make sure we can
224 move through it. We calculate it later. */
225 if (dchr[sp->sct_type].d_mcst == 0)
227 if (sp->sct_own != from->sct_own)
237 * Compute a lower-bound on the cost from "from" to "to".
241 bp_lbcost(struct as_coord from, struct as_coord to, s_char *pp)
243 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
244 struct bestp *bp = (struct bestp *)pp;
247 int x, y, sx, sy, offset;
253 offset = (sy * WORLD_X + sx) / 2;
255 cost = sector_mcost(ts, 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, s_char *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, s_char *pp)
276 return (double)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 as_enable_cachepath();
296 bp_disable_cachepath(void)
298 as_disable_cachepath();
302 bp_clear_cachepath(void)
304 as_clear_cachepath();
308 pathcost(struct sctstr *start, s_char *path, int mob_type)
310 struct sctstr *sectp = (void *)empfile[EF_SECTOR].cache;
327 if (CANT_HAPPEN(i >= sizeof(dirindex) / sizeof(*dirindex)))
330 if (CANT_HAPPEN(o < 0))
336 offset = (sy * WORLD_X + sx) / 2;
338 cost += sector_mcost(sp, mob_type);
346 BestDistPath(s_char *path,
348 struct sctstr *to, double *cost, int mob_type)
350 return BestLandPath(path, from, to, cost, mob_type);
354 BestLandPath(s_char *path,
356 struct sctstr *to, double *cost, int mob_type)
362 if (best_path(from, to, path, mob_type) < 0)
364 *cost = pathcost(from, path, mob_type);
365 length = strlen(path);
367 path[length + 1] = '\0';
372 BestShipPath(s_char *path, int fx, int fy, int tx, int ty, int owner)
376 /* need to make sector database available to bestpath */
377 map = ef_ptr(EF_BMAP, owner);
379 return bestownedpath(path, map, fx, fy, tx, ty, ".=h", owner);
383 BestAirPath(s_char *path, int fx, int fy, int tx, int ty)
385 return bestownedpath(path, 0, fx, fy, tx, ty, "", -1);
386 /* return (bestpath(path, fx, fy, tx, ty, "")); */