2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, 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 */
91 s_char maxc[MAXPRCON][10];
92 s_char use[MAXPRCON][10];
103 if (!snxtsct(&nstr, player->argp[1]))
105 player->simulation = 1;
108 while (nxtsct(&nstr, §)) {
112 civs = min(9999, (int)((obrate * etu_per_update + 1.0)
113 * sect.sct_item[I_CIVIL]));
114 uws = min(9999, (int)((uwbrate * etu_per_update + 1.0)
115 * sect.sct_item[I_UW]));
116 natp = getnatp(sect.sct_own);
117 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
118 civs = min(civs, maxpop);
119 uws = min(uws, maxpop);
121 /* This isn't quite right, since research might rise/fall */
122 /* during the update, but it's the best we can really do */
123 wforce = (int)(((double)civs * sect.sct_work) / 100.0
125 + sect.sct_item[I_MILIT] * 2.0 / 5.0);
126 work = new_work(§, wforce * etu_per_update / 100);
131 type = sect.sct_type;
132 eff = sect.sct_effic;
133 if (sect.sct_newtype != type) {
134 twork = (eff + 3) / 4;
142 type = sect.sct_newtype;
146 if (!eff && dchr[otype].d_pkg == UPKG &&
147 dchr[type].d_pkg != UPKG) {
149 natp = getnatp(sect.sct_own);
151 max_pop(natp->nat_level[NAT_RLEV], 0));
153 max_pop(natp->nat_level[NAT_RLEV], 0));
155 civs = min(9999, civs);
156 uws = min(9999, uws);
158 wforce = (int)(((double)civs * sect.sct_work) / 100.0
160 + sect.sct_item[I_MILIT] * 2 / 5.0);
161 work = etu_per_update * wforce / 100;
162 bwork = min((int)(work / 2), bwork);
169 if (dchr[type].d_lcms > 0) {
170 lcms = sect.sct_item[I_LCM];
171 lcms /= dchr[type].d_lcms;
175 if (dchr[type].d_hcms > 0) {
176 hcms = sect.sct_item[I_HCM];
177 hcms /= dchr[type].d_hcms;
183 } else if (eff < 100) {
191 work = (work + 1) / 2 + bwork;
192 if (eff < 60 || (type != SCT_ENLIST && eff < 61))
199 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
202 pp = &pchr[dchr[type].d_prd];
204 natp = getnatp(sect.sct_own);
206 * sect p_e (inc improvements)
208 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
210 if (type == SCT_ENLIST)
212 if (pp->p_nrndx != 0) {
214 resource = ((s_char *)§) + pp->p_nrndx;
215 p_e = (*resource * p_e) / 100.0;
220 prodeff = prod_eff(pp, natp->nat_level[pp->p_nlndx]);
225 for (j = 0; j < MAXPRCON; ++j) {
229 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
231 used = min(used, sect.sct_item[it] / pp->p_camt[j]);
232 unit_work += pp->p_camt[j];
237 * is production limited by resources or
240 max = (int)(work * p_e / (double)unit_work + 0.5);
241 act = min(used, max);
243 real = dmin(999.0, (double)act * prodeff);
244 maxr = dmin(999.0, (double)max * prodeff);
246 if (vtype != I_NONE) {
249 /* production backlog? */
250 there = min(ITEM_MAX, sect.sct_item[vtype]);
251 real = dmin(real, ITEM_MAX - there);
255 take = real / prodeff;
256 mtake = maxr / prodeff;
260 cost = (int)(take * (double)pp->p_cost);
262 if (pp->p_level == NAT_TLEV) {
263 totpop = count_pop(sect.sct_own);
265 cost = (int)((double)cost * (double)totpop / 50000.0);
270 for (j = 0; j < MAXPRCON; ++j) {
272 if (it > I_NONE && it <= I_MAX && ichr[it].i_name != 0) {
273 if (CANT_HAPPEN(i >= 3))
275 sprintf(use[i], " %3d%c",
276 (int)((take * (double)pp->p_camt[j]) + 0.5),
278 sprintf(maxc[i], " %3d%c",
279 (int)((mtake * (double)pp->p_camt[j]) + 0.5),
286 strcpy(maxc[i], " ");
293 pr("PRODUCTION SIMULATION\n");
294 pr(" sect des eff wkfc will make- p.e. cost use1 use2 use3 max1 max2 max3 max\n");
297 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
298 pr(" %c", dchr[type].d_mnem);
299 pr(" %3.0f%%", p_e * 100.0);
302 if (vtype != I_NONE) {
303 pr(" %4d", (int)(real + 0.5));
304 } else if (type != SCT_ENLIST) {
305 switch (pp->p_level) {
323 civs = min(999, (int)((obrate * etu_per_update + 1.0)
324 * sect.sct_item[I_CIVIL]));
325 natp = getnatp(sect.sct_own);
326 maxpop = max_pop((float)natp->nat_level[NAT_RLEV], §);
327 civs = min(civs, maxpop);
328 /* This isn't quite right, since research might
329 rise/fall during the update, but it's the best
332 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
334 enlisted = (etu_per_update
335 * (10 + sect.sct_item[I_MILIT])
337 if (enlisted > maxmil)
342 if (natp->nat_priorities[type] == 0) {
345 pr(" %4d mil 1.00 $%-5d%3dc",
346 enlisted, enlisted * 3, enlisted);
352 pr(" %-5.5s", pp->p_sname);
353 pr(" %.2f", prodeff);
355 for (i = 0; i < 3; i++) {
359 for (i = 0; i < 3; i++) {
362 if (natp->nat_priorities[type] == 0) {
366 if (vtype != I_NONE || pp->p_level == NAT_ELEV
367 || pp->p_level == NAT_HLEV)
368 pr(" %4d\n", min(999, (int)(max * prodeff + 0.5)));
370 pr(" %1.2f\n", maxr);
372 player->simulation = 0;
375 pr("%s: No sector(s)\n", player->argp[1]);
377 pr("%s: No sector(s)\n", "");
380 pr("%d sector%s\n", nsect, splur(nsect));