Cargo lists storing lists of cargo for each carrier
Persistent game state encodes "who carries what" by storing the carrier uid in the cargo. Cargo lists augment that: they store lists of cargo for each carrier. They are not persistent. New unit_cargo_init() to compute the cargo lists from game state. Call it in ef_init_srv() and at the end of update_main(). New unit_onresize() to resize the cargo list data structure. Installed as units' struct empfile callback onresize to make them resize automatically with the unit files. New unit_carrier_change() to update cargo lists when carriers change in game state. Convenience wrappers pln_carrier_change(), lnd_carrier_change() and nuk_carrier_change(). Call them from prewrite callbacks to keep cargo lists in sync with game state. To make that work, unused units must not point to a carrier. Add new pln_oninit(), lnd_oninit() and nuk_oninit() take care of newly created units. Change lnd_prewrite() and nuk_prewrite() to take dead land units and nukes off their carrier. pln_prewrite() did that already. New unit_cargo_first(), unit_cargo_next() to traverse cargo lists. Convenience wrappers lnd_first_on_ship(), lnd_first_on_land(), lnd_next_on_unit(), pln_first_on_ship(), pln_first_on_land(), pln_next_on_unit() and nuk_on_plane(). The latter is disabled for now because it clashes with an existing function.
This commit is contained in:
parent
f21cb48f69
commit
64a53c90f0
11 changed files with 478 additions and 10 deletions
391
src/lib/common/cargo.c
Normal file
391
src/lib/common/cargo.c
Normal file
|
|
@ -0,0 +1,391 @@
|
|||
/*
|
||||
* Empire - A multi-player, client/server Internet based war game.
|
||||
* Copyright (C) 1986-2008, Dave Pare, Jeff Bailey, Thomas Ruschak,
|
||||
* Ken Stevens, Steve McClure
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
*
|
||||
* ---
|
||||
*
|
||||
* See files README, COPYING and CREDITS in the root of the source
|
||||
* tree for related information and legal notices. It is expected
|
||||
* that future projects/authors will amend these files as needed.
|
||||
*
|
||||
* ---
|
||||
*
|
||||
* cargo.c: Cargo lists
|
||||
*
|
||||
* Known contributors to this file:
|
||||
* Markus Armbruster, 2008
|
||||
*/
|
||||
|
||||
#include <config.h>
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include "file.h"
|
||||
#include "unit.h"
|
||||
|
||||
struct clink {
|
||||
short next;
|
||||
short head[EF_NUKE - EF_PLANE + 1];
|
||||
};
|
||||
|
||||
/*
|
||||
* Cargo lists
|
||||
*
|
||||
* Persistent game state encodes "who carries what" by storing the
|
||||
* carrier uid in the cargo. Cargo lists augment that: they store
|
||||
* lists of cargo for each carrier.
|
||||
*
|
||||
* clink[TYPE] points to an array of cargo list links. The array has
|
||||
* nclink[TYPE] elements. nclink[TYPE] tracks ef_nelem(TYPE).
|
||||
* clink[TYPE][UID] is the cargo list link for unit UID of type TYPE.
|
||||
* TYPE must be a unit file type: EF_SHIP, EF_PLANE, EF_LAND or
|
||||
* EF_NUKE. Other slots of clink[] and nclink[] are unused and remain
|
||||
* zero.
|
||||
*
|
||||
* clink[TYPE][UID].next is the uid of the next unit of the same type
|
||||
* in the same carrier, -1 if none.
|
||||
*
|
||||
* clink[TYPE][UID].head[CARGO-EF_PLANE] is the uid of the first unit
|
||||
* of type CARGO carried by this unit, -1 if none. The next unit, if
|
||||
* any, is clink[CARGO][clink[TYPE][UID].head[CARGO-EF_PLANE]].next,
|
||||
* and so forth.
|
||||
*
|
||||
* Each type of carrier can only carry certain types of cargo, but
|
||||
* cargo lists know nothing about that.
|
||||
*/
|
||||
static struct clink *clink[EF_NUKE + 1];
|
||||
static short nclink[EF_NUKE + 1];
|
||||
|
||||
/*
|
||||
* Return pointer to CL's cargo list head for file type TYPE.
|
||||
*/
|
||||
static short *
|
||||
clink_headp(struct clink *cl, int type)
|
||||
{
|
||||
static short dummy;
|
||||
|
||||
if (CANT_HAPPEN(type < EF_PLANE || type > EF_NUKE)) {
|
||||
dummy = -1;
|
||||
return &dummy;
|
||||
}
|
||||
return &cl->head[type - EF_PLANE];
|
||||
}
|
||||
|
||||
/*
|
||||
* Initialize cargo list link CL to empty.
|
||||
*/
|
||||
static void
|
||||
clink_init(struct clink *cl)
|
||||
{
|
||||
unsigned i;
|
||||
|
||||
cl->next = -1;
|
||||
for (i = 0; i < sizeof(cl->head) / sizeof(*cl->head); i++)
|
||||
cl->head[i] = -1;
|
||||
}
|
||||
|
||||
/*
|
||||
* Check whether *UIDP is a valid uid for file type TYPE.
|
||||
*/
|
||||
static void
|
||||
clink_check1(short *uidp, int type)
|
||||
{
|
||||
if (CANT_HAPPEN(*uidp >= nclink[type]))
|
||||
*uidp = -1;
|
||||
}
|
||||
|
||||
/*
|
||||
* Check validity of cargo lists for file type TYPE.
|
||||
*/
|
||||
static void
|
||||
clink_check(int type)
|
||||
{
|
||||
int carr_type, i;
|
||||
|
||||
/* check the heads for all carriers */
|
||||
if (type != EF_SHIP) {
|
||||
for (carr_type = EF_PLANE; carr_type <= EF_NUKE; carr_type++) {
|
||||
for (i = 0; i < nclink[carr_type]; i++)
|
||||
clink_check1(clink_headp(&clink[carr_type][i], type),
|
||||
type);
|
||||
}
|
||||
}
|
||||
/* check the nexts */
|
||||
for (i = 0; i < nclink[type]; i++)
|
||||
clink_check1(&clink[type][i].next, type);
|
||||
}
|
||||
|
||||
/*
|
||||
* Add to CL's cargo list for type TYPE the uid UID.
|
||||
* UID must not be on any cargo list already.
|
||||
*/
|
||||
static void
|
||||
clink_add(struct clink *cl, int type, int uid)
|
||||
{
|
||||
short *head = clink_headp(cl, type);
|
||||
|
||||
if (CANT_HAPPEN(type < 0 || type > EF_NUKE
|
||||
|| uid < 0 || uid >= nclink[type]))
|
||||
return;
|
||||
if (CANT_HAPPEN(*head >= nclink[type]))
|
||||
*head = -1;
|
||||
clink[type][uid].next = *head;
|
||||
*head = uid;
|
||||
}
|
||||
|
||||
/*
|
||||
* Remove from CL's cargo list for type TYPE the uid UID.
|
||||
* UID must be on that cargo list.
|
||||
*/
|
||||
static void
|
||||
clink_rem(struct clink *cl, int type, int uid)
|
||||
{
|
||||
short *head = clink_headp(cl, type);
|
||||
struct clink *linkv;
|
||||
int n;
|
||||
short *p;
|
||||
|
||||
if (CANT_HAPPEN(type < 0 || type > EF_NUKE))
|
||||
return;
|
||||
linkv = clink[type];
|
||||
n = nclink[type];
|
||||
|
||||
for (p = head; *p != uid; p = &linkv[*p].next) {
|
||||
if (CANT_HAPPEN(*p < 0 || *p >= n))
|
||||
return;
|
||||
}
|
||||
|
||||
*p = linkv[uid].next;
|
||||
}
|
||||
|
||||
/*
|
||||
* Update cargo lists for a change of CARGO's carrier.
|
||||
* Carrier is of type TYPE, and changes from uid OLD to NEW.
|
||||
* Negative uids mean no carrier.
|
||||
*/
|
||||
void
|
||||
unit_carrier_change(struct empobj *cargo, int type, int old, int new)
|
||||
{
|
||||
if (CANT_HAPPEN(type < 0 || type > EF_NUKE))
|
||||
return;
|
||||
if (old >= 0)
|
||||
clink_rem(&clink[type][old], cargo->ef_type, cargo->uid);
|
||||
if (new >= 0)
|
||||
clink_add(&clink[type][new], cargo->ef_type, cargo->uid);
|
||||
}
|
||||
|
||||
/*
|
||||
* Update cargo lists for a change of PP's carrier.
|
||||
* Carrier is of type TYPE, and changes from uid OLD to NEW.
|
||||
* Negative uids mean no carrier.
|
||||
*/
|
||||
void
|
||||
pln_carrier_change(struct plnstr *pp, int type, int old, int new)
|
||||
{
|
||||
unit_carrier_change((struct empobj *)pp, type, old, new);
|
||||
}
|
||||
|
||||
/*
|
||||
* Update cargo lists for a change of LP's carrier.
|
||||
* Carrier is of type TYPE, and changes from uid OLD to NEW.
|
||||
* Negative uids mean no carrier.
|
||||
*/
|
||||
void
|
||||
lnd_carrier_change(struct lndstr *lp, int type, int old, int new)
|
||||
{
|
||||
unit_carrier_change((struct empobj *)lp, type, old, new);
|
||||
}
|
||||
|
||||
/*
|
||||
* Update cargo lists for a change of NP's carrier.
|
||||
* Carrier is of type TYPE, and changes from uid OLD to NEW.
|
||||
* Negative uids mean no carrier.
|
||||
*/
|
||||
void
|
||||
nuk_carrier_change(struct nukstr *np, int type, int old, int new)
|
||||
{
|
||||
unit_carrier_change((struct empobj *)np, type, old, new);
|
||||
}
|
||||
|
||||
/*
|
||||
* Initialize cargo lists from game state.
|
||||
*/
|
||||
void
|
||||
unit_cargo_init(void)
|
||||
{
|
||||
int i;
|
||||
struct plnstr *pp;
|
||||
struct lndstr *lp;
|
||||
struct nukstr *np;
|
||||
|
||||
for (i = EF_SHIP; i <= EF_NUKE; i++) {
|
||||
nclink[i] = 0;
|
||||
unit_onresize(i);
|
||||
}
|
||||
|
||||
for (i = 0; (pp = getplanep(i)); i++) {
|
||||
if (!pp->pln_own)
|
||||
continue;
|
||||
if (CANT_HAPPEN(pp->pln_ship >= 0 && pp->pln_land >= 0))
|
||||
pp->pln_land = -1;
|
||||
pln_carrier_change(pp, EF_SHIP, -1, pp->pln_ship);
|
||||
pln_carrier_change(pp, EF_LAND, -1, pp->pln_land);
|
||||
}
|
||||
for (i = 0; (lp = getlandp(i)); i++) {
|
||||
if (!lp->lnd_own)
|
||||
continue;
|
||||
if (CANT_HAPPEN(lp->lnd_ship >= 0 && lp->lnd_land >= 0))
|
||||
lp->lnd_land = -1;
|
||||
lnd_carrier_change(lp, EF_SHIP, -1, lp->lnd_ship);
|
||||
lnd_carrier_change(lp, EF_LAND, -1, lp->lnd_land);
|
||||
}
|
||||
for (i = 0; (np = getnukep(i)); i++) {
|
||||
if (!np->nuk_own)
|
||||
continue;
|
||||
nuk_carrier_change(np, EF_PLANE, -1, np->nuk_plane);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Resize clink[TYPE] to match ef_nelem(TYPE).
|
||||
* Return 0 on success, -1 on error.
|
||||
* This is the struct empfile onresize callback for units.
|
||||
*/
|
||||
int
|
||||
unit_onresize(int type)
|
||||
{
|
||||
int n, i;
|
||||
struct clink *cl;
|
||||
|
||||
if (CANT_HAPPEN(type < EF_SHIP || type > EF_NUKE))
|
||||
return -1;
|
||||
|
||||
n = ef_nelem(type);
|
||||
cl = realloc(clink[type], n * sizeof(*clink[type]));
|
||||
if (!cl)
|
||||
return -1;
|
||||
for (i = nclink[type]; i < n; i++)
|
||||
clink_init(&cl[i]);
|
||||
clink[type] = cl;
|
||||
nclink[type] = n;
|
||||
clink_check(type);
|
||||
return 0;
|
||||
}
|
||||
|
||||
/*
|
||||
* Find first unit on a carrier's cargo list for file type CARGO_TYPE.
|
||||
* Search carrier UID of type TYPE.
|
||||
* Return first unit's uid, or -1 if the carrier isn't carrying such
|
||||
* units.
|
||||
*/
|
||||
int
|
||||
unit_cargo_first(int type, int uid, int cargo_type)
|
||||
{
|
||||
short *headp;
|
||||
|
||||
if (CANT_HAPPEN(type < EF_SHIP || type > EF_NUKE))
|
||||
return -1;
|
||||
if (CANT_HAPPEN(uid < 0 || uid >= nclink[type]))
|
||||
return -1;
|
||||
headp = clink_headp(&clink[type][uid], cargo_type);
|
||||
if (CANT_HAPPEN(!headp))
|
||||
return -1;
|
||||
return *headp;
|
||||
}
|
||||
|
||||
/*
|
||||
* Find the next unit on a cargo list for file type CARGO_TYPE.
|
||||
* Get the unit after CARGO_UID.
|
||||
* Return its uid, or -1 if there are no more on this list.
|
||||
*/
|
||||
int
|
||||
unit_cargo_next(int cargo_type, int cargo_uid)
|
||||
{
|
||||
if (CANT_HAPPEN(cargo_type < EF_SHIP || cargo_type > EF_NUKE))
|
||||
return -1;
|
||||
if (CANT_HAPPEN(cargo_uid < 0 || cargo_uid >= nclink[cargo_type]))
|
||||
return -1;
|
||||
return clink[cargo_type][cargo_uid].next;
|
||||
}
|
||||
|
||||
/*
|
||||
* If SP carries planes, return the uid of the first one, else -1.
|
||||
*/
|
||||
int
|
||||
pln_first_on_ship(struct shpstr *sp)
|
||||
{
|
||||
return unit_cargo_first(EF_SHIP, sp->shp_uid, EF_PLANE);
|
||||
}
|
||||
|
||||
/*
|
||||
* If LP carries planes, return the uid of the first one, else -1.
|
||||
*/
|
||||
int
|
||||
pln_first_on_land(struct lndstr *lp)
|
||||
{
|
||||
return unit_cargo_first(EF_LAND, lp->lnd_uid, EF_PLANE);
|
||||
}
|
||||
|
||||
/*
|
||||
* Find the next plane on the same carrier as plane#UID.
|
||||
* Return its uid, or -1 if there are no more.
|
||||
*/
|
||||
int
|
||||
pln_next_on_unit(int uid)
|
||||
{
|
||||
return unit_cargo_next(EF_PLANE, uid);
|
||||
}
|
||||
|
||||
/*
|
||||
* If SP carries land units, return the uid of the first one, else -1.
|
||||
*/
|
||||
int
|
||||
lnd_first_on_ship(struct shpstr *sp)
|
||||
{
|
||||
return unit_cargo_first(EF_SHIP, sp->shp_uid, EF_LAND);
|
||||
}
|
||||
|
||||
/*
|
||||
* If SP carries land units, return the uid of the first one, else -1.
|
||||
*/
|
||||
int
|
||||
lnd_first_on_land(struct lndstr *lp)
|
||||
{
|
||||
return unit_cargo_first(EF_LAND, lp->lnd_uid, EF_LAND);
|
||||
}
|
||||
|
||||
/*
|
||||
* Find the next land unit on the same carrier as land#UID.
|
||||
* Return its uid, or -1 if there are no more.
|
||||
*/
|
||||
int
|
||||
lnd_next_on_unit(int uid)
|
||||
{
|
||||
return unit_cargo_next(EF_LAND, uid);
|
||||
}
|
||||
|
||||
#if 0 /* clashes with the one in src/lib/subs/nuke.c */
|
||||
/*
|
||||
* If PP carries a nuke, return its uid, else -1.
|
||||
*/
|
||||
int
|
||||
nuk_on_plane(struct plnstr *pp)
|
||||
{
|
||||
return unit_cargo_first(EF_PLANE, pp->pln_uid, EF_NUKE);
|
||||
}
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue