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.73 by root, Sun Jan 14 18:00:33 2007 UTC vs.
Revision 1.160 by root, Mon Oct 12 14:00:57 2009 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 * Deliantra is free software: you can redistribute it and/or modify it under
9 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
10 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 (at your option) any later version. 11 * 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 Affero GNU General Public License
19 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 21 *
22 The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23*/ 23 */
24 24
25#include <global.h>
26#include <funcpoint.h>
27
28#include <loader.h>
29#include <unistd.h> 25#include <unistd.h>
30 26
27#include "global.h"
28#include "loader.h"
31#include "path.h" 29#include "path.h"
32 30
33/* 31sint8 maptile::outdoor_darkness;
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
… …
324 245
325 insert_ob_in_ob (tmp, container); 246 insert_ob_in_ob (tmp, container);
326 tmp = next; 247 tmp = next;
327 } 248 }
328 249
329 /* sum_weight will go through and calculate what all the containers are 250 // go through and calculate what all the containers are carrying.
330 * carrying. 251 //TODO: remove
331 */ 252 container->update_weight ();
332 sum_weight (container);
333} 253}
334 254
335void 255void
336maptile::set_object_flag (int flag, int value) 256maptile::set_object_flag (int flag, int value)
337{ 257{
… …
341 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 261 for (mapspace *ms = spaces + size (); ms-- > spaces; )
342 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 262 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
343 tmp->flag [flag] = value; 263 tmp->flag [flag] = value;
344} 264}
345 265
266void
267maptile::post_load_original ()
268{
269 if (!spaces)
270 return;
271
272 set_object_flag (FLAG_OBJ_ORIGINAL);
273
274 for (mapspace *ms = spaces + size (); ms-- > spaces; )
275 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
276 INVOKE_OBJECT (RESET, tmp);
277}
278
346/* link_multipart_objects go through all the objects on the map looking 279/* 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 280 * 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 281 * 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 282 * they are saved).
350 * the more sections and not re-add sections for them.
351 */ 283 */
352void 284void
353maptile::link_multipart_objects () 285maptile::link_multipart_objects ()
354{ 286{
355 if (!spaces) 287 if (!spaces)
356 return; 288 return;
357 289
358 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 290 for (mapspace *ms = spaces + size (); ms-- > spaces; )
359 for (object *tmp = ms->bot; tmp; ) 291 {
292 object *op = ms->bot;
293 while (op)
360 { 294 {
361 object *above = tmp->above;
362
363 /* already multipart - don't do anything more */ 295 /* already multipart - don't do anything more */
364 if (!tmp->head && !tmp->more) 296 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 { 297 {
375 op = arch_to_object (at); 298 op->remove ();
299 op->expand_tail ();
376 300
377 /* update x,y coordinates */ 301 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
378 op->x += tmp->x; 302 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
379 op->y += tmp->y; 303 // 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); 304 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
305
306 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
307 // so we have to reset the iteration through the mapspace
392 } 308 }
309 else
310 op = op->above;
393 } 311 }
394
395 tmp = above;
396 } 312 }
397} 313}
398 314
399/* 315/*
400 * Loads (ands parses) the objects into a given map from the specified 316 * Loads (ands parses) the objects into a given map from the specified
401 * file pointer. 317 * file pointer.
402 * mapflags is the same as we get with load_original_map
403 */ 318 */
404bool 319bool
405maptile::_load_objects (object_thawer &thawer) 320maptile::_load_objects (object_thawer &f)
406{ 321{
407 int unique; 322 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 { 323 {
415 /* if the archetype for the object is null, means that we 324 coroapi::cede_to_tick (); // cede once in a while
416 * got an invalid object. Don't do anything with it - the game 325
417 * or editor will not be able to do anything with it either. 326 switch (f.kw)
418 */
419 if (op->arch == NULL)
420 { 327 {
421 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 328 case KW_arch:
329 if (object *op = object::read (f, this))
330 {
331 // TODO: why?
332 if (op->inv)
333 op->update_weight ();
334
335 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
336 {
337 // we insert manually because
338 // a) its way faster
339 // b) we remove manually, too, and there are good reasons for that
340 // c) it's correct
341 mapspace &ms = at (op->x, op->y);
342
343 op->flag [FLAG_REMOVED] = false;
344
345 op->above = 0;
346 op->below = ms.top;
347
348 *(ms.top ? &ms.top->above : &ms.bot) = op;
349
350 ms.top = op;
351 ms.flags_ = 0;
352 }
353 else
354 {
355 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
356 op->destroy ();
357 }
358 }
359
422 continue; 360 continue;
423 }
424 361
425 switch (i)
426 {
427 case LL_NORMAL:
428 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
429
430 if (op->inv)
431 sum_weight (op);
432
433 prev = op, last_more = op;
434 break;
435
436 case LL_MORE: 362 case KW_EOF:
437 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 363 return true;
438 op->head = prev, last_more->more = op, last_more = op; 364
365 default:
366 if (!f.parse_error ("map file"))
367 return false;
439 break; 368 break;
440 } 369 }
441 370
442 op = object::create (); 371 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 } 372 }
463#endif
464 373
465 return true; 374 return true;
466} 375}
467 376
468void 377void
469maptile::activate () 378maptile::activate ()
470{ 379{
471 if (!spaces) 380 if (spaces)
472 return;
473
474 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 381 for (mapspace *ms = spaces + size (); ms-- > spaces; )
475 for (object *op = ms->bot; op; op = op->above) 382 for (object *op = ms->bot; op; op = op->above)
476 op->activate_recursive (); 383 op->activate_recursive ();
477} 384}
478 385
479void 386void
480maptile::deactivate () 387maptile::deactivate ()
481{ 388{
482 if (!spaces) 389 if (spaces)
483 return;
484
485 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 390 for (mapspace *ms = spaces + size (); ms-- > spaces; )
486 for (object *op = ms->bot; op; op = op->above) 391 for (object *op = ms->bot; op; op = op->above)
487 op->deactivate_recursive (); 392 op->deactivate_recursive ();
488} 393}
489 394
490bool 395bool
491maptile::_save_objects (object_freezer &freezer, int flags) 396maptile::_save_objects (object_freezer &f, int flags)
492{ 397{
493 static int cede_count = 0; 398 coroapi::cede_to_tick ();
494 399
495 if (flags & IO_HEADER) 400 if (flags & IO_HEADER)
496 _save_header (freezer); 401 _save_header (f);
497 402
498 if (!spaces) 403 if (!spaces)
499 return false; 404 return false;
500 405
501 for (int i = 0; i < size (); ++i) 406 for (int i = 0; i < size (); ++i)
502 { 407 {
503#if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D
504 if (cede_count >= 500)
505 {
506 cede_count = 0;
507 coroapi::cede ();
508 }
509#endif
510
511 int unique = 0; 408 bool unique = 0;
409
512 for (object *op = spaces [i].bot; op; op = op->above) 410 for (object *op = spaces [i].bot; op; op = op->above)
513 { 411 {
514 // count per-object, but cede only when modification-safe
515 cede_count++;
516
517 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 412 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
518 unique = 1;
519 413
520 if (!op->can_map_save ()) 414 if (expect_false (!op->can_map_save ()))
521 continue; 415 continue;
522 416
523 if (unique || op->flag [FLAG_UNIQUE]) 417 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
524 { 418 {
525 if (flags & IO_UNIQUES) 419 if (flags & IO_UNIQUES)
526 save_object (freezer, op, 1); 420 op->write (f);
527 } 421 }
528 else if (flags & IO_OBJECTS) 422 else if (expect_true (flags & IO_OBJECTS))
529 save_object (freezer, op, 1); 423 op->write (f);
530 } 424 }
531 } 425 }
532 426
427 coroapi::cede_to_tick ();
428
533 return true; 429 return true;
534}
535
536bool
537maptile::_load_objects (const char *path, bool skip_header)
538{
539 object_thawer thawer (path);
540
541 if (!thawer)
542 return false;
543
544 if (skip_header)
545 for (;;)
546 {
547 keyword kw = thawer.get_kv ();
548
549 if (kw == KW_end)
550 break;
551
552 thawer.skip_kv (kw);
553 }
554
555 return _load_objects (thawer);
556} 430}
557 431
558bool 432bool
559maptile::_save_objects (const char *path, int flags) 433maptile::_save_objects (const char *path, int flags)
560{ 434{
… …
569maptile::maptile () 443maptile::maptile ()
570{ 444{
571 in_memory = MAP_SWAPPED; 445 in_memory = MAP_SWAPPED;
572 446
573 /* The maps used to pick up default x and y values from the 447 /* The maps used to pick up default x and y values from the
574 * map archetype. Mimic that behaviour. 448 * map archetype. Mimic that behaviour.
575 */ 449 */
576 width = 16; 450 width = 16;
577 height = 16; 451 height = 16;
578 reset_timeout = 0;
579 timeout = 300; 452 timeout = 300;
580 enter_x = 0; 453 max_nrof = 1000; // 1000 items of anything
581 enter_y = 0; 454 max_volume = 2000000; // 2m³
582} 455}
583 456
584maptile::maptile (int w, int h) 457maptile::maptile (int w, int h)
585{ 458{
586 in_memory = MAP_SWAPPED; 459 in_memory = MAP_SWAPPED;
… …
736bool 609bool
737maptile::_load_header (object_thawer &thawer) 610maptile::_load_header (object_thawer &thawer)
738{ 611{
739 for (;;) 612 for (;;)
740 { 613 {
741 keyword kw = thawer.get_kv ();
742
743 switch (kw) 614 switch (thawer.kw)
744 { 615 {
745 case KW_EOF:
746 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
747 return false;
748
749 case KW_end:
750 return true;
751
752 default:
753 case KW_ERROR:
754 LOG (llevError, "%s: skipping errornous line (%s) while reading map header.\n", &path, thawer.last_keyword);
755 break;
756
757 case KW_msg: 616 case KW_msg:
758 thawer.get_ml (KW_endmsg, msg); 617 thawer.get_ml (KW_endmsg, msg);
759 break; 618 break;
760 619
761 case KW_lore: // CF+ extension 620 case KW_lore: // CF+ extension
… …
792 case KW_winddir: thawer.get (winddir); break; 651 case KW_winddir: thawer.get (winddir); break;
793 case KW_sky: thawer.get (sky); break; 652 case KW_sky: thawer.get (sky); break;
794 653
795 case KW_per_player: thawer.get (per_player); break; 654 case KW_per_player: thawer.get (per_player); break;
796 case KW_per_party: thawer.get (per_party); break; 655 case KW_per_party: thawer.get (per_party); break;
656 case KW_no_reset: thawer.get (no_reset); break;
657 case KW_no_drop: thawer.get (no_drop); break;
797 658
798 case KW_region: get_region_by_name (thawer.get_str ()); break; 659 case KW_region: default_region = region::find (thawer.get_str ()); break;
799 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 660 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
800 661
801 // old names new names 662 // old names new names
802 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 663 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
803 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 664 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
811 672
812 case KW_tile_path_1: thawer.get (tile_path [0]); break; 673 case KW_tile_path_1: thawer.get (tile_path [0]); break;
813 case KW_tile_path_2: thawer.get (tile_path [1]); break; 674 case KW_tile_path_2: thawer.get (tile_path [1]); break;
814 case KW_tile_path_3: thawer.get (tile_path [2]); break; 675 case KW_tile_path_3: thawer.get (tile_path [2]); break;
815 case KW_tile_path_4: thawer.get (tile_path [3]); break; 676 case KW_tile_path_4: thawer.get (tile_path [3]); break;
677
678 case KW_ERROR:
679 set_key_text (thawer.kw_str, thawer.value);
680 break;
681
682 case KW_end:
683 thawer.next ();
684 return true;
685
686 default:
687 if (!thawer.parse_error ("map", 0))
688 return false;
689 break;
816 } 690 }
691
692 thawer.next ();
817 } 693 }
818 694
819 abort (); 695 abort ();
820}
821
822bool
823maptile::_load_header (const char *path)
824{
825 object_thawer thawer (path);
826
827 if (!thawer)
828 return false;
829
830 return _load_header (thawer);
831} 696}
832 697
833/****************************************************************************** 698/******************************************************************************
834 * This is the start of unique map handling code 699 * This is the start of unique map handling code
835 *****************************************************************************/ 700 *****************************************************************************/
… …
846 object *above = op->above; 711 object *above = op->above;
847 712
848 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 713 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
849 unique = 1; 714 unique = 1;
850 715
851 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 716 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
852 {
853 op->destroy_inv (false);
854 op->destroy (); 717 op->destroy ();
855 }
856 718
857 op = above; 719 op = above;
858 } 720 }
859 } 721 }
860} 722}
… …
870 if (name) MAP_OUT (name); 732 if (name) MAP_OUT (name);
871 MAP_OUT (swap_time); 733 MAP_OUT (swap_time);
872 MAP_OUT (reset_time); 734 MAP_OUT (reset_time);
873 MAP_OUT (reset_timeout); 735 MAP_OUT (reset_timeout);
874 MAP_OUT (fixed_resettime); 736 MAP_OUT (fixed_resettime);
737 MAP_OUT (no_reset);
738 MAP_OUT (no_drop);
875 MAP_OUT (difficulty); 739 MAP_OUT (difficulty);
876 740
877 if (region) MAP_OUT2 (region, region->name); 741 if (default_region) MAP_OUT2 (region, default_region->name);
878 742
879 if (shopitems) 743 if (shopitems)
880 { 744 {
881 char shop[MAX_BUF]; 745 char shop[MAX_BUF];
882 print_shop_string (this, shop); 746 print_shop_string (this, shop);
… …
933 * Remove and free all objects in the given map. 797 * Remove and free all objects in the given map.
934 */ 798 */
935void 799void
936maptile::clear () 800maptile::clear ()
937{ 801{
938 if (!spaces) 802 if (spaces)
939 return; 803 {
940
941 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 804 for (mapspace *ms = spaces + size (); ms-- > spaces; )
942 while (object *op = ms->bot) 805 while (object *op = ms->bot)
943 { 806 {
807 // manually remove, as to not trigger anything
808 if (ms->bot = op->above)
809 ms->bot->below = 0;
810
811 op->flag [FLAG_REMOVED] = true;
812
813 object *head = op->head_ ();
944 if (op->head) 814 if (op == head)
945 op = op->head;
946
947 op->destroy_inv (false);
948 op->destroy (); 815 op->destroy ();
816 else if (head->map != op->map)
817 {
818 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
819 head->destroy ();
820 }
821 }
822
823 sfree0 (spaces, size ());
949 } 824 }
950
951 sfree (spaces, size ()), spaces = 0;
952 825
953 if (buttons) 826 if (buttons)
954 free_objectlinkpt (buttons), buttons = 0; 827 free_objectlinkpt (buttons), buttons = 0;
828
829 sfree0 (regions, size ());
830 delete [] regionmap; regionmap = 0;
955} 831}
956 832
957void 833void
958maptile::clear_header () 834maptile::clear_header ()
959{ 835{
… …
991 attachable::do_destroy (); 867 attachable::do_destroy ();
992 868
993 clear (); 869 clear ();
994} 870}
995 871
996/* 872/* decay and destroy perishable items in a map */
997 * Updates every button on the map (by calling update_button() for them).
998 */
999void 873void
1000maptile::update_buttons () 874maptile::do_decay_objects ()
1001{ 875{
1002 for (oblinkpt *obp = buttons; obp; obp = obp->next) 876 if (!spaces)
1003 for (objectlink *ol = obp->link; ol; ol = ol->next) 877 return;
878
879 for (mapspace *ms = spaces + size (); ms-- > spaces; )
880 for (object *above, *op = ms->bot; op; op = above)
1004 { 881 {
1005 if (!ol->ob) 882 above = op->above;
883
884 bool destroy = 0;
885
886 // do not decay anything above unique floor tiles (yet :)
887 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
888 break;
889
890 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
891 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
892 || QUERY_FLAG (op, FLAG_UNIQUE)
893 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
894 || QUERY_FLAG (op, FLAG_UNPAID)
895 || op->is_alive ())
896 ; // do not decay
897 else if (op->is_weapon ())
1006 { 898 {
1007 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 899 op->stats.dam--;
1008 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value); 900 if (op->stats.dam < 0)
1009 continue; 901 destroy = 1;
1010 } 902 }
1011 903 else if (op->is_armor ())
1012 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1013 { 904 {
1014 update_button (ol->ob); 905 op->stats.ac--;
1015 break; 906 if (op->stats.ac < 0)
907 destroy = 1;
1016 } 908 }
909 else if (op->type == FOOD)
910 {
911 op->stats.food -= rndm (5, 20);
912 if (op->stats.food < 0)
913 destroy = 1;
914 }
915 else
916 {
917 int mat = op->materials;
918
919 if (mat & M_PAPER
920 || mat & M_LEATHER
921 || mat & M_WOOD
922 || mat & M_ORGANIC
923 || mat & M_CLOTH
924 || mat & M_LIQUID
925 || (mat & M_IRON && rndm (1, 5) == 1)
926 || (mat & M_GLASS && rndm (1, 2) == 1)
927 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
928 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
929 || (mat & M_ICE && temp > 32))
930 destroy = 1;
931 }
932
933 /* adjust overall chance below */
934 if (destroy && rndm (0, 1))
935 op->destroy ();
1017 } 936 }
1018} 937}
1019 938
1020/* 939/*
1021 * This routine is supposed to find out the difficulty of the map. 940 * This routine is supposed to find out the difficulty of the map.
1022 * difficulty does not have a lot to do with character level, 941 * difficulty does not have a lot to do with character level,
1023 * but does have a lot to do with treasure on the map. 942 * but does have a lot to do with treasure on the map.
1024 * 943 *
1025 * Difficulty can now be set by the map creature. If the value stored 944 * Difficulty can now be set by the map creator. If the value stored
1026 * in the map is zero, then use this routine. Maps should really 945 * in the map is zero, then use this routine. Maps should really
1027 * have a difficulty set than using this function - human calculation 946 * have a difficulty set rather than using this function - human calculation
1028 * is much better than this functions guesswork. 947 * is much better than this function's guesswork.
1029 */ 948 */
1030int 949int
1031maptile::estimate_difficulty () const 950maptile::estimate_difficulty () const
1032{ 951{
1033 long monster_cnt = 0; 952 long monster_cnt = 0;
… …
1045 964
1046 if (QUERY_FLAG (op, FLAG_GENERATOR)) 965 if (QUERY_FLAG (op, FLAG_GENERATOR))
1047 { 966 {
1048 total_exp += op->stats.exp; 967 total_exp += op->stats.exp;
1049 968
1050 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 969 if (archetype *at = op->other_arch)
970 {
1051 total_exp += at->clone.stats.exp * 8; 971 total_exp += at->stats.exp * 8;
1052
1053 monster_cnt++; 972 monster_cnt++;
973 }
974
975 for (object *inv = op->inv; inv; inv = inv->below)
976 {
977 total_exp += op->stats.exp * 8;
978 monster_cnt++;
979 }
1054 } 980 }
1055 } 981 }
1056 982
1057 avgexp = (double) total_exp / monster_cnt; 983 avgexp = (double) total_exp / monster_cnt;
1058 984
… …
1071 * postive values make it darker, negative make it brighter 997 * postive values make it darker, negative make it brighter
1072 */ 998 */
1073int 999int
1074maptile::change_map_light (int change) 1000maptile::change_map_light (int change)
1075{ 1001{
1076 int new_level = darkness + change;
1077
1078 /* Nothing to do */ 1002 /* Nothing to do */
1079 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1003 if (!change)
1080 return 0; 1004 return 0;
1081 1005
1082 /* inform all players on the map */ 1006 /* inform all players on the map */
1083 if (change > 0) 1007 if (change > 0)
1084 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1008 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1085 else 1009 else
1086 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1010 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1087 1011
1088 /* Do extra checking. since darkness is a unsigned value, 1012 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1089 * we need to be extra careful about negative values.
1090 * In general, the checks below are only needed if change
1091 * is not +/-1
1092 */
1093 if (new_level < 0)
1094 darkness = 0;
1095 else if (new_level >= MAX_DARKNESS)
1096 darkness = MAX_DARKNESS;
1097 else
1098 darkness = new_level;
1099 1013
1100 /* All clients need to get re-updated for the change */ 1014 /* All clients need to get re-updated for the change */
1101 update_all_map_los (this); 1015 update_all_map_los (this);
1016
1102 return 1; 1017 return 1;
1103} 1018}
1104 1019
1105/* 1020/*
1106 * This function updates various attributes about a specific space 1021 * This function updates various attributes about a specific space
… …
1109 * through, etc) 1024 * through, etc)
1110 */ 1025 */
1111void 1026void
1112mapspace::update_ () 1027mapspace::update_ ()
1113{ 1028{
1114 object *tmp, *last = 0; 1029 object *last = 0;
1115 uint8 flags = 0, light = 0, anywhere = 0; 1030 uint8 flags = P_UPTODATE, anywhere = 0;
1116 New_Face *top, *floor, *middle; 1031 sint8 light = 0;
1117 object *top_obj, *floor_obj, *middle_obj;
1118 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1032 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1119 1033
1120 middle = blank_face; 1034 //object *middle = 0;
1121 top = blank_face; 1035 //object *top = 0;
1122 floor = blank_face; 1036 //object *floor = 0;
1037 // this seems to generate better code than using locals, above
1038 object *&top = faces_obj[0] = 0;
1039 object *&middle = faces_obj[1] = 0;
1040 object *&floor = faces_obj[2] = 0;
1123 1041
1124 middle_obj = 0;
1125 top_obj = 0;
1126 floor_obj = 0;
1127
1128 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1042 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1129 { 1043 {
1130 /* This could be made additive I guess (two lights better than 1044 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1131 * one). But if so, it shouldn't be a simple additive - 2
1132 * light bulbs do not illuminate twice as far as once since
1133 * it is a dissapation factor that is cubed.
1134 */
1135 if (tmp->glow_radius > light)
1136 light = tmp->glow_radius; 1045 light += tmp->glow_radius;
1137 1046
1138 /* This call is needed in order to update objects the player 1047 /* This call is needed in order to update objects the player
1139 * is standing in that have animations (ie, grass, fire, etc). 1048 * is standing in that have animations (ie, grass, fire, etc).
1140 * However, it also causes the look window to be re-drawn 1049 * However, it also causes the look window to be re-drawn
1141 * 3 times each time the player moves, because many of the 1050 * 3 times each time the player moves, because many of the
… …
1144 * Always put the player down for drawing. 1053 * Always put the player down for drawing.
1145 */ 1054 */
1146 if (!tmp->invisible) 1055 if (!tmp->invisible)
1147 { 1056 {
1148 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1057 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1149 {
1150 top = tmp->face;
1151 top_obj = tmp; 1058 top = tmp;
1152 }
1153 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1059 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1154 { 1060 {
1155 /* If we got a floor, that means middle and top were below it, 1061 /* If we got a floor, that means middle and top were below it,
1156 * so should not be visible, so we clear them. 1062 * so should not be visible, so we clear them.
1157 */ 1063 */
1158 middle = blank_face; 1064 middle = 0;
1159 top = blank_face; 1065 top = 0;
1160 floor = tmp->face;
1161 floor_obj = tmp; 1066 floor = tmp;
1162 } 1067 }
1163 /* Flag anywhere have high priority */ 1068 /* Flag anywhere have high priority */
1164 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1069 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1165 { 1070 {
1166 middle = tmp->face;
1167
1168 middle_obj = tmp; 1071 middle = tmp;
1169 anywhere = 1; 1072 anywhere = 1;
1170 } 1073 }
1074
1171 /* Find the highest visible face around. If equal 1075 /* Find the highest visible face around. If equal
1172 * visibilities, we still want the one nearer to the 1076 * visibilities, we still want the one nearer to the
1173 * top 1077 * top
1174 */ 1078 */
1175 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1079 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1176 {
1177 middle = tmp->face;
1178 middle_obj = tmp; 1080 middle = tmp;
1179 }
1180 } 1081 }
1181 1082
1182 if (tmp == tmp->above) 1083 if (tmp == tmp->above)
1183 { 1084 {
1184 LOG (llevError, "Error in structure of map\n"); 1085 LOG (llevError, "Error in structure of map\n");
… …
1197 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1098 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1198 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1099 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1199 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1100 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1200 } 1101 }
1201 1102
1202 this->light = light; 1103 this->light = min (light, MAX_LIGHT_RADIUS);
1203 this->flags_ = flags; 1104 this->flags_ = flags;
1204 this->move_block = move_block & ~move_allow; 1105 this->move_block = move_block & ~move_allow;
1205 this->move_on = move_on; 1106 this->move_on = move_on;
1206 this->move_off = move_off; 1107 this->move_off = move_off;
1207 this->move_slow = move_slow; 1108 this->move_slow = move_slow;
… …
1219 * middle face. This should not happen, as we already have the 1120 * middle face. This should not happen, as we already have the
1220 * else statement above so middle should not get set. OTOH, it 1121 * else statement above so middle should not get set. OTOH, it
1221 * 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.
1222 */ 1123 */
1223 if (top == middle) 1124 if (top == middle)
1224 middle = blank_face; 1125 middle = 0;
1225 1126
1226 /* There are three posibilities at this point: 1127 /* There are three posibilities at this point:
1227 * 1) top face is set, need middle to be set. 1128 * 1) top face is set, need middle to be set.
1228 * 2) middle is set, need to set top. 1129 * 2) middle is set, need to set top.
1229 * 3) neither middle or top is set - need to set both. 1130 * 3) neither middle or top is set - need to set both.
1230 */ 1131 */
1231 1132
1232 for (tmp = last; tmp; tmp = tmp->below) 1133 for (object *tmp = last; tmp; tmp = tmp->below)
1233 { 1134 {
1234 /* 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 */
1235 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1136 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1236 break; 1137 break;
1237 1138
1238 /* If two top faces are already set, quit processing */ 1139 /* If two top faces are already set, quit processing */
1239 if ((top != blank_face) && (middle != blank_face)) 1140 if (top && middle)
1240 break; 1141 break;
1241 1142
1242 /* Only show visible faces */ 1143 /* Only show visible faces */
1243 if (!tmp->invisible) 1144 if (!tmp->invisible)
1244 { 1145 {
1245 /* Fill in top if needed */ 1146 /* Fill in top if needed */
1246 if (top == blank_face) 1147 if (!top)
1247 { 1148 {
1248 top = tmp->face;
1249 top_obj = tmp; 1149 top = tmp;
1250 if (top == middle) 1150 if (top == middle)
1251 middle = blank_face; 1151 middle = 0;
1252 } 1152 }
1253 else 1153 else
1254 { 1154 {
1255 /* top is already set - we should only get here if 1155 /* top is already set - we should only get here if
1256 * middle is not set 1156 * middle is not set
1257 * 1157 *
1258 * Set the middle face and break out, since there is nothing 1158 * Set the middle face and break out, since there is nothing
1259 * more to fill in. We don't check visiblity here, since 1159 * more to fill in. We don't check visiblity here, since
1260 * 1160 *
1261 */ 1161 */
1262 if (tmp->face != top) 1162 if (tmp != top)
1263 { 1163 {
1264 middle = tmp->face;
1265 middle_obj = tmp; 1164 middle = tmp;
1266 break; 1165 break;
1267 } 1166 }
1268 } 1167 }
1269 } 1168 }
1270 } 1169 }
1271 1170
1272 if (middle == floor) 1171 if (middle == floor)
1273 middle = blank_face; 1172 middle = 0;
1274 1173
1275 if (top == middle) 1174 if (top == middle)
1276 middle = blank_face; 1175 middle = 0;
1277 1176
1278 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1177#if 0
1279 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1178 faces_obj [0] = top;
1280 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1179 faces_obj [1] = middle;
1180 faces_obj [2] = floor;
1181#endif
1281} 1182}
1282 1183
1283/* this updates the orig_map->tile_map[tile_num] value after finding 1184uint64
1284 * the map. It also takes care of linking back the freshly found 1185mapspace::volume () const
1285 * maps tile_map values if it tiles back to this one. It returns
1286 * the value of orig_map->tile_map[tile_num].
1287 */
1288static inline maptile *
1289find_and_link (maptile *orig_map, int tile_num)
1290{ 1186{
1291 maptile *mp = orig_map->tile_map [tile_num]; 1187 uint64 vol = 0;
1292 1188
1293 if (!mp) 1189 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1294 { 1190 vol += op->volume ();
1295 mp = orig_map->find_sync (orig_map->tile_path [tile_num], orig_map);
1296 1191
1297 if (!mp) 1192 return vol;
1298 { 1193}
1299 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1194
1300 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1195maptile *
1301 &orig_map->tile_path[tile_num], &orig_map->path); 1196maptile::tile_available (int dir, bool load)
1302 mp = new maptile (1, 1); 1197{
1303 mp->alloc (); 1198 if (tile_path[dir])
1304 mp->in_memory = MAP_IN_MEMORY;
1305 }
1306 } 1199 {
1200 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1201 return tile_map[dir];
1307 1202
1308 int dest_tile = (tile_num + 2) % 4; 1203 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1204 return tile_map[dir];
1205 }
1309 1206
1310 orig_map->tile_map [tile_num] = mp;
1311
1312 // optimisation: back-link map to origin map if euclidean
1313 //TODO: non-euclidean maps MUST GO
1314 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1315 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1316
1317 return mp; 1207 return 0;
1318}
1319
1320static inline void
1321load_and_link (maptile *orig_map, int tile_num)
1322{
1323 find_and_link (orig_map, tile_num)->load_sync ();
1324} 1208}
1325 1209
1326/* this returns TRUE if the coordinates (x,y) are out of 1210/* this returns TRUE if the coordinates (x,y) are out of
1327 * map m. This function also takes into account any 1211 * map m. This function also takes into account any
1328 * tiling considerations, loading adjacant maps as needed. 1212 * tiling considerations, loading adjacant maps as needed.
… …
1341 if (!m) 1225 if (!m)
1342 return 0; 1226 return 0;
1343 1227
1344 if (x < 0) 1228 if (x < 0)
1345 { 1229 {
1346 if (!m->tile_path[3]) 1230 if (!m->tile_available (3))
1347 return 1; 1231 return 1;
1348 1232
1349 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1350 find_and_link (m, 3);
1351
1352 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);
1353 } 1234 }
1354 1235
1355 if (x >= m->width) 1236 if (x >= m->width)
1356 { 1237 {
1357 if (!m->tile_path[1]) 1238 if (!m->tile_available (1))
1358 return 1; 1239 return 1;
1359 1240
1360 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1361 find_and_link (m, 1);
1362
1363 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);
1364 } 1242 }
1365 1243
1366 if (y < 0) 1244 if (y < 0)
1367 { 1245 {
1368 if (!m->tile_path[0]) 1246 if (!m->tile_available (0))
1369 return 1; 1247 return 1;
1370 1248
1371 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1372 find_and_link (m, 0);
1373
1374 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);
1375 } 1250 }
1376 1251
1377 if (y >= m->height) 1252 if (y >= m->height)
1378 { 1253 {
1379 if (!m->tile_path[2]) 1254 if (!m->tile_available (2))
1380 return 1; 1255 return 1;
1381
1382 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1383 find_and_link (m, 2);
1384 1256
1385 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);
1386 } 1258 }
1387 1259
1388 /* Simple case - coordinates are within this local 1260 /* Simple case - coordinates are within this local
… …
1402maptile * 1274maptile *
1403maptile::xy_find (sint16 &x, sint16 &y) 1275maptile::xy_find (sint16 &x, sint16 &y)
1404{ 1276{
1405 if (x < 0) 1277 if (x < 0)
1406 { 1278 {
1407 if (!tile_path[3]) 1279 if (!tile_available (3))
1408 return 0; 1280 return 0;
1409 1281
1410 find_and_link (this, 3);
1411 x += tile_map[3]->width; 1282 x += tile_map[3]->width;
1412 return tile_map[3]->xy_find (x, y); 1283 return tile_map[3]->xy_find (x, y);
1413 } 1284 }
1414 1285
1415 if (x >= width) 1286 if (x >= width)
1416 { 1287 {
1417 if (!tile_path[1]) 1288 if (!tile_available (1))
1418 return 0; 1289 return 0;
1419 1290
1420 find_and_link (this, 1);
1421 x -= width; 1291 x -= width;
1422 return tile_map[1]->xy_find (x, y); 1292 return tile_map[1]->xy_find (x, y);
1423 } 1293 }
1424 1294
1425 if (y < 0) 1295 if (y < 0)
1426 { 1296 {
1427 if (!tile_path[0]) 1297 if (!tile_available (0))
1428 return 0; 1298 return 0;
1429 1299
1430 find_and_link (this, 0);
1431 y += tile_map[0]->height; 1300 y += tile_map[0]->height;
1432 return tile_map[0]->xy_find (x, y); 1301 return tile_map[0]->xy_find (x, y);
1433 } 1302 }
1434 1303
1435 if (y >= height) 1304 if (y >= height)
1436 { 1305 {
1437 if (!tile_path[2]) 1306 if (!tile_available (2))
1438 return 0; 1307 return 0;
1439 1308
1440 find_and_link (this, 2);
1441 y -= height; 1309 y -= height;
1442 return tile_map[2]->xy_find (x, y); 1310 return tile_map[2]->xy_find (x, y);
1443 } 1311 }
1444 1312
1445 /* Simple case - coordinates are within this local 1313 /* Simple case - coordinates are within this local
… …
1450 1318
1451/** 1319/**
1452 * 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
1453 * map1 to map2 in dx/dy. 1321 * map1 to map2 in dx/dy.
1454 */ 1322 */
1455static int 1323int
1456adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1324adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1457{ 1325{
1458 if (!map1 || !map2) 1326 if (!map1 || !map2)
1459 return 0; 1327 return 0;
1460 1328
1461 //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
1462 //fix: compare paths instead (this is likely faster, too!) 1330 //fix: compare paths instead (this is likely faster, too!)
1463 if (map1 == map2) 1331 if (map1 == map2)
1464 { 1332 {
1465 *dx = 0; 1333 *dx = 0;
1466 *dy = 0; 1334 *dy = 0;
… …
1551/* From map.c 1419/* From map.c
1552 * This is used by get_player to determine where the other 1420 * This is used by get_player to determine where the other
1553 * creature is. get_rangevector takes into account map tiling, 1421 * creature is. get_rangevector takes into account map tiling,
1554 * 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
1555 * righte value. distance_x/y are distance away, which 1423 * righte value. distance_x/y are distance away, which
1556 * can be negativbe. direction is the crossfire direction scheme 1424 * can be negative. direction is the crossfire direction scheme
1557 * that the creature should head. part is the part of the 1425 * that the creature should head. part is the part of the
1558 * monster that is closest. 1426 * monster that is closest.
1559 * 1427 *
1560 * get_rangevector looks at op1 and op2, and fills in the 1428 * get_rangevector looks at op1 and op2, and fills in the
1561 * structure for op1 to get to op2. 1429 * structure for op1 to get to op2.
… …
1572get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1440get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1573{ 1441{
1574 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))
1575 { 1443 {
1576 /* be conservative and fill in _some_ data */ 1444 /* be conservative and fill in _some_ data */
1577 retval->distance = 100000; 1445 retval->distance = 10000;
1578 retval->distance_x = 32767; 1446 retval->distance_x = 10000;
1579 retval->distance_y = 32767; 1447 retval->distance_y = 10000;
1580 retval->direction = 0; 1448 retval->direction = 0;
1581 retval->part = 0; 1449 retval->part = 0;
1582 } 1450 }
1583 else 1451 else
1584 { 1452 {
… …
1589 1457
1590 best = op1; 1458 best = op1;
1591 /* If this is multipart, find the closest part now */ 1459 /* If this is multipart, find the closest part now */
1592 if (!(flags & 0x1) && op1->more) 1460 if (!(flags & 0x1) && op1->more)
1593 { 1461 {
1594 object *tmp;
1595 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;
1596 1463
1597 /* 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
1598 * distance instead of doing all that work above again 1465 * distance instead of doing all that work above again
1599 * since the distance fields we set above are positive in the 1466 * since the distance fields we set above are positive in the
1600 * same axis as is used for multipart objects, the simply arithmetic 1467 * same axis as is used for multipart objects, the simply arithmetic
1601 * below works. 1468 * below works.
1602 */ 1469 */
1603 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1470 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1604 { 1471 {
1605 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) +
1606 (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);
1607 if (tmpi < best_distance) 1474 if (tmpi < best_distance)
1608 { 1475 {
1609 best_distance = tmpi; 1476 best_distance = tmpi;
1610 best = tmp; 1477 best = tmp;
1611 } 1478 }
1612 } 1479 }
1480
1613 if (best != op1) 1481 if (best != op1)
1614 { 1482 {
1615 retval->distance_x += op1->x - best->x; 1483 retval->distance_x += op1->x - best->x;
1616 retval->distance_y += op1->y - best->y; 1484 retval->distance_y += op1->y - best->y;
1617 } 1485 }
1618 } 1486 }
1487
1619 retval->part = best; 1488 retval->part = best;
1620 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));
1621 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1490 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1622 } 1491 }
1623} 1492}
1624 1493
1625/* 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
… …
1630 * 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
1631 * 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
1632 * 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
1633 * field of the rv_vector is set to NULL. 1502 * field of the rv_vector is set to NULL.
1634 */ 1503 */
1635
1636void 1504void
1637get_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)
1638{ 1506{
1639 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))
1640 { 1508 {
1641 /* be conservative and fill in _some_ data */ 1509 /* be conservative and fill in _some_ data */
1642 retval->distance = 100000; 1510 retval->distance = 100000;
… …
1648 else 1516 else
1649 { 1517 {
1650 retval->distance_x += op2->x - x; 1518 retval->distance_x += op2->x - x;
1651 retval->distance_y += op2->y - y; 1519 retval->distance_y += op2->y - y;
1652 1520
1653 retval->part = NULL; 1521 retval->part = 0;
1654 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1522 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1655 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1523 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1656 } 1524 }
1657} 1525}
1658 1526
1659/* 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
… …
1673} 1541}
1674 1542
1675object * 1543object *
1676maptile::insert (object *op, int x, int y, object *originator, int flags) 1544maptile::insert (object *op, int x, int y, object *originator, int flags)
1677{ 1545{
1678 if (!op->flag [FLAG_REMOVED])
1679 op->remove ();
1680
1681 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1546 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1682} 1547}
1683 1548
1549region *
1550maptile::region (int x, int y) const
1551{
1552 if (regions
1553 && regionmap
1554 && !OUT_OF_REAL_MAP (this, x, y))
1555 if (struct region *reg = regionmap [regions [y * width + x]])
1556 return reg;
1557
1558 if (default_region)
1559 return default_region;
1560
1561 return ::region::default_region ();
1562}
1563
1564/* picks a random object from a style map.
1565 */
1566object *
1567maptile::pick_random_object (rand_gen &gen) const
1568{
1569 /* while returning a null object will result in a crash, that
1570 * is actually preferable to an infinite loop. That is because
1571 * most servers will automatically restart in case of crash.
1572 * Change the logic on getting the random space - shouldn't make
1573 * any difference, but this seems clearer to me.
1574 */
1575 for (int i = 1000; --i;)
1576 {
1577 object *pick = at (gen (width), gen (height)).bot;
1578
1579 // do not prefer big monsters just because they are big.
1580 if (pick && pick->is_head ())
1581 return pick->head_ ();
1582 }
1583
1584 // instead of crashing in the unlikely(?) case, try to return *something*
1585 return archetype::find ("bug");
1586}
1587
1588void
1589maptile::play_sound (faceidx sound, int x, int y) const
1590{
1591 if (!sound)
1592 return;
1593
1594 for_all_players_on_map (pl, this)
1595 if (client *ns = pl->ns)
1596 {
1597 int dx = x - pl->ob->x;
1598 int dy = y - pl->ob->y;
1599
1600 int distance = idistance (dx, dy);
1601
1602 if (distance <= MAX_SOUND_DISTANCE)
1603 ns->play_sound (sound, dx, dy);
1604 }
1605}
1606
1607void
1608maptile::say_msg (const char *msg, int x, int y) const
1609{
1610 for_all_players (pl)
1611 if (client *ns = pl->ns)
1612 {
1613 int dx = x - pl->ob->x;
1614 int dy = y - pl->ob->y;
1615
1616 int distance = idistance (dx, dy);
1617
1618 if (distance <= MAX_SOUND_DISTANCE)
1619 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1620 }
1621}
1622
1623static void
1624split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1625{
1626 // clip to map to the left
1627 if (x0 < 0)
1628 {
1629 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1630 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1631
1632 if (x1 < 0) // entirely to the left
1633 return;
1634
1635 x0 = 0;
1636 }
1637
1638 // clip to map to the right
1639 if (x1 > m->width)
1640 {
1641 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1642 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1643
1644 if (x0 > m->width) // entirely to the right
1645 return;
1646
1647 x1 = m->width;
1648 }
1649
1650 // clip to map above
1651 if (y0 < 0)
1652 {
1653 if (maptile *tile = m->tile_available (TILE_UP, 1))
1654 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1655
1656 if (y1 < 0) // entirely above
1657 return;
1658
1659 y0 = 0;
1660 }
1661
1662 // clip to map below
1663 if (y1 > m->height)
1664 {
1665 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1666 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1667
1668 if (y0 > m->height) // entirely below
1669 return;
1670
1671 y1 = m->height;
1672 }
1673
1674 // if we get here, the rect is within the current map
1675 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1676
1677 r->m = m;
1678 r->x0 = x0;
1679 r->y0 = y0;
1680 r->x1 = x1;
1681 r->y1 = y1;
1682 r->dx = dx;
1683 r->dy = dy;
1684}
1685
1686maprect *
1687maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1688{
1689 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1690 buf.clear ();
1691
1692 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1693
1694 // add end marker
1695 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1696 r->m = 0;
1697
1698 return (maprect *)buf.linearise ();
1699}
1700

Diff Legend

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