| 1 |
/* |
| 2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
| 5 |
* |
| 6 |
* Deliantra is free software: you can redistribute it and/or modify |
| 7 |
* it under the terms of the GNU General Public License as published by |
| 8 |
* the Free Software Foundation, either version 3 of the License, or |
| 9 |
* (at your option) any later version. |
| 10 |
* |
| 11 |
* This program is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU General Public License |
| 17 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
| 18 |
* |
| 19 |
* The authors can be reached via e-mail to <support@deliantra.net> |
| 20 |
*/ |
| 21 |
|
| 22 |
/* |
| 23 |
* shstr.C |
| 24 |
*/ |
| 25 |
|
| 26 |
#include <cstring> |
| 27 |
#include <cstdlib> |
| 28 |
#include <glib.h> |
| 29 |
#include <tr1/unordered_set> |
| 30 |
|
| 31 |
#include "global.h" |
| 32 |
|
| 33 |
size_t shstr_alloc; |
| 34 |
|
| 35 |
typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT; |
| 36 |
|
| 37 |
static HT ht; |
| 38 |
static int next_gc; |
| 39 |
|
| 40 |
static const char * |
| 41 |
makevec (const char *s) |
| 42 |
{ |
| 43 |
int len = strlen (s); |
| 44 |
|
| 45 |
shstr_alloc += sizeof (uint32_t) * 2 + len + 1; |
| 46 |
const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (uint32_t) * 2 + len + 1)); |
| 47 |
|
| 48 |
shstr::length (v) = len; |
| 49 |
shstr::refcnt (v) = 1; |
| 50 |
|
| 51 |
memcpy ((char *) v, s, len + 1); |
| 52 |
|
| 53 |
return v; |
| 54 |
} |
| 55 |
|
| 56 |
shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { 0, 0xffffffff, "(null)" }; |
| 57 |
|
| 58 |
const char * |
| 59 |
shstr::find (const char *s) |
| 60 |
{ |
| 61 |
if (!s) |
| 62 |
return s; |
| 63 |
|
| 64 |
auto (i, ht.find (s)); |
| 65 |
|
| 66 |
return i != ht.end ()? *i : 0; |
| 67 |
} |
| 68 |
|
| 69 |
const char * |
| 70 |
shstr::intern (const char *s) |
| 71 |
{ |
| 72 |
if (!s) |
| 73 |
return null (); |
| 74 |
|
| 75 |
if (const char *found = find (s)) |
| 76 |
{ |
| 77 |
++refcnt (found); |
| 78 |
return found; |
| 79 |
} |
| 80 |
|
| 81 |
--next_gc; |
| 82 |
s = makevec (s); |
| 83 |
ht.insert (s); |
| 84 |
return s; |
| 85 |
} |
| 86 |
|
| 87 |
// periodically test refcounts == 0 for a few strings |
| 88 |
// this is the ONLY thing that erases stuff from ht. keep it that way. |
| 89 |
void |
| 90 |
shstr::gc () |
| 91 |
{ |
| 92 |
if (expect_true (next_gc > 0)) |
| 93 |
return; |
| 94 |
|
| 95 |
static const char *curpos; |
| 96 |
|
| 97 |
auto (i, curpos ? ht.find (curpos) : ht.begin ()); |
| 98 |
|
| 99 |
if (i == ht.end ()) |
| 100 |
i = ht.begin (); |
| 101 |
|
| 102 |
int n = ht.size () / 256 + 16; |
| 103 |
next_gc += n >> 1; |
| 104 |
|
| 105 |
for (;;) |
| 106 |
{ |
| 107 |
if (i == ht.end ()) |
| 108 |
{ |
| 109 |
curpos = 0; |
| 110 |
return; |
| 111 |
} |
| 112 |
else if (!--n) |
| 113 |
break; |
| 114 |
else if (!refcnt (*i)) |
| 115 |
{ |
| 116 |
auto (o, i++); |
| 117 |
const char *s = *o; |
| 118 |
|
| 119 |
ht.erase (o); |
| 120 |
|
| 121 |
//printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
| 122 |
shstr_alloc -= sizeof (uint32_t) * 2 + length (s) + 1; |
| 123 |
g_slice_free1 (sizeof (uint32_t) * 2 + length (s) + 1, -2 + (int *) s); |
| 124 |
} |
| 125 |
else |
| 126 |
++i; |
| 127 |
} |
| 128 |
|
| 129 |
curpos = *i; |
| 130 |
} |
| 131 |
|
| 132 |
// declare these here to get correct initialisation order |
| 133 |
#define def2(id,str) const shstr id (str); |
| 134 |
#define def(id) def2(shstr_ ## id, # id) |
| 135 |
# include "shstrinc.h" |
| 136 |
#undef def |
| 137 |
#undef def2 |
| 138 |
|
| 139 |
shstr skill_names[NUM_SKILLS]; |
| 140 |
|
| 141 |
//TODO: this should of course not be here |
| 142 |
|
| 143 |
/* buf_overflow() - we don't want to exceed the buffer size of |
| 144 |
* buf1 by adding on buf2! Returns true if overflow will occur. |
| 145 |
*/ |
| 146 |
int |
| 147 |
buf_overflow (const char *buf1, const char *buf2, int bufsize) |
| 148 |
{ |
| 149 |
int len1 = 0, len2 = 0; |
| 150 |
|
| 151 |
if (buf1) |
| 152 |
len1 = strlen (buf1); |
| 153 |
|
| 154 |
if (buf2) |
| 155 |
len2 = strlen (buf2); |
| 156 |
|
| 157 |
if ((len1 + len2) >= bufsize) |
| 158 |
return 1; |
| 159 |
|
| 160 |
return 0; |
| 161 |
} |
