2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2009, 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 files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * human.c: Food related functions
30 * Known contributors to this file:
33 * Markus Armbruster, 2004-2009
46 static int growfood(struct sctstr *, short *, int, int);
47 static int starve_some(short *, i_type, int);
48 static void trunc_people(struct sctstr *, struct natstr *, short *);
49 static int grow_people(struct sctstr *, int, struct natstr *, int *, int,
51 static int babies(int, int, double, int, int);
54 * feed the individual sector
57 do_feed(struct sctstr *sp, struct natstr *np, short *vec,
66 /* grow people & stuff */
67 sctwork = sp->sct_work;
69 maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
70 work_avail = new_work(sp,
71 total_work(sctwork, etu,
72 vec[I_CIVIL], vec[I_MILIT], vec[I_UW],
75 if (sp->sct_type != SCT_SANCT) {
77 if (opt_NOFOOD == 0) {
78 needed = (int)ceil(food_needed(vec, etu));
79 if (vec[I_FOOD] < needed) {
80 /* need to grow "emergency rations" */
81 work_avail -= 2 * growfood(sp, vec, work_avail / 2, etu);
82 /* It's twice as hard to grow those than norm */
84 /* Conjure up 1f to make life easier for the player */
85 manna = vec[I_FOOD] = 1;
88 starved = feed_people(vec, 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 += (random() % 8) + 2;
103 if (sp->sct_work < 100)
104 sctwork = sp->sct_work + 8 + (random() % 15);
107 if (!player->simulation)
108 sp->sct_work = sctwork;
109 grow_people(sp, etu, np, &work_avail, sctwork, vec);
111 if (!player->simulation)
112 sp->sct_che = age_people(sp->sct_che, etu);
115 /* Take away food we conjured up */
118 sctwork = sp->sct_work = 100;
119 /* Here is where we truncate extra people, always */
120 trunc_people(sp, np, vec);
127 new_work(struct sctstr *sp, int delta)
129 if (sp->sct_type == sp->sct_newtype)
130 return MIN(rollover_avail_max, sp->sct_avail) + delta;
136 growfood(struct sctstr *sp, short *vec, int work, int etu)
143 food_workers = work * fcrate;
144 food_fertil = etu * sp->sct_fertil * fgrate;
145 food = MIN(food_workers, food_fertil);
146 if (food > ITEM_MAX - vec[I_FOOD])
147 food = ITEM_MAX - vec[I_FOOD];
149 work_used = food / fcrate;
154 * returns the number who starved, if any.
157 feed_people(short *vec, int etu)
159 int to_starve, starved;
164 to_starve = famine_victims(vec, etu);
165 starved = starve_some(vec, I_UW, to_starve);
166 starved += starve_some(vec, I_CIVIL, to_starve - starved);
167 starved += starve_some(vec, I_MILIT, to_starve - starved);
168 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
175 * Return food eaten by people in VEC[] in ETU ETUs.
178 food_needed(short *vec, int etu)
180 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
181 double need = etu * eatrate * people;
186 * Return number of famine victims in VEC[] for ETU ETUs.
189 famine_victims(short *vec, int etu)
191 double can_eat = vec[I_FOOD] / (etu * eatrate);
192 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
193 if (people <= can_eat)
195 if (can_eat <= people / 2)
197 return (int)(people - can_eat);
201 * Starve up to NUM people of VEC[WHOM].
202 * Return the number of actually starved.
205 starve_some(short *vec, i_type whom, int num)
207 int retval = MIN(num, vec[whom]);
213 * Truncate any extra people that may be around
216 trunc_people(struct sctstr *sp, struct natstr *np,
219 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
221 if (vec[I_CIVIL] > maxpop)
222 vec[I_CIVIL] = maxpop;
223 if (vec[I_UW] > maxpop)
228 * Grow babies, and add to populace.
229 * XXX Might think about dropping in a birth
230 * rate limitation on countries with high tech
231 * production? Maybe with just high education?
234 grow_people(struct sctstr *sp, int etu,
235 struct natstr *np, int *workp, int sctwork,
240 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
242 newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
243 vec[I_CIVIL] += newciv;
244 newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
247 * subtract the baby eat food (if we are using FOOD) and return
250 if (opt_NOFOOD == 0 && (newciv || newuw))
251 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
252 *workp += total_work(sctwork, etu, newciv, 0, newuw, ITEM_MAX);
253 return newciv + newuw;
257 * Return the number of babies born to ADULTS in ETU ETUs.
258 * BRATE is the birth rate.
259 * FOOD is the food available for growing babies.
260 * MAXPOP is the population limit.
263 babies(int adults, int etu, double brate, int food, int maxpop)
265 int new_birth, new_food, new;
267 if (adults >= maxpop)
270 new_birth = roundavg(brate * etu * adults);
272 new_food = new_birth;
274 new_food = (int)(food / (2.0 * babyeat));
279 if (adults + new > maxpop)
280 new = maxpop - adults;