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.9 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.53 by root, Wed Dec 27 09:28:01 2006 UTC

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

Diff Legend

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