2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2013, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * shpsub.c: Ship subroutine stuff
29 * Known contributors to this file:
31 * Steve McClure, 1996-2000
32 * Markus Armbruster, 2006-2012
50 #include "prototypes.h"
56 static int shp_check_one_mines(struct ulist *);
57 static int shp_hit_mine(struct shpstr *);
58 static void shp_stays(natid, char *, struct ulist *);
61 shp_sel(struct nstr_item *ni, struct emp_qelem *list)
68 while (nxtitem(ni, &ship)) {
70 * It would be nice to let deities navigate foreign ships, but
71 * much of the code assumes that only the ship's owner can
74 if (!ship.shp_own || ship.shp_own != player->cnum)
76 mcp = &mchr[(int)ship.shp_type];
78 if (ontradingblock(EF_SHIP, &ship)) {
79 pr("ship #%d inelligible - it's for sale.\n",
86 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
87 putship(ship.shp_uid, &ship);
88 mlp = malloc(sizeof(struct ulist));
89 mlp->chrp = (struct empobj_chr *)mcp;
90 mlp->unit.ship = ship;
91 mlp->mobil = ship.shp_mobil;
92 emp_insque(&mlp->queue, list);
96 /* This function assumes that the list was created by shp_sel */
98 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
99 int *togetherp, natid actor)
101 struct emp_qelem *qp;
102 struct emp_qelem *next;
113 for (qp = list->q_back; qp != list; qp = next) {
115 mlp = (struct ulist *)qp;
116 sp = &mlp->unit.ship;
117 getship(sp->shp_uid, sp);
118 if (sp->shp_own != actor) {
119 mpr(actor, "%s was sunk at %s\n",
120 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
121 emp_remque((struct emp_qelem *)mlp);
126 if (*sp->shp_path && !update_running) {
127 shp_stays(actor, "has a sail path", mlp);
128 mpr(actor, "Use `sail <#> -' to reset\n");
132 /* check crew - uws don't count */
133 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
134 shp_stays(actor, "is crewless", mlp);
137 if (!getsect(sp->shp_x, sp->shp_y, §)) {
138 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
141 switch (shp_check_nav(§, sp)) {
142 case CN_CONSTRUCTION:
143 shp_stays(actor, "is caught in a construction zone", mlp);
146 shp_stays(actor, "is landlocked", mlp);
152 shp_stays(actor, "was just swallowed by a big green worm", mlp);
160 if (sp->shp_x != allx || sp->shp_y != ally)
162 if (sp->shp_mobil + 1 < (int)mlp->mobil) {
163 mlp->mobil = sp->shp_mobil;
165 if (mlp->mobil < *minmobp)
166 *minmobp = mlp->mobil;
167 if (mlp->mobil > *maxmobp)
168 *maxmobp = mlp->mobil;
173 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
175 struct emp_qelem *qp;
176 struct emp_qelem *next;
179 int mines, m, max, shells;
183 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
185 mlp = (struct ulist *)qp;
186 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
188 mpr(actor, "%s doesn't have minesweeping capability!\n",
189 prship(&mlp->unit.ship));
192 if (takemob && mlp->mobil <= 0.0) {
194 mpr(actor, "%s is out of mobility!\n",
195 prship(&mlp->unit.ship));
198 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
199 if (sect.sct_type != SCT_WATER) {
201 mpr(actor, "%s is not at sea. No mines there!\n",
202 prship(&mlp->unit.ship));
206 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
207 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
209 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
210 if (!(mines = sect.sct_mines))
212 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
213 shells = mlp->unit.ship.shp_item[I_SHELL];
214 for (m = 0; mines > 0 && m < 5; m++) {
216 mpr(actor, "Sweep...\n");
218 shells = MIN(max, shells + 1);
219 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
222 sect.sct_mines = mines;
223 mlp->unit.ship.shp_item[I_SHELL] = shells;
224 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
226 if (shp_check_one_mines(mlp)) {
238 shp_check_one_mines(struct ulist *mlp)
243 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
244 if (sect.sct_type != SCT_WATER)
248 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
249 actor = mlp->unit.ship.shp_own;
250 shp_hit_mine(&mlp->unit.ship);
252 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
255 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
256 if (!mlp->unit.ship.shp_own)
263 shp_check_mines(struct emp_qelem *ship_list)
265 struct emp_qelem *qp;
266 struct emp_qelem *next;
270 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
272 mlp = (struct ulist *)qp;
273 if (shp_check_one_mines(mlp)) {
284 shp_stays(natid actor, char *str, struct ulist *mlp)
286 mpr(actor, "%s %s & stays in %s\n",
287 prship(&mlp->unit.ship), str,
288 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
289 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
290 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
291 emp_remque((struct emp_qelem *)mlp);
296 shp_check_nav(struct sctstr *sect, struct shpstr *shp)
298 switch (dchr[sect->sct_type].d_nav) {
302 if (mchr[(int)shp->shp_type].m_flags & M_CANAL) {
303 if (sect->sct_effic < 2)
304 return CN_CONSTRUCTION;
306 return CN_LANDLOCKED;
309 if (sect->sct_effic < 2)
310 return CN_CONSTRUCTION;
313 if (sect->sct_effic < 60)
314 return CN_CONSTRUCTION;
317 return CN_LANDLOCKED;
323 sect_has_dock(struct sctstr *sect)
325 switch (dchr[sect->sct_type].d_nav) {
335 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
338 struct emp_qelem *qp;
339 struct emp_qelem *next;
343 for (qp = list->q_back; qp != list; qp = next) {
345 mlp = (struct ulist *)qp;
346 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
349 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
352 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
360 shp_damage_one(struct ulist *mlp, int dam)
362 /* ship might have changed (launched interceptors, missile defense) */
363 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
364 shipdamage(&mlp->unit.ship, dam);
365 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
366 if (!mlp->unit.ship.shp_own) {
367 emp_remque((struct emp_qelem *)mlp);
373 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
374 int nowantflags, int x, int y)
376 struct emp_qelem *qp;
377 struct emp_qelem *next;
383 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
385 dam = ldround((double)totdam / count, 1);
386 for (qp = list->q_back; qp != list; qp = next) {
388 mlp = (struct ulist *)qp;
389 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
392 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
395 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
397 shp_damage_one(mlp, dam);
403 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
406 struct emp_qelem *qp;
407 struct emp_qelem *next;
410 for (qp = list->q_back; qp != list; qp = next) {
412 mlp = (struct ulist *)qp;
413 /* If the ship isn't in the requested sector, then continue */
414 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
417 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
420 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
427 static struct ulist *
428 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
430 struct emp_qelem *qp;
431 struct emp_qelem *next;
433 struct ulist *mvs = NULL;
435 for (qp = list->q_back; qp != list; qp = next) {
437 mlp = (struct ulist *)qp;
438 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
440 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
442 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
443 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
444 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
445 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
446 !((struct mchrstr *)mlp->chrp)->m_nland)
452 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
453 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
460 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
462 struct emp_qelem *qp;
463 struct emp_qelem *next;
466 int easiest = 9876; /* things start great for victim */
469 for (qp = list->q_back; qp != list; qp = next) {
471 mlp = (struct ulist *)qp;
473 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
476 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
478 hard = shp_hardtarget(&mlp->unit.ship);
480 easiest = hard; /* things get worse for victim */
483 return easiest - count;
487 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
492 struct emp_qelem msl_list, *qp, *newqp;
496 mvs = most_valuable_ship(list, newx, newy);
500 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
502 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
504 plp = (struct plist *)qp;
506 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
507 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
508 newx, newy, victim, &sublaunch) < 0)
511 if (msl_hit(&plp->plane,
512 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
513 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
514 dam = pln_damage(&plp->plane, 'p', 1);
516 "missile interdiction mission does %d damage to %s!\n",
517 dam, prship(&mvs->unit.ship));
518 shp_damage_one(mvs, dam);
520 dam = pln_damage(&plp->plane, 'p', 0);
521 collateral_damage(newx, newy, dam);
523 mvs = most_valuable_ship(list, newx, newy);
525 plp->plane.pln_effic = 0;
526 putplane(plp->plane.pln_uid, &plp->plane);
535 /* Note that this function has a side effect - it uses coastwatch
536 * ranges to see if it should fire upon a ship. So, this function
537 * is expected to return positive if a ship is in range, and 0 if a
538 * ship is not in range. */
540 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
542 struct emp_qelem *qp;
543 struct emp_qelem *next;
548 natp = getnatp(sectp->sct_own);
550 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
551 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
559 for (qp = list->q_back; qp != list; qp = next) {
561 mlp = (struct ulist *)qp;
562 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
564 if (natp->nat_flags & NF_COASTWATCH)
565 wu(0, sectp->sct_own,
566 "%s %s sighted at %s\n",
567 cname(mlp->unit.ship.shp_own),
568 prship(&mlp->unit.ship),
569 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
572 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
579 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
588 signed char notified[MAXNOC];
591 /* Inform neutral and worse */
592 for (i = 0; i < MAXNOC; ++i) {
593 if (relations_with(i, victim) <= NEUTRAL)
599 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
600 while (nxtsct(&ns, &fsect)) {
603 if (fsect.sct_own == victim)
605 if (notified[fsect.sct_own])
607 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
608 if (notify_coastguard(list, trange, &fsect))
609 notified[fsect.sct_own] = 1;
611 if (opt_NO_FORT_FIRE)
612 return 0; /* Only coastwatch notify in nofortfire */
613 /* Only fire at Hostile ships */
614 for (i = 0; i < MAXNOC; ++i) {
615 if (relations_with(i, victim) >= NEUTRAL)
618 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
619 while (nxtsct(&ns, &fsect)) {
620 if (!notified[fsect.sct_own])
622 range = roundrange(fortrange(&fsect));
623 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
626 dam = fort_fire(&fsect);
632 mpr(victim, "Incoming fire does %d damage!\n", dam);
634 mpr(victim, "%s fires at you for %d!\n",
635 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
638 "%s fires at %s ships in %s for %d!\n",
639 xyas(fsect.sct_x, fsect.sct_y,
641 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
642 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
645 shp_damage(list, totdam, 0, M_SUB, newx, newy);
650 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
651 natid victim, int subs)
653 char *what = subs ? "subs" : "ships";
654 int wantflags = subs ? M_SUB : 0;
655 int nowantflags = subs ? 0 : M_SUB;
656 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
659 dam = unit_interdict(x, y, victim, what,
660 shp_easiest_target(list, wantflags, nowantflags),
663 shp_damage(list, dam, wantflags, nowantflags, x, y);
668 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
672 if (shp_contains(list, newx, newy, 0, M_SUB)) {
673 stopping |= shp_fort_interdiction(list, newx, newy, victim);
675 if (shp_contains(list, newx, newy, 0, M_SUB)) {
676 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
677 stopping |= shp_missile_interdiction(list, newx, newy, victim);
680 if (shp_contains(list, newx, newy, M_SUB, 0))
681 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
685 /* high value of hardtarget is harder to hit */
687 shp_hardtarget(struct shpstr *sp)
691 struct mchrstr *mcp = mchr + sp->shp_type;
694 getsect(sp->shp_x, sp->shp_y, §);
695 onsea = sect.sct_type == SCT_WATER;
696 if (mcp->m_flags & M_SUB)
698 return (int)((sp->shp_effic / 100.0) *
699 (20 + shp_speed(sp) * onsea / 2.0 - vis));
703 shp_hit_mine(struct shpstr *sp)
707 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
708 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
710 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
713 if (mchr[sp->shp_type].m_flags & M_SWEEP)
716 shipdamage(sp, ldround(m, 1));
722 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
726 struct emp_qelem *qp;
727 struct emp_qelem *next;
729 struct emp_qelem done;
739 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
740 unit_put(list, actor);
745 for (qp = list->q_back; qp != list; qp = next) {
747 mlp = (struct ulist *)qp;
748 newx = xnorm(mlp->unit.ship.shp_x + dx);
749 newy = ynorm(mlp->unit.ship.shp_y + dy);
750 getsect(newx, newy, §);
751 navigate = shp_check_nav(§, &mlp->unit.ship);
752 if (navigate != CN_NAVIGABLE ||
754 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
755 if (dchr[sect.sct_type].d_nav == NAV_CANAL &&
756 !(((struct mchrstr *)mlp->chrp)->m_flags & M_CANAL) &&
757 navigate == CN_LANDLOCKED)
759 "is too large to fit into the canal system at %s",
760 xyas(newx, newy, actor));
762 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
764 mpr(actor, "%s\n", dp);
767 shp_stays(actor, dp, mlp);
772 if (mlp->mobil <= 0.0) {
773 shp_stays(actor, "is out of mobility", mlp);
776 mobcost = shp_mobcost(&mlp->unit.ship);
777 mlp->unit.ship.shp_x = newx;
778 mlp->unit.ship.shp_y = newy;
779 if (mlp->mobil - mobcost < -127) {
782 mlp->mobil -= mobcost;
784 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
785 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
787 /* Now update the map for this ship */
788 rad_map_set(mlp->unit.ship.shp_own,
789 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
790 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
791 ((struct mchrstr *)mlp->chrp)->m_vrnge);
795 stopping |= shp_sweep(list, 0, 0, actor);
798 stopping |= shp_check_mines(list);
802 /* interdict ships sector by sector */
804 while (!QEMPTY(list)) {
805 mlp = (struct ulist *)list->q_back;
806 newx = mlp->unit.ship.shp_x;
807 newy = mlp->unit.ship.shp_y;
808 stopping |= shp_interdict(list, newx, newy, actor);
809 /* move survivors in this sector to done */
810 for (qp = list->q_back; qp != list; qp = next) {
812 mlp = (struct ulist *)qp;
813 if (mlp->unit.ship.shp_x == newx &&
814 mlp->unit.ship.shp_y == newy) {
816 emp_insque(qp, &done);
820 /* assign surviving ships back to list */
821 emp_insque(list, &done);
829 * Check for incoming missiles with a P_MAR flag.
830 * Return True=1 if the missile was shotdown.
833 * Chad Zabel, July 95
837 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
842 double gun, eff, teff;
844 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
846 while (nxtitem(&ni, &ship)) {
850 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
853 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
856 if (ship.shp_effic < 60)
859 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
861 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
863 if (!shp_supply(&ship, I_SHELL, 2))
865 ship.shp_item[I_SHELL] -= 2;
866 putship(ship.shp_uid, &ship);
868 /* now calculate the odds */
869 gun = shp_usable_guns(&ship);
870 eff = ship.shp_effic / 100.0;
871 teff = ship.shp_tech / (ship.shp_tech + 200.0);
872 /* raise 4.5 for better interception -KHS */
873 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
878 hit = pct_chance(hitchance);
880 mpr(bombown, "%s anti-missile system activated...%s\n",
882 hit ? "KABOOOM!! Missile destroyed\n"
883 : "SWOOSH!! anti-missile system failed!!");
884 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
886 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
887 hit ? "KABOOOM!! Incoming missile destroyed!\n"
888 : "SWOOSH!! Missile evades anti-missile systems\n");
893 return 0; /* all attempts failed */
897 /* Fire missiles at a ship which has fired shells */
899 shp_missdef(struct shpstr *sp, natid victim)
901 struct emp_qelem list;
908 mlp = malloc(sizeof(struct ulist));
909 mlp->chrp = (struct empobj_chr *)&mchr[(int)sp->shp_type];
910 mlp->unit.ship = *sp;
911 mlp->mobil = sp->shp_mobil;
912 emp_insque(&mlp->queue, &list);
913 sprintf(buf, "%s", prship(&mlp->unit.ship));
916 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
917 getship(sp->shp_uid, sp);
921 "missiles launched in defense did 100%% damage to %s\n",
923 wu(0, victim, "%s sunk!\n", buf);
924 } else if (eff > 0 && sp->shp_effic < eff) {
926 "missiles launched in defense did %d%% damage to %s\n",
927 100 * (eff - sp->shp_effic) / eff, buf);
934 shp_mobcost(struct shpstr *sp)
936 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
941 * Set SP's tech to TLEV along with everything else that depends on it.
944 shp_set_tech(struct shpstr *sp, int tlev)
946 struct mchrstr *mcp = mchr + sp->shp_type;
948 if (CANT_HAPPEN(tlev < mcp->m_tech))