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.187 by root, Tue Sep 4 08:42:55 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 * 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT 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 * Crossfire TRT 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 <crossfire@schmorp.de>
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; 38int nrofallocobjects = 0;
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 if (!cfperl_can_merge (ob1, ob2))
311 return 0; 311 return 0;
312 } 312 }
313 313
314 /* Everything passes, must be OK. */ 314 /* Everything passes, must be OK. */
315 return 1; 315 return 1;
316}
317
318void
319player::set_range (rangetype r)
320{
321 shoottype = r;
322} 316}
323 317
324/* 318/*
325 * sum_weight() is a recursive function which calculates the weight 319 * sum_weight() is a recursive function which calculates the weight
326 * an object is carrying. It goes through in figures out how much 320 * an object is carrying. It goes through in figures out how much
330sum_weight (object *op) 324sum_weight (object *op)
331{ 325{
332 long sum; 326 long sum;
333 object *inv; 327 object *inv;
334 328
335 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 329 for (sum = 0, inv = op->inv; inv; inv = inv->below)
336 { 330 {
337 if (inv->inv) 331 if (inv->inv)
338 sum_weight (inv); 332 sum_weight (inv);
333
339 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 334 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
340 } 335 }
341 336
342 if (op->type == CONTAINER && op->stats.Str) 337 if (op->type == CONTAINER && op->stats.Str)
343 sum = (sum * (100 - op->stats.Str)) / 100; 338 sum = (sum * (100 - op->stats.Str)) / 100;
379/* 374/*
380 * get_nearest_part(multi-object, object 2) returns the part of the 375 * get_nearest_part(multi-object, object 2) returns the part of the
381 * multi-object 1 which is closest to the second object. 376 * multi-object 1 which is closest to the second object.
382 * If it's not a multi-object, it is returned. 377 * If it's not a multi-object, it is returned.
383 */ 378 */
384
385object * 379object *
386get_nearest_part (object *op, const object *pl) 380get_nearest_part (object *op, const object *pl)
387{ 381{
388 object *tmp, *closest; 382 object *tmp, *closest;
389 int last_dist, i; 383 int last_dist, i;
434} 428}
435 429
436/* 430/*
437 * Sets the owner and sets the skill and exp pointers to owner's current 431 * Sets the owner and sets the skill and exp pointers to owner's current
438 * skill and experience objects. 432 * skill and experience objects.
433 * ACTUALLY NO! investigate! TODO
439 */ 434 */
440void 435void
441object::set_owner (object *owner) 436object::set_owner (object *owner)
442{ 437{
438 // allow objects which own objects
443 if (!owner) 439 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) 440 while (owner->owner)
454 owner = owner->owner; 441 owner = owner->owner;
455 442
456 this->owner = owner; 443 this->owner = owner;
444}
445
446int
447object::slottype () const
448{
449 if (type == SKILL)
450 {
451 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
452 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
453 }
454 else
455 {
456 if (slot [body_combat].info) return slot_combat;
457 if (slot [body_range ].info) return slot_ranged;
458 }
459
460 return slot_none;
461}
462
463bool
464object::change_weapon (object *ob)
465{
466 if (current_weapon == ob)
467 return true;
468
469 if (chosen_skill)
470 chosen_skill->flag [FLAG_APPLIED] = false;
471
472 current_weapon = ob;
473 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
474
475 if (chosen_skill)
476 chosen_skill->flag [FLAG_APPLIED] = true;
477
478 update_stats ();
479
480 if (ob)
481 {
482 // now check wether any body locations became invalid, in which case
483 // we cannot apply the weapon at the moment.
484 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
485 if (slot[i].used < 0)
486 {
487 current_weapon = chosen_skill = 0;
488 update_stats ();
489
490 new_draw_info_format (NDI_UNIQUE, 0, this,
491 "You try to balance all your items at once, "
492 "but the %s is just too much for your body. "
493 "[You need to unapply some items first.]", &ob->name);
494 return false;
495 }
496
497 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
498 }
499 else
500 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
501
502 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
503 {
504 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
505 &name, ob->debug_desc ());
506 return false;
507 }
508
509 return true;
457} 510}
458 511
459/* Zero the key_values on op, decrementing the shared-string 512/* Zero the key_values on op, decrementing the shared-string
460 * refcounts and freeing the links. 513 * refcounts and freeing the links.
461 */ 514 */
525object::copy_to (object *dst) 578object::copy_to (object *dst)
526{ 579{
527 *dst = *this; 580 *dst = *this;
528 581
529 if (speed < 0) 582 if (speed < 0)
530 dst->speed_left = speed_left - rndm (); 583 dst->speed_left -= rndm ();
531 584
532 dst->set_speed (dst->speed); 585 dst->set_speed (dst->speed);
533} 586}
534 587
535void 588void
543 * need for monsters, but doesn't hurt to do it for everything. 596 * 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 597 * by doing so, when a monster is created, it has good starting
545 * values for the body_used info, so when items are created 598 * values for the body_used info, so when items are created
546 * for it, they can be properly equipped. 599 * for it, they can be properly equipped.
547 */ 600 */
548 memcpy (body_used, body_info, sizeof (body_used)); 601 for (int i = NUM_BODY_LOCATIONS; i--; )
602 slot[i].used = slot[i].info;
549 603
550 attachable::instantiate (); 604 attachable::instantiate ();
551} 605}
552 606
553object * 607object *
861 915
862 if (!freed_map) 916 if (!freed_map)
863 { 917 {
864 freed_map = new maptile; 918 freed_map = new maptile;
865 919
920 freed_map->path = "<freed objects map>";
866 freed_map->name = "/internal/freed_objects_map"; 921 freed_map->name = "/internal/freed_objects_map";
867 freed_map->width = 3; 922 freed_map->width = 3;
868 freed_map->height = 3; 923 freed_map->height = 3;
869 924
870 freed_map->alloc (); 925 freed_map->alloc ();
874 map = freed_map; 929 map = freed_map;
875 x = 1; 930 x = 1;
876 y = 1; 931 y = 1;
877 } 932 }
878 933
879 head = 0;
880
881 if (more) 934 if (more)
882 { 935 {
883 more->destroy (); 936 more->destroy ();
884 more = 0; 937 more = 0;
885 } 938 }
886 939
940 head = 0;
941
887 // clear those pointers that likely might have circular references to us 942 // clear those pointers that likely might cause circular references
888 owner = 0; 943 owner = 0;
889 enemy = 0; 944 enemy = 0;
890 attacked_by = 0; 945 attacked_by = 0;
946 current_weapon = 0;
891} 947}
892 948
893void 949void
894object::destroy (bool destroy_inventory) 950object::destroy (bool destroy_inventory)
895{ 951{
896 if (destroyed ()) 952 if (destroyed ())
897 return; 953 return;
898 954
899 if (destroy_inventory) 955 if (destroy_inventory)
900 destroy_inv (false); 956 destroy_inv (false);
957
958 if (is_head ())
959 if (sound_destroy)
960 play_sound (sound_destroy);
961 else if (flag [FLAG_MONSTER])
962 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
901 963
902 attachable::destroy (); 964 attachable::destroy ();
903} 965}
904 966
905/* 967/*
1020 if (map->in_memory == MAP_SAVING) 1082 if (map->in_memory == MAP_SAVING)
1021 return; 1083 return;
1022 1084
1023 int check_walk_off = !flag [FLAG_NO_APPLY]; 1085 int check_walk_off = !flag [FLAG_NO_APPLY];
1024 1086
1087 if (object *pl = ms.player ())
1088 {
1089 if (pl->container == this)
1090 /* If a container that the player is currently using somehow gets
1091 * removed (most likely destroyed), update the player view
1092 * appropriately.
1093 */
1094 pl->close_container ();
1095
1096 pl->contr->ns->floorbox_update ();
1097 }
1098
1025 for (tmp = ms.bot; tmp; tmp = tmp->above) 1099 for (tmp = ms.bot; tmp; tmp = tmp->above)
1026 { 1100 {
1027 /* No point updating the players look faces if he is the object 1101 /* No point updating the players look faces if he is the object
1028 * being removed. 1102 * being removed.
1029 */ 1103 */
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 1104
1047 /* See if object moving off should effect something */ 1105 /* See if object moving off should effect something */
1048 if (check_walk_off 1106 if (check_walk_off
1049 && ((move_type & tmp->move_off) 1107 && ((move_type & tmp->move_off)
1050 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1108 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1053 1111
1054 if (destroyed ()) 1112 if (destroyed ())
1055 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1113 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1056 } 1114 }
1057 1115
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; 1116 last = tmp;
1064 } 1117 }
1065 1118
1066 /* last == NULL if there are no objects on this space */ 1119 /* last == NULL if there are no objects on this space */
1067 //TODO: this makes little sense, why only update the topmost object? 1120 //TODO: this makes little sense, why only update the topmost object?
1118 if (more) 1171 if (more)
1119 return; 1172 return;
1120 1173
1121 object *prev = this; 1174 object *prev = this;
1122 1175
1123 for (archetype *at = arch->more; at; at = at->more) 1176 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1124 { 1177 {
1125 object *op = arch_to_object (at); 1178 object *op = arch_to_object (at);
1126 1179
1127 op->name = name; 1180 op->name = name;
1128 op->name_pl = name_pl; 1181 op->name_pl = name_pl;
1142object * 1195object *
1143insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1196insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1144{ 1197{
1145 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1198 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1146 { 1199 {
1147 tmp->x = x + tmp->arch->clone.x; 1200 tmp->x = x + tmp->arch->x;
1148 tmp->y = y + tmp->arch->clone.y; 1201 tmp->y = y + tmp->arch->y;
1149 } 1202 }
1150 1203
1151 return insert_ob_in_map (op, m, originator, flag); 1204 return insert_ob_in_map (op, m, originator, flag);
1152} 1205}
1153 1206
1174object * 1227object *
1175insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1228insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1176{ 1229{
1177 assert (!op->flag [FLAG_FREED]); 1230 assert (!op->flag [FLAG_FREED]);
1178 1231
1179 object *tmp, *top, *floor = NULL; 1232 object *top, *floor = NULL;
1180 1233
1181 op->remove (); 1234 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 1235
1217 /* Ideally, the caller figures this out. However, it complicates a lot 1236 /* 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 1237 * of areas of callers (eg, anything that uses find_free_spot would now
1219 * need extra work 1238 * need extra work
1220 */ 1239 */
1221 if (!xy_normalise (m, op->x, op->y)) 1240 if (!xy_normalise (m, op->x, op->y))
1241 {
1242 op->destroy ();
1222 return 0; 1243 return 0;
1244 }
1245
1246 if (object *more = op->more)
1247 if (!insert_ob_in_map (more, m, originator, flag))
1248 return 0;
1249
1250 CLEAR_FLAG (op, FLAG_REMOVED);
1223 1251
1224 op->map = m; 1252 op->map = m;
1225 mapspace &ms = op->ms (); 1253 mapspace &ms = op->ms ();
1226 1254
1227 /* this has to be done after we translate the coordinates. 1255 /* this has to be done after we translate the coordinates.
1228 */ 1256 */
1229 if (op->nrof && !(flag & INS_NO_MERGE)) 1257 if (op->nrof && !(flag & INS_NO_MERGE))
1230 for (tmp = ms.bot; tmp; tmp = tmp->above) 1258 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1231 if (object::can_merge (op, tmp)) 1259 if (object::can_merge (op, tmp))
1232 { 1260 {
1233 op->nrof += tmp->nrof; 1261 op->nrof += tmp->nrof;
1234 tmp->destroy (); 1262 tmp->destroy ();
1235 } 1263 }
1324 */ 1352 */
1325 if (last && last->below && last != floor) 1353 if (last && last->below && last != floor)
1326 top = last->below; 1354 top = last->below;
1327 } 1355 }
1328 } /* If objects on this space */ 1356 } /* If objects on this space */
1329
1330 if (flag & INS_MAP_LOAD) 1357 if (flag & INS_MAP_LOAD)
1331 top = ms.top; 1358 top = ms.top;
1332 1359
1333 if (flag & INS_ABOVE_FLOOR_ONLY) 1360 if (flag & INS_ABOVE_FLOOR_ONLY)
1334 top = floor; 1361 top = floor;
1369 op->map->touch (); 1396 op->map->touch ();
1370 } 1397 }
1371 1398
1372 op->map->dirty = true; 1399 op->map->dirty = true;
1373 1400
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)) 1401 if (!(flag & INS_MAP_LOAD))
1378 if (object *pl = ms.player ()) 1402 if (object *pl = ms.player ())
1379 if (pl->contr->ns)
1380 pl->contr->ns->floorbox_update (); 1403 pl->contr->ns->floorbox_update ();
1381 1404
1382 /* If this object glows, it may affect lighting conditions that are 1405 /* If this object glows, it may affect lighting conditions that are
1383 * visible to others on this map. But update_all_los is really 1406 * 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 1407 * 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 1408 * on the map will get recalculated. The players could very well
1404 * blocked() and wall() work properly), and these flags are updated by 1427 * blocked() and wall() work properly), and these flags are updated by
1405 * update_object(). 1428 * update_object().
1406 */ 1429 */
1407 1430
1408 /* if this is not the head or flag has been passed, don't check walk on status */ 1431 /* 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) 1432 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1410 { 1433 {
1411 if (check_move_on (op, originator)) 1434 if (check_move_on (op, originator))
1412 return 0; 1435 return 0;
1413 1436
1414 /* If we are a multi part object, lets work our way through the check 1437 /* If we are a multi part object, lets work our way through the check
1415 * walk on's. 1438 * walk on's.
1416 */ 1439 */
1417 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1440 for (object *tmp = op->more; tmp; tmp = tmp->more)
1418 if (check_move_on (tmp, originator)) 1441 if (check_move_on (tmp, originator))
1419 return 0; 1442 return 0;
1420 } 1443 }
1421 1444
1422 return op; 1445 return op;
1432 object *tmp, *tmp1; 1455 object *tmp, *tmp1;
1433 1456
1434 /* first search for itself and remove any old instances */ 1457 /* first search for itself and remove any old instances */
1435 1458
1436 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1459 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1437 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1460 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1438 tmp->destroy (); 1461 tmp->destroy ();
1439 1462
1440 tmp1 = arch_to_object (archetype::find (arch_string)); 1463 tmp1 = arch_to_object (archetype::find (arch_string));
1441 1464
1442 tmp1->x = op->x; 1465 tmp1->x = op->x;
1603 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1626 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1604 free (dump); 1627 free (dump);
1605 return op; 1628 return op;
1606 } 1629 }
1607 1630
1608 if (where->head) 1631 if (where->head_ () != where)
1609 { 1632 {
1610 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1633 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1611 where = where->head; 1634 where = where->head;
1612 } 1635 }
1613 1636
1614 return where->insert (op); 1637 return where->insert (op);
1615} 1638}
1623 * be != op, if items are merged. -Tero 1646 * be != op, if items are merged. -Tero
1624 */ 1647 */
1625object * 1648object *
1626object::insert (object *op) 1649object::insert (object *op)
1627{ 1650{
1628 object *tmp, *otmp;
1629
1630 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1651 if (!QUERY_FLAG (op, FLAG_REMOVED))
1631 op->remove (); 1652 op->remove ();
1632 1653
1633 if (op->more) 1654 if (op->more)
1634 { 1655 {
1636 return op; 1657 return op;
1637 } 1658 }
1638 1659
1639 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1660 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1640 CLEAR_FLAG (op, FLAG_REMOVED); 1661 CLEAR_FLAG (op, FLAG_REMOVED);
1662
1641 if (op->nrof) 1663 if (op->nrof)
1642 { 1664 {
1643 for (tmp = inv; tmp != NULL; tmp = tmp->below) 1665 for (object *tmp = inv; tmp; tmp = tmp->below)
1644 if (object::can_merge (tmp, op)) 1666 if (object::can_merge (tmp, op))
1645 { 1667 {
1646 /* return the original object and remove inserted object 1668 /* return the original object and remove inserted object
1647 (client needs the original object) */ 1669 (client needs the original object) */
1648 tmp->nrof += op->nrof; 1670 tmp->nrof += op->nrof;
1667 add_weight (this, op->weight * op->nrof); 1689 add_weight (this, op->weight * op->nrof);
1668 } 1690 }
1669 else 1691 else
1670 add_weight (this, (op->weight + op->carrying)); 1692 add_weight (this, (op->weight + op->carrying));
1671 1693
1672 otmp = this->in_player (); 1694 if (object *otmp = this->in_player ())
1673 if (otmp && otmp->contr)
1674 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1695 if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1675 otmp->update_stats (); 1696 otmp->update_stats ();
1676 1697
1698 op->owner = 0; // its his/hers now. period.
1677 op->map = 0; 1699 op->map = 0;
1678 op->env = this; 1700 op->env = this;
1679 op->above = 0; 1701 op->above = 0;
1680 op->below = 0; 1702 op->below = 0;
1681 op->x = 0, op->y = 0; 1703 op->x = op->y = 0;
1682 1704
1683 /* reset the light list and los of the players on the map */ 1705 /* reset the light list and los of the players on the map */
1684 if ((op->glow_radius != 0) && map) 1706 if (op->glow_radius && map)
1685 { 1707 {
1686#ifdef DEBUG_LIGHTS 1708#ifdef DEBUG_LIGHTS
1687 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1709 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1688#endif /* DEBUG_LIGHTS */ 1710#endif /* DEBUG_LIGHTS */
1689 if (map->darkness) 1711 if (map->darkness)
1943 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1965 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1944 { 1966 {
1945 CLEAR_FLAG (tmp, flag); 1967 CLEAR_FLAG (tmp, flag);
1946 unflag_inv (tmp, flag); 1968 unflag_inv (tmp, flag);
1947 } 1969 }
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} 1970}
1962 1971
1963/* 1972/*
1964 * find_free_spot(object, map, x, y, start, stop) will search for 1973 * 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 1974 * a spot at the given map and coordinates which will be able to contain
2083 object *tmp; 2092 object *tmp;
2084 maptile *mp; 2093 maptile *mp;
2085 2094
2086 MoveType blocked, move_type; 2095 MoveType blocked, move_type;
2087 2096
2088 if (exclude && exclude->head) 2097 if (exclude && exclude->head_ () != exclude)
2089 { 2098 {
2090 exclude = exclude->head; 2099 exclude = exclude->head;
2091 move_type = exclude->move_type; 2100 move_type = exclude->move_type;
2092 } 2101 }
2093 else 2102 else
2116 max = maxfree[i]; 2125 max = maxfree[i];
2117 else if (mflags & P_IS_ALIVE) 2126 else if (mflags & P_IS_ALIVE)
2118 { 2127 {
2119 for (tmp = ms.bot; tmp; tmp = tmp->above) 2128 for (tmp = ms.bot; tmp; tmp = tmp->above)
2120 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2129 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2121 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2130 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2122 break; 2131 break;
2123 2132
2124 if (tmp) 2133 if (tmp)
2125 return freedir[i]; 2134 return freedir[i];
2126 } 2135 }
2306 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause 2315 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2307 * core dumps if they do. 2316 * core dumps if they do.
2308 * 2317 *
2309 * Add a check so we can't pick up invisible objects (0.93.8) 2318 * Add a check so we can't pick up invisible objects (0.93.8)
2310 */ 2319 */
2311
2312int 2320int
2313can_pick (const object *who, const object *item) 2321can_pick (const object *who, const object *item)
2314{ 2322{
2315 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2323 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2316 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2324 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2321 * create clone from object to another 2329 * create clone from object to another
2322 */ 2330 */
2323object * 2331object *
2324object_create_clone (object *asrc) 2332object_create_clone (object *asrc)
2325{ 2333{
2326 object *dst = 0, *tmp, *src, *part, *prev, *item; 2334 object *dst = 0, *tmp, *src, *prev, *item;
2327 2335
2328 if (!asrc) 2336 if (!asrc)
2329 return 0; 2337 return 0;
2330 2338
2331 src = asrc;
2332 if (src->head)
2333 src = src->head; 2339 src = asrc->head_ ();
2334 2340
2335 prev = 0; 2341 prev = 0;
2336 for (part = src; part; part = part->more) 2342 for (object *part = src; part; part = part->more)
2337 { 2343 {
2338 tmp = part->clone (); 2344 tmp = part->clone ();
2339 tmp->x -= src->x; 2345 tmp->x -= src->x;
2340 tmp->y -= src->y; 2346 tmp->y -= src->y;
2341 2347
2454 /* Basically, if the archetype has this key set, 2460 /* Basically, if the archetype has this key set,
2455 * we need to store the null value so when we save 2461 * we need to store the null value so when we save
2456 * it, we save the empty value so that when we load, 2462 * it, we save the empty value so that when we load,
2457 * we get this value back again. 2463 * we get this value back again.
2458 */ 2464 */
2459 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2465 if (get_ob_key_link (op->arch, canonical_key))
2460 field->value = 0; 2466 field->value = 0;
2461 else 2467 else
2462 { 2468 {
2463 if (last) 2469 if (last)
2464 last->next = field->next; 2470 last->next = field->next;
2533 } 2539 }
2534 else 2540 else
2535 item = item->env; 2541 item = item->env;
2536} 2542}
2537 2543
2538
2539const char * 2544const char *
2540object::flag_desc (char *desc, int len) const 2545object::flag_desc (char *desc, int len) const
2541{ 2546{
2542 char *p = desc; 2547 char *p = desc;
2543 bool first = true; 2548 bool first = true;
2577 &name, 2582 &name,
2578 title ? "\",title:\"" : "", 2583 title ? "\",title:\"" : "",
2579 title ? (const char *)title : "", 2584 title ? (const char *)title : "",
2580 flag_desc (flagdesc, 512), type); 2585 flag_desc (flagdesc, 512), type);
2581 2586
2582 if (env) 2587 if (!this->flag[FLAG_REMOVED] && env)
2583 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2588 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2584 2589
2585 if (map) 2590 if (map)
2586 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); 2591 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2587 2592
2589} 2594}
2590 2595
2591const char * 2596const char *
2592object::debug_desc () const 2597object::debug_desc () const
2593{ 2598{
2594 static char info[256 * 4]; 2599 static char info[3][256 * 4];
2600 static int info_idx;
2601
2595 return debug_desc (info); 2602 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} 2603}
2604 2604
2605struct region * 2605struct region *
2606object::region () const 2606object::region () const
2607{ 2607{
2610} 2610}
2611 2611
2612const materialtype_t * 2612const materialtype_t *
2613object::dominant_material () const 2613object::dominant_material () const
2614{ 2614{
2615 if (materialtype_t *mat = name_to_material (materialname)) 2615 if (materialtype_t *mt = name_to_material (materialname))
2616 return mat; 2616 return mt;
2617 2617
2618 // omfg this is slow, this has to be temporary :)
2619 shstr unknown ("unknown");
2620
2621 return name_to_material (unknown); 2618 return name_to_material (shstr_unknown);
2622} 2619}
2623 2620
2624void 2621void
2625object::open_container (object *new_container) 2622object::open_container (object *new_container)
2626{ 2623{
2642 old_container->flag [FLAG_APPLIED] = 0; 2639 old_container->flag [FLAG_APPLIED] = 0;
2643 container = 0; 2640 container = 0;
2644 2641
2645 esrv_update_item (UPD_FLAGS, this, old_container); 2642 esrv_update_item (UPD_FLAGS, this, old_container);
2646 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2643 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2644 play_sound (sound_find ("chest_close"));
2647 } 2645 }
2648 2646
2649 if (new_container) 2647 if (new_container)
2650 { 2648 {
2651 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) 2649 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2667 new_container->flag [FLAG_APPLIED] = 1; 2665 new_container->flag [FLAG_APPLIED] = 1;
2668 container = new_container; 2666 container = new_container;
2669 2667
2670 esrv_update_item (UPD_FLAGS, this, new_container); 2668 esrv_update_item (UPD_FLAGS, this, new_container);
2671 esrv_send_inventory (this, new_container); 2669 esrv_send_inventory (this, new_container);
2670 play_sound (sound_find ("chest_open"));
2671 }
2672}
2673
2674object *
2675object::force_find (const shstr name)
2676{
2677 /* cycle through his inventory to look for the MARK we want to
2678 * place
2679 */
2680 for (object *tmp = inv; tmp; tmp = tmp->below)
2681 if (tmp->type == FORCE && tmp->slaying == name)
2682 return splay (tmp);
2683
2684 return 0;
2685}
2686
2687void
2688object::force_add (const shstr name, int duration)
2689{
2690 if (object *force = force_find (name))
2691 force->destroy ();
2692
2693 object *force = get_archetype (FORCE_NAME);
2694
2695 force->slaying = name;
2696 force->stats.food = 1;
2697 force->speed_left = -1.f;
2698
2699 force->set_speed (duration ? 1.f / duration : 0.f);
2700 force->flag [FLAG_IS_USED_UP] = true;
2701 force->flag [FLAG_APPLIED] = true;
2702
2703 insert (force);
2704}
2705
2706void
2707object::play_sound (faceidx sound) const
2708{
2709 if (!sound)
2710 return;
2711
2712 if (flag [FLAG_REMOVED])
2713 return;
2714
2715 if (env)
2672 } 2716 {
2717 if (object *pl = in_player ())
2718 pl->contr->play_sound (sound);
2719 }
2720 else
2721 map->play_sound (sound, x, y);
2673} 2722}
2674 2723
2675

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines