1 |
/* |
2 |
* This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 |
* |
6 |
* Crossfire TRT 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 <crossfire@schmorp.de> |
20 |
*/ |
21 |
|
22 |
/* |
23 |
* shstr.C |
24 |
*/ |
25 |
|
26 |
#include <cstring> |
27 |
#include <cstdlib> |
28 |
#include <glib.h> |
29 |
#include <tr1/unordered_set> |
30 |
|
31 |
#include "global.h" |
32 |
|
33 |
size_t shstr_alloc; |
34 |
|
35 |
typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; |
36 |
|
37 |
static HT ht; |
38 |
|
39 |
static const char * |
40 |
makevec (const char *s) |
41 |
{ |
42 |
int len = strlen (s); |
43 |
|
44 |
shstr_alloc += sizeof (int) * 2 + len + 1; |
45 |
const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); |
46 |
|
47 |
shstr::length (v) = len; |
48 |
shstr::refcnt (v) = 1; |
49 |
|
50 |
memcpy ((char *) v, s, len + 1); |
51 |
|
52 |
return v; |
53 |
} |
54 |
|
55 |
static const char * |
56 |
makenull () |
57 |
{ |
58 |
const char *s = makevec ("(null)"); |
59 |
shstr::length (s) = 0; |
60 |
return s; |
61 |
} |
62 |
|
63 |
const char *shstr::null = makenull (); |
64 |
|
65 |
const char * |
66 |
shstr::find (const char *s) |
67 |
{ |
68 |
if (!s) |
69 |
return s; |
70 |
|
71 |
auto (i, ht.find (s)); |
72 |
|
73 |
return i != ht.end ()? *i : 0; |
74 |
} |
75 |
|
76 |
const char * |
77 |
shstr::intern (const char *s) |
78 |
{ |
79 |
if (!s) |
80 |
return null; |
81 |
|
82 |
if (const char *found = find (s)) |
83 |
{ |
84 |
++refcnt (found); |
85 |
return found; |
86 |
} |
87 |
|
88 |
s = makevec (s); |
89 |
ht.insert (s); |
90 |
return s; |
91 |
} |
92 |
|
93 |
// periodically test refcounts == 0 for a few strings |
94 |
// this is the ONLY thing that erases stuff from ht. keep it that way. |
95 |
void |
96 |
shstr::gc () |
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 |
// go through all strings roughly once every 4 minutes |
106 |
int n = ht.size () / 256 + 16; |
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 |
shstr_alloc -= sizeof (int) * 2 + length (s) + 1; |
126 |
g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); |
127 |
} |
128 |
else |
129 |
++i; |
130 |
} |
131 |
|
132 |
curpos = *i; |
133 |
} |
134 |
|
135 |
// declare these here to get correct initialisation order |
136 |
#define def(str) const shstr shstr_ ## str (# str); |
137 |
# include "shstrinc.h" |
138 |
#undef def |
139 |
|
140 |
shstr skill_names[NUM_SKILLS]; |
141 |
|
142 |
//TODO: this should of course not be here |
143 |
|
144 |
/* buf_overflow() - we don't want to exceed the buffer size of |
145 |
* buf1 by adding on buf2! Returns true if overflow will occur. |
146 |
*/ |
147 |
int |
148 |
buf_overflow (const char *buf1, const char *buf2, int bufsize) |
149 |
{ |
150 |
int len1 = 0, len2 = 0; |
151 |
|
152 |
if (buf1) |
153 |
len1 = strlen (buf1); |
154 |
|
155 |
if (buf2) |
156 |
len2 = strlen (buf2); |
157 |
|
158 |
if ((len1 + len2) >= bufsize) |
159 |
return 1; |
160 |
|
161 |
return 0; |
162 |
} |