--- deliantra/server/common/shstr.C	2007/05/17 21:32:08	1.22
+++ deliantra/server/common/shstr.C	2008/05/03 11:14:50	1.30
@@ -1,23 +1,22 @@
 /*
- * CrossFire, A Multiplayer game
- *
- * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
- *
- * This program is free software; you can redistribute it and/or modify
+ * This file is part of Deliantra, the Roguelike Realtime MMORPG.
+ * 
+ * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
+ * 
+ * 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 2 of the License, or
+ * 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
+ * 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@schmorp.de>
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ * 
+ * The authors can be reached via e-mail to <support@deliantra.net>
  */
 
 /*
@@ -31,15 +30,19 @@
 
 #include "global.h"
 
+size_t shstr_alloc;
+
 typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT;
 
 static HT ht;
+static int next_gc;
 
 static const char *
 makevec (const char *s)
 {
   int len = strlen (s);
 
+  shstr_alloc += sizeof (int) * 2 + len + 1;
   const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1));
 
   shstr::length (v) = len;
@@ -83,6 +86,7 @@
       return found;
     }
 
+  --next_gc;
   s = makevec (s);
   ht.insert (s);
   return s;
@@ -93,6 +97,9 @@
 void
 shstr::gc ()
 {
+  if (expect_true (next_gc > 0))
+    return;
+
   static const char *curpos;
 
   auto (i, curpos ? ht.find (curpos) : ht.begin ());
@@ -100,8 +107,8 @@
   if (i == ht.end ())
     i = ht.begin ();
 
-  // go through all strings roughly once every 4 minutes
   int n = ht.size () / 256 + 16;
+  next_gc += n >> 1;
 
   for (;;)
     {
@@ -120,6 +127,7 @@
           ht.erase (o);
 
           //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
+          shstr_alloc -= sizeof (int) * 2 + length (s) + 1;
           g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
         }
       else
@@ -129,10 +137,14 @@
   curpos = *i;
 }
 
-shstr skill_names[NUM_SKILLS];
+const shstr shstr_null;
 
-// what weird misoptimisation is this again?
-const shstr undead_name ("undead");
+// declare these here to get correct initialisation order
+#define def(str) const shstr shstr_ ## str (# str);
+# include "shstrinc.h"
+#undef def
+
+shstr skill_names[NUM_SKILLS];
 
 //TODO: this should of course not be here
 
@@ -146,8 +158,10 @@
 
   if (buf1)
     len1 = strlen (buf1);
+
   if (buf2)
     len2 = strlen (buf2);
+
   if ((len1 + len2) >= bufsize)
     return 1;