--- deliantra/server/common/arch.C 2007/04/13 07:26:29 1.45 +++ deliantra/server/common/arch.C 2007/05/07 06:01:47 1.59 @@ -31,8 +31,6 @@ #include #include -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 @@ -41,6 +39,8 @@ * MSW 2003-04-29 */ +bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing + // the hashtable typedef std::tr1::unordered_map < @@ -52,6 +52,7 @@ > HT; static HT ht (5000); +static std::vector archetypes; /** * GROS - This function retrieves an archetype given the name that appears @@ -276,74 +277,45 @@ 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"); +archetype::archetype () +{ + clone.arch = this; -/* init_blocksview();*/ + 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 () { - LOG (llevDebug, " Setting up archetable...\n"); - - for (archetype *at = first_archetype; at; at = at->next) - for (archetype *bt = at; bt; bt = bt->more) - bt->hash_add (); - - LOG (llevDebug, "done\n"); + //TODO: nuke ->more's } -void -free_all_archs (void) +static void +unlink (archetype *at) { - archetype *at, *next; - int i = 0, f = 0; + if (at->head) + at = at->head; - for (at = first_archetype; at; at = next) + // destroy this archetype's link, making singletons out of its parts + while (at) { - if (at->more) - next = at->more; - else - next = at->next; - - delete - at; - - i++; + archetype *more = at->more; + at->clone.destroy_inv (); + at->head = at->more = 0; + at = more; } - - LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); } -archetype::archetype () +// dire hack, need to rationalise +void +overwrite (archetype *at, object *op) { - clone.arch = this; + at->clone = *op; + at->clone.arch = at; - CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ - SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ -} + at->clone.inv = op->inv; op->inv = 0; -archetype::~archetype () -{ - //TODO: nuke ->more's + op->destroy (); } archetype * @@ -351,170 +323,136 @@ { assert (f.kw == KW_object); - archetype *head = new archetype; - f.get (head->name); + loading_arch = true; // hack to tell parse_kv et al. to behave - if (!head->clone.parse_kv (f)) - { - delete head; - return 0; - } + typedef std::pair part; + std::vector parts; - for (archetype *prev = head; f.kw == KW_more; ) + coroapi::cede_to_tick_every (100); + + for (;;) { + object *op = object::create (); + archetype *at = get (f.get_str ()); + f.get (op->name); f.next (); - assert (f.kw == KW_object); - - archetype *more = new archetype; - f.get (more->name); - - if (!more->clone.parse_kv (f)) +#if 0 + if (f.kw == KW_inherit) { - delete head; - return 0; + 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->name, f.get_str ()); + + f.next (); } +#endif - if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; - if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; + if (!op->parse_kv (f)) + goto fail; - more->head = head; - more->clone.head = &head->clone; - prev->more = more; - prev->clone.more = &more->clone; + op->post_load_check (); - prev = more; - } + parts.push_back (std::make_pair (at, op)); - head->next = first_archetype; - first_archetype = head; + if (f.kw != KW_more) + break; - return head; -} + f.next (); -/* - * Reads/parses the archetype-file, and copies into a linked list - * of archetype-structures. - */ -static bool -first_arch_pass (object_thawer &f) -{ - for (;;) - { - switch (f.kw) + if (f.kw != KW_object) { - case KW_object: - if (!archetype::read (f)) - return false; - continue; - - case KW_EOF: - return true; - - default: - if (!f.parse_error ("archetypes file")) - return false; + f.parse_error ("more object"); + goto fail; } - - f.next (); } -} -/* - * Reads the archetype file once more, and links all pointers between - * archetypes. - */ -void -second_arch_pass (object_thawer & thawer) -{ - char buf[MAX_BUF], *variable = buf, *argument, *cp; - archetype *at = NULL, *other; + { + archetype *head = parts.front ().first; - while (fgets (buf, MAX_BUF, thawer) != NULL) - { - if (*buf == '#') - continue; + // 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; - if ((argument = strchr (buf, ' ')) != NULL) - { - *argument = '\0', argument++; - cp = argument + strlen (argument) - 1; - while (isspace (*cp)) - { - *cp = '\0'; - cp--; - } - } + prev = at; + } - 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) - { - 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; - } - } - } + loading_arch = false; + return head; + } + +fail: + for (auto (p, parts.begin ()); p != parts.end (); ++p) + p->second->destroy (true); + + loading_arch = false; + return 0; } /* - * 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(). + * Initialize global archtype pointers: */ void -load_archetypes (void) +init_archetype_pointers () { - char filename[MAX_BUF]; - - sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); - LOG (llevDebug, "Reading archetypes from %s:\n", filename); - - { - object_thawer f (filename); - - f.next (); - - LOG (llevDebug, " arch-pass 1...\n"); - if (!first_arch_pass (f)) - cleanup ("errors during first arch pass are fatal"); - LOG (llevDebug, " done\n"); - } - - init_archetable (); - warn_archetypes = 1; - - { - object_thawer f (filename); - - LOG (llevDebug, " loading treasure...\n"); - load_treasures (); - LOG (llevDebug, " done\n"); - LOG (llevDebug, " arch-pass 2...\n"); - second_arch_pass (f); - LOG (llevDebug, " done\n"); - } - LOG (llevDebug, " done\n"); + 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"); } /* @@ -526,15 +464,14 @@ { if (!at) { - if (warn_archetypes) - LOG (llevError, "Couldn't find archetype.\n"); - - return NULL; + LOG (llevError, "Couldn't find archetype.\n"); + return 0; } object *op = at->clone.clone (); op->arch = at; op->instantiate (); + return op; } @@ -573,36 +510,6 @@ } /* - * 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. */ @@ -612,7 +519,7 @@ if (!name) return 0; - AUTODECL (i, ht.find (name)); + auto (i, ht.find (name)); if (i == ht.end ()) return 0; @@ -620,6 +527,27 @@ return i->second; } +archetype * +archetype::get (const char *name) +{ + if (!name) + { + LOG (llevError, "null archetype requested\n"); + name = "(null)"; + } + + archetype *at = find (name); + + if (!at) + { + archetypes.push_back (at = new archetype); + at->name = at->clone.name = at->clone.name_pl = name; + at->hash_add (); + } + + return at; +} + /* * Adds an archetype to the hashtable. */ @@ -642,9 +570,7 @@ archetype * type_to_archetype (int type) { - archetype *at; - - for (at = first_archetype; at; at = at->more == 0 ? 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; @@ -656,7 +582,6 @@ * the given type. * Used in treasure-generation. */ - object * clone_arch (int type) {