/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2005, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* This program is free software; you can redistribute it and/or modify
*
* ---
*
- * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
- * related information and legal notices. It is expected that any future
- * projects/authors will amend these files as needed.
+ * See files README, COPYING and CREDITS in the root of the source
+ * tree for related information and legal notices. It is expected
+ * that future projects/authors will amend these files as needed.
*
* ---
*
* Steve McClure, 1996
*/
+#include <config.h>
+
#include "misc.h"
#include "sect.h"
#include "nat.h"
static int grow_people(struct sctstr *, int,
struct natstr *, int *, int,
short *);
+static int babies(int, int, double, int, int);
static int growfood(struct sctstr *, short *, int, int);
static void trunc_people(struct sctstr *, struct natstr *,
short *);
new_work(struct sctstr *sp, int delta)
{
if (sp->sct_type == sp->sct_newtype)
- return min(rollover_avail_max, sp->sct_avail) + delta;
+ return MIN(rollover_avail_max, sp->sct_avail) + delta;
return delta;
}
food_workers = work * fcrate;
food_fertil = etu * sp->sct_fertil * fgrate;
- food = min(food_workers, food_fertil);
+ food = MIN(food_workers, food_fertil);
if (food > ITEM_MAX - vec[I_FOOD])
food = ITEM_MAX - vec[I_FOOD];
/*
{
int newciv;
int newuw;
- int new_birth;
- int new_food;
int maxpop = max_pop(np->nat_level[NAT_RLEV], sp);
- newciv = 0;
- newuw = 0;
- if (vec[I_CIVIL] < maxpop) {
- new_birth = (int)roundavg(obrate * (double)(etu * vec[I_CIVIL]));
- if (opt_NOFOOD)
- new_food = (int)(0.5 + maxpop / (2.0 * babyeat));
- else /* we are using food */
- new_food = (int)(0.5 + vec[I_FOOD] / (2.0 * babyeat));
-
- newciv = new_birth;
- if (newciv > new_food)
- newciv = new_food;
- /* Now, check max pops */
- if ((vec[I_CIVIL] + newciv) > maxpop)
- newciv = maxpop - vec[I_CIVIL];
- vec[I_CIVIL] += newciv;
- }
- if (vec[I_UW] < maxpop) {
- /*
- * now grow uw's
- */
- new_birth = (int)roundavg(uwbrate * (double)(etu * vec[I_UW]));
- if (opt_NOFOOD)
- new_food = (int)(0.5 + maxpop / (2.0 * babyeat));
- else /* food is important */
- new_food = (int)(0.5 + vec[I_FOOD] / (2.0 * babyeat));
-
- newuw = new_birth;
- if (newuw > new_food)
- newuw = new_food;
- /* Now, check max pops */
- if ((vec[I_UW] + newuw) > maxpop)
- newuw = maxpop - vec[I_UW];
- vec[I_UW] += newuw;
- }
+ newciv = babies(vec[I_CIVIL], etu, obrate, vec[I_FOOD], maxpop);
+ vec[I_CIVIL] += newciv;
+ newuw = babies(vec[I_UW], etu, uwbrate, vec[I_FOOD], maxpop);
+ vec[I_UW] += newuw;
/*
* subtract the baby eat food (if we are using FOOD) and return
* # of births.
*workp += total_work(sctwork, etu, newciv, 0, newuw, ITEM_MAX);
return newciv + newuw;
}
+
+/*
+ * Return the number of babies born to ADULTS in ETU ETUs.
+ * BRATE is the birth rate.
+ * FOOD is the food available for growing babies.
+ * MAXPOP is the population limit.
+ */
+static int
+babies(int adults, int etu, double brate, int food, int maxpop)
+{
+ int new_birth, new_food, new;
+
+ if (adults >= maxpop)
+ return 0;
+
+ new_birth = roundavg(brate * etu * adults);
+ if (opt_NOFOOD)
+ new_food = new_birth;
+ else
+ new_food = (int)(0.5 + food / (2.0 * babyeat));
+
+ new = new_birth;
+ if (new > new_food)
+ new = new_food;
+ if (adults + new > maxpop)
+ new = maxpop - adults;
+
+ return new;
+}