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.2 by elmex, Tue Aug 15 15:00:20 2006 UTC vs.
Revision 1.33 by root, Sun Oct 8 16:51:50 2006 UTC

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

Diff Legend

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