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.141 by root, Sun Apr 29 21:44:34 2007 UTC vs.
Revision 1.202 by root, Thu Apr 10 15:35:15 2008 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your 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 GNU General Public License
19 * along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 20 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 22 */
24 23
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 26 variable. */
… …
29#include <stdio.h> 28#include <stdio.h>
30#include <sys/types.h> 29#include <sys/types.h>
31#include <sys/uio.h> 30#include <sys/uio.h>
32#include <object.h> 31#include <object.h>
33#include <funcpoint.h> 32#include <funcpoint.h>
33#include <sproto.h>
34#include <loader.h> 34#include <loader.h>
35 35
36#include <bitset> 36#include <bitset>
37 37
38int nrofallocobjects = 0; 38UUID UUID::cur;
39static UUID uuid;
40const uint64 UUID_SKIP = 1<<19; 39static const uint64 UUID_SKIP = 1<<19;
41 40
42objectvec objects; 41objectvec objects;
43activevec actives; 42activevec actives;
44 43
45short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 44short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
… …
70 { 69 {
71 LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); 70 LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
72 return; 71 return;
73 } 72 }
74 73
75 fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); 74 fprintf (fp, "<1,%llx>\n", (unsigned long long)UUID::cur.seq + UUID_SKIP * 2);
76 fclose (fp); 75 fclose (fp);
77 rename (filename2, filename1); 76 rename (filename2, filename1);
78} 77}
79 78
80static void 79static void
… …
89 if (!(fp = fopen (filename, "r"))) 88 if (!(fp = fopen (filename, "r")))
90 { 89 {
91 if (errno == ENOENT) 90 if (errno == ENOENT)
92 { 91 {
93 LOG (llevInfo, "RESET uid to 1\n"); 92 LOG (llevInfo, "RESET uid to 1\n");
94 uuid.seq = 0; 93 UUID::cur.seq = 0;
95 write_uuid (); 94 write_uuid ();
96 return; 95 return;
97 } 96 }
98 97
99 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 98 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
… …
106 { 105 {
107 LOG (llevError, "FATAL: error reading uid from %s!\n", filename); 106 LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
108 _exit (1); 107 _exit (1);
109 } 108 }
110 109
111 uuid.seq = uid; 110 UUID::cur.seq = uid;
112 write_uuid (); 111 write_uuid ();
113 LOG (llevDebug, "read UID: %" PRId64 "\n", uid); 112 LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
114 fclose (fp); 113 fclose (fp);
115} 114}
116 115
117UUID 116UUID
118gen_uuid () 117UUID::gen ()
119{ 118{
120 UUID uid; 119 UUID uid;
121 120
122 uid.seq = ++uuid.seq; 121 uid.seq = ++cur.seq;
123 122
124 if (!(uuid.seq & (UUID_SKIP - 1))) 123 if (!(cur.seq & (UUID_SKIP - 1)))
125 write_uuid (); 124 write_uuid ();
126 125
127 return uid; 126 return uid;
128} 127}
129 128
130void 129void
131init_uuid () 130UUID::init ()
132{ 131{
133 read_uuid (); 132 read_uuid ();
134} 133}
135 134
136/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 135/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
… …
254 /* This is really a spellbook check - really, we should 253 /* This is really a spellbook check - really, we should
255 * check all objects in the inventory. 254 * check all objects in the inventory.
256 */ 255 */
257 if (ob1->inv || ob2->inv) 256 if (ob1->inv || ob2->inv)
258 { 257 {
259 /* if one object has inventory but the other doesn't, not equiv */ 258 if (!(ob1->inv && ob2->inv))
260 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 259 return 0; /* inventories differ in length */
261 return 0;
262 260
263 /* Now check to see if the two inventory objects could merge */ 261 if (ob1->inv->below || ob2->inv->below)
262 return 0; /* more than one object in inv */
263
264 if (!object::can_merge (ob1->inv, ob2->inv)) 264 if (!object::can_merge (ob1->inv, ob2->inv))
265 return 0; 265 return 0; /* inventory objexts differ */
266 266
267 /* inventory ok - still need to check rest of this object to see 267 /* inventory ok - still need to check rest of this object to see
268 * if it is valid. 268 * if it is valid.
269 */ 269 */
270 } 270 }
… …
299 return 0; 299 return 0;
300 else if (!compare_ob_value_lists (ob1, ob2)) 300 else if (!compare_ob_value_lists (ob1, ob2))
301 return 0; 301 return 0;
302 } 302 }
303 303
304 //TODO: generate an event or call into perl for additional checks
305 if (ob1->self || ob2->self) 304 if (ob1->self || ob2->self)
306 { 305 {
307 ob1->optimise (); 306 ob1->optimise ();
308 ob2->optimise (); 307 ob2->optimise ();
309 308
310 if (ob1->self || ob2->self) 309 if (ob1->self || ob2->self)
310 {
311 int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0;
312 int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0;
313
314 if (k1 != k2)
311 return 0; 315 return 0;
316 else if (k1 == 0)
317 return 1;
318 else if (!cfperl_can_merge (ob1, ob2))
319 return 0;
320 }
312 } 321 }
313 322
314 /* Everything passes, must be OK. */ 323 /* Everything passes, must be OK. */
315 return 1; 324 return 1;
316}
317
318void
319player::set_range (rangetype r)
320{
321 shoottype = r;
322} 325}
323 326
324/* 327/*
325 * sum_weight() is a recursive function which calculates the weight 328 * sum_weight() is a recursive function which calculates the weight
326 * an object is carrying. It goes through in figures out how much 329 * an object is carrying. It goes through in figures out how much
… …
330sum_weight (object *op) 333sum_weight (object *op)
331{ 334{
332 long sum; 335 long sum;
333 object *inv; 336 object *inv;
334 337
335 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 338 for (sum = 0, inv = op->inv; inv; inv = inv->below)
336 { 339 {
337 if (inv->inv) 340 if (inv->inv)
338 sum_weight (inv); 341 sum_weight (inv);
342
339 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 343 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
340 } 344 }
341 345
342 if (op->type == CONTAINER && op->stats.Str) 346 if (op->type == CONTAINER && op->stats.Str)
343 sum = (sum * (100 - op->stats.Str)) / 100; 347 sum = (sum * (100 - op->stats.Str)) / 100;
… …
379/* 383/*
380 * get_nearest_part(multi-object, object 2) returns the part of the 384 * get_nearest_part(multi-object, object 2) returns the part of the
381 * multi-object 1 which is closest to the second object. 385 * multi-object 1 which is closest to the second object.
382 * If it's not a multi-object, it is returned. 386 * If it's not a multi-object, it is returned.
383 */ 387 */
384
385object * 388object *
386get_nearest_part (object *op, const object *pl) 389get_nearest_part (object *op, const object *pl)
387{ 390{
388 object *tmp, *closest; 391 object *tmp, *closest;
389 int last_dist, i; 392 int last_dist, i;
… …
425 break; 428 break;
426 429
427 return op; 430 return op;
428} 431}
429 432
430void
431free_all_object_data ()
432{
433 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
434}
435
436/* 433/*
437 * Sets the owner and sets the skill and exp pointers to owner's current 434 * Sets the owner and sets the skill and exp pointers to owner's current
438 * skill and experience objects. 435 * skill and experience objects.
436 * ACTUALLY NO! investigate! TODO
439 */ 437 */
440void 438void
441object::set_owner (object *owner) 439object::set_owner (object *owner)
442{ 440{
441 // allow objects which own objects
443 if (!owner) 442 if (owner)
444 return;
445
446 /* next line added to allow objects which own objects */
447 /* Add a check for ownercounts in here, as I got into an endless loop
448 * with the fireball owning a poison cloud which then owned the
449 * fireball. I believe that was caused by one of the objects getting
450 * freed and then another object replacing it. Since the ownercounts
451 * didn't match, this check is valid and I believe that cause is valid.
452 */
453 while (owner->owner) 443 while (owner->owner)
454 owner = owner->owner; 444 owner = owner->owner;
445
446 if (flag [FLAG_FREED])
447 {
448 LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ());
449 return;
450 }
455 451
456 this->owner = owner; 452 this->owner = owner;
453}
454
455int
456object::slottype () const
457{
458 if (type == SKILL)
459 {
460 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
461 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
462 }
463 else
464 {
465 if (slot [body_combat].info) return slot_combat;
466 if (slot [body_range ].info) return slot_ranged;
467 }
468
469 return slot_none;
470}
471
472bool
473object::change_weapon (object *ob)
474{
475 if (current_weapon == ob)
476 return true;
477
478 if (chosen_skill)
479 chosen_skill->flag [FLAG_APPLIED] = false;
480
481 current_weapon = ob;
482 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
483
484 if (chosen_skill)
485 chosen_skill->flag [FLAG_APPLIED] = true;
486
487 update_stats ();
488
489 if (ob)
490 {
491 // now check wether any body locations became invalid, in which case
492 // we cannot apply the weapon at the moment.
493 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
494 if (slot[i].used < 0)
495 {
496 current_weapon = chosen_skill = 0;
497 update_stats ();
498
499 new_draw_info_format (NDI_UNIQUE, 0, this,
500 "You try to balance all your items at once, "
501 "but the %s is just too much for your body. "
502 "[You need to unapply some items first.]", &ob->name);
503 return false;
504 }
505
506 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
507 }
508 else
509 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
510
511 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
512 {
513 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
514 &name, ob->debug_desc ());
515 return false;
516 }
517
518 return true;
457} 519}
458 520
459/* Zero the key_values on op, decrementing the shared-string 521/* Zero the key_values on op, decrementing the shared-string
460 * refcounts and freeing the links. 522 * refcounts and freeing the links.
461 */ 523 */
… …
525object::copy_to (object *dst) 587object::copy_to (object *dst)
526{ 588{
527 *dst = *this; 589 *dst = *this;
528 590
529 if (speed < 0) 591 if (speed < 0)
530 dst->speed_left = speed_left - rndm (); 592 dst->speed_left -= rndm ();
531 593
532 dst->set_speed (dst->speed); 594 dst->set_speed (dst->speed);
533} 595}
534 596
535void 597void
536object::instantiate () 598object::instantiate ()
537{ 599{
538 if (!uuid.seq) // HACK 600 if (!uuid.seq) // HACK
539 uuid = gen_uuid (); 601 uuid = UUID::gen ();
540 602
541 speed_left = -0.1f; 603 speed_left = -0.1f;
542 /* copy the body_info to the body_used - this is only really 604 /* copy the body_info to the body_used - this is only really
543 * need for monsters, but doesn't hurt to do it for everything. 605 * need for monsters, but doesn't hurt to do it for everything.
544 * by doing so, when a monster is created, it has good starting 606 * by doing so, when a monster is created, it has good starting
545 * values for the body_used info, so when items are created 607 * values for the body_used info, so when items are created
546 * for it, they can be properly equipped. 608 * for it, they can be properly equipped.
547 */ 609 */
548 memcpy (body_used, body_info, sizeof (body_used)); 610 for (int i = NUM_BODY_LOCATIONS; i--; )
611 slot[i].used = slot[i].info;
549 612
550 attachable::instantiate (); 613 attachable::instantiate ();
551} 614}
552 615
553object * 616object *
… …
702static int object_count; 765static int object_count;
703 766
704void object::link () 767void object::link ()
705{ 768{
706 assert (!index);//D 769 assert (!index);//D
707 uuid = gen_uuid (); 770 uuid = UUID::gen ();
708 count = ++object_count; 771 count = ++object_count;
709 772
710 refcnt_inc (); 773 refcnt_inc ();
711 objects.insert (this); 774 objects.insert (this);
712} 775}
… …
861 924
862 if (!freed_map) 925 if (!freed_map)
863 { 926 {
864 freed_map = new maptile; 927 freed_map = new maptile;
865 928
929 freed_map->path = "<freed objects map>";
866 freed_map->name = "/internal/freed_objects_map"; 930 freed_map->name = "/internal/freed_objects_map";
867 freed_map->width = 3; 931 freed_map->width = 3;
868 freed_map->height = 3; 932 freed_map->height = 3;
933 freed_map->nodrop = 1;
869 934
870 freed_map->alloc (); 935 freed_map->alloc ();
871 freed_map->in_memory = MAP_IN_MEMORY; 936 freed_map->in_memory = MAP_IN_MEMORY;
872 } 937 }
873 938
874 map = freed_map; 939 map = freed_map;
875 x = 1; 940 x = 1;
876 y = 1; 941 y = 1;
877 } 942 }
878 943
879 head = 0;
880
881 if (more) 944 if (more)
882 { 945 {
883 more->destroy (); 946 more->destroy ();
884 more = 0; 947 more = 0;
885 } 948 }
886 949
950 head = 0;
951
887 // clear those pointers that likely might have circular references to us 952 // clear those pointers that likely might cause circular references
888 owner = 0; 953 owner = 0;
889 enemy = 0; 954 enemy = 0;
890 attacked_by = 0; 955 attacked_by = 0;
956 current_weapon = 0;
891} 957}
892 958
893void 959void
894object::destroy (bool destroy_inventory) 960object::destroy (bool destroy_inventory)
895{ 961{
896 if (destroyed ()) 962 if (destroyed ())
897 return; 963 return;
898 964
899 if (destroy_inventory) 965 if (destroy_inventory)
900 destroy_inv (false); 966 destroy_inv (false);
967
968 if (is_head ())
969 if (sound_destroy)
970 play_sound (sound_destroy);
971 else if (flag [FLAG_MONSTER])
972 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
901 973
902 attachable::destroy (); 974 attachable::destroy ();
903} 975}
904 976
905/* 977/*
… …
1020 if (map->in_memory == MAP_SAVING) 1092 if (map->in_memory == MAP_SAVING)
1021 return; 1093 return;
1022 1094
1023 int check_walk_off = !flag [FLAG_NO_APPLY]; 1095 int check_walk_off = !flag [FLAG_NO_APPLY];
1024 1096
1097 if (object *pl = ms.player ())
1098 {
1099 if (pl->container == this)
1100 /* If a container that the player is currently using somehow gets
1101 * removed (most likely destroyed), update the player view
1102 * appropriately.
1103 */
1104 pl->close_container ();
1105
1106 pl->contr->ns->floorbox_update ();
1107 }
1108
1025 for (tmp = ms.bot; tmp; tmp = tmp->above) 1109 for (tmp = ms.bot; tmp; tmp = tmp->above)
1026 { 1110 {
1027 /* No point updating the players look faces if he is the object 1111 /* No point updating the players look faces if he is the object
1028 * being removed. 1112 * being removed.
1029 */ 1113 */
1030
1031 if (tmp->type == PLAYER && tmp != this)
1032 {
1033 /* If a container that the player is currently using somehow gets
1034 * removed (most likely destroyed), update the player view
1035 * appropriately.
1036 */
1037 if (tmp->container == this)
1038 {
1039 flag [FLAG_APPLIED] = 0;
1040 tmp->container = 0;
1041 }
1042
1043 if (tmp->contr->ns)
1044 tmp->contr->ns->floorbox_update ();
1045 }
1046 1114
1047 /* See if object moving off should effect something */ 1115 /* See if object moving off should effect something */
1048 if (check_walk_off 1116 if (check_walk_off
1049 && ((move_type & tmp->move_off) 1117 && ((move_type & tmp->move_off)
1050 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1118 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
… …
1053 1121
1054 if (destroyed ()) 1122 if (destroyed ())
1055 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1123 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1056 } 1124 }
1057 1125
1058 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1059 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1060 if (tmp->above == tmp)
1061 tmp->above = 0;
1062
1063 last = tmp; 1126 last = tmp;
1064 } 1127 }
1065 1128
1066 /* last == NULL if there are no objects on this space */ 1129 /* last == NULL if there are no objects on this space */
1067 //TODO: this makes little sense, why only update the topmost object? 1130 //TODO: this makes little sense, why only update the topmost object?
… …
1087merge_ob (object *op, object *top) 1150merge_ob (object *op, object *top)
1088{ 1151{
1089 if (!op->nrof) 1152 if (!op->nrof)
1090 return 0; 1153 return 0;
1091 1154
1092 if (top) 1155 if (!top)
1093 for (top = op; top && top->above; top = top->above) 1156 for (top = op; top && top->above; top = top->above)
1094 ; 1157 ;
1095 1158
1096 for (; top; top = top->below) 1159 for (; top; top = top->below)
1097 { 1160 {
… …
1118 if (more) 1181 if (more)
1119 return; 1182 return;
1120 1183
1121 object *prev = this; 1184 object *prev = this;
1122 1185
1123 for (archetype *at = arch->more; at; at = at->more) 1186 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1124 { 1187 {
1125 object *op = arch_to_object (at); 1188 object *op = arch_to_object (at);
1126 1189
1127 op->name = name; 1190 op->name = name;
1128 op->name_pl = name_pl; 1191 op->name_pl = name_pl;
… …
1142object * 1205object *
1143insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1206insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1144{ 1207{
1145 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1208 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1146 { 1209 {
1147 tmp->x = x + tmp->arch->clone.x; 1210 tmp->x = x + tmp->arch->x;
1148 tmp->y = y + tmp->arch->clone.y; 1211 tmp->y = y + tmp->arch->y;
1149 } 1212 }
1150 1213
1151 return insert_ob_in_map (op, m, originator, flag); 1214 return insert_ob_in_map (op, m, originator, flag);
1152} 1215}
1153 1216
… …
1174object * 1237object *
1175insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1176{ 1239{
1177 assert (!op->flag [FLAG_FREED]); 1240 assert (!op->flag [FLAG_FREED]);
1178 1241
1179 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1180 1243
1181 op->remove (); 1244 op->remove ();
1182
1183#if 0
1184 if (!m->active != !op->active)
1185 if (m->active)
1186 op->activate_recursive ();
1187 else
1188 op->deactivate_recursive ();
1189#endif
1190
1191 if (out_of_map (m, op->x, op->y))
1192 {
1193 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1194#ifdef MANY_CORES
1195 /* Better to catch this here, as otherwise the next use of this object
1196 * is likely to cause a crash. Better to find out where it is getting
1197 * improperly inserted.
1198 */
1199 abort ();
1200#endif
1201 return op;
1202 }
1203
1204 if (object *more = op->more)
1205 {
1206 if (!insert_ob_in_map (more, m, originator, flag))
1207 {
1208 if (!op->head)
1209 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1210
1211 return 0;
1212 }
1213 }
1214
1215 CLEAR_FLAG (op, FLAG_REMOVED);
1216 1245
1217 /* Ideally, the caller figures this out. However, it complicates a lot 1246 /* Ideally, the caller figures this out. However, it complicates a lot
1218 * of areas of callers (eg, anything that uses find_free_spot would now 1247 * of areas of callers (eg, anything that uses find_free_spot would now
1219 * need extra work 1248 * need extra work
1220 */ 1249 */
1221 if (!xy_normalise (m, op->x, op->y)) 1250 if (!xy_normalise (m, op->x, op->y))
1251 {
1252 op->destroy ();
1222 return 0; 1253 return 0;
1254 }
1255
1256 if (object *more = op->more)
1257 if (!insert_ob_in_map (more, m, originator, flag))
1258 return 0;
1259
1260 CLEAR_FLAG (op, FLAG_REMOVED);
1223 1261
1224 op->map = m; 1262 op->map = m;
1225 mapspace &ms = op->ms (); 1263 mapspace &ms = op->ms ();
1226 1264
1227 /* this has to be done after we translate the coordinates. 1265 /* this has to be done after we translate the coordinates.
1228 */ 1266 */
1229 if (op->nrof && !(flag & INS_NO_MERGE)) 1267 if (op->nrof && !(flag & INS_NO_MERGE))
1230 for (tmp = ms.bot; tmp; tmp = tmp->above) 1268 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1231 if (object::can_merge (op, tmp)) 1269 if (object::can_merge (op, tmp))
1232 { 1270 {
1233 op->nrof += tmp->nrof; 1271 op->nrof += tmp->nrof;
1234 tmp->destroy (); 1272 tmp->destroy ();
1235 } 1273 }
… …
1262 else 1300 else
1263 { 1301 {
1264 top = ms.bot; 1302 top = ms.bot;
1265 1303
1266 /* If there are other objects, then */ 1304 /* If there are other objects, then */
1267 if ((!(flag & INS_MAP_LOAD)) && top) 1305 if (top)
1268 { 1306 {
1269 object *last = 0; 1307 object *last = 0;
1270 1308
1271 /* 1309 /*
1272 * If there are multiple objects on this space, we do some trickier handling. 1310 * If there are multiple objects on this space, we do some trickier handling.
… …
1325 if (last && last->below && last != floor) 1363 if (last && last->below && last != floor)
1326 top = last->below; 1364 top = last->below;
1327 } 1365 }
1328 } /* If objects on this space */ 1366 } /* If objects on this space */
1329 1367
1330 if (flag & INS_MAP_LOAD)
1331 top = ms.top;
1332
1333 if (flag & INS_ABOVE_FLOOR_ONLY) 1368 if (flag & INS_ABOVE_FLOOR_ONLY)
1334 top = floor; 1369 top = floor;
1335 1370
1336 /* Top is the object that our object (op) is going to get inserted above. 1371 /* Top is the object that our object (op) is going to get inserted above.
1337 */ 1372 */
… …
1369 op->map->touch (); 1404 op->map->touch ();
1370 } 1405 }
1371 1406
1372 op->map->dirty = true; 1407 op->map->dirty = true;
1373 1408
1374 /* If we have a floor, we know the player, if any, will be above
1375 * it, so save a few ticks and start from there.
1376 */
1377 if (!(flag & INS_MAP_LOAD))
1378 if (object *pl = ms.player ()) 1409 if (object *pl = ms.player ())
1379 if (pl->contr->ns)
1380 pl->contr->ns->floorbox_update (); 1410 pl->contr->ns->floorbox_update ();
1381 1411
1382 /* If this object glows, it may affect lighting conditions that are 1412 /* If this object glows, it may affect lighting conditions that are
1383 * visible to others on this map. But update_all_los is really 1413 * visible to others on this map. But update_all_los is really
1384 * an inefficient way to do this, as it means los for all players 1414 * an inefficient way to do this, as it means los for all players
1385 * on the map will get recalculated. The players could very well 1415 * on the map will get recalculated. The players could very well
… …
1404 * blocked() and wall() work properly), and these flags are updated by 1434 * blocked() and wall() work properly), and these flags are updated by
1405 * update_object(). 1435 * update_object().
1406 */ 1436 */
1407 1437
1408 /* if this is not the head or flag has been passed, don't check walk on status */ 1438 /* if this is not the head or flag has been passed, don't check walk on status */
1409 if (!(flag & INS_NO_WALK_ON) && !op->head) 1439 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1410 { 1440 {
1411 if (check_move_on (op, originator)) 1441 if (check_move_on (op, originator))
1412 return 0; 1442 return 0;
1413 1443
1414 /* If we are a multi part object, lets work our way through the check 1444 /* If we are a multi part object, lets work our way through the check
1415 * walk on's. 1445 * walk on's.
1416 */ 1446 */
1417 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1447 for (object *tmp = op->more; tmp; tmp = tmp->more)
1418 if (check_move_on (tmp, originator)) 1448 if (check_move_on (tmp, originator))
1419 return 0; 1449 return 0;
1420 } 1450 }
1421 1451
1422 return op; 1452 return op;
… …
1432 object *tmp, *tmp1; 1462 object *tmp, *tmp1;
1433 1463
1434 /* first search for itself and remove any old instances */ 1464 /* first search for itself and remove any old instances */
1435 1465
1436 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1466 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1437 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1467 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1438 tmp->destroy (); 1468 tmp->destroy ();
1439 1469
1440 tmp1 = arch_to_object (archetype::find (arch_string)); 1470 tmp1 = arch_to_object (archetype::find (arch_string));
1441 1471
1442 tmp1->x = op->x; 1472 tmp1->x = op->x;
… …
1603 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1633 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1604 free (dump); 1634 free (dump);
1605 return op; 1635 return op;
1606 } 1636 }
1607 1637
1608 if (where->head) 1638 if (where->head_ () != where)
1609 { 1639 {
1610 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1640 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1611 where = where->head; 1641 where = where->head;
1612 } 1642 }
1613 1643
1614 return where->insert (op); 1644 return where->insert (op);
1615} 1645}
… …
1623 * be != op, if items are merged. -Tero 1653 * be != op, if items are merged. -Tero
1624 */ 1654 */
1625object * 1655object *
1626object::insert (object *op) 1656object::insert (object *op)
1627{ 1657{
1628 object *tmp, *otmp;
1629
1630 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1658 if (!QUERY_FLAG (op, FLAG_REMOVED))
1631 op->remove (); 1659 op->remove ();
1632 1660
1633 if (op->more) 1661 if (op->more)
1634 { 1662 {
… …
1636 return op; 1664 return op;
1637 } 1665 }
1638 1666
1639 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1667 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1640 CLEAR_FLAG (op, FLAG_REMOVED); 1668 CLEAR_FLAG (op, FLAG_REMOVED);
1669
1641 if (op->nrof) 1670 if (op->nrof)
1642 { 1671 {
1643 for (tmp = inv; tmp != NULL; tmp = tmp->below) 1672 for (object *tmp = inv; tmp; tmp = tmp->below)
1644 if (object::can_merge (tmp, op)) 1673 if (object::can_merge (tmp, op))
1645 { 1674 {
1646 /* return the original object and remove inserted object 1675 /* return the original object and remove inserted object
1647 (client needs the original object) */ 1676 (client needs the original object) */
1648 tmp->nrof += op->nrof; 1677 tmp->nrof += op->nrof;
… …
1667 add_weight (this, op->weight * op->nrof); 1696 add_weight (this, op->weight * op->nrof);
1668 } 1697 }
1669 else 1698 else
1670 add_weight (this, (op->weight + op->carrying)); 1699 add_weight (this, (op->weight + op->carrying));
1671 1700
1672 otmp = this->in_player (); 1701 if (object *otmp = this->in_player ())
1673 if (otmp && otmp->contr)
1674 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1702 if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1675 otmp->update_stats (); 1703 otmp->update_stats ();
1676 1704
1705 op->owner = 0; // its his/hers now. period.
1677 op->map = 0; 1706 op->map = 0;
1678 op->env = this; 1707 op->env = this;
1679 op->above = 0; 1708 op->above = 0;
1680 op->below = 0; 1709 op->below = 0;
1681 op->x = 0, op->y = 0; 1710 op->x = op->y = 0;
1682 1711
1683 /* reset the light list and los of the players on the map */ 1712 /* reset the light list and los of the players on the map */
1684 if ((op->glow_radius != 0) && map) 1713 if (op->glow_radius && map)
1685 { 1714 {
1686#ifdef DEBUG_LIGHTS 1715#ifdef DEBUG_LIGHTS
1687 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1716 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1688#endif /* DEBUG_LIGHTS */ 1717#endif /* DEBUG_LIGHTS */
1689 if (map->darkness) 1718 if (map->darkness)
… …
1923 * activate recursively a flag on an object inventory 1952 * activate recursively a flag on an object inventory
1924 */ 1953 */
1925void 1954void
1926flag_inv (object *op, int flag) 1955flag_inv (object *op, int flag)
1927{ 1956{
1928 if (op->inv)
1929 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1957 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1930 { 1958 {
1931 SET_FLAG (tmp, flag); 1959 SET_FLAG (tmp, flag);
1932 flag_inv (tmp, flag); 1960 flag_inv (tmp, flag);
1933 } 1961 }
1934} 1962}
1935 1963
1936/* 1964/*
1937 * deactivate recursively a flag on an object inventory 1965 * deactivate recursively a flag on an object inventory
1938 */ 1966 */
1939void 1967void
1940unflag_inv (object *op, int flag) 1968unflag_inv (object *op, int flag)
1941{ 1969{
1942 if (op->inv)
1943 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1970 for (object *tmp = op->inv; tmp; tmp = tmp->below)
1944 { 1971 {
1945 CLEAR_FLAG (tmp, flag); 1972 CLEAR_FLAG (tmp, flag);
1946 unflag_inv (tmp, flag); 1973 unflag_inv (tmp, flag);
1947 } 1974 }
1948}
1949
1950/*
1951 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1952 * all it's inventory (recursively).
1953 * If checksums are used, a player will get set_cheat called for
1954 * him/her-self and all object carried by a call to this function.
1955 */
1956void
1957set_cheat (object *op)
1958{
1959 SET_FLAG (op, FLAG_WAS_WIZ);
1960 flag_inv (op, FLAG_WAS_WIZ);
1961} 1975}
1962 1976
1963/* 1977/*
1964 * find_free_spot(object, map, x, y, start, stop) will search for 1978 * find_free_spot(object, map, x, y, start, stop) will search for
1965 * a spot at the given map and coordinates which will be able to contain 1979 * a spot at the given map and coordinates which will be able to contain
… …
1967 * to search (see the freearr_x/y[] definition). 1981 * to search (see the freearr_x/y[] definition).
1968 * It returns a random choice among the alternatives found. 1982 * It returns a random choice among the alternatives found.
1969 * start and stop are where to start relative to the free_arr array (1,9 1983 * start and stop are where to start relative to the free_arr array (1,9
1970 * does all 4 immediate directions). This returns the index into the 1984 * does all 4 immediate directions). This returns the index into the
1971 * array of the free spot, -1 if no spot available (dir 0 = x,y) 1985 * array of the free spot, -1 if no spot available (dir 0 = x,y)
1972 * Note - this only checks to see if there is space for the head of the
1973 * object - if it is a multispace object, this should be called for all
1974 * pieces.
1975 * Note2: This function does correctly handle tiled maps, but does not 1986 * Note: This function does correctly handle tiled maps, but does not
1976 * inform the caller. However, insert_ob_in_map will update as 1987 * inform the caller. However, insert_ob_in_map will update as
1977 * necessary, so the caller shouldn't need to do any special work. 1988 * necessary, so the caller shouldn't need to do any special work.
1978 * Note - updated to take an object instead of archetype - this is necessary 1989 * Note - updated to take an object instead of archetype - this is necessary
1979 * because arch_blocked (now ob_blocked) needs to know the movement type 1990 * because arch_blocked (now ob_blocked) needs to know the movement type
1980 * to know if the space in question will block the object. We can't use 1991 * to know if the space in question will block the object. We can't use
… …
1982 * customized, changed states, etc. 1993 * customized, changed states, etc.
1983 */ 1994 */
1984int 1995int
1985find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 1996find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
1986{ 1997{
1998 int altern[SIZEOFFREE];
1987 int index = 0, flag; 1999 int index = 0, flag;
1988 int altern[SIZEOFFREE];
1989 2000
1990 for (int i = start; i < stop; i++) 2001 for (int i = start; i < stop; i++)
1991 { 2002 {
1992 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 2003 mapxy pos (m, x, y); pos.move (i);
1993 if (!flag) 2004
2005 if (!pos.normalise ())
2006 continue;
2007
2008 mapspace &ms = *pos;
2009
2010 if (ms.flags () & P_IS_ALIVE)
2011 continue;
2012
2013 /* However, often
2014 * ob doesn't have any move type (when used to place exits)
2015 * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work.
2016 */
2017 if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL)
2018 {
1994 altern [index++] = i; 2019 altern [index++] = i;
2020 continue;
2021 }
1995 2022
1996 /* Basically, if we find a wall on a space, we cut down the search size. 2023 /* Basically, if we find a wall on a space, we cut down the search size.
1997 * In this way, we won't return spaces that are on another side of a wall. 2024 * In this way, we won't return spaces that are on another side of a wall.
1998 * This mostly work, but it cuts down the search size in all directions - 2025 * This mostly work, but it cuts down the search size in all directions -
1999 * if the space being examined only has a wall to the north and empty 2026 * if the space being examined only has a wall to the north and empty
2000 * spaces in all the other directions, this will reduce the search space 2027 * spaces in all the other directions, this will reduce the search space
2001 * to only the spaces immediately surrounding the target area, and 2028 * to only the spaces immediately surrounding the target area, and
2002 * won't look 2 spaces south of the target space. 2029 * won't look 2 spaces south of the target space.
2003 */ 2030 */
2004 else if ((flag & P_NO_PASS) && maxfree[i] < stop) 2031 if (ms.move_block == MOVE_ALL && maxfree[i] < stop)
2032 {
2005 stop = maxfree[i]; 2033 stop = maxfree[i];
2034 continue;
2035 }
2036
2037 /* Note it is intentional that we check ob - the movement type of the
2038 * head of the object should correspond for the entire object.
2039 */
2040 if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block))
2041 continue;
2042
2043 if (ob->blocked (m, pos.x, pos.y))
2044 continue;
2045
2046 altern [index++] = i;
2006 } 2047 }
2007 2048
2008 if (!index) 2049 if (!index)
2009 return -1; 2050 return -1;
2010 2051
… …
2019 */ 2060 */
2020int 2061int
2021find_first_free_spot (const object *ob, maptile *m, int x, int y) 2062find_first_free_spot (const object *ob, maptile *m, int x, int y)
2022{ 2063{
2023 for (int i = 0; i < SIZEOFFREE; i++) 2064 for (int i = 0; i < SIZEOFFREE; i++)
2024 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2065 if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i]))
2025 return i; 2066 return i;
2026 2067
2027 return -1; 2068 return -1;
2028} 2069}
2029 2070
… …
2083 object *tmp; 2124 object *tmp;
2084 maptile *mp; 2125 maptile *mp;
2085 2126
2086 MoveType blocked, move_type; 2127 MoveType blocked, move_type;
2087 2128
2088 if (exclude && exclude->head) 2129 if (exclude && exclude->head_ () != exclude)
2089 { 2130 {
2090 exclude = exclude->head; 2131 exclude = exclude->head;
2091 move_type = exclude->move_type; 2132 move_type = exclude->move_type;
2092 } 2133 }
2093 else 2134 else
… …
2116 max = maxfree[i]; 2157 max = maxfree[i];
2117 else if (mflags & P_IS_ALIVE) 2158 else if (mflags & P_IS_ALIVE)
2118 { 2159 {
2119 for (tmp = ms.bot; tmp; tmp = tmp->above) 2160 for (tmp = ms.bot; tmp; tmp = tmp->above)
2120 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2161 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2121 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2162 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2122 break; 2163 break;
2123 2164
2124 if (tmp) 2165 if (tmp)
2125 return freedir[i]; 2166 return freedir[i];
2126 } 2167 }
… …
2306 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause 2347 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2307 * core dumps if they do. 2348 * core dumps if they do.
2308 * 2349 *
2309 * Add a check so we can't pick up invisible objects (0.93.8) 2350 * Add a check so we can't pick up invisible objects (0.93.8)
2310 */ 2351 */
2311
2312int 2352int
2313can_pick (const object *who, const object *item) 2353can_pick (const object *who, const object *item)
2314{ 2354{
2315 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2355 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2316 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2356 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
… …
2321 * create clone from object to another 2361 * create clone from object to another
2322 */ 2362 */
2323object * 2363object *
2324object_create_clone (object *asrc) 2364object_create_clone (object *asrc)
2325{ 2365{
2326 object *dst = 0, *tmp, *src, *part, *prev, *item; 2366 object *dst = 0, *tmp, *src, *prev, *item;
2327 2367
2328 if (!asrc) 2368 if (!asrc)
2329 return 0; 2369 return 0;
2330 2370
2331 src = asrc;
2332 if (src->head)
2333 src = src->head; 2371 src = asrc->head_ ();
2334 2372
2335 prev = 0; 2373 prev = 0;
2336 for (part = src; part; part = part->more) 2374 for (object *part = src; part; part = part->more)
2337 { 2375 {
2338 tmp = part->clone (); 2376 tmp = part->clone ();
2339 tmp->x -= src->x; 2377 tmp->x -= src->x;
2340 tmp->y -= src->y; 2378 tmp->y -= src->y;
2341 2379
… …
2454 /* Basically, if the archetype has this key set, 2492 /* Basically, if the archetype has this key set,
2455 * we need to store the null value so when we save 2493 * we need to store the null value so when we save
2456 * it, we save the empty value so that when we load, 2494 * it, we save the empty value so that when we load,
2457 * we get this value back again. 2495 * we get this value back again.
2458 */ 2496 */
2459 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2497 if (get_ob_key_link (op->arch, canonical_key))
2460 field->value = 0; 2498 field->value = 0;
2461 else 2499 else
2462 { 2500 {
2463 if (last) 2501 if (last)
2464 last->next = field->next; 2502 last->next = field->next;
… …
2533 } 2571 }
2534 else 2572 else
2535 item = item->env; 2573 item = item->env;
2536} 2574}
2537 2575
2538
2539const char * 2576const char *
2540object::flag_desc (char *desc, int len) const 2577object::flag_desc (char *desc, int len) const
2541{ 2578{
2542 char *p = desc; 2579 char *p = desc;
2543 bool first = true; 2580 bool first = true;
… …
2577 &name, 2614 &name,
2578 title ? "\",title:\"" : "", 2615 title ? "\",title:\"" : "",
2579 title ? (const char *)title : "", 2616 title ? (const char *)title : "",
2580 flag_desc (flagdesc, 512), type); 2617 flag_desc (flagdesc, 512), type);
2581 2618
2582 if (env) 2619 if (!this->flag[FLAG_REMOVED] && env)
2583 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2620 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2584 2621
2585 if (map) 2622 if (map)
2586 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); 2623 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2587 2624
… …
2589} 2626}
2590 2627
2591const char * 2628const char *
2592object::debug_desc () const 2629object::debug_desc () const
2593{ 2630{
2594 static char info[256 * 4]; 2631 static char info[3][256 * 4];
2632 static int info_idx;
2633
2595 return debug_desc (info); 2634 return debug_desc (info [++info_idx % 3]);
2596}
2597
2598const char *
2599object::debug_desc2 () const
2600{
2601 static char info[256 * 4];
2602 return debug_desc (info);
2603} 2635}
2604 2636
2605struct region * 2637struct region *
2606object::region () const 2638object::region () const
2607{ 2639{
… …
2610} 2642}
2611 2643
2612const materialtype_t * 2644const materialtype_t *
2613object::dominant_material () const 2645object::dominant_material () const
2614{ 2646{
2615 if (materialtype_t *mat = name_to_material (materialname)) 2647 if (materialtype_t *mt = name_to_material (materialname))
2616 return mat; 2648 return mt;
2617 2649
2618 // omfg this is slow, this has to be temporary :)
2619 shstr unknown ("unknown");
2620
2621 return name_to_material (unknown); 2650 return name_to_material (shstr_unknown);
2622} 2651}
2623 2652
2624void 2653void
2625object::open_container (object *new_container) 2654object::open_container (object *new_container)
2626{ 2655{
… …
2642 old_container->flag [FLAG_APPLIED] = 0; 2671 old_container->flag [FLAG_APPLIED] = 0;
2643 container = 0; 2672 container = 0;
2644 2673
2645 esrv_update_item (UPD_FLAGS, this, old_container); 2674 esrv_update_item (UPD_FLAGS, this, old_container);
2646 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2675 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2676 play_sound (sound_find ("chest_close"));
2647 } 2677 }
2648 2678
2649 if (new_container) 2679 if (new_container)
2650 { 2680 {
2651 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) 2681 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
… …
2667 new_container->flag [FLAG_APPLIED] = 1; 2697 new_container->flag [FLAG_APPLIED] = 1;
2668 container = new_container; 2698 container = new_container;
2669 2699
2670 esrv_update_item (UPD_FLAGS, this, new_container); 2700 esrv_update_item (UPD_FLAGS, this, new_container);
2671 esrv_send_inventory (this, new_container); 2701 esrv_send_inventory (this, new_container);
2702 play_sound (sound_find ("chest_open"));
2703 }
2704}
2705
2706object *
2707object::force_find (const shstr name)
2708{
2709 /* cycle through his inventory to look for the MARK we want to
2710 * place
2711 */
2712 for (object *tmp = inv; tmp; tmp = tmp->below)
2713 if (tmp->type == FORCE && tmp->slaying == name)
2714 return splay (tmp);
2715
2716 return 0;
2717}
2718
2719void
2720object::force_add (const shstr name, int duration)
2721{
2722 if (object *force = force_find (name))
2723 force->destroy ();
2724
2725 object *force = get_archetype (FORCE_NAME);
2726
2727 force->slaying = name;
2728 force->stats.food = 1;
2729 force->speed_left = -1.f;
2730
2731 force->set_speed (duration ? 1.f / duration : 0.f);
2732 force->flag [FLAG_IS_USED_UP] = true;
2733 force->flag [FLAG_APPLIED] = true;
2734
2735 insert (force);
2736}
2737
2738void
2739object::play_sound (faceidx sound) const
2740{
2741 if (!sound)
2742 return;
2743
2744 if (flag [FLAG_REMOVED])
2745 return;
2746
2747 if (env)
2672 } 2748 {
2749 if (object *pl = in_player ())
2750 pl->contr->play_sound (sound);
2751 }
2752 else
2753 map->play_sound (sound, x, y);
2673} 2754}
2674 2755
2675

Diff Legend

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