1 |
elmex |
1.1 |
/* |
2 |
root |
1.28 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
root |
1.49 |
* |
4 |
root |
1.53 |
* Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
5 |
root |
1.50 |
* Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
6 |
root |
1.49 |
* |
7 |
root |
1.39 |
* Deliantra is free software: you can redistribute it and/or modify it under |
8 |
|
|
* the terms of the Affero GNU General Public License as published by the |
9 |
|
|
* Free Software Foundation, either version 3 of the License, or (at your |
10 |
|
|
* option) any later version. |
11 |
root |
1.49 |
* |
12 |
root |
1.24 |
* This program is distributed in the hope that it will be useful, |
13 |
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
|
|
* GNU General Public License for more details. |
16 |
root |
1.49 |
* |
17 |
root |
1.39 |
* You should have received a copy of the Affero GNU General Public License |
18 |
|
|
* and the GNU General Public License along with this program. If not, see |
19 |
|
|
* <http://www.gnu.org/licenses/>. |
20 |
root |
1.49 |
* |
21 |
root |
1.28 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
root |
1.22 |
*/ |
23 |
|
|
|
24 |
|
|
/* |
25 |
root |
1.3 |
* shstr.C |
26 |
elmex |
1.1 |
*/ |
27 |
|
|
|
28 |
root |
1.3 |
#include <cstring> |
29 |
|
|
#include <cstdlib> |
30 |
root |
1.10 |
#include <glib.h> |
31 |
elmex |
1.1 |
|
32 |
root |
1.52 |
#include <flat_hash_map.hpp> |
33 |
|
|
|
34 |
|
|
#include <global.h> |
35 |
elmex |
1.1 |
|
36 |
root |
1.26 |
size_t shstr_alloc; |
37 |
|
|
|
38 |
root |
1.52 |
typedef ska::flat_hash_set<const char *, str_hash, str_equal, slice_allocator<const char *>> HT; |
39 |
elmex |
1.1 |
|
40 |
root |
1.16 |
static HT ht; |
41 |
root |
1.29 |
static int next_gc; |
42 |
elmex |
1.1 |
|
43 |
root |
1.41 |
#define NUM_INT 3 |
44 |
|
|
|
45 |
root |
1.13 |
static const char * |
46 |
|
|
makevec (const char *s) |
47 |
root |
1.7 |
{ |
48 |
root |
1.17 |
int len = strlen (s); |
49 |
root |
1.41 |
int alloc = sizeof (uint32_t) * NUM_INT + len + 1; |
50 |
root |
1.7 |
|
51 |
root |
1.38 |
shstr_alloc += alloc; |
52 |
|
|
char *v = (char *)g_slice_alloc (alloc); |
53 |
root |
1.41 |
v += sizeof (uint32_t) * NUM_INT; |
54 |
root |
1.7 |
|
55 |
root |
1.41 |
shstr::hash (v) = strhsh (s); |
56 |
root |
1.7 |
shstr::length (v) = len; |
57 |
|
|
shstr::refcnt (v) = 1; |
58 |
|
|
|
59 |
root |
1.38 |
memcpy (v, s, len + 1); |
60 |
root |
1.7 |
|
61 |
root |
1.8 |
return v; |
62 |
root |
1.7 |
} |
63 |
|
|
|
64 |
root |
1.41 |
shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { STRHSH_NULL, 0, 0xffffffff, "(null)" }; |
65 |
root |
1.15 |
|
66 |
root |
1.45 |
bool |
67 |
|
|
shstr_tmp::contains (const char *substring) const |
68 |
|
|
{ |
69 |
|
|
//TODO: this is supposed to check for comma-seperation... |
70 |
|
|
return s != null () |
71 |
|
|
&& substring |
72 |
|
|
&& strstr (s, substring); |
73 |
|
|
} |
74 |
|
|
|
75 |
elmex |
1.1 |
const char * |
76 |
root |
1.3 |
shstr::find (const char *s) |
77 |
|
|
{ |
78 |
root |
1.4 |
if (!s) |
79 |
|
|
return s; |
80 |
|
|
|
81 |
root |
1.21 |
auto (i, ht.find (s)); |
82 |
elmex |
1.1 |
|
83 |
root |
1.13 |
return i != ht.end ()? *i : 0; |
84 |
elmex |
1.1 |
} |
85 |
|
|
|
86 |
|
|
const char * |
87 |
root |
1.3 |
shstr::intern (const char *s) |
88 |
|
|
{ |
89 |
root |
1.4 |
if (!s) |
90 |
root |
1.33 |
return null (); |
91 |
elmex |
1.1 |
|
92 |
root |
1.4 |
if (const char *found = find (s)) |
93 |
root |
1.5 |
{ |
94 |
|
|
++refcnt (found); |
95 |
|
|
return found; |
96 |
|
|
} |
97 |
elmex |
1.1 |
|
98 |
root |
1.29 |
--next_gc; |
99 |
root |
1.7 |
s = makevec (s); |
100 |
|
|
ht.insert (s); |
101 |
|
|
return s; |
102 |
elmex |
1.1 |
} |
103 |
|
|
|
104 |
root |
1.5 |
// periodically test refcounts == 0 for a few strings |
105 |
|
|
// this is the ONLY thing that erases stuff from ht. keep it that way. |
106 |
elmex |
1.1 |
void |
107 |
root |
1.3 |
shstr::gc () |
108 |
|
|
{ |
109 |
root |
1.29 |
if (expect_true (next_gc > 0)) |
110 |
|
|
return; |
111 |
|
|
|
112 |
root |
1.5 |
static const char *curpos; |
113 |
|
|
|
114 |
root |
1.54 |
auto i = curpos ? ht.find (curpos) : ht.begin (); |
115 |
root |
1.5 |
|
116 |
|
|
if (i == ht.end ()) |
117 |
|
|
i = ht.begin (); |
118 |
|
|
|
119 |
root |
1.11 |
int n = ht.size () / 256 + 16; |
120 |
root |
1.29 |
next_gc += n >> 1; |
121 |
root |
1.6 |
|
122 |
|
|
for (;;) |
123 |
root |
1.5 |
{ |
124 |
|
|
if (i == ht.end ()) |
125 |
|
|
{ |
126 |
|
|
curpos = 0; |
127 |
|
|
return; |
128 |
|
|
} |
129 |
root |
1.6 |
else if (!--n) |
130 |
|
|
break; |
131 |
|
|
else if (!refcnt (*i)) |
132 |
root |
1.5 |
{ |
133 |
root |
1.54 |
const char *s = *i; |
134 |
root |
1.13 |
|
135 |
root |
1.54 |
i = ht.erase (i); |
136 |
root |
1.5 |
|
137 |
|
|
//printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
138 |
root |
1.41 |
int alloc = sizeof (uint32_t) * NUM_INT + length (s) + 1; |
139 |
root |
1.38 |
shstr_alloc -= alloc; |
140 |
root |
1.41 |
g_slice_free1 (alloc, (void *)(s - sizeof (uint32_t) * NUM_INT)); |
141 |
root |
1.5 |
} |
142 |
|
|
else |
143 |
|
|
++i; |
144 |
|
|
} |
145 |
|
|
|
146 |
|
|
curpos = *i; |
147 |
elmex |
1.1 |
} |
148 |
|
|
|
149 |
root |
1.25 |
// declare these here to get correct initialisation order |
150 |
root |
1.37 |
#define def2(id,str) const shstr id (str); |
151 |
|
|
#define def(id) def2(shstr_ ## id, # id) |
152 |
root |
1.25 |
# include "shstrinc.h" |
153 |
|
|
#undef def |
154 |
root |
1.36 |
#undef def2 |
155 |
root |
1.25 |
|
156 |
root |
1.42 |
materialtype_t material_null; |
157 |
root |
1.16 |
|
158 |
elmex |
1.47 |
struct freed_map freed_map; |