ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/map.C
(Generate patch)

Comparing deliantra/server/common/map.C (file contents):
Revision 1.15 by root, Wed Aug 30 08:28:32 2006 UTC vs.
Revision 1.30 by root, Thu Sep 14 22:33:59 2006 UTC

1/*
2 * static char *rcsid_map_c =
3 * "$Id: map.C,v 1.15 2006/08/30 08:28:32 root Exp $";
4 */
5
6/* 1/*
7 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
8 3
9 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
… …
21 16
22 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 20
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
27*/ 22*/
28 23
29 24
30#include <global.h> 25#include <global.h>
31#include <funcpoint.h> 26#include <funcpoint.h>
32 27
33#include <loader.h> 28#include <loader.h>
34#ifndef WIN32 /* ---win32 exclude header */ 29#ifndef WIN32 /* ---win32 exclude header */
35#include <unistd.h> 30# include <unistd.h>
36#endif /* win32 */ 31#endif /* win32 */
37 32
38#include "path.h" 33#include "path.h"
39 34
40 35
41extern int nrofallocobjects,nroffreeobjects; 36extern int nrofallocobjects, nroffreeobjects;
42 37
43/* 38/*
44 * Returns the mapstruct which has a name matching the given argument. 39 * Returns the mapstruct which has a name matching the given argument.
45 * return NULL if no match is found. 40 * return NULL if no match is found.
46 */ 41 */
47 42
43mapstruct *
48mapstruct *has_been_loaded (const char *name) { 44has_been_loaded (const char *name)
45{
49 mapstruct *map; 46 mapstruct *map;
50 47
51 if (!name || !*name) 48 if (!name || !*name)
52 return 0; 49 return 0;
53 for (map = first_map; map; map = map->next) 50 for (map = first_map; map; map = map->next)
54 if (!strcmp (name, map->path)) 51 if (!strcmp (name, map->path))
55 break; 52 break;
56 return (map); 53 return (map);
57} 54}
58 55
59/* 56/*
60 * This makes a path absolute outside the world of Crossfire. 57 * This makes a path absolute outside the world of Crossfire.
61 * In other words, it prepends LIBDIR/MAPDIR/ to the given path 58 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
62 * and returns the pointer to a static array containing the result. 59 * and returns the pointer to a static array containing the result.
63 * it really should be called create_mapname 60 * it really should be called create_mapname
64 */ 61 */
65 62
63const char *
66const char *create_pathname (const char *name) { 64create_pathname (const char *name)
65{
67 static char buf[MAX_BUF]; 66 static char buf[MAX_BUF];
68 67
69 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 68 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
70 * someplace else in the code? msw 2-17-97 69 * someplace else in the code? msw 2-17-97
71 */ 70 */
72 if (*name == '/') 71 if (*name == '/')
73 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name); 72 sprintf (buf, "%s/%s%s", settings.datadir, settings.mapdir, name);
74 else 73 else
75 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name); 74 sprintf (buf, "%s/%s/%s", settings.datadir, settings.mapdir, name);
76 return (buf); 75 return (buf);
77} 76}
78 77
79/* 78/*
80 * same as create_pathname, but for the overlay maps. 79 * same as create_pathname, but for the overlay maps.
81 */ 80 */
82 81
82const char *
83const char *create_overlay_pathname (const char *name) { 83create_overlay_pathname (const char *name)
84{
84 static char buf[MAX_BUF]; 85 static char buf[MAX_BUF];
85 86
86 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 87 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
87 * someplace else in the code? msw 2-17-97 88 * someplace else in the code? msw 2-17-97
88 */ 89 */
89 if (*name == '/') 90 if (*name == '/')
90 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name); 91 sprintf (buf, "%s/%s%s", settings.localdir, settings.mapdir, name);
91 else 92 else
92 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name); 93 sprintf (buf, "%s/%s/%s", settings.localdir, settings.mapdir, name);
93 return (buf); 94 return (buf);
94} 95}
95 96
96/* 97/*
97 * same as create_pathname, but for the template maps. 98 * same as create_pathname, but for the template maps.
98 */ 99 */
99 100
101const char *
100const char *create_template_pathname (const char *name) { 102create_template_pathname (const char *name)
103{
101 static char buf[MAX_BUF]; 104 static char buf[MAX_BUF];
102 105
103 /* Why? having extra / doesn't confuse unix anyplace? Dependancies 106 /* Why? having extra / doesn't confuse unix anyplace? Dependancies
104 * someplace else in the code? msw 2-17-97 107 * someplace else in the code? msw 2-17-97
105 */ 108 */
106 if (*name == '/') 109 if (*name == '/')
107 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name); 110 sprintf (buf, "%s/%s%s", settings.localdir, settings.templatedir, name);
108 else 111 else
109 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name); 112 sprintf (buf, "%s/%s/%s", settings.localdir, settings.templatedir, name);
110 return (buf); 113 return (buf);
111} 114}
112 115
113/* 116/*
114 * This makes absolute path to the itemfile where unique objects 117 * This makes absolute path to the itemfile where unique objects
115 * will be saved. Converts '/' to '@'. I think it's essier maintain 118 * will be saved. Converts '/' to '@'. I think it's essier maintain
116 * files than full directory structure, but if this is problem it can 119 * files than full directory structure, but if this is problem it can
117 * be changed. 120 * be changed.
118 */ 121 */
122static const char *
119static const char *create_items_path (const char *s) { 123create_items_path (const char *s)
124{
120 static char buf[MAX_BUF]; 125 static char buf[MAX_BUF];
121 char *t; 126 char *t;
122 127
128 if (*s == '/')
129 s++;
130
131 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
132
133 for (t = buf + strlen (buf); *s; s++, t++)
123 if (*s == '/') 134 if (*s == '/')
124 s++;
125
126 sprintf (buf, "%s/%s/", settings.localdir, settings.uniquedir);
127
128 for (t=buf+strlen(buf); *s; s++,t++)
129 if (*s == '/')
130 *t = '@'; 135 *t = '@';
131 else 136 else
132 *t = *s; 137 *t = *s;
133 *t = 0; 138 *t = 0;
134 return (buf); 139 return (buf);
135} 140}
136 141
137 142
138/* 143/*
139 * This function checks if a file with the given path exists. 144 * This function checks if a file with the given path exists.
… …
149 * when the editor goes away, the call to stat should probably be 154 * when the editor goes away, the call to stat should probably be
150 * replaced by an access instead (similar to the windows one, but 155 * replaced by an access instead (similar to the windows one, but
151 * that seems to be missing the prepend_dir processing 156 * that seems to be missing the prepend_dir processing
152 */ 157 */
153 158
159int
154int check_path (const char *name, int prepend_dir) 160check_path (const char *name, int prepend_dir)
155{ 161{
156 char buf[MAX_BUF]; 162 char buf[MAX_BUF];
163
157#ifndef WIN32 164#ifndef WIN32
158 char *endbuf; 165 char *endbuf;
159 struct stat statbuf; 166 struct stat statbuf;
160 int mode = 0, i; 167 int mode = 0;
161#endif 168#endif
162 169
163 if (prepend_dir) 170 if (prepend_dir)
164 strcpy (buf, create_pathname(name)); 171 strcpy (buf, create_pathname (name));
165 else 172 else
166 strcpy(buf, name); 173 strcpy (buf, name);
167#ifdef WIN32 /* ***win32: check this sucker in windows style. */ 174#ifdef WIN32 /* ***win32: check this sucker in windows style. */
168 return(_access(buf,0)); 175 return (_access (buf, 0));
169#else 176#else
170 177
171 /* old method (strchr(buf, '\0')) seemd very odd to me - 178 /* old method (strchr(buf, '\0')) seemd very odd to me -
172 * this method should be equivalant and is clearer. 179 * this method should be equivalant and is clearer.
173 * Can not use strcat because we need to cycle through 180 * Can not use strcat because we need to cycle through
174 * all the names. 181 * all the names.
175 */ 182 */
176 endbuf = buf + strlen(buf); 183 endbuf = buf + strlen (buf);
177 184
178 for (i = 0; i < NROF_COMPRESS_METHODS; i++) {
179 if (uncomp[i][0])
180 strcpy(endbuf, uncomp[i][0]);
181 else
182 *endbuf = '\0';
183 if (!stat (buf, &statbuf)) 185 if (stat (buf, &statbuf))
184 break;
185 }
186 if (i == NROF_COMPRESS_METHODS)
187 return (-1); 186 return -1;
188 if (!S_ISREG (statbuf.st_mode)) 187 if (!S_ISREG (statbuf.st_mode))
189 return (-1); 188 return (-1);
190 189
191 if (((statbuf.st_mode & S_IRGRP) && getegid() == statbuf.st_gid) || 190 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
192 ((statbuf.st_mode & S_IRUSR) && geteuid() == statbuf.st_uid) || 191 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
193 (statbuf.st_mode & S_IROTH))
194 mode |= 4; 192 mode |= 4;
195 193
196 if ((statbuf.st_mode & S_IWGRP && getegid() == statbuf.st_gid) || 194 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
197 (statbuf.st_mode & S_IWUSR && geteuid() == statbuf.st_uid) || 195 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
198 (statbuf.st_mode & S_IWOTH))
199 mode |= 2; 196 mode |= 2;
200 197
201 return (mode); 198 return (mode);
202#endif 199#endif
203} 200}
204 201
205/* 202/*
206 * Prints out debug-information about a map. 203 * Prints out debug-information about a map.
207 * Dumping these at llevError doesn't seem right, but is 204 * Dumping these at llevError doesn't seem right, but is
208 * necessary to make sure the information is in fact logged. 205 * necessary to make sure the information is in fact logged.
209 */ 206 */
210 207
208void
211void dump_map(const mapstruct *m) { 209dump_map (const mapstruct *m)
210{
212 LOG(llevError,"Map %s status: %d.\n",m->path,m->in_memory); 211 LOG (llevError, "Map %s status: %d.\n", m->path, m->in_memory);
213 LOG(llevError,"Size: %dx%d Start: %d,%d\n", 212 LOG (llevError, "Size: %dx%d Start: %d,%d\n", MAP_WIDTH (m), MAP_HEIGHT (m), MAP_ENTER_X (m), MAP_ENTER_Y (m));
214 MAP_WIDTH(m), MAP_HEIGHT(m),
215 MAP_ENTER_X(m), MAP_ENTER_Y(m));
216 213
217 if(m->msg!=NULL) 214 if (m->msg != NULL)
218 LOG(llevError,"Message:\n%s",m->msg); 215 LOG (llevError, "Message:\n%s", m->msg);
219 216
220 if(m->maplore!=NULL) 217 if (m->maplore != NULL)
221 LOG(llevError,"Lore:\n%s",m->maplore); 218 LOG (llevError, "Lore:\n%s", m->maplore);
222 219
223 if(m->tmpname!=NULL) 220 if (m->tmpname != NULL)
224 LOG(llevError,"Tmpname: %s\n",m->tmpname); 221 LOG (llevError, "Tmpname: %s\n", m->tmpname);
225 222
226 LOG(llevError,"Difficulty: %d\n",m->difficulty); 223 LOG (llevError, "Difficulty: %d\n", m->difficulty);
227 LOG(llevError,"Darkness: %d\n",m->darkness); 224 LOG (llevError, "Darkness: %d\n", m->darkness);
228} 225}
229 226
230/* 227/*
231 * Prints out debug-information about all maps. 228 * Prints out debug-information about all maps.
232 * This basically just goes through all the maps and calls 229 * This basically just goes through all the maps and calls
233 * dump_map on each one. 230 * dump_map on each one.
234 */ 231 */
235 232
233void
236void dump_all_maps(void) { 234dump_all_maps (void)
235{
237 mapstruct *m; 236 mapstruct *m;
237
238 for(m=first_map;m!=NULL;m=m->next) { 238 for (m = first_map; m != NULL; m = m->next)
239 {
239 dump_map(m); 240 dump_map (m);
240 } 241 }
241} 242}
242 243
243/* This rolls up wall, blocks_magic, blocks_view, etc, all into 244/* This rolls up wall, blocks_magic, blocks_view, etc, all into
244 * one function that just returns a P_.. value (see map.h) 245 * one function that just returns a P_.. value (see map.h)
245 * it will also do map translation for tiled maps, returning 246 * it will also do map translation for tiled maps, returning
… …
248 * by a P_NEW_MAP value, another call to get_map_from_coord 249 * by a P_NEW_MAP value, another call to get_map_from_coord
249 * is needed. The case of not passing values is if we're just 250 * is needed. The case of not passing values is if we're just
250 * checking for the existence of something on those spaces, but 251 * checking for the existence of something on those spaces, but
251 * don't expect to insert/remove anything from those spaces. 252 * don't expect to insert/remove anything from those spaces.
252 */ 253 */
254int
253int get_map_flags(mapstruct *oldmap, mapstruct **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny) 255get_map_flags (mapstruct *oldmap, mapstruct **newmap, sint16 x, sint16 y, sint16 * nx, sint16 * ny)
254{ 256{
255 sint16 newx, newy; 257 sint16 newx, newy;
256 int retval=0; 258 int retval = 0;
257 mapstruct *mp; 259 mapstruct *mp;
258 260
259 if (out_of_map(oldmap, x, y)) return P_OUT_OF_MAP; 261 if (out_of_map (oldmap, x, y))
262 return P_OUT_OF_MAP;
260 newx = x; 263 newx = x;
261 newy = y; 264 newy = y;
262 mp = get_map_from_coord(oldmap, &newx, &newy); 265 mp = get_map_from_coord (oldmap, &newx, &newy);
263 if (mp != oldmap) 266 if (mp != oldmap)
264 retval |= P_NEW_MAP; 267 retval |= P_NEW_MAP;
265 if (newmap) *newmap = mp; 268 if (newmap)
269 *newmap = mp;
270 if (nx)
266 if (nx) *nx = newx; 271 *nx = newx;
272 if (ny)
267 if (ny) *ny = newy; 273 *ny = newy;
274
268 retval |= mp->spaces[newx + mp->width * newy].flags; 275 retval |= mp->spaces[newx + mp->width * newy].flags;
269 276
270 if (retval & P_SAFE)
271 retval |= P_NO_MAGIC | P_NO_CLERIC; // P_SAFE does imply these
272
273 return retval; 277 return retval;
274} 278}
275 279
276 280
277/* 281/*
278 * Returns true if the given coordinate is blocked except by the 282 * Returns true if the given coordinate is blocked except by the
… …
285 * m, x, y are the target map/coordinates - needed for map tiling. 289 * m, x, y are the target map/coordinates - needed for map tiling.
286 * the coordinates & map passed in should have been updated for tiling 290 * the coordinates & map passed in should have been updated for tiling
287 * by the caller. 291 * by the caller.
288 */ 292 */
289 293
294int
290int blocked_link(object *ob, mapstruct *m, int sx, int sy) { 295blocked_link (object *ob, mapstruct *m, int sx, int sy)
296{
291 object *tmp; 297 object *tmp;
292 int mflags, blocked; 298 int mflags, blocked;
293 299
294 /* Make sure the coordinates are valid - they should be, as caller should 300 /* Make sure the coordinates are valid - they should be, as caller should
295 * have already checked this. 301 * have already checked this.
296 */ 302 */
297 if (OUT_OF_REAL_MAP(m, sx, sy)) { 303 if (OUT_OF_REAL_MAP (m, sx, sy))
304 {
298 LOG(llevError,"blocked_link: Passed map, x, y coordinates outside of map\n"); 305 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n");
299 return 1; 306 return 1;
300 } 307 }
301 308
302 /* Save some cycles - instead of calling get_map_flags(), just get the value 309 /* Save some cycles - instead of calling get_map_flags(), just get the value
303 * directly. 310 * directly.
304 */ 311 */
305 mflags = m->spaces[sx + m->width * sy].flags; 312 mflags = m->spaces[sx + m->width * sy].flags;
306 313
307 blocked = GET_MAP_MOVE_BLOCK(m, sx, sy); 314 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy);
308 315
309 /* If space is currently not blocked by anything, no need to 316 /* If space is currently not blocked by anything, no need to
310 * go further. Not true for players - all sorts of special 317 * go further. Not true for players - all sorts of special
311 * things we need to do for players. 318 * things we need to do for players.
312 */ 319 */
313 if (ob->type != PLAYER && ! (mflags & P_IS_ALIVE) && (blocked==0)) return 0; 320 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0))
321 return 0;
314 322
315 /* if there isn't anytyhing alive on this space, and this space isn't 323 /* if there isn't anytyhing alive on this space, and this space isn't
316 * otherwise blocked, we can return now. Only if there is a living 324 * otherwise blocked, we can return now. Only if there is a living
317 * creature do we need to investigate if it is part of this creature 325 * creature do we need to investigate if it is part of this creature
318 * or another. Likewise, only if something is blocking us do we 326 * or another. Likewise, only if something is blocking us do we
319 * need to investigate if there is a special circumstance that would 327 * need to investigate if there is a special circumstance that would
320 * let the player through (inventory checkers for example) 328 * let the player through (inventory checkers for example)
321 */ 329 */
322 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK(ob, blocked)) return 0; 330 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
331 return 0;
323 332
324 if(ob->head != NULL) 333 if (ob->head != NULL)
325 ob=ob->head; 334 ob = ob->head;
326 335
327 /* We basically go through the stack of objects, and if there is 336 /* We basically go through the stack of objects, and if there is
328 * some other object that has NO_PASS or FLAG_ALIVE set, return 337 * some other object that has NO_PASS or FLAG_ALIVE set, return
329 * true. If we get through the entire stack, that must mean 338 * true. If we get through the entire stack, that must mean
330 * ob is blocking it, so return 0. 339 * ob is blocking it, so return 0.
331 */ 340 */
332 for(tmp = GET_MAP_OB(m,sx,sy); tmp!= NULL; tmp = tmp->above) { 341 for (tmp = GET_MAP_OB (m, sx, sy); tmp != NULL; tmp = tmp->above)
342 {
333 343
334 /* This must be before the checks below. Code for inventory checkers. */ 344 /* This must be before the checks below. Code for inventory checkers. */
335 if (tmp->type==CHECK_INV && OB_MOVE_BLOCK(ob, tmp)) { 345 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
346 {
336 /* If last_sp is set, the player/monster needs an object, 347 /* If last_sp is set, the player/monster needs an object,
337 * so we check for it. If they don't have it, they can't 348 * so we check for it. If they don't have it, they can't
338 * pass through this space. 349 * pass through this space.
339 */ 350 */
340 if (tmp->last_sp) { 351 if (tmp->last_sp)
352 {
341 if (check_inv_recursive(ob,tmp)==NULL) 353 if (check_inv_recursive (ob, tmp) == NULL)
342 return 1; 354 return 1;
343 else 355 else
344 continue; 356 continue;
345 } else {
346 /* In this case, the player must not have the object -
347 * if they do, they can't pass through.
348 */
349 if (check_inv_recursive(ob,tmp)!=NULL) /* player has object */
350 return 1;
351 else
352 continue;
353 } 357 }
354 } /* if check_inv */
355 else { 358 else
359 {
360 /* In this case, the player must not have the object -
361 * if they do, they can't pass through.
362 */
363 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
364 return 1;
365 else
366 continue;
367 }
368 } /* if check_inv */
369 else
370 {
356 /* Broke apart a big nasty if into several here to make 371 /* Broke apart a big nasty if into several here to make
357 * this more readable. first check - if the space blocks 372 * this more readable. first check - if the space blocks
358 * movement, can't move here. 373 * movement, can't move here.
359 * second - if a monster, can't move there, unles it is a 374 * second - if a monster, can't move there, unles it is a
360 * hidden dm 375 * hidden dm
361 */ 376 */
362 if (OB_MOVE_BLOCK(ob, tmp)) return 1; 377 if (OB_MOVE_BLOCK (ob, tmp))
378 return 1;
363 if (QUERY_FLAG(tmp,FLAG_ALIVE) && tmp->head != ob && tmp != ob && 379 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob &&
364 tmp->type != DOOR && !(QUERY_FLAG(tmp,FLAG_WIZ) && tmp->contr->hidden)) 380 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden))
365 return 1; 381 return 1;
366 } 382 }
367 383
368 } 384 }
369 return 0; 385 return 0;
370} 386}
371 387
372 388
373/* 389/*
374 * Returns true if the given object can't fit in the given spot. 390 * Returns true if the given object can't fit in the given spot.
… …
395 * Note this used to be arch_blocked, but with new movement 411 * Note this used to be arch_blocked, but with new movement
396 * code, we need to have actual object to check its move_type 412 * code, we need to have actual object to check its move_type
397 * against the move_block values. 413 * against the move_block values.
398 */ 414 */
399 415
416int
400int ob_blocked(const object *ob,mapstruct *m,sint16 x,sint16 y) { 417ob_blocked (const object *ob, mapstruct *m, sint16 x, sint16 y)
418{
401 archetype *tmp; 419 archetype *tmp;
402 int flag; 420 int flag;
403 mapstruct *m1; 421 mapstruct *m1;
404 sint16 sx, sy; 422 sint16 sx, sy;
405 423
406 if(ob==NULL) { 424 if (ob == NULL)
425 {
407 flag= get_map_flags(m,&m1, x,y, &sx, &sy); 426 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
408 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 427 if (flag & P_OUT_OF_MAP)
428 return P_OUT_OF_MAP;
409 429
410 /* don't have object, so don't know what types would block */ 430 /* don't have object, so don't know what types would block */
411 return(GET_MAP_MOVE_BLOCK(m1, sx, sy)); 431 return (GET_MAP_MOVE_BLOCK (m1, sx, sy));
412 } 432 }
413 433
414 for(tmp=ob->arch; tmp!=NULL;tmp=tmp->more) { 434 for (tmp = ob->arch; tmp != NULL; tmp = tmp->more)
435 {
415 flag = get_map_flags(m, &m1, x+tmp->clone.x,y+tmp->clone.y, &sx, &sy); 436 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
416 437
417 if (flag & P_OUT_OF_MAP) return P_OUT_OF_MAP; 438 if (flag & P_OUT_OF_MAP)
418 if (flag & P_IS_ALIVE) return P_IS_ALIVE; 439 return P_OUT_OF_MAP;
440 if (flag & P_IS_ALIVE)
441 return P_IS_ALIVE;
419 442
420 /* find_first_free_spot() calls this function. However, often 443 /* find_first_free_spot() calls this function. However, often
421 * ob doesn't have any move type (when used to place exits) 444 * ob doesn't have any move type (when used to place exits)
422 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 445 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
423 */ 446 */
424 447
425 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK(m1, sx, sy) != MOVE_ALL) continue; 448 if (ob->move_type == 0 && GET_MAP_MOVE_BLOCK (m1, sx, sy) != MOVE_ALL)
449 continue;
426 450
427 /* Note it is intentional that we check ob - the movement type of the 451 /* Note it is intentional that we check ob - the movement type of the
428 * head of the object should correspond for the entire object. 452 * head of the object should correspond for the entire object.
429 */ 453 */
430 if (OB_TYPE_MOVE_BLOCK(ob, GET_MAP_MOVE_BLOCK(m1, sx, sy))) 454 if (OB_TYPE_MOVE_BLOCK (ob, GET_MAP_MOVE_BLOCK (m1, sx, sy)))
431 return AB_NO_PASS; 455 return AB_NO_PASS;
432 456
433 } 457 }
434 return 0; 458 return 0;
435} 459}
436 460
437/* When the map is loaded, load_object does not actually insert objects 461/* When the map is loaded, load_object does not actually insert objects
438 * into inventory, but just links them. What this does is go through 462 * into inventory, but just links them. What this does is go through
439 * and insert them properly. 463 * and insert them properly.
440 * The object 'container' is the object that contains the inventory. 464 * The object 'container' is the object that contains the inventory.
441 * This is needed so that we can update the containers weight. 465 * This is needed so that we can update the containers weight.
442 */ 466 */
443 467
468void
444void fix_container(object *container) 469fix_container (object *container)
445{ 470{
446 object *tmp=container->inv, *next; 471 object *tmp = container->inv, *next;
447 472
448 container->inv=NULL; 473 container->inv = NULL;
449 while (tmp!=NULL) { 474 while (tmp != NULL)
475 {
450 next = tmp->below; 476 next = tmp->below;
451 if (tmp->inv) 477 if (tmp->inv)
452 fix_container(tmp); 478 fix_container (tmp);
453 (void) insert_ob_in_ob(tmp,container); 479 (void) insert_ob_in_ob (tmp, container);
454 tmp = next; 480 tmp = next;
455 } 481 }
456 /* sum_weight will go through and calculate what all the containers are 482 /* sum_weight will go through and calculate what all the containers are
457 * carrying. 483 * carrying.
458 */ 484 */
459 sum_weight(container); 485 sum_weight (container);
460} 486}
461 487
462/* link_multipart_objects go through all the objects on the map looking 488/* link_multipart_objects go through all the objects on the map looking
463 * for objects whose arch says they are multipart yet according to the 489 * for objects whose arch says they are multipart yet according to the
464 * info we have, they only have the head (as would be expected when 490 * info we have, they only have the head (as would be expected when
465 * they are saved). We do have to look for the old maps that did save 491 * they are saved). We do have to look for the old maps that did save
466 * the more sections and not re-add sections for them. 492 * the more sections and not re-add sections for them.
467 */ 493 */
468 494
495static void
469static void link_multipart_objects(mapstruct *m) 496link_multipart_objects (mapstruct *m)
470{ 497{
471 int x,y; 498 int x, y;
472 object *tmp, *op, *last, *above; 499 object *tmp, *op, *last, *above;
473 archetype *at; 500 archetype *at;
474 501
475 for(x=0;x<MAP_WIDTH(m);x++) 502 for (x = 0; x < MAP_WIDTH (m); x++)
476 for(y=0;y<MAP_HEIGHT(m);y++) 503 for (y = 0; y < MAP_HEIGHT (m); y++)
477 for(tmp=get_map_ob(m,x,y);tmp!=NULL;tmp=above) { 504 for (tmp = get_map_ob (m, x, y); tmp != NULL; tmp = above)
505 {
478 above=tmp->above; 506 above = tmp->above;
479 507
480 /* already multipart - don't do anything more */ 508 /* already multipart - don't do anything more */
481 if (tmp->head || tmp->more) continue; 509 if (tmp->head || tmp->more)
510 continue;
482 511
483 /* If there is nothing more to this object, this for loop 512 /* If there is nothing more to this object, this for loop
484 * won't do anything. 513 * won't do anything.
485 */ 514 */
486 for (at = tmp->arch->more, last=tmp; at != NULL; at=at->more, last=op) { 515 for (at = tmp->arch->more, last = tmp; at != NULL; at = at->more, last = op)
516 {
487 op = arch_to_object(at); 517 op = arch_to_object (at);
488 518
489 /* update x,y coordinates */ 519 /* update x,y coordinates */
490 op->x += tmp->x; 520 op->x += tmp->x;
491 op->y += tmp->y; 521 op->y += tmp->y;
492 op->head = tmp; 522 op->head = tmp;
493 op->map = m; 523 op->map = m;
494 last->more = op; 524 last->more = op;
495 if (tmp->name != op->name) {
496 if (op->name) free_string(op->name);
497 op->name = add_string(tmp->name); 525 op->name = tmp->name;
498 }
499 if (tmp->title != op->title) {
500 if (op->title) free_string(op->title);
501 op->title = add_string(tmp->title); 526 op->title = tmp->title;
502 }
503 /* we could link all the parts onto tmp, and then just 527 /* we could link all the parts onto tmp, and then just
504 * call insert_ob_in_map once, but the effect is the same, 528 * call insert_ob_in_map once, but the effect is the same,
505 * as insert_ob_in_map will call itself with each part, and 529 * as insert_ob_in_map will call itself with each part, and
506 * the coding is simpler to just to it here with each part. 530 * the coding is simpler to just to it here with each part.
507 */ 531 */
508 insert_ob_in_map(op, op->map, tmp,INS_NO_MERGE|INS_ABOVE_FLOOR_ONLY|INS_NO_WALK_ON); 532 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON);
509 } /* for at = tmp->arch->more */ 533 } /* for at = tmp->arch->more */
510 } /* for objects on this space */ 534 } /* for objects on this space */
511} 535}
512
513
514 536
515/* 537/*
516 * Loads (ands parses) the objects into a given map from the specified 538 * Loads (ands parses) the objects into a given map from the specified
517 * file pointer. 539 * file pointer.
518 * mapflags is the same as we get with load_original_map 540 * mapflags is the same as we get with load_original_map
519 */ 541 */
520 542void
521void load_objects (mapstruct *m, object_thawer &fp, int mapflags) { 543load_objects (mapstruct *m, object_thawer & fp, int mapflags)
522 int i,j,bufstate=LO_NEWFILE; 544{
545 int i, j;
523 int unique; 546 int unique;
524 object *op, *prev=NULL,*last_more=NULL, *otmp; 547 object *op, *prev = NULL, *last_more = NULL, *otmp;
525 548
526 op=get_object(); 549 op = get_object ();
527 op->map = m; /* To handle buttons correctly */ 550 op->map = m; /* To handle buttons correctly */
528 551
529 while((i = load_object (fp, op, bufstate, mapflags))) { 552 while ((i = load_object (fp, op, mapflags)))
530 /* Since the loading of the map header does not load an object 553 {
531 * anymore, we need to pass LO_NEWFILE for the first object loaded,
532 * and then switch to LO_REPEAT for faster loading.
533 */
534 bufstate = LO_REPEAT;
535
536 /* if the archetype for the object is null, means that we 554 /* if the archetype for the object is null, means that we
537 * got an invalid object. Don't do anything with it - the game 555 * got an invalid object. Don't do anything with it - the game
538 * or editor will not be able to do anything with it either. 556 * or editor will not be able to do anything with it either.
539 */ 557 */
540 if (op->arch==NULL) { 558 if (op->arch == NULL)
559 {
541 LOG(llevDebug,"Discarding object without arch: %s\n", op->name?op->name:"(null)"); 560 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)");
542 continue; 561 continue;
562 }
563
564
565 switch (i)
543 } 566 {
544
545
546 switch(i) {
547 case LL_NORMAL: 567 case LL_NORMAL:
548 /* if we are loading an overlay, put the floors on the bottom */ 568 /* if we are loading an overlay, put the floors on the bottom */
549 if ((QUERY_FLAG(op, FLAG_IS_FLOOR) ||
550 QUERY_FLAG(op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY) 569 if ((QUERY_FLAG (op, FLAG_IS_FLOOR) || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)) && mapflags & MAP_OVERLAY)
551 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD); 570 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY | INS_MAP_LOAD);
552 else 571 else
553 insert_ob_in_map(op,m,op,INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 572 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
554 573
555 if (op->inv) 574 if (op->inv)
556 sum_weight(op); 575 sum_weight (op);
557 576
558 prev=op,last_more=op; 577 prev = op, last_more = op;
559 break; 578 break;
560 579
561 case LL_MORE: 580 case LL_MORE:
562 insert_ob_in_map(op,m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 581 insert_ob_in_map (op, m, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY);
563 op->head=prev,last_more->more=op,last_more=op; 582 op->head = prev, last_more->more = op, last_more = op;
564 break; 583 break;
565 } 584 }
585
566 if (mapflags & MAP_STYLE) { 586 if (mapflags & MAP_STYLE)
567 remove_from_active_list(op); 587 remove_from_active_list (op);
568 } 588
569 op=get_object(); 589 op = get_object ();
570 op->map = m; 590 op->map = m;
571 } 591 }
592
572 for (i=0;i<m->width;i++){ 593 for (i = 0; i < m->width; i++)
594 {
573 for (j=0;j<m->height;j++){ 595 for (j = 0; j < m->height; j++)
596 {
574 unique =0; 597 unique = 0;
575 /* check for unique items, or unique squares */ 598 /* check for unique items, or unique squares */
576 for (otmp = get_map_ob(m, i, j); otmp; otmp = otmp->above) { 599 for (otmp = get_map_ob (m, i, j); otmp; otmp = otmp->above)
600 {
577 if (QUERY_FLAG(otmp, FLAG_UNIQUE) || QUERY_FLAG(otmp, FLAG_OBJ_SAVE_ON_OVL)) 601 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
578 unique = 1; 602 unique = 1;
579 if (!(mapflags & (MAP_OVERLAY|MAP_PLAYER_UNIQUE) || unique)) 603 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
580 SET_FLAG(otmp, FLAG_OBJ_ORIGINAL); 604 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
581 } 605 }
582 } 606 }
583 } 607 }
608
584 free_object(op); 609 free_object (op);
585 link_multipart_objects(m); 610 link_multipart_objects (m);
586} 611}
587 612
588/* This saves all the objects on the map in a non destructive fashion. 613/* This saves all the objects on the map in a non destructive fashion.
589 * Modified by MSW 2001-07-01 to do in a single pass - reduces code, 614 * Modified by MSW 2001-07-01 to do in a single pass - reduces code,
590 * and we only save the head of multi part objects - this is needed 615 * and we only save the head of multi part objects - this is needed
591 * in order to do map tiling properly. 616 * in order to do map tiling properly.
592 */ 617 */
618void
593void save_objects (mapstruct *m, object_freezer &fp, object_freezer &fp2, int flag) { 619save_objects (mapstruct *m, object_freezer & fp, object_freezer & fp2, int flag)
620{
594 int i, j = 0,unique=0; 621 int i, j = 0, unique = 0;
595 object *op; 622 object *op;
623
596 /* first pass - save one-part objects */ 624 /* first pass - save one-part objects */
597 for(i = 0; i < MAP_WIDTH(m); i++) 625 for (i = 0; i < MAP_WIDTH (m); i++)
598 for (j = 0; j < MAP_HEIGHT(m); j++) { 626 for (j = 0; j < MAP_HEIGHT (m); j++)
627 {
599 unique=0; 628 unique = 0;
600 for(op = get_map_ob (m, i, j); op; op = op->above) { 629 for (op = get_map_ob (m, i, j); op; op = op->above)
630 {
601 if (QUERY_FLAG(op,FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 631 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
602 unique=1; 632 unique = 1;
603 633
604 if(op->type == PLAYER) { 634 if (op->type == PLAYER)
635 {
605 LOG(llevDebug, "Player on map that is being saved\n"); 636 LOG (llevDebug, "Player on map that is being saved\n");
606 continue; 637 continue;
607 } 638 }
608 639
609 if (op->head || op->owner) 640 if (op->head || op->owner)
610 continue; 641 continue;
611 642
612 if (unique || QUERY_FLAG(op, FLAG_UNIQUE)) 643 if (unique || QUERY_FLAG (op, FLAG_UNIQUE))
613 save_object (fp2, op, 3); 644 save_object (fp2, op, 3);
614 else 645 else if (flag == 0 || (flag == 2 && (!QUERY_FLAG (op, FLAG_OBJ_ORIGINAL) && !QUERY_FLAG (op, FLAG_UNPAID))))
615 if (flag == 0 ||
616 (flag == 2 && (!QUERY_FLAG(op, FLAG_OBJ_ORIGINAL) &&
617 !QUERY_FLAG(op, FLAG_UNPAID))))
618 save_object(fp, op, 3); 646 save_object (fp, op, 3);
619 647
620 } /* for this space */ 648 } /* for this space */
621 } /* for this j */ 649 } /* for this j */
622} 650}
623 651
624/* 652/*
625 * Allocates, initialises, and returns a pointer to a mapstruct. 653 * Allocates, initialises, and returns a pointer to a mapstruct.
626 * Modified to no longer take a path option which was not being 654 * Modified to no longer take a path option which was not being
627 * used anyways. MSW 2001-07-01 655 * used anyways. MSW 2001-07-01
628 */ 656 */
629 657
630mapstruct *get_linked_map(void) { 658mapstruct *
631 mapstruct *map=(mapstruct *) calloc(1,sizeof(mapstruct)); 659get_linked_map (void)
660{
661 mapstruct *map = new mapstruct;
632 mapstruct *mp; 662 mapstruct *mp;
633 663
634 if(map==NULL)
635 fatal(OUT_OF_MEMORY);
636
637 for(mp=first_map;mp!=NULL&&mp->next!=NULL;mp=mp->next); 664 for (mp = first_map; mp != NULL && mp->next != NULL; mp = mp->next);
638 if(mp==NULL) 665 if (mp == NULL)
639 first_map=map; 666 first_map = map;
640 else 667 else
641 mp->next=map; 668 mp->next = map;
642 669
643 map->in_memory=MAP_SWAPPED; 670 map->in_memory = MAP_SWAPPED;
644 /* The maps used to pick up default x and y values from the 671 /* The maps used to pick up default x and y values from the
645 * map archetype. Mimic that behaviour. 672 * map archetype. Mimic that behaviour.
646 */ 673 */
647 MAP_WIDTH(map)=16; 674 MAP_WIDTH (map) = 16;
648 MAP_HEIGHT(map)=16; 675 MAP_HEIGHT (map) = 16;
649 MAP_RESET_TIMEOUT(map)=0; 676 MAP_RESET_TIMEOUT (map) = 0;
650 MAP_TIMEOUT(map)=300; 677 MAP_TIMEOUT (map) = 300;
651 MAP_ENTER_X(map)=0; 678 MAP_ENTER_X (map) = 0;
652 MAP_ENTER_Y(map)=0; 679 MAP_ENTER_Y (map) = 0;
653 /*set part to -1 indicating conversion to weather map not yet done*/ 680 /*set part to -1 indicating conversion to weather map not yet done */
654 MAP_WORLDPARTX(map)=-1; 681 MAP_WORLDPARTX (map) = -1;
655 MAP_WORLDPARTY(map)=-1; 682 MAP_WORLDPARTY (map) = -1;
656 return map; 683 return map;
657} 684}
658 685
659/* 686/*
660 * Allocates the arrays contained in a mapstruct. 687 * Allocates the arrays contained in a mapstruct.
661 * This basically allocates the dynamic array of spaces for the 688 * This basically allocates the dynamic array of spaces for the
662 * map. 689 * map.
663 */ 690 */
664 691
692void
665void allocate_map(mapstruct *m) { 693allocate_map (mapstruct *m)
694{
666 m->in_memory = MAP_IN_MEMORY; 695 m->in_memory = MAP_IN_MEMORY;
667 /* Log this condition and free the storage. We could I suppose 696 /* Log this condition and free the storage. We could I suppose
668 * realloc, but if the caller is presuming the data will be intact, 697 * realloc, but if the caller is presuming the data will be intact,
669 * that is their poor assumption. 698 * that is their poor assumption.
670 */ 699 */
671 if (m->spaces) { 700 if (m->spaces)
701 {
672 LOG(llevError,"allocate_map called with already allocated map (%s)\n", m->path); 702 LOG (llevError, "allocate_map called with already allocated map (%s)\n", m->path);
673 free(m->spaces); 703 free (m->spaces);
674 } 704 }
675 705
676 m->spaces = (MapSpace *) calloc(1, MAP_WIDTH(m) * MAP_HEIGHT(m) * sizeof(MapSpace)); 706 m->spaces = (MapSpace *) calloc (1, MAP_WIDTH (m) * MAP_HEIGHT (m) * sizeof (MapSpace));
677 707
678 if(m->spaces==NULL) 708 if (m->spaces == NULL)
679 fatal(OUT_OF_MEMORY); 709 fatal (OUT_OF_MEMORY);
680} 710}
681 711
682/* Create and returns a map of the specific size. Used 712/* Create and returns a map of the specific size. Used
683 * in random map code and the editor. 713 * in random map code and the editor.
684 */ 714 */
715mapstruct *
685mapstruct *get_empty_map(int sizex, int sizey) { 716get_empty_map (int sizex, int sizey)
717{
686 mapstruct *m = get_linked_map(); 718 mapstruct *m = get_linked_map ();
719
687 m->width = sizex; 720 m->width = sizex;
688 m->height = sizey; 721 m->height = sizey;
689 m->in_memory = MAP_SWAPPED; 722 m->in_memory = MAP_SWAPPED;
690 allocate_map(m); 723 allocate_map (m);
691 return m; 724 return m;
692} 725}
693 726
694/* Takes a string from a map definition and outputs a pointer to the array of shopitems 727/* Takes a string from a map definition and outputs a pointer to the array of shopitems
695 * corresponding to that string. Memory is allocated for this, it must be freed 728 * corresponding to that string. Memory is allocated for this, it must be freed
696 * at a later date. 729 * at a later date.
697 * Called by parse_map_headers below. 730 * Called by parse_map_headers below.
698 */ 731 */
699 732
733static shopitems *
700static shopitems *parse_shop_string (const char *input_string) { 734parse_shop_string (const char *input_string)
735{
701 char *shop_string, *p, *q, *next_semicolon, *next_colon; 736 char *shop_string, *p, *q, *next_semicolon, *next_colon;
702 shopitems *items=NULL; 737 shopitems *items = NULL;
703 int i=0, number_of_entries=0; 738 int i = 0, number_of_entries = 0;
704 const typedata *current_type; 739 const typedata *current_type;
705 740
706 shop_string=strdup_local(input_string); 741 shop_string = strdup_local (input_string);
707 p=shop_string; 742 p = shop_string;
708 /* first we'll count the entries, we'll need that for allocating the array shortly */ 743 /* first we'll count the entries, we'll need that for allocating the array shortly */
709 while (p) { 744 while (p)
745 {
710 p=strchr(p, ';'); 746 p = strchr (p, ';');
711 number_of_entries++; 747 number_of_entries++;
712 if (p) p++; 748 if (p)
749 p++;
713 } 750 }
714 p=shop_string; 751 p = shop_string;
715 strip_endline(p); 752 strip_endline (p);
716 items=(shopitems *) CALLOC(number_of_entries+1, sizeof(shopitems)); 753 items = new shopitems[number_of_entries + 1];
717 memset(items, 0, (sizeof(shopitems) * number_of_entries+1));
718 for (i=0; i<number_of_entries; i++) { 754 for (i = 0; i < number_of_entries; i++)
755 {
719 if (!p) { 756 if (!p)
757 {
720 LOG(llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n"); 758 LOG (llevError, "parse_shop_string: I seem to have run out of string, that shouldn't happen.\n");
721 break; 759 break;
722 } 760 }
723 next_semicolon=strchr(p, ';'); 761 next_semicolon = strchr (p, ';');
724 next_colon=strchr(p, ':'); 762 next_colon = strchr (p, ':');
725 /* if there is a stregth specified, figure out what it is, we'll need it soon. */ 763 /* if there is a stregth specified, figure out what it is, we'll need it soon. */
726 if (next_colon &&( !next_semicolon || next_colon<next_semicolon)) 764 if (next_colon && (!next_semicolon || next_colon < next_semicolon))
727 items[i].strength=atoi(strchr(p,':')+1); 765 items[i].strength = atoi (strchr (p, ':') + 1);
766
767 if (isdigit (*p) || *p == '*')
728 768 {
729 if (isdigit(*p) || *p=='*') {
730 items[i].typenum = atoi(p); /* atoi returns 0 when we have an asterisk */ 769 items[i].typenum = atoi (p); /* atoi returns 0 when we have an asterisk */
731 current_type=get_typedata(items[i].typenum); 770 current_type = get_typedata (items[i].typenum);
732 if (current_type) { 771 if (current_type)
772 {
733 items[i].name=current_type->name; 773 items[i].name = current_type->name;
734 items[i].name_pl=current_type->name_pl; 774 items[i].name_pl = current_type->name_pl;
735 }
736 }
737 else { /*we have a named type, let's figure out what it is */
738 q=strpbrk(p,";:");
739 if (q) *q='\0';
740
741 current_type=get_typedata_by_name(p);
742 if (current_type) {
743 items[i].name=current_type->name;
744 items[i].typenum=current_type->number;
745 items[i].name_pl=current_type->name_pl;
746 } 775 }
747 else { /* oh uh, something's wrong, let's free up this one, and try 776 }
748 * the next entry while we're at it, better print a warning 777 else
749 */ 778 { /*we have a named type, let's figure out what it is */
750 LOG(llevError, "invalid type %s defined in shopitems in string %s\n", 779 q = strpbrk (p, ";:");
751 p, input_string); 780 if (q)
781 *q = '\0';
782
783 current_type = get_typedata_by_name (p);
784 if (current_type)
785 {
786 items[i].name = current_type->name;
787 items[i].typenum = current_type->number;
788 items[i].name_pl = current_type->name_pl;
752 } 789 }
790 else
791 { /* oh uh, something's wrong, let's free up this one, and try
792 * the next entry while we're at it, better print a warning
793 */
794 LOG (llevError, "invalid type %s defined in shopitems in string %s\n", p, input_string);
753 } 795 }
796 }
754 items[i].index=number_of_entries; 797 items[i].index = number_of_entries;
755 if (next_semicolon) p=++next_semicolon; 798 if (next_semicolon)
799 p = ++next_semicolon;
800 else
756 else p=NULL; 801 p = NULL;
757 } 802 }
758 free(shop_string); 803 free (shop_string);
759 return items; 804 return items;
760} 805}
761 806
762/* opposite of parse string, this puts the string that was originally fed in to 807/* opposite of parse string, this puts the string that was originally fed in to
763 * the map (or something equivilent) into output_string. */ 808 * the map (or something equivilent) into output_string. */
809static void
764static void print_shop_string(mapstruct *m, char *output_string) { 810print_shop_string (mapstruct *m, char *output_string)
811{
765 int i; 812 int i;
766 char tmp[MAX_BUF]; 813 char tmp[MAX_BUF];
814
767 strcpy(output_string, ""); 815 strcpy (output_string, "");
768 for (i=0; i< m->shopitems[0].index; i++) { 816 for (i = 0; i < m->shopitems[0].index; i++)
817 {
769 if (m->shopitems[i].typenum) { 818 if (m->shopitems[i].typenum)
819 {
770 if (m->shopitems[i].strength) { 820 if (m->shopitems[i].strength)
821 {
771 sprintf(tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 822 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
772 } 823 }
824 else
773 else sprintf(tmp, "%s;", m->shopitems[i].name); 825 sprintf (tmp, "%s;", m->shopitems[i].name);
826 }
827 else
774 } 828 {
775 else {
776 if (m->shopitems[i].strength) { 829 if (m->shopitems[i].strength)
830 {
777 sprintf(tmp, "*:%d;", m->shopitems[i].strength); 831 sprintf (tmp, "*:%d;", m->shopitems[i].strength);
778 } 832 }
833 else
779 else sprintf(tmp, "*"); 834 sprintf (tmp, "*");
780 } 835 }
781 strcat(output_string, tmp); 836 strcat (output_string, tmp);
782 } 837 }
783} 838}
784 839
785/* This loads the header information of the map. The header 840/* This loads the header information of the map. The header
786 * contains things like difficulty, size, timeout, etc. 841 * contains things like difficulty, size, timeout, etc.
… …
793 * currently, there are few enough fields this is not a big deal. 848 * currently, there are few enough fields this is not a big deal.
794 * MSW 2001-07-01 849 * MSW 2001-07-01
795 * return 0 on success, 1 on failure. 850 * return 0 on success, 1 on failure.
796 */ 851 */
797 852
853static int
798static int load_map_header(object_thawer &fp, mapstruct *m) 854load_map_header (object_thawer & fp, mapstruct *m)
799{ 855{
800 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key=NULL, *value, *end; 856 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
801 int msgpos=0; 857 int msgpos = 0;
802 int maplorepos=0; 858 int maplorepos = 0;
803 859
804 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 860 while (fgets (buf, HUGE_BUF - 1, fp) != NULL)
861 {
805 buf[HUGE_BUF-1] = 0; 862 buf[HUGE_BUF - 1] = 0;
806 key = buf; 863 key = buf;
807 while (isspace(*key)) key++; 864 while (isspace (*key))
808 if (*key == 0) continue; /* empty line */ 865 key++;
866 if (*key == 0)
867 continue; /* empty line */
809 value = strchr(key, ' '); 868 value = strchr (key, ' ');
810 if (!value) { 869 if (!value)
870 {
811 end = strchr(key, '\n'); 871 end = strchr (key, '\n');
812 if (end != NULL) { 872 if (end != NULL)
873 {
813 *end = 0; 874 *end = 0;
814 } 875 }
876 }
815 } else { 877 else
878 {
816 *value = 0; 879 *value = 0;
817 value++; 880 value++;
818 end = strchr(value, '\n'); 881 end = strchr (value, '\n');
819 while (isspace(*value)) { 882 while (isspace (*value))
883 {
820 value++; 884 value++;
821 if (*value == '\0' || value == end) { 885 if (*value == '\0' || value == end)
886 {
822 /* Nothing but spaces. */ 887 /* Nothing but spaces. */
823 value = NULL; 888 value = NULL;
824 break; 889 break;
825 } 890 }
826 } 891 }
827 } 892 }
893
828 if (!end) { 894 if (!end)
895 {
829 LOG(llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", 896 LOG (llevError, "Error loading map header - did not find a newline - perhaps file is truncated? Buf=%s\n", buf);
830 buf);
831 return 1; 897 return 1;
832 }
833 898 }
834 899
835 /* key is the field name, value is what it should be set 900 /* key is the field name, value is what it should be set
836 * to. We've already done the work to null terminate key, 901 * to. We've already done the work to null terminate key,
837 * and strip off any leading spaces for both of these. 902 * and strip off any leading spaces for both of these.
838 * We have not touched the newline at the end of the line - 903 * We have not touched the newline at the end of the line -
839 * these are needed for some values. the end pointer 904 * these are needed for some values. the end pointer
840 * points to the first of the newlines. 905 * points to the first of the newlines.
841 * value could be NULL! It would be easy enough to just point 906 * value could be NULL! It would be easy enough to just point
842 * this to "" to prevent cores, but that would let more errors slide 907 * this to "" to prevent cores, but that would let more errors slide
843 * through. 908 * through.
844 * 909 *
845 * First check for entries that do not use the value parameter, then 910 * First check for entries that do not use the value parameter, then
846 * validate that value is given and check for the remaining entries 911 * validate that value is given and check for the remaining entries
847 * that use the parameter. 912 * that use the parameter.
848 */ 913 */
849 914
850 if (!strcmp(key,"msg")) { 915 if (!strcmp (key, "msg"))
916 {
851 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 917 while (fgets (buf, HUGE_BUF - 1, fp) != NULL)
918 {
852 if (!strcmp(buf,"endmsg\n")) break; 919 if (!strcmp (buf, "endmsg\n"))
920 break;
853 else { 921 else
922 {
854 /* slightly more efficient than strcat */ 923 /* slightly more efficient than strcat */
855 strcpy(msgbuf+msgpos, buf); 924 strcpy (msgbuf + msgpos, buf);
856 msgpos += strlen(buf); 925 msgpos += strlen (buf);
857 } 926 }
858 } 927 }
859 /* There are lots of maps that have empty messages (eg, msg/endmsg 928 /* There are lots of maps that have empty messages (eg, msg/endmsg
860 * with nothing between). There is no reason in those cases to 929 * with nothing between). There is no reason in those cases to
861 * keep the empty message. Also, msgbuf contains garbage data 930 * keep the empty message. Also, msgbuf contains garbage data
862 * when msgpos is zero, so copying it results in crashes 931 * when msgpos is zero, so copying it results in crashes
863 */ 932 */
864 if (msgpos != 0) 933 if (msgpos != 0)
865 m->msg = strdup_local(msgbuf); 934 m->msg = strdup_local (msgbuf);
866 } 935 }
867 else if (!strcmp(key,"maplore")) { 936 else if (!strcmp (key, "maplore"))
937 {
868 while (fgets(buf, HUGE_BUF-1, fp)!=NULL) { 938 while (fgets (buf, HUGE_BUF - 1, fp) != NULL)
939 {
869 if (!strcmp(buf,"endmaplore\n")) break; 940 if (!strcmp (buf, "endmaplore\n"))
941 break;
870 else { 942 else
943 {
871 /* slightly more efficient than strcat */ 944 /* slightly more efficient than strcat */
872 strcpy(maplorebuf+maplorepos, buf); 945 strcpy (maplorebuf + maplorepos, buf);
873 maplorepos += strlen(buf); 946 maplorepos += strlen (buf);
874 } 947 }
875 } 948 }
876 if (maplorepos != 0) 949 if (maplorepos != 0)
877 m->maplore = strdup_local(maplorebuf); 950 m->maplore = strdup_local (maplorebuf);
878 } 951 }
879 else if (!strcmp(key,"end")) { 952 else if (!strcmp (key, "end"))
953 {
880 break; 954 break;
881 } 955 }
882 else if (value == NULL) { 956 else if (value == NULL)
957 {
883 LOG(llevError, "Got '%s' line without parameter in map header\n", key); 958 LOG (llevError, "Got '%s' line without parameter in map header\n", key);
884 } 959 }
885 else if (!strcmp(key, "arch")) { 960 else if (!strcmp (key, "arch"))
961 {
886 /* This is an oddity, but not something we care about much. */ 962 /* This is an oddity, but not something we care about much. */
887 if (strcmp(value,"map\n")) 963 if (strcmp (value, "map\n"))
888 LOG(llevError,"loading map and got a non 'arch map' line(%s %s)?\n",key,value); 964 LOG (llevError, "loading map and got a non 'arch map' line(%s %s)?\n", key, value);
889 } 965 }
890 else if (!strcmp(key,"name")) { 966 else if (!strcmp (key, "name"))
967 {
891 *end=0; 968 *end = 0;
892 m->name = strdup_local(value); 969 m->name = strdup_local (value);
893 } 970 }
894 /* first strcmp value on these are old names supported 971 /* first strcmp value on these are old names supported
895 * for compatibility reasons. The new values (second) are 972 * for compatibility reasons. The new values (second) are
896 * what really should be used. 973 * what really should be used.
897 */ 974 */
898 else if (!strcmp(key,"oid")) { 975 else if (!strcmp (key, "oid"))
976 {
899 fp.get (m, atoi(value)); 977 fp.get (m, atoi (value));
978 }
900 } else if (!strcmp(key, "attach")) { 979 else if (!strcmp (key, "attach"))
980 {
901 m->attach = add_string (value); 981 m->attach = value;
982 }
902 } else if (!strcmp(key,"hp") || !strcmp(key, "enter_x")) { 983 else if (!strcmp (key, "hp") || !strcmp (key, "enter_x"))
984 {
903 m->enter_x = atoi(value); 985 m->enter_x = atoi (value);
986 }
904 } else if (!strcmp(key,"sp") || !strcmp(key, "enter_y")) { 987 else if (!strcmp (key, "sp") || !strcmp (key, "enter_y"))
988 {
905 m->enter_y = atoi(value); 989 m->enter_y = atoi (value);
990 }
906 } else if (!strcmp(key,"x") || !strcmp(key, "width")) { 991 else if (!strcmp (key, "x") || !strcmp (key, "width"))
992 {
907 m->width = atoi(value); 993 m->width = atoi (value);
994 }
908 } else if (!strcmp(key,"y") || !strcmp(key, "height")) { 995 else if (!strcmp (key, "y") || !strcmp (key, "height"))
996 {
909 m->height = atoi(value); 997 m->height = atoi (value);
998 }
910 } else if (!strcmp(key,"weight") || !strcmp(key, "reset_timeout")) { 999 else if (!strcmp (key, "weight") || !strcmp (key, "reset_timeout"))
1000 {
911 m->reset_timeout = atoi(value); 1001 m->reset_timeout = atoi (value);
1002 }
912 } else if (!strcmp(key,"value") || !strcmp(key, "swap_time")) { 1003 else if (!strcmp (key, "value") || !strcmp (key, "swap_time"))
1004 {
913 m->timeout = atoi(value); 1005 m->timeout = atoi (value);
1006 }
914 } else if (!strcmp(key,"level") || !strcmp(key, "difficulty")) { 1007 else if (!strcmp (key, "level") || !strcmp (key, "difficulty"))
1008 {
915 m->difficulty = atoi(value); 1009 m->difficulty = atoi (value);
1010 }
916 } else if (!strcmp(key,"invisible") || !strcmp(key, "darkness")) { 1011 else if (!strcmp (key, "invisible") || !strcmp (key, "darkness"))
1012 {
917 m->darkness = atoi(value); 1013 m->darkness = atoi (value);
1014 }
918 } else if (!strcmp(key,"stand_still") || !strcmp(key, "fixed_resettime")) { 1015 else if (!strcmp (key, "stand_still") || !strcmp (key, "fixed_resettime"))
1016 {
919 m->fixed_resettime = atoi(value); 1017 m->fixed_resettime = atoi (value);
1018 }
920 } else if (!strcmp(key,"unique")) { 1019 else if (!strcmp (key, "unique"))
1020 {
921 m->unique = atoi(value); 1021 m->unique = atoi (value);
1022 }
922 } else if (!strcmp(key,"template")) { 1023 else if (!strcmp (key, "template"))
1024 {
923 m->templatemap = atoi(value); 1025 m->templatemap = atoi (value);
1026 }
924 } else if (!strcmp(key,"region")) { 1027 else if (!strcmp (key, "region"))
1028 {
925 m->region = get_region_by_name(value); 1029 m->region = get_region_by_name (value);
1030 }
926 } else if (!strcmp(key,"shopitems")) { 1031 else if (!strcmp (key, "shopitems"))
1032 {
927 *end=0; 1033 *end = 0;
928 m->shopitems = parse_shop_string(value); 1034 m->shopitems = parse_shop_string (value);
1035 }
929 } else if (!strcmp(key,"shopgreed")) { 1036 else if (!strcmp (key, "shopgreed"))
1037 {
930 m->shopgreed = atof(value); 1038 m->shopgreed = atof (value);
1039 }
931 } else if (!strcmp(key,"shopmin")) { 1040 else if (!strcmp (key, "shopmin"))
1041 {
932 m->shopmin = atol(value); 1042 m->shopmin = atol (value);
1043 }
933 } else if (!strcmp(key,"shopmax")) { 1044 else if (!strcmp (key, "shopmax"))
1045 {
934 m->shopmax = atol(value); 1046 m->shopmax = atol (value);
1047 }
935 } else if (!strcmp(key,"shoprace")) { 1048 else if (!strcmp (key, "shoprace"))
1049 {
936 *end=0; 1050 *end = 0;
937 m->shoprace = strdup_local(value); 1051 m->shoprace = strdup_local (value);
1052 }
938 } else if (!strcmp(key,"outdoor")) { 1053 else if (!strcmp (key, "outdoor"))
1054 {
939 m->outdoor = atoi(value); 1055 m->outdoor = atoi (value);
1056 }
940 } else if (!strcmp(key, "temp")) { 1057 else if (!strcmp (key, "temp"))
1058 {
941 m->temp = atoi(value); 1059 m->temp = atoi (value);
1060 }
942 } else if (!strcmp(key, "pressure")) { 1061 else if (!strcmp (key, "pressure"))
1062 {
943 m->pressure = atoi(value); 1063 m->pressure = atoi (value);
1064 }
944 } else if (!strcmp(key, "humid")) { 1065 else if (!strcmp (key, "humid"))
1066 {
945 m->humid = atoi(value); 1067 m->humid = atoi (value);
1068 }
946 } else if (!strcmp(key, "windspeed")) { 1069 else if (!strcmp (key, "windspeed"))
1070 {
947 m->windspeed = atoi(value); 1071 m->windspeed = atoi (value);
1072 }
948 } else if (!strcmp(key, "winddir")) { 1073 else if (!strcmp (key, "winddir"))
1074 {
949 m->winddir = atoi(value); 1075 m->winddir = atoi (value);
1076 }
950 } else if (!strcmp(key, "sky")) { 1077 else if (!strcmp (key, "sky"))
1078 {
951 m->sky = atoi(value); 1079 m->sky = atoi (value);
1080 }
952 } else if (!strcmp(key, "nosmooth")) { 1081 else if (!strcmp (key, "nosmooth"))
1082 {
953 m->nosmooth = atoi(value); 1083 m->nosmooth = atoi (value);
954 } 1084 }
955 else if (!strncmp(key,"tile_path_", 10)) { 1085 else if (!strncmp (key, "tile_path_", 10))
1086 {
956 int tile=atoi(key+10); 1087 int tile = atoi (key + 10);
957 1088
958 if (tile<1 || tile>4) { 1089 if (tile < 1 || tile > 4)
1090 {
959 LOG(llevError,"load_map_header: tile location %d out of bounds (%s)\n", 1091 LOG (llevError, "load_map_header: tile location %d out of bounds (%s)\n", tile, m->path);
960 tile, m->path); 1092 }
961 } else { 1093 else
1094 {
962 char *path; 1095 char *path;
963 1096
964 *end = 0; 1097 *end = 0;
965 1098
966 if (m->tile_path[tile-1]) { 1099 if (m->tile_path[tile - 1])
1100 {
967 LOG(llevError,"load_map_header: tile location %d duplicated (%s)\n", 1101 LOG (llevError, "load_map_header: tile location %d duplicated (%s)\n", tile, m->path);
968 tile, m->path);
969 free(m->tile_path[tile-1]); 1102 free (m->tile_path[tile - 1]);
970 m->tile_path[tile-1] = NULL; 1103 m->tile_path[tile - 1] = NULL;
971 } 1104 }
972 1105
973 if (check_path(value, 1) != -1) { 1106 if (check_path (value, 1) != -1)
1107 {
974 /* The unadorned path works. */ 1108 /* The unadorned path works. */
975 path = value; 1109 path = value;
1110 }
976 } else { 1111 else
1112 {
977 /* Try again; it could be a relative exit. */ 1113 /* Try again; it could be a relative exit. */
978 1114
979 path = path_combine_and_normalize(m->path, value); 1115 path = path_combine_and_normalize (m->path, value);
980 1116
981 if (check_path(path, 1) == -1) { 1117 if (check_path (path, 1) == -1)
1118 {
982 LOG(llevError, "get_map_header: Bad tile path %s %s\n", m->path, value); 1119 LOG (llevError, "get_map_header: Bad tile path %s %s\n", m->path, value);
983 path = NULL; 1120 path = NULL;
984 } 1121 }
985 } 1122 }
986 1123
987 if (editor) { 1124 if (editor)
1125 {
988 /* Use the value as in the file. */ 1126 /* Use the value as in the file. */
989 m->tile_path[tile-1] = strdup_local(value); 1127 m->tile_path[tile - 1] = strdup_local (value);
990 } else if (path != NULL) {
991 /* Use the normalized value. */
992 m->tile_path[tile-1] = strdup_local(path);
993 } 1128 }
1129 else if (path != NULL)
1130 {
1131 /* Use the normalized value. */
1132 m->tile_path[tile - 1] = strdup_local (path);
1133 }
994 } /* end if tile direction (in)valid */ 1134 } /* end if tile direction (in)valid */
1135 }
1136 else
995 } 1137 {
996 else {
997 LOG(llevError,"Got unknown value in map header: %s %s\n", key, value); 1138 LOG (llevError, "Got unknown value in map header: %s %s\n", key, value);
998 } 1139 }
999 } 1140 }
1000 if (!key || strcmp(key,"end")) { 1141 if (!key || strcmp (key, "end"))
1142 {
1001 LOG(llevError,"Got premature eof on map header!\n"); 1143 LOG (llevError, "Got premature eof on map header!\n");
1002 return 1; 1144 return 1;
1003 } 1145 }
1004 return 0; 1146 return 0;
1005} 1147}
1006 1148
1007/* 1149/*
1008 * Opens the file "filename" and reads information about the map 1150 * Opens the file "filename" and reads information about the map
1009 * from the given file, and stores it in a newly allocated 1151 * from the given file, and stores it in a newly allocated
… …
1014 * cases, no matter if this flag is set or not. 1156 * cases, no matter if this flag is set or not.
1015 * MAP_STYLE: style map - don't add active objects, don't add to server 1157 * MAP_STYLE: style map - don't add active objects, don't add to server
1016 * managed map list. 1158 * managed map list.
1017 */ 1159 */
1018 1160
1161mapstruct *
1019mapstruct *load_original_map(const char *filename, int flags) { 1162load_original_map (const char *filename, int flags)
1163{
1020 mapstruct *m; 1164 mapstruct *m;
1021 char pathname[MAX_BUF]; 1165 char pathname[MAX_BUF];
1022 1166
1023 LOG(llevDebug, "load_original_map: %s (%x)\n", filename,flags);
1024 if (flags & MAP_PLAYER_UNIQUE) 1167 if (flags & MAP_PLAYER_UNIQUE)
1025 strcpy(pathname, filename); 1168 strcpy (pathname, filename);
1026 else if (flags & MAP_OVERLAY) 1169 else if (flags & MAP_OVERLAY)
1027 strcpy(pathname, create_overlay_pathname(filename)); 1170 strcpy (pathname, create_overlay_pathname (filename));
1028 else 1171 else
1029 strcpy(pathname, create_pathname(filename)); 1172 strcpy (pathname, create_pathname (filename));
1030 1173
1174 LOG (llevDebug, "load_original_map(%x): %s (%s)\n", flags, filename, pathname);
1175
1031 object_thawer thawer (pathname); 1176 object_thawer thawer (pathname);
1032 1177
1033 if (!thawer) 1178 if (!thawer)
1034 return 0; 1179 return 0;
1035 1180
1036 m = get_linked_map(); 1181 m = get_linked_map ();
1037 1182
1038 strcpy (m->path, filename); 1183 strcpy (m->path, filename);
1039 if (load_map_header(thawer, m)) { 1184 if (load_map_header (thawer, m))
1185 {
1040 LOG(llevError,"Error loading map header for %s, flags=%d\n", 1186 LOG (llevError, "Error loading map header for %s, flags=%d\n", filename, flags);
1041 filename, flags);
1042 delete_map(m); 1187 delete_map (m);
1043 return NULL; 1188 return NULL;
1044 } 1189 }
1045 1190
1046 allocate_map(m); 1191 allocate_map (m);
1047 1192
1048 m->in_memory=MAP_LOADING; 1193 m->in_memory = MAP_LOADING;
1049 load_objects (m, thawer, flags & (MAP_BLOCK|MAP_STYLE)); 1194 load_objects (m, thawer, flags & (MAP_BLOCK | MAP_STYLE));
1050 1195
1051 m->in_memory=MAP_IN_MEMORY; 1196 m->in_memory = MAP_IN_MEMORY;
1052 if (!MAP_DIFFICULTY(m)) 1197 if (!MAP_DIFFICULTY (m))
1053 MAP_DIFFICULTY(m)=calculate_difficulty(m); 1198 MAP_DIFFICULTY (m) = calculate_difficulty (m);
1054 set_map_reset_time(m); 1199 set_map_reset_time (m);
1055 m->instantiate (); 1200 m->instantiate ();
1056 return (m); 1201 return (m);
1057} 1202}
1058 1203
1059/* 1204/*
1060 * Loads a map, which has been loaded earlier, from file. 1205 * Loads a map, which has been loaded earlier, from file.
1061 * Return the map object we load into (this can change from the passed 1206 * Return the map object we load into (this can change from the passed
1062 * option if we can't find the original map) 1207 * option if we can't find the original map)
1063 */ 1208 */
1064 1209
1210static mapstruct *
1065static mapstruct *load_temporary_map(mapstruct *m) { 1211load_temporary_map (mapstruct *m)
1066 int comp; 1212{
1067 char buf[MAX_BUF]; 1213 char buf[MAX_BUF];
1068 1214
1069 if (!m->tmpname) { 1215 if (!m->tmpname)
1216 {
1070 LOG(llevError, "No temporary filename for map %s\n", m->path); 1217 LOG (llevError, "No temporary filename for map %s\n", m->path);
1071 strcpy(buf, m->path);
1072 delete_map(m);
1073 m = load_original_map(buf, 0);
1074 if(m==NULL) return NULL;
1075 fix_auto_apply(m); /* Chests which open as default */
1076 return m;
1077 }
1078
1079 object_thawer thawer (m->tmpname);
1080
1081 if (!thawer)
1082 {
1083 strcpy (buf, m->path); 1218 strcpy (buf, m->path);
1084 delete_map (m); 1219 delete_map (m);
1085 m = load_original_map (buf, 0); 1220 m = load_original_map (buf, 0);
1086 if (!m) return NULL; 1221 if (m == NULL)
1087 fix_auto_apply (m); /* Chests which open as default */
1088 return m;
1089 }
1090
1091 if (load_map_header(thawer, m)) {
1092 LOG(llevError,"Error loading map header for %s (%s)\n",
1093 m->path, m->tmpname);
1094 delete_map(m);
1095 m = load_original_map(m->path, 0);
1096 return NULL; 1222 return NULL;
1223 fix_auto_apply (m); /* Chests which open as default */
1224 return m;
1225 }
1226
1227 object_thawer thawer (m->tmpname);
1228
1229 if (!thawer)
1097 } 1230 {
1231 strcpy (buf, m->path);
1232 delete_map (m);
1233 m = load_original_map (buf, 0);
1234 if (!m)
1235 return NULL;
1236 fix_auto_apply (m); /* Chests which open as default */
1237 return m;
1238 }
1239
1240 if (load_map_header (thawer, m))
1241 {
1242 LOG (llevError, "Error loading map header for %s (%s)\n", m->path, m->tmpname);
1243 delete_map (m);
1244 m = load_original_map (m->path, 0);
1245 return NULL;
1246 }
1098 allocate_map(m); 1247 allocate_map (m);
1099 1248
1100 m->in_memory=MAP_LOADING; 1249 m->in_memory = MAP_LOADING;
1101 load_objects (m, thawer, 0); 1250 load_objects (m, thawer, 0);
1102 1251
1103 m->in_memory=MAP_IN_MEMORY; 1252 m->in_memory = MAP_IN_MEMORY;
1104 INVOKE_MAP (SWAPIN, m); 1253 INVOKE_MAP (SWAPIN, m);
1105 return m; 1254 return m;
1106} 1255}
1107 1256
1108/* 1257/*
1109 * Loads a map, which has been loaded earlier, from file. 1258 * Loads a map, which has been loaded earlier, from file.
1110 * Return the map object we load into (this can change from the passed 1259 * Return the map object we load into (this can change from the passed
1111 * option if we can't find the original map) 1260 * option if we can't find the original map)
1112 */ 1261 */
1113 1262
1263mapstruct *
1114mapstruct *load_overlay_map(const char *filename, mapstruct *m) { 1264load_overlay_map (const char *filename, mapstruct *m)
1265{
1115 char pathname[MAX_BUF]; 1266 char pathname[MAX_BUF];
1116 1267
1117 strcpy(pathname, create_overlay_pathname(filename)); 1268 strcpy (pathname, create_overlay_pathname (filename));
1118 1269
1119 object_thawer thawer (pathname); 1270 object_thawer thawer (pathname);
1120 1271
1121 if (!thawer) 1272 if (!thawer)
1122 return m;
1123
1124 if (load_map_header(thawer, m)) {
1125 LOG(llevError,"Error loading map header for overlay %s (%s)\n",
1126 m->path, pathname);
1127 delete_map(m);
1128 m = load_original_map(m->path, 0);
1129 return NULL;
1130 }
1131 /*allocate_map(m);*/
1132
1133 m->in_memory=MAP_LOADING;
1134 load_objects (m, thawer, MAP_OVERLAY);
1135
1136 m->in_memory=MAP_IN_MEMORY;
1137 return m; 1273 return m;
1274
1275 if (load_map_header (thawer, m))
1276 {
1277 LOG (llevError, "Error loading map header for overlay %s (%s)\n", m->path, pathname);
1278 delete_map (m);
1279 m = load_original_map (m->path, 0);
1280 return NULL;
1281 }
1282 /*allocate_map(m); */
1283
1284 m->in_memory = MAP_LOADING;
1285 load_objects (m, thawer, MAP_OVERLAY);
1286
1287 m->in_memory = MAP_IN_MEMORY;
1288 return m;
1138} 1289}
1139 1290
1140/****************************************************************************** 1291/******************************************************************************
1141 * This is the start of unique map handling code 1292 * This is the start of unique map handling code
1142 *****************************************************************************/ 1293 *****************************************************************************/
1143 1294
1144/* This goes through map 'm' and removed any unique items on the map. */ 1295/* This goes through map 'm' and removed any unique items on the map. */
1296static void
1145static void delete_unique_items(mapstruct *m) 1297delete_unique_items (mapstruct *m)
1146{ 1298{
1147 int i,j,unique; 1299 int i, j, unique;
1148 object *op, *next; 1300 object *op, *next;
1149 1301
1150 for(i=0; i<MAP_WIDTH(m); i++) 1302 for (i = 0; i < MAP_WIDTH (m); i++)
1151 for(j=0; j<MAP_HEIGHT(m); j++) { 1303 for (j = 0; j < MAP_HEIGHT (m); j++)
1304 {
1152 unique=0; 1305 unique = 0;
1153 for (op=get_map_ob(m, i, j); op; op=next) { 1306 for (op = get_map_ob (m, i, j); op; op = next)
1307 {
1154 next = op->above; 1308 next = op->above;
1155 if (QUERY_FLAG(op, FLAG_IS_FLOOR) && QUERY_FLAG(op, FLAG_UNIQUE)) 1309 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
1156 unique=1; 1310 unique = 1;
1157 if(op->head == NULL && (QUERY_FLAG(op, FLAG_UNIQUE) || unique)) { 1311 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
1312 {
1158 clean_object(op); 1313 clean_object (op);
1159 if (QUERY_FLAG(op, FLAG_IS_LINKED)) 1314 if (QUERY_FLAG (op, FLAG_IS_LINKED))
1160 remove_button_link(op); 1315 remove_button_link (op);
1161 remove_ob(op); 1316 remove_ob (op);
1162 free_object(op); 1317 free_object (op);
1163 } 1318 }
1164 } 1319 }
1165 } 1320 }
1166} 1321}
1167 1322
1168 1323
1169/* 1324/*
1170 * Loads unique objects from file(s) into the map which is in memory 1325 * Loads unique objects from file(s) into the map which is in memory
1171 * m is the map to load unique items into. 1326 * m is the map to load unique items into.
1172 */ 1327 */
1328static void
1173static void load_unique_objects(mapstruct *m) { 1329load_unique_objects (mapstruct *m)
1330{
1174 int count; 1331 int count;
1175 char firstname[MAX_BUF]; 1332 char firstname[MAX_BUF];
1176 1333
1177 for (count=0; count<10; count++) { 1334 for (count = 0; count < 10; count++)
1335 {
1178 sprintf(firstname, "%s.v%02d", create_items_path(m->path), count); 1336 sprintf (firstname, "%s.v%02d", create_items_path (m->path), count);
1179 if (!access(firstname, R_OK)) break; 1337 if (!access (firstname, R_OK))
1338 break;
1180 } 1339 }
1181 /* If we get here, we did not find any map */ 1340 /* If we get here, we did not find any map */
1182 if (count==10) return; 1341 if (count == 10)
1342 return;
1183 1343
1184 object_thawer thawer (firstname); 1344 object_thawer thawer (firstname);
1185 1345
1186 if (!thawer) 1346 if (!thawer)
1187 return; 1347 return;
1188 1348
1189 m->in_memory=MAP_LOADING; 1349 m->in_memory = MAP_LOADING;
1190 if (m->tmpname == NULL) /* if we have loaded unique items from */ 1350 if (m->tmpname == NULL) /* if we have loaded unique items from */
1191 delete_unique_items(m); /* original map before, don't duplicate them */ 1351 delete_unique_items (m); /* original map before, don't duplicate them */
1192 load_object(thawer, NULL, LO_NOREAD,0);
1193 load_objects (m, thawer, 0); 1352 load_objects (m, thawer, 0);
1194 1353
1195 m->in_memory=MAP_IN_MEMORY; 1354 m->in_memory = MAP_IN_MEMORY;
1196} 1355}
1197 1356
1198 1357
1199/* 1358/*
1200 * Saves a map to file. If flag is set, it is saved into the same 1359 * Saves a map to file. If flag is set, it is saved into the same
… …
1204 * If the map is unique, we also save to the filename in the map 1363 * If the map is unique, we also save to the filename in the map
1205 * (this should have been updated when first loaded) 1364 * (this should have been updated when first loaded)
1206 */ 1365 */
1207 1366
1208int 1367int
1209new_save_map (mapstruct * m, int flag) 1368new_save_map (mapstruct *m, int flag)
1210{ 1369{
1211 char filename[MAX_BUF], buf[MAX_BUF], buf_s[MAX_BUF], shop[MAX_BUF]; 1370 char filename[MAX_BUF], buf[MAX_BUF], shop[MAX_BUF];
1212 int i; 1371 int i;
1213 1372
1214 if (flag && !*m->path) 1373 if (flag && !*m->path)
1215 { 1374 {
1216 LOG (llevError, "Tried to save map without path.\n"); 1375 LOG (llevError, "Tried to save map without path.\n");
… …
1218 } 1377 }
1219 1378
1220 if (flag || (m->unique) || (m->templatemap)) 1379 if (flag || (m->unique) || (m->templatemap))
1221 { 1380 {
1222 if (!m->unique && !m->templatemap) 1381 if (!m->unique && !m->templatemap)
1223 { /* flag is set */ 1382 { /* flag is set */
1224 if (flag == 2) 1383 if (flag == 2)
1225 strcpy (filename, create_overlay_pathname (m->path)); 1384 strcpy (filename, create_overlay_pathname (m->path));
1226 else 1385 else
1227 strcpy (filename, create_pathname (m->path)); 1386 strcpy (filename, create_pathname (m->path));
1228 } 1387 }
… …
1233 } 1392 }
1234 else 1393 else
1235 { 1394 {
1236 if (!m->tmpname) 1395 if (!m->tmpname)
1237 m->tmpname = tempnam_local (settings.tmpdir, NULL); 1396 m->tmpname = tempnam_local (settings.tmpdir, NULL);
1397
1238 strcpy (filename, m->tmpname); 1398 strcpy (filename, m->tmpname);
1239 } 1399 }
1240 1400
1241 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename); 1401 LOG (llevDebug, "Saving map %s to %s\n", m->path, filename);
1242 m->in_memory = MAP_SAVING; 1402 m->in_memory = MAP_SAVING;
1243 1403
1244 object_freezer fp (filename); 1404 object_freezer freezer;
1245 1405
1246 /* legacy */ 1406 /* legacy */
1247 fprintf (fp, "arch map\n"); 1407 fprintf (freezer, "arch map\n");
1248 if (m->name) 1408 if (m->name)
1249 fprintf (fp, "name %s\n", m->name); 1409 fprintf (freezer, "name %s\n", m->name);
1250 if (!flag) 1410 if (!flag)
1251 fprintf (fp, "swap_time %d\n", m->swap_time); 1411 fprintf (freezer, "swap_time %d\n", m->swap_time);
1252 if (m->reset_timeout) 1412 if (m->reset_timeout)
1253 fprintf (fp, "reset_timeout %d\n", m->reset_timeout); 1413 fprintf (freezer, "reset_timeout %d\n", m->reset_timeout);
1254 if (m->fixed_resettime) 1414 if (m->fixed_resettime)
1255 fprintf (fp, "fixed_resettime %d\n", m->fixed_resettime); 1415 fprintf (freezer, "fixed_resettime %d\n", m->fixed_resettime);
1256 /* we unfortunately have no idea if this is a value the creator set 1416 /* we unfortunately have no idea if this is a value the creator set
1257 * or a difficulty value we generated when the map was first loaded 1417 * or a difficulty value we generated when the map was first loaded
1258 */ 1418 */
1259 if (m->difficulty) 1419 if (m->difficulty)
1260 fprintf (fp, "difficulty %d\n", m->difficulty); 1420 fprintf (freezer, "difficulty %d\n", m->difficulty);
1261 if (m->region) 1421 if (m->region)
1262 fprintf (fp, "region %s\n", m->region->name); 1422 fprintf (freezer, "region %s\n", m->region->name);
1263 if (m->shopitems) 1423 if (m->shopitems)
1264 { 1424 {
1265 print_shop_string (m, shop); 1425 print_shop_string (m, shop);
1266 fprintf (fp, "shopitems %s\n", shop); 1426 fprintf (freezer, "shopitems %s\n", shop);
1267 } 1427 }
1268 if (m->shopgreed) 1428 if (m->shopgreed)
1269 fprintf (fp, "shopgreed %f\n", m->shopgreed); 1429 fprintf (freezer, "shopgreed %f\n", m->shopgreed);
1270#ifndef WIN32 1430#ifndef WIN32
1271 if (m->shopmin) 1431 if (m->shopmin)
1272 fprintf (fp, "shopmin %llu\n", m->shopmin); 1432 fprintf (freezer, "shopmin %llu\n", m->shopmin);
1273 if (m->shopmax) 1433 if (m->shopmax)
1274 fprintf (fp, "shopmax %llu\n", m->shopmax); 1434 fprintf (freezer, "shopmax %llu\n", m->shopmax);
1275#else 1435#else
1276 if (m->shopmin) 1436 if (m->shopmin)
1277 fprintf (fp, "shopmin %I64u\n", m->shopmin); 1437 fprintf (freezer, "shopmin %I64u\n", m->shopmin);
1278 if (m->shopmax) 1438 if (m->shopmax)
1279 fprintf (fp, "shopmax %I64u\n", m->shopmax); 1439 fprintf (freezer, "shopmax %I64u\n", m->shopmax);
1280#endif 1440#endif
1281 if (m->shoprace) 1441 if (m->shoprace)
1282 fprintf (fp, "shoprace %s\n", m->shoprace); 1442 fprintf (freezer, "shoprace %s\n", m->shoprace);
1283 if (m->darkness) 1443 if (m->darkness)
1284 fprintf (fp, "darkness %d\n", m->darkness); 1444 fprintf (freezer, "darkness %d\n", m->darkness);
1285 if (m->width) 1445 if (m->width)
1286 fprintf (fp, "width %d\n", m->width); 1446 fprintf (freezer, "width %d\n", m->width);
1287 if (m->height) 1447 if (m->height)
1288 fprintf (fp, "height %d\n", m->height); 1448 fprintf (freezer, "height %d\n", m->height);
1289 if (m->enter_x) 1449 if (m->enter_x)
1290 fprintf (fp, "enter_x %d\n", m->enter_x); 1450 fprintf (freezer, "enter_x %d\n", m->enter_x);
1291 if (m->enter_y) 1451 if (m->enter_y)
1292 fprintf (fp, "enter_y %d\n", m->enter_y); 1452 fprintf (freezer, "enter_y %d\n", m->enter_y);
1293 if (m->msg) 1453 if (m->msg)
1294 fprintf (fp, "msg\n%sendmsg\n", m->msg); 1454 fprintf (freezer, "msg\n%sendmsg\n", m->msg);
1295 if (m->maplore) 1455 if (m->maplore)
1296 fprintf (fp, "maplore\n%sendmaplore\n", m->maplore); 1456 fprintf (freezer, "maplore\n%sendmaplore\n", m->maplore);
1297 if (m->unique) 1457 if (m->unique)
1298 fprintf (fp, "unique %d\n", m->unique); 1458 fprintf (freezer, "unique %d\n", m->unique);
1299 if (m->templatemap) 1459 if (m->templatemap)
1300 fprintf (fp, "template %d\n", m->templatemap); 1460 fprintf (freezer, "template %d\n", m->templatemap);
1301 if (m->outdoor) 1461 if (m->outdoor)
1302 fprintf (fp, "outdoor %d\n", m->outdoor); 1462 fprintf (freezer, "outdoor %d\n", m->outdoor);
1303 if (m->temp) 1463 if (m->temp)
1304 fprintf (fp, "temp %d\n", m->temp); 1464 fprintf (freezer, "temp %d\n", m->temp);
1305 if (m->pressure) 1465 if (m->pressure)
1306 fprintf (fp, "pressure %d\n", m->pressure); 1466 fprintf (freezer, "pressure %d\n", m->pressure);
1307 if (m->humid) 1467 if (m->humid)
1308 fprintf (fp, "humid %d\n", m->humid); 1468 fprintf (freezer, "humid %d\n", m->humid);
1309 if (m->windspeed) 1469 if (m->windspeed)
1310 fprintf (fp, "windspeed %d\n", m->windspeed); 1470 fprintf (freezer, "windspeed %d\n", m->windspeed);
1311 if (m->winddir) 1471 if (m->winddir)
1312 fprintf (fp, "winddir %d\n", m->winddir); 1472 fprintf (freezer, "winddir %d\n", m->winddir);
1313 if (m->sky) 1473 if (m->sky)
1314 fprintf (fp, "sky %d\n", m->sky); 1474 fprintf (freezer, "sky %d\n", m->sky);
1315 if (m->nosmooth) 1475 if (m->nosmooth)
1316 fprintf (fp, "nosmooth %d\n", m->nosmooth); 1476 fprintf (freezer, "nosmooth %d\n", m->nosmooth);
1317 1477
1318 /* Save any tiling information, except on overlays */ 1478 /* Save any tiling information, except on overlays */
1319 if (flag != 2) 1479 if (flag != 2)
1320 for (i = 0; i < 4; i++) 1480 for (i = 0; i < 4; i++)
1321 if (m->tile_path[i]) 1481 if (m->tile_path[i])
1322 fprintf (fp, "tile_path_%d %s\n", i + 1, m->tile_path[i]); 1482 fprintf (freezer, "tile_path_%d %s\n", i + 1, m->tile_path[i]);
1323 1483
1324 fp.put (m); 1484 freezer.put (m);
1325 fprintf (fp, "end\n"); 1485 fprintf (freezer, "end\n");
1326 1486
1327 /* In the game save unique items in the different file, but 1487 /* In the game save unique items in the different file, but
1328 * in the editor save them to the normal map file. 1488 * in the editor save them to the normal map file.
1329 * If unique map, save files in the proper destination (set by 1489 * If unique map, save files in the proper destination (set by
1330 * player) 1490 * player)
1331 */ 1491 */
1332 if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap) 1492 if ((flag == 0 || flag == 2) && !m->unique && !m->templatemap)
1333 { 1493 {
1494 object_freezer unique;
1495
1496 if (flag == 2)
1497 save_objects (m, freezer, unique, 2);
1498 else
1499 save_objects (m, freezer, unique, 0);
1500
1334 sprintf (buf, "%s.v00", create_items_path (m->path)); 1501 sprintf (buf, "%s.v00", create_items_path (m->path));
1335 1502
1336 object_freezer fp2 (buf); 1503 unique.save (buf);
1337
1338 if (flag == 2)
1339 save_objects (m, fp, fp2, 2);
1340 else
1341 save_objects (m, fp, fp2, 0);
1342 } 1504 }
1343 else 1505 else
1344 { /* save same file when not playing, like in editor */ 1506 { /* save same file when not playing, like in editor */
1345 save_objects (m, fp, fp, 0); 1507 save_objects (m, freezer, freezer, 0);
1346 } 1508 }
1509
1510 freezer.save (filename);
1347 1511
1348 return 0; 1512 return 0;
1349} 1513}
1350 1514
1351 1515
1352/* 1516/*
1353 * Remove and free all objects in the inventory of the given object. 1517 * Remove and free all objects in the inventory of the given object.
1354 * object.c ? 1518 * object.c ?
1355 */ 1519 */
1356 1520
1521void
1357void clean_object(object *op) 1522clean_object (object *op)
1358{ 1523{
1359 object *tmp, *next; 1524 object *tmp, *next;
1360 1525
1361 for(tmp = op->inv; tmp; tmp = next) 1526 for (tmp = op->inv; tmp; tmp = next)
1362 { 1527 {
1363 next = tmp->below; 1528 next = tmp->below;
1364 clean_object(tmp); 1529 clean_object (tmp);
1365 if (QUERY_FLAG(tmp, FLAG_IS_LINKED)) 1530 if (QUERY_FLAG (tmp, FLAG_IS_LINKED))
1366 remove_button_link(tmp); 1531 remove_button_link (tmp);
1367 remove_ob(tmp); 1532 remove_ob (tmp);
1368 free_object(tmp); 1533 free_object (tmp);
1369 } 1534 }
1370} 1535}
1371 1536
1372/* 1537/*
1373 * Remove and free all objects in the given map. 1538 * Remove and free all objects in the given map.
1374 */ 1539 */
1375 1540
1541void
1376void free_all_objects(mapstruct *m) { 1542free_all_objects (mapstruct *m)
1543{
1377 int i,j; 1544 int i, j;
1378 object *op; 1545 object *op;
1379 1546
1380 for(i=0;i<MAP_WIDTH(m);i++) 1547 for (i = 0; i < MAP_WIDTH (m); i++)
1381 for(j=0;j<MAP_HEIGHT(m);j++) { 1548 for (j = 0; j < MAP_HEIGHT (m); j++)
1549 {
1382 object *previous_obj=NULL; 1550 object *previous_obj = NULL;
1551
1383 while((op=GET_MAP_OB(m,i,j))!=NULL) { 1552 while ((op = GET_MAP_OB (m, i, j)) != NULL)
1553 {
1384 if (op==previous_obj) { 1554 if (op == previous_obj)
1555 {
1385 LOG(llevDebug, "free_all_objects: Link error, bailing out.\n"); 1556 LOG (llevDebug, "free_all_objects: Link error, bailing out.\n");
1386 break; 1557 break;
1387 } 1558 }
1388 previous_obj=op; 1559 previous_obj = op;
1389 if(op->head!=NULL) 1560 if (op->head != NULL)
1390 op = op->head; 1561 op = op->head;
1391 1562
1392 /* If the map isn't in memory, free_object will remove and 1563 /* If the map isn't in memory, free_object will remove and
1393 * free objects in op's inventory. So let it do the job. 1564 * free objects in op's inventory. So let it do the job.
1394 */ 1565 */
1395 if (m->in_memory==MAP_IN_MEMORY) 1566 if (m->in_memory == MAP_IN_MEMORY)
1396 clean_object(op); 1567 clean_object (op);
1397 remove_ob(op); 1568 remove_ob (op);
1398 free_object(op); 1569 free_object (op);
1399 } 1570 }
1400 } 1571 }
1401#ifdef MANY_CORES
1402 /* I see periodic cores on metalforge where a map has been swapped out, but apparantly
1403 * an item on that map was not saved - look for that condition and die as appropriate -
1404 * this leaves more of the map data intact for better debugging.
1405 */
1406 for (op=objects; op!=NULL; op=op->next) {
1407 if (!QUERY_FLAG(op, FLAG_REMOVED) && op->map == m) {
1408 LOG(llevDebug,"free_all_objects: object %s still on map after it should have been freed\n", op->name);
1409 abort();
1410 }
1411 }
1412#endif
1413} 1572}
1414 1573
1415/* 1574/*
1416 * Frees everything allocated by the given mapstructure. 1575 * Frees everything allocated by the given mapstructure.
1417 * don't free tmpname - our caller is left to do that 1576 * don't free tmpname - our caller is left to do that
1418 */ 1577 */
1419 1578
1579void
1420void free_map(mapstruct *m,int flag) { 1580free_map (mapstruct *m, int flag)
1581{
1421 int i; 1582 int i;
1422 1583
1423 if (!m->in_memory) { 1584 if (!m->in_memory)
1585 {
1424 LOG(llevError,"Trying to free freed map.\n"); 1586 LOG (llevError, "Trying to free freed map.\n");
1425 return; 1587 return;
1426 } 1588 }
1427 if (flag && m->spaces) free_all_objects(m); 1589 if (flag && m->spaces)
1590 free_all_objects (m);
1591 if (m->name)
1428 if (m->name) FREE_AND_CLEAR(m->name); 1592 FREE_AND_CLEAR (m->name);
1593 if (m->spaces)
1429 if (m->spaces) FREE_AND_CLEAR(m->spaces); 1594 FREE_AND_CLEAR (m->spaces);
1595 if (m->msg)
1430 if (m->msg) FREE_AND_CLEAR(m->msg); 1596 FREE_AND_CLEAR (m->msg);
1597 if (m->maplore)
1431 if (m->maplore) FREE_AND_CLEAR(m->maplore); 1598 FREE_AND_CLEAR (m->maplore);
1432 if (m->shopitems) FREE_AND_CLEAR(m->shopitems); 1599 if (m->shopitems)
1600 delete[]m->shopitems;
1601 m->shopitems = 0;
1602 if (m->shoprace)
1433 if (m->shoprace) FREE_AND_CLEAR(m->shoprace); 1603 FREE_AND_CLEAR (m->shoprace);
1434 if (m->buttons) 1604 if (m->buttons)
1435 free_objectlinkpt(m->buttons); 1605 free_objectlinkpt (m->buttons);
1436 m->buttons = NULL; 1606 m->buttons = NULL;
1437 for (i=0; i<4; i++) { 1607 for (i = 0; i < 4; i++)
1608 {
1609 if (m->tile_path[i])
1438 if (m->tile_path[i]) FREE_AND_CLEAR(m->tile_path[i]); 1610 FREE_AND_CLEAR (m->tile_path[i]);
1439 m->tile_map[i] = NULL; 1611 m->tile_map[i] = NULL;
1440 } 1612 }
1441 m->in_memory = MAP_SWAPPED; 1613 m->in_memory = MAP_SWAPPED;
1442} 1614}
1443 1615
1444/* 1616/*
1445 * function: vanish mapstruct 1617 * function: vanish mapstruct
1446 * m : pointer to mapstruct, if NULL no action 1618 * m : pointer to mapstruct, if NULL no action
1447 * this deletes all the data on the map (freeing pointers) 1619 * this deletes all the data on the map (freeing pointers)
1448 * and then removes this map from the global linked list of maps. 1620 * and then removes this map from the global linked list of maps.
1449 */ 1621 */
1450 1622
1623void
1451void delete_map(mapstruct *m) { 1624delete_map (mapstruct *m)
1625{
1452 mapstruct *tmp, *last; 1626 mapstruct *tmp, *last;
1453 int i; 1627 int i;
1454 1628
1455 if (!m) 1629 if (!m)
1456 return; 1630 return;
1457 1631
1458 m->clear (); 1632 m->clear ();
1459 1633
1460 if (m->in_memory == MAP_IN_MEMORY) { 1634 if (m->in_memory == MAP_IN_MEMORY)
1635 {
1461 /* change to MAP_SAVING, even though we are not, 1636 /* change to MAP_SAVING, even though we are not,
1462 * so that remove_ob doesn't do as much work. 1637 * so that remove_ob doesn't do as much work.
1638 */
1639 m->in_memory = MAP_SAVING;
1640 free_map (m, 1);
1641 }
1642 /* move this out of free_map, since tmpname can still be needed if
1643 * the map is swapped out.
1644 */
1645 if (m->tmpname)
1646 {
1647 free (m->tmpname);
1648 m->tmpname = NULL;
1649 }
1650 last = NULL;
1651 /* We need to look through all the maps and see if any maps
1652 * are pointing at this one for tiling information. Since
1653 * tiling can be assymetric, we just can not look to see which
1654 * maps this map tiles with and clears those.
1655 */
1656 for (tmp = first_map; tmp != NULL; tmp = tmp->next)
1657 {
1658 if (tmp->next == m)
1659 last = tmp;
1660
1661 /* This should hopefully get unrolled on a decent compiler */
1662 for (i = 0; i < 4; i++)
1663 if (tmp->tile_map[i] == m)
1664 tmp->tile_map[i] = NULL;
1665 }
1666
1667 /* If last is null, then this should be the first map in the list */
1668 if (!last)
1669 {
1670 if (m == first_map)
1671 first_map = m->next;
1672 else
1673 /* m->path is a static char, so should hopefully still have
1674 * some useful data in it.
1463 */ 1675 */
1464 m->in_memory = MAP_SAVING;
1465 free_map (m, 1);
1466 }
1467 /* move this out of free_map, since tmpname can still be needed if
1468 * the map is swapped out.
1469 */
1470 if (m->tmpname) {
1471 free(m->tmpname);
1472 m->tmpname=NULL;
1473 }
1474 last = NULL;
1475 /* We need to look through all the maps and see if any maps
1476 * are pointing at this one for tiling information. Since
1477 * tiling can be assymetric, we just can not look to see which
1478 * maps this map tiles with and clears those.
1479 */
1480 for (tmp = first_map; tmp != NULL; tmp = tmp->next) {
1481 if (tmp->next == m) last = tmp;
1482
1483 /* This should hopefully get unrolled on a decent compiler */
1484 for (i=0; i<4; i++)
1485 if (tmp->tile_map[i] == m) tmp->tile_map[i]=NULL;
1486 }
1487
1488 /* If last is null, then this should be the first map in the list */
1489 if (!last) {
1490 if (m == first_map)
1491 first_map = m->next;
1492 else
1493 /* m->path is a static char, so should hopefully still have
1494 * some useful data in it.
1495 */
1496 LOG(llevError,"delete_map: Unable to find map %s in list\n", 1676 LOG (llevError, "delete_map: Unable to find map %s in list\n", m->path);
1497 m->path);
1498 } 1677 }
1499 else 1678 else
1500 last->next = m->next; 1679 last->next = m->next;
1501 1680
1502 free (m); 1681 delete m;
1503} 1682}
1504 1683
1505 1684
1506 1685
1507/* 1686/*
… …
1514 * dont do any more name translation on it. 1693 * dont do any more name translation on it.
1515 * 1694 *
1516 * Returns a pointer to the given map. 1695 * Returns a pointer to the given map.
1517 */ 1696 */
1518 1697
1698mapstruct *
1519mapstruct *ready_map_name(const char *name, int flags) { 1699ready_map_name (const char *name, int flags)
1700{
1520 mapstruct *m; 1701 mapstruct *m;
1521 1702
1522 if (!name) 1703 if (!name)
1523 return (NULL); 1704 return (NULL);
1524 1705
1525 /* Have we been at this level before? */ 1706 /* Have we been at this level before? */
1526 m = has_been_loaded (name); 1707 m = has_been_loaded (name);
1527 1708
1528 /* Map is good to go, so just return it */ 1709 /* Map is good to go, so just return it */
1529 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY)) { 1710 if (m && (m->in_memory == MAP_LOADING || m->in_memory == MAP_IN_MEMORY))
1711 {
1530 return m; 1712 return m;
1531 } 1713 }
1532 1714
1533 /* unique maps always get loaded from their original location, and never 1715 /* unique maps always get loaded from their original location, and never
1534 * a temp location. Likewise, if map_flush is set, or we have never loaded 1716 * a temp location. Likewise, if map_flush is set, or we have never loaded
1535 * this map, load it now. I removed the reset checking from here - 1717 * this map, load it now. I removed the reset checking from here -
1536 * it seems the probability of a player trying to enter a map that should 1718 * it seems the probability of a player trying to enter a map that should
1537 * reset but hasn't yet is quite low, and removing that makes this function 1719 * reset but hasn't yet is quite low, and removing that makes this function
1538 * a bit cleaner (and players probably shouldn't rely on exact timing for 1720 * a bit cleaner (and players probably shouldn't rely on exact timing for
1539 * resets in any case - if they really care, they should use the 'maps command. 1721 * resets in any case - if they really care, they should use the 'maps command.
1540 */ 1722 */
1541 if ((flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE)) || !m) { 1723 if ((flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)) || !m)
1724 {
1542 1725
1543 /* first visit or time to reset */ 1726 /* first visit or time to reset */
1544 if (m) { 1727 if (m)
1728 {
1545 clean_tmp_map(m); /* Doesn't make much difference */ 1729 clean_tmp_map (m); /* Doesn't make much difference */
1546 delete_map(m); 1730 delete_map (m);
1547 } 1731 }
1548 1732
1549 /* create and load a map */ 1733 /* create and load a map */
1550 if (flags & MAP_PLAYER_UNIQUE) 1734 if (flags & MAP_PLAYER_UNIQUE)
1551 LOG(llevDebug, "Trying to load map %s.\n", name); 1735 LOG (llevDebug, "Trying to load map %s.\n", name);
1552 else 1736 else
1553 LOG(llevDebug, "Trying to load map %s.\n", create_pathname(name)); 1737 LOG (llevDebug, "Trying to load map %s.\n", create_pathname (name));
1554 1738
1739 //eval_pv ("$x = Event::time", 1);//D
1555 if (!(m = load_original_map(name, (flags & MAP_PLAYER_UNIQUE)))) 1740 if (!(m = load_original_map (name, (flags & MAP_PLAYER_UNIQUE))))
1556 return (NULL); 1741 return (NULL);
1742 //eval_pv ("warn \"LOAD \", Event::time - $x", 1);//D
1557 1743
1558 fix_auto_apply(m); /* Chests which open as default */ 1744 fix_auto_apply (m); /* Chests which open as default */
1559 1745
1560 /* If a player unique map, no extra unique object file to load. 1746 /* If a player unique map, no extra unique object file to load.
1561 * if from the editor, likewise. 1747 * if from the editor, likewise.
1562 */ 1748 */
1563 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE))) 1749 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE)))
1564 load_unique_objects(m); 1750 load_unique_objects (m);
1565 1751
1566 if (! (flags & (MAP_FLUSH|MAP_PLAYER_UNIQUE|MAP_OVERLAY))) { 1752 if (!(flags & (MAP_FLUSH | MAP_PLAYER_UNIQUE | MAP_OVERLAY)))
1753 {
1567 m=load_overlay_map(name, m); 1754 m = load_overlay_map (name, m);
1568 if (m==NULL) 1755 if (m == NULL)
1569 return NULL; 1756 return NULL;
1570 } 1757 }
1571 1758
1572 if (flags & MAP_PLAYER_UNIQUE) 1759 if (flags & MAP_PLAYER_UNIQUE)
1573 INVOKE_MAP (SWAPIN, m); 1760 INVOKE_MAP (SWAPIN, m);
1574 1761
1575 } else { 1762 }
1763 else
1764 {
1576 /* If in this loop, we found a temporary map, so load it up. */ 1765 /* If in this loop, we found a temporary map, so load it up. */
1577 1766
1578 m=load_temporary_map (m); 1767 m = load_temporary_map (m);
1768 if (m == NULL)
1579 if(m==NULL) return NULL; 1769 return NULL;
1580 load_unique_objects(m); 1770 load_unique_objects (m);
1581 1771
1582 clean_tmp_map(m); 1772 clean_tmp_map (m);
1583 m->in_memory = MAP_IN_MEMORY; 1773 m->in_memory = MAP_IN_MEMORY;
1584 /* tempnam() on sun systems (probably others) uses malloc 1774 /* tempnam() on sun systems (probably others) uses malloc
1585 * to allocated space for the string. Free it here. 1775 * to allocated space for the string. Free it here.
1586 * In some cases, load_temporary_map above won't find the 1776 * In some cases, load_temporary_map above won't find the
1587 * temporary map, and so has reloaded a new map. If that 1777 * temporary map, and so has reloaded a new map. If that
1588 * is the case, tmpname is now null 1778 * is the case, tmpname is now null
1589 */ 1779 */
1590 if (m->tmpname) free(m->tmpname); 1780 if (m->tmpname)
1781 free (m->tmpname);
1591 m->tmpname = NULL; 1782 m->tmpname = NULL;
1592 /* It's going to be saved anew anyway */ 1783 /* It's going to be saved anew anyway */
1593 } 1784 }
1594 1785
1595 /* Below here is stuff common to both first time loaded maps and 1786 /* Below here is stuff common to both first time loaded maps and
1596 * temp maps. 1787 * temp maps.
1597 */ 1788 */
1598 1789
1599 decay_objects(m); /* start the decay */ 1790 decay_objects (m); /* start the decay */
1600 /* In case other objects press some buttons down */ 1791 /* In case other objects press some buttons down */
1601 update_buttons(m); 1792 update_buttons (m);
1602 if (m->outdoor) 1793 if (m->outdoor)
1603 set_darkness_map(m); 1794 set_darkness_map (m);
1604 /* run the weather over this map */ 1795 /* run the weather over this map */
1605 weather_effect(name); 1796 weather_effect (name);
1606 return m; 1797 return m;
1607} 1798}
1608 1799
1609 1800
1610/* 1801/*
1611 * This routine is supposed to find out the difficulty of the map. 1802 * This routine is supposed to find out the difficulty of the map.
… …
1616 * in the map is zero, then use this routine. Maps should really 1807 * in the map is zero, then use this routine. Maps should really
1617 * have a difficulty set than using this function - human calculation 1808 * have a difficulty set than using this function - human calculation
1618 * is much better than this functions guesswork. 1809 * is much better than this functions guesswork.
1619 */ 1810 */
1620 1811
1812int
1621int calculate_difficulty(mapstruct *m) { 1813calculate_difficulty (mapstruct *m)
1814{
1622 object *op; 1815 object *op;
1623 archetype *at; 1816 archetype *at;
1624 int x, y, i, diff; 1817 int x, y, i;
1625 long monster_cnt = 0; 1818 long monster_cnt = 0;
1626 double avgexp = 0; 1819 double avgexp = 0;
1627 sint64 total_exp = 0; 1820 sint64 total_exp = 0;
1628 1821
1629 if (MAP_DIFFICULTY (m)) 1822 if (MAP_DIFFICULTY (m))
1630 { 1823 {
1631 LOG(llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m)); 1824 LOG (llevDebug, "Using stored map difficulty: %d\n", MAP_DIFFICULTY (m));
1632 return MAP_DIFFICULTY (m); 1825 return MAP_DIFFICULTY (m);
1633 } 1826 }
1634 1827
1635 for(x = 0; x < MAP_WIDTH(m); x++) 1828 for (x = 0; x < MAP_WIDTH (m); x++)
1636 for(y = 0; y < MAP_HEIGHT(m); y++) 1829 for (y = 0; y < MAP_HEIGHT (m); y++)
1637 for(op = get_map_ob(m, x, y); op != NULL; op = op->above) 1830 for (op = get_map_ob (m, x, y); op != NULL; op = op->above)
1638 { 1831 {
1639 if(QUERY_FLAG (op, FLAG_MONSTER)) 1832 if (QUERY_FLAG (op, FLAG_MONSTER))
1640 { 1833 {
1641 total_exp += op->stats.exp; 1834 total_exp += op->stats.exp;
1642 monster_cnt++; 1835 monster_cnt++;
1643 } 1836 }
1644 1837
1645 if(QUERY_FLAG (op, FLAG_GENERATOR)) 1838 if (QUERY_FLAG (op, FLAG_GENERATOR))
1646 { 1839 {
1647 total_exp += op->stats.exp; 1840 total_exp += op->stats.exp;
1648 at = type_to_archetype(GENERATE_TYPE (op)); 1841 at = type_to_archetype (GENERATE_TYPE (op));
1649 1842
1650 if(at != NULL) 1843 if (at != NULL)
1651 total_exp += at->clone.stats.exp * 8; 1844 total_exp += at->clone.stats.exp * 8;
1652 1845
1653 monster_cnt++; 1846 monster_cnt++;
1654 } 1847 }
1655 } 1848 }
… …
1666 } 1859 }
1667 1860
1668 return 1; 1861 return 1;
1669} 1862}
1670 1863
1864void
1671void clean_tmp_map(mapstruct *m) { 1865clean_tmp_map (mapstruct *m)
1866{
1672 if(m->tmpname == NULL) 1867 if (m->tmpname == NULL)
1673 return; 1868 return;
1674 INVOKE_MAP (CLEAN, m); 1869 INVOKE_MAP (CLEAN, m);
1675 (void) unlink(m->tmpname); 1870 (void) unlink (m->tmpname);
1676} 1871}
1677 1872
1873void
1678void free_all_maps(void) 1874free_all_maps (void)
1679{ 1875{
1680 int real_maps=0; 1876 int real_maps = 0;
1681 1877
1682 while (first_map) { 1878 while (first_map)
1879 {
1683 /* I think some of the callers above before it gets here set this to be 1880 /* I think some of the callers above before it gets here set this to be
1684 * saving, but we still want to free this data 1881 * saving, but we still want to free this data
1685 */ 1882 */
1686 if (first_map->in_memory == MAP_SAVING) first_map->in_memory = MAP_IN_MEMORY; 1883 if (first_map->in_memory == MAP_SAVING)
1884 first_map->in_memory = MAP_IN_MEMORY;
1687 delete_map(first_map); 1885 delete_map (first_map);
1688 real_maps++; 1886 real_maps++;
1689 } 1887 }
1690 LOG(llevDebug,"free_all_maps: Freed %d maps\n", real_maps); 1888 LOG (llevDebug, "free_all_maps: Freed %d maps\n", real_maps);
1691} 1889}
1692 1890
1693/* change_map_light() - used to change map light level (darkness) 1891/* change_map_light() - used to change map light level (darkness)
1694 * up or down. Returns true if successful. It should now be 1892 * up or down. Returns true if successful. It should now be
1695 * possible to change a value by more than 1. 1893 * possible to change a value by more than 1.
1696 * Move this from los.c to map.c since this is more related 1894 * Move this from los.c to map.c since this is more related
1697 * to maps than los. 1895 * to maps than los.
1698 * postive values make it darker, negative make it brighter 1896 * postive values make it darker, negative make it brighter
1699 */ 1897 */
1700 1898
1899int
1701int change_map_light(mapstruct *m, int change) { 1900change_map_light (mapstruct *m, int change)
1901{
1702 int new_level = m->darkness + change; 1902 int new_level = m->darkness + change;
1703 1903
1704 /* Nothing to do */ 1904 /* Nothing to do */
1705 if(!change || (new_level <= 0 && m->darkness == 0) || 1905 if (!change || (new_level <= 0 && m->darkness == 0) || (new_level >= MAX_DARKNESS && m->darkness >= MAX_DARKNESS))
1706 (new_level >= MAX_DARKNESS && m->darkness >=MAX_DARKNESS)) { 1906 {
1707 return 0; 1907 return 0;
1708 } 1908 }
1709 1909
1710 /* inform all players on the map */ 1910 /* inform all players on the map */
1711 if (change>0) 1911 if (change > 0)
1712 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes darker."); 1912 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes darker.");
1713 else 1913 else
1714 new_info_map(NDI_BLACK|NDI_UNIQUE, m,"It becomes brighter."); 1914 new_info_map (NDI_BLACK | NDI_UNIQUE, m, "It becomes brighter.");
1715 1915
1716 /* Do extra checking. since m->darkness is a unsigned value, 1916 /* Do extra checking. since m->darkness is a unsigned value,
1717 * we need to be extra careful about negative values. 1917 * we need to be extra careful about negative values.
1718 * In general, the checks below are only needed if change 1918 * In general, the checks below are only needed if change
1719 * is not +/-1 1919 * is not +/-1
1720 */ 1920 */
1721 if (new_level < 0) m->darkness = 0; 1921 if (new_level < 0)
1722 else if (new_level >=MAX_DARKNESS) m->darkness = MAX_DARKNESS; 1922 m->darkness = 0;
1923 else if (new_level >= MAX_DARKNESS)
1924 m->darkness = MAX_DARKNESS;
1925 else
1723 else m->darkness=new_level; 1926 m->darkness = new_level;
1724 1927
1725 /* All clients need to get re-updated for the change */ 1928 /* All clients need to get re-updated for the change */
1726 update_all_map_los(m); 1929 update_all_map_los (m);
1727 return 1; 1930 return 1;
1728} 1931}
1729 1932
1730 1933
1731/* 1934/*
1732 * This function updates various attributes about a specific space 1935 * This function updates various attributes about a specific space
1733 * on the map (what it looks like, whether it blocks magic, 1936 * on the map (what it looks like, whether it blocks magic,
1734 * has a living creatures, prevents people from passing 1937 * has a living creatures, prevents people from passing
1735 * through, etc) 1938 * through, etc)
1736 */ 1939 */
1940void
1737void update_position (mapstruct *m, int x, int y) { 1941update_position (mapstruct *m, int x, int y)
1942{
1738 object *tmp, *last = NULL; 1943 object *tmp, *last = NULL;
1739 uint8 flags = 0, oldflags, light=0, anywhere=0; 1944 uint8 flags = 0, oldflags, light = 0, anywhere = 0;
1740 New_Face *top,*floor, *middle; 1945 New_Face *top, *floor, *middle;
1741 object *top_obj, *floor_obj, *middle_obj; 1946 object *top_obj, *floor_obj, *middle_obj;
1742 MoveType move_block=0, move_slow=0, move_on=0, move_off=0, move_allow=0; 1947 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1743 1948
1744 oldflags = GET_MAP_FLAGS(m,x,y); 1949 oldflags = GET_MAP_FLAGS (m, x, y);
1745 if (!(oldflags & P_NEED_UPDATE)) { 1950 if (!(oldflags & P_NEED_UPDATE))
1951 {
1746 LOG(llevDebug,"update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", 1952 LOG (llevDebug, "update_position called with P_NEED_UPDATE not set: %s (%d, %d)\n", m->path, x, y);
1747 m->path, x, y);
1748 return; 1953 return;
1749 } 1954 }
1750 1955
1751 middle=blank_face; 1956 middle = blank_face;
1752 top=blank_face; 1957 top = blank_face;
1753 floor=blank_face; 1958 floor = blank_face;
1754 1959
1755 middle_obj = NULL; 1960 middle_obj = NULL;
1756 top_obj = NULL; 1961 top_obj = NULL;
1757 floor_obj = NULL; 1962 floor_obj = NULL;
1758 1963
1759 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above) { 1964 for (tmp = get_map_ob (m, x, y); tmp; last = tmp, tmp = tmp->above)
1965 {
1760 1966
1761 /* This could be made additive I guess (two lights better than 1967 /* This could be made additive I guess (two lights better than
1762 * one). But if so, it shouldn't be a simple additive - 2 1968 * one). But if so, it shouldn't be a simple additive - 2
1763 * light bulbs do not illuminate twice as far as once since 1969 * light bulbs do not illuminate twice as far as once since
1764 * it is a disapation factor that is squared (or is it cubed?) 1970 * it is a disapation factor that is squared (or is it cubed?)
1765 */ 1971 */
1766 if (tmp->glow_radius > light) light = tmp->glow_radius; 1972 if (tmp->glow_radius > light)
1973 light = tmp->glow_radius;
1767 1974
1768 /* This call is needed in order to update objects the player 1975 /* This call is needed in order to update objects the player
1769 * is standing in that have animations (ie, grass, fire, etc). 1976 * is standing in that have animations (ie, grass, fire, etc).
1770 * However, it also causes the look window to be re-drawn 1977 * However, it also causes the look window to be re-drawn
1771 * 3 times each time the player moves, because many of the 1978 * 3 times each time the player moves, because many of the
1772 * functions the move_player calls eventualy call this. 1979 * functions the move_player calls eventualy call this.
1773 * 1980 *
1774 * Always put the player down for drawing. 1981 * Always put the player down for drawing.
1775 */ 1982 */
1776 if (!tmp->invisible) { 1983 if (!tmp->invisible)
1984 {
1777 if ((tmp->type==PLAYER || QUERY_FLAG(tmp, FLAG_MONSTER))) { 1985 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1986 {
1778 top = tmp->face; 1987 top = tmp->face;
1779 top_obj = tmp; 1988 top_obj = tmp;
1780 } 1989 }
1781 else if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) { 1990 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1991 {
1782 /* If we got a floor, that means middle and top were below it, 1992 /* If we got a floor, that means middle and top were below it,
1783 * so should not be visible, so we clear them. 1993 * so should not be visible, so we clear them.
1784 */ 1994 */
1785 middle=blank_face; 1995 middle = blank_face;
1786 top=blank_face; 1996 top = blank_face;
1787 floor = tmp->face; 1997 floor = tmp->face;
1788 floor_obj = tmp; 1998 floor_obj = tmp;
1789 } 1999 }
1790 /* Flag anywhere have high priority */ 2000 /* Flag anywhere have high priority */
1791 else if (QUERY_FLAG(tmp, FLAG_SEE_ANYWHERE)) { 2001 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
2002 {
1792 middle = tmp->face; 2003 middle = tmp->face;
1793 2004
1794 middle_obj = tmp; 2005 middle_obj = tmp;
1795 anywhere =1; 2006 anywhere = 1;
1796 } 2007 }
1797 /* Find the highest visible face around. If equal 2008 /* Find the highest visible face around. If equal
1798 * visibilities, we still want the one nearer to the 2009 * visibilities, we still want the one nearer to the
1799 * top 2010 * top
1800 */ 2011 */
1801 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) { 2012 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere))
2013 {
1802 middle = tmp->face; 2014 middle = tmp->face;
1803 middle_obj = tmp; 2015 middle_obj = tmp;
1804 } 2016 }
1805 } 2017 }
1806 if (tmp==tmp->above) { 2018 if (tmp == tmp->above)
2019 {
1807 LOG(llevError, "Error in structure of map\n"); 2020 LOG (llevError, "Error in structure of map\n");
1808 exit (-1); 2021 exit (-1);
1809 }
1810 2022 }
2023
1811 move_slow |= tmp->move_slow; 2024 move_slow |= tmp->move_slow;
1812 move_block |= tmp->move_block; 2025 move_block |= tmp->move_block;
1813 move_on |= tmp->move_on; 2026 move_on |= tmp->move_on;
1814 move_off |= tmp->move_off; 2027 move_off |= tmp->move_off;
1815 move_allow |= tmp->move_allow; 2028 move_allow |= tmp->move_allow;
1816 2029
1817 if (QUERY_FLAG(tmp,FLAG_ALIVE)) 2030 if (QUERY_FLAG (tmp, FLAG_ALIVE))
1818 flags |= P_IS_ALIVE; 2031 flags |= P_IS_ALIVE;
1819 if (QUERY_FLAG(tmp,FLAG_NO_MAGIC)) 2032 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC))
1820 flags |= P_NO_MAGIC; 2033 flags |= P_NO_MAGIC;
1821 if (QUERY_FLAG(tmp,FLAG_DAMNED)) 2034 if (QUERY_FLAG (tmp, FLAG_DAMNED))
1822 flags |= P_NO_CLERIC; 2035 flags |= P_NO_CLERIC;
1823 if (tmp->type == SAFE_GROUND) 2036 if (tmp->type == SAFE_GROUND)
1824 flags |= P_SAFE | P_NO_CLERIC | P_NO_MAGIC; 2037 flags |= P_SAFE;
1825 2038
1826 if (QUERY_FLAG(tmp,FLAG_BLOCKSVIEW)) 2039 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW))
1827 flags |= P_BLOCKSVIEW; 2040 flags |= P_BLOCKSVIEW;
1828 } /* for stack of objects */ 2041 } /* for stack of objects */
1829 2042
1830 /* we don't want to rely on this function to have accurate flags, but 2043 /* we don't want to rely on this function to have accurate flags, but
1831 * since we're already doing the work, we calculate them here. 2044 * since we're already doing the work, we calculate them here.
1832 * if they don't match, logic is broken someplace. 2045 * if they don't match, logic is broken someplace.
1833 */ 2046 */
1834 if (((oldflags & ~(P_NEED_UPDATE|P_NO_ERROR)) != flags) && 2047 if (((oldflags & ~(P_NEED_UPDATE | P_NO_ERROR)) != flags) && (!(oldflags & P_NO_ERROR)))
1835 (!(oldflags & P_NO_ERROR))) { 2048 {
1836 LOG(llevDebug,"update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n", 2049 LOG (llevDebug, "update_position: updated flags do not match old flags: %s (old=%d,new=%d) %x != %x\n",
1837 m->path, x, y,
1838 (oldflags & ~P_NEED_UPDATE), flags); 2050 m->path, x, y, (oldflags & ~P_NEED_UPDATE), flags);
1839 } 2051 }
1840 SET_MAP_FLAGS(m, x, y, flags); 2052 SET_MAP_FLAGS (m, x, y, flags);
1841 SET_MAP_MOVE_BLOCK(m, x, y, move_block & ~move_allow); 2053 SET_MAP_MOVE_BLOCK (m, x, y, move_block & ~move_allow);
1842 SET_MAP_MOVE_ON(m, x, y, move_on); 2054 SET_MAP_MOVE_ON (m, x, y, move_on);
1843 SET_MAP_MOVE_OFF(m, x, y, move_off); 2055 SET_MAP_MOVE_OFF (m, x, y, move_off);
1844 SET_MAP_MOVE_SLOW(m, x, y, move_slow); 2056 SET_MAP_MOVE_SLOW (m, x, y, move_slow);
1845 2057
1846 /* At this point, we have a floor face (if there is a floor), 2058 /* At this point, we have a floor face (if there is a floor),
1847 * and the floor is set - we are not going to touch it at 2059 * and the floor is set - we are not going to touch it at
1848 * this point. 2060 * this point.
1849 * middle contains the highest visibility face. 2061 * middle contains the highest visibility face.
1850 * top contains a player/monster face, if there is one. 2062 * top contains a player/monster face, if there is one.
1851 * 2063 *
1852 * We now need to fill in top.face and/or middle.face. 2064 * We now need to fill in top.face and/or middle.face.
1853 */ 2065 */
1854 2066
1855 /* If the top face also happens to be high visibility, re-do our 2067 /* If the top face also happens to be high visibility, re-do our
1856 * middle face. This should not happen, as we already have the 2068 * middle face. This should not happen, as we already have the
1857 * else statement above so middle should not get set. OTOH, it 2069 * else statement above so middle should not get set. OTOH, it
1858 * may be possible for the faces to match but be different objects. 2070 * may be possible for the faces to match but be different objects.
1859 */ 2071 */
1860 if (top == middle) middle=blank_face; 2072 if (top == middle)
2073 middle = blank_face;
1861 2074
1862 /* There are three posibilities at this point: 2075 /* There are three posibilities at this point:
1863 * 1) top face is set, need middle to be set. 2076 * 1) top face is set, need middle to be set.
1864 * 2) middle is set, need to set top. 2077 * 2) middle is set, need to set top.
1865 * 3) neither middle or top is set - need to set both. 2078 * 3) neither middle or top is set - need to set both.
1866 */ 2079 */
1867 2080
1868 for (tmp=last; tmp; tmp=tmp->below) { 2081 for (tmp = last; tmp; tmp = tmp->below)
2082 {
1869 /* Once we get to a floor, stop, since we already have a floor object */ 2083 /* Once we get to a floor, stop, since we already have a floor object */
1870 if (QUERY_FLAG(tmp,FLAG_IS_FLOOR)) break; 2084 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
2085 break;
1871 2086
1872 /* If two top faces are already set, quit processing */ 2087 /* If two top faces are already set, quit processing */
1873 if ((top != blank_face) && (middle != blank_face)) break; 2088 if ((top != blank_face) && (middle != blank_face))
2089 break;
1874 2090
1875 /* Only show visible faces, unless its the editor - show all */ 2091 /* Only show visible faces, unless its the editor - show all */
1876 if (!tmp->invisible || editor) { 2092 if (!tmp->invisible || editor)
2093 {
1877 /* Fill in top if needed */ 2094 /* Fill in top if needed */
1878 if (top == blank_face) { 2095 if (top == blank_face)
2096 {
1879 top = tmp->face; 2097 top = tmp->face;
1880 top_obj = tmp; 2098 top_obj = tmp;
2099 if (top == middle)
1881 if (top == middle) middle=blank_face; 2100 middle = blank_face;
2101 }
1882 } else { 2102 else
2103 {
1883 /* top is already set - we should only get here if 2104 /* top is already set - we should only get here if
1884 * middle is not set 2105 * middle is not set
1885 * 2106 *
1886 * Set the middle face and break out, since there is nothing 2107 * Set the middle face and break out, since there is nothing
1887 * more to fill in. We don't check visiblity here, since 2108 * more to fill in. We don't check visiblity here, since
1888 * 2109 *
1889 */ 2110 */
1890 if (tmp->face != top ) { 2111 if (tmp->face != top)
2112 {
1891 middle = tmp->face; 2113 middle = tmp->face;
1892 middle_obj = tmp; 2114 middle_obj = tmp;
1893 break; 2115 break;
1894 } 2116 }
1895 } 2117 }
1896 } 2118 }
1897 } 2119 }
1898 if (middle == floor) middle = blank_face; 2120 if (middle == floor)
1899 if (top == middle) middle = blank_face; 2121 middle = blank_face;
2122 if (top == middle)
2123 middle = blank_face;
1900 SET_MAP_FACE(m,x,y,top,0); 2124 SET_MAP_FACE (m, x, y, top, 0);
1901 if(top != blank_face) 2125 if (top != blank_face)
1902 SET_MAP_FACE_OBJ(m,x,y,top_obj,0); 2126 SET_MAP_FACE_OBJ (m, x, y, top_obj, 0);
1903 else 2127 else
1904 SET_MAP_FACE_OBJ(m,x,y,NULL,0); 2128 SET_MAP_FACE_OBJ (m, x, y, NULL, 0);
1905 SET_MAP_FACE(m,x,y,middle,1); 2129 SET_MAP_FACE (m, x, y, middle, 1);
1906 if(middle != blank_face) 2130 if (middle != blank_face)
1907 SET_MAP_FACE_OBJ(m,x,y,middle_obj,1); 2131 SET_MAP_FACE_OBJ (m, x, y, middle_obj, 1);
1908 else 2132 else
1909 SET_MAP_FACE_OBJ(m,x,y,NULL,1); 2133 SET_MAP_FACE_OBJ (m, x, y, NULL, 1);
1910 SET_MAP_FACE(m,x,y,floor,2); 2134 SET_MAP_FACE (m, x, y, floor, 2);
1911 if(floor != blank_face) 2135 if (floor != blank_face)
1912 SET_MAP_FACE_OBJ(m,x,y,floor_obj,2); 2136 SET_MAP_FACE_OBJ (m, x, y, floor_obj, 2);
1913 else 2137 else
1914 SET_MAP_FACE_OBJ(m,x,y,NULL,2); 2138 SET_MAP_FACE_OBJ (m, x, y, NULL, 2);
1915 SET_MAP_LIGHT(m,x,y,light); 2139 SET_MAP_LIGHT (m, x, y, light);
1916} 2140}
1917 2141
1918 2142
2143void
1919void set_map_reset_time(mapstruct *map) { 2144set_map_reset_time (mapstruct *map)
2145{
1920 int timeout; 2146 int timeout;
1921 2147
1922 timeout = MAP_RESET_TIMEOUT(map); 2148 timeout = MAP_RESET_TIMEOUT (map);
1923 if (timeout <= 0) 2149 if (timeout <= 0)
1924 timeout = MAP_DEFAULTRESET; 2150 timeout = MAP_DEFAULTRESET;
1925 if (timeout >= MAP_MAXRESET) 2151 if (timeout >= MAP_MAXRESET)
1926 timeout = MAP_MAXRESET; 2152 timeout = MAP_MAXRESET;
1927 MAP_WHEN_RESET(map) = seconds()+timeout; 2153 MAP_WHEN_RESET (map) = seconds () + timeout;
1928} 2154}
1929 2155
1930/* this updates the orig_map->tile_map[tile_num] value after loading 2156/* this updates the orig_map->tile_map[tile_num] value after loading
1931 * the map. It also takes care of linking back the freshly loaded 2157 * the map. It also takes care of linking back the freshly loaded
1932 * maps tile_map values if it tiles back to this one. It returns 2158 * maps tile_map values if it tiles back to this one. It returns
1933 * the value of orig_map->tile_map[tile_num]. It really only does this 2159 * the value of orig_map->tile_map[tile_num]. It really only does this
1934 * so that it is easier for calling functions to verify success. 2160 * so that it is easier for calling functions to verify success.
1935 */ 2161 */
1936 2162
2163static mapstruct *
1937static mapstruct *load_and_link_tiled_map(mapstruct *orig_map, int tile_num) 2164load_and_link_tiled_map (mapstruct *orig_map, int tile_num)
1938{ 2165{
1939 int dest_tile = (tile_num +2) % 4; 2166 int dest_tile = (tile_num + 2) % 4;
1940 char *path = path_combine_and_normalize(orig_map->path, orig_map->tile_path[tile_num]); 2167 char *path = path_combine_and_normalize (orig_map->path, orig_map->tile_path[tile_num]);
1941 2168
1942 orig_map->tile_map[tile_num] = ready_map_name(path, 0); 2169 orig_map->tile_map[tile_num] = ready_map_name (path, 0);
1943 2170
1944 /* need to do a strcmp here as the orig_map->path is not a shared string */ 2171 /* need to do a strcmp here as the orig_map->path is not a shared string */
1945 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && 2172 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] && !strcmp (orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
1946 !strcmp(orig_map->tile_map[tile_num]->tile_path[dest_tile], orig_map->path))
1947 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map; 2173 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1948 2174
1949 return orig_map->tile_map[tile_num]; 2175 return orig_map->tile_map[tile_num];
1950} 2176}
1951 2177
1952/* this returns TRUE if the coordinates (x,y) are out of 2178/* this returns TRUE if the coordinates (x,y) are out of
1953 * map m. This function also takes into account any 2179 * map m. This function also takes into account any
1954 * tiling considerations, loading adjacant maps as needed. 2180 * tiling considerations, loading adjacant maps as needed.
… …
1957 * This function will recursively call itself for the 2183 * This function will recursively call itself for the
1958 * tiled maps. 2184 * tiled maps.
1959 * 2185 *
1960 * 2186 *
1961 */ 2187 */
2188int
1962int out_of_map(mapstruct *m, int x, int y) 2189out_of_map (mapstruct *m, int x, int y)
1963{ 2190{
1964 2191
1965 /* If we get passed a null map, this is obviously the 2192 /* If we get passed a null map, this is obviously the
1966 * case. This generally shouldn't happen, but if the 2193 * case. This generally shouldn't happen, but if the
1967 * map loads fail below, it could happen. 2194 * map loads fail below, it could happen.
1968 */ 2195 */
1969 if (!m) return 0; 2196 if (!m)
1970
1971 if (x<0) {
1972 if (!m->tile_path[3]) return 1;
1973 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) {
1974 load_and_link_tiled_map(m, 3);
1975 }
1976 return (out_of_map(m->tile_map[3], x + MAP_WIDTH(m->tile_map[3]), y));
1977 }
1978 if (x>=MAP_WIDTH(m)) {
1979 if (!m->tile_path[1]) return 1;
1980 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) {
1981 load_and_link_tiled_map(m, 1);
1982 }
1983 return (out_of_map(m->tile_map[1], x - MAP_WIDTH(m), y));
1984 }
1985 if (y<0) {
1986 if (!m->tile_path[0]) return 1;
1987 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) {
1988 load_and_link_tiled_map(m, 0);
1989 }
1990 return (out_of_map(m->tile_map[0], x, y + MAP_HEIGHT(m->tile_map[0])));
1991 }
1992 if (y>=MAP_HEIGHT(m)) {
1993 if (!m->tile_path[2]) return 1;
1994 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) {
1995 load_and_link_tiled_map(m, 2);
1996 }
1997 return (out_of_map(m->tile_map[2], x, y - MAP_HEIGHT(m)));
1998 }
1999
2000 /* Simple case - coordinates are within this local
2001 * map.
2002 */
2003 return 0; 2197 return 0;
2198
2199 if (x < 0)
2200 {
2201 if (!m->tile_path[3])
2202 return 1;
2203 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2204 {
2205 load_and_link_tiled_map (m, 3);
2206 }
2207 return (out_of_map (m->tile_map[3], x + MAP_WIDTH (m->tile_map[3]), y));
2208 }
2209 if (x >= MAP_WIDTH (m))
2210 {
2211 if (!m->tile_path[1])
2212 return 1;
2213 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2214 {
2215 load_and_link_tiled_map (m, 1);
2216 }
2217 return (out_of_map (m->tile_map[1], x - MAP_WIDTH (m), y));
2218 }
2219 if (y < 0)
2220 {
2221 if (!m->tile_path[0])
2222 return 1;
2223 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2224 {
2225 load_and_link_tiled_map (m, 0);
2226 }
2227 return (out_of_map (m->tile_map[0], x, y + MAP_HEIGHT (m->tile_map[0])));
2228 }
2229 if (y >= MAP_HEIGHT (m))
2230 {
2231 if (!m->tile_path[2])
2232 return 1;
2233 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2234 {
2235 load_and_link_tiled_map (m, 2);
2236 }
2237 return (out_of_map (m->tile_map[2], x, y - MAP_HEIGHT (m)));
2238 }
2239
2240 /* Simple case - coordinates are within this local
2241 * map.
2242 */
2243 return 0;
2004} 2244}
2005 2245
2006/* This is basically the same as out_of_map above, but 2246/* This is basically the same as out_of_map above, but
2007 * instead we return NULL if no map is valid (coordinates 2247 * instead we return NULL if no map is valid (coordinates
2008 * out of bounds and no tiled map), otherwise it returns 2248 * out of bounds and no tiled map), otherwise it returns
2009 * the map as that the coordinates are really on, and 2249 * the map as that the coordinates are really on, and
2010 * updates x and y to be the localized coordinates. 2250 * updates x and y to be the localized coordinates.
2011 * Using this is more efficient of calling out_of_map 2251 * Using this is more efficient of calling out_of_map
2012 * and then figuring out what the real map is 2252 * and then figuring out what the real map is
2013 */ 2253 */
2254mapstruct *
2014mapstruct *get_map_from_coord(mapstruct *m, sint16 *x, sint16 *y) 2255get_map_from_coord (mapstruct *m, sint16 * x, sint16 * y)
2015{ 2256{
2016 2257
2017 if (*x<0) { 2258 if (*x < 0)
2259 {
2018 if (!m->tile_path[3]) return NULL; 2260 if (!m->tile_path[3])
2261 return NULL;
2019 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY) 2262 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
2020 load_and_link_tiled_map(m, 3); 2263 load_and_link_tiled_map (m, 3);
2021 2264
2022 *x += MAP_WIDTH(m->tile_map[3]); 2265 *x += MAP_WIDTH (m->tile_map[3]);
2023 return (get_map_from_coord(m->tile_map[3], x, y)); 2266 return (get_map_from_coord (m->tile_map[3], x, y));
2024 } 2267 }
2025 if (*x>=MAP_WIDTH(m)) { 2268 if (*x >= MAP_WIDTH (m))
2269 {
2026 if (!m->tile_path[1]) return NULL; 2270 if (!m->tile_path[1])
2271 return NULL;
2027 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY) 2272 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
2028 load_and_link_tiled_map(m, 1); 2273 load_and_link_tiled_map (m, 1);
2029 2274
2030 *x -= MAP_WIDTH(m); 2275 *x -= MAP_WIDTH (m);
2031 return (get_map_from_coord(m->tile_map[1], x, y)); 2276 return (get_map_from_coord (m->tile_map[1], x, y));
2277 }
2278 if (*y < 0)
2032 } 2279 {
2033 if (*y<0) {
2034 if (!m->tile_path[0]) return NULL; 2280 if (!m->tile_path[0])
2281 return NULL;
2035 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY) 2282 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
2036 load_and_link_tiled_map(m, 0); 2283 load_and_link_tiled_map (m, 0);
2037 2284
2038 *y += MAP_HEIGHT(m->tile_map[0]); 2285 *y += MAP_HEIGHT (m->tile_map[0]);
2039 return (get_map_from_coord(m->tile_map[0], x, y)); 2286 return (get_map_from_coord (m->tile_map[0], x, y));
2040 } 2287 }
2041 if (*y>=MAP_HEIGHT(m)) { 2288 if (*y >= MAP_HEIGHT (m))
2289 {
2042 if (!m->tile_path[2]) return NULL; 2290 if (!m->tile_path[2])
2291 return NULL;
2043 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY) 2292 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
2044 load_and_link_tiled_map(m, 2); 2293 load_and_link_tiled_map (m, 2);
2045 2294
2046 *y -= MAP_HEIGHT(m); 2295 *y -= MAP_HEIGHT (m);
2047 return (get_map_from_coord(m->tile_map[2], x, y)); 2296 return (get_map_from_coord (m->tile_map[2], x, y));
2048 } 2297 }
2049 2298
2050 /* Simple case - coordinates are within this local 2299 /* Simple case - coordinates are within this local
2051 * map. 2300 * map.
2052 */ 2301 */
2053 2302
2054 return m; 2303 return m;
2055} 2304}
2056 2305
2057/** 2306/**
2058 * Return whether map2 is adjacent to map1. If so, store the distance from 2307 * Return whether map2 is adjacent to map1. If so, store the distance from
2059 * map1 to map2 in dx/dy. 2308 * map1 to map2 in dx/dy.
2060 */ 2309 */
2310static int
2061static int adjacent_map(const mapstruct *map1, const mapstruct *map2, int *dx, int *dy) { 2311adjacent_map (const mapstruct *map1, const mapstruct *map2, int *dx, int *dy)
2312{
2062 if (!map1 || !map2) 2313 if (!map1 || !map2)
2063 return 0; 2314 return 0;
2064 2315
2065 if (map1 == map2) { 2316 if (map1 == map2)
2317 {
2066 *dx = 0; 2318 *dx = 0;
2067 *dy = 0; 2319 *dy = 0;
2068 2320
2321 }
2069 } else if (map1->tile_map[0] == map2) { /* up */ 2322 else if (map1->tile_map[0] == map2)
2323 { /* up */
2070 *dx = 0; 2324 *dx = 0;
2071 *dy = -MAP_HEIGHT(map2); 2325 *dy = -MAP_HEIGHT (map2);
2326 }
2072 } else if (map1->tile_map[1] == map2) { /* right */ 2327 else if (map1->tile_map[1] == map2)
2328 { /* right */
2073 *dx = MAP_WIDTH(map1); 2329 *dx = MAP_WIDTH (map1);
2074 *dy = 0; 2330 *dy = 0;
2331 }
2075 } else if (map1->tile_map[2] == map2) { /* down */ 2332 else if (map1->tile_map[2] == map2)
2333 { /* down */
2076 *dx = 0; 2334 *dx = 0;
2077 *dy = MAP_HEIGHT(map1); 2335 *dy = MAP_HEIGHT (map1);
2336 }
2078 } else if (map1->tile_map[3] == map2) { /* left */ 2337 else if (map1->tile_map[3] == map2)
2338 { /* left */
2079 *dx = -MAP_WIDTH(map2); 2339 *dx = -MAP_WIDTH (map2);
2080 *dy = 0; 2340 *dy = 0;
2081 2341
2342 }
2082 } else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) { /* up right */ 2343 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2)
2344 { /* up right */
2083 *dx = MAP_WIDTH(map1->tile_map[0]); 2345 *dx = MAP_WIDTH (map1->tile_map[0]);
2084 *dy = -MAP_HEIGHT(map1->tile_map[0]); 2346 *dy = -MAP_HEIGHT (map1->tile_map[0]);
2347 }
2085 } else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) { /* up left */ 2348 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2)
2349 { /* up left */
2086 *dx = -MAP_WIDTH(map2); 2350 *dx = -MAP_WIDTH (map2);
2087 *dy = -MAP_HEIGHT(map1->tile_map[0]); 2351 *dy = -MAP_HEIGHT (map1->tile_map[0]);
2352 }
2088 } else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) { /* right up */ 2353 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2)
2354 { /* right up */
2089 *dx = MAP_WIDTH(map1); 2355 *dx = MAP_WIDTH (map1);
2090 *dy = -MAP_HEIGHT(map2); 2356 *dy = -MAP_HEIGHT (map2);
2357 }
2091 } else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) { /* right down */ 2358 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2)
2359 { /* right down */
2092 *dx = MAP_WIDTH(map1); 2360 *dx = MAP_WIDTH (map1);
2093 *dy = MAP_HEIGHT(map1->tile_map[1]); 2361 *dy = MAP_HEIGHT (map1->tile_map[1]);
2362 }
2094 } else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) { /* down right */ 2363 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2)
2364 { /* down right */
2095 *dx = MAP_WIDTH(map1->tile_map[2]); 2365 *dx = MAP_WIDTH (map1->tile_map[2]);
2096 *dy = MAP_HEIGHT(map1); 2366 *dy = MAP_HEIGHT (map1);
2367 }
2097 } else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) { /* down left */ 2368 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2)
2369 { /* down left */
2098 *dx = -MAP_WIDTH(map2); 2370 *dx = -MAP_WIDTH (map2);
2099 *dy = MAP_HEIGHT(map1); 2371 *dy = MAP_HEIGHT (map1);
2372 }
2100 } else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) { /* left up */ 2373 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2)
2374 { /* left up */
2101 *dx = -MAP_WIDTH(map1->tile_map[3]); 2375 *dx = -MAP_WIDTH (map1->tile_map[3]);
2102 *dy = -MAP_HEIGHT(map2); 2376 *dy = -MAP_HEIGHT (map2);
2377 }
2103 } else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) { /* left down */ 2378 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2)
2379 { /* left down */
2104 *dx = -MAP_WIDTH(map1->tile_map[3]); 2380 *dx = -MAP_WIDTH (map1->tile_map[3]);
2105 *dy = MAP_HEIGHT(map1->tile_map[3]); 2381 *dy = MAP_HEIGHT (map1->tile_map[3]);
2106 2382
2107 } else { /* not "adjacent" enough */ 2383 }
2384 else
2385 { /* not "adjacent" enough */
2108 return 0; 2386 return 0;
2109 } 2387 }
2110 2388
2111 return 1; 2389 return 1;
2112} 2390}
2113 2391
2114/* From map.c 2392/* From map.c
2115 * This is used by get_player to determine where the other 2393 * This is used by get_player to determine where the other
2116 * creature is. get_rangevector takes into account map tiling, 2394 * creature is. get_rangevector takes into account map tiling,
… …
2130 * 2408 *
2131 * currently, the only flag supported (0x1) is don't translate for 2409 * currently, the only flag supported (0x1) is don't translate for
2132 * closest body part of 'op1' 2410 * closest body part of 'op1'
2133 */ 2411 */
2134 2412
2413void
2135void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags) { 2414get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
2415{
2136 if (!adjacent_map(op1->map, op2->map, &retval->distance_x, &retval->distance_y)) { 2416 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
2417 {
2137 /* be conservative and fill in _some_ data */ 2418 /* be conservative and fill in _some_ data */
2138 retval->distance = 100000; 2419 retval->distance = 100000;
2139 retval->distance_x = 32767; 2420 retval->distance_x = 32767;
2140 retval->distance_y = 32767; 2421 retval->distance_y = 32767;
2141 retval->direction = 0; 2422 retval->direction = 0;
2142 retval->part = 0; 2423 retval->part = 0;
2143 } else { 2424 }
2425 else
2426 {
2144 object *best; 2427 object *best;
2145 2428
2146 retval->distance_x += op2->x-op1->x; 2429 retval->distance_x += op2->x - op1->x;
2147 retval->distance_y += op2->y-op1->y; 2430 retval->distance_y += op2->y - op1->y;
2148 2431
2149 best = op1; 2432 best = op1;
2150 /* If this is multipart, find the closest part now */ 2433 /* If this is multipart, find the closest part now */
2151 if (!(flags&0x1) && op1->more) { 2434 if (!(flags & 0x1) && op1->more)
2435 {
2152 object *tmp; 2436 object *tmp;
2153 int best_distance = retval->distance_x*retval->distance_x+ 2437 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
2154 retval->distance_y*retval->distance_y, tmpi;
2155 2438
2156 /* we just take the offset of the piece to head to figure 2439 /* we just take the offset of the piece to head to figure
2157 * distance instead of doing all that work above again 2440 * distance instead of doing all that work above again
2158 * since the distance fields we set above are positive in the 2441 * since the distance fields we set above are positive in the
2159 * same axis as is used for multipart objects, the simply arithmetic 2442 * same axis as is used for multipart objects, the simply arithmetic
2160 * below works. 2443 * below works.
2161 */ 2444 */
2162 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) { 2445 for (tmp = op1->more; tmp != NULL; tmp = tmp->more)
2446 {
2163 tmpi = (op1->x-tmp->x+retval->distance_x)*(op1->x-tmp->x+retval->distance_x)+ 2447 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
2164 (op1->y-tmp->y+retval->distance_y)*(op1->y-tmp->y+retval->distance_y); 2448 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
2165 if (tmpi < best_distance) { 2449 if (tmpi < best_distance)
2450 {
2166 best_distance = tmpi; 2451 best_distance = tmpi;
2167 best = tmp; 2452 best = tmp;
2168 } 2453 }
2169 } 2454 }
2170 if (best != op1) { 2455 if (best != op1)
2456 {
2171 retval->distance_x += op1->x-best->x; 2457 retval->distance_x += op1->x - best->x;
2172 retval->distance_y += op1->y-best->y; 2458 retval->distance_y += op1->y - best->y;
2173 } 2459 }
2174 } 2460 }
2175 retval->part = best; 2461 retval->part = best;
2176 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y); 2462 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);
2177 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y); 2463 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
2178 } 2464 }
2179} 2465}
2180 2466
2181/* this is basically the same as get_rangevector above, but instead of 2467/* this is basically the same as get_rangevector above, but instead of
2182 * the first parameter being an object, it instead is the map 2468 * the first parameter being an object, it instead is the map
… …
2187 * be more consistant with the above function and also in case they are needed 2473 * be more consistant with the above function and also in case they are needed
2188 * for something in the future. Also, since no object is pasted, the best 2474 * for something in the future. Also, since no object is pasted, the best
2189 * field of the rv_vector is set to NULL. 2475 * field of the rv_vector is set to NULL.
2190 */ 2476 */
2191 2477
2478void
2192void get_rangevector_from_mapcoord(const mapstruct *m, int x, int y, const object *op2, rv_vector *retval, int flags) { 2479get_rangevector_from_mapcoord (const mapstruct *m, int x, int y, const object *op2, rv_vector * retval, int flags)
2480{
2193 if (!adjacent_map(m, op2->map, &retval->distance_x, &retval->distance_y)) { 2481 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
2482 {
2194 /* be conservative and fill in _some_ data */ 2483 /* be conservative and fill in _some_ data */
2195 retval->distance = 100000; 2484 retval->distance = 100000;
2196 retval->distance_x = 32767; 2485 retval->distance_x = 32767;
2197 retval->distance_y = 32767; 2486 retval->distance_y = 32767;
2198 retval->direction = 0; 2487 retval->direction = 0;
2199 retval->part = 0; 2488 retval->part = 0;
2200 } else { 2489 }
2490 else
2491 {
2201 retval->distance_x += op2->x-x; 2492 retval->distance_x += op2->x - x;
2202 retval->distance_y += op2->y-y; 2493 retval->distance_y += op2->y - y;
2203 2494
2204 retval->part = NULL; 2495 retval->part = NULL;
2205 retval->distance = isqrt(retval->distance_x*retval->distance_x+retval->distance_y*retval->distance_y); 2496 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y);
2206 retval->direction = find_dir_2(-retval->distance_x, -retval->distance_y); 2497 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
2207 } 2498 }
2208} 2499}
2209 2500
2210/* Returns true of op1 and op2 are effectively on the same map 2501/* Returns true of op1 and op2 are effectively on the same map
2211 * (as related to map tiling). Note that this looks for a path from 2502 * (as related to map tiling). Note that this looks for a path from
… …
2213 * to op1, this will still return false. 2504 * to op1, this will still return false.
2214 * Note we only look one map out to keep the processing simple 2505 * Note we only look one map out to keep the processing simple
2215 * and efficient. This could probably be a macro. 2506 * and efficient. This could probably be a macro.
2216 * MSW 2001-08-05 2507 * MSW 2001-08-05
2217 */ 2508 */
2509int
2218int on_same_map(const object *op1, const object *op2) { 2510on_same_map (const object *op1, const object *op2)
2511{
2219 int dx, dy; 2512 int dx, dy;
2220 2513
2221 return adjacent_map(op1->map, op2->map, &dx, &dy); 2514 return adjacent_map (op1->map, op2->map, &dx, &dy);
2222} 2515}

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines