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;
139 if (!eff && IS_BIG_CITY(otype) &&
140 !IS_BIG_CITY(type)) {
141 natp = getnatp(sect.sct_own);
142 maxpop = max_population(natp->nat_level[NAT_RLEV],
144 work = new_work(§,
145 total_work(sect.sct_work, etu_per_update,
146 civs, sect.sct_item[I_MILIT],
148 bwork = min(work / 2, bwork);
154 if (dchr[type].d_lcms > 0) {
155 lcms = sect.sct_item[I_LCM];
156 lcms /= dchr[type].d_lcms;
160 if (dchr[type].d_hcms > 0) {
161 hcms = sect.sct_item[I_HCM];
162 hcms /= dchr[type].d_hcms;
168 } else if (eff < 100) {
176 work = (work + 1) / 2 + bwork;
184 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
187 pp = &pchr[dchr[type].d_prd];
189 natp = getnatp(sect.sct_own);
191 * sect p_e (inc improvements)
193 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
195 if (type == SCT_ENLIST)
197 if (pp->p_nrndx != 0) {
199 resource = (u_char *)§ + pp->p_nrndx;
200 p_e = (*resource * p_e) / 100.0;
205 prodeff = prod_eff(pp, natp->nat_level[pp->p_nlndx]);
210 for (j = 0; j < MAXPRCON; ++j) {
214 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
216 used = min(used, sect.sct_item[it] / pp->p_camt[j]);
217 unit_work += pp->p_camt[j];
222 * is production limited by resources or
225 max = (int)(work * p_e / (double)unit_work + 0.5);
226 act = min(used, max);
228 real = dmin(999.0, (double)act * prodeff);
229 maxr = dmin(999.0, (double)max * prodeff);
231 if (vtype != I_NONE) {
234 /* production backlog? */
235 there = min(ITEM_MAX, sect.sct_item[vtype]);
236 real = dmin(real, ITEM_MAX - there);
240 take = real / prodeff;
241 mtake = maxr / prodeff;
245 cost = (int)(take * (double)pp->p_cost);
247 if (pp->p_level == NAT_TLEV) {
248 totpop = count_pop(sect.sct_own);
250 cost = (int)((double)cost * (double)totpop / 50000.0);
255 for (j = 0; j < MAXPRCON; ++j) {
257 if (it > I_NONE && it <= I_MAX && ichr[it].i_mnem != 0) {
258 if (CANT_HAPPEN(i >= 3))
260 sprintf(use[i], "%4d%c",
261 (int)((take * (double)pp->p_camt[j]) + 0.5),
263 sprintf(maxc[i], "%4d%c",
264 (int)((mtake * (double)pp->p_camt[j]) + 0.5),
271 strcpy(maxc[i], " ");
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", nstr.x, nstr.y, player->cnum);
283 pr(" %c", dchr[type].d_mnem);
284 pr(" %3.0f%%", p_e * 100.0);
287 if (vtype != I_NONE) {
288 pr(" %4d%c", (int)(real + 0.5), ichr[vtype].i_mnem);
289 } else if (type != SCT_ENLIST) {
290 switch (pp->p_level) {
300 CANT_HAPPEN("bad TYPE");
309 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
310 natp = getnatp(sect.sct_own);
311 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
312 civs = min(civs, maxpop);
313 /* This isn't quite right, since research might
314 rise/fall during the update, but it's the best
317 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
319 enlisted = (etu_per_update
320 * (10 + sect.sct_item[I_MILIT])
322 if (enlisted > maxmil)
327 if (natp->nat_priorities[type] == 0) {
330 pr(" %4d%c 1.00 $%-5d%4dc %4dc %5d\n",
331 enlisted, ichr[I_MILIT].i_mnem, enlisted * 3,
332 enlisted, enlisted, maxmil);
336 pr(" %.2f", prodeff);
338 for (i = 0; i < 3; i++) {
342 for (i = 0; i < 3; i++) {
345 if (natp->nat_priorities[type] == 0) {
349 if (vtype != I_NONE || pp->p_level == NAT_ELEV
350 || pp->p_level == NAT_HLEV)
351 pr(" %5d\n", min(999, (int)(max * prodeff + 0.5)));
353 pr(" %5.2f\n", maxr);
355 player->simulation = 0;
358 pr("%s: No sector(s)\n", player->argp[1]);
360 pr("%s: No sector(s)\n", "");
363 pr("%d sector%s\n", nsect, splur(nsect));