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 case SHP_STUCK_CONSTRUCTION:
148 shp_stays(actor, "is caught in a construction zone", mlp);
153 case SHP_STUCK_CANAL:
154 case SHP_STUCK_IMPASSABLE:
155 shp_stays(actor, "is landlocked", mlp);
163 if (sp->shp_x != allx || sp->shp_y != ally)
165 if (sp->shp_mobil + 1 < (int)mlp->mobil) {
166 mlp->mobil = sp->shp_mobil;
168 if (mlp->mobil < *minmobp)
169 *minmobp = mlp->mobil;
170 if (mlp->mobil > *maxmobp)
171 *maxmobp = mlp->mobil;
176 shp_nav_put(struct emp_qelem *list, natid actor)
178 struct emp_qelem *qp, *next;
182 for (qp = list->q_back; qp != list; qp = next) {
184 mlp = (struct ulist *)qp;
185 sp = &mlp->unit.ship;
186 mpr(actor, "%s stopped at %s\n",
187 prship(sp), xyas(sp->shp_x, sp->shp_y, actor));
188 shp_nav_put_one(mlp);
193 shp_nav_put_one(struct ulist *mlp)
195 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
196 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
197 emp_remque(&mlp->queue);
202 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
204 struct emp_qelem *qp;
205 struct emp_qelem *next;
208 int mines, m, max, shells;
212 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
214 mlp = (struct ulist *)qp;
215 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
217 mpr(actor, "%s doesn't have minesweeping capability!\n",
218 prship(&mlp->unit.ship));
221 if (takemob && mlp->mobil <= 0.0) {
223 mpr(actor, "%s is out of mobility!\n",
224 prship(&mlp->unit.ship));
227 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
228 if (sect.sct_type != SCT_WATER) {
230 mpr(actor, "%s is not at sea. No mines there!\n",
231 prship(&mlp->unit.ship));
235 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
236 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
238 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
239 if (!(mines = sect.sct_mines))
241 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
242 shells = mlp->unit.ship.shp_item[I_SHELL];
243 for (m = 0; mines > 0 && m < 5; m++) {
245 mpr(actor, "Sweep...\n");
247 shells = MIN(max, shells + 1);
248 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
251 sect.sct_mines = mines;
252 mlp->unit.ship.shp_item[I_SHELL] = shells;
253 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
255 if (shp_check_one_mines(mlp)) {
267 shp_check_one_mines(struct ulist *mlp)
272 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
273 if (sect.sct_type != SCT_WATER)
277 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
278 actor = mlp->unit.ship.shp_own;
279 shp_hit_mine(&mlp->unit.ship);
281 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
284 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
285 if (!mlp->unit.ship.shp_own)
292 shp_check_mines(struct emp_qelem *ship_list)
294 struct emp_qelem *qp;
295 struct emp_qelem *next;
299 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
301 mlp = (struct ulist *)qp;
302 if (shp_check_one_mines(mlp)) {
313 shp_stays(natid actor, char *str, struct ulist *mlp)
315 mpr(actor, "%s %s & stays in %s\n",
316 prship(&mlp->unit.ship), str,
317 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
318 shp_nav_put_one(mlp);
322 * Return whether and why SP would be stuck in SECTP.
325 shp_check_nav(struct shpstr *sp, struct sctstr *sectp)
327 switch (dchr[sectp->sct_type].d_nav) {
331 if (!(mchr[sp->shp_type].m_flags & M_CANAL)) {
332 return SHP_STUCK_CANAL;
336 if (sectp->sct_effic < 2)
337 return SHP_STUCK_CONSTRUCTION;
340 if (sectp->sct_effic < 60)
341 return SHP_STUCK_CONSTRUCTION;
347 return SHP_STUCK_IMPASSABLE;
349 return SHP_STUCK_NOT;
353 sect_has_dock(struct sctstr *sect)
355 switch (dchr[sect->sct_type].d_nav) {
365 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
368 struct emp_qelem *qp;
369 struct emp_qelem *next;
373 for (qp = list->q_back; qp != list; qp = next) {
375 mlp = (struct ulist *)qp;
376 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
379 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
382 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
390 shp_damage_one(struct ulist *mlp, int dam)
392 /* ship might have changed (launched interceptors, missile defense) */
393 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
394 shipdamage(&mlp->unit.ship, dam);
395 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
396 if (!mlp->unit.ship.shp_own) {
397 emp_remque(&mlp->queue);
403 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
404 int nowantflags, int x, int y)
406 struct emp_qelem *qp;
407 struct emp_qelem *next;
413 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
415 dam = ldround((double)totdam / count, 1);
416 for (qp = list->q_back; qp != list; qp = next) {
418 mlp = (struct ulist *)qp;
419 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
422 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
425 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
427 shp_damage_one(mlp, dam);
433 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
436 struct emp_qelem *qp;
437 struct emp_qelem *next;
440 for (qp = list->q_back; qp != list; qp = next) {
442 mlp = (struct ulist *)qp;
443 /* If the ship isn't in the requested sector, then continue */
444 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
447 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
450 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
457 static struct ulist *
458 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
460 struct emp_qelem *qp;
461 struct emp_qelem *next;
463 struct ulist *mvs = NULL;
465 for (qp = list->q_back; qp != list; qp = next) {
467 mlp = (struct ulist *)qp;
468 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
470 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
472 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
473 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
474 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
475 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
476 !((struct mchrstr *)mlp->chrp)->m_nland)
482 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
483 ((struct mchrstr *)mvs->chrp)->m_cost * mvs->unit.ship.shp_effic)
490 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
492 struct emp_qelem *qp;
493 struct emp_qelem *next;
496 int easiest = 9876; /* things start great for victim */
499 for (qp = list->q_back; qp != list; qp = next) {
501 mlp = (struct ulist *)qp;
503 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
506 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
508 hard = shp_hardtarget(&mlp->unit.ship);
510 easiest = hard; /* things get worse for victim */
513 return easiest - count;
517 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
522 struct emp_qelem msl_list, *qp, *newqp;
526 mvs = most_valuable_ship(list, newx, newy);
530 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
532 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
534 plp = (struct plist *)qp;
536 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
537 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
538 newx, newy, victim, &sublaunch) < 0)
541 if (msl_hit(&plp->plane,
542 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
543 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
544 dam = pln_damage(&plp->plane, 'p', 1);
546 "missile interdiction mission does %d damage to %s!\n",
547 dam, prship(&mvs->unit.ship));
548 shp_damage_one(mvs, dam);
550 dam = pln_damage(&plp->plane, 'p', 0);
551 collateral_damage(newx, newy, dam);
553 mvs = most_valuable_ship(list, newx, newy);
555 plp->plane.pln_effic = 0;
556 putplane(plp->plane.pln_uid, &plp->plane);
565 /* Note that this function has a side effect - it uses coastwatch
566 * ranges to see if it should fire upon a ship. So, this function
567 * is expected to return positive if a ship is in range, and 0 if a
568 * ship is not in range. */
570 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
572 struct emp_qelem *qp;
573 struct emp_qelem *next;
578 natp = getnatp(sectp->sct_own);
580 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
581 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
589 for (qp = list->q_back; qp != list; qp = next) {
591 mlp = (struct ulist *)qp;
592 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
594 if (natp->nat_flags & NF_COASTWATCH)
595 wu(0, sectp->sct_own,
596 "%s %s sighted at %s\n",
597 cname(mlp->unit.ship.shp_own),
598 prship(&mlp->unit.ship),
599 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
602 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
609 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
618 signed char notified[MAXNOC];
621 /* Inform neutral and worse */
622 for (i = 0; i < MAXNOC; ++i) {
623 if (relations_with(i, victim) <= NEUTRAL)
629 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
630 while (nxtsct(&ns, &fsect)) {
633 if (fsect.sct_own == victim)
635 if (notified[fsect.sct_own])
637 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
638 if (notify_coastguard(list, trange, &fsect))
639 notified[fsect.sct_own] = 1;
641 if (opt_NO_FORT_FIRE)
642 return 0; /* Only coastwatch notify in nofortfire */
643 /* Only fire at Hostile ships */
644 for (i = 0; i < MAXNOC; ++i) {
645 if (relations_with(i, victim) >= NEUTRAL)
648 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
649 while (nxtsct(&ns, &fsect)) {
650 if (!notified[fsect.sct_own])
652 range = roundrange(fortrange(&fsect));
653 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
656 dam = fort_fire(&fsect);
662 mpr(victim, "Incoming fire does %d damage!\n", dam);
664 mpr(victim, "%s fires at you for %d!\n",
665 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
668 "%s fires at %s ships in %s for %d!\n",
669 xyas(fsect.sct_x, fsect.sct_y,
671 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
672 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
675 shp_damage(list, totdam, 0, M_SUB, newx, newy);
680 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
681 natid victim, int subs)
683 char *what = subs ? "subs" : "ships";
684 int wantflags = subs ? M_SUB : 0;
685 int nowantflags = subs ? 0 : M_SUB;
686 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
689 dam = unit_interdict(x, y, victim, what,
690 shp_easiest_target(list, wantflags, nowantflags),
693 shp_damage(list, dam, wantflags, nowantflags, x, y);
698 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
702 if (shp_contains(list, newx, newy, 0, M_SUB)) {
703 stopping |= shp_fort_interdiction(list, newx, newy, victim);
705 if (shp_contains(list, newx, newy, 0, M_SUB)) {
706 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
707 stopping |= shp_missile_interdiction(list, newx, newy, victim);
710 if (shp_contains(list, newx, newy, M_SUB, 0))
711 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
715 /* high value of hardtarget is harder to hit */
717 shp_hardtarget(struct shpstr *sp)
721 struct mchrstr *mcp = mchr + sp->shp_type;
724 getsect(sp->shp_x, sp->shp_y, §);
725 onsea = sect.sct_type == SCT_WATER;
726 if (mcp->m_flags & M_SUB)
728 return (int)((sp->shp_effic / 100.0) *
729 (20 + shp_speed(sp) * onsea / 2.0 - vis));
733 shp_hit_mine(struct shpstr *sp)
737 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
738 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
740 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
743 if (mchr[sp->shp_type].m_flags & M_SWEEP)
746 shipdamage(sp, ldround(m, 1));
752 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
756 struct emp_qelem *qp;
757 struct emp_qelem *next;
759 struct emp_qelem done;
765 enum shp_stuck stuck;
770 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
771 shp_nav_put(list, actor);
778 for (qp = list->q_back; qp != list; qp = next) {
780 mlp = (struct ulist *)qp;
781 newx = xnorm(mlp->unit.ship.shp_x + dx);
782 newy = ynorm(mlp->unit.ship.shp_y + dy);
783 getsect(newx, newy, §);
784 stuck = shp_check_nav(&mlp->unit.ship, §);
785 if (stuck == SHP_STUCK_NOT &&
787 || relations_with(sect.sct_own, actor) >= FRIENDLY))
791 for (qp = list->q_back; qp != list; qp = next) {
793 mlp = (struct ulist *)qp;
794 newx = xnorm(mlp->unit.ship.shp_x + dx);
795 newy = ynorm(mlp->unit.ship.shp_y + dy);
796 getsect(newx, newy, §);
797 stuck = shp_check_nav(&mlp->unit.ship, §);
798 if (stuck != SHP_STUCK_NOT ||
800 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
801 if (stuck == SHP_STUCK_CANAL)
803 "is too large to fit into the canal system at %s",
804 xyas(newx, newy, actor));
806 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
807 if (together && !move) {
808 mpr(actor, "%s\n", dp);
811 shp_stays(actor, dp, mlp);
816 if (mlp->mobil <= 0.0) {
817 shp_stays(actor, "is out of mobility", mlp);
820 mobcost = shp_mobcost(&mlp->unit.ship);
821 mlp->unit.ship.shp_x = newx;
822 mlp->unit.ship.shp_y = newy;
823 if (mlp->mobil - mobcost < -127) {
826 mlp->mobil -= mobcost;
828 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
829 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
831 /* Now update the map for this ship */
832 rad_map_set(mlp->unit.ship.shp_own,
833 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
834 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
835 ((struct mchrstr *)mlp->chrp)->m_vrnge);
839 stopping |= shp_sweep(list, 0, 0, actor);
842 stopping |= shp_check_mines(list);
846 /* interdict ships sector by sector */
848 while (!QEMPTY(list)) {
849 mlp = (struct ulist *)list->q_back;
850 newx = mlp->unit.ship.shp_x;
851 newy = mlp->unit.ship.shp_y;
852 stopping |= shp_interdict(list, newx, newy, actor);
853 /* move survivors in this sector to done */
854 for (qp = list->q_back; qp != list; qp = next) {
856 mlp = (struct ulist *)qp;
857 if (mlp->unit.ship.shp_x == newx &&
858 mlp->unit.ship.shp_y == newy) {
860 emp_insque(qp, &done);
864 /* assign surviving ships back to list */
865 emp_insque(list, &done);
873 * Check for incoming missiles with a P_MAR flag.
874 * Return True=1 if the missile was shotdown.
877 * Chad Zabel, July 95
881 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
886 double gun, eff, teff;
888 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
890 while (nxtitem(&ni, &ship)) {
894 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
897 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
900 if (ship.shp_effic < 60)
903 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
905 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
907 if (!shp_supply(&ship, I_SHELL, 2))
909 ship.shp_item[I_SHELL] -= 2;
910 putship(ship.shp_uid, &ship);
912 /* now calculate the odds */
913 gun = shp_usable_guns(&ship);
914 eff = ship.shp_effic / 100.0;
915 teff = ship.shp_tech / (ship.shp_tech + 200.0);
916 /* raise 4.5 for better interception -KHS */
917 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
918 hitchance = LIMIT_TO(hitchance, 0, 100);
919 hit = pct_chance(hitchance);
921 mpr(bombown, "%s anti-missile system activated...%s\n",
923 hit ? "KABOOOM!! Missile destroyed\n"
924 : "SWOOSH!! anti-missile system failed!!");
925 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
927 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
928 hit ? "KABOOOM!! Incoming missile destroyed!\n"
929 : "SWOOSH!! Missile evades anti-missile systems\n");
934 return 0; /* all attempts failed */
938 /* Fire missiles at a ship which has fired shells */
940 shp_missdef(struct shpstr *sp, natid victim)
942 struct emp_qelem list;
948 mlp = shp_insque(sp, &list);
949 sprintf(buf, "%s", prship(&mlp->unit.ship));
952 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
953 getship(sp->shp_uid, sp);
957 "missiles launched in defense did 100%% damage to %s\n",
959 wu(0, victim, "%s sunk!\n", buf);
960 } else if (eff > 0 && sp->shp_effic < eff) {
962 "missiles launched in defense did %d%% damage to %s\n",
963 100 * (eff - sp->shp_effic) / eff, buf);
970 shp_mobcost(struct shpstr *sp)
972 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
977 * Set SP's tech to TLEV along with everything else that depends on it.
980 shp_set_tech(struct shpstr *sp, int tlev)
982 struct mchrstr *mcp = mchr + sp->shp_type;
984 if (CANT_HAPPEN(tlev < mcp->m_tech))