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];
98 if (!snxtsct(&nstr, player->argp[1]))
100 player->simulation = 1;
103 while (nxtsct(&nstr, §)) {
109 natp = getnatp(sect.sct_own);
110 work = do_feed(§, natp, etu_per_update, 1);
113 type = sect.sct_type;
114 eff = sect.sct_effic;
115 if (sect.sct_newtype != type) {
116 twork = (eff + 3) / 4;
123 type = sect.sct_newtype;
130 if (dchr[type].d_lcms > 0) {
131 lcms = sect.sct_item[I_LCM];
132 lcms /= dchr[type].d_lcms;
136 if (dchr[type].d_hcms > 0) {
137 hcms = sect.sct_item[I_HCM];
138 hcms /= dchr[type].d_hcms;
144 } else if (eff < 100) {
152 work = (work + 1) / 2 + bwork;
156 if (type == SCT_ENLIST) {
160 if (sect.sct_own != sect.sct_oldown)
163 maxmil = sect.sct_item[I_CIVIL] / 2 - sect.sct_item[I_MILIT];
165 enlisted = (etu_per_update
166 * (10 + sect.sct_item[I_MILIT])
168 if (enlisted > maxmil)
173 prprod(sect.sct_x, sect.sct_y, type, eff / 100.0, 1.0, work,
174 ichr[I_MILIT].i_mnem, enlisted, maxmil, enlisted * 3,
175 "c\0\0", &enlisted, &enlisted, nsect++);
179 if (dchr[type].d_prd < 0)
181 pp = &pchr[dchr[type].d_prd];
184 resource = (unsigned char *)§ + pp->p_nrndx;
188 mat_limit = prod_materials_cost(pp, sect.sct_item, &unit_work);
194 p_e *= *resource / 100.0;
199 worker_limit = work * p_e / (double)unit_work;
200 res_limit = prod_resource_limit(pp, resource);
202 max_consume = res_limit;
203 if (max_consume > worker_limit)
204 max_consume = (int)worker_limit;
205 material_consume = MIN(max_consume, mat_limit);
207 prodeff = prod_eff(type, natp->nat_level[pp->p_nlndx]);
208 real = (double)material_consume * prodeff;
209 maxr = (double)max_consume * prodeff;
211 if (vtype != I_NONE) {
212 real = MIN(999.0, real);
213 maxr = MIN(999.0, maxr);
216 /* production backlog? */
217 there = MIN(ITEM_MAX, sect.sct_item[vtype]);
218 real = MIN(real, ITEM_MAX - there);
222 take = real / prodeff;
223 mtake = maxr / prodeff;
227 cost = take * pp->p_cost;
229 if (pp->p_level == NAT_TLEV) {
230 totpop = count_pop(sect.sct_own);
232 cost *= totpop / 50000.0;
236 for (i = 0; i < MAXPRCON; ++i) {
237 cmnem[i] = cuse[i] = cmax[i] = 0;
241 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
243 cmnem[i] = ichr[it].i_mnem;
244 cuse[i] = (int)(take * pp->p_camt[i] + 0.5);
245 cmax[i] = (int)(mtake * pp->p_camt[i] + 0.5);
248 if (pp->p_type != I_NONE)
249 mnem = ichr[vtype].i_mnem;
250 else if (pp->p_level == NAT_TLEV || pp->p_level == NAT_RLEV)
254 prprod(sect.sct_x, sect.sct_y, type, p_e, prodeff, work,
255 mnem, real, maxr, cost,
256 cmnem, cuse, cmax, nsect++);
258 player->simulation = 0;
261 pr("%s: No sector(s)\n", player->argp[1]);
263 pr("%s: No sector(s)\n", "");
266 pr("%d sector%s\n", nsect, splur(nsect));
271 prprod(coord x, coord y, int type, double p_e, double prodeff, int work,
272 char mnem, double make, double max, double cost,
273 char cmnem[], int cuse[], int cmax[], int nsect)
278 pr("PRODUCTION SIMULATION\n");
279 pr(" sect des eff avail make p.e. cost use1 use2 use3 max1 max2 max3 max\n");
282 prxy("%4d,%-4d", x, y);
283 pr(" %c %3.0f%% %5d", dchr[type].d_mnem, p_e * 100.0, work);
287 pr(" %4.0f%c", make, mnem ? mnem : ' ');
288 pr(" %.2f $%-5.0f", prodeff, cost);
289 for (i = 0; i < 3; i++) {
290 if (i < MAXPRCON && cmnem[i])
291 pr("%4d%c", cuse[i], cmnem[i]);
296 for (i = 0; i < 3; i++) {
297 if (i < MAXPRCON && cmnem[i])
298 pr("%4d%c", cmax[i], cmnem[i]);