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.25 by root, Mon Sep 4 17:36:12 2006 UTC vs.
Revision 1.55 by root, Wed Dec 27 18:09:48 2006 UTC

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

Diff Legend

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