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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2002,2010 Oracle. All rights reserved.
*
* $Id: TreeTest.java,v 1.94.2.2 2010/01/04 15:30:48 cwl Exp $
*/
package com.sleepycat.je.tree;
import java.io.IOException;
import com.sleepycat.je.BtreeStats;
import com.sleepycat.je.CacheMode;
import com.sleepycat.je.DatabaseException;
import com.sleepycat.je.DatabaseStats;
import com.sleepycat.je.DbInternal;
import com.sleepycat.je.VerifyConfig;
import com.sleepycat.je.dbi.EnvironmentImpl;
import com.sleepycat.je.dbi.NullCursor;
import com.sleepycat.je.txn.BasicLocker;
import com.sleepycat.je.txn.Locker;
import com.sleepycat.je.util.TestUtils;
public class TreeTest extends TreeTestBase {
public TreeTest() {
super();
}
/**
* Rudimentary insert/retrieve test.
*/
public void testSimpleTreeCreation()
throws DatabaseException {
initEnv(false);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.
createBasicLocker(DbInternal.envGetEnvironmentImpl(env));
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
insertAndRetrieve(cursor, "aaaaa".getBytes(),
new LN((byte[]) null,
envImpl,
false)); // replicated
insertAndRetrieve(cursor, "aaaab".getBytes(),
new LN((byte[]) null,
envImpl,
false)); // replicated
insertAndRetrieve(cursor, "aaaa".getBytes(),
new LN((byte[]) null,
envImpl,
false)); // replicated
insertAndRetrieve(cursor, "aaa".getBytes(),
new LN((byte[]) null,
envImpl,
false)); // replicated
txn.operationEnd();
}
/**
* Slightly less rudimentary test inserting a handfull of keys and LN's.
*/
public void testMultipleInsertRetrieve0()
throws DatabaseException {
/*
* Set the seed to reproduce a specific problem found while debugging:
* IN.split was splitting with the identifier key being on the right
* side.
*/
initEnv(false);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = 0; i < 21; i++) {
byte[] key = new byte[N_KEY_BYTES];
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, new LN((byte[]) null,
envImpl,
false)); // replicated
}
txn.operationEnd();
}
/**
* Insert a bunch of keys and test that they retrieve back ok. While we
* insert, maintain the highest and lowest keys inserted. Verify that
* getFirstNode and getLastNode return those two entries. Lather, rinse,
* repeat.
*/
public void testMultipleInsertRetrieve1()
throws DatabaseException, IOException {
initEnv(false);
doMultipleInsertRetrieve1();
}
/**
* Helper routine for above.
*/
private void doMultipleInsertRetrieve1()
throws DatabaseException {
byte[][] keys = new byte[N_KEYS][];
LN[] lns = new LN[N_KEYS];
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = 0; i < N_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
keys[i] = key;
lns[i] = new LN((byte[]) null, envImpl, false /* replicated */);
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, lns[i]);
}
for (int i = 0; i < N_KEYS; i++) {
assertTrue(retrieveLN(keys[i]) == lns[i]);
}
TestUtils.checkLatchCount();
IN leftMostNode = tree.getFirstNode(CacheMode.DEFAULT);
assertTrue(leftMostNode instanceof BIN);
BIN lmn = (BIN) leftMostNode;
lmn.releaseLatch();
TestUtils.checkLatchCount();
assertTrue(Key.compareKeys(lmn.getKey(0), minKey, null) == 0);
TestUtils.checkLatchCount();
IN rightMostNode = tree.getLastNode(CacheMode.DEFAULT);
assertTrue(rightMostNode instanceof BIN);
BIN rmn = (BIN) rightMostNode;
rmn.releaseLatch();
TestUtils.checkLatchCount();
assertTrue(Key.compareKeys
(rmn.getKey(rmn.getNEntries() - 1), maxKey, null) == 0);
TreeStats ts = tree.getTreeStats();
assertTrue(ts.nRootSplits > 1);
txn.operationEnd();
}
/**
* Create a tree. After creation, walk the bins forwards using getNextBin
* counting the keys and validating that the keys are being returned in
* ascending order. Ensure that the correct number of keys were returned.
*/
public void testCountAndValidateKeys()
throws DatabaseException, IOException {
initEnv(false);
doCountAndValidateKeys();
}
/**
* Helper routine for above test.
*/
private void doCountAndValidateKeys()
throws DatabaseException {
byte[][] keys = new byte[N_KEYS][];
LN[] lns = new LN[N_KEYS];
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = 0; i < N_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
keys[i] = key;
lns[i] = new LN((byte[]) null, envImpl, false /* replicated */);
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, lns[i]);
}
assertTrue(countAndValidateKeys(tree) == N_KEYS);
txn.operationEnd();
}
/**
* Create a tree. After creation, walk the bins backwards using getPrevBin
* counting the keys and validating that the keys are being returned in
* descending order. Ensure that the correct number of keys were returned.
*/
public void testCountAndValidateKeysBackwards()
throws DatabaseException, IOException {
initEnv(false);
doCountAndValidateKeysBackwards();
}
/**
* Helper routine for above test.
*/
public void doCountAndValidateKeysBackwards()
throws DatabaseException {
byte[][] keys = new byte[N_KEYS][];
LN[] lns = new LN[N_KEYS];
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = 0; i < N_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
keys[i] = key;
lns[i] = new LN((byte[]) null, envImpl, false /* replicated */);
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, lns[i]);
}
assertTrue(countAndValidateKeysBackwards(tree) == N_KEYS);
txn.operationEnd();
}
public void testAscendingInsertBalance()
throws DatabaseException {
initEnv(false);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
/* Fill up a db with data */
for (int i = 0; i < N_KEYS; i++) {
byte[] keyBytes = new byte[4];
TestUtils.putUnsignedInt(keyBytes, TestUtils.alphaKey(i));
insertAndRetrieve(cursor, keyBytes,
new LN((byte[]) null,
envImpl,
false)); // replicated
}
TestUtils.checkLatchCount();
/* Count the number of levels on the left. */
IN leftMostNode = tree.getFirstNode(CacheMode.DEFAULT);
assertTrue(leftMostNode instanceof BIN);
int leftSideLevels = 0;
do {
SearchResult result =
tree.getParentINForChildIN(leftMostNode, true,
CacheMode.DEFAULT);
leftMostNode = result.parent;
leftSideLevels++;
} while (leftMostNode != null);
TestUtils.checkLatchCount();
/* Count the number of levels on the right. */
IN rightMostNode = tree.getLastNode(CacheMode.DEFAULT);
assertTrue(rightMostNode instanceof BIN);
int rightSideLevels = 0;
do {
SearchResult result =
tree.getParentINForChildIN(rightMostNode, true,
CacheMode.DEFAULT);
rightMostNode = result.parent;
rightSideLevels++;
} while (rightMostNode != null);
TestUtils.checkLatchCount();
if (leftSideLevels > 10 ||
rightSideLevels > 10) {
fail("Levels too high (" +
leftSideLevels +
"/" +
rightSideLevels +
") on descending insert");
}
txn.operationEnd();
}
public void testDescendingInsertBalance()
throws DatabaseException {
initEnv(false);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = N_KEYS; i >= 0; --i) {
byte[] keyBytes = new byte[4];
TestUtils.putUnsignedInt(keyBytes, TestUtils.alphaKey(i));
insertAndRetrieve(cursor, keyBytes,
new LN((byte[]) null,
envImpl,
false)); // replicated
}
TestUtils.checkLatchCount();
IN leftMostNode = tree.getFirstNode(CacheMode.DEFAULT);
assertTrue(leftMostNode instanceof BIN);
int leftSideLevels = 0;
do {
SearchResult result =
tree.getParentINForChildIN(leftMostNode, true,
CacheMode.DEFAULT);
leftMostNode = result.parent;
leftSideLevels++;
} while (leftMostNode != null);
TestUtils.checkLatchCount();
IN rightMostNode = tree.getLastNode(CacheMode.DEFAULT);
assertTrue(rightMostNode instanceof BIN);
int rightSideLevels = 0;
do {
SearchResult result =
tree.getParentINForChildIN(rightMostNode, true,
CacheMode.DEFAULT);
rightMostNode = result.parent;
rightSideLevels++;
} while (rightMostNode != null);
TestUtils.checkLatchCount();
if (leftSideLevels > 10 ||
rightSideLevels > 10) {
fail("Levels too high (" +
leftSideLevels +
"/" +
rightSideLevels +
") on descending insert");
}
txn.operationEnd();
}
/**
* Insert a bunch of keys. Call verify and validate the results.
*/
public void testVerify()
throws DatabaseException {
initEnv(false);
byte[][] keys = new byte[N_KEYS][];
LN[] lns = new LN[N_KEYS];
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.createBasicLocker(envImpl);
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
for (int i = 0; i < N_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
keys[i] = key;
lns[i] = new LN((byte[]) new byte[1],
envImpl,
false); // replicated
TestUtils.generateRandomAlphaBytes(key);
insertAndRetrieve(cursor, key, lns[i]);
}
/*
* Note that verify will attempt to continue past errors, so
* assertTrue on the status return.
*/
assertTrue(env.verify(new VerifyConfig(), System.err));
DatabaseStats stats = db.verify(new VerifyConfig());
BtreeStats btStats = (BtreeStats) stats;
assertTrue(btStats.getInternalNodeCount() <
btStats.getBottomInternalNodeCount());
assertTrue(btStats.getBottomInternalNodeCount() <
btStats.getLeafNodeCount() +
btStats.getDeletedLeafNodeCount());
assertTrue(btStats.getLeafNodeCount() +
btStats.getDeletedLeafNodeCount() ==
N_KEYS);
txn.operationEnd();
/* Now intentionally create LogFileNotFoundExceptions */
/*
db.close();
env.close();
This is disabled until the method for flipping files is
introduced. It's too hard to create a LogFileNotFoundException
by brute force deleting a file; often recovery doesn't work.
Instead, use a flipped file later on.
String[] jeFiles =
FileManager.listFiles(envHome,
new String[] {FileManager.JE_SUFFIX});
int targetIdx = jeFiles.length / 2;
assertTrue(targetIdx > 0);
File targetFile = new File(envHome, jeFiles[targetIdx]);
assertTrue(targetFile.delete());
initEnv(false);
assertFalse(env.verify(new VerifyConfig(), System.err));
*/
}
}
|
