/*
* 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 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 GNU General Public License
* along with this program. If not, see .
*
* The authors can be reached via e-mail to
*/
/*
* shstr.C
*/
#include
#include
#include
#include
#include "global.h"
size_t shstr_alloc;
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::length (v) = len;
shstr::refcnt (v) = 1;
memcpy ((char *) v, s, len + 1);
return v;
}
static const char *
makenull ()
{
const char *s = makevec ("(null)");
shstr::length (s) = 0;
return s;
}
const char *shstr::null = makenull ();
const char *
shstr::find (const char *s)
{
if (!s)
return s;
auto (i, ht.find (s));
return i != ht.end ()? *i : 0;
}
const char *
shstr::intern (const char *s)
{
if (!s)
return null;
if (const char *found = find (s))
{
++refcnt (found);
return found;
}
--next_gc;
s = makevec (s);
ht.insert (s);
return s;
}
// periodically test refcounts == 0 for a few strings
// this is the ONLY thing that erases stuff from ht. keep it that way.
void
shstr::gc ()
{
if (expect_true (next_gc > 0))
return;
static const char *curpos;
auto (i, curpos ? ht.find (curpos) : ht.begin ());
if (i == ht.end ())
i = ht.begin ();
int n = ht.size () / 256 + 16;
next_gc += n >> 1;
for (;;)
{
if (i == ht.end ())
{
curpos = 0;
return;
}
else if (!--n)
break;
else if (!refcnt (*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));
shstr_alloc -= sizeof (int) * 2 + length (s) + 1;
g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
}
else
++i;
}
curpos = *i;
}
const shstr shstr_null;
// 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
/* 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;
if (buf1)
len1 = strlen (buf1);
if (buf2)
len2 = strlen (buf2);
if ((len1 + len2) >= bufsize)
return 1;
return 0;
}