2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2000, 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 * prod.c: Calculate production levels
30 * Known contributors to this file:
31 * David Muir Sharnoff, 1987
32 * Steve McClure, 1997-2000
49 count_pop(register int n)
55 for (i = 0; NULL != (sp = getsectid(i)); i++) {
58 if (sp->sct_oldown != n)
60 pop += sp->sct_item[I_CIVIL];
70 struct nstr_sect nstr;
73 double maxr; /* floating version of max */
75 double real; /* floating pt version of act */
78 int act; /* actual production */
81 int max; /* production w/infinate materials */
87 int totcomp; /* sum of component amounts */
88 int used; /* production w/infinite workforce */
91 u_short *amount; /* amount for component pointer */
92 u_char *comp; /* component pointer */
109 if (!snxtsct(&nstr, player->argp[1]))
111 player->simulation = 1;
114 while (nxtsct(&nstr, §)) {
118 civs = min(9999, (int)((obrate * etu_per_update + 1.0)
119 * sect.sct_item[I_CIVIL]));
120 uws = min(9999, (int)((uwbrate * etu_per_update + 1.0)
121 * sect.sct_item[I_UW]));
123 natp = getnatp(sect.sct_own);
124 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
125 civs = min(civs, maxpop);
126 uws = min(uws, maxpop);
127 } else { /* now RES_POP */
128 civs = min(999, civs);
132 /* This isn't quite right, since research might rise/fall */
133 /* during the update, but it's the best we can really do */
134 wforce = (int)(((double)civs * sect.sct_work) / 100.0
136 + sect.sct_item[I_MILIT] * 2.0 / 5.0);
137 work = (double)etu_per_update *(double)wforce / 100.0;
138 if (opt_ROLLOVER_AVAIL) {
139 if (sect.sct_type == sect.sct_newtype) {
140 work += sect.sct_avail;
142 if (work > 999) work = 999;
144 bwork = (int)((double)work / 2.0);
148 type = sect.sct_type;
149 eff = sect.sct_effic;
150 if (sect.sct_newtype != type) {
151 twork = (eff + 3) / 4;
159 type = sect.sct_newtype;
163 if (!eff && dchr[otype].d_pkg == UPKG &&
164 dchr[type].d_pkg != UPKG) {
166 natp = getnatp(sect.sct_own);
169 max_pop(natp->nat_level[NAT_RLEV], 0));
172 max_pop(natp->nat_level[NAT_RLEV], 0));
174 civs = min(9999, civs);
175 uws = min(9999, uws);
177 wforce = (int)(((double)civs * sect.sct_work) / 100.0
179 + sect.sct_item[I_MILIT] * 2 / 5.0);
180 work = etu_per_update * wforce / 100.0;
181 bwork = min((int)(work / 2), bwork);
188 if (dchr[type].d_lcms > 0) {
189 lcms = sect.sct_item[I_LCM];
190 lcms /= dchr[type].d_lcms;
194 if (dchr[type].d_hcms > 0) {
195 hcms = sect.sct_item[I_HCM];
196 hcms /= dchr[type].d_hcms;
202 } else if (eff < 100) {
210 work = work / 2 + bwork;
211 if (eff < 60 || (type != SCT_ENLIST && eff < 61))
218 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
221 pp = &pchr[dchr[type].d_prd];
223 natp = getnatp(sect.sct_own);
225 * sect effic (inc improvements)
227 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
229 if (type == SCT_ENLIST)
231 if (pp->p_nrndx != 0) {
233 resource = ((s_char *)§) + pp->p_nrndx;
234 effic = (*resource * effic) / 100.0;
235 if (pp->p_nrdep > 0) {
236 maxtake = (*resource * 100.0) / pp->p_nrdep;
244 if (pp->p_nlndx >= 0) {
245 prodeff = natp->nat_level[pp->p_nlndx] - pp->p_nlmin;
249 prodeff = prodeff / (prodeff + pp->p_nllag);
255 endcomp = pp->p_vtype + pp->p_nv;
257 while (comp < endcomp) {
261 used = min(used, sect.sct_item[(int)*comp] / *amount);
270 * is production limited by resources or
273 max = (int)(work * effic / (double)totcomp) + 0.5;
274 act = min(used, max);
276 * some things are easier to make.. food,
279 act = (int)(((double)pp->p_effic * 0.01 * (double)act) + 0.5);
280 max = (int)(((double)pp->p_effic * 0.01 * (double)max) + 0.5);
282 real = (double)act *(double)prodeff;
283 maxr = (double)max *(double)prodeff;
288 /* production backlog? */
289 if ((there = sect.sct_item[vtype]) >= 9999) {
292 act = min(act, (9999 - there));
293 max = min(max, (9999 - there));
297 take = real / prodeff;
298 mtake = maxr / prodeff;
307 take = (double)take / ((double)pp->p_effic * 0.01);
308 mtake = (double)mtake / ((double)pp->p_effic * 0.01);
310 cost = (int)(take * (double)pp->p_cost);
312 if (pp->p_level == NAT_TLEV) {
313 totpop = count_pop(sect.sct_own);
315 cost = (int)((double)cost * (double)totpop / 50000.0);
322 while (comp < endcomp) {
323 it = unitem((int)*comp);
324 if (it > 0 && it <= I_MAX && ichr[it].i_name != 0)
325 c = ichr[it].i_name[0];
328 (void)sprintf(use[i], " %3d%c",
329 (int)((take * (double)(*amount)) + 0.5), c);
330 (void)sprintf(maxc[i], " %3d%c",
331 (int)((mtake * (double)(*amount)) + 0.5), c);
338 strcpy(maxc[i], " ");
345 pr("PRODUCTION SIMULATION\n");
346 pr(" sect des eff wkfc will make- p.e. cost use1 use2 use3 max1 max2 max3 max\n");
349 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
350 pr(" %c", dchr[type].d_mnem);
351 pr(" %3.0f%%", effic * 100.0);
355 pr(" %4d", (int)(real + 0.5));
356 } else if (type != SCT_ENLIST) {
357 switch (pp->p_level) {
375 civs = min(999, (int)((obrate * etu_per_update + 1.0)
376 * sect.sct_item[I_CIVIL]));
377 natp = getnatp(sect.sct_own);
378 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
379 civs = min(civs, maxpop);
380 /* This isn't quite right, since research might
381 rise/fall during the update, but it's the best
384 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
386 enlisted = (etu_per_update
387 * (10 + sect.sct_item[I_MILIT])
389 if (enlisted > maxmil)
394 if (natp->nat_priorities[type] == 0) {
397 pr(" %4d mil 1.00 $%-5d%3dc",
398 enlisted, enlisted * 3, enlisted);
400 enlisted, maxmil, maxmil);
404 pr(" %-5.5s", pp->p_sname);
405 prodeff = prodeff * (double)pp->p_effic * 0.01;
406 pr(" %.2f", prodeff);
408 for (i = 0; i < 3; i++) {
412 for (i = 0; i < 3; i++) {
415 if (natp->nat_priorities[type] == 0) {
419 if (vtype != 0 || pp->p_level == NAT_ELEV
420 || pp->p_level == NAT_HLEV)
421 pr(" %4d\n", min(999, (int)(max * prodeff + 0.05)));
423 pr(" %1.2f\n", maxr);
425 player->simulation = 0;
428 pr("%s: No sector(s)\n", player->argp[1]);
430 pr("%s: No sector(s)\n", "");
433 pr("%d sector%s\n", nsect, splur(nsect));