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