1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
/**
* @file llstringtable.cpp
* @brief The LLStringTable class provides a _fast_ method for finding
* unique copies of strings.
*
* Copyright (c) 2001-$CurrentYear$, Linden Research, Inc.
* $License$
*/
#include "linden_common.h"
#include "llstringtable.h"
#include "llstl.h"
LLStringTable gStringTable(32768);
LLStringTable::LLStringTable(int tablesize)
: mUniqueEntries(0)
{
S32 i;
if (!tablesize)
tablesize = 4096; // some arbitrary default
// Make sure tablesize is power of 2
for (i = 31; i>0; i--)
{
if (tablesize & (1<<i))
{
if (tablesize >= (3<<(i-1)))
tablesize = (1<<(i+1));
else
tablesize = (1<<i);
break;
}
}
mMaxEntries = tablesize;
#if !STRING_TABLE_HASH_MAP
// ALlocate strings
mStringList = new string_list_ptr_t[mMaxEntries];
// Clear strings
for (i = 0; i < mMaxEntries; i++)
{
mStringList[i] = NULL;
}
#endif
}
LLStringTable::~LLStringTable()
{
#if !STRING_TABLE_HASH_MAP
if (mStringList)
{
for (S32 i = 0; i < mMaxEntries; i++)
{
if (mStringList[i])
{
string_list_t::iterator iter;
for (iter = mStringList[i]->begin(); iter != mStringList[i]->end(); iter++)
delete *iter; // *iter = (LLStringTableEntry*)
}
delete mStringList[i];
}
delete [] mStringList;
mStringList = NULL;
}
#else
// Need to clean up the string hash
for_each(mStringHash.begin(), mStringHash.end(), DeletePairedPointer());
mStringHash.clear();
#endif
}
static U32 hash_my_string(const char *str, int max_entries)
{
U32 retval = 0;
#if 0
while (*str)
{
retval <<= 1;
retval += *str++;
}
#else
while (*str)
{
retval = (retval<<4) + *str;
U32 x = (retval & 0xf0000000);
if (x) retval = retval ^ (x>>24);
retval = retval & (~x);
str++;
}
#endif
return (retval & (max_entries-1)); // max_entries is gauranteed to be power of 2
}
char* LLStringTable::checkString(const std::string& str)
{
return checkString(str.c_str());
}
char* LLStringTable::checkString(const char *str)
{
LLStringTableEntry* entry = checkStringEntry(str);
if (entry)
{
return entry->mString;
}
else
{
return NULL;
}
}
LLStringTableEntry* LLStringTable::checkStringEntry(const std::string& str)
{
return checkStringEntry(str.c_str());
}
LLStringTableEntry* LLStringTable::checkStringEntry(const char *str)
{
if (str)
{
char *ret_val;
LLStringTableEntry *entry;
U32 hash_value = hash_my_string(str, mMaxEntries);
#if STRING_TABLE_HASH_MAP
#if 1 // Microsoft
string_hash_t::iterator lower = mStringHash.lower_bound(hash_value);
string_hash_t::iterator upper = mStringHash.upper_bound(hash_value);
#else // stlport
std::pair<string_hash_t::iterator, string_hash_t::iterator> P = mStringHash.equal_range(hash_value);
string_hash_t::iterator lower = P.first;
string_hash_t::iterator upper = P.second;
#endif
for (string_hash_t::iterator iter = lower; iter != upper; iter++)
{
entry = iter->second;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
return entry;
}
}
#else
string_list_t *strlist = mStringList[hash_value];
if (strlist)
{
string_list_t::iterator iter;
for (iter = strlist->begin(); iter != strlist->end(); iter++)
{
entry = *iter;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
return entry;
}
}
}
#endif
}
return NULL;
}
char* LLStringTable::addString(const std::string& str)
{
//RN: safe to use temporary c_str since string is copied
return addString(str.c_str());
}
char* LLStringTable::addString(const char *str)
{
LLStringTableEntry* entry = addStringEntry(str);
if (entry)
{
return entry->mString;
}
else
{
return NULL;
}
}
LLStringTableEntry* LLStringTable::addStringEntry(const std::string& str)
{
return addStringEntry(str.c_str());
}
LLStringTableEntry* LLStringTable::addStringEntry(const char *str)
{
if (str)
{
char *ret_val = NULL;
LLStringTableEntry *entry;
U32 hash_value = hash_my_string(str, mMaxEntries);
#if STRING_TABLE_HASH_MAP
#if 1 // Microsoft
string_hash_t::iterator lower = mStringHash.lower_bound(hash_value);
string_hash_t::iterator upper = mStringHash.upper_bound(hash_value);
#else // stlport
std::pair<string_hash_t::iterator, string_hash_t::iterator> P = mStringHash.equal_range(hash_value);
string_hash_t::iterator lower = P.first;
string_hash_t::iterator upper = P.second;
#endif
for (string_hash_t::iterator iter = lower; iter != upper; iter++)
{
entry = iter->second;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
entry->incCount();
return entry;
}
}
// not found, so add!
LLStringTableEntry* newentry = new LLStringTableEntry(str);
ret_val = newentry->mString;
mStringHash.insert(string_hash_t::value_type(hash_value, newentry));
#else
string_list_t *strlist = mStringList[hash_value];
if (strlist)
{
string_list_t::iterator iter;
for (iter = strlist->begin(); iter != strlist->end(); iter++)
{
entry = *iter;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
entry->incCount();
return entry;
}
}
}
else
{
mStringList[hash_value] = new string_list_t;
strlist = mStringList[hash_value];
}
// not found, so add!
LLStringTableEntry *newentry = new LLStringTableEntry(str);
//ret_val = newentry->mString;
strlist->push_front(newentry);
#endif
mUniqueEntries++;
return newentry;
}
else
{
return NULL;
}
}
void LLStringTable::removeString(const char *str)
{
if (str)
{
char *ret_val;
LLStringTableEntry *entry;
U32 hash_value = hash_my_string(str, mMaxEntries);
#if STRING_TABLE_HASH_MAP
{
#if 1 // Microsoft
string_hash_t::iterator lower = mStringHash.lower_bound(hash_value);
string_hash_t::iterator upper = mStringHash.upper_bound(hash_value);
#else // stlport
std::pair<string_hash_t::iterator, string_hash_t::iterator> P = mStringHash.equal_range(hash_value);
string_hash_t::iterator lower = P.first;
string_hash_t::iterator upper = P.second;
#endif
for (string_hash_t::iterator iter = lower; iter != upper; iter++)
{
entry = iter->second;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
if (!entry->decCount())
{
mUniqueEntries--;
if (mUniqueEntries < 0)
{
llerror("LLStringTable:removeString trying to remove too many strings!", 0);
}
delete iter->second;
mStringHash.erase(iter);
}
return;
}
}
}
#else
string_list_t *strlist = mStringList[hash_value];
if (strlist)
{
string_list_t::iterator iter;
for (iter = strlist->begin(); iter != strlist->end(); iter++)
{
entry = *iter;
ret_val = entry->mString;
if (!strncmp(ret_val, str, MAX_STRINGS_LENGTH))
{
if (!entry->decCount())
{
mUniqueEntries--;
if (mUniqueEntries < 0)
{
llerror("LLStringTable:removeString trying to remove too many strings!", 0);
}
strlist->remove(entry);
delete entry;
}
return;
}
}
}
#endif
}
}
|
