2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2014, 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-2014
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)
66 while (nxtitem(ni, &ship)) {
68 * It would be nice to let deities navigate foreign ships, but
69 * much of the code assumes that only the ship's owner can
72 if (!ship.shp_own || ship.shp_own != player->cnum)
75 if (ontradingblock(EF_SHIP, &ship)) {
76 pr("ship #%d inelligible - it's for sale.\n",
83 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
84 putship(ship.shp_uid, &ship);
85 shp_insque(&ship, list);
91 * Return the new list link.
94 shp_insque(struct shpstr *sp, struct emp_qelem *list)
96 struct ulist *mlp = malloc(sizeof(struct ulist));
98 mlp->chrp = (struct empobj_chr *)&mchr[sp->shp_type];
100 mlp->mobil = sp->shp_mobil;
101 emp_insque(&mlp->queue, list);
105 /* This function assumes that the list was created by shp_sel */
107 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
108 int *togetherp, natid actor)
110 struct emp_qelem *qp;
111 struct emp_qelem *next;
122 for (qp = list->q_back; qp != list; qp = next) {
124 mlp = (struct ulist *)qp;
125 sp = &mlp->unit.ship;
126 getship(sp->shp_uid, sp);
127 if (sp->shp_own != actor) {
128 mpr(actor, "%s was sunk at %s\n",
129 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
130 emp_remque(&mlp->queue);
135 if (*sp->shp_path && !update_running) {
136 shp_stays(actor, "has a sail path", mlp);
137 mpr(actor, "Use `sail <#> -' to reset\n");
141 /* check crew - uws don't count */
142 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
143 shp_stays(actor, "is crewless", mlp);
146 if (!getsect(sp->shp_x, sp->shp_y, §)) {
147 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
150 switch (shp_check_nav(sp, §)) {
153 shp_stays(actor, "is caught in a construction zone", mlp);
157 shp_stays(actor, "is landlocked", mlp);
163 shp_stays(actor, "was just swallowed by a big green worm", mlp);
171 if (sp->shp_x != allx || sp->shp_y != ally)
173 if (sp->shp_mobil + 1 < (int)mlp->mobil) {
174 mlp->mobil = sp->shp_mobil;
176 if (mlp->mobil < *minmobp)
177 *minmobp = mlp->mobil;
178 if (mlp->mobil > *maxmobp)
179 *maxmobp = mlp->mobil;
184 shp_nav_put(struct emp_qelem *list, natid actor)
186 struct emp_qelem *qp, *next;
190 for (qp = list->q_back; qp != list; qp = next) {
192 mlp = (struct ulist *)qp;
193 sp = &mlp->unit.ship;
194 mpr(actor, "%s stopped at %s\n",
195 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
196 sp->shp_mobil = (int)mlp->mobil;
197 putship(sp->shp_uid, sp);
204 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
206 struct emp_qelem *qp;
207 struct emp_qelem *next;
210 int mines, m, max, shells;
214 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
216 mlp = (struct ulist *)qp;
217 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
219 mpr(actor, "%s doesn't have minesweeping capability!\n",
220 prship(&mlp->unit.ship));
223 if (takemob && mlp->mobil <= 0.0) {
225 mpr(actor, "%s is out of mobility!\n",
226 prship(&mlp->unit.ship));
229 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
230 if (sect.sct_type != SCT_WATER) {
232 mpr(actor, "%s is not at sea. No mines there!\n",
233 prship(&mlp->unit.ship));
237 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
238 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
240 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
241 if (!(mines = sect.sct_mines))
243 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
244 shells = mlp->unit.ship.shp_item[I_SHELL];
245 for (m = 0; mines > 0 && m < 5; m++) {
247 mpr(actor, "Sweep...\n");
249 shells = MIN(max, shells + 1);
250 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
253 sect.sct_mines = mines;
254 mlp->unit.ship.shp_item[I_SHELL] = shells;
255 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
257 if (shp_check_one_mines(mlp)) {
269 shp_check_one_mines(struct ulist *mlp)
274 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
275 if (sect.sct_type != SCT_WATER)
279 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
280 actor = mlp->unit.ship.shp_own;
281 shp_hit_mine(&mlp->unit.ship);
283 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
286 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
287 if (!mlp->unit.ship.shp_own)
294 shp_check_mines(struct emp_qelem *ship_list)
296 struct emp_qelem *qp;
297 struct emp_qelem *next;
301 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
303 mlp = (struct ulist *)qp;
304 if (shp_check_one_mines(mlp)) {
315 shp_stays(natid actor, char *str, struct ulist *mlp)
317 mpr(actor, "%s %s & stays in %s\n",
318 prship(&mlp->unit.ship), str,
319 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
320 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
321 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
322 emp_remque(&mlp->queue);
327 * Can SP navigate in SECTP?
328 * Sector ownership is *not* considered!
329 * Return NAVOK when yes.
330 * Return NAV_02 when it could if the sector was at least 2% efficient.
331 * Return NAV_60 when it could if the sector was at least 60% efficient.
332 * Return NAV_CANAL when it lacks capability M_CANAL.
333 * Return NAV_NONE when this sector type isn't navigable at all.
336 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
338 switch (dchr[sectp->sct_type].d_nav) {
342 if (mchr[sp->shp_type].m_flags & M_CANAL) {
343 if (sectp->sct_effic < 2)
349 if (sectp->sct_effic < 2)
353 if (sectp->sct_effic < 60)
365 sect_has_dock(struct sctstr *sect)
367 switch (dchr[sect->sct_type].d_nav) {
377 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
380 struct emp_qelem *qp;
381 struct emp_qelem *next;
385 for (qp = list->q_back; qp != list; qp = next) {
387 mlp = (struct ulist *)qp;
388 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
391 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
394 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
402 shp_damage_one(struct ulist *mlp, int dam)
404 /* ship might have changed (launched interceptors, missile defense) */
405 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
406 shipdamage(&mlp->unit.ship, dam);
407 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
408 if (!mlp->unit.ship.shp_own) {
409 emp_remque(&mlp->queue);
415 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
416 int nowantflags, int x, int y)
418 struct emp_qelem *qp;
419 struct emp_qelem *next;
425 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
427 dam = ldround((double)totdam / count, 1);
428 for (qp = list->q_back; qp != list; qp = next) {
430 mlp = (struct ulist *)qp;
431 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
434 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
437 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
439 shp_damage_one(mlp, dam);
445 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
448 struct emp_qelem *qp;
449 struct emp_qelem *next;
452 for (qp = list->q_back; qp != list; qp = next) {
454 mlp = (struct ulist *)qp;
455 /* If the ship isn't in the requested sector, then continue */
456 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
459 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
462 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
469 static struct ulist *
470 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
472 struct emp_qelem *qp;
473 struct emp_qelem *next;
475 struct ulist *mvs = NULL;
477 for (qp = list->q_back; qp != list; qp = next) {
479 mlp = (struct ulist *)qp;
480 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
482 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
484 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
485 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
486 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
487 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
488 !((struct mchrstr *)mlp->chrp)->m_nland)
494 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
495 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
502 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
504 struct emp_qelem *qp;
505 struct emp_qelem *next;
508 int easiest = 9876; /* things start great for victim */
511 for (qp = list->q_back; qp != list; qp = next) {
513 mlp = (struct ulist *)qp;
515 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
518 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
520 hard = shp_hardtarget(&mlp->unit.ship);
522 easiest = hard; /* things get worse for victim */
525 return easiest - count;
529 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
534 struct emp_qelem msl_list, *qp, *newqp;
538 mvs = most_valuable_ship(list, newx, newy);
542 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
544 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
546 plp = (struct plist *)qp;
548 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
549 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
550 newx, newy, victim, &sublaunch) < 0)
553 if (msl_hit(&plp->plane,
554 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
555 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
556 dam = pln_damage(&plp->plane, 'p', 1);
558 "missile interdiction mission does %d damage to %s!\n",
559 dam, prship(&mvs->unit.ship));
560 shp_damage_one(mvs, dam);
562 dam = pln_damage(&plp->plane, 'p', 0);
563 collateral_damage(newx, newy, dam);
565 mvs = most_valuable_ship(list, newx, newy);
567 plp->plane.pln_effic = 0;
568 putplane(plp->plane.pln_uid, &plp->plane);
577 /* Note that this function has a side effect - it uses coastwatch
578 * ranges to see if it should fire upon a ship. So, this function
579 * is expected to return positive if a ship is in range, and 0 if a
580 * ship is not in range. */
582 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
584 struct emp_qelem *qp;
585 struct emp_qelem *next;
590 natp = getnatp(sectp->sct_own);
592 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
593 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
601 for (qp = list->q_back; qp != list; qp = next) {
603 mlp = (struct ulist *)qp;
604 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
606 if (natp->nat_flags & NF_COASTWATCH)
607 wu(0, sectp->sct_own,
608 "%s %s sighted at %s\n",
609 cname(mlp->unit.ship.shp_own),
610 prship(&mlp->unit.ship),
611 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
614 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
621 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
630 signed char notified[MAXNOC];
633 /* Inform neutral and worse */
634 for (i = 0; i < MAXNOC; ++i) {
635 if (relations_with(i, victim) <= NEUTRAL)
641 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
642 while (nxtsct(&ns, &fsect)) {
645 if (fsect.sct_own == victim)
647 if (notified[fsect.sct_own])
649 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
650 if (notify_coastguard(list, trange, &fsect))
651 notified[fsect.sct_own] = 1;
653 if (opt_NO_FORT_FIRE)
654 return 0; /* Only coastwatch notify in nofortfire */
655 /* Only fire at Hostile ships */
656 for (i = 0; i < MAXNOC; ++i) {
657 if (relations_with(i, victim) >= NEUTRAL)
660 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
661 while (nxtsct(&ns, &fsect)) {
662 if (!notified[fsect.sct_own])
664 range = roundrange(fortrange(&fsect));
665 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
668 dam = fort_fire(&fsect);
674 mpr(victim, "Incoming fire does %d damage!\n", dam);
676 mpr(victim, "%s fires at you for %d!\n",
677 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
680 "%s fires at %s ships in %s for %d!\n",
681 xyas(fsect.sct_x, fsect.sct_y,
683 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
684 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
687 shp_damage(list, totdam, 0, M_SUB, newx, newy);
692 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
693 natid victim, int subs)
695 char *what = subs ? "subs" : "ships";
696 int wantflags = subs ? M_SUB : 0;
697 int nowantflags = subs ? 0 : M_SUB;
698 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
701 dam = unit_interdict(x, y, victim, what,
702 shp_easiest_target(list, wantflags, nowantflags),
705 shp_damage(list, dam, wantflags, nowantflags, x, y);
710 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
714 if (shp_contains(list, newx, newy, 0, M_SUB)) {
715 stopping |= shp_fort_interdiction(list, newx, newy, victim);
717 if (shp_contains(list, newx, newy, 0, M_SUB)) {
718 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
719 stopping |= shp_missile_interdiction(list, newx, newy, victim);
722 if (shp_contains(list, newx, newy, M_SUB, 0))
723 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
727 /* high value of hardtarget is harder to hit */
729 shp_hardtarget(struct shpstr *sp)
733 struct mchrstr *mcp = mchr + sp->shp_type;
736 getsect(sp->shp_x, sp->shp_y, §);
737 onsea = sect.sct_type == SCT_WATER;
738 if (mcp->m_flags & M_SUB)
740 return (int)((sp->shp_effic / 100.0) *
741 (20 + shp_speed(sp) * onsea / 2.0 - vis));
745 shp_hit_mine(struct shpstr *sp)
749 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
750 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
752 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
755 if (mchr[sp->shp_type].m_flags & M_SWEEP)
758 shipdamage(sp, ldround(m, 1));
764 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
768 struct emp_qelem *qp;
769 struct emp_qelem *next;
771 struct emp_qelem done;
781 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
782 shp_nav_put(list, actor);
787 for (qp = list->q_back; qp != list; qp = next) {
789 mlp = (struct ulist *)qp;
790 newx = xnorm(mlp->unit.ship.shp_x + dx);
791 newy = ynorm(mlp->unit.ship.shp_y + dy);
792 getsect(newx, newy, §);
793 navigate = shp_check_nav(&mlp->unit.ship, §);
794 if (navigate != NAVOK ||
796 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
797 if (navigate == NAV_CANAL)
799 "is too large to fit into the canal system at %s",
800 xyas(newx, newy, actor));
802 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
804 mpr(actor, "%s\n", dp);
807 shp_stays(actor, dp, mlp);
812 if (mlp->mobil <= 0.0) {
813 shp_stays(actor, "is out of mobility", mlp);
816 mobcost = shp_mobcost(&mlp->unit.ship);
817 mlp->unit.ship.shp_x = newx;
818 mlp->unit.ship.shp_y = newy;
819 if (mlp->mobil - mobcost < -127) {
822 mlp->mobil -= mobcost;
824 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
825 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
827 /* Now update the map for this ship */
828 rad_map_set(mlp->unit.ship.shp_own,
829 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
830 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
831 ((struct mchrstr *)mlp->chrp)->m_vrnge);
835 stopping |= shp_sweep(list, 0, 0, actor);
838 stopping |= shp_check_mines(list);
842 /* interdict ships sector by sector */
844 while (!QEMPTY(list)) {
845 mlp = (struct ulist *)list->q_back;
846 newx = mlp->unit.ship.shp_x;
847 newy = mlp->unit.ship.shp_y;
848 stopping |= shp_interdict(list, newx, newy, actor);
849 /* move survivors in this sector to done */
850 for (qp = list->q_back; qp != list; qp = next) {
852 mlp = (struct ulist *)qp;
853 if (mlp->unit.ship.shp_x == newx &&
854 mlp->unit.ship.shp_y == newy) {
856 emp_insque(qp, &done);
860 /* assign surviving ships back to list */
861 emp_insque(list, &done);
869 * Check for incoming missiles with a P_MAR flag.
870 * Return True=1 if the missile was shotdown.
873 * Chad Zabel, July 95
877 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
882 double gun, eff, teff;
884 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
886 while (nxtitem(&ni, &ship)) {
890 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
893 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
896 if (ship.shp_effic < 60)
899 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
901 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
903 if (!shp_supply(&ship, I_SHELL, 2))
905 ship.shp_item[I_SHELL] -= 2;
906 putship(ship.shp_uid, &ship);
908 /* now calculate the odds */
909 gun = shp_usable_guns(&ship);
910 eff = ship.shp_effic / 100.0;
911 teff = ship.shp_tech / (ship.shp_tech + 200.0);
912 /* raise 4.5 for better interception -KHS */
913 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
914 hitchance = LIMIT_TO(hitchance, 0, 100);
915 hit = pct_chance(hitchance);
917 mpr(bombown, "%s anti-missile system activated...%s\n",
919 hit ? "KABOOOM!! Missile destroyed\n"
920 : "SWOOSH!! anti-missile system failed!!");
921 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
923 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
924 hit ? "KABOOOM!! Incoming missile destroyed!\n"
925 : "SWOOSH!! Missile evades anti-missile systems\n");
930 return 0; /* all attempts failed */
934 /* Fire missiles at a ship which has fired shells */
936 shp_missdef(struct shpstr *sp, natid victim)
938 struct emp_qelem list;
944 mlp = shp_insque(sp, &list);
945 sprintf(buf, "%s", prship(&mlp->unit.ship));
948 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
949 getship(sp->shp_uid, sp);
953 "missiles launched in defense did 100%% damage to %s\n",
955 wu(0, victim, "%s sunk!\n", buf);
956 } else if (eff > 0 && sp->shp_effic < eff) {
958 "missiles launched in defense did %d%% damage to %s\n",
959 100 * (eff - sp->shp_effic) / eff, buf);
966 shp_mobcost(struct shpstr *sp)
968 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
973 * Set SP's tech to TLEV along with everything else that depends on it.
976 shp_set_tech(struct shpstr *sp, int tlev)
978 struct mchrstr *mcp = mchr + sp->shp_type;
980 if (CANT_HAPPEN(tlev < mcp->m_tech))