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