ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.236 by root, Tue May 6 20:08:37 2008 UTC vs.
Revision 1.294 by root, Thu Nov 5 15:43:21 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 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 <global.h> 25#include <global.h>
32#include <bitset> 33#include <bitset>
33 34
34UUID UUID::cur; 35UUID UUID::cur;
35static uint64_t seq_next_save; 36static uint64_t seq_next_save;
36static const uint64 UUID_GAP = 1<<19; 37static const uint64 UUID_GAP = 1<<19;
38uint32_t mapspace::smellcount = 10000;
37 39
38objectvec objects; 40objectvec objects;
39activevec actives; 41activevec actives;
42
43//+GPL
40 44
41short freearr_x[SIZEOFFREE] = { 45short freearr_x[SIZEOFFREE] = {
42 0, 46 0,
43 0, 1, 1, 1, 0, -1, -1, -1, 47 0, 1, 1, 1, 0, -1, -1, -1,
44 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 48 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
186 || ob1->speed != ob2->speed 190 || ob1->speed != ob2->speed
187 || ob1->value != ob2->value 191 || ob1->value != ob2->value
188 || ob1->name != ob2->name) 192 || ob1->name != ob2->name)
189 return 0; 193 return 0;
190 194
191 /* Do not merge objects if nrof would overflow. First part checks 195 /* Do not merge objects if nrof would overflow, assume nrof
192 * for unsigned overflow (2c), second part checks whether the result 196 * is always 0 .. 2**31-1 */
193 * would fit into a 32 bit signed int, which is often used to hold 197 if (ob1->nrof > 0x7fffffff - ob2->nrof)
194 * nrof values.
195 */
196 if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31))
197 return 0; 198 return 0;
198 199
199 /* If the objects have been identified, set the BEEN_APPLIED flag. 200 /* If the objects have been identified, set the BEEN_APPLIED flag.
200 * This is to the comparison of the flags below will be OK. We 201 * This is to the comparison of the flags below will be OK. We
201 * just can't ignore the been applied or identified flags, as they 202 * just can't ignore the been applied or identified flags, as they
206 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 207 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
207 208
208 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 209 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
209 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 210 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
210 211
211 if (ob1->arch->name != ob2->arch->name 212 if (ob1->arch->archname != ob2->arch->archname
212 || ob1->name != ob2->name 213 || ob1->name != ob2->name
213 || ob1->title != ob2->title 214 || ob1->title != ob2->title
214 || ob1->msg != ob2->msg 215 || ob1->msg != ob2->msg
215 || ob1->weight != ob2->weight 216 || ob1->weight != ob2->weight
216 || ob1->attacktype != ob2->attacktype 217 || ob1->attacktype != ob2->attacktype
217 || ob1->magic != ob2->magic 218 || ob1->magic != ob2->magic
218 || ob1->slaying != ob2->slaying 219 || ob1->slaying != ob2->slaying
219 || ob1->skill != ob2->skill 220 || ob1->skill != ob2->skill
220 || ob1->value != ob2->value 221 || ob1->value != ob2->value
221 || ob1->animation_id != ob2->animation_id 222 || ob1->animation_id != ob2->animation_id
223 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
222 || ob1->client_type != ob2->client_type 224 || ob1->client_type != ob2->client_type
223 || ob1->materialname != ob2->materialname 225 || ob1->materialname != ob2->materialname
224 || ob1->lore != ob2->lore 226 || ob1->lore != ob2->lore
225 || ob1->subtype != ob2->subtype 227 || ob1->subtype != ob2->subtype
226 || ob1->move_type != ob2->move_type 228 || ob1->move_type != ob2->move_type
234 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 236 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
235 return 0; 237 return 0;
236 238
237 if ((ob1->flag ^ ob2->flag) 239 if ((ob1->flag ^ ob2->flag)
238 .reset (FLAG_INV_LOCKED) 240 .reset (FLAG_INV_LOCKED)
239 .reset (FLAG_CLIENT_SENT)
240 .reset (FLAG_REMOVED) 241 .reset (FLAG_REMOVED)
241 .any ()) 242 .any ())
242 return 0; 243 return 0;
243 244
244 /* This is really a spellbook check - we should in general 245 /* This is really a spellbook check - we should in general
326 { 327 {
327 // see if we are in a container of sorts 328 // see if we are in a container of sorts
328 if (env) 329 if (env)
329 { 330 {
330 // the player inventory itself is always visible 331 // the player inventory itself is always visible
331 if (env->type == PLAYER) 332 if (env->is_player ())
332 return env; 333 return env;
333 334
334 // else a player could have our env open 335 // else a player could have our env open
335 object *envest = env->outer_env (); 336 object *envest = env->outer_env_or_self ();
336 337
337 // the player itself is always on a map, so we will find him here 338 // the player itself is always on a map, so we will find him here
338 // even if our inv is in a player. 339 // even if our inv is in a player.
339 if (envest->is_on_map ()) 340 if (envest->is_on_map ())
340 if (object *pl = envest->ms ().player ()) 341 if (object *pl = envest->ms ().player ())
341 if (pl->container == env) 342 if (pl->container_ () == env)
342 return pl; 343 return pl;
343 } 344 }
344 else 345 else
345 { 346 {
346 // maybe there is a player standing on the same mapspace 347 // maybe there is a player standing on the same mapspace
347 // this will catch the case where "this" is a player 348 // this will catch the case where "this" is a player
348 if (object *pl = ms ().player ()) 349 if (object *pl = ms ().player ())
349 if (!pl->container || this == pl->container) 350 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
351 || pl->container_ () == this)
350 return pl; 352 return pl;
351 } 353 }
352 } 354 }
353 355
354 return 0; 356 return 0;
430 return strdup ("[NULLOBJ]"); 432 return strdup ("[NULLOBJ]");
431 433
432 object_freezer freezer; 434 object_freezer freezer;
433 op->write (freezer); 435 op->write (freezer);
434 return freezer.as_string (); 436 return freezer.as_string ();
437}
438
439char *
440object::as_string ()
441{
442 return dump_object (this);
435} 443}
436 444
437/* 445/*
438 * get_nearest_part(multi-object, object 2) returns the part of the 446 * get_nearest_part(multi-object, object 2) returns the part of the
439 * multi-object 1 which is closest to the second object. 447 * multi-object 1 which is closest to the second object.
478 */ 486 */
479object * 487object *
480find_object_name (const char *str) 488find_object_name (const char *str)
481{ 489{
482 shstr_cmp str_ (str); 490 shstr_cmp str_ (str);
483 object *op;
484 491
492 if (str_)
485 for_all_objects (op) 493 for_all_objects (op)
486 if (op->name == str_) 494 if (op->name == str_)
487 break; 495 return op;
488 496
489 return op; 497 return 0;
490} 498}
491 499
492/* 500/*
493 * Sets the owner and sets the skill and exp pointers to owner's current 501 * Sets the owner and sets the skill and exp pointers to owner's current
494 * skill and experience objects. 502 * skill and experience objects.
556 update_stats (); 564 update_stats ();
557 565
558 new_draw_info_format (NDI_UNIQUE, 0, this, 566 new_draw_info_format (NDI_UNIQUE, 0, this,
559 "You try to balance all your items at once, " 567 "You try to balance all your items at once, "
560 "but the %s is just too much for your body. " 568 "but the %s is just too much for your body. "
561 "[You need to unapply some items first.]", &ob->name); 569 "[You need to unapply some items first - use the 'body' command to see "
570 "how many items you cna wera on a specific body part.]", &ob->name);
562 return false; 571 return false;
563 } 572 }
564 573
565 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 574 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
566 } 575 }
638 } 647 }
639 648
640 if (speed < 0) 649 if (speed < 0)
641 dst->speed_left -= rndm (); 650 dst->speed_left -= rndm ();
642 651
643 dst->set_speed (dst->speed); 652 dst->activate ();
644} 653}
645 654
646void 655void
647object::instantiate () 656object::instantiate ()
648{ 657{
760 else if (action == UP_OBJ_INSERT) 769 else if (action == UP_OBJ_INSERT)
761 { 770 {
762 // this is likely overkill, TODO: revisit (schmorp) 771 // this is likely overkill, TODO: revisit (schmorp)
763 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 772 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
764 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 773 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
765 || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) 774 || (op->is_player () && !(m.flags_ & P_PLAYER))
766 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 775 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
767 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) 776 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
768 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) 777 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
769 || (m.move_on | op->move_on ) != m.move_on 778 || (m.move_on | op->move_on ) != m.move_on
770 || (m.move_off | op->move_off ) != m.move_off 779 || (m.move_off | op->move_off ) != m.move_off
771 || (m.move_slow | op->move_slow) != m.move_slow 780 || (m.move_slow | op->move_slow) != m.move_slow
772 /* This isn't perfect, but I don't expect a lot of objects to 781 /* This isn't perfect, but I don't expect a lot of objects to
773 * to have move_allow right now. 782 * have move_allow right now.
774 */ 783 */
775 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 784 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
776 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) 785 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
777 m.flags_ = 0; 786 m.invalidate ();
778 } 787 }
779 /* if the object is being removed, we can't make intelligent 788 /* if the object is being removed, we can't make intelligent
780 * decisions, because remove_ob can't really pass the object 789 * decisions, because remove_ob can't really pass the object
781 * that is being removed. 790 * that is being removed.
782 */ 791 */
783 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 792 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
784 m.flags_ = 0; 793 m.invalidate ();
785 else if (action == UP_OBJ_FACE) 794 else if (action == UP_OBJ_FACE)
786 /* Nothing to do for that case */ ; 795 /* Nothing to do for that case */ ;
787 else 796 else
788 LOG (llevError, "update_object called with invalid action: %d\n", action); 797 LOG (llevError, "update_object called with invalid action: %d\n", action);
789 798
793 802
794object::object () 803object::object ()
795{ 804{
796 SET_FLAG (this, FLAG_REMOVED); 805 SET_FLAG (this, FLAG_REMOVED);
797 806
798 expmul = 1.0; 807 //expmul = 1.0; declared const for the time being
799 face = blank_face; 808 face = blank_face;
800} 809}
801 810
802object::~object () 811object::~object ()
803{ 812{
833 /* If already on active list, don't do anything */ 842 /* If already on active list, don't do anything */
834 if (active) 843 if (active)
835 return; 844 return;
836 845
837 if (has_active_speed ()) 846 if (has_active_speed ())
847 {
848 if (flag [FLAG_FREED])
849 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
850
838 actives.insert (this); 851 actives.insert (this);
852 }
839} 853}
840 854
841void 855void
842object::activate_recursive () 856object::activate_recursive ()
843{ 857{
904 * drop on that space. 918 * drop on that space.
905 */ 919 */
906 if (!drop_to_ground 920 if (!drop_to_ground
907 || !map 921 || !map
908 || map->in_memory != MAP_ACTIVE 922 || map->in_memory != MAP_ACTIVE
909 || map->nodrop 923 || map->no_drop
910 || ms ().move_block == MOVE_ALL) 924 || ms ().move_block == MOVE_ALL)
911 { 925 {
912 while (inv) 926 while (inv)
913 {
914 inv->destroy_inv (false);
915 inv->destroy (); 927 inv->destroy ();
916 }
917 } 928 }
918 else 929 else
919 { /* Put objects in inventory onto this space */ 930 { /* Put objects in inventory onto this space */
920 while (inv) 931 while (inv)
921 { 932 {
925 || op->flag [FLAG_NO_DROP] 936 || op->flag [FLAG_NO_DROP]
926 || op->type == RUNE 937 || op->type == RUNE
927 || op->type == TRAP 938 || op->type == TRAP
928 || op->flag [FLAG_IS_A_TEMPLATE] 939 || op->flag [FLAG_IS_A_TEMPLATE]
929 || op->flag [FLAG_DESTROY_ON_DEATH]) 940 || op->flag [FLAG_DESTROY_ON_DEATH])
930 op->destroy (true); 941 op->destroy ();
931 else 942 else
932 map->insert (op, x, y); 943 map->insert (op, x, y);
933 } 944 }
934 } 945 }
935} 946}
943 954
944static struct freed_map : maptile 955static struct freed_map : maptile
945{ 956{
946 freed_map () 957 freed_map ()
947 { 958 {
948 path = "<freed objects map>"; 959 path = "<freed objects map>";
949 name = "/internal/freed_objects_map"; 960 name = "/internal/freed_objects_map";
950 width = 3; 961 width = 3;
951 height = 3; 962 height = 3;
952 nodrop = 1; 963 no_drop = 1;
964 no_reset = 1;
953 965
954 alloc (); 966 alloc ();
955 in_memory = MAP_ACTIVE; 967 in_memory = MAP_ACTIVE;
956 } 968 }
957 969
963 975
964void 976void
965object::do_destroy () 977object::do_destroy ()
966{ 978{
967 if (flag [FLAG_IS_LINKED]) 979 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 980 remove_link ();
969 981
970 if (flag [FLAG_FRIENDLY]) 982 if (flag [FLAG_FRIENDLY])
971 remove_friendly_object (this); 983 remove_friendly_object (this);
972 984
973 remove (); 985 remove ();
998 attacked_by = 0; 1010 attacked_by = 0;
999 current_weapon = 0; 1011 current_weapon = 0;
1000} 1012}
1001 1013
1002void 1014void
1003object::destroy (bool destroy_inventory) 1015object::destroy ()
1004{ 1016{
1005 if (destroyed ()) 1017 if (destroyed ())
1006 return; 1018 return;
1007 1019
1008 if (!is_head () && !head->destroyed ()) 1020 if (!is_head () && !head->destroyed ())
1009 { 1021 {
1010 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1022 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1011 head->destroy (destroy_inventory); 1023 head->destroy ();
1012 return; 1024 return;
1013 } 1025 }
1014 1026
1015 destroy_inv (!destroy_inventory); 1027 destroy_inv (false);
1016 1028
1017 if (is_head ()) 1029 if (is_head ())
1018 if (sound_destroy) 1030 if (sound_destroy)
1019 play_sound (sound_destroy); 1031 play_sound (sound_destroy);
1020 else if (flag [FLAG_MONSTER]) 1032 else if (flag [FLAG_MONSTER])
1031 * the previous environment. 1043 * the previous environment.
1032 */ 1044 */
1033void 1045void
1034object::do_remove () 1046object::do_remove ()
1035{ 1047{
1036 object *tmp, *last = 0;
1037 object *otmp;
1038
1039 if (flag [FLAG_REMOVED]) 1048 if (flag [FLAG_REMOVED])
1040 return; 1049 return;
1041 1050
1042 INVOKE_OBJECT (REMOVE, this); 1051 INVOKE_OBJECT (REMOVE, this);
1043 1052
1057 esrv_del_item (pl->contr, count); 1066 esrv_del_item (pl->contr, count);
1058 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed 1067 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1059 1068
1060 adjust_weight (env, -total_weight ()); 1069 adjust_weight (env, -total_weight ());
1061 1070
1062 // make sure cmov optimisation is applicable 1071 object *pl = in_player ();
1063 *(above ? &above->below : &env->inv) = below;
1064 *(below ? &below->above : &above ) = above; // &above is just a dummy
1065
1066 above = 0;
1067 below = 0;
1068 env = 0;
1069 1072
1070 /* we set up values so that it could be inserted into 1073 /* we set up values so that it could be inserted into
1071 * the map, but we don't actually do that - it is up 1074 * the map, but we don't actually do that - it is up
1072 * to the caller to decide what we want to do. 1075 * to the caller to decide what we want to do.
1073 */ 1076 */
1074 map = env->map; 1077 map = env->map;
1075 x = env->x; 1078 x = env->x;
1076 y = env->y; 1079 y = env->y;
1077 1080
1081 // make sure cmov optimisation is applicable
1082 *(above ? &above->below : &env->inv) = below;
1083 *(below ? &below->above : &above ) = above; // &above is just a dummy
1084
1085 above = 0;
1086 below = 0;
1087 env = 0;
1088
1078 /* NO_FIX_PLAYER is set when a great many changes are being 1089 /* NO_FIX_PLAYER is set when a great many changes are being
1079 * made to players inventory. If set, avoiding the call 1090 * made to players inventory. If set, avoiding the call
1080 * to save cpu time. 1091 * to save cpu time.
1081 */ 1092 */
1082 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1093 if (pl)
1094 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1095 {
1083 otmp->update_stats (); 1096 pl->update_stats ();
1097
1098 if (glow_radius && pl->is_on_map ())
1099 update_all_los (pl->map, pl->x, pl->y);
1100 }
1084 } 1101 }
1085 else if (map) 1102 else if (map)
1086 { 1103 {
1087 map->dirty = true; 1104 map->dirty = true;
1088 mapspace &ms = this->ms (); 1105 mapspace &ms = this->ms ();
1089 1106
1090 if (object *pl = ms.player ()) 1107 if (object *pl = ms.player ())
1091 { 1108 {
1092 if (type == PLAYER) // this == pl(!) 1109 if (is_player ())
1093 { 1110 {
1111 if (!flag [FLAG_WIZPASS])
1112 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1113
1094 // leaving a spot always closes any open container on the ground 1114 // leaving a spot always closes any open container on the ground
1095 if (container && !container->env) 1115 if (container && !container->env)
1096 // this causes spurious floorbox updates, but it ensures 1116 // this causes spurious floorbox updates, but it ensures
1097 // that the CLOSE event is being sent. 1117 // that the CLOSE event is being sent.
1098 close_container (); 1118 close_container ();
1099 1119
1100 --map->players; 1120 --map->players;
1101 map->touch (); 1121 map->touch ();
1102 } 1122 }
1103 else if (pl->container == this) 1123 else if (pl->container_ () == this)
1104 { 1124 {
1105 // removing a container should close it 1125 // removing a container should close it
1106 close_container (); 1126 close_container ();
1107 } 1127 }
1108 1128
1115 *(below ? &below->above : &ms.bot) = above; 1135 *(below ? &below->above : &ms.bot) = above;
1116 1136
1117 above = 0; 1137 above = 0;
1118 below = 0; 1138 below = 0;
1119 1139
1140 ms.invalidate ();
1141
1120 if (map->in_memory == MAP_SAVING) 1142 if (map->in_memory == MAP_SAVING)
1121 return; 1143 return;
1122 1144
1123 int check_walk_off = !flag [FLAG_NO_APPLY]; 1145 int check_walk_off = !flag [FLAG_NO_APPLY];
1124 1146
1125 if (object *pl = ms.player ()) 1147 if (object *pl = ms.player ())
1126 { 1148 {
1127 if (pl->container == this) 1149 if (pl->container_ () == this)
1128 /* If a container that the player is currently using somehow gets 1150 /* If a container that the player is currently using somehow gets
1129 * removed (most likely destroyed), update the player view 1151 * removed (most likely destroyed), update the player view
1130 * appropriately. 1152 * appropriately.
1131 */ 1153 */
1132 pl->close_container (); 1154 pl->close_container ();
1136 //TODO: update floorbox to preserve ordering 1158 //TODO: update floorbox to preserve ordering
1137 if (pl->contr->ns) 1159 if (pl->contr->ns)
1138 pl->contr->ns->floorbox_update (); 1160 pl->contr->ns->floorbox_update ();
1139 } 1161 }
1140 1162
1163 if (check_walk_off)
1141 for (tmp = ms.bot; tmp; tmp = tmp->above) 1164 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1142 { 1165 {
1166 above = tmp->above;
1167
1143 /* No point updating the players look faces if he is the object 1168 /* No point updating the players look faces if he is the object
1144 * being removed. 1169 * being removed.
1145 */ 1170 */
1146 1171
1147 /* See if object moving off should effect something */ 1172 /* See if object moving off should effect something */
1148 if (check_walk_off
1149 && ((move_type & tmp->move_off) 1173 if ((move_type & tmp->move_off)
1150 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1174 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1151 {
1152 move_apply (tmp, this, 0); 1175 move_apply (tmp, this, 0);
1153
1154 if (destroyed ())
1155 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1156 } 1176 }
1157 1177
1158 last = tmp; 1178 if (affects_los ())
1159 }
1160
1161 /* last == NULL if there are no objects on this space */
1162 //TODO: this makes little sense, why only update the topmost object?
1163 if (!last)
1164 map->at (x, y).flags_ = 0;
1165 else
1166 update_object (last, UP_OBJ_REMOVE);
1167
1168 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1169 update_all_los (map, x, y); 1179 update_all_los (map, x, y);
1170 } 1180 }
1171} 1181}
1172 1182
1173/* 1183/*
1197 esrv_update_item (UPD_NROF, pl, top); 1207 esrv_update_item (UPD_NROF, pl, top);
1198 1208
1199 op->weight = 0; // cancel the addition above 1209 op->weight = 0; // cancel the addition above
1200 op->carrying = 0; // must be 0 already 1210 op->carrying = 0; // must be 0 already
1201 1211
1202 op->destroy (1); 1212 op->destroy ();
1203 1213
1204 return top; 1214 return top;
1205 } 1215 }
1206 1216
1207 return 0; 1217 return 0;
1235 * job preparing multi-part monsters. 1245 * job preparing multi-part monsters.
1236 */ 1246 */
1237object * 1247object *
1238insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1248insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1239{ 1249{
1250 op->remove ();
1251
1240 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1252 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1241 { 1253 {
1242 tmp->x = x + tmp->arch->x; 1254 tmp->x = x + tmp->arch->x;
1243 tmp->y = y + tmp->arch->y; 1255 tmp->y = y + tmp->arch->y;
1244 } 1256 }
1267 * just 'op' otherwise 1279 * just 'op' otherwise
1268 */ 1280 */
1269object * 1281object *
1270insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1282insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1271{ 1283{
1272 assert (!op->flag [FLAG_FREED]);
1273
1274 op->remove (); 1284 op->remove ();
1285
1286 if (m == &freed_map)//D TODO: remove soon
1287 {//D
1288 LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1289 }//D
1275 1290
1276 /* Ideally, the caller figures this out. However, it complicates a lot 1291 /* Ideally, the caller figures this out. However, it complicates a lot
1277 * of areas of callers (eg, anything that uses find_free_spot would now 1292 * of areas of callers (eg, anything that uses find_free_spot would now
1278 * need extra work 1293 * need extra work
1279 */ 1294 */
1295 maptile *newmap = m;
1280 if (!xy_normalise (m, op->x, op->y)) 1296 if (!xy_normalise (newmap, op->x, op->y))
1281 { 1297 {
1282 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found 1298 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1283 return 0; 1299 return 0;
1284 } 1300 }
1285 1301
1286 if (object *more = op->more) 1302 if (object *more = op->more)
1287 if (!insert_ob_in_map (more, m, originator, flag)) 1303 if (!insert_ob_in_map (more, m, originator, flag))
1288 return 0; 1304 return 0;
1289 1305
1290 CLEAR_FLAG (op, FLAG_REMOVED); 1306 op->flag [FLAG_REMOVED] = false;
1291 1307 op->env = 0;
1292 op->map = m; 1308 op->map = newmap;
1309
1293 mapspace &ms = op->ms (); 1310 mapspace &ms = op->ms ();
1294 1311
1295 /* this has to be done after we translate the coordinates. 1312 /* this has to be done after we translate the coordinates.
1296 */ 1313 */
1297 if (op->nrof && !(flag & INS_NO_MERGE)) 1314 if (op->nrof && !(flag & INS_NO_MERGE))
1298 for (object *tmp = ms.bot; tmp; tmp = tmp->above) 1315 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1299 if (object::can_merge (op, tmp)) 1316 if (object::can_merge (op, tmp))
1300 { 1317 {
1301 // TODO: we atcually want to update tmp, not op, 1318 // TODO: we actually want to update tmp, not op,
1302 // but some caller surely breaks when we return tmp 1319 // but some caller surely breaks when we return tmp
1303 // from here :/ 1320 // from here :/
1304 op->nrof += tmp->nrof; 1321 op->nrof += tmp->nrof;
1305 tmp->destroy (1); 1322 tmp->destroy ();
1306 } 1323 }
1307 1324
1308 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1325 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1309 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1326 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1310 1327
1317 { 1334 {
1318 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1335 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1319 abort (); 1336 abort ();
1320 } 1337 }
1321 1338
1339 if (!originator->is_on_map ())
1340 {
1341 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1342 op->debug_desc (), originator->debug_desc ());
1343 abort ();
1344 }
1345
1322 op->above = originator; 1346 op->above = originator;
1323 op->below = originator->below; 1347 op->below = originator->below;
1324
1325 if (op->below)
1326 op->below->above = op;
1327 else
1328 ms.bot = op;
1329
1330 /* since *below* originator, no need to update top */
1331 originator->below = op; 1348 originator->below = op;
1349
1350 *(op->below ? &op->below->above : &ms.bot) = op;
1332 } 1351 }
1333 else 1352 else
1334 { 1353 {
1335 object *top, *floor = NULL; 1354 object *floor = 0;
1336 1355 object *top = ms.top;
1337 top = ms.bot;
1338 1356
1339 /* If there are other objects, then */ 1357 /* If there are other objects, then */
1340 if (top) 1358 if (top)
1341 { 1359 {
1342 object *last = 0;
1343
1344 /* 1360 /*
1345 * If there are multiple objects on this space, we do some trickier handling. 1361 * If there are multiple objects on this space, we do some trickier handling.
1346 * We've already dealt with merging if appropriate. 1362 * We've already dealt with merging if appropriate.
1347 * Generally, we want to put the new object on top. But if 1363 * Generally, we want to put the new object on top. But if
1348 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last 1364 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1351 * once we get to them. This reduces the need to traverse over all of 1367 * once we get to them. This reduces the need to traverse over all of
1352 * them when adding another one - this saves quite a bit of cpu time 1368 * them when adding another one - this saves quite a bit of cpu time
1353 * when lots of spells are cast in one area. Currently, it is presumed 1369 * when lots of spells are cast in one area. Currently, it is presumed
1354 * that flying non pickable objects are spell objects. 1370 * that flying non pickable objects are spell objects.
1355 */ 1371 */
1356 for (top = ms.bot; top; top = top->above) 1372 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1357 { 1373 {
1358 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1374 if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR))
1359 floor = top; 1375 floor = tmp;
1360 1376
1361 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1377 if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR))
1362 { 1378 {
1363 /* We insert above top, so we want this object below this */ 1379 /* We insert above top, so we want this object below this */
1364 top = top->below; 1380 top = tmp->below;
1365 break; 1381 break;
1366 } 1382 }
1367 1383
1368 last = top; 1384 top = tmp;
1369 } 1385 }
1370
1371 /* Don't want top to be NULL, so set it to the last valid object */
1372 top = last;
1373 1386
1374 /* We let update_position deal with figuring out what the space 1387 /* We let update_position deal with figuring out what the space
1375 * looks like instead of lots of conditions here. 1388 * looks like instead of lots of conditions here.
1376 * makes things faster, and effectively the same result. 1389 * makes things faster, and effectively the same result.
1377 */ 1390 */
1384 */ 1397 */
1385 if (!(flag & INS_ON_TOP) 1398 if (!(flag & INS_ON_TOP)
1386 && ms.flags () & P_BLOCKSVIEW 1399 && ms.flags () & P_BLOCKSVIEW
1387 && (op->face && !faces [op->face].visibility)) 1400 && (op->face && !faces [op->face].visibility))
1388 { 1401 {
1402 object *last;
1403
1389 for (last = top; last != floor; last = last->below) 1404 for (last = top; last != floor; last = last->below)
1390 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1405 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1391 break; 1406 break;
1392 1407
1393 /* Check to see if we found the object that blocks view, 1408 /* Check to see if we found the object that blocks view,
1401 } /* If objects on this space */ 1416 } /* If objects on this space */
1402 1417
1403 if (flag & INS_ABOVE_FLOOR_ONLY) 1418 if (flag & INS_ABOVE_FLOOR_ONLY)
1404 top = floor; 1419 top = floor;
1405 1420
1406 /* Top is the object that our object (op) is going to get inserted above. 1421 // insert object above top, or bottom-most if top = 0
1407 */
1408
1409 /* First object on this space */
1410 if (!top) 1422 if (!top)
1411 { 1423 {
1424 op->below = 0;
1412 op->above = ms.bot; 1425 op->above = ms.bot;
1413
1414 if (op->above)
1415 op->above->below = op;
1416
1417 op->below = 0;
1418 ms.bot = op; 1426 ms.bot = op;
1427
1428 *(op->above ? &op->above->below : &ms.top) = op;
1419 } 1429 }
1420 else 1430 else
1421 { /* get inserted into the stack above top */ 1431 {
1422 op->above = top->above; 1432 op->above = top->above;
1423
1424 if (op->above)
1425 op->above->below = op; 1433 top->above = op;
1426 1434
1427 op->below = top; 1435 op->below = top;
1428 top->above = op; 1436 *(op->above ? &op->above->below : &ms.top) = op;
1429 } 1437 }
1438 }
1430 1439
1431 if (!op->above) 1440 if (op->is_player ())
1432 ms.top = op;
1433 } /* else not INS_BELOW_ORIGINATOR */
1434
1435 if (op->type == PLAYER)
1436 { 1441 {
1437 op->contr->do_los = 1; 1442 op->contr->do_los = 1;
1438 ++op->map->players; 1443 ++op->map->players;
1439 op->map->touch (); 1444 op->map->touch ();
1440 } 1445 }
1455 * be far away from this change and not affected in any way - 1460 * be far away from this change and not affected in any way -
1456 * this should get redone to only look for players within range, 1461 * this should get redone to only look for players within range,
1457 * or just updating the P_UPTODATE for spaces within this area 1462 * or just updating the P_UPTODATE for spaces within this area
1458 * of effect may be sufficient. 1463 * of effect may be sufficient.
1459 */ 1464 */
1460 if (op->map->darkness && (op->glow_radius != 0)) 1465 if (op->affects_los ())
1466 {
1467 op->ms ().invalidate ();
1461 update_all_los (op->map, op->x, op->y); 1468 update_all_los (op->map, op->x, op->y);
1469 }
1462 1470
1463 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1471 /* updates flags (blocked, alive, no magic, etc) for this map space */
1464 update_object (op, UP_OBJ_INSERT); 1472 update_object (op, UP_OBJ_INSERT);
1465 1473
1466 INVOKE_OBJECT (INSERT, op); 1474 INVOKE_OBJECT (INSERT, op);
1473 * blocked() and wall() work properly), and these flags are updated by 1481 * blocked() and wall() work properly), and these flags are updated by
1474 * update_object(). 1482 * update_object().
1475 */ 1483 */
1476 1484
1477 /* if this is not the head or flag has been passed, don't check walk on status */ 1485 /* if this is not the head or flag has been passed, don't check walk on status */
1478 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1486 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1479 { 1487 {
1480 if (check_move_on (op, originator)) 1488 if (check_move_on (op, originator))
1481 return 0; 1489 return 0;
1482 1490
1483 /* If we are a multi part object, lets work our way through the check 1491 /* If we are a multi part object, lets work our way through the check
1494/* this function inserts an object in the map, but if it 1502/* this function inserts an object in the map, but if it
1495 * finds an object of its own type, it'll remove that one first. 1503 * finds an object of its own type, it'll remove that one first.
1496 * op is the object to insert it under: supplies x and the map. 1504 * op is the object to insert it under: supplies x and the map.
1497 */ 1505 */
1498void 1506void
1499replace_insert_ob_in_map (const char *arch_string, object *op) 1507replace_insert_ob_in_map (shstr_tmp archname, object *op)
1500{ 1508{
1501 /* first search for itself and remove any old instances */ 1509 /* first search for itself and remove any old instances */
1502 1510
1503 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1511 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1504 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1512 if (tmp->arch->archname == archname) /* same archetype */
1505 tmp->destroy (1); 1513 tmp->destroy ();
1506 1514
1507 object *tmp = arch_to_object (archetype::find (arch_string)); 1515 object *tmp = arch_to_object (archetype::find (archname));
1508 1516
1509 tmp->x = op->x; 1517 tmp->x = op->x;
1510 tmp->y = op->y; 1518 tmp->y = op->y;
1511 1519
1512 insert_ob_in_map (tmp, op->map, op, 0); 1520 insert_ob_in_map (tmp, op->map, op, 0);
1534 if (!nr) 1542 if (!nr)
1535 return true; 1543 return true;
1536 1544
1537 nr = min (nr, nrof); 1545 nr = min (nr, nrof);
1538 1546
1547 if (nrof > nr)
1548 {
1539 nrof -= nr; 1549 nrof -= nr;
1540
1541 if (nrof)
1542 {
1543 adjust_weight (env, -weight * nr); // carrying == 0 1550 adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1544 1551
1545 if (object *pl = visible_to ()) 1552 if (object *pl = visible_to ())
1546 esrv_update_item (UPD_NROF, pl, this); 1553 esrv_update_item (UPD_NROF, pl, this);
1547 1554
1548 return true; 1555 return true;
1549 } 1556 }
1550 else 1557 else
1551 { 1558 {
1552 destroy (1); 1559 destroy ();
1553 return false; 1560 return false;
1554 } 1561 }
1555} 1562}
1556 1563
1557/* 1564/*
1634 if (object *pl = tmp->visible_to ()) 1641 if (object *pl = tmp->visible_to ())
1635 esrv_update_item (UPD_NROF, pl, tmp); 1642 esrv_update_item (UPD_NROF, pl, tmp);
1636 1643
1637 adjust_weight (this, op->total_weight ()); 1644 adjust_weight (this, op->total_weight ());
1638 1645
1639 op->destroy (1); 1646 op->destroy ();
1640 op = tmp; 1647 op = tmp;
1641 goto inserted; 1648 goto inserted;
1642 } 1649 }
1643 1650
1644 op->owner = 0; // it's his/hers now. period. 1651 op->owner = 0; // it's his/hers now. period.
1662 1669
1663 adjust_weight (this, op->total_weight ()); 1670 adjust_weight (this, op->total_weight ());
1664 1671
1665inserted: 1672inserted:
1666 /* reset the light list and los of the players on the map */ 1673 /* reset the light list and los of the players on the map */
1667 if (op->glow_radius && map && map->darkness) 1674 if (op->glow_radius && is_on_map ())
1675 {
1676 update_stats ();
1668 update_all_los (map, x, y); 1677 update_all_los (map, x, y);
1669 1678 }
1679 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1670 // if this is a player's inventory, update stats 1680 // if this is a player's inventory, update stats
1671 if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1672 update_stats (); 1681 update_stats ();
1673 1682
1674 INVOKE_OBJECT (INSERT, this); 1683 INVOKE_OBJECT (INSERT, this);
1675 1684
1676 return op; 1685 return op;
1697 * on top. 1706 * on top.
1698 */ 1707 */
1699int 1708int
1700check_move_on (object *op, object *originator) 1709check_move_on (object *op, object *originator)
1701{ 1710{
1711 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1712 return 0;
1713
1702 object *tmp; 1714 object *tmp;
1703 maptile *m = op->map; 1715 maptile *m = op->map;
1704 int x = op->x, y = op->y; 1716 int x = op->x, y = op->y;
1705 1717
1706 MoveType move_on, move_slow, move_block; 1718 mapspace &ms = m->at (x, y);
1707 1719
1708 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1720 ms.update ();
1709 return 0;
1710 1721
1711 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1722 MoveType move_on = ms.move_on;
1712 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1723 MoveType move_slow = ms.move_slow;
1713 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1724 MoveType move_block = ms.move_block;
1714 1725
1715 /* if nothing on this space will slow op down or be applied, 1726 /* if nothing on this space will slow op down or be applied,
1716 * no need to do checking below. have to make sure move_type 1727 * no need to do checking below. have to make sure move_type
1717 * is set, as lots of objects don't have it set - we treat that 1728 * is set, as lots of objects don't have it set - we treat that
1718 * as walking. 1729 * as walking.
1729 return 0; 1740 return 0;
1730 1741
1731 /* The objects have to be checked from top to bottom. 1742 /* The objects have to be checked from top to bottom.
1732 * Hence, we first go to the top: 1743 * Hence, we first go to the top:
1733 */ 1744 */
1734 1745 for (object *next, *tmp = ms.top; tmp; tmp = next)
1735 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1736 {
1737 /* Trim the search when we find the first other spell effect
1738 * this helps performance so that if a space has 50 spell objects,
1739 * we don't need to check all of them.
1740 */
1741 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1742 break;
1743 } 1746 {
1747 next = tmp->below;
1744 1748
1745 for (; tmp; tmp = tmp->below)
1746 {
1747 if (tmp == op) 1749 if (tmp == op)
1748 continue; /* Can't apply yourself */ 1750 continue; /* Can't apply yourself */
1749 1751
1750 /* Check to see if one of the movement types should be slowed down. 1752 /* Check to see if one of the movement types should be slowed down.
1751 * Second check makes sure that the movement types not being slowed 1753 * Second check makes sure that the movement types not being slowed
1756 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1758 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1757 { 1759 {
1758 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1760 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1759 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1761 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1760 { 1762 {
1761
1762 float
1763 diff = tmp->move_slow_penalty * fabs (op->speed); 1763 float diff = tmp->move_slow_penalty * fabs (op->speed);
1764 1764
1765 if (op->type == PLAYER) 1765 if (op->is_player ())
1766 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1766 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1767 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1767 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1768 diff /= 4.0; 1768 diff /= 4.0;
1769 1769
1770 op->speed_left -= diff; 1770 op->speed_left -= diff;
1771 } 1771 }
1772 } 1772 }
1978 * head of the object should correspond for the entire object. 1978 * head of the object should correspond for the entire object.
1979 */ 1979 */
1980 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 1980 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1981 continue; 1981 continue;
1982 1982
1983 if (ob->blocked (m, pos.x, pos.y)) 1983 if (ob->blocked (pos.m, pos.x, pos.y))
1984 continue; 1984 continue;
1985 1985
1986 altern [index++] = i; 1986 altern [index++] = i;
1987 } 1987 }
1988 1988
2056 * there is capable of. 2056 * there is capable of.
2057 */ 2057 */
2058int 2058int
2059find_dir (maptile *m, int x, int y, object *exclude) 2059find_dir (maptile *m, int x, int y, object *exclude)
2060{ 2060{
2061 int i, max = SIZEOFFREE, mflags; 2061 int max = SIZEOFFREE, mflags;
2062
2063 sint16 nx, ny;
2064 object *tmp;
2065 maptile *mp;
2066
2067 MoveType blocked, move_type; 2062 MoveType move_type;
2068 2063
2069 if (exclude && exclude->head_ () != exclude) 2064 if (exclude && exclude->head_ () != exclude)
2070 { 2065 {
2071 exclude = exclude->head; 2066 exclude = exclude->head;
2072 move_type = exclude->move_type; 2067 move_type = exclude->move_type;
2075 { 2070 {
2076 /* If we don't have anything, presume it can use all movement types. */ 2071 /* If we don't have anything, presume it can use all movement types. */
2077 move_type = MOVE_ALL; 2072 move_type = MOVE_ALL;
2078 } 2073 }
2079 2074
2080 for (i = 1; i < max; i++) 2075 for (int i = 1; i < max; i++)
2081 { 2076 {
2082 mp = m; 2077 mapxy pos (m, x, y);
2083 nx = x + freearr_x[i]; 2078 pos.move (i);
2084 ny = y + freearr_y[i];
2085 2079
2086 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2080 if (!pos.normalise ())
2087
2088 if (mflags & P_OUT_OF_MAP)
2089 max = maxfree[i]; 2081 max = maxfree[i];
2090 else 2082 else
2091 { 2083 {
2092 mapspace &ms = mp->at (nx, ny); 2084 mapspace &ms = *pos;
2093 2085
2094 blocked = ms.move_block;
2095
2096 if ((move_type & blocked) == move_type) 2086 if ((move_type & ms.move_block) == move_type)
2097 max = maxfree[i]; 2087 max = maxfree [i];
2098 else if (mflags & P_IS_ALIVE) 2088 else if (ms.flags () & P_IS_ALIVE)
2099 { 2089 {
2100 for (tmp = ms.bot; tmp; tmp = tmp->above) 2090 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2101 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2091 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2102 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2092 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2103 break;
2104
2105 if (tmp)
2106 return freedir[i]; 2093 return freedir [i];
2107 } 2094 }
2108 } 2095 }
2109 } 2096 }
2110 2097
2111 return 0; 2098 return 0;
2186 * This basically means that if direction is 15, then it could either go 2173 * This basically means that if direction is 15, then it could either go
2187 * direction 4, 14, or 16 to get back to where we are. 2174 * direction 4, 14, or 16 to get back to where we are.
2188 * Moved from spell_util.c to object.c with the other related direction 2175 * Moved from spell_util.c to object.c with the other related direction
2189 * functions. 2176 * functions.
2190 */ 2177 */
2191int reduction_dir[SIZEOFFREE][3] = { 2178const int reduction_dir[SIZEOFFREE][3] = {
2192 {0, 0, 0}, /* 0 */ 2179 {0, 0, 0}, /* 0 */
2193 {0, 0, 0}, /* 1 */ 2180 {0, 0, 0}, /* 1 */
2194 {0, 0, 0}, /* 2 */ 2181 {0, 0, 0}, /* 2 */
2195 {0, 0, 0}, /* 3 */ 2182 {0, 0, 0}, /* 3 */
2196 {0, 0, 0}, /* 4 */ 2183 {0, 0, 0}, /* 4 */
2292int 2279int
2293can_pick (const object *who, const object *item) 2280can_pick (const object *who, const object *item)
2294{ 2281{
2295 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2282 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2296 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2283 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2297 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2284 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2298} 2285}
2299 2286
2300/* 2287/*
2301 * create clone from object to another 2288 * create clone from object to another
2302 */ 2289 */
2334 return tmp; 2321 return tmp;
2335 2322
2336 return 0; 2323 return 0;
2337} 2324}
2338 2325
2339const shstr & 2326shstr_tmp
2340object::kv_get (const shstr &key) const 2327object::kv_get (shstr_tmp key) const
2341{ 2328{
2342 for (key_value *kv = key_values; kv; kv = kv->next) 2329 for (key_value *kv = key_values; kv; kv = kv->next)
2343 if (kv->key == key) 2330 if (kv->key == key)
2344 return kv->value; 2331 return kv->value;
2345 2332
2346 return shstr_null; 2333 return shstr ();
2347} 2334}
2348 2335
2349void 2336void
2350object::kv_set (const shstr &key, const shstr &value) 2337object::kv_set (shstr_tmp key, shstr_tmp value)
2351{ 2338{
2352 for (key_value *kv = key_values; kv; kv = kv->next) 2339 for (key_value *kv = key_values; kv; kv = kv->next)
2353 if (kv->key == key) 2340 if (kv->key == key)
2354 { 2341 {
2355 kv->value = value; 2342 kv->value = value;
2364 2351
2365 key_values = kv; 2352 key_values = kv;
2366} 2353}
2367 2354
2368void 2355void
2369object::kv_del (const shstr &key) 2356object::kv_del (shstr_tmp key)
2370{ 2357{
2371 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2358 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2372 if ((*kvp)->key == key) 2359 if ((*kvp)->key == key)
2373 { 2360 {
2374 key_value *kv = *kvp; 2361 key_value *kv = *kvp;
2433{ 2420{
2434 char flagdesc[512]; 2421 char flagdesc[512];
2435 char info2[256 * 4]; 2422 char info2[256 * 4];
2436 char *p = info; 2423 char *p = info;
2437 2424
2438 p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", 2425 p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}",
2439 count, 2426 count,
2440 uuid.c_str (), 2427 uuid.c_str (),
2441 &name, 2428 &name,
2442 title ? "\",title:\"" : "", 2429 title ? ",title:\"" : "",
2443 title ? (const char *)title : "", 2430 title ? (const char *)title : "",
2431 title ? "\"" : "",
2444 flag_desc (flagdesc, 512), type); 2432 flag_desc (flagdesc, 512), type);
2445 2433
2446 if (!flag[FLAG_REMOVED] && env) 2434 if (!flag[FLAG_REMOVED] && env)
2447 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2435 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2448 2436
2504 container = 0; 2492 container = 0;
2505 2493
2506 // client needs item update to make it work, client bug requires this to be separate 2494 // client needs item update to make it work, client bug requires this to be separate
2507 esrv_update_item (UPD_FLAGS, this, old_container); 2495 esrv_update_item (UPD_FLAGS, this, old_container);
2508 2496
2509 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2497 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2510 play_sound (sound_find ("chest_close")); 2498 play_sound (sound_find ("chest_close"));
2511 } 2499 }
2512 2500
2513 if (new_container) 2501 if (new_container)
2514 { 2502 {
2524 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2512 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2525 new_container->insert (closer); 2513 new_container->insert (closer);
2526 } 2514 }
2527#endif 2515#endif
2528 2516
2529 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2517 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2530 2518
2531 // make sure the container is available, client bug requires this to be separate 2519 // make sure the container is available, client bug requires this to be separate
2532 esrv_send_item (this, new_container); 2520 esrv_send_item (this, new_container);
2533 2521
2534 new_container->flag [FLAG_APPLIED] = true; 2522 new_container->flag [FLAG_APPLIED] = true;
2542// else if (!old_container->env && contr && contr->ns) 2530// else if (!old_container->env && contr && contr->ns)
2543// contr->ns->floorbox_reset (); 2531// contr->ns->floorbox_reset ();
2544} 2532}
2545 2533
2546object * 2534object *
2547object::force_find (const shstr name) 2535object::force_find (shstr_tmp name)
2548{ 2536{
2549 /* cycle through his inventory to look for the MARK we want to 2537 /* cycle through his inventory to look for the MARK we want to
2550 * place 2538 * place
2551 */ 2539 */
2552 for (object *tmp = inv; tmp; tmp = tmp->below) 2540 for (object *tmp = inv; tmp; tmp = tmp->below)
2554 return splay (tmp); 2542 return splay (tmp);
2555 2543
2556 return 0; 2544 return 0;
2557} 2545}
2558 2546
2547//-GPL
2548
2559void 2549void
2550object::force_set_timer (int duration)
2551{
2552 this->duration = 1;
2553 this->speed_left = -1.f;
2554
2555 this->set_speed (duration ? 1.f / duration : 0.f);
2556}
2557
2558object *
2560object::force_add (const shstr name, int duration) 2559object::force_add (shstr_tmp name, int duration)
2561{ 2560{
2562 if (object *force = force_find (name)) 2561 if (object *force = force_find (name))
2563 force->destroy (); 2562 force->destroy ();
2564 2563
2565 object *force = get_archetype (FORCE_NAME); 2564 object *force = get_archetype (FORCE_NAME);
2566 2565
2567 force->slaying = name; 2566 force->slaying = name;
2568 force->stats.food = 1; 2567 force->force_set_timer (duration);
2569 force->speed_left = -1.f;
2570
2571 force->set_speed (duration ? 1.f / duration : 0.f);
2572 force->flag [FLAG_IS_USED_UP] = true;
2573 force->flag [FLAG_APPLIED] = true; 2568 force->flag [FLAG_APPLIED] = true;
2574 2569
2575 insert (force); 2570 return insert (force);
2576} 2571}
2577 2572
2578void 2573void
2579object::play_sound (faceidx sound) 2574object::play_sound (faceidx sound) const
2580{ 2575{
2581 if (!sound) 2576 if (!sound)
2582 return; 2577 return;
2583 2578
2584 if (flag [FLAG_REMOVED]) 2579 if (is_on_map ())
2580 map->play_sound (sound, x, y);
2581 else if (object *pl = in_player ())
2582 pl->contr->play_sound (sound);
2583}
2584
2585void
2586object::say_msg (const char *msg) const
2587{
2588 if (is_on_map ())
2589 map->say_msg (msg, x, y);
2590 else if (object *pl = in_player ())
2591 pl->contr->play_sound (sound);
2592}
2593
2594void
2595object::make_noise ()
2596{
2597 // we do not model noise in the map, so instead put
2598 // a temporary light into the noise source
2599 // could use the map instead, but that's less reliable for our
2600 // goal, which is to make invisibility a bit harder to exploit
2601
2602 // currently only works sensibly for players
2603 if (!is_player ())
2585 return; 2604 return;
2586 2605
2587 if (env) 2606 // find old force, or create new one
2588 { 2607 object *force = force_find (shstr_noise_force);
2589 if (object *pl = in_player ()) 2608
2590 pl->contr->play_sound (sound); 2609 if (force)
2591 } 2610 force->speed_left = -1.f; // patch old speed up
2592 else 2611 else
2593 map->play_sound (sound, x, y); 2612 {
2594} 2613 force = archetype::get (shstr_noise_force);
2595 2614
2615 force->slaying = shstr_noise_force;
2616 force->stats.food = 1;
2617 force->speed_left = -1.f;
2618
2619 force->set_speed (1.f / 4.f);
2620 force->flag [FLAG_IS_USED_UP] = true;
2621 force->flag [FLAG_APPLIED] = true;
2622
2623 insert (force);
2624 }
2625}
2626

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines