1 |
elmex |
1.1 |
/* |
2 |
root |
1.3 |
* shstr.C |
3 |
elmex |
1.1 |
*/ |
4 |
|
|
|
5 |
root |
1.3 |
#include <cstring> |
6 |
|
|
#include <cstdlib> |
7 |
|
|
|
8 |
root |
1.10 |
#include <glib.h> |
9 |
|
|
|
10 |
root |
1.3 |
#include <tr1/unordered_set> |
11 |
elmex |
1.1 |
|
12 |
|
|
#include "shstr.h" |
13 |
root |
1.9 |
#include "util.h" |
14 |
elmex |
1.1 |
|
15 |
root |
1.9 |
typedef std::tr1::unordered_set<const char *, str_hash, str_equal> HT; |
16 |
elmex |
1.1 |
|
17 |
root |
1.3 |
static HT ht; |
18 |
elmex |
1.1 |
|
19 |
root |
1.7 |
static const char *makevec (const char *s) |
20 |
|
|
{ |
21 |
|
|
int len = strlen (s); |
22 |
|
|
|
23 |
root |
1.10 |
const char *v = (const char *)(2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); |
24 |
root |
1.7 |
|
25 |
|
|
shstr::length (v) = len; |
26 |
|
|
shstr::refcnt (v) = 1; |
27 |
|
|
|
28 |
|
|
memcpy ((char *)v, s, len + 1); |
29 |
|
|
|
30 |
root |
1.8 |
return v; |
31 |
root |
1.7 |
} |
32 |
|
|
|
33 |
|
|
const char *shstr::null = makevec ("<nil>"); |
34 |
|
|
|
35 |
root |
1.8 |
// what weird misoptimisation is this again? |
36 |
|
|
const shstr undead_name ("undead"); |
37 |
|
|
|
38 |
elmex |
1.1 |
const char * |
39 |
root |
1.3 |
shstr::find (const char *s) |
40 |
|
|
{ |
41 |
root |
1.4 |
if (!s) |
42 |
|
|
return s; |
43 |
|
|
|
44 |
root |
1.3 |
HT::iterator i = ht.find (s); |
45 |
elmex |
1.1 |
|
46 |
root |
1.3 |
return i != ht.end () |
47 |
root |
1.5 |
? *i |
48 |
root |
1.3 |
: 0; |
49 |
elmex |
1.1 |
} |
50 |
|
|
|
51 |
|
|
const char * |
52 |
root |
1.3 |
shstr::intern (const char *s) |
53 |
|
|
{ |
54 |
root |
1.4 |
if (!s) |
55 |
root |
1.7 |
return null; |
56 |
elmex |
1.1 |
|
57 |
root |
1.4 |
if (const char *found = find (s)) |
58 |
root |
1.5 |
{ |
59 |
|
|
++refcnt (found); |
60 |
|
|
return found; |
61 |
|
|
} |
62 |
elmex |
1.1 |
|
63 |
root |
1.7 |
s = makevec (s); |
64 |
|
|
ht.insert (s); |
65 |
|
|
return s; |
66 |
elmex |
1.1 |
} |
67 |
|
|
|
68 |
root |
1.5 |
// periodically test refcounts == 0 for a few strings |
69 |
|
|
// this is the ONLY thing that erases stuff from ht. keep it that way. |
70 |
elmex |
1.1 |
void |
71 |
root |
1.3 |
shstr::gc () |
72 |
|
|
{ |
73 |
root |
1.5 |
static const char *curpos; |
74 |
|
|
|
75 |
|
|
HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); |
76 |
|
|
|
77 |
|
|
if (i == ht.end ()) |
78 |
|
|
i = ht.begin (); |
79 |
|
|
|
80 |
|
|
// go through all strings roughly once every 4 minutes |
81 |
root |
1.10 |
int n = ht.size () / 256 + 16000; |
82 |
root |
1.6 |
|
83 |
|
|
for (;;) |
84 |
root |
1.5 |
{ |
85 |
|
|
if (i == ht.end ()) |
86 |
|
|
{ |
87 |
|
|
curpos = 0; |
88 |
|
|
return; |
89 |
|
|
} |
90 |
root |
1.6 |
else if (!--n) |
91 |
|
|
break; |
92 |
|
|
else if (!refcnt (*i)) |
93 |
root |
1.5 |
{ |
94 |
|
|
HT::iterator o = i++; |
95 |
|
|
const char *s = *o; |
96 |
|
|
ht.erase (o); |
97 |
|
|
|
98 |
root |
1.10 |
int len = length (s); |
99 |
|
|
|
100 |
root |
1.5 |
//printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
101 |
root |
1.10 |
g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *)s); |
102 |
root |
1.5 |
} |
103 |
|
|
else |
104 |
|
|
++i; |
105 |
|
|
} |
106 |
|
|
|
107 |
|
|
curpos = *i; |
108 |
elmex |
1.1 |
} |
109 |
|
|
|
110 |
root |
1.5 |
//TODO: this should of course not be here |
111 |
elmex |
1.1 |
/* buf_overflow() - we don't want to exceed the buffer size of |
112 |
|
|
* buf1 by adding on buf2! Returns true if overflow will occur. |
113 |
|
|
*/ |
114 |
|
|
|
115 |
|
|
int |
116 |
|
|
buf_overflow (const char *buf1, const char *buf2, int bufsize) |
117 |
|
|
{ |
118 |
root |
1.3 |
int len1 = 0, len2 = 0; |
119 |
elmex |
1.1 |
|
120 |
|
|
if (buf1) |
121 |
root |
1.2 |
len1 = strlen (buf1); |
122 |
elmex |
1.1 |
if (buf2) |
123 |
root |
1.2 |
len2 = strlen (buf2); |
124 |
elmex |
1.1 |
if ((len1 + len2) >= bufsize) |
125 |
root |
1.2 |
return 1; |
126 |
elmex |
1.1 |
return 0; |
127 |
|
|
} |
128 |
|
|
|