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 * lndsub.c: Land unit subroutines
29 * Known contributors to this file:
31 * Steve McClure, 1998-2000
32 * Markus Armbruster, 2004-2014
51 #include "prototypes.h"
55 static int lnd_check_one_mines(struct ulist *, int);
56 static void lnd_stays(natid, char *, struct ulist *);
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(int destination, struct lndstr *lp, int spy,
347 int vis = lnd_vis(lp);
348 char buf1[80], buf2[80], buf3[80];
350 if (destination == 0)
353 if (lp->lnd_own == 0)
356 memset(buf1, 0, sizeof(buf1));
357 memset(buf2, 0, sizeof(buf2));
358 memset(buf3, 0, sizeof(buf3));
359 if (chance((spy + vis) / 10.0)) {
360 if (destination == player->cnum)
361 pr("%s %s", mess, prland(lp));
363 sprintf(buf1, "%s %s", mess, prland(lp));
365 if (chance((spy + vis) / 20.0)) {
366 if (destination == player->cnum)
367 pr(" (eff %d, mil %d",
368 roundintby(lp->lnd_effic, 5),
369 roundintby(lp->lnd_item[I_MILIT], 10));
371 sprintf(buf2, " (eff %d, mil %d",
372 roundintby(lp->lnd_effic, 5),
373 roundintby(lp->lnd_item[I_MILIT], 10));
375 if (chance((spy + vis) / 20.0)) {
377 t = lp->lnd_tech - 20 + roll(40);
379 if (destination == player->cnum)
380 pr(", tech %d)\n", t);
382 sprintf(buf3, ", tech %d)\n", t);
384 if (destination == player->cnum)
387 sprintf(buf3, ")\n");
390 if (destination == player->cnum)
397 if (destination != player->cnum) {
398 wu(0, destination, "%s%s%s", buf1, buf2, buf3);
403 lnd_sel(struct nstr_item *ni, struct emp_qelem *list)
407 int mobtype = MOB_MOVE; /* indeterminate */
410 while (nxtitem(ni, &land)) {
412 * It would be nice to let deities march foreign land units,
413 * but much of the code assumes that only the land unit's
414 * owner can march it.
416 if (!land.lnd_own || land.lnd_own != player->cnum)
419 if (ontradingblock(EF_LAND, &land)) {
420 pr("unit #%d inelligible - it's for sale.\n",
426 * The marching code gets confused when trains and non-trains
427 * march together. Disallow for now.
429 this_mot = lnd_mobtype(&land);
430 if (this_mot != mobtype) {
431 if (mobtype == MOB_MOVE)
433 else if (mobtype == MOB_MARCH) {
434 pr("%s is a train and can't march with the leader.\n",
438 pr("%s can't rail-march with the leading train.\n",
444 land.lnd_mission = 0;
447 memset(land.lnd_rpath, 0, sizeof(land.lnd_rpath));
448 putland(land.lnd_uid, &land);
449 lnd_insque(&land, list);
455 * Return the new list link.
458 lnd_insque(struct lndstr *lp, struct emp_qelem *list)
460 struct ulist *mlp = malloc(sizeof(struct ulist));
462 mlp->unit.land = *lp;
463 mlp->mobil = lp->lnd_mobil;
464 emp_insque(&mlp->queue, list);
468 /* This function assumes that the list was created by lnd_sel */
470 lnd_mar(struct emp_qelem *list, double *minmobp, double *maxmobp,
473 struct emp_qelem *qp;
474 struct emp_qelem *next;
476 struct lndstr *lp, *ldr = NULL;
482 for (qp = list->q_back; qp != list; qp = next) {
484 llp = (struct ulist *)qp;
485 lp = &llp->unit.land;
486 getland(lp->lnd_uid, lp);
487 if (lp->lnd_own != actor) {
488 mpr(actor, "%s was disbanded at %s\n",
489 prland(lp), xyas(lp->lnd_x, lp->lnd_y, actor));
490 emp_remque(&llp->queue);
494 if (lp->lnd_ship >= 0) {
495 lnd_stays(actor, "is on a ship", llp);
498 if (lp->lnd_land >= 0) {
499 lnd_stays(actor, "is on a unit", llp);
502 if (!getsect(lp->lnd_x, lp->lnd_y, §)) {
503 lnd_stays(actor, "was sucked into the sky by a strange looking spaceland", llp); /* heh -KHS */
506 if (!(lchr[lp->lnd_type].l_flags & L_SPY) &&
507 !(lchr[lp->lnd_type].l_flags & L_TRAIN) &&
508 lp->lnd_item[I_MILIT] == 0) {
509 lnd_stays(actor, "has no mil on it to guide it", llp);
512 switch (lnd_check_mar(lp, §)) {
515 case LND_STUCK_NO_RAIL:
516 lnd_stays(actor, "is stuck off the rail system", llp);
521 case LND_STUCK_IMPASSABLE:
522 lnd_stays(actor, "is stuck", llp);
525 if (relations_with(sect.sct_own, actor) != ALLIED &&
526 !(lchr[lp->lnd_type].l_flags & L_SPY) &&
528 sprintf(mess, "has been kidnapped by %s", cname(sect.sct_own));
529 lnd_stays(actor, mess, llp);
534 else if (lp->lnd_x != ldr->lnd_x || lp->lnd_y != ldr->lnd_y) {
535 lnd_stays(actor, "is not with the leader", llp);
538 if (lp->lnd_mobil + 1 < (int)llp->mobil) {
539 llp->mobil = lp->lnd_mobil;
541 if (llp->mobil < *minmobp)
542 *minmobp = llp->mobil;
543 if (llp->mobil > *maxmobp)
544 *maxmobp = llp->mobil;
549 lnd_mar_put_one(struct ulist *llp)
551 if (llp->mobil < -127)
553 llp->unit.land.lnd_mobil = llp->mobil;
558 lnd_mar_put(struct emp_qelem *list, natid actor)
560 struct emp_qelem *qp, *next;
564 for (qp = list->q_back; qp != list; qp = next) {
566 llp = (struct ulist *)qp;
567 lp = &llp->unit.land;
568 mpr(actor, "%s stopped at %s\n",
569 prland(lp), xyas(lp->lnd_x, lp->lnd_y, actor));
570 lnd_mar_put_one(llp);
575 lnd_put(struct emp_qelem *list)
577 struct emp_qelem *qp, *next;
579 for (qp = list->q_back; qp != list; qp = next) {
581 lnd_put_one((struct ulist *)qp);
586 lnd_put_one(struct ulist *llp)
588 putland(llp->unit.land.lnd_uid, &llp->unit.land);
589 emp_remque(&llp->queue);
594 * Sweep landmines with engineers in LAND_LIST for ACTOR.
595 * All land units in LAND_LIST must be in the same sector.
596 * If EXPLICIT is non-zero, this is for an explicit sweep command from
597 * a player. Else it's an automatic "on the move" sweep.
598 * If TAKEMOB is non-zero, require and charge mobility.
599 * Return non-zero when the land units should stop.
602 lnd_sweep(struct emp_qelem *land_list, int explicit, int takemob,
605 struct emp_qelem *qp;
606 struct emp_qelem *next;
609 int mines, m, max, sshells, lshells;
610 int stopping = 0, first = 1;
612 llp = lnd_find_capable(land_list, L_ENGINEER);
615 mpr(actor, "No engineers!\n");
619 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
621 && relations_with(sect.sct_oldown, actor) == ALLIED)
623 if (SCT_MINES_ARE_SEAMINES(§)) {
625 mpr(actor, "%s is a %s. No landmines there!\n",
626 xyas(sect.sct_x, sect.sct_y, actor),
627 dchr[sect.sct_type].d_name);
631 for (qp = land_list->q_back; qp != land_list; qp = next) {
633 llp = (struct ulist *)qp;
634 if (!(lchr[llp->unit.land.lnd_type].l_flags & L_ENGINEER))
637 if (llp->mobil <= 0.0) {
639 mpr(actor, "%s is out of mobility!\n",
640 prland(&llp->unit.land));
643 llp->mobil -= lnd_pathcost(&llp->unit.land, 0.2);
644 llp->unit.land.lnd_mobil = (int)llp->mobil;
645 llp->unit.land.lnd_harden = 0;
647 putland(llp->unit.land.lnd_uid, &llp->unit.land);
648 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
649 if (!(mines = sect.sct_mines))
651 max = lchr[llp->unit.land.lnd_type].l_item[I_SHELL];
652 lshells = llp->unit.land.lnd_item[I_SHELL];
653 sshells = sect.sct_item[I_SHELL];
654 for (m = 0; mines > 0 && m < max * 2; m++) {
655 if (chance(0.5 * lchr[llp->unit.land.lnd_type].l_att)) {
657 mpr(actor, "Approaching minefield at %s...\n",
658 xyas(sect.sct_x, sect.sct_y, actor));
661 mpr(actor, "Sweep...\n");
665 else if (sshells < ITEM_MAX)
669 sect.sct_mines = mines;
670 llp->unit.land.lnd_item[I_SHELL] = lshells;
671 sect.sct_item[I_SHELL] = sshells;
672 putland(llp->unit.land.lnd_uid, &llp->unit.land);
674 if (lnd_check_one_mines(llp, 1)) {
684 lnd_check_one_mines(struct ulist *llp, int with_eng)
688 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
689 if (SCT_LANDMINES(§) == 0)
691 if (relations_with(sect.sct_oldown, llp->unit.land.lnd_own) == ALLIED)
693 if (chance(DMINE_LHITCHANCE(sect.sct_mines) / (1 + 2 * with_eng))) {
694 lnd_hit_mine(&llp->unit.land);
697 putland(llp->unit.land.lnd_uid, &llp->unit.land);
698 if (!llp->unit.land.lnd_own)
705 lnd_check_mines(struct emp_qelem *land_list)
707 struct emp_qelem *qp;
708 struct emp_qelem *next;
711 int with_eng = !!lnd_find_capable(land_list, L_ENGINEER);
713 for (qp = land_list->q_back; qp != land_list; qp = next) {
715 llp = (struct ulist *)qp;
716 if (lnd_check_one_mines(llp, with_eng)) {
726 lnd_stays(natid actor, char *str, struct ulist *llp)
728 mpr(actor, "%s %s & stays in %s\n",
729 prland(&llp->unit.land), str,
730 xyas(llp->unit.land.lnd_x, llp->unit.land.lnd_y, actor));
731 lnd_mar_put_one(llp);
734 /* Return whether and why SP would be stuck in SECTP. */
736 lnd_check_mar(struct lndstr *lp, struct sctstr *sectp)
738 if (dchr[sectp->sct_type].d_mob0 < 0)
739 return LND_STUCK_IMPASSABLE;
740 if (lnd_mobtype(lp) == MOB_RAIL && !SCT_HAS_RAIL(sectp))
741 return LND_STUCK_NO_RAIL;
742 return LND_STUCK_NOT;
746 lnd_damage(struct emp_qelem *list, int totdam)
748 struct emp_qelem *qp;
749 struct emp_qelem *next;
754 if (!totdam || !(count = emp_quelen(list)))
756 dam = ldround((double)totdam / count, 1);
757 for (qp = list->q_back; qp != list; qp = next) {
759 llp = (struct ulist *)qp;
760 /* land unit might have changed (launched SAMs, collateral dmg) */
761 getland(llp->unit.land.lnd_uid, &llp->unit.land);
762 landdamage(&llp->unit.land, dam);
763 putland(llp->unit.land.lnd_uid, &llp->unit.land);
764 if (!llp->unit.land.lnd_own) {
773 lnd_easiest_target(struct emp_qelem *list)
775 struct emp_qelem *qp;
776 struct emp_qelem *next;
779 int easiest = 9876; /* things start great for victim */
782 for (qp = list->q_back; qp != list; qp = next) {
784 llp = (struct ulist *)qp;
785 hard = lnd_hardtarget(&llp->unit.land);
787 easiest = hard; /* things get worse for victim */
790 return easiest - count;
794 lnd_missile_interdiction(struct emp_qelem *list, coord newx, coord newy,
797 int mindam = emp_quelen(list) * 20;
798 int hardtarget = lnd_easiest_target(list);
799 int dam, newdam, sublaunch;
802 struct emp_qelem msl_list, *qp, *newqp;
804 msl_sel(&msl_list, newx, newy, victim, P_T, P_MAR, MI_INTERDICT);
807 for (qp = msl_list.q_back; qp != &msl_list; qp = newqp) {
809 plp = (struct plist *)qp;
811 if (dam < mindam && mission_pln_equip(plp, NULL, 'p') >= 0) {
812 if (msl_launch(&plp->plane, EF_LAND, "troops",
813 newx, newy, victim, &sublaunch) < 0)
816 if (msl_hit(&plp->plane, hardtarget, EF_LAND,
817 N_LND_MISS, N_LND_SMISS, sublaunch, victim)) {
818 newdam = pln_damage(&plp->plane, 'p', 1);
821 newdam = pln_damage(&plp->plane, 'p', 0);
822 collateral_damage(newx, newy, newdam);
825 plp->plane.pln_effic = 0;
826 putplane(plp->plane.pln_uid, &plp->plane);
833 mpr(victim, "missile interdiction mission does %d damage!\n", dam);
834 collateral_damage(newx, newy, dam);
835 lnd_damage(list, dam);
841 /* Steve M. - commented out for now until abuse is decided upon */
842 /* risner: allow forts to interdict land units. */
844 lnd_fort_interdiction(struct emp_qelem *list,
845 coord newx, coord newy, natid victim)
854 snxtsct_dist(&ns, newx, newy, fort_max_interdiction_range);
855 while (nxtsct(&ns, &fsect)) {
856 if (fsect.sct_own == 0)
858 if (relations_with(fsect.sct_own, victim) >= NEUTRAL)
860 range = roundrange(fortrange(&fsect));
861 trange = mapdist(newx, newy, fsect.sct_x, fsect.sct_y);
864 dam = fort_fire(&fsect);
870 mpr(victim, "Incoming fire does %d damage!\n", dam);
872 "%s fires at %s land units in %s for %d!\n",
873 xyas(fsect.sct_x, fsect.sct_y,
875 cname(victim), xyas(newx, newy, fsect.sct_own), dam);
876 nreport(fsect.sct_own, N_SCT_SHELL, victim, 1);
879 lnd_damage(list, totdam);
885 lnd_mission_interdiction(struct emp_qelem *list, coord x, coord y,
890 dam = unit_interdict(x, y, victim, "land units",
891 lnd_easiest_target(list),
894 lnd_damage(list, dam);
899 lnd_interdict(struct emp_qelem *list, coord newx, coord newy, natid victim)
904 if (!opt_NO_FORT_FIRE)
905 /* Steve M. - commented out for now until abuse is decided upon */
906 stopping |= lnd_fort_interdiction(list, newx, newy, victim);
909 stopping |= lnd_mission_interdiction(list, newx, newy, victim);
910 stopping |= lnd_missile_interdiction(list, newx, newy, victim);
914 /* high value of hardtarget is harder to hit */
916 lnd_hardtarget(struct lndstr *lp)
920 getsect(lp->lnd_x, lp->lnd_y, §);
921 return (int)((lp->lnd_effic / 100.0) *
922 (10 + dchr[sect.sct_type].d_dstr * 2 + lnd_spd(lp) / 2.0
927 lnd_hit_mine(struct lndstr *lp)
931 mpr(lp->lnd_own, "Blammo! Landmines detected in %s!\n",
932 xyas(lp->lnd_x, lp->lnd_y, lp->lnd_own));
934 nreport(lp->lnd_own, N_LHIT_MINE, 0, 1);
937 if (lchr[lp->lnd_type].l_flags & L_ENGINEER)
945 lnd_pathcost(struct lndstr *lp, double pathcost)
949 effspd = lnd_spd(lp);
950 if (lchr[(int)lp->lnd_type].l_flags & L_SUPPLY)
951 effspd *= lp->lnd_effic * 0.01;
954 * The return value must be PATHCOST times a factor that depends
955 * only on the land unit. Anything else breaks path finding. In
956 * particular, you can't add or enforce a minimum cost here. Do
957 * it in sector_mcost().
959 return pathcost * 5.0 * speed_factor(effspd, lp->lnd_tech);
963 lnd_mobtype(struct lndstr *lp)
965 return (lchr[(int)lp->lnd_type].l_flags & L_TRAIN)
966 ? MOB_RAIL : MOB_MARCH;
970 lnd_mobcost(struct lndstr *lp, struct sctstr *sp)
972 return lnd_pathcost(lp, sector_mcost(sp, lnd_mobtype(lp)));
976 * Ask user to confirm sector abandonment, if any.
977 * All land units in LIST must be in the same sector.
978 * If removing the land units in LIST would abandon their sector, ask
979 * the user to confirm.
980 * Return zero when abandonment was declined, else non-zero.
982 int lnd_abandon_askyn(struct emp_qelem *list)
986 struct emp_qelem *qp;
990 llp = (struct ulist *)list->q_back;
991 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, §);
992 if (!abandon_askyn(§, I_CIVIL, 0, llp))
994 if (!check_sect_ok(§))
996 for (qp = list->q_back; qp != list; qp = qp->q_back) {
997 if (!check_land_ok(&((struct ulist *)qp)->unit.land))
1004 lnd_mar_one_sector(struct emp_qelem *list, int dir, natid actor)
1006 struct sctstr sect, osect;
1007 struct emp_qelem *qp;
1008 struct emp_qelem *next;
1021 if (CANT_HAPPEN(QEMPTY(list)))
1024 if (dir <= DIR_STOP || dir >= DIR_VIEW) {
1025 lnd_mar_put(list, actor);
1028 dx = diroff[dir][0];
1029 dy = diroff[dir][1];
1031 llp = (struct ulist *)list->q_back;
1032 getsect(llp->unit.land.lnd_x, llp->unit.land.lnd_y, &osect);
1033 oldown = osect.sct_own;
1034 newx = xnorm(llp->unit.land.lnd_x + dx);
1035 newy = ynorm(llp->unit.land.lnd_y + dy);
1036 getsect(newx, newy, §);
1037 rel = sect.sct_own ? relations_with(sect.sct_own, actor) : ALLIED;
1040 for (qp = list->q_back; qp != list; qp = next) {
1042 llp = (struct ulist *)qp;
1043 switch (lnd_check_mar(&llp->unit.land, §)) {
1046 || (lchr[llp->unit.land.lnd_type].l_flags & L_SPY))
1049 case LND_STUCK_NO_RAIL:
1051 mpr(actor, "no rail system in %s\n",
1052 xyas(newx, newy, actor));
1054 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1059 case LND_STUCK_IMPASSABLE:
1060 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1065 mpr(actor, "can't go to %s\n", xyas(newx, newy, actor));
1069 for (qp = list->q_back; qp != list; qp = next) {
1071 llp = (struct ulist *)qp;
1073 && !(lchr[llp->unit.land.lnd_type].l_flags & L_SPY)) {
1074 sprintf(dp, "can't go to %s", xyas(newx, newy, actor));
1075 lnd_stays(actor, dp, llp);
1078 if (llp->mobil <= 0.0) {
1079 lnd_stays(actor, "is out of mobility", llp);
1082 llp->unit.land.lnd_x = newx;
1083 llp->unit.land.lnd_y = newy;
1084 llp->mobil -= lnd_mobcost(&llp->unit.land, §);
1085 llp->unit.land.lnd_mobil = (int)llp->mobil;
1086 llp->unit.land.lnd_harden = 0;
1087 putland(llp->unit.land.lnd_uid, &llp->unit.land);
1089 getsect(osect.sct_x, osect.sct_y, &osect);
1090 if (osect.sct_own != oldown && oldown == actor) {
1091 /* It was your sector, now it's not. Simple :) */
1092 mpr(actor, "You no longer own %s\n",
1093 xyas(osect.sct_x, osect.sct_y, actor));
1095 if (rel != ALLIED) {
1097 /* Always a 10% chance of getting caught. */
1098 if (chance(LND_SPY_DETECT_CHANCE(llp->unit.land.lnd_effic))) {
1099 if (rel == NEUTRAL || rel == FRIENDLY) {
1101 "%s unit spotted in %s\n", cname(actor),
1102 xyas(sect.sct_x, sect.sct_y, sect.sct_own));
1103 setrel(sect.sct_own, llp->unit.land.lnd_own, HOSTILE);
1104 } else if (rel <= HOSTILE) {
1106 "%s spy shot in %s\n", cname(actor),
1107 xyas(sect.sct_x, sect.sct_y, sect.sct_own));
1108 mpr(actor, "%s was shot and killed.\n",
1109 prland(&llp->unit.land));
1110 llp->unit.land.lnd_effic = 0;
1111 putland(llp->unit.land.lnd_uid, &llp->unit.land);
1119 stopping |= lnd_sweep(list, 0, 1, actor);
1122 stopping |= lnd_check_mines(list);
1127 for (qp = list->q_back; qp != list; qp = next) {
1129 llp = (struct ulist *)qp;
1130 if (!(lchr[(int)llp->unit.land.lnd_type].l_flags & L_SPY))
1134 stopping |= lnd_interdict(list, newx, newy, actor);
1140 * Fire land unit support against VICTIM for ATTACKER, at X,Y.
1141 * If DEFENDING, this is defensive support, else offensive support.
1142 * Return total damage.
1145 lnd_support(natid victim, natid attacker, coord x, coord y, int defending)
1147 struct nstr_item ni;
1154 snxtitem_all(&ni, EF_LAND);
1155 while (nxtitem(&ni, &land)) {
1156 if ((land.lnd_x == x) && (land.lnd_y == y))
1158 if (!feels_like_helping(land.lnd_own, attacker, victim))
1161 /* are we in range? */
1162 dist = mapdist(land.lnd_x, land.lnd_y, x, y);
1164 range = roundrange(lnd_fire_range(&land));
1168 dam2 = lnd_fire(&land);
1169 putland(land.lnd_uid, &land);
1174 nreport(land.lnd_own, N_FIRE_BACK, victim, 1);
1176 nreport(land.lnd_own, N_FIRE_L_ATTACK, victim, 1);
1177 if (pct_chance(lnd_acc(&land) - 1))
1180 if (land.lnd_own != attacker)
1182 "%s supported %s at %s\n",
1183 prland(&land), cname(attacker), xyas(x, y, land.lnd_own));
1189 lnd_can_attack(struct lndstr *lp)
1191 struct lchrstr *lcp = &lchr[(int)lp->lnd_type];
1193 if (lcp->l_flags & L_SUPPLY)
1200 * Increase fortification value of LP.
1201 * Fortification costs mobility. Use up to MOB mobility.
1202 * Return actual fortification increase.
1205 lnd_fortify(struct lndstr *lp, int mob)
1208 double mob_used, mult;
1210 if (lp->lnd_ship >= 0 || lp->lnd_land >= 0)
1213 mob_used = MIN(lp->lnd_mobil, mob);
1217 mult = has_helpful_engineer(lp->lnd_x, lp->lnd_y, lp->lnd_own)
1220 hard_amt = (int)(mob_used * mult);
1221 if (lp->lnd_harden + hard_amt > land_mob_max) {
1222 hard_amt = land_mob_max - lp->lnd_harden;
1223 mob_used = ceil(hard_amt / mult);
1226 lp->lnd_mobil -= (int)mob_used;
1227 lp->lnd_harden += hard_amt;
1228 lp->lnd_harden = MIN(lp->lnd_harden, land_mob_max);
1234 * Is there a engineer unit at X,Y that can help nation CN?
1237 has_helpful_engineer(coord x, coord y, natid cn)
1239 struct nstr_item ni;
1242 snxtitem_xy(&ni, EF_LAND, x, y);
1243 while (nxtitem(&ni, &land)) {
1244 if (relations_with(land.lnd_own, cn) != ALLIED)
1246 if (lchr[(int)land.lnd_type].l_flags & L_ENGINEER)
1254 * Set LP's tech to TLEV along with everything else that depends on it.
1257 lnd_set_tech(struct lndstr *lp, int tlev)
1259 struct lchrstr *lcp = lchr + lp->lnd_type;
1261 if (CANT_HAPPEN(tlev < lcp->l_tech))
1264 lp->lnd_tech = tlev;