--- deliantra/server/common/arch.C 2007/01/06 14:42:28 1.36 +++ deliantra/server/common/arch.C 2008/04/20 05:24:55 1.74 @@ -1,26 +1,25 @@ /* - CrossFire, A Multiplayer game for X-windows - - Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team - Copyright (C) 2002 Mark Wedel & Crossfire Development Team - Copyright (C) 1992 Frank Tore Johansen - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. - - The authors can be reached via e-mail at -*/ + * This file is part of Deliantra, the Roguelike Realtime MMORPG. + * + * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team + * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team + * Copyright (©) 1992,2007 Frank Tore Johansen + * + * Deliantra is free software: you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see . + * + * The authors can be reached via e-mail to + */ #include @@ -28,41 +27,31 @@ #include #include -#define USE_UNORDERED_MAP 0 - -#if USE_UNORDERED_MAP -# include -# include -#endif +#include +#include -int arch_cmp = 0; /* How many strcmp's */ -int arch_search = 0; /* How many searches */ -int arch_init; /* True if doing arch initialization */ - -/* The naming of these functions is really poor - they are all - * pretty much named '.._arch_...', but they may more may not - * return archetypes. Some make the arch_to_object call, and thus - * return an object. Perhaps those should be called 'archob' functions - * to denote they return an object derived from the archetype. - * MSW 2003-04-29 - */ +archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing +arch_ptr archetype::empty; -#if USE_UNORDERED_MAP // the hashtable typedef std::tr1::unordered_map < - std::size_t, + const char *, arch_ptr, - std::tr1::hash, - std::equal_to, - slice_allocator< std::pair > - true, + str_hash, + str_equal, + slice_allocator< std::pair > > HT; -static HT ht; -#else -static arch_ptr arch_table[ARCHTABLE]; -#endif +static HT ht (10000); +archvec archetypes; +static unordered_vector allarch; +static int dirtycnt; + +// the vector of other_arch references to be resolved +static std::vector< std::pair > postponed_arch_ref; +// the vector of loaded but not yet committed archetypes +static std::vector postponed_arch; /** * GROS - This function retrieves an archetype given the name that appears @@ -78,17 +67,13 @@ archetype * find_archetype_by_object_name (const char *name) { - archetype *at; + shstr_cmp name_cmp (name); - if (name == NULL) - return (archetype *) NULL; + for_all_archetypes (at) + if (at->name == name_cmp) + return at; - for (at = first_archetype; at != NULL; at = at->next) - { - if (!strcmp (at->clone.name, name)) - return at; - } - return NULL; + return 0; } /** @@ -99,18 +84,13 @@ archetype * find_archetype_by_object_type_name (int type, const char *name) { - archetype *at; - - if (name == NULL) - return NULL; + shstr_cmp name_cmp (name); - for (at = first_archetype; at != NULL; at = at->next) - { - if (at->clone.type == type && strcmp (at->clone.name, name) == 0) - return at; - } + for_all_archetypes (at) + if (at->name == name_cmp && at->type == type) + return at; - return NULL; + return 0; } /* This is a lot like the above function. Instead, we are trying to match @@ -121,12 +101,11 @@ object * get_archetype_by_skill_name (const char *skill, int type) { - archetype *at; + shstr_cmp skill_cmp (skill); - if (skill) - for (at = first_archetype; at; at = at->next) - if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) - return arch_to_object (at); + for_all_archetypes (at) + if (at->skill == skill_cmp && (type == -1 || type == at->type)) + return arch_to_object (at); return 0; } @@ -141,15 +120,11 @@ archetype * get_archetype_by_type_subtype (int type, int subtype) { - archetype * - at; + for_all_archetypes (at) + if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) + return at; - for (at = first_archetype; at != NULL; at = at->next) - { - if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) - return at; - } - return NULL; + return 0; } /** @@ -167,7 +142,6 @@ object * get_archetype_by_object_name (const char *name) { - archetype *at; char tmpname[MAX_BUF]; int i; @@ -176,39 +150,38 @@ for (i = strlen (tmpname); i > 0; i--) { tmpname[i] = 0; - at = find_archetype_by_object_name (tmpname); - if (at) + if (archetype *at = find_archetype_by_object_name (tmpname)) return arch_to_object (at); } return create_singularity (name); } - /* This is a subset of the parse_id command. Basically, name can be - * a string seperated lists of things to match, with certain keywords. - * pl is the player (only needed to set count properly) - * op is the item we are trying to match. Calling function takes care - * of what action might need to be done and if it is valid - * (pickup, drop, etc.) Return NONZERO if we have a match. A higher - * value means a better match. 0 means no match. - * - * Brief outline of the procedure: - * We take apart the name variable into the individual components. - * cases for 'all' and unpaid are pretty obvious. - * Next, we check for a count (either specified in name, or in the - * player object.) - * If count is 1, make a quick check on the name. - * IF count is >1, we need to make plural name. Return if match. - * Last, make a check on the full name. - */ +/* This is a subset of the parse_id command. Basically, name can be + * a string seperated lists of things to match, with certain keywords. + * pl is the player (only needed to set count properly) + * op is the item we are trying to match. Calling function takes care + * of what action might need to be done and if it is valid + * (pickup, drop, etc.) Return NONZERO if we have a match. A higher + * value means a better match. 0 means no match. + * + * Brief outline of the procedure: + * We take apart the name variable into the individual components. + * cases for 'all' and unpaid are pretty obvious. + * Next, we check for a count (either specified in name, or in the + * player object.) + * If count is 1, make a quick check on the name. + * IF count is >1, we need to make plural name. Return if match. + * Last, make a check on the full name. + */ int item_matched_string (object *pl, object *op, const char *name) { char *cp, local_name[MAX_BUF]; int count, retval = 0; - strcpy (local_name, name); /* strtok is destructive to name */ + assign (local_name, name); /* strtok is destructive to name */ for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) { @@ -303,286 +276,252 @@ return 0; } -/* - * Initialises the internal linked list of archetypes (read from file). - * Then the global "empty_archetype" pointer is initialised. - * Then the blocksview[] array is initialised. - */ - -void -init_archetypes (void) -{ /* called from add_player() and edit() */ - if (first_archetype != NULL) /* Only do this once */ - return; - - arch_init = 1; - load_archetypes (); - arch_init = 0; - empty_archetype = archetype::find ("empty_archetype"); - -/* init_blocksview();*/ +archetype::archetype (const char *name) +{ + arch = this; + this->archname = this->name = this->name_pl = name; } -/* - * Stores debug-information about how efficient the hashtable - * used for archetypes has been in the static errmsg array. - */ +archetype::~archetype () +{ + unlink (); +} void -arch_info (object *op) +archetype::link () { - sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); - new_draw_info (NDI_BLACK, 0, op, errmsg); + if (!archetypes.contains (this)) + { + archetypes.insert (this); + ht.insert (std::make_pair (archname, this)); + } } -/* - * Initialise the hashtable used by the archetypes. - */ - void -clear_archetable (void) +archetype::unlink () { - memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); + if (archetypes.contains (this)) + { + archetypes.erase (this); + ht.erase (archname); + } } /* - * An alternative way to init the hashtable which is slower, but _works_... + * Finds, using the hashtable, which archetype matches the given name. + * returns a pointer to the found archetype, otherwise NULL. */ - -void -init_archetable (void) +archetype * +archetype::find (const char *name) { - archetype *at; - - LOG (llevDebug, " Setting up archetable...\n"); + if (!name) + return 0; - for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) - at->hash_add (); + auto (i, ht.find (name)); - LOG (llevDebug, "done\n"); + if (i == ht.end ()) + return 0; + else + return i->second; } -void -free_all_archs (void) +archetype * +archetype::read (object_thawer &f) { - archetype *at, *next; - int i = 0, f = 0; + assert (f.kw == KW_object); + + std::vector parts; + + coroapi::cede_to_tick (); - for (at = first_archetype; at != NULL; at = next) + for (;;) { - if (at->more) - next = at->more; - else - next = at->next; + archetype *at = new archetype (f.get_str ()); - delete - at; + f.next (); - i++; - } +#if 0 + // implementing it here in the server does neither allow multiple inheritence + // nor does it cleanly "just override". it would allow use in map files, though, + // and other resource files dynamically laoded (as opposed to being preprocessed). + // not that any of this is relevant as of yet... + if (f.kw == KW_inherit) + { + if (archetype *at = find (f.get_str ())) + *op = at->clone; + else + LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", + &at->archname, f.get_str ()); - LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); -} + f.next (); + } +#endif -archetype::archetype () -{ - CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ - SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ -} + loading_arch = at; // hack to tell parse_kv et al. to behave + bool parse_ok = at->parse_kv (f); + loading_arch = 0; -archetype::~archetype () -{ -} + if (!parse_ok) + goto fail; -/* - * Reads/parses the archetype-file, and copies into a linked list - * of archetype-structures. - */ -void -first_arch_pass (object_thawer & fp) -{ - archetype *head = 0, *last_more = 0; + loading_arch = at; // hack to tell parse_kv et al. to behave + at->post_load_check (); + loading_arch = 0; - archetype *at = new archetype; - at->clone.arch = first_archetype = at; + parts.push_back (at); - while (int i = load_object (fp, &at->clone, 0)) - { - at->clone.speed_left = (float) (-0.1); - /* copy the body_info to the body_used - this is only really - * need for monsters, but doesn't hurt to do it for everything. - * by doing so, when a monster is created, it has good starting - * values for the body_used info, so when items are created - * for it, they can be properly equipped. - */ - memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); + if (f.kw != KW_more) + break; - switch (i) - { - case LL_NORMAL: /* A new archetype, just link it with the previous */ - if (last_more != NULL) - last_more->next = at; - if (head != NULL) - head->next = at; - head = last_more = at; -#if 0 - if (!op->type) - LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); -#endif - at->tail_x = 0; - at->tail_y = 0; - break; - - case LL_MORE: /* Another part of the previous archetype, link it correctly */ - - at->head = head; - at->clone.head = &head->clone; - if (last_more != NULL) - { - last_more->more = at; - last_more->clone.more = &at->clone; - } - last_more = at; - - /* If this multipart image is still composed of individual small - * images, don't set the tail_.. values. We can't use them anyways, - * and setting these to zero makes the map sending to the client much - * easier as just looking at the head, we know what to do. - */ - if (at->clone.face != head->clone.face) - { - head->tail_x = 0; - head->tail_y = 0; - } - else - { - if (at->clone.x > head->tail_x) - head->tail_x = at->clone.x; - if (at->clone.y > head->tail_y) - head->tail_y = at->clone.y; - } - break; + f.next (); + if (f.kw != KW_object) + { + f.parse_error ("more object"); + goto fail; } + } + + { + auto (at, parts.begin ()); - at = new archetype; + archetype *new_head = parts.front (); + archetype *old_head = find (new_head->archname); - at->clone.arch = at; - } + if (old_head && !old_head->is_head ()) + { + LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", + &new_head->archname, &old_head->archname); + goto fail; + } + + // check that all archetypes belong to the same old object or are new + for (auto (at, parts.begin ()); at != parts.end (); ++at) + { + archetype *new_part = *at; + archetype *old_part = find (new_part->archname); + + if (old_part && old_part->head_ () != old_head) + { + LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", + &new_part->archname, &((archetype *)old_part->head_ ())->archname); + goto fail; + } + } + + // assemble new chain + new_head->min_x = new_head->max_x = new_head->x; + new_head->min_y = new_head->max_y = new_head->y; + + archetype *less = new_head; + for (auto (p, parts.begin () + 1); p != parts.end (); ++p) + { + archetype *at = *p; + + // some flags get inherited from the head (probably a lot more) + // doing it here doesn't feel too cozy, but it allows code + // to ignore head checks for these flags, which saves time + at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; + at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; + at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; + at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; + + new_head->min_x = min (new_head->min_x, at->x); + new_head->min_y = min (new_head->min_y, at->y); + new_head->max_x = max (new_head->max_x, at->x); + new_head->max_y = max (new_head->max_y, at->y); + + at->head = new_head; + less->more = at; + less = at; + } + + postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); + + return new_head; + } - delete at; +fail: + for (auto (p, parts.begin ()); p != parts.end (); ++p) + (*p)->destroy (true); + + return 0; } -/* - * Reads the archetype file once more, and links all pointers between - * archetypes. - */ +void +archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) +{ + ref = 0; + postponed_arch_ref.push_back (std::pair(&ref, shstr (other_arch))); +} void -second_arch_pass (object_thawer & thawer) +archetype::commit_load () { - char buf[MAX_BUF], *variable = buf, *argument, *cp; - archetype *at = NULL, *other; + // unlink old archetypes and link in new ones */ + for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) + { + archetype *at = *p; + + if (archetype *old = find (at->archname)) + old->unlink (); - while (fgets (buf, MAX_BUF, thawer) != NULL) + allarch.push_back (at); + + at->link (); + ++dirtycnt; + } + + postponed_arch.clear (); + + // now resolve arch references + for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) { - if (*buf == '#') - continue; - if ((argument = strchr (buf, ' ')) != NULL) - { - *argument = '\0', argument++; - cp = argument + strlen (argument) - 1; - while (isspace (*cp)) - { - *cp = '\0'; - cp--; - } - } - if (!strcmp ("Object", variable)) - { - if ((at = archetype::find (argument)) == NULL) - LOG (llevError, "Warning: failed to find arch %s\n", argument); - } - else if (!strcmp ("other_arch", variable)) - { - if (at != NULL && at->clone.other_arch == NULL) - { - if ((other = archetype::find (argument)) == NULL) - LOG (llevError, "Warning: failed to find other_arch %s\n", argument); - else if (at != NULL) - at->clone.other_arch = other; - } - } - else if (!strcmp ("randomitems", variable)) - { - if (at != NULL) - { - treasurelist *tl = find_treasurelist (argument); - - if (tl == NULL) - LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); - else - at->clone.randomitems = tl; - } - } + arch_ptr *ap = p->first; + archetype *at = find (p->second); + + if (!at) + LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); + + *ap = at; } -} -#ifdef DEBUG -void -check_generators (void) -{ - archetype *at; + postponed_arch_ref.clear (); - for (at = first_archetype; at != NULL; at = at->next) - if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) - LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); + empty = find (shstr_empty_archetype); } -#endif - -/* - * First initialises the archtype hash-table (init_archetable()). - * Reads and parses the archetype file (with the first and second-pass - * functions). - * Then initialises treasures by calling load_treasures(). - */ void -load_archetypes (void) +archetype::gc () { - char filename[MAX_BUF]; + int cnt = max (1, min (allarch.size () / 128, dirtycnt)); + dirtycnt = max (0, dirtycnt - cnt); - sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); - LOG (llevDebug, "Reading archetypes from %s:\n", filename); - - { - object_thawer - thawer (filename); + do + { + static int idx; - clear_archetable (); - LOG (llevDebug, " arch-pass 1...\n"); - first_arch_pass (thawer); - LOG (llevDebug, " done\n"); - } + if (idx >= allarch.size ()) + if (idx) + idx = 0; + else + return; - init_archetable (); - warn_archetypes = 1; + archetype *at = allarch [idx]; - { - object_thawer - thawer (filename); - - LOG (llevDebug, " loading treasure...\n"); - load_treasures (); - LOG (llevDebug, " done\n"); - LOG (llevDebug, " arch-pass 2...\n"); - second_arch_pass (thawer); - LOG (llevDebug, " done\n"); -#ifdef DEBUG - check_generators (); -#endif - } - LOG (llevDebug, " done\n"); + if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object + ++idx; + else + { + LOG (llevDebug, "garbage collect arch %s", at->debug_desc ()); + assert (at->arch == at); // verify that refcnt == 1 is truely valid + allarch.erase (idx); + at->arch = 0; + at->more = 0; + at->destroy (); + } + } + while (--cnt); } /* @@ -592,22 +531,25 @@ object * arch_to_object (archetype *at) { - object *op; - - if (at == NULL) + if (!at) { - if (warn_archetypes) - LOG (llevError, "Couldn't find archetype.\n"); - - return NULL; + LOG (llevError, "Couldn't find archetype.\n"); + return 0; } - op = at->clone.clone (); + object *op = at->clone (); op->arch = at; op->instantiate (); + return op; } +object * +archetype::instance () +{ + return arch_to_object (this); +} + /* * Creates an object. This function is called by get_archetype() * if it fails to find the appropriate archetype. @@ -617,13 +559,17 @@ object * create_singularity (const char *name) { - object *op; + LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); + + if (!strcmp (name, "bug")) + abort (); + char buf[MAX_BUF]; + sprintf (buf, "bug, please report (%s)", name); - sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); - op = object::create (); + object *op = get_archetype ("bug"); op->name = op->name_pl = buf; - SET_FLAG (op, FLAG_NO_PICK); + return op; } @@ -643,149 +589,14 @@ } /* - * Hash-function used by the arch-hashtable. - */ - -unsigned long -hasharch (const char *str, int tablesize) -{ - unsigned long hash = 0; - unsigned int i = 0; - const char *p; - - /* use the one-at-a-time hash function, which supposedly is - * better than the djb2-like one used by perl5.005, but - * certainly is better then the bug used here before. - * see http://burtleburtle.net/bob/hash/doobs.html - */ - for (p = str; i < MAXSTRING && *p; p++, i++) - { - hash += *p; - hash += hash << 10; - hash ^= hash >> 6; - } - - hash += hash << 3; - hash ^= hash >> 11; - hash += hash << 15; - - return hash % tablesize; -} - -/* - * Finds, using the hashtable, which archetype matches the given name. - * returns a pointer to the found archetype, otherwise NULL. - */ - -archetype * -archetype::find (const char *name) -{ - if (!name) - return 0; - -#if USE_UNORDERED_MAP - AUTODECL (i, ht.find ((size_t) name)); - - if (i == ht.end ()) - return 0; - else - return i->second; -#endif - - archetype *at; - unsigned long index; - - index = hasharch (name, ARCHTABLE); - arch_search++; - for (;;) - { - at = arch_table[index]; - - if (at == NULL) - { - if (warn_archetypes) - LOG (llevError, "Couldn't find archetype %s\n", name); - - return NULL; - } - - arch_cmp++; - - if (!strcmp ((const char *) at->name, name)) - return at; - - if (++index >= ARCHTABLE) - index = 0; - } -} - -/* - * Adds an archetype to the hashtable. - */ -void -archetype::hash_add () -{ -#if USE_UNORDERED_MAP - ht.insert (std::make_pair ((size_t) (const char *) name, this)); -#else - - int index = hasharch ((const char *) name, ARCHTABLE), org_index = index; - - for (;;) - { - if (!arch_table[index]) - { - arch_table[index] = this; - break; - } - - if (++index == ARCHTABLE) - index = 0; - - if (index == org_index) - fatal (ARCHTABLE_TOO_SMALL); - } -#endif -} - -void -archetype::hash_del () -{ -#if USE_UNORDERED_MAP -# error remove this from HT -#else - - int index = hasharch ((const char *) name, ARCHTABLE), org_index = index; - - for (;;) - { - if (arch_table[index] == this) - { - arch_table[index] = 0; - break; - } - - if (++index == ARCHTABLE) - index = 0; - - if (index == org_index) - break; - } -#endif -} - -/* * Returns the first archetype using the given type. * Used in treasure-generation. */ - archetype * type_to_archetype (int type) { - archetype *at; - - for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) - if (at->clone.type == type) + for_all_archetypes (at) + if (at->type == type && at->head_ () != at) return at; return 0; @@ -796,7 +607,6 @@ * the given type. * Used in treasure-generation. */ - object * clone_arch (int type) { @@ -808,7 +618,7 @@ return 0; } - object *op = at->clone.clone (); + object *op = at->clone (); op->instantiate (); return op; } @@ -816,7 +626,6 @@ /* * member: make instance from class */ - object * object_create_arch (archetype *at) { @@ -825,8 +634,9 @@ while (at) { op = arch_to_object (at); - op->x = at->clone.x; - op->y = at->clone.y; + + op->x = at->x; + op->y = at->y; if (head) op->head = head, prev->more = op; @@ -835,9 +645,9 @@ head = op; prev = op; - at = at->more; + at = (archetype *)at->more; } - return (head); + return head; }