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,
109 int *togetherp, natid actor)
111 struct emp_qelem *qp;
112 struct emp_qelem *next;
123 for (qp = list->q_back; qp != list; qp = next) {
125 mlp = (struct ulist *)qp;
126 sp = &mlp->unit.ship;
127 getship(sp->shp_uid, sp);
128 if (sp->shp_own != actor) {
129 mpr(actor, "%s was sunk at %s\n",
130 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
131 emp_remque(&mlp->queue);
135 /* check crew - uws don't count */
136 if (sp->shp_item[I_MILIT] == 0 && sp->shp_item[I_CIVIL] == 0) {
137 shp_stays(actor, "is crewless", mlp);
140 if (!getsect(sp->shp_x, sp->shp_y, §)) {
141 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
144 switch (shp_check_nav(sp, §)) {
147 shp_stays(actor, "is caught in a construction zone", mlp);
151 shp_stays(actor, "is landlocked", mlp);
157 shp_stays(actor, "was just swallowed by a big green worm", mlp);
165 if (sp->shp_x != allx || sp->shp_y != ally)
167 if (sp->shp_mobil + 1 < (int)mlp->mobil) {
168 mlp->mobil = sp->shp_mobil;
170 if (mlp->mobil < *minmobp)
171 *minmobp = mlp->mobil;
172 if (mlp->mobil > *maxmobp)
173 *maxmobp = mlp->mobil;
178 shp_nav_put(struct emp_qelem *list, natid actor)
180 struct emp_qelem *qp, *next;
184 for (qp = list->q_back; qp != list; qp = next) {
186 mlp = (struct ulist *)qp;
187 sp = &mlp->unit.ship;
188 mpr(actor, "%s stopped at %s\n",
189 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
190 shp_nav_put_one(mlp);
195 shp_nav_put_one(struct ulist *mlp)
197 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
198 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
199 emp_remque(&mlp->queue);
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 shp_nav_put_one(mlp);
324 * Can SP navigate in SECTP?
325 * Sector ownership is *not* considered!
326 * Return NAVOK when yes.
327 * Return NAV_02 when it could if the sector was at least 2% efficient.
328 * Return NAV_60 when it could if the sector was at least 60% efficient.
329 * Return NAV_CANAL when it lacks capability M_CANAL.
330 * Return NAV_NONE when this sector type isn't navigable at all.
333 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
335 switch (dchr[sectp->sct_type].d_nav) {
339 if (mchr[sp->shp_type].m_flags & M_CANAL) {
340 if (sectp->sct_effic < 2)
346 if (sectp->sct_effic < 2)
350 if (sectp->sct_effic < 60)
362 sect_has_dock(struct sctstr *sect)
364 switch (dchr[sect->sct_type].d_nav) {
374 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
377 struct emp_qelem *qp;
378 struct emp_qelem *next;
382 for (qp = list->q_back; qp != list; qp = next) {
384 mlp = (struct ulist *)qp;
385 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
388 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
391 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
399 shp_damage_one(struct ulist *mlp, int dam)
401 /* ship might have changed (launched interceptors, missile defense) */
402 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
403 shipdamage(&mlp->unit.ship, dam);
404 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
405 if (!mlp->unit.ship.shp_own) {
406 emp_remque(&mlp->queue);
412 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
413 int nowantflags, int x, int y)
415 struct emp_qelem *qp;
416 struct emp_qelem *next;
422 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
424 dam = ldround((double)totdam / count, 1);
425 for (qp = list->q_back; qp != list; qp = next) {
427 mlp = (struct ulist *)qp;
428 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
431 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
434 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
436 shp_damage_one(mlp, dam);
442 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
445 struct emp_qelem *qp;
446 struct emp_qelem *next;
449 for (qp = list->q_back; qp != list; qp = next) {
451 mlp = (struct ulist *)qp;
452 /* If the ship isn't in the requested sector, then continue */
453 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
456 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
459 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
466 static struct ulist *
467 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
469 struct emp_qelem *qp;
470 struct emp_qelem *next;
472 struct ulist *mvs = NULL;
474 for (qp = list->q_back; qp != list; qp = next) {
476 mlp = (struct ulist *)qp;
477 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
479 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
481 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
482 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
483 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
484 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
485 !((struct mchrstr *)mlp->chrp)->m_nland)
491 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
492 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
499 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
501 struct emp_qelem *qp;
502 struct emp_qelem *next;
505 int easiest = 9876; /* things start great for victim */
508 for (qp = list->q_back; qp != list; qp = next) {
510 mlp = (struct ulist *)qp;
512 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
515 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
517 hard = shp_hardtarget(&mlp->unit.ship);
519 easiest = hard; /* things get worse for victim */
522 return easiest - count;
526 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
531 struct emp_qelem msl_list, *qp, *newqp;
535 mvs = most_valuable_ship(list, newx, newy);
539 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
541 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
543 plp = (struct plist *)qp;
545 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
546 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
547 newx, newy, victim, &sublaunch) < 0)
550 if (msl_hit(&plp->plane,
551 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
552 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
553 dam = pln_damage(&plp->plane, 'p', 1);
555 "missile interdiction mission does %d damage to %s!\n",
556 dam, prship(&mvs->unit.ship));
557 shp_damage_one(mvs, dam);
559 dam = pln_damage(&plp->plane, 'p', 0);
560 collateral_damage(newx, newy, dam);
562 mvs = most_valuable_ship(list, newx, newy);
564 plp->plane.pln_effic = 0;
565 putplane(plp->plane.pln_uid, &plp->plane);
574 /* Note that this function has a side effect - it uses coastwatch
575 * ranges to see if it should fire upon a ship. So, this function
576 * is expected to return positive if a ship is in range, and 0 if a
577 * ship is not in range. */
579 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
581 struct emp_qelem *qp;
582 struct emp_qelem *next;
587 natp = getnatp(sectp->sct_own);
589 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
590 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
598 for (qp = list->q_back; qp != list; qp = next) {
600 mlp = (struct ulist *)qp;
601 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
603 if (natp->nat_flags & NF_COASTWATCH)
604 wu(0, sectp->sct_own,
605 "%s %s sighted at %s\n",
606 cname(mlp->unit.ship.shp_own),
607 prship(&mlp->unit.ship),
608 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
611 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
618 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
627 signed char notified[MAXNOC];
630 /* Inform neutral and worse */
631 for (i = 0; i < MAXNOC; ++i) {
632 if (relations_with(i, victim) <= NEUTRAL)
638 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
639 while (nxtsct(&ns, &fsect)) {
642 if (fsect.sct_own == victim)
644 if (notified[fsect.sct_own])
646 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
647 if (notify_coastguard(list, trange, &fsect))
648 notified[fsect.sct_own] = 1;
650 if (opt_NO_FORT_FIRE)
651 return 0; /* Only coastwatch notify in nofortfire */
652 /* Only fire at Hostile ships */
653 for (i = 0; i < MAXNOC; ++i) {
654 if (relations_with(i, victim) >= NEUTRAL)
657 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
658 while (nxtsct(&ns, &fsect)) {
659 if (!notified[fsect.sct_own])
661 range = roundrange(fortrange(&fsect));
662 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
665 dam = fort_fire(&fsect);
671 mpr(victim, "Incoming fire does %d damage!\n", dam);
673 mpr(victim, "%s fires at you for %d!\n",
674 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
677 "%s fires at %s ships in %s for %d!\n",
678 xyas(fsect.sct_x, fsect.sct_y,
680 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
681 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
684 shp_damage(list, totdam, 0, M_SUB, newx, newy);
689 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
690 natid victim, int subs)
692 char *what = subs ? "subs" : "ships";
693 int wantflags = subs ? M_SUB : 0;
694 int nowantflags = subs ? 0 : M_SUB;
695 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
698 dam = unit_interdict(x, y, victim, what,
699 shp_easiest_target(list, wantflags, nowantflags),
702 shp_damage(list, dam, wantflags, nowantflags, x, y);
707 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
711 if (shp_contains(list, newx, newy, 0, M_SUB)) {
712 stopping |= shp_fort_interdiction(list, newx, newy, victim);
714 if (shp_contains(list, newx, newy, 0, M_SUB)) {
715 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
716 stopping |= shp_missile_interdiction(list, newx, newy, victim);
719 if (shp_contains(list, newx, newy, M_SUB, 0))
720 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
724 /* high value of hardtarget is harder to hit */
726 shp_hardtarget(struct shpstr *sp)
730 struct mchrstr *mcp = mchr + sp->shp_type;
733 getsect(sp->shp_x, sp->shp_y, §);
734 onsea = sect.sct_type == SCT_WATER;
735 if (mcp->m_flags & M_SUB)
737 return (int)((sp->shp_effic / 100.0) *
738 (20 + shp_speed(sp) * onsea / 2.0 - vis));
742 shp_hit_mine(struct shpstr *sp)
746 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
747 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
749 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
752 if (mchr[sp->shp_type].m_flags & M_SWEEP)
755 shipdamage(sp, ldround(m, 1));
761 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
765 struct emp_qelem *qp;
766 struct emp_qelem *next;
768 struct emp_qelem done;
779 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
780 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))
800 for (qp = list->q_back; qp != list; qp = next) {
802 mlp = (struct ulist *)qp;
803 newx = xnorm(mlp->unit.ship.shp_x + dx);
804 newy = ynorm(mlp->unit.ship.shp_y + dy);
805 getsect(newx, newy, §);
806 navigate = shp_check_nav(&mlp->unit.ship, §);
807 if (navigate != NAVOK ||
809 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
810 if (navigate == NAV_CANAL)
812 "is too large to fit into the canal system at %s",
813 xyas(newx, newy, actor));
815 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
816 if (together && !move) {
817 mpr(actor, "%s\n", dp);
820 shp_stays(actor, dp, mlp);
825 if (mlp->mobil <= 0.0) {
826 shp_stays(actor, "is out of mobility", mlp);
829 mobcost = shp_mobcost(&mlp->unit.ship);
830 mlp->unit.ship.shp_x = newx;
831 mlp->unit.ship.shp_y = newy;
832 if (mlp->mobil - mobcost < -127) {
835 mlp->mobil -= mobcost;
837 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
838 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
840 /* Now update the map for this ship */
841 rad_map_set(mlp->unit.ship.shp_own,
842 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
843 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
844 ((struct mchrstr *)mlp->chrp)->m_vrnge);
848 stopping |= shp_sweep(list, 0, 0, actor);
851 stopping |= shp_check_mines(list);
855 /* interdict ships sector by sector */
857 while (!QEMPTY(list)) {
858 mlp = (struct ulist *)list->q_back;
859 newx = mlp->unit.ship.shp_x;
860 newy = mlp->unit.ship.shp_y;
861 stopping |= shp_interdict(list, newx, newy, actor);
862 /* move survivors in this sector to done */
863 for (qp = list->q_back; qp != list; qp = next) {
865 mlp = (struct ulist *)qp;
866 if (mlp->unit.ship.shp_x == newx &&
867 mlp->unit.ship.shp_y == newy) {
869 emp_insque(qp, &done);
873 /* assign surviving ships back to list */
874 emp_insque(list, &done);
882 * Check for incoming missiles with a P_MAR flag.
883 * Return True=1 if the missile was shotdown.
886 * Chad Zabel, July 95
890 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
895 double gun, eff, teff;
897 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
899 while (nxtitem(&ni, &ship)) {
903 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
906 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
909 if (ship.shp_effic < 60)
912 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
914 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
916 if (!shp_supply(&ship, I_SHELL, 2))
918 ship.shp_item[I_SHELL] -= 2;
919 putship(ship.shp_uid, &ship);
921 /* now calculate the odds */
922 gun = shp_usable_guns(&ship);
923 eff = ship.shp_effic / 100.0;
924 teff = ship.shp_tech / (ship.shp_tech + 200.0);
925 /* raise 4.5 for better interception -KHS */
926 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
927 hitchance = LIMIT_TO(hitchance, 0, 100);
928 hit = pct_chance(hitchance);
930 mpr(bombown, "%s anti-missile system activated...%s\n",
932 hit ? "KABOOOM!! Missile destroyed\n"
933 : "SWOOSH!! anti-missile system failed!!");
934 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
936 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
937 hit ? "KABOOOM!! Incoming missile destroyed!\n"
938 : "SWOOSH!! Missile evades anti-missile systems\n");
943 return 0; /* all attempts failed */
947 /* Fire missiles at a ship which has fired shells */
949 shp_missdef(struct shpstr *sp, natid victim)
951 struct emp_qelem list;
957 mlp = shp_insque(sp, &list);
958 sprintf(buf, "%s", prship(&mlp->unit.ship));
961 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
962 getship(sp->shp_uid, sp);
966 "missiles launched in defense did 100%% damage to %s\n",
968 wu(0, victim, "%s sunk!\n", buf);
969 } else if (eff > 0 && sp->shp_effic < eff) {
971 "missiles launched in defense did %d%% damage to %s\n",
972 100 * (eff - sp->shp_effic) / eff, buf);
979 shp_mobcost(struct shpstr *sp)
981 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
986 * Set SP's tech to TLEV along with everything else that depends on it.
989 shp_set_tech(struct shpstr *sp, int tlev)
991 struct mchrstr *mcp = mchr + sp->shp_type;
993 if (CANT_HAPPEN(tlev < mcp->m_tech))