2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, 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 the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * distribute.c: Do distribution to sectors
30 * Known contributors to this file:
46 #include "distribute.h"
50 #include "prototypes.h"
52 #define EXPORT_BONUS 10.0
53 #define IMPORT_BONUS 10.0
56 #define MAX(x,y) ((x) < (y) ? (y) : (x))
60 dodistribute(struct sctstr *sp, int imex, s_char *path, double dist_i_cost,
62 /* import or export? */
70 i_packing sect_packing, dist_packing;
79 if ((sp->sct_dist_x == sp->sct_x) && (sp->sct_dist_y == sp->sct_y))
82 if (path == (s_char *)0) {
83 if (sp->sct_own != 0) {
84 if (imex == EXPORT) /* only want this once */
85 wu(0, sp->sct_own, "No path to dist sector for %s\n",
91 dist = getsectp(sp->sct_dist_x, sp->sct_dist_y);
92 dist_packing = dist->sct_effic >= 60 ? dchr[dist->sct_type].d_pkg : IPKG;
93 sect_packing = sp->sct_effic >= 60 ? dchr[sp->sct_type].d_pkg : IPKG;
95 lplague = rplague = changed = 0;
96 for (item = I_NONE + 1; item <= I_MAX; item++) {
97 if (sp->sct_dist[item] == 0)
100 thresh = sp->sct_dist[item];
102 * calculate costs for importing and exporting.
103 * the mob bonus is because delivering straight through
104 * to the dist sect is cheaper than stopping at each
105 * sector along the way (processor-timewise)
107 amt_sect = sp->sct_item[item];
108 amt_dist = dist->sct_item[item];
109 diff = amt_sect - thresh;
111 if (sp->sct_own != sp->sct_oldown)
114 if (dist->sct_own != dist->sct_oldown)
120 if (!military_control(dist))
126 * don't import if no mobility.
127 * check to make sure have enough mobility in the
128 * dist sector to import what we need.
130 if (dist->sct_mobil <= 0) {
131 /*logerror(" dist mobil < 0"); */
136 amt_dist--; /* Don't send your last civ */
138 if (amt_dist < amt) {
143 pack = ip->i_pkg[dist_packing];
144 mcost = dist_i_cost / pack * ip->i_lbs / IMPORT_BONUS;
145 if (dist->sct_mobil < mcost * amt)
146 amt = dist->sct_mobil / mcost;
149 dist->sct_item[item] -= amt;
151 dist->sct_mobil -= (int)(mcost * amt);
152 sp->sct_item[item] += amt;
156 if (!military_control(sp))
158 if ((item == I_CIVIL) && (sp->sct_work < 100))
160 if ((item == I_CIVIL) && (sp->sct_own != sp->sct_oldown))
164 * don't export if no mobility. check to make sure we
165 * have mobility enough to do the right thing.
166 * also make sure that there's enough space in the
167 * target sector to hold the required amt.
169 if (sp->sct_mobil <= 0) {
170 /*logerror(" sp mob is zero"); */
176 pack = MAX(ip->i_pkg[sect_packing], ip->i_pkg[dist_packing]);
177 mcost = dist_e_cost / pack * ip->i_lbs / EXPORT_BONUS;
178 if (sp->sct_mobil < mcost * amt)
179 amt = sp->sct_mobil / mcost;
180 if (amt > ITEM_MAX - amt_dist)
181 amt = ITEM_MAX - amt_dist;
186 sp->sct_item[item] -= amt;
188 sp->sct_mobil -= (int)(mcost * amt);
189 dist->sct_item[item] += amt;
194 lplague = dist->sct_pstage;
195 if (lplague == PLG_INFECT && sp->sct_pstage == PLG_HEALTHY)
196 sp->sct_pstage = PLG_EXPOSED;
200 rplague = sp->sct_pstage;
201 if (rplague == PLG_INFECT && dist->sct_pstage == PLG_HEALTHY)
202 dist->sct_pstage = PLG_EXPOSED;