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
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2002,2010 Oracle. All rights reserved.
*
* $Id: INTest.java,v 1.67.2.2 2010/01/04 15:30:48 cwl Exp $
*/
package com.sleepycat.je.tree;
import java.io.File;
import java.util.Random;
import junit.framework.TestCase;
import com.sleepycat.je.DatabaseConfig;
import com.sleepycat.je.DatabaseException;
import com.sleepycat.je.EnvironmentConfig;
import com.sleepycat.je.config.EnvironmentParams;
import com.sleepycat.je.dbi.DatabaseId;
import com.sleepycat.je.dbi.DatabaseImpl;
import com.sleepycat.je.dbi.EnvironmentImpl;
import com.sleepycat.je.tree.Key.DumpType;
import com.sleepycat.je.util.TestUtils;
import com.sleepycat.je.utilint.DbLsn;
public class INTest extends TestCase {
static private final int N_BYTES_IN_KEY = 3;
private int initialINCapacity;
private DatabaseImpl db = null;
static private long FAKE_LSN = DbLsn.makeLsn(0, 0);
private EnvironmentImpl noLogEnv;
private File envHome;
public INTest()
throws DatabaseException {
envHome = new File(System.getProperty(TestUtils.DEST_DIR));
}
public void setUp()
throws DatabaseException {
EnvironmentConfig envConfig = TestUtils.initEnvConfig();
envConfig.setConfigParam(EnvironmentParams.NODE_MAX.getName(), "6");
envConfig.setAllowCreate(true);
noLogEnv = new EnvironmentImpl(envHome,
envConfig,
null /*sharedCacheEnv*/,
false /*replicationIntended*/);
initialINCapacity =
noLogEnv.getConfigManager().getInt(EnvironmentParams.NODE_MAX);
db = new DatabaseImpl("foo", new DatabaseId(11), noLogEnv,
new DatabaseConfig());
}
public void tearDown()
throws DatabaseException {
db.releaseTreeAdminMemory();
noLogEnv.close();
}
public void testFindEntry()
throws DatabaseException {
IN in = new IN(db, new byte[0], initialINCapacity, 7);
in.latch();
byte[] zeroBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
zeroBytes[i] = 0x00;
}
byte[] maxBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
/*
* Use FF since that sets the sign bit negative on a byte. This
* checks the Key.compareTo routine for proper unsigned
* comparisons.
*/
maxBytes[i] = (byte) 0xFF;
}
assertTrue(in.findEntry(zeroBytes, false, false) == -1);
assertTrue(in.findEntry(maxBytes, false, false) == -1);
assertTrue(in.findEntry(zeroBytes, false, true) == -1);
assertTrue(in.findEntry(maxBytes, false, true) == -1);
assertTrue(in.findEntry(zeroBytes, true, false) == -1);
assertTrue(in.findEntry(maxBytes, true, false) == -1);
assertTrue(in.findEntry(zeroBytes, true, true) == -1);
assertTrue(in.findEntry(maxBytes, true, true) == -1);
for (int i = 0; i < initialINCapacity; i++) {
/*
* Insert a key and check that we get the same index in return from
* the binary search. Check the next highest and next lowest keys
* also.
*/
byte[] keyBytes = new byte[N_BYTES_IN_KEY];
byte[] nextKeyBytes = new byte[N_BYTES_IN_KEY];
byte[] prevKeyBytes = new byte[N_BYTES_IN_KEY];
nextKeyBytes[0] = prevKeyBytes[0] = keyBytes[0] = 0x01;
nextKeyBytes[1] = prevKeyBytes[1] = keyBytes[1] = (byte) i;
nextKeyBytes[2] = prevKeyBytes[2] = keyBytes[2] = 0x10;
nextKeyBytes[2]++;
prevKeyBytes[2]--;
in.setEntry(i, null, keyBytes, FAKE_LSN, (byte) 0);
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) == i);
assertTrue(in.findEntry(zeroBytes, false, true) == -1);
assertTrue(in.findEntry(maxBytes, false, true) == -1);
assertTrue(in.findEntry(zeroBytes, true, false) == -1);
assertTrue(in.findEntry(maxBytes, true, false) == i);
assertTrue(in.findEntry(zeroBytes, true, true) == -1);
assertTrue(in.findEntry(maxBytes, true, true) == -1);
for (int j = 1; j < in.getNEntries(); j++) { // 0th key is virtual
assertTrue(in.findEntry(in.getKey(j), false, false)
== j);
assertTrue(in.findEntry(in.getKey(j), false, true)
== j);
assertTrue(in.findEntry(in.getKey(j), true, false) ==
(j | IN.EXACT_MATCH));
assertTrue(in.findEntry(in.getKey(j), true, true) ==
(j | IN.EXACT_MATCH));
assertTrue(in.findEntry(nextKeyBytes, false, false) == i);
assertTrue(in.findEntry(prevKeyBytes, false, false) == i - 1);
assertTrue(in.findEntry(nextKeyBytes, false, true) == -1);
assertTrue(in.findEntry(prevKeyBytes, false, true) == -1);
}
}
in.releaseLatch();
}
public void testInsertEntry()
throws DatabaseException {
for (int i = 0; i < 10; i++) { // cwl: consider upping this
doInsertEntry(false);
doInsertEntry(true);
}
}
private void doInsertEntry(boolean withMinMax)
throws DatabaseException {
IN in = new IN(db, new byte[0], initialINCapacity, 7);
in.latch();
byte[] zeroBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
zeroBytes[i] = 0x00;
}
byte[] maxBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
maxBytes[i] = (byte) 0xFF;
}
if (withMinMax) {
try {
in.insertEntry(new ChildReference(null, zeroBytes, FAKE_LSN));
in.verify(null);
in.insertEntry(new ChildReference(null, maxBytes, FAKE_LSN));
in.verify(null);
} catch (InconsistentNodeException INE) {
fail("caught InconsistentNodeException");
}
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) == 1);
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, false, true) == 0);
assertTrue(in.findEntry(maxBytes, false, true) == 1);
assertTrue(in.findEntry(zeroBytes, true, false) == IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, false) ==
(1 | IN.EXACT_MATCH));
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, true, true) == IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, true) ==
(1 | IN.EXACT_MATCH));
}
Random rnd = new Random();
try {
for (int i = 0;
i < initialINCapacity - (withMinMax ? 2 : 0);
i++) {
/*
* Insert a key and check that we get the same index in return
* from the binary search. Check the next highest and next
* lowest keys also.
*/
byte[] keyBytes = new byte[N_BYTES_IN_KEY];
/*
* There's a small chance that we may generate the same
* sequence of bytes that are already present.
*/
while (true) {
rnd.nextBytes(keyBytes);
int index = in.findEntry(keyBytes, true, false);
if ((index & IN.EXACT_MATCH) != 0 &&
index >= 0) {
continue;
}
break;
}
in.insertEntry(new ChildReference(null, keyBytes, FAKE_LSN));
try {
in.verify(null);
} catch (InconsistentNodeException INE) {
Key.DUMP_TYPE = DumpType.BINARY;
in.dump(0);
}
if (withMinMax) {
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) ==
in.getNEntries() - 1);
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, false, true) == 0);
assertTrue(in.findEntry(maxBytes, false, true) ==
in.getNEntries() - 1);
assertTrue(in.findEntry(zeroBytes, true, false) ==
IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, false) ==
((in.getNEntries() - 1) | IN.EXACT_MATCH));
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, true, true) ==
IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, true) ==
((in.getNEntries() - 1) | IN.EXACT_MATCH));
} else {
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) ==
in.getNEntries() - 1);
assertTrue(in.findEntry(zeroBytes, false, true) == -1);
assertTrue(in.findEntry(maxBytes, false, true) == -1);
assertTrue(in.findEntry(zeroBytes, true, false) == -1);
assertTrue(in.findEntry(maxBytes, true, false) ==
in.getNEntries() - 1);
}
for (int j = 1; j < in.getNEntries(); j++) {
assertTrue(in.findEntry(in.getKey(j), false, false) == j);
assertTrue(in.findEntry(in.getKey(j), false, true) == j);
assertTrue(in.findEntry(in.getKey(j), false, true) == j);
assertTrue(in.findEntry(in.getKey(j), true, false) ==
(j | IN.EXACT_MATCH));
}
}
} catch (InconsistentNodeException INE) {
fail("caught InconsistentNodeException");
}
/* Should be full so insertEntry should return false. */
byte[] keyBytes = new byte[N_BYTES_IN_KEY];
rnd.nextBytes(keyBytes);
try {
in.insertEntry(new ChildReference(null, keyBytes, FAKE_LSN));
fail("should have caught InconsistentNodeException, but didn't");
} catch (InconsistentNodeException INE) {
}
in.releaseLatch();
}
public void testDeleteEntry()
throws DatabaseException {
for (int i = 0; i < 10; i++) { // cwl: consider upping this
doDeleteEntry(true);
doDeleteEntry(false);
}
}
private void doDeleteEntry(boolean withMinMax)
throws DatabaseException {
IN in = new IN(db, new byte[0], initialINCapacity, 7);
in.latch();
byte[] zeroBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
zeroBytes[i] = 0x00;
}
byte[] maxBytes = new byte[N_BYTES_IN_KEY];
for (int i = 0; i < N_BYTES_IN_KEY; i++) {
maxBytes[i] = (byte) 0xFF;
}
if (withMinMax) {
try {
in.insertEntry(new ChildReference(null, zeroBytes, FAKE_LSN));
in.verify(null);
in.insertEntry(new ChildReference(null, maxBytes, FAKE_LSN));
in.verify(null);
} catch (InconsistentNodeException INE) {
fail("caught InconsistentNodeException");
}
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) == 1);
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, false, true) == 0);
assertTrue(in.findEntry(maxBytes, false, true) == 1);
assertTrue(in.findEntry(zeroBytes, true, false) == IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, false) ==
(1 | IN.EXACT_MATCH));
/* Shadowed by the virtual 0'th key. */
assertTrue(in.findEntry(zeroBytes, true, true) == IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, true) ==
(1 | IN.EXACT_MATCH));
}
Random rnd = new Random();
try {
/* Fill up the IN with random entries. */
for (int i = 0;
i < initialINCapacity - (withMinMax ? 2 : 0);
i++) {
/*
* Insert a key and check that we get the same index in return
* from the binary search. Check the next highest and next
* lowest keys also.
*/
byte[] keyBytes = new byte[N_BYTES_IN_KEY];
/*
* There's a small chance that we may generate the same
* sequence of bytes that are already present.
*/
while (true) {
rnd.nextBytes(keyBytes);
int index = in.findEntry(keyBytes, true, false);
if ((index & IN.EXACT_MATCH) != 0 &&
index >= 0) {
continue;
}
break;
}
in.insertEntry(new ChildReference(null, keyBytes, FAKE_LSN));
}
if (withMinMax) {
assertTrue(in.findEntry(zeroBytes, false, false) == 0);
assertTrue(in.findEntry(maxBytes, false, false) ==
in.getNEntries() - 1);
/*
* zeroBytes is in the 0th entry, but that's the virtual key so
* it's not an exact match.
*/
assertTrue(in.findEntry(zeroBytes, false, true) == 0);
assertTrue(in.findEntry(maxBytes, false, true) ==
in.getNEntries() - 1);
assertTrue(in.findEntry(zeroBytes, false, true) == 0);
assertTrue(in.findEntry(maxBytes, false, true) ==
in.getNEntries() - 1);
assertTrue(in.findEntry(zeroBytes, true, false) ==
IN.EXACT_MATCH);
assertTrue(in.findEntry(maxBytes, true, false) ==
((in.getNEntries() - 1) | IN.EXACT_MATCH));
}
while (in.getNEntries() > 1) {
int i = rnd.nextInt(in.getNEntries() - 1) + 1;
assertTrue(in.deleteEntry(in.getKey(i), false));
}
/*
* We should only be able to delete the zero Key if it was inserted
* in the first place.
*/
assertEquals(withMinMax, in.deleteEntry(zeroBytes, false));
} catch (InconsistentNodeException INE) {
fail("caught InconsistentNodeException");
}
in.releaseLatch();
}
}
|
