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