--- deliantra/server/common/shstr.C 2007/10/22 05:46:44 1.27 +++ deliantra/server/common/shstr.C 2009/01/01 11:41:17 1.36 @@ -1,9 +1,9 @@ /* - * 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 * - * 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. @@ -16,7 +16,7 @@ * 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 */ /* @@ -32,17 +32,18 @@ size_t shstr_alloc; -typedef std::tr1::unordered_set , true> HT; +typedef std::tr1::unordered_set > 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_alloc += sizeof (uint32_t) * 2 + len + 1; + const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (uint32_t) * 2 + len + 1)); shstr::length (v) = len; shstr::refcnt (v) = 1; @@ -52,15 +53,7 @@ return v; } -static const char * -makenull () -{ - const char *s = makevec ("(null)"); - shstr::length (s) = 0; - return s; -} - -const char *shstr::null = makenull (); +shstr_vec shstr_tmp::nullvec = { 0, 0xffffffff, "(null)" }; const char * shstr::find (const char *s) @@ -77,7 +70,7 @@ shstr::intern (const char *s) { if (!s) - return null; + return null (); if (const char *found = find (s)) { @@ -85,6 +78,7 @@ return found; } + --next_gc; s = makevec (s); ht.insert (s); return s; @@ -95,6 +89,9 @@ void shstr::gc () { + if (expect_true (next_gc > 0)) + return; + static const char *curpos; auto (i, curpos ? ht.find (curpos) : ht.begin ()); @@ -103,6 +100,7 @@ i = ht.begin (); int n = ht.size () / 256 + 16; + next_gc += n >> 1; for (;;) { @@ -121,8 +119,8 @@ 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); + shstr_alloc -= sizeof (uint32_t) * 2 + length (s) + 1; + g_slice_free1 (sizeof (uint32_t) * 2 + length (s) + 1, -2 + (int *) s); } else ++i; @@ -132,9 +130,11 @@ } // declare these here to get correct initialisation order -#define def(str) const shstr shstr_ ## str (# str); +#define def2(id,str) const shstr shstr_ ## id (str); +#define def(id) def2(id, # id) # include "shstrinc.h" #undef def +#undef def2 shstr skill_names[NUM_SKILLS];