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 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 static void assemble_dist_paths(struct distinfo *distptrs);
56 static char *ReversePath(char *path);
64 struct rusage rus1, rus2;
65 struct distinfo *infptr;
67 if (g_distptrs == NULL) {
68 logerror("First update since reboot, allocating buffer\n");
69 /* Allocate the information buffer */
70 g_distptrs = malloc(WORLD_SZ() * sizeof(*g_distptrs));
71 if (g_distptrs == NULL) {
72 logerror("malloc failed in finish_sects.\n");
78 memset(g_distptrs, 0, WORLD_SZ() * sizeof(*g_distptrs));
80 logerror("delivering...\n");
82 for (n = 0; NULL != (sp = getsectid(n)); n++) {
83 if (sp->sct_type == SCT_WATER)
87 np = getnatp(sp->sct_own);
88 if (np->nat_money < 0)
92 logerror("done delivering\n");
94 logerror("assembling paths...\n");
95 getrusage(RUSAGE_SELF, &rus1);
97 /* First, enable the best_path cacheing */
98 bp_enable_cachepath();
100 /* Now assemble the paths */
101 assemble_dist_paths(g_distptrs);
103 /* Now disable the best_path cacheing */
104 bp_disable_cachepath();
106 /* Now, clear the best_path cache that may have been created */
107 bp_clear_cachepath();
109 getrusage(RUSAGE_SELF, &rus2);
110 logerror("done assembling paths %g user %g system",
111 rus2.ru_utime.tv_sec + rus2.ru_utime.tv_usec / 1e6
112 - (rus1.ru_utime.tv_sec + rus1.ru_utime.tv_usec / 1e6),
113 rus2.ru_stime.tv_sec + rus2.ru_stime.tv_usec / 1e6
114 - (rus1.ru_stime.tv_sec + rus1.ru_stime.tv_usec / 1e6));
116 logerror("exporting...");
117 for (n = 0; NULL != (sp = getsectid(n)); n++) {
118 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
120 np = getnatp(sp->sct_own);
121 if (np->nat_money < 0)
123 /* Get the pointer */
124 infptr = &g_distptrs[sp->sct_uid];
125 dodistribute(sp, EXPORT, infptr->imcost, infptr->excost);
127 logerror("done exporting\n");
129 logerror("importing...");
130 for (n = 0; NULL != (sp = getsectid(n)); n++) {
131 /* Get the pointer (we do it first so we can free if needed) */
132 infptr = &g_distptrs[sp->sct_uid];
133 if (sp->sct_type == SCT_WATER || sp->sct_own == 0)
135 np = getnatp(sp->sct_own);
136 if (np->nat_money < 0)
138 dodistribute(sp, IMPORT, infptr->imcost, infptr->excost);
141 logerror("done importing\n");
146 assemble_dist_paths(struct distinfo *distptrs)
152 struct distinfo *infptr;
156 for (n = 0; NULL != (sp = getsectid(n)); n++) {
157 if ((sp->sct_dist_x == sp->sct_x) && (sp->sct_dist_y == sp->sct_y))
159 /* Set the pointer */
160 infptr = &distptrs[sp->sct_uid];
161 /* now, get the dist sector */
162 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
164 logerror("Bad dist sect %d,%d for %d,%d !\n",
165 sp->sct_dist_x, sp->sct_dist_y,
166 sp->sct_x, sp->sct_y);
169 /* Now, get the best distribution path over roads */
170 /* Note we go from the dist center to the sector. This gives
171 us the import path for that sector. */
172 path = BestDistPath(buf, dist, sp, &d);
174 /* Now, we have a path */
176 infptr->imcost = infptr->excost = -1.0;
178 /* Save the import cost */
180 /* Now, reverse the path */
181 p = ReversePath(path);
182 /* And walk the path back to the dist center to get the export
184 infptr->excost = pathcost(sp, p, MOB_MOVE);
190 ReversePath(char *path)
192 char *patharray = "aucdefjhigklmyopqrstbvwxnz";
193 static char new_path[512];
203 if (path[ind - 1] == 'h')
206 new_path[ind--] = '\0';
207 new_path[ind] = '\0';
210 new_path[ind--] = patharray[*(path++) - 'a'];