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_find_capable(struct emp_qelem *list, int flags)
67 for (qp = list->q_back; qp != list; qp = qp->q_back) {
68 mlp = (struct ulist *)qp;
69 if (mchr[mlp->unit.ship.shp_type].m_flags & flags)
76 shp_sel(struct nstr_item *ni, struct emp_qelem *list)
81 while (nxtitem(ni, &ship)) {
83 * It would be nice to let deities navigate foreign ships, but
84 * much of the code assumes that only the ship's owner can
87 if (!ship.shp_own || ship.shp_own != player->cnum)
90 if (ontradingblock(EF_SHIP, &ship)) {
91 pr("ship #%d inelligible - it's for sale.\n",
98 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
99 putship(ship.shp_uid, &ship);
100 shp_insque(&ship, list);
106 * Return the new list link.
109 shp_insque(struct shpstr *sp, struct emp_qelem *list)
111 struct ulist *mlp = malloc(sizeof(struct ulist));
113 mlp->unit.ship = *sp;
114 mlp->mobil = sp->shp_mobil;
115 emp_insque(&mlp->queue, list);
119 /* This function assumes that the list was created by shp_sel */
121 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
124 struct emp_qelem *qp;
125 struct emp_qelem *next;
127 struct shpstr *sp, *flg = NULL;
132 for (qp = list->q_back; qp != list; qp = next) {
134 mlp = (struct ulist *)qp;
135 sp = &mlp->unit.ship;
136 getship(sp->shp_uid, sp);
137 if (sp->shp_own != actor) {
138 mpr(actor, "%s was sunk at %s\n",
139 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
140 emp_remque(&mlp->queue);
144 /* check crew - uws don't count */
145 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
146 shp_stays(actor, "is crewless", mlp);
149 if (!getsect(sp->shp_x, sp->shp_y, §)) {
150 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
153 switch (shp_check_nav(sp, §)) {
156 case SHP_STUCK_CONSTRUCTION:
157 shp_stays(actor, "is caught in a construction zone", mlp);
162 case SHP_STUCK_CANAL:
163 case SHP_STUCK_IMPASSABLE:
164 shp_stays(actor, "is landlocked", mlp);
169 else if (sp->shp_x != flg->shp_x || sp->shp_y != flg->shp_y) {
170 shp_stays(actor, "is not with the flagship", mlp);
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 shp_nav_put_one(mlp);
201 shp_nav_put_one(struct ulist *mlp)
203 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
204 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
205 emp_remque(&mlp->queue);
210 * Sweep seamines with engineers in SHIP_LIST for ACTOR.
211 * All ships in SHIP_LIST must be in the same sector.
212 * If EXPLICIT is non-zero, this is for an explicit sweep command from
213 * a player. Else it's an automatic "on the move" sweep.
214 * If TAKEMOB is non-zero, require and charge mobility.
215 * Return non-zero when the ships should stop.
218 shp_sweep(struct emp_qelem *ship_list, int explicit, int takemob,
221 struct emp_qelem *qp;
222 struct emp_qelem *next;
225 int mines, m, max, shells;
229 mlp = shp_find_capable(ship_list, M_SWEEP);
232 mpr(actor, "No minesweepers!\n");
236 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
237 if (sect.sct_type != SCT_WATER) {
239 mpr(actor, "%s is a %s. No seamines there!\n",
240 xyas(sect.sct_x, sect.sct_y, actor),
241 dchr[sect.sct_type].d_name);
245 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
247 mlp = (struct ulist *)qp;
248 if (!(mchr[mlp->unit.ship.shp_type].m_flags & M_SWEEP))
251 if (mlp->mobil <= 0.0) {
253 mpr(actor, "%s is out of mobility!\n",
254 prship(&mlp->unit.ship));
257 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
258 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
260 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
261 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
262 if (!(mines = sect.sct_mines))
264 max = mchr[mlp->unit.ship.shp_type].m_item[I_SHELL];
265 shells = mlp->unit.ship.shp_item[I_SHELL];
266 for (m = 0; mines > 0 && m < 5; m++) {
268 mpr(actor, "Sweep...\n");
270 shells = MIN(max, shells + 1);
271 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
274 sect.sct_mines = mines;
275 mlp->unit.ship.shp_item[I_SHELL] = shells;
276 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
278 if (shp_check_one_mines(mlp)) {
290 shp_check_one_mines(struct ulist *mlp)
295 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
296 if (sect.sct_type != SCT_WATER)
300 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
301 actor = mlp->unit.ship.shp_own;
302 shp_hit_mine(&mlp->unit.ship);
304 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
307 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
308 if (!mlp->unit.ship.shp_own)
315 shp_check_mines(struct emp_qelem *ship_list)
317 struct emp_qelem *qp;
318 struct emp_qelem *next;
322 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
324 mlp = (struct ulist *)qp;
325 if (shp_check_one_mines(mlp)) {
336 shp_stays(natid actor, char *str, struct ulist *mlp)
338 mpr(actor, "%s %s & stays in %s\n",
339 prship(&mlp->unit.ship), str,
340 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
341 shp_nav_put_one(mlp);
345 * Return whether and why SP would be stuck in SECTP.
348 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
350 switch (dchr[sectp->sct_type].d_nav) {
354 if (!(mchr[sp->shp_type].m_flags & M_CANAL)) {
355 return SHP_STUCK_CANAL;
359 if (sectp->sct_effic < 2)
360 return SHP_STUCK_CONSTRUCTION;
363 if (sectp->sct_effic < 60)
364 return SHP_STUCK_CONSTRUCTION;
370 return SHP_STUCK_IMPASSABLE;
372 return SHP_STUCK_NOT;
376 sect_has_dock(struct sctstr *sect)
378 switch (dchr[sect->sct_type].d_nav) {
388 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
391 struct emp_qelem *qp;
392 struct emp_qelem *next;
396 for (qp = list->q_back; qp != list; qp = next) {
398 mlp = (struct ulist *)qp;
399 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
402 (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
405 mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
413 shp_damage_one(struct ulist *mlp, int dam)
415 /* ship might have changed (launched interceptors, missile defense) */
416 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
417 shipdamage(&mlp->unit.ship, dam);
418 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
419 if (!mlp->unit.ship.shp_own) {
420 emp_remque(&mlp->queue);
426 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
427 int nowantflags, int x, int y)
429 struct emp_qelem *qp;
430 struct emp_qelem *next;
436 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
438 dam = ldround((double)totdam / count, 1);
439 for (qp = list->q_back; qp != list; qp = next) {
441 mlp = (struct ulist *)qp;
442 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
445 (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
448 mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
450 shp_damage_one(mlp, dam);
456 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
459 struct emp_qelem *qp;
460 struct emp_qelem *next;
463 for (qp = list->q_back; qp != list; qp = next) {
465 mlp = (struct ulist *)qp;
466 /* If the ship isn't in the requested sector, then continue */
467 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
470 (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
473 mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
480 static struct ulist *
481 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
483 struct emp_qelem *qp;
484 struct emp_qelem *next;
486 struct ulist *mvs = NULL;
488 for (qp = list->q_back; qp != list; qp = next) {
490 mlp = (struct ulist *)qp;
491 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
493 if (mchr[mlp->unit.ship.shp_type].m_flags & M_SUB)
495 if (!mchr[mlp->unit.ship.shp_type].m_nxlight &&
496 !mchr[mlp->unit.ship.shp_type].m_nchoppers &&
497 mchr[mlp->unit.ship.shp_type].m_cost < 1000 &&
498 !mchr[mlp->unit.ship.shp_type].m_nplanes &&
499 !mchr[mlp->unit.ship.shp_type].m_nland)
505 if (mchr[mlp->unit.ship.shp_type].m_cost * mlp->unit.ship.shp_effic >
506 mchr[mvs->unit.ship.shp_type].m_cost * mvs->unit.ship.shp_effic)
513 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
515 struct emp_qelem *qp;
516 struct emp_qelem *next;
519 int easiest = 9876; /* things start great for victim */
522 for (qp = list->q_back; qp != list; qp = next) {
524 mlp = (struct ulist *)qp;
526 (mchr[mlp->unit.ship.shp_type].m_flags & wantflags) != wantflags)
529 mchr[mlp->unit.ship.shp_type].m_flags & nowantflags)
531 hard = shp_hardtarget(&mlp->unit.ship);
533 easiest = hard; /* things get worse for victim */
536 return easiest - count;
540 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
545 struct emp_qelem msl_list, *qp, *newqp;
549 mvs = most_valuable_ship(list, newx, newy);
553 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
555 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
557 plp = (struct plist *)qp;
559 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
560 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
561 newx, newy, victim, &sublaunch) < 0)
564 if (msl_hit(&plp->plane,
565 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
566 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
567 dam = pln_damage(&plp->plane, 'p', 1);
569 "missile interdiction mission does %d damage to %s!\n",
570 dam, prship(&mvs->unit.ship));
571 shp_damage_one(mvs, dam);
573 dam = pln_damage(&plp->plane, 'p', 0);
574 collateral_damage(newx, newy, dam);
576 mvs = most_valuable_ship(list, newx, newy);
578 plp->plane.pln_effic = 0;
579 putplane(plp->plane.pln_uid, &plp->plane);
588 /* Note that this function has a side effect - it uses coastwatch
589 * ranges to see if it should fire upon a ship. So, this function
590 * is expected to return positive if a ship is in range, and 0 if a
591 * ship is not in range. */
593 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
595 struct emp_qelem *qp;
596 struct emp_qelem *next;
601 natp = getnatp(sectp->sct_own);
603 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
604 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
612 for (qp = list->q_back; qp != list; qp = next) {
614 mlp = (struct ulist *)qp;
615 if (mchr[mlp->unit.ship.shp_type].m_flags & M_SUB)
617 if (natp->nat_flags & NF_COASTWATCH)
618 wu(0, sectp->sct_own,
619 "%s %s sighted at %s\n",
620 cname(mlp->unit.ship.shp_own),
621 prship(&mlp->unit.ship),
622 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
625 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
632 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
641 signed char notified[MAXNOC];
644 /* Inform neutral and worse */
645 for (i = 0; i < MAXNOC; ++i) {
646 if (relations_with(i, victim) <= NEUTRAL)
652 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
653 while (nxtsct(&ns, &fsect)) {
656 if (fsect.sct_own == victim)
658 if (notified[fsect.sct_own])
660 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
661 if (notify_coastguard(list, trange, &fsect))
662 notified[fsect.sct_own] = 1;
664 if (opt_NO_FORT_FIRE)
665 return 0; /* Only coastwatch notify in nofortfire */
666 /* Only fire at Hostile ships */
667 for (i = 0; i < MAXNOC; ++i) {
668 if (relations_with(i, victim) >= NEUTRAL)
671 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
672 while (nxtsct(&ns, &fsect)) {
673 if (!notified[fsect.sct_own])
675 range = roundrange(fortrange(&fsect));
676 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
679 dam = fort_fire(&fsect);
685 mpr(victim, "Incoming fire does %d damage!\n", dam);
687 mpr(victim, "%s fires at you for %d!\n",
688 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
691 "%s fires at %s ships in %s for %d!\n",
692 xyas(fsect.sct_x, fsect.sct_y,
694 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
695 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
698 shp_damage(list, totdam, 0, M_SUB, newx, newy);
703 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
704 natid victim, int subs)
706 char *what = subs ? "subs" : "ships";
707 int wantflags = subs ? M_SUB : 0;
708 int nowantflags = subs ? 0 : M_SUB;
709 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
712 dam = unit_interdict(x, y, victim, what,
713 shp_easiest_target(list, wantflags, nowantflags),
716 shp_damage(list, dam, wantflags, nowantflags, x, y);
721 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
725 if (shp_contains(list, newx, newy, 0, M_SUB)) {
726 stopping |= shp_fort_interdiction(list, newx, newy, victim);
728 if (shp_contains(list, newx, newy, 0, M_SUB)) {
729 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
730 stopping |= shp_missile_interdiction(list, newx, newy, victim);
733 if (shp_contains(list, newx, newy, M_SUB, 0))
734 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
738 /* high value of hardtarget is harder to hit */
740 shp_hardtarget(struct shpstr *sp)
744 struct mchrstr *mcp = mchr + sp->shp_type;
747 getsect(sp->shp_x, sp->shp_y, §);
748 onsea = sect.sct_type == SCT_WATER;
749 if (mcp->m_flags & M_SUB)
751 return (int)((sp->shp_effic / 100.0) *
752 (20 + shp_speed(sp) * onsea / 2.0 - vis));
756 shp_hit_mine(struct shpstr *sp)
760 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
761 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
763 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
766 if (mchr[sp->shp_type].m_flags & M_SWEEP)
769 shipdamage(sp, ldround(m, 1));
775 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor)
778 struct emp_qelem *qp;
779 struct emp_qelem *next;
786 enum shp_stuck stuck;
791 if (CANT_HAPPEN(QEMPTY(list)))
794 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
795 shp_nav_put(list, actor);
801 mlp = (struct ulist *)list->q_back;
802 newx = xnorm(mlp->unit.ship.shp_x + dx);
803 newy = ynorm(mlp->unit.ship.shp_y + dy);
804 getsect(newx, newy, §);
806 if (sect.sct_own && relations_with(sect.sct_own, actor) < FRIENDLY) {
807 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
812 for (qp = list->q_back; qp != list; qp = next) {
814 mlp = (struct ulist *)qp;
815 switch (shp_check_nav(&mlp->unit.ship, §)) {
819 case SHP_STUCK_CANAL:
824 case SHP_STUCK_CONSTRUCTION:
825 case SHP_STUCK_IMPASSABLE:
826 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
831 mpr(actor, "is too large to fit into the canal system at %s\n",
832 xyas(newx, newy, actor));
836 for (qp = list->q_back; qp != list; qp = next) {
838 mlp = (struct ulist *)qp;
839 stuck = shp_check_nav(&mlp->unit.ship, §);
840 if (stuck == SHP_STUCK_CANAL) {
842 "is too large to fit into the canal system at %s",
843 xyas(newx, newy, actor));
844 shp_stays(actor, dp, mlp);
846 } else if (CANT_HAPPEN(stuck != SHP_STUCK_NOT)) {
847 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
848 shp_stays(actor, dp, mlp);
852 if (mlp->mobil <= 0.0) {
853 shp_stays(actor, "is out of mobility", mlp);
856 mobcost = shp_mobcost(&mlp->unit.ship);
857 mlp->unit.ship.shp_x = newx;
858 mlp->unit.ship.shp_y = newy;
859 if (mlp->mobil - mobcost < -127) {
862 mlp->mobil -= mobcost;
864 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
865 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
867 /* Now update the map for this ship */
868 rad_map_set(mlp->unit.ship.shp_own,
869 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
870 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
871 mchr[mlp->unit.ship.shp_type].m_vrnge);
875 stopping |= shp_sweep(list, 0, 0, actor);
878 stopping |= shp_check_mines(list);
881 stopping |= shp_interdict(list, newx, newy, actor);
888 * Check for incoming missiles with a P_MAR flag.
889 * Return True=1 if the missile was shotdown.
892 * Chad Zabel, July 95
896 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
901 double gun, eff, teff;
903 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
905 while (nxtitem(&ni, &ship)) {
909 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
912 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
915 if (ship.shp_effic < 60)
918 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
920 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
922 if (!shp_supply(&ship, I_SHELL, 2))
924 ship.shp_item[I_SHELL] -= 2;
925 putship(ship.shp_uid, &ship);
927 /* now calculate the odds */
928 gun = shp_usable_guns(&ship);
929 eff = ship.shp_effic / 100.0;
930 teff = ship.shp_tech / (ship.shp_tech + 200.0);
931 /* raise 4.5 for better interception -KHS */
932 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
933 hitchance = LIMIT_TO(hitchance, 0, 100);
934 hit = pct_chance(hitchance);
936 mpr(bombown, "%s anti-missile system activated...%s\n",
938 hit ? "KABOOOM!! Missile destroyed\n"
939 : "SWOOSH!! anti-missile system failed!!");
940 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
942 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
943 hit ? "KABOOOM!! Incoming missile destroyed!\n"
944 : "SWOOSH!! Missile evades anti-missile systems\n");
949 return 0; /* all attempts failed */
953 /* Fire missiles at a ship which has fired shells */
955 shp_missdef(struct shpstr *sp, natid victim)
957 struct emp_qelem list;
963 mlp = shp_insque(sp, &list);
964 sprintf(buf, "%s", prship(&mlp->unit.ship));
967 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
968 getship(sp->shp_uid, sp);
972 "missiles launched in defense did 100%% damage to %s\n",
974 wu(0, victim, "%s sunk!\n", buf);
975 } else if (eff > 0 && sp->shp_effic < eff) {
977 "missiles launched in defense did %d%% damage to %s\n",
978 100 * (eff - sp->shp_effic) / eff, buf);
985 shp_mobcost(struct shpstr *sp)
987 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
992 * Set SP's tech to TLEV along with everything else that depends on it.
995 shp_set_tech(struct shpstr *sp, int tlev)
997 struct mchrstr *mcp = mchr + sp->shp_type;
999 if (CANT_HAPPEN(tlev < mcp->m_tech))
1002 sp->shp_tech = tlev;