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.42 by root, Wed Dec 13 02:55:49 2006 UTC vs.
Revision 1.141 by root, Wed May 7 11:02:50 2008 UTC

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

Diff Legend

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