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/infinite materials */
86 int unit_work; /* sum of component amounts */
87 int used; /* production w/infinite workforce */
92 s_char maxc[MAXPRCON][10];
93 s_char use[MAXPRCON][10];
104 if (!snxtsct(&nstr, player->argp[1]))
106 player->simulation = 1;
109 while (nxtsct(&nstr, §)) {
113 civs = min(9999, (int)((obrate * etu_per_update + 1.0)
114 * sect.sct_item[I_CIVIL]));
115 uws = min(9999, (int)((uwbrate * etu_per_update + 1.0)
116 * sect.sct_item[I_UW]));
118 natp = getnatp(sect.sct_own);
119 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
120 civs = min(civs, maxpop);
121 uws = min(uws, maxpop);
122 } else { /* now RES_POP */
123 civs = min(999, civs);
127 /* This isn't quite right, since research might rise/fall */
128 /* during the update, but it's the best we can really do */
129 wforce = (int)(((double)civs * sect.sct_work) / 100.0
131 + sect.sct_item[I_MILIT] * 2.0 / 5.0);
132 work = new_work(§, wforce * etu_per_update / 100);
137 type = sect.sct_type;
138 eff = sect.sct_effic;
139 if (sect.sct_newtype != type) {
140 twork = (eff + 3) / 4;
148 type = sect.sct_newtype;
152 if (!eff && dchr[otype].d_pkg == UPKG &&
153 dchr[type].d_pkg != UPKG) {
155 natp = getnatp(sect.sct_own);
157 max_pop(natp->nat_level[NAT_RLEV], 0));
159 max_pop(natp->nat_level[NAT_RLEV], 0));
161 civs = min(9999, civs);
162 uws = min(9999, uws);
164 wforce = (int)(((double)civs * sect.sct_work) / 100.0
166 + sect.sct_item[I_MILIT] * 2 / 5.0);
167 work = etu_per_update * wforce / 100;
168 bwork = min((int)(work / 2), bwork);
175 if (dchr[type].d_lcms > 0) {
176 lcms = sect.sct_item[I_LCM];
177 lcms /= dchr[type].d_lcms;
181 if (dchr[type].d_hcms > 0) {
182 hcms = sect.sct_item[I_HCM];
183 hcms /= dchr[type].d_hcms;
189 } else if (eff < 100) {
197 work = (work + 1) / 2 + bwork;
198 if (eff < 60 || (type != SCT_ENLIST && eff < 61))
205 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
208 pp = &pchr[dchr[type].d_prd];
210 natp = getnatp(sect.sct_own);
212 * sect p_e (inc improvements)
214 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
216 if (type == SCT_ENLIST)
218 if (pp->p_nrndx != 0) {
220 resource = ((s_char *)§) + pp->p_nrndx;
221 p_e = (*resource * p_e) / 100.0;
226 prodeff = prod_eff(pp, natp->nat_level[pp->p_nlndx]);
231 for (j = 0; j < MAXPRCON; ++j) {
235 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
237 used = min(used, sect.sct_item[it] / pp->p_camt[j]);
238 unit_work += pp->p_camt[j];
243 * is production limited by resources or
246 max = (int)(work * p_e / (double)unit_work + 0.5);
247 act = min(used, max);
249 real = dmin(999.0, (double)act * prodeff);
250 maxr = dmin(999.0, (double)max * prodeff);
255 /* production backlog? */
256 there = min(ITEM_MAX, sect.sct_item[vtype]);
257 real = dmin(real, ITEM_MAX - there);
261 take = real / prodeff;
262 mtake = maxr / prodeff;
266 cost = (int)(take * (double)pp->p_cost);
268 if (pp->p_level == NAT_TLEV) {
269 totpop = count_pop(sect.sct_own);
271 cost = (int)((double)cost * (double)totpop / 50000.0);
276 for (j = 0; j < MAXPRCON; ++j) {
278 if (it > I_NONE && it <= I_MAX && ichr[it].i_name != 0) {
279 if (CANT_HAPPEN(i >= 3))
281 sprintf(use[i], " %3d%c",
282 (int)((take * (double)pp->p_camt[j]) + 0.5),
284 sprintf(maxc[i], " %3d%c",
285 (int)((mtake * (double)pp->p_camt[j]) + 0.5),
292 strcpy(maxc[i], " ");
299 pr("PRODUCTION SIMULATION\n");
300 pr(" sect des eff wkfc will make- p.e. cost use1 use2 use3 max1 max2 max3 max\n");
303 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
304 pr(" %c", dchr[type].d_mnem);
305 pr(" %3.0f%%", p_e * 100.0);
309 pr(" %4d", (int)(real + 0.5));
310 } else if (type != SCT_ENLIST) {
311 switch (pp->p_level) {
329 civs = min(999, (int)((obrate * etu_per_update + 1.0)
330 * sect.sct_item[I_CIVIL]));
331 natp = getnatp(sect.sct_own);
332 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
333 civs = min(civs, maxpop);
334 /* This isn't quite right, since research might
335 rise/fall during the update, but it's the best
338 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
340 enlisted = (etu_per_update
341 * (10 + sect.sct_item[I_MILIT])
343 if (enlisted > maxmil)
348 if (natp->nat_priorities[type] == 0) {
351 pr(" %4d mil 1.00 $%-5d%3dc",
352 enlisted, enlisted * 3, enlisted);
358 pr(" %-5.5s", pp->p_sname);
359 pr(" %.2f", prodeff);
361 for (i = 0; i < 3; i++) {
365 for (i = 0; i < 3; i++) {
368 if (natp->nat_priorities[type] == 0) {
372 if (vtype != 0 || pp->p_level == NAT_ELEV
373 || pp->p_level == NAT_HLEV)
374 pr(" %4d\n", min(999, (int)(max * prodeff + 0.05)));
376 pr(" %1.2f\n", maxr);
378 player->simulation = 0;
381 pr("%s: No sector(s)\n", player->argp[1]);
383 pr("%s: No sector(s)\n", "");
386 pr("%d sector%s\n", nsect, splur(nsect));