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-2016
44 #include "prototypes.h"
48 static int new_work(struct sctstr *, int);
49 static int growfood(struct sctstr *, int, int);
50 static int starve_some(short *, i_type, int);
51 static void trunc_people(struct sctstr *, struct natstr *);
52 static int grow_people(struct sctstr *, int, struct natstr *, int);
53 static int babies(int, int, double, int, int, int);
56 * feed the individual sector
59 do_feed(struct sctstr *sp, struct natstr *np, int etu,
60 int round_babies_down)
68 maxworkers = max_workers(np->nat_level[NAT_RLEV], sp);
69 work_avail = new_work(sp,
70 total_work(sp->sct_work, etu,
71 sp->sct_item[I_CIVIL],
72 sp->sct_item[I_MILIT],
75 if (sp->sct_type != SCT_SANCT) {
77 if (opt_NOFOOD == 0) {
78 needed = (int)ceil(food_needed(sp->sct_item, etu));
79 if (sp->sct_item[I_FOOD] < needed) {
80 /* need to grow "emergency rations" */
81 work_avail -= 2 * growfood(sp, work_avail / 2, etu);
82 /* It's twice as hard to grow those than norm */
83 if (sp->sct_item[I_FOOD] == 0)
84 /* Conjure up 1f to make life easier for the player */
85 manna = sp->sct_item[I_FOOD] = 1;
88 starved = feed_people(sp->sct_item, etu);
90 if (!player->simulation) {
91 /* don't report POGO starvation */
93 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
94 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
96 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
99 sp->sct_loyal += roll(8) + 1;
102 sctwork = sp->sct_work;
104 sctwork += 7 + roll(15);
107 grow_people(sp, etu, np, round_babies_down);
108 work_avail = new_work(sp,
109 total_work(sp->sct_work, etu,
110 sp->sct_item[I_CIVIL],
111 sp->sct_item[I_MILIT],
114 /* FIXME restores work charged for growfood() */
116 sp->sct_che = age_people(sp->sct_che, etu);
119 /* Take away food we conjured up */
120 sp->sct_item[I_FOOD] = 0;
124 /* Here is where we truncate extra people, always */
125 trunc_people(sp, np);
127 sp->sct_work = sctwork;
128 sp->sct_avail = work_avail;
132 new_work(struct sctstr *sp, int delta)
134 int rollover = sp->sct_avail;
136 if (sp->sct_type != sp->sct_newtype)
138 if (rollover > rollover_avail_max)
139 rollover = rollover_avail_max;
140 if (rollover > delta / 2 + 1)
141 rollover = delta / 2 + 1;
143 return rollover + delta;
147 growfood(struct sctstr *sp, int work, int etu)
154 food_workers = work * fcrate;
155 food_fertil = etu * sp->sct_fertil * fgrate;
156 food = MIN(food_workers, food_fertil);
157 if (food > ITEM_MAX - sp->sct_item[I_FOOD])
158 food = ITEM_MAX - sp->sct_item[I_FOOD];
159 sp->sct_item[I_FOOD] += food;
160 work_used = food / fcrate;
165 * returns the number who starved, if any.
168 feed_people(short *vec, int etu)
170 int to_starve, starved;
175 to_starve = famine_victims(vec, etu);
176 starved = starve_some(vec, I_UW, to_starve);
177 starved += starve_some(vec, I_CIVIL, to_starve - starved);
178 starved += starve_some(vec, I_MILIT, to_starve - starved);
179 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
186 * Return food eaten by people in @vec[] in @etu ETUs.
189 food_needed(short *vec, int etu)
191 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
192 double need = etu * eatrate * people;
197 * Return number of famine victims in @vec[] for @etu ETUs.
200 famine_victims(short *vec, int etu)
202 double can_eat = vec[I_FOOD] / (etu * eatrate);
203 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
204 if (people <= can_eat)
206 if (can_eat <= people / 2)
208 return (int)(people - can_eat);
212 * Starve up to @num people of @vec[@whom].
213 * Return the number of actually starved.
216 starve_some(short *vec, i_type whom, int num)
218 int retval = MIN(num, vec[whom]);
224 * Truncate any extra people that may be around
227 trunc_people(struct sctstr *sp, struct natstr *np)
229 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
231 if (sp->sct_item[I_CIVIL] > maxpop)
232 sp->sct_item[I_CIVIL] = maxpop;
233 if (sp->sct_item[I_UW] > maxpop)
234 sp->sct_item[I_UW] = maxpop;
238 * Grow babies, and add to populace.
239 * XXX Might think about dropping in a birth
240 * rate limitation on countries with high tech
241 * production? Maybe with just high education?
244 grow_people(struct sctstr *sp, int etu, struct natstr *np, int round_down)
248 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
250 newciv = babies(sp->sct_item[I_CIVIL], etu, obrate,
251 sp->sct_item[I_FOOD], maxpop, round_down);
252 sp->sct_item[I_CIVIL] += newciv;
253 newuw = babies(sp->sct_item[I_UW], etu, uwbrate,
254 sp->sct_item[I_FOOD], maxpop, round_down);
255 sp->sct_item[I_UW] += newuw;
257 * subtract the baby eat food (if we are using FOOD) and return
260 if (opt_NOFOOD == 0 && (newciv || newuw))
261 sp->sct_item[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
262 return newciv + newuw;
266 * Return the number of babies born to @adults in @etu ETUs.
267 * @brate is the birth rate.
268 * @food is the food available for growing babies.
269 * @maxpop is the population limit.
270 * If @round_down, discard fractions instead of rounding them
274 babies(int adults, int etu, double brate, int food, int maxpop,
280 if (adults >= maxpop)
283 new_birth = brate * etu * adults;
284 new = round_down ? (int)new_birth : roundavg(new_birth);
287 new_food = (int)(food / (2.0 * babyeat));
292 if (adults + new > maxpop)
293 new = maxpop - adults;