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.137 by root, Mon Apr 16 06:23:40 2007 UTC vs.
Revision 1.174 by root, Wed Aug 8 04:52:59 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 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} 316}
324sum_weight (object *op) 324sum_weight (object *op)
325{ 325{
326 long sum; 326 long sum;
327 object *inv; 327 object *inv;
328 328
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 329 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 330 {
331 if (inv->inv) 331 if (inv->inv)
332 sum_weight (inv); 332 sum_weight (inv);
333
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 334 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 335 }
335 336
336 if (op->type == CONTAINER && op->stats.Str) 337 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 338 sum = (sum * (100 - op->stats.Str)) / 100;
446 */ 447 */
447 while (owner->owner) 448 while (owner->owner)
448 owner = owner->owner; 449 owner = owner->owner;
449 450
450 this->owner = owner; 451 this->owner = owner;
452}
453
454int
455object::slottype () const
456{
457 if (type == SKILL)
458 {
459 if (IS_COMBAT_SKILL (subtype)) return slot_combat;
460 if (IS_RANGED_SKILL (subtype)) return slot_ranged;
461 }
462 else
463 {
464 if (slot [body_combat].info) return slot_combat;
465 if (slot [body_range ].info) return slot_ranged;
466 }
467
468 return slot_none;
469}
470
471bool
472object::change_weapon (object *ob)
473{
474 if (current_weapon == ob)
475 return true;
476
477 if (chosen_skill)
478 chosen_skill->flag [FLAG_APPLIED] = false;
479
480 current_weapon = ob;
481 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
482
483 if (chosen_skill)
484 chosen_skill->flag [FLAG_APPLIED] = true;
485
486 update_stats ();
487
488 if (ob)
489 {
490 // now check wether any body locations became invalid, in which case
491 // we cannot apply the weapon at the moment.
492 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
493 if (slot[i].used < 0)
494 {
495 current_weapon = chosen_skill = 0;
496 update_stats ();
497
498 new_draw_info_format (NDI_UNIQUE, 0, this,
499 "You try to balance all your items at once, "
500 "but the %s is just too much for your body. "
501 "[You need to unapply some items first.]", &ob->name);
502 return false;
503 }
504
505 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
506 }
507 else
508 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
509
510 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
511 {
512 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
513 &name, ob->debug_desc ());
514 return false;
515 }
516
517 return true;
451} 518}
452 519
453/* Zero the key_values on op, decrementing the shared-string 520/* Zero the key_values on op, decrementing the shared-string
454 * refcounts and freeing the links. 521 * refcounts and freeing the links.
455 */ 522 */
537 * need for monsters, but doesn't hurt to do it for everything. 604 * need for monsters, but doesn't hurt to do it for everything.
538 * by doing so, when a monster is created, it has good starting 605 * by doing so, when a monster is created, it has good starting
539 * values for the body_used info, so when items are created 606 * values for the body_used info, so when items are created
540 * for it, they can be properly equipped. 607 * for it, they can be properly equipped.
541 */ 608 */
542 memcpy (body_used, body_info, sizeof (body_used)); 609 for (int i = NUM_BODY_LOCATIONS; i--; )
610 slot[i].used = slot[i].info;
543 611
544 attachable::instantiate (); 612 attachable::instantiate ();
545} 613}
546 614
547object * 615object *
835 903
836 if (flag [FLAG_IS_LINKED]) 904 if (flag [FLAG_IS_LINKED])
837 remove_button_link (this); 905 remove_button_link (this);
838 906
839 if (flag [FLAG_FRIENDLY]) 907 if (flag [FLAG_FRIENDLY])
840 {
841 remove_friendly_object (this); 908 remove_friendly_object (this);
842
843 if (type == GOLEM
844 && owner
845 && owner->type == PLAYER
846 && owner->contr->ranges[range_golem] == this)
847 owner->contr->ranges[range_golem] = 0;
848 }
849 909
850 if (!flag [FLAG_REMOVED]) 910 if (!flag [FLAG_REMOVED])
851 remove (); 911 remove ();
852 912
853 destroy_inv (true); 913 destroy_inv (true);
876 map = freed_map; 936 map = freed_map;
877 x = 1; 937 x = 1;
878 y = 1; 938 y = 1;
879 } 939 }
880 940
881 head = 0;
882
883 if (more) 941 if (more)
884 { 942 {
885 more->destroy (); 943 more->destroy ();
886 more = 0; 944 more = 0;
887 } 945 }
888 946
947 head = 0;
948
889 // clear those pointers that likely might have circular references to us 949 // clear those pointers that likely might cause circular references
890 owner = 0; 950 owner = 0;
891 enemy = 0; 951 enemy = 0;
892 attacked_by = 0; 952 attacked_by = 0;
953 current_weapon = 0;
893} 954}
894 955
895void 956void
896object::destroy (bool destroy_inventory) 957object::destroy (bool destroy_inventory)
897{ 958{
898 if (destroyed ()) 959 if (destroyed ())
899 return; 960 return;
900 961
901 if (destroy_inventory) 962 if (destroy_inventory)
902 destroy_inv (false); 963 destroy_inv (false);
964
965 if (is_head ())
966 if (sound_destroy)
967 play_sound (sound_destroy);
968 else if (flag [FLAG_MONSTER])
969 play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism
903 970
904 attachable::destroy (); 971 attachable::destroy ();
905} 972}
906 973
907/* 974/*
1028 { 1095 {
1029 /* No point updating the players look faces if he is the object 1096 /* No point updating the players look faces if he is the object
1030 * being removed. 1097 * being removed.
1031 */ 1098 */
1032 1099
1033 if (tmp->type == PLAYER && tmp != this) 1100 if (tmp->type == PLAYER && tmp->container == this)
1034 {
1035 /* If a container that the player is currently using somehow gets 1101 /* If a container that the player is currently using somehow gets
1036 * removed (most likely destroyed), update the player view 1102 * removed (most likely destroyed), update the player view
1037 * appropriately. 1103 * appropriately.
1038 */ 1104 */
1039 if (tmp->container == this)
1040 {
1041 flag [FLAG_APPLIED] = 0;
1042 tmp->container = 0; 1105 tmp->close_container ();
1043 }
1044
1045 if (tmp->contr->ns)
1046 tmp->contr->ns->floorbox_update ();
1047 }
1048 1106
1049 /* See if object moving off should effect something */ 1107 /* See if object moving off should effect something */
1050 if (check_walk_off 1108 if (check_walk_off
1051 && ((move_type & tmp->move_off) 1109 && ((move_type & tmp->move_off)
1052 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1110 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1055 1113
1056 if (destroyed ()) 1114 if (destroyed ())
1057 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1115 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1058 } 1116 }
1059 1117
1060 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1061 //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp)
1062 if (tmp->above == tmp)
1063 tmp->above = 0;
1064
1065 last = tmp; 1118 last = tmp;
1066 } 1119 }
1067 1120
1068 /* last == NULL if there are no objects on this space */ 1121 /* last == NULL if there are no objects on this space */
1069 //TODO: this makes little sense, why only update the topmost object? 1122 //TODO: this makes little sense, why only update the topmost object?
1112 } 1165 }
1113 1166
1114 return 0; 1167 return 0;
1115} 1168}
1116 1169
1170void
1171object::expand_tail ()
1172{
1173 if (more)
1174 return;
1175
1176 object *prev = this;
1177
1178 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1179 {
1180 object *op = arch_to_object (at);
1181
1182 op->name = name;
1183 op->name_pl = name_pl;
1184 op->title = title;
1185
1186 op->head = this;
1187 prev->more = op;
1188
1189 prev = op;
1190 }
1191}
1192
1117/* 1193/*
1118 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1194 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1119 * job preparing multi-part monsters. 1195 * job preparing multi-part monsters.
1120 */ 1196 */
1121object * 1197object *
1122insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1198insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1123{ 1199{
1124 for (object *tmp = op->head_ (); tmp; tmp = tmp->more) 1200 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1125 { 1201 {
1126 tmp->x = x + tmp->arch->clone.x; 1202 tmp->x = x + tmp->arch->x;
1127 tmp->y = y + tmp->arch->clone.y; 1203 tmp->y = y + tmp->arch->y;
1128 } 1204 }
1129 1205
1130 return insert_ob_in_map (op, m, originator, flag); 1206 return insert_ob_in_map (op, m, originator, flag);
1131} 1207}
1132 1208
1151 * just 'op' otherwise 1227 * just 'op' otherwise
1152 */ 1228 */
1153object * 1229object *
1154insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1230insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1155{ 1231{
1232 assert (!op->flag [FLAG_FREED]);
1233
1156 object *tmp, *top, *floor = NULL; 1234 object *top, *floor = NULL;
1157
1158 if (QUERY_FLAG (op, FLAG_FREED))
1159 {
1160 LOG (llevError, "Trying to insert freed object!\n");
1161 return NULL;
1162 }
1163
1164 if (!QUERY_FLAG (op, FLAG_REMOVED))
1165 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1166 1235
1167 op->remove (); 1236 op->remove ();
1168 1237
1169 if (!m) 1238#if 0
1170 { 1239 if (!m->active != !op->active)
1171 char *dump = dump_object (op); 1240 if (m->active)
1172 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1241 op->activate_recursive ();
1173 free (dump); 1242 else
1174 return op; 1243 op->deactivate_recursive ();
1175 } 1244#endif
1176 1245
1177 if (out_of_map (m, op->x, op->y)) 1246 if (out_of_map (m, op->x, op->y))
1178 { 1247 {
1179 char *dump = dump_object (op);
1180 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1248 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1181#ifdef MANY_CORES 1249#ifdef MANY_CORES
1182 /* Better to catch this here, as otherwise the next use of this object 1250 /* Better to catch this here, as otherwise the next use of this object
1183 * is likely to cause a crash. Better to find out where it is getting 1251 * is likely to cause a crash. Better to find out where it is getting
1184 * improperly inserted. 1252 * improperly inserted.
1185 */ 1253 */
1186 abort (); 1254 abort ();
1187#endif 1255#endif
1188 free (dump);
1189 return op; 1256 return op;
1190 } 1257 }
1191 1258
1192 if (object *more = op->more) 1259 if (object *more = op->more)
1193 {
1194 if (!insert_ob_in_map (more, m, originator, flag)) 1260 if (!insert_ob_in_map (more, m, originator, flag))
1195 {
1196 if (!op->head)
1197 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1198
1199 return 0; 1261 return 0;
1200 }
1201 }
1202 1262
1203 CLEAR_FLAG (op, FLAG_REMOVED); 1263 CLEAR_FLAG (op, FLAG_REMOVED);
1204 1264
1205 /* Ideally, the caller figures this out. However, it complicates a lot 1265 /* Ideally, the caller figures this out. However, it complicates a lot
1206 * of areas of callers (eg, anything that uses find_free_spot would now 1266 * of areas of callers (eg, anything that uses find_free_spot would now
1213 mapspace &ms = op->ms (); 1273 mapspace &ms = op->ms ();
1214 1274
1215 /* this has to be done after we translate the coordinates. 1275 /* this has to be done after we translate the coordinates.
1216 */ 1276 */
1217 if (op->nrof && !(flag & INS_NO_MERGE)) 1277 if (op->nrof && !(flag & INS_NO_MERGE))
1218 for (tmp = ms.bot; tmp; tmp = tmp->above) 1278 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1219 if (object::can_merge (op, tmp)) 1279 if (object::can_merge (op, tmp))
1220 { 1280 {
1221 op->nrof += tmp->nrof; 1281 op->nrof += tmp->nrof;
1222 tmp->destroy (); 1282 tmp->destroy ();
1223 } 1283 }
1312 */ 1372 */
1313 if (last && last->below && last != floor) 1373 if (last && last->below && last != floor)
1314 top = last->below; 1374 top = last->below;
1315 } 1375 }
1316 } /* If objects on this space */ 1376 } /* If objects on this space */
1317
1318 if (flag & INS_MAP_LOAD) 1377 if (flag & INS_MAP_LOAD)
1319 top = ms.top; 1378 top = ms.top;
1320 1379
1321 if (flag & INS_ABOVE_FLOOR_ONLY) 1380 if (flag & INS_ABOVE_FLOOR_ONLY)
1322 top = floor; 1381 top = floor;
1392 * blocked() and wall() work properly), and these flags are updated by 1451 * blocked() and wall() work properly), and these flags are updated by
1393 * update_object(). 1452 * update_object().
1394 */ 1453 */
1395 1454
1396 /* if this is not the head or flag has been passed, don't check walk on status */ 1455 /* if this is not the head or flag has been passed, don't check walk on status */
1397 if (!(flag & INS_NO_WALK_ON) && !op->head) 1456 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1398 { 1457 {
1399 if (check_move_on (op, originator)) 1458 if (check_move_on (op, originator))
1400 return 0; 1459 return 0;
1401 1460
1402 /* If we are a multi part object, lets work our way through the check 1461 /* If we are a multi part object, lets work our way through the check
1403 * walk on's. 1462 * walk on's.
1404 */ 1463 */
1405 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1464 for (object *tmp = op->more; tmp; tmp = tmp->more)
1406 if (check_move_on (tmp, originator)) 1465 if (check_move_on (tmp, originator))
1407 return 0; 1466 return 0;
1408 } 1467 }
1409 1468
1410 return op; 1469 return op;
1420 object *tmp, *tmp1; 1479 object *tmp, *tmp1;
1421 1480
1422 /* first search for itself and remove any old instances */ 1481 /* first search for itself and remove any old instances */
1423 1482
1424 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1483 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1425 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1484 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1426 tmp->destroy (); 1485 tmp->destroy ();
1427 1486
1428 tmp1 = arch_to_object (archetype::find (arch_string)); 1487 tmp1 = arch_to_object (archetype::find (arch_string));
1429 1488
1430 tmp1->x = op->x; 1489 tmp1->x = op->x;
1431 tmp1->y = op->y; 1490 tmp1->y = op->y;
1432 insert_ob_in_map (tmp1, op->map, op, 0); 1491 insert_ob_in_map (tmp1, op->map, op, 0);
1433} 1492}
1434 1493
1435// XXX: function not returning object*
1436object * 1494object *
1437object::insert_at (object *where, object *originator, int flags) 1495object::insert_at (object *where, object *originator, int flags)
1438{ 1496{
1439 where->map->insert (this, where->x, where->y, originator, flags); 1497 return where->map->insert (this, where->x, where->y, originator, flags);
1440} 1498}
1441 1499
1442/* 1500/*
1443 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1501 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1444 * is returned contains nr objects, and the remaining parts contains 1502 * is returned contains nr objects, and the remaining parts contains
1484 * the amount of an object. If the amount reaches 0, the object 1542 * the amount of an object. If the amount reaches 0, the object
1485 * is subsequently removed and freed. 1543 * is subsequently removed and freed.
1486 * 1544 *
1487 * Return value: 'op' if something is left, NULL if the amount reached 0 1545 * Return value: 'op' if something is left, NULL if the amount reached 0
1488 */ 1546 */
1489
1490object * 1547object *
1491decrease_ob_nr (object *op, uint32 i) 1548decrease_ob_nr (object *op, uint32 i)
1492{ 1549{
1493 object *tmp; 1550 object *tmp;
1494 1551
1569 1626
1570/* 1627/*
1571 * add_weight(object, weight) adds the specified weight to an object, 1628 * add_weight(object, weight) adds the specified weight to an object,
1572 * and also updates how much the environment(s) is/are carrying. 1629 * and also updates how much the environment(s) is/are carrying.
1573 */ 1630 */
1574
1575void 1631void
1576add_weight (object *op, signed long weight) 1632add_weight (object *op, signed long weight)
1577{ 1633{
1578 while (op != NULL) 1634 while (op != NULL)
1579 { 1635 {
1594 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1650 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1595 free (dump); 1651 free (dump);
1596 return op; 1652 return op;
1597 } 1653 }
1598 1654
1599 if (where->head) 1655 if (where->head_ () != where)
1600 { 1656 {
1601 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1657 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1602 where = where->head; 1658 where = where->head;
1603 } 1659 }
1604 1660
1605 return where->insert (op); 1661 return where->insert (op);
1606} 1662}
1611 * inside the object environment. 1667 * inside the object environment.
1612 * 1668 *
1613 * The function returns now pointer to inserted item, and return value can 1669 * The function returns now pointer to inserted item, and return value can
1614 * be != op, if items are merged. -Tero 1670 * be != op, if items are merged. -Tero
1615 */ 1671 */
1616
1617object * 1672object *
1618object::insert (object *op) 1673object::insert (object *op)
1619{ 1674{
1620 object *tmp, *otmp; 1675 object *tmp, *otmp;
1621 1676
1935 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1990 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1936 { 1991 {
1937 CLEAR_FLAG (tmp, flag); 1992 CLEAR_FLAG (tmp, flag);
1938 unflag_inv (tmp, flag); 1993 unflag_inv (tmp, flag);
1939 } 1994 }
1940}
1941
1942/*
1943 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1944 * all it's inventory (recursively).
1945 * If checksums are used, a player will get set_cheat called for
1946 * him/her-self and all object carried by a call to this function.
1947 */
1948void
1949set_cheat (object *op)
1950{
1951 SET_FLAG (op, FLAG_WAS_WIZ);
1952 flag_inv (op, FLAG_WAS_WIZ);
1953} 1995}
1954 1996
1955/* 1997/*
1956 * find_free_spot(object, map, x, y, start, stop) will search for 1998 * find_free_spot(object, map, x, y, start, stop) will search for
1957 * a spot at the given map and coordinates which will be able to contain 1999 * a spot at the given map and coordinates which will be able to contain
2075 object *tmp; 2117 object *tmp;
2076 maptile *mp; 2118 maptile *mp;
2077 2119
2078 MoveType blocked, move_type; 2120 MoveType blocked, move_type;
2079 2121
2080 if (exclude && exclude->head) 2122 if (exclude && exclude->head_ () != exclude)
2081 { 2123 {
2082 exclude = exclude->head; 2124 exclude = exclude->head;
2083 move_type = exclude->move_type; 2125 move_type = exclude->move_type;
2084 } 2126 }
2085 else 2127 else
2108 max = maxfree[i]; 2150 max = maxfree[i];
2109 else if (mflags & P_IS_ALIVE) 2151 else if (mflags & P_IS_ALIVE)
2110 { 2152 {
2111 for (tmp = ms.bot; tmp; tmp = tmp->above) 2153 for (tmp = ms.bot; tmp; tmp = tmp->above)
2112 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2154 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2113 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2155 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2114 break; 2156 break;
2115 2157
2116 if (tmp) 2158 if (tmp)
2117 return freedir[i]; 2159 return freedir[i];
2118 } 2160 }
2313 * create clone from object to another 2355 * create clone from object to another
2314 */ 2356 */
2315object * 2357object *
2316object_create_clone (object *asrc) 2358object_create_clone (object *asrc)
2317{ 2359{
2318 object *dst = 0, *tmp, *src, *part, *prev, *item; 2360 object *dst = 0, *tmp, *src, *prev, *item;
2319 2361
2320 if (!asrc) 2362 if (!asrc)
2321 return 0; 2363 return 0;
2322 2364
2323 src = asrc;
2324 if (src->head)
2325 src = src->head; 2365 src = asrc->head_ ();
2326 2366
2327 prev = 0; 2367 prev = 0;
2328 for (part = src; part; part = part->more) 2368 for (object *part = src; part; part = part->more)
2329 { 2369 {
2330 tmp = part->clone (); 2370 tmp = part->clone ();
2331 tmp->x -= src->x; 2371 tmp->x -= src->x;
2332 tmp->y -= src->y; 2372 tmp->y -= src->y;
2333 2373
2446 /* Basically, if the archetype has this key set, 2486 /* Basically, if the archetype has this key set,
2447 * we need to store the null value so when we save 2487 * we need to store the null value so when we save
2448 * it, we save the empty value so that when we load, 2488 * it, we save the empty value so that when we load,
2449 * we get this value back again. 2489 * we get this value back again.
2450 */ 2490 */
2451 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2491 if (get_ob_key_link (op->arch, canonical_key))
2452 field->value = 0; 2492 field->value = 0;
2453 else 2493 else
2454 { 2494 {
2455 if (last) 2495 if (last)
2456 last->next = field->next; 2496 last->next = field->next;
2525 } 2565 }
2526 else 2566 else
2527 item = item->env; 2567 item = item->env;
2528} 2568}
2529 2569
2530
2531const char * 2570const char *
2532object::flag_desc (char *desc, int len) const 2571object::flag_desc (char *desc, int len) const
2533{ 2572{
2534 char *p = desc; 2573 char *p = desc;
2535 bool first = true; 2574 bool first = true;
2581} 2620}
2582 2621
2583const char * 2622const char *
2584object::debug_desc () const 2623object::debug_desc () const
2585{ 2624{
2586 static char info[256 * 4]; 2625 static char info[3][256 * 4];
2626 static int info_idx;
2627
2587 return debug_desc (info); 2628 return debug_desc (info [++info_idx % 3]);
2588}
2589
2590const char *
2591object::debug_desc2 () const
2592{
2593 static char info[256 * 4];
2594 return debug_desc (info);
2595} 2629}
2596 2630
2597struct region * 2631struct region *
2598object::region () const 2632object::region () const
2599{ 2633{
2602} 2636}
2603 2637
2604const materialtype_t * 2638const materialtype_t *
2605object::dominant_material () const 2639object::dominant_material () const
2606{ 2640{
2607 if (materialtype_t *mat = name_to_material (materialname)) 2641 if (materialtype_t *mt = name_to_material (materialname))
2608 return mat; 2642 return mt;
2609 2643
2610 // omfg this is slow, this has to be temporary :)
2611 shstr unknown ("unknown");
2612
2613 return name_to_material (unknown); 2644 return name_to_material (shstr_unknown);
2614} 2645}
2615 2646
2616void 2647void
2617object::open_container (object *new_container) 2648object::open_container (object *new_container)
2618{ 2649{
2662 esrv_update_item (UPD_FLAGS, this, new_container); 2693 esrv_update_item (UPD_FLAGS, this, new_container);
2663 esrv_send_inventory (this, new_container); 2694 esrv_send_inventory (this, new_container);
2664 } 2695 }
2665} 2696}
2666 2697
2698object *
2699object::force_find (const shstr name)
2700{
2701 /* cycle through his inventory to look for the MARK we want to
2702 * place
2703 */
2704 for (object *tmp = inv; tmp; tmp = tmp->below)
2705 if (tmp->type == FORCE && tmp->slaying == name)
2706 return splay (tmp);
2667 2707
2708 return 0;
2709}
2710
2711void
2712object::force_add (const shstr name, int duration)
2713{
2714 if (object *force = force_find (name))
2715 force->destroy ();
2716
2717 object *force = get_archetype (FORCE_NAME);
2718
2719 force->slaying = name;
2720 force->stats.food = 1;
2721 force->speed_left = -1.f;
2722
2723 force->set_speed (duration ? 1.f / duration : 0.f);
2724 force->flag [FLAG_IS_USED_UP] = true;
2725 force->flag [FLAG_APPLIED] = true;
2726
2727 insert (force);
2728}
2729

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines