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.10 by root, Mon Aug 28 14:05:23 2006 UTC vs.
Revision 1.54 by root, Wed Dec 27 13:13:46 2006 UTC

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

Diff Legend

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