2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2011, 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 * prod.c: Calculate production levels
29 * Known contributors to this file:
30 * David Muir Sharnoff, 1987
31 * Steve McClure, 1997-2000
32 * Markus Armbruster, 2004-2010
42 static void prprod(coord, coord, int, double, double, int, char,
43 double, double, double, char[], int[], int[], int);
52 for (i = 0; NULL != (sp = getsectid(i)); i++) {
55 if (sp->sct_oldown != n)
57 pop += sp->sct_item[I_CIVIL];
67 struct nstr_sect nstr;
70 double maxr; /* floating version of max */
72 double real; /* floating pt version of act */
75 int act; /* actual production */
78 int max; /* production w/infinite materials */
83 int unit_work; /* sum of component amounts */
84 int used; /* production w/infinite workforce */
87 unsigned char *resource;
89 int cuse[MAXPRCON], cmax[MAXPRCON];
101 if (!snxtsct(&nstr, player->argp[1]))
103 player->simulation = 1;
106 while (nxtsct(&nstr, §)) {
110 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
111 uws = (1.0 + uwbrate * etu_per_update) * sect.sct_item[I_UW];
112 natp = getnatp(sect.sct_own);
113 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
115 work = new_work(§,
116 total_work(sect.sct_work, etu_per_update,
117 civs, sect.sct_item[I_MILIT], uws,
123 type = sect.sct_type;
124 eff = sect.sct_effic;
125 if (sect.sct_newtype != type) {
126 twork = (eff + 3) / 4;
134 type = sect.sct_newtype;
137 if (!eff && IS_BIG_CITY(otype) && !IS_BIG_CITY(type)) {
138 natp = getnatp(sect.sct_own);
139 maxpop = max_population(natp->nat_level[NAT_RLEV],
141 work = new_work(§,
142 total_work(sect.sct_work, etu_per_update,
143 civs, sect.sct_item[I_MILIT],
145 bwork = MIN(work / 2, bwork);
151 if (dchr[type].d_lcms > 0) {
152 lcms = sect.sct_item[I_LCM];
153 lcms /= dchr[type].d_lcms;
157 if (dchr[type].d_hcms > 0) {
158 hcms = sect.sct_item[I_HCM];
159 hcms /= dchr[type].d_hcms;
165 } else if (eff < 100) {
173 work = (work + 1) / 2 + bwork;
181 if (type == SCT_ENLIST) {
185 if (sect.sct_own != sect.sct_oldown)
187 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
188 natp = getnatp(sect.sct_own);
189 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
190 civs = MIN(civs, maxpop);
192 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
194 enlisted = (etu_per_update
195 * (10 + sect.sct_item[I_MILIT])
197 if (enlisted > maxmil)
202 prprod(sect.sct_x, sect.sct_y, type, p_e, 1.0, work,
203 ichr[I_MILIT].i_mnem, enlisted, maxmil, enlisted * 3,
204 "c\0\0", &enlisted, &enlisted, nsect++);
208 if (dchr[type].d_prd < 0)
211 pp = &pchr[dchr[type].d_prd];
214 resource = (unsigned char *)§ + pp->p_nrndx;
217 natp = getnatp(sect.sct_own);
219 * sect p_e (inc improvements)
223 p_e *= *resource / 100.0;
228 prodeff = prod_eff(type, natp->nat_level[pp->p_nlndx]);
233 for (i = 0; i < MAXPRCON; ++i) {
237 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
239 used = MIN(used, sect.sct_item[it] / pp->p_camt[i]);
240 unit_work += pp->p_camt[i];
245 * is production limited by resources or
248 max = (int)(work * p_e / (double)unit_work + 0.5);
249 if (resource && pp->p_nrdep != 0) {
250 if (*resource * 100 < pp->p_nrdep * max)
251 max = *resource * 100 / pp->p_nrdep;
253 act = MIN(used, max);
255 real = (double)act * prodeff;
256 maxr = (double)max * prodeff;
258 if (vtype != I_NONE) {
259 real = MIN(999.0, real);
260 maxr = MIN(999.0, maxr);
263 /* production backlog? */
264 there = MIN(ITEM_MAX, sect.sct_item[vtype]);
265 real = MIN(real, ITEM_MAX - there);
269 take = real / prodeff;
270 mtake = maxr / prodeff;
274 cost = take * pp->p_cost;
276 if (pp->p_level == NAT_TLEV) {
277 totpop = count_pop(sect.sct_own);
279 cost *= totpop / 50000.0;
283 for (i = 0; i < MAXPRCON; ++i) {
284 cmnem[i] = cuse[i] = cmax[i] = 0;
288 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
290 cmnem[i] = ichr[it].i_mnem;
291 cuse[i] = (int)(take * pp->p_camt[i] + 0.5);
292 cmax[i] = (int)(mtake * pp->p_camt[i] + 0.5);
295 if (pp->p_type != I_NONE)
296 mnem = ichr[vtype].i_mnem;
297 else if (pp->p_level == NAT_TLEV || pp->p_level == NAT_RLEV)
301 prprod(sect.sct_x, sect.sct_y, type, p_e, prodeff, work,
302 mnem, real, maxr, cost,
303 cmnem, cuse, cmax, nsect++);
305 player->simulation = 0;
308 pr("%s: No sector(s)\n", player->argp[1]);
310 pr("%s: No sector(s)\n", "");
313 pr("%d sector%s\n", nsect, splur(nsect));
318 prprod(coord x, coord y, int type, double p_e, double prodeff, int work,
319 char mnem, double make, double max, double cost,
320 char cmnem[], int cuse[], int cmax[], int nsect)
325 pr("PRODUCTION SIMULATION\n");
326 pr(" sect des eff avail make p.e. cost use1 use2 use3 max1 max2 max3 max\n");
329 prxy("%4d,%-4d", x, y);
330 pr(" %c %3.0f%% %5d", dchr[type].d_mnem, p_e * 100.0, work);
334 pr(" %4.0f%c", make, mnem ? mnem : ' ');
335 pr(" %.2f $%-5.0f", prodeff, cost);
336 for (i = 0; i < 3; i++) {
337 if (i < MAXPRCON && cmnem[i])
338 pr("%4d%c", cuse[i], cmnem[i]);
343 for (i = 0; i < 3; i++) {
344 if (i < MAXPRCON && cmnem[i])
345 pr("%4d%c", cmax[i], cmnem[i]);