2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2008, 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-2007
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,
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) {
75 if (opt_NOFOOD == 0) {
76 needed = (int)ceil(food_needed(vec, etu));
77 if (vec[I_FOOD] < needed) {
78 /* need to grow "emergency rations" */
79 work_avail -= 2 * growfood(sp, vec, work_avail / 2, etu);
80 /* It's twice as hard to grow those than norm */
82 if (vec[I_FOOD] < needed && sp->sct_own == sp->sct_oldown) {
83 /* steal food from warehouses, headquarters,
84 supply ships in port, or supply units */
85 vec[I_FOOD] = supply_commod(sp->sct_own,
90 starved = feed_people(vec, etu);
92 if (!player->simulation) {
93 /* don't report POGO starvation */
95 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
96 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
98 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
101 sp->sct_loyal += (random() % 8) + 2;
105 if (sp->sct_work < 100)
106 sctwork = sp->sct_work + 8 + (random() % 15);
109 if (!player->simulation)
110 sp->sct_work = sctwork;
111 grow_people(sp, etu, np, &work_avail, sctwork, vec);
114 sctwork = sp->sct_work = 100;
115 /* Here is where we truncate extra people, always */
116 trunc_people(sp, np, vec);
123 new_work(struct sctstr *sp, int delta)
125 if (sp->sct_type == sp->sct_newtype)
126 return MIN(rollover_avail_max, sp->sct_avail) + delta;
132 growfood(struct sctstr *sp, short *vec, int work, int etu)
139 food_workers = work * fcrate;
140 food_fertil = etu * sp->sct_fertil * fgrate;
141 food = MIN(food_workers, food_fertil);
142 if (food > ITEM_MAX - vec[I_FOOD])
143 food = ITEM_MAX - vec[I_FOOD];
145 * Be nice; grow minimum one food unit.
146 * This makes life simpler for the player.
149 if (vec[I_FOOD] == 0)
151 work_used = food / fcrate;
156 * returns the number who starved, if any.
159 feed_people(short *vec, int etu)
161 int to_starve, starved;
166 to_starve = famine_victims(vec, etu);
167 starved = starve_some(vec, I_UW, to_starve);
168 starved += starve_some(vec, I_CIVIL, to_starve - starved);
169 starved += starve_some(vec, I_MILIT, to_starve - starved);
170 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
177 * Return food eaten by people in VEC[] in ETU ETUs.
180 food_needed(short *vec, int etu)
182 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
183 double need = etu * eatrate * people;
188 * Return number of famine victims in VEC[] for ETU ETUs.
191 famine_victims(short *vec, int etu)
193 double can_eat = vec[I_FOOD] / (etu * eatrate);
194 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
195 if (people < can_eat)
197 if (can_eat < people / 2)
199 return (int)(people - can_eat);
203 * Starve up to NUM people of VEC[WHOM].
204 * Return the number of actually starved.
207 starve_some(short *vec, i_type whom, int num)
209 int retval = MIN(num, vec[whom]);
215 * Truncate any extra people that may be around
218 trunc_people(struct sctstr *sp, struct natstr *np,
221 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
223 if (vec[I_CIVIL] > maxpop)
224 vec[I_CIVIL] = maxpop;
225 if (vec[I_UW] > maxpop)
230 * Grow babies, and add to populace.
231 * XXX Might think about dropping in a birth
232 * rate limitation on countries with high tech
233 * production? Maybe with just high education?
236 grow_people(struct sctstr *sp, int etu,
237 struct natstr *np, int *workp, int sctwork,
242 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
244 newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
245 vec[I_CIVIL] += newciv;
246 newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
249 * subtract the baby eat food (if we are using FOOD) and return
252 if (opt_NOFOOD == 0 && (newciv || newuw))
253 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
254 *workp += total_work(sctwork, etu, newciv, 0, newuw, ITEM_MAX);
255 return newciv + newuw;
259 * Return the number of babies born to ADULTS in ETU ETUs.
260 * BRATE is the birth rate.
261 * FOOD is the food available for growing babies.
262 * MAXPOP is the population limit.
265 babies(int adults, int etu, double brate, int food, int maxpop)
267 int new_birth, new_food, new;
269 if (adults >= maxpop)
272 new_birth = roundavg(brate * etu * adults);
274 new_food = new_birth;
276 new_food = (int)(0.5 + food / (2.0 * babyeat));
281 if (adults + new > maxpop)
282 new = maxpop - adults;