git.pond.sub.org Git - empserver/blob - src/lib/update/ship.c

   1 /*
   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
   5  *
   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.
  10  *
  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.
  15  *
  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
  19  *
  20  *  ---
  21  *
  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.
  25  *
  26  *  ---
  27  *
  28  *  ship.c: Do production for ships
  29  *
  30  *  Known contributors to this file:
  31  *     Dave Pare, 1986
  32  *     Steve McClure, 1996
  33  */
  34
  35 #include "misc.h"
  36 #include "plague.h"
  37 #include "sect.h"
  38 #include "nat.h"
  39 #include "ship.h"
  40 #include "news.h"
  41 #include "file.h"
  42 #include "product.h"
  43 #include "land.h"
  44 #include "xy.h"
  45 #include "nsc.h"
  46 #include "optlist.h"
  47 #include "player.h"
  48 #include "update.h"
  49 #include "common.h"
  50 #include "subs.h"
  51 #include "gen.h"
  52 #include "lost.h"
  53 #include "budg.h"
  54
  55 #ifndef MIN
  56 #define MIN(x,y)        ((x) > (y) ? (y) : (x))
  57 #endif
  58
  59 static int shiprepair(struct shpstr *, struct natstr *,
  60                       int *, int);
  61 static void upd_ship(struct shpstr *, int,
  62                      struct natstr *, int *, int);
  63
  64 int
  65 prod_ship(int etus, int natnum, int *bp, int build)
  66                 /* build = 1, maintain = 0 */
  67 {
  68     struct shpstr *sp;
  69     struct natstr *np;
  70     int n, k = 0;
  71     int start_money;
  72     int lastx = 9999, lasty = 9999;
  73
  74     bp_enable_cachepath();
  75     for (n = 0; NULL != (sp = getshipp(n)); n++) {
  76         if (sp->shp_own == 0)
  77             continue;
  78         if (sp->shp_own != natnum)
  79             continue;
  80         np = getnatp(sp->shp_own);
  81         start_money = np->nat_money;
  82         if (lastx == 9999 || lasty == 9999) {
  83             lastx = sp->shp_x;
  84             lasty = sp->shp_y;
  85         }
  86         if (lastx != sp->shp_x || lasty != sp->shp_y) {
  87             /* Reset the cache */
  88             bp_disable_cachepath();
  89             bp_clear_cachepath();
  90             bp_enable_cachepath();
  91         }
  92         upd_ship(sp, etus, np, bp, build);
  93         if (build && !player->simulation)       /* make sure to only autonav once */
  94             nav_ship(sp);       /* autonav the ship */
  95         sea_money[sp->shp_own] += np->nat_money - start_money;
  96         if ((build && (np->nat_money != start_money)) || (!build))
  97             k++;
  98         if (player->simulation)
  99             np->nat_money = start_money;
 100     }
 101     bp_disable_cachepath();
 102     bp_clear_cachepath();
 103
 104     if (opt_SAIL) {
 105         if (build && !player->simulation)       /* make sure to only sail once */
 106             sail_ship(natnum);
 107     }
 108     return k;
 109 }
 110
 111 static void
 112 upd_ship(struct shpstr *sp, int etus,
 113          struct natstr *np, int *bp, int build)
 114                /* build = 1, maintain = 0 */
 115 {
 116     struct sctstr *sectp;
 117     struct mchrstr *mp;
 118     int pstage, ptime;
 119     int oil_gained;
 120     int max_oil;
 121     int max_food;
 122     struct pchrstr *product;
 123     s_char *resource;
 124     int dep;
 125     int n;
 126     int mult;
 127     int needed;
 128     int cost;
 129     int eff;
 130
 131     mp = &mchr[(int)sp->shp_type];
 132     if (build == 1) {
 133         if (np->nat_priorities[PRI_SBUILD] == 0 || np->nat_money < 0)
 134             return;
 135         if (sp->shp_effic < SHIP_MINEFF || !shiprepair(sp, np, bp, etus)) {
 136             makelost(EF_SHIP, sp->shp_own, sp->shp_uid, sp->shp_x,
 137                      sp->shp_y);
 138             sp->shp_own = 0;
 139             return;
 140         }
 141     } else {
 142         mult = 1;
 143         if (np->nat_level[NAT_TLEV] < sp->shp_tech * 0.85)
 144             mult = 2;
 145         cost = -(mult * etus * dmin(0.0, money_ship * mp->m_cost));
 146         if ((np->nat_priorities[PRI_SMAINT] == 0 || np->nat_money < cost)
 147             && !player->simulation) {
 148             if ((eff = sp->shp_effic - etus / 5) < SHIP_MINEFF) {
 149                 wu(0, sp->shp_own,
 150                    "%s lost to lack of maintenance\n", prship(sp));
 151                 makelost(EF_SHIP, sp->shp_own, sp->shp_uid, sp->shp_x,
 152                          sp->shp_y);
 153                 sp->shp_own = 0;
 154                 return;
 155             }
 156             wu(0, sp->shp_own,
 157                "%s lost %d%% to lack of maintenance\n",
 158                prship(sp), sp->shp_effic - eff);
 159             sp->shp_effic = eff;
 160         } else {
 161             np->nat_money -= cost;
 162         }
 163
 164         if (!player->simulation) {
 165             sectp = getsectp(sp->shp_x, sp->shp_y);
 166
 167             if ((mp->m_flags & M_OIL) && sectp->sct_type == SCT_WATER) {
 168                 /*
 169                  * take care of oil production
 170                  */
 171                 product = &pchr[P_OIL];
 172                 oil_gained = roundavg(total_work(100, etus,
 173                                                  sp->shp_item[I_CIVIL],
 174                                                  sp->shp_item[I_MILIT],
 175                                                  sp->shp_item[I_UW])
 176                                       * (double)sp->shp_effic / 100.0
 177                                       * (double)sectp->sct_oil / 100.0
 178                                       * prod_eff(product, sp->shp_tech));
 179                 max_oil = mp->m_item[I_OIL];
 180                 if (sp->shp_item[I_OIL] + oil_gained > max_oil)
 181                     oil_gained = max_oil - sp->shp_item[I_OIL];
 182                 sp->shp_item[I_OIL] += oil_gained;
 183                 if (product->p_nrdep != 0 && oil_gained > 0) {
 184                     resource = (u_char *)sectp + product->p_nrndx;
 185                     dep = roundavg(oil_gained * product->p_nrdep / 100.0);
 186                     if (CANT_HAPPEN(dep > *resource))
 187                         dep = *resource;
 188                     *resource -= dep;
 189                 }
 190             }
 191             if ((mp->m_flags & M_FOOD) && sectp->sct_type == SCT_WATER) {
 192                 product = &pchr[P_FOOD];
 193                 sp->shp_item[I_FOOD] += roundavg(total_work(100, etus,
 194                                                             sp->shp_item[I_CIVIL],
 195                                                             sp->shp_item[I_MILIT],
 196                                                             sp->shp_item[I_UW])
 197                                                  * (double)sp->shp_effic / 100.0
 198                                                  * (double)sectp->sct_fertil / 100.0
 199                                                  * prod_eff(product, sp->shp_tech));
 200             }
 201             if ((n = feed_ship(sp, etus, &needed, 1)) > 0) {
 202                 wu(0, sp->shp_own, "%d starved on %s\n", n, prship(sp));
 203                 if (n > 10)
 204                     nreport(sp->shp_own, N_DIE_FAMINE, 0, 1);
 205             }
 206             max_food = mp->m_item[I_FOOD];
 207             if (sp->shp_item[I_FOOD] > max_food)
 208                 sp->shp_item[I_FOOD] = max_food;
 209             /*
 210              * do plague stuff.  plague can't break out on ships,
 211              * but it can still kill people.
 212              */
 213             pstage = sp->shp_pstage;
 214             ptime = sp->shp_ptime;
 215             if (pstage != PLG_HEALTHY) {
 216                 n = plague_people(np, sp->shp_item, &pstage, &ptime, etus);
 217                 switch (n) {
 218                 case PLG_DYING:
 219                     wu(0, sp->shp_own,
 220                        "PLAGUE deaths reported on %s\n", prship(sp));
 221                     nreport(sp->shp_own, N_DIE_PLAGUE, 0, 1);
 222                     break;
 223                 case PLG_INFECT:
 224                     wu(0, sp->shp_own, "%s battling PLAGUE\n", prship(sp));
 225                     break;
 226                 case PLG_INCUBATE:
 227                     /* Are we still incubating? */
 228                     if (n == pstage) {
 229                         /* Yes. Will it turn "infectious" next time? */
 230                         if (ptime <= etus) {
 231                             /* Yes.  Report an outbreak. */
 232                             wu(0, sp->shp_own,
 233                                "Outbreak of PLAGUE on %s!\n", prship(sp));
 234                             nreport(sp->shp_own, N_OUT_PLAGUE, 0, 1);
 235                         }
 236                     } else {
 237                         /* It has already moved on to "infectious" */
 238                         wu(0, sp->shp_own,
 239                            "%s battling PLAGUE\n", prship(sp));
 240                     }
 241                     break;
 242                 case PLG_EXPOSED:
 243                     /* Has the plague moved to "incubation" yet? */
 244                     if (n != pstage) {
 245                         /* Yes. Will it turn "infectious" next time? */
 246                         if (ptime <= etus) {
 247                             /* Yes.  Report an outbreak. */
 248                             wu(0, sp->shp_own,
 249                                "Outbreak of PLAGUE on %s!\n", prship(sp));
 250                             nreport(sp->shp_own, N_OUT_PLAGUE, 0, 1);
 251                         }
 252                     }
 253                     break;
 254                 default:
 255                     break;
 256                 }
 257
 258                 sp->shp_pstage = pstage;
 259                 sp->shp_ptime = ptime;
 260             }
 261             pops[sp->shp_own] += sp->shp_item[I_CIVIL];
 262         }
 263     }
 264 }
 265
 266 /*
 267  * idea is: a sector full of workers can fix up eight
 268  * battleships +8 % eff each etu.  This will cost around
 269  * 8 * 8 * $40 = $2560!
 270  */
 271 static int
 272 shiprepair(struct shpstr *ship, struct natstr *np,
 273            int *bp, int etus)
 274 {
 275     int delta;
 276     struct sctstr *sp;
 277     struct mchrstr *mp;
 278     float leftp, buildp;
 279     int left, build;
 280     int lcm_needed, hcm_needed;
 281     int wf;
 282     int avail;
 283     int w_p_eff;
 284     int mult;
 285     int mvec[I_MAX + 1];
 286     int rel;
 287
 288     mp = &mchr[(int)ship->shp_type];
 289     sp = getsectp(ship->shp_x, ship->shp_y);
 290
 291     if ((sp->sct_own != ship->shp_own) && (sp->sct_own != 0)) {
 292         rel = getrel(getnatp(sp->sct_own), ship->shp_own);
 293
 294         if (rel < FRIENDLY)
 295             return 1;
 296     }
 297
 298     wf = 0;
 299     /* only military can work on a military boat */
 300     if (ship->shp_glim > 0)
 301         wf = etus * ship->shp_item[I_MILIT] / 2;
 302     else
 303         wf = etus * (ship->shp_item[I_CIVIL] / 2 + ship->shp_item[I_MILIT] / 5);
 304
 305     if (sp->sct_type != SCT_HARBR) {
 306         wf /= 3;
 307         avail = wf;
 308     } else {
 309         if (!player->simulation)
 310             avail = wf + sp->sct_avail * 100;
 311         else
 312             avail = wf + gt_bg_nmbr(bp, sp, I_MAX + 1) * 100;
 313     }
 314
 315     w_p_eff = SHP_BLD_WORK(mp->m_lcm, mp->m_hcm);
 316
 317     if ((sp->sct_off) && (sp->sct_own == ship->shp_own))
 318         return 1;
 319
 320     mult = 1;
 321     if (np->nat_level[NAT_TLEV] < ship->shp_tech * 0.85)
 322         mult = 2;
 323
 324     if (ship->shp_effic == 100) {
 325         /* ship is ok; no repairs needed */
 326         return 1;
 327     }
 328
 329     left = 100 - ship->shp_effic;
 330     delta = roundavg((double)avail / w_p_eff);
 331     if (delta <= 0)
 332         return 1;
 333     if (delta > etus * ship_grow_scale)
 334         delta = etus * ship_grow_scale;
 335     if (delta > left)
 336         delta = left;
 337
 338     /* delta is the max amount we can grow */
 339
 340     left = 100 - ship->shp_effic;
 341     if (left > delta)
 342         left = delta;
 343
 344     leftp = ((float)left / 100.0);
 345     memset(mvec, 0, sizeof(mvec));
 346     mvec[I_LCM] = lcm_needed = ldround((double)(mp->m_lcm * leftp), 1);
 347     mvec[I_HCM] = hcm_needed = ldround((double)(mp->m_hcm * leftp), 1);
 348
 349     get_materials(sp, bp, mvec, 0);
 350
 351     if (mvec[I_LCM] >= lcm_needed)
 352         buildp = leftp;
 353     else
 354         buildp = ((float)mvec[I_LCM] / (float)mp->m_lcm);
 355     if (mvec[I_HCM] < hcm_needed)
 356         buildp = MIN(buildp, ((float)mvec[I_HCM] / (float)mp->m_hcm));
 357
 358     build = ldround((double)(buildp * 100.0), 1);
 359     memset(mvec, 0, sizeof(mvec));
 360     mvec[I_LCM] = lcm_needed = roundavg((double)(mp->m_lcm * buildp));
 361     mvec[I_HCM] = hcm_needed = roundavg((double)(mp->m_hcm * buildp));
 362
 363     get_materials(sp, bp, mvec, 1);
 364
 365     if (sp->sct_type != SCT_HARBR)
 366         build = delta;
 367     wf -= build * w_p_eff;
 368     if (wf < 0) {
 369         /*
 370          * I didn't use roundavg here, because I want to penalize
 371          * the player with a large number of ships.
 372          */
 373         if (!player->simulation)
 374             avail = (sp->sct_avail * 100 + wf) / 100;
 375         else
 376             avail = (gt_bg_nmbr(bp, sp, I_MAX + 1) * 100 + wf) / 100;
 377         if (avail < 0)
 378             avail = 0;
 379         if (!player->simulation)
 380             sp->sct_avail = avail;
 381         else
 382             pt_bg_nmbr(bp, sp, I_MAX + 1, avail);
 383     }
 384     if (sp->sct_type != SCT_HARBR)
 385         if ((build + ship->shp_effic) > 80) {
 386             build = 80 - ship->shp_effic;
 387             if (build < 0)
 388                 build = 0;
 389         }
 390
 391     np->nat_money -= mult * mp->m_cost * build / 100.0;
 392     if (!player->simulation)
 393         ship->shp_effic += (s_char)build;
 394     return 1;
 395 }
 396
 397 /*
 398  * returns the number who starved, if any.
 399  */
 400 int
 401 feed_ship(struct shpstr *sp, int etus, int *needed, int doit)
 402 {
 403     double food_eaten, land_eaten;
 404     int ifood_eaten;
 405     int can_eat, need;
 406     int total_people;
 407     int to_starve;
 408     int starved;
 409     struct nstr_item ni;
 410     struct lndstr *lp;
 411
 412     if (opt_NOFOOD)
 413         return 0;               /* no food no work to do */
 414
 415     total_people
 416         = sp->shp_item[I_CIVIL] + sp->shp_item[I_MILIT] + sp->shp_item[I_UW];
 417     food_eaten = etus * eatrate * total_people;
 418     ifood_eaten = (int)food_eaten;
 419     if (food_eaten - ifood_eaten > 0)
 420         ifood_eaten++;
 421     starved = 0;
 422     *needed = 0;
 423     if (!player->simulation && ifood_eaten > sp->shp_item[I_FOOD])
 424         sp->shp_item[I_FOOD]
 425             += supply_commod(sp->shp_own, sp->shp_x, sp->shp_y,
 426                              I_FOOD, ifood_eaten - sp->shp_item[I_FOOD]);
 427
 428 /* doit - only steal food from land units during the update */
 429     if (ifood_eaten > sp->shp_item[I_FOOD] && sp->shp_nland > 0 && doit) {
 430         snxtitem_all(&ni, EF_LAND);
 431         while ((lp = (struct lndstr *)nxtitemp(&ni, 0)) &&
 432                ifood_eaten > sp->shp_item[I_FOOD]) {
 433             if (lp->lnd_ship != sp->shp_uid)
 434                 continue;
 435             need = ifood_eaten - sp->shp_item[I_FOOD];
 436             land_eaten = etus * eatrate * lnd_getmil(lp);
 437             if (lp->lnd_item[I_FOOD] - need > land_eaten) {
 438                 sp->shp_item[I_FOOD] += need;
 439                 lp->lnd_item[I_FOOD] -= need;
 440             } else if (lp->lnd_item[I_FOOD] - land_eaten > 0) {
 441                 sp->shp_item[I_FOOD] += lp->lnd_item[I_FOOD] - land_eaten;
 442                 lp->lnd_item[I_FOOD] -= lp->lnd_item[I_FOOD] - land_eaten;
 443             }
 444         }
 445     }
 446
 447     if (ifood_eaten > sp->shp_item[I_FOOD]) {
 448         *needed = ifood_eaten - sp->shp_item[I_FOOD];
 449         can_eat = sp->shp_item[I_FOOD] / (etus * eatrate);
 450         /* only want to starve off at most 1/2 the populace. */
 451         if (can_eat < total_people / 2)
 452             can_eat = total_people / 2;
 453
 454         to_starve = total_people - can_eat;
 455         while (to_starve && sp->shp_item[I_UW]) {
 456             to_starve--;
 457             starved++;
 458             sp->shp_item[I_UW]--;
 459         }
 460         while (to_starve && sp->shp_item[I_CIVIL]) {
 461             to_starve--;
 462             starved++;
 463             sp->shp_item[I_CIVIL]--;
 464         }
 465         while (to_starve && sp->shp_item[I_MILIT]) {
 466             to_starve--;
 467             starved++;
 468             sp->shp_item[I_MILIT]--;
 469         }
 470
 471         sp->shp_item[I_FOOD] = 0;
 472     } else {
 473         sp->shp_item[I_FOOD] -= (int)food_eaten;
 474     }
 475     return starved;
 476 }