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.54 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.93 by root, Tue Dec 26 20:04:09 2006 UTC

… …
29#include <sys/types.h> 29#include <sys/types.h>
30#include <sys/uio.h> 30#include <sys/uio.h>
31#include <object.h> 31#include <object.h>
32#include <funcpoint.h> 32#include <funcpoint.h>
33#include <loader.h> 33#include <loader.h>
34
35#include <bitset>
34 36
35int nrofallocobjects = 0; 37int nrofallocobjects = 0;
36static UUID uuid; 38static UUID uuid;
37const uint64 UUID_SKIP = 1<<19; 39const uint64 UUID_SKIP = 1<<19;
38 40
… …
104 _exit (1); 106 _exit (1);
105 } 107 }
106 108
107 uuid.seq = uid; 109 uuid.seq = uid;
108 write_uuid (); 110 write_uuid ();
109 LOG (llevDebug, "read UID: %lld\n", uid); 111 LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
110 fclose (fp); 112 fclose (fp);
111} 113}
112 114
113UUID 115UUID
114gen_uuid () 116gen_uuid ()
… …
139 * objects with lists are rare, and lists stay short. If not, use a 141 * objects with lists are rare, and lists stay short. If not, use a
140 * different structure or at least keep the lists sorted... 142 * different structure or at least keep the lists sorted...
141 */ 143 */
142 144
143 /* For each field in wants, */ 145 /* For each field in wants, */
144 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) 146 for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next)
145 { 147 {
146 key_value *has_field; 148 key_value *has_field;
147 149
148 /* Look for a field in has with the same key. */ 150 /* Look for a field in has with the same key. */
149 has_field = get_ob_key_link (has, wants_field->key); 151 has_field = get_ob_key_link (has, wants_field->key);
… …
183 * 185 *
184 * Note that this function appears a lot longer than the macro it 186 * Note that this function appears a lot longer than the macro it
185 * replaces - this is mostly for clarity - a decent compiler should hopefully 187 * replaces - this is mostly for clarity - a decent compiler should hopefully
186 * reduce this to the same efficiency. 188 * reduce this to the same efficiency.
187 * 189 *
188 * Check nrof variable *before* calling CAN_MERGE() 190 * Check nrof variable *before* calling can_merge()
189 * 191 *
190 * Improvements made with merge: Better checking on potion, and also 192 * Improvements made with merge: Better checking on potion, and also
191 * check weight 193 * check weight
192 */ 194 */
193 195
194bool object::can_merge (object *ob1, object *ob2) 196bool object::can_merge_slow (object *ob1, object *ob2)
195{ 197{
196 /* A couple quicksanity checks */ 198 /* A couple quicksanity checks */
197 if ((ob1 == ob2) || (ob1->type != ob2->type)) 199 if (ob1 == ob2
200 || ob1->type != ob2->type
201 || ob1->speed != ob2->speed
202 || ob1->value != ob2->value
203 || ob1->name != ob2->name)
198 return 0; 204 return 0;
199 205
200 if (ob1->speed != ob2->speed) 206 //TODO: this ain't working well, use nicer and correct overflow check
201 return 0;
202
203 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that 207 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204 * value could not be stored in a sint32 (which unfortunately sometimes is 208 * value could not be stored in a sint32 (which unfortunately sometimes is
205 * used to store nrof). 209 * used to store nrof).
206 */ 210 */
207 if (ob1->nrof + ob2->nrof >= 1UL << 31) 211 if (ob1->nrof + ob2->nrof >= 1UL << 31)
… …
217 SET_FLAG (ob1, FLAG_BEEN_APPLIED); 221 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218 222
219 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) 223 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220 SET_FLAG (ob2, FLAG_BEEN_APPLIED); 224 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221 225
222 226 if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any ()
223 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something 227 || ob1->arch != ob2->arch
224 * being locked in inventory should prevent merging.
225 * 0x4 in flags3 is CLIENT_SENT
226 */
227 if ((ob1->arch != ob2->arch) ||
228 (ob1->flags[0] != ob2->flags[0]) ||
229 (ob1->flags[1] != ob2->flags[1]) ||
230 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232 (ob1->name != ob2->name) || 228 || ob1->name != ob2->name
233 (ob1->title != ob2->title) || 229 || ob1->title != ob2->title
234 (ob1->msg != ob2->msg) || 230 || ob1->msg != ob2->msg
235 (ob1->weight != ob2->weight) || 231 || ob1->weight != ob2->weight
236 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || 232 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || 233 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) )
238 (ob1->attacktype != ob2->attacktype) || 234 || ob1->attacktype != ob2->attacktype
239 (ob1->magic != ob2->magic) || 235 || ob1->magic != ob2->magic
240 (ob1->slaying != ob2->slaying) || 236 || ob1->slaying != ob2->slaying
241 (ob1->skill != ob2->skill) || 237 || ob1->skill != ob2->skill
242 (ob1->value != ob2->value) || 238 || ob1->value != ob2->value
243 (ob1->animation_id != ob2->animation_id) || 239 || ob1->animation_id != ob2->animation_id
244 (ob1->client_type != ob2->client_type) || 240 || ob1->client_type != ob2->client_type
245 (ob1->materialname != ob2->materialname) || 241 || ob1->materialname != ob2->materialname
246 (ob1->lore != ob2->lore) || 242 || ob1->lore != ob2->lore
247 (ob1->subtype != ob2->subtype) || 243 || ob1->subtype != ob2->subtype
248 (ob1->move_type != ob2->move_type) || 244 || ob1->move_type != ob2->move_type
249 (ob1->move_block != ob2->move_block) || 245 || ob1->move_block != ob2->move_block
250 (ob1->move_allow != ob2->move_allow) || 246 || ob1->move_allow != ob2->move_allow
251 (ob1->move_on != ob2->move_on) || 247 || ob1->move_on != ob2->move_on
252 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) 248 || ob1->move_off != ob2->move_off
249 || ob1->move_slow != ob2->move_slow
250 || ob1->move_slow_penalty != ob2->move_slow_penalty)
253 return 0; 251 return 0;
254 252
255 /* This is really a spellbook check - really, we should 253 /* This is really a spellbook check - really, we should
256 * check all objects in the inventory. 254 * check all objects in the inventory.
257 */ 255 */
… …
260 /* if one object has inventory but the other doesn't, not equiv */ 258 /* if one object has inventory but the other doesn't, not equiv */
261 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 259 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
262 return 0; 260 return 0;
263 261
264 /* Now check to see if the two inventory objects could merge */ 262 /* Now check to see if the two inventory objects could merge */
265 if (!CAN_MERGE (ob1->inv, ob2->inv)) 263 if (!object::can_merge (ob1->inv, ob2->inv))
266 return 0; 264 return 0;
267 265
268 /* inventory ok - still need to check rest of this object to see 266 /* inventory ok - still need to check rest of this object to see
269 * if it is valid. 267 * if it is valid.
270 */ 268 */
… …
354 op = op->env; 352 op = op->env;
355 return op; 353 return op;
356} 354}
357 355
358/* 356/*
359 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
360 * a better check. We basically keeping traversing up until we can't
361 * or find a player.
362 */
363
364object *
365is_player_inv (object *op)
366{
367 for (; op != NULL && op->type != PLAYER; op = op->env)
368 if (op->env == op)
369 op->env = NULL;
370 return op;
371}
372
373/*
374 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 357 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
375 * Some error messages. 358 * Some error messages.
376 * The result of the dump is stored in the static global errmsg array. 359 * The result of the dump is stored in the static global errmsg array.
377 */ 360 */
378 361
… …
381{ 364{
382 if (!op) 365 if (!op)
383 return strdup ("[NULLOBJ]"); 366 return strdup ("[NULLOBJ]");
384 367
385 object_freezer freezer; 368 object_freezer freezer;
386 save_object (freezer, op, 3); 369 save_object (freezer, op, 1);
387 return freezer.as_string (); 370 return freezer.as_string ();
388} 371}
389 372
390/* 373/*
391 * get_nearest_part(multi-object, object 2) returns the part of the 374 * get_nearest_part(multi-object, object 2) returns the part of the
… …
484 } 467 }
485 468
486 op->key_values = 0; 469 op->key_values = 0;
487} 470}
488 471
489void object::clear ()
490{
491 attachable_base::clear ();
492
493 free_key_values (this);
494
495 owner = 0;
496 name = 0;
497 name_pl = 0;
498 title = 0;
499 race = 0;
500 slaying = 0;
501 skill = 0;
502 msg = 0;
503 lore = 0;
504 custom_name = 0;
505 materialname = 0;
506 contr = 0;
507 below = 0;
508 above = 0;
509 inv = 0;
510 container = 0;
511 env = 0;
512 more = 0;
513 head = 0;
514 map = 0;
515 active_next = 0;
516 active_prev = 0;
517
518 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
519
520 SET_FLAG (this, FLAG_REMOVED);
521
522 /* What is not cleared is next, prev, and count */
523
524 expmul = 1.0;
525 face = blank_face;
526
527 if (settings.casting_time)
528 casting_time = -1;
529}
530
531void object::clone (object *destination)
532{
533 *(object_copy *)destination = *this;
534 *(object_pod *)destination = *this;
535
536 if (self || cb)
537 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
538}
539
540/* 472/*
541 * copy object first frees everything allocated by the second object, 473 * copy_to first frees everything allocated by the dst object,
542 * and then copies the contends of the first object into the second 474 * and then copies the contents of itself into the second
543 * object, allocating what needs to be allocated. Basically, any 475 * object, allocating what needs to be allocated. Basically, any
544 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 476 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
545 * if the first object is freed, the pointers in the new object 477 * if the first object is freed, the pointers in the new object
546 * will point at garbage. 478 * will point at garbage.
547 */ 479 */
548void 480void
549copy_object (object *op2, object *op) 481object::copy_to (object *dst)
550{ 482{
551 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 483 bool is_freed = QUERY_FLAG (dst, FLAG_FREED);
552 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 484 bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED);
553 485
554 op2->clone (op); 486 *(object_copy *)dst = *this;
555 487
556 if (is_freed) 488 if (is_freed)
557 SET_FLAG (op, FLAG_FREED); 489 SET_FLAG (dst, FLAG_FREED);
490
558 if (is_removed) 491 if (is_removed)
559 SET_FLAG (op, FLAG_REMOVED); 492 SET_FLAG (dst, FLAG_REMOVED);
560 493
561 if (op2->speed < 0) 494 if (speed < 0)
562 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; 495 dst->speed_left = speed_left - RANDOM () % 200 / 100.0;
563 496
564 /* Copy over key_values, if any. */ 497 /* Copy over key_values, if any. */
565 if (op2->key_values) 498 if (key_values)
566 { 499 {
567 key_value *tail = 0; 500 key_value *tail = 0;
568 key_value *i; 501 key_value *i;
569 502
570 op->key_values = 0; 503 dst->key_values = 0;
571 504
572 for (i = op2->key_values; i; i = i->next) 505 for (i = key_values; i; i = i->next)
573 { 506 {
574 key_value *new_link = new key_value; 507 key_value *new_link = new key_value;
575 508
576 new_link->next = 0; 509 new_link->next = 0;
577 new_link->key = i->key; 510 new_link->key = i->key;
578 new_link->value = i->value; 511 new_link->value = i->value;
579 512
580 /* Try and be clever here, too. */ 513 /* Try and be clever here, too. */
581 if (!op->key_values) 514 if (!dst->key_values)
582 { 515 {
583 op->key_values = new_link; 516 dst->key_values = new_link;
584 tail = new_link; 517 tail = new_link;
585 } 518 }
586 else 519 else
587 { 520 {
588 tail->next = new_link; 521 tail->next = new_link;
589 tail = new_link; 522 tail = new_link;
590 } 523 }
591 } 524 }
592 } 525 }
593 526
594 update_ob_speed (op); 527 dst->set_speed (dst->speed);
528}
529
530object *
531object::clone ()
532{
533 object *neu = create ();
534 copy_to (neu);
535 return neu;
595} 536}
596 537
597/* 538/*
598 * If an object with the IS_TURNABLE() flag needs to be turned due 539 * If an object with the IS_TURNABLE() flag needs to be turned due
599 * to the closest player being on the other side, this function can 540 * to the closest player being on the other side, this function can
… …
613 * Updates the speed of an object. If the speed changes from 0 to another 554 * Updates the speed of an object. If the speed changes from 0 to another
614 * value, or vice versa, then add/remove the object from the active list. 555 * value, or vice versa, then add/remove the object from the active list.
615 * This function needs to be called whenever the speed of an object changes. 556 * This function needs to be called whenever the speed of an object changes.
616 */ 557 */
617void 558void
618update_ob_speed (object *op) 559object::set_speed (float speed)
619{ 560{
620 extern int arch_init; 561 extern int arch_init;
621 562
622 /* No reason putting the archetypes objects on the speed list, 563 /* No reason putting the archetypes objects on the speed list,
623 * since they never really need to be updated. 564 * since they never really need to be updated.
624 */ 565 */
625 566 if (flag [FLAG_FREED] && speed)
626 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
627 { 567 {
628 LOG (llevError, "Object %s is freed but has speed.\n", &op->name); 568 LOG (llevError, "Object %s is freed but has speed.\n", &name);
629#ifdef MANY_CORES
630 abort ();
631#else
632 op->speed = 0; 569 speed = 0;
633#endif
634 } 570 }
571
572 this->speed = speed;
635 573
636 if (arch_init) 574 if (arch_init)
637 return; 575 return;
638 576
639 if (FABS (op->speed) > MIN_ACTIVE_SPEED) 577 if (FABS (speed) > MIN_ACTIVE_SPEED)
640 { 578 {
641 /* If already on active list, don't do anything */ 579 /* If already on active list, don't do anything */
642 if (op->active_next || op->active_prev || op == active_objects) 580 if (active_next || active_prev || this == active_objects)
643 return; 581 return;
644 582
645 /* process_events() expects us to insert the object at the beginning 583 /* process_events() expects us to insert the object at the beginning
646 * of the list. */ 584 * of the list. */
647 op->active_next = active_objects; 585 active_next = active_objects;
648 586
649 if (op->active_next != NULL) 587 if (active_next)
650 op->active_next->active_prev = op; 588 active_next->active_prev = this;
651 589
652 active_objects = op; 590 active_objects = this;
653 } 591 }
654 else 592 else
655 { 593 {
656 /* If not on the active list, nothing needs to be done */ 594 /* If not on the active list, nothing needs to be done */
657 if (!op->active_next && !op->active_prev && op != active_objects) 595 if (!active_next && !active_prev && this != active_objects)
658 return; 596 return;
659 597
660 if (op->active_prev == NULL) 598 if (!active_prev)
661 { 599 {
662 active_objects = op->active_next; 600 active_objects = active_next;
663 601
664 if (op->active_next != NULL) 602 if (active_next)
665 op->active_next->active_prev = NULL; 603 active_next->active_prev = 0;
666 } 604 }
667 else 605 else
668 { 606 {
669 op->active_prev->active_next = op->active_next; 607 active_prev->active_next = active_next;
670 608
671 if (op->active_next) 609 if (active_next)
672 op->active_next->active_prev = op->active_prev; 610 active_next->active_prev = active_prev;
673 } 611 }
674 612
675 op->active_next = NULL; 613 active_next = 0;
676 op->active_prev = NULL; 614 active_prev = 0;
677 } 615 }
678} 616}
679 617
680/* This function removes object 'op' from the list of active 618/* This function removes object 'op' from the list of active
681 * objects. 619 * objects.
… …
707 op->active_next = NULL; 645 op->active_next = NULL;
708 op->active_prev = NULL; 646 op->active_prev = NULL;
709} 647}
710 648
711/* 649/*
712 * update_object() updates the array which represents the map. 650 * update_object() updates the the map.
713 * It takes into account invisible objects (and represent squares covered 651 * It takes into account invisible objects (and represent squares covered
714 * by invisible objects by whatever is below them (unless it's another 652 * by invisible objects by whatever is below them (unless it's another
715 * invisible object, etc...) 653 * invisible object, etc...)
716 * If the object being updated is beneath a player, the look-window 654 * If the object being updated is beneath a player, the look-window
717 * of that player is updated (this might be a suboptimal way of 655 * of that player is updated (this might be a suboptimal way of
718 * updating that window, though, since update_object() is called _often_) 656 * updating that window, though, since update_object() is called _often_)
719 * 657 *
720 * action is a hint of what the caller believes need to be done. 658 * action is a hint of what the caller believes need to be done.
721 * For example, if the only thing that has changed is the face (due to
722 * an animation), we don't need to call update_position until that actually
723 * comes into view of a player. OTOH, many other things, like addition/removal
724 * of walls or living creatures may need us to update the flags now.
725 * current action are: 659 * current action are:
726 * UP_OBJ_INSERT: op was inserted 660 * UP_OBJ_INSERT: op was inserted
727 * UP_OBJ_REMOVE: op was removed 661 * UP_OBJ_REMOVE: op was removed
728 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 662 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
729 * as that is easier than trying to look at what may have changed. 663 * as that is easier than trying to look at what may have changed.
730 * UP_OBJ_FACE: only the objects face has changed. 664 * UP_OBJ_FACE: only the objects face has changed.
731 */ 665 */
732
733void 666void
734update_object (object *op, int action) 667update_object (object *op, int action)
735{ 668{
736 int update_now = 0, flags;
737 MoveType move_on, move_off, move_block, move_slow; 669 MoveType move_on, move_off, move_block, move_slow;
738 670
739 if (op == NULL) 671 if (op == NULL)
740 { 672 {
741 /* this should never happen */ 673 /* this should never happen */
742 LOG (llevDebug, "update_object() called for NULL object.\n"); 674 LOG (llevDebug, "update_object() called for NULL object.\n");
743 return; 675 return;
744 } 676 }
745 677
746 if (op->env != NULL) 678 if (op->env)
747 { 679 {
748 /* Animation is currently handled by client, so nothing 680 /* Animation is currently handled by client, so nothing
749 * to do in this case. 681 * to do in this case.
750 */ 682 */
751 return; 683 return;
… …
756 */ 688 */
757 if (!op->map || op->map->in_memory == MAP_SAVING) 689 if (!op->map || op->map->in_memory == MAP_SAVING)
758 return; 690 return;
759 691
760 /* make sure the object is within map boundaries */ 692 /* make sure the object is within map boundaries */
761 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map)) 693 if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height)
762 { 694 {
763 LOG (llevError, "update_object() called for object out of map!\n"); 695 LOG (llevError, "update_object() called for object out of map!\n");
764#ifdef MANY_CORES 696#ifdef MANY_CORES
765 abort (); 697 abort ();
766#endif 698#endif
767 return; 699 return;
768 } 700 }
769 701
770 flags = GET_MAP_FLAGS (op->map, op->x, op->y); 702 mapspace &m = op->ms ();
771 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
772 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
773 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
774 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
775 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
776 703
704 if (m.flags_ & P_NEED_UPDATE)
705 /* nop */;
777 if (action == UP_OBJ_INSERT) 706 else if (action == UP_OBJ_INSERT)
778 { 707 {
708 // this is likely overkill, TODO: revisit (schmorp)
779 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 709 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
780 update_now = 1;
781
782 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 710 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
783 update_now = 1; 711 || (op->type == PLAYER && !(m.flags_ & P_PLAYER))
784 712 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
713 || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE))
785 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 714 || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC))
786 update_now = 1;
787
788 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
789 update_now = 1;
790
791 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
792 update_now = 1;
793
794 if ((move_on | op->move_on) != move_on) 715 || (m.move_on | op->move_on ) != m.move_on
795 update_now = 1;
796
797 if ((move_off | op->move_off) != move_off) 716 || (m.move_off | op->move_off ) != m.move_off
798 update_now = 1; 717 || (m.move_slow | op->move_slow) != m.move_slow
799
800 /* This isn't perfect, but I don't expect a lot of objects to 718 /* This isn't perfect, but I don't expect a lot of objects to
801 * to have move_allow right now. 719 * to have move_allow right now.
802 */ 720 */
803 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 721 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
804 update_now = 1; 722 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
805 723 m.flags_ = P_NEED_UPDATE;
806 if ((move_slow | op->move_slow) != move_slow)
807 update_now = 1;
808 } 724 }
809 /* if the object is being removed, we can't make intelligent 725 /* if the object is being removed, we can't make intelligent
810 * decisions, because remove_ob can't really pass the object 726 * decisions, because remove_ob can't really pass the object
811 * that is being removed. 727 * that is being removed.
812 */ 728 */
813 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) 729 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
814 update_now = 1; 730 m.flags_ = P_NEED_UPDATE;
815 else if (action == UP_OBJ_FACE) 731 else if (action == UP_OBJ_FACE)
816 /* Nothing to do for that case */ ; 732 /* Nothing to do for that case */ ;
817 else 733 else
818 LOG (llevError, "update_object called with invalid action: %d\n", action); 734 LOG (llevError, "update_object called with invalid action: %d\n", action);
819 735
820 if (update_now)
821 {
822 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
823 update_position (op->map, op->x, op->y);
824 }
825
826 if (op->more != NULL) 736 if (op->more)
827 update_object (op->more, action); 737 update_object (op->more, action);
828} 738}
829 739
830object::vector object::mortals;
831object::vector object::objects; // not yet used 740object::vector object::objects; // not yet used
832object *object::first; 741object *object::first;
833
834void object::free_mortals ()
835{
836 for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
837 if ((*i)->refcnt)
838 ++i; // further delay freeing
839 else
840 {
841 delete *i;
842 mortals.erase (i);
843 }
844
845 static int lastmortals = 0;//D
846
847 if (mortals.size() != lastmortals && lastmortals > 100)//D
848 {
849 lastmortals = mortals.size ();//D
850 LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D
851 }
852}
853 742
854object::object () 743object::object ()
855{ 744{
856 SET_FLAG (this, FLAG_REMOVED); 745 SET_FLAG (this, FLAG_REMOVED);
857 746
… …
889 778
890 prev = 0; 779 prev = 0;
891 next = 0; 780 next = 0;
892} 781}
893 782
783/*
784 * Remove and free all objects in the inventory of the given object.
785 * object.c ?
786 */
787void
788object::destroy_inv (bool drop_to_ground)
789{
790 /* Only if the space blocks everything do we not process -
791 * if some form of movement is allowed, let objects
792 * drop on that space.
793 */
794 if (!drop_to_ground
795 || !map
796 || map->in_memory != MAP_IN_MEMORY
797 || map->at (x, y).move_block == MOVE_ALL)
798 {
799 while (inv)
800 {
801 inv->destroy_inv (drop_to_ground);
802 inv->destroy ();
803 }
804 }
805 else
806 { /* Put objects in inventory onto this space */
807 while (inv)
808 {
809 object *op = inv;
810
811 if (op->flag [FLAG_STARTEQUIP]
812 || op->flag [FLAG_NO_DROP]
813 || op->type == RUNE
814 || op->type == TRAP
815 || op->flag [FLAG_IS_A_TEMPLATE])
816 op->destroy ();
817 else
818 map->insert (op, x, y);
819 }
820 }
821}
822
894object *object::create () 823object *object::create ()
895{ 824{
896 object *op = new object; 825 object *op = new object;
897 op->link (); 826 op->link ();
898 return op; 827 return op;
899} 828}
900 829
901/* 830void
902 * free_object() frees everything allocated by an object, removes 831object::do_destroy ()
903 * it from the list of used objects, and puts it on the list of
904 * free objects. The IS_FREED() flag is set in the object.
905 * The object must have been removed by remove_ob() first for
906 * this function to succeed.
907 *
908 * If destroy_inventory is set, free inventory as well. Else drop items in
909 * inventory to the ground.
910 */
911void object::destroy (bool destroy_inventory)
912{ 832{
913 if (QUERY_FLAG (this, FLAG_FREED)) 833 if (flag [FLAG_IS_LINKED])
834 remove_button_link (this);
835
836 if (flag [FLAG_FRIENDLY])
837 remove_friendly_object (this);
838
839 if (!flag [FLAG_REMOVED])
840 remove ();
841
842 if (flag [FLAG_FREED])
914 return; 843 return;
915 844
916 if (QUERY_FLAG (this, FLAG_FRIENDLY)) 845 set_speed (0);
917 remove_friendly_object (this);
918 846
919 if (!QUERY_FLAG (this, FLAG_REMOVED)) 847 flag [FLAG_FREED] = 1;
920 remove_ob (this);
921 848
922 SET_FLAG (this, FLAG_FREED); 849 attachable::do_destroy ();
850
851 destroy_inv (true);
852 unlink ();
853
854 // hack to ensure that freed objects still have a valid map
855 {
856 static maptile *freed_map; // freed objects are moved here to avoid crashes
857
858 if (!freed_map)
859 {
860 freed_map = new maptile;
861
862 freed_map->name = "/internal/freed_objects_map";
863 freed_map->width = 3;
864 freed_map->height = 3;
865
866 freed_map->allocate ();
867 }
868
869 map = freed_map;
870 x = 1;
871 y = 1;
872 }
873
874 head = 0;
923 875
924 if (more) 876 if (more)
925 { 877 {
926 more->destroy (destroy_inventory); 878 more->destroy ();
927 more = 0; 879 more = 0;
928 }
929
930 if (inv)
931 {
932 /* Only if the space blocks everything do we not process -
933 * if some form of movement is allowed, let objects
934 * drop on that space.
935 */
936 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
937 {
938 object *op = inv;
939
940 while (op)
941 {
942 object *tmp = op->below;
943 op->destroy (destroy_inventory);
944 op = tmp;
945 }
946 }
947 else
948 { /* Put objects in inventory onto this space */
949 object *op = inv;
950
951 while (op)
952 {
953 object *tmp = op->below;
954
955 remove_ob (op);
956
957 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
958 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
959 free_object (op);
960 else
961 {
962 op->x = x;
963 op->y = y;
964 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
965 }
966
967 op = tmp;
968 }
969 }
970 } 880 }
971 881
972 // clear those pointers that likely might have circular references to us 882 // clear those pointers that likely might have circular references to us
973 owner = 0; 883 owner = 0;
974 enemy = 0; 884 enemy = 0;
975 attacked_by = 0; 885 attacked_by = 0;
976 886
977 // only relevant for players(?), but make sure of it anyways 887 // only relevant for players(?), but make sure of it anyways
978 contr = 0; 888 contr = 0;
889}
979 890
980 /* Remove object from the active list */ 891void
981 speed = 0; 892object::destroy (bool destroy_inventory)
982 update_ob_speed (this); 893{
894 if (destroyed ())
895 return;
983 896
984 unlink (); 897 if (destroy_inventory)
898 destroy_inv (false);
985 899
986 mortals.push_back (this); 900 attachable::destroy ();
987} 901}
988 902
989/* 903/*
990 * sub_weight() recursively (outwards) subtracts a number from the 904 * sub_weight() recursively (outwards) subtracts a number from the
991 * weight of an object (and what is carried by it's environment(s)). 905 * weight of an object (and what is carried by it's environment(s)).
992 */ 906 */
993
994void 907void
995sub_weight (object *op, signed long weight) 908sub_weight (object *op, signed long weight)
996{ 909{
997 while (op != NULL) 910 while (op != NULL)
998 { 911 {
… …
1002 op->carrying -= weight; 915 op->carrying -= weight;
1003 op = op->env; 916 op = op->env;
1004 } 917 }
1005} 918}
1006 919
1007/* remove_ob(op): 920/* op->remove ():
1008 * This function removes the object op from the linked list of objects 921 * This function removes the object op from the linked list of objects
1009 * which it is currently tied to. When this function is done, the 922 * which it is currently tied to. When this function is done, the
1010 * object will have no environment. If the object previously had an 923 * object will have no environment. If the object previously had an
1011 * environment, the x and y coordinates will be updated to 924 * environment, the x and y coordinates will be updated to
1012 * the previous environment. 925 * the previous environment.
1013 * Beware: This function is called from the editor as well! 926 * Beware: This function is called from the editor as well!
1014 */ 927 */
1015
1016void 928void
1017remove_ob (object *op) 929object::remove ()
1018{ 930{
1019 object *tmp, *last = 0; 931 object *tmp, *last = 0;
1020 object *otmp; 932 object *otmp;
1021 933
1022 int check_walk_off;
1023 maptile *m;
1024
1025 sint16 x, y;
1026
1027 if (QUERY_FLAG (op, FLAG_REMOVED)) 934 if (QUERY_FLAG (this, FLAG_REMOVED))
1028 return; 935 return;
1029 936
1030 SET_FLAG (op, FLAG_REMOVED); 937 SET_FLAG (this, FLAG_REMOVED);
938 INVOKE_OBJECT (REMOVE, this);
1031 939
1032 if (op->more != NULL) 940 if (more)
1033 remove_ob (op->more); 941 more->remove ();
1034 942
1035 /* 943 /*
1036 * In this case, the object to be removed is in someones 944 * In this case, the object to be removed is in someones
1037 * inventory. 945 * inventory.
1038 */ 946 */
1039 if (op->env != NULL) 947 if (env)
1040 { 948 {
1041 if (op->nrof) 949 if (nrof)
1042 sub_weight (op->env, op->weight * op->nrof); 950 sub_weight (env, weight * nrof);
1043 else 951 else
1044 sub_weight (op->env, op->weight + op->carrying); 952 sub_weight (env, weight + carrying);
1045 953
1046 /* NO_FIX_PLAYER is set when a great many changes are being 954 /* NO_FIX_PLAYER is set when a great many changes are being
1047 * made to players inventory. If set, avoiding the call 955 * made to players inventory. If set, avoiding the call
1048 * to save cpu time. 956 * to save cpu time.
1049 */ 957 */
1050 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 958 if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1051 fix_player (otmp); 959 otmp->update_stats ();
1052 960
1053 if (op->above != NULL) 961 if (above != NULL)
1054 op->above->below = op->below; 962 above->below = below;
1055 else 963 else
1056 op->env->inv = op->below; 964 env->inv = below;
1057 965
1058 if (op->below != NULL) 966 if (below != NULL)
1059 op->below->above = op->above; 967 below->above = above;
1060 968
1061 /* we set up values so that it could be inserted into 969 /* we set up values so that it could be inserted into
1062 * the map, but we don't actually do that - it is up 970 * the map, but we don't actually do that - it is up
1063 * to the caller to decide what we want to do. 971 * to the caller to decide what we want to do.
1064 */ 972 */
1065 op->x = op->env->x, op->y = op->env->y; 973 x = env->x, y = env->y;
1066 op->map = op->env->map; 974 map = env->map;
1067 op->above = NULL, op->below = NULL; 975 above = 0, below = 0;
1068 op->env = NULL; 976 env = 0;
1069 } 977 }
1070 else if (op->map) 978 else if (map)
1071 { 979 {
1072 x = op->x;
1073 y = op->y;
1074 m = get_map_from_coord (op->map, &x, &y);
1075
1076 if (!m)
1077 {
1078 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1079 op->map->path, op->x, op->y);
1080 /* in old days, we used to set x and y to 0 and continue.
1081 * it seems if we get into this case, something is probablye
1082 * screwed up and should be fixed.
1083 */
1084 abort ();
1085 }
1086
1087 if (op->map != m)
1088 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1089 op->map->path, m->path, op->x, op->y, x, y);
1090
1091 /* Re did the following section of code - it looks like it had 980 /* Re did the following section of code - it looks like it had
1092 * lots of logic for things we no longer care about 981 * lots of logic for things we no longer care about
1093 */ 982 */
1094 983
1095 /* link the object above us */ 984 /* link the object above us */
1096 if (op->above) 985 if (above)
1097 op->above->below = op->below; 986 above->below = below;
1098 else 987 else
1099 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ 988 map->at (x, y).top = below; /* we were top, set new top */
1100 989
1101 /* Relink the object below us, if there is one */ 990 /* Relink the object below us, if there is one */
1102 if (op->below) 991 if (below)
1103 op->below->above = op->above; 992 below->above = above;
1104 else 993 else
1105 { 994 {
1106 /* Nothing below, which means we need to relink map object for this space 995 /* Nothing below, which means we need to relink map object for this space
1107 * use translated coordinates in case some oddness with map tiling is 996 * use translated coordinates in case some oddness with map tiling is
1108 * evident 997 * evident
1109 */ 998 */
1110 if (GET_MAP_OB (m, x, y) != op) 999 if (GET_MAP_OB (map, x, y) != this)
1111 { 1000 {
1112 char *dump = dump_object (op); 1001 char *dump = dump_object (this);
1113 LOG (llevError, 1002 LOG (llevError,
1114 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); 1003 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);
1115 free (dump); 1004 free (dump);
1116 dump = dump_object (GET_MAP_OB (m, x, y)); 1005 dump = dump_object (GET_MAP_OB (map, x, y));
1117 LOG (llevError, "%s\n", dump); 1006 LOG (llevError, "%s\n", dump);
1118 free (dump); 1007 free (dump);
1119 } 1008 }
1120 1009
1121 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ 1010 map->at (x, y).bot = above; /* goes on above it. */
1122 } 1011 }
1123 1012
1124 op->above = 0; 1013 above = 0;
1125 op->below = 0; 1014 below = 0;
1126 1015
1127 if (op->map->in_memory == MAP_SAVING) 1016 if (map->in_memory == MAP_SAVING)
1128 return; 1017 return;
1129 1018
1130 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); 1019 int check_walk_off = !flag [FLAG_NO_APPLY];
1131 1020
1132 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1021 for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above)
1133 { 1022 {
1134 /* No point updating the players look faces if he is the object 1023 /* No point updating the players look faces if he is the object
1135 * being removed. 1024 * being removed.
1136 */ 1025 */
1137 1026
1138 if (tmp->type == PLAYER && tmp != op) 1027 if (tmp->type == PLAYER && tmp != this)
1139 { 1028 {
1140 /* If a container that the player is currently using somehow gets 1029 /* If a container that the player is currently using somehow gets
1141 * removed (most likely destroyed), update the player view 1030 * removed (most likely destroyed), update the player view
1142 * appropriately. 1031 * appropriately.
1143 */ 1032 */
1144 if (tmp->container == op) 1033 if (tmp->container == this)
1145 { 1034 {
1146 CLEAR_FLAG (op, FLAG_APPLIED); 1035 flag [FLAG_APPLIED] = 0;
1147 tmp->container = NULL; 1036 tmp->container = 0;
1148 } 1037 }
1149 1038
1150 tmp->contr->socket.update_look = 1; 1039 if (tmp->contr->ns)
1040 tmp->contr->ns->floorbox_update ();
1151 } 1041 }
1152 1042
1153 /* See if player moving off should effect something */ 1043 /* See if player moving off should effect something */
1154 if (check_walk_off 1044 if (check_walk_off
1155 && ((op->move_type & tmp->move_off) 1045 && ((move_type & tmp->move_off)
1156 && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) 1046 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1157 { 1047 {
1158 move_apply (tmp, op, NULL); 1048 move_apply (tmp, this, 0);
1159 1049
1160 if (op->destroyed ()) 1050 if (destroyed ())
1161 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1051 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1162 } 1052 }
1163 1053
1164 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1054 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1165 1055
1166 if (tmp->above == tmp) 1056 if (tmp->above == tmp)
1167 tmp->above = NULL; 1057 tmp->above = 0;
1168 1058
1169 last = tmp; 1059 last = tmp;
1170 } 1060 }
1171 1061
1172 /* last == NULL of there are no objects on this space */ 1062 /* last == NULL of there are no objects on this space */
1173 if (last == NULL) 1063 if (!last)
1174 { 1064 map->at (x, y).flags_ = P_NEED_UPDATE;
1175 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1176 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1177 * those out anyways, and if there are any flags set right now, they won't
1178 * be correct anyways.
1179 */
1180 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1181 update_position (op->map, op->x, op->y);
1182 }
1183 else 1065 else
1184 update_object (last, UP_OBJ_REMOVE); 1066 update_object (last, UP_OBJ_REMOVE);
1185 1067
1186 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1068 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1187 update_all_los (op->map, op->x, op->y); 1069 update_all_los (map, x, y);
1188 } 1070 }
1189} 1071}
1190 1072
1191/* 1073/*
1192 * merge_ob(op,top): 1074 * merge_ob(op,top):
… …
1200merge_ob (object *op, object *top) 1082merge_ob (object *op, object *top)
1201{ 1083{
1202 if (!op->nrof) 1084 if (!op->nrof)
1203 return 0; 1085 return 0;
1204 1086
1205 if (top == NULL) 1087 if (top)
1206 for (top = op; top != NULL && top->above != NULL; top = top->above); 1088 for (top = op; top && top->above; top = top->above)
1089 ;
1207 1090
1208 for (; top != NULL; top = top->below) 1091 for (; top; top = top->below)
1209 { 1092 {
1210 if (top == op) 1093 if (top == op)
1211 continue; 1094 continue;
1212 if (CAN_MERGE (op, top)) 1095
1096 if (object::can_merge (op, top))
1213 { 1097 {
1214 top->nrof += op->nrof; 1098 top->nrof += op->nrof;
1215 1099
1216/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1100/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1217 op->weight = 0; /* Don't want any adjustements now */ 1101 op->weight = 0; /* Don't want any adjustements now */
1218 remove_ob (op); 1102 op->destroy ();
1219 free_object (op);
1220 return top; 1103 return top;
1221 } 1104 }
1222 } 1105 }
1223 1106
1224 return 0; 1107 return 0;
… …
1229 * job preparing multi-part monsters 1112 * job preparing multi-part monsters
1230 */ 1113 */
1231object * 1114object *
1232insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1115insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1233{ 1116{
1234 object *tmp;
1235
1236 if (op->head)
1237 op = op->head;
1238
1239 for (tmp = op; tmp; tmp = tmp->more) 1117 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1240 { 1118 {
1241 tmp->x = x + tmp->arch->clone.x; 1119 tmp->x = x + tmp->arch->clone.x;
1242 tmp->y = y + tmp->arch->clone.y; 1120 tmp->y = y + tmp->arch->clone.y;
1243 } 1121 }
1244 1122
… …
1263 * Return value: 1141 * Return value:
1264 * new object if 'op' was merged with other object 1142 * new object if 'op' was merged with other object
1265 * NULL if 'op' was destroyed 1143 * NULL if 'op' was destroyed
1266 * just 'op' otherwise 1144 * just 'op' otherwise
1267 */ 1145 */
1268
1269object * 1146object *
1270insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1147insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1271{ 1148{
1272 object *tmp, *top, *floor = NULL; 1149 object *tmp, *top, *floor = NULL;
1273 sint16 x, y; 1150 sint16 x, y;
… …
1307 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); 1184 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1308 free (dump); 1185 free (dump);
1309 return op; 1186 return op;
1310 } 1187 }
1311 1188
1312 if (op->more != NULL) 1189 if (op->more)
1313 { 1190 {
1314 /* The part may be on a different map. */ 1191 /* The part may be on a different map. */
1315 1192
1316 object *more = op->more; 1193 object *more = op->more;
1317 1194
… …
1333 if (insert_ob_in_map (more, more->map, originator, flag) == NULL) 1210 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1334 { 1211 {
1335 if (!op->head) 1212 if (!op->head)
1336 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1213 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1337 1214
1338 return NULL; 1215 return 0;
1339 } 1216 }
1340 } 1217 }
1341 1218
1342 CLEAR_FLAG (op, FLAG_REMOVED); 1219 CLEAR_FLAG (op, FLAG_REMOVED);
1343 1220
… …
1351 1228
1352 /* this has to be done after we translate the coordinates. 1229 /* this has to be done after we translate the coordinates.
1353 */ 1230 */
1354 if (op->nrof && !(flag & INS_NO_MERGE)) 1231 if (op->nrof && !(flag & INS_NO_MERGE))
1355 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1232 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1356 if (CAN_MERGE (op, tmp)) 1233 if (object::can_merge (op, tmp))
1357 { 1234 {
1358 op->nrof += tmp->nrof; 1235 op->nrof += tmp->nrof;
1359 remove_ob (tmp); 1236 tmp->destroy ();
1360 free_object (tmp);
1361 } 1237 }
1362 1238
1363 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1239 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1364 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1240 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1365 1241
… …
1378 op->below = originator->below; 1254 op->below = originator->below;
1379 1255
1380 if (op->below) 1256 if (op->below)
1381 op->below->above = op; 1257 op->below->above = op;
1382 else 1258 else
1383 SET_MAP_OB (op->map, op->x, op->y, op); 1259 op->ms ().bot = op;
1384 1260
1385 /* since *below* originator, no need to update top */ 1261 /* since *below* originator, no need to update top */
1386 originator->below = op; 1262 originator->below = op;
1387 } 1263 }
1388 else 1264 else
… …
1434 * If INS_ON_TOP is used, don't do this processing 1310 * If INS_ON_TOP is used, don't do this processing
1435 * Need to find the object that in fact blocks view, otherwise 1311 * Need to find the object that in fact blocks view, otherwise
1436 * stacking is a bit odd. 1312 * stacking is a bit odd.
1437 */ 1313 */
1438 if (!(flag & INS_ON_TOP) && 1314 if (!(flag & INS_ON_TOP) &&
1439 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) 1315 (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1440 { 1316 {
1441 for (last = top; last != floor; last = last->below) 1317 for (last = top; last != floor; last = last->below)
1442 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1318 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1443 break; 1319 break;
1444 /* Check to see if we found the object that blocks view, 1320 /* Check to see if we found the object that blocks view,
… …
1467 1343
1468 if (op->above) 1344 if (op->above)
1469 op->above->below = op; 1345 op->above->below = op;
1470 1346
1471 op->below = NULL; 1347 op->below = NULL;
1472 SET_MAP_OB (op->map, op->x, op->y, op); 1348 op->ms ().bot = op;
1473 } 1349 }
1474 else 1350 else
1475 { /* get inserted into the stack above top */ 1351 { /* get inserted into the stack above top */
1476 op->above = top->above; 1352 op->above = top->above;
1477 1353
… …
1481 op->below = top; 1357 op->below = top;
1482 top->above = op; 1358 top->above = op;
1483 } 1359 }
1484 1360
1485 if (op->above == NULL) 1361 if (op->above == NULL)
1486 SET_MAP_TOP (op->map, op->x, op->y, op); 1362 op->ms ().top = op;
1487 } /* else not INS_BELOW_ORIGINATOR */ 1363 } /* else not INS_BELOW_ORIGINATOR */
1488 1364
1489 if (op->type == PLAYER) 1365 if (op->type == PLAYER)
1490 op->contr->do_los = 1; 1366 op->contr->do_los = 1;
1491 1367
1492 /* If we have a floor, we know the player, if any, will be above 1368 /* If we have a floor, we know the player, if any, will be above
1493 * it, so save a few ticks and start from there. 1369 * it, so save a few ticks and start from there.
1494 */ 1370 */
1495 if (!(flag & INS_MAP_LOAD)) 1371 if (!(flag & INS_MAP_LOAD))
1496 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1372 if (object *pl = op->ms ().player ())
1497 if (tmp->type == PLAYER) 1373 if (pl->contr->ns)
1498 tmp->contr->socket.update_look = 1; 1374 pl->contr->ns->floorbox_update ();
1499 1375
1500 /* If this object glows, it may affect lighting conditions that are 1376 /* If this object glows, it may affect lighting conditions that are
1501 * visible to others on this map. But update_all_los is really 1377 * visible to others on this map. But update_all_los is really
1502 * an inefficient way to do this, as it means los for all players 1378 * an inefficient way to do this, as it means los for all players
1503 * on the map will get recalculated. The players could very well 1379 * on the map will get recalculated. The players could very well
1504 * be far away from this change and not affected in any way - 1380 * be far away from this change and not affected in any way -
1505 * this should get redone to only look for players within range, 1381 * this should get redone to only look for players within range,
1506 * or just updating the P_NEED_UPDATE for spaces within this area 1382 * or just updating the P_NEED_UPDATE for spaces within this area
1507 * of effect may be sufficient. 1383 * of effect may be sufficient.
1508 */ 1384 */
1509 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1385 if (op->map->darkness && (op->glow_radius != 0))
1510 update_all_los (op->map, op->x, op->y); 1386 update_all_los (op->map, op->x, op->y);
1511 1387
1512 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1388 /* updates flags (blocked, alive, no magic, etc) for this map space */
1513 update_object (op, UP_OBJ_INSERT); 1389 update_object (op, UP_OBJ_INSERT);
1514 1390
1391 INVOKE_OBJECT (INSERT, op);
1392
1515 /* Don't know if moving this to the end will break anything. However, 1393 /* Don't know if moving this to the end will break anything. However,
1516 * we want to have update_look set above before calling this. 1394 * we want to have floorbox_update called before calling this.
1517 * 1395 *
1518 * check_move_on() must be after this because code called from 1396 * check_move_on() must be after this because code called from
1519 * check_move_on() depends on correct map flags (so functions like 1397 * check_move_on() depends on correct map flags (so functions like
1520 * blocked() and wall() work properly), and these flags are updated by 1398 * blocked() and wall() work properly), and these flags are updated by
1521 * update_object(). 1399 * update_object().
… …
1523 1401
1524 /* if this is not the head or flag has been passed, don't check walk on status */ 1402 /* if this is not the head or flag has been passed, don't check walk on status */
1525 if (!(flag & INS_NO_WALK_ON) && !op->head) 1403 if (!(flag & INS_NO_WALK_ON) && !op->head)
1526 { 1404 {
1527 if (check_move_on (op, originator)) 1405 if (check_move_on (op, originator))
1528 return NULL; 1406 return 0;
1529 1407
1530 /* If we are a multi part object, lets work our way through the check 1408 /* If we are a multi part object, lets work our way through the check
1531 * walk on's. 1409 * walk on's.
1532 */ 1410 */
1533 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1411 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1534 if (check_move_on (tmp, originator)) 1412 if (check_move_on (tmp, originator))
1535 return NULL; 1413 return 0;
1536 } 1414 }
1537 1415
1538 return op; 1416 return op;
1539} 1417}
1540 1418
1541/* this function inserts an object in the map, but if it 1419/* this function inserts an object in the map, but if it
1542 * finds an object of its own type, it'll remove that one first. 1420 * finds an object of its own type, it'll remove that one first.
1543 * op is the object to insert it under: supplies x and the map. 1421 * op is the object to insert it under: supplies x and the map.
1544 */ 1422 */
1545void 1423void
1546replace_insert_ob_in_map (const char *arch_string, object *op) 1424replace_insert_ob_in_map (const char *arch_string, object *op)
1547{ 1425{
1548 object * 1426 object *tmp, *tmp1;
1549 tmp;
1550 object *
1551 tmp1;
1552 1427
1553 /* first search for itself and remove any old instances */ 1428 /* first search for itself and remove any old instances */
1554 1429
1555 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1430 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1556 {
1557 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1431 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1558 { 1432 tmp->destroy ();
1559 remove_ob (tmp);
1560 free_object (tmp);
1561 }
1562 }
1563 1433
1564 tmp1 = arch_to_object (archetype::find (arch_string)); 1434 tmp1 = arch_to_object (archetype::find (arch_string));
1565 1435
1566 tmp1->x = op->x; 1436 tmp1->x = op->x;
1567 tmp1->y = op->y; 1437 tmp1->y = op->y;
1568 insert_ob_in_map (tmp1, op->map, op, 0); 1438 insert_ob_in_map (tmp1, op->map, op, 0);
1439}
1440
1441object *
1442object::insert_at (object *where, object *originator, int flags)
1443{
1444 where->map->insert (this, where->x, where->y, originator, flags);
1569} 1445}
1570 1446
1571/* 1447/*
1572 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1448 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1573 * is returned contains nr objects, and the remaining parts contains 1449 * is returned contains nr objects, and the remaining parts contains
1574 * the rest (or is removed and freed if that number is 0). 1450 * the rest (or is removed and freed if that number is 0).
1575 * On failure, NULL is returned, and the reason put into the 1451 * On failure, NULL is returned, and the reason put into the
1576 * global static errmsg array. 1452 * global static errmsg array.
1577 */ 1453 */
1578
1579object * 1454object *
1580get_split_ob (object *orig_ob, uint32 nr) 1455get_split_ob (object *orig_ob, uint32 nr)
1581{ 1456{
1582 object * 1457 object *newob;
1583 newob;
1584 int
1585 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1458 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1586 1459
1587 if (orig_ob->nrof < nr) 1460 if (orig_ob->nrof < nr)
1588 { 1461 {
1589 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1462 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1590 return NULL; 1463 return NULL;
1591 } 1464 }
1592 1465
1593 newob = object_create_clone (orig_ob); 1466 newob = object_create_clone (orig_ob);
1594 1467
1595 if ((orig_ob->nrof -= nr) < 1) 1468 if ((orig_ob->nrof -= nr) < 1)
1596 { 1469 orig_ob->destroy (1);
1597 if (!is_removed)
1598 remove_ob (orig_ob);
1599 free_object2 (orig_ob, 1);
1600 }
1601 else if (!is_removed) 1470 else if (!is_removed)
1602 { 1471 {
1603 if (orig_ob->env != NULL) 1472 if (orig_ob->env != NULL)
1604 sub_weight (orig_ob->env, orig_ob->weight * nr); 1473 sub_weight (orig_ob->env, orig_ob->weight * nr);
1605 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1474 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
… …
1625 1494
1626object * 1495object *
1627decrease_ob_nr (object *op, uint32 i) 1496decrease_ob_nr (object *op, uint32 i)
1628{ 1497{
1629 object *tmp; 1498 object *tmp;
1630 player *pl;
1631 1499
1632 if (i == 0) /* objects with op->nrof require this check */ 1500 if (i == 0) /* objects with op->nrof require this check */
1633 return op; 1501 return op;
1634 1502
1635 if (i > op->nrof) 1503 if (i > op->nrof)
1636 i = op->nrof; 1504 i = op->nrof;
1637 1505
1638 if (QUERY_FLAG (op, FLAG_REMOVED)) 1506 if (QUERY_FLAG (op, FLAG_REMOVED))
1639 op->nrof -= i; 1507 op->nrof -= i;
1640 else if (op->env != NULL) 1508 else if (op->env)
1641 { 1509 {
1642 /* is this object in the players inventory, or sub container 1510 /* is this object in the players inventory, or sub container
1643 * therein? 1511 * therein?
1644 */ 1512 */
1645 tmp = is_player_inv (op->env); 1513 tmp = op->in_player ();
1646 /* nope. Is this a container the player has opened? 1514 /* nope. Is this a container the player has opened?
1647 * If so, set tmp to that player. 1515 * If so, set tmp to that player.
1648 * IMO, searching through all the players will mostly 1516 * IMO, searching through all the players will mostly
1649 * likely be quicker than following op->env to the map, 1517 * likely be quicker than following op->env to the map,
1650 * and then searching the map for a player. 1518 * and then searching the map for a player.
1651 */ 1519 */
1652 if (!tmp) 1520 if (!tmp)
1653 { 1521 for_all_players (pl)
1654 for (pl = first_player; pl; pl = pl->next)
1655 if (pl->ob->container == op->env) 1522 if (pl->ob->container == op->env)
1523 {
1524 tmp = pl->ob;
1656 break; 1525 break;
1657 if (pl)
1658 tmp = pl->ob;
1659 else
1660 tmp = NULL;
1661 } 1526 }
1662 1527
1663 if (i < op->nrof) 1528 if (i < op->nrof)
1664 { 1529 {
1665 sub_weight (op->env, op->weight * i); 1530 sub_weight (op->env, op->weight * i);
1666 op->nrof -= i; 1531 op->nrof -= i;
1667 if (tmp) 1532 if (tmp)
1668 {
1669 esrv_send_item (tmp, op); 1533 esrv_send_item (tmp, op);
1670 }
1671 } 1534 }
1672 else 1535 else
1673 { 1536 {
1674 remove_ob (op); 1537 op->remove ();
1675 op->nrof = 0; 1538 op->nrof = 0;
1676 if (tmp) 1539 if (tmp)
1677 {
1678 esrv_del_item (tmp->contr, op->count); 1540 esrv_del_item (tmp->contr, op->count);
1679 }
1680 } 1541 }
1681 } 1542 }
1682 else 1543 else
1683 { 1544 {
1684 object *above = op->above; 1545 object *above = op->above;
1685 1546
1686 if (i < op->nrof) 1547 if (i < op->nrof)
1687 op->nrof -= i; 1548 op->nrof -= i;
1688 else 1549 else
1689 { 1550 {
1690 remove_ob (op); 1551 op->remove ();
1691 op->nrof = 0; 1552 op->nrof = 0;
1692 } 1553 }
1693 1554
1694 /* Since we just removed op, op->above is null */ 1555 /* Since we just removed op, op->above is null */
1695 for (tmp = above; tmp != NULL; tmp = tmp->above) 1556 for (tmp = above; tmp; tmp = tmp->above)
1696 if (tmp->type == PLAYER) 1557 if (tmp->type == PLAYER)
1697 { 1558 {
1698 if (op->nrof) 1559 if (op->nrof)
1699 esrv_send_item (tmp, op); 1560 esrv_send_item (tmp, op);
1700 else 1561 else
… …
1704 1565
1705 if (op->nrof) 1566 if (op->nrof)
1706 return op; 1567 return op;
1707 else 1568 else
1708 { 1569 {
1709 free_object (op); 1570 op->destroy ();
1710 return NULL; 1571 return 0;
1711 } 1572 }
1712} 1573}
1713 1574
1714/* 1575/*
1715 * add_weight(object, weight) adds the specified weight to an object, 1576 * add_weight(object, weight) adds the specified weight to an object,
… …
1727 op->carrying += weight; 1588 op->carrying += weight;
1728 op = op->env; 1589 op = op->env;
1729 } 1590 }
1730} 1591}
1731 1592
1732/*
1733 * insert_ob_in_ob(op,environment):
1734 * This function inserts the object op in the linked list
1735 * inside the object environment.
1736 *
1737 * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1738 * the inventory at the last position or next to other objects of the same
1739 * type.
1740 * Frank: Now sorted by type, archetype and magic!
1741 *
1742 * The function returns now pointer to inserted item, and return value can
1743 * be != op, if items are merged. -Tero
1744 */
1745
1746object * 1593object *
1747insert_ob_in_ob (object *op, object *where) 1594insert_ob_in_ob (object *op, object *where)
1748{ 1595{
1749 object * 1596 if (!where)
1750 tmp, *
1751 otmp;
1752
1753 if (!QUERY_FLAG (op, FLAG_REMOVED))
1754 {
1755 char *dump = dump_object (op);
1756 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", dump);
1757 free (dump);
1758 return op;
1759 }
1760
1761 if (where == NULL)
1762 { 1597 {
1763 char *dump = dump_object (op); 1598 char *dump = dump_object (op);
1764 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1599 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1765 free (dump); 1600 free (dump);
1766 return op; 1601 return op;
1767 } 1602 }
1768 1603
1769 if (where->head) 1604 if (where->head)
1770 { 1605 {
1771 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); 1606 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1772 where = where->head; 1607 where = where->head;
1773 } 1608 }
1609
1610 return where->insert (op);
1611}
1612
1613/*
1614 * env->insert (op)
1615 * This function inserts the object op in the linked list
1616 * inside the object environment.
1617 *
1618 * The function returns now pointer to inserted item, and return value can
1619 * be != op, if items are merged. -Tero
1620 */
1621
1622object *
1623object::insert (object *op)
1624{
1625 object *tmp, *otmp;
1626
1627 if (!QUERY_FLAG (op, FLAG_REMOVED))
1628 op->remove ();
1774 1629
1775 if (op->more) 1630 if (op->more)
1776 { 1631 {
1777 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1632 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1778 return op; 1633 return op;
… …
1780 1635
1781 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1636 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1782 CLEAR_FLAG (op, FLAG_REMOVED); 1637 CLEAR_FLAG (op, FLAG_REMOVED);
1783 if (op->nrof) 1638 if (op->nrof)
1784 { 1639 {
1785 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1640 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1786 if (CAN_MERGE (tmp, op)) 1641 if (object::can_merge (tmp, op))
1787 { 1642 {
1788 /* return the original object and remove inserted object 1643 /* return the original object and remove inserted object
1789 (client needs the original object) */ 1644 (client needs the original object) */
1790 tmp->nrof += op->nrof; 1645 tmp->nrof += op->nrof;
1791 /* Weight handling gets pretty funky. Since we are adding to 1646 /* Weight handling gets pretty funky. Since we are adding to
1792 * tmp->nrof, we need to increase the weight. 1647 * tmp->nrof, we need to increase the weight.
1793 */ 1648 */
1794 add_weight (where, op->weight * op->nrof); 1649 add_weight (this, op->weight * op->nrof);
1795 SET_FLAG (op, FLAG_REMOVED); 1650 SET_FLAG (op, FLAG_REMOVED);
1796 free_object (op); /* free the inserted object */ 1651 op->destroy (); /* free the inserted object */
1797 op = tmp; 1652 op = tmp;
1798 remove_ob (op); /* and fix old object's links */ 1653 op->remove (); /* and fix old object's links */
1799 CLEAR_FLAG (op, FLAG_REMOVED); 1654 CLEAR_FLAG (op, FLAG_REMOVED);
1800 break; 1655 break;
1801 } 1656 }
1802 1657
1803 /* I assume combined objects have no inventory 1658 /* I assume combined objects have no inventory
1804 * We add the weight - this object could have just been removed 1659 * We add the weight - this object could have just been removed
1805 * (if it was possible to merge). calling remove_ob will subtract 1660 * (if it was possible to merge). calling remove_ob will subtract
1806 * the weight, so we need to add it in again, since we actually do 1661 * the weight, so we need to add it in again, since we actually do
1807 * the linking below 1662 * the linking below
1808 */ 1663 */
1809 add_weight (where, op->weight * op->nrof); 1664 add_weight (this, op->weight * op->nrof);
1810 } 1665 }
1811 else 1666 else
1812 add_weight (where, (op->weight + op->carrying)); 1667 add_weight (this, (op->weight + op->carrying));
1813 1668
1814 otmp = is_player_inv (where); 1669 otmp = this->in_player ();
1815 if (otmp && otmp->contr != NULL) 1670 if (otmp && otmp->contr)
1816 {
1817 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1671 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1818 fix_player (otmp); 1672 otmp->update_stats ();
1819 }
1820 1673
1821 op->map = NULL; 1674 op->map = 0;
1822 op->env = where; 1675 op->env = this;
1823 op->above = NULL; 1676 op->above = 0;
1824 op->below = NULL; 1677 op->below = 0;
1825 op->x = 0, op->y = 0; 1678 op->x = 0, op->y = 0;
1826 1679
1827 /* reset the light list and los of the players on the map */ 1680 /* reset the light list and los of the players on the map */
1828 if ((op->glow_radius != 0) && where->map) 1681 if ((op->glow_radius != 0) && map)
1829 { 1682 {
1830#ifdef DEBUG_LIGHTS 1683#ifdef DEBUG_LIGHTS
1831 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1684 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1832#endif /* DEBUG_LIGHTS */ 1685#endif /* DEBUG_LIGHTS */
1833 if (MAP_DARKNESS (where->map)) 1686 if (map->darkness)
1834 update_all_los (where->map, where->x, where->y); 1687 update_all_los (map, x, y);
1835 } 1688 }
1836 1689
1837 /* Client has no idea of ordering so lets not bother ordering it here. 1690 /* Client has no idea of ordering so lets not bother ordering it here.
1838 * It sure simplifies this function... 1691 * It sure simplifies this function...
1839 */ 1692 */
1840 if (where->inv == NULL) 1693 if (!inv)
1841 where->inv = op; 1694 inv = op;
1842 else 1695 else
1843 { 1696 {
1844 op->below = where->inv; 1697 op->below = inv;
1845 op->below->above = op; 1698 op->below->above = op;
1846 where->inv = op; 1699 inv = op;
1847 } 1700 }
1701
1702 INVOKE_OBJECT (INSERT, this);
1703
1848 return op; 1704 return op;
1849} 1705}
1850 1706
1851/* 1707/*
1852 * Checks if any objects has a move_type that matches objects 1708 * Checks if any objects has a move_type that matches objects
… …
1866 * 1722 *
1867 * MSW 2001-07-08: Check all objects on space, not just those below 1723 * MSW 2001-07-08: Check all objects on space, not just those below
1868 * object being inserted. insert_ob_in_map may not put new objects 1724 * object being inserted. insert_ob_in_map may not put new objects
1869 * on top. 1725 * on top.
1870 */ 1726 */
1871
1872int 1727int
1873check_move_on (object *op, object *originator) 1728check_move_on (object *op, object *originator)
1874{ 1729{
1875 object *tmp; 1730 object *tmp;
1876 maptile *m = op->map; 1731 maptile *m = op->map;
… …
1903 1758
1904 /* The objects have to be checked from top to bottom. 1759 /* The objects have to be checked from top to bottom.
1905 * Hence, we first go to the top: 1760 * Hence, we first go to the top:
1906 */ 1761 */
1907 1762
1908 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1763 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above)
1909 { 1764 {
1910 /* Trim the search when we find the first other spell effect 1765 /* Trim the search when we find the first other spell effect
1911 * this helps performance so that if a space has 50 spell objects, 1766 * this helps performance so that if a space has 50 spell objects,
1912 * we don't need to check all of them. 1767 * we don't need to check all of them.
1913 */ 1768 */
… …
1968/* 1823/*
1969 * present_arch(arch, map, x, y) searches for any objects with 1824 * present_arch(arch, map, x, y) searches for any objects with
1970 * a matching archetype at the given map and coordinates. 1825 * a matching archetype at the given map and coordinates.
1971 * The first matching object is returned, or NULL if none. 1826 * The first matching object is returned, or NULL if none.
1972 */ 1827 */
1973
1974object * 1828object *
1975present_arch (const archetype *at, maptile *m, int x, int y) 1829present_arch (const archetype *at, maptile *m, int x, int y)
1976{ 1830{
1977 object *
1978 tmp;
1979
1980 if (m == NULL || out_of_map (m, x, y)) 1831 if (m == NULL || out_of_map (m, x, y))
1981 { 1832 {
1982 LOG (llevError, "Present_arch called outside map.\n"); 1833 LOG (llevError, "Present_arch called outside map.\n");
1983 return NULL; 1834 return NULL;
1984 } 1835 }
1836
1985 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1837 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1986 if (tmp->arch == at) 1838 if (tmp->arch == at)
1987 return tmp; 1839 return tmp;
1840
1988 return NULL; 1841 return NULL;
1989} 1842}
1990 1843
1991/* 1844/*
1992 * present(type, map, x, y) searches for any objects with 1845 * present(type, map, x, y) searches for any objects with
1993 * a matching type variable at the given map and coordinates. 1846 * a matching type variable at the given map and coordinates.
1994 * The first matching object is returned, or NULL if none. 1847 * The first matching object is returned, or NULL if none.
1995 */ 1848 */
1996
1997object * 1849object *
1998present (unsigned char type, maptile *m, int x, int y) 1850present (unsigned char type, maptile *m, int x, int y)
1999{ 1851{
2000 object *
2001 tmp;
2002
2003 if (out_of_map (m, x, y)) 1852 if (out_of_map (m, x, y))
2004 { 1853 {
2005 LOG (llevError, "Present called outside map.\n"); 1854 LOG (llevError, "Present called outside map.\n");
2006 return NULL; 1855 return NULL;
2007 } 1856 }
1857
2008 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1858 for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
2009 if (tmp->type == type) 1859 if (tmp->type == type)
2010 return tmp; 1860 return tmp;
1861
2011 return NULL; 1862 return NULL;
2012} 1863}
2013 1864
2014/* 1865/*
2015 * present_in_ob(type, object) searches for any objects with 1866 * present_in_ob(type, object) searches for any objects with
2016 * a matching type variable in the inventory of the given object. 1867 * a matching type variable in the inventory of the given object.
2017 * The first matching object is returned, or NULL if none. 1868 * The first matching object is returned, or NULL if none.
2018 */ 1869 */
2019
2020object * 1870object *
2021present_in_ob (unsigned char type, const object *op) 1871present_in_ob (unsigned char type, const object *op)
2022{ 1872{
2023 object *
2024 tmp;
2025
2026 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1873 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2027 if (tmp->type == type) 1874 if (tmp->type == type)
2028 return tmp; 1875 return tmp;
1876
2029 return NULL; 1877 return NULL;
2030} 1878}
2031 1879
2032/* 1880/*
2033 * present_in_ob (type, str, object) searches for any objects with 1881 * present_in_ob (type, str, object) searches for any objects with
… …
2041 * str is the string to match against. Note that we match against 1889 * str is the string to match against. Note that we match against
2042 * the object name, not the archetype name. this is so that the 1890 * the object name, not the archetype name. this is so that the
2043 * spell code can use one object type (force), but change it's name 1891 * spell code can use one object type (force), but change it's name
2044 * to be unique. 1892 * to be unique.
2045 */ 1893 */
2046
2047object * 1894object *
2048present_in_ob_by_name (int type, const char *str, const object *op) 1895present_in_ob_by_name (int type, const char *str, const object *op)
2049{ 1896{
2050 object *
2051 tmp;
2052
2053 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1897 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2054 {
2055 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1898 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2056 return tmp; 1899 return tmp;
2057 } 1900
2058 return NULL; 1901 return 0;
2059} 1902}
2060 1903
2061/* 1904/*
2062 * present_arch_in_ob(archetype, object) searches for any objects with 1905 * present_arch_in_ob(archetype, object) searches for any objects with
2063 * a matching archetype in the inventory of the given object. 1906 * a matching archetype in the inventory of the given object.
2064 * The first matching object is returned, or NULL if none. 1907 * The first matching object is returned, or NULL if none.
2065 */ 1908 */
2066
2067object * 1909object *
2068present_arch_in_ob (const archetype *at, const object *op) 1910present_arch_in_ob (const archetype *at, const object *op)
2069{ 1911{
2070 object *
2071 tmp;
2072
2073 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1912 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2074 if (tmp->arch == at) 1913 if (tmp->arch == at)
2075 return tmp; 1914 return tmp;
1915
2076 return NULL; 1916 return NULL;
2077} 1917}
2078 1918
2079/* 1919/*
2080 * activate recursively a flag on an object inventory 1920 * activate recursively a flag on an object inventory
2081 */ 1921 */
2082void 1922void
2083flag_inv (object *op, int flag) 1923flag_inv (object *op, int flag)
2084{ 1924{
2085 object *
2086 tmp;
2087
2088 if (op->inv) 1925 if (op->inv)
2089 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1926 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2090 { 1927 {
2091 SET_FLAG (tmp, flag); 1928 SET_FLAG (tmp, flag);
2092 flag_inv (tmp, flag); 1929 flag_inv (tmp, flag);
2093 } 1930 }
2094} /* 1931}
1932
1933/*
2095 * desactivate recursively a flag on an object inventory 1934 * deactivate recursively a flag on an object inventory
2096 */ 1935 */
2097void 1936void
2098unflag_inv (object *op, int flag) 1937unflag_inv (object *op, int flag)
2099{ 1938{
2100 object *
2101 tmp;
2102
2103 if (op->inv) 1939 if (op->inv)
2104 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1940 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2105 { 1941 {
2106 CLEAR_FLAG (tmp, flag); 1942 CLEAR_FLAG (tmp, flag);
2107 unflag_inv (tmp, flag); 1943 unflag_inv (tmp, flag);
2108 } 1944 }
2109} 1945}
… …
2112 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 1948 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2113 * all it's inventory (recursively). 1949 * all it's inventory (recursively).
2114 * If checksums are used, a player will get set_cheat called for 1950 * If checksums are used, a player will get set_cheat called for
2115 * him/her-self and all object carried by a call to this function. 1951 * him/her-self and all object carried by a call to this function.
2116 */ 1952 */
2117
2118void 1953void
2119set_cheat (object *op) 1954set_cheat (object *op)
2120{ 1955{
2121 SET_FLAG (op, FLAG_WAS_WIZ); 1956 SET_FLAG (op, FLAG_WAS_WIZ);
2122 flag_inv (op, FLAG_WAS_WIZ); 1957 flag_inv (op, FLAG_WAS_WIZ);
… …
2141 * because arch_blocked (now ob_blocked) needs to know the movement type 1976 * because arch_blocked (now ob_blocked) needs to know the movement type
2142 * to know if the space in question will block the object. We can't use 1977 * to know if the space in question will block the object. We can't use
2143 * the archetype because that isn't correct if the monster has been 1978 * the archetype because that isn't correct if the monster has been
2144 * customized, changed states, etc. 1979 * customized, changed states, etc.
2145 */ 1980 */
2146
2147int 1981int
2148find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 1982find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2149{ 1983{
2150 int
2151 i,
2152 index = 0, flag; 1984 int index = 0, flag;
2153 static int
2154 altern[SIZEOFFREE]; 1985 int altern[SIZEOFFREE];
2155 1986
2156 for (i = start; i < stop; i++) 1987 for (int i = start; i < stop; i++)
2157 { 1988 {
2158 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 1989 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2159 if (!flag) 1990 if (!flag)
2160 altern[index++] = i; 1991 altern [index++] = i;
2161 1992
2162 /* Basically, if we find a wall on a space, we cut down the search size. 1993 /* Basically, if we find a wall on a space, we cut down the search size.
2163 * In this way, we won't return spaces that are on another side of a wall. 1994 * In this way, we won't return spaces that are on another side of a wall.
2164 * This mostly work, but it cuts down the search size in all directions - 1995 * This mostly work, but it cuts down the search size in all directions -
2165 * if the space being examined only has a wall to the north and empty 1996 * if the space being examined only has a wall to the north and empty
2166 * spaces in all the other directions, this will reduce the search space 1997 * spaces in all the other directions, this will reduce the search space
2167 * to only the spaces immediately surrounding the target area, and 1998 * to only the spaces immediately surrounding the target area, and
2168 * won't look 2 spaces south of the target space. 1999 * won't look 2 spaces south of the target space.
2169 */ 2000 */
2170 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 2001 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2171 stop = maxfree[i]; 2002 stop = maxfree[i];
2172 } 2003 }
2004
2173 if (!index) 2005 if (!index)
2174 return -1; 2006 return -1;
2007
2175 return altern[RANDOM () % index]; 2008 return altern[RANDOM () % index];
2176} 2009}
2177 2010
2178/* 2011/*
2179 * find_first_free_spot(archetype, maptile, x, y) works like 2012 * find_first_free_spot(archetype, maptile, x, y) works like
2180 * find_free_spot(), but it will search max number of squares. 2013 * find_free_spot(), but it will search max number of squares.
2181 * But it will return the first available spot, not a random choice. 2014 * But it will return the first available spot, not a random choice.
2182 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2015 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2183 */ 2016 */
2184
2185int 2017int
2186find_first_free_spot (const object *ob, maptile *m, int x, int y) 2018find_first_free_spot (const object *ob, maptile *m, int x, int y)
2187{ 2019{
2188 int
2189 i;
2190
2191 for (i = 0; i < SIZEOFFREE; i++) 2020 for (int i = 0; i < SIZEOFFREE; i++)
2192 {
2193 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2021 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2194 return i; 2022 return i;
2195 } 2023
2196 return -1; 2024 return -1;
2197} 2025}
2198 2026
2199/* 2027/*
2200 * The function permute(arr, begin, end) randomly reorders the array 2028 * The function permute(arr, begin, end) randomly reorders the array
2201 * arr[begin..end-1]. 2029 * arr[begin..end-1].
2030 * now uses a fisher-yates shuffle, old permute was broken
2202 */ 2031 */
2203static void 2032static void
2204permute (int *arr, int begin, int end) 2033permute (int *arr, int begin, int end)
2205{ 2034{
2206 int 2035 arr += begin;
2207 i,
2208 j,
2209 tmp,
2210 len;
2211
2212 len = end - begin; 2036 end -= begin;
2213 for (i = begin; i < end; i++)
2214 {
2215 j = begin + RANDOM () % len;
2216 2037
2217 tmp = arr[i]; 2038 while (--end)
2218 arr[i] = arr[j]; 2039 swap (arr [end], arr [RANDOM () % (end + 1)]);
2219 arr[j] = tmp;
2220 }
2221} 2040}
2222 2041
2223/* new function to make monster searching more efficient, and effective! 2042/* new function to make monster searching more efficient, and effective!
2224 * This basically returns a randomized array (in the passed pointer) of 2043 * This basically returns a randomized array (in the passed pointer) of
2225 * the spaces to find monsters. In this way, it won't always look for 2044 * the spaces to find monsters. In this way, it won't always look for
… …
2228 * the 3x3 area will be searched, just not in a predictable order. 2047 * the 3x3 area will be searched, just not in a predictable order.
2229 */ 2048 */
2230void 2049void
2231get_search_arr (int *search_arr) 2050get_search_arr (int *search_arr)
2232{ 2051{
2233 int 2052 int i;
2234 i;
2235 2053
2236 for (i = 0; i < SIZEOFFREE; i++) 2054 for (i = 0; i < SIZEOFFREE; i++)
2237 {
2238 search_arr[i] = i; 2055 search_arr[i] = i;
2239 }
2240 2056
2241 permute (search_arr, 1, SIZEOFFREE1 + 1); 2057 permute (search_arr, 1, SIZEOFFREE1 + 1);
2242 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2058 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2243 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2059 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2244} 2060}
… …
2253 * Perhaps incorrectly, but I'm making the assumption that exclude 2069 * Perhaps incorrectly, but I'm making the assumption that exclude
2254 * is actually want is going to try and move there. We need this info 2070 * is actually want is going to try and move there. We need this info
2255 * because we have to know what movement the thing looking to move 2071 * because we have to know what movement the thing looking to move
2256 * there is capable of. 2072 * there is capable of.
2257 */ 2073 */
2258
2259int 2074int
2260find_dir (maptile *m, int x, int y, object *exclude) 2075find_dir (maptile *m, int x, int y, object *exclude)
2261{ 2076{
2262 int
2263 i,
2264 max = SIZEOFFREE, mflags; 2077 int i, max = SIZEOFFREE, mflags;
2265 2078
2266 sint16 nx, ny; 2079 sint16 nx, ny;
2267 object * 2080 object *tmp;
2268 tmp;
2269 maptile * 2081 maptile *mp;
2270 mp;
2271 2082
2272 MoveType blocked, move_type; 2083 MoveType blocked, move_type;
2273 2084
2274 if (exclude && exclude->head) 2085 if (exclude && exclude->head)
2275 { 2086 {
… …
2287 mp = m; 2098 mp = m;
2288 nx = x + freearr_x[i]; 2099 nx = x + freearr_x[i];
2289 ny = y + freearr_y[i]; 2100 ny = y + freearr_y[i];
2290 2101
2291 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2102 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2103
2292 if (mflags & P_OUT_OF_MAP) 2104 if (mflags & P_OUT_OF_MAP)
2293 {
2294 max = maxfree[i]; 2105 max = maxfree[i];
2295 }
2296 else 2106 else
2297 { 2107 {
2298 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2108 mapspace &ms = mp->at (nx, ny);
2109
2110 blocked = ms.move_block;
2299 2111
2300 if ((move_type & blocked) == move_type) 2112 if ((move_type & blocked) == move_type)
2301 {
2302 max = maxfree[i]; 2113 max = maxfree[i];
2303 }
2304 else if (mflags & P_IS_ALIVE) 2114 else if (mflags & P_IS_ALIVE)
2305 { 2115 {
2306 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2116 for (tmp = ms.bot; tmp; tmp = tmp->above)
2307 { 2117 if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER)
2308 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) 2118 && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2309 {
2310 break; 2119 break;
2311 } 2120
2312 }
2313 if (tmp) 2121 if (tmp)
2314 {
2315 return freedir[i]; 2122 return freedir[i];
2316 }
2317 } 2123 }
2318 } 2124 }
2319 } 2125 }
2126
2320 return 0; 2127 return 0;
2321} 2128}
2322 2129
2323/* 2130/*
2324 * distance(object 1, object 2) will return the square of the 2131 * distance(object 1, object 2) will return the square of the
2325 * distance between the two given objects. 2132 * distance between the two given objects.
2326 */ 2133 */
2327
2328int 2134int
2329distance (const object *ob1, const object *ob2) 2135distance (const object *ob1, const object *ob2)
2330{ 2136{
2331 int
2332 i;
2333
2334 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2137 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2335 return i;
2336} 2138}
2337 2139
2338/* 2140/*
2339 * find_dir_2(delta-x,delta-y) will return a direction in which 2141 * find_dir_2(delta-x,delta-y) will return a direction in which
2340 * an object which has subtracted the x and y coordinates of another 2142 * an object which has subtracted the x and y coordinates of another
2341 * object, needs to travel toward it. 2143 * object, needs to travel toward it.
2342 */ 2144 */
2343
2344int 2145int
2345find_dir_2 (int x, int y) 2146find_dir_2 (int x, int y)
2346{ 2147{
2347 int 2148 int q;
2348 q;
2349 2149
2350 if (y) 2150 if (y)
2351 q = x * 100 / y; 2151 q = x * 100 / y;
2352 else if (x) 2152 else if (x)
2353 q = -300 * x; 2153 q = -300 * x;
… …
2388int 2188int
2389absdir (int d) 2189absdir (int d)
2390{ 2190{
2391 while (d < 1) 2191 while (d < 1)
2392 d += 8; 2192 d += 8;
2193
2393 while (d > 8) 2194 while (d > 8)
2394 d -= 8; 2195 d -= 8;
2196
2395 return d; 2197 return d;
2396} 2198}
2397 2199
2398/* 2200/*
2399 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2201 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
… …
2401 */ 2203 */
2402 2204
2403int 2205int
2404dirdiff (int dir1, int dir2) 2206dirdiff (int dir1, int dir2)
2405{ 2207{
2406 int 2208 int d;
2407 d;
2408 2209
2409 d = abs (dir1 - dir2); 2210 d = abs (dir1 - dir2);
2410 if (d > 4) 2211 if (d > 4)
2411 d = 8 - d; 2212 d = 8 - d;
2213
2412 return d; 2214 return d;
2413} 2215}
2414 2216
2415/* peterm: 2217/* peterm:
2416 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2218 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster.
… …
2419 * This basically means that if direction is 15, then it could either go 2221 * This basically means that if direction is 15, then it could either go
2420 * direction 4, 14, or 16 to get back to where we are. 2222 * direction 4, 14, or 16 to get back to where we are.
2421 * Moved from spell_util.c to object.c with the other related direction 2223 * Moved from spell_util.c to object.c with the other related direction
2422 * functions. 2224 * functions.
2423 */ 2225 */
2424
2425int
2426 reduction_dir[SIZEOFFREE][3] = { 2226int reduction_dir[SIZEOFFREE][3] = {
2427 {0, 0, 0}, /* 0 */ 2227 {0, 0, 0}, /* 0 */
2428 {0, 0, 0}, /* 1 */ 2228 {0, 0, 0}, /* 1 */
2429 {0, 0, 0}, /* 2 */ 2229 {0, 0, 0}, /* 2 */
2430 {0, 0, 0}, /* 3 */ 2230 {0, 0, 0}, /* 3 */
2431 {0, 0, 0}, /* 4 */ 2231 {0, 0, 0}, /* 4 */
… …
2479 * find a path to that monster that we found. If not, 2279 * find a path to that monster that we found. If not,
2480 * we don't bother going toward it. Returns 1 if we 2280 * we don't bother going toward it. Returns 1 if we
2481 * can see a direct way to get it 2281 * can see a direct way to get it
2482 * Modified to be map tile aware -.MSW 2282 * Modified to be map tile aware -.MSW
2483 */ 2283 */
2484
2485
2486int 2284int
2487can_see_monsterP (maptile *m, int x, int y, int dir) 2285can_see_monsterP (maptile *m, int x, int y, int dir)
2488{ 2286{
2489 sint16 dx, dy; 2287 sint16 dx, dy;
2490 int
2491 mflags; 2288 int mflags;
2492 2289
2493 if (dir < 0) 2290 if (dir < 0)
2494 return 0; /* exit condition: invalid direction */ 2291 return 0; /* exit condition: invalid direction */
2495 2292
2496 dx = x + freearr_x[dir]; 2293 dx = x + freearr_x[dir];
… …
2509 return 0; 2306 return 0;
2510 2307
2511 /* yes, can see. */ 2308 /* yes, can see. */
2512 if (dir < 9) 2309 if (dir < 9)
2513 return 1; 2310 return 1;
2311
2514 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2312 return can_see_monsterP (m, x, y, reduction_dir[dir][0])
2515 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); 2313 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2314 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2516} 2315}
2517
2518
2519 2316
2520/* 2317/*
2521 * can_pick(picker, item): finds out if an object is possible to be 2318 * can_pick(picker, item): finds out if an object is possible to be
2522 * picked up by the picker. Returnes 1 if it can be 2319 * picked up by the picker. Returnes 1 if it can be
2523 * picked up, otherwise 0. 2320 * picked up, otherwise 0.
… …
2534 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2331 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2535 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2332 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2536 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); 2333 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2537} 2334}
2538 2335
2539
2540/* 2336/*
2541 * create clone from object to another 2337 * create clone from object to another
2542 */ 2338 */
2543object * 2339object *
2544object_create_clone (object *asrc) 2340object_create_clone (object *asrc)
2545{ 2341{
2546 object *
2547 dst = NULL, *tmp, *src, *part, *prev, *item; 2342 object *dst = 0, *tmp, *src, *part, *prev, *item;
2548 2343
2549 if (!asrc) 2344 if (!asrc)
2550 return NULL; 2345 return 0;
2346
2551 src = asrc; 2347 src = asrc;
2552 if (src->head) 2348 if (src->head)
2553 src = src->head; 2349 src = src->head;
2554 2350
2555 prev = NULL; 2351 prev = 0;
2556 for (part = src; part; part = part->more) 2352 for (part = src; part; part = part->more)
2557 { 2353 {
2558 tmp = get_object (); 2354 tmp = part->clone ();
2559 copy_object (part, tmp);
2560 tmp->x -= src->x; 2355 tmp->x -= src->x;
2561 tmp->y -= src->y; 2356 tmp->y -= src->y;
2357
2562 if (!part->head) 2358 if (!part->head)
2563 { 2359 {
2564 dst = tmp; 2360 dst = tmp;
2565 tmp->head = NULL; 2361 tmp->head = 0;
2566 } 2362 }
2567 else 2363 else
2568 {
2569 tmp->head = dst; 2364 tmp->head = dst;
2570 } 2365
2571 tmp->more = NULL; 2366 tmp->more = 0;
2367
2572 if (prev) 2368 if (prev)
2573 prev->more = tmp; 2369 prev->more = tmp;
2370
2574 prev = tmp; 2371 prev = tmp;
2575 } 2372 }
2576 2373
2577 for (item = src->inv; item; item = item->below) 2374 for (item = src->inv; item; item = item->below)
2578 insert_ob_in_ob (object_create_clone (item), dst); 2375 insert_ob_in_ob (object_create_clone (item), dst);
… …
2584/* Basically, we save the content of the string to a temp file, then call */ 2381/* Basically, we save the content of the string to a temp file, then call */
2585/* load_object on it. I admit it is a highly inefficient way to make things, */ 2382/* load_object on it. I admit it is a highly inefficient way to make things, */
2586/* but it was simple to make and allows reusing the load_object function. */ 2383/* but it was simple to make and allows reusing the load_object function. */
2587/* Remember not to use load_object_str in a time-critical situation. */ 2384/* Remember not to use load_object_str in a time-critical situation. */
2588/* Also remember that multiparts objects are not supported for now. */ 2385/* Also remember that multiparts objects are not supported for now. */
2589
2590object * 2386object *
2591load_object_str (const char *obstr) 2387load_object_str (const char *obstr)
2592{ 2388{
2593 object *op; 2389 object *op;
2594 char filename[MAX_BUF]; 2390 char filename[MAX_BUF];
… …
2604 } 2400 }
2605 2401
2606 fprintf (tempfile, obstr); 2402 fprintf (tempfile, obstr);
2607 fclose (tempfile); 2403 fclose (tempfile);
2608 2404
2609 op = get_object (); 2405 op = object::create ();
2610 2406
2611 object_thawer thawer (filename); 2407 object_thawer thawer (filename);
2612 2408
2613 if (thawer) 2409 if (thawer)
2614 load_object (thawer, op, 0); 2410 load_object (thawer, op, 0);
… …
2624 * returns NULL if no match. 2420 * returns NULL if no match.
2625 */ 2421 */
2626object * 2422object *
2627find_obj_by_type_subtype (const object *who, int type, int subtype) 2423find_obj_by_type_subtype (const object *who, int type, int subtype)
2628{ 2424{
2629 object *tmp;
2630
2631 for (tmp = who->inv; tmp; tmp = tmp->below) 2425 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2632 if (tmp->type == type && tmp->subtype == subtype) 2426 if (tmp->type == type && tmp->subtype == subtype)
2633 return tmp; 2427 return tmp;
2634 2428
2635 return NULL; 2429 return 0;
2636} 2430}
2637 2431
2638/* If ob has a field named key, return the link from the list, 2432/* If ob has a field named key, return the link from the list,
2639 * otherwise return NULL. 2433 * otherwise return NULL.
2640 * 2434 *
… …
2642 * do the desired thing. 2436 * do the desired thing.
2643 */ 2437 */
2644key_value * 2438key_value *
2645get_ob_key_link (const object *ob, const char *key) 2439get_ob_key_link (const object *ob, const char *key)
2646{ 2440{
2647 key_value *link;
2648
2649 for (link = ob->key_values; link != NULL; link = link->next) 2441 for (key_value *link = ob->key_values; link; link = link->next)
2650 if (link->key == key) 2442 if (link->key == key)
2651 return link; 2443 return link;
2652 2444
2653 return NULL; 2445 return 0;
2654} 2446}
2655 2447
2656/* 2448/*
2657 * Returns the value of op has an extra_field for key, or NULL. 2449 * Returns the value of op has an extra_field for key, or NULL.
2658 * 2450 *
… …
2698 * Returns TRUE on success. 2490 * Returns TRUE on success.
2699 */ 2491 */
2700int 2492int
2701set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) 2493set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2702{ 2494{
2703 key_value *
2704 field = NULL, *last = NULL; 2495 key_value *field = NULL, *last = NULL;
2705 2496
2706 for (field = op->key_values; field != NULL; field = field->next) 2497 for (field = op->key_values; field != NULL; field = field->next)
2707 { 2498 {
2708 if (field->key != canonical_key) 2499 if (field->key != canonical_key)
2709 { 2500 {
… …
2737 /* IF we get here, key doesn't exist */ 2528 /* IF we get here, key doesn't exist */
2738 2529
2739 /* No field, we'll have to add it. */ 2530 /* No field, we'll have to add it. */
2740 2531
2741 if (!add_key) 2532 if (!add_key)
2742 {
2743 return FALSE; 2533 return FALSE;
2744 } 2534
2745 /* There isn't any good reason to store a null 2535 /* There isn't any good reason to store a null
2746 * value in the key/value list. If the archetype has 2536 * value in the key/value list. If the archetype has
2747 * this key, then we should also have it, so shouldn't 2537 * this key, then we should also have it, so shouldn't
2748 * be here. If user wants to store empty strings, 2538 * be here. If user wants to store empty strings,
2749 * should pass in "" 2539 * should pass in ""

Diff Legend

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