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.248 by root, Mon Jul 14 23:47:06 2008 UTC vs.
Revision 1.302 by root, Tue Nov 10 00:01:31 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,
… …
48 0, 52 0,
49 -1, -1, 0, 1, 1, 1, 0, -1, 53 -1, -1, 0, 1, 1, 1, 0, -1,
50 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, 54 -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
51 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 55 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
52}; 56};
53int maxfree[SIZEOFFREE] = {
54 0,
55 9, 10, 13, 14, 17, 18, 21, 22,
56 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
57 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
58};
59int freedir[SIZEOFFREE] = { 57int freedir[SIZEOFFREE] = {
60 0, 58 0,
61 1, 2, 3, 4, 5, 6, 7, 8, 59 1, 2, 3, 4, 5, 6, 7, 8,
62 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 60 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
63 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 61 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
62};
63
64static int maxfree[SIZEOFFREE] = {
65 0,
66 9, 10, 13, 14, 17, 18, 21, 22,
67 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
68 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
64}; 69};
65 70
66static void 71static void
67write_uuid (uval64 skip, bool sync) 72write_uuid (uval64 skip, bool sync)
68{ 73{
… …
96 101
97 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 102 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98 _exit (1); 103 _exit (1);
99 } 104 }
100 105
101 UUID::BUF buf; 106 char buf [UUID::MAX_LEN];
102 buf[0] = 0; 107 buf[0] = 0;
103 fgets (buf, sizeof (buf), fp); 108 fgets (buf, sizeof (buf), fp);
104 109
105 if (!UUID::cur.parse (buf)) 110 if (!UUID::cur.parse (buf))
106 { 111 {
… …
133 138
134void 139void
135UUID::init () 140UUID::init ()
136{ 141{
137 read_uuid (); 142 read_uuid ();
143}
144
145bool
146UUID::parse (const char *s)
147{
148 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
149 return false;
150
151 seq = 0;
152
153 while (*s != '>')
154 {
155 if (*s < '0')
156 return false;
157
158 // this gives nice branchless code with gcc
159 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
160 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
161
162 seq = (seq << 4) | digit;
163
164 ++s;
165 }
166
167 return true;
168}
169
170char *
171UUID::append (char *buf) const
172{
173 *buf++ = '<';
174 *buf++ = '1';
175 *buf++ = '.';
176
177 uint64_t seq = this->seq;
178 const int bits = 64;
179 char nz = 0;
180 static const char tohex [] = "0123456789abcdef";
181
182 // assert (len >= 3 + bits / 4 + 1 + 1);
183 for (int i = bits / 4; --i; )
184 {
185 uint8_t digit = seq >> (bits - 4);
186
187 *buf = tohex [digit];
188 nz |= digit;
189 buf += nz ? 1 : 0;
190 seq <<= 4;
191 }
192
193 // last digit is special - always emit
194 uint8_t digit = seq >> (bits - 4);
195 *buf++ = tohex [digit];
196
197 *buf++ = '>';
198
199 return buf;
200}
201
202char *
203UUID::c_str () const
204{
205 static char buf [MAX_LEN];
206 *append (buf) = 0;
207 return buf;
138} 208}
139 209
140/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 210/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
141static bool 211static bool
142compare_ob_value_lists_one (const object *wants, const object *has) 212compare_ob_value_lists_one (const object *wants, const object *has)
… …
181bool object::can_merge_slow (object *ob1, object *ob2) 251bool object::can_merge_slow (object *ob1, object *ob2)
182{ 252{
183 /* A couple quicksanity checks */ 253 /* A couple quicksanity checks */
184 if (ob1 == ob2 254 if (ob1 == ob2
185 || ob1->type != ob2->type 255 || ob1->type != ob2->type
186 || ob1->speed != ob2->speed 256 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
187 || ob1->value != ob2->value 257 || ob1->value != ob2->value
188 || ob1->name != ob2->name) 258 || ob1->name != ob2->name)
189 return 0; 259 return 0;
190 260
191 /* Do not merge objects if nrof would overflow. First part checks 261 /* Do not merge objects if nrof would overflow, assume nrof
192 * for unsigned overflow (2c), second part checks whether the result 262 * is always 0 .. 2**31-1 */
193 * would fit into a 32 bit signed int, which is often used to hold 263 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; 264 return 0;
198 265
199 /* If the objects have been identified, set the BEEN_APPLIED flag. 266 /* 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 267 * 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 268 * just can't ignore the been applied or identified flags, as they
… …
228 || ob1->move_block != ob2->move_block 295 || ob1->move_block != ob2->move_block
229 || ob1->move_allow != ob2->move_allow 296 || ob1->move_allow != ob2->move_allow
230 || ob1->move_on != ob2->move_on 297 || ob1->move_on != ob2->move_on
231 || ob1->move_off != ob2->move_off 298 || ob1->move_off != ob2->move_off
232 || ob1->move_slow != ob2->move_slow 299 || ob1->move_slow != ob2->move_slow
233 || ob1->move_slow_penalty != ob2->move_slow_penalty 300 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
234 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 301 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
235 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 302 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
236 return 0; 303 return 0;
237 304
238 if ((ob1->flag ^ ob2->flag) 305 if ((ob1->flag ^ ob2->flag)
239 .reset (FLAG_INV_LOCKED) 306 .reset (FLAG_INV_LOCKED)
240 .reset (FLAG_CLIENT_SENT)
241 .reset (FLAG_REMOVED) 307 .reset (FLAG_REMOVED)
242 .any ()) 308 .any ())
243 return 0; 309 return 0;
244 310
245 /* This is really a spellbook check - we should in general 311 /* This is really a spellbook check - we should in general
… …
327 { 393 {
328 // see if we are in a container of sorts 394 // see if we are in a container of sorts
329 if (env) 395 if (env)
330 { 396 {
331 // the player inventory itself is always visible 397 // the player inventory itself is always visible
332 if (env->type == PLAYER) 398 if (env->is_player ())
333 return env; 399 return env;
334 400
335 // else a player could have our env open 401 // else a player could have our env open
336 object *envest = env->outer_env (); 402 object *envest = env->outer_env_or_self ();
337 403
338 // the player itself is always on a map, so we will find him here 404 // the player itself is always on a map, so we will find him here
339 // even if our inv is in a player. 405 // even if our inv is in a player.
340 if (envest->is_on_map ()) 406 if (envest->is_on_map ())
341 if (object *pl = envest->ms ().player ()) 407 if (object *pl = envest->ms ().player ())
342 if (pl->container == env) 408 if (pl->container_ () == env)
343 return pl; 409 return pl;
344 } 410 }
345 else 411 else
346 { 412 {
347 // maybe there is a player standing on the same mapspace 413 // maybe there is a player standing on the same mapspace
348 // this will catch the case where "this" is a player 414 // this will catch the case where "this" is a player
349 if (object *pl = ms ().player ()) 415 if (object *pl = ms ().player ())
350 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 416 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
351 || this == pl->container) 417 || pl->container_ () == this)
352 return pl; 418 return pl;
353 } 419 }
354 } 420 }
355 421
356 return 0; 422 return 0;
… …
434 object_freezer freezer; 500 object_freezer freezer;
435 op->write (freezer); 501 op->write (freezer);
436 return freezer.as_string (); 502 return freezer.as_string ();
437} 503}
438 504
439/* 505char *
440 * get_nearest_part(multi-object, object 2) returns the part of the 506object::as_string ()
441 * multi-object 1 which is closest to the second object.
442 * If it's not a multi-object, it is returned.
443 */
444object *
445get_nearest_part (object *op, const object *pl)
446{ 507{
447 object *tmp, *closest; 508 return dump_object (this);
448 int last_dist, i;
449
450 if (!op->more)
451 return op;
452
453 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
454 tmp;
455 tmp = tmp->more)
456 if ((i = distance (tmp, pl)) < last_dist)
457 closest = tmp, last_dist = i;
458
459 return closest;
460} 509}
461 510
462/* 511/*
463 * Returns the object which has the count-variable equal to the argument. 512 * Returns the object which has the count-variable equal to the argument.
464 * VERRRY slow. 513 * VERRRY slow.
… …
558 update_stats (); 607 update_stats ();
559 608
560 new_draw_info_format (NDI_UNIQUE, 0, this, 609 new_draw_info_format (NDI_UNIQUE, 0, this,
561 "You try to balance all your items at once, " 610 "You try to balance all your items at once, "
562 "but the %s is just too much for your body. " 611 "but the %s is just too much for your body. "
563 "[You need to unapply some items first.]", &ob->name); 612 "[You need to unapply some items first - use the 'body' command to see "
613 "how many items you cna wera on a specific body part.]", &ob->name);
564 return false; 614 return false;
565 } 615 }
566 616
567 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 617 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
568 } 618 }
… …
640 } 690 }
641 691
642 if (speed < 0) 692 if (speed < 0)
643 dst->speed_left -= rndm (); 693 dst->speed_left -= rndm ();
644 694
645 dst->set_speed (dst->speed); 695 dst->activate ();
646} 696}
647 697
648void 698void
649object::instantiate () 699object::instantiate ()
650{ 700{
… …
694 * This function needs to be called whenever the speed of an object changes. 744 * This function needs to be called whenever the speed of an object changes.
695 */ 745 */
696void 746void
697object::set_speed (float speed) 747object::set_speed (float speed)
698{ 748{
699 if (flag [FLAG_FREED] && speed)
700 {
701 LOG (llevError, "Object %s is freed but has speed.\n", &name);
702 speed = 0;
703 }
704
705 this->speed = speed; 749 this->speed = speed;
706 750
707 if (has_active_speed ()) 751 if (has_active_speed ())
708 activate (); 752 activate ();
709 else 753 else
… …
759 803
760 if (!(m.flags_ & P_UPTODATE)) 804 if (!(m.flags_ & P_UPTODATE))
761 /* nop */; 805 /* nop */;
762 else if (action == UP_OBJ_INSERT) 806 else if (action == UP_OBJ_INSERT)
763 { 807 {
808#if 0
764 // this is likely overkill, TODO: revisit (schmorp) 809 // this is likely overkill, TODO: revisit (schmorp)
765 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 810 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
766 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 811 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
767 || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) 812 || (op->is_player () && !(m.flags_ & P_PLAYER))
768 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 813 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
769 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) 814 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
770 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) 815 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
771 || (m.move_on | op->move_on ) != m.move_on 816 || (m.move_on | op->move_on ) != m.move_on
772 || (m.move_off | op->move_off ) != m.move_off 817 || (m.move_off | op->move_off ) != m.move_off
773 || (m.move_slow | op->move_slow) != m.move_slow 818 || (m.move_slow | op->move_slow) != m.move_slow
774 /* This isn't perfect, but I don't expect a lot of objects to 819 /* This isn't perfect, but I don't expect a lot of objects to
775 * to have move_allow right now. 820 * have move_allow right now.
776 */ 821 */
777 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 822 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
823 m.invalidate ();
824#else
778 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) 825 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
779 m.flags_ = 0; 826 m.invalidate ();
827#endif
780 } 828 }
781 /* if the object is being removed, we can't make intelligent 829 /* if the object is being removed, we can't make intelligent
782 * decisions, because remove_ob can't really pass the object 830 * decisions, because remove_ob can't really pass the object
783 * that is being removed. 831 * that is being removed.
784 */ 832 */
785 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 833 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
786 m.flags_ = 0; 834 m.invalidate ();
787 else if (action == UP_OBJ_FACE) 835 else if (action == UP_OBJ_FACE)
788 /* Nothing to do for that case */ ; 836 /* Nothing to do for that case */ ;
789 else 837 else
790 LOG (llevError, "update_object called with invalid action: %d\n", action); 838 LOG (llevError, "update_object called with invalid action: %d\n", action);
791 839
… …
795 843
796object::object () 844object::object ()
797{ 845{
798 SET_FLAG (this, FLAG_REMOVED); 846 SET_FLAG (this, FLAG_REMOVED);
799 847
800 expmul = 1.0; 848 //expmul = 1.0; declared const for the time being
801 face = blank_face; 849 face = blank_face;
802} 850}
803 851
804object::~object () 852object::~object ()
805{ 853{
… …
835 /* If already on active list, don't do anything */ 883 /* If already on active list, don't do anything */
836 if (active) 884 if (active)
837 return; 885 return;
838 886
839 if (has_active_speed ()) 887 if (has_active_speed ())
888 {
889 if (flag [FLAG_FREED])
890 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
891
840 actives.insert (this); 892 actives.insert (this);
893 }
841} 894}
842 895
843void 896void
844object::activate_recursive () 897object::activate_recursive ()
845{ 898{
… …
910 || map->in_memory != MAP_ACTIVE 963 || map->in_memory != MAP_ACTIVE
911 || map->no_drop 964 || map->no_drop
912 || ms ().move_block == MOVE_ALL) 965 || ms ().move_block == MOVE_ALL)
913 { 966 {
914 while (inv) 967 while (inv)
915 {
916 inv->destroy_inv (false);
917 inv->destroy (); 968 inv->destroy ();
918 }
919 } 969 }
920 else 970 else
921 { /* Put objects in inventory onto this space */ 971 { /* Put objects in inventory onto this space */
922 while (inv) 972 while (inv)
923 { 973 {
… …
927 || op->flag [FLAG_NO_DROP] 977 || op->flag [FLAG_NO_DROP]
928 || op->type == RUNE 978 || op->type == RUNE
929 || op->type == TRAP 979 || op->type == TRAP
930 || op->flag [FLAG_IS_A_TEMPLATE] 980 || op->flag [FLAG_IS_A_TEMPLATE]
931 || op->flag [FLAG_DESTROY_ON_DEATH]) 981 || op->flag [FLAG_DESTROY_ON_DEATH])
932 op->destroy (true); 982 op->destroy ();
933 else 983 else
934 map->insert (op, x, y); 984 map->insert (op, x, y);
935 } 985 }
936 } 986 }
937} 987}
… …
966 1016
967void 1017void
968object::do_destroy () 1018object::do_destroy ()
969{ 1019{
970 if (flag [FLAG_IS_LINKED]) 1020 if (flag [FLAG_IS_LINKED])
971 remove_button_link (this); 1021 remove_link ();
972 1022
973 if (flag [FLAG_FRIENDLY]) 1023 if (flag [FLAG_FRIENDLY])
974 remove_friendly_object (this); 1024 remove_friendly_object (this);
975 1025
976 remove (); 1026 remove ();
… …
1001 attacked_by = 0; 1051 attacked_by = 0;
1002 current_weapon = 0; 1052 current_weapon = 0;
1003} 1053}
1004 1054
1005void 1055void
1006object::destroy (bool destroy_inventory) 1056object::destroy ()
1007{ 1057{
1008 if (destroyed ()) 1058 if (destroyed ())
1009 return; 1059 return;
1010 1060
1011 if (!is_head () && !head->destroyed ()) 1061 if (!is_head () && !head->destroyed ())
1012 { 1062 {
1013 LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); 1063 LOG (llevError | logBacktrace, "tried to destroy the tail of an object");
1014 head->destroy (destroy_inventory); 1064 head->destroy ();
1015 return; 1065 return;
1016 } 1066 }
1017 1067
1018 destroy_inv (!destroy_inventory); 1068 destroy_inv (false);
1019 1069
1020 if (is_head ()) 1070 if (is_head ())
1021 if (sound_destroy) 1071 if (sound_destroy)
1022 play_sound (sound_destroy); 1072 play_sound (sound_destroy);
1023 else if (flag [FLAG_MONSTER]) 1073 else if (flag [FLAG_MONSTER])
… …
1034 * the previous environment. 1084 * the previous environment.
1035 */ 1085 */
1036void 1086void
1037object::do_remove () 1087object::do_remove ()
1038{ 1088{
1039 object *tmp, *last = 0;
1040 object *otmp;
1041
1042 if (flag [FLAG_REMOVED]) 1089 if (flag [FLAG_REMOVED])
1043 return; 1090 return;
1044 1091
1045 INVOKE_OBJECT (REMOVE, this); 1092 INVOKE_OBJECT (REMOVE, this);
1046 1093
… …
1059 if (object *pl = visible_to ()) 1106 if (object *pl = visible_to ())
1060 esrv_del_item (pl->contr, count); 1107 esrv_del_item (pl->contr, count);
1061 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed 1108 flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed
1062 1109
1063 adjust_weight (env, -total_weight ()); 1110 adjust_weight (env, -total_weight ());
1111
1112 object *pl = in_player ();
1064 1113
1065 /* we set up values so that it could be inserted into 1114 /* we set up values so that it could be inserted into
1066 * the map, but we don't actually do that - it is up 1115 * the map, but we don't actually do that - it is up
1067 * to the caller to decide what we want to do. 1116 * to the caller to decide what we want to do.
1068 */ 1117 */
… …
1080 1129
1081 /* NO_FIX_PLAYER is set when a great many changes are being 1130 /* NO_FIX_PLAYER is set when a great many changes are being
1082 * made to players inventory. If set, avoiding the call 1131 * made to players inventory. If set, avoiding the call
1083 * to save cpu time. 1132 * to save cpu time.
1084 */ 1133 */
1085 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1134 if (pl)
1135 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1136 {
1086 otmp->update_stats (); 1137 pl->update_stats ();
1138
1139 if (glow_radius && pl->is_on_map ())
1140 update_all_los (pl->map, pl->x, pl->y);
1141 }
1087 } 1142 }
1088 else if (map) 1143 else if (map)
1089 { 1144 {
1090 map->dirty = true; 1145 map->dirty = true;
1091 mapspace &ms = this->ms (); 1146 mapspace &ms = this->ms ();
1092 1147
1093 if (object *pl = ms.player ()) 1148 if (object *pl = ms.player ())
1094 { 1149 {
1095 if (type == PLAYER) // this == pl(!) 1150 if (is_player ())
1096 { 1151 {
1152 if (!flag [FLAG_WIZPASS])
1153 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1154
1097 // leaving a spot always closes any open container on the ground 1155 // leaving a spot always closes any open container on the ground
1098 if (container && !container->env) 1156 if (container && !container->env)
1099 // this causes spurious floorbox updates, but it ensures 1157 // this causes spurious floorbox updates, but it ensures
1100 // that the CLOSE event is being sent. 1158 // that the CLOSE event is being sent.
1101 close_container (); 1159 close_container ();
1102 1160
1103 --map->players; 1161 --map->players;
1104 map->touch (); 1162 map->touch ();
1105 } 1163 }
1106 else if (pl->container == this) 1164 else if (pl->container_ () == this)
1107 { 1165 {
1108 // removing a container should close it 1166 // removing a container should close it
1109 close_container (); 1167 close_container ();
1110 } 1168 }
1111 1169
… …
1118 *(below ? &below->above : &ms.bot) = above; 1176 *(below ? &below->above : &ms.bot) = above;
1119 1177
1120 above = 0; 1178 above = 0;
1121 below = 0; 1179 below = 0;
1122 1180
1181 ms.invalidate ();
1182
1123 if (map->in_memory == MAP_SAVING) 1183 if (map->in_memory == MAP_SAVING)
1124 return; 1184 return;
1125 1185
1126 int check_walk_off = !flag [FLAG_NO_APPLY]; 1186 int check_walk_off = !flag [FLAG_NO_APPLY];
1127 1187
1128 if (object *pl = ms.player ()) 1188 if (object *pl = ms.player ())
1129 { 1189 {
1130 if (pl->container == this) 1190 if (pl->container_ () == this)
1131 /* If a container that the player is currently using somehow gets 1191 /* If a container that the player is currently using somehow gets
1132 * removed (most likely destroyed), update the player view 1192 * removed (most likely destroyed), update the player view
1133 * appropriately. 1193 * appropriately.
1134 */ 1194 */
1135 pl->close_container (); 1195 pl->close_container ();
… …
1139 //TODO: update floorbox to preserve ordering 1199 //TODO: update floorbox to preserve ordering
1140 if (pl->contr->ns) 1200 if (pl->contr->ns)
1141 pl->contr->ns->floorbox_update (); 1201 pl->contr->ns->floorbox_update ();
1142 } 1202 }
1143 1203
1204 if (check_walk_off)
1144 for (tmp = ms.bot; tmp; tmp = tmp->above) 1205 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1145 { 1206 {
1207 above = tmp->above;
1208
1146 /* No point updating the players look faces if he is the object 1209 /* No point updating the players look faces if he is the object
1147 * being removed. 1210 * being removed.
1148 */ 1211 */
1149 1212
1150 /* See if object moving off should effect something */ 1213 /* See if object moving off should effect something */
1151 if (check_walk_off
1152 && ((move_type & tmp->move_off) 1214 if ((move_type & tmp->move_off)
1153 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1215 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1154 {
1155 move_apply (tmp, this, 0); 1216 move_apply (tmp, this, 0);
1156
1157 if (destroyed ())
1158 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1159 } 1217 }
1160 1218
1161 last = tmp; 1219 if (affects_los ())
1162 }
1163
1164 /* last == NULL if there are no objects on this space */
1165 //TODO: this makes little sense, why only update the topmost object?
1166 if (!last)
1167 map->at (x, y).flags_ = 0;
1168 else
1169 update_object (last, UP_OBJ_REMOVE);
1170
1171 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1172 update_all_los (map, x, y); 1220 update_all_los (map, x, y);
1173 } 1221 }
1174} 1222}
1175 1223
1176/* 1224/*
… …
1200 esrv_update_item (UPD_NROF, pl, top); 1248 esrv_update_item (UPD_NROF, pl, top);
1201 1249
1202 op->weight = 0; // cancel the addition above 1250 op->weight = 0; // cancel the addition above
1203 op->carrying = 0; // must be 0 already 1251 op->carrying = 0; // must be 0 already
1204 1252
1205 op->destroy (1); 1253 op->destroy ();
1206 1254
1207 return top; 1255 return top;
1208 } 1256 }
1209 1257
1210 return 0; 1258 return 0;
… …
1272 * just 'op' otherwise 1320 * just 'op' otherwise
1273 */ 1321 */
1274object * 1322object *
1275insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1323insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1276{ 1324{
1277 if (op->is_on_map ())
1278 {
1279 LOG (llevError, "insert_ob_in_map called for object already on map");
1280 abort ();
1281 }
1282
1283 if (op->env)
1284 {
1285 LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)");
1286 op->remove (); 1325 op->remove ();
1287 }
1288 1326
1289 if (op->face && !face_info (op->face))//D TODO: remove soon 1327 if (m == &freed_map)//D TODO: remove soon
1290 {//D 1328 {//D
1291 LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D 1329 LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D
1292 op->face = 1;//D
1293 }//D 1330 }//D
1294 1331
1295 /* Ideally, the caller figures this out. However, it complicates a lot 1332 /* Ideally, the caller figures this out. However, it complicates a lot
1296 * of areas of callers (eg, anything that uses find_free_spot would now 1333 * of areas of callers (eg, anything that uses find_free_spot would now
1297 * need extra work 1334 * need extra work
1298 */ 1335 */
1336 maptile *newmap = m;
1299 if (!xy_normalise (m, op->x, op->y)) 1337 if (!xy_normalise (newmap, op->x, op->y))
1300 { 1338 {
1301 op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found 1339 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1302 return 0; 1340 return 0;
1303 } 1341 }
1304 1342
1305 if (object *more = op->more) 1343 if (object *more = op->more)
1306 if (!insert_ob_in_map (more, m, originator, flag)) 1344 if (!insert_ob_in_map (more, m, originator, flag))
1307 return 0; 1345 return 0;
1308 1346
1309 CLEAR_FLAG (op, FLAG_REMOVED); 1347 op->flag [FLAG_REMOVED] = false;
1310 1348 op->env = 0;
1311 op->map = m; 1349 op->map = newmap;
1350
1312 mapspace &ms = op->ms (); 1351 mapspace &ms = op->ms ();
1313 1352
1314 /* this has to be done after we translate the coordinates. 1353 /* this has to be done after we translate the coordinates.
1315 */ 1354 */
1316 if (op->nrof && !(flag & INS_NO_MERGE)) 1355 if (op->nrof && !(flag & INS_NO_MERGE))
… …
1319 { 1358 {
1320 // TODO: we actually want to update tmp, not op, 1359 // TODO: we actually want to update tmp, not op,
1321 // but some caller surely breaks when we return tmp 1360 // but some caller surely breaks when we return tmp
1322 // from here :/ 1361 // from here :/
1323 op->nrof += tmp->nrof; 1362 op->nrof += tmp->nrof;
1324 tmp->destroy (1); 1363 tmp->destroy ();
1325 } 1364 }
1326 1365
1327 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1366 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1328 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1367 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1329 1368
… …
1337 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1376 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1338 abort (); 1377 abort ();
1339 } 1378 }
1340 1379
1341 if (!originator->is_on_map ()) 1380 if (!originator->is_on_map ())
1381 {
1342 LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", 1382 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1343 op->debug_desc (), originator->debug_desc ()); 1383 op->debug_desc (), originator->debug_desc ());
1384 abort ();
1385 }
1344 1386
1345 op->above = originator; 1387 op->above = originator;
1346 op->below = originator->below; 1388 op->below = originator->below;
1347 originator->below = op; 1389 originator->below = op;
1348 1390
… …
1434 op->below = top; 1476 op->below = top;
1435 *(op->above ? &op->above->below : &ms.top) = op; 1477 *(op->above ? &op->above->below : &ms.top) = op;
1436 } 1478 }
1437 } 1479 }
1438 1480
1439 if (op->type == PLAYER) 1481 if (op->is_player ())
1440 { 1482 {
1441 op->contr->do_los = 1; 1483 op->contr->do_los = 1;
1442 ++op->map->players; 1484 ++op->map->players;
1443 op->map->touch (); 1485 op->map->touch ();
1444 } 1486 }
… …
1459 * be far away from this change and not affected in any way - 1501 * be far away from this change and not affected in any way -
1460 * this should get redone to only look for players within range, 1502 * this should get redone to only look for players within range,
1461 * or just updating the P_UPTODATE for spaces within this area 1503 * or just updating the P_UPTODATE for spaces within this area
1462 * of effect may be sufficient. 1504 * of effect may be sufficient.
1463 */ 1505 */
1464 if (op->map->darkness && (op->glow_radius != 0)) 1506 if (op->affects_los ())
1507 {
1508 op->ms ().invalidate ();
1465 update_all_los (op->map, op->x, op->y); 1509 update_all_los (op->map, op->x, op->y);
1510 }
1466 1511
1467 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1512 /* updates flags (blocked, alive, no magic, etc) for this map space */
1468 update_object (op, UP_OBJ_INSERT); 1513 update_object (op, UP_OBJ_INSERT);
1469 1514
1470 INVOKE_OBJECT (INSERT, op); 1515 INVOKE_OBJECT (INSERT, op);
… …
1477 * blocked() and wall() work properly), and these flags are updated by 1522 * blocked() and wall() work properly), and these flags are updated by
1478 * update_object(). 1523 * update_object().
1479 */ 1524 */
1480 1525
1481 /* if this is not the head or flag has been passed, don't check walk on status */ 1526 /* if this is not the head or flag has been passed, don't check walk on status */
1482 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1527 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1483 { 1528 {
1484 if (check_move_on (op, originator)) 1529 if (check_move_on (op, originator))
1485 return 0; 1530 return 0;
1486 1531
1487 /* If we are a multi part object, lets work our way through the check 1532 /* If we are a multi part object, lets work our way through the check
… …
1498/* this function inserts an object in the map, but if it 1543/* this function inserts an object in the map, but if it
1499 * finds an object of its own type, it'll remove that one first. 1544 * finds an object of its own type, it'll remove that one first.
1500 * op is the object to insert it under: supplies x and the map. 1545 * op is the object to insert it under: supplies x and the map.
1501 */ 1546 */
1502void 1547void
1503replace_insert_ob_in_map (const char *arch_string, object *op) 1548replace_insert_ob_in_map (shstr_tmp archname, object *op)
1504{ 1549{
1505 /* first search for itself and remove any old instances */ 1550 /* first search for itself and remove any old instances */
1506 1551
1507 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1552 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1508 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1553 if (tmp->arch->archname == archname) /* same archetype */
1509 tmp->destroy (1); 1554 tmp->destroy ();
1510 1555
1511 object *tmp = arch_to_object (archetype::find (arch_string)); 1556 object *tmp = arch_to_object (archetype::find (archname));
1512 1557
1513 tmp->x = op->x; 1558 tmp->x = op->x;
1514 tmp->y = op->y; 1559 tmp->y = op->y;
1515 1560
1516 insert_ob_in_map (tmp, op->map, op, 0); 1561 insert_ob_in_map (tmp, op->map, op, 0);
… …
1521{ 1566{
1522 if (where->env) 1567 if (where->env)
1523 return where->env->insert (this); 1568 return where->env->insert (this);
1524 else 1569 else
1525 return where->map->insert (this, where->x, where->y, originator, flags); 1570 return where->map->insert (this, where->x, where->y, originator, flags);
1571}
1572
1573// check whether we can put this into the map, respect max_volume, max_items
1574bool
1575object::can_drop_at (maptile *m, int x, int y, object *originator)
1576{
1577 mapspace &ms = m->at (x, y);
1578
1579 int items = ms.items ();
1580
1581 if (!items // testing !items ensures we can drop at least one item
1582 || (items < m->max_items
1583 && ms.volume () < m->max_volume))
1584 return true;
1585
1586 if (originator && originator->is_player ())
1587 originator->contr->failmsg (format (
1588 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1589 query_name ()
1590 ));
1591
1592 return false;
1526} 1593}
1527 1594
1528/* 1595/*
1529 * decrease(object, number) decreases a specified number from 1596 * decrease(object, number) decreases a specified number from
1530 * the amount of an object. If the amount reaches 0, the object 1597 * the amount of an object. If the amount reaches 0, the object
… …
1538 if (!nr) 1605 if (!nr)
1539 return true; 1606 return true;
1540 1607
1541 nr = min (nr, nrof); 1608 nr = min (nr, nrof);
1542 1609
1610 if (nrof > nr)
1611 {
1543 nrof -= nr; 1612 nrof -= nr;
1544
1545 if (nrof)
1546 {
1547 adjust_weight (env, -weight * max (1, nr)); // carrying == 0 1613 adjust_weight (env, -weight * max (1, nr)); // carrying == 0
1548 1614
1549 if (object *pl = visible_to ()) 1615 if (object *pl = visible_to ())
1550 esrv_update_item (UPD_NROF, pl, this); 1616 esrv_update_item (UPD_NROF, pl, this);
1551 1617
1552 return true; 1618 return true;
1553 } 1619 }
1554 else 1620 else
1555 { 1621 {
1556 destroy (1); 1622 destroy ();
1557 return false; 1623 return false;
1558 } 1624 }
1559} 1625}
1560 1626
1561/* 1627/*
… …
1638 if (object *pl = tmp->visible_to ()) 1704 if (object *pl = tmp->visible_to ())
1639 esrv_update_item (UPD_NROF, pl, tmp); 1705 esrv_update_item (UPD_NROF, pl, tmp);
1640 1706
1641 adjust_weight (this, op->total_weight ()); 1707 adjust_weight (this, op->total_weight ());
1642 1708
1643 op->destroy (1); 1709 op->destroy ();
1644 op = tmp; 1710 op = tmp;
1645 goto inserted; 1711 goto inserted;
1646 } 1712 }
1647 1713
1648 op->owner = 0; // it's his/hers now. period. 1714 op->owner = 0; // it's his/hers now. period.
… …
1666 1732
1667 adjust_weight (this, op->total_weight ()); 1733 adjust_weight (this, op->total_weight ());
1668 1734
1669inserted: 1735inserted:
1670 /* reset the light list and los of the players on the map */ 1736 /* reset the light list and los of the players on the map */
1671 if (op->glow_radius && map && map->darkness) 1737 if (op->glow_radius && is_on_map ())
1738 {
1739 update_stats ();
1672 update_all_los (map, x, y); 1740 update_all_los (map, x, y);
1673 1741 }
1742 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER])
1674 // if this is a player's inventory, update stats 1743 // if this is a player's inventory, update stats
1675 if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER])
1676 update_stats (); 1744 update_stats ();
1677 1745
1678 INVOKE_OBJECT (INSERT, this); 1746 INVOKE_OBJECT (INSERT, this);
1679 1747
1680 return op; 1748 return op;
… …
1701 * on top. 1769 * on top.
1702 */ 1770 */
1703int 1771int
1704check_move_on (object *op, object *originator) 1772check_move_on (object *op, object *originator)
1705{ 1773{
1774 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1775 return 0;
1776
1706 object *tmp; 1777 object *tmp;
1707 maptile *m = op->map; 1778 maptile *m = op->map;
1708 int x = op->x, y = op->y; 1779 int x = op->x, y = op->y;
1709 1780
1710 MoveType move_on, move_slow, move_block; 1781 mapspace &ms = m->at (x, y);
1711 1782
1712 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1783 ms.update ();
1713 return 0;
1714 1784
1715 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1785 MoveType move_on = ms.move_on;
1716 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1786 MoveType move_slow = ms.move_slow;
1717 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1787 MoveType move_block = ms.move_block;
1718 1788
1719 /* if nothing on this space will slow op down or be applied, 1789 /* if nothing on this space will slow op down or be applied,
1720 * no need to do checking below. have to make sure move_type 1790 * no need to do checking below. have to make sure move_type
1721 * is set, as lots of objects don't have it set - we treat that 1791 * is set, as lots of objects don't have it set - we treat that
1722 * as walking. 1792 * as walking.
… …
1733 return 0; 1803 return 0;
1734 1804
1735 /* The objects have to be checked from top to bottom. 1805 /* The objects have to be checked from top to bottom.
1736 * Hence, we first go to the top: 1806 * Hence, we first go to the top:
1737 */ 1807 */
1738 1808 for (object *next, *tmp = ms.top; tmp; tmp = next)
1739 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1740 {
1741 /* Trim the search when we find the first other spell effect
1742 * this helps performance so that if a space has 50 spell objects,
1743 * we don't need to check all of them.
1744 */
1745 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1746 break;
1747 } 1809 {
1810 next = tmp->below;
1748 1811
1749 for (; tmp; tmp = tmp->below)
1750 {
1751 if (tmp == op) 1812 if (tmp == op)
1752 continue; /* Can't apply yourself */ 1813 continue; /* Can't apply yourself */
1753 1814
1754 /* Check to see if one of the movement types should be slowed down. 1815 /* Check to see if one of the movement types should be slowed down.
1755 * Second check makes sure that the movement types not being slowed 1816 * Second check makes sure that the movement types not being slowed
… …
1760 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1821 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1761 { 1822 {
1762 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1823 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1763 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1824 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1764 { 1825 {
1765
1766 float
1767 diff = tmp->move_slow_penalty * fabs (op->speed); 1826 float diff = tmp->move_slow_penalty * fabs (op->speed);
1768 1827
1769 if (op->type == PLAYER) 1828 if (op->is_player ())
1770 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1829 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1771 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1830 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1772 diff /= 4.0; 1831 diff /= 4.0;
1773 1832
1774 op->speed_left -= diff; 1833 op->speed_left -= diff;
1775 } 1834 }
1776 } 1835 }
… …
1982 * head of the object should correspond for the entire object. 2041 * head of the object should correspond for the entire object.
1983 */ 2042 */
1984 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) 2043 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
1985 continue; 2044 continue;
1986 2045
1987 if (ob->blocked (m, pos.x, pos.y)) 2046 if (ob->blocked (pos.m, pos.x, pos.y))
1988 continue; 2047 continue;
1989 2048
1990 altern [index++] = i; 2049 altern [index++] = i;
1991 } 2050 }
1992 2051
… …
2060 * there is capable of. 2119 * there is capable of.
2061 */ 2120 */
2062int 2121int
2063find_dir (maptile *m, int x, int y, object *exclude) 2122find_dir (maptile *m, int x, int y, object *exclude)
2064{ 2123{
2065 int i, max = SIZEOFFREE, mflags; 2124 int max = SIZEOFFREE, mflags;
2066
2067 sint16 nx, ny;
2068 object *tmp;
2069 maptile *mp;
2070
2071 MoveType blocked, move_type; 2125 MoveType move_type;
2072 2126
2073 if (exclude && exclude->head_ () != exclude) 2127 if (exclude && exclude->head_ () != exclude)
2074 { 2128 {
2075 exclude = exclude->head; 2129 exclude = exclude->head;
2076 move_type = exclude->move_type; 2130 move_type = exclude->move_type;
… …
2079 { 2133 {
2080 /* If we don't have anything, presume it can use all movement types. */ 2134 /* If we don't have anything, presume it can use all movement types. */
2081 move_type = MOVE_ALL; 2135 move_type = MOVE_ALL;
2082 } 2136 }
2083 2137
2084 for (i = 1; i < max; i++) 2138 for (int i = 1; i < max; i++)
2085 { 2139 {
2086 mp = m; 2140 mapxy pos (m, x, y);
2087 nx = x + freearr_x[i]; 2141 pos.move (i);
2088 ny = y + freearr_y[i];
2089 2142
2090 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2143 if (!pos.normalise ())
2091
2092 if (mflags & P_OUT_OF_MAP)
2093 max = maxfree[i]; 2144 max = maxfree[i];
2094 else 2145 else
2095 { 2146 {
2096 mapspace &ms = mp->at (nx, ny); 2147 mapspace &ms = *pos;
2097 2148
2098 blocked = ms.move_block;
2099
2100 if ((move_type & blocked) == move_type) 2149 if ((move_type & ms.move_block) == move_type)
2101 max = maxfree[i]; 2150 max = maxfree [i];
2102 else if (mflags & P_IS_ALIVE) 2151 else if (ms.flags () & P_IS_ALIVE)
2103 { 2152 {
2104 for (tmp = ms.bot; tmp; tmp = tmp->above) 2153 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2105 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2154 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2106 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2155 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2107 break;
2108
2109 if (tmp)
2110 return freedir[i]; 2156 return freedir [i];
2111 } 2157 }
2112 } 2158 }
2113 } 2159 }
2114 2160
2115 return 0; 2161 return 0;
… …
2190 * This basically means that if direction is 15, then it could either go 2236 * This basically means that if direction is 15, then it could either go
2191 * direction 4, 14, or 16 to get back to where we are. 2237 * direction 4, 14, or 16 to get back to where we are.
2192 * Moved from spell_util.c to object.c with the other related direction 2238 * Moved from spell_util.c to object.c with the other related direction
2193 * functions. 2239 * functions.
2194 */ 2240 */
2195int reduction_dir[SIZEOFFREE][3] = { 2241static const int reduction_dir[SIZEOFFREE][3] = {
2196 {0, 0, 0}, /* 0 */ 2242 {0, 0, 0}, /* 0 */
2197 {0, 0, 0}, /* 1 */ 2243 {0, 0, 0}, /* 1 */
2198 {0, 0, 0}, /* 2 */ 2244 {0, 0, 0}, /* 2 */
2199 {0, 0, 0}, /* 3 */ 2245 {0, 0, 0}, /* 3 */
2200 {0, 0, 0}, /* 4 */ 2246 {0, 0, 0}, /* 4 */
… …
2296int 2342int
2297can_pick (const object *who, const object *item) 2343can_pick (const object *who, const object *item)
2298{ 2344{
2299 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2345 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2300 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2346 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2301 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2347 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3));
2302} 2348}
2303 2349
2304/* 2350/*
2305 * create clone from object to another 2351 * create clone from object to another
2306 */ 2352 */
… …
2338 return tmp; 2384 return tmp;
2339 2385
2340 return 0; 2386 return 0;
2341} 2387}
2342 2388
2343const shstr & 2389shstr_tmp
2344object::kv_get (const shstr &key) const 2390object::kv_get (shstr_tmp key) const
2345{ 2391{
2346 for (key_value *kv = key_values; kv; kv = kv->next) 2392 for (key_value *kv = key_values; kv; kv = kv->next)
2347 if (kv->key == key) 2393 if (kv->key == key)
2348 return kv->value; 2394 return kv->value;
2349 2395
2350 return shstr_null; 2396 return shstr ();
2351} 2397}
2352 2398
2353void 2399void
2354object::kv_set (const shstr &key, const shstr &value) 2400object::kv_set (shstr_tmp key, shstr_tmp value)
2355{ 2401{
2356 for (key_value *kv = key_values; kv; kv = kv->next) 2402 for (key_value *kv = key_values; kv; kv = kv->next)
2357 if (kv->key == key) 2403 if (kv->key == key)
2358 { 2404 {
2359 kv->value = value; 2405 kv->value = value;
… …
2368 2414
2369 key_values = kv; 2415 key_values = kv;
2370} 2416}
2371 2417
2372void 2418void
2373object::kv_del (const shstr &key) 2419object::kv_del (shstr_tmp key)
2374{ 2420{
2375 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2421 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2376 if ((*kvp)->key == key) 2422 if ((*kvp)->key == key)
2377 { 2423 {
2378 key_value *kv = *kvp; 2424 key_value *kv = *kvp;
… …
2471{ 2517{
2472 return map ? map->region (x, y) 2518 return map ? map->region (x, y)
2473 : region::default_region (); 2519 : region::default_region ();
2474} 2520}
2475 2521
2476const materialtype_t *
2477object::dominant_material () const
2478{
2479 if (materialtype_t *mt = name_to_material (materialname))
2480 return mt;
2481
2482 return name_to_material (shstr_unknown);
2483}
2484
2485void 2522void
2486object::open_container (object *new_container) 2523object::open_container (object *new_container)
2487{ 2524{
2488 if (container == new_container) 2525 if (container == new_container)
2489 return; 2526 return;
… …
2509 container = 0; 2546 container = 0;
2510 2547
2511 // client needs item update to make it work, client bug requires this to be separate 2548 // client needs item update to make it work, client bug requires this to be separate
2512 esrv_update_item (UPD_FLAGS, this, old_container); 2549 esrv_update_item (UPD_FLAGS, this, old_container);
2513 2550
2514 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2551 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2515 play_sound (sound_find ("chest_close")); 2552 play_sound (sound_find ("chest_close"));
2516 } 2553 }
2517 2554
2518 if (new_container) 2555 if (new_container)
2519 { 2556 {
… …
2529 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2566 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2530 new_container->insert (closer); 2567 new_container->insert (closer);
2531 } 2568 }
2532#endif 2569#endif
2533 2570
2534 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2571 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2535 2572
2536 // make sure the container is available, client bug requires this to be separate 2573 // make sure the container is available, client bug requires this to be separate
2537 esrv_send_item (this, new_container); 2574 esrv_send_item (this, new_container);
2538 2575
2539 new_container->flag [FLAG_APPLIED] = true; 2576 new_container->flag [FLAG_APPLIED] = true;
… …
2547// else if (!old_container->env && contr && contr->ns) 2584// else if (!old_container->env && contr && contr->ns)
2548// contr->ns->floorbox_reset (); 2585// contr->ns->floorbox_reset ();
2549} 2586}
2550 2587
2551object * 2588object *
2552object::force_find (const shstr name) 2589object::force_find (shstr_tmp name)
2553{ 2590{
2554 /* cycle through his inventory to look for the MARK we want to 2591 /* cycle through his inventory to look for the MARK we want to
2555 * place 2592 * place
2556 */ 2593 */
2557 for (object *tmp = inv; tmp; tmp = tmp->below) 2594 for (object *tmp = inv; tmp; tmp = tmp->below)
… …
2559 return splay (tmp); 2596 return splay (tmp);
2560 2597
2561 return 0; 2598 return 0;
2562} 2599}
2563 2600
2601//-GPL
2602
2564void 2603void
2604object::force_set_timer (int duration)
2605{
2606 this->duration = 1;
2607 this->speed_left = -1.f;
2608
2609 this->set_speed (duration ? 1.f / duration : 0.f);
2610}
2611
2612object *
2565object::force_add (const shstr name, int duration) 2613object::force_add (shstr_tmp name, int duration)
2566{ 2614{
2567 if (object *force = force_find (name)) 2615 if (object *force = force_find (name))
2568 force->destroy (); 2616 force->destroy ();
2569 2617
2570 object *force = get_archetype (FORCE_NAME); 2618 object *force = get_archetype (FORCE_NAME);
2571 2619
2572 force->slaying = name; 2620 force->slaying = name;
2573 force->stats.food = 1; 2621 force->force_set_timer (duration);
2574 force->speed_left = -1.f;
2575
2576 force->set_speed (duration ? 1.f / duration : 0.f);
2577 force->flag [FLAG_IS_USED_UP] = true;
2578 force->flag [FLAG_APPLIED] = true; 2622 force->flag [FLAG_APPLIED] = true;
2579 2623
2580 insert (force); 2624 return insert (force);
2581} 2625}
2582 2626
2583void 2627void
2584object::play_sound (faceidx sound) 2628object::play_sound (faceidx sound) const
2585{ 2629{
2586 if (!sound) 2630 if (!sound)
2587 return; 2631 return;
2588 2632
2589 if (flag [FLAG_REMOVED]) 2633 if (is_on_map ())
2634 map->play_sound (sound, x, y);
2635 else if (object *pl = in_player ())
2636 pl->contr->play_sound (sound);
2637}
2638
2639void
2640object::say_msg (const char *msg) const
2641{
2642 if (is_on_map ())
2643 map->say_msg (msg, x, y);
2644 else if (object *pl = in_player ())
2645 pl->contr->play_sound (sound);
2646}
2647
2648void
2649object::make_noise ()
2650{
2651 // we do not model noise in the map, so instead put
2652 // a temporary light into the noise source
2653 // could use the map instead, but that's less reliable for our
2654 // goal, which is to make invisibility a bit harder to exploit
2655
2656 // currently only works sensibly for players
2657 if (!is_player ())
2590 return; 2658 return;
2591 2659
2592 if (env) 2660 // find old force, or create new one
2593 { 2661 object *force = force_find (shstr_noise_force);
2594 if (object *pl = in_player ()) 2662
2595 pl->contr->play_sound (sound); 2663 if (force)
2596 } 2664 force->speed_left = -1.f; // patch old speed up
2597 else 2665 else
2598 map->play_sound (sound, x, y); 2666 {
2599} 2667 force = archetype::get (shstr_noise_force);
2600 2668
2669 force->slaying = shstr_noise_force;
2670 force->stats.food = 1;
2671 force->speed_left = -1.f;
2672
2673 force->set_speed (1.f / 4.f);
2674 force->flag [FLAG_IS_USED_UP] = true;
2675 force->flag [FLAG_APPLIED] = true;
2676
2677 insert (force);
2678 }
2679}
2680

Diff Legend

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