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 * mobility.c: Add mobility to each of the items which accumulate mobility.
29 * Known contributors to this file:
31 * Steve McClure, 1998-1999
32 * Markus Armbruster, 2004-2008
44 static int do_upd_checking;
46 static void do_mob_land(struct lndstr *, int);
47 static void do_mob_plane(struct plnstr *, int);
48 static void do_mob_sect(struct sctstr *sp, int etus);
49 static void do_mob_ship(struct shpstr *, int);
52 sct_do_upd_mob(struct sctstr *sp)
56 if (do_upd_checking || update_running)
60 if (sp->sct_type == SCT_SANCT)
62 etus = game_tick_to_now(&sp->sct_access);
66 do_upd_checking = 1; /* avoid recursion */
67 do_mob_sect(sp, etus);
72 shp_do_upd_mob(struct shpstr *sp)
76 if (do_upd_checking || update_running)
80 etus = game_tick_to_now(&sp->shp_access);
84 do_upd_checking = 1; /* avoid recursion */
85 do_mob_ship(sp, etus);
90 lnd_do_upd_mob(struct lndstr *lp)
94 if (do_upd_checking || update_running)
98 etus = game_tick_to_now(&lp->lnd_access);
102 do_upd_checking = 1; /* avoid recursion */
103 do_mob_land(lp, etus);
108 pln_do_upd_mob(struct plnstr *pp)
112 if (do_upd_checking || update_running)
114 if (pp->pln_own == 0)
116 etus = game_tick_to_now(&pp->pln_access);
120 do_upd_checking = 1; /* avoid recursion */
121 do_mob_plane(pp, etus);
133 for (n = 0; NULL != (sp = getsectid(n)); n++) {
134 sp->sct_timestamp = now;
136 etus = game_reset_tick(&sp->sct_access);
138 etus = etu_per_update;
139 do_mob_sect(sp, etus);
144 do_mob_sect(struct sctstr *sp, int etus)
148 if (CANT_HAPPEN(etus < 0))
151 if (sp->sct_own == 0)
153 if (sp->sct_type == SCT_SANCT)
156 value = sp->sct_mobil + ((float)etus * sect_mob_scale);
157 if (value > sect_mob_max)
158 value = sect_mob_max;
159 sp->sct_mobil = value;
170 for (n = 0; NULL != (sp = getshipp(n)); n++) {
171 sp->shp_timestamp = now;
173 etus = game_reset_tick(&sp->shp_access);
175 etus = etu_per_update;
176 do_mob_ship(sp, etus);
181 do_mob_ship(struct shpstr *sp, int etus)
185 if (CANT_HAPPEN(etus < 0))
188 if (sp->shp_own == 0)
191 value = sp->shp_mobil + (float)etus * ship_mob_scale;
192 if (value > ship_mob_max)
193 value = ship_mob_max;
194 sp->shp_mobil = (signed char)value;
205 for (n = 0; NULL != (lp = getlandp(n)); n++) {
206 lp->lnd_timestamp = now;
208 etus = game_reset_tick(&lp->lnd_access);
210 etus = etu_per_update;
211 do_mob_land(lp, etus);
216 do_mob_land(struct lndstr *lp, int etus)
220 if (CANT_HAPPEN(etus < 0))
223 if (lp->lnd_own == 0)
226 value = lp->lnd_mobil + ((float)etus * land_mob_scale);
227 if (value > land_mob_max) {
228 if (lp->lnd_harden < land_mob_max && !opt_MOB_ACCESS) {
230 * Automatic fortification on excess mobility.
231 * Disabled for MOB_ACCESS, because it leads to
232 * excessively deep recursion and thus miserable
233 * performance as the number of land units grows.
235 * Provide mobility to be used in lnd_fortify()
236 * without overflowing lnd_mobil.
238 lp->lnd_mobil = land_mob_max;
239 lnd_fortify(lp, value - land_mob_max);
241 value = land_mob_max;
243 lp->lnd_mobil = value;
254 for (n = 0; NULL != (pp = getplanep(n)); n++) {
255 pp->pln_timestamp = now;
257 etus = game_reset_tick(&pp->pln_access);
259 etus = etu_per_update;
260 do_mob_plane(pp, etus);
265 do_mob_plane(struct plnstr *pp, int etus)
269 if (CANT_HAPPEN(etus < 0))
272 if (pp->pln_own == 0)
275 value = pp->pln_mobil + ((float)etus * plane_mob_scale);
276 if (value > plane_mob_max)
277 value = plane_mob_max;
278 pp->pln_mobil = value;