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.66 by pippijn, Wed Jan 3 00:21:35 2007 UTC vs.
Revision 1.158 by root, Tue Feb 17 03:53:31 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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20 21 * The authors can be reached via e-mail to <support@deliantra.net>
21 The authors can be reached via e-mail at <crossfire@schmorp.de>
22*/ 22 */
23 23
24#include <global.h>
25#include <funcpoint.h>
26
27#include <loader.h>
28#include <unistd.h> 24#include <unistd.h>
29 25
26#include "global.h"
27#include "loader.h"
30#include "path.h" 28#include "path.h"
31 29
32/* 30sint8 maptile::outdoor_darkness;
33 * This makes a path absolute outside the world of Crossfire.
34 * In other words, it prepends LIBDIR/MAPDIR/ to the given path
35 * and returns the pointer to a static array containing the result.
36 * it really should be called create_mapname
37 */
38const char *
39create_pathname (const char *name)
40{
41 static char buf[8192];
42 snprintf (buf, sizeof (buf), "%s/%s/%s", settings.datadir, settings.mapdir, name);
43 return buf;
44}
45
46/*
47 * This function checks if a file with the given path exists.
48 * -1 is returned if it fails, otherwise the mode of the file
49 * is returned.
50 * It tries out all the compression suffixes listed in the uncomp[] array.
51 *
52 * If prepend_dir is set, then we call create_pathname (which prepends
53 * libdir & mapdir). Otherwise, we assume the name given is fully
54 * complete.
55 * Only the editor actually cares about the writablity of this -
56 * the rest of the code only cares that the file is readable.
57 * when the editor goes away, the call to stat should probably be
58 * replaced by an access instead (similar to the windows one, but
59 * that seems to be missing the prepend_dir processing
60 */
61int
62check_path (const char *name, int prepend_dir)
63{
64 char buf[MAX_BUF];
65
66 char *endbuf;
67 struct stat statbuf;
68 int mode = 0;
69
70 if (prepend_dir)
71 strcpy (buf, create_pathname (name));
72 else
73 strcpy (buf, name);
74
75 /* old method (strchr(buf, '\0')) seemd very odd to me -
76 * this method should be equivalant and is clearer.
77 * Can not use strcat because we need to cycle through
78 * all the names.
79 */
80 endbuf = buf + strlen (buf);
81
82 if (stat (buf, &statbuf))
83 return -1;
84 if (!S_ISREG (statbuf.st_mode))
85 return (-1);
86
87 if (((statbuf.st_mode & S_IRGRP) && getegid () == statbuf.st_gid) ||
88 ((statbuf.st_mode & S_IRUSR) && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IROTH))
89 mode |= 4;
90
91 if ((statbuf.st_mode & S_IWGRP && getegid () == statbuf.st_gid) ||
92 (statbuf.st_mode & S_IWUSR && geteuid () == statbuf.st_uid) || (statbuf.st_mode & S_IWOTH))
93 mode |= 2;
94
95 return (mode);
96}
97 31
98/* This rolls up wall, blocks_magic, blocks_view, etc, all into 32/* This rolls up wall, blocks_magic, blocks_view, etc, all into
99 * one function that just returns a P_.. value (see map.h) 33 * one function that just returns a P_.. value (see map.h)
100 * it will also do map translation for tiled maps, returning 34 * it will also do map translation for tiled maps, returning
101 * new values into newmap, nx, and ny. Any and all of those 35 * new values into newmap, nx, and ny. Any and all of those
… …
172 * let the player through (inventory checkers for example) 106 * let the player through (inventory checkers for example)
173 */ 107 */
174 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked)) 108 if (!(mflags & P_IS_ALIVE) && !OB_TYPE_MOVE_BLOCK (ob, blocked))
175 return 0; 109 return 0;
176 110
177 if (ob->head != NULL)
178 ob = ob->head; 111 ob = ob->head_ ();
179 112
180 /* We basically go through the stack of objects, and if there is 113 /* We basically go through the stack of objects, and if there is
181 * some other object that has NO_PASS or FLAG_ALIVE set, return 114 * some other object that has NO_PASS or FLAG_ALIVE set, return
182 * true. If we get through the entire stack, that must mean 115 * true. If we get through the entire stack, that must mean
183 * ob is blocking it, so return 0. 116 * ob is blocking it, so return 0.
… …
213 else 146 else
214 { 147 {
215 /* Broke apart a big nasty if into several here to make 148 /* Broke apart a big nasty if into several here to make
216 * this more readable. first check - if the space blocks 149 * this more readable. first check - if the space blocks
217 * movement, can't move here. 150 * movement, can't move here.
218 * second - if a monster, can't move there, unles it is a 151 * second - if a monster, can't move there, unless it is a
219 * hidden dm 152 * hidden dm
220 */ 153 */
221 if (OB_MOVE_BLOCK (ob, tmp)) 154 if (OB_MOVE_BLOCK (ob, tmp))
222 return 1; 155 return 1;
223 if (QUERY_FLAG (tmp, FLAG_ALIVE) && tmp->head != ob && tmp != ob && 156
224 tmp->type != DOOR && !(QUERY_FLAG (tmp, FLAG_WIZ) && tmp->contr->hidden)) 157 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob
159 && tmp != ob
160 && tmp->type != DOOR
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden))
225 return 1; 162 return 1;
226 } 163 }
227 164
228 } 165 }
229 return 0; 166 return 0;
230} 167}
231 168
232
233/* 169/*
234 * Returns true if the given object can't fit in the given spot. 170 * Returns qthe blocking object if the given object can't fit in the given
235 * This is meant for multi space objects - for single space objecs, 171 * spot. This is meant for multi space objects - for single space objecs,
236 * just calling get_map_blocked and checking that against movement type 172 * just calling get_map_blocked and checking that against movement type
237 * of object. This function goes through all the parts of the 173 * of object. This function goes through all the parts of the multipart
238 * multipart object and makes sure they can be inserted. 174 * object and makes sure they can be inserted.
239 * 175 *
240 * While this doesn't call out of map, the get_map_flags does. 176 * While this doesn't call out of map, the get_map_flags does.
241 * 177 *
242 * This function has been used to deprecate arch_out_of_map - 178 * This function has been used to deprecate arch_out_of_map -
243 * this function also does that check, and since in most cases, 179 * this function also does that check, and since in most cases,
… …
254 * 190 *
255 * Note this used to be arch_blocked, but with new movement 191 * Note this used to be arch_blocked, but with new movement
256 * code, we need to have actual object to check its move_type 192 * code, we need to have actual object to check its move_type
257 * against the move_block values. 193 * against the move_block values.
258 */ 194 */
259int 195bool
260ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y) 196object::blocked (maptile *m, int x, int y) const
261{ 197{
262 archetype *tmp; 198 for (archetype *tmp = arch; tmp; tmp = (archetype *)tmp->more)
263 int flag;
264 maptile *m1;
265 sint16 sx, sy;
266
267 if (!ob)
268 {
269 flag = get_map_flags (m, &m1, x, y, &sx, &sy);
270 if (flag & P_OUT_OF_MAP)
271 return P_OUT_OF_MAP;
272
273 /* don't have object, so don't know what types would block */
274 return m1->at (sx, sy).move_block;
275 } 199 {
200 mapxy pos (m, x + tmp->x, y + tmp->y);
276 201
277 for (tmp = ob->arch; tmp; tmp = tmp->more) 202 if (!pos.normalise ())
278 { 203 return 1;
279 flag = get_map_flags (m, &m1, x + tmp->clone.x, y + tmp->clone.y, &sx, &sy);
280 204
281 if (flag & P_OUT_OF_MAP) 205 mapspace &ms = *pos;
282 return P_OUT_OF_MAP; 206
283 if (flag & P_IS_ALIVE) 207 if (ms.flags () & P_IS_ALIVE)
284 return P_IS_ALIVE; 208 return 1;
285 209
286 mapspace &ms = m1->at (sx, sy); 210 /* However, often ob doesn't have any move type
287 211 * (signifying non-moving objects)
288 /* find_first_free_spot() calls this function. However, often
289 * ob doesn't have any move type (when used to place exits)
290 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. 212 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
291 */ 213 */
292
293 if (ob->move_type == 0 && ms.move_block != MOVE_ALL) 214 if (!move_type && ms.move_block != MOVE_ALL)
294 continue; 215 continue;
295 216
296 /* Note it is intentional that we check ob - the movement type of the 217 /* Note it is intentional that we check ob - the movement type of the
297 * head of the object should correspond for the entire object. 218 * head of the object should correspond for the entire object.
298 */ 219 */
299 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 220 if (ms.blocks (move_type))
300 return P_NO_PASS; 221 return 1;
301 } 222 }
302 223
303 return 0; 224 return 0;
304} 225}
305 226
… …
323 244
324 insert_ob_in_ob (tmp, container); 245 insert_ob_in_ob (tmp, container);
325 tmp = next; 246 tmp = next;
326 } 247 }
327 248
328 /* sum_weight will go through and calculate what all the containers are 249 // go through and calculate what all the containers are carrying.
329 * carrying. 250 //TODO: remove
330 */ 251 container->update_weight ();
331 sum_weight (container);
332} 252}
333 253
334void 254void
335maptile::set_object_flag (int flag, int value) 255maptile::set_object_flag (int flag, int value)
336{ 256{
… …
340 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 260 for (mapspace *ms = spaces + size (); ms-- > spaces; )
341 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 261 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
342 tmp->flag [flag] = value; 262 tmp->flag [flag] = value;
343} 263}
344 264
265void
266maptile::post_load_original ()
267{
268 if (!spaces)
269 return;
270
271 set_object_flag (FLAG_OBJ_ORIGINAL);
272
273 for (mapspace *ms = spaces + size (); ms-- > spaces; )
274 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275 INVOKE_OBJECT (RESET, tmp);
276}
277
345/* link_multipart_objects go through all the objects on the map looking 278/* link_multipart_objects go through all the objects on the map looking
346 * for objects whose arch says they are multipart yet according to the 279 * for objects whose arch says they are multipart yet according to the
347 * info we have, they only have the head (as would be expected when 280 * info we have, they only have the head (as would be expected when
348 * they are saved). We do have to look for the old maps that did save 281 * they are saved).
349 * the more sections and not re-add sections for them.
350 */ 282 */
351void 283void
352maptile::link_multipart_objects () 284maptile::link_multipart_objects ()
353{ 285{
354 if (!spaces) 286 if (!spaces)
355 return; 287 return;
356 288
357 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 289 for (mapspace *ms = spaces + size (); ms-- > spaces; )
358 for (object *tmp = ms->bot; tmp; ) 290 {
291 object *op = ms->bot;
292 while (op)
359 { 293 {
360 object *above = tmp->above;
361
362 /* already multipart - don't do anything more */ 294 /* already multipart - don't do anything more */
363 if (!tmp->head && !tmp->more) 295 if (op->head_ () == op && !op->more && op->arch->more)
364 {
365 /* If there is nothing more to this object, this for loop
366 * won't do anything.
367 */
368 archetype *at;
369 object *last, *op;
370 for (at = tmp->arch->more, last = tmp;
371 at;
372 at = at->more, last = op)
373 { 296 {
374 op = arch_to_object (at); 297 op->remove ();
298 op->expand_tail ();
375 299
376 /* update x,y coordinates */ 300 // FIXME: INS_ON_TOP is just a workaround for the pentagram vs.
377 op->x += tmp->x; 301 // multi-tile monster bug, where INS_ABOVE_FLOOR_ONLY put the monsters
378 op->y += tmp->y; 302 // below the pentagrams... hopefully INS_ON_TOP doesn't break anything
379 op->head = tmp;
380 op->map = this;
381 last->more = op;
382 op->name = tmp->name;
383 op->title = tmp->title;
384
385 /* we could link all the parts onto tmp, and then just
386 * call insert_ob_in_map once, but the effect is the same,
387 * as insert_ob_in_map will call itself with each part, and
388 * the coding is simpler to just to it here with each part.
389 */
390 insert_ob_in_map (op, op->map, tmp, INS_NO_MERGE | INS_ABOVE_FLOOR_ONLY | INS_NO_WALK_ON); 303 insert (op, op->x, op->y, 0, INS_NO_MERGE | INS_ON_TOP | INS_NO_WALK_ON);
304
305 op = ms->bot; // we are mutating the mapspace too much with INS_ON_TOP
306 // so we have to reset the iteration through the mapspace
391 } 307 }
308 else
309 op = op->above;
392 } 310 }
393
394 tmp = above;
395 } 311 }
396} 312}
397 313
398/* 314/*
399 * Loads (ands parses) the objects into a given map from the specified 315 * Loads (ands parses) the objects into a given map from the specified
400 * file pointer. 316 * file pointer.
401 * mapflags is the same as we get with load_original_map
402 */ 317 */
403bool 318bool
404maptile::load_objects (object_thawer &thawer) 319maptile::_load_objects (object_thawer &f)
405{ 320{
406 int unique; 321 for (;;)
407 object *op, *prev = NULL, *last_more = NULL, *otmp;
408
409 op = object::create ();
410 op->map = this; /* To handle buttons correctly */
411
412 while (int i = load_object (thawer, op, 0))
413 { 322 {
414 /* if the archetype for the object is null, means that we 323 coroapi::cede_to_tick (); // cede once in a while
415 * got an invalid object. Don't do anything with it - the game 324
416 * or editor will not be able to do anything with it either. 325 switch (f.kw)
417 */
418 if (op->arch == NULL)
419 { 326 {
420 LOG (llevDebug, "Discarding object without arch: %s\n", op->name ? (const char *) op->name : "(null)"); 327 case KW_arch:
328 if (object *op = object::read (f, this))
329 {
330 // TODO: why?
331 if (op->inv)
332 op->update_weight ();
333
334 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335 {
336 // we insert manually because
337 // a) its way faster
338 // b) we remove manually, too, and there are good reasons for that
339 // c) it's correct
340 mapspace &ms = at (op->x, op->y);
341
342 op->flag [FLAG_REMOVED] = false;
343
344 op->above = 0;
345 op->below = ms.top;
346
347 *(ms.top ? &ms.top->above : &ms.bot) = op;
348
349 ms.top = op;
350 ms.flags_ = 0;
351 }
352 else
353 {
354 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
355 op->destroy ();
356 }
357 }
358
421 continue; 359 continue;
422 }
423 360
424 switch (i)
425 {
426 case LL_NORMAL:
427 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD);
428
429 if (op->inv)
430 sum_weight (op);
431
432 prev = op, last_more = op;
433 break;
434
435 case LL_MORE: 361 case KW_EOF:
436 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ABOVE_FLOOR_ONLY); 362 return true;
437 op->head = prev, last_more->more = op, last_more = op; 363
364 default:
365 if (!f.parse_error ("map file"))
366 return false;
438 break; 367 break;
439 } 368 }
440 369
441 op = object::create (); 370 f.next ();
442 op->map = this;
443 }
444
445 op->destroy ();
446
447#if 0
448 for (i = 0; i < width; i++)
449 for (j = 0; j < height; j++)
450 {
451 unique = 0;
452 /* check for unique items, or unique squares */
453 for (otmp = GET_MAP_OB (m, i, j); otmp; otmp = otmp->above)
454 {
455 if (QUERY_FLAG (otmp, FLAG_UNIQUE) || QUERY_FLAG (otmp, FLAG_OBJ_SAVE_ON_OVL))
456 unique = 1;
457
458 if (!(mapflags & (MAP_OVERLAY | MAP_PLAYER_UNIQUE) || unique))
459 SET_FLAG (otmp, FLAG_OBJ_ORIGINAL);
460 }
461 } 371 }
462#endif
463 372
464 return true; 373 return true;
465} 374}
466 375
467void 376void
468maptile::activate () 377maptile::activate ()
469{ 378{
470 if (!spaces) 379 if (spaces)
471 return;
472
473 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 380 for (mapspace *ms = spaces + size (); ms-- > spaces; )
474 for (object *op = ms->bot; op; op = op->above) 381 for (object *op = ms->bot; op; op = op->above)
475 op->activate_recursive (); 382 op->activate_recursive ();
476} 383}
477 384
478void 385void
479maptile::deactivate () 386maptile::deactivate ()
480{ 387{
481 if (!spaces) 388 if (spaces)
482 return;
483
484 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 389 for (mapspace *ms = spaces + size (); ms-- > spaces; )
485 for (object *op = ms->bot; op; op = op->above) 390 for (object *op = ms->bot; op; op = op->above)
486 op->deactivate_recursive (); 391 op->deactivate_recursive ();
487} 392}
488 393
489bool 394bool
490maptile::save_objects (object_freezer &freezer, int flags) 395maptile::_save_objects (object_freezer &f, int flags)
491{ 396{
492 static int cede_count = 0; 397 coroapi::cede_to_tick ();
493 398
494 if (flags & IO_HEADER) 399 if (flags & IO_HEADER)
495 save_header (freezer); 400 _save_header (f);
496 401
497 if (!spaces) 402 if (!spaces)
498 return false; 403 return false;
499 404
500 for (int i = 0; i < size (); ++i) 405 for (int i = 0; i < size (); ++i)
501 { 406 {
502 if (cede_count >= 500)
503 {
504 cede_count = 0;
505 coroapi::cede ();
506 }
507
508 int unique = 0; 407 bool unique = 0;
408
509 for (object *op = spaces [i].bot; op; op = op->above) 409 for (object *op = spaces [i].bot; op; op = op->above)
510 { 410 {
511 // count per-object, but cede only when modification-safe
512 cede_count++;
513
514 if (op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR]) 411 unique |= op->flag [FLAG_UNIQUE] && op->flag [FLAG_IS_FLOOR];
515 unique = 1;
516 412
517 if (!op->can_map_save ()) 413 if (expect_false (!op->can_map_save ()))
518 continue; 414 continue;
519 415
520 if (unique || op->flag [FLAG_UNIQUE]) 416 if (expect_false (unique || op->flag [FLAG_UNIQUE]))
521 { 417 {
522 if (flags & IO_UNIQUES) 418 if (flags & IO_UNIQUES)
523 save_object (freezer, op, 1); 419 op->write (f);
524 } 420 }
525 else if (flags & IO_OBJECTS) 421 else if (expect_true (flags & IO_OBJECTS))
526 save_object (freezer, op, 1); 422 op->write (f);
527 } 423 }
528 } 424 }
529 425
426 coroapi::cede_to_tick ();
427
530 return true; 428 return true;
531} 429}
532 430
533bool 431bool
534maptile::load_objects (const char *path, bool skip_header) 432maptile::_save_objects (const char *path, int flags)
535{ 433{
536 object_thawer thawer (path); 434 object_freezer freezer;
537 435
538 if (!thawer) 436 if (!_save_objects (freezer, flags))
539 return false; 437 return false;
540 438
541 if (skip_header)
542 for (;;)
543 {
544 keyword kw = thawer.get_kv ();
545
546 if (kw == KW_end)
547 break;
548
549 thawer.skip_kv (kw);
550 }
551
552 return load_objects (thawer);
553}
554
555bool
556maptile::save_objects (const char *path, int flags)
557{
558 object_freezer freezer;
559
560 if (!save_objects (freezer, flags))
561 return false;
562
563 return freezer.save (path); 439 return freezer.save (path);
564} 440}
565 441
566maptile::maptile () 442maptile::maptile ()
567{ 443{
568 in_memory = MAP_SWAPPED; 444 in_memory = MAP_SWAPPED;
569 445
570 /* The maps used to pick up default x and y values from the 446 /* The maps used to pick up default x and y values from the
571 * map archetype. Mimic that behaviour. 447 * map archetype. Mimic that behaviour.
572 */ 448 */
573 width = 16; 449 width = 16;
574 height = 16; 450 height = 16;
575 reset_timeout = 0;
576 timeout = 300; 451 timeout = 300;
577 enter_x = 0; 452 max_nrof = 1000; // 1000 items of anything
578 enter_y = 0; 453 max_volume = 2000000; // 2m³
579} 454}
580 455
581maptile::maptile (int w, int h) 456maptile::maptile (int w, int h)
582{ 457{
583 in_memory = MAP_SWAPPED; 458 in_memory = MAP_SWAPPED;
… …
729 * This could be done in lex (like the object loader), but I think 604 * This could be done in lex (like the object loader), but I think
730 * currently, there are few enough fields this is not a big deal. 605 * currently, there are few enough fields this is not a big deal.
731 * MSW 2001-07-01 606 * MSW 2001-07-01
732 */ 607 */
733bool 608bool
734maptile::load_header (object_thawer &thawer) 609maptile::_load_header (object_thawer &thawer)
735{ 610{
736 char buf[HUGE_BUF], msgbuf[HUGE_BUF], maplorebuf[HUGE_BUF], *key = NULL, *value, *end;
737 int msgpos = 0;
738 int maplorepos = 0;
739
740 for (;;) 611 for (;;)
741 { 612 {
742 keyword kw = thawer.get_kv ();
743
744 switch (kw) 613 switch (thawer.kw)
745 { 614 {
746 case KW_EOF:
747 LOG (llevError, "%s: end of file while reading map header, aborting header load.\n", &path);
748 return false;
749
750 case KW_end:
751 return true;
752
753 case KW_msg: 615 case KW_msg:
754 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
755 break; 617 break;
756 618
757 case KW_lore: // CF+ extension 619 case KW_lore: // CF+ extension
… …
788 case KW_winddir: thawer.get (winddir); break; 650 case KW_winddir: thawer.get (winddir); break;
789 case KW_sky: thawer.get (sky); break; 651 case KW_sky: thawer.get (sky); break;
790 652
791 case KW_per_player: thawer.get (per_player); break; 653 case KW_per_player: thawer.get (per_player); break;
792 case KW_per_party: thawer.get (per_party); break; 654 case KW_per_party: thawer.get (per_party); break;
655 case KW_no_reset: thawer.get (no_reset); break;
656 case KW_no_drop: thawer.get (no_drop); break;
793 657
794 case KW_region: get_region_by_name (thawer.get_str ()); break; 658 case KW_region: default_region = region::find (thawer.get_str ()); break;
795 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 659 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
796 660
797 // old names new names 661 // old names new names
798 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 662 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
799 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 663 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
808 case KW_tile_path_1: thawer.get (tile_path [0]); break; 672 case KW_tile_path_1: thawer.get (tile_path [0]); break;
809 case KW_tile_path_2: thawer.get (tile_path [1]); break; 673 case KW_tile_path_2: thawer.get (tile_path [1]); break;
810 case KW_tile_path_3: thawer.get (tile_path [2]); break; 674 case KW_tile_path_3: thawer.get (tile_path [2]); break;
811 case KW_tile_path_4: thawer.get (tile_path [3]); break; 675 case KW_tile_path_4: thawer.get (tile_path [3]); break;
812 676
677 case KW_ERROR:
678 set_key_text (thawer.kw_str, thawer.value);
679 break;
680
681 case KW_end:
682 thawer.next ();
683 return true;
684
813 default: 685 default:
814 LOG (llevError, "%s: skipping unknown key in map header: %s\n", &path, keyword_str [kw]); 686 if (!thawer.parse_error ("map", 0))
687 return false;
815 break; 688 break;
816 } 689 }
690
691 thawer.next ();
817 } 692 }
818 693
819 abort (); 694 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} 695}
832 696
833/****************************************************************************** 697/******************************************************************************
834 * This is the start of unique map handling code 698 * This is the start of unique map handling code
835 *****************************************************************************/ 699 *****************************************************************************/
… …
846 object *above = op->above; 710 object *above = op->above;
847 711
848 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 712 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
849 unique = 1; 713 unique = 1;
850 714
851 if (op->head == NULL && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 715 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique))
852 {
853 op->destroy_inv (false);
854 op->destroy (); 716 op->destroy ();
855 }
856 717
857 op = above; 718 op = above;
858 } 719 }
859 } 720 }
860} 721}
861 722
862bool 723bool
863maptile::save_header (object_freezer &freezer) 724maptile::_save_header (object_freezer &freezer)
864{ 725{
865#define MAP_OUT(k) freezer.put (KW_ ## k, k) 726#define MAP_OUT(k) freezer.put (KW_ ## k, k)
866#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 727#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v)
867 728
868 MAP_OUT2 (arch, "map"); 729 MAP_OUT2 (arch, "map");
… …
870 if (name) MAP_OUT (name); 731 if (name) MAP_OUT (name);
871 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
872 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
873 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
874 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
736 MAP_OUT (no_reset);
737 MAP_OUT (no_drop);
875 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
876 739
877 if (region) MAP_OUT2 (region, region->name); 740 if (default_region) MAP_OUT2 (region, default_region->name);
878 741
879 if (shopitems) 742 if (shopitems)
880 { 743 {
881 char shop[MAX_BUF]; 744 char shop[MAX_BUF];
882 print_shop_string (this, shop); 745 print_shop_string (this, shop);
… …
917 780
918 return true; 781 return true;
919} 782}
920 783
921bool 784bool
922maptile::save_header (const char *path) 785maptile::_save_header (const char *path)
923{ 786{
924 object_freezer freezer; 787 object_freezer freezer;
925 788
926 if (!save_header (freezer)) 789 if (!_save_header (freezer))
927 return false; 790 return false;
928 791
929 return freezer.save (path); 792 return freezer.save (path);
930} 793}
931 794
… …
933 * Remove and free all objects in the given map. 796 * Remove and free all objects in the given map.
934 */ 797 */
935void 798void
936maptile::clear () 799maptile::clear ()
937{ 800{
938 if (!spaces) 801 if (spaces)
939 return; 802 {
940
941 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 803 for (mapspace *ms = spaces + size (); ms-- > spaces; )
942 while (object *op = ms->bot) 804 while (object *op = ms->bot)
943 { 805 {
806 // manually remove, as to not trigger anything
807 if (ms->bot = op->above)
808 ms->bot->below = 0;
809
810 op->flag [FLAG_REMOVED] = true;
811
812 object *head = op->head_ ();
944 if (op->head) 813 if (op == head)
945 op = op->head;
946
947 op->destroy_inv (false);
948 op->destroy (); 814 op->destroy ();
815 else if (head->map != op->map)
816 {
817 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
818 head->destroy ();
819 }
820 }
821
822 sfree0 (spaces, size ());
949 } 823 }
950
951 sfree (spaces, size ()), spaces = 0;
952 824
953 if (buttons) 825 if (buttons)
954 free_objectlinkpt (buttons), buttons = 0; 826 free_objectlinkpt (buttons), buttons = 0;
827
828 sfree0 (regions, size ());
829 delete [] regionmap; regionmap = 0;
955} 830}
956 831
957void 832void
958maptile::clear_header () 833maptile::clear_header ()
959{ 834{
… …
991 attachable::do_destroy (); 866 attachable::do_destroy ();
992 867
993 clear (); 868 clear ();
994} 869}
995 870
996/* 871/* decay and destroy perishable items in a map */
997 * Updates every button on the map (by calling update_button() for them).
998 */
999void 872void
1000maptile::update_buttons () 873maptile::do_decay_objects ()
1001{ 874{
1002 for (oblinkpt *obp = buttons; obp; obp = obp->next) 875 if (!spaces)
1003 for (objectlink *ol = obp->link; ol; ol = ol->next) 876 return;
877
878 for (mapspace *ms = spaces + size (); ms-- > spaces; )
879 for (object *above, *op = ms->bot; op; op = above)
1004 { 880 {
1005 if (!ol->ob) 881 above = op->above;
882
883 bool destroy = 0;
884
885 // do not decay anything above unique floor tiles (yet :)
886 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE))
887 break;
888
889 if (QUERY_FLAG (op, FLAG_IS_FLOOR)
890 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
891 || QUERY_FLAG (op, FLAG_UNIQUE)
892 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
893 || QUERY_FLAG (op, FLAG_UNPAID)
894 || op->is_alive ())
895 ; // do not decay
896 else if (op->is_weapon ())
1006 { 897 {
1007 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n", 898 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); 899 if (op->stats.dam < 0)
1009 continue; 900 destroy = 1;
1010 } 901 }
1011 902 else if (op->is_armor ())
1012 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
1013 { 903 {
1014 update_button (ol->ob); 904 op->stats.ac--;
1015 break; 905 if (op->stats.ac < 0)
906 destroy = 1;
1016 } 907 }
908 else if (op->type == FOOD)
909 {
910 op->stats.food -= rndm (5, 20);
911 if (op->stats.food < 0)
912 destroy = 1;
913 }
914 else
915 {
916 int mat = op->materials;
917
918 if (mat & M_PAPER
919 || mat & M_LEATHER
920 || mat & M_WOOD
921 || mat & M_ORGANIC
922 || mat & M_CLOTH
923 || mat & M_LIQUID
924 || (mat & M_IRON && rndm (1, 5) == 1)
925 || (mat & M_GLASS && rndm (1, 2) == 1)
926 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
927 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
928 || (mat & M_ICE && temp > 32))
929 destroy = 1;
930 }
931
932 /* adjust overall chance below */
933 if (destroy && rndm (0, 1))
934 op->destroy ();
1017 } 935 }
1018} 936}
1019 937
1020/* 938/*
1021 * This routine is supposed to find out the difficulty of the map. 939 * This routine is supposed to find out the difficulty of the map.
1022 * difficulty does not have a lot to do with character level, 940 * difficulty does not have a lot to do with character level,
1023 * but does have a lot to do with treasure on the map. 941 * but does have a lot to do with treasure on the map.
1024 * 942 *
1025 * Difficulty can now be set by the map creature. If the value stored 943 * 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 944 * in the map is zero, then use this routine. Maps should really
1027 * have a difficulty set than using this function - human calculation 945 * have a difficulty set rather than using this function - human calculation
1028 * is much better than this functions guesswork. 946 * is much better than this function's guesswork.
1029 */ 947 */
1030int 948int
1031maptile::estimate_difficulty () const 949maptile::estimate_difficulty () const
1032{ 950{
1033 long monster_cnt = 0; 951 long monster_cnt = 0;
… …
1045 963
1046 if (QUERY_FLAG (op, FLAG_GENERATOR)) 964 if (QUERY_FLAG (op, FLAG_GENERATOR))
1047 { 965 {
1048 total_exp += op->stats.exp; 966 total_exp += op->stats.exp;
1049 967
1050 if (archetype *at = type_to_archetype (GENERATE_TYPE (op))) 968 if (archetype *at = op->other_arch)
969 {
1051 total_exp += at->clone.stats.exp * 8; 970 total_exp += at->stats.exp * 8;
1052
1053 monster_cnt++; 971 monster_cnt++;
972 }
973
974 for (object *inv = op->inv; inv; inv = inv->below)
975 {
976 total_exp += op->stats.exp * 8;
977 monster_cnt++;
978 }
1054 } 979 }
1055 } 980 }
1056 981
1057 avgexp = (double) total_exp / monster_cnt; 982 avgexp = (double) total_exp / monster_cnt;
1058 983
… …
1071 * postive values make it darker, negative make it brighter 996 * postive values make it darker, negative make it brighter
1072 */ 997 */
1073int 998int
1074maptile::change_map_light (int change) 999maptile::change_map_light (int change)
1075{ 1000{
1076 int new_level = darkness + change;
1077
1078 /* Nothing to do */ 1001 /* Nothing to do */
1079 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 1002 if (!change)
1080 return 0; 1003 return 0;
1081 1004
1082 /* inform all players on the map */ 1005 /* inform all players on the map */
1083 if (change > 0) 1006 if (change > 0)
1084 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1007 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1085 else 1008 else
1086 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1009 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1087 1010
1088 /* Do extra checking. since darkness is a unsigned value, 1011 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 1012
1100 /* All clients need to get re-updated for the change */ 1013 /* All clients need to get re-updated for the change */
1101 update_all_map_los (this); 1014 update_all_map_los (this);
1015
1102 return 1; 1016 return 1;
1103} 1017}
1104 1018
1105/* 1019/*
1106 * This function updates various attributes about a specific space 1020 * This function updates various attributes about a specific space
… …
1109 * through, etc) 1023 * through, etc)
1110 */ 1024 */
1111void 1025void
1112mapspace::update_ () 1026mapspace::update_ ()
1113{ 1027{
1114 object *tmp, *last = 0; 1028 object *last = 0;
1115 uint8 flags = 0, light = 0, anywhere = 0; 1029 uint8 flags = P_UPTODATE, anywhere = 0;
1116 New_Face *top, *floor, *middle; 1030 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; 1031 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1119 1032
1120 middle = blank_face; 1033 //object *middle = 0;
1121 top = blank_face; 1034 //object *top = 0;
1122 floor = blank_face; 1035 //object *floor = 0;
1036 // this seems to generate better code than using locals, above
1037 object *&top = faces_obj[0] = 0;
1038 object *&middle = faces_obj[1] = 0;
1039 object *&floor = faces_obj[2] = 0;
1123 1040
1124 middle_obj = 0;
1125 top_obj = 0;
1126 floor_obj = 0;
1127
1128 for (tmp = bot; tmp; last = tmp, tmp = tmp->above) 1041 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1129 { 1042 {
1130 /* This could be made additive I guess (two lights better than 1043 // 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; 1044 light += tmp->glow_radius;
1137 1045
1138 /* This call is needed in order to update objects the player 1046 /* This call is needed in order to update objects the player
1139 * is standing in that have animations (ie, grass, fire, etc). 1047 * is standing in that have animations (ie, grass, fire, etc).
1140 * However, it also causes the look window to be re-drawn 1048 * However, it also causes the look window to be re-drawn
1141 * 3 times each time the player moves, because many of the 1049 * 3 times each time the player moves, because many of the
… …
1144 * Always put the player down for drawing. 1052 * Always put the player down for drawing.
1145 */ 1053 */
1146 if (!tmp->invisible) 1054 if (!tmp->invisible)
1147 { 1055 {
1148 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1056 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER)))
1149 {
1150 top = tmp->face;
1151 top_obj = tmp; 1057 top = tmp;
1152 }
1153 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1058 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1154 { 1059 {
1155 /* If we got a floor, that means middle and top were below it, 1060 /* If we got a floor, that means middle and top were below it,
1156 * so should not be visible, so we clear them. 1061 * so should not be visible, so we clear them.
1157 */ 1062 */
1158 middle = blank_face; 1063 middle = 0;
1159 top = blank_face; 1064 top = 0;
1160 floor = tmp->face;
1161 floor_obj = tmp; 1065 floor = tmp;
1162 } 1066 }
1163 /* Flag anywhere have high priority */ 1067 /* Flag anywhere have high priority */
1164 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE)) 1068 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1165 { 1069 {
1166 middle = tmp->face;
1167
1168 middle_obj = tmp; 1070 middle = tmp;
1169 anywhere = 1; 1071 anywhere = 1;
1170 } 1072 }
1073
1171 /* Find the highest visible face around. If equal 1074 /* Find the highest visible face around. If equal
1172 * visibilities, we still want the one nearer to the 1075 * visibilities, we still want the one nearer to the
1173 * top 1076 * top
1174 */ 1077 */
1175 else if (middle == blank_face || (tmp->face->visibility > middle->visibility && !anywhere)) 1078 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1176 {
1177 middle = tmp->face;
1178 middle_obj = tmp; 1079 middle = tmp;
1179 }
1180 } 1080 }
1181 1081
1182 if (tmp == tmp->above) 1082 if (tmp == tmp->above)
1183 { 1083 {
1184 LOG (llevError, "Error in structure of map\n"); 1084 LOG (llevError, "Error in structure of map\n");
… …
1197 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1097 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1198 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE; 1098 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1199 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC; 1099 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1200 } 1100 }
1201 1101
1202 this->light = light; 1102 this->light = min (light, MAX_LIGHT_RADIUS);
1203 this->flags_ = flags; 1103 this->flags_ = flags;
1204 this->move_block = move_block & ~move_allow; 1104 this->move_block = move_block & ~move_allow;
1205 this->move_on = move_on; 1105 this->move_on = move_on;
1206 this->move_off = move_off; 1106 this->move_off = move_off;
1207 this->move_slow = move_slow; 1107 this->move_slow = move_slow;
… …
1219 * middle face. This should not happen, as we already have the 1119 * middle face. This should not happen, as we already have the
1220 * else statement above so middle should not get set. OTOH, it 1120 * else statement above so middle should not get set. OTOH, it
1221 * may be possible for the faces to match but be different objects. 1121 * may be possible for the faces to match but be different objects.
1222 */ 1122 */
1223 if (top == middle) 1123 if (top == middle)
1224 middle = blank_face; 1124 middle = 0;
1225 1125
1226 /* There are three posibilities at this point: 1126 /* There are three posibilities at this point:
1227 * 1) top face is set, need middle to be set. 1127 * 1) top face is set, need middle to be set.
1228 * 2) middle is set, need to set top. 1128 * 2) middle is set, need to set top.
1229 * 3) neither middle or top is set - need to set both. 1129 * 3) neither middle or top is set - need to set both.
1230 */ 1130 */
1231 1131
1232 for (tmp = last; tmp; tmp = tmp->below) 1132 for (object *tmp = last; tmp; tmp = tmp->below)
1233 { 1133 {
1234 /* Once we get to a floor, stop, since we already have a floor object */ 1134 /* Once we get to a floor, stop, since we already have a floor object */
1235 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1135 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1236 break; 1136 break;
1237 1137
1238 /* If two top faces are already set, quit processing */ 1138 /* If two top faces are already set, quit processing */
1239 if ((top != blank_face) && (middle != blank_face)) 1139 if (top && middle)
1240 break; 1140 break;
1241 1141
1242 /* Only show visible faces, unless its the editor - show all */ 1142 /* Only show visible faces */
1243 if (!tmp->invisible || editor) 1143 if (!tmp->invisible)
1244 { 1144 {
1245 /* Fill in top if needed */ 1145 /* Fill in top if needed */
1246 if (top == blank_face) 1146 if (!top)
1247 { 1147 {
1248 top = tmp->face;
1249 top_obj = tmp; 1148 top = tmp;
1250 if (top == middle) 1149 if (top == middle)
1251 middle = blank_face; 1150 middle = 0;
1252 } 1151 }
1253 else 1152 else
1254 { 1153 {
1255 /* top is already set - we should only get here if 1154 /* top is already set - we should only get here if
1256 * middle is not set 1155 * middle is not set
1257 * 1156 *
1258 * Set the middle face and break out, since there is nothing 1157 * Set the middle face and break out, since there is nothing
1259 * more to fill in. We don't check visiblity here, since 1158 * more to fill in. We don't check visiblity here, since
1260 * 1159 *
1261 */ 1160 */
1262 if (tmp->face != top) 1161 if (tmp != top)
1263 { 1162 {
1264 middle = tmp->face;
1265 middle_obj = tmp; 1163 middle = tmp;
1266 break; 1164 break;
1267 } 1165 }
1268 } 1166 }
1269 } 1167 }
1270 } 1168 }
1271 1169
1272 if (middle == floor) 1170 if (middle == floor)
1273 middle = blank_face; 1171 middle = 0;
1274 1172
1275 if (top == middle) 1173 if (top == middle)
1276 middle = blank_face; 1174 middle = 0;
1277 1175
1278 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1176#if 0
1279 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1177 faces_obj [0] = top;
1280 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1178 faces_obj [1] = middle;
1179 faces_obj [2] = floor;
1180#endif
1281} 1181}
1282 1182
1283/* this updates the orig_map->tile_map[tile_num] value after loading 1183uint64
1284 * the map. It also takes care of linking back the freshly loaded 1184mapspace::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]. It really only does this
1287 * so that it is easier for calling functions to verify success.
1288 */
1289static maptile *
1290load_and_link_tiled_map (maptile *orig_map, int tile_num)
1291{ 1185{
1292 maptile *mp = orig_map->load_map_sync (orig_map->tile_path [tile_num], orig_map); 1186 uint64 vol = 0;
1293 1187
1294 if (!mp || mp->in_memory != MAP_IN_MEMORY) 1188 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1295 { 1189 vol += op->volume ();
1296 // emergency mode, manufacture a dummy map, this creates a memleak, but thats fine 1190
1297 LOG (llevError, "FATAL: cannot load tiled map %s from %s, leaking memory and worse!\n", 1191 return vol;
1298 &orig_map->tile_path[tile_num], &orig_map->path); 1192}
1299 mp = new maptile (1, 1); 1193
1300 mp->alloc (); 1194maptile *
1301 mp->in_memory = MAP_IN_MEMORY; 1195maptile::tile_available (int dir, bool load)
1196{
1197 if (tile_path[dir])
1302 } 1198 {
1199 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1200 return tile_map[dir];
1303 1201
1304 int dest_tile = (tile_num + 2) % 4; 1202 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1203 return tile_map[dir];
1204 }
1305 1205
1306 orig_map->tile_map[tile_num] = mp;
1307
1308 // optimisation: back-link map to origin map if euclidean
1309 //TODO: non-euclidean maps MUST GO
1310 if (orig_map->tile_map[tile_num]->tile_path[dest_tile] == orig_map->path)
1311 orig_map->tile_map[tile_num]->tile_map[dest_tile] = orig_map;
1312
1313 return mp; 1206 return 0;
1314} 1207}
1315 1208
1316/* this returns TRUE if the coordinates (x,y) are out of 1209/* this returns TRUE if the coordinates (x,y) are out of
1317 * map m. This function also takes into account any 1210 * map m. This function also takes into account any
1318 * tiling considerations, loading adjacant maps as needed. 1211 * tiling considerations, loading adjacant maps as needed.
… …
1331 if (!m) 1224 if (!m)
1332 return 0; 1225 return 0;
1333 1226
1334 if (x < 0) 1227 if (x < 0)
1335 { 1228 {
1336 if (!m->tile_path[3]) 1229 if (!m->tile_available (3))
1337 return 1; 1230 return 1;
1338 1231
1339 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1340 load_and_link_tiled_map (m, 3);
1341
1342 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y); 1232 return out_of_map (m->tile_map[3], x + m->tile_map[3]->width, y);
1343 } 1233 }
1344 1234
1345 if (x >= m->width) 1235 if (x >= m->width)
1346 { 1236 {
1347 if (!m->tile_path[1]) 1237 if (!m->tile_available (1))
1348 return 1; 1238 return 1;
1349 1239
1350 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1351 load_and_link_tiled_map (m, 1);
1352
1353 return out_of_map (m->tile_map[1], x - m->width, y); 1240 return out_of_map (m->tile_map[1], x - m->width, y);
1354 } 1241 }
1355 1242
1356 if (y < 0) 1243 if (y < 0)
1357 { 1244 {
1358 if (!m->tile_path[0]) 1245 if (!m->tile_available (0))
1359 return 1; 1246 return 1;
1360 1247
1361 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1362 load_and_link_tiled_map (m, 0);
1363
1364 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height); 1248 return out_of_map (m->tile_map[0], x, y + m->tile_map[0]->height);
1365 } 1249 }
1366 1250
1367 if (y >= m->height) 1251 if (y >= m->height)
1368 { 1252 {
1369 if (!m->tile_path[2]) 1253 if (!m->tile_available (2))
1370 return 1; 1254 return 1;
1371
1372 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1373 load_and_link_tiled_map (m, 2);
1374 1255
1375 return out_of_map (m->tile_map[2], x, y - m->height); 1256 return out_of_map (m->tile_map[2], x, y - m->height);
1376 } 1257 }
1377 1258
1378 /* Simple case - coordinates are within this local 1259 /* Simple case - coordinates are within this local
… …
1388 * updates x and y to be the localised coordinates. 1269 * updates x and y to be the localised coordinates.
1389 * Using this is more efficient of calling out_of_map 1270 * Using this is more efficient of calling out_of_map
1390 * and then figuring out what the real map is 1271 * and then figuring out what the real map is
1391 */ 1272 */
1392maptile * 1273maptile *
1393get_map_from_coord (maptile *m, sint16 *x, sint16 *y) 1274maptile::xy_find (sint16 &x, sint16 &y)
1394{ 1275{
1395 if (*x < 0) 1276 if (x < 0)
1396 { 1277 {
1397 if (!m->tile_path[3]) 1278 if (!tile_available (3))
1398 return 0; 1279 return 0;
1399 1280
1400 if (!m->tile_map[3] || m->tile_map[3]->in_memory != MAP_IN_MEMORY)
1401 load_and_link_tiled_map (m, 3);
1402
1403 *x += m->tile_map[3]->width; 1281 x += tile_map[3]->width;
1404 return (get_map_from_coord (m->tile_map[3], x, y)); 1282 return tile_map[3]->xy_find (x, y);
1405 } 1283 }
1406 1284
1407 if (*x >= m->width) 1285 if (x >= width)
1408 { 1286 {
1409 if (!m->tile_path[1]) 1287 if (!tile_available (1))
1410 return 0; 1288 return 0;
1411 1289
1412 if (!m->tile_map[1] || m->tile_map[1]->in_memory != MAP_IN_MEMORY)
1413 load_and_link_tiled_map (m, 1);
1414
1415 *x -= m->width; 1290 x -= width;
1416 return (get_map_from_coord (m->tile_map[1], x, y)); 1291 return tile_map[1]->xy_find (x, y);
1417 } 1292 }
1418 1293
1419 if (*y < 0) 1294 if (y < 0)
1420 { 1295 {
1421 if (!m->tile_path[0]) 1296 if (!tile_available (0))
1422 return 0; 1297 return 0;
1423 1298
1424 if (!m->tile_map[0] || m->tile_map[0]->in_memory != MAP_IN_MEMORY)
1425 load_and_link_tiled_map (m, 0);
1426
1427 *y += m->tile_map[0]->height; 1299 y += tile_map[0]->height;
1428 return (get_map_from_coord (m->tile_map[0], x, y)); 1300 return tile_map[0]->xy_find (x, y);
1429 } 1301 }
1430 1302
1431 if (*y >= m->height) 1303 if (y >= height)
1432 { 1304 {
1433 if (!m->tile_path[2]) 1305 if (!tile_available (2))
1434 return 0; 1306 return 0;
1435 1307
1436 if (!m->tile_map[2] || m->tile_map[2]->in_memory != MAP_IN_MEMORY)
1437 load_and_link_tiled_map (m, 2);
1438
1439 *y -= m->height; 1308 y -= height;
1440 return (get_map_from_coord (m->tile_map[2], x, y)); 1309 return tile_map[2]->xy_find (x, y);
1441 } 1310 }
1442 1311
1443 /* Simple case - coordinates are within this local 1312 /* Simple case - coordinates are within this local
1444 * map. 1313 * map.
1445 */ 1314 */
1446 return m; 1315 return this;
1447} 1316}
1448 1317
1449/** 1318/**
1450 * Return whether map2 is adjacent to map1. If so, store the distance from 1319 * Return whether map2 is adjacent to map1. If so, store the distance from
1451 * map1 to map2 in dx/dy. 1320 * map1 to map2 in dx/dy.
1452 */ 1321 */
1453static int 1322int
1454adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1323adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy)
1455{ 1324{
1456 if (!map1 || !map2) 1325 if (!map1 || !map2)
1457 return 0; 1326 return 0;
1458 1327
1328 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
1329 //fix: compare paths instead (this is likely faster, too!)
1459 if (map1 == map2) 1330 if (map1 == map2)
1460 { 1331 {
1461 *dx = 0; 1332 *dx = 0;
1462 *dy = 0; 1333 *dy = 0;
1463 } 1334 }
… …
1523 } 1394 }
1524 else 1395 else
1525 return 0; 1396 return 0;
1526 1397
1527 return 1; 1398 return 1;
1399}
1400
1401maptile *
1402maptile::xy_load (sint16 &x, sint16 &y)
1403{
1404 maptile *map = xy_find (x, y);
1405
1406 if (map)
1407 map->load_sync ();
1408
1409 return map;
1410}
1411
1412maptile *
1413get_map_from_coord (maptile *m, sint16 *x, sint16 *y)
1414{
1415 return m->xy_load (*x, *y);
1528} 1416}
1529 1417
1530/* From map.c 1418/* From map.c
1531 * This is used by get_player to determine where the other 1419 * This is used by get_player to determine where the other
1532 * creature is. get_rangevector takes into account map tiling, 1420 * creature is. get_rangevector takes into account map tiling,
1533 * so you just can not look the the map coordinates and get the 1421 * so you just can not look the the map coordinates and get the
1534 * righte value. distance_x/y are distance away, which 1422 * righte value. distance_x/y are distance away, which
1535 * can be negativbe. direction is the crossfire direction scheme 1423 * can be negative. direction is the crossfire direction scheme
1536 * that the creature should head. part is the part of the 1424 * that the creature should head. part is the part of the
1537 * monster that is closest. 1425 * monster that is closest.
1538 * 1426 *
1539 * get_rangevector looks at op1 and op2, and fills in the 1427 * get_rangevector looks at op1 and op2, and fills in the
1540 * structure for op1 to get to op2. 1428 * structure for op1 to get to op2.
… …
1551get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1439get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1552{ 1440{
1553 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1441 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1554 { 1442 {
1555 /* be conservative and fill in _some_ data */ 1443 /* be conservative and fill in _some_ data */
1556 retval->distance = 100000; 1444 retval->distance = 10000;
1557 retval->distance_x = 32767; 1445 retval->distance_x = 10000;
1558 retval->distance_y = 32767; 1446 retval->distance_y = 10000;
1559 retval->direction = 0; 1447 retval->direction = 0;
1560 retval->part = 0; 1448 retval->part = 0;
1561 } 1449 }
1562 else 1450 else
1563 { 1451 {
… …
1568 1456
1569 best = op1; 1457 best = op1;
1570 /* If this is multipart, find the closest part now */ 1458 /* If this is multipart, find the closest part now */
1571 if (!(flags & 0x1) && op1->more) 1459 if (!(flags & 0x1) && op1->more)
1572 { 1460 {
1573 object *tmp;
1574 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1461 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1575 1462
1576 /* we just take the offset of the piece to head to figure 1463 /* we just take the offset of the piece to head to figure
1577 * distance instead of doing all that work above again 1464 * distance instead of doing all that work above again
1578 * since the distance fields we set above are positive in the 1465 * since the distance fields we set above are positive in the
1579 * same axis as is used for multipart objects, the simply arithmetic 1466 * same axis as is used for multipart objects, the simply arithmetic
1580 * below works. 1467 * below works.
1581 */ 1468 */
1582 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1469 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1583 { 1470 {
1584 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1471 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1585 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1472 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1586 if (tmpi < best_distance) 1473 if (tmpi < best_distance)
1587 { 1474 {
1588 best_distance = tmpi; 1475 best_distance = tmpi;
1589 best = tmp; 1476 best = tmp;
1590 } 1477 }
1591 } 1478 }
1479
1592 if (best != op1) 1480 if (best != op1)
1593 { 1481 {
1594 retval->distance_x += op1->x - best->x; 1482 retval->distance_x += op1->x - best->x;
1595 retval->distance_y += op1->y - best->y; 1483 retval->distance_y += op1->y - best->y;
1596 } 1484 }
1597 } 1485 }
1486
1598 retval->part = best; 1487 retval->part = best;
1599 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1488 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1600 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1489 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1601 } 1490 }
1602} 1491}
1603 1492
1604/* this is basically the same as get_rangevector above, but instead of 1493/* this is basically the same as get_rangevector above, but instead of
… …
1609 * flags has no meaning for this function at this time - I kept it in to 1498 * flags has no meaning for this function at this time - I kept it in to
1610 * be more consistant with the above function and also in case they are needed 1499 * be more consistant with the above function and also in case they are needed
1611 * for something in the future. Also, since no object is pasted, the best 1500 * for something in the future. Also, since no object is pasted, the best
1612 * field of the rv_vector is set to NULL. 1501 * field of the rv_vector is set to NULL.
1613 */ 1502 */
1614
1615void 1503void
1616get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector * retval, int flags) 1504get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1617{ 1505{
1618 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1506 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1619 { 1507 {
1620 /* be conservative and fill in _some_ data */ 1508 /* be conservative and fill in _some_ data */
1621 retval->distance = 100000; 1509 retval->distance = 100000;
… …
1628 { 1516 {
1629 retval->distance_x += op2->x - x; 1517 retval->distance_x += op2->x - x;
1630 retval->distance_y += op2->y - y; 1518 retval->distance_y += op2->y - y;
1631 1519
1632 retval->part = NULL; 1520 retval->part = NULL;
1633 retval->distance = isqrt (retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y); 1521 retval->distance = idistance (retval->distance_x, retval->distance_y);
1634 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1522 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1635 } 1523 }
1636} 1524}
1637 1525
1638/* Returns true of op1 and op2 are effectively on the same map 1526/* Returns true of op1 and op2 are effectively on the same map
… …
1652} 1540}
1653 1541
1654object * 1542object *
1655maptile::insert (object *op, int x, int y, object *originator, int flags) 1543maptile::insert (object *op, int x, int y, object *originator, int flags)
1656{ 1544{
1657 if (!op->flag [FLAG_REMOVED])
1658 op->remove ();
1659
1660 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1545 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1661} 1546}
1662 1547
1548region *
1549maptile::region (int x, int y) const
1550{
1551 if (regions
1552 && regionmap
1553 && !OUT_OF_REAL_MAP (this, x, y))
1554 if (struct region *reg = regionmap [regions [y * width + x]])
1555 return reg;
1556
1557 if (default_region)
1558 return default_region;
1559
1560 return ::region::default_region ();
1561}
1562
1563/* picks a random object from a style map.
1564 */
1565object *
1566maptile::pick_random_object (rand_gen &gen) const
1567{
1568 /* while returning a null object will result in a crash, that
1569 * is actually preferable to an infinite loop. That is because
1570 * most servers will automatically restart in case of crash.
1571 * Change the logic on getting the random space - shouldn't make
1572 * any difference, but this seems clearer to me.
1573 */
1574 for (int i = 1000; --i;)
1575 {
1576 object *pick = at (gen (width), gen (height)).bot;
1577
1578 // do not prefer big monsters just because they are big.
1579 if (pick && pick->is_head ())
1580 return pick->head_ ();
1581 }
1582
1583 // instead of crashing in the unlikely(?) case, try to return *something*
1584 return archetype::find ("bug");
1585}
1586
1587void
1588maptile::play_sound (faceidx sound, int x, int y) const
1589{
1590 if (!sound)
1591 return;
1592
1593 for_all_players_on_map (pl, this)
1594 if (client *ns = pl->ns)
1595 {
1596 int dx = x - pl->ob->x;
1597 int dy = y - pl->ob->y;
1598
1599 int distance = idistance (dx, dy);
1600
1601 if (distance <= MAX_SOUND_DISTANCE)
1602 ns->play_sound (sound, dx, dy);
1603 }
1604}
1605
1606void
1607maptile::say_msg (const char *msg, int x, int y) const
1608{
1609 for_all_players (pl)
1610 if (client *ns = pl->ns)
1611 {
1612 int dx = x - pl->ob->x;
1613 int dy = y - pl->ob->y;
1614
1615 int distance = idistance (dx, dy);
1616
1617 if (distance <= MAX_SOUND_DISTANCE)
1618 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1619 }
1620}
1621
1622static void
1623split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1624{
1625 // clip to map to the left
1626 if (x0 < 0)
1627 {
1628 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1629 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1630
1631 if (x1 < 0) // entirely to the left
1632 return;
1633
1634 x0 = 0;
1635 }
1636
1637 // clip to map to the right
1638 if (x1 > m->width)
1639 {
1640 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1641 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1642
1643 if (x0 > m->width) // entirely to the right
1644 return;
1645
1646 x1 = m->width;
1647 }
1648
1649 // clip to map above
1650 if (y0 < 0)
1651 {
1652 if (maptile *tile = m->tile_available (TILE_UP, 1))
1653 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1654
1655 if (y1 < 0) // entirely above
1656 return;
1657
1658 y0 = 0;
1659 }
1660
1661 // clip to map below
1662 if (y1 > m->height)
1663 {
1664 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1665 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1666
1667 if (y0 > m->height) // entirely below
1668 return;
1669
1670 y1 = m->height;
1671 }
1672
1673 // if we get here, the rect is within the current map
1674 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1675
1676 r->m = m;
1677 r->x0 = x0;
1678 r->y0 = y0;
1679 r->x1 = x1;
1680 r->y1 = y1;
1681 r->dx = dx;
1682 r->dy = dy;
1683}
1684
1685maprect *
1686maptile::split_to_tiles (int x0, int y0, int x1, int y1)
1687{
1688 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1689 buf.clear ();
1690
1691 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1692
1693 // add end marker
1694 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1695 r->m = 0;
1696
1697 return (maprect *)buf.linearise ();
1698}
1699

Diff Legend

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