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.8 by root, Sat Aug 26 08:44:04 2006 UTC vs.
Revision 1.64 by root, Mon Jan 1 12:28:45 2007 UTC

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

Diff Legend

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