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 * 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-2016
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 material_consume; /* actual production */
78 int max_consume; /* production w/infinite materials */
83 int unit_work; /* sum of component amounts */
84 int mat_limit, res_limit;
88 unsigned char *resource;
90 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 maxworkers = max_workers(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;
133 type = sect.sct_newtype;
140 if (dchr[type].d_lcms > 0) {
141 lcms = sect.sct_item[I_LCM];
142 lcms /= dchr[type].d_lcms;
146 if (dchr[type].d_hcms > 0) {
147 hcms = sect.sct_item[I_HCM];
148 hcms /= dchr[type].d_hcms;
154 } else if (eff < 100) {
162 work = (work + 1) / 2 + bwork;
166 if (type == SCT_ENLIST) {
167 int maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
171 if (sect.sct_own != sect.sct_oldown)
174 maxmil = MIN(civs, maxpop) / 2 - sect.sct_item[I_MILIT];
176 enlisted = (etu_per_update
177 * (10 + sect.sct_item[I_MILIT])
179 if (enlisted > maxmil)
184 prprod(sect.sct_x, sect.sct_y, type, eff / 100.0, 1.0, work,
185 ichr[I_MILIT].i_mnem, enlisted, maxmil, enlisted * 3,
186 "c\0\0", &enlisted, &enlisted, nsect++);
190 if (dchr[type].d_prd < 0)
192 pp = &pchr[dchr[type].d_prd];
195 resource = (unsigned char *)§ + pp->p_nrndx;
199 mat_limit = prod_materials_cost(pp, sect.sct_item, &unit_work);
205 p_e *= *resource / 100.0;
210 worker_limit = work * p_e / (double)unit_work;
211 res_limit = prod_resource_limit(pp, resource);
213 max_consume = res_limit;
214 if (max_consume > worker_limit)
215 max_consume = (int)worker_limit;
216 material_consume = MIN(max_consume, mat_limit);
218 prodeff = prod_eff(type, natp->nat_level[pp->p_nlndx]);
219 real = (double)material_consume * prodeff;
220 maxr = (double)max_consume * prodeff;
222 if (vtype != I_NONE) {
223 real = MIN(999.0, real);
224 maxr = MIN(999.0, maxr);
227 /* production backlog? */
228 there = MIN(ITEM_MAX, sect.sct_item[vtype]);
229 real = MIN(real, ITEM_MAX - there);
233 take = real / prodeff;
234 mtake = maxr / prodeff;
238 cost = take * pp->p_cost;
240 if (pp->p_level == NAT_TLEV) {
241 totpop = count_pop(sect.sct_own);
243 cost *= totpop / 50000.0;
247 for (i = 0; i < MAXPRCON; ++i) {
248 cmnem[i] = cuse[i] = cmax[i] = 0;
252 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
254 cmnem[i] = ichr[it].i_mnem;
255 cuse[i] = (int)(take * pp->p_camt[i] + 0.5);
256 cmax[i] = (int)(mtake * pp->p_camt[i] + 0.5);
259 if (pp->p_type != I_NONE)
260 mnem = ichr[vtype].i_mnem;
261 else if (pp->p_level == NAT_TLEV || pp->p_level == NAT_RLEV)
265 prprod(sect.sct_x, sect.sct_y, type, p_e, prodeff, work,
266 mnem, real, maxr, cost,
267 cmnem, cuse, cmax, nsect++);
269 player->simulation = 0;
272 pr("%s: No sector(s)\n", player->argp[1]);
274 pr("%s: No sector(s)\n", "");
277 pr("%d sector%s\n", nsect, splur(nsect));
282 prprod(coord x, coord y, int type, double p_e, double prodeff, int work,
283 char mnem, double make, double max, double cost,
284 char cmnem[], int cuse[], int cmax[], int nsect)
289 pr("PRODUCTION SIMULATION\n");
290 pr(" sect des eff avail make p.e. cost use1 use2 use3 max1 max2 max3 max\n");
293 prxy("%4d,%-4d", x, y);
294 pr(" %c %3.0f%% %5d", dchr[type].d_mnem, p_e * 100.0, work);
298 pr(" %4.0f%c", make, mnem ? mnem : ' ');
299 pr(" %.2f $%-5.0f", prodeff, cost);
300 for (i = 0; i < 3; i++) {
301 if (i < MAXPRCON && cmnem[i])
302 pr("%4d%c", cuse[i], cmnem[i]);
307 for (i = 0; i < 3; i++) {
308 if (i < MAXPRCON && cmnem[i])
309 pr("%4d%c", cmax[i], cmnem[i]);