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 * finish.c: Finish the update
30 * Known contributors to this file:
32 * Thomas Ruschak, 1993
39 #include <sys/resource.h>
40 #include "distribute.h"
44 /* Used for building up distribution info */
46 char *path; /* path to take */
47 double imcost; /* import cost */
48 double excost; /* export cost */
51 /* This is our global buffer of distribution pointers. Note that
52 * We only malloc this once, and never again (until reboot time
53 * of course :) ) We do clear it each and every time. */
54 static struct distinfo *g_distptrs;
56 static char *finish_path = "h"; /* Placeholder indicating path exists */
58 static void assemble_dist_paths(struct distinfo *distptrs);
59 static char *ReversePath(char *path);
67 struct rusage rus1, rus2;
68 struct distinfo *infptr;
70 if (g_distptrs == NULL) {
71 logerror("First update since reboot, allocating buffer\n");
72 /* Allocate the information buffer */
73 g_distptrs = malloc(WORLD_SZ() * sizeof(*g_distptrs));
74 if (g_distptrs == NULL) {
75 logerror("malloc failed in finish_sects.\n");
81 memset(g_distptrs, 0, WORLD_SZ() * sizeof(*g_distptrs));
83 logerror("delivering...\n");
85 for (n = 0; NULL != (sp = getsectid(n)); n++) {
86 if (sp->sct_type == SCT_WATER)
90 np = getnatp(sp->sct_own);
91 if (np->nat_money < 0)
95 logerror("done delivering\n");
97 logerror("assembling paths...\n");
98 getrusage(RUSAGE_SELF, &rus1);
100 /* First, enable the best_path cacheing */
101 bp_enable_cachepath();
103 /* Now assemble the paths */
104 assemble_dist_paths(g_distptrs);
106 /* Now disable the best_path cacheing */
107 bp_disable_cachepath();
109 /* Now, clear the best_path cache that may have been created */
110 bp_clear_cachepath();
112 getrusage(RUSAGE_SELF, &rus2);
113 logerror("done assembling paths %g user %g system",
114 rus2.ru_utime.tv_sec + rus2.ru_utime.tv_usec / 1e6
115 - (rus1.ru_utime.tv_sec + rus1.ru_utime.tv_usec / 1e6),
116 rus2.ru_stime.tv_sec + rus2.ru_stime.tv_usec / 1e6
117 - (rus1.ru_stime.tv_sec + rus1.ru_stime.tv_usec / 1e6));
119 logerror("exporting...");
120 for (n = 0; NULL != (sp = getsectid(n)); n++) {
121 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
123 np = getnatp(sp->sct_own);
124 if (np->nat_money < 0)
126 /* Get the pointer */
127 infptr = &g_distptrs[sp->sct_uid];
128 dodistribute(sp, EXPORT,
129 infptr->path, infptr->imcost, infptr->excost);
131 logerror("done exporting\n");
133 logerror("importing...");
134 for (n = 0; NULL != (sp = getsectid(n)); n++) {
135 /* Get the pointer (we do it first so we can free if needed) */
136 infptr = &g_distptrs[sp->sct_uid];
137 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
139 np = getnatp(sp->sct_own);
140 if (np->nat_money < 0)
142 dodistribute(sp, IMPORT,
143 infptr->path, infptr->imcost, infptr->excost);
146 logerror("done importing\n");
151 assemble_dist_paths(struct distinfo *distptrs)
157 struct distinfo *infptr;
161 for (n = 0; NULL != (sp = getsectid(n)); n++) {
162 if ((sp->sct_dist_x == sp->sct_x) && (sp->sct_dist_y == sp->sct_y))
164 /* Set the pointer */
165 infptr = &distptrs[sp->sct_uid];
166 /* now, get the dist sector */
167 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
169 logerror("Bad dist sect %d,%d for %d,%d !\n",
170 sp->sct_dist_x, sp->sct_dist_y,
171 sp->sct_x, sp->sct_y);
174 /* Now, get the best distribution path over roads */
175 /* Note we go from the dist center to the sector. This gives
176 us the import path for that sector. */
177 path = BestDistPath(buf, dist, sp, &d);
179 /* Now, we have a path */
181 /* Save the import cost */
183 /* Now, reverse the path */
184 p = ReversePath(path);
185 /* And walk the path back to the dist center to get the export
187 infptr->excost = pathcost(sp, p, MOB_MOVE);
188 infptr->path = finish_path;
194 ReversePath(char *path)
196 char *patharray = "aucdefjhigklmyopqrstbvwxnz";
197 static char new_path[512];
207 if (path[ind - 1] == 'h')
210 new_path[ind--] = '\0';
211 new_path[ind] = '\0';
214 new_path[ind--] = patharray[*(path++) - 'a'];