2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2009, 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 *, struct mchrstr *);
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, ((struct mchrstr *)mlp->chrp));
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 shipdamage(&mlp->unit.ship, dam);
358 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
359 if (!mlp->unit.ship.shp_own) {
360 emp_remque((struct emp_qelem *)mlp);
366 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
367 int nowantflags, int x, int y)
369 struct emp_qelem *qp;
370 struct emp_qelem *next;
376 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
378 dam = ldround((double)totdam / count, 1);
379 for (qp = list->q_back; qp != list; qp = next) {
381 mlp = (struct ulist *)qp;
382 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
385 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
388 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
390 shp_damage_one(mlp, dam);
396 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
399 struct emp_qelem *qp;
400 struct emp_qelem *next;
403 for (qp = list->q_back; qp != list; qp = next) {
405 mlp = (struct ulist *)qp;
406 /* If the ship isn't in the requested sector, then continue */
407 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
410 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
413 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
420 static struct ulist *
421 most_valuable_ship(struct emp_qelem *list)
423 struct emp_qelem *qp;
424 struct emp_qelem *next;
426 struct ulist *mvs = 0;
428 for (qp = list->q_back; qp != list; qp = next) {
430 mlp = (struct ulist *)qp;
431 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
433 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
434 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
435 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
436 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
437 !((struct mchrstr *)mlp->chrp)->m_nland)
443 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
444 ((struct mchrstr *)mlp->chrp)->m_cost * mvs->unit.ship.shp_effic)
451 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
453 struct emp_qelem *qp;
454 struct emp_qelem *next;
457 int easiest = 9876; /* things start great for victim */
460 for (qp = list->q_back; qp != list; qp = next) {
462 mlp = (struct ulist *)qp;
464 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
467 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
469 hard = shp_hardtarget(&mlp->unit.ship);
471 easiest = hard; /* things get worse for victim */
474 return easiest - count;
478 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
484 struct emp_qelem msl_list, *qp, *newqp;
488 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
491 while (!QEMPTY(&msl_list) && (mvs = most_valuable_ship(list))) {
492 sprintf(what, "%s", prship(&mvs->unit.ship));
493 dam = msl_launch_mindam(&msl_list, newx, newy,
494 shp_hardtarget(&mvs->unit.ship),
495 EF_SHIP, 1, what, victim, MI_INTERDICT);
498 "missile interdiction mission does %d damage to %s!\n",
500 shp_damage_one(mvs, dam);
503 } else if (++twotries >= 2) {
507 qp = msl_list.q_forw;
508 while (qp != msl_list.q_forw) {
518 /* Note that this function has a side effect - it uses coastwatch
519 * ranges to see if it should fire upon a ship. So, this function
520 * is expected to return positive if a ship is in range, and 0 if a
521 * ship is not in range. */
523 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
525 struct emp_qelem *qp;
526 struct emp_qelem *next;
531 natp = getnatp(sectp->sct_own);
533 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
534 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
542 for (qp = list->q_back; qp != list; qp = next) {
544 mlp = (struct ulist *)qp;
545 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
547 if (natp->nat_flags & NF_COASTWATCH)
548 wu(0, sectp->sct_own,
549 "%s %s sighted at %s\n",
550 cname(mlp->unit.ship.shp_own),
551 prship(&mlp->unit.ship),
552 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
555 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
562 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
570 signed char notified[MAXNOC];
573 /* Inform neutral and worse */
574 for (i = 0; i < MAXNOC; ++i) {
575 if (getrel(getnatp(i), victim) <= NEUTRAL)
581 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
582 while (nxtsct(&ns, &fsect)) {
585 if (fsect.sct_own == victim)
587 if (notified[fsect.sct_own])
589 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
590 if (notify_coastguard(list, trange, &fsect))
591 notified[fsect.sct_own] = 1;
593 if (opt_NO_FORT_FIRE)
594 return 0; /* Only coastwatch notify in nofortfire */
595 /* Only fire at Hostile ships */
596 for (i = 0; i < MAXNOC; ++i) {
597 if (getrel(getnatp(i), victim) >= NEUTRAL)
600 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
601 while (nxtsct(&ns, &fsect)) {
602 if (!notified[fsect.sct_own])
604 range = roundrange(fortrange(&fsect));
605 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
608 dam = fort_fire(&fsect);
613 mpr(victim, "Incoming fire does %d damage!\n", dam);
615 mpr(victim, "%s fires at you for %d!\n",
616 xyas(fsect.sct_x,fsect.sct_y,victim),
620 "%s fires at %s ships in %s for %d!\n",
621 xyas(fsect.sct_x, fsect.sct_y,
623 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
624 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
627 return shp_damage(list, totdam, 0, M_SUB, newx, newy);
632 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
636 if (shp_contains(list, newx, newy, 0, M_SUB)) {
637 stopping |= shp_fort_interdiction(list, newx, newy, victim);
639 if (shp_contains(list, newx, newy, 0, M_SUB)) {
642 unit_interdict(newx, newy, victim, "ships",
643 shp_easiest_target(list, 0, M_SUB),
645 0, M_SUB, newx, newy);
646 if (most_valuable_ship(list)) {
648 shp_missile_interdiction(list, newx, newy, victim);
652 if (shp_contains(list, newx, newy, M_SUB, 0)) {
655 unit_interdict(newx, newy, victim, "subs",
656 shp_easiest_target(list, M_SUB, 0),
658 M_SUB, 0, newx, newy);
663 /* high value of hardtarget is harder to hit */
665 shp_hardtarget(struct shpstr *sp)
669 struct mchrstr *mcp = mchr + sp->shp_type;
672 getsect(sp->shp_x, sp->shp_y, §);
673 onsea = sect.sct_type == SCT_WATER;
674 if (mcp->m_flags & M_SUB)
676 return (int)((sp->shp_effic / 100.0) *
677 (20 + shp_speed(sp) * onsea / 2.0 - vis));
681 shp_hit_mine(struct shpstr *sp, struct mchrstr *mcp)
685 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
686 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
688 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
691 if (mcp->m_flags & M_SWEEP)
694 shipdamage(sp, ldround(m, 1));
700 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
704 struct emp_qelem *qp;
705 struct emp_qelem *next;
707 struct emp_qelem done;
714 double tech; /* for mapping */
715 double tf; /* for mapping */
719 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
720 unit_put(list, actor);
725 for (qp = list->q_back; qp != list; qp = next) {
727 mlp = (struct ulist *)qp;
728 newx = xnorm(mlp->unit.ship.shp_x + dx);
729 newy = ynorm(mlp->unit.ship.shp_y + dy);
730 getsect(newx, newy, §);
731 navigate = shp_check_nav(§, &mlp->unit.ship);
732 if (navigate != CN_NAVIGABLE ||
733 (sect.sct_own && actor != sect.sct_own &&
734 getrel(getnatp(sect.sct_own), actor) < FRIENDLY)) {
735 if (dchr[sect.sct_type].d_nav == NAV_CANAL &&
736 !(((struct mchrstr *)mlp->chrp)->m_flags & M_CANAL) &&
737 navigate == CN_LANDLOCKED)
739 "is too large to fit into the canal system at %s",
740 xyas(newx, newy, actor));
742 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
744 mpr(actor, "%s\n", dp);
752 if (mlp->mobil <= 0.0) {
753 shp_mess("is out of mobility", mlp);
756 mobcost = shp_mobcost(&mlp->unit.ship);
757 mlp->unit.ship.shp_x = newx;
758 mlp->unit.ship.shp_y = newy;
759 if (mlp->mobil - mobcost < -127) {
762 mlp->mobil -= mobcost;
764 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
765 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
767 /* Now update the map for this ship */
768 tech = techfact(mlp->unit.ship.shp_tech,
769 ((struct mchrstr *)mlp->chrp)->m_vrnge);
770 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SONAR)
771 tf = techfact(mlp->unit.ship.shp_tech, 1.0);
774 radmapupd(mlp->unit.ship.shp_own,
775 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
776 (int)mlp->unit.ship.shp_effic, (int)tech, tf);
780 stopping |= shp_sweep(list, 0, 0, actor);
783 stopping |= shp_check_mines(list);
787 /* interdict ships sector by sector */
789 while (!QEMPTY(list)) {
790 mlp = (struct ulist *)list->q_back;
791 newx = mlp->unit.ship.shp_x;
792 newy = mlp->unit.ship.shp_y;
793 stopping |= shp_interdict(list, newx, newy, actor);
794 /* move survivors in this sector to done */
795 for (qp = list->q_back; qp != list; qp = next) {
797 mlp = (struct ulist *)qp;
798 if (mlp->unit.ship.shp_x == newx &&
799 mlp->unit.ship.shp_y == newy) {
801 emp_insque(qp, &done);
805 /* assign surviving ships back to list */
806 emp_insque(list, &done);
814 * Check for incoming missiles with a P_MAR flag.
815 * Return True=1 if the missile was shotdown.
818 * Chad Zabel, July 95
822 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
827 double gun, eff, teff;
829 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
831 while (nxtitem(&ni, &ship)) {
835 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
838 if (getrel(getnatp(ship.shp_own), bombown) >= NEUTRAL)
841 if (ship.shp_effic < 60)
844 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
846 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
848 if (!shp_supply(&ship, I_SHELL, 2))
850 ship.shp_item[I_SHELL] -= 2;
851 putship(ship.shp_uid, &ship);
853 /* now calculate the odds */
854 gun = shp_usable_guns(&ship);
855 eff = ship.shp_effic / 100.0;
856 teff = ship.shp_tech / (ship.shp_tech + 200.0);
857 /* raise 4.5 for better interception -KHS */
858 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
864 mpr(bombown, "%s anti-missile system activated...",
865 cname(ship.shp_own));
866 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
868 mpr(ship.shp_own, "%d%% hitchance...", hitchance);
870 if (roll(100) <= hitchance) {
871 mpr(bombown, "KABOOOM!! Missile destroyed\n\n");
873 "KABOOOM!! Incoming missile destroyed!\n\n");
876 mpr(bombown, "SWOOSH!! anti-missile system failed!!\n");
878 "SWOOSH!! Missile evades anti-missile systems\n\n");
881 return 0; /* all attempts failed */
885 /* Fire missiles at a ship which has fired shells */
887 shp_missdef(struct shpstr *sp, natid victim)
889 struct emp_qelem list;
896 mlp = malloc(sizeof(struct ulist));
897 mlp->chrp = (struct empobj_chr *)&mchr[(int)sp->shp_type];
898 mlp->unit.ship = *sp;
899 mlp->mobil = sp->shp_mobil;
900 emp_insque(&mlp->queue, &list);
901 sprintf(buf, "%s", prship(&mlp->unit.ship));
904 if (most_valuable_ship(&list)) {
905 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
906 getship(sp->shp_uid, sp);
910 "missiles launched in defense did 100%% damage to %s\n",
912 wu(0, victim, "%s sunk!\n", buf);
913 } else if (eff > 0 && sp->shp_effic < eff) {
915 "missiles launched in defense did %d%% damage to %s\n",
916 100 * (eff - sp->shp_effic) / eff, buf);
924 shp_mobcost(struct shpstr *sp)
926 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
931 * Set SP's tech to TLEV along with everything else that depends on it.
934 shp_set_tech(struct shpstr *sp, int tlev)
936 struct mchrstr *mcp = mchr + sp->shp_type;
938 if (CANT_HAPPEN(tlev < mcp->m_tech))