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.120 by root, Sun Jan 21 21:28:27 2007 UTC vs.
Revision 1.158 by root, Mon Jun 4 12:19:08 2007 UTC

1/* 1/*
2 * CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
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 it
9 * it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
10 * the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
11 * (at your option) any later version. 11 * 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, but
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 * GNU General Public License for more details. 16 * 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 along
19 * along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <crossfire@schmorp.de>
23 */ 23 */
24 24
25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
26 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
27 variable. */ 27 variable. */
29#include <stdio.h> 29#include <stdio.h>
30#include <sys/types.h> 30#include <sys/types.h>
31#include <sys/uio.h> 31#include <sys/uio.h>
32#include <object.h> 32#include <object.h>
33#include <funcpoint.h> 33#include <funcpoint.h>
34#include <sproto.h>
34#include <loader.h> 35#include <loader.h>
35 36
36#include <bitset> 37#include <bitset>
37 38
38int nrofallocobjects = 0; 39int nrofallocobjects = 0;
324sum_weight (object *op) 325sum_weight (object *op)
325{ 326{
326 long sum; 327 long sum;
327 object *inv; 328 object *inv;
328 329
329 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) 330 for (sum = 0, inv = op->inv; inv; inv = inv->below)
330 { 331 {
331 if (inv->inv) 332 if (inv->inv)
332 sum_weight (inv); 333 sum_weight (inv);
334
333 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 335 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
334 } 336 }
335 337
336 if (op->type == CONTAINER && op->stats.Str) 338 if (op->type == CONTAINER && op->stats.Str)
337 sum = (sum * (100 - op->stats.Str)) / 100; 339 sum = (sum * (100 - op->stats.Str)) / 100;
357/* 359/*
358 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 360 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
359 * Some error messages. 361 * Some error messages.
360 * The result of the dump is stored in the static global errmsg array. 362 * The result of the dump is stored in the static global errmsg array.
361 */ 363 */
362
363char * 364char *
364dump_object (object *op) 365dump_object (object *op)
365{ 366{
366 if (!op) 367 if (!op)
367 return strdup ("[NULLOBJ]"); 368 return strdup ("[NULLOBJ]");
368 369
369 object_freezer freezer; 370 object_freezer freezer;
370 save_object (freezer, op, 1); 371 op->write (freezer);
371 return freezer.as_string (); 372 return freezer.as_string ();
372} 373}
373 374
374/* 375/*
375 * get_nearest_part(multi-object, object 2) returns the part of the 376 * get_nearest_part(multi-object, object 2) returns the part of the
449 owner = owner->owner; 450 owner = owner->owner;
450 451
451 this->owner = owner; 452 this->owner = owner;
452} 453}
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;
519}
520
454/* Zero the key_values on op, decrementing the shared-string 521/* Zero the key_values on op, decrementing the shared-string
455 * refcounts and freeing the links. 522 * refcounts and freeing the links.
456 */ 523 */
457static void 524static void
458free_key_values (object *op) 525free_key_values (object *op)
459{ 526{
460 for (key_value *i = op->key_values; i != 0;) 527 for (key_value *i = op->key_values; i; )
461 { 528 {
462 key_value *next = i->next; 529 key_value *next = i->next;
463 delete i; 530 delete i;
464 531
465 i = next; 532 i = next;
466 } 533 }
467 534
468 op->key_values = 0; 535 op->key_values = 0;
469} 536}
470 537
471/* 538object &
472 * copy_to first frees everything allocated by the dst object, 539object::operator =(const object &src)
473 * and then copies the contents of itself into the second
474 * object, allocating what needs to be allocated. Basically, any
475 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
476 * if the first object is freed, the pointers in the new object
477 * will point at garbage.
478 */
479void
480object::copy_to (object *dst)
481{ 540{
482 bool is_freed = QUERY_FLAG (dst, FLAG_FREED); 541 bool is_freed = flag [FLAG_FREED];
483 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); 542 bool is_removed = flag [FLAG_REMOVED];
484 543
485 *(object_copy *)dst = *this; 544 *(object_copy *)this = src;
486 545
487 if (is_freed) 546 flag [FLAG_FREED] = is_freed;
488 SET_FLAG (dst, FLAG_FREED); 547 flag [FLAG_REMOVED] = is_removed;
489
490 if (is_removed)
491 SET_FLAG (dst, FLAG_REMOVED);
492
493 if (speed < 0)
494 dst->speed_left = speed_left - rndm ();
495 548
496 /* Copy over key_values, if any. */ 549 /* Copy over key_values, if any. */
497 if (key_values) 550 if (src.key_values)
498 { 551 {
499 key_value *tail = 0; 552 key_value *tail = 0;
500 key_value *i;
501
502 dst->key_values = 0; 553 key_values = 0;
503 554
504 for (i = key_values; i; i = i->next) 555 for (key_value *i = src.key_values; i; i = i->next)
505 { 556 {
506 key_value *new_link = new key_value; 557 key_value *new_link = new key_value;
507 558
508 new_link->next = 0; 559 new_link->next = 0;
509 new_link->key = i->key; 560 new_link->key = i->key;
510 new_link->value = i->value; 561 new_link->value = i->value;
511 562
512 /* Try and be clever here, too. */ 563 /* Try and be clever here, too. */
513 if (!dst->key_values) 564 if (!key_values)
514 { 565 {
515 dst->key_values = new_link; 566 key_values = new_link;
516 tail = new_link; 567 tail = new_link;
517 } 568 }
518 else 569 else
519 { 570 {
520 tail->next = new_link; 571 tail->next = new_link;
521 tail = new_link; 572 tail = new_link;
522 } 573 }
523 } 574 }
524 } 575 }
576}
577
578/*
579 * copy_to first frees everything allocated by the dst object,
580 * and then copies the contents of itself into the second
581 * object, allocating what needs to be allocated. Basically, any
582 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
583 * if the first object is freed, the pointers in the new object
584 * will point at garbage.
585 */
586void
587object::copy_to (object *dst)
588{
589 *dst = *this;
590
591 if (speed < 0)
592 dst->speed_left = speed_left - rndm ();
525 593
526 dst->set_speed (dst->speed); 594 dst->set_speed (dst->speed);
595}
596
597void
598object::instantiate ()
599{
600 if (!uuid.seq) // HACK
601 uuid = gen_uuid ();
602
603 speed_left = -0.1f;
604 /* copy the body_info to the body_used - this is only really
605 * need for monsters, but doesn't hurt to do it for everything.
606 * by doing so, when a monster is created, it has good starting
607 * values for the body_used info, so when items are created
608 * for it, they can be properly equipped.
609 */
610 for (int i = NUM_BODY_LOCATIONS; i--; )
611 slot[i].used = slot[i].info;
612
613 attachable::instantiate ();
527} 614}
528 615
529object * 616object *
530object::clone () 617object::clone ()
531{ 618{
589 * UP_OBJ_FACE: only the objects face has changed. 676 * UP_OBJ_FACE: only the objects face has changed.
590 */ 677 */
591void 678void
592update_object (object *op, int action) 679update_object (object *op, int action)
593{ 680{
594 MoveType move_on, move_off, move_block, move_slow;
595
596 if (op == NULL) 681 if (op == NULL)
597 { 682 {
598 /* this should never happen */ 683 /* this should never happen */
599 LOG (llevDebug, "update_object() called for NULL object.\n"); 684 LOG (llevDebug, "update_object() called for NULL object.\n");
600 return; 685 return;
670 face = blank_face; 755 face = blank_face;
671} 756}
672 757
673object::~object () 758object::~object ()
674{ 759{
675 if (index)
676 unlink (); 760 unlink ();
677 761
678 free_key_values (this); 762 free_key_values (this);
679} 763}
680 764
681static int object_count; 765static int object_count;
690 objects.insert (this); 774 objects.insert (this);
691} 775}
692 776
693void object::unlink () 777void object::unlink ()
694{ 778{
695 assert (index);//D 779 if (!index)
780 return;
781
696 objects.erase (this); 782 objects.erase (this);
697 refcnt_dec (); 783 refcnt_dec ();
698} 784}
699 785
700void 786void
774 * drop on that space. 860 * drop on that space.
775 */ 861 */
776 if (!drop_to_ground 862 if (!drop_to_ground
777 || !map 863 || !map
778 || map->in_memory != MAP_IN_MEMORY 864 || map->in_memory != MAP_IN_MEMORY
865 || map->nodrop
779 || ms ().move_block == MOVE_ALL) 866 || ms ().move_block == MOVE_ALL)
780 { 867 {
781 while (inv) 868 while (inv)
782 { 869 {
783 inv->destroy_inv (drop_to_ground); 870 inv->destroy_inv (drop_to_ground);
899 * This function removes the object op from the linked list of objects 986 * This function removes the object op from the linked list of objects
900 * which it is currently tied to. When this function is done, the 987 * which it is currently tied to. When this function is done, the
901 * object will have no environment. If the object previously had an 988 * object will have no environment. If the object previously had an
902 * environment, the x and y coordinates will be updated to 989 * environment, the x and y coordinates will be updated to
903 * the previous environment. 990 * the previous environment.
904 * Beware: This function is called from the editor as well!
905 */ 991 */
906void 992void
907object::remove_slow () 993object::do_remove ()
908{ 994{
909 object *tmp, *last = 0; 995 object *tmp, *last = 0;
910 object *otmp; 996 object *otmp;
911 997
912 if (QUERY_FLAG (this, FLAG_REMOVED)) 998 if (QUERY_FLAG (this, FLAG_REMOVED))
955 } 1041 }
956 else if (map) 1042 else if (map)
957 { 1043 {
958 if (type == PLAYER) 1044 if (type == PLAYER)
959 { 1045 {
1046 // leaving a spot always closes any open container on the ground
1047 if (container && !container->env)
1048 // this causes spurious floorbox updates, but it ensures
1049 // that the CLOSE event is being sent.
1050 close_container ();
1051
960 --map->players; 1052 --map->players;
961 map->touch (); 1053 map->touch ();
962 } 1054 }
963 1055
964 map->dirty = true; 1056 map->dirty = true;
1079 return top; 1171 return top;
1080 } 1172 }
1081 } 1173 }
1082 1174
1083 return 0; 1175 return 0;
1176}
1177
1178void
1179object::expand_tail ()
1180{
1181 if (more)
1182 return;
1183
1184 object *prev = this;
1185
1186 for (archetype *at = arch->more; at; at = at->more)
1187 {
1188 object *op = arch_to_object (at);
1189
1190 op->name = name;
1191 op->name_pl = name_pl;
1192 op->title = title;
1193
1194 op->head = this;
1195 prev->more = op;
1196
1197 prev = op;
1198 }
1084} 1199}
1085 1200
1086/* 1201/*
1087 * same as insert_ob_in_map except it handles separate coordinates and does a clean 1202 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1088 * job preparing multi-part monsters. 1203 * job preparing multi-part monsters.
1120 * just 'op' otherwise 1235 * just 'op' otherwise
1121 */ 1236 */
1122object * 1237object *
1123insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1238insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1124{ 1239{
1240 assert (!op->flag [FLAG_FREED]);
1241
1125 object *tmp, *top, *floor = NULL; 1242 object *top, *floor = NULL;
1126
1127 if (QUERY_FLAG (op, FLAG_FREED))
1128 {
1129 LOG (llevError, "Trying to insert freed object!\n");
1130 return NULL;
1131 }
1132
1133 if (!QUERY_FLAG (op, FLAG_REMOVED))
1134 LOG (llevError, "Trying to insert already inserted object %s\n", op->debug_desc ());
1135 1243
1136 op->remove (); 1244 op->remove ();
1137 1245
1138 if (!m) 1246#if 0
1139 { 1247 if (!m->active != !op->active)
1140 char *dump = dump_object (op); 1248 if (m->active)
1141 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); 1249 op->activate_recursive ();
1142 free (dump); 1250 else
1143 return op; 1251 op->deactivate_recursive ();
1144 } 1252#endif
1145 1253
1146 if (out_of_map (m, op->x, op->y)) 1254 if (out_of_map (m, op->x, op->y))
1147 { 1255 {
1148 char *dump = dump_object (op);
1149 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1256 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1150#ifdef MANY_CORES 1257#ifdef MANY_CORES
1151 /* Better to catch this here, as otherwise the next use of this object 1258 /* Better to catch this here, as otherwise the next use of this object
1152 * is likely to cause a crash. Better to find out where it is getting 1259 * is likely to cause a crash. Better to find out where it is getting
1153 * improperly inserted. 1260 * improperly inserted.
1154 */ 1261 */
1155 abort (); 1262 abort ();
1156#endif 1263#endif
1157 free (dump);
1158 return op; 1264 return op;
1159 } 1265 }
1160 1266
1161 if (object *more = op->more) 1267 if (object *more = op->more)
1162 {
1163 if (!insert_ob_in_map (more, m, originator, flag)) 1268 if (!insert_ob_in_map (more, m, originator, flag))
1164 {
1165 if (!op->head)
1166 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1167
1168 return 0; 1269 return 0;
1169 }
1170 }
1171 1270
1172 CLEAR_FLAG (op, FLAG_REMOVED); 1271 CLEAR_FLAG (op, FLAG_REMOVED);
1173 1272
1174 /* Ideally, the caller figures this out. However, it complicates a lot 1273 /* Ideally, the caller figures this out. However, it complicates a lot
1175 * of areas of callers (eg, anything that uses find_free_spot would now 1274 * of areas of callers (eg, anything that uses find_free_spot would now
1182 mapspace &ms = op->ms (); 1281 mapspace &ms = op->ms ();
1183 1282
1184 /* this has to be done after we translate the coordinates. 1283 /* this has to be done after we translate the coordinates.
1185 */ 1284 */
1186 if (op->nrof && !(flag & INS_NO_MERGE)) 1285 if (op->nrof && !(flag & INS_NO_MERGE))
1187 for (tmp = ms.bot; tmp; tmp = tmp->above) 1286 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1188 if (object::can_merge (op, tmp)) 1287 if (object::can_merge (op, tmp))
1189 { 1288 {
1190 op->nrof += tmp->nrof; 1289 op->nrof += tmp->nrof;
1191 tmp->destroy (); 1290 tmp->destroy ();
1192 } 1291 }
1259 * looks like instead of lots of conditions here. 1358 * looks like instead of lots of conditions here.
1260 * makes things faster, and effectively the same result. 1359 * makes things faster, and effectively the same result.
1261 */ 1360 */
1262 1361
1263 /* Have object 'fall below' other objects that block view. 1362 /* Have object 'fall below' other objects that block view.
1264 * Unless those objects are exits, type 66 1363 * Unless those objects are exits.
1265 * If INS_ON_TOP is used, don't do this processing 1364 * If INS_ON_TOP is used, don't do this processing
1266 * Need to find the object that in fact blocks view, otherwise 1365 * Need to find the object that in fact blocks view, otherwise
1267 * stacking is a bit odd. 1366 * stacking is a bit odd.
1268 */ 1367 */
1269 if (!(flag & INS_ON_TOP) 1368 if (!(flag & INS_ON_TOP)
1270 && ms.flags () & P_BLOCKSVIEW 1369 && ms.flags () & P_BLOCKSVIEW
1271 && (op->face && !op->face->visibility)) 1370 && (op->face && !faces [op->face].visibility))
1272 { 1371 {
1273 for (last = top; last != floor; last = last->below) 1372 for (last = top; last != floor; last = last->below)
1274 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1373 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1275 break; 1374 break;
1276 1375
1361 * blocked() and wall() work properly), and these flags are updated by 1460 * blocked() and wall() work properly), and these flags are updated by
1362 * update_object(). 1461 * update_object().
1363 */ 1462 */
1364 1463
1365 /* if this is not the head or flag has been passed, don't check walk on status */ 1464 /* if this is not the head or flag has been passed, don't check walk on status */
1366 if (!(flag & INS_NO_WALK_ON) && !op->head) 1465 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1367 { 1466 {
1368 if (check_move_on (op, originator)) 1467 if (check_move_on (op, originator))
1369 return 0; 1468 return 0;
1370 1469
1371 /* If we are a multi part object, lets work our way through the check 1470 /* If we are a multi part object, lets work our way through the check
1372 * walk on's. 1471 * walk on's.
1373 */ 1472 */
1374 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1473 for (object *tmp = op->more; tmp; tmp = tmp->more)
1375 if (check_move_on (tmp, originator)) 1474 if (check_move_on (tmp, originator))
1376 return 0; 1475 return 0;
1377 } 1476 }
1378 1477
1379 return op; 1478 return op;
1389 object *tmp, *tmp1; 1488 object *tmp, *tmp1;
1390 1489
1391 /* first search for itself and remove any old instances */ 1490 /* first search for itself and remove any old instances */
1392 1491
1393 for (tmp = op->ms ().bot; tmp; tmp = tmp->above) 1492 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1394 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1493 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1395 tmp->destroy (); 1494 tmp->destroy ();
1396 1495
1397 tmp1 = arch_to_object (archetype::find (arch_string)); 1496 tmp1 = arch_to_object (archetype::find (arch_string));
1398 1497
1399 tmp1->x = op->x; 1498 tmp1->x = op->x;
1402} 1501}
1403 1502
1404object * 1503object *
1405object::insert_at (object *where, object *originator, int flags) 1504object::insert_at (object *where, object *originator, int flags)
1406{ 1505{
1407 where->map->insert (this, where->x, where->y, originator, flags); 1506 return where->map->insert (this, where->x, where->y, originator, flags);
1408} 1507}
1409 1508
1410/* 1509/*
1411 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1510 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1412 * is returned contains nr objects, and the remaining parts contains 1511 * is returned contains nr objects, and the remaining parts contains
1452 * the amount of an object. If the amount reaches 0, the object 1551 * the amount of an object. If the amount reaches 0, the object
1453 * is subsequently removed and freed. 1552 * is subsequently removed and freed.
1454 * 1553 *
1455 * Return value: 'op' if something is left, NULL if the amount reached 0 1554 * Return value: 'op' if something is left, NULL if the amount reached 0
1456 */ 1555 */
1457
1458object * 1556object *
1459decrease_ob_nr (object *op, uint32 i) 1557decrease_ob_nr (object *op, uint32 i)
1460{ 1558{
1461 object *tmp; 1559 object *tmp;
1462 1560
1537 1635
1538/* 1636/*
1539 * add_weight(object, weight) adds the specified weight to an object, 1637 * add_weight(object, weight) adds the specified weight to an object,
1540 * and also updates how much the environment(s) is/are carrying. 1638 * and also updates how much the environment(s) is/are carrying.
1541 */ 1639 */
1542
1543void 1640void
1544add_weight (object *op, signed long weight) 1641add_weight (object *op, signed long weight)
1545{ 1642{
1546 while (op != NULL) 1643 while (op != NULL)
1547 { 1644 {
1562 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1659 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1563 free (dump); 1660 free (dump);
1564 return op; 1661 return op;
1565 } 1662 }
1566 1663
1567 if (where->head) 1664 if (where->head_ () != where)
1568 { 1665 {
1569 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); 1666 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1570 where = where->head; 1667 where = where->head;
1571 } 1668 }
1572 1669
1573 return where->insert (op); 1670 return where->insert (op);
1574} 1671}
1579 * inside the object environment. 1676 * inside the object environment.
1580 * 1677 *
1581 * The function returns now pointer to inserted item, and return value can 1678 * The function returns now pointer to inserted item, and return value can
1582 * be != op, if items are merged. -Tero 1679 * be != op, if items are merged. -Tero
1583 */ 1680 */
1584
1585object * 1681object *
1586object::insert (object *op) 1682object::insert (object *op)
1587{ 1683{
1588 object *tmp, *otmp; 1684 object *tmp, *otmp;
1589 1685
1903 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) 1999 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
1904 { 2000 {
1905 CLEAR_FLAG (tmp, flag); 2001 CLEAR_FLAG (tmp, flag);
1906 unflag_inv (tmp, flag); 2002 unflag_inv (tmp, flag);
1907 } 2003 }
1908}
1909
1910/*
1911 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1912 * all it's inventory (recursively).
1913 * If checksums are used, a player will get set_cheat called for
1914 * him/her-self and all object carried by a call to this function.
1915 */
1916void
1917set_cheat (object *op)
1918{
1919 SET_FLAG (op, FLAG_WAS_WIZ);
1920 flag_inv (op, FLAG_WAS_WIZ);
1921} 2004}
1922 2005
1923/* 2006/*
1924 * find_free_spot(object, map, x, y, start, stop) will search for 2007 * find_free_spot(object, map, x, y, start, stop) will search for
1925 * a spot at the given map and coordinates which will be able to contain 2008 * a spot at the given map and coordinates which will be able to contain
1966 } 2049 }
1967 2050
1968 if (!index) 2051 if (!index)
1969 return -1; 2052 return -1;
1970 2053
1971 return altern[RANDOM () % index]; 2054 return altern [rndm (index)];
1972} 2055}
1973 2056
1974/* 2057/*
1975 * find_first_free_spot(archetype, maptile, x, y) works like 2058 * find_first_free_spot(archetype, maptile, x, y) works like
1976 * find_free_spot(), but it will search max number of squares. 2059 * find_free_spot(), but it will search max number of squares.
1997{ 2080{
1998 arr += begin; 2081 arr += begin;
1999 end -= begin; 2082 end -= begin;
2000 2083
2001 while (--end) 2084 while (--end)
2002 swap (arr [end], arr [RANDOM () % (end + 1)]); 2085 swap (arr [end], arr [rndm (end + 1)]);
2003} 2086}
2004 2087
2005/* new function to make monster searching more efficient, and effective! 2088/* new function to make monster searching more efficient, and effective!
2006 * This basically returns a randomized array (in the passed pointer) of 2089 * This basically returns a randomized array (in the passed pointer) of
2007 * the spaces to find monsters. In this way, it won't always look for 2090 * the spaces to find monsters. In this way, it won't always look for
2043 object *tmp; 2126 object *tmp;
2044 maptile *mp; 2127 maptile *mp;
2045 2128
2046 MoveType blocked, move_type; 2129 MoveType blocked, move_type;
2047 2130
2048 if (exclude && exclude->head) 2131 if (exclude && exclude->head_ () != exclude)
2049 { 2132 {
2050 exclude = exclude->head; 2133 exclude = exclude->head;
2051 move_type = exclude->move_type; 2134 move_type = exclude->move_type;
2052 } 2135 }
2053 else 2136 else
2076 max = maxfree[i]; 2159 max = maxfree[i];
2077 else if (mflags & P_IS_ALIVE) 2160 else if (mflags & P_IS_ALIVE)
2078 { 2161 {
2079 for (tmp = ms.bot; tmp; tmp = tmp->above) 2162 for (tmp = ms.bot; tmp; tmp = tmp->above)
2080 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) 2163 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2081 && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2164 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2082 break; 2165 break;
2083 2166
2084 if (tmp) 2167 if (tmp)
2085 return freedir[i]; 2168 return freedir[i];
2086 } 2169 }
2281 * create clone from object to another 2364 * create clone from object to another
2282 */ 2365 */
2283object * 2366object *
2284object_create_clone (object *asrc) 2367object_create_clone (object *asrc)
2285{ 2368{
2286 object *dst = 0, *tmp, *src, *part, *prev, *item; 2369 object *dst = 0, *tmp, *src, *prev, *item;
2287 2370
2288 if (!asrc) 2371 if (!asrc)
2289 return 0; 2372 return 0;
2290 2373
2291 src = asrc;
2292 if (src->head)
2293 src = src->head; 2374 src = asrc->head_ ();
2294 2375
2295 prev = 0; 2376 prev = 0;
2296 for (part = src; part; part = part->more) 2377 for (object *part = src; part; part = part->more)
2297 { 2378 {
2298 tmp = part->clone (); 2379 tmp = part->clone ();
2299 tmp->x -= src->x; 2380 tmp->x -= src->x;
2300 tmp->y -= src->y; 2381 tmp->y -= src->y;
2301 2382
2319 insert_ob_in_ob (object_create_clone (item), dst); 2400 insert_ob_in_ob (object_create_clone (item), dst);
2320 2401
2321 return dst; 2402 return dst;
2322} 2403}
2323 2404
2324/* GROS - Creates an object using a string representing its content. */
2325/* Basically, we save the content of the string to a temp file, then call */
2326/* load_object on it. I admit it is a highly inefficient way to make things, */
2327/* but it was simple to make and allows reusing the load_object function. */
2328/* Remember not to use load_object_str in a time-critical situation. */
2329/* Also remember that multiparts objects are not supported for now. */
2330object *
2331load_object_str (const char *obstr)
2332{
2333 object *op;
2334 char filename[MAX_BUF];
2335
2336 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2337
2338 FILE *tempfile = fopen (filename, "w");
2339
2340 if (tempfile == NULL)
2341 {
2342 LOG (llevError, "Error - Unable to access load object temp file\n");
2343 return NULL;
2344 }
2345
2346 fprintf (tempfile, obstr);
2347 fclose (tempfile);
2348
2349 op = object::create ();
2350
2351 object_thawer thawer (filename);
2352
2353 if (thawer)
2354 load_object (thawer, op, 0);
2355
2356 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2357 CLEAR_FLAG (op, FLAG_REMOVED);
2358
2359 return op;
2360}
2361
2362/* This returns the first object in who's inventory that 2405/* This returns the first object in who's inventory that
2363 * has the same type and subtype match. 2406 * has the same type and subtype match.
2364 * returns NULL if no match. 2407 * returns NULL if no match.
2365 */ 2408 */
2366object * 2409object *
2419 if (link->key == canonical_key) 2462 if (link->key == canonical_key)
2420 return link->value; 2463 return link->value;
2421 2464
2422 return 0; 2465 return 0;
2423} 2466}
2424
2425 2467
2426/* 2468/*
2427 * Updates the canonical_key in op to value. 2469 * Updates the canonical_key in op to value.
2428 * 2470 *
2429 * canonical_key is a shared string (value doesn't have to be). 2471 * canonical_key is a shared string (value doesn't have to be).
2569{ 2611{
2570 char flagdesc[512]; 2612 char flagdesc[512];
2571 char info2[256 * 4]; 2613 char info2[256 * 4];
2572 char *p = info; 2614 char *p = info;
2573 2615
2574 p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", 2616 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2575 count, uuid.seq, 2617 count, uuid.seq,
2576 &name, 2618 &name,
2577 title ? "\",title:\"" : "", 2619 title ? "\",title:\"" : "",
2578 title ? (const char *)title : "", 2620 title ? (const char *)title : "",
2579 flag_desc (flagdesc, 512), type); 2621 flag_desc (flagdesc, 512), type);
2588} 2630}
2589 2631
2590const char * 2632const char *
2591object::debug_desc () const 2633object::debug_desc () const
2592{ 2634{
2593 static char info[256 * 4]; 2635 static char info[3][256 * 4];
2636 static int info_idx;
2637
2594 return debug_desc (info); 2638 return debug_desc (info [++info_idx % 3]);
2595} 2639}
2596 2640
2597const char * 2641struct region *
2598object::debug_desc2 () const 2642object::region () const
2599{ 2643{
2600 static char info[256 * 4]; 2644 return map ? map->region (x, y)
2601 return debug_desc (info); 2645 : region::default_region ();
2602} 2646}
2603 2647
2648const materialtype_t *
2649object::dominant_material () const
2650{
2651 if (materialtype_t *mat = name_to_material (materialname))
2652 return mat;
2653
2654 // omfg this is slow, this has to be temporary :)
2655 shstr unknown ("unknown");
2656
2657 return name_to_material (unknown);
2658}
2659
2660void
2661object::open_container (object *new_container)
2662{
2663 if (container == new_container)
2664 return;
2665
2666 if (object *old_container = container)
2667 {
2668 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2669 return;
2670
2671#if 0
2672 // remove the "Close old_container" object.
2673 if (object *closer = old_container->inv)
2674 if (closer->type == CLOSE_CON)
2675 closer->destroy ();
2676#endif
2677
2678 old_container->flag [FLAG_APPLIED] = 0;
2679 container = 0;
2680
2681 esrv_update_item (UPD_FLAGS, this, old_container);
2682 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2683 }
2684
2685 if (new_container)
2686 {
2687 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2688 return;
2689
2690 // TODO: this does not seem to serve any purpose anymore?
2691#if 0
2692 // insert the "Close Container" object.
2693 if (archetype *closer = new_container->other_arch)
2694 {
2695 object *closer = arch_to_object (new_container->other_arch);
2696 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2697 new_container->insert (closer);
2698 }
2699#endif
2700
2701 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2702
2703 new_container->flag [FLAG_APPLIED] = 1;
2704 container = new_container;
2705
2706 esrv_update_item (UPD_FLAGS, this, new_container);
2707 esrv_send_inventory (this, new_container);
2708 }
2709}
2710
2711

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines