1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | CrossFire, A Multiplayer game for X-windows |
3 | |
3 | |
|
|
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | |
7 | |
7 | This program is free software; you can redistribute it and/or modify |
8 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | it under the terms of the GNU General Public License as published by |
… | |
… | |
36 | |
37 | |
37 | int nrofallocobjects = 0; |
38 | int nrofallocobjects = 0; |
38 | static UUID uuid; |
39 | static UUID uuid; |
39 | const uint64 UUID_SKIP = 1<<19; |
40 | const uint64 UUID_SKIP = 1<<19; |
40 | |
41 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
43 | activevec actives; |
42 | |
44 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
47 | }; |
46 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
… | |
… | |
390 | } |
392 | } |
391 | |
393 | |
392 | /* |
394 | /* |
393 | * Returns the object which has the count-variable equal to the argument. |
395 | * Returns the object which has the count-variable equal to the argument. |
394 | */ |
396 | */ |
395 | |
|
|
396 | object * |
397 | object * |
397 | find_object (tag_t i) |
398 | find_object (tag_t i) |
398 | { |
399 | { |
399 | for (object *op = object::first; op; op = op->next) |
400 | for_all_objects (op) |
400 | if (op->count == i) |
401 | if (op->count == i) |
401 | return op; |
402 | return op; |
402 | |
403 | |
403 | return 0; |
404 | return 0; |
404 | } |
405 | } |
405 | |
406 | |
406 | /* |
407 | /* |
407 | * Returns the first object which has a name equal to the argument. |
408 | * Returns the first object which has a name equal to the argument. |
408 | * Used only by the patch command, but not all that useful. |
409 | * Used only by the patch command, but not all that useful. |
409 | * Enables features like "patch <name-of-other-player> food 999" |
410 | * Enables features like "patch <name-of-other-player> food 999" |
410 | */ |
411 | */ |
411 | |
|
|
412 | object * |
412 | object * |
413 | find_object_name (const char *str) |
413 | find_object_name (const char *str) |
414 | { |
414 | { |
415 | shstr_cmp str_ (str); |
415 | shstr_cmp str_ (str); |
416 | object *op; |
416 | object *op; |
417 | |
417 | |
418 | for (op = object::first; op != NULL; op = op->next) |
418 | for_all_objects (op) |
419 | if (op->name == str_) |
419 | if (op->name == str_) |
420 | break; |
420 | break; |
421 | |
421 | |
422 | return op; |
422 | return op; |
423 | } |
423 | } |
… | |
… | |
660 | |
660 | |
661 | if (op->more) |
661 | if (op->more) |
662 | update_object (op->more, action); |
662 | update_object (op->more, action); |
663 | } |
663 | } |
664 | |
664 | |
665 | object *object::first; |
|
|
666 | |
|
|
667 | object::object () |
665 | object::object () |
668 | { |
666 | { |
669 | SET_FLAG (this, FLAG_REMOVED); |
667 | SET_FLAG (this, FLAG_REMOVED); |
670 | |
668 | |
671 | expmul = 1.0; |
669 | expmul = 1.0; |
… | |
… | |
675 | object::~object () |
673 | object::~object () |
676 | { |
674 | { |
677 | free_key_values (this); |
675 | free_key_values (this); |
678 | } |
676 | } |
679 | |
677 | |
|
|
678 | static int object_count; |
|
|
679 | |
680 | void object::link () |
680 | void object::link () |
681 | { |
681 | { |
682 | count = ++ob_count; |
682 | assert (!index);//D |
683 | uuid = gen_uuid (); |
683 | uuid = gen_uuid (); |
|
|
684 | count = ++object_count; |
684 | |
685 | |
685 | prev = 0; |
686 | refcnt_inc (); |
686 | next = object::first; |
687 | objects.insert (this); |
687 | |
|
|
688 | if (object::first) |
|
|
689 | object::first->prev = this; |
|
|
690 | |
|
|
691 | object::first = this; |
|
|
692 | } |
688 | } |
693 | |
689 | |
694 | void object::unlink () |
690 | void object::unlink () |
695 | { |
691 | { |
696 | if (this == object::first) |
692 | assert (index);//D |
697 | object::first = next; |
693 | objects.erase (this); |
698 | |
694 | refcnt_dec (); |
699 | /* Remove this object from the list of used objects */ |
|
|
700 | if (prev) prev->next = next; |
|
|
701 | if (next) next->prev = prev; |
|
|
702 | |
|
|
703 | prev = 0; |
|
|
704 | next = 0; |
|
|
705 | } |
|
|
706 | |
|
|
707 | bool |
|
|
708 | object::active () const |
|
|
709 | { |
|
|
710 | return active_next || active_prev || this == active_objects; |
|
|
711 | } |
695 | } |
712 | |
696 | |
713 | void |
697 | void |
714 | object::activate () |
698 | object::activate () |
715 | { |
699 | { |
716 | /* If already on active list, don't do anything */ |
700 | /* If already on active list, don't do anything */ |
717 | if (active ()) |
701 | if (active) |
718 | return; |
702 | return; |
719 | |
703 | |
720 | if (has_active_speed ()) |
704 | if (has_active_speed ()) |
721 | { |
705 | actives.insert (this); |
722 | /* process_events() expects us to insert the object at the beginning |
|
|
723 | * of the list. */ |
|
|
724 | active_next = active_objects; |
|
|
725 | |
|
|
726 | if (active_next) |
|
|
727 | active_next->active_prev = this; |
|
|
728 | |
|
|
729 | active_objects = this; |
|
|
730 | } |
|
|
731 | } |
706 | } |
732 | |
707 | |
733 | void |
708 | void |
734 | object::activate_recursive () |
709 | object::activate_recursive () |
735 | { |
710 | { |
736 | activate (); |
711 | activate (); |
737 | |
712 | |
738 | for (object *op = inv; op; op = op->above) |
713 | for (object *op = inv; op; op = op->below) |
739 | op->activate_recursive (); |
714 | op->activate_recursive (); |
740 | } |
715 | } |
741 | |
716 | |
742 | /* This function removes object 'op' from the list of active |
717 | /* This function removes object 'op' from the list of active |
743 | * objects. |
718 | * objects. |
… | |
… | |
749 | */ |
724 | */ |
750 | void |
725 | void |
751 | object::deactivate () |
726 | object::deactivate () |
752 | { |
727 | { |
753 | /* If not on the active list, nothing needs to be done */ |
728 | /* If not on the active list, nothing needs to be done */ |
754 | if (!active ()) |
729 | if (!active) |
755 | return; |
730 | return; |
756 | |
731 | |
757 | if (active_prev == 0) |
732 | actives.erase (this); |
758 | { |
|
|
759 | active_objects = active_next; |
|
|
760 | if (active_next) |
|
|
761 | active_next->active_prev = 0; |
|
|
762 | } |
|
|
763 | else |
|
|
764 | { |
|
|
765 | active_prev->active_next = active_next; |
|
|
766 | if (active_next) |
|
|
767 | active_next->active_prev = active_prev; |
|
|
768 | } |
|
|
769 | |
|
|
770 | active_next = 0; |
|
|
771 | active_prev = 0; |
|
|
772 | } |
733 | } |
773 | |
734 | |
774 | void |
735 | void |
775 | object::deactivate_recursive () |
736 | object::deactivate_recursive () |
776 | { |
737 | { |
777 | for (object *op = inv; op; op = op->above) |
738 | for (object *op = inv; op; op = op->below) |
778 | op->deactivate_recursive (); |
739 | op->deactivate_recursive (); |
779 | |
740 | |
780 | deactivate (); |
741 | deactivate (); |
|
|
742 | } |
|
|
743 | |
|
|
744 | void |
|
|
745 | object::set_flag_inv (int flag, int value) |
|
|
746 | { |
|
|
747 | for (object *op = inv; op; op = op->below) |
|
|
748 | { |
|
|
749 | op->flag [flag] = value; |
|
|
750 | op->set_flag_inv (flag, value); |
|
|
751 | } |
781 | } |
752 | } |
782 | |
753 | |
783 | /* |
754 | /* |
784 | * Remove and free all objects in the inventory of the given object. |
755 | * Remove and free all objects in the inventory of the given object. |
785 | * object.c ? |
756 | * object.c ? |
… | |
… | |
818 | |
789 | |
819 | if (op->flag [FLAG_STARTEQUIP] |
790 | if (op->flag [FLAG_STARTEQUIP] |
820 | || op->flag [FLAG_NO_DROP] |
791 | || op->flag [FLAG_NO_DROP] |
821 | || op->type == RUNE |
792 | || op->type == RUNE |
822 | || op->type == TRAP |
793 | || op->type == TRAP |
823 | || op->flag [FLAG_IS_A_TEMPLATE]) |
794 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
795 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
824 | op->destroy (); |
796 | op->destroy (); |
825 | else |
797 | else |
826 | map->insert (op, x, y); |
798 | map->insert (op, x, y); |
827 | } |
799 | } |
828 | } |
800 | } |
… | |
… | |
836 | } |
808 | } |
837 | |
809 | |
838 | void |
810 | void |
839 | object::do_destroy () |
811 | object::do_destroy () |
840 | { |
812 | { |
|
|
813 | attachable::do_destroy (); |
|
|
814 | |
841 | if (flag [FLAG_IS_LINKED]) |
815 | if (flag [FLAG_IS_LINKED]) |
842 | remove_button_link (this); |
816 | remove_button_link (this); |
843 | |
817 | |
844 | if (flag [FLAG_FRIENDLY]) |
818 | if (flag [FLAG_FRIENDLY]) |
845 | remove_friendly_object (this); |
819 | remove_friendly_object (this); |
846 | |
820 | |
847 | if (!flag [FLAG_REMOVED]) |
821 | if (!flag [FLAG_REMOVED]) |
848 | remove (); |
822 | remove (); |
849 | |
823 | |
850 | if (flag [FLAG_FREED]) |
824 | destroy_inv (true); |
851 | return; |
|
|
852 | |
825 | |
853 | set_speed (0); |
826 | deactivate (); |
|
|
827 | unlink (); |
854 | |
828 | |
855 | flag [FLAG_FREED] = 1; |
829 | flag [FLAG_FREED] = 1; |
856 | |
|
|
857 | attachable::do_destroy (); |
|
|
858 | |
|
|
859 | destroy_inv (true); |
|
|
860 | unlink (); |
|
|
861 | |
830 | |
862 | // hack to ensure that freed objects still have a valid map |
831 | // hack to ensure that freed objects still have a valid map |
863 | { |
832 | { |
864 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
833 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
865 | |
834 | |
… | |
… | |
890 | |
859 | |
891 | // clear those pointers that likely might have circular references to us |
860 | // clear those pointers that likely might have circular references to us |
892 | owner = 0; |
861 | owner = 0; |
893 | enemy = 0; |
862 | enemy = 0; |
894 | attacked_by = 0; |
863 | attacked_by = 0; |
895 | |
|
|
896 | // only relevant for players(?), but make sure of it anyways |
|
|
897 | contr = 0; |
|
|
898 | } |
864 | } |
899 | |
865 | |
900 | void |
866 | void |
901 | object::destroy (bool destroy_inventory) |
867 | object::destroy (bool destroy_inventory) |
902 | { |
868 | { |
… | |
… | |
1204 | { |
1170 | { |
1205 | /* The part may be on a different map. */ |
1171 | /* The part may be on a different map. */ |
1206 | |
1172 | |
1207 | object *more = op->more; |
1173 | object *more = op->more; |
1208 | |
1174 | |
1209 | /* We really need the caller to normalize coordinates - if |
1175 | /* We really need the caller to normalise coordinates - if |
1210 | * we set the map, that doesn't work if the location is within |
1176 | * we set the map, that doesn't work if the location is within |
1211 | * a map and this is straddling an edge. So only if coordinate |
1177 | * a map and this is straddling an edge. So only if coordinate |
1212 | * is clear wrong do we normalize it. |
1178 | * is clear wrong do we normalise it. |
1213 | */ |
1179 | */ |
1214 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1180 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1215 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1181 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1216 | else if (!more->map) |
1182 | else if (!more->map) |
1217 | { |
1183 | { |
… | |
… | |
1444 | { |
1410 | { |
1445 | object *tmp, *tmp1; |
1411 | object *tmp, *tmp1; |
1446 | |
1412 | |
1447 | /* first search for itself and remove any old instances */ |
1413 | /* first search for itself and remove any old instances */ |
1448 | |
1414 | |
1449 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1415 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1450 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1416 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1451 | tmp->destroy (); |
1417 | tmp->destroy (); |
1452 | |
1418 | |
1453 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1419 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1454 | |
1420 | |
… | |
… | |
1777 | |
1743 | |
1778 | /* The objects have to be checked from top to bottom. |
1744 | /* The objects have to be checked from top to bottom. |
1779 | * Hence, we first go to the top: |
1745 | * Hence, we first go to the top: |
1780 | */ |
1746 | */ |
1781 | |
1747 | |
1782 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1748 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1783 | { |
1749 | { |
1784 | /* Trim the search when we find the first other spell effect |
1750 | /* Trim the search when we find the first other spell effect |
1785 | * this helps performance so that if a space has 50 spell objects, |
1751 | * this helps performance so that if a space has 50 spell objects, |
1786 | * we don't need to check all of them. |
1752 | * we don't need to check all of them. |
1787 | */ |
1753 | */ |
… | |
… | |
1845 | * The first matching object is returned, or NULL if none. |
1811 | * The first matching object is returned, or NULL if none. |
1846 | */ |
1812 | */ |
1847 | object * |
1813 | object * |
1848 | present_arch (const archetype *at, maptile *m, int x, int y) |
1814 | present_arch (const archetype *at, maptile *m, int x, int y) |
1849 | { |
1815 | { |
1850 | if (m == NULL || out_of_map (m, x, y)) |
1816 | if (!m || out_of_map (m, x, y)) |
1851 | { |
1817 | { |
1852 | LOG (llevError, "Present_arch called outside map.\n"); |
1818 | LOG (llevError, "Present_arch called outside map.\n"); |
1853 | return NULL; |
1819 | return NULL; |
1854 | } |
1820 | } |
1855 | |
1821 | |
1856 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1822 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1857 | if (tmp->arch == at) |
1823 | if (tmp->arch == at) |
1858 | return tmp; |
1824 | return tmp; |
1859 | |
1825 | |
1860 | return NULL; |
1826 | return NULL; |
1861 | } |
1827 | } |
… | |
… | |
1872 | { |
1838 | { |
1873 | LOG (llevError, "Present called outside map.\n"); |
1839 | LOG (llevError, "Present called outside map.\n"); |
1874 | return NULL; |
1840 | return NULL; |
1875 | } |
1841 | } |
1876 | |
1842 | |
1877 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1843 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1878 | if (tmp->type == type) |
1844 | if (tmp->type == type) |
1879 | return tmp; |
1845 | return tmp; |
1880 | |
1846 | |
1881 | return NULL; |
1847 | return NULL; |
1882 | } |
1848 | } |
… | |
… | |
2197 | |
2163 | |
2198 | return 3; |
2164 | return 3; |
2199 | } |
2165 | } |
2200 | |
2166 | |
2201 | /* |
2167 | /* |
2202 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2203 | * the "absolute" direction of a number (it actually takes care of |
|
|
2204 | * "overflow" in previous calculations of a direction). |
|
|
2205 | */ |
|
|
2206 | |
|
|
2207 | int |
|
|
2208 | absdir (int d) |
|
|
2209 | { |
|
|
2210 | while (d < 1) |
|
|
2211 | d += 8; |
|
|
2212 | |
|
|
2213 | while (d > 8) |
|
|
2214 | d -= 8; |
|
|
2215 | |
|
|
2216 | return d; |
|
|
2217 | } |
|
|
2218 | |
|
|
2219 | /* |
|
|
2220 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2168 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2221 | * between two directions (which are expected to be absolute (see absdir()) |
2169 | * between two directions (which are expected to be absolute (see absdir()) |
2222 | */ |
2170 | */ |
2223 | |
|
|
2224 | int |
2171 | int |
2225 | dirdiff (int dir1, int dir2) |
2172 | dirdiff (int dir1, int dir2) |
2226 | { |
2173 | { |
2227 | int d; |
2174 | int d; |
2228 | |
2175 | |
… | |
… | |
2667 | { |
2614 | { |
2668 | static char info[256 * 4]; |
2615 | static char info[256 * 4]; |
2669 | return debug_desc (info); |
2616 | return debug_desc (info); |
2670 | } |
2617 | } |
2671 | |
2618 | |
|
|
2619 | const char * |
|
|
2620 | object::debug_desc2 () const |
|
|
2621 | { |
|
|
2622 | static char info[256 * 4]; |
|
|
2623 | return debug_desc (info); |
|
|
2624 | } |
|
|
2625 | |