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.41 by root, Tue Dec 12 22:37:05 2006 UTC vs.
Revision 1.72 by root, Sat Jan 13 23:06:12 2007 UTC

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

Diff Legend

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