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 (unsigned int) * 2 + len + 1; |
46 |
const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (unsigned int) * 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 |
static const char * |
57 |
makenull () |
58 |
{ |
59 |
const char *s = makevec ("(null)"); |
60 |
shstr_tmp::length (s) = 0; |
61 |
//shstr ::refcnt (s) = 0xffffffff; // useful for debugging |
62 |
return s; |
63 |
} |
64 |
|
65 |
const char *shstr_tmp::null = makenull (); |
66 |
|
67 |
const char * |
68 |
shstr::find (const char *s) |
69 |
{ |
70 |
if (!s) |
71 |
return s; |
72 |
|
73 |
auto (i, ht.find (s)); |
74 |
|
75 |
return i != ht.end ()? *i : 0; |
76 |
} |
77 |
|
78 |
const char * |
79 |
shstr::intern (const char *s) |
80 |
{ |
81 |
if (!s) |
82 |
return null; |
83 |
|
84 |
if (const char *found = find (s)) |
85 |
{ |
86 |
++refcnt (found); |
87 |
return found; |
88 |
} |
89 |
|
90 |
--next_gc; |
91 |
s = makevec (s); |
92 |
ht.insert (s); |
93 |
return s; |
94 |
} |
95 |
|
96 |
// periodically test refcounts == 0 for a few strings |
97 |
// this is the ONLY thing that erases stuff from ht. keep it that way. |
98 |
void |
99 |
shstr::gc () |
100 |
{ |
101 |
if (expect_true (next_gc > 0)) |
102 |
return; |
103 |
|
104 |
static const char *curpos; |
105 |
|
106 |
auto (i, curpos ? ht.find (curpos) : ht.begin ()); |
107 |
|
108 |
if (i == ht.end ()) |
109 |
i = ht.begin (); |
110 |
|
111 |
int n = ht.size () / 256 + 16; |
112 |
next_gc += n >> 1; |
113 |
|
114 |
for (;;) |
115 |
{ |
116 |
if (i == ht.end ()) |
117 |
{ |
118 |
curpos = 0; |
119 |
return; |
120 |
} |
121 |
else if (!--n) |
122 |
break; |
123 |
else if (!refcnt (*i)) |
124 |
{ |
125 |
auto (o, i++); |
126 |
const char *s = *o; |
127 |
|
128 |
ht.erase (o); |
129 |
|
130 |
//printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
131 |
shstr_alloc -= sizeof (unsigned int) * 2 + length (s) + 1; |
132 |
g_slice_free1 (sizeof (unsigned int) * 2 + length (s) + 1, -2 + (int *) s); |
133 |
} |
134 |
else |
135 |
++i; |
136 |
} |
137 |
|
138 |
curpos = *i; |
139 |
} |
140 |
|
141 |
const shstr shstr_null; |
142 |
|
143 |
// declare these here to get correct initialisation order |
144 |
#define def(str) const shstr shstr_ ## str (# str); |
145 |
# include "shstrinc.h" |
146 |
#undef def |
147 |
|
148 |
shstr skill_names[NUM_SKILLS]; |
149 |
|
150 |
//TODO: this should of course not be here |
151 |
|
152 |
/* buf_overflow() - we don't want to exceed the buffer size of |
153 |
* buf1 by adding on buf2! Returns true if overflow will occur. |
154 |
*/ |
155 |
int |
156 |
buf_overflow (const char *buf1, const char *buf2, int bufsize) |
157 |
{ |
158 |
int len1 = 0, len2 = 0; |
159 |
|
160 |
if (buf1) |
161 |
len1 = strlen (buf1); |
162 |
|
163 |
if (buf2) |
164 |
len2 = strlen (buf2); |
165 |
|
166 |
if ((len1 + len2) >= bufsize) |
167 |
return 1; |
168 |
|
169 |
return 0; |
170 |
} |