|
|
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 | */ |
1 | |
21 | |
2 | /* |
22 | /* |
3 | * shstr.C |
23 | * shstr.C |
4 | */ |
24 | */ |
5 | |
25 | |
6 | #include <cstring> |
26 | #include <cstring> |
7 | #include <cstdlib> |
27 | #include <cstdlib> |
8 | |
|
|
9 | #include <glib.h> |
28 | #include <glib.h> |
10 | |
|
|
11 | #include <tr1/unordered_set> |
29 | #include <tr1/unordered_set> |
12 | |
30 | |
13 | #include "shstr.h" |
|
|
14 | #include "util.h" |
31 | #include "global.h" |
15 | |
32 | |
16 | typedef |
33 | size_t shstr_alloc; |
17 | std::tr1::unordered_set < const char *, |
|
|
18 | str_hash, |
|
|
19 | str_equal > |
|
|
20 | HT; |
|
|
21 | |
34 | |
|
|
35 | typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT; |
|
|
36 | |
22 | static HT |
37 | static HT ht; |
23 | ht; |
38 | static int next_gc; |
24 | |
39 | |
25 | static const char * |
40 | static const char * |
26 | makevec (const char *s) |
41 | makevec (const char *s) |
27 | { |
42 | { |
28 | int |
|
|
29 | len = strlen (s); |
43 | int len = strlen (s); |
30 | |
44 | |
31 | const char * |
45 | shstr_alloc += sizeof (uint32_t) * 2 + len + 1; |
32 | v = (const char *) (2 + (int *) g_slice_alloc (sizeof (int) * 2 + len + 1)); |
46 | const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (uint32_t) * 2 + len + 1)); |
33 | |
47 | |
34 | shstr::length (v) = len; |
48 | shstr::length (v) = len; |
35 | shstr::refcnt (v) = 1; |
49 | shstr::refcnt (v) = 1; |
36 | |
50 | |
37 | memcpy ((char *) v, s, len + 1); |
51 | memcpy ((char *) v, s, len + 1); |
38 | |
52 | |
39 | return v; |
53 | return v; |
40 | } |
54 | } |
41 | |
55 | |
42 | const char * |
56 | shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { 0, 0xffffffff, "(null)" }; |
43 | shstr::null = makevec ("<nil>"); |
|
|
44 | |
|
|
45 | // what weird misoptimisation is this again? |
|
|
46 | const shstr undead_name ("undead"); |
|
|
47 | |
|
|
48 | shstr skill_names[NUM_SKILLS]; |
|
|
49 | |
57 | |
50 | const char * |
58 | const char * |
51 | shstr::find (const char *s) |
59 | shstr::find (const char *s) |
52 | { |
60 | { |
53 | if (!s) |
61 | if (!s) |
54 | return s; |
62 | return s; |
55 | |
63 | |
56 | HT::iterator i = ht.find (s); |
64 | auto (i, ht.find (s)); |
57 | |
65 | |
58 | return i != ht.end ()? *i : 0; |
66 | return i != ht.end ()? *i : 0; |
59 | } |
67 | } |
60 | |
68 | |
61 | const char * |
69 | const char * |
62 | shstr::intern (const char *s) |
70 | shstr::intern (const char *s) |
63 | { |
71 | { |
64 | if (!s) |
72 | if (!s) |
65 | return null; |
73 | return null (); |
66 | |
74 | |
67 | if (const char *found = find (s)) |
75 | if (const char *found = find (s)) |
68 | { |
76 | { |
69 | ++refcnt (found); |
77 | ++refcnt (found); |
70 | return found; |
78 | return found; |
71 | } |
79 | } |
72 | |
80 | |
|
|
81 | --next_gc; |
73 | s = makevec (s); |
82 | s = makevec (s); |
74 | ht.insert (s); |
83 | ht.insert (s); |
75 | return s; |
84 | return s; |
76 | } |
85 | } |
77 | |
86 | |
78 | // periodically test refcounts == 0 for a few strings |
87 | // periodically test refcounts == 0 for a few strings |
79 | // this is the ONLY thing that erases stuff from ht. keep it that way. |
88 | // this is the ONLY thing that erases stuff from ht. keep it that way. |
80 | void |
89 | void |
81 | shstr::gc () |
90 | shstr::gc () |
82 | { |
91 | { |
83 | return; //D |
92 | if (expect_true (next_gc > 0)) |
84 | //D currently disabled: some datastructures might still store them |
93 | return; |
85 | //D but their pointers will become invalidated |
94 | |
86 | static const char *curpos; |
95 | static const char *curpos; |
87 | |
96 | |
88 | HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); |
97 | auto (i, curpos ? ht.find (curpos) : ht.begin ()); |
89 | |
98 | |
90 | if (i == ht.end ()) |
99 | if (i == ht.end ()) |
91 | i = ht.begin (); |
100 | i = ht.begin (); |
92 | |
101 | |
93 | // go through all strings roughly once every 4 minutes |
|
|
94 | int n = ht.size () / 256 + 16; |
102 | int n = ht.size () / 256 + 16; |
|
|
103 | next_gc += n >> 1; |
95 | |
104 | |
96 | for (;;) |
105 | for (;;) |
97 | { |
106 | { |
98 | if (i == ht.end ()) |
107 | if (i == ht.end ()) |
99 | { |
108 | { |
… | |
… | |
102 | } |
111 | } |
103 | else if (!--n) |
112 | else if (!--n) |
104 | break; |
113 | break; |
105 | else if (!refcnt (*i)) |
114 | else if (!refcnt (*i)) |
106 | { |
115 | { |
107 | HT::iterator o = i++; |
116 | auto (o, i++); |
108 | const char *s = *o; |
117 | const char *s = *o; |
109 | |
118 | |
110 | ht.erase (o); |
119 | ht.erase (o); |
111 | |
120 | |
112 | //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
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; |
113 | g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); |
123 | g_slice_free1 (sizeof (uint32_t) * 2 + length (s) + 1, -2 + (int *) s); |
114 | } |
124 | } |
115 | else |
125 | else |
116 | ++i; |
126 | ++i; |
117 | } |
127 | } |
118 | |
128 | |
119 | curpos = *i; |
129 | curpos = *i; |
120 | } |
130 | } |
121 | |
131 | |
|
|
132 | // declare these here to get correct initialisation order |
|
|
133 | #define def2(id,str) const shstr shstr_ ## id (str); |
|
|
134 | #define def(id) def2(id, # id) |
|
|
135 | # include "shstrinc.h" |
|
|
136 | #undef def |
|
|
137 | #undef def2 |
|
|
138 | |
|
|
139 | shstr skill_names[NUM_SKILLS]; |
|
|
140 | |
122 | //TODO: this should of course not be here |
141 | //TODO: this should of course not be here |
123 | |
142 | |
124 | /* buf_overflow() - we don't want to exceed the buffer size of |
143 | /* buf_overflow() - we don't want to exceed the buffer size of |
125 | * buf1 by adding on buf2! Returns true if overflow will occur. |
144 | * buf1 by adding on buf2! Returns true if overflow will occur. |
126 | */ |
145 | */ |
127 | |
|
|
128 | int |
146 | int |
129 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
147 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
130 | { |
148 | { |
131 | int len1 = 0, len2 = 0; |
149 | int len1 = 0, len2 = 0; |
132 | |
150 | |
133 | if (buf1) |
151 | if (buf1) |
134 | len1 = strlen (buf1); |
152 | len1 = strlen (buf1); |
|
|
153 | |
135 | if (buf2) |
154 | if (buf2) |
136 | len2 = strlen (buf2); |
155 | len2 = strlen (buf2); |
|
|
156 | |
137 | if ((len1 + len2) >= bufsize) |
157 | if ((len1 + len2) >= bufsize) |
138 | return 1; |
158 | return 1; |
|
|
159 | |
139 | return 0; |
160 | return 0; |
140 | } |
161 | } |