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

Diff Legend

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