--- deliantra/server/common/arch.C 2007/10/16 00:30:24 1.70
+++ deliantra/server/common/arch.C 2008/04/30 06:40:28 1.76
@@ -1,11 +1,11 @@
/*
- * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
+ * This file is part of Deliantra, the Roguelike Realtime MMORPG.
*
- * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
+ * 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
*
- * Crossfire TRT is free software: you can redistribute it and/or modify
+ * 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.
@@ -18,27 +18,19 @@
* 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
+ * The authors can be reached via e-mail to
*/
#include
#include
-#include
#include
#include
#include
-/* 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 laoder etc. to suppress/request special processing
+archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
+arch_ptr archetype::empty;
// the hashtable
typedef std::tr1::unordered_map
@@ -50,8 +42,15 @@
slice_allocator< std::pair >
> HT;
-static HT ht (5000);
+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
@@ -278,7 +277,6 @@
archetype::archetype (const char *name)
{
- stub = true;
arch = this;
this->archname = this->name = this->name_pl = name;
}
@@ -291,19 +289,21 @@
void
archetype::link ()
{
- ht.insert (std::make_pair (archname, this));
-
if (!archetypes.contains (this))
- archetypes.insert (this);
+ {
+ archetypes.insert (this);
+ ht.insert (std::make_pair (archname, this));
+ }
}
void
archetype::unlink ()
{
- ht.erase (archname);
-
if (archetypes.contains (this))
- archetypes.erase (this);
+ {
+ archetypes.erase (this);
+ ht.erase (archname);
+ }
}
/*
@@ -325,45 +325,17 @@
}
archetype *
-archetype::get (const char *name)
-{
- if (!name)
- {
- LOG (llevError, "null archetype requested\n");
- name = "(null)";
- }
-
- if (loading_arch && !strcmp (&loading_arch->archname, name))
- return loading_arch;
-
- archetype *at = find (name);
-
- if (!at)
- {
- at = new archetype (name);
- at->link ();
- }
-
- return at;
-}
-
-archetype *
archetype::read (object_thawer &f)
{
assert (f.kw == KW_object);
std::vector parts;
- coroapi::cede_to_tick_every (10);
+ coroapi::cede_to_tick ();
for (;;)
{
- // the archetype might have been referenced earlier
- // so try to find an existing stub archetype first
- archetype *at = find (f.get_str ());
-
- if (!at || !at->stub)
- at = new archetype (f.get_str ());
+ archetype *at = new archetype (f.get_str ());
f.next ();
@@ -436,10 +408,6 @@
}
}
- // deactivate existing archetype
- for (archetype *at = old_head; at; at = (archetype *)at->more)
- at->unlink ();
-
// 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;
@@ -449,7 +417,7 @@
{
archetype *at = *p;
- // some flags get inherited formt he head (probably a lot more)
+ // 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];
@@ -457,23 +425,17 @@
at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
- if (at->x < new_head->min_x) new_head->min_x = at->x;
- if (at->y < new_head->min_y) new_head->min_y = at->y;
- if (at->x > new_head->max_x) new_head->max_x = at->x;
- if (at->y > new_head->max_y) new_head->max_y = at->y;
+ 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;
}
- // now activate it
- for (auto (p, parts.begin ()); p != parts.end (); ++p)
- {
- archetype *at = *p;
- at->stub = false;
- at->link ();
- }
+ postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
return new_head;
}
@@ -485,17 +447,80 @@
return 0;
}
-/*
- * Initialize global archtype pointers:
- */
void
-init_archetype_pointers ()
+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
+archetype::commit_load ()
+{
+ // 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 ();
+
+ 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)
+ {
+ 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;
+ }
+
+ postponed_arch_ref.clear ();
+
+ empty = find (shstr_empty_archetype);
+}
+
+void
+archetype::gc ()
{
- 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");
+ int cnt = max (1, min (allarch.size () / 128, dirtycnt));
+ dirtycnt = max (0, dirtycnt - cnt);
+
+ do
+ {
+ static int idx;
+
+ if (idx >= allarch.size ())
+ if (idx)
+ idx = 0;
+ else
+ return;
+
+ archetype *at = allarch [idx];
+
+ 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);
}
/*
@@ -562,6 +587,12 @@
return arch_to_object (at);
}
+object *
+archetype::get (const char *name)
+{
+ return get_archetype (name);
+}
+
/*
* Returns the first archetype using the given type.
* Used in treasure-generation.