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