2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2016, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * prepare.c: Perform prelimiary updates of sectors
29 * Known contributors to this file:
31 * Thomas Ruschak, 1992
33 * Markus Armbruster, 2016
46 #include "prototypes.h"
51 prepare_sects(int etu)
55 int n, civ_tax, uw_tax, mil_pay;
57 memset(levels, 0, sizeof(levels));
59 /* Process all the fallout. */
61 if (!player->simulation) {
62 /* First, we determine which sectors to process fallout in */
63 for (n = 0; NULL != (sp = getsectid(n)); n++)
64 sp->sct_updated = sp->sct_fallout != 0;
65 /* Next, we process the fallout there */
66 for (n = 0; NULL != (sp = getsectid(n)); n++)
69 /* Next, we spread the fallout */
70 for (n = 0; NULL != (sp = getsectid(n)); n++)
72 spread_fallout(sp, etu);
73 /* Next, we decay the fallout */
74 for (n = 0; NULL != (sp = getsectid(n)); n++)
76 decay_fallout(sp, etu);
79 for (n = 0; NULL != (sp = getsectid(n)); n++) {
82 if (sp->sct_type == SCT_WATER)
84 if (getnatp(sp->sct_own)->nat_stat == STAT_SANCT)
88 * When running the test suite, reseed PRNG for each sector
89 * with its UID, to keep results stable even when the number
90 * of PRNs consumed changes.
92 if (running_test_suite)
93 seed_prng(sp->sct_uid);
98 np = getnatp(sp->sct_own);
99 tax(sp, etu, &pops[sp->sct_own], &civ_tax, &uw_tax, &mil_pay);
100 np->nat_money += civ_tax + uw_tax + mil_pay;
101 if (sp->sct_type == SCT_BANK)
102 np->nat_money += bank_income(sp, etu);
104 for (n = 0; NULL != (np = getnatp(n)); n++) {
105 np->nat_money += upd_slmilcosts(np->nat_cnum, etu);
110 tax(struct sctstr *sp, int etu, int *pop, int *civ_tax,
111 int *uw_tax, int *mil_pay)
113 *civ_tax = (int)(0.5 + sp->sct_item[I_CIVIL] * sp->sct_effic *
114 etu * money_civ / 100);
116 * captured civs only pay 1/4 taxes
118 if (sp->sct_own != sp->sct_oldown)
119 *civ_tax = *civ_tax / 4;
120 *uw_tax = (int)(0.5 + sp->sct_item[I_UW] * sp->sct_effic *
121 etu * money_uw / 100);
122 *mil_pay = sp->sct_item[I_MILIT] * etu * money_mil;
125 * only non-captured civs add to census for nation
127 if (sp->sct_oldown == sp->sct_own)
128 *pop += sp->sct_item[I_CIVIL];
132 upd_slmilcosts(natid n, int etu)
141 for (i = 0; NULL != (sp = getshipp(i)); i++) {
142 if (!sp->shp_own || sp->shp_own != n)
144 if ((mil = sp->shp_item[I_MILIT]) > 0)
147 for (i = 0; NULL != (lp = getlandp(i)); i++) {
148 if (!lp->lnd_own || lp->lnd_own != n)
150 if ((mil = lp->lnd_item[I_MILIT]) > 0)
153 mil_pay = totalmil * etu * money_mil;
158 bank_income(struct sctstr *sp, int etu)
160 return (int)(sp->sct_item[I_BAR] * etu * bankint * sp->sct_effic / 100);