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.161 by root, Mon Oct 12 21:27:55 2009 UTC vs.
Revision 1.188 by root, Fri Apr 16 02:32:25 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 it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
… …
23 */ 23 */
24 24
25#include <unistd.h> 25#include <unistd.h>
26 26
27#include "global.h" 27#include "global.h"
28#include "loader.h"
29#include "path.h" 28#include "path.h"
29
30//+GPL
30 31
31sint8 maptile::outdoor_darkness; 32sint8 maptile::outdoor_darkness;
32 33
33/* This rolls up wall, blocks_magic, blocks_view, etc, all into 34/* This rolls up wall, blocks_magic, blocks_view, etc, all into
34 * one function that just returns a P_.. value (see map.h) 35 * one function that just returns a P_.. value (see map.h)
… …
80 { 81 {
81 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");
82 return 1; 83 return 1;
83 } 84 }
84 85
85 /* Save some cycles - instead of calling get_map_flags(), just get the value
86 * directly.
87 */
88 mapspace &ms = m->at (sx, sy); 86 mapspace &ms = m->at (sx, sy);
89 87
90 int mflags = ms.flags (); 88 int mflags = ms.flags ();
91 int blocked = ms.move_block; 89 int blocked = ms.move_block;
92 90
93 /* If space is currently not blocked by anything, no need to 91 /* If space is currently not blocked by anything, no need to
94 * go further. Not true for players - all sorts of special 92 * go further. Not true for players - all sorts of special
95 * things we need to do for players. 93 * things we need to do for players.
… …
114 * true. If we get through the entire stack, that must mean 112 * true. If we get through the entire stack, that must mean
115 * ob is blocking it, so return 0. 113 * ob is blocking it, so return 0.
116 */ 114 */
117 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 115 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
118 { 116 {
119 /* This must be before the checks below. Code for inventory checkers. */ 117 if (OB_MOVE_BLOCK (ob, tmp))
120 if (tmp->type == CHECK_INV && OB_MOVE_BLOCK (ob, tmp))
121 { 118 {
122 bool have = check_inv_recursive (ob, tmp); 119 if (INVOKE_OBJECT (BLOCKED_MOVE, tmp, ob))
123 120 if (RESULT_INT (0))
124 /* If last_sp is set, the player/monster needs an object, 121 return 1;
125 * so we check for it. If they don't have it, they can't
126 * pass through this space.
127 */ 122 else
128 if (tmp->last_sp) 123 continue;
124
125 if (tmp->type == CHECK_INV)
129 { 126 {
130 if (!have) 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;
132 }
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))
131 return 1; 141 return 1;
132 } 142 }
133 else 143 else
134 { 144 return 1; // unconditional block
135 /* In this case, the player must not have the object - 145
136 * if they do, they can't pass through.
137 */
138 if (have)
139 return 1;
140 }
141 }
142 else 146 } else {
143 { 147 // space does not block the ob, directly, but
144 /* Broke apart a big nasty if into several here to make 148 // anything alive that is not a door still
145 * this more readable. first check - if the space blocks 149 // blocks anything but wizards.
146 * movement, can't move here.
147 * second - if a monster, can't move there, unless it is a
148 * dm.
149 */
150 if (OB_MOVE_BLOCK (ob, tmp))
151 return 1;
152 150
153 if (tmp->flag [FLAG_ALIVE] 151 if (tmp->flag [FLAG_ALIVE]
154 && tmp->head_ () != ob 152 && tmp->head_ () != ob
155 && tmp != ob 153 && tmp != ob
156 && tmp->type != DOOR 154 && tmp->type != DOOR)
157 && !tmp->flag [FLAG_WIZ])
158 return 1; 155 return 1;
159 } 156 }
160 } 157 }
161 158
162 return 0; 159 return 0;
… …
218 } 215 }
219 216
220 return 0; 217 return 0;
221} 218}
222 219
223/* When the map is loaded, load_object does not actually insert objects 220//-GPL
224 * into inventory, but just links them. What this does is go through
225 * and insert them properly.
226 * The object 'container' is the object that contains the inventory.
227 * This is needed so that we can update the containers weight.
228 */
229void
230fix_container (object *container)
231{
232 object *tmp = container->inv, *next;
233
234 container->inv = 0;
235 while (tmp)
236 {
237 next = tmp->below;
238 if (tmp->inv)
239 fix_container (tmp);
240
241 insert_ob_in_ob (tmp, container);
242 tmp = next;
243 }
244
245 // go through and calculate what all the containers are carrying.
246 //TODO: remove
247 container->update_weight ();
248}
249 221
250void 222void
251maptile::set_object_flag (int flag, int value) 223maptile::set_object_flag (int flag, int value)
252{ 224{
253 if (!spaces) 225 if (!spaces)
… …
268 240
269 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 241 for (mapspace *ms = spaces + size (); ms-- > spaces; )
270 for (object *tmp = ms->bot; tmp; tmp = tmp->above) 242 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
271 INVOKE_OBJECT (RESET, tmp); 243 INVOKE_OBJECT (RESET, tmp);
272} 244}
245
246void
247maptile::post_load ()
248{
249#if 0
250 if (!spaces)
251 return;
252
253 for (mapspace *ms = spaces + size (); ms-- > spaces; )
254 for (object *tmp = ms->bot; tmp; tmp = tmp->above)
255 ; // nop
256#endif
257}
258
259//+GPL
273 260
274/* link_multipart_objects go through all the objects on the map looking 261/* link_multipart_objects go through all the objects on the map looking
275 * for objects whose arch says they are multipart yet according to the 262 * for objects whose arch says they are multipart yet according to the
276 * info we have, they only have the head (as would be expected when 263 * info we have, they only have the head (as would be expected when
277 * they are saved). 264 * they are saved).
… …
304 else 291 else
305 op = op->above; 292 op = op->above;
306 } 293 }
307 } 294 }
308} 295}
296
297//-GPL
309 298
310/* 299/*
311 * Loads (ands parses) the objects into a given map from the specified 300 * Loads (ands parses) the objects into a given map from the specified
312 * file pointer. 301 * file pointer.
313 */ 302 */
… …
433 return false; 422 return false;
434 423
435 return freezer.save (path); 424 return freezer.save (path);
436} 425}
437 426
438maptile::maptile () 427void
428maptile::init ()
439{ 429{
440 in_memory = MAP_SWAPPED; 430 in_memory = MAP_SWAPPED;
441 431
442 /* The maps used to pick up default x and y values from the 432 /* The maps used to pick up default x and y values from the
443 * map archetype. Mimic that behaviour. 433 * map archetype. Mimic that behaviour.
444 */ 434 */
445 width = 16; 435 width = 16;
446 height = 16; 436 height = 16;
447 timeout = 300; 437 timeout = 300;
448 max_nrof = 1000; // 1000 items of anything 438 max_items = MAX_ITEM_PER_ACTION;
449 max_volume = 2000000; // 2m³ 439 max_volume = 2000000; // 2m³
450}
451
452maptile::maptile (int w, int h)
453{
454 in_memory = MAP_SWAPPED;
455
456 width = w;
457 height = h;
458 reset_timeout = 0; 440 reset_timeout = 0;
459 timeout = 300;
460 enter_x = 0; 441 enter_x = 0;
461 enter_y = 0; 442 enter_y = 0;
443}
444
445maptile::maptile ()
446{
447 init ();
448}
449
450maptile::maptile (int w, int h)
451{
452 init ();
453
454 width = w;
455 height = h;
462 456
463 alloc (); 457 alloc ();
464} 458}
465 459
466/* 460/*
… …
474 if (spaces) 468 if (spaces)
475 return; 469 return;
476 470
477 spaces = salloc0<mapspace> (size ()); 471 spaces = salloc0<mapspace> (size ());
478} 472}
473
474//+GPL
479 475
480/* Takes a string from a map definition and outputs a pointer to the array of shopitems 476/* Takes a string from a map definition and outputs a pointer to the array of shopitems
481 * corresponding to that string. Memory is allocated for this, it must be freed 477 * corresponding to that string. Memory is allocated for this, it must be freed
482 * at a later date. 478 * at a later date.
483 * Called by parse_map_headers below. 479 * Called by parse_map_headers below.
… …
560 return items; 556 return items;
561} 557}
562 558
563/* opposite of parse string, this puts the string that was originally fed in to 559/* opposite of parse string, this puts the string that was originally fed in to
564 * the map (or something equivilent) into output_string. */ 560 * the map (or something equivilent) into output_string. */
565static void 561static const char *
566print_shop_string (maptile *m, char *output_string) 562print_shop_string (maptile *m)
567{ 563{
568 int i; 564 static dynbuf_text buf; buf.clear ();
569 char tmp[MAX_BUF];
570 565
571 strcpy (output_string, "");
572 for (i = 0; i < m->shopitems[0].index; i++) 566 for (int i = 0; i < m->shopitems[0].index; i++)
573 { 567 {
574 if (m->shopitems[i].typenum) 568 if (m->shopitems[i].typenum)
575 { 569 {
576 if (m->shopitems[i].strength) 570 if (m->shopitems[i].strength)
577 sprintf (tmp, "%s:%d;", m->shopitems[i].name, m->shopitems[i].strength); 571 buf.printf ("%s:%d;", m->shopitems[i].name, m->shopitems[i].strength);
578 else 572 else
579 sprintf (tmp, "%s;", m->shopitems[i].name); 573 buf.printf ("%s;", m->shopitems[i].name);
580 } 574 }
581 else 575 else
582 { 576 {
583 if (m->shopitems[i].strength) 577 if (m->shopitems[i].strength)
584 sprintf (tmp, "*:%d;", m->shopitems[i].strength); 578 buf.printf ("*:%d;", m->shopitems[i].strength);
585 else 579 else
586 sprintf (tmp, "*"); 580 buf.printf ("*");
587 } 581 }
588
589 strcat (output_string, tmp);
590 } 582 }
583
584 return buf;
591} 585}
586
587//-GPL
592 588
593/* This loads the header information of the map. The header 589/* This loads the header information of the map. The header
594 * contains things like difficulty, size, timeout, etc. 590 * contains things like difficulty, size, timeout, etc.
595 * this used to be stored in the map object, but with the 591 * this used to be stored in the map object, but with the
596 * addition of tiling, fields beyond that easily named in an 592 * addition of tiling, fields beyond that easily named in an
… …
637 case KW_shopgreed: thawer.get (shopgreed); break; 633 case KW_shopgreed: thawer.get (shopgreed); break;
638 case KW_shopmin: thawer.get (shopmin); break; 634 case KW_shopmin: thawer.get (shopmin); break;
639 case KW_shopmax: thawer.get (shopmax); break; 635 case KW_shopmax: thawer.get (shopmax); break;
640 case KW_shoprace: thawer.get (shoprace); break; 636 case KW_shoprace: thawer.get (shoprace); break;
641 case KW_outdoor: thawer.get (outdoor); break; 637 case KW_outdoor: thawer.get (outdoor); break;
642 case KW_temp: thawer.get (temp); break;
643 case KW_pressure: thawer.get (pressure); break;
644 case KW_humid: thawer.get (humid); break;
645 case KW_windspeed: thawer.get (windspeed); break;
646 case KW_winddir: thawer.get (winddir); break;
647 case KW_sky: thawer.get (sky); break;
648 638
649 case KW_per_player: thawer.get (per_player); break; 639 case KW_per_player: thawer.get (per_player); break;
650 case KW_per_party: thawer.get (per_party); break; 640 case KW_per_party: thawer.get (per_party); break;
651 case KW_no_reset: thawer.get (no_reset); break; 641 case KW_no_reset: thawer.get (no_reset); break;
652 case KW_no_drop: thawer.get (no_drop); break; 642 case KW_no_drop: thawer.get (no_drop); break;
… …
677 case KW_end: 667 case KW_end:
678 thawer.next (); 668 thawer.next ();
679 return true; 669 return true;
680 670
681 default: 671 default:
682 if (!thawer.parse_error ("map", 0)) 672 if (!thawer.parse_error ("map"))
683 return false; 673 return false;
684 break; 674 break;
685 } 675 }
686 676
687 thawer.next (); 677 thawer.next ();
688 } 678 }
689 679
690 abort (); 680 abort ();
691} 681}
682
683//+GPL
692 684
693/****************************************************************************** 685/******************************************************************************
694 * This is the start of unique map handling code 686 * This is the start of unique map handling code
695 *****************************************************************************/ 687 *****************************************************************************/
696 688
… …
703 int unique = 0; 695 int unique = 0;
704 for (object *op = spaces [i].bot; op; ) 696 for (object *op = spaces [i].bot; op; )
705 { 697 {
706 object *above = op->above; 698 object *above = op->above;
707 699
708 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 700 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
709 unique = 1; 701 unique = 1;
710 702
711 if (op->head_ () == op && (QUERY_FLAG (op, FLAG_UNIQUE) || unique)) 703 if (op->head_ () == op && (op->flag [FLAG_UNIQUE] || unique))
712 op->destroy (); 704 op->destroy ();
713 705
714 op = above; 706 op = above;
715 } 707 }
716 } 708 }
717} 709}
718 710
711//-GPL
712
719bool 713bool
720maptile::_save_header (object_freezer &freezer) 714maptile::_save_header (object_freezer &freezer)
721{ 715{
722#define MAP_OUT(k) freezer.put (KW_ ## k, k) 716#define MAP_OUT(k) freezer.put (KW(k), k)
723#define MAP_OUT2(k,v) freezer.put (KW_ ## k, v) 717#define MAP_OUT2(k,v) freezer.put (KW(k), v)
724 718
725 MAP_OUT2 (arch, "map"); 719 MAP_OUT2 (arch, CS(map));
726 720
727 if (name) MAP_OUT (name); 721 if (name) MAP_OUT (name);
728 MAP_OUT (swap_time); 722 MAP_OUT (swap_time);
729 MAP_OUT (reset_time); 723 MAP_OUT (reset_time);
730 MAP_OUT (reset_timeout); 724 MAP_OUT (reset_timeout);
731 MAP_OUT (fixed_resettime); 725 MAP_OUT (fixed_resettime);
732 MAP_OUT (no_reset); 726 MAP_OUT (no_reset);
733 MAP_OUT (no_drop); 727 MAP_OUT (no_drop);
734 MAP_OUT (difficulty); 728 MAP_OUT (difficulty);
735
736 if (default_region) MAP_OUT2 (region, default_region->name); 729 if (default_region) MAP_OUT2 (region, default_region->name);
737 730
738 if (shopitems) 731 if (shopitems) MAP_OUT2 (shopitems, print_shop_string (this));
739 {
740 char shop[MAX_BUF];
741 print_shop_string (this, shop);
742 MAP_OUT2 (shopitems, shop);
743 }
744
745 MAP_OUT (shopgreed); 732 MAP_OUT (shopgreed);
746 MAP_OUT (shopmin); 733 MAP_OUT (shopmin);
747 MAP_OUT (shopmax); 734 MAP_OUT (shopmax);
748 if (shoprace) MAP_OUT (shoprace); 735 if (shoprace) MAP_OUT (shoprace);
749 MAP_OUT (darkness); 736
750 MAP_OUT (width); 737 MAP_OUT (width);
751 MAP_OUT (height); 738 MAP_OUT (height);
752 MAP_OUT (enter_x); 739 MAP_OUT (enter_x);
753 MAP_OUT (enter_y); 740 MAP_OUT (enter_y);
754 741 MAP_OUT (darkness);
755 if (msg) freezer.put (KW_msg , KW_endmsg , msg);
756 if (maplore) freezer.put (KW_maplore, KW_endmaplore, maplore);
757
758 MAP_OUT (outdoor); 742 MAP_OUT (outdoor);
759 MAP_OUT (temp); 743
760 MAP_OUT (pressure); 744 if (msg) freezer.put (KW(msg) , KW(endmsg) , msg);
761 MAP_OUT (humid); 745 if (maplore) freezer.put (KW(maplore), KW(endmaplore), maplore);
762 MAP_OUT (windspeed);
763 MAP_OUT (winddir);
764 MAP_OUT (sky);
765 746
766 MAP_OUT (per_player); 747 MAP_OUT (per_player);
767 MAP_OUT (per_party); 748 MAP_OUT (per_party);
768 749
769 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]); 750 if (tile_path [0]) MAP_OUT2 (tile_path_1, tile_path [0]);
770 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]); 751 if (tile_path [1]) MAP_OUT2 (tile_path_2, tile_path [1]);
771 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]); 752 if (tile_path [2]) MAP_OUT2 (tile_path_3, tile_path [2]);
772 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]); 753 if (tile_path [3]) MAP_OUT2 (tile_path_4, tile_path [3]);
773 754
774 freezer.put (this); 755 freezer.put (this);
775 freezer.put (KW_end); 756 freezer.put (KW(end));
776 757
777 return true; 758 return true;
778} 759}
779 760
780bool 761bool
… …
785 if (!_save_header (freezer)) 766 if (!_save_header (freezer))
786 return false; 767 return false;
787 768
788 return freezer.save (path); 769 return freezer.save (path);
789} 770}
771
772//+GPL
790 773
791/* 774/*
792 * Remove and free all objects in the given map. 775 * Remove and free all objects in the given map.
793 */ 776 */
794void 777void
… …
863 846
864 clear (); 847 clear ();
865} 848}
866 849
867/* decay and destroy perishable items in a map */ 850/* decay and destroy perishable items in a map */
851// TODO: should be done regularly, not on map load?
868void 852void
869maptile::do_decay_objects () 853maptile::do_decay_objects ()
870{ 854{
871 if (!spaces) 855 if (!spaces)
872 return; 856 return;
… …
874 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 858 for (mapspace *ms = spaces + size (); ms-- > spaces; )
875 for (object *above, *op = ms->bot; op; op = above) 859 for (object *above, *op = ms->bot; op; op = above)
876 { 860 {
877 above = op->above; 861 above = op->above;
878 862
863 // do not decay anything above unique floor tiles (yet :)
864 if (op->flag [FLAG_IS_FLOOR] && op->flag [FLAG_UNIQUE])
865 break;
866
879 bool destroy = 0; 867 bool destroy = 0;
880 868
881 // do not decay anything above unique floor tiles (yet :) 869 if (op->flag [FLAG_IS_FLOOR]
882 if (QUERY_FLAG (op, FLAG_IS_FLOOR) && QUERY_FLAG (op, FLAG_UNIQUE)) 870 || op->flag [FLAG_OBJ_ORIGINAL]
883 break; 871 || op->flag [FLAG_UNIQUE]
884 872 || op->flag [FLAG_OVERLAY_FLOOR]
885 if (QUERY_FLAG (op, FLAG_IS_FLOOR) 873 || 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 ()) 874 || op->is_alive ())
891 ; // do not decay 875 ; // do not decay
892 else if (op->is_weapon ()) 876 else if (op->is_weapon ())
893 { 877 {
894 op->stats.dam--; 878 op->stats.dam--;
… …
919 || mat & M_LIQUID 903 || mat & M_LIQUID
920 || (mat & M_IRON && rndm (1, 5) == 1) 904 || (mat & M_IRON && rndm (1, 5) == 1)
921 || (mat & M_GLASS && rndm (1, 2) == 1) 905 || (mat & M_GLASS && rndm (1, 2) == 1)
922 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1) 906 || ((mat & M_STONE || mat & M_ADAMANT) && rndm (1, 10) == 1)
923 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1) 907 || ((mat & M_SOFT_METAL || mat & M_BONE) && rndm (1, 3) == 1)
924 || (mat & M_ICE && temp > 32)) 908 //|| (mat & M_ICE && temp > 32)
909 )
925 destroy = 1; 910 destroy = 1;
926 } 911 }
927 912
928 /* adjust overall chance below */ 913 /* adjust overall chance below */
929 if (destroy && rndm (0, 1)) 914 if (destroy && rndm (0, 1))
… …
949 sint64 total_exp = 0; 934 sint64 total_exp = 0;
950 935
951 for (mapspace *ms = spaces + size (); ms-- > spaces; ) 936 for (mapspace *ms = spaces + size (); ms-- > spaces; )
952 for (object *op = ms->bot; op; op = op->above) 937 for (object *op = ms->bot; op; op = op->above)
953 { 938 {
954 if (QUERY_FLAG (op, FLAG_MONSTER)) 939 if (op->flag [FLAG_MONSTER])
955 { 940 {
956 total_exp += op->stats.exp; 941 total_exp += op->stats.exp;
957 monster_cnt++; 942 monster_cnt++;
958 } 943 }
959 944
960 if (QUERY_FLAG (op, FLAG_GENERATOR)) 945 if (op->flag [FLAG_GENERATOR])
961 { 946 {
962 total_exp += op->stats.exp; 947 total_exp += op->stats.exp;
963 948
964 if (archetype *at = op->other_arch) 949 if (archetype *at = op->other_arch)
965 { 950 {
… …
1020 */ 1005 */
1021void 1006void
1022mapspace::update_ () 1007mapspace::update_ ()
1023{ 1008{
1024 object *last = 0; 1009 object *last = 0;
1025 uint8 flags = P_UPTODATE, anywhere = 0; 1010 uint8 flags = P_UPTODATE;
1026 sint8 light = 0; 1011 sint8 light = 0;
1027 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0; 1012 MoveType move_block = 0, move_slow = 0, move_on = 0, move_off = 0, move_allow = 0;
1013 uint64_t volume = 0;
1014 uint32_t items = 0;
1015 object *anywhere = 0;
1016 uint8_t middle_visibility = 0;
1028 1017
1029 //object *middle = 0; 1018 //object *middle = 0;
1030 //object *top = 0; 1019 //object *top = 0;
1031 //object *floor = 0; 1020 //object *floor = 0;
1032 // this seems to generate better code than using locals, above 1021 // this seems to generate better code than using locals, above
1033 object *&top = faces_obj[0] = 0; 1022 object *&top = faces_obj[0] = 0;
1034 object *&middle = faces_obj[1] = 0; 1023 object *&middle = faces_obj[1] = 0;
1035 object *&floor = faces_obj[2] = 0; 1024 object *&floor = faces_obj[2] = 0;
1025
1026 object::flags_t allflags; // all flags of all objects or'ed together
1036 1027
1037 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above) 1028 for (object *tmp = bot; tmp; last = tmp, tmp = tmp->above)
1038 { 1029 {
1039 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C) 1030 // Lights are additive, up to MAX_LIGHT_RADIUS, see los.C)
1040 light += tmp->glow_radius; 1031 light += tmp->glow_radius;
… …
1045 * 3 times each time the player moves, because many of the 1036 * 3 times each time the player moves, because many of the
1046 * functions the move_player calls eventualy call this. 1037 * functions the move_player calls eventualy call this.
1047 * 1038 *
1048 * Always put the player down for drawing. 1039 * Always put the player down for drawing.
1049 */ 1040 */
1050 if (!tmp->invisible) 1041 if (expect_true (!tmp->invisible))
1051 { 1042 {
1052 if ((tmp->type == PLAYER || QUERY_FLAG (tmp, FLAG_MONSTER))) 1043 if (expect_false (tmp->type == PLAYER || tmp->flag [FLAG_MONSTER]))
1053 top = tmp; 1044 top = tmp;
1054 else if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1045 else if (expect_false (tmp->flag [FLAG_IS_FLOOR]))
1055 { 1046 {
1056 /* If we got a floor, that means middle and top were below it, 1047 /* If we got a floor, that means middle and top were below it,
1057 * so should not be visible, so we clear them. 1048 * so should not be visible, so we clear them.
1058 */ 1049 */
1059 middle = 0; 1050 middle = 0;
1060 top = 0; 1051 top = 0;
1061 floor = tmp; 1052 floor = tmp;
1053 volume = 0;
1054 items = 0;
1062 } 1055 }
1063 /* Flag anywhere have high priority */ 1056 else
1064 else if (QUERY_FLAG (tmp, FLAG_SEE_ANYWHERE))
1065 { 1057 {
1058 if (expect_true (!tmp->flag [FLAG_NO_PICK]))
1059 {
1060 ++items;
1061 volume += tmp->volume ();
1062 }
1063
1064 /* Flag anywhere have high priority */
1065 if (expect_false (tmp->flag [FLAG_SEE_ANYWHERE]))
1066 anywhere = tmp;
1067
1068 /* Find the highest visible face around. If equal
1069 * visibilities, we still want the one nearer to the
1070 * top
1071 */
1072 if (expect_false (::faces [tmp->face].visibility >= middle_visibility))
1073 {
1074 middle_visibility = ::faces [tmp->face].visibility;
1066 middle = tmp; 1075 middle = tmp;
1067 anywhere = 1; 1076 }
1068 } 1077 }
1069
1070 /* Find the highest visible face around. If equal
1071 * visibilities, we still want the one nearer to the
1072 * top
1073 */
1074 else if (!middle || (::faces [tmp->face].visibility > ::faces [middle->face].visibility && !anywhere))
1075 middle = tmp;
1076 }
1077
1078 if (tmp == tmp->above)
1079 {
1080 LOG (llevError, "Error in structure of map\n");
1081 exit (-1);
1082 } 1078 }
1083 1079
1084 move_slow |= tmp->move_slow; 1080 move_slow |= tmp->move_slow;
1085 move_block |= tmp->move_block; 1081 move_block |= tmp->move_block;
1086 move_on |= tmp->move_on; 1082 move_on |= tmp->move_on;
1087 move_off |= tmp->move_off; 1083 move_off |= tmp->move_off;
1088 move_allow |= tmp->move_allow; 1084 move_allow |= tmp->move_allow;
1089 1085
1090 if (QUERY_FLAG (tmp, FLAG_BLOCKSVIEW)) flags |= P_BLOCKSVIEW; 1086 allflags |= tmp->flag;
1091 if (QUERY_FLAG (tmp, FLAG_NO_MAGIC)) flags |= P_NO_MAGIC; 1087
1092 if (tmp->type == PLAYER) flags |= P_PLAYER; 1088 if (tmp->type == PLAYER) flags |= P_PLAYER;
1093 if (tmp->type == SAFE_GROUND) flags |= P_SAFE; 1089 if (tmp->type == SAFE_GROUND) flags |= P_SAFE;
1094 if (QUERY_FLAG (tmp, FLAG_ALIVE)) flags |= P_IS_ALIVE;
1095 if (QUERY_FLAG (tmp, FLAG_DAMNED)) flags |= P_NO_CLERIC;
1096 } 1090 }
1091
1092 // FLAG_SEE_ANYWHERE takes precedence
1093 if (anywhere)
1094 middle = anywhere;
1095
1096 // ORing all flags together and checking them here is much faster
1097 if (allflags [FLAG_BLOCKSVIEW]) flags |= P_BLOCKSVIEW;
1098 if (allflags [FLAG_NO_MAGIC] ) flags |= P_NO_MAGIC;
1099 if (allflags [FLAG_ALIVE] ) flags |= P_IS_ALIVE;
1100 if (allflags [FLAG_DAMNED] ) flags |= P_NO_CLERIC;
1097 1101
1098 this->light = min (light, MAX_LIGHT_RADIUS); 1102 this->light = min (light, MAX_LIGHT_RADIUS);
1099 this->flags_ = flags; 1103 this->flags_ = flags;
1100 this->move_block = move_block & ~move_allow; 1104 this->move_block = move_block & ~move_allow;
1101 this->move_on = move_on; 1105 this->move_on = move_on;
1102 this->move_off = move_off; 1106 this->move_off = move_off;
1103 this->move_slow = move_slow; 1107 this->move_slow = move_slow;
1108 this->volume_ = (volume + 1023) / 1024;
1109 this->items_ = upos_min (items, 65535); // assume nrof <= 2**31
1104 1110
1105 /* At this point, we have a floor face (if there is a floor), 1111 /* At this point, we have a floor face (if there is a floor),
1106 * and the floor is set - we are not going to touch it at 1112 * and the floor is set - we are not going to touch it at
1107 * this point. 1113 * this point.
1108 * middle contains the highest visibility face. 1114 * middle contains the highest visibility face.
… …
1126 */ 1132 */
1127 1133
1128 for (object *tmp = last; tmp; tmp = tmp->below) 1134 for (object *tmp = last; tmp; tmp = tmp->below)
1129 { 1135 {
1130 /* Once we get to a floor, stop, since we already have a floor object */ 1136 /* Once we get to a floor, stop, since we already have a floor object */
1131 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR)) 1137 if (tmp->flag [FLAG_IS_FLOOR])
1132 break; 1138 break;
1133 1139
1134 /* If two top faces are already set, quit processing */ 1140 /* If two top faces are already set, quit processing */
1135 if (top && middle) 1141 if (top && middle)
1136 break; 1142 break;
… …
1174 faces_obj [1] = middle; 1180 faces_obj [1] = middle;
1175 faces_obj [2] = floor; 1181 faces_obj [2] = floor;
1176#endif 1182#endif
1177} 1183}
1178 1184
1179uint64
1180mapspace::volume () const
1181{
1182 uint64 vol = 0;
1183
1184 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1185 vol += op->volume ();
1186
1187 return vol;
1188}
1189
1190maptile * 1185maptile *
1191maptile::tile_available (int dir, bool load) 1186maptile::tile_available (int dir, bool load)
1192{ 1187{
1193 if (tile_path[dir]) 1188 if (tile_path[dir])
1194 { 1189 {
… …
1430 * 1425 *
1431 * currently, the only flag supported (0x1) is don't translate for 1426 * currently, the only flag supported (0x1) is don't translate for
1432 * closest body part of 'op1' 1427 * closest body part of 'op1'
1433 */ 1428 */
1434void 1429void
1435get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1430get_rangevector (object *op1, object *op2, rv_vector *retval, int flags)
1436{ 1431{
1437 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1432 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1438 { 1433 {
1439 /* be conservative and fill in _some_ data */ 1434 /* be conservative and fill in _some_ data */
1440 retval->distance = 10000; 1435 retval->distance = 10000;
… …
1443 retval->direction = 0; 1438 retval->direction = 0;
1444 retval->part = 0; 1439 retval->part = 0;
1445 } 1440 }
1446 else 1441 else
1447 { 1442 {
1448 object *best;
1449
1450 retval->distance_x += op2->x - op1->x; 1443 retval->distance_x += op2->x - op1->x;
1451 retval->distance_y += op2->y - op1->y; 1444 retval->distance_y += op2->y - op1->y;
1452 1445
1453 best = op1; 1446 object *best = op1;
1447
1454 /* If this is multipart, find the closest part now */ 1448 /* If this is multipart, find the closest part now */
1455 if (!(flags & 0x1) && op1->more) 1449 if (!(flags & 1) && op1->more)
1456 { 1450 {
1457 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1451 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1458 1452
1459 /* we just take the offset of the piece to head to figure 1453 /* we just take the offset of the piece to head to figure
1460 * distance instead of doing all that work above again 1454 * distance instead of doing all that work above again
… …
1533 int dx, dy; 1527 int dx, dy;
1534 1528
1535 return adjacent_map (op1->map, op2->map, &dx, &dy); 1529 return adjacent_map (op1->map, op2->map, &dx, &dy);
1536} 1530}
1537 1531
1532//-GPL
1533
1538object * 1534object *
1539maptile::insert (object *op, int x, int y, object *originator, int flags) 1535maptile::insert (object *op, int x, int y, object *originator, int flags)
1540{ 1536{
1541 return insert_ob_in_map_at (op, this, originator, flags, x, y); 1537 return insert_ob_in_map_at (op, this, originator, flags, x, y);
1542} 1538}
… …
1553 if (default_region) 1549 if (default_region)
1554 return default_region; 1550 return default_region;
1555 1551
1556 return ::region::default_region (); 1552 return ::region::default_region ();
1557} 1553}
1554
1555//+GPL
1558 1556
1559/* picks a random object from a style map. 1557/* picks a random object from a style map.
1560 */ 1558 */
1561object * 1559object *
1562maptile::pick_random_object (rand_gen &gen) const 1560maptile::pick_random_object (rand_gen &gen) const
… …
1569 */ 1567 */
1570 for (int i = 1000; --i;) 1568 for (int i = 1000; --i;)
1571 { 1569 {
1572 object *pick = at (gen (width), gen (height)).bot; 1570 object *pick = at (gen (width), gen (height)).bot;
1573 1571
1574 // do not prefer big monsters just because they are big. 1572 // must be head: do not prefer big monsters just because they are big.
1575 if (pick && pick->is_head ()) 1573 if (pick && pick->is_head ())
1576 return pick->head_ (); 1574 return pick;
1577 } 1575 }
1578 1576
1579 // instead of crashing in the unlikely(?) case, try to return *something* 1577 // instead of crashing in the unlikely(?) case, try to return *something*
1580 return archetype::find ("bug"); 1578 return archetype::find (shstr_bug);
1581} 1579}
1580
1581//-GPL
1582 1582
1583void 1583void
1584maptile::play_sound (faceidx sound, int x, int y) const 1584maptile::play_sound (faceidx sound, int x, int y) const
1585{ 1585{
1586 if (!sound) 1586 if (!sound)
… …
1612 1612
1613 if (distance <= MAX_SOUND_DISTANCE) 1613 if (distance <= MAX_SOUND_DISTANCE)
1614 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg); 1614 ns->send_msg (NDI_GREY | NDI_DEF, SAY_CHANNEL, msg);
1615 } 1615 }
1616} 1616}
1617
1618dynbuf mapwalk_buf (sizeof (maprect) * 25, sizeof (maprect) * 25);
1617 1619
1618static void 1620static void
1619split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy) 1621split_to_tiles (dynbuf &buf, maptile *m, int x0, int y0, int x1, int y1, int dx, int dy)
1620{ 1622{
1621 // clip to map to the left 1623 // clip to map to the left
… …
1677 r->dx = dx; 1679 r->dx = dx;
1678 r->dy = dy; 1680 r->dy = dy;
1679} 1681}
1680 1682
1681maprect * 1683maprect *
1682maptile::split_to_tiles (int x0, int y0, int x1, int y1) 1684maptile::split_to_tiles (dynbuf &buf, int x0, int y0, int x1, int y1)
1683{ 1685{
1684 static dynbuf buf (sizeof (maprect) * 8, sizeof (maprect) * 8);
1685 buf.clear (); 1686 buf.clear ();
1686 1687
1687 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0); 1688 ::split_to_tiles (buf, this, x0, y0, x1, y1, 0, 0);
1688 1689
1689 // add end marker 1690 // add end marker

Diff Legend

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