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