2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2009, 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
39 #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 = malloc(WORLD_SZ() * sizeof(*g_distptrs));
81 if (g_distptrs == NULL) {
82 logerror("malloc failed in finish_sects.\n");
88 memset(g_distptrs, 0, WORLD_SZ() * sizeof(*g_distptrs));
90 logerror("delivering...\n");
92 for (n = 0; NULL != (sp = getsectid(n)); n++) {
93 if (sp->sct_type == SCT_WATER)
97 np = getnatp(sp->sct_own);
98 if (np->nat_money < 0)
102 logerror("done delivering\n");
104 logerror("assembling paths...\n");
106 /* First, enable the best_path cacheing */
107 bp_enable_cachepath();
109 /* Now assemble the paths */
110 assemble_dist_paths(g_distptrs);
112 /* Now disable the best_path cacheing */
113 bp_disable_cachepath();
115 /* Now, clear the best_path cache that may have been created */
116 bp_clear_cachepath();
118 logerror("done assembling paths\n");
120 logerror("exporting...");
121 for (n = 0; NULL != (sp = getsectid(n)); n++) {
122 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
124 np = getnatp(sp->sct_own);
125 if (np->nat_money < 0)
127 /* Get the pointer */
128 infptr = &g_distptrs[sp->sct_uid];
129 dodistribute(sp, EXPORT,
130 infptr->path, infptr->imcost, infptr->excost);
132 logerror("done exporting\n");
134 /* Note that we free the paths (if allocated) as we loop here */
135 logerror("importing...");
136 for (n = 0; NULL != (sp = getsectid(n)); n++) {
137 /* Get the pointer (we do it first so we can free if needed) */
138 infptr = &g_distptrs[sp->sct_uid];
139 if (sp->sct_type == SCT_WATER || sp->sct_own == 0) {
140 #ifdef SAVE_FINISH_PATHS
143 #endif /* SAVE_FINISH_PATHS */
146 np = getnatp(sp->sct_own);
147 if (np->nat_money < 0) {
148 #ifdef SAVE_FINISH_PATHS
151 #endif /* SAVE_FINISH_PATHS */
154 dodistribute(sp, IMPORT,
155 infptr->path, infptr->imcost, infptr->excost);
156 #ifdef SAVE_FINISH_PATHS
159 #endif /* SAVE_FINISH_PATHS */
163 logerror("done importing\n");
168 assemble_dist_paths(struct distinfo *distptrs)
174 struct distinfo *infptr;
178 for (n = 0; NULL != (sp = getsectid(n)); n++) {
179 if ((sp->sct_dist_x == sp->sct_x) && (sp->sct_dist_y == sp->sct_y))
181 /* Set the pointer */
182 infptr = &distptrs[sp->sct_uid];
183 /* now, get the dist sector */
184 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
186 logerror("Bad dist sect %d,%d for %d,%d !\n",
187 sp->sct_dist_x, sp->sct_dist_y,
188 sp->sct_x, sp->sct_y);
191 /* Now, get the best distribution path over roads */
192 /* Note we go from the dist center to the sector. This gives
193 us the import path for that sector. */
194 path = BestDistPath(buf, dist, sp, &d);
196 /* Now, we have a path */
198 #ifdef SAVE_FINISH_PATHS
200 /* Here we malloc a buffer and save it */
202 infptr->path = malloc(len);
203 if (infptr->path == NULL) {
204 logerror("malloc failed in assemble_dist_path!\n");
207 #endif /* SAVE_FINISH_PATHS */
208 /* Save the import cost */
210 /* Now, reverse the path */
211 p = ReversePath(path);
212 /* And walk the path back to the dist center to get the export
214 infptr->excost = pathcost(sp, p, MOB_MOVE);
215 #ifdef SAVE_FINISH_PATHS
216 memcpy(infptr->path, p, len);
218 infptr->path = finish_path;
219 #endif /* SAVE_FINISH_PATHS */
225 ReversePath(char *path)
227 char *patharray = "aucdefjhigklmyopqrstbvwxnz";
228 static char new_path[512];
238 if (path[ind - 1] == 'h')
241 new_path[ind--] = '\0';
242 new_path[ind] = '\0';
245 new_path[ind--] = patharray[*(path++) - 'a'];