2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, 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 the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * mobility.c: Add mobility to each of the items which accumulate mobility.
30 * Known contributors to this file:
32 * Steve McClure, 1998-1999
53 static int timestamp_fixing;
54 static int do_upd_checking = 0;
56 static void do_mob_land(struct lndstr *, int);
57 static void do_mob_plane(struct plnstr *, int);
58 static void do_mob_sect(struct sctstr *sp, int etus);
59 static void do_mob_ship(struct shpstr *, int);
62 increase_mob(time_t * counter, float mult)
73 secs = now - *counter;
74 if (secs < 1 || secs < s_p_etu)
76 newetus = (int)(secs / s_p_etu);
79 left = (secs % s_p_etu);
81 newmob = (float)(newetus * mult);
82 inewmob = (int)(newetus * mult);
83 if (newmob == inewmob || newetus > 7)
87 } while (newetus > 0);
92 *counter = *counter - left;
100 update_timestamps(time_t lastsavedtime)
102 struct shpstr *shipp;
103 struct sctstr *sectp;
104 struct lndstr *landp;
105 struct plnstr *planep;
110 timestamp_fixing = 1;
112 delta = now - lastsavedtime;
113 for (n = 0; (shipp = getshipp(n)); n++)
114 shipp->shp_access += delta;
115 for (n = 0; (sectp = getsectid(n)); n++)
116 sectp->sct_access += delta;
117 for (n = 0; (landp = getlandp(n)); n++)
118 landp->lnd_access += delta;
119 for (n = 0; (planep = getplanep(n)); n++)
120 planep->pln_access += delta;
121 timestamp_fixing = 0;
127 struct shpstr *shipp;
128 struct sctstr *sectp;
129 struct lndstr *landp;
130 struct plnstr *planep;
137 sectp = getsectid(n);
139 planep = getplanep(n);
142 shp_do_upd_mob(shipp);
144 sct_do_upd_mob(sectp);
146 lnd_do_upd_mob(landp);
148 pln_do_upd_mob(planep);
149 if (!shipp && !sectp && !landp && !planep)
157 sct_do_upd_mob(struct sctstr *sp)
161 if (do_upd_checking || timestamp_fixing || update_pending)
163 if (sp->sct_own == 0)
165 if (sp->sct_type == SCT_SANCT)
167 if ((etus = increase_mob(&sp->sct_access, sect_mob_scale)) == 0)
170 do_mob_sect(sp, etus);
176 shp_do_upd_mob(struct shpstr *sp)
180 if (do_upd_checking || timestamp_fixing || update_pending)
182 if (sp->shp_own == 0)
184 if ((etus = increase_mob(&sp->shp_access, ship_mob_scale)) == 0)
187 do_mob_ship(sp, etus);
192 lnd_do_upd_mob(struct lndstr *lp)
196 if (do_upd_checking || timestamp_fixing || update_pending)
198 if (lp->lnd_own == 0)
200 if ((etus = increase_mob(&lp->lnd_access, land_mob_scale)) == 0)
204 do_mob_land(lp, etus);
209 pln_do_upd_mob(struct plnstr *pp)
213 if (do_upd_checking || timestamp_fixing || update_pending)
215 if (pp->pln_own == 0)
217 if ((etus = increase_mob(&pp->pln_access, plane_mob_scale)) == 0)
221 do_mob_plane(pp, etus);
233 for (n = 0; NULL != (sp = getsectid(n)); n++) {
234 sp->sct_timestamp = now;
238 do_mob_sect(sp, etus);
243 do_mob_sect(struct sctstr *sp, int etus)
247 if (sp->sct_own == 0)
249 if (sp->sct_type == SCT_SANCT)
251 /* Do we have to even bother? */
252 if (sp->sct_mobil >= sect_mob_max) {
253 /* No, so set just in case and then return */
254 sp->sct_mobil = sect_mob_max;
257 value = sp->sct_mobil + ((float)etus * sect_mob_scale);
258 if (value > sect_mob_max)
259 value = sect_mob_max;
260 sp->sct_mobil = value;
271 for (n = 0; NULL != (sp = getshipp(n)); n++) {
272 sp->shp_timestamp = now;
276 do_mob_ship(sp, etus);
281 do_mob_ship(struct shpstr *sp, int etus)
285 int can_add, have_fuel_for, total_add;
288 if (sp->shp_own == 0)
291 /* Do we even have to bother updating this mobility? */
292 if (sp->shp_mobil >= ship_mob_max) {
293 /* No, so don't. Just set it to max (just in case) and
295 sp->shp_mobil = ship_mob_max;
299 if (opt_FUEL == 0) { /* only a bit to do ... */
300 value = sp->shp_mobil + ((float)etus * ship_mob_scale);
301 if (value > ship_mob_max)
302 value = ship_mob_max;
303 sp->shp_mobil = value;
304 return; /* so we ship the FUEL stuff */
307 /* opt_FUEL in force */
308 if (mchr[(int)sp->shp_type].m_fuelu == 0) {
309 value = sp->shp_mobil + ((float)etus * ship_mob_scale);
310 if (value > ship_mob_max)
311 value = ship_mob_max;
312 sp->shp_mobil = (s_char)value;
314 can_add = ship_mob_max - sp->shp_mobil;
315 if (can_add > ((float)etus * ship_mob_scale))
316 can_add = ((float)etus * ship_mob_scale);
317 have_fuel_for = ldround((((double)sp->shp_fuel /
318 (double)mchr[(int)sp->shp_type].
319 m_fuelu) * (double)fuel_mult), 1);
321 if (can_add > have_fuel_for) {
323 need = can_add - have_fuel_for;
325 d *= (double)mchr[(int)sp->shp_type].m_fuelu;
326 d /= (double)fuel_mult;
328 if ((d - (int)d) > 0.0)
331 newfuel = supply_commod(sp->shp_own, sp->shp_x,
332 sp->shp_y, I_PETROL, need);
333 sp->shp_fuel += (u_char)(newfuel * 5);
336 have_fuel_for = ldround((((double)sp->shp_fuel /
337 (double)mchr[(int)sp->shp_type].
338 m_fuelu) * (double)fuel_mult), 1);
340 if (can_add > have_fuel_for) {
342 need = can_add - have_fuel_for;
344 d *= (double)mchr[(int)sp->shp_type].m_fuelu;
345 d /= (double)fuel_mult;
347 if ((d - (int)d) > 0.0)
350 newfuel = supply_commod(sp->shp_own, sp->shp_x,
351 sp->shp_y, I_OIL, need);
352 sp->shp_fuel += (u_char)(newfuel * 50);
355 have_fuel_for = ldround((((double)sp->shp_fuel /
356 (double)mchr[(int)sp->shp_type].
357 m_fuelu) * (double)fuel_mult), 1);
359 if (can_add > have_fuel_for)
360 total_add = have_fuel_for;
363 d = (double)total_add;
364 d *= (double)mchr[(int)sp->shp_type].m_fuelu;
365 d /= (double)fuel_mult;
366 sp->shp_fuel -= (u_char)ldround(d, 1);
367 sp->shp_fuel = (u_char)min(sp->shp_fuel,
368 mchr[(int)sp->shp_type].m_fuelc);
369 sp->shp_mobil += (s_char)total_add;
381 for (n = 0; NULL != (lp = getlandp(n)); n++) {
382 lp->lnd_timestamp = now;
386 do_mob_land(lp, etus);
391 do_mob_land(struct lndstr *lp, int etus)
395 int can_add, have_fuel_for, total_add;
398 if (lp->lnd_own == 0)
401 if (lp->lnd_mobil >= land_mob_max) {
402 lp->lnd_mobil = land_mob_max;
403 if (lp->lnd_harden >= land_mob_max) {
404 lp->lnd_harden = land_mob_max;
409 if (opt_FUEL == 0) { /* just some bits and pieces */
410 value = lp->lnd_mobil + ((float)etus * land_mob_scale);
411 if (value > land_mob_max) {
412 lnd_fortify(lp, value - land_mob_max);
413 value = land_mob_max;
415 lp->lnd_mobil = value;
420 /* opt_FUEL in force ... */
421 if (lp->lnd_fuelu == 0) {
422 value = lp->lnd_mobil + ((float)etus * land_mob_scale);
423 if (value > land_mob_max) {
424 lnd_fortify(lp, value - land_mob_max);
425 value = land_mob_max;
427 lp->lnd_mobil = value;
431 can_add = land_mob_max - lp->lnd_mobil;
433 if (can_add > ((float)etus * land_mob_scale))
434 can_add = ((float)etus * land_mob_scale);
436 have_fuel_for = (lp->lnd_fuel / lp->lnd_fuelu) * fuel_mult;
438 if (can_add > have_fuel_for) {
440 need = can_add - have_fuel_for;
442 d *= (double)lp->lnd_fuelu;
443 d /= (double)fuel_mult;
445 if ((d - (int)d) > 0.0)
448 newfuel = supply_commod(lp->lnd_own, lp->lnd_x,
449 lp->lnd_y, I_PETROL, need);
450 lp->lnd_fuel += (u_char)(newfuel * 5);
453 have_fuel_for = (lp->lnd_fuel / lp->lnd_fuelu) * fuel_mult;
455 if (can_add > have_fuel_for) {
457 need = can_add - have_fuel_for;
459 d *= (double)lp->lnd_fuelu;
460 d /= (double)fuel_mult;
462 if ((d - (int)d) > 0.0)
465 newfuel = supply_commod(lp->lnd_own, lp->lnd_x,
466 lp->lnd_y, I_OIL, need);
467 lp->lnd_fuel += (u_char)(newfuel * 50);
470 have_fuel_for = (lp->lnd_fuel / lp->lnd_fuelu) * fuel_mult;
472 if (can_add > have_fuel_for) {
473 total_add = have_fuel_for;
476 d = (double)total_add;
477 d *= (double)lp->lnd_fuelu;
478 d /= (double)fuel_mult;
479 lp->lnd_fuel -= (u_char)ldround(d, 1);
480 lp->lnd_fuel = (u_char)min(lp->lnd_fuel, lp->lnd_fuelc);
481 if (total_add + lp->lnd_mobil > land_mob_max) {
482 total_add = land_mob_max - lp->lnd_mobil;
484 /* no automatic fortification here, as it would cost fuel */
486 lp->lnd_mobil += (s_char)total_add;
498 for (n = 0; NULL != (pp = getplanep(n)); n++) {
499 pp->pln_timestamp = now;
503 do_mob_plane(pp, etus);
508 do_mob_plane(struct plnstr *pp, int etus)
512 if (pp->pln_own == 0)
514 if (pp->pln_mobil >= plane_mob_max) {
515 pp->pln_mobil = plane_mob_max;
519 value = pp->pln_mobil + ((float)etus * plane_mob_scale);
520 if (value > plane_mob_max)
521 value = plane_mob_max;
522 pp->pln_mobil = value;