2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2007, 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 * finish.c: Finish the update
30 * Known contributors to this file:
32 * Thomas Ruschak, 1993
38 #include "distribute.h"
43 /* Used for building up distribution info */
45 char *path; /* path to take */
46 double imcost; /* import cost */
47 double excost; /* export cost */
50 /* This is our global buffer of distribution pointers. Note that
51 * We only malloc this once, and never again (until reboot time
52 * of course :) ) We do clear it each and every time. */
53 static struct distinfo *g_distptrs;
55 /* Note that even though we malloc and save the path, it is never
56 * used. Thus, this option. If you want to malloc and save every
57 * path and then free when done, just enable this. Or, if the
58 * dodistribute ever uses the path for something other than checking
59 * to see that a path exists, enable this */
60 /* #define SAVE_FINISH_PATHS */
62 #ifndef SAVE_FINISH_PATHS
63 static char *finish_path = "h"; /* Placeholder indicating path exists */
64 #endif /* SAVE_FINISH_PATHS */
66 static void assemble_dist_paths(struct distinfo *distptrs);
67 static char *ReversePath(char *path);
75 struct distinfo *infptr;
77 if (g_distptrs == NULL) {
78 logerror("First update since reboot, allocating buffer\n");
79 /* Allocate the information buffer */
80 g_distptrs = (struct distinfo *)(malloc((WORLD_X * WORLD_Y) *
81 sizeof(struct distinfo)));
82 if (g_distptrs == NULL) {
83 logerror("malloc failed in finish_sects.\n");
87 logerror("Allocated '%lu' bytes '%d' indices\n",
88 (unsigned long)(WORLD_X * WORLD_Y * sizeof(struct distinfo)),
93 memset(g_distptrs, 0, ((WORLD_X * WORLD_Y) * sizeof(struct distinfo)));
95 logerror("delivering...\n");
97 for (n = 0; NULL != (sp = getsectid(n)); n++) {
98 if (sp->sct_type == SCT_WATER)
100 if (sp->sct_own == 0)
102 np = getnatp(sp->sct_own);
103 if (np->nat_money < 0)
107 logerror("done delivering\n");
109 logerror("assembling paths...\n");
111 /* First, enable the best_path cacheing */
112 bp_enable_cachepath();
114 /* Now assemble the paths */
115 assemble_dist_paths(g_distptrs);
117 /* Now disable the best_path cacheing */
118 bp_disable_cachepath();
120 /* Now, clear the best_path cache that may have been created */
121 bp_clear_cachepath();
123 logerror("done assembling paths\n");
125 logerror("exporting...");
126 for (n = 0; NULL != (sp = getsectid(n)); n++) {
127 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
129 np = getnatp(sp->sct_own);
130 if (np->nat_money < 0)
132 /* Get the pointer */
133 infptr = &g_distptrs[XYOFFSET(sp->sct_x, sp->sct_y)];
134 dodistribute(sp, EXPORT,
135 infptr->path, infptr->imcost, infptr->excost);
137 logerror("done exporting\n");
139 /* Note that we free the paths (if allocated) as we loop here */
140 logerror("importing...");
141 for (n = 0; NULL != (sp = getsectid(n)); n++) {
142 /* Get the pointer (we do it first so we can free if needed) */
143 infptr = &g_distptrs[XYOFFSET(sp->sct_x, sp->sct_y)];
144 if (sp->sct_type == SCT_WATER || sp->sct_own == 0) {
145 #ifdef SAVE_FINISH_PATHS
148 #endif /* SAVE_FINISH_PATHS */
151 np = getnatp(sp->sct_own);
152 if (np->nat_money < 0) {
153 #ifdef SAVE_FINISH_PATHS
156 #endif /* SAVE_FINISH_PATHS */
159 dodistribute(sp, IMPORT,
160 infptr->path, infptr->imcost, infptr->excost);
161 #ifdef SAVE_FINISH_PATHS
164 #endif /* SAVE_FINISH_PATHS */
168 logerror("done importing\n");
173 assemble_dist_paths(struct distinfo *distptrs)
179 struct distinfo *infptr;
183 for (n = 0; NULL != (sp = getsectid(n)); n++) {
184 if ((sp->sct_dist_x == sp->sct_x) && (sp->sct_dist_y == sp->sct_y))
186 /* Set the pointer */
187 infptr = &distptrs[XYOFFSET(sp->sct_x, sp->sct_y)];
188 /* now, get the dist sector */
189 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
191 logerror("Bad dist sect %d,%d for %d,%d !\n",
192 sp->sct_dist_x, sp->sct_dist_y,
193 sp->sct_x, sp->sct_y);
196 /* Now, get the best distribution path over roads */
197 /* Note we go from the dist center to the sector. This gives
198 us the import path for that sector. */
199 path = BestDistPath(buf, dist, sp, &d);
201 /* Now, we have a path */
203 #ifdef SAVE_FINISH_PATHS
205 /* Here we malloc a buffer and save it */
207 infptr->path = malloc(len);
208 if (infptr->path == NULL) {
209 logerror("malloc failed in assemble_dist_path!\n");
212 #endif /* SAVE_FINISH_PATHS */
213 /* Save the import cost */
215 /* Now, reverse the path */
216 p = ReversePath(path);
217 /* And walk the path back to the dist center to get the export
219 infptr->excost = pathcost(sp, p, MOB_MOVE);
220 #ifdef SAVE_FINISH_PATHS
221 memcpy(infptr->path, p, len);
223 infptr->path = finish_path;
224 #endif /* SAVE_FINISH_PATHS */
230 ReversePath(char *path)
232 char *patharray = "aucdefjhigklmyopqrstbvwxnz";
233 static char new_path[512];
243 if (path[ind - 1] == 'h')
246 new_path[ind--] = '\0';
247 new_path[ind] = '\0';
250 new_path[ind--] = patharray[*(path++) - 'a'];