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.143 by root, Sun May 18 19:53:07 2008 UTC vs.
Revision 1.193 by root, Sun Apr 18 12:50:07 2010 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 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
28#include "loader.h"
29
30#include "path.h" 28#include "path.h"
29
30//+GPL
31
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)
34 * it will also do map translation for tiled maps, returning 36 * it will also do map translation for tiled maps, returning
35 * new values into newmap, nx, and ny. Any and all of those 37 * new values into newmap, nx, and ny. Any and all of those
… …
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, "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)
… …
259 226
260 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 227 for (mapspace *ms = spaces + size (); ms-- > spaces; )
261 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 228 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
262 tmp->flag [flag] = value; 229 tmp->flag [flag] = value;
263} 230}
231
232void
233maptile::post_load_original ()
234{
235 if (!spaces)
236 return;
237
238 set_object_flag (FLAG_OBJ_ORIGINAL);
239
240 for (mapspace *ms = spaces + size (); ms-- > spaces; )
241 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
242 INVOKE_OBJECT (RESET, tmp);
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
264 259
265/* 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
266 * 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
267 * 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
268 * they are saved). 263 * they are saved).
… …
296 op = op->above; 291 op = op->above;
297 } 292 }
298 } 293 }
299} 294}
300 295
296//-GPL
297
301/* 298/*
302 * 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
303 * file pointer. 300 * file pointer.
304 */ 301 */
305bool 302bool
… …
321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height)) 318 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 { 319 {
323 // we insert manually because 320 // we insert manually because
324 // a) its way faster 321 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that 322 // b) we remove manually, too, and there are good reasons for that
326 // c) its correct 323 // c) it's correct
327 mapspace &ms = at (op->x, op->y); 324 mapspace &ms = at (op->x, op->y);
328 325
329 op->flag [FLAG_REMOVED] = false; 326 op->flag [FLAG_REMOVED] = false;
330 327
331 op->above = 0; 328 op->above = 0;
332 op->below = ms.top; 329 op->below = ms.top;
333 330
334 if (ms.top)
335 ms.top->above = op; 331 *(ms.top ? &ms.top->above : &ms.bot) = op;
336 else
337 ms.bot = op;
338 332
339 ms.top = op; 333 ms.top = op;
340 ms.flags_ = 0; 334 ms.flags_ = 0;
341 } 335 }
342 else 336 else
… …
427 return false; 421 return false;
428 422
429 return freezer.save (path); 423 return freezer.save (path);
430} 424}
431 425
432maptile::maptile () 426void
427maptile::init ()
433{ 428{
434 in_memory = MAP_SWAPPED; 429 in_memory = MAP_SWAPPED;
435 430
436 /* The maps used to pick up default x and y values from the 431 /* The maps used to pick up default x and y values from the
437 * map archetype. Mimic that behaviour. 432 * map archetype. Mimic that behaviour.
438 */ 433 */
439 width = 16; 434 width = 16;
440 height = 16; 435 height = 16;
441 timeout = 300; 436 timeout = 300;
442 max_nrof = 1000; // 1000 items of anything 437 max_items = MAX_ITEM_PER_ACTION;
443 max_volume = 2000000; // 2m³ 438 max_volume = 2000000; // 2m³
444}
445
446maptile::maptile (int w, int h)
447{
448 in_memory = MAP_SWAPPED;
449
450 width = w;
451 height = h;
452 reset_timeout = 0; 439 reset_timeout = 0;
453 timeout = 300;
454 enter_x = 0; 440 enter_x = 0;
455 enter_y = 0; 441 enter_y = 0;
442}
443
444maptile::maptile ()
445{
446 init ();
447}
448
449maptile::maptile (int w, int h)
450{
451 init ();
452
453 width = w;
454 height = h;
456 455
457 alloc (); 456 alloc ();
458} 457}
459 458
460/* 459/*
… …
468 if (spaces) 467 if (spaces)
469 return; 468 return;
470 469
471 spaces = salloc0<mapspace> (size ()); 470 spaces = salloc0<mapspace> (size ());
472} 471}
472
473//+GPL
473 474
474/* Takes a string from a map definition and outputs a pointer to the array of shopitems 475/* Takes a string from a map definition and outputs a pointer to the array of shopitems
475 * corresponding to that string. Memory is allocated for this, it must be freed 476 * corresponding to that string. Memory is allocated for this, it must be freed
476 * at a later date. 477 * at a later date.
477 * Called by parse_map_headers below. 478 * Called by parse_map_headers below.
… …
554 return items; 555 return items;
555} 556}
556 557
557/* opposite of parse string, this puts the string that was originally fed in to 558/* opposite of parse string, this puts the string that was originally fed in to
558 * the map (or something equivilent) into output_string. */ 559 * the map (or something equivilent) into output_string. */
559static void 560static const char *
560print_shop_string (maptile *m, char *output_string) 561print_shop_string (maptile *m)
561{ 562{
562 int i; 563 static dynbuf_text buf; buf.clear ();
563 char tmp[MAX_BUF];
564 564
565 strcpy (output_string, "");
566 for (i = 0; i < m->shopitems[0].index; i++) 565 for (int i = 0; i < m->shopitems[0].index; i++)
567 { 566 {
568 if (m->shopitems[i].typenum) 567 if (m->shopitems[i].typenum)
569 { 568 {
570 if (m->shopitems[i].strength) 569 if (m->shopitems[i].strength)
571 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 570 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
572 else 571 else
573 sprintf (tmp, "%s;", m->shopitems[i].name); 572 buf.printf ("%s;", m->shopitems[i].name);
574 } 573 }
575 else 574 else
576 { 575 {
577 if (m->shopitems[i].strength) 576 if (m->shopitems[i].strength)
578 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 577 buf.printf ("*:%d;", m->shopitems[i].strength);
579 else 578 else
580 sprintf (tmp, "*"); 579 buf.printf ("*");
581 } 580 }
582
583 strcat (output_string, tmp);
584 } 581 }
582
583 return buf;
585} 584}
585
586//-GPL
586 587
587/* This loads the header information of the map. The header 588/* This loads the header information of the map. The header
588 * contains things like difficulty, size, timeout, etc. 589 * contains things like difficulty, size, timeout, etc.
589 * this used to be stored in the map object, but with the 590 * this used to be stored in the map object, but with the
590 * addition of tiling, fields beyond that easily named in an 591 * addition of tiling, fields beyond that easily named in an
… …
631 case KW_shopgreed: thawer.get (shopgreed); break; 632 case KW_shopgreed: thawer.get (shopgreed); break;
632 case KW_shopmin: thawer.get (shopmin); break; 633 case KW_shopmin: thawer.get (shopmin); break;
633 case KW_shopmax: thawer.get (shopmax); break; 634 case KW_shopmax: thawer.get (shopmax); break;
634 case KW_shoprace: thawer.get (shoprace); break; 635 case KW_shoprace: thawer.get (shoprace); break;
635 case KW_outdoor: thawer.get (outdoor); break; 636 case KW_outdoor: thawer.get (outdoor); break;
636 case KW_temp: thawer.get (temp); break;
637 case KW_pressure: thawer.get (pressure); break;
638 case KW_humid: thawer.get (humid); break;
639 case KW_windspeed: thawer.get (windspeed); break;
640 case KW_winddir: thawer.get (winddir); break;
641 case KW_sky: thawer.get (sky); break;
642 637
643 case KW_per_player: thawer.get (per_player); break; 638 case KW_per_player: thawer.get (per_player); break;
644 case KW_per_party: thawer.get (per_party); break; 639 case KW_per_party: thawer.get (per_party); break;
645 case KW_no_reset: thawer.get (no_reset); break; 640 case KW_no_reset: thawer.get (no_reset); break;
646 case KW_no_drop: thawer.get (no_drop); break; 641 case KW_no_drop: thawer.get (no_drop); break;
… …
671 case KW_end: 666 case KW_end:
672 thawer.next (); 667 thawer.next ();
673 return true; 668 return true;
674 669
675 default: 670 default:
676 if (!thawer.parse_error ("map", 0)) 671 if (!thawer.parse_error ("map"))
677 return false; 672 return false;
678 break; 673 break;
679 } 674 }
680 675
681 thawer.next (); 676 thawer.next ();
682 } 677 }
683 678
684 abort (); 679 abort ();
685} 680}
681
682//+GPL
686 683
687/****************************************************************************** 684/******************************************************************************
688 * This is the start of unique map handling code 685 * This is the start of unique map handling code
689 *****************************************************************************/ 686 *****************************************************************************/
690 687
… …
697 int unique = 0; 694 int unique = 0;
698 for (object *op = spaces [i].bot; op; ) 695 for (object *op = spaces [i].bot; op; )
699 { 696 {
700 object *above = op->above; 697 object *above = op->above;
701 698
702 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 699 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
703 unique = 1; 700 unique = 1;
704 701
705 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 702 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
706 {
707 op->destroy_inv (false);
708 op->destroy (); 703 op->destroy ();
709 }
710 704
711 op = above; 705 op = above;
712 } 706 }
713 } 707 }
714} 708}
715 709
710//-GPL
711
716bool 712bool
717maptile::_save_header (object_freezer &freezer) 713maptile::_save_header (object_freezer &freezer)
718{ 714{
719#define MAP_OUT(k) freezer.put (KW_ ## k, k) 715#define MAP_OUT(k) freezer.put (KW(k), k)
720#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 716#define MAP_OUT2(k,v) freezer.put (KW(k), v)
721 717
722 MAP_OUT2 (arch, "map"); 718 MAP_OUT2 (arch, CS(map));
723 719
724 if (name) MAP_OUT (name); 720 if (name) MAP_OUT (name);
725 MAP_OUT (swap_time); 721 MAP_OUT (swap_time);
726 MAP_OUT (reset_time); 722 MAP_OUT (reset_time);
727 MAP_OUT (reset_timeout); 723 MAP_OUT (reset_timeout);
728 MAP_OUT (fixed_resettime); 724 MAP_OUT (fixed_resettime);
729 MAP_OUT (no_reset); 725 MAP_OUT (no_reset);
730 MAP_OUT (no_drop); 726 MAP_OUT (no_drop);
731 MAP_OUT (difficulty); 727 MAP_OUT (difficulty);
732
733 if (default_region) MAP_OUT2 (region, default_region->name); 728 if (default_region) MAP_OUT2 (region, default_region->name);
734 729
735 if (shopitems) 730 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
736 {
737 char shop[MAX_BUF];
738 print_shop_string (this, shop);
739 MAP_OUT2 (shopitems, shop);
740 }
741
742 MAP_OUT (shopgreed); 731 MAP_OUT (shopgreed);
743 MAP_OUT (shopmin); 732 MAP_OUT (shopmin);
744 MAP_OUT (shopmax); 733 MAP_OUT (shopmax);
745 if (shoprace) MAP_OUT (shoprace); 734 if (shoprace) MAP_OUT (shoprace);
746 MAP_OUT (darkness); 735
747 MAP_OUT (width); 736 MAP_OUT (width);
748 MAP_OUT (height); 737 MAP_OUT (height);
749 MAP_OUT (enter_x); 738 MAP_OUT (enter_x);
750 MAP_OUT (enter_y); 739 MAP_OUT (enter_y);
751 740 MAP_OUT (darkness);
752 if (msg) freezer.put (KW_msg , KW_endmsg , msg);
753 if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
754
755 MAP_OUT (outdoor); 741 MAP_OUT (outdoor);
756 MAP_OUT (temp); 742
757 MAP_OUT (pressure); 743 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
758 MAP_OUT (humid); 744 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
759 MAP_OUT (windspeed);
760 MAP_OUT (winddir);
761 MAP_OUT (sky);
762 745
763 MAP_OUT (per_player); 746 MAP_OUT (per_player);
764 MAP_OUT (per_party); 747 MAP_OUT (per_party);
765 748
766 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 749 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
767 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 750 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
768 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 751 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
769 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 752 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
770 753
771 freezer.put (this); 754 freezer.put (this);
772 freezer.put (KW_end); 755 freezer.put (KW(end));
773 756
774 return true; 757 return true;
775} 758}
776 759
777bool 760bool
… …
782 if (!_save_header (freezer)) 765 if (!_save_header (freezer))
783 return false; 766 return false;
784 767
785 return freezer.save (path); 768 return freezer.save (path);
786} 769}
770
771//+GPL
787 772
788/* 773/*
789 * Remove and free all objects in the given map. 774 * Remove and free all objects in the given map.
790 */ 775 */
791void 776void
… …
802 787
803 op->flag [FLAG_REMOVED] = true; 788 op->flag [FLAG_REMOVED] = true;
804 789
805 object *head = op->head_ (); 790 object *head = op->head_ ();
806 if (op == head) 791 if (op == head)
807 {
808 op->destroy_inv (false);
809 op->destroy (); 792 op->destroy ();
810 }
811 else if (head->map != op->map) 793 else if (head->map != op->map)
812 { 794 {
813 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ()); 795 LOG (llevDebug, "bad luck for object crossing map borders: %s", head->debug_desc ());
814 head->destroy (); 796 head->destroy ();
815 } 797 }
… …
863 845
864 clear (); 846 clear ();
865} 847}
866 848
867/* decay and destroy perishable items in a map */ 849/* decay and destroy perishable items in a map */
850// TODO: should be done regularly, not on map load?
868void 851void
869maptile::do_decay_objects () 852maptile::do_decay_objects ()
870{ 853{
871 if (!spaces) 854 if (!spaces)
872 return; 855 return;
… …
874 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 857 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 for (object *above, *op = ms->bot; op; op = above) 858 for (object *above, *op = ms->bot; op; op = above)
876 { 859 {
877 above = op->above; 860 above = op->above;
878 861
862 // do not decay anything above unique floor tiles (yet :)
863 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
864 break;
865
879 bool destroy = 0; 866 bool destroy = 0;
880 867
881 // do not decay anything above unique floor tiles (yet :) 868 if (op->flag [FLAG_IS_FLOOR]
882 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 869 || op->flag [FLAG_OBJ_ORIGINAL]
883 break; 870 || op->flag [FLAG_UNIQUE]
884 871 || op->flag [FLAG_OVERLAY_FLOOR]
885 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 872 || op->flag [FLAG_UNPAID]
886 || QUERY_FLAG (op, FLAG_OBJ_ORIGINAL)
887 || QUERY_FLAG (op, FLAG_UNIQUE)
888 || QUERY_FLAG (op, FLAG_OVERLAY_FLOOR)
889 || QUERY_FLAG (op, FLAG_UNPAID)
890 || op->is_alive ()) 873 || op->is_alive ())
891 ; // do not decay 874 ; // do not decay
892 else if (op->is_weapon ()) 875 else if (op->is_weapon ())
893 { 876 {
894 op->stats.dam--; 877 op->stats.dam--;
… …
919 || mat & M_LIQUID 902 || mat & M_LIQUID
920 || (mat & M_IRON && rndm (1, 5) == 1) 903 || (mat & M_IRON && rndm (1, 5) == 1)
921 || (mat & M_GLASS && rndm (1, 2) == 1) 904 || (mat & M_GLASS && rndm (1, 2) == 1)
922 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) 905 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
923 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) 906 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
924 || (mat & M_ICE && temp > 32)) 907 //|| (mat & M_ICE && temp > 32)
908 )
925 destroy = 1; 909 destroy = 1;
926 } 910 }
927 911
928 /* adjust overall chance below */ 912 /* adjust overall chance below */
929 if (destroy && rndm (0, 1)) 913 if (destroy && rndm (0, 1))
930 op->destroy (); 914 op->destroy ();
931 }
932}
933
934/*
935 * Updates every button on the map (by calling update_button() for them).
936 */
937void
938maptile::update_buttons ()
939{
940 for (oblinkpt *obp = buttons; obp; obp = obp->next)
941 for (objectlink *ol = obp->link; ol; ol = ol->next)
942 {
943 if (!ol->ob)
944 {
945 LOG (llevError, "Internal error in update_button (%s (%dx%d), connected %ld).\n",
946 ol->ob ? (const char *) ol->ob->name : "null", ol->ob ? ol->ob->x : -1, ol->ob ? ol->ob->y : -1, obp->value);
947 continue;
948 }
949
950 if (ol->ob->type == BUTTON || ol->ob->type == PEDESTAL)
951 {
952 update_button (ol->ob);
953 break;
954 }
955 } 915 }
956} 916}
957 917
958/* 918/*
959 * This routine is supposed to find out the difficulty of the map. 919 * This routine is supposed to find out the difficulty of the map.
960 * difficulty does not have a lot to do with character level, 920 * difficulty does not have a lot to do with character level,
961 * but does have a lot to do with treasure on the map. 921 * but does have a lot to do with treasure on the map.
962 * 922 *
963 * Difficulty can now be set by the map creature. If the value stored 923 * Difficulty can now be set by the map creator. If the value stored
964 * in the map is zero, then use this routine. Maps should really 924 * in the map is zero, then use this routine. Maps should really
965 * have a difficulty set than using this function - human calculation 925 * have a difficulty set rather than using this function - human calculation
966 * is much better than this functions guesswork. 926 * is much better than this function's guesswork.
967 */ 927 */
968int 928int
969maptile::estimate_difficulty () const 929maptile::estimate_difficulty () const
970{ 930{
971 long monster_cnt = 0; 931 long monster_cnt = 0;
… …
973 sint64 total_exp = 0; 933 sint64 total_exp = 0;
974 934
975 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 935 for (mapspace *ms = spaces + size (); ms-- > spaces; )
976 for (object *op = ms->bot; op; op = op->above) 936 for (object *op = ms->bot; op; op = op->above)
977 { 937 {
978 if (QUERY_FLAG (op, FLAG_MONSTER)) 938 if (op->flag [FLAG_MONSTER])
979 { 939 {
980 total_exp += op->stats.exp; 940 total_exp += op->stats.exp;
981 monster_cnt++; 941 monster_cnt++;
982 } 942 }
983 943
984 if (QUERY_FLAG (op, FLAG_GENERATOR)) 944 if (op->flag [FLAG_GENERATOR])
985 { 945 {
986 total_exp += op->stats.exp; 946 total_exp += op->stats.exp;
987 947
988 if (archetype *at = op->other_arch) 948 if (archetype *at = op->other_arch)
989 { 949 {
… …
1016 * postive values make it darker, negative make it brighter 976 * postive values make it darker, negative make it brighter
1017 */ 977 */
1018int 978int
1019maptile::change_map_light (int change) 979maptile::change_map_light (int change)
1020{ 980{
1021 int new_level = darkness + change;
1022
1023 /* Nothing to do */ 981 /* Nothing to do */
1024 if (!change || (new_level <= 0 && darkness == 0) || (new_level >= MAX_DARKNESS && darkness >= MAX_DARKNESS)) 982 if (!change)
1025 return 0; 983 return 0;
1026 984
1027 /* inform all players on the map */ 985 /* inform all players on the map */
1028 if (change > 0) 986 if (change > 0)
1029 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker."); 987 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes darker.");
1030 else 988 else
1031 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter."); 989 new_info_map (NDI_BLACK | NDI_UNIQUE, this, "It becomes brighter.");
1032 990
1033 /* Do extra checking. since darkness is a unsigned value, 991 darkness = clamp (darkness + change, -MAX_DARKNESS, MAX_DARKNESS);
1034 * we need to be extra careful about negative values.
1035 * In general, the checks below are only needed if change
1036 * is not +/-1
1037 */
1038 if (new_level < 0)
1039 darkness = 0;
1040 else if (new_level >= MAX_DARKNESS)
1041 darkness = MAX_DARKNESS;
1042 else
1043 darkness = new_level;
1044 992
1045 /* All clients need to get re-updated for the change */ 993 /* All clients need to get re-updated for the change */
1046 update_all_map_los (this); 994 update_all_map_los (this);
1047 995
1048 return 1; 996 return 1;
… …
1056 */ 1004 */
1057void 1005void
1058mapspace::update_ () 1006mapspace::update_ ()
1059{ 1007{
1060 object *last = 0; 1008 object *last = 0;
1061 uint8 flags = P_UPTODATE, light = 0, anywhere = 0; 1009 uint8 flags = P_UPTODATE;
1010 sint8 light = 0;
1062 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1011 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1012 uint64_t volume = 0;
1013 uint32_t items = 0;
1014 object *anywhere = 0;
1015 uint8_t middle_visibility = 0;
1063 1016
1064 //object *middle = 0; 1017 //object *middle = 0;
1065 //object *top = 0; 1018 //object *top = 0;
1066 //object *floor = 0; 1019 //object *floor = 0;
1067 // this seems to generate better code than using locals, above 1020 // this seems to generate better code than using locals, above
1068 object *&top = faces_obj[0] = 0; 1021 object *&top = faces_obj[0] = 0;
1069 object *&middle = faces_obj[1] = 0; 1022 object *&middle = faces_obj[1] = 0;
1070 object *&floor = faces_obj[2] = 0; 1023 object *&floor = faces_obj[2] = 0;
1071 1024
1025 object::flags_t allflags; // all flags of all objects or'ed together
1026
1072 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) 1027 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1073 { 1028 {
1074 /* This could be made additive I guess (two lights better than 1029 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1075 * one). But if so, it shouldn't be a simple additive - 2
1076 * light bulbs do not illuminate twice as far as once since
1077 * it is a dissapation factor that is cubed.
1078 */
1079 light = max (light, tmp->glow_radius); 1030 light += tmp->glow_radius;
1080 1031
1081 /* This call is needed in order to update objects the player 1032 /* This call is needed in order to update objects the player
1082 * is standing in that have animations (ie, grass, fire, etc). 1033 * is standing in that have animations (ie, grass, fire, etc).
1083 * However, it also causes the look window to be re-drawn 1034 * However, it also causes the look window to be re-drawn
1084 * 3 times each time the player moves, because many of the 1035 * 3 times each time the player moves, because many of the
1085 * functions the move_player calls eventualy call this. 1036 * functions the move_player calls eventualy call this.
1086 * 1037 *
1087 * Always put the player down for drawing. 1038 * Always put the player down for drawing.
1088 */ 1039 */
1089 if (!tmp->invisible) 1040 if (expect_true (!tmp->invisible))
1090 { 1041 {
1091 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1042 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1092 top = tmp; 1043 top = tmp;
1093 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1044 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1094 { 1045 {
1095 /* If we got a floor, that means middle and top were below it, 1046 /* If we got a floor, that means middle and top were below it,
1096 * so should not be visible, so we clear them. 1047 * so should not be visible, so we clear them.
1097 */ 1048 */
1098 middle = 0; 1049 middle = 0;
1099 top = 0; 1050 top = 0;
1100 floor = tmp; 1051 floor = tmp;
1052 volume = 0;
1053 items = 0;
1101 } 1054 }
1102 /* Flag anywhere have high priority */ 1055 else
1103 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1104 { 1056 {
1057 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1058 {
1059 ++items;
1060 volume += tmp->volume ();
1061 }
1062
1063 /* Flag anywhere have high priority */
1064 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1065 anywhere = tmp;
1066
1067 /* Find the highest visible face around. If equal
1068 * visibilities, we still want the one nearer to the
1069 * top
1070 */
1071 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1072 {
1073 middle_visibility = ::faces [tmp->face].visibility;
1105 middle = tmp; 1074 middle = tmp;
1106 anywhere = 1; 1075 }
1107 } 1076 }
1108
1109 /* Find the highest visible face around. If equal
1110 * visibilities, we still want the one nearer to the
1111 * top
1112 */
1113 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1114 middle = tmp;
1115 }
1116
1117 if (tmp == tmp->above)
1118 {
1119 LOG (llevError, "Error in structure of map\n");
1120 exit (-1);
1121 } 1077 }
1122 1078
1123 move_slow |= tmp->move_slow; 1079 move_slow |= tmp->move_slow;
1124 move_block |= tmp->move_block; 1080 move_block |= tmp->move_block;
1125 move_on |= tmp->move_on; 1081 move_on |= tmp->move_on;
1126 move_off |= tmp->move_off; 1082 move_off |= tmp->move_off;
1127 move_allow |= tmp->move_allow; 1083 move_allow |= tmp->move_allow;
1128 1084
1129 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1085 allflags |= tmp->flag;
1130 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1086
1131 if (tmp->type == PLAYER) flags |= P_PLAYER; 1087 if (tmp->type == PLAYER) flags |= P_PLAYER;
1132 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1088 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1133 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1134 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1135 } 1089 }
1136 1090
1137 this->light = light; 1091 // FLAG_SEE_ANYWHERE takes precedence
1092 if (anywhere)
1093 middle = anywhere;
1094
1095 // ORing all flags together and checking them here is much faster
1096 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1097 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1098 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1099 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1100
1101 this->light = min (light, MAX_LIGHT_RADIUS);
1138 this->flags_ = flags; 1102 this->flags_ = flags;
1139 this->move_block = move_block & ~move_allow; 1103 this->move_block = move_block & ~move_allow;
1140 this->move_on = move_on; 1104 this->move_on = move_on;
1141 this->move_off = move_off; 1105 this->move_off = move_off;
1142 this->move_slow = move_slow; 1106 this->move_slow = move_slow;
1107 this->volume_ = (volume + 1023) / 1024;
1108 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1143 1109
1144 /* At this point, we have a floor face (if there is a floor), 1110 /* At this point, we have a floor face (if there is a floor),
1145 * and the floor is set - we are not going to touch it at 1111 * and the floor is set - we are not going to touch it at
1146 * this point. 1112 * this point.
1147 * middle contains the highest visibility face. 1113 * middle contains the highest visibility face.
… …
1165 */ 1131 */
1166 1132
1167 for (object *tmp = last; tmp; tmp = tmp->below) 1133 for (object *tmp = last; tmp; tmp = tmp->below)
1168 { 1134 {
1169 /* Once we get to a floor, stop, since we already have a floor object */ 1135 /* Once we get to a floor, stop, since we already have a floor object */
1170 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1136 if (tmp->flag [FLAG_IS_FLOOR])
1171 break; 1137 break;
1172 1138
1173 /* If two top faces are already set, quit processing */ 1139 /* If two top faces are already set, quit processing */
1174 if (top && middle) 1140 if (top && middle)
1175 break; 1141 break;
… …
1213 faces_obj [1] = middle; 1179 faces_obj [1] = middle;
1214 faces_obj [2] = floor; 1180 faces_obj [2] = floor;
1215#endif 1181#endif
1216} 1182}
1217 1183
1218uint64 1184maptile *
1219mapspace::volume () const
1220{
1221 uint64 vol = 0;
1222
1223 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1224 vol += op->volume ();
1225
1226 return vol;
1227}
1228
1229bool
1230maptile::tile_available (int dir, bool load) 1185maptile::tile_available (int dir, bool load)
1231{ 1186{
1232 if (!tile_path[dir]) 1187 if (tile_path[dir])
1233 return 0; 1188 {
1234
1235 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE)) 1189 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1236 return 1; 1190 return tile_map[dir];
1237 1191
1238 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1192 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1239 return 1; 1193 return tile_map[dir];
1194 }
1240 1195
1241 return 0; 1196 return 0;
1242} 1197}
1243 1198
1244/* this returns TRUE if the coordinates (x,y) are out of 1199/* this returns TRUE if the coordinates (x,y) are out of
… …
1469 * 1424 *
1470 * currently, the only flag supported (0x1) is don't translate for 1425 * currently, the only flag supported (0x1) is don't translate for
1471 * closest body part of 'op1' 1426 * closest body part of 'op1'
1472 */ 1427 */
1473void 1428void
1474get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1429get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1475{ 1430{
1476 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1431 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1477 { 1432 {
1478 /* be conservative and fill in _some_ data */ 1433 /* be conservative and fill in _some_ data */
1479 retval->distance = 10000; 1434 retval->distance = 10000;
1480 retval->distance_x = 10000; 1435 retval->distance_x = 10000;
1481 retval->distance_y = 10000; 1436 retval->distance_y = 10000;
1482 retval->direction = 0; 1437 retval->direction = 0;
1483 retval->part = 0; 1438 retval->part = 0;
1484 } 1439 }
1485 else 1440 else
1486 { 1441 {
1487 object *best;
1488
1489 retval->distance_x += op2->x - op1->x; 1442 retval->distance_x += op2->x - op1->x;
1490 retval->distance_y += op2->y - op1->y; 1443 retval->distance_y += op2->y - op1->y;
1491 1444
1492 best = op1; 1445 object *best = op1;
1446
1493 /* If this is multipart, find the closest part now */ 1447 /* If this is multipart, find the closest part now */
1494 if (!(flags & 0x1) && op1->more) 1448 if (!(flags & 1) && op1->more)
1495 { 1449 {
1496 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1450 int best_distance = idistance (retval->distance_x, retval->distance_y);
1497 1451
1498 /* we just take the offset of the piece to head to figure 1452 /* we just take the offset of the piece to head to figure
1499 * distance instead of doing all that work above again 1453 * distance instead of doing all that work above again
1500 * since the distance fields we set above are positive in the 1454 * since the distance fields we set above are positive in the
1501 * same axis as is used for multipart objects, the simply arithmetic 1455 * same axis as is used for multipart objects, the simply arithmetic
1502 * below works. 1456 * below works.
1503 */ 1457 */
1504 for (object *tmp = op1->more; tmp; tmp = tmp->more) 1458 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1505 { 1459 {
1506 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1460 int tmpi = idistance (op1->x - tmp->x + retval->distance_x, op1->y - tmp->y + retval->distance_y);
1507 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1461
1508 if (tmpi < best_distance) 1462 if (tmpi < best_distance)
1509 { 1463 {
1510 best_distance = tmpi; 1464 best_distance = tmpi;
1511 best = tmp; 1465 best = tmp;
1512 } 1466 }
1513 } 1467 }
1514 1468
1515 if (best != op1) 1469 if (best != op1)
1516 { 1470 {
1517 retval->distance_x += op1->x - best->x; 1471 retval->distance_x += op1->x - best->x;
1518 retval->distance_y += op1->y - best->y; 1472 retval->distance_y += op1->y - best->y;
1519 } 1473 }
1520 } 1474 }
1521 1475
1522 retval->part = best; 1476 retval->part = best;
1523 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y)); 1477 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1524 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1478 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1525 } 1479 }
1526} 1480}
1527 1481
1528/* this is basically the same as get_rangevector above, but instead of 1482/* this is basically the same as get_rangevector above, but instead of
1529 * the first parameter being an object, it instead is the map 1483 * the first parameter being an object, it instead is the map
… …
1539get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags) 1493get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags)
1540{ 1494{
1541 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y)) 1495 if (!adjacent_map (m, op2->map, &retval->distance_x, &retval->distance_y))
1542 { 1496 {
1543 /* be conservative and fill in _some_ data */ 1497 /* be conservative and fill in _some_ data */
1544 retval->distance = 100000; 1498 retval->distance = 100000;
1545 retval->distance_x = 32767; 1499 retval->distance_x = 32767;
1546 retval->distance_y = 32767; 1500 retval->distance_y = 32767;
1547 retval->direction = 0; 1501 retval->direction = 0;
1548 retval->part = 0; 1502 retval->part = 0;
1549 } 1503 }
1550 else 1504 else
1551 { 1505 {
1552 retval->distance_x += op2->x - x; 1506 retval->distance_x += op2->x - x;
1553 retval->distance_y += op2->y - y; 1507 retval->distance_y += op2->y - y;
1554 1508
1555 retval->part = NULL; 1509 retval->part = 0;
1556 retval->distance = idistance (retval->distance_x, retval->distance_y); 1510 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1557 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1511 retval->direction = find_dir_2 (retval->distance_x, retval->distance_y);
1558 } 1512 }
1559} 1513}
1560 1514
1561/* Returns true of op1 and op2 are effectively on the same map 1515/* Returns true of op1 and op2 are effectively on the same map
1562 * (as related to map tiling). Note that this looks for a path from 1516 * (as related to map tiling). Note that this looks for a path from
… …
1572 int dx, dy; 1526 int dx, dy;
1573 1527
1574 return adjacent_map (op1->map, op2->map, &dx, &dy); 1528 return adjacent_map (op1->map, op2->map, &dx, &dy);
1575} 1529}
1576 1530
1531//-GPL
1532
1577object * 1533object *
1578maptile::insert (object *op, int x, int y, object *originator, int flags) 1534maptile::insert (object *op, int x, int y, object *originator, int flags)
1579{ 1535{
1580 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1536 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1581} 1537}
… …
1592 if (default_region) 1548 if (default_region)
1593 return default_region; 1549 return default_region;
1594 1550
1595 return ::region::default_region (); 1551 return ::region::default_region ();
1596} 1552}
1553
1554//+GPL
1597 1555
1598/* picks a random object from a style map. 1556/* picks a random object from a style map.
1599 */ 1557 */
1600object * 1558object *
1601maptile::pick_random_object (rand_gen &gen) const 1559maptile::pick_random_object (rand_gen &gen) const
… …
1608 */ 1566 */
1609 for (int i = 1000; --i;) 1567 for (int i = 1000; --i;)
1610 { 1568 {
1611 object *pick = at (gen (width), gen (height)).bot; 1569 object *pick = at (gen (width), gen (height)).bot;
1612 1570
1613 // do not prefer big monsters just because they are big. 1571 // must be head: do not prefer big monsters just because they are big.
1614 if (pick && pick->is_head ()) 1572 if (pick && pick->is_head ())
1615 return pick->head_ (); 1573 return pick;
1616 } 1574 }
1617 1575
1618 // instead of crashing in the unlikely(?) case, try to return *something* 1576 // instead of crashing in the unlikely(?) case, try to return *something*
1619 return archetype::find ("bug"); 1577 return archetype::find (shstr_bug);
1620} 1578}
1579
1580//-GPL
1621 1581
1622void 1582void
1623maptile::play_sound (faceidx sound, int x, int y) const 1583maptile::play_sound (faceidx sound, int x, int y) const
1624{ 1584{
1625 if (!sound) 1585 if (!sound)
1626 return; 1586 return;
1627 1587
1588 for_all_players_on_map (pl, this)
1589 if (client *ns = pl->ns)
1590 {
1591 int dx = x - pl->ob->x;
1592 int dy = y - pl->ob->y;
1593
1594 int distance = idistance (dx, dy);
1595
1596 if (distance <= MAX_SOUND_DISTANCE)
1597 ns->play_sound (sound, dx, dy);
1598 }
1599}
1600
1601void
1602maptile::say_msg (const char *msg, int x, int y) const
1603{
1628 for_all_players (pl) 1604 for_all_players (pl)
1629 if (pl->ob->map == this)
1630 if (client *ns = pl->ns) 1605 if (client *ns = pl->ns)
1631 { 1606 {
1632 int dx = x - pl->ob->x; 1607 int dx = x - pl->ob->x;
1633 int dy = y - pl->ob->y; 1608 int dy = y - pl->ob->y;
1634 1609
1635 int distance = idistance (dx, dy); 1610 int distance = idistance (dx, dy);
1636 1611
1637 if (distance <= MAX_SOUND_DISTANCE) 1612 if (distance <= MAX_SOUND_DISTANCE)
1638 ns->play_sound (sound, dx, dy); 1613 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1639 } 1614 }
1640} 1615}
1641 1616
1617dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1618
1619static void
1620split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1621{
1622 // clip to map to the left
1623 if (x0 < 0)
1624 {
1625 if (maptile *tile = m->tile_available (TILE_LEFT, 1))
1626 split_to_tiles (buf, tile, x0 + tile->width, y0, min (x1 + tile->width, tile->width), y1, dx - tile->width, dy);
1627
1628 if (x1 < 0) // entirely to the left
1629 return;
1630
1631 x0 = 0;
1632 }
1633
1634 // clip to map to the right
1635 if (x1 > m->width)
1636 {
1637 if (maptile *tile = m->tile_available (TILE_RIGHT, 1))
1638 split_to_tiles (buf, tile, max (x0 - m->width, 0), y0, x1 - m->width, y1, dx + m->width, dy);
1639
1640 if (x0 > m->width) // entirely to the right
1641 return;
1642
1643 x1 = m->width;
1644 }
1645
1646 // clip to map above
1647 if (y0 < 0)
1648 {
1649 if (maptile *tile = m->tile_available (TILE_UP, 1))
1650 split_to_tiles (buf, tile, x0, y0 + tile->height, x1, min (y1 + tile->height, tile->height), dx, dy - tile->height);
1651
1652 if (y1 < 0) // entirely above
1653 return;
1654
1655 y0 = 0;
1656 }
1657
1658 // clip to map below
1659 if (y1 > m->height)
1660 {
1661 if (maptile *tile = m->tile_available (TILE_DOWN, 1))
1662 split_to_tiles (buf, tile, x0, max (y0 - m->height, 0), x1, y1 - m->height, dx, dy + m->height);
1663
1664 if (y0 > m->height) // entirely below
1665 return;
1666
1667 y1 = m->height;
1668 }
1669
1670 // if we get here, the rect is within the current map
1671 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1672
1673 r->m = m;
1674 r->x0 = x0;
1675 r->y0 = y0;
1676 r->x1 = x1;
1677 r->y1 = y1;
1678 r->dx = dx;
1679 r->dy = dy;
1680}
1681
1682maprect *
1683maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1684{
1685 buf.clear ();
1686
1687 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1688
1689 // add end marker
1690 maprect *r = (maprect *)buf.alloc (sizeof (maprect));
1691 r->m = 0;
1692
1693 return (maprect *)buf.linearise ();
1694}
1695

Diff Legend

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