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.3 by elmex, Tue Aug 15 17:35:50 2006 UTC vs.
Revision 1.41 by root, Tue Dec 12 22:37:05 2006 UTC

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

Diff Legend

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