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_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
186 struct emp_qelem *qp;
187 struct emp_qelem *next;
190 int mines, m, max, shells;
194 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
196 mlp = (struct ulist *)qp;
197 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
199 mpr(actor, "%s doesn't have minesweeping capability!\n",
200 prship(&mlp->unit.ship));
203 if (takemob && mlp->mobil <= 0.0) {
205 mpr(actor, "%s is out of mobility!\n",
206 prship(&mlp->unit.ship));
209 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
210 if (sect.sct_type != SCT_WATER) {
212 mpr(actor, "%s is not at sea. No mines there!\n",
213 prship(&mlp->unit.ship));
217 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
218 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
220 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
221 if (!(mines = sect.sct_mines))
223 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
224 shells = mlp->unit.ship.shp_item[I_SHELL];
225 for (m = 0; mines > 0 && m < 5; m++) {
227 mpr(actor, "Sweep...\n");
229 shells = MIN(max, shells + 1);
230 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
233 sect.sct_mines = mines;
234 mlp->unit.ship.shp_item[I_SHELL] = shells;
235 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
237 if (shp_check_one_mines(mlp)) {
249 shp_check_one_mines(struct ulist *mlp)
254 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
255 if (sect.sct_type != SCT_WATER)
259 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
260 actor = mlp->unit.ship.shp_own;
261 shp_hit_mine(&mlp->unit.ship);
263 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
266 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
267 if (!mlp->unit.ship.shp_own)
274 shp_check_mines(struct emp_qelem *ship_list)
276 struct emp_qelem *qp;
277 struct emp_qelem *next;
281 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
283 mlp = (struct ulist *)qp;
284 if (shp_check_one_mines(mlp)) {
295 shp_stays(natid actor, char *str, struct ulist *mlp)
297 mpr(actor, "%s %s & stays in %s\n",
298 prship(&mlp->unit.ship), str,
299 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
300 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
301 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
302 emp_remque(&mlp->queue);
307 * Can SP navigate in SECTP?
308 * Sector ownership is *not* considered!
309 * Return NAVOK when yes.
310 * Return NAV_02 when it could if the sector was at least 2% efficient.
311 * Return NAV_60 when it could if the sector was at least 60% efficient.
312 * Return NAV_CANAL when it lacks capability M_CANAL.
313 * Return NAV_NONE when this sector type isn't navigable at all.
316 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
318 switch (dchr[sectp->sct_type].d_nav) {
322 if (mchr[sp->shp_type].m_flags & M_CANAL) {
323 if (sectp->sct_effic < 2)
329 if (sectp->sct_effic < 2)
333 if (sectp->sct_effic < 60)
345 sect_has_dock(struct sctstr *sect)
347 switch (dchr[sect->sct_type].d_nav) {
357 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
360 struct emp_qelem *qp;
361 struct emp_qelem *next;
365 for (qp = list->q_back; qp != list; qp = next) {
367 mlp = (struct ulist *)qp;
368 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
371 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
374 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
382 shp_damage_one(struct ulist *mlp, int dam)
384 /* ship might have changed (launched interceptors, missile defense) */
385 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
386 shipdamage(&mlp->unit.ship, dam);
387 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
388 if (!mlp->unit.ship.shp_own) {
389 emp_remque(&mlp->queue);
395 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
396 int nowantflags, int x, int y)
398 struct emp_qelem *qp;
399 struct emp_qelem *next;
405 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
407 dam = ldround((double)totdam / count, 1);
408 for (qp = list->q_back; qp != list; qp = next) {
410 mlp = (struct ulist *)qp;
411 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
414 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
417 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
419 shp_damage_one(mlp, dam);
425 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
428 struct emp_qelem *qp;
429 struct emp_qelem *next;
432 for (qp = list->q_back; qp != list; qp = next) {
434 mlp = (struct ulist *)qp;
435 /* If the ship isn't in the requested sector, then continue */
436 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
439 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
442 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
449 static struct ulist *
450 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
452 struct emp_qelem *qp;
453 struct emp_qelem *next;
455 struct ulist *mvs = NULL;
457 for (qp = list->q_back; qp != list; qp = next) {
459 mlp = (struct ulist *)qp;
460 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
462 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
464 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
465 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
466 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
467 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
468 !((struct mchrstr *)mlp->chrp)->m_nland)
474 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
475 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
482 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
484 struct emp_qelem *qp;
485 struct emp_qelem *next;
488 int easiest = 9876; /* things start great for victim */
491 for (qp = list->q_back; qp != list; qp = next) {
493 mlp = (struct ulist *)qp;
495 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
498 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
500 hard = shp_hardtarget(&mlp->unit.ship);
502 easiest = hard; /* things get worse for victim */
505 return easiest - count;
509 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
514 struct emp_qelem msl_list, *qp, *newqp;
518 mvs = most_valuable_ship(list, newx, newy);
522 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
524 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
526 plp = (struct plist *)qp;
528 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
529 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
530 newx, newy, victim, &sublaunch) < 0)
533 if (msl_hit(&plp->plane,
534 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
535 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
536 dam = pln_damage(&plp->plane, 'p', 1);
538 "missile interdiction mission does %d damage to %s!\n",
539 dam, prship(&mvs->unit.ship));
540 shp_damage_one(mvs, dam);
542 dam = pln_damage(&plp->plane, 'p', 0);
543 collateral_damage(newx, newy, dam);
545 mvs = most_valuable_ship(list, newx, newy);
547 plp->plane.pln_effic = 0;
548 putplane(plp->plane.pln_uid, &plp->plane);
557 /* Note that this function has a side effect - it uses coastwatch
558 * ranges to see if it should fire upon a ship. So, this function
559 * is expected to return positive if a ship is in range, and 0 if a
560 * ship is not in range. */
562 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
564 struct emp_qelem *qp;
565 struct emp_qelem *next;
570 natp = getnatp(sectp->sct_own);
572 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
573 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
581 for (qp = list->q_back; qp != list; qp = next) {
583 mlp = (struct ulist *)qp;
584 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
586 if (natp->nat_flags & NF_COASTWATCH)
587 wu(0, sectp->sct_own,
588 "%s %s sighted at %s\n",
589 cname(mlp->unit.ship.shp_own),
590 prship(&mlp->unit.ship),
591 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
594 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
601 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
610 signed char notified[MAXNOC];
613 /* Inform neutral and worse */
614 for (i = 0; i < MAXNOC; ++i) {
615 if (relations_with(i, victim) <= NEUTRAL)
621 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
622 while (nxtsct(&ns, &fsect)) {
625 if (fsect.sct_own == victim)
627 if (notified[fsect.sct_own])
629 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
630 if (notify_coastguard(list, trange, &fsect))
631 notified[fsect.sct_own] = 1;
633 if (opt_NO_FORT_FIRE)
634 return 0; /* Only coastwatch notify in nofortfire */
635 /* Only fire at Hostile ships */
636 for (i = 0; i < MAXNOC; ++i) {
637 if (relations_with(i, victim) >= NEUTRAL)
640 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
641 while (nxtsct(&ns, &fsect)) {
642 if (!notified[fsect.sct_own])
644 range = roundrange(fortrange(&fsect));
645 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
648 dam = fort_fire(&fsect);
654 mpr(victim, "Incoming fire does %d damage!\n", dam);
656 mpr(victim, "%s fires at you for %d!\n",
657 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
660 "%s fires at %s ships in %s for %d!\n",
661 xyas(fsect.sct_x, fsect.sct_y,
663 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
664 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
667 shp_damage(list, totdam, 0, M_SUB, newx, newy);
672 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
673 natid victim, int subs)
675 char *what = subs ? "subs" : "ships";
676 int wantflags = subs ? M_SUB : 0;
677 int nowantflags = subs ? 0 : M_SUB;
678 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
681 dam = unit_interdict(x, y, victim, what,
682 shp_easiest_target(list, wantflags, nowantflags),
685 shp_damage(list, dam, wantflags, nowantflags, x, y);
690 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
694 if (shp_contains(list, newx, newy, 0, M_SUB)) {
695 stopping |= shp_fort_interdiction(list, newx, newy, victim);
697 if (shp_contains(list, newx, newy, 0, M_SUB)) {
698 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
699 stopping |= shp_missile_interdiction(list, newx, newy, victim);
702 if (shp_contains(list, newx, newy, M_SUB, 0))
703 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
707 /* high value of hardtarget is harder to hit */
709 shp_hardtarget(struct shpstr *sp)
713 struct mchrstr *mcp = mchr + sp->shp_type;
716 getsect(sp->shp_x, sp->shp_y, §);
717 onsea = sect.sct_type == SCT_WATER;
718 if (mcp->m_flags & M_SUB)
720 return (int)((sp->shp_effic / 100.0) *
721 (20 + shp_speed(sp) * onsea / 2.0 - vis));
725 shp_hit_mine(struct shpstr *sp)
729 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
730 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
732 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
735 if (mchr[sp->shp_type].m_flags & M_SWEEP)
738 shipdamage(sp, ldround(m, 1));
744 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
748 struct emp_qelem *qp;
749 struct emp_qelem *next;
751 struct emp_qelem done;
761 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
762 unit_put(list, actor);
767 for (qp = list->q_back; qp != list; qp = next) {
769 mlp = (struct ulist *)qp;
770 newx = xnorm(mlp->unit.ship.shp_x + dx);
771 newy = ynorm(mlp->unit.ship.shp_y + dy);
772 getsect(newx, newy, §);
773 navigate = shp_check_nav(&mlp->unit.ship, §);
774 if (navigate != NAVOK ||
776 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
777 if (navigate == NAV_CANAL)
779 "is too large to fit into the canal system at %s",
780 xyas(newx, newy, actor));
782 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
784 mpr(actor, "%s\n", dp);
787 shp_stays(actor, dp, mlp);
792 if (mlp->mobil <= 0.0) {
793 shp_stays(actor, "is out of mobility", mlp);
796 mobcost = shp_mobcost(&mlp->unit.ship);
797 mlp->unit.ship.shp_x = newx;
798 mlp->unit.ship.shp_y = newy;
799 if (mlp->mobil - mobcost < -127) {
802 mlp->mobil -= mobcost;
804 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
805 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
807 /* Now update the map for this ship */
808 rad_map_set(mlp->unit.ship.shp_own,
809 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
810 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
811 ((struct mchrstr *)mlp->chrp)->m_vrnge);
815 stopping |= shp_sweep(list, 0, 0, actor);
818 stopping |= shp_check_mines(list);
822 /* interdict ships sector by sector */
824 while (!QEMPTY(list)) {
825 mlp = (struct ulist *)list->q_back;
826 newx = mlp->unit.ship.shp_x;
827 newy = mlp->unit.ship.shp_y;
828 stopping |= shp_interdict(list, newx, newy, actor);
829 /* move survivors in this sector to done */
830 for (qp = list->q_back; qp != list; qp = next) {
832 mlp = (struct ulist *)qp;
833 if (mlp->unit.ship.shp_x == newx &&
834 mlp->unit.ship.shp_y == newy) {
836 emp_insque(qp, &done);
840 /* assign surviving ships back to list */
841 emp_insque(list, &done);
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))