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 = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
113 uws = (1.0 + uwbrate * etu_per_update) * sect.sct_item[I_UW];
114 natp = getnatp(sect.sct_own);
115 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
116 civs = min(civs, maxpop);
117 uws = min(uws, maxpop);
119 /* This isn't quite right, since research might rise/fall */
120 /* during the update, but it's the best we can really do */
121 wforce = (int)(((double)civs * sect.sct_work) / 100.0
123 + sect.sct_item[I_MILIT] * 2.0 / 5.0);
124 work = new_work(§, wforce * etu_per_update / 100);
129 type = sect.sct_type;
130 eff = sect.sct_effic;
131 if (sect.sct_newtype != type) {
132 twork = (eff + 3) / 4;
140 type = sect.sct_newtype;
144 if (!eff && dchr[otype].d_pkg == UPKG &&
145 dchr[type].d_pkg != UPKG) {
146 natp = getnatp(sect.sct_own);
147 maxpop = max_population(natp->nat_level[NAT_RLEV],
149 civs = min(civs, maxpop);
150 uws = min(uws, maxpop);
151 wforce = (int)(((double)civs * sect.sct_work) / 100.0
153 + sect.sct_item[I_MILIT] * 2 / 5.0);
154 work = etu_per_update * wforce / 100;
155 bwork = min((int)(work / 2), bwork);
162 if (dchr[type].d_lcms > 0) {
163 lcms = sect.sct_item[I_LCM];
164 lcms /= dchr[type].d_lcms;
168 if (dchr[type].d_hcms > 0) {
169 hcms = sect.sct_item[I_HCM];
170 hcms /= dchr[type].d_hcms;
176 } else if (eff < 100) {
184 work = (work + 1) / 2 + bwork;
185 if (eff < 60 || (type != SCT_ENLIST && eff < 61))
192 if (dchr[type].d_prd == 0 && type != SCT_ENLIST)
195 pp = &pchr[dchr[type].d_prd];
197 natp = getnatp(sect.sct_own);
199 * sect p_e (inc improvements)
201 if (type == SCT_ENLIST && sect.sct_own != sect.sct_oldown)
203 if (type == SCT_ENLIST)
205 if (pp->p_nrndx != 0) {
207 resource = (u_char *)§ + pp->p_nrndx;
208 p_e = (*resource * p_e) / 100.0;
213 prodeff = prod_eff(pp, natp->nat_level[pp->p_nlndx]);
218 for (j = 0; j < MAXPRCON; ++j) {
222 if (CANT_HAPPEN(it <= I_NONE || I_MAX < it))
224 used = min(used, sect.sct_item[it] / pp->p_camt[j]);
225 unit_work += pp->p_camt[j];
230 * is production limited by resources or
233 max = (int)(work * p_e / (double)unit_work + 0.5);
234 act = min(used, max);
236 real = dmin(999.0, (double)act * prodeff);
237 maxr = dmin(999.0, (double)max * prodeff);
239 if (vtype != I_NONE) {
242 /* production backlog? */
243 there = min(ITEM_MAX, sect.sct_item[vtype]);
244 real = dmin(real, ITEM_MAX - there);
248 take = real / prodeff;
249 mtake = maxr / prodeff;
253 cost = (int)(take * (double)pp->p_cost);
255 if (pp->p_level == NAT_TLEV) {
256 totpop = count_pop(sect.sct_own);
258 cost = (int)((double)cost * (double)totpop / 50000.0);
263 for (j = 0; j < MAXPRCON; ++j) {
265 if (it > I_NONE && it <= I_MAX && ichr[it].i_name != 0) {
266 if (CANT_HAPPEN(i >= 3))
268 sprintf(use[i], "%4d%c",
269 (int)((take * (double)pp->p_camt[j]) + 0.5),
271 sprintf(maxc[i], "%4d%c",
272 (int)((mtake * (double)pp->p_camt[j]) + 0.5),
279 strcpy(maxc[i], " ");
286 pr("PRODUCTION SIMULATION\n");
287 pr(" sect des eff will make p.e. cost use1 use2 use3 max1 max2 max3 max\n");
290 prxy("%4d,%-4d", nstr.x, nstr.y, player->cnum);
291 pr(" %c", dchr[type].d_mnem);
292 pr(" %3.0f%%", p_e * 100.0);
294 if (vtype != I_NONE) {
295 pr(" %5d", (int)(real + 0.5));
296 } else if (type != SCT_ENLIST) {
297 switch (pp->p_level) {
307 CANT_HAPPEN("bad TYPE");
316 civs = (1.0 + obrate * etu_per_update) * sect.sct_item[I_CIVIL];
317 natp = getnatp(sect.sct_own);
318 maxpop = max_pop(natp->nat_level[NAT_RLEV], §);
319 civs = min(civs, maxpop);
320 /* This isn't quite right, since research might
321 rise/fall during the update, but it's the best
324 maxmil = (civs / 2) - sect.sct_item[I_MILIT];
326 enlisted = (etu_per_update
327 * (10 + sect.sct_item[I_MILIT])
329 if (enlisted > maxmil)
334 if (natp->nat_priorities[type] == 0) {
337 pr(" %5d mil 1.00 $%-5d%4dc %4dc %5d\n",
338 enlisted, enlisted * 3, enlisted, enlisted, maxmil);
342 pr(" %-7.7s", pp->p_sname);
343 pr(" %.2f", prodeff);
345 for (i = 0; i < 3; i++) {
349 for (i = 0; i < 3; i++) {
352 if (natp->nat_priorities[type] == 0) {
356 if (vtype != I_NONE || pp->p_level == NAT_ELEV
357 || pp->p_level == NAT_HLEV)
358 pr(" %5d\n", min(999, (int)(max * prodeff + 0.5)));
360 pr(" %5.2f\n", maxr);
362 player->simulation = 0;
365 pr("%s: No sector(s)\n", player->argp[1]);
367 pr("%s: No sector(s)\n", "");
370 pr("%d sector%s\n", nsect, splur(nsect));