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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
|
/*++
Copyright (c) 1989 Microsoft Corporation
Module Name:
tprefix.c
Abstract:
Test program for the Prefix table package
Author:
Gary Kimura [GaryKi] 03-Aug-1989
Revision History:
--*/
#include <stdio.h>
#include <string.h>
#include "nt.h"
#include "ntrtl.h"
//
// Routines and types for generating random prefixes
//
ULONG RtlRandom ( IN OUT PULONG Seed );
ULONG Seed;
PSZ AnotherPrefix(IN ULONG MaxNameLength);
ULONG AlphabetLength;
//PSZ Alphabet = "AlphaBravoCharlieDeltaEchoFoxtrotGolfHotelIndiaJuliettKiloLimaMikeNovemberOscarPapaQuebecRomeoSierraTangoUniformVictorWhiskeyXrayYankeeZulu";
PSZ Alphabet = "\
Aa\
BBbb\
CCCccc\
DDDDdddd\
EEEEEeeeee\
FFFFFFffffff\
GGGGGGGggggggg\
HHHHHHHHhhhhhhhh\
IIIIIIIIIiiiiiiiii\
JJJJJJJJJJjjjjjjjjjj\
KKKKKKKKKKKkkkkkkkkkkk\
LLLLLLLLLLLLllllllllllll\
MMMMMMMMMMMMMmmmmmmmmmmmmm\
NNNNNNNNNNNNNNnnnnnnnnnnnnnn\
OOOOOOOOOOOOOOOooooooooooooooo\
PPPPPPPPPPPPPPPPpppppppppppppppp\
QQQQQQQQQQQQQQQQQqqqqqqqqqqqqqqqqq\
RRRRRRRRRRRRRRRRRRrrrrrrrrrrrrrrrrrr\
SSSSSSSSSSSSSSSSSSSsssssssssssssssssss\
TTTTTTTTTTTTTTTTTTTTtttttttttttttttttttt\
UUUUUUUUUUUUUUUUUUUUUuuuuuuuuuuuuuuuuuuuuu\
VVVVVVVVVVVVVVVVVVVVVVvvvvvvvvvvvvvvvvvvvvvv\
WWWWWWWWWWWWWWWWWWWWWWWwwwwwwwwwwwwwwwwwwwwwww\
XXXXXXXXXXXXXXXXXXXXXXXXxxxxxxxxxxxxxxxxxxxxxxxx\
YYYYYYYYYYYYYYYYYYYYYYYYYyyyyyyyyyyyyyyyyyyyyyyyyy\
ZZZZZZZZZZZZZZZZZZZZZZZZZZzzzzzzzzzzzzzzzzzzzzzzzzzz";
#define BUFFER_LENGTH 8192
CHAR Buffer[BUFFER_LENGTH];
ULONG NextBufferChar = 0;
//
// record structure and variables for the prefix table and it
// elements
//
typedef struct _PREFIX_NODE {
PREFIX_TABLE_ENTRY PfxEntry;
STRING String;
} PREFIX_NODE;
typedef PREFIX_NODE *PPREFIX_NODE;
#define PREFIXES 512
PREFIX_NODE Prefixes[PREFIXES];
PREFIX_TABLE PrefixTable;
int
main(
int argc,
char *argv[]
)
{
ULONG i;
PSZ Psz;
PPREFIX_TABLE_ENTRY PfxEntry;
PPREFIX_NODE PfxNode;
STRING String;
//
// We're starting the test
//
DbgPrint("Start Prefix Test\n");
//
// Calculate the alphabet size for use by AnotherPrefix
//
AlphabetLength = strlen(Alphabet);
//
// Initialize the prefix table
//
PfxInitialize(&PrefixTable);
//
// Insert the root prefix
//
RtlInitString( &Prefixes[i].String, "\\" );
if (PfxInsertPrefix( &PrefixTable,
&Prefixes[0].String,
&Prefixes[0].PfxEntry )) {
DbgPrint("Insert root prefix\n");
} else {
DbgPrint("error inserting root prefix\n");
}
//
// Insert prefixes
//
Seed = 0;
for (i = 1, Psz = AnotherPrefix(3);
(i < PREFIXES) && (Psz != NULL);
i += 1, Psz = AnotherPrefix(3)) {
DbgPrint("[0x%x] = ", i);
DbgPrint("\"%s\"", Psz);
RtlInitString(&Prefixes[i].String, Psz);
if (PfxInsertPrefix( &PrefixTable,
&Prefixes[i].String,
&Prefixes[i].PfxEntry )) {
DbgPrint(" inserted in table\n");
} else {
DbgPrint(" already in table\n");
}
}
//
// Enumerate the prefix table
//
DbgPrint("Enumerate Prefix Table the first time\n");
for (PfxEntry = PfxNextPrefix(&PrefixTable, TRUE);
PfxEntry != NULL;
PfxEntry = PfxNextPrefix(&PrefixTable, FALSE)) {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint("%s\n", PfxNode->String.Buffer);
}
DbgPrint("Start Prefix search 0x%x\n", NextBufferChar);
//
// Search for prefixes
//
for (Psz = AnotherPrefix(4); Psz != NULL; Psz = AnotherPrefix(4)) {
DbgPrint("0x%x ", NextBufferChar);
RtlInitString(&String, Psz);
PfxEntry = PfxFindPrefix( &PrefixTable, &String, FALSE );
if (PfxEntry == NULL) {
PfxEntry = PfxFindPrefix( &PrefixTable, &String, TRUE );
if (PfxEntry == NULL) {
DbgPrint("Not found \"%s\"\n", Psz);
NOTHING;
} else {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint("Case blind \"%s\" is \"%s\"\n", Psz, PfxNode->String.Buffer);
PfxRemovePrefix( &PrefixTable, PfxEntry );
}
} else {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint( "Case sensitive \"%s\" is \"%s\"\n", Psz, PfxNode->String.Buffer);
if (PfxNode != &Prefixes[0]) {
PfxRemovePrefix( &PrefixTable, PfxEntry );
}
}
}
//
// Enumerate the prefix table
//
DbgPrint("Enumerate Prefix Table a second time\n");
for (PfxEntry = PfxNextPrefix(&PrefixTable, TRUE);
PfxEntry != NULL;
PfxEntry = PfxNextPrefix(&PrefixTable, FALSE)) {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint("%s\n", PfxNode->String.Buffer);
}
//
// Now enumerate and zero out the table
//
for (PfxEntry = PfxNextPrefix(&PrefixTable, TRUE);
PfxEntry != NULL;
PfxEntry = PfxNextPrefix(&PrefixTable, FALSE)) {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint("Delete %s\n", PfxNode->String.Buffer);
PfxRemovePrefix( &PrefixTable, PfxEntry );
}
//
// Enumerate again but this time the table should be empty
//
for (PfxEntry = PfxNextPrefix(&PrefixTable, TRUE);
PfxEntry != NULL;
PfxEntry = PfxNextPrefix(&PrefixTable, FALSE)) {
PfxNode = CONTAINING_RECORD(PfxEntry, PREFIX_NODE, PfxEntry);
DbgPrint("This Node should be gone \"%s\"\n", PfxNode->String.Buffer);
}
DbgPrint("End PrefixTest()\n");
return TRUE;
}
PSZ
AnotherPrefix(IN ULONG MaxNameLength)
{
ULONG AlphabetPosition;
ULONG NameLength;
ULONG IndividualNameLength;
ULONG StartBufferPosition;
ULONG i;
ULONG j;
//
// Check if there is enough room for another name
//
if (NextBufferChar > (BUFFER_LENGTH - (MaxNameLength * 4))) {
return NULL;
}
//
// Where in the alphabet soup we start
//
AlphabetPosition = RtlRandom(&Seed) % AlphabetLength;
//
// How many names we want in our prefix
//
NameLength = (RtlRandom(&Seed) % MaxNameLength) + 1;
//
// Compute each name
//
StartBufferPosition = NextBufferChar;
for (i = 0; i < NameLength; i += 1) {
Buffer[NextBufferChar++] = '\\';
IndividualNameLength = (RtlRandom(&Seed) % 3) + 1;
for (j = 0; j < IndividualNameLength; j += 1) {
Buffer[NextBufferChar++] = Alphabet[AlphabetPosition];
AlphabetPosition = (AlphabetPosition + 1) % AlphabetLength;
}
}
Buffer[NextBufferChar++] = '\0';
return &Buffer[StartBufferPosition];
}
|
