1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258
|
/*
* Copyright (C) 1987, 1988 Chuck Simmons
*
* See the file COPYING, distributed with empire, for restriction
* and warranty information.
*/
/*
util.c -- various utility routines.
*/
#include <stdio.h>
#include <stdlib.h>
#include <curses.h> /* Ugh...shouldn't be needed here */
#include <signal.h>
#include <sys/types.h>
#include <unistd.h>
#include "empire.h"
#include "extern.h"
/*
Report a bug.
*/
void
assert(char *expression, char *file, int line)
{
char buf[STRSIZE];
(void) move (lines, 0);
close_disp ();
(void) sprintf (buf, "assert failed: file %s line %d: %s",
file, line, expression);
kill(getpid(), SIGSEGV); /* core dump */
}
/*
End the game by cleaning up the display.
*/
void
empend(void)
{
close_disp ();
exit (0);
}
/*
Here is a little routine to perform consistency checking on the
database. I'm finding that my database is becoming inconsistent,
and I've no idea why. Possibly this will help.
We perform the following functions:
1) Make sure no list contains loops.
2) Make sure every object is in either the free list with 0 hits,
or it is in the correct object list and a location list with non-zero hits,
and an appropriate owner.
3) Make sure every city is on the map.
4) Make sure every object is in the correct location and that
objects on the map have non-zero hits.
5) Make sure every object in a cargo list has a ship pointer.
6) Make sure every object with a ship pointer is in that ship's
cargo list.
*/
static bool in_free[LIST_SIZE]; /* true if object in free list */
static bool in_obj[LIST_SIZE]; /* true if object in obj list */
static bool in_loc[LIST_SIZE]; /* true if object in a loc list */
static bool in_cargo[LIST_SIZE]; /* true if object in a cargo list */
void
check(void)
{
void check_cargo(piece_info_t *, int);
void check_obj(piece_info_t **, int);
void check_obj_cargo(piece_info_t **);
long i, j;
piece_info_t *p;
/* nothing in any list yet */
for (i = 0; i < LIST_SIZE; i++) {
in_free[i] = 0;
in_obj[i] = 0;
in_loc[i] = 0;
in_cargo[i] = 0;
}
/* Mark all objects in free list. Make sure objects in free list
have zero hits. */
for (p = free_list; p != NULL; p = p->piece_link.next) {
i = p - object;
ASSERT (!in_free[i]);
in_free[i] = 1;
ASSERT (p->hits == 0);
if (p->piece_link.prev)
ASSERT (p->piece_link.prev->piece_link.next == p);
}
/* Mark all objects in the map.
Check that cities are in corect location.
Check that objects are in correct location,
have a good owner, and good hits. */
for (i = 0; i < MAP_SIZE; i++) {
if (map[i].cityp) ASSERT (map[i].cityp->loc == i);
for (p = map[i].objp; p != NULL; p = p->loc_link.next) {
ASSERT (p->loc == i);
ASSERT (p->hits > 0);
ASSERT (p->owner == USER || p->owner == COMP);
j = p - object;
ASSERT (!in_loc[j]);
in_loc[j] = 1;
if (p->loc_link.prev)
ASSERT (p->loc_link.prev->loc_link.next == p);
}
}
/* make sure all cities are on map */
for (i = 0; i < NUM_CITY; i++)
ASSERT (map[city[i].loc].cityp == &(city[i]));
/* Scan object lists. */
check_obj (comp_obj, COMP);
check_obj (user_obj, USER);
/* Scan cargo lists. */
check_cargo (user_obj[TRANSPORT], ARMY);
check_cargo (comp_obj[TRANSPORT], ARMY);
check_cargo (user_obj[CARRIER], FIGHTER);
check_cargo (comp_obj[CARRIER], FIGHTER);
/* Make sure all objects with ship pointers are in cargo. */
check_obj_cargo (comp_obj);
check_obj_cargo (user_obj);
/* Make sure every object is either free or in loc and obj list. */
for (i = 0; i < LIST_SIZE; i++)
ASSERT (in_free[i] != (in_loc[i] && in_obj[i]));
}
/*
Check object lists. We look for:
1) Loops and bad prev pointers.
2) Dead objects.
3) Invalid types.
4) Invalid owners.
*/
void
check_obj(piece_info_t **list, int owner)
{
long i, j;
piece_info_t *p;
for (i = 0; i < NUM_OBJECTS; i++)
for (p = list[i]; p != NULL; p = p->piece_link.next) {
ASSERT (p->owner == owner);
ASSERT (p->type == i);
ASSERT (p->hits > 0);
j = p - object;
ASSERT (!in_obj[j]);
in_obj[j] = 1;
if (p->piece_link.prev)
ASSERT (p->piece_link.prev->piece_link.next == p);
}
}
/*
Check cargo lists. We assume object lists are valid.
as we will place bits in the 'in_cargo' array that are used by
'check_obj'.
Check for:
1) Number of items in list is same as cargo count.
2) Type of cargo is correct.
3) Location of cargo matches location of ship.
4) Ship pointer of cargo points to correct ship.
5) There are no loops in cargo list and prev ptrs are correct.
6) All cargo is alive.
*/
void
check_cargo(piece_info_t *list, int cargo_type)
{
piece_info_t *p, *q;
long j;
for (p = list; p != NULL; p = p->piece_link.next) {
long count = 0;
for (q = p->cargo; q != NULL; q = q->cargo_link.next) {
count += 1; /* count items in list */
ASSERT (q->type == cargo_type);
ASSERT (q->owner == p->owner);
ASSERT (q->hits > 0);
ASSERT (q->ship == p);
ASSERT (q->loc == p->loc);
j = q - object;
ASSERT (!in_cargo[j]);
in_cargo[j] = 1;
if (p->cargo_link.prev)
ASSERT (p->cargo_link.prev->cargo_link.next == p);
}
ASSERT (count == p->count);
}
}
/*
Scan through object lists making sure every object with a ship
pointer appears in a cargo list. We assume object and cargo
lists are valid.
*/
void
check_obj_cargo(piece_info_t **list)
{
piece_info_t *p;
long i;
for (i = 0; i < NUM_OBJECTS; i++)
for (p = list[i]; p != NULL; p = p->piece_link.next) {
if (p->ship) ASSERT (in_cargo[p-object]);
}
}
/* end */
|