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
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 *,
50 static int babies(int, int, double, int, int);
53 * feed the individual sector
56 do_feed(struct sctstr *sp, struct natstr *np, int *workp, int etu)
64 maxworkers = max_workers(np->nat_level[NAT_RLEV], sp);
65 work_avail = new_work(sp,
66 total_work(sp->sct_work, etu,
67 sp->sct_item[I_CIVIL],
68 sp->sct_item[I_MILIT],
72 if (sp->sct_type != SCT_SANCT) {
74 if (opt_NOFOOD == 0) {
75 needed = (int)ceil(food_needed(sp->sct_item, etu));
76 if (sp->sct_item[I_FOOD] < needed) {
77 /* need to grow "emergency rations" */
78 work_avail -= 2 * growfood(sp, sp->sct_item,
80 /* It's twice as hard to grow those than norm */
81 if (sp->sct_item[I_FOOD] == 0)
82 /* Conjure up 1f to make life easier for the player */
83 manna = sp->sct_item[I_FOOD] = 1;
86 starved = feed_people(sp->sct_item, etu);
88 if (!player->simulation) {
89 /* don't report POGO starvation */
91 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
92 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
94 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
96 sp->sct_loyal += roll(8) + 1;
100 sctwork = sp->sct_work;
102 sctwork += 7 + roll(15);
105 grow_people(sp, etu, np, sp->sct_item);
106 work_avail = new_work(sp,
107 total_work(sp->sct_work, etu,
108 sp->sct_item[I_CIVIL],
109 sp->sct_item[I_MILIT],
112 /* FIXME restores work charged for growfood() */
114 if (!player->simulation)
115 sp->sct_che = age_people(sp->sct_che, etu);
118 /* Take away food we conjured up */
119 sp->sct_item[I_FOOD] = 0;
122 /* Here is where we truncate extra people, always */
123 trunc_people(sp, np, sp->sct_item);
126 if (!player->simulation)
127 sp->sct_work = sctwork;
132 new_work(struct sctstr *sp, int delta)
134 if (sp->sct_type == sp->sct_newtype)
135 return MIN(rollover_avail_max, sp->sct_avail) + delta;
141 growfood(struct sctstr *sp, short *vec, int work, int etu)
148 food_workers = work * fcrate;
149 food_fertil = etu * sp->sct_fertil * fgrate;
150 food = MIN(food_workers, food_fertil);
151 if (food > ITEM_MAX - vec[I_FOOD])
152 food = ITEM_MAX - vec[I_FOOD];
154 work_used = food / fcrate;
159 * returns the number who starved, if any.
162 feed_people(short *vec, int etu)
164 int to_starve, starved;
169 to_starve = famine_victims(vec, etu);
170 starved = starve_some(vec, I_UW, to_starve);
171 starved += starve_some(vec, I_CIVIL, to_starve - starved);
172 starved += starve_some(vec, I_MILIT, to_starve - starved);
173 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
180 * Return food eaten by people in @vec[] in @etu ETUs.
183 food_needed(short *vec, int etu)
185 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
186 double need = etu * eatrate * people;
191 * Return number of famine victims in @vec[] for @etu ETUs.
194 famine_victims(short *vec, int etu)
196 double can_eat = vec[I_FOOD] / (etu * eatrate);
197 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
198 if (people <= can_eat)
200 if (can_eat <= people / 2)
202 return (int)(people - can_eat);
206 * Starve up to @num people of @vec[@whom].
207 * Return the number of actually starved.
210 starve_some(short *vec, i_type whom, int num)
212 int retval = MIN(num, vec[whom]);
218 * Truncate any extra people that may be around
221 trunc_people(struct sctstr *sp, struct natstr *np, short *vec)
223 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
225 if (vec[I_CIVIL] > maxpop)
226 vec[I_CIVIL] = maxpop;
227 if (vec[I_UW] > maxpop)
232 * Grow babies, and add to populace.
233 * XXX Might think about dropping in a birth
234 * rate limitation on countries with high tech
235 * production? Maybe with just high education?
238 grow_people(struct sctstr *sp, int etu,
244 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
246 newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
247 vec[I_CIVIL] += newciv;
248 newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
251 * subtract the baby eat food (if we are using FOOD) and return
254 if (opt_NOFOOD == 0 && (newciv || newuw))
255 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
256 return newciv + newuw;
260 * Return the number of babies born to @adults in @etu ETUs.
261 * @brate is the birth rate.
262 * @food is the food available for growing babies.
263 * @maxpop is the population limit.
266 babies(int adults, int etu, double brate, int food, int maxpop)
268 int new_birth, new_food, new;
270 if (adults >= maxpop)
273 new_birth = roundavg(brate * etu * adults);
275 new_food = new_birth;
277 new_food = (int)(food / (2.0 * babyeat));
282 if (adults + new > maxpop)
283 new = maxpop - adults;