2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2018, 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-2016
39 #include <sys/resource.h>
43 #include "prototypes.h"
46 static void assemble_dist_paths(double *);
51 static double *import_cost;
54 struct rusage rus1, rus2;
56 if (import_cost == NULL) {
57 logerror("First update since reboot, allocating buffer\n");
58 import_cost = malloc(WORLD_SZ() * sizeof(*import_cost));
59 if (import_cost == NULL) {
60 logerror("malloc failed in finish_sects.\n");
65 logerror("delivering...\n");
67 for (n = 0; NULL != (sp = getsectid(n)); n++) {
68 if (!sp->sct_own || sp->sct_type == SCT_SANCT)
70 if (nat_budget[sp->sct_own].money < 0)
74 logerror("done delivering\n");
76 logerror("assembling paths...\n");
77 getrusage(RUSAGE_SELF, &rus1);
78 assemble_dist_paths(import_cost);
79 getrusage(RUSAGE_SELF, &rus2);
80 logerror("done assembling paths %g user %g system",
81 rus2.ru_utime.tv_sec + rus2.ru_utime.tv_usec / 1e6
82 - (rus1.ru_utime.tv_sec + rus1.ru_utime.tv_usec / 1e6),
83 rus2.ru_stime.tv_sec + rus2.ru_stime.tv_usec / 1e6
84 - (rus1.ru_stime.tv_sec + rus1.ru_stime.tv_usec / 1e6));
86 logerror("exporting...");
87 for (n = 0; NULL != (sp = getsectid(n)); n++) {
88 if (!sp->sct_own || sp->sct_type == SCT_SANCT)
90 if (nat_budget[sp->sct_own].money < 0)
92 dodistribute(sp, EXPORT, import_cost[n]);
94 logerror("done exporting\n");
96 logerror("importing...");
97 for (n = 0; NULL != (sp = getsectid(n)); n++) {
99 if (!sp->sct_own || sp->sct_type == SCT_SANCT)
101 if (nat_budget[sp->sct_own].money < 0)
103 dodistribute(sp, IMPORT, import_cost[n]);
105 logerror("done importing\n");
110 distcmp(const void *p, const void *q)
114 struct sctstr *sp = (void *)empfile[EF_SECTOR].cache;
117 d = sp[b].sct_dist_y - sp[a].sct_dist_y;
120 d = sp[b].sct_dist_x - sp[a].sct_dist_x;
127 assemble_dist_paths(double *import_cost)
134 coord dx = 1, dy = 0; /* invalid */
137 job = malloc(WORLD_SZ() * sizeof(*job));
140 for (uid = 0; NULL != (sp = getsectid(uid)); uid++) {
141 import_cost[uid] = -1;
142 if (sp->sct_dist_x == sp->sct_x && sp->sct_dist_y == sp->sct_y)
147 #ifdef PATH_FIND_STATS
148 printf("dist path reuse %zu bytes, %d/%d used\n",
149 WORLD_SZ() * sizeof(*job), n, WORLD_SZ());
152 qsort(job, n, sizeof(*job), distcmp);
154 for (i = 0; i < n; i++) {
157 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
158 if (CANT_HAPPEN(!dist))
160 if (sp->sct_own != dist->sct_own)
162 if (sp->sct_dist_x != dx || sp->sct_dist_y != dy) {
165 path_find_from(dx, dy, dist->sct_own, MOB_MOVE);
167 import_cost[uid] = path_find_to(sp->sct_x, sp->sct_y);
169 path_find_print_stats();