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.63 by root, Mon Jan 1 00:41:02 2007 UTC vs.
Revision 1.129 by root, Wed Sep 12 11:10:09 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 22 */
23 23
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 24#include <unistd.h>
29 25
26#include "global.h"
27#include "funcpoint.h"
28
29#include "loader.h"
30
30#include "path.h" 31#include "path.h"
31
32/*
33 * This makes a path absolute outside the world of Crossfire.
34 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
35 * and returns the pointer to a static array containing the result.
36 * it really should be called create_mapname
37 */
38const char *
39create_pathname (const char *name)
40{
41 static char buf[8192];
42 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
43 return buf;
44}
45
46/*
47 * This function checks if a file with the given path exists.
48 * -1 is returned if it fails, otherwise the mode of the file
49 * is returned.
50 * It tries out all the compression suffixes listed in the uncomp[] array.
51 *
52 * If prepend_dir is set, then we call create_pathname (which prepends
53 * libdir & mapdir). Otherwise, we assume the name given is fully
54 * complete.
55 * Only the editor actually cares about the writablity of this -
56 * the rest of the code only cares that the file is readable.
57 * when the editor goes away, the call to stat should probably be
58 * replaced by an access instead (similar to the windows one, but
59 * that seems to be missing the prepend_dir processing
60 */
61int
62check_path (const char *name, int prepend_dir)
63{
64 char buf[MAX_BUF];
65
66 char *endbuf;
67 struct stat statbuf;
68 int mode = 0;
69
70 if (prepend_dir)
71 strcpy (buf, create_pathname (name));
72 else
73 strcpy (buf, name);
74
75 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through
78 * all the names.
79 */
80 endbuf = buf + strlen (buf);
81
82 if (stat (buf, &statbuf))
83 return -1;
84 if (!S_ISREG (statbuf.st_mode))
85 return (-1);
86
87 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
88 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
89 mode |= 4;
90
91 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
92 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
93 mode |= 2;
94
95 return (mode);
96}
97 32
98/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
99 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
100 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
101 * new values into newmap, nx, and ny. Any and all of those 36 * new values into newmap, nx, and ny. Any and all of those
… …
172 * let the player through (inventory checkers for example) 107 * let the player through (inventory checkers for example)
173 */ 108 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 109 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 110 return 0;
176 111
177 if (ob->head != NULL)
178 ob = ob->head; 112 ob = ob->head_ ();
179 113
180 /* We basically go through the stack of objects, and if there is 114 /* We basically go through the stack of objects, and if there is
181 * some other object that has NO_PASS or FLAG_ALIVE set, return 115 * some other object that has NO_PASS or FLAG_ALIVE set, return
182 * true. If we get through the entire stack, that must mean 116 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 117 * ob is blocking it, so return 0.
… …
213 else 147 else
214 { 148 {
215 /* Broke apart a big nasty if into several here to make 149 /* Broke apart a big nasty if into several here to make
216 * this more readable. first check - if the space blocks 150 * this more readable. first check - if the space blocks
217 * movement, can't move here. 151 * movement, can't move here.
218 * second - if a monster, can't move there, unles it is a 152 * second - if a monster, can't move there, unless it is a
219 * hidden dm 153 * hidden dm
220 */ 154 */
221 if (OB_MOVE_BLOCK (ob, tmp)) 155 if (OB_MOVE_BLOCK (ob, tmp))
222 return 1; 156 return 1;
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 157
224 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 158 if (tmp->flag [FLAG_ALIVE]
159 && tmp->head_ () != ob
160 && tmp != ob
161 && tmp->type != DOOR
162 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
225 return 1; 163 return 1;
226 } 164 }
227 165
228 } 166 }
229 return 0; 167 return 0;
230} 168}
231 169
232
233/* 170/*
234 * Returns true if the given object can't fit in the given spot. 171 * Returns qthe blocking object if the given object can't fit in the given
235 * This is meant for multi space objects - for single space objecs, 172 * spot. This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 173 * just calling get_map_blocked and checking that against movement type
237 * of object. This function goes through all the parts of the 174 * of object. This function goes through all the parts of the multipart
238 * multipart object and makes sure they can be inserted. 175 * object and makes sure they can be inserted.
239 * 176 *
240 * While this doesn't call out of map, the get_map_flags does. 177 * While this doesn't call out of map, the get_map_flags does.
241 * 178 *
242 * This function has been used to deprecate arch_out_of_map - 179 * This function has been used to deprecate arch_out_of_map -
243 * this function also does that check, and since in most cases, 180 * this function also does that check, and since in most cases,
… …
254 * 191 *
255 * Note this used to be arch_blocked, but with new movement 192 * Note this used to be arch_blocked, but with new movement
256 * code, we need to have actual object to check its move_type 193 * code, we need to have actual object to check its move_type
257 * against the move_block values. 194 * against the move_block values.
258 */ 195 */
259int 196bool
260ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 197object::blocked (maptile *m, int x, int y) const
261{ 198{
262 archetype *tmp; 199 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
263 int flag;
264 maptile *m1;
265 sint16 sx, sy;
266
267 if (!ob)
268 {
269 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
270 if (flag & P_OUT_OF_MAP)
271 return P_OUT_OF_MAP;
272
273 /* don't have object, so don't know what types would block */
274 return m1->at (sx, sy).move_block;
275 } 200 {
201 mapxy pos (m, x + tmp->x, y + tmp->y);
276 202
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 203 if (!pos.normalise ())
278 { 204 return 1;
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
280 205
281 if (flag & P_OUT_OF_MAP) 206 mapspace &ms = *pos;
282 return P_OUT_OF_MAP; 207
283 if (flag & P_IS_ALIVE) 208 if (ms.flags () & P_IS_ALIVE)
284 return P_IS_ALIVE; 209 return 1;
285 210
286 mapspace &ms = m1->at (sx, sy); 211 /* However, often ob doesn't have any move type
287 212 * (signifying non-moving objects)
288 /* find_first_free_spot() calls this function. However, often
289 * ob doesn't have any move type (when used to place exits)
290 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 213 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
291 */ 214 */
292
293 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 215 if (!move_type && ms.move_block != MOVE_ALL)
294 continue; 216 continue;
295 217
296 /* Note it is intentional that we check ob - the movement type of the 218 /* Note it is intentional that we check ob - the movement type of the
297 * head of the object should correspond for the entire object. 219 * head of the object should correspond for the entire object.
298 */ 220 */
299 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 221 if (ms.blocks (move_type))
300 return P_NO_PASS; 222 return 1;
301 } 223 }
302 224
303 return 0; 225 return 0;
304} 226}
305 227
… …
329 * carrying. 251 * carrying.
330 */ 252 */
331 sum_weight (container); 253 sum_weight (container);
332} 254}
333 255
256void
257maptile::set_object_flag (int flag, int value)
258{
259 if (!spaces)
260 return;
261
262 for (mapspace *ms = spaces + size (); ms-- > spaces; )
263 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
264 tmp->flag [flag] = value;
265}
266
334/* link_multipart_objects go through all the objects on the map looking 267/* link_multipart_objects go through all the objects on the map looking
335 * for objects whose arch says they are multipart yet according to the 268 * for objects whose arch says they are multipart yet according to the
336 * info we have, they only have the head (as would be expected when 269 * info we have, they only have the head (as would be expected when
337 * they are saved). We do have to look for the old maps that did save 270 * they are saved).
338 * the more sections and not re-add sections for them.
339 */ 271 */
340void 272void
341maptile::link_multipart_objects () 273maptile::link_multipart_objects ()
342{ 274{
343 if (!spaces) 275 if (!spaces)
344 return; 276 return;
345 277
346 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 278 for (mapspace *ms = spaces + size (); ms-- > spaces; )
347 for (object *tmp = ms->bot; tmp; ) 279 {
280 object *op = ms->bot;
281 while (op)
348 { 282 {
349 object *above = tmp->above;
350
351 /* already multipart - don't do anything more */ 283 /* already multipart - don't do anything more */
352 if (!tmp->head && !tmp->more) 284 if (op->head_ () == op && !op->more && op->arch->more)
353 {
354 /* If there is nothing more to this object, this for loop
355 * won't do anything.
356 */
357 archetype *at;
358 object *last, *op;
359 for (at = tmp->arch->more, last = tmp;
360 at;
361 at = at->more, last = op)
362 { 285 {
363 op = arch_to_object (at); 286 op->remove ();
287 op->expand_tail ();
364 288
365 /* update x,y coordinates */ 289 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
366 op->x += tmp->x; 290 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
367 op->y += tmp->y; 291 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
368 op->head = tmp;
369 op->map = this;
370 last->more = op;
371 op->name = tmp->name;
372 op->title = tmp->title;
373
374 /* we could link all the parts onto tmp, and then just
375 * call insert_ob_in_map once, but the effect is the same,
376 * as insert_ob_in_map will call itself with each part, and
377 * the coding is simpler to just to it here with each part.
378 */
379 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 292 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
293
294 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
295 // so we have to reset the iteration through the mapspace
380 } 296 }
297 else
298 op = op->above;
381 } 299 }
382
383 tmp = above;
384 } 300 }
385} 301}
386 302
387/* 303/*
388 * Loads (ands parses) the objects into a given map from the specified 304 * Loads (ands parses) the objects into a given map from the specified
389 * file pointer. 305 * file pointer.
390 * mapflags is the same as we get with load_original_map
391 */ 306 */
392bool 307bool
393maptile::load_objects (object_thawer &thawer) 308maptile::_load_objects (object_thawer &f)
394{ 309{
395 int unique; 310 for (;;)
396 object *op, *prev = NULL, *last_more = NULL, *otmp;
397
398 op = object::create ();
399 op->map = this; /* To handle buttons correctly */
400
401 while (int i = load_object (thawer, op, 0))
402 { 311 {
403 /* if the archetype for the object is null, means that we 312 coroapi::cede_to_tick_every (100); // cede once in a while
404 * got an invalid object. Don't do anything with it - the game 313
405 * or editor will not be able to do anything with it either. 314 switch (f.kw)
406 */
407 if (op->arch == NULL)
408 { 315 {
409 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 316 case KW_arch:
410 continue; 317 if (object *op = object::read (f, this))
411 }
412
413 switch (i)
414 { 318 {
415 case LL_NORMAL: 319 if (op->inv)
320 sum_weight (op);
321
416 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 322 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
323 }
417 324
418 if (op->inv) 325 continue;
419 sum_weight (op);
420 326
421 prev = op, last_more = op;
422 break;
423
424 case LL_MORE: 327 case KW_EOF:
425 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 328 return true;
426 op->head = prev, last_more->more = op, last_more = op; 329
330 default:
331 if (!f.parse_error ("map file"))
332 return false;
427 break; 333 break;
428 } 334 }
429 335
430 op = object::create (); 336 f.next ();
431 op->map = this;
432 }
433
434 op->destroy ();
435
436#if 0
437 for (i = 0; i < width; i++)
438 for (j = 0; j < height; j++)
439 {
440 unique = 0;
441 /* check for unique items, or unique squares */
442 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
443 {
444 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
445 unique = 1;
446
447 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
448 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
449 }
450 } 337 }
451#endif
452 338
453 return true; 339 return true;
454} 340}
455 341
456void 342void
457maptile::activate () 343maptile::activate ()
458{ 344{
459 if (!spaces) 345 if (spaces)
460 return;
461
462 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 346 for (mapspace *ms = spaces + size (); ms-- > spaces; )
463 for (object *op = ms->bot; op; op = op->above) 347 for (object *op = ms->bot; op; op = op->above)
464 op->activate_recursive (); 348 op->activate_recursive ();
465} 349}
466 350
467void 351void
468maptile::deactivate () 352maptile::deactivate ()
469{ 353{
470 if (!spaces) 354 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 355 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 356 for (object *op = ms->bot; op; op = op->above)
475 op->deactivate_recursive (); 357 op->deactivate_recursive ();
476} 358}
477 359
478bool 360bool
479maptile::save_objects (object_freezer &freezer, int flags) 361maptile::_save_objects (object_freezer &f, int flags)
480{ 362{
363 coroapi::cede_to_tick ();
364
481 if (flags & IO_HEADER) 365 if (flags & IO_HEADER)
482 save_header (freezer); 366 _save_header (f);
483 367
484 if (!spaces) 368 if (!spaces)
485 return false; 369 return false;
486 370
487 for (int i = 0; i < size (); ++i) 371 for (int i = 0; i < size (); ++i)
488 { 372 {
489 int unique = 0; 373 bool unique = 0;
374
490 for (object *op = spaces [i].bot; op; op = op->above) 375 for (object *op = spaces [i].bot; op; op = op->above)
491 { 376 {
492 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 377 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
493 unique = 1;
494 378
495 if (!op->can_map_save ()) 379 if (expect_false (!op->can_map_save ()))
496 continue; 380 continue;
497 381
498 if (unique || op->flag [FLAG_UNIQUE]) 382 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
499 { 383 {
500 if (flags & IO_UNIQUES) 384 if (flags & IO_UNIQUES)
501 save_object (freezer, op, 1); 385 op->write (f);
502 } 386 }
503 else if (flags & IO_OBJECTS) 387 else if (expect_true (flags & IO_OBJECTS))
504 save_object (freezer, op, 1); 388 op->write (f);
505 } 389 }
506 } 390 }
507 391
392 coroapi::cede_to_tick ();
393
508 return true; 394 return true;
509} 395}
510 396
511bool 397bool
512maptile::load_objects (const char *path, bool skip_header) 398maptile::_save_objects (const char *path, int flags)
513{ 399{
514 object_thawer thawer (path); 400 object_freezer freezer;
515 401
516 if (!thawer) 402 if (!_save_objects (freezer, flags))
517 return false; 403 return false;
518 404
519 if (skip_header)
520 for (;;)
521 {
522 keyword kw = thawer.get_kv ();
523
524 if (kw == KW_end)
525 break;
526
527 thawer.skip_kv (kw);
528 }
529
530 return load_objects (thawer);
531}
532
533bool
534maptile::save_objects (const char *path, int flags)
535{
536 object_freezer freezer;
537
538 if (!save_objects (freezer, flags))
539 return false;
540
541 return freezer.save (path); 405 return freezer.save (path);
542} 406}
543 407
544maptile::maptile () 408maptile::maptile ()
545{ 409{
546 in_memory = MAP_SWAPPED; 410 in_memory = MAP_SWAPPED;
547 411
548 /* The maps used to pick up default x and y values from the 412 /* The maps used to pick up default x and y values from the
549 * map archetype. Mimic that behaviour. 413 * map archetype. Mimic that behaviour.
550 */ 414 */
551 width = 16; 415 width = 16;
552 height = 16; 416 height = 16;
553 reset_timeout = 0;
554 timeout = 300; 417 timeout = 300;
555 enter_x = 0; 418 max_nrof = 1000; // 1000 items of anything
556 enter_y = 0; 419 max_volume = 2000000; // 2m³
557} 420}
558 421
559maptile::maptile (int w, int h) 422maptile::maptile (int w, int h)
560{ 423{
561 in_memory = MAP_SWAPPED; 424 in_memory = MAP_SWAPPED;
… …
707 * This could be done in lex (like the object loader), but I think 570 * This could be done in lex (like the object loader), but I think
708 * currently, there are few enough fields this is not a big deal. 571 * currently, there are few enough fields this is not a big deal.
709 * MSW 2001-07-01 572 * MSW 2001-07-01
710 */ 573 */
711bool 574bool
712maptile::load_header (object_thawer &thawer) 575maptile::_load_header (object_thawer &thawer)
713{ 576{
714 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
715 int msgpos = 0;
716 int maplorepos = 0;
717
718 for (;;) 577 for (;;)
719 { 578 {
720 keyword kw = thawer.get_kv ();
721
722 switch (kw) 579 switch (thawer.kw)
723 { 580 {
724 case KW_EOF:
725 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
726 return false;
727
728 case KW_end:
729 return true;
730
731 case KW_msg: 581 case KW_msg:
732 thawer.get_ml (KW_endmsg, msg); 582 thawer.get_ml (KW_endmsg, msg);
733 break; 583 break;
734 584
735 case KW_lore: // CF+ extension 585 case KW_lore: // CF+ extension
… …
766 case KW_winddir: thawer.get (winddir); break; 616 case KW_winddir: thawer.get (winddir); break;
767 case KW_sky: thawer.get (sky); break; 617 case KW_sky: thawer.get (sky); break;
768 618
769 case KW_per_player: thawer.get (per_player); break; 619 case KW_per_player: thawer.get (per_player); break;
770 case KW_per_party: thawer.get (per_party); break; 620 case KW_per_party: thawer.get (per_party); break;
621 case KW_no_reset: thawer.get (no_reset); break;
771 622
772 case KW_region: get_region_by_name (thawer.get_str ()); break; 623 case KW_region: default_region = region::find (thawer.get_str ()); break;
773 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 624 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
774 625
775 // old names new names 626 // old names new names
776 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 627 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
777 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 628 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
786 case KW_tile_path_1: thawer.get (tile_path [0]); break; 637 case KW_tile_path_1: thawer.get (tile_path [0]); break;
787 case KW_tile_path_2: thawer.get (tile_path [1]); break; 638 case KW_tile_path_2: thawer.get (tile_path [1]); break;
788 case KW_tile_path_3: thawer.get (tile_path [2]); break; 639 case KW_tile_path_3: thawer.get (tile_path [2]); break;
789 case KW_tile_path_4: thawer.get (tile_path [3]); break; 640 case KW_tile_path_4: thawer.get (tile_path [3]); break;
790 641
642 case KW_ERROR:
643 set_key_text (thawer.kw_str, thawer.value);
644 break;
645
646 case KW_end:
647 thawer.next ();
648 return true;
649
791 default: 650 default:
792 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 651 if (!thawer.parse_error ("map", 0))
652 return false;
793 break; 653 break;
794 } 654 }
655
656 thawer.next ();
795 } 657 }
796 658
797 abort (); 659 abort ();
798}
799
800bool
801maptile::load_header (const char *path)
802{
803 object_thawer thawer (path);
804
805 if (!thawer)
806 return false;
807
808 return load_header (thawer);
809} 660}
810 661
811/****************************************************************************** 662/******************************************************************************
812 * This is the start of unique map handling code 663 * This is the start of unique map handling code
813 *****************************************************************************/ 664 *****************************************************************************/
… …
824 object *above = op->above; 675 object *above = op->above;
825 676
826 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 677 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
827 unique = 1; 678 unique = 1;
828 679
829 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 680 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
830 { 681 {
831 op->destroy_inv (false); 682 op->destroy_inv (false);
832 op->destroy (); 683 op->destroy ();
833 } 684 }
834 685
… …
836 } 687 }
837 } 688 }
838} 689}
839 690
840bool 691bool
841maptile::save_header (object_freezer &freezer) 692maptile::_save_header (object_freezer &freezer)
842{ 693{
843#define MAP_OUT(k) freezer.put (KW_ ## k, k) 694#define MAP_OUT(k) freezer.put (KW_ ## k, k)
844#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 695#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
845 696
846 MAP_OUT2 (arch, "map"); 697 MAP_OUT2 (arch, "map");
… …
848 if (name) MAP_OUT (name); 699 if (name) MAP_OUT (name);
849 MAP_OUT (swap_time); 700 MAP_OUT (swap_time);
850 MAP_OUT (reset_time); 701 MAP_OUT (reset_time);
851 MAP_OUT (reset_timeout); 702 MAP_OUT (reset_timeout);
852 MAP_OUT (fixed_resettime); 703 MAP_OUT (fixed_resettime);
704 MAP_OUT (no_reset);
853 MAP_OUT (difficulty); 705 MAP_OUT (difficulty);
854 706
855 if (region) MAP_OUT2 (region, region->name); 707 if (default_region) MAP_OUT2 (region, default_region->name);
856 708
857 if (shopitems) 709 if (shopitems)
858 { 710 {
859 char shop[MAX_BUF]; 711 char shop[MAX_BUF];
860 print_shop_string (this, shop); 712 print_shop_string (this, shop);
… …
895 747
896 return true; 748 return true;
897} 749}
898 750
899bool 751bool
900maptile::save_header (const char *path) 752maptile::_save_header (const char *path)
901{ 753{
902 object_freezer freezer; 754 object_freezer freezer;
903 755
904 if (!save_header (freezer)) 756 if (!_save_header (freezer))
905 return false; 757 return false;
906 758
907 return freezer.save (path); 759 return freezer.save (path);
908} 760}
909 761
… …
911 * Remove and free all objects in the given map. 763 * Remove and free all objects in the given map.
912 */ 764 */
913void 765void
914maptile::clear () 766maptile::clear ()
915{ 767{
916 if (!spaces) 768 if (spaces)
917 return; 769 {
918
919 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 770 for (mapspace *ms = spaces + size (); ms-- > spaces; )
920 while (object *op = ms->bot) 771 while (object *op = ms->bot)
921 { 772 {
773 // manually remove, as to not trigger anything
774 if (ms->bot = op->above)
775 ms->bot->below = 0;
776
777 op->flag [FLAG_REMOVED] = true;
778
779 object *head = op->head_ ();
922 if (op->head) 780 if (op == head)
923 op = op->head; 781 {
924
925 op->destroy_inv (false); 782 op->destroy_inv (false);
926 op->destroy (); 783 op->destroy ();
784 }
785 else if (head->map != op->map)
786 {
787 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
788 head->destroy ();
789 }
927 } 790 }
928 791
929 sfree (spaces, size ()), spaces = 0; 792 sfree (spaces, size ()), spaces = 0;
793 }
930 794
931 if (buttons) 795 if (buttons)
932 free_objectlinkpt (buttons), buttons = 0; 796 free_objectlinkpt (buttons), buttons = 0;
797
798 sfree (regions, size ()); regions = 0;
799 delete [] regionmap; regionmap = 0;
933} 800}
934 801
935void 802void
936maptile::clear_header () 803maptile::clear_header ()
937{ 804{
… …
967maptile::do_destroy () 834maptile::do_destroy ()
968{ 835{
969 attachable::do_destroy (); 836 attachable::do_destroy ();
970 837
971 clear (); 838 clear ();
839}
840
841/* decay and destroy perishable items in a map */
842void
843maptile::do_decay_objects ()
844{
845 if (!spaces)
846 return;
847
848 for (mapspace *ms = spaces + size (); ms-- > spaces; )
849 for (object *above, *op = ms->bot; op; op = above)
850 {
851 above = op->above;
852
853 bool destroy = 0;
854
855 // do not decay anything above unique floor tiles (yet :)
856 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
857 break;
858
859 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
860 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
861 || QUERY_FLAG (op, FLAG_UNIQUE)
862 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
863 || QUERY_FLAG (op, FLAG_UNPAID)
864 || op->is_alive ())
865 ; // do not decay
866 else if (op->is_weapon ())
867 {
868 op->stats.dam--;
869 if (op->stats.dam < 0)
870 destroy = 1;
871 }
872 else if (op->is_armor ())
873 {
874 op->stats.ac--;
875 if (op->stats.ac < 0)
876 destroy = 1;
877 }
878 else if (op->type == FOOD)
879 {
880 op->stats.food -= rndm (5, 20);
881 if (op->stats.food < 0)
882 destroy = 1;
883 }
884 else
885 {
886 int mat = op->materials;
887
888 if (mat & M_PAPER
889 || mat & M_LEATHER
890 || mat & M_WOOD
891 || mat & M_ORGANIC
892 || mat & M_CLOTH
893 || mat & M_LIQUID
894 || (mat & M_IRON && rndm (1, 5) == 1)
895 || (mat & M_GLASS && rndm (1, 2) == 1)
896 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
897 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
898 || (mat & M_ICE && temp > 32))
899 destroy = 1;
900 }
901
902 /* adjust overall chance below */
903 if (destroy && rndm (0, 1))
904 op->destroy ();
905 }
972} 906}
973 907
974/* 908/*
975 * Updates every button on the map (by calling update_button() for them). 909 * Updates every button on the map (by calling update_button() for them).
976 */ 910 */
… …
1024 if (QUERY_FLAG (op, FLAG_GENERATOR)) 958 if (QUERY_FLAG (op, FLAG_GENERATOR))
1025 { 959 {
1026 total_exp += op->stats.exp; 960 total_exp += op->stats.exp;
1027 961
1028 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 962 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1029 total_exp += at->clone.stats.exp * 8; 963 total_exp += at->stats.exp * 8;
1030 964
1031 monster_cnt++; 965 monster_cnt++;
1032 } 966 }
1033 } 967 }
1034 968
… …
1088 */ 1022 */
1089void 1023void
1090mapspace::update_ () 1024mapspace::update_ ()
1091{ 1025{
1092 object *tmp, *last = 0; 1026 object *tmp, *last = 0;
1093 uint8 flags = 0, light = 0, anywhere = 0; 1027 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1094 New_Face *top, *floor, *middle;
1095 object *top_obj, *floor_obj, *middle_obj;
1096 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1028 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1097 1029
1098 middle = blank_face; 1030 //object *middle = 0;
1099 top = blank_face; 1031 //object *top = 0;
1100 floor = blank_face; 1032 //object *floor = 0;
1101 1033 // this seems to generate better code than using locals, above
1102 middle_obj = 0; 1034 object *&top = faces_obj[0] = 0;
1103 top_obj = 0; 1035 object *&middle = faces_obj[1] = 0;
1104 floor_obj = 0; 1036 object *&floor = faces_obj[2] = 0;
1105 1037
1106 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1038 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1107 { 1039 {
1108 /* This could be made additive I guess (two lights better than 1040 /* This could be made additive I guess (two lights better than
1109 * one). But if so, it shouldn't be a simple additive - 2 1041 * one). But if so, it shouldn't be a simple additive - 2
… …
1122 * Always put the player down for drawing. 1054 * Always put the player down for drawing.
1123 */ 1055 */
1124 if (!tmp->invisible) 1056 if (!tmp->invisible)
1125 { 1057 {
1126 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1058 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1127 {
1128 top = tmp->face;
1129 top_obj = tmp; 1059 top = tmp;
1130 }
1131 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1060 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1132 { 1061 {
1133 /* If we got a floor, that means middle and top were below it, 1062 /* If we got a floor, that means middle and top were below it,
1134 * so should not be visible, so we clear them. 1063 * so should not be visible, so we clear them.
1135 */ 1064 */
1136 middle = blank_face; 1065 middle = 0;
1137 top = blank_face; 1066 top = 0;
1138 floor = tmp->face;
1139 floor_obj = tmp; 1067 floor = tmp;
1140 } 1068 }
1141 /* Flag anywhere have high priority */ 1069 /* Flag anywhere have high priority */
1142 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1070 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1143 { 1071 {
1144 middle = tmp->face;
1145
1146 middle_obj = tmp; 1072 middle = tmp;
1147 anywhere = 1; 1073 anywhere = 1;
1148 } 1074 }
1149 /* Find the highest visible face around. If equal 1075 /* Find the highest visible face around. If equal
1150 * visibilities, we still want the one nearer to the 1076 * visibilities, we still want the one nearer to the
1151 * top 1077 * top
1152 */ 1078 */
1153 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1079 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1154 {
1155 middle = tmp->face;
1156 middle_obj = tmp; 1080 middle = tmp;
1157 }
1158 } 1081 }
1159 1082
1160 if (tmp == tmp->above) 1083 if (tmp == tmp->above)
1161 { 1084 {
1162 LOG (llevError, "Error in structure of map\n"); 1085 LOG (llevError, "Error in structure of map\n");
… …
1197 * middle face. This should not happen, as we already have the 1120 * middle face. This should not happen, as we already have the
1198 * else statement above so middle should not get set. OTOH, it 1121 * else statement above so middle should not get set. OTOH, it
1199 * may be possible for the faces to match but be different objects. 1122 * may be possible for the faces to match but be different objects.
1200 */ 1123 */
1201 if (top == middle) 1124 if (top == middle)
1202 middle = blank_face; 1125 middle = 0;
1203 1126
1204 /* There are three posibilities at this point: 1127 /* There are three posibilities at this point:
1205 * 1) top face is set, need middle to be set. 1128 * 1) top face is set, need middle to be set.
1206 * 2) middle is set, need to set top. 1129 * 2) middle is set, need to set top.
1207 * 3) neither middle or top is set - need to set both. 1130 * 3) neither middle or top is set - need to set both.
… …
1212 /* Once we get to a floor, stop, since we already have a floor object */ 1135 /* Once we get to a floor, stop, since we already have a floor object */
1213 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1136 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1214 break; 1137 break;
1215 1138
1216 /* If two top faces are already set, quit processing */ 1139 /* If two top faces are already set, quit processing */
1217 if ((top != blank_face) && (middle != blank_face)) 1140 if (top && middle)
1218 break; 1141 break;
1219 1142
1220 /* Only show visible faces, unless its the editor - show all */ 1143 /* Only show visible faces */
1221 if (!tmp->invisible || editor) 1144 if (!tmp->invisible)
1222 { 1145 {
1223 /* Fill in top if needed */ 1146 /* Fill in top if needed */
1224 if (top == blank_face) 1147 if (!top)
1225 { 1148 {
1226 top = tmp->face;
1227 top_obj = tmp; 1149 top = tmp;
1228 if (top == middle) 1150 if (top == middle)
1229 middle = blank_face; 1151 middle = 0;
1230 } 1152 }
1231 else 1153 else
1232 { 1154 {
1233 /* top is already set - we should only get here if 1155 /* top is already set - we should only get here if
1234 * middle is not set 1156 * middle is not set
1235 * 1157 *
1236 * Set the middle face and break out, since there is nothing 1158 * Set the middle face and break out, since there is nothing
1237 * more to fill in. We don't check visiblity here, since 1159 * more to fill in. We don't check visiblity here, since
1238 * 1160 *
1239 */ 1161 */
1240 if (tmp->face != top) 1162 if (tmp != top)
1241 { 1163 {
1242 middle = tmp->face;
1243 middle_obj = tmp; 1164 middle = tmp;
1244 break; 1165 break;
1245 } 1166 }
1246 } 1167 }
1247 } 1168 }
1248 } 1169 }
1249 1170
1250 if (middle == floor) 1171 if (middle == floor)
1251 middle = blank_face; 1172 middle = 0;
1252 1173
1253 if (top == middle) 1174 if (top == middle)
1254 middle = blank_face; 1175 middle = 0;
1255 1176
1256 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1177#if 0
1257 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1178 faces_obj [0] = top;
1258 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1179 faces_obj [1] = middle;
1180 faces_obj [2] = floor;
1181#endif
1259} 1182}
1260 1183
1261/* this updates the orig_map->tile_map[tile_num] value after loading 1184uint64
1262 * the map. It also takes care of linking back the freshly loaded 1185mapspace::volume () const
1263 * maps tile_map values if it tiles back to this one. It returns
1264 * the value of orig_map->tile_map[tile_num]. It really only does this
1265 * so that it is easier for calling functions to verify success.
1266 */
1267static maptile *
1268load_and_link_tiled_map (maptile *orig_map, int tile_num)
1269{ 1186{
1270 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1187 uint64 vol = 0;
1271 1188
1272 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1189 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1273 { 1190 vol += op->volume ();
1274 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1275 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1276 &orig_map->tile_path[tile_num], &orig_map->path);
1277 mp = new maptile (1, 1);
1278 mp->alloc ();
1279 mp->in_memory = MAP_IN_MEMORY;
1280 }
1281 1191
1282 int dest_tile = (tile_num + 2) % 4; 1192 return vol;
1193}
1283 1194
1284 orig_map->tile_map[tile_num] = mp; 1195bool
1196maptile::tile_available (int dir, bool load)
1197{
1198 if (!tile_path[dir])
1199 return 0;
1285 1200
1286 // optimisation: back-link map to origin map if euclidean 1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1287 //TODO: non-euclidean maps MUST GO 1202 return 1;
1288 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1289 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1290 1203
1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1205 return 1;
1206
1291 return mp; 1207 return 0;
1292} 1208}
1293 1209
1294/* this returns TRUE if the coordinates (x,y) are out of 1210/* this returns TRUE if the coordinates (x,y) are out of
1295 * map m. This function also takes into account any 1211 * map m. This function also takes into account any
1296 * tiling considerations, loading adjacant maps as needed. 1212 * tiling considerations, loading adjacant maps as needed.
… …
1309 if (!m) 1225 if (!m)
1310 return 0; 1226 return 0;
1311 1227
1312 if (x < 0) 1228 if (x < 0)
1313 { 1229 {
1314 if (!m->tile_path[3]) 1230 if (!m->tile_available (3))
1315 return 1; 1231 return 1;
1316 1232
1317 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1318 load_and_link_tiled_map (m, 3);
1319
1320 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1233 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1321 } 1234 }
1322 1235
1323 if (x >= m->width) 1236 if (x >= m->width)
1324 { 1237 {
1325 if (!m->tile_path[1]) 1238 if (!m->tile_available (1))
1326 return 1; 1239 return 1;
1327 1240
1328 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1329 load_and_link_tiled_map (m, 1);
1330
1331 return out_of_map (m->tile_map[1], x - m->width, y); 1241 return out_of_map (m->tile_map[1], x - m->width, y);
1332 } 1242 }
1333 1243
1334 if (y < 0) 1244 if (y < 0)
1335 { 1245 {
1336 if (!m->tile_path[0]) 1246 if (!m->tile_available (0))
1337 return 1; 1247 return 1;
1338 1248
1339 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1340 load_and_link_tiled_map (m, 0);
1341
1342 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1249 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1343 } 1250 }
1344 1251
1345 if (y >= m->height) 1252 if (y >= m->height)
1346 { 1253 {
1347 if (!m->tile_path[2]) 1254 if (!m->tile_available (2))
1348 return 1; 1255 return 1;
1349
1350 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1351 load_and_link_tiled_map (m, 2);
1352 1256
1353 return out_of_map (m->tile_map[2], x, y - m->height); 1257 return out_of_map (m->tile_map[2], x, y - m->height);
1354 } 1258 }
1355 1259
1356 /* Simple case - coordinates are within this local 1260 /* Simple case - coordinates are within this local
… …
1361 1265
1362/* This is basically the same as out_of_map above, but 1266/* This is basically the same as out_of_map above, but
1363 * instead we return NULL if no map is valid (coordinates 1267 * instead we return NULL if no map is valid (coordinates
1364 * out of bounds and no tiled map), otherwise it returns 1268 * out of bounds and no tiled map), otherwise it returns
1365 * the map as that the coordinates are really on, and 1269 * the map as that the coordinates are really on, and
1366 * updates x and y to be the localized coordinates. 1270 * updates x and y to be the localised coordinates.
1367 * Using this is more efficient of calling out_of_map 1271 * Using this is more efficient of calling out_of_map
1368 * and then figuring out what the real map is 1272 * and then figuring out what the real map is
1369 */ 1273 */
1370maptile * 1274maptile *
1371get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1275maptile::xy_find (sint16 &x, sint16 &y)
1372{ 1276{
1373 if (*x < 0) 1277 if (x < 0)
1374 { 1278 {
1375 if (!m->tile_path[3]) 1279 if (!tile_available (3))
1376 return 0; 1280 return 0;
1377 1281
1378 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1379 load_and_link_tiled_map (m, 3);
1380
1381 *x += m->tile_map[3]->width; 1282 x += tile_map[3]->width;
1382 return (get_map_from_coord (m->tile_map[3], x, y)); 1283 return tile_map[3]->xy_find (x, y);
1383 } 1284 }
1384 1285
1385 if (*x >= m->width) 1286 if (x >= width)
1386 { 1287 {
1387 if (!m->tile_path[1]) 1288 if (!tile_available (1))
1388 return 0; 1289 return 0;
1389 1290
1390 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1391 load_and_link_tiled_map (m, 1);
1392
1393 *x -= m->width; 1291 x -= width;
1394 return (get_map_from_coord (m->tile_map[1], x, y)); 1292 return tile_map[1]->xy_find (x, y);
1395 } 1293 }
1396 1294
1397 if (*y < 0) 1295 if (y < 0)
1398 { 1296 {
1399 if (!m->tile_path[0]) 1297 if (!tile_available (0))
1400 return 0; 1298 return 0;
1401 1299
1402 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1403 load_and_link_tiled_map (m, 0);
1404
1405 *y += m->tile_map[0]->height; 1300 y += tile_map[0]->height;
1406 return (get_map_from_coord (m->tile_map[0], x, y)); 1301 return tile_map[0]->xy_find (x, y);
1407 } 1302 }
1408 1303
1409 if (*y >= m->height) 1304 if (y >= height)
1410 { 1305 {
1411 if (!m->tile_path[2]) 1306 if (!tile_available (2))
1412 return 0; 1307 return 0;
1413 1308
1414 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1415 load_and_link_tiled_map (m, 2);
1416
1417 *y -= m->height; 1309 y -= height;
1418 return (get_map_from_coord (m->tile_map[2], x, y)); 1310 return tile_map[2]->xy_find (x, y);
1419 } 1311 }
1420 1312
1421 /* Simple case - coordinates are within this local 1313 /* Simple case - coordinates are within this local
1422 * map. 1314 * map.
1423 */ 1315 */
1424 return m; 1316 return this;
1425} 1317}
1426 1318
1427/** 1319/**
1428 * Return whether map2 is adjacent to map1. If so, store the distance from 1320 * Return whether map2 is adjacent to map1. If so, store the distance from
1429 * map1 to map2 in dx/dy. 1321 * map1 to map2 in dx/dy.
1430 */ 1322 */
1431static int 1323int
1432adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1324adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1433{ 1325{
1434 if (!map1 || !map2) 1326 if (!map1 || !map2)
1435 return 0; 1327 return 0;
1436 1328
1329 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1330 //fix: compare paths instead (this is likely faster, too!)
1437 if (map1 == map2) 1331 if (map1 == map2)
1438 { 1332 {
1439 *dx = 0; 1333 *dx = 0;
1440 *dy = 0; 1334 *dy = 0;
1441 } 1335 }
… …
1501 } 1395 }
1502 else 1396 else
1503 return 0; 1397 return 0;
1504 1398
1505 return 1; 1399 return 1;
1400}
1401
1402maptile *
1403maptile::xy_load (sint16 &x, sint16 &y)
1404{
1405 maptile *map = xy_find (x, y);
1406
1407 if (map)
1408 map->load_sync ();
1409
1410 return map;
1411}
1412
1413maptile *
1414get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1415{
1416 return m->xy_load (*x, *y);
1506} 1417}
1507 1418
1508/* From map.c 1419/* From map.c
1509 * This is used by get_player to determine where the other 1420 * This is used by get_player to determine where the other
1510 * creature is. get_rangevector takes into account map tiling, 1421 * creature is. get_rangevector takes into account map tiling,
1511 * so you just can not look the the map coordinates and get the 1422 * so you just can not look the the map coordinates and get the
1512 * righte value. distance_x/y are distance away, which 1423 * righte value. distance_x/y are distance away, which
1513 * can be negativbe. direction is the crossfire direction scheme 1424 * can be negative. direction is the crossfire direction scheme
1514 * that the creature should head. part is the part of the 1425 * that the creature should head. part is the part of the
1515 * monster that is closest. 1426 * monster that is closest.
1516 * 1427 *
1517 * get_rangevector looks at op1 and op2, and fills in the 1428 * get_rangevector looks at op1 and op2, and fills in the
1518 * structure for op1 to get to op2. 1429 * structure for op1 to get to op2.
… …
1529get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1440get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1530{ 1441{
1531 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1442 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1532 { 1443 {
1533 /* be conservative and fill in _some_ data */ 1444 /* be conservative and fill in _some_ data */
1534 retval->distance = 100000; 1445 retval->distance = 10000;
1535 retval->distance_x = 32767; 1446 retval->distance_x = 10000;
1536 retval->distance_y = 32767; 1447 retval->distance_y = 10000;
1537 retval->direction = 0; 1448 retval->direction = 0;
1538 retval->part = 0; 1449 retval->part = 0;
1539 } 1450 }
1540 else 1451 else
1541 { 1452 {
… …
1546 1457
1547 best = op1; 1458 best = op1;
1548 /* If this is multipart, find the closest part now */ 1459 /* If this is multipart, find the closest part now */
1549 if (!(flags & 0x1) && op1->more) 1460 if (!(flags & 0x1) && op1->more)
1550 { 1461 {
1551 object *tmp;
1552 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1462 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1553 1463
1554 /* we just take the offset of the piece to head to figure 1464 /* we just take the offset of the piece to head to figure
1555 * distance instead of doing all that work above again 1465 * distance instead of doing all that work above again
1556 * since the distance fields we set above are positive in the 1466 * since the distance fields we set above are positive in the
1557 * same axis as is used for multipart objects, the simply arithmetic 1467 * same axis as is used for multipart objects, the simply arithmetic
1558 * below works. 1468 * below works.
1559 */ 1469 */
1560 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1470 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1561 { 1471 {
1562 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1472 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1563 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1473 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1564 if (tmpi < best_distance) 1474 if (tmpi < best_distance)
1565 { 1475 {
1566 best_distance = tmpi; 1476 best_distance = tmpi;
1567 best = tmp; 1477 best = tmp;
1568 } 1478 }
1569 } 1479 }
1480
1570 if (best != op1) 1481 if (best != op1)
1571 { 1482 {
1572 retval->distance_x += op1->x - best->x; 1483 retval->distance_x += op1->x - best->x;
1573 retval->distance_y += op1->y - best->y; 1484 retval->distance_y += op1->y - best->y;
1574 } 1485 }
1575 } 1486 }
1487
1576 retval->part = best; 1488 retval->part = best;
1577 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1489 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1578 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1490 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1579 } 1491 }
1580} 1492}
1581 1493
1582/* this is basically the same as get_rangevector above, but instead of 1494/* this is basically the same as get_rangevector above, but instead of
… …
1587 * flags has no meaning for this function at this time - I kept it in to 1499 * flags has no meaning for this function at this time - I kept it in to
1588 * be more consistant with the above function and also in case they are needed 1500 * be more consistant with the above function and also in case they are needed
1589 * for something in the future. Also, since no object is pasted, the best 1501 * for something in the future. Also, since no object is pasted, the best
1590 * field of the rv_vector is set to NULL. 1502 * field of the rv_vector is set to NULL.
1591 */ 1503 */
1592
1593void 1504void
1594get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1505get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1595{ 1506{
1596 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1507 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1597 { 1508 {
1598 /* be conservative and fill in _some_ data */ 1509 /* be conservative and fill in _some_ data */
1599 retval->distance = 100000; 1510 retval->distance = 100000;
… …
1606 { 1517 {
1607 retval->distance_x += op2->x - x; 1518 retval->distance_x += op2->x - x;
1608 retval->distance_y += op2->y - y; 1519 retval->distance_y += op2->y - y;
1609 1520
1610 retval->part = NULL; 1521 retval->part = NULL;
1611 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1522 retval->distance = idistance (retval->distance_x, retval->distance_y);
1612 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1523 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1613 } 1524 }
1614} 1525}
1615 1526
1616/* Returns true of op1 and op2 are effectively on the same map 1527/* Returns true of op1 and op2 are effectively on the same map
… …
1636 op->remove (); 1547 op->remove ();
1637 1548
1638 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1549 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1639} 1550}
1640 1551
1552region *
1553maptile::region (int x, int y) const
1554{
1555 if (regions
1556 && regionmap
1557 && !OUT_OF_REAL_MAP (this, x, y))
1558 if (struct region *reg = regionmap [regions [y * width + x]])
1559 return reg;
1560
1561 if (default_region)
1562 return default_region;
1563
1564 return ::region::default_region ();
1565}
1566
1567/* picks a random object from a style map.
1568 * Redone by MSW so it should be faster and not use static
1569 * variables to generate tables.
1570 */
1571object *
1572maptile::pick_random_object () const
1573{
1574 /* while returning a null object will result in a crash, that
1575 * is actually preferable to an infinite loop. That is because
1576 * most servers will automatically restart in case of crash.
1577 * Change the logic on getting the random space - shouldn't make
1578 * any difference, but this seems clearer to me.
1579 */
1580 for (int i = 1000; --i;)
1581 {
1582 object *pick = at (rndm (width), rndm (height)).bot;
1583
1584 // do not prefer big monsters just because they are big.
1585 if (pick && pick->head_ () == pick)
1586 return pick->head_ ();
1587 }
1588
1589 // instead of crashing in the unlikely(?) case, try to return *something*
1590 return get_archetype ("blocked");
1591}
1592
1593void
1594maptile::play_sound (faceidx sound, int x, int y) const
1595{
1596 if (!sound)
1597 return;
1598
1599 for_all_players (pl)
1600 if (pl->observe->map == this)
1601 if (client *ns = pl->ns)
1602 {
1603 int dx = x - pl->observe->x;
1604 int dy = y - pl->observe->y;
1605
1606 int distance = idistance (dx, dy);
1607
1608 if (distance <= MAX_SOUND_DISTANCE)
1609 ns->play_sound (sound, dx, dy);
1610 }
1611}
1612

Diff Legend

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