--- deliantra/server/common/object.C 2006/09/11 12:38:36 1.29 +++ deliantra/server/common/object.C 2006/09/14 00:07:15 1.40 @@ -31,10 +31,11 @@ #include #include #include -#include #include int nrofallocobjects = 0; +static UUID uuid; +const uint64 UUID_SKIP = 1<<19; object *objects; /* Pointer to the list of used objects */ object *active_objects; /* List of active objects that need to be processed */ @@ -53,6 +54,83 @@ 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 }; +static void +write_uuid (void) +{ + char filename1[MAX_BUF], filename2[MAX_BUF]; + + sprintf (filename1, "%s/uuid", settings.localdir); + sprintf (filename2, "%s/uuid~", settings.localdir); + + FILE *fp; + + if (!(fp = fopen (filename2, "w"))) + { + LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); + return; + } + + fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); + fclose (fp); + rename (filename2, filename1); +} + +static void +read_uuid (void) +{ + char filename[MAX_BUF]; + + sprintf (filename, "%s/uuid", settings.localdir); + + FILE *fp; + + if (!(fp = fopen (filename, "r"))) + { + if (errno == ENOENT) + { + LOG (llevInfo, "RESET uid to 1\n"); + uuid.seq = 0; + write_uuid (); + return; + } + + LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); + _exit (1); + } + + int version; + unsigned long long uid; + if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) + { + LOG (llevError, "FATAL: error reading uid from %s!\n", filename); + _exit (1); + } + + uuid.seq = uid; + write_uuid (); + LOG (llevDebug, "read UID: %lld\n", uid); + fclose (fp); +} + +UUID +gen_uuid () +{ + UUID uid; + + uid.seq = ++uuid.seq; + + if (!(uuid.seq & (UUID_SKIP - 1))) + write_uuid (); + + return uid; +} + +void +init_uuid () +{ + read_uuid (); +} + /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ static int compare_ob_value_lists_one (const object *wants, const object *has) @@ -257,10 +335,13 @@ sum_weight (inv); sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); } + if (op->type == CONTAINER && op->stats.Str) sum = (sum * (100 - op->stats.Str)) / 100; + if (op->carrying != sum) op->carrying = sum; + return sum; } @@ -419,11 +500,11 @@ object * find_object_name (const char *str) { - const char *name = shstr::find (str); + shstr_cmp str_ (str); object *op; for (op = objects; op != NULL; op = op->next) - if (&op->name == name) + if (op->name == str_) break; return op; @@ -445,32 +526,15 @@ * anything, so check removed flag. I don't expect that this should break * anything - once an object is removed, it is basically dead anyways. */ - object * -get_owner (object *op) +object::get_owner () { - if (op->owner == NULL) - return NULL; - - if (!QUERY_FLAG (op->owner, FLAG_FREED) && !QUERY_FLAG (op->owner, FLAG_REMOVED) && op->owner->count == op->ownercount) - return op->owner; - - op->owner = NULL; - op->ownercount = 0; - return NULL; -} - -void -clear_owner (object *op) -{ - if (!op) - return; - - if (op->owner && op->ownercount == op->owner->count) - op->owner->refcount--; + if (!owner + || QUERY_FLAG (owner, FLAG_FREED) + || QUERY_FLAG (owner, FLAG_REMOVED)) + owner = 0; - op->owner = NULL; - op->ownercount = 0; + return owner; } /* @@ -478,9 +542,9 @@ * skill and experience objects. */ void -set_owner (object *op, object *owner) +object::set_owner (object *owner) { - if (owner == NULL || op == NULL) + if (!owner) return; /* next line added to allow objects which own objects */ @@ -490,48 +554,10 @@ * freed and then another object replacing it. Since the ownercounts * didn't match, this check is valid and I believe that cause is valid. */ - while (owner->owner && owner != owner->owner && owner->ownercount == owner->owner->count) + while (owner->owner) owner = owner->owner; - /* IF the owner still has an owner, we did not resolve to a final owner. - * so lets not add to that. - */ - if (owner->owner) - return; - - op->owner = owner; - - op->ownercount = owner->count; - owner->refcount++; -} - -/* Set the owner to clone's current owner and set the skill and experience - * objects to clone's objects (typically those objects that where the owner's - * current skill and experience objects at the time when clone's owner was - * set - not the owner's current skill and experience objects). - * - * Use this function if player created an object (e.g. fire bullet, swarm - * spell), and this object creates further objects whose kills should be - * accounted for the player's original skill, even if player has changed - * skills meanwhile. - */ -void -copy_owner (object *op, object *clone) -{ - object *owner = get_owner (clone); - - if (owner == NULL) - { - /* players don't have owners - they own themselves. Update - * as appropriate. - */ - if (clone->type == PLAYER) - owner = clone; - else - return; - } - - set_owner (op, owner); + this->owner = owner; } /* Zero the key_values on op, decrementing the shared-string @@ -557,8 +583,7 @@ free_key_values (this); - clear_owner (this); - + owner = 0; name = 0; name_pl = 0; title = 0; @@ -569,54 +594,42 @@ lore = 0; custom_name = 0; materialname = 0; + contr = 0; + below = 0; + above = 0; + inv = 0; + container = 0; + env = 0; + more = 0; + head = 0; + map = 0; + active_next = 0; + active_prev = 0; - memset (static_cast < object_pod * >(this), 0, sizeof (object_pod)); + memset (static_cast(this), 0, sizeof (object_pod)); SET_FLAG (this, FLAG_REMOVED); + + /* What is not cleared is next, prev, and count */ + + expmul = 1.0; + face = blank_face; + attacked_by_count = -1; + + if (settings.casting_time) + casting_time = -1; } void object::clone (object *destination) { - *(object_copy *) destination = *this; - *(object_pod *) destination = *this; + *(object_copy *)destination = *this; + *(object_pod *)destination = *this; if (self || cb) INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); } /* - * clear_object() frees everything allocated by an object, and also - * clears all variables and flags to default settings. - */ - -void -clear_object (object *op) -{ - op->clear (); - - op->contr = NULL; - op->below = NULL; - op->above = NULL; - op->inv = NULL; - op->container = NULL; - op->env = NULL; - op->more = NULL; - op->head = NULL; - op->map = NULL; - op->refcount = 0; - op->active_next = NULL; - op->active_prev = NULL; - /* What is not cleared is next, prev, and count */ - - op->expmul = 1.0; - op->face = blank_face; - op->attacked_by_count = -1; - - if (settings.casting_time) - op->casting_time = -1; -} - -/* * copy object first frees everything allocated by the second object, * and then copies the contends of the first object into the second * object, allocating what needs to be allocated. Basically, any @@ -624,7 +637,6 @@ * if the first object is freed, the pointers in the new object * will point at garbage. */ - void copy_object (object *op2, object *op) { @@ -694,7 +706,6 @@ * value, or vice versa, then add/remove the object from the active list. * This function needs to be called whenever the speed of an object changes. */ - void update_ob_speed (object *op) { @@ -713,10 +724,10 @@ op->speed = 0; #endif } + if (arch_init) - { - return; - } + return; + if (FABS (op->speed) > MIN_ACTIVE_SPEED) { /* If already on active list, don't do anything */ @@ -726,8 +737,10 @@ /* process_events() expects us to insert the object at the beginning * of the list. */ op->active_next = active_objects; + if (op->active_next != NULL) op->active_next->active_prev = op; + active_objects = op; } else @@ -739,15 +752,18 @@ if (op->active_prev == NULL) { active_objects = op->active_next; + if (op->active_next != NULL) op->active_next->active_prev = NULL; } else { op->active_prev->active_next = op->active_next; + if (op->active_next) op->active_next->active_prev = op->active_prev; } + op->active_next = NULL; op->active_prev = NULL; } @@ -903,21 +919,23 @@ update_object (op->more, action); } -static unordered_vector < object *>mortals; -static -std::vector < object *> - freed; +static unordered_vector mortals; +static std::vector > freed; void object::free_mortals () { - for (unordered_vector < object *>::iterator i = mortals.begin (); i != mortals.end ();) - if (!(*i)->refcount) + for (unordered_vector::iterator i = mortals.begin (); i != mortals.end ();) + if ((*i)->refcnt) + ++i; // further delay freeing + else { - freed.push_back (*i); + //freed.push_back (*i);//D + delete *i; mortals.erase (i); } - else - ++i; + + if (mortals.size() && 0)//D + LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D } object::object () @@ -950,6 +968,10 @@ void object::unlink () { count = 0; + uuid = gen_uuid (); + + if (this == objects) + objects = next; /* Remove this object from the list of used objects */ if (prev) @@ -963,19 +985,14 @@ next->prev = prev; next = 0; } - - if (this == objects) - objects = next; } object *object::create () { - object * - op; + object *op; if (freed.empty ()) op = new object; - else { // highly annoying, but the only way to get it stable right now @@ -1004,12 +1021,12 @@ if (QUERY_FLAG (this, FLAG_FREED)) return; - if (!QUERY_FLAG (this, FLAG_REMOVED)) - remove_ob (this); - if (QUERY_FLAG (this, FLAG_FRIENDLY)) remove_friendly_object (this); + if (!QUERY_FLAG (this, FLAG_REMOVED)) + remove_ob (this); + SET_FLAG (this, FLAG_FREED); if (more) @@ -1024,7 +1041,7 @@ * if some form of movement is allowed, let objects * drop on that space. */ - if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)) + if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) { object *op = inv; @@ -1060,7 +1077,7 @@ } } - clear_owner (this); + owner = 0; /* Remove object from the active list */ speed = 0; @@ -1290,7 +1307,6 @@ * If top is NULL, it is calculated. * Returns pointer to object if it succeded in the merge, otherwise NULL */ - object * merge_ob (object *op, object *top) { @@ -2788,34 +2804,27 @@ const char * get_ob_key_value (const object *op, const char *const key) { - key_value * - link; - const char * - canonical_key; - - canonical_key = shstr::find (key); + key_value *link; + shstr_cmp canonical_key (key); - if (canonical_key == NULL) + if (!canonical_key) { /* 1. There being a field named key on any object * implies there'd be a shared string to find. * 2. Since there isn't, no object has this field. * 3. Therefore, *this* object doesn't have this field. */ - return NULL; + return 0; } /* This is copied from get_ob_key_link() above - * only 4 lines, and saves the function call overhead. */ - for (link = op->key_values; link != NULL; link = link->next) - { - if (link->key == canonical_key) - { - return link->value; - } - } - return NULL; + for (link = op->key_values; link; link = link->next) + if (link->key == canonical_key) + return link->value; + + return 0; } @@ -2910,3 +2919,54 @@ return set_ob_key_value_s (op, key_, value, add_key); } + +object::depth_iterator::depth_iterator (object *container) +: iterator_base (container) +{ + while (item->inv) + item = item->inv; +} + +void +object::depth_iterator::next () +{ + if (item->below) + { + item = item->below; + + while (item->inv) + item = item->inv; + } + else + item = item->env; +} + +// return a suitable string describing an objetc in enough detail to find it +const char * +object::debug_desc (char *info) const +{ + char info2[256 * 3]; + char *p = info; + + p += snprintf (p, 256, "%d=\"%s%s%s\"", + count, + &name, + title ? " " : "", + title ? (const char *)title : ""); + + if (env) + p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); + + if (map) + p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); + + return info; +} + +const char * +object::debug_desc () const +{ + static char info[256 * 3]; + return debug_desc (info); +} +