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 | return ((unsigned int)i) < objects.size () |
400 | if (op->count == i) |
401 | ? objects [i] |
401 | return op; |
402 | : 0; |
402 | |
|
|
403 | return 0; |
|
|
404 | } |
403 | } |
405 | |
404 | |
406 | /* |
405 | /* |
407 | * Returns the first object which has a name equal to the argument. |
406 | * Returns the first object which has a name equal to the argument. |
408 | * Used only by the patch command, but not all that useful. |
407 | * Used only by the patch command, but not all that useful. |
409 | * Enables features like "patch <name-of-other-player> food 999" |
408 | * Enables features like "patch <name-of-other-player> food 999" |
410 | */ |
409 | */ |
411 | |
|
|
412 | object * |
410 | object * |
413 | find_object_name (const char *str) |
411 | find_object_name (const char *str) |
414 | { |
412 | { |
415 | shstr_cmp str_ (str); |
413 | shstr_cmp str_ (str); |
416 | object *op; |
414 | object *op; |
417 | |
415 | |
418 | for (op = object::first; op != NULL; op = op->next) |
416 | for_all_objects (op) |
419 | if (op->name == str_) |
417 | if (op->name == str_) |
420 | break; |
418 | break; |
421 | |
419 | |
422 | return op; |
420 | return op; |
423 | } |
421 | } |
… | |
… | |
677 | free_key_values (this); |
675 | free_key_values (this); |
678 | } |
676 | } |
679 | |
677 | |
680 | void object::link () |
678 | void object::link () |
681 | { |
679 | { |
682 | count = ++ob_count; |
|
|
683 | uuid = gen_uuid (); |
680 | uuid = gen_uuid (); |
684 | |
681 | |
685 | prev = 0; |
682 | objects.insert (this); |
686 | next = object::first; |
|
|
687 | |
|
|
688 | if (object::first) |
|
|
689 | object::first->prev = this; |
|
|
690 | |
|
|
691 | object::first = this; |
|
|
692 | } |
683 | } |
693 | |
684 | |
694 | void object::unlink () |
685 | void object::unlink () |
695 | { |
686 | { |
696 | if (this == object::first) |
687 | objects.erase (this); |
697 | object::first = next; |
|
|
698 | |
|
|
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 | } |
688 | } |
712 | |
689 | |
713 | void |
690 | void |
714 | object::activate () |
691 | object::activate () |
715 | { |
692 | { |
716 | /* If already on active list, don't do anything */ |
693 | /* If already on active list, don't do anything */ |
717 | if (active ()) |
694 | if (active) |
718 | return; |
695 | return; |
719 | |
696 | |
720 | if (has_active_speed ()) |
697 | if (has_active_speed ()) |
721 | { |
698 | 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 | } |
699 | } |
732 | |
700 | |
733 | void |
701 | void |
734 | object::activate_recursive () |
702 | object::activate_recursive () |
735 | { |
703 | { |
736 | activate (); |
704 | activate (); |
737 | |
705 | |
738 | for (object *op = inv; op; op = op->above) |
706 | for (object *op = inv; op; op = op->below) |
739 | op->activate_recursive (); |
707 | op->activate_recursive (); |
740 | } |
708 | } |
741 | |
709 | |
742 | /* This function removes object 'op' from the list of active |
710 | /* This function removes object 'op' from the list of active |
743 | * objects. |
711 | * objects. |
… | |
… | |
749 | */ |
717 | */ |
750 | void |
718 | void |
751 | object::deactivate () |
719 | object::deactivate () |
752 | { |
720 | { |
753 | /* If not on the active list, nothing needs to be done */ |
721 | /* If not on the active list, nothing needs to be done */ |
754 | if (!active ()) |
722 | if (!active) |
755 | return; |
723 | return; |
756 | |
724 | |
757 | if (active_prev == 0) |
725 | 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 | } |
726 | } |
773 | |
727 | |
774 | void |
728 | void |
775 | object::deactivate_recursive () |
729 | object::deactivate_recursive () |
776 | { |
730 | { |
777 | for (object *op = inv; op; op = op->above) |
731 | for (object *op = inv; op; op = op->below) |
778 | op->deactivate_recursive (); |
732 | op->deactivate_recursive (); |
779 | |
733 | |
780 | deactivate (); |
734 | deactivate (); |
|
|
735 | } |
|
|
736 | |
|
|
737 | void |
|
|
738 | object::set_flag_inv (int flag, int value) |
|
|
739 | { |
|
|
740 | for (object *op = inv; op; op = op->below) |
|
|
741 | { |
|
|
742 | op->flag [flag] = value; |
|
|
743 | op->set_flag_inv (flag, value); |
|
|
744 | } |
781 | } |
745 | } |
782 | |
746 | |
783 | /* |
747 | /* |
784 | * Remove and free all objects in the inventory of the given object. |
748 | * Remove and free all objects in the inventory of the given object. |
785 | * object.c ? |
749 | * object.c ? |
… | |
… | |
870 | freed_map->name = "/internal/freed_objects_map"; |
834 | freed_map->name = "/internal/freed_objects_map"; |
871 | freed_map->width = 3; |
835 | freed_map->width = 3; |
872 | freed_map->height = 3; |
836 | freed_map->height = 3; |
873 | |
837 | |
874 | freed_map->alloc (); |
838 | freed_map->alloc (); |
|
|
839 | freed_map->in_memory = MAP_IN_MEMORY; |
875 | } |
840 | } |
876 | |
841 | |
877 | map = freed_map; |
842 | map = freed_map; |
878 | x = 1; |
843 | x = 1; |
879 | y = 1; |
844 | y = 1; |
… | |
… | |
889 | |
854 | |
890 | // clear those pointers that likely might have circular references to us |
855 | // clear those pointers that likely might have circular references to us |
891 | owner = 0; |
856 | owner = 0; |
892 | enemy = 0; |
857 | enemy = 0; |
893 | attacked_by = 0; |
858 | attacked_by = 0; |
894 | |
|
|
895 | // only relevant for players(?), but make sure of it anyways |
|
|
896 | contr = 0; |
|
|
897 | } |
859 | } |
898 | |
860 | |
899 | void |
861 | void |
900 | object::destroy (bool destroy_inventory) |
862 | object::destroy (bool destroy_inventory) |
901 | { |
863 | { |
… | |
… | |
986 | else if (map) |
948 | else if (map) |
987 | { |
949 | { |
988 | if (type == PLAYER) |
950 | if (type == PLAYER) |
989 | { |
951 | { |
990 | --map->players; |
952 | --map->players; |
991 | map->last_access = runtime; |
953 | map->touch (); |
992 | } |
954 | } |
993 | |
955 | |
994 | map->dirty = true; |
956 | map->dirty = true; |
995 | |
957 | |
996 | /* link the object above us */ |
958 | /* link the object above us */ |
… | |
… | |
1203 | { |
1165 | { |
1204 | /* The part may be on a different map. */ |
1166 | /* The part may be on a different map. */ |
1205 | |
1167 | |
1206 | object *more = op->more; |
1168 | object *more = op->more; |
1207 | |
1169 | |
1208 | /* We really need the caller to normalize coordinates - if |
1170 | /* We really need the caller to normalise coordinates - if |
1209 | * we set the map, that doesn't work if the location is within |
1171 | * we set the map, that doesn't work if the location is within |
1210 | * a map and this is straddling an edge. So only if coordinate |
1172 | * a map and this is straddling an edge. So only if coordinate |
1211 | * is clear wrong do we normalize it. |
1173 | * is clear wrong do we normalise it. |
1212 | */ |
1174 | */ |
1213 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1175 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
1214 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1176 | more->map = get_map_from_coord (m, &more->x, &more->y); |
1215 | else if (!more->map) |
1177 | else if (!more->map) |
1216 | { |
1178 | { |
… | |
… | |
1376 | |
1338 | |
1377 | if (op->type == PLAYER) |
1339 | if (op->type == PLAYER) |
1378 | { |
1340 | { |
1379 | op->contr->do_los = 1; |
1341 | op->contr->do_los = 1; |
1380 | ++op->map->players; |
1342 | ++op->map->players; |
1381 | op->map->last_access = runtime; |
1343 | op->map->touch (); |
1382 | } |
1344 | } |
1383 | |
1345 | |
1384 | op->map->dirty = true; |
1346 | op->map->dirty = true; |
1385 | |
1347 | |
1386 | /* If we have a floor, we know the player, if any, will be above |
1348 | /* If we have a floor, we know the player, if any, will be above |
… | |
… | |
1443 | { |
1405 | { |
1444 | object *tmp, *tmp1; |
1406 | object *tmp, *tmp1; |
1445 | |
1407 | |
1446 | /* first search for itself and remove any old instances */ |
1408 | /* first search for itself and remove any old instances */ |
1447 | |
1409 | |
1448 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1410 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1449 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1411 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1450 | tmp->destroy (); |
1412 | tmp->destroy (); |
1451 | |
1413 | |
1452 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1414 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1453 | |
1415 | |
… | |
… | |
1776 | |
1738 | |
1777 | /* The objects have to be checked from top to bottom. |
1739 | /* The objects have to be checked from top to bottom. |
1778 | * Hence, we first go to the top: |
1740 | * Hence, we first go to the top: |
1779 | */ |
1741 | */ |
1780 | |
1742 | |
1781 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1743 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1782 | { |
1744 | { |
1783 | /* Trim the search when we find the first other spell effect |
1745 | /* Trim the search when we find the first other spell effect |
1784 | * this helps performance so that if a space has 50 spell objects, |
1746 | * this helps performance so that if a space has 50 spell objects, |
1785 | * we don't need to check all of them. |
1747 | * we don't need to check all of them. |
1786 | */ |
1748 | */ |
… | |
… | |
1844 | * The first matching object is returned, or NULL if none. |
1806 | * The first matching object is returned, or NULL if none. |
1845 | */ |
1807 | */ |
1846 | object * |
1808 | object * |
1847 | present_arch (const archetype *at, maptile *m, int x, int y) |
1809 | present_arch (const archetype *at, maptile *m, int x, int y) |
1848 | { |
1810 | { |
1849 | if (m == NULL || out_of_map (m, x, y)) |
1811 | if (!m || out_of_map (m, x, y)) |
1850 | { |
1812 | { |
1851 | LOG (llevError, "Present_arch called outside map.\n"); |
1813 | LOG (llevError, "Present_arch called outside map.\n"); |
1852 | return NULL; |
1814 | return NULL; |
1853 | } |
1815 | } |
1854 | |
1816 | |
1855 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1817 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1856 | if (tmp->arch == at) |
1818 | if (tmp->arch == at) |
1857 | return tmp; |
1819 | return tmp; |
1858 | |
1820 | |
1859 | return NULL; |
1821 | return NULL; |
1860 | } |
1822 | } |
… | |
… | |
1871 | { |
1833 | { |
1872 | LOG (llevError, "Present called outside map.\n"); |
1834 | LOG (llevError, "Present called outside map.\n"); |
1873 | return NULL; |
1835 | return NULL; |
1874 | } |
1836 | } |
1875 | |
1837 | |
1876 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1838 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1877 | if (tmp->type == type) |
1839 | if (tmp->type == type) |
1878 | return tmp; |
1840 | return tmp; |
1879 | |
1841 | |
1880 | return NULL; |
1842 | return NULL; |
1881 | } |
1843 | } |
… | |
… | |
2613 | object::flag_desc (char *desc, int len) const |
2575 | object::flag_desc (char *desc, int len) const |
2614 | { |
2576 | { |
2615 | char *p = desc; |
2577 | char *p = desc; |
2616 | bool first = true; |
2578 | bool first = true; |
2617 | |
2579 | |
|
|
2580 | *p = 0; |
|
|
2581 | |
2618 | for (int i = 0; i < NUM_FLAGS; i++) |
2582 | for (int i = 0; i < NUM_FLAGS; i++) |
2619 | { |
2583 | { |
2620 | if (len <= 10) // magic constant! |
2584 | if (len <= 10) // magic constant! |
2621 | { |
2585 | { |
2622 | snprintf (p, len, ",..."); |
2586 | snprintf (p, len, ",..."); |
2623 | break; |
2587 | break; |
2624 | } |
2588 | } |
2625 | |
2589 | |
2626 | if (flag[i]) |
2590 | if (flag [i]) |
2627 | { |
2591 | { |
2628 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
2592 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
2629 | len -= cnt; |
2593 | len -= cnt; |
2630 | p += cnt; |
2594 | p += cnt; |
2631 | first = false; |
2595 | first = false; |
… | |
… | |
2633 | } |
2597 | } |
2634 | |
2598 | |
2635 | return desc; |
2599 | return desc; |
2636 | } |
2600 | } |
2637 | |
2601 | |
2638 | // return a suitable string describing an objetc in enough detail to find it |
2602 | // return a suitable string describing an object in enough detail to find it |
2639 | const char * |
2603 | const char * |
2640 | object::debug_desc (char *info) const |
2604 | object::debug_desc (char *info) const |
2641 | { |
2605 | { |
2642 | char flagdesc[512]; |
2606 | char flagdesc[512]; |
2643 | char info2[256 * 4]; |
2607 | char info2[256 * 4]; |
… | |
… | |
2660 | } |
2624 | } |
2661 | |
2625 | |
2662 | const char * |
2626 | const char * |
2663 | object::debug_desc () const |
2627 | object::debug_desc () const |
2664 | { |
2628 | { |
2665 | static char info[256 * 3]; |
2629 | static char info[256 * 4]; |
2666 | return debug_desc (info); |
2630 | return debug_desc (info); |
2667 | } |
2631 | } |
2668 | |
2632 | |