--- deliantra/server/common/arch.C 2006/09/08 17:14:07 1.14 +++ deliantra/server/common/arch.C 2007/04/18 07:59:55 1.56 @@ -1,49 +1,35 @@ /* - * static char *rcsid_arch_c = - * "$Id: arch.C,v 1.14 2006/09/08 17:14:07 root Exp $"; + * 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 */ -/* - CrossFire, A Multiplayer game for X-windows - - 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 crossfire-devel@real-time.com -*/ - #include -#include - #include -#include #include #include -/* IF set, does a little timing on the archetype load. */ -#define TIME_ARCH_LOAD 0 - -static void add_arch (archetype * at); - -static archetype *arch_table[ARCHTABLE]; -int arch_cmp = 0; /* How many strcmp's */ -int arch_search = 0; /* How many searches */ -int arch_init; /* True if doing arch initialization */ +#include +#include /* The naming of these functions is really poor - they are all * pretty much named '.._arch_...', but they may more may not @@ -53,12 +39,20 @@ * MSW 2003-04-29 */ -#if USE_UNORDERED_MAP +bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing + // the hashtable -typedef std::tr1::unordered_map HT; +typedef std::tr1::unordered_map + < + const char *, + arch_ptr, + str_hash, + str_equal, + slice_allocator< std::pair > + > HT; -static HT ht; -#endif +static HT ht (5000); +static std::vector archetypes; /** * GROS - This function retrieves an archetype given the name that appears @@ -74,17 +68,13 @@ archetype * find_archetype_by_object_name (const char *name) { - archetype *at; + shstr_cmp name_cmp (name); - if (name == NULL) - return (archetype *) NULL; + for (archetype *at = first_archetype; at; at = at->next) + if (at->clone.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; } /** @@ -95,18 +85,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 (archetype *at = first_archetype; at; at = at->next) + if (at->clone.name == name_cmp && at->clone.type == type) + return at; - return NULL; + return 0; } /* This is a lot like the above function. Instead, we are trying to match @@ -117,18 +102,13 @@ object * get_archetype_by_skill_name (const char *skill, int type) { - archetype * - at; + shstr_cmp skill_cmp (skill); - if (skill == NULL) - return NULL; + for (archetype *at = first_archetype; at; at = at->next) + if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) + return arch_to_object (at); - for (at = first_archetype; at != NULL; at = at->next) - { - if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) - return arch_to_object (at); - } - return NULL; + return 0; } /* similiar to above - this returns the first archetype @@ -141,15 +121,11 @@ archetype * get_archetype_by_type_subtype (int type, int subtype) { - archetype * - at; + for (archetype *at = first_archetype; at; at = at->next) + if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.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,24 +143,19 @@ object * get_archetype_by_object_name (const char *name) { - archetype * - at; - char - tmpname[MAX_BUF]; - int - i; + char tmpname[MAX_BUF]; + int i; + + assign (tmpname, name); - strncpy (tmpname, name, MAX_BUF - 1); - tmpname[MAX_BUF - 1] = 0; for (i = strlen (tmpname); i > 0; i--) { tmpname[i] = 0; - at = find_archetype_by_object_name (tmpname); - if (at != NULL) - { - return arch_to_object (at); - } + + if (archetype *at = find_archetype_by_object_name (tmpname)) + return arch_to_object (at); } + return create_singularity (name); } @@ -206,15 +177,12 @@ * Last, make a check on the full name. */ int -item_matched_string (object * pl, object * op, const char *name) +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 */ + char *cp, local_name[MAX_BUF]; + int count, retval = 0; + + assign (local_name, name); /* strtok is destructive to name */ for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) { @@ -274,7 +242,6 @@ retval = 14; else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) retval = 14; - /* Do substring checks, so things like 'Str+1' will match. * retval of these should perhaps be lower - they are lower * then the specific strcasecmp aboves, but still higher than @@ -286,16 +253,11 @@ retval = 12; else if (strstr (query_short_name (op), cp)) retval = 12; - /* Check against plural/non plural based on count. */ else if (count > 1 && !strcasecmp (cp, op->name_pl)) - { - retval = 6; - } + retval = 6; else if (count == 1 && !strcasecmp (op->name, cp)) - { - retval = 6; - } + retval = 6; /* base name matched - not bad */ else if (strcasecmp (cp, op->name) == 0 && !count) retval = 4; @@ -307,345 +269,207 @@ { if (pl->type == PLAYER) pl->contr->count = count; + return retval; } } - 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 = find_archetype ("empty_archetype"); -/* init_blocksview();*/ + return 0; } -/* - * Stores debug-information about how efficient the hashtable - * used for archetypes has been in the static errmsg array. - */ - -void -arch_info (object * op) +archetype::archetype () { - sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); - new_draw_info (NDI_BLACK, 0, op, errmsg); -} - -/* - * Initialise the hashtable used by the archetypes. - */ + clone.arch = this; -void -clear_archetable (void) -{ - memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); + CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ + SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ } -/* - * An alternative way to init the hashtable which is slower, but _works_... - */ - -void -init_archetable (void) +archetype::~archetype () { - archetype *at; - - LOG (llevDebug, " Setting up archetable...\n"); - - for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) - add_arch (at); - - LOG (llevDebug, "done\n"); + //TODO: nuke ->more's } -/* - * Dumps an archetype to debug-level output. - */ - -void -dump_arch (archetype * at) +static void +unlink (archetype *at) { - dump_object (&at->clone); -} - -/* - * Dumps _all_ archetypes to debug-level output. - * If you run crossfire with debug, and enter DM-mode, you can trigger - * this with the O key. - */ + if (at->head) + at = at->head; -void -dump_all_archetypes (void) -{ - archetype * - at; - for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) + // destroy this archetype's link, making singletons out of its parts + while (at) { - dump_arch (at); - fprintf (logfile, "%s\n", errmsg); + archetype *more = at->more; + at->clone.destroy_inv (); + at->head = at->more = 0; + at = more; } } +// dire hack, need to rationalise void -free_all_archs (void) +overwrite (archetype *at, object *op) { - archetype * - at, * - next; - int - i = 0, f = 0; + at->clone = *op; + at->clone.arch = at; - for (at = first_archetype; at != NULL; at = next) - { - if (at->more) - next = at->more; - else - next = at->next; + at->clone.inv = op->inv; op->inv = 0; - delete - at; - i++; - } - LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); + op->destroy (); } -archetype::archetype () +archetype * +archetype::read (object_thawer &f) { - clear_object (&clone); /* to initial state other also */ - CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ - SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ -} + assert (f.kw == KW_object); -archetype::~archetype () -{ -} + loading_arch = true; // hack to tell parse_kv et al. to behave -/* - * Reads/parses the archetype-file, and copies into a linked list - * of archetype-structures. - */ -void -first_arch_pass (object_thawer & fp) -{ - archetype *at, *head = NULL, *last_more = NULL; + typedef std::pair part; + std::vector parts; - at->clone.arch = first_archetype = at = new archetype; + coroapi::cede_to_tick_every (100); - while (int i = load_object (fp, &at->clone, 0)) + for (;;) { - 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)); + object *op = object::create (); + archetype *at = get (f.get_str ()); + f.get (op->name); + f.next (); - 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; - } + if (f.kw == KW_inherit) + { + if (archetype *at = find (f.get_str ())) + *op = at->clone; 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; + LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", + &at->name, f.get_str ()); + f.next (); } +#endif - at = new archetype; - at->clone.arch = at; - } + if (!op->parse_kv (f)) + goto fail; - delete at; -} + parts.push_back (std::make_pair (at, op)); -/* - * Reads the archetype file once more, and links all pointers between - * archetypes. - */ + if (f.kw != KW_more) + break; -void -second_arch_pass (object_thawer & thawer) -{ - char buf[MAX_BUF], *variable = buf, *argument, *cp; - archetype *at = NULL, *other; + f.next (); - while (fgets (buf, MAX_BUF, thawer) != NULL) - { - 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 (f.kw != KW_object) { - if ((at = find_archetype (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 = find_archetype (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; - } + f.parse_error ("more object"); + goto fail; } } -} - -#ifdef DEBUG -void -check_generators (void) -{ - archetype * - at; - 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); -} -#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) -{ - char - filename[MAX_BUF]; -#if TIME_ARCH_LOAD - struct timeval - tv1, - tv2; -#endif + { + archetype *head = parts.front ().first; - sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); - LOG (llevDebug, "Reading archetypes from %s:\n", filename); + // check that all archetypes belong to the same object or are heads + for (auto (p, parts.begin ()); p != parts.end (); ++p) + { + archetype *at = p->first; + + if (at->head != head && at->head) + { + LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name); + goto fail; + } + + if (at->next && at != head) + { + LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name); + goto fail; + } + } + + // sever chain of existing head object + for (archetype *more, *at = head; at; at = more) + { + more = at->more; + + at->head = 0; + at->more = 0; + } + + // replace/update head + overwrite (head, parts.front ().second); + head->tail_x = 0; + head->tail_y = 0; + + // link into list of heads, if not already there + if (!head->linked) + { + head->linked = true; + head->next = first_archetype; + first_archetype = head; + } + + // reassemble new chain + archetype *prev = head; + for (auto (p, parts.begin () + 1); p != parts.end (); ++p) + { + archetype *at = p->first; + overwrite (at, p->second); + + 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; + + at->head = head; + at->clone.head = &head->clone; + prev->more = at; + prev->clone.more = &at->clone; - { - object_thawer - thawer (filename); + prev = at; + } - clear_archetable (); - LOG (llevDebug, " arch-pass 1...\n"); - first_arch_pass (thawer); - LOG (llevDebug, " done\n"); + loading_arch = false; + return head; } - init_archetable (); - warn_archetypes = 1; +fail: + for (auto (p, parts.begin ()); p != parts.end (); ++p) + p->second->destroy (true); - { - object_thawer - thawer (filename); + loading_arch = false; + return 0; +} - LOG (llevDebug, " loading treasure...\n"); - load_treasures (); - LOG (llevDebug, " done\n arch-pass 2...\n"); - second_arch_pass (thawer); - LOG (llevDebug, " done\n"); -#ifdef DEBUG - check_generators (); -#endif - } - LOG (llevDebug, " done\n"); +/* + * Initialize global archtype pointers: + */ +void +init_archetype_pointers () +{ + ring_arch = archetype::find ("ring"); + amulet_arch = archetype::find ("amulet"); + staff_arch = archetype::find ("staff"); + crown_arch = archetype::find ("crown"); + empty_archetype = archetype::find ("empty_archetype"); } /* * Creates and returns a new object which is a copy of the given archetype. * This function returns NULL on failure. */ - object * -arch_to_object (archetype * at) +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 = get_object (); - copy_object (&at->clone, op); - op->instantiate (); + + object *op = at->clone.clone (); op->arch = at; + op->instantiate (); + return op; } @@ -655,14 +479,14 @@ * Thus get_archetype() will be guaranteed to always return * an object, and never NULL. */ - object * create_singularity (const char *name) { object *op; char buf[MAX_BUF]; + sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); - op = get_object (); + op = object::create (); op->name = op->name_pl = buf; SET_FLAG (op, FLAG_NO_PICK); return op; @@ -672,138 +496,77 @@ * Finds which archetype matches the given name, and returns a new * object containing a copy of the archetype. */ - object * get_archetype (const char *name) { - archetype *at; - at = find_archetype (name); - if (at == NULL) - return create_singularity (name); - return arch_to_object (at); -} + archetype *at = archetype::find (name); -/* - * 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; + if (!at) + return create_singularity (name); - return hash % tablesize; + return arch_to_object (at); } /* * Finds, using the hashtable, which archetype matches the given name. * returns a pointer to the found archetype, otherwise NULL. */ - archetype * -find_archetype (const char *name) +archetype::find (const char *name) { -#if USE_UNORDERED_MAP - name = shstr::find (name); - if (!name) return 0; - HT::const_iterator i = ht.find ((size_t)name); + auto (i, ht.find (name)); if (i == ht.end ()) return 0; else return i->second; -#endif - - archetype *at; - unsigned long index; +} - if (name == NULL) - return (archetype *) NULL; +archetype * +archetype::get (const char *name) +{ + archetype *at = find (name); - index = hasharch (name, ARCHTABLE); - arch_search++; - for (;;) + if (!at) { - 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; + archetypes.push_back (at = new archetype); + at->name = name; + at->hash_add (); } + + return at; } /* * Adds an archetype to the hashtable. */ - -static void -add_arch (archetype *at) +void +archetype::hash_add () { -#if USE_UNORDERED_MAP - ht.insert (std::make_pair ((size_t)(const char *)at->name, at)); -#endif - - int index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; - - for (;;) - { - if (arch_table[index] == NULL) - { - arch_table[index] = at; - return; - } - - if (++index == ARCHTABLE) - index = 0; + ht.insert (std::make_pair (name, this)); +} - if (index == org_index) - fatal (ARCHTABLE_TOO_SMALL); - } +void +archetype::hash_del () +{ + ht.erase (name); } /* * 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 != NULL; at = (at->more == NULL) ? at->next : at->more) + for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more) if (at->clone.type == type) return at; - return NULL; + + return 0; } /* @@ -811,22 +574,18 @@ * the given type. * Used in treasure-generation. */ - object * clone_arch (int type) { - archetype * - at; - object * - op = get_object (); + archetype *at; if ((at = type_to_archetype (type)) == NULL) { LOG (llevError, "Can't clone archetype %d\n", type); - free_object (op); - return NULL; + return 0; } - copy_object (&at->clone, op); + + object *op = at->clone.clone (); op->instantiate (); return op; } @@ -836,25 +595,26 @@ */ object * -object_create_arch (archetype * at) +object_create_arch (archetype *at) { - object * - op, * - prev = NULL, *head = NULL; + object *op, *prev = 0, *head = 0; while (at) { op = arch_to_object (at); op->x = at->clone.x; op->y = at->clone.y; + if (head) op->head = head, prev->more = op; + if (!head) head = op; + prev = op; at = at->more; } + return (head); } -/*** end of arch.c ***/