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.153 by root, Tue Dec 23 06:58:23 2008 UTC vs.
Revision 1.203 by root, Sat Apr 23 04:56:46 2011 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 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 (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. 19 * and the GNU General Public License along with this program. If not, see
20 * <http://www.gnu.org/licenses/>.
20 * 21 *
21 * The authors can be reached via e-mail to <support@deliantra.net> 22 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 23 */
23 24
24#include <unistd.h> 25#include <unistd.h>
25 26
26#include "global.h" 27#include "global.h"
27#include "loader.h"
28#include "path.h" 28#include "path.h"
29
30//+GPL
29 31
30sint8 maptile::outdoor_darkness; 32sint8 maptile::outdoor_darkness;
31 33
32/* This rolls up wall, blocks_magic, blocks_view, etc, all into 34/* This rolls up wall, blocks_magic, blocks_view, etc, all into
33 * one function that just returns a P_.. value (see map.h) 35 * one function that just returns a P_.. value (see map.h)
… …
70 * by the caller. 72 * by the caller.
71 */ 73 */
72int 74int
73blocked_link (object *ob, maptile *m, int sx, int sy) 75blocked_link (object *ob, maptile *m, int sx, int sy)
74{ 76{
75 object *tmp;
76 int mflags, blocked;
77
78 /* Make sure the coordinates are valid - they should be, as caller should 77 /* Make sure the coordinates are valid - they should be, as caller should
79 * have already checked this. 78 * have already checked this.
80 */ 79 */
81 if (OUT_OF_REAL_MAP (m, sx, sy)) 80 if (OUT_OF_REAL_MAP (m, sx, sy))
82 { 81 {
83 LOG (llevError, "blocked_link: Passed map, x, y coordinates outside of map\n"); 82 LOG (llevError | logBacktrace, "blocked_link: Passed map, x, y coordinates outside of map\n");
84 return 1; 83 return 1;
85 } 84 }
86 85
87 /* Save some cycles - instead of calling get_map_flags(), just get the value 86 mapspace &ms = m->at (sx, sy);
88 * directly.
89 */
90 mflags = m->at (sx, sy).flags ();
91 87
92 blocked = GET_MAP_MOVE_BLOCK (m, sx, sy); 88 int mflags = ms.flags ();
89 int blocked = ms.move_block;
93 90
94 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
95 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
96 * things we need to do for players. 93 * things we need to do for players.
97 */ 94 */
98 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && (blocked == 0)) 95 if (ob->type != PLAYER && !(mflags & P_IS_ALIVE) && blocked == 0)
99 return 0; 96 return 0;
100 97
101 /* if there isn't anytyhing alive on this space, and this space isn't 98 /* if there isn't anything alive on this space, and this space isn't
102 * otherwise blocked, we can return now. Only if there is a living 99 * otherwise blocked, we can return now. Only if there is a living
103 * creature do we need to investigate if it is part of this creature 100 * creature do we need to investigate if it is part of this creature
104 * or another. Likewise, only if something is blocking us do we 101 * or another. Likewise, only if something is blocking us do we
105 * need to investigate if there is a special circumstance that would 102 * need to investigate if there is a special circumstance that would
106 * let the player through (inventory checkers for example) 103 * let the player through (inventory checkers for example)
… …
113 /* We basically go through the stack of objects, and if there is 110 /* We basically go through the stack of objects, and if there is
114 * some other object that has NO_PASS or FLAG_ALIVE set, return 111 * some other object that has NO_PASS or FLAG_ALIVE set, return
115 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
116 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
117 */ 114 */
118 for (tmp = GET_MAP_OB (m, sx, sy); tmp; tmp = tmp->above) 115 for (object *tmp = ms.top; tmp; tmp = tmp->below)
119 { 116 {
120 117 if (OB_MOVE_BLOCK (ob, tmp))
121 /* This must be before the checks below. Code for inventory checkers. */
122 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
123 { 118 {
124 /* If last_sp is set, the player/monster needs an object, 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
125 * so we check for it. If they don't have it, they can't 120 if (RESULT_INT (0))
126 * pass through this space. 121 return 1;
127 */ 122 else
128 if (tmp->last_sp) 123 continue;
124
125 if (tmp->type == CHECK_INV)
129 { 126 {
130 if (check_inv_recursive (ob, tmp) == NULL) 127 bool have = check_inv_recursive (ob, tmp);
128
129 // last_sp set means we block if we don't have.
130 if (logical_xor (have, tmp->last_sp))
131 return 1; 131 return 1;
132 else 132 }
133 continue; 133 else if (tmp->type == T_MATCH)
134 {
135 // T_MATCH allows "entrance" iff the match is true
136 // == blocks if the match fails
137
138 // we could have used an INVOKE_OBJECT, but decided against it, as we
139 // assume that T_MATCH is relatively common.
140 if (!match (tmp->slaying, ob, tmp, ob))
141 return 1;
134 } 142 }
135 else 143 else
136 { 144 return 1; // unconditional block
137 /* In this case, the player must not have the object - 145
138 * if they do, they can't pass through.
139 */
140 if (check_inv_recursive (ob, tmp) != NULL) /* player has object */
141 return 1;
142 else
143 continue;
144 }
145 } /* if check_inv */
146 else 146 } else {
147 { 147 // space does not block the ob, directly, but
148 /* Broke apart a big nasty if into several here to make 148 // anything alive that is not a door still
149 * this more readable. first check - if the space blocks 149 // blocks anything
150 * movement, can't move here.
151 * second - if a monster, can't move there, unless it is a
152 * hidden dm
153 */
154 if (OB_MOVE_BLOCK (ob, tmp))
155 return 1;
156 150
157 if (tmp->flag [FLAG_ALIVE] 151 if (tmp->flag [FLAG_ALIVE]
158 && tmp->head_ () != ob
159 && tmp != ob
160 && tmp->type != DOOR 152 && tmp->type != DOOR
161 && !(tmp->flag [FLAG_WIZ] && tmp->contr->hidden)) 153 && tmp->head_ () != ob) //TODO: maybe move these check up?
162 return 1; 154 return 1;
163 } 155 }
164
165 } 156 }
157
166 return 0; 158 return 0;
167} 159}
168 160
169/* 161/*
170 * Returns qthe blocking object if the given object can't fit in the given 162 * Returns the blocking object if the given object can't fit in the given
171 * spot. This is meant for multi space objects - for single space objecs, 163 * spot. This is meant for multi space objects - for single space objecs,
172 * just calling get_map_blocked and checking that against movement type 164 * just calling get_map_blocked and checking that against movement type
173 * of object. This function goes through all the parts of the multipart 165 * of object. This function goes through all the parts of the multipart
174 * object and makes sure they can be inserted. 166 * object and makes sure they can be inserted.
175 * 167 *
… …
222 } 214 }
223 215
224 return 0; 216 return 0;
225} 217}
226 218
227/* When the map is loaded, load_object does not actually insert objects 219//-GPL
228 * into inventory, but just links them. What this does is go through
229 * and insert them properly.
230 * The object 'container' is the object that contains the inventory.
231 * This is needed so that we can update the containers weight.
232 */
233void
234fix_container (object *container)
235{
236 object *tmp = container->inv, *next;
237
238 container->inv = 0;
239 while (tmp)
240 {
241 next = tmp->below;
242 if (tmp->inv)
243 fix_container (tmp);
244
245 insert_ob_in_ob (tmp, container);
246 tmp = next;
247 }
248
249 // go through and calculate what all the containers are carrying.
250 //TODO: remove
251 container->update_weight ();
252}
253 220
254void 221void
255maptile::set_object_flag (int flag, int value) 222maptile::set_object_flag (int flag, int value)
256{ 223{
257 if (!spaces) 224 if (!spaces)
… …
272 239
273 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 240 for (mapspace *ms = spaces + size (); ms-- > spaces; )
274 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 241 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
275 INVOKE_OBJECT (RESET, tmp); 242 INVOKE_OBJECT (RESET, tmp);
276} 243}
244
245void
246maptile::post_load ()
247{
248#if 0
249 if (!spaces)
250 return;
251
252 for (mapspace *ms = spaces + size (); ms-- > spaces; )
253 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
254 ; // nop
255#endif
256}
257
258//+GPL
277 259
278/* link_multipart_objects go through all the objects on the map looking 260/* link_multipart_objects go through all the objects on the map looking
279 * for objects whose arch says they are multipart yet according to the 261 * for objects whose arch says they are multipart yet according to the
280 * info we have, they only have the head (as would be expected when 262 * info we have, they only have the head (as would be expected when
281 * they are saved). 263 * they are saved).
… …
309 op = op->above; 291 op = op->above;
310 } 292 }
311 } 293 }
312} 294}
313 295
296//-GPL
297
314/* 298/*
315 * Loads (ands parses) the objects into a given map from the specified 299 * Loads (ands parses) the objects into a given map from the specified
316 * file pointer. 300 * file pointer.
317 */ 301 */
318bool 302bool
… …
327 case KW_arch: 311 case KW_arch:
328 if (object *op = object::read (f, this)) 312 if (object *op = object::read (f, this))
329 { 313 {
330 // TODO: why? 314 // TODO: why?
331 if (op->inv) 315 if (op->inv)
316 {
317 op->carrying = 0;
332 op->update_weight (); 318 op->update_weight ();
319 }
333 320
334 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
335 { 322 {
336 // we insert manually because 323 // we insert manually because
337 // a) its way faster 324 // a) its way faster
338 // b) we remove manually, too, and there are good reasons for that 325 // b) we remove manually, too, and there are good reasons for that
339 // c) its correct 326 // c) it's correct
340 mapspace &ms = at (op->x, op->y); 327 mapspace &ms = at (op->x, op->y);
341 328
342 op->flag [FLAG_REMOVED] = false; 329 op->flag [FLAG_REMOVED] = false;
343 330
344 op->above = 0; 331 op->above = 0;
345 op->below = ms.top; 332 op->below = ms.top;
346 333
347 if (ms.top)
348 ms.top->above = op; 334 *(ms.top ? &ms.top->above : &ms.bot) = op;
349 else
350 ms.bot = op;
351 335
352 ms.top = op; 336 ms.top = op;
353 ms.flags_ = 0; 337 ms.flags_ = 0;
354 } 338 }
355 else 339 else
… …
440 return false; 424 return false;
441 425
442 return freezer.save (path); 426 return freezer.save (path);
443} 427}
444 428
445maptile::maptile () 429void
430maptile::init ()
446{ 431{
447 in_memory = MAP_SWAPPED; 432 in_memory = MAP_SWAPPED;
448 433
449 /* The maps used to pick up default x and y values from the 434 /* The maps used to pick up default x and y values from the
450 * map archetype. Mimic that behaviour. 435 * map archetype. Mimic that behaviour.
451 */ 436 */
452 width = 16; 437 width = 16;
453 height = 16; 438 height = 16;
454 timeout = 300; 439 timeout = 300;
455 max_nrof = 1000; // 1000 items of anything 440 max_items = MAX_ITEM_PER_ACTION;
456 max_volume = 2000000; // 2m³ 441 max_volume = 2000000; // 2m³
457}
458
459maptile::maptile (int w, int h)
460{
461 in_memory = MAP_SWAPPED;
462
463 width = w;
464 height = h;
465 reset_timeout = 0; 442 reset_timeout = 0;
466 timeout = 300;
467 enter_x = 0; 443 enter_x = 0;
468 enter_y = 0; 444 enter_y = 0;
445}
446
447maptile::maptile ()
448{
449 init ();
450}
451
452maptile::maptile (int w, int h)
453{
454 init ();
455
456 width = w;
457 height = h;
469 458
470 alloc (); 459 alloc ();
471} 460}
472 461
473/* 462/*
… …
481 if (spaces) 470 if (spaces)
482 return; 471 return;
483 472
484 spaces = salloc0<mapspace> (size ()); 473 spaces = salloc0<mapspace> (size ());
485} 474}
475
476//+GPL
486 477
487/* Takes a string from a map definition and outputs a pointer to the array of shopitems 478/* Takes a string from a map definition and outputs a pointer to the array of shopitems
488 * corresponding to that string. Memory is allocated for this, it must be freed 479 * corresponding to that string. Memory is allocated for this, it must be freed
489 * at a later date. 480 * at a later date.
490 * Called by parse_map_headers below. 481 * Called by parse_map_headers below.
… …
567 return items; 558 return items;
568} 559}
569 560
570/* opposite of parse string, this puts the string that was originally fed in to 561/* opposite of parse string, this puts the string that was originally fed in to
571 * the map (or something equivilent) into output_string. */ 562 * the map (or something equivilent) into output_string. */
572static void 563static const char *
573print_shop_string (maptile *m, char *output_string) 564print_shop_string (maptile *m)
574{ 565{
575 int i; 566 static dynbuf_text buf; buf.clear ();
576 char tmp[MAX_BUF]; 567 bool first = true;
577 568
578 strcpy (output_string, "");
579 for (i = 0; i < m->shopitems[0].index; i++) 569 for (int i = 0; i < m->shopitems[0].index; i++)
580 { 570 {
571 if (!first)
572 buf << ';';
573
574 first = false;
575
581 if (m->shopitems[i].typenum) 576 if (m->shopitems[i].typenum)
582 { 577 {
583 if (m->shopitems[i].strength) 578 if (m->shopitems[i].strength)
584 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 579 buf.printf ("%s:%d", m->shopitems[i].name, m->shopitems[i].strength);
585 else 580 else
586 sprintf (tmp, "%s;", m->shopitems[i].name); 581 buf.printf ("%s", m->shopitems[i].name);
587 } 582 }
588 else 583 else
589 { 584 {
590 if (m->shopitems[i].strength) 585 if (m->shopitems[i].strength)
591 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 586 buf.printf ("*:%d", m->shopitems[i].strength);
592 else 587 else
593 sprintf (tmp, "*"); 588 buf.printf ("*");
594 } 589 }
595
596 strcat (output_string, tmp);
597 } 590 }
591
592 return buf;
598} 593}
594
595//-GPL
599 596
600/* This loads the header information of the map. The header 597/* This loads the header information of the map. The header
601 * contains things like difficulty, size, timeout, etc. 598 * contains things like difficulty, size, timeout, etc.
602 * this used to be stored in the map object, but with the 599 * this used to be stored in the map object, but with the
603 * addition of tiling, fields beyond that easily named in an 600 * addition of tiling, fields beyond that easily named in an
… …
617 { 614 {
618 case KW_msg: 615 case KW_msg:
619 thawer.get_ml (KW_endmsg, msg); 616 thawer.get_ml (KW_endmsg, msg);
620 break; 617 break;
621 618
622 case KW_lore: // CF+ extension 619 case KW_lore: // deliantra extension
623 thawer.get_ml (KW_endlore, maplore); 620 thawer.get_ml (KW_endlore, maplore);
624 break; 621 break;
625 622
626 case KW_maplore: 623 case KW_maplore:
627 thawer.get_ml (KW_endmaplore, maplore); 624 thawer.get_ml (KW_endmaplore, maplore);
… …
644 case KW_shopgreed: thawer.get (shopgreed); break; 641 case KW_shopgreed: thawer.get (shopgreed); break;
645 case KW_shopmin: thawer.get (shopmin); break; 642 case KW_shopmin: thawer.get (shopmin); break;
646 case KW_shopmax: thawer.get (shopmax); break; 643 case KW_shopmax: thawer.get (shopmax); break;
647 case KW_shoprace: thawer.get (shoprace); break; 644 case KW_shoprace: thawer.get (shoprace); break;
648 case KW_outdoor: thawer.get (outdoor); break; 645 case KW_outdoor: thawer.get (outdoor); break;
649 case KW_temp: thawer.get (temp); break;
650 case KW_pressure: thawer.get (pressure); break;
651 case KW_humid: thawer.get (humid); break;
652 case KW_windspeed: thawer.get (windspeed); break;
653 case KW_winddir: thawer.get (winddir); break;
654 case KW_sky: thawer.get (sky); break;
655 646
656 case KW_per_player: thawer.get (per_player); break; 647 case KW_per_player: thawer.get (per_player); break;
657 case KW_per_party: thawer.get (per_party); break; 648 case KW_per_party: thawer.get (per_party); break;
658 case KW_no_reset: thawer.get (no_reset); break; 649 case KW_no_reset: thawer.get (no_reset); break;
659 case KW_no_drop: thawer.get (no_drop); break; 650 case KW_no_drop: thawer.get (no_drop); break;
660 651
661 case KW_region: default_region = region::find (thawer.get_str ()); break; 652 case KW_region: thawer.get (default_region); break;
662 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break; 653 case KW_shopitems: shopitems = parse_shop_string (thawer.get_str ()); break;
663 654
664 // old names new names 655 // old names new names
665 case KW_hp: case KW_enter_x: thawer.get (enter_x); break; 656 case KW_hp: case KW_enter_x: thawer.get (enter_x); break;
666 case KW_sp: case KW_enter_y: thawer.get (enter_y); break; 657 case KW_sp: case KW_enter_y: thawer.get (enter_y); break;
… …
674 665
675 case KW_tile_path_1: thawer.get (tile_path [0]); break; 666 case KW_tile_path_1: thawer.get (tile_path [0]); break;
676 case KW_tile_path_2: thawer.get (tile_path [1]); break; 667 case KW_tile_path_2: thawer.get (tile_path [1]); break;
677 case KW_tile_path_3: thawer.get (tile_path [2]); break; 668 case KW_tile_path_3: thawer.get (tile_path [2]); break;
678 case KW_tile_path_4: thawer.get (tile_path [3]); break; 669 case KW_tile_path_4: thawer.get (tile_path [3]); break;
670 case KW_tile_path_5: thawer.get (tile_path [4]); break;
671 case KW_tile_path_6: thawer.get (tile_path [5]); break;
679 672
680 case KW_ERROR: 673 case KW_ERROR:
681 set_key_text (thawer.kw_str, thawer.value); 674 set_key_text (thawer.kw_str, thawer.value);
682 break; 675 break;
683 676
684 case KW_end: 677 case KW_end:
685 thawer.next (); 678 thawer.next ();
686 return true; 679 return true;
687 680
688 default: 681 default:
689 if (!thawer.parse_error ("map", 0)) 682 if (!thawer.parse_error ("map"))
690 return false; 683 return false;
691 break; 684 break;
692 } 685 }
693 686
694 thawer.next (); 687 thawer.next ();
695 } 688 }
696 689
697 abort (); 690 abort ();
698} 691}
692
693//+GPL
699 694
700/****************************************************************************** 695/******************************************************************************
701 * This is the start of unique map handling code 696 * This is the start of unique map handling code
702 *****************************************************************************/ 697 *****************************************************************************/
703 698
… …
710 int unique = 0; 705 int unique = 0;
711 for (object *op = spaces [i].bot; op; ) 706 for (object *op = spaces [i].bot; op; )
712 { 707 {
713 object *above = op->above; 708 object *above = op->above;
714 709
715 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 710 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
716 unique = 1; 711 unique = 1;
717 712
718 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 713 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
719 op->destroy (); 714 op->destroy ();
720 715
721 op = above; 716 op = above;
722 } 717 }
723 } 718 }
724} 719}
725 720
721//-GPL
722
726bool 723bool
727maptile::_save_header (object_freezer &freezer) 724maptile::_save_header (object_freezer &freezer)
728{ 725{
729#define MAP_OUT(k) freezer.put (KW_ ## k, k) 726#define MAP_OUT(k) freezer.put (KW(k), k)
730#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 727#define MAP_OUT2(k,v) freezer.put (KW(k), v)
731 728
732 MAP_OUT2 (arch, "map"); 729 MAP_OUT2 (arch, CS(map));
733 730
734 if (name) MAP_OUT (name); 731 if (name) MAP_OUT (name);
735 MAP_OUT (swap_time); 732 MAP_OUT (swap_time);
736 MAP_OUT (reset_time); 733 MAP_OUT (reset_time);
737 MAP_OUT (reset_timeout); 734 MAP_OUT (reset_timeout);
738 MAP_OUT (fixed_resettime); 735 MAP_OUT (fixed_resettime);
739 MAP_OUT (no_reset); 736 MAP_OUT (no_reset);
740 MAP_OUT (no_drop); 737 MAP_OUT (no_drop);
741 MAP_OUT (difficulty); 738 MAP_OUT (difficulty);
742
743 if (default_region) MAP_OUT2 (region, default_region->name); 739 if (default_region) MAP_OUT2 (region, default_region->name);
744 740
745 if (shopitems) 741 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
746 {
747 char shop[MAX_BUF];
748 print_shop_string (this, shop);
749 MAP_OUT2 (shopitems, shop);
750 }
751
752 MAP_OUT (shopgreed); 742 MAP_OUT (shopgreed);
753 MAP_OUT (shopmin); 743 MAP_OUT (shopmin);
754 MAP_OUT (shopmax); 744 MAP_OUT (shopmax);
755 if (shoprace) MAP_OUT (shoprace); 745 if (shoprace) MAP_OUT (shoprace);
756 MAP_OUT (darkness); 746
757 MAP_OUT (width); 747 MAP_OUT (width);
758 MAP_OUT (height); 748 MAP_OUT (height);
759 MAP_OUT (enter_x); 749 MAP_OUT (enter_x);
760 MAP_OUT (enter_y); 750 MAP_OUT (enter_y);
761 751 MAP_OUT (darkness);
762 if (msg) freezer.put (KW_msg , KW_endmsg , msg);
763 if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
764
765 MAP_OUT (outdoor); 752 MAP_OUT (outdoor);
766 MAP_OUT (temp); 753
767 MAP_OUT (pressure); 754 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
768 MAP_OUT (humid); 755 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
769 MAP_OUT (windspeed);
770 MAP_OUT (winddir);
771 MAP_OUT (sky);
772 756
773 MAP_OUT (per_player); 757 MAP_OUT (per_player);
774 MAP_OUT (per_party); 758 MAP_OUT (per_party);
775 759
776 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 760 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
777 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 761 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
778 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 762 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
779 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 763 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
764 if (tile_path [4]) MAP_OUT2 (tile_path_5, tile_path [4]);
765 if (tile_path [5]) MAP_OUT2 (tile_path_6, tile_path [5]);
780 766
781 freezer.put (this); 767 freezer.put (this);
782 freezer.put (KW_end); 768 freezer.put (KW(end));
783 769
784 return true; 770 return true;
785} 771}
786 772
787bool 773bool
… …
792 if (!_save_header (freezer)) 778 if (!_save_header (freezer))
793 return false; 779 return false;
794 780
795 return freezer.save (path); 781 return freezer.save (path);
796} 782}
783
784//+GPL
797 785
798/* 786/*
799 * Remove and free all objects in the given map. 787 * Remove and free all objects in the given map.
800 */ 788 */
801void 789void
… …
839 msg = 0; 827 msg = 0;
840 maplore = 0; 828 maplore = 0;
841 shoprace = 0; 829 shoprace = 0;
842 delete [] shopitems, shopitems = 0; 830 delete [] shopitems, shopitems = 0;
843 831
844 for (int i = 0; i < 4; i++) 832 for (int i = 0; i < TILE_NUM; i++)
845 tile_path [i] = 0; 833 tile_path [i] = 0;
846} 834}
847 835
848maptile::~maptile () 836maptile::~maptile ()
849{ 837{
… …
870 858
871 clear (); 859 clear ();
872} 860}
873 861
874/* decay and destroy perishable items in a map */ 862/* decay and destroy perishable items in a map */
863// TODO: should be done regularly, not on map load?
875void 864void
876maptile::do_decay_objects () 865maptile::do_decay_objects ()
877{ 866{
878 if (!spaces) 867 if (!spaces)
879 return; 868 return;
… …
881 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 870 for (mapspace *ms = spaces + size (); ms-- > spaces; )
882 for (object *above, *op = ms->bot; op; op = above) 871 for (object *above, *op = ms->bot; op; op = above)
883 { 872 {
884 above = op->above; 873 above = op->above;
885 874
875 // do not decay anything above unique floor tiles (yet :)
876 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
877 break;
878
886 bool destroy = 0; 879 bool destroy = 0;
887 880
888 // do not decay anything above unique floor tiles (yet :) 881 if (op->flag [FLAG_IS_FLOOR]
889 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 882 || op->flag [FLAG_OBJ_ORIGINAL]
890 break; 883 || op->flag [FLAG_UNIQUE]
891 884 || op->flag [FLAG_OVERLAY_FLOOR]
892 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 885 || op->flag [FLAG_UNPAID]
893 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
894 || QUERY_FLAG (op, FLAG_UNIQUE)
895 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
896 || QUERY_FLAG (op, FLAG_UNPAID)
897 || op->is_alive ()) 886 || op->is_alive ())
898 ; // do not decay 887 ; // do not decay
899 else if (op->is_weapon ()) 888 else if (op->is_weapon ())
900 { 889 {
901 op->stats.dam--; 890 op->stats.dam--;
… …
926 || mat & M_LIQUID 915 || mat & M_LIQUID
927 || (mat & M_IRON && rndm (1, 5) == 1) 916 || (mat & M_IRON && rndm (1, 5) == 1)
928 || (mat & M_GLASS && rndm (1, 2) == 1) 917 || (mat & M_GLASS && rndm (1, 2) == 1)
929 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) 918 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
930 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) 919 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
931 || (mat & M_ICE && temp > 32)) 920 //|| (mat & M_ICE && temp > 32)
921 )
932 destroy = 1; 922 destroy = 1;
933 } 923 }
934 924
935 /* adjust overall chance below */ 925 /* adjust overall chance below */
936 if (destroy && rndm (0, 1)) 926 if (destroy && rndm (0, 1))
937 op->destroy (); 927 op->destroy ();
938 }
939}
940
941/*
942 * Updates every button on the map (by calling update_button() for them).
943 */
944void
945maptile::update_buttons ()
946{
947 for (oblinkpt *obp = buttons; obp; obp = obp->next)
948 for (objectlink *ol = obp->link; ol; ol = ol->next)
949 {
950 if (!ol->ob)
951 {
952 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
953 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
954 continue;
955 }
956
957 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
958 {
959 update_button (ol->ob);
960 break;
961 }
962 } 928 }
963} 929}
964 930
965/* 931/*
966 * This routine is supposed to find out the difficulty of the map. 932 * This routine is supposed to find out the difficulty of the map.
… …
980 sint64 total_exp = 0; 946 sint64 total_exp = 0;
981 947
982 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 948 for (mapspace *ms = spaces + size (); ms-- > spaces; )
983 for (object *op = ms->bot; op; op = op->above) 949 for (object *op = ms->bot; op; op = op->above)
984 { 950 {
985 if (QUERY_FLAG (op, FLAG_MONSTER)) 951 if (op->flag [FLAG_MONSTER])
986 { 952 {
987 total_exp += op->stats.exp; 953 total_exp += op->stats.exp;
988 monster_cnt++; 954 monster_cnt++;
989 } 955 }
990 956
991 if (QUERY_FLAG (op, FLAG_GENERATOR)) 957 if (op->flag [FLAG_GENERATOR])
992 { 958 {
993 total_exp += op->stats.exp; 959 total_exp += op->stats.exp;
994 960
995 if (archetype *at = op->other_arch) 961 if (archetype *at = op->other_arch)
996 { 962 {
… …
1023 * postive values make it darker, negative make it brighter 989 * postive values make it darker, negative make it brighter
1024 */ 990 */
1025int 991int
1026maptile::change_map_light (int change) 992maptile::change_map_light (int change)
1027{ 993{
1028 int new_level = darkness + change;
1029
1030 /* Nothing to do */ 994 /* Nothing to do */
1031 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 995 if (!change)
1032 return 0; 996 return 0;
1033 997
1034 /* inform all players on the map */ 998 /* inform all players on the map */
1035 if (change > 0) 999 if (change > 0)
1036 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 1000 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1037 else 1001 else
1038 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 1002 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1039 1003
1040 /* Do extra checking. since darkness is a unsigned value, 1004 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1041 * we need to be extra careful about negative values.
1042 * In general, the checks below are only needed if change
1043 * is not +/-1
1044 */
1045 if (new_level < 0)
1046 darkness = 0;
1047 else if (new_level >= MAX_DARKNESS)
1048 darkness = MAX_DARKNESS;
1049 else
1050 darkness = new_level;
1051 1005
1052 /* All clients need to get re-updated for the change */ 1006 /* All clients need to get re-updated for the change */
1053 update_all_map_los (this); 1007 update_all_map_los (this);
1054 1008
1055 return 1; 1009 return 1;
… …
1063 */ 1017 */
1064void 1018void
1065mapspace::update_ () 1019mapspace::update_ ()
1066{ 1020{
1067 object *last = 0; 1021 object *last = 0;
1068 uint8 flags = P_UPTODATE, anywhere = 0; 1022 uint8 flags = P_UPTODATE;
1069 sint8 light = 0; 1023 sint8 light = 0;
1070 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1024 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1025 uint64_t volume = 0;
1026 uint32_t items = 0;
1027 object *anywhere = 0;
1028 uint8_t middle_visibility = 0;
1071 1029
1072 //object *middle = 0; 1030 //object *middle = 0;
1073 //object *top = 0; 1031 //object *top = 0;
1074 //object *floor = 0; 1032 //object *floor = 0;
1075 // this seems to generate better code than using locals, above 1033 // this seems to generate better code than using locals, above
1076 object *&top = faces_obj[0] = 0; 1034 object *&top = faces_obj[0] = 0;
1077 object *&middle = faces_obj[1] = 0; 1035 object *&middle = faces_obj[1] = 0;
1078 object *&floor = faces_obj[2] = 0; 1036 object *&floor = faces_obj[2] = 0;
1037
1038 object::flags_t allflags; // all flags of all objects or'ed together
1079 1039
1080 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) 1040 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1081 { 1041 {
1082 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) 1042 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1083 light += tmp->glow_radius; 1043 light += tmp->glow_radius;
… …
1088 * 3 times each time the player moves, because many of the 1048 * 3 times each time the player moves, because many of the
1089 * functions the move_player calls eventualy call this. 1049 * functions the move_player calls eventualy call this.
1090 * 1050 *
1091 * Always put the player down for drawing. 1051 * Always put the player down for drawing.
1092 */ 1052 */
1093 if (!tmp->invisible) 1053 if (expect_true (!tmp->invisible))
1094 { 1054 {
1095 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1055 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1096 top = tmp; 1056 top = tmp;
1097 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1057 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1098 { 1058 {
1099 /* If we got a floor, that means middle and top were below it, 1059 /* If we got a floor, that means middle and top were below it,
1100 * so should not be visible, so we clear them. 1060 * so should not be visible, so we clear them.
1101 */ 1061 */
1102 middle = 0; 1062 middle = 0;
1103 top = 0; 1063 top = 0;
1104 floor = tmp; 1064 floor = tmp;
1065 volume = 0;
1066 items = 0;
1105 } 1067 }
1106 /* Flag anywhere have high priority */ 1068 else
1107 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1108 { 1069 {
1070 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1071 {
1072 ++items;
1073 volume += tmp->volume ();
1074 }
1075
1076 /* Flag anywhere have high priority */
1077 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1078 anywhere = tmp;
1079
1080 /* Find the highest visible face around. If equal
1081 * visibilities, we still want the one nearer to the
1082 * top
1083 */
1084 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1085 {
1086 middle_visibility = ::faces [tmp->face].visibility;
1109 middle = tmp; 1087 middle = tmp;
1110 anywhere = 1; 1088 }
1111 } 1089 }
1112
1113 /* Find the highest visible face around. If equal
1114 * visibilities, we still want the one nearer to the
1115 * top
1116 */
1117 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1118 middle = tmp;
1119 }
1120
1121 if (tmp == tmp->above)
1122 {
1123 LOG (llevError, "Error in structure of map\n");
1124 exit (-1);
1125 } 1090 }
1126 1091
1127 move_slow |= tmp->move_slow; 1092 move_slow |= tmp->move_slow;
1128 move_block |= tmp->move_block; 1093 move_block |= tmp->move_block;
1129 move_on |= tmp->move_on; 1094 move_on |= tmp->move_on;
1130 move_off |= tmp->move_off; 1095 move_off |= tmp->move_off;
1131 move_allow |= tmp->move_allow; 1096 move_allow |= tmp->move_allow;
1132 1097
1133 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1098 allflags |= tmp->flag;
1134 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1099
1135 if (tmp->type == PLAYER) flags |= P_PLAYER; 1100 if (tmp->type == PLAYER) flags |= P_PLAYER;
1136 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1101 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1137 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1138 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1139 } 1102 }
1103
1104 // FLAG_SEE_ANYWHERE takes precedence
1105 if (anywhere)
1106 middle = anywhere;
1107
1108 // ORing all flags together and checking them here is much faster
1109 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1110 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1111 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1112 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1140 1113
1141 this->light = min (light, MAX_LIGHT_RADIUS); 1114 this->light = min (light, MAX_LIGHT_RADIUS);
1142 this->flags_ = flags; 1115 this->flags_ = flags;
1143 this->move_block = move_block & ~move_allow; 1116 this->move_block = move_block & ~move_allow;
1144 this->move_on = move_on; 1117 this->move_on = move_on;
1145 this->move_off = move_off; 1118 this->move_off = move_off;
1146 this->move_slow = move_slow; 1119 this->move_slow = move_slow;
1120 this->volume_ = (volume + 1023) / 1024;
1121 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1147 1122
1148 /* At this point, we have a floor face (if there is a floor), 1123 /* At this point, we have a floor face (if there is a floor),
1149 * and the floor is set - we are not going to touch it at 1124 * and the floor is set - we are not going to touch it at
1150 * this point. 1125 * this point.
1151 * middle contains the highest visibility face. 1126 * middle contains the highest visibility face.
… …
1169 */ 1144 */
1170 1145
1171 for (object *tmp = last; tmp; tmp = tmp->below) 1146 for (object *tmp = last; tmp; tmp = tmp->below)
1172 { 1147 {
1173 /* Once we get to a floor, stop, since we already have a floor object */ 1148 /* Once we get to a floor, stop, since we already have a floor object */
1174 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1149 if (tmp->flag [FLAG_IS_FLOOR])
1175 break; 1150 break;
1176 1151
1177 /* If two top faces are already set, quit processing */ 1152 /* If two top faces are already set, quit processing */
1178 if (top && middle) 1153 if (top && middle)
1179 break; 1154 break;
… …
1217 faces_obj [1] = middle; 1192 faces_obj [1] = middle;
1218 faces_obj [2] = floor; 1193 faces_obj [2] = floor;
1219#endif 1194#endif
1220} 1195}
1221 1196
1222uint64 1197maptile *
1223mapspace::volume () const
1224{
1225 uint64 vol = 0;
1226
1227 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1228 vol += op->volume ();
1229
1230 return vol;
1231}
1232
1233bool
1234maptile::tile_available (int dir, bool load) 1198maptile::tile_available (int dir, bool load)
1235{ 1199{
1236 if (!tile_path[dir]) 1200 if (tile_path[dir])
1237 return 0; 1201 {
1238 1202 // map is there and we don't need to load it OR it's loaded => return what we have
1239 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1203 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1240 return 1; 1204 return tile_map[dir];
1241 1205
1206 // well, try to locate it then, if possible - maybe it's there already
1242 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1207 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1243 return 1; 1208 return tile_map[dir];
1209 }
1244 1210
1245 return 0; 1211 return 0;
1246} 1212}
1247 1213
1248/* this returns TRUE if the coordinates (x,y) are out of 1214/* this returns TRUE if the coordinates (x,y) are out of
… …
1357/** 1323/**
1358 * Return whether map2 is adjacent to map1. If so, store the distance from 1324 * Return whether map2 is adjacent to map1. If so, store the distance from
1359 * map1 to map2 in dx/dy. 1325 * map1 to map2 in dx/dy.
1360 */ 1326 */
1361int 1327int
1362adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy) 1328adjacent_map (maptile *map1, maptile *map2, int *dx, int *dy)
1363{ 1329{
1364 if (!map1 || !map2) 1330 if (!map1 || !map2)
1365 return 0; 1331 return 0;
1366 1332
1367 //TODO: this doesn't actually check correctly when intermediate maps are not loaded 1333 //TODO: this doesn't actually check correctly when intermediate maps are not loaded
… …
1369 if (map1 == map2) 1335 if (map1 == map2)
1370 { 1336 {
1371 *dx = 0; 1337 *dx = 0;
1372 *dy = 0; 1338 *dy = 0;
1373 } 1339 }
1374 else if (map1->tile_map[0] == map2) 1340 else if (map1->tile_available (TILE_NORTH, false) == map2)
1375 { /* up */ 1341 {
1376 *dx = 0; 1342 *dx = 0;
1377 *dy = -map2->height; 1343 *dy = -map2->height;
1378 } 1344 }
1379 else if (map1->tile_map[1] == map2) 1345 else if (map1->tile_available (TILE_EAST , false) == map2)
1380 { /* right */ 1346 {
1381 *dx = map1->width; 1347 *dx = map1->width;
1382 *dy = 0; 1348 *dy = 0;
1383 } 1349 }
1384 else if (map1->tile_map[2] == map2) 1350 else if (map1->tile_available (TILE_SOUTH, false) == map2)
1385 { /* down */ 1351 {
1386 *dx = 0; 1352 *dx = 0;
1387 *dy = map1->height; 1353 *dy = map1->height;
1388 } 1354 }
1389 else if (map1->tile_map[3] == map2) 1355 else if (map1->tile_available (TILE_WEST , false) == map2)
1390 { /* left */ 1356 {
1391 *dx = -map2->width; 1357 *dx = -map2->width;
1392 *dy = 0; 1358 *dy = 0;
1393 } 1359 }
1394 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[1] == map2) 1360 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_EAST , false) == map2)
1395 { /* up right */ 1361 { /* up right */
1396 *dx = map1->tile_map[0]->width; 1362 *dx = +map1->tile_map[TILE_NORTH]->width;
1397 *dy = -map1->tile_map[0]->height; 1363 *dy = -map1->tile_map[TILE_NORTH]->height;
1398 } 1364 }
1399 else if (map1->tile_map[0] && map1->tile_map[0]->tile_map[3] == map2) 1365 else if (map1->tile_map[TILE_NORTH] && map1->tile_map[TILE_NORTH]->tile_available (TILE_WEST , false) == map2)
1400 { /* up left */ 1366 { /* up left */
1401 *dx = -map2->width; 1367 *dx = -map2->width;
1402 *dy = -map1->tile_map[0]->height; 1368 *dy = -map1->tile_map[TILE_NORTH]->height;
1403 } 1369 }
1404 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[0] == map2) 1370 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_NORTH, false) == map2)
1405 { /* right up */ 1371 { /* right up */
1406 *dx = map1->width; 1372 *dx = +map1->width;
1407 *dy = -map2->height; 1373 *dy = -map2->height;
1408 } 1374 }
1409 else if (map1->tile_map[1] && map1->tile_map[1]->tile_map[2] == map2) 1375 else if (map1->tile_map[TILE_EAST ] && map1->tile_map[TILE_EAST ]->tile_available (TILE_SOUTH, false) == map2)
1410 { /* right down */ 1376 { /* right down */
1411 *dx = map1->width; 1377 *dx = +map1->width;
1412 *dy = map1->tile_map[1]->height; 1378 *dy = +map1->tile_map[TILE_EAST]->height;
1413 } 1379 }
1414 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[1] == map2) 1380 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_EAST , false) == map2)
1415 { /* down right */ 1381 { /* down right */
1416 *dx = map1->tile_map[2]->width; 1382 *dx = +map1->tile_map[TILE_SOUTH]->width;
1417 *dy = map1->height; 1383 *dy = +map1->height;
1418 } 1384 }
1419 else if (map1->tile_map[2] && map1->tile_map[2]->tile_map[3] == map2) 1385 else if (map1->tile_map[TILE_SOUTH] && map1->tile_map[TILE_SOUTH]->tile_available (TILE_WEST , false) == map2)
1420 { /* down left */ 1386 { /* down left */
1421 *dx = -map2->width; 1387 *dx = -map2->width;
1422 *dy = map1->height; 1388 *dy = +map1->height;
1423 } 1389 }
1424 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[0] == map2) 1390 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_NORTH, false) == map2)
1425 { /* left up */ 1391 { /* left up */
1426 *dx = -map1->tile_map[3]->width; 1392 *dx = -map1->tile_map[TILE_WEST]->width;
1427 *dy = -map2->height; 1393 *dy = -map2->height;
1428 } 1394 }
1429 else if (map1->tile_map[3] && map1->tile_map[3]->tile_map[2] == map2) 1395 else if (map1->tile_map[TILE_WEST ] && map1->tile_map[TILE_WEST ]->tile_available (TILE_SOUTH, false) == map2)
1430 { /* left down */ 1396 { /* left down */
1431 *dx = -map1->tile_map[3]->width; 1397 *dx = -map1->tile_map[TILE_WEST]->width;
1432 *dy = map1->tile_map[3]->height; 1398 *dy = +map1->tile_map[TILE_WEST]->height;
1433 } 1399 }
1434 else 1400 else
1435 return 0; 1401 return 0;
1436 1402
1437 return 1; 1403 return 1;
… …
1473 * 1439 *
1474 * currently, the only flag supported (0x1) is don't translate for 1440 * currently, the only flag supported (0x1) is don't translate for
1475 * closest body part of 'op1' 1441 * closest body part of 'op1'
1476 */ 1442 */
1477void 1443void
1478get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1444get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1479{ 1445{
1480 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1446 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1481 { 1447 {
1482 /* be conservative and fill in _some_ data */ 1448 /* be conservative and fill in _some_ data */
1483 retval->distance = 10000; 1449 retval->distance = 10000;
1484 retval->distance_x = 10000; 1450 retval->distance_x = 10000;
1485 retval->distance_y = 10000; 1451 retval->distance_y = 10000;
1486 retval->direction = 0; 1452 retval->direction = 0;
1487 retval->part = 0; 1453 retval->part = 0;
1488 } 1454 }
1489 else 1455 else
1490 { 1456 {
1491 object *best;
1492
1493 retval->distance_x += op2->x - op1->x; 1457 retval->distance_x += op2->x - op1->x;
1494 retval->distance_y += op2->y - op1->y; 1458 retval->distance_y += op2->y - op1->y;
1495 1459
1496 best = op1; 1460 object *best = op1;
1461
1497 /* If this is multipart, find the closest part now */ 1462 /* If this is multipart, find the closest part now */
1498 if (!(flags & 0x1) && op1->more) 1463 if (!(flags & 1) && op1->more)
1499 { 1464 {
1500 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1465 int best_distance = idistance (retval->distance_x, retval->distance_y);
1501 1466
1502 /* we just take the offset of the piece to head to figure 1467 /* we just take the offset of the piece to head to figure
1503 * distance instead of doing all that work above again 1468 * distance instead of doing all that work above again
1504 * since the distance fields we set above are positive in the 1469 * since the distance fields we set above are positive in the
1505 * same axis as is used for multipart objects, the simply arithmetic 1470 * same axis as is used for multipart objects, the simply arithmetic
1506 * below works. 1471 * below works.
1507 */ 1472 */
1508 for (object *tmp = op1->more; tmp; tmp = tmp->more) 1473 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1509 { 1474 {
1510 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1475 int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1511 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1476
1512 if (tmpi < best_distance) 1477 if (tmpi < best_distance)
1513 { 1478 {
1514 best_distance = tmpi; 1479 best_distance = tmpi;
1515 best = tmp; 1480 best = tmp;
1516 } 1481 }
1517 } 1482 }
1518 1483
1519 if (best != op1) 1484 if (best != op1)
1520 { 1485 {
1521 retval->distance_x += op1->x - best->x; 1486 retval->distance_x += op1->x - best->x;
1522 retval->distance_y += op1->y - best->y; 1487 retval->distance_y += op1->y - best->y;
1523 } 1488 }
1524 } 1489 }
1525 1490
1526 retval->part = best; 1491 retval->part = best;
1527 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); 1492 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1528 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1493 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1529 } 1494 }
1530} 1495}
1531 1496
1532/* this is basically the same as get_rangevector above, but instead of 1497/* this is basically the same as get_rangevector above, but instead of
1533 * the first parameter being an object, it instead is the map 1498 * the first parameter being an object, it instead is the map
… …
1538 * be more consistant with the above function and also in case they are needed 1503 * be more consistant with the above function and also in case they are needed
1539 * for something in the future. Also, since no object is pasted, the best 1504 * for something in the future. Also, since no object is pasted, the best
1540 * field of the rv_vector is set to NULL. 1505 * field of the rv_vector is set to NULL.
1541 */ 1506 */
1542void 1507void
1543get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) 1508get_rangevector_from_mapcoord (maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1544{ 1509{
1545 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1510 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1546 { 1511 {
1547 /* be conservative and fill in _some_ data */ 1512 /* be conservative and fill in _some_ data */
1548 retval->distance = 100000; 1513 retval->distance = 100000;
1549 retval->distance_x = 32767; 1514 retval->distance_x = 32767;
1550 retval->distance_y = 32767; 1515 retval->distance_y = 32767;
1551 retval->direction = 0; 1516 retval->direction = 0;
1552 retval->part = 0; 1517 retval->part = 0;
1553 } 1518 }
1554 else 1519 else
1555 { 1520 {
1556 retval->distance_x += op2->x - x; 1521 retval->distance_x += op2->x - x;
1557 retval->distance_y += op2->y - y; 1522 retval->distance_y += op2->y - y;
1558 1523
1559 retval->part = NULL; 1524 retval->part = 0;
1560 retval->distance = idistance (retval->distance_x, retval->distance_y); 1525 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1561 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1526 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1562 } 1527 }
1563} 1528}
1564 1529
1565/* Returns true of op1 and op2 are effectively on the same map 1530/* Returns true of op1 and op2 are effectively on the same map
1566 * (as related to map tiling). Note that this looks for a path from 1531 * (as related to map tiling). Note that this looks for a path from
… …
1576 int dx, dy; 1541 int dx, dy;
1577 1542
1578 return adjacent_map (op1->map, op2->map, &dx, &dy); 1543 return adjacent_map (op1->map, op2->map, &dx, &dy);
1579} 1544}
1580 1545
1546//-GPL
1547
1581object * 1548object *
1582maptile::insert (object *op, int x, int y, object *originator, int flags) 1549maptile::insert (object *op, int x, int y, object *originator, int flags)
1583{ 1550{
1584 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1551 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1585} 1552}
… …
1596 if (default_region) 1563 if (default_region)
1597 return default_region; 1564 return default_region;
1598 1565
1599 return ::region::default_region (); 1566 return ::region::default_region ();
1600} 1567}
1568
1569//+GPL
1601 1570
1602/* picks a random object from a style map. 1571/* picks a random object from a style map.
1603 */ 1572 */
1604object * 1573object *
1605maptile::pick_random_object (rand_gen &gen) const 1574maptile::pick_random_object (rand_gen &gen) const
… …
1612 */ 1581 */
1613 for (int i = 1000; --i;) 1582 for (int i = 1000; --i;)
1614 { 1583 {
1615 object *pick = at (gen (width), gen (height)).bot; 1584 object *pick = at (gen (width), gen (height)).bot;
1616 1585
1617 // do not prefer big monsters just because they are big. 1586 // must be head: do not prefer big monsters just because they are big.
1618 if (pick && pick->is_head ()) 1587 if (pick && pick->is_head ())
1619 return pick->head_ (); 1588 return pick;
1620 } 1589 }
1621 1590
1622 // instead of crashing in the unlikely(?) case, try to return *something* 1591 // instead of crashing in the unlikely(?) case, try to return *something*
1623 return archetype::find ("bug"); 1592 return archetype::find (shstr_bug);
1624} 1593}
1594
1595//-GPL
1625 1596
1626void 1597void
1627maptile::play_sound (faceidx sound, int x, int y) const 1598maptile::play_sound (faceidx sound, int x, int y) const
1628{ 1599{
1629 if (!sound) 1600 if (!sound)
… …
1640 if (distance <= MAX_SOUND_DISTANCE) 1611 if (distance <= MAX_SOUND_DISTANCE)
1641 ns->play_sound (sound, dx, dy); 1612 ns->play_sound (sound, dx, dy);
1642 } 1613 }
1643} 1614}
1644 1615
1616void
1617maptile::say_msg (const char *msg, int x, int y) const
1618{
1619 for_all_players (pl)
1620 if (client *ns = pl->ns)
1621 {
1622 int dx = x - pl->ob->x;
1623 int dy = y - pl->ob->y;
1624
1625 int distance = idistance (dx, dy);
1626
1627 if (distance <= MAX_SOUND_DISTANCE)
1628 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1629 }
1630}
1631
1632dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1633
1634static void
1635split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1636{
1637 // clip to map to the left
1638 if (x0 < 0)
1639 {
1640 if (maptile *tile = m->tile_available (TILE_WEST, 1))
1641 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1642
1643 if (x1 < 0) // entirely to the left
1644 return;
1645
1646 x0 = 0;
1647 }
1648
1649 // clip to map to the right
1650 if (x1 > m->width)
1651 {
1652 if (maptile *tile = m->tile_available (TILE_EAST, 1))
1653 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1654
1655 if (x0 > m->width) // entirely to the right
1656 return;
1657
1658 x1 = m->width;
1659 }
1660
1661 // clip to map above
1662 if (y0 < 0)
1663 {
1664 if (maptile *tile = m->tile_available (TILE_NORTH, 1))
1665 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1666
1667 if (y1 < 0) // entirely above
1668 return;
1669
1670 y0 = 0;
1671 }
1672
1673 // clip to map below
1674 if (y1 > m->height)
1675 {
1676 if (maptile *tile = m->tile_available (TILE_SOUTH, 1))
1677 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1678
1679 if (y0 > m->height) // entirely below
1680 return;
1681
1682 y1 = m->height;
1683 }
1684
1685 // if we get here, the rect is within the current map
1686 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1687
1688 r->m = m;
1689 r->x0 = x0;
1690 r->y0 = y0;
1691 r->x1 = x1;
1692 r->y1 = y1;
1693 r->dx = dx;
1694 r->dy = dy;
1695}
1696
1697maprect *
1698maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1699{
1700 buf.clear ();
1701
1702 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1703
1704 // add end marker
1705 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1706 r->m = 0;
1707
1708 return (maprect *)buf.linearise ();
1709}
1710

Diff Legend

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