2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2010, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program 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 2 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, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * shpsub.c: Ship subroutine stuff
30 * Known contributors to this file:
32 * Steve McClure, 1996-2000
33 * Markus Armbruster, 2006-2009
48 #include "prototypes.h"
55 static int shp_check_one_mines(struct ulist *);
56 static int shp_hit_mine(struct shpstr *);
57 static void shp_mess(char *, struct ulist *);
60 shp_sel(struct nstr_item *ni, struct emp_qelem *list)
67 while (nxtitem(ni, &ship)) {
70 mcp = &mchr[(int)ship.shp_type];
72 if (ontradingblock(EF_SHIP, &ship)) {
73 pr("ship #%d inelligible - it's for sale.\n",
80 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
81 putship(ship.shp_uid, &ship);
82 mlp = malloc(sizeof(struct ulist));
83 mlp->chrp = (struct empobj_chr *)mcp;
84 mlp->unit.ship = ship;
85 mlp->mobil = ship.shp_mobil;
86 emp_insque(&mlp->queue, list);
90 /* This function assumes that the list was created by shp_sel */
92 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
93 int *togetherp, natid actor)
96 struct emp_qelem *next;
107 for (qp = list->q_back; qp != list; qp = next) {
109 mlp = (struct ulist *)qp;
110 getship(mlp->unit.ship.shp_uid, &ship);
111 if (ship.shp_own != actor) {
112 mpr(actor, "%s was sunk at %s\n",
113 prship(&ship), xyas(ship.shp_x, ship.shp_y, actor));
114 emp_remque((struct emp_qelem *)mlp);
119 if (*ship.shp_path && !update_running) {
120 shp_mess("has a sail path", mlp);
121 mpr(actor, "Use `sail <#> -' to reset\n");
125 /* check crew - uws don't count */
126 if (ship.shp_item[I_MILIT] == 0 && ship.shp_item[I_CIVIL] == 0) {
127 shp_mess("is crewless", mlp);
130 if (!getsect(ship.shp_x, ship.shp_y, §)) {
131 shp_mess("was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
134 switch (shp_check_nav(§, &ship)) {
135 case CN_CONSTRUCTION:
136 shp_mess("is caught in a construction zone", mlp);
139 shp_mess("is landlocked", mlp);
145 shp_mess("was just swallowed by a big green worm", mlp);
153 if (ship.shp_x != allx || ship.shp_y != ally)
155 if (ship.shp_mobil + 1 < (int)mlp->mobil) {
156 mlp->mobil = ship.shp_mobil;
158 if (mlp->mobil < *minmobp)
159 *minmobp = mlp->mobil;
160 if (mlp->mobil > *maxmobp)
161 *maxmobp = mlp->mobil;
162 mlp->unit.ship = ship;
167 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
169 struct emp_qelem *qp;
170 struct emp_qelem *next;
173 int mines, m, max, shells;
177 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
179 mlp = (struct ulist *)qp;
180 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
182 mpr(actor, "%s doesn't have minesweeping capability!\n",
183 prship(&mlp->unit.ship));
186 if (takemob && mlp->mobil <= 0.0) {
188 mpr(actor, "%s is out of mobility!\n",
189 prship(&mlp->unit.ship));
192 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
193 if (sect.sct_type != SCT_WATER) {
195 mpr(actor, "%s is not at sea. No mines there!\n",
196 prship(&mlp->unit.ship));
200 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
201 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
203 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
204 if (!(mines = sect.sct_mines))
206 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
207 shells = mlp->unit.ship.shp_item[I_SHELL];
208 for (m = 0; mines > 0 && m < 5; m++) {
210 mpr(actor, "Sweep...\n");
212 shells = MIN(max, shells + 1);
213 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
216 sect.sct_mines = mines;
217 mlp->unit.ship.shp_item[I_SHELL] = shells;
218 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
220 if (shp_check_one_mines(mlp)) {
232 shp_check_one_mines(struct ulist *mlp)
237 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
238 if (sect.sct_type != SCT_WATER)
242 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
243 actor = mlp->unit.ship.shp_own;
244 shp_hit_mine(&mlp->unit.ship);
246 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
249 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
250 if (!mlp->unit.ship.shp_own)
257 shp_check_mines(struct emp_qelem *ship_list)
259 struct emp_qelem *qp;
260 struct emp_qelem *next;
264 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
266 mlp = (struct ulist *)qp;
267 if (shp_check_one_mines(mlp)) {
278 shp_mess(char *str, struct ulist *mlp)
280 mpr(mlp->unit.ship.shp_own, "%s %s & stays in %s\n",
281 prship(&mlp->unit.ship),
282 str, xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
283 mlp->unit.ship.shp_own));
284 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
285 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
286 emp_remque((struct emp_qelem *)mlp);
291 shp_check_nav(struct sctstr *sect, struct shpstr *shp)
293 switch (dchr[sect->sct_type].d_nav) {
297 if (mchr[(int)shp->shp_type].m_flags & M_CANAL) {
298 if (sect->sct_effic < 2)
299 return CN_CONSTRUCTION;
301 return CN_LANDLOCKED;
304 if (sect->sct_effic < 2)
305 return CN_CONSTRUCTION;
308 if (sect->sct_effic < 60)
309 return CN_CONSTRUCTION;
312 return CN_LANDLOCKED;
318 sect_has_dock(struct sctstr *sect)
320 switch (dchr[sect->sct_type].d_nav) {
330 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
333 struct emp_qelem *qp;
334 struct emp_qelem *next;
338 for (qp = list->q_back; qp != list; qp = next) {
340 mlp = (struct ulist *)qp;
341 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
344 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
347 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
355 shp_damage_one(struct ulist *mlp, int dam)
357 /* ship might have changed (launched interceptors, missile defense) */
358 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
359 shipdamage(&mlp->unit.ship, dam);
360 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
361 if (!mlp->unit.ship.shp_own) {
362 emp_remque((struct emp_qelem *)mlp);
368 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
369 int nowantflags, int x, int y)
371 struct emp_qelem *qp;
372 struct emp_qelem *next;
378 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
380 dam = ldround((double)totdam / count, 1);
381 for (qp = list->q_back; qp != list; qp = next) {
383 mlp = (struct ulist *)qp;
384 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
387 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
390 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
392 shp_damage_one(mlp, dam);
398 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
401 struct emp_qelem *qp;
402 struct emp_qelem *next;
405 for (qp = list->q_back; qp != list; qp = next) {
407 mlp = (struct ulist *)qp;
408 /* If the ship isn't in the requested sector, then continue */
409 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
412 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
415 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
422 static struct ulist *
423 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
425 struct emp_qelem *qp;
426 struct emp_qelem *next;
428 struct ulist *mvs = NULL;
430 for (qp = list->q_back; qp != list; qp = next) {
432 mlp = (struct ulist *)qp;
433 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
435 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
437 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
438 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
439 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
440 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
441 !((struct mchrstr *)mlp->chrp)->m_nland)
447 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
448 ((struct mchrstr *)mlp->chrp)->m_cost * mvs->unit.ship.shp_effic)
455 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
457 struct emp_qelem *qp;
458 struct emp_qelem *next;
461 int easiest = 9876; /* things start great for victim */
464 for (qp = list->q_back; qp != list; qp = next) {
466 mlp = (struct ulist *)qp;
468 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
471 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
473 hard = shp_hardtarget(&mlp->unit.ship);
475 easiest = hard; /* things get worse for victim */
478 return easiest - count;
482 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
487 struct emp_qelem msl_list, *qp, *newqp;
491 mvs = most_valuable_ship(list, newx, newy);
495 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
497 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
499 plp = (struct plist *)qp;
501 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
502 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
503 newx, newy, victim, &sublaunch) < 0)
506 if (msl_hit(&plp->plane,
507 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
508 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
509 dam = pln_damage(&plp->plane, 'p', 1);
511 "missile interdiction mission does %d damage to %s!\n",
512 dam, prship(&mvs->unit.ship));
513 shp_damage_one(mvs, dam);
515 dam = pln_damage(&plp->plane, 'p', 0);
516 collateral_damage(newx, newy, dam);
518 mvs = most_valuable_ship(list, newx, newy);
520 plp->plane.pln_effic = 0;
521 putplane(plp->plane.pln_uid, &plp->plane);
530 /* Note that this function has a side effect - it uses coastwatch
531 * ranges to see if it should fire upon a ship. So, this function
532 * is expected to return positive if a ship is in range, and 0 if a
533 * ship is not in range. */
535 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
537 struct emp_qelem *qp;
538 struct emp_qelem *next;
543 natp = getnatp(sectp->sct_own);
545 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
546 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
554 for (qp = list->q_back; qp != list; qp = next) {
556 mlp = (struct ulist *)qp;
557 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
559 if (natp->nat_flags & NF_COASTWATCH)
560 wu(0, sectp->sct_own,
561 "%s %s sighted at %s\n",
562 cname(mlp->unit.ship.shp_own),
563 prship(&mlp->unit.ship),
564 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
567 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
574 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
583 signed char notified[MAXNOC];
586 /* Inform neutral and worse */
587 for (i = 0; i < MAXNOC; ++i) {
588 if (getrel(getnatp(i), victim) <= NEUTRAL)
594 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
595 while (nxtsct(&ns, &fsect)) {
598 if (fsect.sct_own == victim)
600 if (notified[fsect.sct_own])
602 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
603 if (notify_coastguard(list, trange, &fsect))
604 notified[fsect.sct_own] = 1;
606 if (opt_NO_FORT_FIRE)
607 return 0; /* Only coastwatch notify in nofortfire */
608 /* Only fire at Hostile ships */
609 for (i = 0; i < MAXNOC; ++i) {
610 if (getrel(getnatp(i), victim) >= NEUTRAL)
613 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
614 while (nxtsct(&ns, &fsect)) {
615 if (!notified[fsect.sct_own])
617 range = roundrange(fortrange(&fsect));
618 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
621 dam = fort_fire(&fsect);
627 mpr(victim, "Incoming fire does %d damage!\n", dam);
629 mpr(victim, "%s fires at you for %d!\n",
630 xyas(fsect.sct_x,fsect.sct_y,victim),
634 "%s fires at %s ships in %s for %d!\n",
635 xyas(fsect.sct_x, fsect.sct_y,
637 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
638 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
641 shp_damage(list, totdam, 0, M_SUB, newx, newy);
646 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
647 natid victim, int subs)
649 char *what = subs ? "subs" : "ships";
650 int wantflags = subs ? M_SUB : 0;
651 int nowantflags = subs ? 0 : M_SUB;
652 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
655 dam = unit_interdict(x, y, victim, what,
656 shp_easiest_target(list, wantflags, nowantflags),
659 shp_damage(list, dam, wantflags, nowantflags, x, y);
664 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
668 if (shp_contains(list, newx, newy, 0, M_SUB)) {
669 stopping |= shp_fort_interdiction(list, newx, newy, victim);
671 if (shp_contains(list, newx, newy, 0, M_SUB)) {
672 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
673 stopping |= shp_missile_interdiction(list, newx, newy, victim);
676 if (shp_contains(list, newx, newy, M_SUB, 0))
677 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
681 /* high value of hardtarget is harder to hit */
683 shp_hardtarget(struct shpstr *sp)
687 struct mchrstr *mcp = mchr + sp->shp_type;
690 getsect(sp->shp_x, sp->shp_y, §);
691 onsea = sect.sct_type == SCT_WATER;
692 if (mcp->m_flags & M_SUB)
694 return (int)((sp->shp_effic / 100.0) *
695 (20 + shp_speed(sp) * onsea / 2.0 - vis));
699 shp_hit_mine(struct shpstr *sp)
703 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
704 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
706 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
709 if (mchr[sp->shp_type].m_flags & M_SWEEP)
712 shipdamage(sp, ldround(m, 1));
718 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
722 struct emp_qelem *qp;
723 struct emp_qelem *next;
725 struct emp_qelem done;
732 double tech; /* for mapping */
733 double tf; /* for mapping */
737 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
738 unit_put(list, actor);
743 for (qp = list->q_back; qp != list; qp = next) {
745 mlp = (struct ulist *)qp;
746 newx = xnorm(mlp->unit.ship.shp_x + dx);
747 newy = ynorm(mlp->unit.ship.shp_y + dy);
748 getsect(newx, newy, §);
749 navigate = shp_check_nav(§, &mlp->unit.ship);
750 if (navigate != CN_NAVIGABLE ||
751 (sect.sct_own && actor != sect.sct_own &&
752 getrel(getnatp(sect.sct_own), actor) < FRIENDLY)) {
753 if (dchr[sect.sct_type].d_nav == NAV_CANAL &&
754 !(((struct mchrstr *)mlp->chrp)->m_flags & M_CANAL) &&
755 navigate == CN_LANDLOCKED)
757 "is too large to fit into the canal system at %s",
758 xyas(newx, newy, actor));
760 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
762 mpr(actor, "%s\n", dp);
770 if (mlp->mobil <= 0.0) {
771 shp_mess("is out of mobility", mlp);
774 mobcost = shp_mobcost(&mlp->unit.ship);
775 mlp->unit.ship.shp_x = newx;
776 mlp->unit.ship.shp_y = newy;
777 if (mlp->mobil - mobcost < -127) {
780 mlp->mobil -= mobcost;
782 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
783 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
785 /* Now update the map for this ship */
786 tech = techfact(mlp->unit.ship.shp_tech,
787 ((struct mchrstr *)mlp->chrp)->m_vrnge);
788 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SONAR)
789 tf = techfact(mlp->unit.ship.shp_tech, 1.0);
792 radmapupd(mlp->unit.ship.shp_own,
793 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
794 (int)mlp->unit.ship.shp_effic, (int)tech, tf);
798 stopping |= shp_sweep(list, 0, 0, actor);
801 stopping |= shp_check_mines(list);
805 /* interdict ships sector by sector */
807 while (!QEMPTY(list)) {
808 mlp = (struct ulist *)list->q_back;
809 newx = mlp->unit.ship.shp_x;
810 newy = mlp->unit.ship.shp_y;
811 stopping |= shp_interdict(list, newx, newy, actor);
812 /* move survivors in this sector to done */
813 for (qp = list->q_back; qp != list; qp = next) {
815 mlp = (struct ulist *)qp;
816 if (mlp->unit.ship.shp_x == newx &&
817 mlp->unit.ship.shp_y == newy) {
819 emp_insque(qp, &done);
823 /* assign surviving ships back to list */
824 emp_insque(list, &done);
832 * Check for incoming missiles with a P_MAR flag.
833 * Return True=1 if the missile was shotdown.
836 * Chad Zabel, July 95
840 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
845 double gun, eff, teff;
847 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
849 while (nxtitem(&ni, &ship)) {
853 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
856 if (getrel(getnatp(ship.shp_own), bombown) >= NEUTRAL)
859 if (ship.shp_effic < 60)
862 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
864 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
866 if (!shp_supply(&ship, I_SHELL, 2))
868 ship.shp_item[I_SHELL] -= 2;
869 putship(ship.shp_uid, &ship);
871 /* now calculate the odds */
872 gun = shp_usable_guns(&ship);
873 eff = ship.shp_effic / 100.0;
874 teff = ship.shp_tech / (ship.shp_tech + 200.0);
875 /* raise 4.5 for better interception -KHS */
876 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
882 mpr(bombown, "%s anti-missile system activated...",
883 cname(ship.shp_own));
884 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
886 mpr(ship.shp_own, "%d%% hitchance...", hitchance);
888 if (roll(100) <= hitchance) {
889 mpr(bombown, "KABOOOM!! Missile destroyed\n\n");
891 "KABOOOM!! Incoming missile destroyed!\n\n");
894 mpr(bombown, "SWOOSH!! anti-missile system failed!!\n");
896 "SWOOSH!! Missile evades anti-missile systems\n\n");
899 return 0; /* all attempts failed */
903 /* Fire missiles at a ship which has fired shells */
905 shp_missdef(struct shpstr *sp, natid victim)
907 struct emp_qelem list;
914 mlp = malloc(sizeof(struct ulist));
915 mlp->chrp = (struct empobj_chr *)&mchr[(int)sp->shp_type];
916 mlp->unit.ship = *sp;
917 mlp->mobil = sp->shp_mobil;
918 emp_insque(&mlp->queue, &list);
919 sprintf(buf, "%s", prship(&mlp->unit.ship));
922 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
923 getship(sp->shp_uid, sp);
927 "missiles launched in defense did 100%% damage to %s\n",
929 wu(0, victim, "%s sunk!\n", buf);
930 } else if (eff > 0 && sp->shp_effic < eff) {
932 "missiles launched in defense did %d%% damage to %s\n",
933 100 * (eff - sp->shp_effic) / eff, buf);
940 shp_mobcost(struct shpstr *sp)
942 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
947 * Set SP's tech to TLEV along with everything else that depends on it.
950 shp_set_tech(struct shpstr *sp, int tlev)
952 struct mchrstr *mcp = mchr + sp->shp_type;
954 if (CANT_HAPPEN(tlev < mcp->m_tech))