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)
56 for (i = 0; NULL != (sp = getsectid(i)); i++) {
59 if (sp->sct_oldown != n)
61 if (getvec(VT_ITEM, vec, (s_char *)sp, EF_SECTOR) <= 0)
71 extern double obrate, uwbrate;
72 extern int etu_per_update;
75 struct nstr_sect nstr;
78 double maxr; /* floating version of max */
80 double real; /* floating pt version of act */
83 int act; /* actual production */
86 int max; /* production w/infinate materials */
92 int totcomp; /* sum of component amounts */
93 int used; /* production w/infinite workforce */
96 u_short *amount; /* amount for component pointer */
97 u_char *comp; /* component pointer */
105 int vec[I_MAX+1], lcms, hcms;
115 if (!snxtsct(&nstr, player->argp[1]))
117 player->simulation = 1;
120 while (nxtsct(&nstr, §)) {
123 getvec(VT_ITEM, items, (s_char *)§, EF_SECTOR);
125 civs = min(9999, (int) ((obrate * (double) etu_per_update + 1.0)
126 * (double) items[I_CIVIL]));
127 uws = min(9999, (int) ((uwbrate * (double) etu_per_update + 1.0)
128 * (double) items[I_UW]));
130 natp = getnatp(sect.sct_own);
131 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
132 civs = min(civs, maxpop);
133 uws = min(uws, maxpop);
134 } else { /* now RES_POP */
135 civs = min(999,civs);
139 /* This isn't quite right, since research might rise/fall */
140 /* during the update, but it's the best we can really do */
141 wforce = (int)(((double)civs * (double)sect.sct_work)
142 / 100.0 + (double)uws + (double)items[I_MILIT] * 2.0 / 5.0);
143 work = (double)etu_per_update * (double)wforce / 100.0;
144 bwork = (int)((double)work / 2.0);
148 type = sect.sct_type;
149 eff = sect.sct_effic;
150 if(sect.sct_newtype != type) {
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);
167 civs = min(civs, max_pop(natp->nat_level[NAT_RLEV],0));
168 uws = min(uws, max_pop(natp->nat_level[NAT_RLEV], 0));
170 civs = min(9999,civs);
173 wforce = (int)((civs * sect.sct_work) / 100.0 + uws + items[I_MILIT] * 2 / 5.0);
174 work = etu_per_update * wforce / 100.0;
175 bwork = min((int)(work/2), bwork);
182 getvec(VT_ITEM, vec, (s_char *)§, EF_SECTOR);
183 if (dchr[type].d_lcms>0){
185 lcms /= dchr[type].d_lcms;
189 if (dchr[type].d_hcms>0){
191 hcms /= dchr[type].d_hcms;
197 } else if (eff < 100) {
205 work = work/2 + bwork;
206 if (eff < 60 || (type != SCT_ENLIST && eff < 61))
213 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
216 pp = &pchr[dchr[type].d_prd];
218 natp = getnatp(sect.sct_own);
220 * sect effic (inc improvements)
222 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
224 if (type == SCT_ENLIST)
226 if (pp->p_nrndx != 0) {
228 resource = ((s_char *) §) + pp->p_nrndx;
229 effic = (*resource * effic) / 100.0;
230 if (pp->p_nrdep > 0) {
231 maxtake = (*resource * 100.0) / pp->p_nrdep;
239 if (pp->p_nlndx >= 0) {
240 prodeff = natp->nat_level[pp->p_nlndx] - pp->p_nlmin;
244 prodeff = prodeff / (prodeff + pp->p_nllag);
250 endcomp = pp->p_vtype + pp->p_nv;
252 while (comp < endcomp) {
256 used = min(used, (int)(getvar((int)*comp, (s_char *)§,
257 EF_SECTOR) / *amount));
266 * is production limited by resources or
269 max = (int) (work * effic / (double) totcomp) + 0.5;
270 act = min(used, max);
272 * some things are easier to make.. food,
275 act = (int) (((double)pp->p_effic * 0.01 * (double)act) + 0.5);
276 max = (int) (((double)pp->p_effic * 0.01 * (double)max) + 0.5);
278 real = (double)act * (double)prodeff;
279 maxr = (double)max * (double)prodeff;
284 /* production backlog? */
285 if ((there = getvar((int)vtype, (s_char *)§, EF_SECTOR)) >= 9999) {
288 act = min(act, (9999 - there));
289 max = min(max, (9999 - there));
293 take = real / prodeff;
294 mtake = maxr / prodeff;
303 take = (double)take / ((double)pp->p_effic * 0.01);
304 mtake = (double)mtake / ((double)pp->p_effic * 0.01);
306 cost = (int)(take * (double)pp->p_cost);
308 if (pp->p_level == NAT_TLEV) {
309 totpop = count_pop(sect.sct_own);
311 cost = (int)((double)cost * (double)totpop / 50000.0);
318 while (comp < endcomp) {
319 it = unitem((int) *comp);
320 if (it > 0 && it <= I_MAX && ichr[it].i_name != 0)
321 c = ichr[it].i_name[0];
324 (void) sprintf(use[i], " %3d%c", (int)((take * (double)(*amount)) + 0.5), c);
325 (void) sprintf(maxc[i], " %3d%c", (int)((mtake * (double)(*amount)) + 0.5), c);
332 strcpy(maxc[i], " ");
339 pr("PRODUCTION SIMULATION\n");
340 pr(" sect des eff wkfc will make- p.e. cost use1 use2 use3 max1 max2 max3 max\n");
343 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
344 pr(" %c", dchr[type].d_mnem);
345 pr(" %3.0f%%", effic * 100.0);
349 pr(" %4d", (int)(real + 0.5));
350 } else if (type != SCT_ENLIST) {
351 switch (pp->p_level) {
369 civs = min(999, (int) ((obrate * (double) etu_per_update + 1.0)
370 * (double) items[I_CIVIL]));
371 natp = getnatp(sect.sct_own);
372 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
373 civs = min(civs, maxpop);
374 /* This isn't quite right, since research might
375 rise/fall during the update, but it's the best
378 maxmil = (civs / 2) - items[I_MILIT];
380 enlisted = (etu_per_update * (10 + items[I_MILIT]) * 0.05);
381 if (enlisted > maxmil)
386 if (natp->nat_priorities[type] == 0){
389 pr(" %4d mil 1.00 $%-5d%3dc",
390 enlisted, enlisted * 3, enlisted);
392 enlisted, maxmil, maxmil);
396 pr(" %-5.5s", pp->p_sname);
397 prodeff = prodeff * (double)pp->p_effic * 0.01;
398 pr(" %.2f", prodeff);
400 for (i = 0; i < 3; i++) {
404 for (i = 0; i < 3; i++) {
407 if (natp->nat_priorities[type] == 0){
411 if (vtype != 0 || pp->p_level == NAT_ELEV
412 || pp->p_level == NAT_HLEV)
413 pr(" %4d\n", min(999,(int)(max * prodeff + 0.05)));
415 pr(" %1.2f\n", maxr);
417 player->simulation = 0;
420 pr("%s: No sector(s)\n", player->argp[1]);
422 pr("%s: No sector(s)\n", "");
425 pr("%d sector%s\n", nsect, splur(nsect));