2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2016, 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 * lndsub.c: Land unit subroutines
29 * Known contributors to this file:
31 * Steve McClure, 1998-2000
32 * Markus Armbruster, 2004-2015
51 #include "prototypes.h"
55 static void lnd_mar_put_one(struct ulist *);
56 static int lnd_check_one_mines(struct ulist *, int);
57 static int lnd_hit_mine(struct lndstr *);
58 static int has_helpful_engineer(coord, coord, natid);
61 lnd_find_capable(struct emp_qelem *list, int flags)
66 for (qp = list->q_back; qp != list; qp = qp->q_back) {
67 llp = (struct ulist *)qp;
68 if (lchr[llp->unit.land.lnd_type].l_flags & flags)
75 attack_val(int combat_mode, struct lndstr *lp)
81 if (lp->lnd_effic < LAND_MINEFF) {
82 putland(lp->lnd_uid, lp);
86 lcp = &lchr[(int)lp->lnd_type];
88 /* Spies always count as 1 during assaults. If they are the only ones
89 in the assault, they get to sneak on anyway. */
91 if (lcp->l_flags & L_SPY && combat_mode == A_ASSAULT)
94 men = lp->lnd_item[I_MILIT];
95 value = men * lnd_att(lp) * lp->lnd_effic / 100.0;
97 switch (combat_mode) {
101 if (!(lcp->l_flags & L_MARINE))
102 return assault_penalty * value;
105 if (!(lcp->l_flags & L_MARINE))
106 return assault_penalty * men;
113 defense_val(struct lndstr *lp)
119 if (lp->lnd_effic < LAND_MINEFF) {
120 putland(lp->lnd_uid, lp);
124 lcp = &lchr[(int)lp->lnd_type];
126 men = lp->lnd_item[I_MILIT];
128 if ((lp->lnd_ship >= 0 || lp->lnd_land >= 0) &&
129 !(lcp->l_flags & L_MARINE))
132 value = men * lnd_def(lp) * lp->lnd_effic / 100.0;
133 value *= ((double)land_mob_max + lp->lnd_harden) / land_mob_max;
135 /* If there are military on the unit, you get at least a 1
136 man defensive unit, except for spies */
137 if (value < 1.0 && men > 0 && !(lcp->l_flags & L_SPY))
144 lnd_reaction_range(struct lndstr *lp)
148 getsect(lp->lnd_x, lp->lnd_y, §);
149 if (sect.sct_type == SCT_HEADQ && sect.sct_effic >= 60)
150 return lchr[lp->lnd_type].l_rad + 1;
151 return lchr[lp->lnd_type].l_rad;
155 lnd_print(natid actor, struct ulist *llp, char *s)
157 if (actor == player->cnum)
158 pr("%s %s\n", prland(&llp->unit.land), s);
160 wu(0, actor, "%s %s\n", prland(&llp->unit.land), s);
164 lnd_take_casualty(int combat_mode, struct ulist *llp, int cas)
165 /* attacking or assaulting or paratrooping? */
166 /* number of casualties to take */
178 int nowhere_to_go = 0;
179 double mobcost, bmcost;
183 taken = llp->unit.land.lnd_item[I_MILIT];
184 /* Spies always die */
185 if (lchr[llp->unit.land.lnd_type].l_flags & L_SPY)
186 llp->unit.land.lnd_effic = 0;
188 eff_eq = ldround(cas * 100.0 /
189 lchr[llp->unit.land.lnd_type].l_item[I_MILIT], 1);
190 llp->unit.land.lnd_effic -= eff_eq;
191 lnd_submil(&llp->unit.land, cas);
194 if (llp->unit.land.lnd_effic < LAND_MINEFF) {
195 sprintf(buf, "dies %s %s!",
196 combat_mode ? att_mode[combat_mode] : "defending",
197 xyas(llp->unit.land.lnd_x, llp->unit.land.lnd_y,
198 llp->unit.land.lnd_own));
199 lnd_print(llp->unit.land.lnd_own, llp, buf);
201 /* Since we killed the unit, we killed all the mil on it */
204 /* Ok, now, how many did we take off? (sould be the diff) */
205 taken = taken - llp->unit.land.lnd_item[I_MILIT];
208 if (llp->unit.land.lnd_effic >= llp->unit.land.lnd_retreat)
211 /* we're being boarded */
212 if (llp->unit.land.lnd_ship >= 0 && combat_mode == A_DEFEND)
215 /* we're being boarded */
216 if (llp->unit.land.lnd_land >= 0 && combat_mode == A_DEFEND)
219 /* Have to make a retreat check */
221 ret_chance = llp->unit.land.lnd_retreat - llp->unit.land.lnd_effic;
222 if (pct_chance(ret_chance)) {
224 lnd_print(llp->unit.land.lnd_own, llp, "fails morale check!");
225 llp->unit.land.lnd_mission = 0;
226 llp->unit.land.lnd_harden = 0;
227 if (llp->unit.land.lnd_ship >= 0 || llp->unit.land.lnd_land >= 0)
229 else if (combat_mode == A_DEFEND) {
231 * defending unit.. find a place to send it
232 * strategy: look for the most-populated
233 * adjacent sector that is owned by the unit
234 * owner. Charge mob..
237 for (n = 1; n <= 6; ++n) {
238 ret_x = llp->unit.land.lnd_x + diroff[n][0];
239 ret_y = llp->unit.land.lnd_y + diroff[n][1];
240 getsect(ret_x, ret_y, §);
241 if (sect.sct_own != llp->unit.land.lnd_own)
243 if (sect.sct_type == SCT_MOUNT)
245 mobcost = lnd_mobcost(&llp->unit.land, §);
248 civs = sect.sct_item[I_CIVIL];
249 if (civs > biggest) {
259 /* retreat to bx,by */
260 llp->unit.land.lnd_x = bx;
261 llp->unit.land.lnd_y = by;
262 /* FIXME landmines */
263 mob = llp->unit.land.lnd_mobil - (int)bmcost;
266 orig = llp->unit.land.lnd_mobil;
267 llp->unit.land.lnd_mobil = (signed char)mob;
268 if (llp->unit.land.lnd_mobil > orig)
269 llp->unit.land.lnd_mobil = -127;
270 sprintf(buf, "retreats at %d%% efficiency to %s!",
271 llp->unit.land.lnd_effic,
272 xyas(bx, by, llp->unit.land.lnd_own));
273 lnd_print(llp->unit.land.lnd_own, llp, buf);
276 } else { /* attacking from a sector */
277 sprintf(buf, "leaves the battlefield at %d%% efficiency",
278 llp->unit.land.lnd_effic);
279 if ((llp->unit.land.lnd_mobil - (int)llp->mobil) < -127)
280 llp->unit.land.lnd_mobil = -127;
282 llp->unit.land.lnd_mobil -= (int)llp->mobil;
284 lnd_print(llp->unit.land.lnd_own, llp, buf);
289 /* nowhere to go.. take more casualties */
290 llp->unit.land.lnd_effic -= 10;
291 lnd_submil(&llp->unit.land,
292 lchr[llp->unit.land.lnd_type].l_item[I_MILIT] / 10);
293 if (llp->unit.land.lnd_effic < LAND_MINEFF) {
294 lnd_print(llp->unit.land.lnd_own, llp,
295 "has nowhere to retreat, and dies!");
298 lnd_print(llp->unit.land.lnd_own, llp,
299 "has nowhere to retreat and takes extra losses!");
306 lnd_takemob(struct emp_qelem *list, double loss)
308 struct emp_qelem *qp, *next;
311 int mcost = ldround(combat_mob * loss, 1);
313 for (qp = list->q_forw; qp != list; qp = next) {
315 llp = (struct ulist *)qp;
318 use_supply(&llp->unit.land);
320 new = llp->unit.land.lnd_mobil - mcost;
323 llp->unit.land.lnd_mobil = (signed char)new;
328 lnd_submil(struct lndstr *lp, int num)
330 int new = lp->lnd_item[I_MILIT] - num;
331 lp->lnd_item[I_MILIT] = new < 0 ? 0 : new;
335 lnd_spyval(struct lndstr *lp)
337 if (lchr[(int)lp->lnd_type].l_flags & L_RECON)
338 return lchr[lp->lnd_type].l_spy * (lp->lnd_effic / 100.0) + 2;
340 return lchr[lp->lnd_type].l_spy * (lp->lnd_effic / 100.0);
344 intelligence_report(natid destination, struct lndstr *lp, int spy,
347 int vis = lnd_vis(lp);
348 char buf1[80], buf2[80], buf3[80];
350 if (!destination || !lp->lnd_own)
353 if (chance((spy + vis) / 10.0)) {
354 sprintf(buf1, "%s %s", mess, prland(lp));
356 if (chance((spy + vis) / 20.0)) {
357 sprintf(buf2, " (eff %d, mil %d",
358 roundintby(lp->lnd_effic, 5),
359 roundintby(lp->lnd_item[I_MILIT], 10));
361 if (chance((spy + vis) / 20.0)) {
363 t = lp->lnd_tech - 20 + roll(40);
365 sprintf(buf3, ", tech %d)", t);
370 buf2[0] = buf3[0] = 0;
372 if (destination == player->cnum)
373 pr("%s%s%s", buf1, buf2, buf3);
375 wu(0, destination, "%s%s%s\n", buf1, buf2, buf3);
380 lnd_may_mar(struct lndstr *lp, struct lndstr *ldr, char *suffix)
385 if (!lp->lnd_own || !getsect(lp->lnd_x, lp->lnd_y, §)) {
390 if (opt_MARKET && ontradingblock(EF_LAND, lp)) {
391 mpr(lp->lnd_own, "%s is on the trading block%s\n",
396 if (lp->lnd_ship >= 0) {
397 mpr(lp->lnd_own, "%s is on a ship%s\n", prland(lp), suffix);
400 if (lp->lnd_land >= 0) {
401 mpr(lp->lnd_own, "%s is on a unit%s\n", prland(lp), suffix);
405 if (!(lchr[lp->lnd_type].l_flags & L_SPY) &&
406 !(lchr[lp->lnd_type].l_flags & L_TRAIN) &&
407 lp->lnd_item[I_MILIT] == 0) {
408 mpr(lp->lnd_own, "%s has no mil on it to guide it%s\n",
413 switch (lnd_check_mar(lp, §)) {
416 case LND_STUCK_NO_RAIL:
417 mpr(lp->lnd_own, "%s is stuck off the rail system%s\n",
423 case LND_STUCK_IMPASSABLE:
424 mpr(lp->lnd_own, "%s is stuck%s\n", prland(lp), suffix);
428 if (relations_with(sect.sct_own, lp->lnd_own) != ALLIED &&
429 !(lchr[lp->lnd_type].l_flags & L_SPY) &&
431 mpr(lp->lnd_own, "%s has been kidnapped by %s%s\n",
432 prland(lp), cname(sect.sct_own), suffix);
436 if (ldr && (lp->lnd_x != ldr->lnd_x || lp->lnd_y != ldr->lnd_y)) {
437 mpr(lp->lnd_own, "%s is not with the leader%s\n",
443 * The marching code gets confused when trains and non-trains
444 * march together. Disallow for now.
446 mobtype = lnd_mobtype(lp);
447 if (!ldr || mobtype == lnd_mobtype(ldr))
449 else if (mobtype == MOB_RAIL) {
451 "%s is a train and can't march with the leader%s\n",
455 mpr(lp->lnd_own, "%s can't rail-march with the leading train%s\n",
464 lnd_sel(struct nstr_item *ni, struct emp_qelem *list)
466 struct lndstr land, *ldr = NULL;
470 while (nxtitem(ni, &land)) {
472 * It would be nice to let deities march foreign land units,
473 * but much of the code assumes that only the land unit's
474 * owner can march it.
476 if (!land.lnd_own || land.lnd_own != player->cnum)
478 if (!lnd_may_mar(&land, ldr, ""))
481 land.lnd_mission = 0;
483 memset(land.lnd_rpath, 0, sizeof(land.lnd_rpath));
484 putland(land.lnd_uid, &land);
485 llp = lnd_insque(&land, list);
487 ldr = &llp->unit.land;
492 * Append @lp to @list.
493 * Return the new list link.
496 lnd_insque(struct lndstr *lp, struct emp_qelem *list)
498 struct ulist *mlp = malloc(sizeof(struct ulist));
500 mlp->unit.land = *lp;
501 mlp->mobil = lp->lnd_mobil;
502 emp_insque(&mlp->queue, list);
507 lnd_mar_stay_behind(struct emp_qelem *list, natid actor)
509 struct emp_qelem *qp;
510 struct emp_qelem *next;
512 struct lndstr *lp, *ldr = NULL;
515 for (qp = list->q_back; qp != list; qp = next) {
517 llp = (struct ulist *)qp;
518 lp = &llp->unit.land;
519 getland(lp->lnd_uid, lp);
521 if (lp->lnd_own != actor) {
522 mpr(actor, "%s was disbanded at %s\n",
523 prland(lp), xyas(lp->lnd_x, lp->lnd_y, actor));
524 emp_remque(&llp->queue);
529 snprintf(and_stays, sizeof(and_stays), " & stays in %s",
530 xyas(lp->lnd_x, lp->lnd_y, actor));
531 if (!lnd_may_mar(lp, ldr, and_stays)) {
532 lnd_mar_put_one(llp);
538 if (lp->lnd_mobil + 1 < (int)llp->mobil) {
539 llp->mobil = lp->lnd_mobil;
545 lnd_mar_put_one(struct ulist *llp)
547 if (llp->mobil < -127)
549 llp->unit.land.lnd_mobil = llp->mobil;
554 lnd_mar_put(struct emp_qelem *list, natid actor)
556 struct emp_qelem *qp, *next;
560 for (qp = list->q_back; qp != list; qp = next) {
562 llp = (struct ulist *)qp;
563 lp = &llp->unit.land;
564 mpr(actor, "%s stopped at %s\n",
565 prland(lp), xyas(lp->lnd_x, lp->lnd_y, actor));
566 lnd_mar_put_one(llp);
571 lnd_put(struct emp_qelem *list)
573 struct emp_qelem *qp, *next;
575 for (qp = list->q_back; qp != list; qp = next) {
577 lnd_put_one((struct ulist *)qp);
582 lnd_put_one(struct ulist *llp)
584 putland(llp->unit.land.lnd_uid, &llp->unit.land);
585 emp_remque(&llp->queue);
590 * Sweep landmines with engineers in @land_list for @actor.
591 * All land units in @land_list must be in the same sector.
592 * If @explicit is non-zero, this is for an explicit sweep command from
593 * a player. Else it's an automatic "on the move" sweep.
594 * If @takemob is non-zero, require and charge mobility.
595 * Return non-zero when the land units should stop.
598 lnd_sweep(struct emp_qelem *land_list, int explicit, int takemob,
601 struct emp_qelem *qp;
602 struct emp_qelem *next;
605 int mines, m, max, sshells, lshells;
606 int stopping = 0, first = 1;
608 llp = lnd_find_capable(land_list, L_ENGINEER);
611 mpr(actor, "No engineers!\n");
615 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
617 && relations_with(sect.sct_oldown, actor) == ALLIED)
619 if (SCT_MINES_ARE_SEAMINES(§)) {
621 mpr(actor, "%s is a %s. No landmines there!\n",
622 xyas(sect.sct_x, sect.sct_y, actor),
623 dchr[sect.sct_type].d_name);
627 for (qp = land_list->q_back; qp != land_list; qp = next) {
629 llp = (struct ulist *)qp;
630 if (!(lchr[llp->unit.land.lnd_type].l_flags & L_ENGINEER))
633 if (llp->mobil <= 0.0) {
635 mpr(actor, "%s is out of mobility!\n",
636 prland(&llp->unit.land));
639 llp->mobil -= lnd_pathcost(&llp->unit.land, 0.2);
640 llp->unit.land.lnd_mobil = (int)llp->mobil;
641 llp->unit.land.lnd_harden = 0;
643 putland(llp->unit.land.lnd_uid, &llp->unit.land);
644 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
645 if (!(mines = sect.sct_mines))
647 max = lchr[llp->unit.land.lnd_type].l_item[I_SHELL];
648 lshells = llp->unit.land.lnd_item[I_SHELL];
649 sshells = sect.sct_item[I_SHELL];
650 for (m = 0; mines > 0 && m < max * 2; m++) {
651 if (chance(0.5 * lchr[llp->unit.land.lnd_type].l_att)) {
653 mpr(actor, "Approaching minefield at %s...\n",
654 xyas(sect.sct_x, sect.sct_y, actor));
657 mpr(actor, "Sweep...\n");
661 else if (sshells < ITEM_MAX)
665 sect.sct_mines = mines;
666 llp->unit.land.lnd_item[I_SHELL] = lshells;
667 sect.sct_item[I_SHELL] = sshells;
668 putland(llp->unit.land.lnd_uid, &llp->unit.land);
670 stopping |= lnd_check_one_mines(llp, 1);
676 lnd_check_one_mines(struct ulist *llp, int with_eng)
680 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
681 if (SCT_LANDMINES(§) == 0)
683 if (relations_with(sect.sct_oldown, llp->unit.land.lnd_own) == ALLIED)
685 if (chance(DMINE_LHITCHANCE(sect.sct_mines) / (1 + 2 * with_eng))) {
686 lnd_hit_mine(&llp->unit.land);
689 putland(llp->unit.land.lnd_uid, &llp->unit.land);
690 if (!llp->unit.land.lnd_own) {
691 emp_remque(&llp->queue);
700 lnd_check_mines(struct emp_qelem *land_list)
702 struct emp_qelem *qp;
703 struct emp_qelem *next;
705 int with_eng = !!lnd_find_capable(land_list, L_ENGINEER);
707 for (qp = land_list->q_back; qp != land_list; qp = next) {
709 stopping |= lnd_check_one_mines((struct ulist *)qp, with_eng);
714 /* Return whether and why SP would be stuck in SECTP. */
716 lnd_check_mar(struct lndstr *lp, struct sctstr *sectp)
718 if (dchr[sectp->sct_type].d_mob0 < 0)
719 return LND_STUCK_IMPASSABLE;
720 if (lnd_mobtype(lp) == MOB_RAIL && !SCT_HAS_RAIL(sectp))
721 return LND_STUCK_NO_RAIL;
722 return LND_STUCK_NOT;
726 lnd_damage(struct emp_qelem *list, int totdam)
728 struct emp_qelem *qp;
729 struct emp_qelem *next;
734 if (!totdam || !(count = emp_quelen(list)))
736 dam = ldround((double)totdam / count, 1);
737 for (qp = list->q_back; qp != list; qp = next) {
739 llp = (struct ulist *)qp;
740 /* land unit might have changed (launched SAMs, collateral dmg) */
741 getland(llp->unit.land.lnd_uid, &llp->unit.land);
742 landdamage(&llp->unit.land, dam);
743 putland(llp->unit.land.lnd_uid, &llp->unit.land);
744 if (!llp->unit.land.lnd_own) {
753 lnd_easiest_target(struct emp_qelem *list)
755 struct emp_qelem *qp;
756 struct emp_qelem *next;
759 int easiest = 9876; /* things start great for victim */
762 for (qp = list->q_back; qp != list; qp = next) {
764 llp = (struct ulist *)qp;
765 hard = lnd_hardtarget(&llp->unit.land);
767 easiest = hard; /* things get worse for victim */
770 return easiest - count;
774 lnd_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
777 int mindam = emp_quelen(list) * 20;
778 int hardtarget = lnd_easiest_target(list);
779 int dam, newdam, sublaunch;
782 struct emp_qelem msl_list, *qp, *newqp;
784 msl_sel(&msl_list, newx, newy, victim, P_T, P_MAR, MI_INTERDICT);
787 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
789 plp = (struct plist *)qp;
791 if (dam < mindam && mission_pln_equip(plp, NULL, 'p') >= 0) {
792 if (msl_launch(&plp->plane, EF_LAND, "troops",
793 newx, newy, victim, &sublaunch) < 0)
796 if (msl_hit(&plp->plane, hardtarget, EF_LAND,
797 N_LND_MISS, N_LND_SMISS, sublaunch, victim)) {
798 newdam = pln_damage(&plp->plane, 'p', "");
801 newdam = pln_damage(&plp->plane, 'p', NULL);
802 collateral_damage(newx, newy, newdam);
805 plp->plane.pln_effic = 0;
806 putplane(plp->plane.pln_uid, &plp->plane);
813 mpr(victim, "missile interdiction mission does %d damage!\n", dam);
814 collateral_damage(newx, newy, dam);
815 lnd_damage(list, dam);
821 /* Steve M. - commented out for now until abuse is decided upon */
822 /* risner: allow forts to interdict land units. */
824 lnd_fort_interdiction(struct emp_qelem *list,
825 coord newx, coord newy, natid victim)
834 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
835 while (nxtsct(&ns, &fsect)) {
836 if (fsect.sct_own == 0)
838 if (relations_with(fsect.sct_own, victim) >= NEUTRAL)
840 range = roundrange(fortrange(&fsect));
841 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
844 dam = fort_fire(&fsect);
850 mpr(victim, "Incoming fire does %d damage!\n", dam);
852 "%s fires at %s land units in %s for %d!\n",
853 xyas(fsect.sct_x, fsect.sct_y,
855 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
856 nreport(fsect.sct_own, N_SCT_SHELL, victim, 1);
859 lnd_damage(list, totdam);
865 lnd_mission_interdiction(struct emp_qelem *list, coord x, coord y,
870 dam = unit_interdict(x, y, victim, "land units",
871 lnd_easiest_target(list),
874 lnd_damage(list, dam);
879 lnd_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
884 if (!opt_NO_FORT_FIRE)
885 /* Steve M. - commented out for now until abuse is decided upon */
886 stopping |= lnd_fort_interdiction(list, newx, newy, victim);
889 stopping |= lnd_mission_interdiction(list, newx, newy, victim);
890 stopping |= lnd_missile_interdiction(list, newx, newy, victim);
894 /* high value of hardtarget is harder to hit */
896 lnd_hardtarget(struct lndstr *lp)
900 getsect(lp->lnd_x, lp->lnd_y, §);
901 return (int)((lp->lnd_effic / 100.0) *
902 (10 + dchr[sect.sct_type].d_dstr * 2 + lnd_spd(lp) / 2.0
907 lnd_hit_mine(struct lndstr *lp)
911 mpr(lp->lnd_own, "Blammo! Landmines detected in %s!\n",
912 xyas(lp->lnd_x, lp->lnd_y, lp->lnd_own));
914 nreport(lp->lnd_own, N_LHIT_MINE, 0, 1);
917 if (lchr[lp->lnd_type].l_flags & L_ENGINEER)
925 lnd_pathcost(struct lndstr *lp, double pathcost)
929 effspd = lnd_spd(lp);
930 if (lchr[(int)lp->lnd_type].l_flags & L_SUPPLY)
931 effspd *= lp->lnd_effic * 0.01;
934 * The return value must be PATHCOST times a factor that depends
935 * only on the land unit. Anything else breaks path finding. In
936 * particular, you can't add or enforce a minimum cost here. Do
937 * it in sector_mcost().
939 return pathcost * 5.0 * speed_factor(effspd, lp->lnd_tech);
943 lnd_mobtype(struct lndstr *lp)
945 return (lchr[(int)lp->lnd_type].l_flags & L_TRAIN)
946 ? MOB_RAIL : MOB_MARCH;
950 lnd_mobcost(struct lndstr *lp, struct sctstr *sp)
952 return lnd_pathcost(lp, sector_mcost(sp, lnd_mobtype(lp)));
956 * Ask user to confirm sector abandonment, if any.
957 * All land units in @list must be in the same sector.
958 * If removing the land units in @list would abandon their sector, ask
959 * the user to confirm.
960 * Return zero when abandonment was declined, else non-zero.
962 int lnd_abandon_askyn(struct emp_qelem *list)
967 struct emp_qelem *qp;
971 llp = (struct ulist *)list->q_back;
972 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
973 abandon = abandon_askyn(§, I_CIVIL, 0, llp);
974 if (!check_sect_ok(§))
976 for (qp = list->q_back; qp != list; qp = qp->q_back) {
977 if (!check_land_ok(&((struct ulist *)qp)->unit.land))
984 lnd_mar_dir(struct emp_qelem *list, int dir, natid actor)
986 struct sctstr sect, osect;
987 struct emp_qelem *qp;
988 struct emp_qelem *next;
998 if (CANT_HAPPEN(QEMPTY(list)))
1001 if (dir <= DIR_STOP || dir > DIR_LAST) {
1002 CANT_HAPPEN(dir != DIR_STOP);
1003 lnd_mar_put(list, actor);
1006 dx = diroff[dir][0];
1007 dy = diroff[dir][1];
1009 llp = (struct ulist *)list->q_back;
1010 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, &osect);
1011 oldown = osect.sct_own;
1012 newx = xnorm(llp->unit.land.lnd_x + dx);
1013 newy = ynorm(llp->unit.land.lnd_y + dy);
1014 getsect(newx, newy, §);
1015 rel = sect.sct_own ? relations_with(sect.sct_own, actor) : ALLIED;
1018 for (qp = list->q_back; qp != list; qp = next) {
1020 llp = (struct ulist *)qp;
1021 switch (lnd_check_mar(&llp->unit.land, §)) {
1024 || (lchr[llp->unit.land.lnd_type].l_flags & L_SPY))
1027 case LND_STUCK_NO_RAIL:
1029 mpr(actor, "no rail system in %s\n",
1030 xyas(newx, newy, actor));
1032 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1037 case LND_STUCK_IMPASSABLE:
1038 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1043 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1047 for (qp = list->q_back; qp != list; qp = next) {
1049 llp = (struct ulist *)qp;
1051 && !(lchr[llp->unit.land.lnd_type].l_flags & L_SPY)) {
1052 mpr(actor, "%s can't go to %s & stays in %s\n",
1053 prland(&llp->unit.land), xyas(newx, newy, actor),
1054 xyas(llp->unit.land.lnd_x, llp->unit.land.lnd_y, actor));
1055 lnd_mar_put_one(llp);
1058 if (llp->mobil <= 0.0) {
1059 mpr(actor, "%s is out of mobility & stays in %s\n",
1060 prland(&llp->unit.land),
1061 xyas(llp->unit.land.lnd_x, llp->unit.land.lnd_y, actor));
1062 lnd_mar_put_one(llp);
1065 llp->unit.land.lnd_x = newx;
1066 llp->unit.land.lnd_y = newy;
1067 llp->mobil -= lnd_mobcost(&llp->unit.land, §);
1068 llp->unit.land.lnd_mobil = (int)llp->mobil;
1069 llp->unit.land.lnd_harden = 0;
1070 putland(llp->unit.land.lnd_uid, &llp->unit.land);
1072 getsect(osect.sct_x, osect.sct_y, &osect);
1073 if (osect.sct_own != oldown && oldown == actor) {
1074 /* It was your sector, now it's not. Simple :) */
1075 mpr(actor, "You no longer own %s\n",
1076 xyas(osect.sct_x, osect.sct_y, actor));
1078 if (rel != ALLIED) {
1080 /* Always a 10% chance of getting caught. */
1081 if (chance(LND_SPY_DETECT_CHANCE(llp->unit.land.lnd_effic))) {
1082 if (rel == NEUTRAL || rel == FRIENDLY) {
1084 "%s unit spotted in %s\n", cname(actor),
1085 xyas(sect.sct_x, sect.sct_y, sect.sct_own));
1086 setrel(sect.sct_own, llp->unit.land.lnd_own, HOSTILE);
1087 } else if (rel <= HOSTILE) {
1089 "%s spy shot in %s\n", cname(actor),
1090 xyas(sect.sct_x, sect.sct_y, sect.sct_own));
1091 mpr(actor, "%s was shot and killed.\n",
1092 prland(&llp->unit.land));
1093 llp->unit.land.lnd_effic = 0;
1094 putland(llp->unit.land.lnd_uid, &llp->unit.land);
1101 return QEMPTY(list);
1105 lnd_mar_gauntlet(struct emp_qelem *list, int interdict, natid actor)
1107 struct ulist *mlp = (struct ulist *)list->q_back;
1109 int stopping, visible;
1110 struct emp_qelem *qp, *next;
1113 if (CANT_HAPPEN(QEMPTY(list)))
1115 newx = mlp->unit.land.lnd_x;
1116 newy = mlp->unit.land.lnd_y;
1117 stopping = lnd_sweep(list, 0, 1, actor);
1120 stopping |= lnd_check_mines(list);
1125 for (qp = list->q_back; qp != list; qp = next) {
1127 llp = (struct ulist *)qp;
1128 if (!(lchr[(int)llp->unit.land.lnd_type].l_flags & L_SPY))
1131 if (visible && interdict)
1132 stopping |= lnd_interdict(list, newx, newy, actor);
1138 * Fire land unit support against @victim for @attacker, at @x,@y.
1139 * If @defending, this is defensive support, else offensive support.
1140 * Return total damage.
1143 lnd_support(natid victim, natid attacker, coord x, coord y, int defending)
1145 struct nstr_item ni;
1152 snxtitem_all(&ni, EF_LAND);
1153 while (nxtitem(&ni, &land)) {
1154 if ((land.lnd_x == x) && (land.lnd_y == y))
1156 if (!feels_like_helping(land.lnd_own, attacker, victim))
1159 /* are we in range? */
1160 dist = mapdist(land.lnd_x, land.lnd_y, x, y);
1162 range = roundrange(lnd_fire_range(&land));
1166 dam2 = lnd_fire(&land);
1167 putland(land.lnd_uid, &land);
1172 nreport(land.lnd_own, N_FIRE_BACK, victim, 1);
1174 nreport(land.lnd_own, N_FIRE_L_ATTACK, victim, 1);
1175 if (pct_chance(lnd_acc(&land) - 1))
1178 if (land.lnd_own != attacker)
1180 "%s supported %s at %s\n",
1181 prland(&land), cname(attacker), xyas(x, y, land.lnd_own));
1187 lnd_can_attack(struct lndstr *lp)
1189 struct lchrstr *lcp = &lchr[(int)lp->lnd_type];
1191 if (lcp->l_flags & L_SUPPLY)
1198 * Increase fortification value of @lp.
1199 * Fortification costs mobility. Use up to @mob mobility.
1200 * Return actual fortification increase.
1203 lnd_fortify(struct lndstr *lp, int mob)
1206 double mob_used, mult;
1208 if (lp->lnd_ship >= 0 || lp->lnd_land >= 0)
1211 mob_used = MIN(lp->lnd_mobil, mob);
1215 mult = has_helpful_engineer(lp->lnd_x, lp->lnd_y, lp->lnd_own)
1218 hard_amt = (int)(mob_used * mult);
1219 if (lp->lnd_harden + hard_amt > land_mob_max) {
1220 hard_amt = land_mob_max - lp->lnd_harden;
1221 mob_used = ceil(hard_amt / mult);
1224 lp->lnd_mobil -= (int)mob_used;
1225 lp->lnd_harden += hard_amt;
1226 lp->lnd_harden = MIN(lp->lnd_harden, land_mob_max);
1232 * Is there a engineer unit at @x,@y that can help nation @cn?
1235 has_helpful_engineer(coord x, coord y, natid cn)
1237 struct nstr_item ni;
1240 snxtitem_xy(&ni, EF_LAND, x, y);
1241 while (nxtitem(&ni, &land)) {
1242 if (relations_with(land.lnd_own, cn) != ALLIED)
1244 if (lchr[(int)land.lnd_type].l_flags & L_ENGINEER)
1252 * Set @lp's tech to @tlev along with everything else that depends on it.
1255 lnd_set_tech(struct lndstr *lp, int tlev)
1257 struct lchrstr *lcp = lchr + lp->lnd_type;
1259 if (CANT_HAPPEN(tlev < lcp->l_tech))
1262 lp->lnd_tech = tlev;