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.71 by pippijn, Sat Jan 6 14:42:29 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 7 *
8 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
9 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
10 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 (at your option) any later version. 11 * (at your option) any later version.
12 12 *
13 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,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details. 16 * GNU General Public License for more details.
17 17 *
18 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
19 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
21
22 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>
23*/ 22 */
24 23
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 "funcpoint.h"
28
29#include "loader.h"
30
31#include "path.h" 31#include "path.h"
32
33/*
34 * This makes a path absolute outside the world of Crossfire.
35 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
36 * and returns the pointer to a static array containing the result.
37 * it really should be called create_mapname
38 */
39const char *
40create_pathname (const char *name)
41{
42 static char buf[8192];
43 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
44 return buf;
45}
46
47/*
48 * This function checks if a file with the given path exists.
49 * -1 is returned if it fails, otherwise the mode of the file
50 * is returned.
51 * It tries out all the compression suffixes listed in the uncomp[] array.
52 *
53 * If prepend_dir is set, then we call create_pathname (which prepends
54 * libdir & mapdir). Otherwise, we assume the name given is fully
55 * complete.
56 * Only the editor actually cares about the writablity of this -
57 * the rest of the code only cares that the file is readable.
58 * when the editor goes away, the call to stat should probably be
59 * replaced by an access instead (similar to the windows one, but
60 * that seems to be missing the prepend_dir processing
61 */
62int
63check_path (const char *name, int prepend_dir)
64{
65 char buf[MAX_BUF];
66
67 char *endbuf;
68 struct stat statbuf;
69 int mode = 0;
70
71 if (prepend_dir)
72 strcpy (buf, create_pathname (name));
73 else
74 strcpy (buf, name);
75
76 /* old method (strchr(buf, '\0')) seemd very odd to me -
77 * this method should be equivalant and is clearer.
78 * Can not use strcat because we need to cycle through
79 * all the names.
80 */
81 endbuf = buf + strlen (buf);
82
83 if (stat (buf, &statbuf))
84 return -1;
85 if (!S_ISREG (statbuf.st_mode))
86 return (-1);
87
88 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
89 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
90 mode |= 4;
91
92 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
93 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
94 mode |= 2;
95
96 return (mode);
97}
98 32
99/* This rolls up wall, blocks_magic, blocks_view, etc, all into 33/* This rolls up wall, blocks_magic, blocks_view, etc, all into
100 * one function that just returns a P_.. value (see map.h) 34 * one function that just returns a P_.. value (see map.h)
101 * it will also do map translation for tiled maps, returning 35 * it will also do map translation for tiled maps, returning
102 * 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
… …
173 * let the player through (inventory checkers for example) 107 * let the player through (inventory checkers for example)
174 */ 108 */
175 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 109 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
176 return 0; 110 return 0;
177 111
178 if (ob->head != NULL)
179 ob = ob->head; 112 ob = ob->head_ ();
180 113
181 /* 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
182 * 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
183 * true. If we get through the entire stack, that must mean 116 * true. If we get through the entire stack, that must mean
184 * ob is blocking it, so return 0. 117 * ob is blocking it, so return 0.
… …
214 else 147 else
215 { 148 {
216 /* Broke apart a big nasty if into several here to make 149 /* Broke apart a big nasty if into several here to make
217 * this more readable. first check - if the space blocks 150 * this more readable. first check - if the space blocks
218 * movement, can't move here. 151 * movement, can't move here.
219 * 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
220 * hidden dm 153 * hidden dm
221 */ 154 */
222 if (OB_MOVE_BLOCK (ob, tmp)) 155 if (OB_MOVE_BLOCK (ob, tmp))
223 return 1; 156 return 1;
224 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 157
225 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))
226 return 1; 163 return 1;
227 } 164 }
228 165
229 } 166 }
230 return 0; 167 return 0;
231} 168}
232 169
233
234/* 170/*
235 * 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
236 * This is meant for multi space objects - for single space objecs, 172 * spot. This is meant for multi space objects - for single space objecs,
237 * just calling get_map_blocked and checking that against movement type 173 * just calling get_map_blocked and checking that against movement type
238 * of object. This function goes through all the parts of the 174 * of object. This function goes through all the parts of the multipart
239 * multipart object and makes sure they can be inserted. 175 * object and makes sure they can be inserted.
240 * 176 *
241 * 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.
242 * 178 *
243 * This function has been used to deprecate arch_out_of_map - 179 * This function has been used to deprecate arch_out_of_map -
244 * this function also does that check, and since in most cases, 180 * this function also does that check, and since in most cases,
… …
255 * 191 *
256 * Note this used to be arch_blocked, but with new movement 192 * Note this used to be arch_blocked, but with new movement
257 * 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
258 * against the move_block values. 194 * against the move_block values.
259 */ 195 */
260int 196bool
261ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 197object::blocked (maptile *m, int x, int y) const
262{ 198{
263 archetype *tmp; 199 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
264 int flag;
265 maptile *m1;
266 sint16 sx, sy;
267
268 if (!ob)
269 {
270 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
271 if (flag & P_OUT_OF_MAP)
272 return P_OUT_OF_MAP;
273
274 /* don't have object, so don't know what types would block */
275 return m1->at (sx, sy).move_block;
276 } 200 {
201 mapxy pos (m, x + tmp->x, y + tmp->y);
277 202
278 for (tmp = ob->arch; tmp; tmp = tmp->more) 203 if (!pos.normalise ())
279 { 204 return 1;
280 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
281 205
282 if (flag & P_OUT_OF_MAP) 206 mapspace &ms = *pos;
283 return P_OUT_OF_MAP; 207
284 if (flag & P_IS_ALIVE) 208 if (ms.flags () & P_IS_ALIVE)
285 return P_IS_ALIVE; 209 return 1;
286 210
287 mapspace &ms = m1->at (sx, sy); 211 /* However, often ob doesn't have any move type
288 212 * (signifying non-moving objects)
289 /* find_first_free_spot() calls this function. However, often
290 * ob doesn't have any move type (when used to place exits)
291 * 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.
292 */ 214 */
293
294 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 215 if (!move_type && ms.move_block != MOVE_ALL)
295 continue; 216 continue;
296 217
297 /* 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
298 * head of the object should correspond for the entire object. 219 * head of the object should correspond for the entire object.
299 */ 220 */
300 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 221 if (ms.blocks (move_type))
301 return P_NO_PASS; 222 return 1;
302 } 223 }
303 224
304 return 0; 225 return 0;
305} 226}
306 227
… …
344} 265}
345 266
346/* 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
347 * 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
348 * 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
349 * they are saved). We do have to look for the old maps that did save 270 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 271 */
352void 272void
353maptile::link_multipart_objects () 273maptile::link_multipart_objects ()
354{ 274{
355 if (!spaces) 275 if (!spaces)
356 return; 276 return;
357 277
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 278 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; ) 279 {
280 object *op = ms->bot;
281 while (op)
360 { 282 {
361 object *above = tmp->above;
362
363 /* already multipart - don't do anything more */ 283 /* already multipart - don't do anything more */
364 if (!tmp->head && !tmp->more) 284 if (op->head_ () == op && !op->more && op->arch->more)
365 {
366 /* If there is nothing more to this object, this for loop
367 * won't do anything.
368 */
369 archetype *at;
370 object *last, *op;
371 for (at = tmp->arch->more, last = tmp;
372 at;
373 at = at->more, last = op)
374 { 285 {
375 op = arch_to_object (at); 286 op->remove ();
287 op->expand_tail ();
376 288
377 /* update x,y coordinates */ 289 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
378 op->x += tmp->x; 290 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
379 op->y += tmp->y; 291 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
380 op->head = tmp;
381 op->map = this;
382 last->more = op;
383 op->name = tmp->name;
384 op->title = tmp->title;
385
386 /* we could link all the parts onto tmp, and then just
387 * call insert_ob_in_map once, but the effect is the same,
388 * as insert_ob_in_map will call itself with each part, and
389 * the coding is simpler to just to it here with each part.
390 */
391 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
392 } 296 }
297 else
298 op = op->above;
393 } 299 }
394
395 tmp = above;
396 } 300 }
397} 301}
398 302
399/* 303/*
400 * 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
401 * file pointer. 305 * file pointer.
402 * mapflags is the same as we get with load_original_map
403 */ 306 */
404bool 307bool
405maptile::load_objects (object_thawer &thawer) 308maptile::_load_objects (object_thawer &f)
406{ 309{
407 int unique; 310 for (;;)
408 object *op, *prev = NULL, *last_more = NULL, *otmp;
409
410 op = object::create ();
411 op->map = this; /* To handle buttons correctly */
412
413 while (int i = load_object (thawer, op, 0))
414 { 311 {
415 /* if the archetype for the object is null, means that we 312 coroapi::cede_to_tick_every (100); // cede once in a while
416 * got an invalid object. Don't do anything with it - the game 313
417 * or editor will not be able to do anything with it either. 314 switch (f.kw)
418 */
419 if (op->arch == NULL)
420 { 315 {
421 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 316 case KW_arch:
422 continue; 317 if (object *op = object::read (f, this))
423 }
424
425 switch (i)
426 { 318 {
427 case LL_NORMAL: 319 if (op->inv)
320 sum_weight (op);
321
428 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 }
429 324
430 if (op->inv) 325 continue;
431 sum_weight (op);
432 326
433 prev = op, last_more = op;
434 break;
435
436 case LL_MORE: 327 case KW_EOF:
437 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 328 return true;
438 op->head = prev, last_more->more = op, last_more = op; 329
330 default:
331 if (!f.parse_error ("map file"))
332 return false;
439 break; 333 break;
440 } 334 }
441 335
442 op = object::create (); 336 f.next ();
443 op->map = this;
444 }
445
446 op->destroy ();
447
448#if 0
449 for (i = 0; i < width; i++)
450 for (j = 0; j < height; j++)
451 {
452 unique = 0;
453 /* check for unique items, or unique squares */
454 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
455 {
456 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
457 unique = 1;
458
459 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
460 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
461 }
462 } 337 }
463#endif
464 338
465 return true; 339 return true;
466} 340}
467 341
468void 342void
469maptile::activate () 343maptile::activate ()
470{ 344{
471 if (!spaces) 345 if (spaces)
472 return;
473
474 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 346 for (mapspace *ms = spaces + size (); ms-- > spaces; )
475 for (object *op = ms->bot; op; op = op->above) 347 for (object *op = ms->bot; op; op = op->above)
476 op->activate_recursive (); 348 op->activate_recursive ();
477} 349}
478 350
479void 351void
480maptile::deactivate () 352maptile::deactivate ()
481{ 353{
482 if (!spaces) 354 if (spaces)
483 return;
484
485 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 355 for (mapspace *ms = spaces + size (); ms-- > spaces; )
486 for (object *op = ms->bot; op; op = op->above) 356 for (object *op = ms->bot; op; op = op->above)
487 op->deactivate_recursive (); 357 op->deactivate_recursive ();
488} 358}
489 359
490bool 360bool
491maptile::save_objects (object_freezer &freezer, int flags) 361maptile::_save_objects (object_freezer &f, int flags)
492{ 362{
493 static int cede_count = 0; 363 coroapi::cede_to_tick ();
494 364
495 if (flags & IO_HEADER) 365 if (flags & IO_HEADER)
496 save_header (freezer); 366 _save_header (f);
497 367
498 if (!spaces) 368 if (!spaces)
499 return false; 369 return false;
500 370
501 for (int i = 0; i < size (); ++i) 371 for (int i = 0; i < size (); ++i)
502 { 372 {
503 if (cede_count >= 500)
504 {
505 cede_count = 0;
506 coroapi::cede ();
507 }
508
509 int unique = 0; 373 bool unique = 0;
374
510 for (object *op = spaces [i].bot; op; op = op->above) 375 for (object *op = spaces [i].bot; op; op = op->above)
511 { 376 {
512 // count per-object, but cede only when modification-safe
513 cede_count++;
514
515 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 377 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
516 unique = 1;
517 378
518 if (!op->can_map_save ()) 379 if (expect_false (!op->can_map_save ()))
519 continue; 380 continue;
520 381
521 if (unique || op->flag [FLAG_UNIQUE]) 382 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
522 { 383 {
523 if (flags & IO_UNIQUES) 384 if (flags & IO_UNIQUES)
524 save_object (freezer, op, 1); 385 op->write (f);
525 } 386 }
526 else if (flags & IO_OBJECTS) 387 else if (expect_true (flags & IO_OBJECTS))
527 save_object (freezer, op, 1); 388 op->write (f);
528 } 389 }
529 } 390 }
530 391
392 coroapi::cede_to_tick ();
393
531 return true; 394 return true;
532} 395}
533 396
534bool 397bool
535maptile::load_objects (const char *path, bool skip_header) 398maptile::_save_objects (const char *path, int flags)
536{ 399{
537 object_thawer thawer (path); 400 object_freezer freezer;
538 401
539 if (!thawer) 402 if (!_save_objects (freezer, flags))
540 return false; 403 return false;
541 404
542 if (skip_header)
543 for (;;)
544 {
545 keyword kw = thawer.get_kv ();
546
547 if (kw == KW_end)
548 break;
549
550 thawer.skip_kv (kw);
551 }
552
553 return load_objects (thawer);
554}
555
556bool
557maptile::save_objects (const char *path, int flags)
558{
559 object_freezer freezer;
560
561 if (!save_objects (freezer, flags))
562 return false;
563
564 return freezer.save (path); 405 return freezer.save (path);
565} 406}
566 407
567maptile::maptile () 408maptile::maptile ()
568{ 409{
569 in_memory = MAP_SWAPPED; 410 in_memory = MAP_SWAPPED;
570 411
571 /* 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
572 * map archetype. Mimic that behaviour. 413 * map archetype. Mimic that behaviour.
573 */ 414 */
574 width = 16; 415 width = 16;
575 height = 16; 416 height = 16;
576 reset_timeout = 0;
577 timeout = 300; 417 timeout = 300;
578 enter_x = 0; 418 max_nrof = 1000; // 1000 items of anything
579 enter_y = 0; 419 max_volume = 2000000; // 2m³
580} 420}
581 421
582maptile::maptile (int w, int h) 422maptile::maptile (int w, int h)
583{ 423{
584 in_memory = MAP_SWAPPED; 424 in_memory = MAP_SWAPPED;
… …
730 * 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
731 * 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.
732 * MSW 2001-07-01 572 * MSW 2001-07-01
733 */ 573 */
734bool 574bool
735maptile::load_header (object_thawer &thawer) 575maptile::_load_header (object_thawer &thawer)
736{ 576{
737 for (;;) 577 for (;;)
738 { 578 {
739 keyword kw = thawer.get_kv ();
740
741 switch (kw) 579 switch (thawer.kw)
742 { 580 {
743 case KW_EOF:
744 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
745 return false;
746
747 case KW_end:
748 return true;
749
750 default:
751 case KW_ERROR:
752 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
753 break;
754
755 case KW_msg: 581 case KW_msg:
756 thawer.get_ml (KW_endmsg, msg); 582 thawer.get_ml (KW_endmsg, msg);
757 break; 583 break;
758 584
759 case KW_lore: // CF+ extension 585 case KW_lore: // CF+ extension
… …
790 case KW_winddir: thawer.get (winddir); break; 616 case KW_winddir: thawer.get (winddir); break;
791 case KW_sky: thawer.get (sky); break; 617 case KW_sky: thawer.get (sky); break;
792 618
793 case KW_per_player: thawer.get (per_player); break; 619 case KW_per_player: thawer.get (per_player); break;
794 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;
795 622
796 case KW_region: get_region_by_name (thawer.get_str ()); break; 623 case KW_region: default_region = region::find (thawer.get_str ()); break;
797 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 624 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
798 625
799 // old names new names 626 // old names new names
800 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;
801 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;
… …
809 636
810 case KW_tile_path_1: thawer.get (tile_path [0]); break; 637 case KW_tile_path_1: thawer.get (tile_path [0]); break;
811 case KW_tile_path_2: thawer.get (tile_path [1]); break; 638 case KW_tile_path_2: thawer.get (tile_path [1]); break;
812 case KW_tile_path_3: thawer.get (tile_path [2]); break; 639 case KW_tile_path_3: thawer.get (tile_path [2]); break;
813 case KW_tile_path_4: thawer.get (tile_path [3]); break; 640 case KW_tile_path_4: thawer.get (tile_path [3]); break;
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
650 default:
651 if (!thawer.parse_error ("map", 0))
652 return false;
653 break;
814 } 654 }
655
656 thawer.next ();
815 } 657 }
816 658
817 abort (); 659 abort ();
818}
819
820bool
821maptile::load_header (const char *path)
822{
823 object_thawer thawer (path);
824
825 if (!thawer)
826 return false;
827
828 return load_header (thawer);
829} 660}
830 661
831/****************************************************************************** 662/******************************************************************************
832 * This is the start of unique map handling code 663 * This is the start of unique map handling code
833 *****************************************************************************/ 664 *****************************************************************************/
… …
844 object *above = op->above; 675 object *above = op->above;
845 676
846 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))
847 unique = 1; 678 unique = 1;
848 679
849 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 680 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
850 { 681 {
851 op->destroy_inv (false); 682 op->destroy_inv (false);
852 op->destroy (); 683 op->destroy ();
853 } 684 }
854 685
… …
856 } 687 }
857 } 688 }
858} 689}
859 690
860bool 691bool
861maptile::save_header (object_freezer &freezer) 692maptile::_save_header (object_freezer &freezer)
862{ 693{
863#define MAP_OUT(k) freezer.put (KW_ ## k, k) 694#define MAP_OUT(k) freezer.put (KW_ ## k, k)
864#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 695#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
865 696
866 MAP_OUT2 (arch, "map"); 697 MAP_OUT2 (arch, "map");
… …
868 if (name) MAP_OUT (name); 699 if (name) MAP_OUT (name);
869 MAP_OUT (swap_time); 700 MAP_OUT (swap_time);
870 MAP_OUT (reset_time); 701 MAP_OUT (reset_time);
871 MAP_OUT (reset_timeout); 702 MAP_OUT (reset_timeout);
872 MAP_OUT (fixed_resettime); 703 MAP_OUT (fixed_resettime);
704 MAP_OUT (no_reset);
873 MAP_OUT (difficulty); 705 MAP_OUT (difficulty);
874 706
875 if (region) MAP_OUT2 (region, region->name); 707 if (default_region) MAP_OUT2 (region, default_region->name);
876 708
877 if (shopitems) 709 if (shopitems)
878 { 710 {
879 char shop[MAX_BUF]; 711 char shop[MAX_BUF];
880 print_shop_string (this, shop); 712 print_shop_string (this, shop);
… …
915 747
916 return true; 748 return true;
917} 749}
918 750
919bool 751bool
920maptile::save_header (const char *path) 752maptile::_save_header (const char *path)
921{ 753{
922 object_freezer freezer; 754 object_freezer freezer;
923 755
924 if (!save_header (freezer)) 756 if (!_save_header (freezer))
925 return false; 757 return false;
926 758
927 return freezer.save (path); 759 return freezer.save (path);
928} 760}
929 761
… …
931 * Remove and free all objects in the given map. 763 * Remove and free all objects in the given map.
932 */ 764 */
933void 765void
934maptile::clear () 766maptile::clear ()
935{ 767{
936 if (!spaces) 768 if (spaces)
937 return; 769 {
938
939 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 770 for (mapspace *ms = spaces + size (); ms-- > spaces; )
940 while (object *op = ms->bot) 771 while (object *op = ms->bot)
941 { 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_ ();
942 if (op->head) 780 if (op == head)
943 op = op->head; 781 {
944
945 op->destroy_inv (false); 782 op->destroy_inv (false);
946 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 }
947 } 790 }
948 791
949 sfree (spaces, size ()), spaces = 0; 792 sfree (spaces, size ()), spaces = 0;
793 }
950 794
951 if (buttons) 795 if (buttons)
952 free_objectlinkpt (buttons), buttons = 0; 796 free_objectlinkpt (buttons), buttons = 0;
797
798 sfree (regions, size ()); regions = 0;
799 delete [] regionmap; regionmap = 0;
953} 800}
954 801
955void 802void
956maptile::clear_header () 803maptile::clear_header ()
957{ 804{
… …
987maptile::do_destroy () 834maptile::do_destroy ()
988{ 835{
989 attachable::do_destroy (); 836 attachable::do_destroy ();
990 837
991 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 }
992} 906}
993 907
994/* 908/*
995 * 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).
996 */ 910 */
… …
1044 if (QUERY_FLAG (op, FLAG_GENERATOR)) 958 if (QUERY_FLAG (op, FLAG_GENERATOR))
1045 { 959 {
1046 total_exp += op->stats.exp; 960 total_exp += op->stats.exp;
1047 961
1048 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 962 if (archetype *at = type_to_archetype (GENERATE_TYPE (op)))
1049 total_exp += at->clone.stats.exp * 8; 963 total_exp += at->stats.exp * 8;
1050 964
1051 monster_cnt++; 965 monster_cnt++;
1052 } 966 }
1053 } 967 }
1054 968
… …
1108 */ 1022 */
1109void 1023void
1110mapspace::update_ () 1024mapspace::update_ ()
1111{ 1025{
1112 object *tmp, *last = 0; 1026 object *tmp, *last = 0;
1113 uint8 flags = 0, light = 0, anywhere = 0; 1027 uint8 flags = P_UPTODATE, light = 0, anywhere = 0;
1114 New_Face *top, *floor, *middle;
1115 object *top_obj, *floor_obj, *middle_obj;
1116 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;
1117 1029
1118 middle = blank_face; 1030 //object *middle = 0;
1119 top = blank_face; 1031 //object *top = 0;
1120 floor = blank_face; 1032 //object *floor = 0;
1121 1033 // this seems to generate better code than using locals, above
1122 middle_obj = 0; 1034 object *&top = faces_obj[0] = 0;
1123 top_obj = 0; 1035 object *&middle = faces_obj[1] = 0;
1124 floor_obj = 0; 1036 object *&floor = faces_obj[2] = 0;
1125 1037
1126 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1038 for (tmp = bot; tmp; last = tmp, tmp = tmp->above)
1127 { 1039 {
1128 /* This could be made additive I guess (two lights better than 1040 /* This could be made additive I guess (two lights better than
1129 * 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
… …
1142 * Always put the player down for drawing. 1054 * Always put the player down for drawing.
1143 */ 1055 */
1144 if (!tmp->invisible) 1056 if (!tmp->invisible)
1145 { 1057 {
1146 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1058 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1147 {
1148 top = tmp->face;
1149 top_obj = tmp; 1059 top = tmp;
1150 }
1151 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1060 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1152 { 1061 {
1153 /* 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,
1154 * so should not be visible, so we clear them. 1063 * so should not be visible, so we clear them.
1155 */ 1064 */
1156 middle = blank_face; 1065 middle = 0;
1157 top = blank_face; 1066 top = 0;
1158 floor = tmp->face;
1159 floor_obj = tmp; 1067 floor = tmp;
1160 } 1068 }
1161 /* Flag anywhere have high priority */ 1069 /* Flag anywhere have high priority */
1162 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1070 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1163 { 1071 {
1164 middle = tmp->face;
1165
1166 middle_obj = tmp; 1072 middle = tmp;
1167 anywhere = 1; 1073 anywhere = 1;
1168 } 1074 }
1169 /* Find the highest visible face around. If equal 1075 /* Find the highest visible face around. If equal
1170 * visibilities, we still want the one nearer to the 1076 * visibilities, we still want the one nearer to the
1171 * top 1077 * top
1172 */ 1078 */
1173 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1079 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1174 {
1175 middle = tmp->face;
1176 middle_obj = tmp; 1080 middle = tmp;
1177 }
1178 } 1081 }
1179 1082
1180 if (tmp == tmp->above) 1083 if (tmp == tmp->above)
1181 { 1084 {
1182 LOG (llevError, "Error in structure of map\n"); 1085 LOG (llevError, "Error in structure of map\n");
… …
1217 * middle face. This should not happen, as we already have the 1120 * middle face. This should not happen, as we already have the
1218 * else statement above so middle should not get set. OTOH, it 1121 * else statement above so middle should not get set. OTOH, it
1219 * 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.
1220 */ 1123 */
1221 if (top == middle) 1124 if (top == middle)
1222 middle = blank_face; 1125 middle = 0;
1223 1126
1224 /* There are three posibilities at this point: 1127 /* There are three posibilities at this point:
1225 * 1) top face is set, need middle to be set. 1128 * 1) top face is set, need middle to be set.
1226 * 2) middle is set, need to set top. 1129 * 2) middle is set, need to set top.
1227 * 3) neither middle or top is set - need to set both. 1130 * 3) neither middle or top is set - need to set both.
… …
1232 /* 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 */
1233 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1136 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1234 break; 1137 break;
1235 1138
1236 /* If two top faces are already set, quit processing */ 1139 /* If two top faces are already set, quit processing */
1237 if ((top != blank_face) && (middle != blank_face)) 1140 if (top && middle)
1238 break; 1141 break;
1239 1142
1240 /* Only show visible faces */ 1143 /* Only show visible faces */
1241 if (!tmp->invisible) 1144 if (!tmp->invisible)
1242 { 1145 {
1243 /* Fill in top if needed */ 1146 /* Fill in top if needed */
1244 if (top == blank_face) 1147 if (!top)
1245 { 1148 {
1246 top = tmp->face;
1247 top_obj = tmp; 1149 top = tmp;
1248 if (top == middle) 1150 if (top == middle)
1249 middle = blank_face; 1151 middle = 0;
1250 } 1152 }
1251 else 1153 else
1252 { 1154 {
1253 /* top is already set - we should only get here if 1155 /* top is already set - we should only get here if
1254 * middle is not set 1156 * middle is not set
1255 * 1157 *
1256 * Set the middle face and break out, since there is nothing 1158 * Set the middle face and break out, since there is nothing
1257 * more to fill in. We don't check visiblity here, since 1159 * more to fill in. We don't check visiblity here, since
1258 * 1160 *
1259 */ 1161 */
1260 if (tmp->face != top) 1162 if (tmp != top)
1261 { 1163 {
1262 middle = tmp->face;
1263 middle_obj = tmp; 1164 middle = tmp;
1264 break; 1165 break;
1265 } 1166 }
1266 } 1167 }
1267 } 1168 }
1268 } 1169 }
1269 1170
1270 if (middle == floor) 1171 if (middle == floor)
1271 middle = blank_face; 1172 middle = 0;
1272 1173
1273 if (top == middle) 1174 if (top == middle)
1274 middle = blank_face; 1175 middle = 0;
1275 1176
1276 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1177#if 0
1277 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1178 faces_obj [0] = top;
1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1179 faces_obj [1] = middle;
1180 faces_obj [2] = floor;
1181#endif
1279} 1182}
1280 1183
1281/* this updates the orig_map->tile_map[tile_num] value after finding 1184uint64
1282 * the map. It also takes care of linking back the freshly found 1185mapspace::volume () const
1283 * maps tile_map values if it tiles back to this one. It returns
1284 * the value of orig_map->tile_map[tile_num].
1285 */
1286static inline maptile *
1287find_and_link (maptile *orig_map, int tile_num)
1288{ 1186{
1289 maptile *mp = orig_map->tile_map [tile_num]; 1187 uint64 vol = 0;
1290 1188
1291 if (!mp) 1189 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1292 { 1190 vol += op->volume ();
1293 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1294 1191
1295 if (!mp) 1192 return vol;
1296 { 1193}
1297 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine
1298 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n",
1299 &orig_map->tile_path[tile_num], &orig_map->path);
1300 mp = new maptile (1, 1);
1301 mp->alloc ();
1302 mp->in_memory = MAP_IN_MEMORY;
1303 }
1304 }
1305 1194
1306 int dest_tile = (tile_num + 2) % 4; 1195bool
1196maptile::tile_available (int dir, bool load)
1197{
1198 if (!tile_path[dir])
1199 return 0;
1307 1200
1308 orig_map->tile_map [tile_num] = mp; 1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY))
1202 return 1;
1309 1203
1310 // optimisation: back-link map to origin map if euclidean 1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1311 //TODO: non-euclidean maps MUST GO 1205 return 1;
1312 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1313 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1314 1206
1315 return mp; 1207 return 0;
1316}
1317
1318static inline void
1319load_and_link (maptile *orig_map, int tile_num)
1320{
1321 find_and_link (orig_map, tile_num)->load_sync ();
1322} 1208}
1323 1209
1324/* this returns TRUE if the coordinates (x,y) are out of 1210/* this returns TRUE if the coordinates (x,y) are out of
1325 * map m. This function also takes into account any 1211 * map m. This function also takes into account any
1326 * tiling considerations, loading adjacant maps as needed. 1212 * tiling considerations, loading adjacant maps as needed.
… …
1339 if (!m) 1225 if (!m)
1340 return 0; 1226 return 0;
1341 1227
1342 if (x < 0) 1228 if (x < 0)
1343 { 1229 {
1344 if (!m->tile_path[3]) 1230 if (!m->tile_available (3))
1345 return 1; 1231 return 1;
1346 1232
1347 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1348 find_and_link (m, 3);
1349
1350 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);
1351 } 1234 }
1352 1235
1353 if (x >= m->width) 1236 if (x >= m->width)
1354 { 1237 {
1355 if (!m->tile_path[1]) 1238 if (!m->tile_available (1))
1356 return 1; 1239 return 1;
1357 1240
1358 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1359 find_and_link (m, 1);
1360
1361 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);
1362 } 1242 }
1363 1243
1364 if (y < 0) 1244 if (y < 0)
1365 { 1245 {
1366 if (!m->tile_path[0]) 1246 if (!m->tile_available (0))
1367 return 1; 1247 return 1;
1368 1248
1369 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1370 find_and_link (m, 0);
1371
1372 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);
1373 } 1250 }
1374 1251
1375 if (y >= m->height) 1252 if (y >= m->height)
1376 { 1253 {
1377 if (!m->tile_path[2]) 1254 if (!m->tile_available (2))
1378 return 1; 1255 return 1;
1379
1380 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1381 find_and_link (m, 2);
1382 1256
1383 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);
1384 } 1258 }
1385 1259
1386 /* Simple case - coordinates are within this local 1260 /* Simple case - coordinates are within this local
… …
1400maptile * 1274maptile *
1401maptile::xy_find (sint16 &x, sint16 &y) 1275maptile::xy_find (sint16 &x, sint16 &y)
1402{ 1276{
1403 if (x < 0) 1277 if (x < 0)
1404 { 1278 {
1405 if (!tile_path[3]) 1279 if (!tile_available (3))
1406 return 0; 1280 return 0;
1407 1281
1408 find_and_link (this, 3);
1409 x += tile_map[3]->width; 1282 x += tile_map[3]->width;
1410 return tile_map[3]->xy_find (x, y); 1283 return tile_map[3]->xy_find (x, y);
1411 } 1284 }
1412 1285
1413 if (x >= width) 1286 if (x >= width)
1414 { 1287 {
1415 if (!tile_path[1]) 1288 if (!tile_available (1))
1416 return 0; 1289 return 0;
1417 1290
1418 find_and_link (this, 1);
1419 x -= width; 1291 x -= width;
1420 return tile_map[1]->xy_find (x, y); 1292 return tile_map[1]->xy_find (x, y);
1421 } 1293 }
1422 1294
1423 if (y < 0) 1295 if (y < 0)
1424 { 1296 {
1425 if (!tile_path[0]) 1297 if (!tile_available (0))
1426 return 0; 1298 return 0;
1427 1299
1428 find_and_link (this, 0);
1429 y += tile_map[0]->height; 1300 y += tile_map[0]->height;
1430 return tile_map[0]->xy_find (x, y); 1301 return tile_map[0]->xy_find (x, y);
1431 } 1302 }
1432 1303
1433 if (y >= height) 1304 if (y >= height)
1434 { 1305 {
1435 if (!tile_path[2]) 1306 if (!tile_available (2))
1436 return 0; 1307 return 0;
1437 1308
1438 find_and_link (this, 2);
1439 y -= height; 1309 y -= height;
1440 return tile_map[2]->xy_find (x, y); 1310 return tile_map[2]->xy_find (x, y);
1441 } 1311 }
1442 1312
1443 /* Simple case - coordinates are within this local 1313 /* Simple case - coordinates are within this local
… …
1448 1318
1449/** 1319/**
1450 * 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
1451 * map1 to map2 in dx/dy. 1321 * map1 to map2 in dx/dy.
1452 */ 1322 */
1453static int 1323int
1454adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1324adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1455{ 1325{
1456 if (!map1 || !map2) 1326 if (!map1 || !map2)
1457 return 0; 1327 return 0;
1458 1328
1459 //TODO: this doesn't actually check corretcly when intermediate maps are not loaded 1329 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1460 //fix: compare paths instead (this is likely faster, too!) 1330 //fix: compare paths instead (this is likely faster, too!)
1461 if (map1 == map2) 1331 if (map1 == map2)
1462 { 1332 {
1463 *dx = 0; 1333 *dx = 0;
1464 *dy = 0; 1334 *dy = 0;
… …
1549/* From map.c 1419/* From map.c
1550 * This is used by get_player to determine where the other 1420 * This is used by get_player to determine where the other
1551 * creature is. get_rangevector takes into account map tiling, 1421 * creature is. get_rangevector takes into account map tiling,
1552 * 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
1553 * righte value. distance_x/y are distance away, which 1423 * righte value. distance_x/y are distance away, which
1554 * can be negativbe. direction is the crossfire direction scheme 1424 * can be negative. direction is the crossfire direction scheme
1555 * that the creature should head. part is the part of the 1425 * that the creature should head. part is the part of the
1556 * monster that is closest. 1426 * monster that is closest.
1557 * 1427 *
1558 * get_rangevector looks at op1 and op2, and fills in the 1428 * get_rangevector looks at op1 and op2, and fills in the
1559 * structure for op1 to get to op2. 1429 * structure for op1 to get to op2.
… …
1570get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1440get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1571{ 1441{
1572 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))
1573 { 1443 {
1574 /* be conservative and fill in _some_ data */ 1444 /* be conservative and fill in _some_ data */
1575 retval->distance = 100000; 1445 retval->distance = 10000;
1576 retval->distance_x = 32767; 1446 retval->distance_x = 10000;
1577 retval->distance_y = 32767; 1447 retval->distance_y = 10000;
1578 retval->direction = 0; 1448 retval->direction = 0;
1579 retval->part = 0; 1449 retval->part = 0;
1580 } 1450 }
1581 else 1451 else
1582 { 1452 {
… …
1587 1457
1588 best = op1; 1458 best = op1;
1589 /* If this is multipart, find the closest part now */ 1459 /* If this is multipart, find the closest part now */
1590 if (!(flags & 0x1) && op1->more) 1460 if (!(flags & 0x1) && op1->more)
1591 { 1461 {
1592 object *tmp;
1593 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;
1594 1463
1595 /* 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
1596 * distance instead of doing all that work above again 1465 * distance instead of doing all that work above again
1597 * since the distance fields we set above are positive in the 1466 * since the distance fields we set above are positive in the
1598 * same axis as is used for multipart objects, the simply arithmetic 1467 * same axis as is used for multipart objects, the simply arithmetic
1599 * below works. 1468 * below works.
1600 */ 1469 */
1601 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1470 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1602 { 1471 {
1603 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) +
1604 (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);
1605 if (tmpi < best_distance) 1474 if (tmpi < best_distance)
1606 { 1475 {
1607 best_distance = tmpi; 1476 best_distance = tmpi;
1608 best = tmp; 1477 best = tmp;
1609 } 1478 }
1610 } 1479 }
1480
1611 if (best != op1) 1481 if (best != op1)
1612 { 1482 {
1613 retval->distance_x += op1->x - best->x; 1483 retval->distance_x += op1->x - best->x;
1614 retval->distance_y += op1->y - best->y; 1484 retval->distance_y += op1->y - best->y;
1615 } 1485 }
1616 } 1486 }
1487
1617 retval->part = best; 1488 retval->part = best;
1618 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));
1619 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1490 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1620 } 1491 }
1621} 1492}
1622 1493
1623/* 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
… …
1628 * 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
1629 * 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
1630 * 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
1631 * field of the rv_vector is set to NULL. 1502 * field of the rv_vector is set to NULL.
1632 */ 1503 */
1633
1634void 1504void
1635get_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)
1636{ 1506{
1637 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))
1638 { 1508 {
1639 /* be conservative and fill in _some_ data */ 1509 /* be conservative and fill in _some_ data */
1640 retval->distance = 100000; 1510 retval->distance = 100000;
… …
1647 { 1517 {
1648 retval->distance_x += op2->x - x; 1518 retval->distance_x += op2->x - x;
1649 retval->distance_y += op2->y - y; 1519 retval->distance_y += op2->y - y;
1650 1520
1651 retval->part = NULL; 1521 retval->part = NULL;
1652 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);
1653 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1523 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1654 } 1524 }
1655} 1525}
1656 1526
1657/* 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
… …
1677 op->remove (); 1547 op->remove ();
1678 1548
1679 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);
1680} 1550}
1681 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