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 * human.c: Food related functions
29 * Known contributors to this file:
32 * Markus Armbruster, 2004-2012
45 static int growfood(struct sctstr *, short *, int, int);
46 static int starve_some(short *, i_type, int);
47 static void trunc_people(struct sctstr *, struct natstr *, short *);
48 static int grow_people(struct sctstr *, int, struct natstr *, int *, int,
50 static int babies(int, int, double, int, int);
53 * feed the individual sector
56 do_feed(struct sctstr *sp, struct natstr *np, short *vec,
65 /* grow people & stuff */
66 sctwork = sp->sct_work;
68 maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
69 work_avail = new_work(sp,
70 total_work(sctwork, etu,
71 vec[I_CIVIL], vec[I_MILIT], vec[I_UW],
74 if (sp->sct_type != SCT_SANCT) {
76 if (opt_NOFOOD == 0) {
77 needed = (int)ceil(food_needed(vec, etu));
78 if (vec[I_FOOD] < needed) {
79 /* need to grow "emergency rations" */
80 work_avail -= 2 * growfood(sp, vec, work_avail / 2, etu);
81 /* It's twice as hard to grow those than norm */
83 /* Conjure up 1f to make life easier for the player */
84 manna = vec[I_FOOD] = 1;
87 starved = feed_people(vec, etu);
89 if (!player->simulation) {
90 /* don't report POGO starvation */
92 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
93 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
95 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
98 sp->sct_loyal += roll(8) + 1;
102 if (sp->sct_work < 100)
103 sctwork = sp->sct_work + 7 + roll(15);
106 if (!player->simulation)
107 sp->sct_work = sctwork;
108 grow_people(sp, etu, np, &work_avail, sctwork, vec);
110 if (!player->simulation)
111 sp->sct_che = age_people(sp->sct_che, etu);
114 /* Take away food we conjured up */
117 sctwork = sp->sct_work = 100;
118 /* Here is where we truncate extra people, always */
119 trunc_people(sp, np, vec);
126 new_work(struct sctstr *sp, int delta)
128 if (sp->sct_type == sp->sct_newtype)
129 return MIN(rollover_avail_max, sp->sct_avail) + delta;
135 growfood(struct sctstr *sp, short *vec, int work, int etu)
142 food_workers = work * fcrate;
143 food_fertil = etu * sp->sct_fertil * fgrate;
144 food = MIN(food_workers, food_fertil);
145 if (food > ITEM_MAX - vec[I_FOOD])
146 food = ITEM_MAX - vec[I_FOOD];
148 work_used = food / fcrate;
153 * returns the number who starved, if any.
156 feed_people(short *vec, int etu)
158 int to_starve, starved;
163 to_starve = famine_victims(vec, etu);
164 starved = starve_some(vec, I_UW, to_starve);
165 starved += starve_some(vec, I_CIVIL, to_starve - starved);
166 starved += starve_some(vec, I_MILIT, to_starve - starved);
167 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
174 * Return food eaten by people in @vec[] in @etu ETUs.
177 food_needed(short *vec, int etu)
179 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
180 double need = etu * eatrate * people;
185 * Return number of famine victims in @vec[] for @etu ETUs.
188 famine_victims(short *vec, int etu)
190 double can_eat = vec[I_FOOD] / (etu * eatrate);
191 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
192 if (people <= can_eat)
194 if (can_eat <= people / 2)
196 return (int)(people - can_eat);
200 * Starve up to @num people of @vec[@whom].
201 * Return the number of actually starved.
204 starve_some(short *vec, i_type whom, int num)
206 int retval = MIN(num, vec[whom]);
212 * Truncate any extra people that may be around
215 trunc_people(struct sctstr *sp, struct natstr *np, short *vec)
217 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
219 if (vec[I_CIVIL] > maxpop)
220 vec[I_CIVIL] = maxpop;
221 if (vec[I_UW] > maxpop)
226 * Grow babies, and add to populace.
227 * XXX Might think about dropping in a birth
228 * rate limitation on countries with high tech
229 * production? Maybe with just high education?
232 grow_people(struct sctstr *sp, int etu,
233 struct natstr *np, int *workp, int sctwork,
238 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
240 newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
241 vec[I_CIVIL] += newciv;
242 newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
245 * subtract the baby eat food (if we are using FOOD) and return
248 if (opt_NOFOOD == 0 && (newciv || newuw))
249 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
250 *workp += total_work(sctwork, etu, newciv, 0, newuw, ITEM_MAX);
251 return newciv + newuw;
255 * Return the number of babies born to @adults in @etu ETUs.
256 * @brate is the birth rate.
257 * @food is the food available for growing babies.
258 * @maxpop is the population limit.
261 babies(int adults, int etu, double brate, int food, int maxpop)
263 int new_birth, new_food, new;
265 if (adults >= maxpop)
268 new_birth = roundavg(brate * etu * adults);
270 new_food = new_birth;
272 new_food = (int)(food / (2.0 * babyeat));
277 if (adults + new > maxpop)
278 new = maxpop - adults;