2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2016, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * finish.c: Finish the update
29 * Known contributors to this file:
31 * Thomas Ruschak, 1993
33 * Markus Armbruster, 2004-2011
39 #include <sys/resource.h>
40 #include "distribute.h"
46 #include "prototypes.h"
48 static void assemble_dist_paths(double *);
53 static double *import_cost;
57 struct rusage rus1, rus2;
59 if (import_cost == NULL) {
60 logerror("First update since reboot, allocating buffer\n");
61 import_cost = malloc(WORLD_SZ() * sizeof(*import_cost));
62 if (import_cost == NULL) {
63 logerror("malloc failed in finish_sects.\n");
68 logerror("delivering...\n");
70 for (n = 0; NULL != (sp = getsectid(n)); n++) {
71 if (sp->sct_type == SCT_WATER)
75 np = getnatp(sp->sct_own);
76 if (np->nat_money < 0)
80 logerror("done delivering\n");
82 logerror("assembling paths...\n");
83 getrusage(RUSAGE_SELF, &rus1);
84 assemble_dist_paths(import_cost);
85 getrusage(RUSAGE_SELF, &rus2);
86 logerror("done assembling paths %g user %g system",
87 rus2.ru_utime.tv_sec + rus2.ru_utime.tv_usec / 1e6
88 - (rus1.ru_utime.tv_sec + rus1.ru_utime.tv_usec / 1e6),
89 rus2.ru_stime.tv_sec + rus2.ru_stime.tv_usec / 1e6
90 - (rus1.ru_stime.tv_sec + rus1.ru_stime.tv_usec / 1e6));
92 logerror("exporting...");
93 for (n = 0; NULL != (sp = getsectid(n)); n++) {
96 np = getnatp(sp->sct_own);
97 if (np->nat_money < 0)
99 dodistribute(sp, EXPORT, import_cost[n]);
101 logerror("done exporting\n");
103 logerror("importing...");
104 for (n = 0; NULL != (sp = getsectid(n)); n++) {
108 np = getnatp(sp->sct_own);
109 if (np->nat_money < 0)
111 dodistribute(sp, IMPORT, import_cost[n]);
113 logerror("done importing\n");
118 distcmp(const void *p, const void *q)
122 struct sctstr *sp = (void *)empfile[EF_SECTOR].cache;
125 d = sp[b].sct_dist_y - sp[a].sct_dist_y;
128 d = sp[b].sct_dist_x - sp[a].sct_dist_x;
135 assemble_dist_paths(double *import_cost)
142 coord dx = 1, dy = 0; /* invalid */
145 job = malloc(WORLD_SZ() * sizeof(*job));
148 for (uid = 0; NULL != (sp = getsectid(uid)); uid++) {
149 import_cost[uid] = -1;
150 if (sp->sct_dist_x == sp->sct_x && sp->sct_dist_y == sp->sct_y)
155 #ifdef PATH_FIND_STATS
156 printf("dist path reuse %zu bytes, %d/%d used\n",
157 WORLD_SZ() * sizeof(*job), n, WORLD_SZ());
160 qsort(job, n, sizeof(*job), distcmp);
162 for (i = 0; i < n; i++) {
165 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
166 if (CANT_HAPPEN(!dist))
168 if (sp->sct_own != dist->sct_own)
170 if (sp->sct_dist_x != dx || sp->sct_dist_y != dy) {
173 path_find_from(dx, dy, dist->sct_own, MOB_MOVE);
175 import_cost[uid] = path_find_to(sp->sct_x, sp->sct_y);
177 path_find_print_stats();