2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, 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 the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * human.c: Food related functions
30 * Known contributors to this file:
49 static int grow_people(struct sctstr *, int,
50 struct natstr *, int *, int,
52 static int growfood(struct sctstr *, short *, int, int);
53 static void starvation(struct sctstr *);
54 static void trunc_people(struct sctstr *, struct natstr *,
58 * feed the individual sector
62 do_feed(struct sctstr *sp, struct natstr *np, short *vec,
63 int *workp, int *bp, int etu)
73 /* grow people & stuff */
74 sctwork = sp->sct_work;
76 maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
77 civvies = (vec[I_CIVIL] > maxpop) ? maxpop : vec[I_CIVIL];
78 uws = (vec[I_UW] > maxpop) ? maxpop : vec[I_UW];
79 mil = (vec[I_MILIT] > maxpop) ? maxpop : vec[I_MILIT];
80 work_avail = new_work(sp, total_work(sctwork, etu, civvies, mil, uws));
82 people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
83 if (sp->sct_type != SCT_SANCT) {
84 if (opt_NOFOOD == 0) {
85 if (vec[I_FOOD] < 1 + etu * people * eatrate) {
86 /* need to grow "emergency rations" */
88 growfood(sp, vec, (int)(work_avail / 2),
90 /* It's twice as hard to grow those than norm */
91 pt_bg_nmbr(bp, sp, I_MAX + 1, work_avail);
92 if (!player->simulation)
93 sp->sct_avail = work_avail;
95 if ((vec[I_FOOD] < 1 + etu * people * eatrate) &&
96 (sp->sct_own == sp->sct_oldown)) {
98 /* steal food from warehouses, headquarters,
99 supply ships in port, or supply units */
102 needed = ldround((double)(1 + etu * people * eatrate), 1);
104 /* Now, find some food */
105 vec[I_FOOD] = supply_commod(sp->sct_own, sp->sct_x,
106 sp->sct_y, I_FOOD, needed);
110 starved = feed_people(vec, etu, &needed);
111 if ((starved > 0 && sp->sct_own) && (!player->simulation)) {
112 /* don't report POGO starvation */
113 wu(0, sp->sct_own, "%d starved in %s.\n", starved,
114 xyas(sp->sct_x, sp->sct_y, sp->sct_own));
116 nreport(sp->sct_own, N_DIE_FAMINE, 0, 1);
119 if (!player->simulation)
123 if (sp->sct_work < 100)
124 sctwork = sp->sct_work + 8 + (random() % 15);
127 if (!player->simulation)
128 sp->sct_work = sctwork;
129 dummy = grow_people(sp, etu, np, &work_avail, sctwork, vec);
132 sctwork = sp->sct_work = 100;
133 /* Here is where we truncate extra people, always */
134 trunc_people(sp, np, vec);
136 pt_bg_nmbr(bp, sp, I_CIVIL, vec[I_CIVIL]);
137 pt_bg_nmbr(bp, sp, I_UW, vec[I_UW]);
138 pt_bg_nmbr(bp, sp, I_MILIT, vec[I_MILIT]);
144 new_work(struct sctstr *sp, int delta)
146 if (sp->sct_type == sp->sct_newtype)
147 return min(rollover_avail_max, sp->sct_avail) + delta;
153 growfood(struct sctstr *sp, short *vec, int work, int etu)
160 /* I'm being very nice and commenting out this so players
161 * won't whine about starvation
162 if (sp->sct_fertil == 0 || work == 0)
165 food_workers = work * fcrate;
166 food_fertil = etu * sp->sct_fertil * fgrate;
167 food = min(food_workers, food_fertil);
169 * be nice; grow minimum one food unit.
170 * This makes life simpler for the player.
172 if (food > ITEM_MAX - vec[I_FOOD])
173 food = ITEM_MAX - vec[I_FOOD];
175 if (vec[I_FOOD] == 0)
177 work_used = food / fcrate;
182 * returns the number who starved, if any.
185 feed_people(short *vec, int etu, int *needed)
197 total_people = vec[I_CIVIL] + vec[I_MILIT] + vec[I_UW];
198 food_eaten = etu * eatrate * total_people;
199 ifood_eaten = (int)food_eaten;
200 if (food_eaten - ifood_eaten > 0)
202 if (ifood_eaten <= 1)
206 if (ifood_eaten > vec[I_FOOD]) {
207 *needed = ifood_eaten - vec[I_FOOD];
208 can_eat = vec[I_FOOD] / (etu * eatrate);
209 /* only want to starve off at most 1/2 the populace. */
210 if (can_eat < total_people / 2)
211 can_eat = total_people / 2;
213 to_starve = total_people - can_eat;
214 while (to_starve && vec[I_UW]) {
219 while (to_starve && vec[I_CIVIL]) {
224 while (to_starve && vec[I_MILIT]) {
232 vec[I_FOOD] -= roundavg(food_eaten);
238 * Truncate any extra people that may be around
241 trunc_people(struct sctstr *sp, struct natstr *np,
244 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
246 if (vec[I_CIVIL] > maxpop)
247 vec[I_CIVIL] = maxpop;
248 if (vec[I_UW] > maxpop)
253 * Grow babies, and add to populace.
254 * XXX Might think about dropping in a birth
255 * rate limitation on countries with high tech
256 * production? Maybe with just high education?
259 grow_people(struct sctstr *sp, int etu,
260 struct natstr *np, int *workp, int sctwork,
267 int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
271 if (vec[I_CIVIL] < maxpop) {
272 new_birth = (int)roundavg(obrate * (double)(etu * vec[I_CIVIL]));
274 new_food = (int)(0.5 + maxpop / (2.0 * babyeat));
275 else /* we are using food */
276 new_food = (int)(0.5 + vec[I_FOOD] / (2.0 * babyeat));
279 if (newciv > new_food)
281 /* Now, check max pops */
282 if ((vec[I_CIVIL] + newciv) > maxpop)
283 newciv = maxpop - vec[I_CIVIL];
284 vec[I_CIVIL] += newciv;
286 if (vec[I_UW] < maxpop) {
290 new_birth = (int)roundavg(uwbrate * (double)(etu * vec[I_UW]));
292 new_food = (int)(0.5 + maxpop / (2.0 * babyeat));
293 else /* food is important */
294 new_food = (int)(0.5 + vec[I_FOOD] / (2.0 * babyeat));
297 if (newuw > new_food)
299 /* Now, check max pops */
300 if ((vec[I_UW] + newuw) > maxpop)
301 newuw = maxpop - vec[I_UW];
305 * subtract the baby eat food (if we are using FOOD) and return
308 if (opt_NOFOOD == 0 && (newciv || newuw))
309 vec[I_FOOD] -= roundavg((newciv + newuw) * babyeat);
310 *workp += total_work(sctwork, etu, newciv, 0, newuw);
311 return newciv + newuw;
315 * percentage of people who starved
318 starvation(struct sctstr *sp)
321 sp->sct_loyal += (random() % 8) + 2;