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.270 by root, Sat Dec 27 02:31:19 2008 UTC vs.
Revision 1.304 by root, Tue Nov 10 16:29:20 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, assume nrof 261 /* Do not merge objects if nrof would overflow, assume nrof
… …
216 || ob1->skill != ob2->skill 286 || ob1->skill != ob2->skill
217 || ob1->value != ob2->value 287 || ob1->value != ob2->value
218 || ob1->animation_id != ob2->animation_id 288 || ob1->animation_id != ob2->animation_id
219 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 289 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other
220 || ob1->client_type != ob2->client_type 290 || ob1->client_type != ob2->client_type
221 || ob1->materialname != ob2->materialname 291 || ob1->material != ob2->material
222 || ob1->lore != ob2->lore 292 || ob1->lore != ob2->lore
223 || ob1->subtype != ob2->subtype 293 || ob1->subtype != ob2->subtype
224 || ob1->move_type != ob2->move_type 294 || ob1->move_type != ob2->move_type
225 || ob1->move_block != ob2->move_block 295 || ob1->move_block != ob2->move_block
226 || ob1->move_allow != ob2->move_allow 296 || ob1->move_allow != ob2->move_allow
227 || ob1->move_on != ob2->move_on 297 || ob1->move_on != ob2->move_on
228 || ob1->move_off != ob2->move_off 298 || ob1->move_off != ob2->move_off
229 || ob1->move_slow != ob2->move_slow 299 || ob1->move_slow != ob2->move_slow
230 || ob1->move_slow_penalty != ob2->move_slow_penalty 300 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
231 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 301 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
232 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 302 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
233 return 0; 303 return 0;
234 304
235 if ((ob1->flag ^ ob2->flag) 305 if ((ob1->flag ^ ob2->flag)
… …
327 // the player inventory itself is always visible 397 // the player inventory itself is always visible
328 if (env->is_player ()) 398 if (env->is_player ())
329 return env; 399 return env;
330 400
331 // else a player could have our env open 401 // else a player could have our env open
332 object *envest = env->outer_env (); 402 object *envest = env->outer_env_or_self ();
333 403
334 // 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
335 // even if our inv is in a player. 405 // even if our inv is in a player.
336 if (envest->is_on_map ()) 406 if (envest->is_on_map ())
337 if (object *pl = envest->ms ().player ()) 407 if (object *pl = envest->ms ().player ())
338 if (pl->container == env) 408 if (pl->container_ () == env)
339 return pl; 409 return pl;
340 } 410 }
341 else 411 else
342 { 412 {
343 // maybe there is a player standing on the same mapspace 413 // maybe there is a player standing on the same mapspace
344 // this will catch the case where "this" is a player 414 // this will catch the case where "this" is a player
345 if (object *pl = ms ().player ()) 415 if (object *pl = ms ().player ())
346 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 416 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
347 || this == pl->container) 417 || pl->container_ () == this)
348 return pl; 418 return pl;
349 } 419 }
350 } 420 }
351 421
352 return 0; 422 return 0;
… …
430 object_freezer freezer; 500 object_freezer freezer;
431 op->write (freezer); 501 op->write (freezer);
432 return freezer.as_string (); 502 return freezer.as_string ();
433} 503}
434 504
435/* 505char *
436 * get_nearest_part(multi-object, object 2) returns the part of the 506object::as_string ()
437 * multi-object 1 which is closest to the second object.
438 * If it's not a multi-object, it is returned.
439 */
440object *
441get_nearest_part (object *op, const object *pl)
442{ 507{
443 object *tmp, *closest; 508 return dump_object (this);
444 int last_dist, i;
445
446 if (!op->more)
447 return op;
448
449 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
450 tmp;
451 tmp = tmp->more)
452 if ((i = distance (tmp, pl)) < last_dist)
453 closest = tmp, last_dist = i;
454
455 return closest;
456} 509}
457 510
458/* 511/*
459 * 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.
460 * VERRRY slow. 513 * VERRRY slow.
… …
554 update_stats (); 607 update_stats ();
555 608
556 new_draw_info_format (NDI_UNIQUE, 0, this, 609 new_draw_info_format (NDI_UNIQUE, 0, this,
557 "You try to balance all your items at once, " 610 "You try to balance all your items at once, "
558 "but the %s is just too much for your body. " 611 "but the %s is just too much for your body. "
559 "[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);
560 return false; 614 return false;
561 } 615 }
562 616
563 //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);
564 } 618 }
… …
690 * 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.
691 */ 745 */
692void 746void
693object::set_speed (float speed) 747object::set_speed (float speed)
694{ 748{
695 if (flag [FLAG_FREED] && speed)
696 {
697 LOG (llevError, "Object %s is freed but has speed.\n", &name);
698 speed = 0;
699 }
700
701 this->speed = speed; 749 this->speed = speed;
702 750
703 if (has_active_speed ()) 751 if (has_active_speed ())
704 activate (); 752 activate ();
705 else 753 else
… …
755 803
756 if (!(m.flags_ & P_UPTODATE)) 804 if (!(m.flags_ & P_UPTODATE))
757 /* nop */; 805 /* nop */;
758 else if (action == UP_OBJ_INSERT) 806 else if (action == UP_OBJ_INSERT)
759 { 807 {
808#if 0
760 // this is likely overkill, TODO: revisit (schmorp) 809 // this is likely overkill, TODO: revisit (schmorp)
761 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 810 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
762 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 811 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
763 || (op->is_player () && !(m.flags_ & P_PLAYER)) 812 || (op->is_player () && !(m.flags_ & P_PLAYER))
764 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 813 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
… …
769 || (m.move_slow | op->move_slow) != m.move_slow 818 || (m.move_slow | op->move_slow) != m.move_slow
770 /* 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
771 * have move_allow right now. 820 * have move_allow right now.
772 */ 821 */
773 || ((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
774 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
775 m.invalidate (); 823 m.invalidate ();
824#else
825 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
826 m.invalidate ();
827#endif
776 } 828 }
777 /* if the object is being removed, we can't make intelligent 829 /* if the object is being removed, we can't make intelligent
778 * decisions, because remove_ob can't really pass the object 830 * decisions, because remove_ob can't really pass the object
779 * that is being removed. 831 * that is being removed.
780 */ 832 */
… …
791 843
792object::object () 844object::object ()
793{ 845{
794 SET_FLAG (this, FLAG_REMOVED); 846 SET_FLAG (this, FLAG_REMOVED);
795 847
796 expmul = 1.0; 848 //expmul = 1.0; declared const for the time being
797 face = blank_face; 849 face = blank_face;
850 material = MATERIAL_NULL;
798} 851}
799 852
800object::~object () 853object::~object ()
801{ 854{
802 unlink (); 855 unlink ();
… …
830{ 883{
831 /* If already on active list, don't do anything */ 884 /* If already on active list, don't do anything */
832 if (active) 885 if (active)
833 return; 886 return;
834 887
835 if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
836 if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
837
838 if (has_active_speed ()) 888 if (has_active_speed ())
889 {
890 if (flag [FLAG_FREED])
891 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
892
839 actives.insert (this); 893 actives.insert (this);
894 }
840} 895}
841 896
842void 897void
843object::activate_recursive () 898object::activate_recursive ()
844{ 899{
… …
962 1017
963void 1018void
964object::do_destroy () 1019object::do_destroy ()
965{ 1020{
966 if (flag [FLAG_IS_LINKED]) 1021 if (flag [FLAG_IS_LINKED])
967 remove_button_link (this); 1022 remove_link ();
968 1023
969 if (flag [FLAG_FRIENDLY]) 1024 if (flag [FLAG_FRIENDLY])
970 remove_friendly_object (this); 1025 remove_friendly_object (this);
971 1026
972 remove (); 1027 remove ();
… …
1030 * the previous environment. 1085 * the previous environment.
1031 */ 1086 */
1032void 1087void
1033object::do_remove () 1088object::do_remove ()
1034{ 1089{
1035 object *tmp, *last = 0;
1036 object *otmp;
1037
1038 if (flag [FLAG_REMOVED]) 1090 if (flag [FLAG_REMOVED])
1039 return; 1091 return;
1040 1092
1041 INVOKE_OBJECT (REMOVE, this); 1093 INVOKE_OBJECT (REMOVE, this);
1042 1094
… …
1096 1148
1097 if (object *pl = ms.player ()) 1149 if (object *pl = ms.player ())
1098 { 1150 {
1099 if (is_player ()) 1151 if (is_player ())
1100 { 1152 {
1153 if (!flag [FLAG_WIZPASS])
1101 ms.smell = pticks; // remember the smell of the player 1154 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1102 1155
1103 // leaving a spot always closes any open container on the ground 1156 // leaving a spot always closes any open container on the ground
1104 if (container && !container->env) 1157 if (container && !container->env)
1105 // this causes spurious floorbox updates, but it ensures 1158 // this causes spurious floorbox updates, but it ensures
1106 // that the CLOSE event is being sent. 1159 // that the CLOSE event is being sent.
1107 close_container (); 1160 close_container ();
1108 1161
1109 --map->players; 1162 --map->players;
1110 map->touch (); 1163 map->touch ();
1111 } 1164 }
1112 else if (pl->container == this) 1165 else if (pl->container_ () == this)
1113 { 1166 {
1114 // removing a container should close it 1167 // removing a container should close it
1115 close_container (); 1168 close_container ();
1116 } 1169 }
1117 1170
… …
1133 1186
1134 int check_walk_off = !flag [FLAG_NO_APPLY]; 1187 int check_walk_off = !flag [FLAG_NO_APPLY];
1135 1188
1136 if (object *pl = ms.player ()) 1189 if (object *pl = ms.player ())
1137 { 1190 {
1138 if (pl->container == this) 1191 if (pl->container_ () == this)
1139 /* If a container that the player is currently using somehow gets 1192 /* If a container that the player is currently using somehow gets
1140 * removed (most likely destroyed), update the player view 1193 * removed (most likely destroyed), update the player view
1141 * appropriately. 1194 * appropriately.
1142 */ 1195 */
1143 pl->close_container (); 1196 pl->close_container ();
… …
1147 //TODO: update floorbox to preserve ordering 1200 //TODO: update floorbox to preserve ordering
1148 if (pl->contr->ns) 1201 if (pl->contr->ns)
1149 pl->contr->ns->floorbox_update (); 1202 pl->contr->ns->floorbox_update ();
1150 } 1203 }
1151 1204
1205 if (check_walk_off)
1152 for (tmp = ms.bot; tmp; tmp = tmp->above) 1206 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1153 { 1207 {
1208 above = tmp->above;
1209
1154 /* No point updating the players look faces if he is the object 1210 /* No point updating the players look faces if he is the object
1155 * being removed. 1211 * being removed.
1156 */ 1212 */
1157 1213
1158 /* See if object moving off should effect something */ 1214 /* See if object moving off should effect something */
1159 if (check_walk_off
1160 && ((move_type & tmp->move_off) 1215 if ((move_type & tmp->move_off)
1161 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1216 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1162 {
1163 move_apply (tmp, this, 0); 1217 move_apply (tmp, this, 0);
1164
1165 if (destroyed ())
1166 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1167 } 1218 }
1168
1169 last = tmp;
1170 }
1171 1219
1172 if (affects_los ()) 1220 if (affects_los ())
1173 update_all_los (map, x, y); 1221 update_all_los (map, x, y);
1174 } 1222 }
1175} 1223}
… …
1284 1332
1285 /* Ideally, the caller figures this out. However, it complicates a lot 1333 /* Ideally, the caller figures this out. However, it complicates a lot
1286 * of areas of callers (eg, anything that uses find_free_spot would now 1334 * of areas of callers (eg, anything that uses find_free_spot would now
1287 * need extra work 1335 * need extra work
1288 */ 1336 */
1337 maptile *newmap = m;
1289 if (!xy_normalise (m, op->x, op->y)) 1338 if (!xy_normalise (newmap, op->x, op->y))
1290 { 1339 {
1291 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found 1340 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1292 return 0; 1341 return 0;
1293 } 1342 }
1294 1343
1295 if (object *more = op->more) 1344 if (object *more = op->more)
1296 if (!insert_ob_in_map (more, m, originator, flag)) 1345 if (!insert_ob_in_map (more, m, originator, flag))
1297 return 0; 1346 return 0;
1298 1347
1299 CLEAR_FLAG (op, FLAG_REMOVED); 1348 op->flag [FLAG_REMOVED] = false;
1300 1349 op->env = 0;
1301 op->map = m; 1350 op->map = newmap;
1351
1302 mapspace &ms = op->ms (); 1352 mapspace &ms = op->ms ();
1303 1353
1304 /* this has to be done after we translate the coordinates. 1354 /* this has to be done after we translate the coordinates.
1305 */ 1355 */
1306 if (op->nrof && !(flag & INS_NO_MERGE)) 1356 if (op->nrof && !(flag & INS_NO_MERGE))
… …
1327 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1377 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1328 abort (); 1378 abort ();
1329 } 1379 }
1330 1380
1331 if (!originator->is_on_map ()) 1381 if (!originator->is_on_map ())
1382 {
1332 LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", 1383 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1333 op->debug_desc (), originator->debug_desc ()); 1384 op->debug_desc (), originator->debug_desc ());
1385 abort ();
1386 }
1334 1387
1335 op->above = originator; 1388 op->above = originator;
1336 op->below = originator->below; 1389 op->below = originator->below;
1337 originator->below = op; 1390 originator->below = op;
1338 1391
… …
1470 * blocked() and wall() work properly), and these flags are updated by 1523 * blocked() and wall() work properly), and these flags are updated by
1471 * update_object(). 1524 * update_object().
1472 */ 1525 */
1473 1526
1474 /* if this is not the head or flag has been passed, don't check walk on status */ 1527 /* if this is not the head or flag has been passed, don't check walk on status */
1475 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1528 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1476 { 1529 {
1477 if (check_move_on (op, originator)) 1530 if (check_move_on (op, originator))
1478 return 0; 1531 return 0;
1479 1532
1480 /* If we are a multi part object, lets work our way through the check 1533 /* If we are a multi part object, lets work our way through the check
… …
1491/* this function inserts an object in the map, but if it 1544/* this function inserts an object in the map, but if it
1492 * finds an object of its own type, it'll remove that one first. 1545 * finds an object of its own type, it'll remove that one first.
1493 * op is the object to insert it under: supplies x and the map. 1546 * op is the object to insert it under: supplies x and the map.
1494 */ 1547 */
1495void 1548void
1496replace_insert_ob_in_map (const char *arch_string, object *op) 1549replace_insert_ob_in_map (shstr_tmp archname, object *op)
1497{ 1550{
1498 /* first search for itself and remove any old instances */ 1551 /* first search for itself and remove any old instances */
1499 1552
1500 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1553 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1501 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1554 if (tmp->arch->archname == archname) /* same archetype */
1502 tmp->destroy (); 1555 tmp->destroy ();
1503 1556
1504 object *tmp = arch_to_object (archetype::find (arch_string)); 1557 object *tmp = arch_to_object (archetype::find (archname));
1505 1558
1506 tmp->x = op->x; 1559 tmp->x = op->x;
1507 tmp->y = op->y; 1560 tmp->y = op->y;
1508 1561
1509 insert_ob_in_map (tmp, op->map, op, 0); 1562 insert_ob_in_map (tmp, op->map, op, 0);
… …
1514{ 1567{
1515 if (where->env) 1568 if (where->env)
1516 return where->env->insert (this); 1569 return where->env->insert (this);
1517 else 1570 else
1518 return where->map->insert (this, where->x, where->y, originator, flags); 1571 return where->map->insert (this, where->x, where->y, originator, flags);
1572}
1573
1574// check whether we can put this into the map, respect max_volume, max_items
1575bool
1576object::can_drop_at (maptile *m, int x, int y, object *originator)
1577{
1578 mapspace &ms = m->at (x, y);
1579
1580 int items = ms.items ();
1581
1582 if (!items // testing !items ensures we can drop at least one item
1583 || (items < m->max_items
1584 && ms.volume () < m->max_volume))
1585 return true;
1586
1587 if (originator && originator->is_player ())
1588 originator->contr->failmsg (format (
1589 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1590 query_name ()
1591 ));
1592
1593 return false;
1519} 1594}
1520 1595
1521/* 1596/*
1522 * decrease(object, number) decreases a specified number from 1597 * decrease(object, number) decreases a specified number from
1523 * the amount of an object. If the amount reaches 0, the object 1598 * the amount of an object. If the amount reaches 0, the object
… …
1695 * on top. 1770 * on top.
1696 */ 1771 */
1697int 1772int
1698check_move_on (object *op, object *originator) 1773check_move_on (object *op, object *originator)
1699{ 1774{
1775 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1776 return 0;
1777
1700 object *tmp; 1778 object *tmp;
1701 maptile *m = op->map; 1779 maptile *m = op->map;
1702 int x = op->x, y = op->y; 1780 int x = op->x, y = op->y;
1703 1781
1704 MoveType move_on, move_slow, move_block; 1782 mapspace &ms = m->at (x, y);
1705 1783
1706 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1784 ms.update ();
1707 return 0;
1708 1785
1709 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1786 MoveType move_on = ms.move_on;
1710 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1787 MoveType move_slow = ms.move_slow;
1711 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1788 MoveType move_block = ms.move_block;
1712 1789
1713 /* if nothing on this space will slow op down or be applied, 1790 /* if nothing on this space will slow op down or be applied,
1714 * no need to do checking below. have to make sure move_type 1791 * no need to do checking below. have to make sure move_type
1715 * is set, as lots of objects don't have it set - we treat that 1792 * is set, as lots of objects don't have it set - we treat that
1716 * as walking. 1793 * as walking.
… …
1727 return 0; 1804 return 0;
1728 1805
1729 /* The objects have to be checked from top to bottom. 1806 /* The objects have to be checked from top to bottom.
1730 * Hence, we first go to the top: 1807 * Hence, we first go to the top:
1731 */ 1808 */
1732 1809 for (object *next, *tmp = ms.top; tmp; tmp = next)
1733 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1734 {
1735 /* Trim the search when we find the first other spell effect
1736 * this helps performance so that if a space has 50 spell objects,
1737 * we don't need to check all of them.
1738 */
1739 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1740 break;
1741 } 1810 {
1811 next = tmp->below;
1742 1812
1743 for (; tmp; tmp = tmp->below)
1744 {
1745 if (tmp == op) 1813 if (tmp == op)
1746 continue; /* Can't apply yourself */ 1814 continue; /* Can't apply yourself */
1747 1815
1748 /* Check to see if one of the movement types should be slowed down. 1816 /* Check to see if one of the movement types should be slowed down.
1749 * Second check makes sure that the movement types not being slowed 1817 * Second check makes sure that the movement types not being slowed
… …
1754 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1822 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1755 { 1823 {
1756 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1824 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1757 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1825 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1758 { 1826 {
1759
1760 float
1761 diff = tmp->move_slow_penalty * fabs (op->speed); 1827 float diff = tmp->move_slow_penalty * fabs (op->speed);
1762 1828
1763 if (op->is_player ()) 1829 if (op->is_player ())
1764 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1830 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1765 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1831 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1766 diff /= 4.0; 1832 diff /= 4.0;
1767 1833
1768 op->speed_left -= diff; 1834 op->speed_left -= diff;
1769 } 1835 }
1770 } 1836 }
… …
2054 * there is capable of. 2120 * there is capable of.
2055 */ 2121 */
2056int 2122int
2057find_dir (maptile *m, int x, int y, object *exclude) 2123find_dir (maptile *m, int x, int y, object *exclude)
2058{ 2124{
2059 int i, max = SIZEOFFREE, mflags; 2125 int max = SIZEOFFREE, mflags;
2060
2061 sint16 nx, ny;
2062 object *tmp;
2063 maptile *mp;
2064
2065 MoveType blocked, move_type; 2126 MoveType move_type;
2066 2127
2067 if (exclude && exclude->head_ () != exclude) 2128 if (exclude && exclude->head_ () != exclude)
2068 { 2129 {
2069 exclude = exclude->head; 2130 exclude = exclude->head;
2070 move_type = exclude->move_type; 2131 move_type = exclude->move_type;
… …
2073 { 2134 {
2074 /* If we don't have anything, presume it can use all movement types. */ 2135 /* If we don't have anything, presume it can use all movement types. */
2075 move_type = MOVE_ALL; 2136 move_type = MOVE_ALL;
2076 } 2137 }
2077 2138
2078 for (i = 1; i < max; i++) 2139 for (int i = 1; i < max; i++)
2079 { 2140 {
2080 mp = m; 2141 mapxy pos (m, x, y);
2081 nx = x + freearr_x[i]; 2142 pos.move (i);
2082 ny = y + freearr_y[i];
2083 2143
2084 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2144 if (!pos.normalise ())
2085
2086 if (mflags & P_OUT_OF_MAP)
2087 max = maxfree[i]; 2145 max = maxfree[i];
2088 else 2146 else
2089 { 2147 {
2090 mapspace &ms = mp->at (nx, ny); 2148 mapspace &ms = *pos;
2091 2149
2092 blocked = ms.move_block;
2093
2094 if ((move_type & blocked) == move_type) 2150 if ((move_type & ms.move_block) == move_type)
2095 max = maxfree[i]; 2151 max = maxfree [i];
2096 else if (mflags & P_IS_ALIVE) 2152 else if (ms.flags () & P_IS_ALIVE)
2097 { 2153 {
2098 for (tmp = ms.bot; tmp; tmp = tmp->above) 2154 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2099 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) 2155 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2100 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2156 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2101 break;
2102
2103 if (tmp)
2104 return freedir[i]; 2157 return freedir [i];
2105 } 2158 }
2106 } 2159 }
2107 } 2160 }
2108 2161
2109 return 0; 2162 return 0;
… …
2184 * This basically means that if direction is 15, then it could either go 2237 * This basically means that if direction is 15, then it could either go
2185 * direction 4, 14, or 16 to get back to where we are. 2238 * direction 4, 14, or 16 to get back to where we are.
2186 * Moved from spell_util.c to object.c with the other related direction 2239 * Moved from spell_util.c to object.c with the other related direction
2187 * functions. 2240 * functions.
2188 */ 2241 */
2189int reduction_dir[SIZEOFFREE][3] = { 2242static const int reduction_dir[SIZEOFFREE][3] = {
2190 {0, 0, 0}, /* 0 */ 2243 {0, 0, 0}, /* 0 */
2191 {0, 0, 0}, /* 1 */ 2244 {0, 0, 0}, /* 1 */
2192 {0, 0, 0}, /* 2 */ 2245 {0, 0, 0}, /* 2 */
2193 {0, 0, 0}, /* 3 */ 2246 {0, 0, 0}, /* 3 */
2194 {0, 0, 0}, /* 4 */ 2247 {0, 0, 0}, /* 4 */
… …
2332 return tmp; 2385 return tmp;
2333 2386
2334 return 0; 2387 return 0;
2335} 2388}
2336 2389
2337const shstr & 2390shstr_tmp
2338object::kv_get (const shstr &key) const 2391object::kv_get (shstr_tmp key) const
2339{ 2392{
2340 for (key_value *kv = key_values; kv; kv = kv->next) 2393 for (key_value *kv = key_values; kv; kv = kv->next)
2341 if (kv->key == key) 2394 if (kv->key == key)
2342 return kv->value; 2395 return kv->value;
2343 2396
2344 return shstr_null; 2397 return shstr ();
2345} 2398}
2346 2399
2347void 2400void
2348object::kv_set (const shstr &key, const shstr &value) 2401object::kv_set (shstr_tmp key, shstr_tmp value)
2349{ 2402{
2350 for (key_value *kv = key_values; kv; kv = kv->next) 2403 for (key_value *kv = key_values; kv; kv = kv->next)
2351 if (kv->key == key) 2404 if (kv->key == key)
2352 { 2405 {
2353 kv->value = value; 2406 kv->value = value;
… …
2362 2415
2363 key_values = kv; 2416 key_values = kv;
2364} 2417}
2365 2418
2366void 2419void
2367object::kv_del (const shstr &key) 2420object::kv_del (shstr_tmp key)
2368{ 2421{
2369 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2422 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2370 if ((*kvp)->key == key) 2423 if ((*kvp)->key == key)
2371 { 2424 {
2372 key_value *kv = *kvp; 2425 key_value *kv = *kvp;
… …
2465{ 2518{
2466 return map ? map->region (x, y) 2519 return map ? map->region (x, y)
2467 : region::default_region (); 2520 : region::default_region ();
2468} 2521}
2469 2522
2470const materialtype_t *
2471object::dominant_material () const
2472{
2473 if (materialtype_t *mt = name_to_material (materialname))
2474 return mt;
2475
2476 return name_to_material (shstr_unknown);
2477}
2478
2479void 2523void
2480object::open_container (object *new_container) 2524object::open_container (object *new_container)
2481{ 2525{
2482 if (container == new_container) 2526 if (container == new_container)
2483 return; 2527 return;
… …
2503 container = 0; 2547 container = 0;
2504 2548
2505 // client needs item update to make it work, client bug requires this to be separate 2549 // client needs item update to make it work, client bug requires this to be separate
2506 esrv_update_item (UPD_FLAGS, this, old_container); 2550 esrv_update_item (UPD_FLAGS, this, old_container);
2507 2551
2508 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2552 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2509 play_sound (sound_find ("chest_close")); 2553 play_sound (sound_find ("chest_close"));
2510 } 2554 }
2511 2555
2512 if (new_container) 2556 if (new_container)
2513 { 2557 {
… …
2523 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2567 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2524 new_container->insert (closer); 2568 new_container->insert (closer);
2525 } 2569 }
2526#endif 2570#endif
2527 2571
2528 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2572 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2529 2573
2530 // make sure the container is available, client bug requires this to be separate 2574 // make sure the container is available, client bug requires this to be separate
2531 esrv_send_item (this, new_container); 2575 esrv_send_item (this, new_container);
2532 2576
2533 new_container->flag [FLAG_APPLIED] = true; 2577 new_container->flag [FLAG_APPLIED] = true;
… …
2541// else if (!old_container->env && contr && contr->ns) 2585// else if (!old_container->env && contr && contr->ns)
2542// contr->ns->floorbox_reset (); 2586// contr->ns->floorbox_reset ();
2543} 2587}
2544 2588
2545object * 2589object *
2546object::force_find (const shstr name) 2590object::force_find (shstr_tmp name)
2547{ 2591{
2548 /* cycle through his inventory to look for the MARK we want to 2592 /* cycle through his inventory to look for the MARK we want to
2549 * place 2593 * place
2550 */ 2594 */
2551 for (object *tmp = inv; tmp; tmp = tmp->below) 2595 for (object *tmp = inv; tmp; tmp = tmp->below)
… …
2553 return splay (tmp); 2597 return splay (tmp);
2554 2598
2555 return 0; 2599 return 0;
2556} 2600}
2557 2601
2602//-GPL
2603
2604void
2605object::force_set_timer (int duration)
2606{
2607 this->duration = 1;
2608 this->speed_left = -1.f;
2609
2610 this->set_speed (duration ? 1.f / duration : 0.f);
2611}
2612
2558object * 2613object *
2559object::force_add (const shstr name, int duration) 2614object::force_add (shstr_tmp name, int duration)
2560{ 2615{
2561 if (object *force = force_find (name)) 2616 if (object *force = force_find (name))
2562 force->destroy (); 2617 force->destroy ();
2563 2618
2564 object *force = get_archetype (FORCE_NAME); 2619 object *force = get_archetype (FORCE_NAME);
2565 2620
2566 force->slaying = name; 2621 force->slaying = name;
2567 force->stats.food = 1; 2622 force->force_set_timer (duration);
2568 force->speed_left = -1.f;
2569
2570 force->set_speed (duration ? 1.f / duration : 0.f);
2571 force->flag [FLAG_IS_USED_UP] = true;
2572 force->flag [FLAG_APPLIED] = true; 2623 force->flag [FLAG_APPLIED] = true;
2573 2624
2574 return insert (force); 2625 return insert (force);
2575} 2626}
2576 2627
2577void 2628void
2578object::play_sound (faceidx sound) 2629object::play_sound (faceidx sound) const
2579{ 2630{
2580 if (!sound) 2631 if (!sound)
2581 return; 2632 return;
2582 2633
2583 if (flag [FLAG_REMOVED]) 2634 if (is_on_map ())
2584 return;
2585
2586 if (env)
2587 {
2588 if (object *pl = in_player ())
2589 pl->contr->play_sound (sound);
2590 }
2591 else
2592 map->play_sound (sound, x, y); 2635 map->play_sound (sound, x, y);
2636 else if (object *pl = in_player ())
2637 pl->contr->play_sound (sound);
2638}
2639
2640void
2641object::say_msg (const char *msg) const
2642{
2643 if (is_on_map ())
2644 map->say_msg (msg, x, y);
2645 else if (object *pl = in_player ())
2646 pl->contr->play_sound (sound);
2593} 2647}
2594 2648
2595void 2649void
2596object::make_noise () 2650object::make_noise ()
2597{ 2651{

Diff Legend

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