ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.30 by root, Mon Sep 11 20:28:37 2006 UTC vs.
Revision 1.39 by root, Wed Sep 13 02:05:19 2006 UTC

… …
29#include <stdio.h> 29#include <stdio.h>
30#include <sys/types.h> 30#include <sys/types.h>
31#include <sys/uio.h> 31#include <sys/uio.h>
32#include <object.h> 32#include <object.h>
33#include <funcpoint.h> 33#include <funcpoint.h>
34#include <skills.h>
35#include <loader.h> 34#include <loader.h>
36 35
37int nrofallocobjects = 0; 36int nrofallocobjects = 0;
37static UUID uuid;
38const uint64 UUID_SKIP = 1<<19;
38 39
39object *objects; /* Pointer to the list of used objects */ 40object *objects; /* Pointer to the list of used objects */
40object *active_objects; /* List of active objects that need to be processed */ 41object *active_objects; /* List of active objects that need to be processed */
41 42
42short 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, 43short 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,
… …
50}; 51};
51int freedir[SIZEOFFREE] = { 52int freedir[SIZEOFFREE] = {
52 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, 53 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
53 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 54 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
54}; 55};
56
57static void
58write_uuid (void)
59{
60 char filename1[MAX_BUF], filename2[MAX_BUF];
61
62 sprintf (filename1, "%s/uuid", settings.localdir);
63 sprintf (filename2, "%s/uuid~", settings.localdir);
64
65 FILE *fp;
66
67 if (!(fp = fopen (filename2, "w")))
68 {
69 LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
70 return;
71 }
72
73 fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
74 fclose (fp);
75 rename (filename2, filename1);
76}
77
78static void
79read_uuid (void)
80{
81 char filename[MAX_BUF];
82
83 sprintf (filename, "%s/uuid", settings.localdir);
84
85 FILE *fp;
86
87 if (!(fp = fopen (filename, "r")))
88 {
89 if (errno == ENOENT)
90 {
91 LOG (llevInfo, "RESET uid to 1\n");
92 uuid.seq = 0;
93 write_uuid ();
94 return;
95 }
96
97 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
98 _exit (1);
99 }
100
101 int version;
102 unsigned long long uid;
103 if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
104 {
105 LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
106 _exit (1);
107 }
108
109 uuid.seq = uid;
110 write_uuid ();
111 LOG (llevDebug, "read UID: %lld\n", uid);
112 fclose (fp);
113}
114
115UUID
116gen_uuid ()
117{
118 UUID uid;
119
120 uid.seq = ++uuid.seq;
121
122 if (!(uuid.seq & (UUID_SKIP - 1)))
123 write_uuid ();
124
125 return uid;
126}
127
128void
129init_uuid ()
130{
131 read_uuid ();
132}
55 133
56/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 134/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
57static int 135static int
58compare_ob_value_lists_one (const object *wants, const object *has) 136compare_ob_value_lists_one (const object *wants, const object *has)
59{ 137{
… …
255 { 333 {
256 if (inv->inv) 334 if (inv->inv)
257 sum_weight (inv); 335 sum_weight (inv);
258 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 336 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
259 } 337 }
338
260 if (op->type == CONTAINER && op->stats.Str) 339 if (op->type == CONTAINER && op->stats.Str)
261 sum = (sum * (100 - op->stats.Str)) / 100; 340 sum = (sum * (100 - op->stats.Str)) / 100;
341
262 if (op->carrying != sum) 342 if (op->carrying != sum)
263 op->carrying = sum; 343 op->carrying = sum;
344
264 return sum; 345 return sum;
265} 346}
266 347
267/** 348/**
268 * Return the outermost environment object for a given object. 349 * Return the outermost environment object for a given object.
… …
417 */ 498 */
418 499
419object * 500object *
420find_object_name (const char *str) 501find_object_name (const char *str)
421{ 502{
422 const char *name = shstr::find (str); 503 shstr_cmp str_ (str);
423 object *op; 504 object *op;
424 505
425 for (op = objects; op != NULL; op = op->next) 506 for (op = objects; op != NULL; op = op->next)
426 if (&op->name == name) 507 if (op->name == str_)
427 break; 508 break;
428 509
429 return op; 510 return op;
430} 511}
431 512
… …
623/* 704/*
624 * Updates the speed of an object. If the speed changes from 0 to another 705 * Updates the speed of an object. If the speed changes from 0 to another
625 * value, or vice versa, then add/remove the object from the active list. 706 * value, or vice versa, then add/remove the object from the active list.
626 * This function needs to be called whenever the speed of an object changes. 707 * This function needs to be called whenever the speed of an object changes.
627 */ 708 */
628
629void 709void
630update_ob_speed (object *op) 710update_ob_speed (object *op)
631{ 711{
632 extern int arch_init; 712 extern int arch_init;
633 713
… …
642 abort (); 722 abort ();
643#else 723#else
644 op->speed = 0; 724 op->speed = 0;
645#endif 725#endif
646 } 726 }
727
647 if (arch_init) 728 if (arch_init)
648 {
649 return; 729 return;
650 } 730
651 if (FABS (op->speed) > MIN_ACTIVE_SPEED) 731 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
652 { 732 {
653 /* If already on active list, don't do anything */ 733 /* If already on active list, don't do anything */
654 if (op->active_next || op->active_prev || op == active_objects) 734 if (op->active_next || op->active_prev || op == active_objects)
655 return; 735 return;
656 736
657 /* process_events() expects us to insert the object at the beginning 737 /* process_events() expects us to insert the object at the beginning
658 * of the list. */ 738 * of the list. */
659 op->active_next = active_objects; 739 op->active_next = active_objects;
740
660 if (op->active_next != NULL) 741 if (op->active_next != NULL)
661 op->active_next->active_prev = op; 742 op->active_next->active_prev = op;
743
662 active_objects = op; 744 active_objects = op;
663 } 745 }
664 else 746 else
665 { 747 {
666 /* If not on the active list, nothing needs to be done */ 748 /* If not on the active list, nothing needs to be done */
… …
668 return; 750 return;
669 751
670 if (op->active_prev == NULL) 752 if (op->active_prev == NULL)
671 { 753 {
672 active_objects = op->active_next; 754 active_objects = op->active_next;
755
673 if (op->active_next != NULL) 756 if (op->active_next != NULL)
674 op->active_next->active_prev = NULL; 757 op->active_next->active_prev = NULL;
675 } 758 }
676 else 759 else
677 { 760 {
678 op->active_prev->active_next = op->active_next; 761 op->active_prev->active_next = op->active_next;
762
679 if (op->active_next) 763 if (op->active_next)
680 op->active_next->active_prev = op->active_prev; 764 op->active_next->active_prev = op->active_prev;
681 } 765 }
766
682 op->active_next = NULL; 767 op->active_next = NULL;
683 op->active_prev = NULL; 768 op->active_prev = NULL;
684 } 769 }
685} 770}
686 771
… …
833 if (op->more != NULL) 918 if (op->more != NULL)
834 update_object (op->more, action); 919 update_object (op->more, action);
835} 920}
836 921
837static unordered_vector<object *> mortals; 922static unordered_vector<object *> mortals;
838static std::vector<object *> freed; 923static std::vector<object *, slice_allocator <object *> > freed;
839 924
840void object::free_mortals () 925void object::free_mortals ()
841{ 926{
842 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();) 927 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
843 if ((*i)->refcnt) 928 if ((*i)->refcnt)
… …
847 freed.push_back (*i);//D 932 freed.push_back (*i);//D
848 //delete *i; 933 //delete *i;
849 mortals.erase (i); 934 mortals.erase (i);
850 } 935 }
851 936
852 if (mortals.size())//D 937 if (mortals.size() && 0)//D
853 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D 938 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D
854} 939}
855 940
856object::object () 941object::object ()
857{ 942{
… …
881} 966}
882 967
883void object::unlink () 968void object::unlink ()
884{ 969{
885 count = 0; 970 count = 0;
971 uuid = gen_uuid ();
972
973 if (this == objects)
974 objects = next;
886 975
887 /* Remove this object from the list of used objects */ 976 /* Remove this object from the list of used objects */
888 if (prev) 977 if (prev)
889 { 978 {
890 prev->next = next; 979 prev->next = next;
… …
894 if (next) 983 if (next)
895 { 984 {
896 next->prev = prev; 985 next->prev = prev;
897 next = 0; 986 next = 0;
898 } 987 }
899
900 if (this == objects)
901 objects = next;
902} 988}
903 989
904object *object::create () 990object *object::create ()
905{ 991{
906 object * 992 object *op;
907 op;
908 993
909 if (freed.empty ()) 994 if (freed.empty ())
910 op = new object; 995 op = new object;
911 else 996 else
912 { 997 {
… …
934void object::free (bool free_inventory) 1019void object::free (bool free_inventory)
935{ 1020{
936 if (QUERY_FLAG (this, FLAG_FREED)) 1021 if (QUERY_FLAG (this, FLAG_FREED))
937 return; 1022 return;
938 1023
1024 if (QUERY_FLAG (this, FLAG_FRIENDLY))
1025 remove_friendly_object (this);
1026
939 if (!QUERY_FLAG (this, FLAG_REMOVED)) 1027 if (!QUERY_FLAG (this, FLAG_REMOVED))
940 remove_ob (this); 1028 remove_ob (this);
941
942 if (QUERY_FLAG (this, FLAG_FRIENDLY))
943 remove_friendly_object (this);
944 1029
945 SET_FLAG (this, FLAG_FREED); 1030 SET_FLAG (this, FLAG_FREED);
946 1031
947 if (more) 1032 if (more)
948 { 1033 {
… …
954 { 1039 {
955 /* Only if the space blocks everything do we not process - 1040 /* Only if the space blocks everything do we not process -
956 * if some form of movement is allowed, let objects 1041 * if some form of movement is allowed, let objects
957 * drop on that space. 1042 * drop on that space.
958 */ 1043 */
959 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) 1044 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
960 { 1045 {
961 object *op = inv; 1046 object *op = inv;
962 1047
963 while (op) 1048 while (op)
964 { 1049 {
… …
1220 * This function goes through all objects below and including top, and 1305 * This function goes through all objects below and including top, and
1221 * merges op to the first matching object. 1306 * merges op to the first matching object.
1222 * If top is NULL, it is calculated. 1307 * If top is NULL, it is calculated.
1223 * Returns pointer to object if it succeded in the merge, otherwise NULL 1308 * Returns pointer to object if it succeded in the merge, otherwise NULL
1224 */ 1309 */
1225
1226object * 1310object *
1227merge_ob (object *op, object *top) 1311merge_ob (object *op, object *top)
1228{ 1312{
1229 if (!op->nrof) 1313 if (!op->nrof)
1230 return 0; 1314 return 0;
… …
2718 * The returned string is shared. 2802 * The returned string is shared.
2719 */ 2803 */
2720const char * 2804const char *
2721get_ob_key_value (const object *op, const char *const key) 2805get_ob_key_value (const object *op, const char *const key)
2722{ 2806{
2723 key_value * 2807 key_value *link;
2724 link; 2808 shstr_cmp canonical_key (key);
2725 const char *
2726 canonical_key;
2727 2809
2728 canonical_key = shstr::find (key);
2729
2730 if (canonical_key == NULL) 2810 if (!canonical_key)
2731 { 2811 {
2732 /* 1. There being a field named key on any object 2812 /* 1. There being a field named key on any object
2733 * implies there'd be a shared string to find. 2813 * implies there'd be a shared string to find.
2734 * 2. Since there isn't, no object has this field. 2814 * 2. Since there isn't, no object has this field.
2735 * 3. Therefore, *this* object doesn't have this field. 2815 * 3. Therefore, *this* object doesn't have this field.
2736 */ 2816 */
2737 return NULL; 2817 return 0;
2738 } 2818 }
2739 2819
2740 /* This is copied from get_ob_key_link() above - 2820 /* This is copied from get_ob_key_link() above -
2741 * only 4 lines, and saves the function call overhead. 2821 * only 4 lines, and saves the function call overhead.
2742 */ 2822 */
2743 for (link = op->key_values; link != NULL; link = link->next) 2823 for (link = op->key_values; link; link = link->next)
2744 {
2745 if (link->key == canonical_key) 2824 if (link->key == canonical_key)
2746 {
2747 return link->value; 2825 return link->value;
2748 } 2826
2749 }
2750 return NULL; 2827 return 0;
2751} 2828}
2752 2829
2753 2830
2754/* 2831/*
2755 * Updates the canonical_key in op to value. 2832 * Updates the canonical_key in op to value.
… …
2840{ 2917{
2841 shstr key_ (key); 2918 shstr key_ (key);
2842 2919
2843 return set_ob_key_value_s (op, key_, value, add_key); 2920 return set_ob_key_value_s (op, key_, value, add_key);
2844} 2921}
2922
2923object::depth_iterator::depth_iterator (object *container)
2924: iterator_base (container)
2925{
2926 while (item->inv)
2927 item = item->inv;
2928}
2929
2930void
2931object::depth_iterator::next ()
2932{
2933 if (item->below)
2934 {
2935 item = item->below;
2936
2937 while (item->inv)
2938 item = item->inv;
2939 }
2940 else
2941 item = item->env;
2942}
2943
2944// return a suitable string describing an objetc in enough detail to find it
2945const char *
2946object::debug_desc (char *info) const
2947{
2948 char info2[256 * 3];
2949 char *p = info;
2950
2951 p += snprintf (p, 256, "%d=\"%s%s%s\"",
2952 count,
2953 &name,
2954 title ? " " : "",
2955 title ? (const char *)title : "");
2956
2957 if (env)
2958 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2959
2960 if (map)
2961 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
2962
2963 return info;
2964}
2965
2966const char *
2967object::debug_desc () const
2968{
2969 static char info[256 * 3];
2970 return debug_desc (info);
2971}
2972

Diff Legend

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