--- deliantra/server/common/shstr.C	2006/09/03 23:33:00	1.7
+++ deliantra/server/common/shstr.C	2018/11/17 23:40:00	1.53
@@ -1,68 +1,76 @@
 /*
+ * This file is part of Deliantra, the Roguelike Realtime MMORPG.
+ *
+ * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team
+ * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 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 Affero 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 Affero GNU General Public License
+ * and the GNU General Public License along with this program. If not, see
+ * <http://www.gnu.org/licenses/>.
+ *
+ * The authors can be reached via e-mail to <support@deliantra.net>
+ */
+
+/*
  * shstr.C
  */
 
 #include <cstring>
 #include <cstdlib>
+#include <glib.h>
 
-#include <tr1/unordered_set>
+#include <flat_hash_map.hpp>
 
-#include "shstr.h"
+#include <global.h>
 
-struct hash
-{
-  std::size_t operator ()(const char *s) const
-  {
-    unsigned long hash = 0;
-    unsigned int i = 0;
-
-    /* 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
-     */
-    while (*s)
-      {
-        hash += *s++;
-        hash += hash << 10;
-        hash ^= hash >>  6;
-      }
-
-    hash += hash <<  3;
-    hash ^= hash >> 11;
-    hash += hash << 15;
-
-    return hash;
-  }
-};
+size_t shstr_alloc;
 
-struct equal
-{
-  bool operator ()(const char *a, const char *b) const
-  {
-    return !strcmp (a, b);
-  }
-};
-
-typedef std::tr1::unordered_set<const char *, hash, equal> HT;
+typedef ska::flat_hash_set<const char *, str_hash, str_equal, slice_allocator<const char *>> HT;
 
 static HT ht;
+static int next_gc;
+
+#define NUM_INT 3
 
-static const char *makevec (const char *s)
+static const char *
+makevec (const char *s)
 {
   int len = strlen (s);
+  int alloc = sizeof (uint32_t) * NUM_INT + len + 1;
 
-  const char *v = (const char *)(2 + (int *)malloc (sizeof (int) * 2 + len + 1));
+  shstr_alloc += alloc;
+  char *v = (char *)g_slice_alloc (alloc);
+  v += sizeof (uint32_t) * NUM_INT;
 
+  shstr::hash   (v) = strhsh (s);
   shstr::length (v) = len;
   shstr::refcnt (v) = 1;
 
-  memcpy ((char *)v, s, len + 1);
+  memcpy (v, s, len + 1);
 
-  return s;
+  return v;
 }
 
-const char *shstr::null = makevec ("<nil>");
+shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { STRHSH_NULL, 0, 0xffffffff, "(null)" };
+
+bool
+shstr_tmp::contains (const char *substring) const
+{
+  //TODO: this is supposed to check for comma-seperation...
+  return s != null ()
+         && substring
+         && strstr (s, substring);
+}
 
 const char *
 shstr::find (const char *s)
@@ -70,18 +78,16 @@
   if (!s)
     return s;
 
-  HT::iterator i = ht.find (s);
+  auto (i, ht.find (s));
 
-  return i != ht.end ()
-    ? *i
-    : 0;
+  return i != ht.end ()? *i : 0;
 }
 
 const char *
 shstr::intern (const char *s)
 {
   if (!s)
-    return null;
+    return null ();
 
   if (const char *found = find (s))
     {
@@ -89,6 +95,7 @@
       return found;
     }
 
+  --next_gc;
   s = makevec (s);
   ht.insert (s);
   return s;
@@ -99,15 +106,18 @@
 void
 shstr::gc ()
 {
+  if (expect_true (next_gc > 0))
+    return;
+
   static const char *curpos;
 
-  HT::iterator i = curpos ? ht.find (curpos) : ht.begin ();
+  auto (i, curpos ? ht.find (curpos) : ht.begin ());
 
   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,12 +130,15 @@
         break;
       else if (!refcnt (*i))
         {
-          HT::iterator o = i++;
+          auto (o, i++);
           const char *s = *o;
+
           ht.erase (o);
 
           //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
-          free (-2 + (int *)s);
+          int alloc = sizeof (uint32_t) * NUM_INT + length (s) + 1;
+          shstr_alloc -= alloc;
+          g_slice_free1 (alloc, (void *)(s - sizeof (uint32_t) * NUM_INT));
         }
       else
         ++i;
@@ -134,22 +147,13 @@
   curpos = *i;
 }
 
-//TODO: this should of course not be here
-/* buf_overflow() - we don't want to exceed the buffer size of 
- * buf1 by adding on buf2! Returns true if overflow will occur.
- */
-
-int 
-buf_overflow (const char *buf1, const char *buf2, int bufsize)
-{
-    int len1 = 0, len2 = 0;
+// declare these here to get correct initialisation order
+#define def2(id,str) const shstr id (str);
+#define def(id)      def2(shstr_ ## id, # id)
+# include "shstrinc.h"
+#undef def
+#undef def2
 
-    if (buf1)
-        len1 = strlen (buf1);
-    if (buf2)
-        len2 = strlen (buf2);
-    if ((len1 + len2) >= bufsize)
-        return 1;
-    return 0;
-}
+materialtype_t material_null;
 
+struct freed_map freed_map;