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.275 by root, Sun Dec 28 15:28:47 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>
… …
36static const uint64 UUID_GAP = 1<<19; 37static const uint64 UUID_GAP = 1<<19;
37uint32_t mapspace::smellcount = 10000; 38uint32_t mapspace::smellcount = 10000;
38 39
39objectvec objects; 40objectvec objects;
40activevec actives; 41activevec actives;
42
43//+GPL
41 44
42short freearr_x[SIZEOFFREE] = { 45short freearr_x[SIZEOFFREE] = {
43 0, 46 0,
44 0, 1, 1, 1, 0, -1, -1, -1, 47 0, 1, 1, 1, 0, -1, -1, -1,
45 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,
… …
49 0, 52 0,
50 -1, -1, 0, 1, 1, 1, 0, -1, 53 -1, -1, 0, 1, 1, 1, 0, -1,
51 -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,
52 -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
53}; 56};
54int maxfree[SIZEOFFREE] = {
55 0,
56 9, 10, 13, 14, 17, 18, 21, 22,
57 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48,
58 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
59};
60int freedir[SIZEOFFREE] = { 57int freedir[SIZEOFFREE] = {
61 0, 58 0,
62 1, 2, 3, 4, 5, 6, 7, 8, 59 1, 2, 3, 4, 5, 6, 7, 8,
63 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,
64 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
65}; 69};
66 70
67static void 71static void
68write_uuid (uval64 skip, bool sync) 72write_uuid (uval64 skip, bool sync)
69{ 73{
… …
97 101
98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 102 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
99 _exit (1); 103 _exit (1);
100 } 104 }
101 105
102 UUID::BUF buf; 106 char buf [UUID::MAX_LEN];
103 buf[0] = 0; 107 buf[0] = 0;
104 fgets (buf, sizeof (buf), fp); 108 fgets (buf, sizeof (buf), fp);
105 109
106 if (!UUID::cur.parse (buf)) 110 if (!UUID::cur.parse (buf))
107 { 111 {
… …
134 138
135void 139void
136UUID::init () 140UUID::init ()
137{ 141{
138 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;
139} 208}
140 209
141/* 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. */
142static bool 211static bool
143compare_ob_value_lists_one (const object *wants, const object *has) 212compare_ob_value_lists_one (const object *wants, const object *has)
… …
182bool object::can_merge_slow (object *ob1, object *ob2) 251bool object::can_merge_slow (object *ob1, object *ob2)
183{ 252{
184 /* A couple quicksanity checks */ 253 /* A couple quicksanity checks */
185 if (ob1 == ob2 254 if (ob1 == ob2
186 || ob1->type != ob2->type 255 || ob1->type != ob2->type
187 || ob1->speed != ob2->speed 256 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED
188 || ob1->value != ob2->value 257 || ob1->value != ob2->value
189 || ob1->name != ob2->name) 258 || ob1->name != ob2->name)
190 return 0; 259 return 0;
191 260
192 /* Do not merge objects if nrof would overflow, assume nrof 261 /* Do not merge objects if nrof would overflow, assume nrof
… …
217 || ob1->skill != ob2->skill 286 || ob1->skill != ob2->skill
218 || ob1->value != ob2->value 287 || ob1->value != ob2->value
219 || ob1->animation_id != ob2->animation_id 288 || ob1->animation_id != ob2->animation_id
220 || (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
221 || ob1->client_type != ob2->client_type 290 || ob1->client_type != ob2->client_type
222 || ob1->materialname != ob2->materialname 291 || ob1->material != ob2->material
223 || ob1->lore != ob2->lore 292 || ob1->lore != ob2->lore
224 || ob1->subtype != ob2->subtype 293 || ob1->subtype != ob2->subtype
225 || ob1->move_type != ob2->move_type 294 || ob1->move_type != ob2->move_type
226 || ob1->move_block != ob2->move_block 295 || ob1->move_block != ob2->move_block
227 || ob1->move_allow != ob2->move_allow 296 || ob1->move_allow != ob2->move_allow
228 || ob1->move_on != ob2->move_on 297 || ob1->move_on != ob2->move_on
229 || ob1->move_off != ob2->move_off 298 || ob1->move_off != ob2->move_off
230 || ob1->move_slow != ob2->move_slow 299 || ob1->move_slow != ob2->move_slow
231 || ob1->move_slow_penalty != ob2->move_slow_penalty 300 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 301 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 302 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
234 return 0; 303 return 0;
235 304
236 if ((ob1->flag ^ ob2->flag) 305 if ((ob1->flag ^ ob2->flag)
… …
328 // the player inventory itself is always visible 397 // the player inventory itself is always visible
329 if (env->is_player ()) 398 if (env->is_player ())
330 return env; 399 return env;
331 400
332 // else a player could have our env open 401 // else a player could have our env open
333 object *envest = env->outer_env (); 402 object *envest = env->outer_env_or_self ();
334 403
335 // 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
336 // even if our inv is in a player. 405 // even if our inv is in a player.
337 if (envest->is_on_map ()) 406 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ()) 407 if (object *pl = envest->ms ().player ())
339 if (pl->container == env) 408 if (pl->container_ () == env)
340 return pl; 409 return pl;
341 } 410 }
342 else 411 else
343 { 412 {
344 // maybe there is a player standing on the same mapspace 413 // maybe there is a player standing on the same mapspace
345 // this will catch the case where "this" is a player 414 // this will catch the case where "this" is a player
346 if (object *pl = ms ().player ()) 415 if (object *pl = ms ().player ())
347 if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) 416 if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look)
348 || this == pl->container) 417 || pl->container_ () == this)
349 return pl; 418 return pl;
350 } 419 }
351 } 420 }
352 421
353 return 0; 422 return 0;
… …
431 object_freezer freezer; 500 object_freezer freezer;
432 op->write (freezer); 501 op->write (freezer);
433 return freezer.as_string (); 502 return freezer.as_string ();
434} 503}
435 504
436/* 505char *
437 * get_nearest_part(multi-object, object 2) returns the part of the 506object::as_string ()
438 * multi-object 1 which is closest to the second object.
439 * If it's not a multi-object, it is returned.
440 */
441object *
442get_nearest_part (object *op, const object *pl)
443{ 507{
444 object *tmp, *closest; 508 return dump_object (this);
445 int last_dist, i;
446
447 if (!op->more)
448 return op;
449
450 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
451 tmp;
452 tmp = tmp->more)
453 if ((i = distance (tmp, pl)) < last_dist)
454 closest = tmp, last_dist = i;
455
456 return closest;
457} 509}
458 510
459/* 511/*
460 * 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.
461 * VERRRY slow. 513 * VERRRY slow.
… …
555 update_stats (); 607 update_stats ();
556 608
557 new_draw_info_format (NDI_UNIQUE, 0, this, 609 new_draw_info_format (NDI_UNIQUE, 0, this,
558 "You try to balance all your items at once, " 610 "You try to balance all your items at once, "
559 "but the %s is just too much for your body. " 611 "but the %s is just too much for your body. "
560 "[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);
561 return false; 614 return false;
562 } 615 }
563 616
564 //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);
565 } 618 }
… …
691 * 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.
692 */ 745 */
693void 746void
694object::set_speed (float speed) 747object::set_speed (float speed)
695{ 748{
696 if (flag [FLAG_FREED] && speed)
697 {
698 LOG (llevError, "Object %s is freed but has speed.\n", &name);
699 speed = 0;
700 }
701
702 this->speed = speed; 749 this->speed = speed;
703 750
704 if (has_active_speed ()) 751 if (has_active_speed ())
705 activate (); 752 activate ();
706 else 753 else
… …
756 803
757 if (!(m.flags_ & P_UPTODATE)) 804 if (!(m.flags_ & P_UPTODATE))
758 /* nop */; 805 /* nop */;
759 else if (action == UP_OBJ_INSERT) 806 else if (action == UP_OBJ_INSERT)
760 { 807 {
808#if 0
761 // this is likely overkill, TODO: revisit (schmorp) 809 // this is likely overkill, TODO: revisit (schmorp)
762 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 810 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
763 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 811 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
764 || (op->is_player () && !(m.flags_ & P_PLAYER)) 812 || (op->is_player () && !(m.flags_ & P_PLAYER))
765 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 813 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
… …
770 || (m.move_slow | op->move_slow) != m.move_slow 818 || (m.move_slow | op->move_slow) != m.move_slow
771 /* 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
772 * have move_allow right now. 820 * have move_allow right now.
773 */ 821 */
774 || ((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
775 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
776 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
777 } 828 }
778 /* if the object is being removed, we can't make intelligent 829 /* if the object is being removed, we can't make intelligent
779 * decisions, because remove_ob can't really pass the object 830 * decisions, because remove_ob can't really pass the object
780 * that is being removed. 831 * that is being removed.
781 */ 832 */
… …
792 843
793object::object () 844object::object ()
794{ 845{
795 SET_FLAG (this, FLAG_REMOVED); 846 SET_FLAG (this, FLAG_REMOVED);
796 847
797 expmul = 1.0; 848 //expmul = 1.0; declared const for the time being
798 face = blank_face; 849 face = blank_face;
850 material = MATERIAL_NULL;
799} 851}
800 852
801object::~object () 853object::~object ()
802{ 854{
803 unlink (); 855 unlink ();
… …
831{ 883{
832 /* If already on active list, don't do anything */ 884 /* If already on active list, don't do anything */
833 if (active) 885 if (active)
834 return; 886 return;
835 887
836 if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
837 if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
838
839 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
840 actives.insert (this); 893 actives.insert (this);
894 }
841} 895}
842 896
843void 897void
844object::activate_recursive () 898object::activate_recursive ()
845{ 899{
… …
963 1017
964void 1018void
965object::do_destroy () 1019object::do_destroy ()
966{ 1020{
967 if (flag [FLAG_IS_LINKED]) 1021 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 1022 remove_link ();
969 1023
970 if (flag [FLAG_FRIENDLY]) 1024 if (flag [FLAG_FRIENDLY])
971 remove_friendly_object (this); 1025 remove_friendly_object (this);
972 1026
973 remove (); 1027 remove ();
… …
1031 * the previous environment. 1085 * the previous environment.
1032 */ 1086 */
1033void 1087void
1034object::do_remove () 1088object::do_remove ()
1035{ 1089{
1036 object *tmp, *last = 0;
1037 object *otmp;
1038
1039 if (flag [FLAG_REMOVED]) 1090 if (flag [FLAG_REMOVED])
1040 return; 1091 return;
1041 1092
1042 INVOKE_OBJECT (REMOVE, this); 1093 INVOKE_OBJECT (REMOVE, this);
1043 1094
… …
1109 close_container (); 1160 close_container ();
1110 1161
1111 --map->players; 1162 --map->players;
1112 map->touch (); 1163 map->touch ();
1113 } 1164 }
1114 else if (pl->container == this) 1165 else if (pl->container_ () == this)
1115 { 1166 {
1116 // removing a container should close it 1167 // removing a container should close it
1117 close_container (); 1168 close_container ();
1118 } 1169 }
1119 1170
… …
1135 1186
1136 int check_walk_off = !flag [FLAG_NO_APPLY]; 1187 int check_walk_off = !flag [FLAG_NO_APPLY];
1137 1188
1138 if (object *pl = ms.player ()) 1189 if (object *pl = ms.player ())
1139 { 1190 {
1140 if (pl->container == this) 1191 if (pl->container_ () == this)
1141 /* If a container that the player is currently using somehow gets 1192 /* If a container that the player is currently using somehow gets
1142 * removed (most likely destroyed), update the player view 1193 * removed (most likely destroyed), update the player view
1143 * appropriately. 1194 * appropriately.
1144 */ 1195 */
1145 pl->close_container (); 1196 pl->close_container ();
… …
1149 //TODO: update floorbox to preserve ordering 1200 //TODO: update floorbox to preserve ordering
1150 if (pl->contr->ns) 1201 if (pl->contr->ns)
1151 pl->contr->ns->floorbox_update (); 1202 pl->contr->ns->floorbox_update ();
1152 } 1203 }
1153 1204
1205 if (check_walk_off)
1154 for (tmp = ms.bot; tmp; tmp = tmp->above) 1206 for (object *above, *tmp = ms.bot; tmp; tmp = above)
1155 { 1207 {
1208 above = tmp->above;
1209
1156 /* 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
1157 * being removed. 1211 * being removed.
1158 */ 1212 */
1159 1213
1160 /* See if object moving off should effect something */ 1214 /* See if object moving off should effect something */
1161 if (check_walk_off
1162 && ((move_type & tmp->move_off) 1215 if ((move_type & tmp->move_off)
1163 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1216 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)
1164 {
1165 move_apply (tmp, this, 0); 1217 move_apply (tmp, this, 0);
1166
1167 if (destroyed ())
1168 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1169 } 1218 }
1170
1171 last = tmp;
1172 }
1173 1219
1174 if (affects_los ()) 1220 if (affects_los ())
1175 update_all_los (map, x, y); 1221 update_all_los (map, x, y);
1176 } 1222 }
1177} 1223}
… …
1297 1343
1298 if (object *more = op->more) 1344 if (object *more = op->more)
1299 if (!insert_ob_in_map (more, m, originator, flag)) 1345 if (!insert_ob_in_map (more, m, originator, flag))
1300 return 0; 1346 return 0;
1301 1347
1302 CLEAR_FLAG (op, FLAG_REMOVED); 1348 op->flag [FLAG_REMOVED] = false;
1303 1349 op->env = 0;
1304 op->map = newmap; 1350 op->map = newmap;
1351
1305 mapspace &ms = op->ms (); 1352 mapspace &ms = op->ms ();
1306 1353
1307 /* this has to be done after we translate the coordinates. 1354 /* this has to be done after we translate the coordinates.
1308 */ 1355 */
1309 if (op->nrof && !(flag & INS_NO_MERGE)) 1356 if (op->nrof && !(flag & INS_NO_MERGE))
… …
1330 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");
1331 abort (); 1378 abort ();
1332 } 1379 }
1333 1380
1334 if (!originator->is_on_map ()) 1381 if (!originator->is_on_map ())
1382 {
1335 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",
1336 op->debug_desc (), originator->debug_desc ()); 1384 op->debug_desc (), originator->debug_desc ());
1385 abort ();
1386 }
1337 1387
1338 op->above = originator; 1388 op->above = originator;
1339 op->below = originator->below; 1389 op->below = originator->below;
1340 originator->below = op; 1390 originator->below = op;
1341 1391
… …
1473 * blocked() and wall() work properly), and these flags are updated by 1523 * blocked() and wall() work properly), and these flags are updated by
1474 * update_object(). 1524 * update_object().
1475 */ 1525 */
1476 1526
1477 /* 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 */
1478 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1528 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1479 { 1529 {
1480 if (check_move_on (op, originator)) 1530 if (check_move_on (op, originator))
1481 return 0; 1531 return 0;
1482 1532
1483 /* 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
… …
1494/* this function inserts an object in the map, but if it 1544/* 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. 1545 * 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. 1546 * op is the object to insert it under: supplies x and the map.
1497 */ 1547 */
1498void 1548void
1499replace_insert_ob_in_map (const char *arch_string, object *op) 1549replace_insert_ob_in_map (shstr_tmp archname, object *op)
1500{ 1550{
1501 /* first search for itself and remove any old instances */ 1551 /* first search for itself and remove any old instances */
1502 1552
1503 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1553 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1504 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1554 if (tmp->arch->archname == archname) /* same archetype */
1505 tmp->destroy (); 1555 tmp->destroy ();
1506 1556
1507 object *tmp = arch_to_object (archetype::find (arch_string)); 1557 object *tmp = arch_to_object (archetype::find (archname));
1508 1558
1509 tmp->x = op->x; 1559 tmp->x = op->x;
1510 tmp->y = op->y; 1560 tmp->y = op->y;
1511 1561
1512 insert_ob_in_map (tmp, op->map, op, 0); 1562 insert_ob_in_map (tmp, op->map, op, 0);
… …
1517{ 1567{
1518 if (where->env) 1568 if (where->env)
1519 return where->env->insert (this); 1569 return where->env->insert (this);
1520 else 1570 else
1521 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;
1522} 1594}
1523 1595
1524/* 1596/*
1525 * decrease(object, number) decreases a specified number from 1597 * decrease(object, number) decreases a specified number from
1526 * 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
… …
1698 * on top. 1770 * on top.
1699 */ 1771 */
1700int 1772int
1701check_move_on (object *op, object *originator) 1773check_move_on (object *op, object *originator)
1702{ 1774{
1775 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1776 return 0;
1777
1703 object *tmp; 1778 object *tmp;
1704 maptile *m = op->map; 1779 maptile *m = op->map;
1705 int x = op->x, y = op->y; 1780 int x = op->x, y = op->y;
1706 1781
1707 MoveType move_on, move_slow, move_block; 1782 mapspace &ms = m->at (x, y);
1708 1783
1709 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1784 ms.update ();
1710 return 0;
1711 1785
1712 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1786 MoveType move_on = ms.move_on;
1713 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1787 MoveType move_slow = ms.move_slow;
1714 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1788 MoveType move_block = ms.move_block;
1715 1789
1716 /* 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,
1717 * 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
1718 * 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
1719 * as walking. 1793 * as walking.
… …
1730 return 0; 1804 return 0;
1731 1805
1732 /* The objects have to be checked from top to bottom. 1806 /* The objects have to be checked from top to bottom.
1733 * Hence, we first go to the top: 1807 * Hence, we first go to the top:
1734 */ 1808 */
1735 1809 for (object *next, *tmp = ms.top; tmp; tmp = next)
1736 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1737 {
1738 /* Trim the search when we find the first other spell effect
1739 * this helps performance so that if a space has 50 spell objects,
1740 * we don't need to check all of them.
1741 */
1742 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1743 break;
1744 } 1810 {
1811 next = tmp->below;
1745 1812
1746 for (; tmp; tmp = tmp->below)
1747 {
1748 if (tmp == op) 1813 if (tmp == op)
1749 continue; /* Can't apply yourself */ 1814 continue; /* Can't apply yourself */
1750 1815
1751 /* 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.
1752 * Second check makes sure that the movement types not being slowed 1817 * Second check makes sure that the movement types not being slowed
… …
1757 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1822 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1758 { 1823 {
1759 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1824 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1760 ((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))
1761 { 1826 {
1762
1763 float
1764 diff = tmp->move_slow_penalty * fabs (op->speed); 1827 float diff = tmp->move_slow_penalty * fabs (op->speed);
1765 1828
1766 if (op->is_player ()) 1829 if (op->is_player ())
1767 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)) ||
1768 (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)))
1769 diff /= 4.0; 1832 diff /= 4.0;
1770 1833
1771 op->speed_left -= diff; 1834 op->speed_left -= diff;
1772 } 1835 }
1773 } 1836 }
… …
2174 * 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
2175 * 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.
2176 * 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
2177 * functions. 2240 * functions.
2178 */ 2241 */
2179int reduction_dir[SIZEOFFREE][3] = { 2242static const int reduction_dir[SIZEOFFREE][3] = {
2180 {0, 0, 0}, /* 0 */ 2243 {0, 0, 0}, /* 0 */
2181 {0, 0, 0}, /* 1 */ 2244 {0, 0, 0}, /* 1 */
2182 {0, 0, 0}, /* 2 */ 2245 {0, 0, 0}, /* 2 */
2183 {0, 0, 0}, /* 3 */ 2246 {0, 0, 0}, /* 3 */
2184 {0, 0, 0}, /* 4 */ 2247 {0, 0, 0}, /* 4 */
… …
2322 return tmp; 2385 return tmp;
2323 2386
2324 return 0; 2387 return 0;
2325} 2388}
2326 2389
2327const shstr & 2390shstr_tmp
2328object::kv_get (const shstr &key) const 2391object::kv_get (shstr_tmp key) const
2329{ 2392{
2330 for (key_value *kv = key_values; kv; kv = kv->next) 2393 for (key_value *kv = key_values; kv; kv = kv->next)
2331 if (kv->key == key) 2394 if (kv->key == key)
2332 return kv->value; 2395 return kv->value;
2333 2396
2334 return shstr_null; 2397 return shstr ();
2335} 2398}
2336 2399
2337void 2400void
2338object::kv_set (const shstr &key, const shstr &value) 2401object::kv_set (shstr_tmp key, shstr_tmp value)
2339{ 2402{
2340 for (key_value *kv = key_values; kv; kv = kv->next) 2403 for (key_value *kv = key_values; kv; kv = kv->next)
2341 if (kv->key == key) 2404 if (kv->key == key)
2342 { 2405 {
2343 kv->value = value; 2406 kv->value = value;
… …
2352 2415
2353 key_values = kv; 2416 key_values = kv;
2354} 2417}
2355 2418
2356void 2419void
2357object::kv_del (const shstr &key) 2420object::kv_del (shstr_tmp key)
2358{ 2421{
2359 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2422 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2360 if ((*kvp)->key == key) 2423 if ((*kvp)->key == key)
2361 { 2424 {
2362 key_value *kv = *kvp; 2425 key_value *kv = *kvp;
… …
2455{ 2518{
2456 return map ? map->region (x, y) 2519 return map ? map->region (x, y)
2457 : region::default_region (); 2520 : region::default_region ();
2458} 2521}
2459 2522
2460const materialtype_t *
2461object::dominant_material () const
2462{
2463 if (materialtype_t *mt = name_to_material (materialname))
2464 return mt;
2465
2466 return name_to_material (shstr_unknown);
2467}
2468
2469void 2523void
2470object::open_container (object *new_container) 2524object::open_container (object *new_container)
2471{ 2525{
2472 if (container == new_container) 2526 if (container == new_container)
2473 return; 2527 return;
… …
2493 container = 0; 2547 container = 0;
2494 2548
2495 // 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
2496 esrv_update_item (UPD_FLAGS, this, old_container); 2550 esrv_update_item (UPD_FLAGS, this, old_container);
2497 2551
2498 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 ());
2499 play_sound (sound_find ("chest_close")); 2553 play_sound (sound_find ("chest_close"));
2500 } 2554 }
2501 2555
2502 if (new_container) 2556 if (new_container)
2503 { 2557 {
… …
2513 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2567 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2514 new_container->insert (closer); 2568 new_container->insert (closer);
2515 } 2569 }
2516#endif 2570#endif
2517 2571
2518 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 ());
2519 2573
2520 // 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
2521 esrv_send_item (this, new_container); 2575 esrv_send_item (this, new_container);
2522 2576
2523 new_container->flag [FLAG_APPLIED] = true; 2577 new_container->flag [FLAG_APPLIED] = true;
… …
2531// else if (!old_container->env && contr && contr->ns) 2585// else if (!old_container->env && contr && contr->ns)
2532// contr->ns->floorbox_reset (); 2586// contr->ns->floorbox_reset ();
2533} 2587}
2534 2588
2535object * 2589object *
2536object::force_find (const shstr name) 2590object::force_find (shstr_tmp name)
2537{ 2591{
2538 /* 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
2539 * place 2593 * place
2540 */ 2594 */
2541 for (object *tmp = inv; tmp; tmp = tmp->below) 2595 for (object *tmp = inv; tmp; tmp = tmp->below)
… …
2543 return splay (tmp); 2597 return splay (tmp);
2544 2598
2545 return 0; 2599 return 0;
2546} 2600}
2547 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
2548object * 2613object *
2549object::force_add (const shstr name, int duration) 2614object::force_add (shstr_tmp name, int duration)
2550{ 2615{
2551 if (object *force = force_find (name)) 2616 if (object *force = force_find (name))
2552 force->destroy (); 2617 force->destroy ();
2553 2618
2554 object *force = get_archetype (FORCE_NAME); 2619 object *force = get_archetype (FORCE_NAME);
2555 2620
2556 force->slaying = name; 2621 force->slaying = name;
2557 force->stats.food = 1; 2622 force->force_set_timer (duration);
2558 force->speed_left = -1.f;
2559
2560 force->set_speed (duration ? 1.f / duration : 0.f);
2561 force->flag [FLAG_IS_USED_UP] = true;
2562 force->flag [FLAG_APPLIED] = true; 2623 force->flag [FLAG_APPLIED] = true;
2563 2624
2564 return insert (force); 2625 return insert (force);
2565} 2626}
2566 2627
2567void 2628void
2568object::play_sound (faceidx sound) 2629object::play_sound (faceidx sound) const
2569{ 2630{
2570 if (!sound) 2631 if (!sound)
2571 return; 2632 return;
2572 2633
2573 if (flag [FLAG_REMOVED]) 2634 if (is_on_map ())
2574 return;
2575
2576 if (env)
2577 {
2578 if (object *pl = in_player ())
2579 pl->contr->play_sound (sound);
2580 }
2581 else
2582 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);
2583} 2647}
2584 2648
2585void 2649void
2586object::make_noise () 2650object::make_noise ()
2587{ 2651{

Diff Legend

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