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