2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2011, 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-2010
49 #include "prototypes.h"
55 static int shp_check_one_mines(struct ulist *);
56 static int shp_hit_mine(struct shpstr *);
57 static void shp_stays(natid, char *, struct ulist *);
60 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 != player->cnum)
75 mcp = &mchr[(int)ship.shp_type];
77 if (ontradingblock(EF_SHIP, &ship)) {
78 pr("ship #%d inelligible - it's for sale.\n",
85 memset(ship.shp_rpath, 0, sizeof(ship.shp_rpath));
86 putship(ship.shp_uid, &ship);
87 mlp = malloc(sizeof(struct ulist));
88 mlp->chrp = (struct empobj_chr *)mcp;
89 mlp->unit.ship = ship;
90 mlp->mobil = ship.shp_mobil;
91 emp_insque(&mlp->queue, list);
95 /* This function assumes that the list was created by shp_sel */
97 shp_nav(struct emp_qelem *list, double *minmobp, double *maxmobp,
98 int *togetherp, natid actor)
100 struct emp_qelem *qp;
101 struct emp_qelem *next;
112 for (qp = list->q_back; qp != list; qp = next) {
114 mlp = (struct ulist *)qp;
115 getship(mlp->unit.ship.shp_uid, &ship);
116 if (ship.shp_own != actor) {
117 mpr(actor, "%s was sunk at %s\n",
118 prship(&ship), xyas(ship.shp_x, ship.shp_y, actor));
119 emp_remque((struct emp_qelem *)mlp);
124 if (*ship.shp_path && !update_running) {
125 shp_stays(actor, "has a sail path", mlp);
126 mpr(actor, "Use `sail <#> -' to reset\n");
130 /* check crew - uws don't count */
131 if (ship.shp_item[I_MILIT] == 0 && ship.shp_item[I_CIVIL] == 0) {
132 shp_stays(actor, "is crewless", mlp);
135 if (!getsect(ship.shp_x, ship.shp_y, §)) {
136 shp_stays(actor, "was sucked into the sky by a strange looking spaceship", mlp); /* heh -KHS */
139 switch (shp_check_nav(§, &ship)) {
140 case CN_CONSTRUCTION:
141 shp_stays(actor, "is caught in a construction zone", mlp);
144 shp_stays(actor, "is landlocked", mlp);
150 shp_stays(actor, "was just swallowed by a big green worm", mlp);
158 if (ship.shp_x != allx || ship.shp_y != ally)
160 if (ship.shp_mobil + 1 < (int)mlp->mobil) {
161 mlp->mobil = ship.shp_mobil;
163 if (mlp->mobil < *minmobp)
164 *minmobp = mlp->mobil;
165 if (mlp->mobil > *maxmobp)
166 *maxmobp = mlp->mobil;
167 mlp->unit.ship = ship;
172 shp_sweep(struct emp_qelem *ship_list, int verbose, int takemob, natid actor)
174 struct emp_qelem *qp;
175 struct emp_qelem *next;
178 int mines, m, max, shells;
182 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
184 mlp = (struct ulist *)qp;
185 if (!(((struct mchrstr *)mlp->chrp)->m_flags & M_SWEEP)) {
187 mpr(actor, "%s doesn't have minesweeping capability!\n",
188 prship(&mlp->unit.ship));
191 if (takemob && mlp->mobil <= 0.0) {
193 mpr(actor, "%s is out of mobility!\n",
194 prship(&mlp->unit.ship));
197 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
198 if (sect.sct_type != SCT_WATER) {
200 mpr(actor, "%s is not at sea. No mines there!\n",
201 prship(&mlp->unit.ship));
205 mlp->mobil -= shp_mobcost(&mlp->unit.ship);
206 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
208 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
209 if (!(mines = sect.sct_mines))
211 max = ((struct mchrstr *)mlp->chrp)->m_item[I_SHELL];
212 shells = mlp->unit.ship.shp_item[I_SHELL];
213 for (m = 0; mines > 0 && m < 5; m++) {
215 mpr(actor, "Sweep...\n");
217 shells = MIN(max, shells + 1);
218 changed |= map_set(actor, sect.sct_x, sect.sct_y, 'X', 0);
221 sect.sct_mines = mines;
222 mlp->unit.ship.shp_item[I_SHELL] = shells;
223 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
225 if (shp_check_one_mines(mlp)) {
237 shp_check_one_mines(struct ulist *mlp)
242 getsect(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, §);
243 if (sect.sct_type != SCT_WATER)
247 if (chance(DMINE_HITCHANCE(sect.sct_mines))) {
248 actor = mlp->unit.ship.shp_own;
249 shp_hit_mine(&mlp->unit.ship);
251 if (map_set(actor, sect.sct_x, sect.sct_y, 'X', 0))
254 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
255 if (!mlp->unit.ship.shp_own)
262 shp_check_mines(struct emp_qelem *ship_list)
264 struct emp_qelem *qp;
265 struct emp_qelem *next;
269 for (qp = ship_list->q_back; qp != ship_list; qp = next) {
271 mlp = (struct ulist *)qp;
272 if (shp_check_one_mines(mlp)) {
283 shp_stays(natid actor, char *str, struct ulist *mlp)
285 mpr(actor, "%s %s & stays in %s\n",
286 prship(&mlp->unit.ship), str,
287 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y, actor));
288 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
289 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
290 emp_remque((struct emp_qelem *)mlp);
295 shp_check_nav(struct sctstr *sect, struct shpstr *shp)
297 switch (dchr[sect->sct_type].d_nav) {
301 if (mchr[(int)shp->shp_type].m_flags & M_CANAL) {
302 if (sect->sct_effic < 2)
303 return CN_CONSTRUCTION;
305 return CN_LANDLOCKED;
308 if (sect->sct_effic < 2)
309 return CN_CONSTRUCTION;
312 if (sect->sct_effic < 60)
313 return CN_CONSTRUCTION;
316 return CN_LANDLOCKED;
322 sect_has_dock(struct sctstr *sect)
324 switch (dchr[sect->sct_type].d_nav) {
334 shp_count(struct emp_qelem *list, int wantflags, int nowantflags,
337 struct emp_qelem *qp;
338 struct emp_qelem *next;
342 for (qp = list->q_back; qp != list; qp = next) {
344 mlp = (struct ulist *)qp;
345 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
348 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
351 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
359 shp_damage_one(struct ulist *mlp, int dam)
361 /* ship might have changed (launched interceptors, missile defense) */
362 getship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
363 shipdamage(&mlp->unit.ship, dam);
364 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
365 if (!mlp->unit.ship.shp_own) {
366 emp_remque((struct emp_qelem *)mlp);
372 shp_damage(struct emp_qelem *list, int totdam, int wantflags,
373 int nowantflags, int x, int y)
375 struct emp_qelem *qp;
376 struct emp_qelem *next;
382 || !(count = shp_count(list, wantflags, nowantflags, x, y)))
384 dam = ldround((double)totdam / count, 1);
385 for (qp = list->q_back; qp != list; qp = next) {
387 mlp = (struct ulist *)qp;
388 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
391 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
394 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
396 shp_damage_one(mlp, dam);
402 shp_contains(struct emp_qelem *list, int newx, int newy, int wantflags,
405 struct emp_qelem *qp;
406 struct emp_qelem *next;
409 for (qp = list->q_back; qp != list; qp = next) {
411 mlp = (struct ulist *)qp;
412 /* If the ship isn't in the requested sector, then continue */
413 if (newx != mlp->unit.ship.shp_x || newy != mlp->unit.ship.shp_y)
416 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
419 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
426 static struct ulist *
427 most_valuable_ship(struct emp_qelem *list, coord x, coord y)
429 struct emp_qelem *qp;
430 struct emp_qelem *next;
432 struct ulist *mvs = NULL;
434 for (qp = list->q_back; qp != list; qp = next) {
436 mlp = (struct ulist *)qp;
437 if (mlp->unit.ship.shp_x != x || mlp->unit.ship.shp_y != y)
439 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
441 if (!((struct mchrstr *)mlp->chrp)->m_nxlight &&
442 !((struct mchrstr *)mlp->chrp)->m_nchoppers &&
443 ((struct mchrstr *)mlp->chrp)->m_cost < 1000 &&
444 !((struct mchrstr *)mlp->chrp)->m_nplanes &&
445 !((struct mchrstr *)mlp->chrp)->m_nland)
451 if (((struct mchrstr *)mlp->chrp)->m_cost * mlp->unit.ship.shp_effic >
452 ((struct mchrstr *)mlp->chrp)->m_cost * mvs->unit.ship.shp_effic)
459 shp_easiest_target(struct emp_qelem *list, int wantflags, int nowantflags)
461 struct emp_qelem *qp;
462 struct emp_qelem *next;
465 int easiest = 9876; /* things start great for victim */
468 for (qp = list->q_back; qp != list; qp = next) {
470 mlp = (struct ulist *)qp;
472 (((struct mchrstr *)mlp->chrp)->m_flags & wantflags) != wantflags)
475 ((struct mchrstr *)mlp->chrp)->m_flags & nowantflags)
477 hard = shp_hardtarget(&mlp->unit.ship);
479 easiest = hard; /* things get worse for victim */
482 return easiest - count;
486 shp_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
491 struct emp_qelem msl_list, *qp, *newqp;
495 mvs = most_valuable_ship(list, newx, newy);
499 msl_sel(&msl_list, newx, newy, victim, P_T | P_MAR, 0, MI_INTERDICT);
501 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
503 plp = (struct plist *)qp;
505 if (mvs && mission_pln_equip(plp, NULL, 'p') >= 0) {
506 if (msl_launch(&plp->plane, EF_SHIP, prship(&mvs->unit.ship),
507 newx, newy, victim, &sublaunch) < 0)
510 if (msl_hit(&plp->plane,
511 shp_hardtarget(&mvs->unit.ship), EF_SHIP,
512 N_SHP_MISS, N_SHP_SMISS, sublaunch, victim)) {
513 dam = pln_damage(&plp->plane, 'p', 1);
515 "missile interdiction mission does %d damage to %s!\n",
516 dam, prship(&mvs->unit.ship));
517 shp_damage_one(mvs, dam);
519 dam = pln_damage(&plp->plane, 'p', 0);
520 collateral_damage(newx, newy, dam);
522 mvs = most_valuable_ship(list, newx, newy);
524 plp->plane.pln_effic = 0;
525 putplane(plp->plane.pln_uid, &plp->plane);
534 /* Note that this function has a side effect - it uses coastwatch
535 * ranges to see if it should fire upon a ship. So, this function
536 * is expected to return positive if a ship is in range, and 0 if a
537 * ship is not in range. */
539 notify_coastguard(struct emp_qelem *list, int trange, struct sctstr *sectp)
541 struct emp_qelem *qp;
542 struct emp_qelem *next;
547 natp = getnatp(sectp->sct_own);
549 vrange = sectp->sct_type == SCT_RADAR ? 14 : 4;
550 vrange *= tfact(sectp->sct_own, 1.0) * sectp->sct_effic / 100.0;
558 for (qp = list->q_back; qp != list; qp = next) {
560 mlp = (struct ulist *)qp;
561 if (((struct mchrstr *)mlp->chrp)->m_flags & M_SUB)
563 if (natp->nat_flags & NF_COASTWATCH)
564 wu(0, sectp->sct_own,
565 "%s %s sighted at %s\n",
566 cname(mlp->unit.ship.shp_own),
567 prship(&mlp->unit.ship),
568 xyas(mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
571 setcont(sectp->sct_own, mlp->unit.ship.shp_own, FOUND_COAST);
578 shp_fort_interdiction(struct emp_qelem *list, coord newx, coord newy,
587 signed char notified[MAXNOC];
590 /* Inform neutral and worse */
591 for (i = 0; i < MAXNOC; ++i) {
592 if (relations_with(i, victim) <= NEUTRAL)
598 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
599 while (nxtsct(&ns, &fsect)) {
602 if (fsect.sct_own == victim)
604 if (notified[fsect.sct_own])
606 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
607 if (notify_coastguard(list, trange, &fsect))
608 notified[fsect.sct_own] = 1;
610 if (opt_NO_FORT_FIRE)
611 return 0; /* Only coastwatch notify in nofortfire */
612 /* Only fire at Hostile ships */
613 for (i = 0; i < MAXNOC; ++i) {
614 if (relations_with(i, victim) >= NEUTRAL)
617 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
618 while (nxtsct(&ns, &fsect)) {
619 if (!notified[fsect.sct_own])
621 range = roundrange(fortrange(&fsect));
622 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
625 dam = fort_fire(&fsect);
631 mpr(victim, "Incoming fire does %d damage!\n", dam);
633 mpr(victim, "%s fires at you for %d!\n",
634 xyas(fsect.sct_x, fsect.sct_y, victim), dam);
637 "%s fires at %s ships in %s for %d!\n",
638 xyas(fsect.sct_x, fsect.sct_y,
640 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
641 nreport(fsect.sct_own, N_SHP_SHELL, victim, 1);
644 shp_damage(list, totdam, 0, M_SUB, newx, newy);
649 shp_mission_interdiction(struct emp_qelem *list, coord x, coord y,
650 natid victim, int subs)
652 char *what = subs ? "subs" : "ships";
653 int wantflags = subs ? M_SUB : 0;
654 int nowantflags = subs ? 0 : M_SUB;
655 int mission = subs ? MI_SINTERDICT : MI_INTERDICT;
658 dam = unit_interdict(x, y, victim, what,
659 shp_easiest_target(list, wantflags, nowantflags),
662 shp_damage(list, dam, wantflags, nowantflags, x, y);
667 shp_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
671 if (shp_contains(list, newx, newy, 0, M_SUB)) {
672 stopping |= shp_fort_interdiction(list, newx, newy, victim);
674 if (shp_contains(list, newx, newy, 0, M_SUB)) {
675 stopping |= shp_mission_interdiction(list, newx, newy, victim, 0);
676 stopping |= shp_missile_interdiction(list, newx, newy, victim);
679 if (shp_contains(list, newx, newy, M_SUB, 0))
680 stopping |= shp_mission_interdiction(list, newx, newy, victim, 1);
684 /* high value of hardtarget is harder to hit */
686 shp_hardtarget(struct shpstr *sp)
690 struct mchrstr *mcp = mchr + sp->shp_type;
693 getsect(sp->shp_x, sp->shp_y, §);
694 onsea = sect.sct_type == SCT_WATER;
695 if (mcp->m_flags & M_SUB)
697 return (int)((sp->shp_effic / 100.0) *
698 (20 + shp_speed(sp) * onsea / 2.0 - vis));
702 shp_hit_mine(struct shpstr *sp)
706 mpr(sp->shp_own, "Kawhomp! Mine detected in %s!\n",
707 xyas(sp->shp_x, sp->shp_y, sp->shp_own));
709 nreport(sp->shp_own, N_HIT_MINE, 0, 1);
712 if (mchr[sp->shp_type].m_flags & M_SWEEP)
715 shipdamage(sp, ldround(m, 1));
721 shp_nav_one_sector(struct emp_qelem *list, int dir, natid actor,
725 struct emp_qelem *qp;
726 struct emp_qelem *next;
728 struct emp_qelem done;
738 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
739 unit_put(list, actor);
744 for (qp = list->q_back; qp != list; qp = next) {
746 mlp = (struct ulist *)qp;
747 newx = xnorm(mlp->unit.ship.shp_x + dx);
748 newy = ynorm(mlp->unit.ship.shp_y + dy);
749 getsect(newx, newy, §);
750 navigate = shp_check_nav(§, &mlp->unit.ship);
751 if (navigate != CN_NAVIGABLE ||
753 && relations_with(sect.sct_own, actor) < FRIENDLY)) {
754 if (dchr[sect.sct_type].d_nav == NAV_CANAL &&
755 !(((struct mchrstr *)mlp->chrp)->m_flags & M_CANAL) &&
756 navigate == CN_LANDLOCKED)
758 "is too large to fit into the canal system at %s",
759 xyas(newx, newy, actor));
761 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
763 mpr(actor, "%s\n", dp);
766 shp_stays(actor, dp, mlp);
771 if (mlp->mobil <= 0.0) {
772 shp_stays(actor, "is out of mobility", mlp);
775 mobcost = shp_mobcost(&mlp->unit.ship);
776 mlp->unit.ship.shp_x = newx;
777 mlp->unit.ship.shp_y = newy;
778 if (mlp->mobil - mobcost < -127) {
781 mlp->mobil -= mobcost;
783 mlp->unit.ship.shp_mobil = (int)mlp->mobil;
784 putship(mlp->unit.ship.shp_uid, &mlp->unit.ship);
786 /* Now update the map for this ship */
787 rad_map_set(mlp->unit.ship.shp_own,
788 mlp->unit.ship.shp_x, mlp->unit.ship.shp_y,
789 mlp->unit.ship.shp_effic, mlp->unit.ship.shp_tech,
790 ((struct mchrstr *)mlp->chrp)->m_vrnge);
794 stopping |= shp_sweep(list, 0, 0, actor);
797 stopping |= shp_check_mines(list);
801 /* interdict ships sector by sector */
803 while (!QEMPTY(list)) {
804 mlp = (struct ulist *)list->q_back;
805 newx = mlp->unit.ship.shp_x;
806 newy = mlp->unit.ship.shp_y;
807 stopping |= shp_interdict(list, newx, newy, actor);
808 /* move survivors in this sector to done */
809 for (qp = list->q_back; qp != list; qp = next) {
811 mlp = (struct ulist *)qp;
812 if (mlp->unit.ship.shp_x == newx &&
813 mlp->unit.ship.shp_y == newy) {
815 emp_insque(qp, &done);
819 /* assign surviving ships back to list */
820 emp_insque(list, &done);
828 * Check for incoming missiles with a P_MAR flag.
829 * Return True=1 if the missile was shotdown.
832 * Chad Zabel, July 95
836 shp_missile_defense(coord dx, coord dy, natid bombown, int hardtarget)
841 double gun, eff, teff;
843 snxtitem_dist(&ni, EF_SHIP, dx, dy, 1);
845 while (nxtitem(&ni, &ship)) {
849 if (!(mchr[(int)ship.shp_type].m_flags & M_ANTIMISSILE))
852 if (relations_with(ship.shp_own, bombown) >= NEUTRAL)
855 if (ship.shp_effic < 60)
858 if (ship.shp_item[I_MILIT] < 1) /* do we have mil? */
860 if (ship.shp_item[I_GUN] < 1) /* we need at least 1 gun */
862 if (!shp_supply(&ship, I_SHELL, 2))
864 ship.shp_item[I_SHELL] -= 2;
865 putship(ship.shp_uid, &ship);
867 /* now calculate the odds */
868 gun = shp_usable_guns(&ship);
869 eff = ship.shp_effic / 100.0;
870 teff = ship.shp_tech / (ship.shp_tech + 200.0);
871 /* raise 4.5 for better interception -KHS */
872 hitchance = (int)(gun * eff * teff * 4.5) - hardtarget;
877 hit = roll(100) <= hitchance;
879 mpr(bombown, "%s anti-missile system activated...%s\n",
881 hit ? "KABOOOM!! Missile destroyed\n"
882 : "SWOOSH!! anti-missile system failed!!");
883 mpr(ship.shp_own, "Ship #%i anti-missile system activated!\n",
885 mpr(ship.shp_own, "%d%% hitchance...%s\n", hitchance,
886 hit ? "KABOOOM!! Incoming missile destroyed!\n"
887 : "SWOOSH!! Missile evades anti-missile systems\n");
892 return 0; /* all attempts failed */
896 /* Fire missiles at a ship which has fired shells */
898 shp_missdef(struct shpstr *sp, natid victim)
900 struct emp_qelem list;
907 mlp = malloc(sizeof(struct ulist));
908 mlp->chrp = (struct empobj_chr *)&mchr[(int)sp->shp_type];
909 mlp->unit.ship = *sp;
910 mlp->mobil = sp->shp_mobil;
911 emp_insque(&mlp->queue, &list);
912 sprintf(buf, "%s", prship(&mlp->unit.ship));
915 shp_missile_interdiction(&list, sp->shp_x, sp->shp_y, sp->shp_own);
916 getship(sp->shp_uid, sp);
920 "missiles launched in defense did 100%% damage to %s\n",
922 wu(0, victim, "%s sunk!\n", buf);
923 } else if (eff > 0 && sp->shp_effic < eff) {
925 "missiles launched in defense did %d%% damage to %s\n",
926 100 * (eff - sp->shp_effic) / eff, buf);
933 shp_mobcost(struct shpstr *sp)
935 return speed_factor(sp->shp_effic * 0.01 * shp_speed(sp),
940 * Set SP's tech to TLEV along with everything else that depends on it.
943 shp_set_tech(struct shpstr *sp, int tlev)
945 struct mchrstr *mcp = mchr + sp->shp_type;
947 if (CANT_HAPPEN(tlev < mcp->m_tech))