2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, 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-2006
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,
58 int *workp, int *bp, int etu)
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 */
81 pt_bg_nmbr(bp, sp, I_MAX + 1, work_avail);
82 if (!player->simulation)
83 sp->sct_avail = work_avail;
85 if (vec[I_FOOD] < needed && sp->sct_own == sp->sct_oldown) {
86 /* steal food from warehouses, headquarters,
87 supply ships in port, or supply units */
88 vec[I_FOOD] = supply_commod(sp->sct_own,
93 starved = feed_people(vec, etu);
95 if (!player->simulation) {
96 /* don't report POGO starvation */
98 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
99 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
101 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
104 sp->sct_loyal += (random() % 8) + 2;
108 if (sp->sct_work < 100)
109 sctwork = sp->sct_work + 8 + (random() % 15);
112 if (!player->simulation)
113 sp->sct_work = sctwork;
114 grow_people(sp, etu, np, &work_avail, sctwork, vec);
117 sctwork = sp->sct_work = 100;
118 /* Here is where we truncate extra people, always */
119 trunc_people(sp, np, vec);
121 pt_bg_nmbr(bp, sp, I_CIVIL, vec[I_CIVIL]);
122 pt_bg_nmbr(bp, sp, I_UW, vec[I_UW]);
123 pt_bg_nmbr(bp, sp, I_MILIT, vec[I_MILIT]);
129 new_work(struct sctstr *sp, int delta)
131 if (sp->sct_type == sp->sct_newtype)
132 return MIN(rollover_avail_max, sp->sct_avail) + delta;
138 growfood(struct sctstr *sp, short *vec, int work, int etu)
145 food_workers = work * fcrate;
146 food_fertil = etu * sp->sct_fertil * fgrate;
147 food = MIN(food_workers, food_fertil);
148 if (food > ITEM_MAX - vec[I_FOOD])
149 food = ITEM_MAX - vec[I_FOOD];
151 * Be nice; grow minimum one food unit.
152 * This makes life simpler for the player.
155 if (vec[I_FOOD] == 0)
157 work_used = food / fcrate;
162 * returns the number who starved, if any.
165 feed_people(short *vec, int etu)
167 int to_starve, starved;
172 to_starve = famine_victims(vec, etu);
173 starved = starve_some(vec, I_UW, to_starve);
174 starved += starve_some(vec, I_CIVIL, to_starve - starved);
175 starved += starve_some(vec, I_MILIT, to_starve - starved);
176 vec[I_FOOD] -= roundavg(food_needed(vec, etu));
183 * Return food eaten by people in VEC[] in ETU ETUs.
186 food_needed(short *vec, int etu)
188 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
189 double need = etu * eatrate * people;
194 * Return number of famine victims in VEC[] for ETU ETUs.
197 famine_victims(short *vec, int etu)
199 double can_eat = vec[I_FOOD] / (etu * eatrate);
200 int people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
201 if (people < can_eat)
203 if (can_eat < people / 2)
205 return (int)(people - can_eat);
209 * Starve up to NUM people of VEC[WHOM].
210 * Return the number of actually starved.
213 starve_some(short *vec, i_type whom, int num)
215 int retval = MIN(num, vec[whom]);
221 * Truncate any extra people that may be around
224 trunc_people(struct sctstr *sp, struct natstr *np,
227 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
229 if (vec[I_CIVIL] > maxpop)
230 vec[I_CIVIL] = maxpop;
231 if (vec[I_UW] > maxpop)
236 * Grow babies, and add to populace.
237 * XXX Might think about dropping in a birth
238 * rate limitation on countries with high tech
239 * production? Maybe with just high education?
242 grow_people(struct sctstr *sp, int etu,
243 struct natstr *np, int *workp, int sctwork,
248 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
250 newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
251 vec[I_CIVIL] += newciv;
252 newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
255 * subtract the baby eat food (if we are using FOOD) and return
258 if (opt_NOFOOD == 0 && (newciv || newuw))
259 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
260 *workp += total_work(sctwork, etu, newciv, 0, newuw, ITEM_MAX);
261 return newciv + newuw;
265 * Return the number of babies born to ADULTS in ETU ETUs.
266 * BRATE is the birth rate.
267 * FOOD is the food available for growing babies.
268 * MAXPOP is the population limit.
271 babies(int adults, int etu, double brate, int food, int maxpop)
273 int new_birth, new_food, new;
275 if (adults >= maxpop)
278 new_birth = roundavg(brate * etu * adults);
280 new_food = new_birth;
282 new_food = (int)(0.5 + food / (2.0 * babyeat));
287 if (adults + new > maxpop)
288 new = maxpop - adults;