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 |
shstr skill_names[NUM_SKILLS]; |
49 |
|
50 |
const char * |
51 |
shstr::find (const char *s) |
52 |
{ |
53 |
if (!s) |
54 |
return s; |
55 |
|
56 |
HT::iterator i = ht.find (s); |
57 |
|
58 |
return i != ht.end ()? *i : 0; |
59 |
} |
60 |
|
61 |
const char * |
62 |
shstr::intern (const char *s) |
63 |
{ |
64 |
if (!s) |
65 |
return null; |
66 |
|
67 |
if (const char *found = find (s)) |
68 |
{ |
69 |
++refcnt (found); |
70 |
return found; |
71 |
} |
72 |
|
73 |
s = makevec (s); |
74 |
ht.insert (s); |
75 |
return s; |
76 |
} |
77 |
|
78 |
// periodically test refcounts == 0 for a few strings |
79 |
// this is the ONLY thing that erases stuff from ht. keep it that way. |
80 |
void |
81 |
shstr::gc () |
82 |
{ |
83 |
return; //D |
84 |
//D currently disabled: some datastructures might still store them |
85 |
//D but their pointers will become invalidated |
86 |
static const char *curpos; |
87 |
|
88 |
HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); |
89 |
|
90 |
if (i == ht.end ()) |
91 |
i = ht.begin (); |
92 |
|
93 |
// go through all strings roughly once every 4 minutes |
94 |
int n = ht.size () / 256 + 16; |
95 |
|
96 |
for (;;) |
97 |
{ |
98 |
if (i == ht.end ()) |
99 |
{ |
100 |
curpos = 0; |
101 |
return; |
102 |
} |
103 |
else if (!--n) |
104 |
break; |
105 |
else if (!refcnt (*i)) |
106 |
{ |
107 |
HT::iterator o = i++; |
108 |
const char *s = *o; |
109 |
|
110 |
ht.erase (o); |
111 |
|
112 |
//printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); |
113 |
g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); |
114 |
} |
115 |
else |
116 |
++i; |
117 |
} |
118 |
|
119 |
curpos = *i; |
120 |
} |
121 |
|
122 |
//TODO: this should of course not be here |
123 |
|
124 |
/* buf_overflow() - we don't want to exceed the buffer size of |
125 |
* buf1 by adding on buf2! Returns true if overflow will occur. |
126 |
*/ |
127 |
|
128 |
int |
129 |
buf_overflow (const char *buf1, const char *buf2, int bufsize) |
130 |
{ |
131 |
int len1 = 0, len2 = 0; |
132 |
|
133 |
if (buf1) |
134 |
len1 = strlen (buf1); |
135 |
if (buf2) |
136 |
len2 = strlen (buf2); |
137 |
if ((len1 + len2) >= bufsize) |
138 |
return 1; |
139 |
return 0; |
140 |
} |