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 void shp_nav_put_one(struct ulist *);
57 static int shp_check_one_mines(struct ulist *);
58 static int shp_hit_mine(struct shpstr *);
59 static void shp_stays(natid, char *, struct ulist *);
62 shp_sel(struct nstr_item *ni, struct emp_qelem *list)
67 while (nxtitem(ni, &ship)) {
69 * It would be nice to let deities navigate foreign ships, but
70 * much of the code assumes that only the ship's owner can
73 if (!ship.shp_own || ship.shp_own != player->cnum)
76 if (ontradingblock(EF_SHIP, &ship)) {
77 pr("ship #%d inelligible - it's for sale.\n",
84 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
85 putship(ship.shp_uid, &ship);
86 shp_insque(&ship, list);
92 * Return the new list link.
95 shp_insque(struct shpstr *sp, struct emp_qelem *list)
97 struct ulist *mlp = malloc(sizeof(struct ulist));
99 mlp->chrp = (struct empobj_chr *)&mchr[sp->shp_type];
100 mlp->unit.ship = *sp;
101 mlp->mobil = sp->shp_mobil;
102 emp_insque(&mlp->queue, list);
106 /* This function assumes that the list was created by shp_sel */
108 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
111 struct emp_qelem *qp;
112 struct emp_qelem *next;
114 struct shpstr *sp, *flg = NULL;
119 for (qp = list->q_back; qp != list; qp = next) {
121 mlp = (struct ulist *)qp;
122 sp = &mlp->unit.ship;
123 getship(sp->shp_uid, sp);
124 if (sp->shp_own != actor) {
125 mpr(actor, "%s was sunk at %s\n",
126 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
127 emp_remque(&mlp->queue);
131 /* check crew - uws don't count */
132 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
133 shp_stays(actor, "is crewless", mlp);
136 if (!getsect(sp->shp_x, sp->shp_y, §)) {
137 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
140 switch (shp_check_nav(sp, §)) {
143 case SHP_STUCK_CONSTRUCTION:
144 shp_stays(actor, "is caught in a construction zone", mlp);
149 case SHP_STUCK_CANAL:
150 case SHP_STUCK_IMPASSABLE:
151 shp_stays(actor, "is landlocked", mlp);
156 else if (sp->shp_x != flg->shp_x || sp->shp_y != flg->shp_y) {
157 shp_stays(actor, "is not with the flagship", mlp);
160 if (sp->shp_mobil + 1 < (int)mlp->mobil) {
161 mlp->mobil = sp->shp_mobil;
163 if (mlp->mobil < *minmobp)
164 *minmobp = mlp->mobil;
165 if (mlp->mobil > *maxmobp)
166 *maxmobp = mlp->mobil;
171 shp_nav_put(struct emp_qelem *list, natid actor)
173 struct emp_qelem *qp, *next;
177 for (qp = list->q_back; qp != list; qp = next) {
179 mlp = (struct ulist *)qp;
180 sp = &mlp->unit.ship;
181 mpr(actor, "%s stopped at %s\n",
182 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
183 shp_nav_put_one(mlp);
188 shp_nav_put_one(struct ulist *mlp)
190 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
191 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
192 emp_remque(&mlp->queue);
197 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
199 struct emp_qelem *qp;
200 struct emp_qelem *next;
203 int mines, m, max, shells;
207 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
209 mlp = (struct ulist *)qp;
210 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
212 mpr(actor, "%s doesn't have minesweeping capability!\n",
213 prship(&mlp->unit.ship));
216 if (takemob && mlp->mobil <= 0.0) {
218 mpr(actor, "%s is out of mobility!\n",
219 prship(&mlp->unit.ship));
222 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
223 if (sect.sct_type != SCT_WATER) {
225 mpr(actor, "%s is not at sea. No mines there!\n",
226 prship(&mlp->unit.ship));
230 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
231 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
233 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
234 if (!(mines = sect.sct_mines))
236 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
237 shells = mlp->unit.ship.shp_item[I_SHELL];
238 for (m = 0; mines > 0 && m < 5; m++) {
240 mpr(actor, "Sweep...\n");
242 shells = MIN(max, shells + 1);
243 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
246 sect.sct_mines = mines;
247 mlp->unit.ship.shp_item[I_SHELL] = shells;
248 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
250 if (shp_check_one_mines(mlp)) {
262 shp_check_one_mines(struct ulist *mlp)
267 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
268 if (sect.sct_type != SCT_WATER)
272 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
273 actor = mlp->unit.ship.shp_own;
274 shp_hit_mine(&mlp->unit.ship);
276 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
279 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
280 if (!mlp->unit.ship.shp_own)
287 shp_check_mines(struct emp_qelem *ship_list)
289 struct emp_qelem *qp;
290 struct emp_qelem *next;
294 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
296 mlp = (struct ulist *)qp;
297 if (shp_check_one_mines(mlp)) {
308 shp_stays(natid actor, char *str, struct ulist *mlp)
310 mpr(actor, "%s %s & stays in %s\n",
311 prship(&mlp->unit.ship), str,
312 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
313 shp_nav_put_one(mlp);
317 * Return whether and why SP would be stuck in SECTP.
320 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
322 switch (dchr[sectp->sct_type].d_nav) {
326 if (!(mchr[sp->shp_type].m_flags & M_CANAL)) {
327 return SHP_STUCK_CANAL;
331 if (sectp->sct_effic < 2)
332 return SHP_STUCK_CONSTRUCTION;
335 if (sectp->sct_effic < 60)
336 return SHP_STUCK_CONSTRUCTION;
342 return SHP_STUCK_IMPASSABLE;
344 return SHP_STUCK_NOT;
348 sect_has_dock(struct sctstr *sect)
350 switch (dchr[sect->sct_type].d_nav) {
360 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
363 struct emp_qelem *qp;
364 struct emp_qelem *next;
368 for (qp = list->q_back; qp != list; qp = next) {
370 mlp = (struct ulist *)qp;
371 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
374 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
377 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
385 shp_damage_one(struct ulist *mlp, int dam)
387 /* ship might have changed (launched interceptors, missile defense) */
388 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
389 shipdamage(&mlp->unit.ship, dam);
390 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
391 if (!mlp->unit.ship.shp_own) {
392 emp_remque(&mlp->queue);
398 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
399 int nowantflags, int x, int y)
401 struct emp_qelem *qp;
402 struct emp_qelem *next;
408 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
410 dam = ldround((double)totdam / count, 1);
411 for (qp = list->q_back; qp != list; qp = next) {
413 mlp = (struct ulist *)qp;
414 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
417 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
420 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
422 shp_damage_one(mlp, dam);
428 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
431 struct emp_qelem *qp;
432 struct emp_qelem *next;
435 for (qp = list->q_back; qp != list; qp = next) {
437 mlp = (struct ulist *)qp;
438 /* If the ship isn't in the requested sector, then continue */
439 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
442 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
445 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
452 static struct ulist *
453 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
455 struct emp_qelem *qp;
456 struct emp_qelem *next;
458 struct ulist *mvs = NULL;
460 for (qp = list->q_back; qp != list; qp = next) {
462 mlp = (struct ulist *)qp;
463 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
465 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
467 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
468 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
469 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
470 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
471 !((struct mchrstr *)mlp->chrp)->m_nland)
477 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
478 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
485 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
487 struct emp_qelem *qp;
488 struct emp_qelem *next;
491 int easiest = 9876; /* things start great for victim */
494 for (qp = list->q_back; qp != list; qp = next) {
496 mlp = (struct ulist *)qp;
498 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
501 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
503 hard = shp_hardtarget(&mlp->unit.ship);
505 easiest = hard; /* things get worse for victim */
508 return easiest - count;
512 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
517 struct emp_qelem msl_list, *qp, *newqp;
521 mvs = most_valuable_ship(list, newx, newy);
525 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
527 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
529 plp = (struct plist *)qp;
531 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
532 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
533 newx, newy, victim, &sublaunch) < 0)
536 if (msl_hit(&plp->plane,
537 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
538 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
539 dam = pln_damage(&plp->plane, 'p', 1);
541 "missile interdiction mission does %d damage to %s!\n",
542 dam, prship(&mvs->unit.ship));
543 shp_damage_one(mvs, dam);
545 dam = pln_damage(&plp->plane, 'p', 0);
546 collateral_damage(newx, newy, dam);
548 mvs = most_valuable_ship(list, newx, newy);
550 plp->plane.pln_effic = 0;
551 putplane(plp->plane.pln_uid, &plp->plane);
560 /* Note that this function has a side effect - it uses coastwatch
561 * ranges to see if it should fire upon a ship. So, this function
562 * is expected to return positive if a ship is in range, and 0 if a
563 * ship is not in range. */
565 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
567 struct emp_qelem *qp;
568 struct emp_qelem *next;
573 natp = getnatp(sectp->sct_own);
575 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
576 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
584 for (qp = list->q_back; qp != list; qp = next) {
586 mlp = (struct ulist *)qp;
587 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
589 if (natp->nat_flags & NF_COASTWATCH)
590 wu(0, sectp->sct_own,
591 "%s %s sighted at %s\n",
592 cname(mlp->unit.ship.shp_own),
593 prship(&mlp->unit.ship),
594 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
597 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
604 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
613 signed char notified[MAXNOC];
616 /* Inform neutral and worse */
617 for (i = 0; i < MAXNOC; ++i) {
618 if (relations_with(i, victim) <= NEUTRAL)
624 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
625 while (nxtsct(&ns, &fsect)) {
628 if (fsect.sct_own == victim)
630 if (notified[fsect.sct_own])
632 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
633 if (notify_coastguard(list, trange, &fsect))
634 notified[fsect.sct_own] = 1;
636 if (opt_NO_FORT_FIRE)
637 return 0; /* Only coastwatch notify in nofortfire */
638 /* Only fire at Hostile ships */
639 for (i = 0; i < MAXNOC; ++i) {
640 if (relations_with(i, victim) >= NEUTRAL)
643 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
644 while (nxtsct(&ns, &fsect)) {
645 if (!notified[fsect.sct_own])
647 range = roundrange(fortrange(&fsect));
648 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
651 dam = fort_fire(&fsect);
657 mpr(victim, "Incoming fire does %d damage!\n", dam);
659 mpr(victim, "%s fires at you for %d!\n",
660 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
663 "%s fires at %s ships in %s for %d!\n",
664 xyas(fsect.sct_x, fsect.sct_y,
666 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
667 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
670 shp_damage(list, totdam, 0, M_SUB, newx, newy);
675 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
676 natid victim, int subs)
678 char *what = subs ? "subs" : "ships";
679 int wantflags = subs ? M_SUB : 0;
680 int nowantflags = subs ? 0 : M_SUB;
681 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
684 dam = unit_interdict(x, y, victim, what,
685 shp_easiest_target(list, wantflags, nowantflags),
688 shp_damage(list, dam, wantflags, nowantflags, x, y);
693 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
697 if (shp_contains(list, newx, newy, 0, M_SUB)) {
698 stopping |= shp_fort_interdiction(list, newx, newy, victim);
700 if (shp_contains(list, newx, newy, 0, M_SUB)) {
701 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
702 stopping |= shp_missile_interdiction(list, newx, newy, victim);
705 if (shp_contains(list, newx, newy, M_SUB, 0))
706 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
710 /* high value of hardtarget is harder to hit */
712 shp_hardtarget(struct shpstr *sp)
716 struct mchrstr *mcp = mchr + sp->shp_type;
719 getsect(sp->shp_x, sp->shp_y, §);
720 onsea = sect.sct_type == SCT_WATER;
721 if (mcp->m_flags & M_SUB)
723 return (int)((sp->shp_effic / 100.0) *
724 (20 + shp_speed(sp) * onsea / 2.0 - vis));
728 shp_hit_mine(struct shpstr *sp)
732 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
733 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
735 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
738 if (mchr[sp->shp_type].m_flags & M_SWEEP)
741 shipdamage(sp, ldround(m, 1));
747 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor)
750 struct emp_qelem *qp;
751 struct emp_qelem *next;
758 enum shp_stuck stuck;
763 if (CANT_HAPPEN(QEMPTY(list)))
766 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
767 shp_nav_put(list, actor);
773 mlp = (struct ulist *)list->q_back;
774 newx = xnorm(mlp->unit.ship.shp_x + dx);
775 newy = ynorm(mlp->unit.ship.shp_y + dy);
776 getsect(newx, newy, §);
779 for (qp = list->q_back; qp != list; qp = next) {
781 mlp = (struct ulist *)qp;
782 stuck = shp_check_nav(&mlp->unit.ship, §);
783 if (stuck == SHP_STUCK_NOT &&
785 || relations_with(sect.sct_own, actor) >= FRIENDLY))
789 for (qp = list->q_back; qp != list; qp = next) {
791 mlp = (struct ulist *)qp;
792 stuck = shp_check_nav(&mlp->unit.ship, §);
793 if (stuck != SHP_STUCK_NOT ||
795 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
796 if (stuck == SHP_STUCK_CANAL &&
798 || relations_with(sect.sct_own, actor) >= FRIENDLY))
800 "is too large to fit into the canal system at %s",
801 xyas(newx, newy, actor));
803 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
805 mpr(actor, "%s\n", dp);
808 shp_stays(actor, dp, mlp);
813 if (mlp->mobil <= 0.0) {
814 shp_stays(actor, "is out of mobility", mlp);
817 mobcost = shp_mobcost(&mlp->unit.ship);
818 mlp->unit.ship.shp_x = newx;
819 mlp->unit.ship.shp_y = newy;
820 if (mlp->mobil - mobcost < -127) {
823 mlp->mobil -= mobcost;
825 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
826 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
828 /* Now update the map for this ship */
829 rad_map_set(mlp->unit.ship.shp_own,
830 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
831 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
832 ((struct mchrstr *)mlp->chrp)->m_vrnge);
836 stopping |= shp_sweep(list, 0, 0, actor);
839 stopping |= shp_check_mines(list);
842 stopping |= shp_interdict(list, newx, newy, actor);
849 * Check for incoming missiles with a P_MAR flag.
850 * Return True=1 if the missile was shotdown.
853 * Chad Zabel, July 95
857 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
862 double gun, eff, teff;
864 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
866 while (nxtitem(&ni, &ship)) {
870 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
873 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
876 if (ship.shp_effic < 60)
879 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
881 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
883 if (!shp_supply(&ship, I_SHELL, 2))
885 ship.shp_item[I_SHELL] -= 2;
886 putship(ship.shp_uid, &ship);
888 /* now calculate the odds */
889 gun = shp_usable_guns(&ship);
890 eff = ship.shp_effic / 100.0;
891 teff = ship.shp_tech / (ship.shp_tech + 200.0);
892 /* raise 4.5 for better interception -KHS */
893 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
894 hitchance = LIMIT_TO(hitchance, 0, 100);
895 hit = pct_chance(hitchance);
897 mpr(bombown, "%s anti-missile system activated...%s\n",
899 hit ? "KABOOOM!! Missile destroyed\n"
900 : "SWOOSH!! anti-missile system failed!!");
901 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
903 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
904 hit ? "KABOOOM!! Incoming missile destroyed!\n"
905 : "SWOOSH!! Missile evades anti-missile systems\n");
910 return 0; /* all attempts failed */
914 /* Fire missiles at a ship which has fired shells */
916 shp_missdef(struct shpstr *sp, natid victim)
918 struct emp_qelem list;
924 mlp = shp_insque(sp, &list);
925 sprintf(buf, "%s", prship(&mlp->unit.ship));
928 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
929 getship(sp->shp_uid, sp);
933 "missiles launched in defense did 100%% damage to %s\n",
935 wu(0, victim, "%s sunk!\n", buf);
936 } else if (eff > 0 && sp->shp_effic < eff) {
938 "missiles launched in defense did %d%% damage to %s\n",
939 100 * (eff - sp->shp_effic) / eff, buf);
946 shp_mobcost(struct shpstr *sp)
948 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
953 * Set SP's tech to TLEV along with everything else that depends on it.
956 shp_set_tech(struct shpstr *sp, int tlev)
958 struct mchrstr *mcp = mchr + sp->shp_type;
960 if (CANT_HAPPEN(tlev < mcp->m_tech))