… | |
… | |
141 | * 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 |
142 | * different structure or at least keep the lists sorted... |
142 | * different structure or at least keep the lists sorted... |
143 | */ |
143 | */ |
144 | |
144 | |
145 | /* For each field in wants, */ |
145 | /* For each field in wants, */ |
146 | 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) |
147 | { |
147 | { |
148 | key_value *has_field; |
148 | key_value *has_field; |
149 | |
149 | |
150 | /* Look for a field in has with the same key. */ |
150 | /* Look for a field in has with the same key. */ |
151 | has_field = get_ob_key_link (has, wants_field->key); |
151 | has_field = get_ob_key_link (has, wants_field->key); |
… | |
… | |
221 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
222 | |
222 | |
223 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
224 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
225 | |
225 | |
226 | |
|
|
227 | if ((ob1->flags ^ ob2->flags).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
226 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
228 | || ob1->arch != ob2->arch |
227 | || ob1->arch != ob2->arch |
229 | || ob1->name != ob2->name |
228 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
229 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
230 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
231 | || ob1->weight != ob2->weight |
… | |
… | |
353 | op = op->env; |
352 | op = op->env; |
354 | return op; |
353 | return op; |
355 | } |
354 | } |
356 | |
355 | |
357 | /* |
356 | /* |
358 | * Eneq(@csd.uu.se): Since we can have items buried in a character we need |
|
|
359 | * a better check. We basically keeping traversing up until we can't |
|
|
360 | * or find a player. |
|
|
361 | */ |
|
|
362 | |
|
|
363 | object * |
|
|
364 | is_player_inv (object *op) |
|
|
365 | { |
|
|
366 | for (; op != NULL && op->type != PLAYER; op = op->env) |
|
|
367 | if (op->env == op) |
|
|
368 | op->env = NULL; |
|
|
369 | return op; |
|
|
370 | } |
|
|
371 | |
|
|
372 | /* |
|
|
373 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
374 | * Some error messages. |
358 | * Some error messages. |
375 | * 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. |
376 | */ |
360 | */ |
377 | |
361 | |
… | |
… | |
380 | { |
364 | { |
381 | if (!op) |
365 | if (!op) |
382 | return strdup ("[NULLOBJ]"); |
366 | return strdup ("[NULLOBJ]"); |
383 | |
367 | |
384 | object_freezer freezer; |
368 | object_freezer freezer; |
385 | save_object (freezer, op, 3); |
369 | save_object (freezer, op, 1); |
386 | return freezer.as_string (); |
370 | return freezer.as_string (); |
387 | } |
371 | } |
388 | |
372 | |
389 | /* |
373 | /* |
390 | * 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 |
… | |
… | |
483 | } |
467 | } |
484 | |
468 | |
485 | op->key_values = 0; |
469 | op->key_values = 0; |
486 | } |
470 | } |
487 | |
471 | |
488 | void object::clear () |
|
|
489 | { |
|
|
490 | attachable_base::clear (); |
|
|
491 | |
|
|
492 | free_key_values (this); |
|
|
493 | |
|
|
494 | owner = 0; |
|
|
495 | name = 0; |
|
|
496 | name_pl = 0; |
|
|
497 | title = 0; |
|
|
498 | race = 0; |
|
|
499 | slaying = 0; |
|
|
500 | skill = 0; |
|
|
501 | msg = 0; |
|
|
502 | lore = 0; |
|
|
503 | custom_name = 0; |
|
|
504 | materialname = 0; |
|
|
505 | contr = 0; |
|
|
506 | below = 0; |
|
|
507 | above = 0; |
|
|
508 | inv = 0; |
|
|
509 | container = 0; |
|
|
510 | env = 0; |
|
|
511 | more = 0; |
|
|
512 | head = 0; |
|
|
513 | map = 0; |
|
|
514 | active_next = 0; |
|
|
515 | active_prev = 0; |
|
|
516 | |
|
|
517 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
|
|
518 | |
|
|
519 | SET_FLAG (this, FLAG_REMOVED); |
|
|
520 | |
|
|
521 | /* What is not cleared is next, prev, and count */ |
|
|
522 | |
|
|
523 | expmul = 1.0; |
|
|
524 | face = blank_face; |
|
|
525 | |
|
|
526 | if (settings.casting_time) |
|
|
527 | casting_time = -1; |
|
|
528 | } |
|
|
529 | |
|
|
530 | /* |
472 | /* |
531 | * copy_to first frees everything allocated by the dst object, |
473 | * copy_to first frees everything allocated by the dst object, |
532 | * and then copies the contents of itself into the second |
474 | * and then copies the contents of itself into the second |
533 | * object, allocating what needs to be allocated. Basically, any |
475 | * object, allocating what needs to be allocated. Basically, any |
534 | * 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, |
… | |
… | |
540 | { |
482 | { |
541 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
483 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
542 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
484 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
543 | |
485 | |
544 | *(object_copy *)dst = *this; |
486 | *(object_copy *)dst = *this; |
545 | *(object_pod *)dst = *this; |
|
|
546 | |
|
|
547 | if (self || cb) |
|
|
548 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
|
|
549 | |
487 | |
550 | if (is_freed) |
488 | if (is_freed) |
551 | SET_FLAG (dst, FLAG_FREED); |
489 | SET_FLAG (dst, FLAG_FREED); |
552 | |
490 | |
553 | if (is_removed) |
491 | if (is_removed) |
… | |
… | |
584 | tail = new_link; |
522 | tail = new_link; |
585 | } |
523 | } |
586 | } |
524 | } |
587 | } |
525 | } |
588 | |
526 | |
589 | update_ob_speed (dst); |
527 | dst->set_speed (dst->speed); |
590 | } |
528 | } |
591 | |
529 | |
592 | object * |
530 | object * |
593 | object::clone () |
531 | object::clone () |
594 | { |
532 | { |
… | |
… | |
616 | * 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 |
617 | * 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. |
618 | * 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. |
619 | */ |
557 | */ |
620 | void |
558 | void |
621 | update_ob_speed (object *op) |
559 | object::set_speed (float speed) |
622 | { |
560 | { |
623 | extern int arch_init; |
561 | extern int arch_init; |
624 | |
562 | |
625 | /* No reason putting the archetypes objects on the speed list, |
563 | /* No reason putting the archetypes objects on the speed list, |
626 | * since they never really need to be updated. |
564 | * since they never really need to be updated. |
627 | */ |
565 | */ |
628 | |
566 | if (flag [FLAG_FREED] && speed) |
629 | if (QUERY_FLAG (op, FLAG_FREED) && op->speed) |
|
|
630 | { |
567 | { |
631 | LOG (llevError, "Object %s is freed but has speed.\n", &op->name); |
568 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
632 | #ifdef MANY_CORES |
|
|
633 | abort (); |
|
|
634 | #else |
|
|
635 | op->speed = 0; |
569 | speed = 0; |
636 | #endif |
|
|
637 | } |
570 | } |
|
|
571 | |
|
|
572 | this->speed = speed; |
638 | |
573 | |
639 | if (arch_init) |
574 | if (arch_init) |
640 | return; |
575 | return; |
641 | |
576 | |
642 | if (FABS (op->speed) > MIN_ACTIVE_SPEED) |
577 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
643 | { |
578 | { |
644 | /* If already on active list, don't do anything */ |
579 | /* If already on active list, don't do anything */ |
645 | if (op->active_next || op->active_prev || op == active_objects) |
580 | if (active_next || active_prev || this == active_objects) |
646 | return; |
581 | return; |
647 | |
582 | |
648 | /* process_events() expects us to insert the object at the beginning |
583 | /* process_events() expects us to insert the object at the beginning |
649 | * of the list. */ |
584 | * of the list. */ |
650 | op->active_next = active_objects; |
585 | active_next = active_objects; |
651 | |
586 | |
652 | if (op->active_next != NULL) |
587 | if (active_next) |
653 | op->active_next->active_prev = op; |
588 | active_next->active_prev = this; |
654 | |
589 | |
655 | active_objects = op; |
590 | active_objects = this; |
656 | } |
591 | } |
657 | else |
592 | else |
658 | { |
593 | { |
659 | /* If not on the active list, nothing needs to be done */ |
594 | /* If not on the active list, nothing needs to be done */ |
660 | if (!op->active_next && !op->active_prev && op != active_objects) |
595 | if (!active_next && !active_prev && this != active_objects) |
661 | return; |
596 | return; |
662 | |
597 | |
663 | if (op->active_prev == NULL) |
598 | if (!active_prev) |
664 | { |
599 | { |
665 | active_objects = op->active_next; |
600 | active_objects = active_next; |
666 | |
601 | |
667 | if (op->active_next != NULL) |
602 | if (active_next) |
668 | op->active_next->active_prev = NULL; |
603 | active_next->active_prev = 0; |
669 | } |
604 | } |
670 | else |
605 | else |
671 | { |
606 | { |
672 | op->active_prev->active_next = op->active_next; |
607 | active_prev->active_next = active_next; |
673 | |
608 | |
674 | if (op->active_next) |
609 | if (active_next) |
675 | op->active_next->active_prev = op->active_prev; |
610 | active_next->active_prev = active_prev; |
676 | } |
611 | } |
677 | |
612 | |
678 | op->active_next = NULL; |
613 | active_next = 0; |
679 | op->active_prev = NULL; |
614 | active_prev = 0; |
680 | } |
615 | } |
681 | } |
616 | } |
682 | |
617 | |
683 | /* This function removes object 'op' from the list of active |
618 | /* This function removes object 'op' from the list of active |
684 | * objects. |
619 | * objects. |
… | |
… | |
710 | op->active_next = NULL; |
645 | op->active_next = NULL; |
711 | op->active_prev = NULL; |
646 | op->active_prev = NULL; |
712 | } |
647 | } |
713 | |
648 | |
714 | /* |
649 | /* |
715 | * update_object() updates the array which represents the map. |
650 | * update_object() updates the the map. |
716 | * It takes into account invisible objects (and represent squares covered |
651 | * It takes into account invisible objects (and represent squares covered |
717 | * 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 |
718 | * invisible object, etc...) |
653 | * invisible object, etc...) |
719 | * 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 |
720 | * 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 |
721 | * updating that window, though, since update_object() is called _often_) |
656 | * updating that window, though, since update_object() is called _often_) |
722 | * |
657 | * |
723 | * 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. |
724 | * For example, if the only thing that has changed is the face (due to |
|
|
725 | * an animation), we don't need to call update_position until that actually |
|
|
726 | * comes into view of a player. OTOH, many other things, like addition/removal |
|
|
727 | * of walls or living creatures may need us to update the flags now. |
|
|
728 | * current action are: |
659 | * current action are: |
729 | * UP_OBJ_INSERT: op was inserted |
660 | * UP_OBJ_INSERT: op was inserted |
730 | * UP_OBJ_REMOVE: op was removed |
661 | * UP_OBJ_REMOVE: op was removed |
731 | * 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 |
732 | * 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. |
733 | * UP_OBJ_FACE: only the objects face has changed. |
664 | * UP_OBJ_FACE: only the objects face has changed. |
734 | */ |
665 | */ |
735 | |
|
|
736 | void |
666 | void |
737 | update_object (object *op, int action) |
667 | update_object (object *op, int action) |
738 | { |
668 | { |
739 | int update_now = 0, flags; |
|
|
740 | MoveType move_on, move_off, move_block, move_slow; |
669 | MoveType move_on, move_off, move_block, move_slow; |
741 | |
670 | |
742 | if (op == NULL) |
671 | if (op == NULL) |
743 | { |
672 | { |
744 | /* this should never happen */ |
673 | /* this should never happen */ |
745 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
674 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
746 | return; |
675 | return; |
747 | } |
676 | } |
748 | |
677 | |
749 | if (op->env != NULL) |
678 | if (op->env) |
750 | { |
679 | { |
751 | /* Animation is currently handled by client, so nothing |
680 | /* Animation is currently handled by client, so nothing |
752 | * to do in this case. |
681 | * to do in this case. |
753 | */ |
682 | */ |
754 | return; |
683 | return; |
… | |
… | |
759 | */ |
688 | */ |
760 | if (!op->map || op->map->in_memory == MAP_SAVING) |
689 | if (!op->map || op->map->in_memory == MAP_SAVING) |
761 | return; |
690 | return; |
762 | |
691 | |
763 | /* make sure the object is within map boundaries */ |
692 | /* make sure the object is within map boundaries */ |
764 | 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) |
765 | { |
694 | { |
766 | LOG (llevError, "update_object() called for object out of map!\n"); |
695 | LOG (llevError, "update_object() called for object out of map!\n"); |
767 | #ifdef MANY_CORES |
696 | #ifdef MANY_CORES |
768 | abort (); |
697 | abort (); |
769 | #endif |
698 | #endif |
770 | return; |
699 | return; |
771 | } |
700 | } |
772 | |
701 | |
773 | flags = GET_MAP_FLAGS (op->map, op->x, op->y); |
702 | mapspace &m = op->ms (); |
774 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE); |
|
|
775 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
|
|
776 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
|
|
777 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
|
|
778 | move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y); |
|
|
779 | |
703 | |
|
|
704 | if (m.flags_ & P_NEED_UPDATE) |
|
|
705 | /* nop */; |
780 | if (action == UP_OBJ_INSERT) |
706 | else if (action == UP_OBJ_INSERT) |
781 | { |
707 | { |
|
|
708 | // this is likely overkill, TODO: revisit (schmorp) |
782 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) |
709 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
783 | update_now = 1; |
|
|
784 | |
|
|
785 | if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) |
710 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
786 | update_now = 1; |
711 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
787 | |
712 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
|
|
713 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
788 | if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) |
714 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
789 | update_now = 1; |
|
|
790 | |
|
|
791 | if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) |
|
|
792 | update_now = 1; |
|
|
793 | |
|
|
794 | if (op->type == SAFE_GROUND && !(flags & P_SAFE)) |
|
|
795 | update_now = 1; |
|
|
796 | |
|
|
797 | if ((move_on | op->move_on) != move_on) |
715 | || (m.move_on | op->move_on ) != m.move_on |
798 | update_now = 1; |
|
|
799 | |
|
|
800 | if ((move_off | op->move_off) != move_off) |
716 | || (m.move_off | op->move_off ) != m.move_off |
801 | update_now = 1; |
717 | || (m.move_slow | op->move_slow) != m.move_slow |
802 | |
|
|
803 | /* 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 |
804 | * to have move_allow right now. |
719 | * to have move_allow right now. |
805 | */ |
720 | */ |
806 | if (((move_block | op->move_block) & ~op->move_allow) != move_block) |
721 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
807 | update_now = 1; |
722 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
808 | |
723 | m.flags_ = P_NEED_UPDATE; |
809 | if ((move_slow | op->move_slow) != move_slow) |
|
|
810 | update_now = 1; |
|
|
811 | } |
724 | } |
812 | |
|
|
813 | /* if the object is being removed, we can't make intelligent |
725 | /* if the object is being removed, we can't make intelligent |
814 | * decisions, because remove_ob can't really pass the object |
726 | * decisions, because remove_ob can't really pass the object |
815 | * that is being removed. |
727 | * that is being removed. |
816 | */ |
728 | */ |
817 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
729 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
818 | update_now = 1; |
730 | m.flags_ = P_NEED_UPDATE; |
819 | else if (action == UP_OBJ_FACE) |
731 | else if (action == UP_OBJ_FACE) |
820 | /* Nothing to do for that case */ ; |
732 | /* Nothing to do for that case */ ; |
821 | else |
733 | else |
822 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
734 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
823 | |
735 | |
824 | if (update_now) |
|
|
825 | { |
|
|
826 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
|
|
827 | update_position (op->map, op->x, op->y); |
|
|
828 | } |
|
|
829 | |
|
|
830 | if (op->more != NULL) |
736 | if (op->more) |
831 | update_object (op->more, action); |
737 | update_object (op->more, action); |
832 | } |
738 | } |
833 | |
739 | |
834 | object::vector object::mortals; |
|
|
835 | object::vector object::objects; // not yet used |
740 | object::vector object::objects; // not yet used |
836 | object *object::first; |
741 | object *object::first; |
837 | |
|
|
838 | void object::free_mortals () |
|
|
839 | { |
|
|
840 | for (AUTODECL (i, mortals.begin ()); i != mortals.end ();) |
|
|
841 | if ((*i)->refcnt) |
|
|
842 | ++i; // further delay freeing |
|
|
843 | else |
|
|
844 | { |
|
|
845 | delete *i; |
|
|
846 | mortals.erase (i); |
|
|
847 | } |
|
|
848 | } |
|
|
849 | |
742 | |
850 | object::object () |
743 | object::object () |
851 | { |
744 | { |
852 | SET_FLAG (this, FLAG_REMOVED); |
745 | SET_FLAG (this, FLAG_REMOVED); |
853 | |
746 | |
… | |
… | |
885 | |
778 | |
886 | prev = 0; |
779 | prev = 0; |
887 | next = 0; |
780 | next = 0; |
888 | } |
781 | } |
889 | |
782 | |
|
|
783 | /* |
|
|
784 | * Remove and free all objects in the inventory of the given object. |
|
|
785 | * object.c ? |
|
|
786 | */ |
|
|
787 | void |
|
|
788 | object::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 | |
890 | object *object::create () |
823 | object *object::create () |
891 | { |
824 | { |
892 | object *op = new object; |
825 | object *op = new object; |
893 | op->link (); |
826 | op->link (); |
894 | return op; |
827 | return op; |
895 | } |
828 | } |
896 | |
829 | |
897 | /* |
830 | void |
898 | * free_object() frees everything allocated by an object, removes |
831 | object::do_destroy () |
899 | * it from the list of used objects, and puts it on the list of |
|
|
900 | * free objects. The IS_FREED() flag is set in the object. |
|
|
901 | * The object must have been removed by remove_ob() first for |
|
|
902 | * this function to succeed. |
|
|
903 | * |
|
|
904 | * If destroy_inventory is set, free inventory as well. Else drop items in |
|
|
905 | * inventory to the ground. |
|
|
906 | */ |
|
|
907 | void object::destroy (bool destroy_inventory) |
|
|
908 | { |
832 | { |
909 | 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]) |
910 | return; |
843 | return; |
911 | |
844 | |
912 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
845 | set_speed (0); |
913 | remove_friendly_object (this); |
|
|
914 | |
846 | |
915 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
847 | flag [FLAG_FREED] = 1; |
916 | remove (); |
|
|
917 | |
848 | |
918 | SET_FLAG (this, FLAG_FREED); |
849 | attachable::do_destroy (); |
919 | |
850 | |
920 | if (more) |
851 | destroy_inv (true); |
921 | { |
852 | unlink (); |
922 | more->destroy (destroy_inventory); |
|
|
923 | more = 0; |
|
|
924 | } |
|
|
925 | |
|
|
926 | if (inv) |
|
|
927 | { |
|
|
928 | /* Only if the space blocks everything do we not process - |
|
|
929 | * if some form of movement is allowed, let objects |
|
|
930 | * drop on that space. |
|
|
931 | */ |
|
|
932 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
|
|
933 | { |
|
|
934 | object *op = inv; |
|
|
935 | |
|
|
936 | while (op) |
|
|
937 | { |
|
|
938 | object *tmp = op->below; |
|
|
939 | op->destroy (destroy_inventory); |
|
|
940 | op = tmp; |
|
|
941 | } |
|
|
942 | } |
|
|
943 | else |
|
|
944 | { /* Put objects in inventory onto this space */ |
|
|
945 | object *op = inv; |
|
|
946 | |
|
|
947 | while (op) |
|
|
948 | { |
|
|
949 | object *tmp = op->below; |
|
|
950 | |
|
|
951 | op->remove (); |
|
|
952 | |
|
|
953 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
|
|
954 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
|
|
955 | op->destroy (); |
|
|
956 | else |
|
|
957 | { |
|
|
958 | op->x = x; |
|
|
959 | op->y = y; |
|
|
960 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
|
|
961 | } |
|
|
962 | |
|
|
963 | op = tmp; |
|
|
964 | } |
|
|
965 | } |
|
|
966 | } |
|
|
967 | |
853 | |
968 | // hack to ensure that freed objects still have a valid map |
854 | // hack to ensure that freed objects still have a valid map |
969 | { |
855 | { |
970 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
856 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
971 | |
857 | |
… | |
… | |
983 | map = freed_map; |
869 | map = freed_map; |
984 | x = 1; |
870 | x = 1; |
985 | y = 1; |
871 | y = 1; |
986 | } |
872 | } |
987 | |
873 | |
|
|
874 | head = 0; |
|
|
875 | |
|
|
876 | if (more) |
|
|
877 | { |
|
|
878 | more->destroy (); |
|
|
879 | more = 0; |
|
|
880 | } |
|
|
881 | |
988 | // clear those pointers that likely might have circular references to us |
882 | // clear those pointers that likely might have circular references to us |
989 | owner = 0; |
883 | owner = 0; |
990 | enemy = 0; |
884 | enemy = 0; |
991 | attacked_by = 0; |
885 | attacked_by = 0; |
992 | |
886 | |
993 | // only relevant for players(?), but make sure of it anyways |
887 | // only relevant for players(?), but make sure of it anyways |
994 | contr = 0; |
888 | contr = 0; |
|
|
889 | } |
995 | |
890 | |
996 | /* Remove object from the active list */ |
891 | void |
997 | speed = 0; |
892 | object::destroy (bool destroy_inventory) |
998 | update_ob_speed (this); |
893 | { |
|
|
894 | if (destroyed ()) |
|
|
895 | return; |
999 | |
896 | |
1000 | unlink (); |
897 | if (destroy_inventory) |
|
|
898 | destroy_inv (false); |
1001 | |
899 | |
1002 | mortals.push_back (this); |
900 | attachable::destroy (); |
1003 | } |
901 | } |
1004 | |
902 | |
1005 | /* |
903 | /* |
1006 | * sub_weight() recursively (outwards) subtracts a number from the |
904 | * sub_weight() recursively (outwards) subtracts a number from the |
1007 | * 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)). |
… | |
… | |
1031 | object::remove () |
929 | object::remove () |
1032 | { |
930 | { |
1033 | object *tmp, *last = 0; |
931 | object *tmp, *last = 0; |
1034 | object *otmp; |
932 | object *otmp; |
1035 | |
933 | |
1036 | int check_walk_off; |
|
|
1037 | |
|
|
1038 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
934 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1039 | return; |
935 | return; |
1040 | |
936 | |
1041 | SET_FLAG (this, FLAG_REMOVED); |
937 | SET_FLAG (this, FLAG_REMOVED); |
|
|
938 | INVOKE_OBJECT (REMOVE, this); |
1042 | |
939 | |
1043 | if (more) |
940 | if (more) |
1044 | more->remove (); |
941 | more->remove (); |
1045 | |
942 | |
1046 | /* |
943 | /* |
… | |
… | |
1056 | |
953 | |
1057 | /* 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 |
1058 | * made to players inventory. If set, avoiding the call |
955 | * made to players inventory. If set, avoiding the call |
1059 | * to save cpu time. |
956 | * to save cpu time. |
1060 | */ |
957 | */ |
1061 | if ((otmp = is_player_inv (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)) |
1062 | fix_player (otmp); |
959 | otmp->update_stats (); |
1063 | |
960 | |
1064 | if (above != NULL) |
961 | if (above != NULL) |
1065 | above->below = below; |
962 | above->below = below; |
1066 | else |
963 | else |
1067 | env->inv = below; |
964 | env->inv = below; |
… | |
… | |
1086 | |
983 | |
1087 | /* link the object above us */ |
984 | /* link the object above us */ |
1088 | if (above) |
985 | if (above) |
1089 | above->below = below; |
986 | above->below = below; |
1090 | else |
987 | else |
1091 | SET_MAP_TOP (map, x, y, below); /* we were top, set new top */ |
988 | map->at (x, y).top = below; /* we were top, set new top */ |
1092 | |
989 | |
1093 | /* Relink the object below us, if there is one */ |
990 | /* Relink the object below us, if there is one */ |
1094 | if (below) |
991 | if (below) |
1095 | below->above = above; |
992 | below->above = above; |
1096 | else |
993 | else |
… | |
… | |
1108 | dump = dump_object (GET_MAP_OB (map, x, y)); |
1005 | dump = dump_object (GET_MAP_OB (map, x, y)); |
1109 | LOG (llevError, "%s\n", dump); |
1006 | LOG (llevError, "%s\n", dump); |
1110 | free (dump); |
1007 | free (dump); |
1111 | } |
1008 | } |
1112 | |
1009 | |
1113 | SET_MAP_OB (map, x, y, above); /* goes on above it. */ |
1010 | map->at (x, y).bot = above; /* goes on above it. */ |
1114 | } |
1011 | } |
1115 | |
1012 | |
1116 | above = 0; |
1013 | above = 0; |
1117 | below = 0; |
1014 | below = 0; |
1118 | |
1015 | |
1119 | if (map->in_memory == MAP_SAVING) |
1016 | if (map->in_memory == MAP_SAVING) |
1120 | return; |
1017 | return; |
1121 | |
1018 | |
1122 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
1019 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1123 | |
1020 | |
1124 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1021 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1125 | { |
1022 | { |
1126 | /* 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 |
1127 | * being removed. |
1024 | * being removed. |
1128 | */ |
1025 | */ |
1129 | |
1026 | |
… | |
… | |
1133 | * removed (most likely destroyed), update the player view |
1030 | * removed (most likely destroyed), update the player view |
1134 | * appropriately. |
1031 | * appropriately. |
1135 | */ |
1032 | */ |
1136 | if (tmp->container == this) |
1033 | if (tmp->container == this) |
1137 | { |
1034 | { |
1138 | CLEAR_FLAG (this, FLAG_APPLIED); |
1035 | flag [FLAG_APPLIED] = 0; |
1139 | tmp->container = 0; |
1036 | tmp->container = 0; |
1140 | } |
1037 | } |
1141 | |
1038 | |
1142 | tmp->contr->socket->update_look = 1; |
1039 | if (tmp->contr->ns) |
|
|
1040 | tmp->contr->ns->floorbox_update (); |
1143 | } |
1041 | } |
1144 | |
1042 | |
1145 | /* See if player moving off should effect something */ |
1043 | /* See if player moving off should effect something */ |
1146 | if (check_walk_off |
1044 | if (check_walk_off |
1147 | && ((move_type & tmp->move_off) |
1045 | && ((move_type & tmp->move_off) |
… | |
… | |
1161 | last = tmp; |
1059 | last = tmp; |
1162 | } |
1060 | } |
1163 | |
1061 | |
1164 | /* last == NULL of there are no objects on this space */ |
1062 | /* last == NULL of there are no objects on this space */ |
1165 | if (!last) |
1063 | if (!last) |
1166 | { |
1064 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1167 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
|
|
1168 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
|
|
1169 | * those out anyways, and if there are any flags set right now, they won't |
|
|
1170 | * be correct anyways. |
|
|
1171 | */ |
|
|
1172 | SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE); |
|
|
1173 | update_position (map, x, y); |
|
|
1174 | } |
|
|
1175 | else |
1065 | else |
1176 | update_object (last, UP_OBJ_REMOVE); |
1066 | update_object (last, UP_OBJ_REMOVE); |
1177 | |
1067 | |
1178 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1068 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1179 | update_all_los (map, x, y); |
1069 | update_all_los (map, x, y); |
1180 | } |
1070 | } |
1181 | } |
1071 | } |
1182 | |
1072 | |
1183 | /* |
1073 | /* |
… | |
… | |
1192 | merge_ob (object *op, object *top) |
1082 | merge_ob (object *op, object *top) |
1193 | { |
1083 | { |
1194 | if (!op->nrof) |
1084 | if (!op->nrof) |
1195 | return 0; |
1085 | return 0; |
1196 | |
1086 | |
1197 | if (top == NULL) |
1087 | if (top) |
1198 | for (top = op; top != NULL && top->above != NULL; top = top->above); |
1088 | for (top = op; top && top->above; top = top->above) |
|
|
1089 | ; |
1199 | |
1090 | |
1200 | for (; top != NULL; top = top->below) |
1091 | for (; top; top = top->below) |
1201 | { |
1092 | { |
1202 | if (top == op) |
1093 | if (top == op) |
1203 | continue; |
1094 | continue; |
1204 | |
1095 | |
1205 | if (object::can_merge (op, top)) |
1096 | if (object::can_merge (op, top)) |
… | |
… | |
1221 | * job preparing multi-part monsters |
1112 | * job preparing multi-part monsters |
1222 | */ |
1113 | */ |
1223 | object * |
1114 | object * |
1224 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1115 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1225 | { |
1116 | { |
1226 | object *tmp; |
|
|
1227 | |
|
|
1228 | if (op->head) |
|
|
1229 | op = op->head; |
|
|
1230 | |
|
|
1231 | for (tmp = op; tmp; tmp = tmp->more) |
1117 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1232 | { |
1118 | { |
1233 | tmp->x = x + tmp->arch->clone.x; |
1119 | tmp->x = x + tmp->arch->clone.x; |
1234 | tmp->y = y + tmp->arch->clone.y; |
1120 | tmp->y = y + tmp->arch->clone.y; |
1235 | } |
1121 | } |
1236 | |
1122 | |
… | |
… | |
1255 | * Return value: |
1141 | * Return value: |
1256 | * new object if 'op' was merged with other object |
1142 | * new object if 'op' was merged with other object |
1257 | * NULL if 'op' was destroyed |
1143 | * NULL if 'op' was destroyed |
1258 | * just 'op' otherwise |
1144 | * just 'op' otherwise |
1259 | */ |
1145 | */ |
1260 | |
|
|
1261 | object * |
1146 | object * |
1262 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1147 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1263 | { |
1148 | { |
1264 | object *tmp, *top, *floor = NULL; |
1149 | object *tmp, *top, *floor = NULL; |
1265 | sint16 x, y; |
1150 | sint16 x, y; |
… | |
… | |
1299 | 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); |
1300 | free (dump); |
1185 | free (dump); |
1301 | return op; |
1186 | return op; |
1302 | } |
1187 | } |
1303 | |
1188 | |
1304 | if (op->more != NULL) |
1189 | if (op->more) |
1305 | { |
1190 | { |
1306 | /* The part may be on a different map. */ |
1191 | /* The part may be on a different map. */ |
1307 | |
1192 | |
1308 | object *more = op->more; |
1193 | object *more = op->more; |
1309 | |
1194 | |
… | |
… | |
1325 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1210 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
1326 | { |
1211 | { |
1327 | if (!op->head) |
1212 | if (!op->head) |
1328 | 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"); |
1329 | |
1214 | |
1330 | return NULL; |
1215 | return 0; |
1331 | } |
1216 | } |
1332 | } |
1217 | } |
1333 | |
1218 | |
1334 | CLEAR_FLAG (op, FLAG_REMOVED); |
1219 | CLEAR_FLAG (op, FLAG_REMOVED); |
1335 | |
1220 | |
… | |
… | |
1369 | op->below = originator->below; |
1254 | op->below = originator->below; |
1370 | |
1255 | |
1371 | if (op->below) |
1256 | if (op->below) |
1372 | op->below->above = op; |
1257 | op->below->above = op; |
1373 | else |
1258 | else |
1374 | SET_MAP_OB (op->map, op->x, op->y, op); |
1259 | op->ms ().bot = op; |
1375 | |
1260 | |
1376 | /* since *below* originator, no need to update top */ |
1261 | /* since *below* originator, no need to update top */ |
1377 | originator->below = op; |
1262 | originator->below = op; |
1378 | } |
1263 | } |
1379 | else |
1264 | else |
… | |
… | |
1425 | * If INS_ON_TOP is used, don't do this processing |
1310 | * If INS_ON_TOP is used, don't do this processing |
1426 | * Need to find the object that in fact blocks view, otherwise |
1311 | * Need to find the object that in fact blocks view, otherwise |
1427 | * stacking is a bit odd. |
1312 | * stacking is a bit odd. |
1428 | */ |
1313 | */ |
1429 | if (!(flag & INS_ON_TOP) && |
1314 | if (!(flag & INS_ON_TOP) && |
1430 | (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)) |
1431 | { |
1316 | { |
1432 | for (last = top; last != floor; last = last->below) |
1317 | for (last = top; last != floor; last = last->below) |
1433 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1318 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1434 | break; |
1319 | break; |
1435 | /* Check to see if we found the object that blocks view, |
1320 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1458 | |
1343 | |
1459 | if (op->above) |
1344 | if (op->above) |
1460 | op->above->below = op; |
1345 | op->above->below = op; |
1461 | |
1346 | |
1462 | op->below = NULL; |
1347 | op->below = NULL; |
1463 | SET_MAP_OB (op->map, op->x, op->y, op); |
1348 | op->ms ().bot = op; |
1464 | } |
1349 | } |
1465 | else |
1350 | else |
1466 | { /* get inserted into the stack above top */ |
1351 | { /* get inserted into the stack above top */ |
1467 | op->above = top->above; |
1352 | op->above = top->above; |
1468 | |
1353 | |
… | |
… | |
1472 | op->below = top; |
1357 | op->below = top; |
1473 | top->above = op; |
1358 | top->above = op; |
1474 | } |
1359 | } |
1475 | |
1360 | |
1476 | if (op->above == NULL) |
1361 | if (op->above == NULL) |
1477 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1362 | op->ms ().top = op; |
1478 | } /* else not INS_BELOW_ORIGINATOR */ |
1363 | } /* else not INS_BELOW_ORIGINATOR */ |
1479 | |
1364 | |
1480 | if (op->type == PLAYER) |
1365 | if (op->type == PLAYER) |
1481 | op->contr->do_los = 1; |
1366 | op->contr->do_los = 1; |
1482 | |
1367 | |
1483 | /* 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 |
1484 | * it, so save a few ticks and start from there. |
1369 | * it, so save a few ticks and start from there. |
1485 | */ |
1370 | */ |
1486 | if (!(flag & INS_MAP_LOAD)) |
1371 | if (!(flag & INS_MAP_LOAD)) |
1487 | 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 ()) |
1488 | if (tmp->type == PLAYER) |
1373 | if (pl->contr->ns) |
1489 | tmp->contr->socket->update_look = 1; |
1374 | pl->contr->ns->floorbox_update (); |
1490 | |
1375 | |
1491 | /* If this object glows, it may affect lighting conditions that are |
1376 | /* If this object glows, it may affect lighting conditions that are |
1492 | * 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 |
1493 | * 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 |
1494 | * on the map will get recalculated. The players could very well |
1379 | * on the map will get recalculated. The players could very well |
1495 | * 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 - |
1496 | * this should get redone to only look for players within range, |
1381 | * this should get redone to only look for players within range, |
1497 | * 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 |
1498 | * of effect may be sufficient. |
1383 | * of effect may be sufficient. |
1499 | */ |
1384 | */ |
1500 | if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) |
1385 | if (op->map->darkness && (op->glow_radius != 0)) |
1501 | update_all_los (op->map, op->x, op->y); |
1386 | update_all_los (op->map, op->x, op->y); |
1502 | |
1387 | |
1503 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1388 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1504 | update_object (op, UP_OBJ_INSERT); |
1389 | update_object (op, UP_OBJ_INSERT); |
1505 | |
1390 | |
|
|
1391 | INVOKE_OBJECT (INSERT, op); |
|
|
1392 | |
1506 | /* 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, |
1507 | * we want to have update_look set above before calling this. |
1394 | * we want to have floorbox_update called before calling this. |
1508 | * |
1395 | * |
1509 | * check_move_on() must be after this because code called from |
1396 | * check_move_on() must be after this because code called from |
1510 | * check_move_on() depends on correct map flags (so functions like |
1397 | * check_move_on() depends on correct map flags (so functions like |
1511 | * blocked() and wall() work properly), and these flags are updated by |
1398 | * blocked() and wall() work properly), and these flags are updated by |
1512 | * update_object(). |
1399 | * update_object(). |
… | |
… | |
1514 | |
1401 | |
1515 | /* 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 */ |
1516 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1403 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1517 | { |
1404 | { |
1518 | if (check_move_on (op, originator)) |
1405 | if (check_move_on (op, originator)) |
1519 | return NULL; |
1406 | return 0; |
1520 | |
1407 | |
1521 | /* 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 |
1522 | * walk on's. |
1409 | * walk on's. |
1523 | */ |
1410 | */ |
1524 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1411 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1525 | if (check_move_on (tmp, originator)) |
1412 | if (check_move_on (tmp, originator)) |
1526 | return NULL; |
1413 | return 0; |
1527 | } |
1414 | } |
1528 | |
1415 | |
1529 | return op; |
1416 | return op; |
1530 | } |
1417 | } |
1531 | |
1418 | |
1532 | /* this function inserts an object in the map, but if it |
1419 | /* this function inserts an object in the map, but if it |
1533 | * 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. |
1534 | * 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. |
1535 | */ |
1422 | */ |
1536 | void |
1423 | void |
1537 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1424 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1538 | { |
1425 | { |
1539 | object * |
1426 | object *tmp, *tmp1; |
1540 | tmp; |
|
|
1541 | object * |
|
|
1542 | tmp1; |
|
|
1543 | |
1427 | |
1544 | /* first search for itself and remove any old instances */ |
1428 | /* first search for itself and remove any old instances */ |
1545 | |
1429 | |
1546 | 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) |
1547 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1431 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
… | |
… | |
1550 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1434 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1551 | |
1435 | |
1552 | tmp1->x = op->x; |
1436 | tmp1->x = op->x; |
1553 | tmp1->y = op->y; |
1437 | tmp1->y = op->y; |
1554 | insert_ob_in_map (tmp1, op->map, op, 0); |
1438 | insert_ob_in_map (tmp1, op->map, op, 0); |
|
|
1439 | } |
|
|
1440 | |
|
|
1441 | object * |
|
|
1442 | object::insert_at (object *where, object *originator, int flags) |
|
|
1443 | { |
|
|
1444 | where->map->insert (this, where->x, where->y, originator, flags); |
1555 | } |
1445 | } |
1556 | |
1446 | |
1557 | /* |
1447 | /* |
1558 | * 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 |
1559 | * is returned contains nr objects, and the remaining parts contains |
1449 | * is returned contains nr objects, and the remaining parts contains |
1560 | * 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). |
1561 | * On failure, NULL is returned, and the reason put into the |
1451 | * On failure, NULL is returned, and the reason put into the |
1562 | * global static errmsg array. |
1452 | * global static errmsg array. |
1563 | */ |
1453 | */ |
1564 | |
|
|
1565 | object * |
1454 | object * |
1566 | get_split_ob (object *orig_ob, uint32 nr) |
1455 | get_split_ob (object *orig_ob, uint32 nr) |
1567 | { |
1456 | { |
1568 | object *newob; |
1457 | object *newob; |
1569 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1458 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
… | |
… | |
1605 | |
1494 | |
1606 | object * |
1495 | object * |
1607 | decrease_ob_nr (object *op, uint32 i) |
1496 | decrease_ob_nr (object *op, uint32 i) |
1608 | { |
1497 | { |
1609 | object *tmp; |
1498 | object *tmp; |
1610 | player *pl; |
|
|
1611 | |
1499 | |
1612 | if (i == 0) /* objects with op->nrof require this check */ |
1500 | if (i == 0) /* objects with op->nrof require this check */ |
1613 | return op; |
1501 | return op; |
1614 | |
1502 | |
1615 | if (i > op->nrof) |
1503 | if (i > op->nrof) |
1616 | i = op->nrof; |
1504 | i = op->nrof; |
1617 | |
1505 | |
1618 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1506 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1619 | op->nrof -= i; |
1507 | op->nrof -= i; |
1620 | else if (op->env != NULL) |
1508 | else if (op->env) |
1621 | { |
1509 | { |
1622 | /* is this object in the players inventory, or sub container |
1510 | /* is this object in the players inventory, or sub container |
1623 | * therein? |
1511 | * therein? |
1624 | */ |
1512 | */ |
1625 | tmp = is_player_inv (op->env); |
1513 | tmp = op->in_player (); |
1626 | /* nope. Is this a container the player has opened? |
1514 | /* nope. Is this a container the player has opened? |
1627 | * If so, set tmp to that player. |
1515 | * If so, set tmp to that player. |
1628 | * IMO, searching through all the players will mostly |
1516 | * IMO, searching through all the players will mostly |
1629 | * likely be quicker than following op->env to the map, |
1517 | * likely be quicker than following op->env to the map, |
1630 | * and then searching the map for a player. |
1518 | * and then searching the map for a player. |
1631 | */ |
1519 | */ |
1632 | if (!tmp) |
1520 | if (!tmp) |
1633 | { |
1521 | for_all_players (pl) |
1634 | for (pl = first_player; pl; pl = pl->next) |
|
|
1635 | if (pl->ob->container == op->env) |
1522 | if (pl->ob->container == op->env) |
|
|
1523 | { |
|
|
1524 | tmp = pl->ob; |
1636 | break; |
1525 | break; |
1637 | if (pl) |
|
|
1638 | tmp = pl->ob; |
|
|
1639 | else |
|
|
1640 | tmp = NULL; |
|
|
1641 | } |
1526 | } |
1642 | |
1527 | |
1643 | if (i < op->nrof) |
1528 | if (i < op->nrof) |
1644 | { |
1529 | { |
1645 | sub_weight (op->env, op->weight * i); |
1530 | sub_weight (op->env, op->weight * i); |
1646 | op->nrof -= i; |
1531 | op->nrof -= i; |
1647 | if (tmp) |
1532 | if (tmp) |
1648 | { |
|
|
1649 | esrv_send_item (tmp, op); |
1533 | esrv_send_item (tmp, op); |
1650 | } |
|
|
1651 | } |
1534 | } |
1652 | else |
1535 | else |
1653 | { |
1536 | { |
1654 | op->remove (); |
1537 | op->remove (); |
1655 | op->nrof = 0; |
1538 | op->nrof = 0; |
1656 | if (tmp) |
1539 | if (tmp) |
1657 | { |
|
|
1658 | esrv_del_item (tmp->contr, op->count); |
1540 | esrv_del_item (tmp->contr, op->count); |
1659 | } |
|
|
1660 | } |
1541 | } |
1661 | } |
1542 | } |
1662 | else |
1543 | else |
1663 | { |
1544 | { |
1664 | object *above = op->above; |
1545 | object *above = op->above; |
… | |
… | |
1670 | op->remove (); |
1551 | op->remove (); |
1671 | op->nrof = 0; |
1552 | op->nrof = 0; |
1672 | } |
1553 | } |
1673 | |
1554 | |
1674 | /* Since we just removed op, op->above is null */ |
1555 | /* Since we just removed op, op->above is null */ |
1675 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1556 | for (tmp = above; tmp; tmp = tmp->above) |
1676 | if (tmp->type == PLAYER) |
1557 | if (tmp->type == PLAYER) |
1677 | { |
1558 | { |
1678 | if (op->nrof) |
1559 | if (op->nrof) |
1679 | esrv_send_item (tmp, op); |
1560 | esrv_send_item (tmp, op); |
1680 | else |
1561 | else |
… | |
… | |
1685 | if (op->nrof) |
1566 | if (op->nrof) |
1686 | return op; |
1567 | return op; |
1687 | else |
1568 | else |
1688 | { |
1569 | { |
1689 | op->destroy (); |
1570 | op->destroy (); |
1690 | return NULL; |
1571 | return 0; |
1691 | } |
1572 | } |
1692 | } |
1573 | } |
1693 | |
1574 | |
1694 | /* |
1575 | /* |
1695 | * add_weight(object, weight) adds the specified weight to an object, |
1576 | * add_weight(object, weight) adds the specified weight to an object, |
… | |
… | |
1783 | add_weight (this, op->weight * op->nrof); |
1664 | add_weight (this, op->weight * op->nrof); |
1784 | } |
1665 | } |
1785 | else |
1666 | else |
1786 | add_weight (this, (op->weight + op->carrying)); |
1667 | add_weight (this, (op->weight + op->carrying)); |
1787 | |
1668 | |
1788 | otmp = is_player_inv (this); |
1669 | otmp = this->in_player (); |
1789 | if (otmp && otmp->contr) |
1670 | if (otmp && otmp->contr) |
1790 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1671 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1791 | fix_player (otmp); |
1672 | otmp->update_stats (); |
1792 | |
1673 | |
1793 | op->map = NULL; |
1674 | op->map = 0; |
1794 | op->env = this; |
1675 | op->env = this; |
1795 | op->above = NULL; |
1676 | op->above = 0; |
1796 | op->below = NULL; |
1677 | op->below = 0; |
1797 | op->x = 0, op->y = 0; |
1678 | op->x = 0, op->y = 0; |
1798 | |
1679 | |
1799 | /* 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 */ |
1800 | if ((op->glow_radius != 0) && map) |
1681 | if ((op->glow_radius != 0) && map) |
1801 | { |
1682 | { |
1802 | #ifdef DEBUG_LIGHTS |
1683 | #ifdef DEBUG_LIGHTS |
1803 | 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); |
1804 | #endif /* DEBUG_LIGHTS */ |
1685 | #endif /* DEBUG_LIGHTS */ |
1805 | if (MAP_DARKNESS (map)) |
1686 | if (map->darkness) |
1806 | update_all_los (map, x, y); |
1687 | update_all_los (map, x, y); |
1807 | } |
1688 | } |
1808 | |
1689 | |
1809 | /* 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. |
1810 | * It sure simplifies this function... |
1691 | * It sure simplifies this function... |
… | |
… | |
1815 | { |
1696 | { |
1816 | op->below = inv; |
1697 | op->below = inv; |
1817 | op->below->above = op; |
1698 | op->below->above = op; |
1818 | inv = op; |
1699 | inv = op; |
1819 | } |
1700 | } |
|
|
1701 | |
|
|
1702 | INVOKE_OBJECT (INSERT, this); |
1820 | |
1703 | |
1821 | return op; |
1704 | return op; |
1822 | } |
1705 | } |
1823 | |
1706 | |
1824 | /* |
1707 | /* |
… | |
… | |
1839 | * |
1722 | * |
1840 | * 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 |
1841 | * 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 |
1842 | * on top. |
1725 | * on top. |
1843 | */ |
1726 | */ |
1844 | |
|
|
1845 | int |
1727 | int |
1846 | check_move_on (object *op, object *originator) |
1728 | check_move_on (object *op, object *originator) |
1847 | { |
1729 | { |
1848 | object *tmp; |
1730 | object *tmp; |
1849 | maptile *m = op->map; |
1731 | maptile *m = op->map; |
… | |
… | |
1876 | |
1758 | |
1877 | /* The objects have to be checked from top to bottom. |
1759 | /* The objects have to be checked from top to bottom. |
1878 | * Hence, we first go to the top: |
1760 | * Hence, we first go to the top: |
1879 | */ |
1761 | */ |
1880 | |
1762 | |
1881 | 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) |
1882 | { |
1764 | { |
1883 | /* Trim the search when we find the first other spell effect |
1765 | /* Trim the search when we find the first other spell effect |
1884 | * 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, |
1885 | * we don't need to check all of them. |
1767 | * we don't need to check all of them. |
1886 | */ |
1768 | */ |
… | |
… | |
1941 | /* |
1823 | /* |
1942 | * present_arch(arch, map, x, y) searches for any objects with |
1824 | * present_arch(arch, map, x, y) searches for any objects with |
1943 | * a matching archetype at the given map and coordinates. |
1825 | * a matching archetype at the given map and coordinates. |
1944 | * The first matching object is returned, or NULL if none. |
1826 | * The first matching object is returned, or NULL if none. |
1945 | */ |
1827 | */ |
1946 | |
|
|
1947 | object * |
1828 | object * |
1948 | present_arch (const archetype *at, maptile *m, int x, int y) |
1829 | present_arch (const archetype *at, maptile *m, int x, int y) |
1949 | { |
1830 | { |
1950 | object * |
|
|
1951 | tmp; |
|
|
1952 | |
|
|
1953 | if (m == NULL || out_of_map (m, x, y)) |
1831 | if (m == NULL || out_of_map (m, x, y)) |
1954 | { |
1832 | { |
1955 | LOG (llevError, "Present_arch called outside map.\n"); |
1833 | LOG (llevError, "Present_arch called outside map.\n"); |
1956 | return NULL; |
1834 | return NULL; |
1957 | } |
1835 | } |
|
|
1836 | |
1958 | 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) |
1959 | if (tmp->arch == at) |
1838 | if (tmp->arch == at) |
1960 | return tmp; |
1839 | return tmp; |
|
|
1840 | |
1961 | return NULL; |
1841 | return NULL; |
1962 | } |
1842 | } |
1963 | |
1843 | |
1964 | /* |
1844 | /* |
1965 | * present(type, map, x, y) searches for any objects with |
1845 | * present(type, map, x, y) searches for any objects with |
1966 | * a matching type variable at the given map and coordinates. |
1846 | * a matching type variable at the given map and coordinates. |
1967 | * The first matching object is returned, or NULL if none. |
1847 | * The first matching object is returned, or NULL if none. |
1968 | */ |
1848 | */ |
1969 | |
|
|
1970 | object * |
1849 | object * |
1971 | present (unsigned char type, maptile *m, int x, int y) |
1850 | present (unsigned char type, maptile *m, int x, int y) |
1972 | { |
1851 | { |
1973 | object * |
|
|
1974 | tmp; |
|
|
1975 | |
|
|
1976 | if (out_of_map (m, x, y)) |
1852 | if (out_of_map (m, x, y)) |
1977 | { |
1853 | { |
1978 | LOG (llevError, "Present called outside map.\n"); |
1854 | LOG (llevError, "Present called outside map.\n"); |
1979 | return NULL; |
1855 | return NULL; |
1980 | } |
1856 | } |
|
|
1857 | |
1981 | 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) |
1982 | if (tmp->type == type) |
1859 | if (tmp->type == type) |
1983 | return tmp; |
1860 | return tmp; |
|
|
1861 | |
1984 | return NULL; |
1862 | return NULL; |
1985 | } |
1863 | } |
1986 | |
1864 | |
1987 | /* |
1865 | /* |
1988 | * present_in_ob(type, object) searches for any objects with |
1866 | * present_in_ob(type, object) searches for any objects with |
1989 | * a matching type variable in the inventory of the given object. |
1867 | * a matching type variable in the inventory of the given object. |
1990 | * The first matching object is returned, or NULL if none. |
1868 | * The first matching object is returned, or NULL if none. |
1991 | */ |
1869 | */ |
1992 | |
|
|
1993 | object * |
1870 | object * |
1994 | present_in_ob (unsigned char type, const object *op) |
1871 | present_in_ob (unsigned char type, const object *op) |
1995 | { |
1872 | { |
1996 | object * |
|
|
1997 | tmp; |
|
|
1998 | |
|
|
1999 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1873 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2000 | if (tmp->type == type) |
1874 | if (tmp->type == type) |
2001 | return tmp; |
1875 | return tmp; |
|
|
1876 | |
2002 | return NULL; |
1877 | return NULL; |
2003 | } |
1878 | } |
2004 | |
1879 | |
2005 | /* |
1880 | /* |
2006 | * present_in_ob (type, str, object) searches for any objects with |
1881 | * present_in_ob (type, str, object) searches for any objects with |
… | |
… | |
2014 | * 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 |
2015 | * 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 |
2016 | * 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 |
2017 | * to be unique. |
1892 | * to be unique. |
2018 | */ |
1893 | */ |
2019 | |
|
|
2020 | object * |
1894 | object * |
2021 | present_in_ob_by_name (int type, const char *str, const object *op) |
1895 | present_in_ob_by_name (int type, const char *str, const object *op) |
2022 | { |
1896 | { |
2023 | object * |
|
|
2024 | tmp; |
|
|
2025 | |
|
|
2026 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1897 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2027 | { |
|
|
2028 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1898 | if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
2029 | return tmp; |
1899 | return tmp; |
2030 | } |
1900 | |
2031 | return NULL; |
1901 | return 0; |
2032 | } |
1902 | } |
2033 | |
1903 | |
2034 | /* |
1904 | /* |
2035 | * present_arch_in_ob(archetype, object) searches for any objects with |
1905 | * present_arch_in_ob(archetype, object) searches for any objects with |
2036 | * a matching archetype in the inventory of the given object. |
1906 | * a matching archetype in the inventory of the given object. |
2037 | * The first matching object is returned, or NULL if none. |
1907 | * The first matching object is returned, or NULL if none. |
2038 | */ |
1908 | */ |
2039 | |
|
|
2040 | object * |
1909 | object * |
2041 | present_arch_in_ob (const archetype *at, const object *op) |
1910 | present_arch_in_ob (const archetype *at, const object *op) |
2042 | { |
1911 | { |
2043 | object * |
|
|
2044 | tmp; |
|
|
2045 | |
|
|
2046 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1912 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2047 | if (tmp->arch == at) |
1913 | if (tmp->arch == at) |
2048 | return tmp; |
1914 | return tmp; |
|
|
1915 | |
2049 | return NULL; |
1916 | return NULL; |
2050 | } |
1917 | } |
2051 | |
1918 | |
2052 | /* |
1919 | /* |
2053 | * activate recursively a flag on an object inventory |
1920 | * activate recursively a flag on an object inventory |
2054 | */ |
1921 | */ |
2055 | void |
1922 | void |
2056 | flag_inv (object *op, int flag) |
1923 | flag_inv (object *op, int flag) |
2057 | { |
1924 | { |
2058 | object * |
|
|
2059 | tmp; |
|
|
2060 | |
|
|
2061 | if (op->inv) |
1925 | if (op->inv) |
2062 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1926 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2063 | { |
1927 | { |
2064 | SET_FLAG (tmp, flag); |
1928 | SET_FLAG (tmp, flag); |
2065 | flag_inv (tmp, flag); |
1929 | flag_inv (tmp, flag); |
2066 | } |
1930 | } |
2067 | } /* |
1931 | } |
|
|
1932 | |
|
|
1933 | /* |
2068 | * desactivate recursively a flag on an object inventory |
1934 | * deactivate recursively a flag on an object inventory |
2069 | */ |
1935 | */ |
2070 | void |
1936 | void |
2071 | unflag_inv (object *op, int flag) |
1937 | unflag_inv (object *op, int flag) |
2072 | { |
1938 | { |
2073 | object * |
|
|
2074 | tmp; |
|
|
2075 | |
|
|
2076 | if (op->inv) |
1939 | if (op->inv) |
2077 | for (tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1940 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
2078 | { |
1941 | { |
2079 | CLEAR_FLAG (tmp, flag); |
1942 | CLEAR_FLAG (tmp, flag); |
2080 | unflag_inv (tmp, flag); |
1943 | unflag_inv (tmp, flag); |
2081 | } |
1944 | } |
2082 | } |
1945 | } |
… | |
… | |
2085 | * 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 |
2086 | * all it's inventory (recursively). |
1949 | * all it's inventory (recursively). |
2087 | * 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 |
2088 | * 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. |
2089 | */ |
1952 | */ |
2090 | |
|
|
2091 | void |
1953 | void |
2092 | set_cheat (object *op) |
1954 | set_cheat (object *op) |
2093 | { |
1955 | { |
2094 | SET_FLAG (op, FLAG_WAS_WIZ); |
1956 | SET_FLAG (op, FLAG_WAS_WIZ); |
2095 | flag_inv (op, FLAG_WAS_WIZ); |
1957 | flag_inv (op, FLAG_WAS_WIZ); |
… | |
… | |
2114 | * 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 |
2115 | * 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 |
2116 | * 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 |
2117 | * customized, changed states, etc. |
1979 | * customized, changed states, etc. |
2118 | */ |
1980 | */ |
2119 | |
|
|
2120 | int |
1981 | int |
2121 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1982 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2122 | { |
1983 | { |
2123 | int |
|
|
2124 | i, |
|
|
2125 | index = 0, flag; |
1984 | int index = 0, flag; |
2126 | static int |
|
|
2127 | altern[SIZEOFFREE]; |
1985 | int altern[SIZEOFFREE]; |
2128 | |
1986 | |
2129 | for (i = start; i < stop; i++) |
1987 | for (int i = start; i < stop; i++) |
2130 | { |
1988 | { |
2131 | 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]); |
2132 | if (!flag) |
1990 | if (!flag) |
2133 | altern[index++] = i; |
1991 | altern [index++] = i; |
2134 | |
1992 | |
2135 | /* 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. |
2136 | * 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. |
2137 | * 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 - |
2138 | * 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 |
2139 | * 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 |
2140 | * to only the spaces immediately surrounding the target area, and |
1998 | * to only the spaces immediately surrounding the target area, and |
2141 | * won't look 2 spaces south of the target space. |
1999 | * won't look 2 spaces south of the target space. |
2142 | */ |
2000 | */ |
2143 | else if ((flag & AB_NO_PASS) && maxfree[i] < stop) |
2001 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2144 | stop = maxfree[i]; |
2002 | stop = maxfree[i]; |
2145 | } |
2003 | } |
|
|
2004 | |
2146 | if (!index) |
2005 | if (!index) |
2147 | return -1; |
2006 | return -1; |
|
|
2007 | |
2148 | return altern[RANDOM () % index]; |
2008 | return altern[RANDOM () % index]; |
2149 | } |
2009 | } |
2150 | |
2010 | |
2151 | /* |
2011 | /* |
2152 | * find_first_free_spot(archetype, maptile, x, y) works like |
2012 | * find_first_free_spot(archetype, maptile, x, y) works like |
2153 | * find_free_spot(), but it will search max number of squares. |
2013 | * find_free_spot(), but it will search max number of squares. |
2154 | * 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. |
2155 | * 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. |
2156 | */ |
2016 | */ |
2157 | |
|
|
2158 | int |
2017 | int |
2159 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2018 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2160 | { |
2019 | { |
2161 | int |
|
|
2162 | i; |
|
|
2163 | |
|
|
2164 | for (i = 0; i < SIZEOFFREE; i++) |
2020 | for (int i = 0; i < SIZEOFFREE; i++) |
2165 | { |
|
|
2166 | 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])) |
2167 | return i; |
2022 | return i; |
2168 | } |
2023 | |
2169 | return -1; |
2024 | return -1; |
2170 | } |
2025 | } |
2171 | |
2026 | |
2172 | /* |
2027 | /* |
2173 | * The function permute(arr, begin, end) randomly reorders the array |
2028 | * The function permute(arr, begin, end) randomly reorders the array |
2174 | * arr[begin..end-1]. |
2029 | * arr[begin..end-1]. |
|
|
2030 | * now uses a fisher-yates shuffle, old permute was broken |
2175 | */ |
2031 | */ |
2176 | static void |
2032 | static void |
2177 | permute (int *arr, int begin, int end) |
2033 | permute (int *arr, int begin, int end) |
2178 | { |
2034 | { |
2179 | int |
2035 | arr += begin; |
2180 | i, |
|
|
2181 | j, |
|
|
2182 | tmp, |
|
|
2183 | len; |
|
|
2184 | |
|
|
2185 | len = end - begin; |
2036 | end -= begin; |
2186 | for (i = begin; i < end; i++) |
|
|
2187 | { |
|
|
2188 | j = begin + RANDOM () % len; |
|
|
2189 | |
2037 | |
2190 | tmp = arr[i]; |
2038 | while (--end) |
2191 | arr[i] = arr[j]; |
2039 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2192 | arr[j] = tmp; |
|
|
2193 | } |
|
|
2194 | } |
2040 | } |
2195 | |
2041 | |
2196 | /* new function to make monster searching more efficient, and effective! |
2042 | /* new function to make monster searching more efficient, and effective! |
2197 | * This basically returns a randomized array (in the passed pointer) of |
2043 | * This basically returns a randomized array (in the passed pointer) of |
2198 | * 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 |
… | |
… | |
2201 | * 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. |
2202 | */ |
2048 | */ |
2203 | void |
2049 | void |
2204 | get_search_arr (int *search_arr) |
2050 | get_search_arr (int *search_arr) |
2205 | { |
2051 | { |
2206 | int |
2052 | int i; |
2207 | i; |
|
|
2208 | |
2053 | |
2209 | for (i = 0; i < SIZEOFFREE; i++) |
2054 | for (i = 0; i < SIZEOFFREE; i++) |
2210 | { |
|
|
2211 | search_arr[i] = i; |
2055 | search_arr[i] = i; |
2212 | } |
|
|
2213 | |
2056 | |
2214 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2057 | permute (search_arr, 1, SIZEOFFREE1 + 1); |
2215 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2058 | permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2216 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2059 | permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2217 | } |
2060 | } |
… | |
… | |
2226 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2069 | * Perhaps incorrectly, but I'm making the assumption that exclude |
2227 | * 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 |
2228 | * 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 |
2229 | * there is capable of. |
2072 | * there is capable of. |
2230 | */ |
2073 | */ |
2231 | |
|
|
2232 | int |
2074 | int |
2233 | find_dir (maptile *m, int x, int y, object *exclude) |
2075 | find_dir (maptile *m, int x, int y, object *exclude) |
2234 | { |
2076 | { |
2235 | int |
|
|
2236 | i, |
|
|
2237 | max = SIZEOFFREE, mflags; |
2077 | int i, max = SIZEOFFREE, mflags; |
2238 | |
2078 | |
2239 | sint16 nx, ny; |
2079 | sint16 nx, ny; |
2240 | object * |
2080 | object *tmp; |
2241 | tmp; |
|
|
2242 | maptile * |
2081 | maptile *mp; |
2243 | mp; |
|
|
2244 | |
2082 | |
2245 | MoveType blocked, move_type; |
2083 | MoveType blocked, move_type; |
2246 | |
2084 | |
2247 | if (exclude && exclude->head) |
2085 | if (exclude && exclude->head) |
2248 | { |
2086 | { |
… | |
… | |
2260 | mp = m; |
2098 | mp = m; |
2261 | nx = x + freearr_x[i]; |
2099 | nx = x + freearr_x[i]; |
2262 | ny = y + freearr_y[i]; |
2100 | ny = y + freearr_y[i]; |
2263 | |
2101 | |
2264 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2102 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
|
|
2103 | |
2265 | if (mflags & P_OUT_OF_MAP) |
2104 | if (mflags & P_OUT_OF_MAP) |
2266 | { |
|
|
2267 | max = maxfree[i]; |
2105 | max = maxfree[i]; |
2268 | } |
|
|
2269 | else |
2106 | else |
2270 | { |
2107 | { |
2271 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2108 | mapspace &ms = mp->at (nx, ny); |
|
|
2109 | |
|
|
2110 | blocked = ms.move_block; |
2272 | |
2111 | |
2273 | if ((move_type & blocked) == move_type) |
2112 | if ((move_type & blocked) == move_type) |
2274 | { |
|
|
2275 | max = maxfree[i]; |
2113 | max = maxfree[i]; |
2276 | } |
|
|
2277 | else if (mflags & P_IS_ALIVE) |
2114 | else if (mflags & P_IS_ALIVE) |
2278 | { |
2115 | { |
2279 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) |
2116 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2280 | { |
2117 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2281 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2118 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2282 | { |
|
|
2283 | break; |
2119 | break; |
2284 | } |
2120 | |
2285 | } |
|
|
2286 | if (tmp) |
2121 | if (tmp) |
2287 | { |
|
|
2288 | return freedir[i]; |
2122 | return freedir[i]; |
2289 | } |
|
|
2290 | } |
2123 | } |
2291 | } |
2124 | } |
2292 | } |
2125 | } |
|
|
2126 | |
2293 | return 0; |
2127 | return 0; |
2294 | } |
2128 | } |
2295 | |
2129 | |
2296 | /* |
2130 | /* |
2297 | * distance(object 1, object 2) will return the square of the |
2131 | * distance(object 1, object 2) will return the square of the |
2298 | * distance between the two given objects. |
2132 | * distance between the two given objects. |
2299 | */ |
2133 | */ |
2300 | |
|
|
2301 | int |
2134 | int |
2302 | distance (const object *ob1, const object *ob2) |
2135 | distance (const object *ob1, const object *ob2) |
2303 | { |
2136 | { |
2304 | int |
|
|
2305 | i; |
|
|
2306 | |
|
|
2307 | 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); |
2308 | return i; |
|
|
2309 | } |
2138 | } |
2310 | |
2139 | |
2311 | /* |
2140 | /* |
2312 | * 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 |
2313 | * 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 |
2314 | * object, needs to travel toward it. |
2143 | * object, needs to travel toward it. |
2315 | */ |
2144 | */ |
2316 | |
|
|
2317 | int |
2145 | int |
2318 | find_dir_2 (int x, int y) |
2146 | find_dir_2 (int x, int y) |
2319 | { |
2147 | { |
2320 | int |
2148 | int q; |
2321 | q; |
|
|
2322 | |
2149 | |
2323 | if (y) |
2150 | if (y) |
2324 | q = x * 100 / y; |
2151 | q = x * 100 / y; |
2325 | else if (x) |
2152 | else if (x) |
2326 | q = -300 * x; |
2153 | q = -300 * x; |
… | |
… | |
2361 | int |
2188 | int |
2362 | absdir (int d) |
2189 | absdir (int d) |
2363 | { |
2190 | { |
2364 | while (d < 1) |
2191 | while (d < 1) |
2365 | d += 8; |
2192 | d += 8; |
|
|
2193 | |
2366 | while (d > 8) |
2194 | while (d > 8) |
2367 | d -= 8; |
2195 | d -= 8; |
|
|
2196 | |
2368 | return d; |
2197 | return d; |
2369 | } |
2198 | } |
2370 | |
2199 | |
2371 | /* |
2200 | /* |
2372 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2201 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
… | |
… | |
2374 | */ |
2203 | */ |
2375 | |
2204 | |
2376 | int |
2205 | int |
2377 | dirdiff (int dir1, int dir2) |
2206 | dirdiff (int dir1, int dir2) |
2378 | { |
2207 | { |
2379 | int |
2208 | int d; |
2380 | d; |
|
|
2381 | |
2209 | |
2382 | d = abs (dir1 - dir2); |
2210 | d = abs (dir1 - dir2); |
2383 | if (d > 4) |
2211 | if (d > 4) |
2384 | d = 8 - d; |
2212 | d = 8 - d; |
|
|
2213 | |
2385 | return d; |
2214 | return d; |
2386 | } |
2215 | } |
2387 | |
2216 | |
2388 | /* peterm: |
2217 | /* peterm: |
2389 | * 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. |
… | |
… | |
2392 | * 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 |
2393 | * 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. |
2394 | * 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 |
2395 | * functions. |
2224 | * functions. |
2396 | */ |
2225 | */ |
2397 | |
|
|
2398 | int |
|
|
2399 | reduction_dir[SIZEOFFREE][3] = { |
2226 | int reduction_dir[SIZEOFFREE][3] = { |
2400 | {0, 0, 0}, /* 0 */ |
2227 | {0, 0, 0}, /* 0 */ |
2401 | {0, 0, 0}, /* 1 */ |
2228 | {0, 0, 0}, /* 1 */ |
2402 | {0, 0, 0}, /* 2 */ |
2229 | {0, 0, 0}, /* 2 */ |
2403 | {0, 0, 0}, /* 3 */ |
2230 | {0, 0, 0}, /* 3 */ |
2404 | {0, 0, 0}, /* 4 */ |
2231 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2452 | * find a path to that monster that we found. If not, |
2279 | * find a path to that monster that we found. If not, |
2453 | * we don't bother going toward it. Returns 1 if we |
2280 | * we don't bother going toward it. Returns 1 if we |
2454 | * can see a direct way to get it |
2281 | * can see a direct way to get it |
2455 | * Modified to be map tile aware -.MSW |
2282 | * Modified to be map tile aware -.MSW |
2456 | */ |
2283 | */ |
2457 | |
|
|
2458 | |
|
|
2459 | int |
2284 | int |
2460 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2285 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2461 | { |
2286 | { |
2462 | sint16 dx, dy; |
2287 | sint16 dx, dy; |
2463 | int |
|
|
2464 | mflags; |
2288 | int mflags; |
2465 | |
2289 | |
2466 | if (dir < 0) |
2290 | if (dir < 0) |
2467 | return 0; /* exit condition: invalid direction */ |
2291 | return 0; /* exit condition: invalid direction */ |
2468 | |
2292 | |
2469 | dx = x + freearr_x[dir]; |
2293 | dx = x + freearr_x[dir]; |
… | |
… | |
2482 | return 0; |
2306 | return 0; |
2483 | |
2307 | |
2484 | /* yes, can see. */ |
2308 | /* yes, can see. */ |
2485 | if (dir < 9) |
2309 | if (dir < 9) |
2486 | return 1; |
2310 | return 1; |
|
|
2311 | |
2487 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | |
2312 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2488 | 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]); |
2489 | } |
2315 | } |
2490 | |
|
|
2491 | |
|
|
2492 | |
2316 | |
2493 | /* |
2317 | /* |
2494 | * 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 |
2495 | * picked up by the picker. Returnes 1 if it can be |
2319 | * picked up by the picker. Returnes 1 if it can be |
2496 | * picked up, otherwise 0. |
2320 | * picked up, otherwise 0. |
… | |
… | |
2507 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2331 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2508 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2332 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2509 | !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)); |
2510 | } |
2334 | } |
2511 | |
2335 | |
2512 | |
|
|
2513 | /* |
2336 | /* |
2514 | * create clone from object to another |
2337 | * create clone from object to another |
2515 | */ |
2338 | */ |
2516 | object * |
2339 | object * |
2517 | object_create_clone (object *asrc) |
2340 | object_create_clone (object *asrc) |
… | |
… | |
2536 | { |
2359 | { |
2537 | dst = tmp; |
2360 | dst = tmp; |
2538 | tmp->head = 0; |
2361 | tmp->head = 0; |
2539 | } |
2362 | } |
2540 | else |
2363 | else |
2541 | { |
|
|
2542 | tmp->head = dst; |
2364 | tmp->head = dst; |
2543 | } |
|
|
2544 | |
2365 | |
2545 | tmp->more = 0; |
2366 | tmp->more = 0; |
2546 | |
2367 | |
2547 | if (prev) |
2368 | if (prev) |
2548 | prev->more = tmp; |
2369 | prev->more = tmp; |
… | |
… | |
2560 | /* 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 */ |
2561 | /* 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, */ |
2562 | /* 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. */ |
2563 | /* 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. */ |
2564 | /* Also remember that multiparts objects are not supported for now. */ |
2385 | /* Also remember that multiparts objects are not supported for now. */ |
2565 | |
|
|
2566 | object * |
2386 | object * |
2567 | load_object_str (const char *obstr) |
2387 | load_object_str (const char *obstr) |
2568 | { |
2388 | { |
2569 | object *op; |
2389 | object *op; |
2570 | char filename[MAX_BUF]; |
2390 | char filename[MAX_BUF]; |
… | |
… | |
2600 | * returns NULL if no match. |
2420 | * returns NULL if no match. |
2601 | */ |
2421 | */ |
2602 | object * |
2422 | object * |
2603 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2423 | find_obj_by_type_subtype (const object *who, int type, int subtype) |
2604 | { |
2424 | { |
2605 | object *tmp; |
|
|
2606 | |
|
|
2607 | for (tmp = who->inv; tmp; tmp = tmp->below) |
2425 | for (object *tmp = who->inv; tmp; tmp = tmp->below) |
2608 | if (tmp->type == type && tmp->subtype == subtype) |
2426 | if (tmp->type == type && tmp->subtype == subtype) |
2609 | return tmp; |
2427 | return tmp; |
2610 | |
2428 | |
2611 | return NULL; |
2429 | return 0; |
2612 | } |
2430 | } |
2613 | |
2431 | |
2614 | /* 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, |
2615 | * otherwise return NULL. |
2433 | * otherwise return NULL. |
2616 | * |
2434 | * |
… | |
… | |
2618 | * do the desired thing. |
2436 | * do the desired thing. |
2619 | */ |
2437 | */ |
2620 | key_value * |
2438 | key_value * |
2621 | get_ob_key_link (const object *ob, const char *key) |
2439 | get_ob_key_link (const object *ob, const char *key) |
2622 | { |
2440 | { |
2623 | key_value *link; |
|
|
2624 | |
|
|
2625 | for (link = ob->key_values; link != NULL; link = link->next) |
2441 | for (key_value *link = ob->key_values; link; link = link->next) |
2626 | if (link->key == key) |
2442 | if (link->key == key) |
2627 | return link; |
2443 | return link; |
2628 | |
2444 | |
2629 | return NULL; |
2445 | return 0; |
2630 | } |
2446 | } |
2631 | |
2447 | |
2632 | /* |
2448 | /* |
2633 | * 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. |
2634 | * |
2450 | * |
… | |
… | |
2674 | * Returns TRUE on success. |
2490 | * Returns TRUE on success. |
2675 | */ |
2491 | */ |
2676 | int |
2492 | int |
2677 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2493 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2678 | { |
2494 | { |
2679 | key_value * |
|
|
2680 | field = NULL, *last = NULL; |
2495 | key_value *field = NULL, *last = NULL; |
2681 | |
2496 | |
2682 | for (field = op->key_values; field != NULL; field = field->next) |
2497 | for (field = op->key_values; field != NULL; field = field->next) |
2683 | { |
2498 | { |
2684 | if (field->key != canonical_key) |
2499 | if (field->key != canonical_key) |
2685 | { |
2500 | { |
… | |
… | |
2713 | /* IF we get here, key doesn't exist */ |
2528 | /* IF we get here, key doesn't exist */ |
2714 | |
2529 | |
2715 | /* No field, we'll have to add it. */ |
2530 | /* No field, we'll have to add it. */ |
2716 | |
2531 | |
2717 | if (!add_key) |
2532 | if (!add_key) |
2718 | { |
|
|
2719 | return FALSE; |
2533 | return FALSE; |
2720 | } |
2534 | |
2721 | /* There isn't any good reason to store a null |
2535 | /* There isn't any good reason to store a null |
2722 | * value in the key/value list. If the archetype has |
2536 | * value in the key/value list. If the archetype has |
2723 | * this key, then we should also have it, so shouldn't |
2537 | * this key, then we should also have it, so shouldn't |
2724 | * be here. If user wants to store empty strings, |
2538 | * be here. If user wants to store empty strings, |
2725 | * should pass in "" |
2539 | * should pass in "" |