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
|
/* $Id: strspace.cpp $ */
/** @file
* IPRT - Unique String Spaces.
*/
/*
* Copyright (C) 2006-2020 Oracle Corporation
*
* This file is part of VirtualBox Open Source Edition (OSE), as
* available from http://www.virtualbox.org. This file is free software;
* you can redistribute it and/or modify it under the terms of the GNU
* General Public License (GPL) as published by the Free Software
* Foundation, in version 2 as it comes in the "COPYING" file of the
* VirtualBox OSE distribution. VirtualBox OSE is distributed in the
* hope that it will be useful, but WITHOUT ANY WARRANTY of any kind.
*
* The contents of this file may alternatively be used under the terms
* of the Common Development and Distribution License Version 1.0
* (CDDL) only, as it comes in the "COPYING.CDDL" file of the
* VirtualBox OSE distribution, in which case the provisions of the
* CDDL are applicable instead of those of the GPL.
*
* You may elect to license modified versions of this file under the
* terms and conditions of either the GPL or the CDDL or both.
*/
/*********************************************************************************************************************************
* Header Files *
*********************************************************************************************************************************/
#include <iprt/string.h>
#include "internal/iprt.h"
#include <iprt/assert.h>
#include "internal/strhash.h"
/*********************************************************************************************************************************
* Defined Constants And Macros *
*********************************************************************************************************************************/
/*
* AVL configuration.
*/
#define KAVL_DECL(a_Type) static a_Type
#define KAVL_FN(a) rtstrspace##a
#define KAVL_MAX_STACK 27 /* Up to 2^24 nodes. */
#define KAVL_EQUAL_ALLOWED 1
#define KAVLNODECORE RTSTRSPACECORE
#define PKAVLNODECORE PRTSTRSPACECORE
#define PPKAVLNODECORE PPRTSTRSPACECORE
#define KAVLKEY uint32_t
#define PKAVLKEY uint32_t *
#define PKAVLCALLBACK PFNRTSTRSPACECALLBACK
/*
* AVL Compare macros
*/
#define KAVL_G(key1, key2) (key1 > key2)
#define KAVL_E(key1, key2) (key1 == key2)
#define KAVL_NE(key1, key2) (key1 != key2)
/*
* Include the code.
*/
#define SSToDS(ptr) ptr
#define KMAX RT_MAX
#define kASSERT Assert
#include "../table/avl_Base.cpp.h"
#include "../table/avl_Get.cpp.h"
#include "../table/avl_DoWithAll.cpp.h"
#include "../table/avl_Destroy.cpp.h"
/**
* Inserts a string into a unique string space.
*
* @returns true on success.
* @returns false if the string collided with an existing string.
* @param pStrSpace The space to insert it into.
* @param pStr The string node.
*/
RTDECL(bool) RTStrSpaceInsert(PRTSTRSPACE pStrSpace, PRTSTRSPACECORE pStr)
{
pStr->Key = sdbm(pStr->pszString, &pStr->cchString);
PRTSTRSPACECORE pMatch = KAVL_FN(Get)(pStrSpace, pStr->Key);
if (!pMatch)
return KAVL_FN(Insert)(pStrSpace, pStr);
/* Check for clashes. */
for (PRTSTRSPACECORE pCur = pMatch; pCur; pCur = pCur->pList)
if ( pCur->cchString == pStr->cchString
&& !memcmp(pCur->pszString, pStr->pszString, pStr->cchString))
return false;
pStr->pList = pMatch->pList;
pMatch->pList = pStr;
return true;
}
RT_EXPORT_SYMBOL(RTStrSpaceInsert);
/**
* Removes a string from a unique string space.
*
* @returns Pointer to the removed string node.
* @returns NULL if the string was not found in the string space.
* @param pStrSpace The space to insert it into.
* @param pszString The string to remove.
*/
RTDECL(PRTSTRSPACECORE) RTStrSpaceRemove(PRTSTRSPACE pStrSpace, const char *pszString)
{
size_t cchString;
KAVLKEY Key = sdbm(pszString, &cchString);
PRTSTRSPACECORE pCur = KAVL_FN(Get)(pStrSpace, Key);
if (!pCur)
return NULL;
/* find the right one. */
PRTSTRSPACECORE pPrev = NULL;
for (; pCur; pPrev = pCur, pCur = pCur->pList)
if ( pCur->cchString == cchString
&& !memcmp(pCur->pszString, pszString, cchString))
break;
if (pCur)
{
if (pPrev)
/* simple, it's in the linked list. */
pPrev->pList = pCur->pList;
else
{
/* in the tree. remove and reinsert list head. */
PRTSTRSPACECORE pInsert = pCur->pList;
pCur->pList = NULL;
pCur = KAVL_FN(Remove)(pStrSpace, Key);
Assert(pCur);
if (pInsert)
{
PRTSTRSPACECORE pList = pInsert->pList;
bool fRc = KAVL_FN(Insert)(pStrSpace, pInsert);
Assert(fRc); NOREF(fRc);
pInsert->pList = pList;
}
}
}
return pCur;
}
RT_EXPORT_SYMBOL(RTStrSpaceRemove);
/**
* Gets a string from a unique string space.
*
* @returns Pointer to the string node.
* @returns NULL if the string was not found in the string space.
* @param pStrSpace The space to insert it into.
* @param pszString The string to get.
*/
RTDECL(PRTSTRSPACECORE) RTStrSpaceGet(PRTSTRSPACE pStrSpace, const char *pszString)
{
size_t cchString;
KAVLKEY Key = sdbm(pszString, &cchString);
PRTSTRSPACECORE pCur = KAVL_FN(Get)(pStrSpace, Key);
if (!pCur)
return NULL;
/* Linear search. */
for (; pCur; pCur = pCur->pList)
if ( pCur->cchString == cchString
&& !memcmp(pCur->pszString, pszString, cchString))
return pCur;
return NULL;
}
RT_EXPORT_SYMBOL(RTStrSpaceGet);
/**
* Gets a string from a unique string space.
*
* @returns Pointer to the string node.
* @returns NULL if the string was not found in the string space.
* @param pStrSpace The space to insert it into.
* @param pszString The string to get.
* @param cchMax The max string length to evaluate. Passing
* RTSTR_MAX is ok and makes it behave just like
* RTStrSpaceGet.
*/
RTDECL(PRTSTRSPACECORE) RTStrSpaceGetN(PRTSTRSPACE pStrSpace, const char *pszString, size_t cchMax)
{
size_t cchString;
KAVLKEY Key = sdbmN(pszString, cchMax, &cchString);
PRTSTRSPACECORE pCur = KAVL_FN(Get)(pStrSpace, Key);
if (!pCur)
return NULL;
/* Linear search. */
for (; pCur; pCur = pCur->pList)
if ( pCur->cchString == cchString
&& !memcmp(pCur->pszString, pszString, cchString))
return pCur;
return NULL;
}
RT_EXPORT_SYMBOL(RTStrSpaceGetN);
/**
* Enumerates the string space.
* The caller supplies a callback which will be called for each of
* the string nodes.
*
* @returns 0 or what ever non-zero return value pfnCallback returned
* when aborting the destruction.
* @param pStrSpace The space to insert it into.
* @param pfnCallback The callback.
* @param pvUser The user argument.
*/
RTDECL(int) RTStrSpaceEnumerate(PRTSTRSPACE pStrSpace, PFNRTSTRSPACECALLBACK pfnCallback, void *pvUser)
{
return KAVL_FN(DoWithAll)(pStrSpace, true, pfnCallback, pvUser);
}
RT_EXPORT_SYMBOL(RTStrSpaceEnumerate);
/**
* Destroys the string space.
* The caller supplies a callback which will be called for each of
* the string nodes in for freeing their memory and other resources.
*
* @returns 0 or what ever non-zero return value pfnCallback returned
* when aborting the destruction.
* @param pStrSpace The space to insert it into.
* @param pfnCallback The callback.
* @param pvUser The user argument.
*/
RTDECL(int) RTStrSpaceDestroy(PRTSTRSPACE pStrSpace, PFNRTSTRSPACECALLBACK pfnCallback, void *pvUser)
{
return KAVL_FN(Destroy)(pStrSpace, pfnCallback, pvUser);
}
RT_EXPORT_SYMBOL(RTStrSpaceDestroy);
|
