2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2005, 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
54 for (i = 0; NULL != (sp = getsectid(i)); i++) {
57 if (sp->sct_oldown != n)
59 pop += sp->sct_item[I_CIVIL];
69 struct nstr_sect nstr;
72 double maxr; /* floating version of max */
74 double real; /* floating pt version of act */
77 int act; /* actual production */
80 int max; /* production w/infinite materials */
85 int unit_work; /* sum of component amounts */
86 int used; /* production w/infinite workforce */
90 s_char maxc[MAXPRCON][10];
91 s_char use[MAXPRCON][10];
102 if (!snxtsct(&nstr, player->argp[1]))
104 player->simulation = 1;
107 while (nxtsct(&nstr, §)) {
111 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
112 uws = (1.0 + uwbrate * etu_per_update) * sect.sct_item[I_UW];
113 natp = getnatp(sect.sct_own);
114 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
116 /* This isn't quite right, since research might rise/fall */
117 /* during the update, but it's the best we can really do */
118 work = new_work(§,
119 total_work(sect.sct_work, etu_per_update,
120 civs, sect.sct_item[I_MILIT], uws, maxpop));
125 type = sect.sct_type;
126 eff = sect.sct_effic;
127 if (sect.sct_newtype != type) {
128 twork = (eff + 3) / 4;
136 type = sect.sct_newtype;
140 if (!eff && dchr[otype].d_pkg == UPKG &&
141 dchr[type].d_pkg != UPKG) {
142 natp = getnatp(sect.sct_own);
143 maxpop = max_population(natp->nat_level[NAT_RLEV],
145 work = new_work(§,
146 total_work(sect.sct_work, etu_per_update,
147 civs, sect.sct_item[I_MILIT],
149 bwork = min(work / 2, bwork);
156 if (dchr[type].d_lcms > 0) {
157 lcms = sect.sct_item[I_LCM];
158 lcms /= dchr[type].d_lcms;
162 if (dchr[type].d_hcms > 0) {
163 hcms = sect.sct_item[I_HCM];
164 hcms /= dchr[type].d_hcms;
170 } else if (eff < 100) {
178 work = (work + 1) / 2 + bwork;
186 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
189 pp = &pchr[dchr[type].d_prd];
191 natp = getnatp(sect.sct_own);
193 * sect p_e (inc improvements)
195 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
197 if (type == SCT_ENLIST)
199 if (pp->p_nrndx != 0) {
201 resource = (u_char *)§ + pp->p_nrndx;
202 p_e = (*resource * p_e) / 100.0;
207 prodeff = prod_eff(pp, natp->nat_level[pp->p_nlndx]);
212 for (j = 0; j < MAXPRCON; ++j) {
216 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
218 used = min(used, sect.sct_item[it] / pp->p_camt[j]);
219 unit_work += pp->p_camt[j];
224 * is production limited by resources or
227 max = (int)(work * p_e / (double)unit_work + 0.5);
228 act = min(used, max);
230 real = dmin(999.0, (double)act * prodeff);
231 maxr = dmin(999.0, (double)max * prodeff);
233 if (vtype != I_NONE) {
236 /* production backlog? */
237 there = min(ITEM_MAX, sect.sct_item[vtype]);
238 real = dmin(real, ITEM_MAX - there);
242 take = real / prodeff;
243 mtake = maxr / prodeff;
247 cost = (int)(take * (double)pp->p_cost);
249 if (pp->p_level == NAT_TLEV) {
250 totpop = count_pop(sect.sct_own);
252 cost = (int)((double)cost * (double)totpop / 50000.0);
257 for (j = 0; j < MAXPRCON; ++j) {
259 if (it > I_NONE && it <= I_MAX && ichr[it].i_mnem != 0) {
260 if (CANT_HAPPEN(i >= 3))
262 sprintf(use[i], "%4d%c",
263 (int)((take * (double)pp->p_camt[j]) + 0.5),
265 sprintf(maxc[i], "%4d%c",
266 (int)((mtake * (double)pp->p_camt[j]) + 0.5),
273 strcpy(maxc[i], " ");
280 pr("PRODUCTION SIMULATION\n");
281 pr(" sect des eff avail make p.e. cost use1 use2 use3 max1 max2 max3 max\n");
284 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
285 pr(" %c", dchr[type].d_mnem);
286 pr(" %3.0f%%", p_e * 100.0);
289 if (vtype != I_NONE) {
290 pr(" %4d%c", (int)(real + 0.5), ichr[vtype].i_mnem);
291 } else if (type != SCT_ENLIST) {
292 switch (pp->p_level) {
302 CANT_HAPPEN("bad TYPE");
311 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
312 natp = getnatp(sect.sct_own);
313 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
314 civs = min(civs, maxpop);
315 /* This isn't quite right, since research might
316 rise/fall during the update, but it's the best
319 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
321 enlisted = (etu_per_update
322 * (10 + sect.sct_item[I_MILIT])
324 if (enlisted > maxmil)
329 if (natp->nat_priorities[type] == 0) {
332 pr(" %4d%c 1.00 $%-5d%4dc %4dc %5d\n",
333 enlisted, ichr[I_MILIT].i_mnem, enlisted * 3,
334 enlisted, enlisted, maxmil);
338 pr(" %.2f", prodeff);
340 for (i = 0; i < 3; i++) {
344 for (i = 0; i < 3; i++) {
347 if (natp->nat_priorities[type] == 0) {
351 if (vtype != I_NONE || pp->p_level == NAT_ELEV
352 || pp->p_level == NAT_HLEV)
353 pr(" %5d\n", min(999, (int)(max * prodeff + 0.5)));
355 pr(" %5.2f\n", maxr);
357 player->simulation = 0;
360 pr("%s: No sector(s)\n", player->argp[1]);
362 pr("%s: No sector(s)\n", "");
365 pr("%d sector%s\n", nsect, splur(nsect));