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
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2002,2010 Oracle. All rights reserved.
*
* $Id: GetParentNodeTest.java,v 1.47.2.2 2010/01/04 15:30:48 cwl Exp $
*/
package com.sleepycat.je.tree;
import java.io.File;
import junit.framework.TestCase;
import com.sleepycat.je.CacheMode;
import com.sleepycat.je.Database;
import com.sleepycat.je.DatabaseConfig;
import com.sleepycat.je.DatabaseException;
import com.sleepycat.je.DbInternal;
import com.sleepycat.je.Environment;
import com.sleepycat.je.EnvironmentConfig;
import com.sleepycat.je.OperationStatus;
import com.sleepycat.je.Transaction;
import com.sleepycat.je.config.EnvironmentParams;
import com.sleepycat.je.dbi.DatabaseImpl;
import com.sleepycat.je.dbi.EnvironmentImpl;
import com.sleepycat.je.latch.LatchSupport;
import com.sleepycat.je.util.StringDbt;
import com.sleepycat.je.util.TestUtils;
public class GetParentNodeTest extends TestCase {
static private final boolean DEBUG = false;
private File envHome;
private Environment env;
private Database db;
private IN rootIN;
private IN firstLevel2IN;
private BIN firstBIN;
private DBIN firstDBIN;
public GetParentNodeTest() {
envHome = new File(System.getProperty(TestUtils.DEST_DIR));
}
public void setUp()
throws Exception {
TestUtils.removeLogFiles("Setup", envHome, false);
initEnv();
}
public void tearDown()
throws Exception {
try {
db.close();
env.close();
} catch (DatabaseException E) {
}
TestUtils.removeLogFiles("TearDown", envHome, true);
}
private void initEnv()
throws DatabaseException {
EnvironmentConfig envConfig = TestUtils.initEnvConfig();
envConfig.setConfigParam(EnvironmentParams.NODE_MAX.getName(), "4");
envConfig.setTransactional(true);
envConfig.setAllowCreate(true);
env = new Environment(envHome, envConfig);
String databaseName = "testDb";
Transaction txn = env.beginTransaction(null, null);
DatabaseConfig dbConfig = new DatabaseConfig();
dbConfig.setTransactional(true);
dbConfig.setAllowCreate(true);
dbConfig.setSortedDuplicates(true);
db = env.openDatabase(txn, databaseName, dbConfig);
txn.commit();
}
/**
* Test getParentINForChildIN and GetParentBINForChildLN painstakingly on a
* hand constructed tree.
*/
public void testBasic()
throws Exception {
try {
/*
* Make a tree w/3 levels in the main tree and a single dup
* tree. The dupTree has two levels. The tree looks like this:
*
* root(key=a)
* |
* +---------------------------+
* IN(key=a) IN(key=e)
* | |
* +------------------+ +--------+--------+
* BIN(key=a) BIN(c) BIN(e) BIN(g) BIN(i)
* | | | | | | | | | | |
* LNa DINb LNc,d LNe,f LNg,h LNi,j,k
* |
* +----------+-------------+
* | | |
* DBIN(data1) DBIN(data3) DBIN(data5)
* LN LN LN LN LN LN LN
*/
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("a"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("c"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("d"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("e"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("f"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("g"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("h"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("i"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("j"),
new StringDbt("data1")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("k"),
new StringDbt("data1")));
/* Add one dup tree. */
byte[] dupKey = "b".getBytes();
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data2")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data3")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data4")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data5")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data6")));
assertEquals(OperationStatus.SUCCESS,
db.put(null, new StringDbt("b"),
new StringDbt("data7")));
/*
* Test exact matches.
*/
checkTreeUsingExistingNodes(dupKey, true);
checkTreeUsingExistingNodes(dupKey, false);
/* Test potential matches. */
checkTreeUsingPotentialNodes();
/* Test deletes. */
checkTreeWithDeletedBins(true);
checkTreeWithDeletedBins(false);
/* Should be no latches held. */
assertEquals(0, LatchSupport.countLatchesHeld());
} catch (Throwable t) {
t.printStackTrace();
throw new Exception(t);
}
}
private void checkTreeUsingExistingNodes(byte[] dupKey,
boolean requireExactMatch)
throws DatabaseException {
/* Start at the root. */
DatabaseImpl database = DbInternal.dbGetDatabaseImpl(db);
Tree tree = database.getTree();
if (DEBUG) {
tree.dump();
}
rootIN = tree.withRootLatchedShared
(new GetRoot(DbInternal.dbGetDatabaseImpl(db)));
rootIN.latch();
SearchResult result =
tree.getParentINForChildIN(rootIN, true, CacheMode.DEFAULT);
assertFalse(result.exactParentFound);
assertEquals(rootIN.getNEntries(), 2);
/* Second and third level. */
BIN dupTreeBin = null;
DIN dupTreeDINRoot = null;
firstBIN = null;
int dupIndex = -1;
for (int i = 0; i < rootIN.getNEntries(); i++) {
/* Each level 2 IN. */
IN in = (IN) rootIN.fetchTarget(i);
if (i == 0) {
firstLevel2IN = in;
}
checkMatch(tree, in, rootIN, i, requireExactMatch);
/* For each BIN, find its parent, and then find its LNs. */
for (int j = 0; j < in.getNEntries(); j++) {
BIN bin = (BIN) in.fetchTarget(j);
if (firstBIN == null) {
firstBIN = bin;
}
checkMatch(tree, bin, in, j, requireExactMatch);
for (int k = 0; k < bin.getNEntries(); k++) {
Node n = bin.fetchTarget(k);
if (n instanceof LN) {
checkMatch(tree, (LN) n, bin, bin.getKey(k),
null, k, bin.getLsn(k));
}
}
int findIndex = bin.findEntry(dupKey, false, true);
if (findIndex > 0) {
dupIndex = findIndex;
dupTreeDINRoot =
(DIN) bin.fetchTarget(dupIndex);
dupTreeBin = bin;
}
}
}
/* Check dup tree, assumes a 2 level tree. */
assertTrue(dupTreeBin != null);
assertTrue(dupTreeDINRoot != null);
checkMatch(tree, dupTreeDINRoot, dupTreeBin, dupIndex,
requireExactMatch);
assertTrue(dupTreeDINRoot.getNEntries() > 0);
for (int i = 0; i < dupTreeDINRoot.getNEntries(); i++) {
IN in = (IN) dupTreeDINRoot.fetchTarget(i);
checkMatch(tree, in, dupTreeDINRoot, i, requireExactMatch);
if (firstDBIN == null) {
firstDBIN = (DBIN)in;
}
for (int k = 0; k < in.getNEntries(); k++) {
Node n = in.fetchTarget(k);
LN ln = (LN) n;
checkMatch(tree, ln, (BIN)in, dupKey,
ln.getData(),
k, in.getLsn(k));
}
}
}
/*
* Do a parent search, expect to find the parent, check that we do.
*/
private void checkMatch(Tree tree,
IN target,
IN parent,
int index,
boolean requireExactMatch)
throws DatabaseException {
target.latch();
SearchResult result = tree.getParentINForChildIN
(target, requireExactMatch, CacheMode.DEFAULT);
assertTrue(result.exactParentFound);
assertEquals("Target=" + target + " parent=" + parent,
index, result.index);
assertEquals(parent, result.parent);
parent.releaseLatch();
}
/*
* Search for the BIN for this LN.
*/
private void checkMatch(Tree tree,
LN target,
BIN parent,
byte[] mainKey,
byte[] dupKey,
int index,
long expectedLsn)
throws DatabaseException {
TreeLocation location = new TreeLocation();
assertTrue
(tree.getParentBINForChildLN(location, mainKey, dupKey, target,
false, true, false,
CacheMode.DEFAULT));
location.bin.releaseLatch();
assertEquals(parent, location.bin);
assertEquals(index, location.index);
assertEquals(expectedLsn, location.childLsn);
assertTrue
(tree.getParentBINForChildLN(location, mainKey, dupKey, target,
true, false, true,
CacheMode.DEFAULT));
location.bin.releaseLatch();
assertEquals(parent, location.bin);
assertEquals(index, location.index);
assertEquals(expectedLsn, location.childLsn);
assertTrue
(tree.getParentBINForChildLN(location, mainKey, dupKey, target,
true, true, false,
CacheMode.DEFAULT));
location.bin.releaseLatch();
assertEquals(parent, location.bin);
assertEquals(index, location.index);
assertEquals(expectedLsn, location.childLsn);
}
private class GetRoot implements WithRootLatched {
private DatabaseImpl db;
GetRoot(DatabaseImpl db) {
this.db = db;
}
public IN doWork(ChildReference root)
throws DatabaseException {
return (IN) root.fetchTarget(db, null);
}
}
/**
* Make up non-existent nodes and see where they'd fit in. This exercises
* recovery type processing and cleaning.
*/
private void checkTreeUsingPotentialNodes()
throws DatabaseException {
DatabaseImpl database = DbInternal.dbGetDatabaseImpl(db);
Tree tree = database.getTree();
/*
* Make an IN with the key "ab". Its potential parent should be the
* first level 2 IN.
*/
IN inAB = new IN(database, "ab".getBytes(), 4, 2);
checkPotential(tree, inAB, firstLevel2IN);
/*
* Make an BIN with the key "x". Its potential parent should be the
* first level 2 IN.
*/
BIN binAB =
new BIN(database, "ab".getBytes(), 4, 1);
checkPotential(tree, binAB, firstLevel2IN);
/*
* Make a DIN with the key "a". Its potential parent should be BIN(c).
*/
DIN dinA = new DIN(database,
"data1".getBytes(),
4,
"a".getBytes(),
null, 3);
checkPotential(tree, dinA, firstBIN);
/*
* Make an LN with the key "ab". It's potential parent should be the
* BINa.
*/
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
LN LNab = new LN("foo".getBytes(), envImpl, false /* replicated */);
byte[] mainKey = "ab".getBytes();
checkPotential(tree, LNab, firstBIN, mainKey,
LNab.getData(), mainKey);
/**
* Make a dup LN with the key b. Its potential parent should be DBINb.
*/
LN LNdata = new LN("data".getBytes(), envImpl, false /* replicated */);
mainKey = "b".getBytes();
byte[] dupKey = LNdata.getData();
checkPotential(tree, LNdata, firstDBIN, mainKey, dupKey, dupKey);
}
private void checkPotential(Tree tree, IN potential, IN expectedParent)
throws DatabaseException {
/* Try an exact match, expect a failure, then try an inexact match. */
potential.latch();
SearchResult result = tree.getParentINForChildIN
(potential, true, CacheMode.DEFAULT);
assertFalse(result.exactParentFound);
assertTrue(result.parent == null);
potential.latch();
result =
tree.getParentINForChildIN(potential, false, CacheMode.DEFAULT);
assertFalse(result.exactParentFound);
assertEquals("expected = " + expectedParent.getNodeId() +
" got" + result.parent.getNodeId(),
expectedParent, result.parent);
result.parent.releaseLatch();
}
private void checkPotential(Tree tree, LN potential, BIN expectedParent,
byte[] mainKey, byte[] dupKey, byte[] expectedKey)
throws DatabaseException {
/* Try an exact match, expect a failure, then try an inexact match. */
TreeLocation location = new TreeLocation();
assertFalse(tree.getParentBINForChildLN
(location, mainKey, dupKey, potential, false,
false, true, CacheMode.DEFAULT));
location.bin.releaseLatch();
assertEquals(location.bin, expectedParent);
assertEquals(expectedKey, location.lnKey);
}
private void checkTreeWithDeletedBins(boolean requireExactMatch)
throws DatabaseException {
/**
* Mark all refs from the IN's to the BIN's as "known deleted". Start
* at the root.
*/
DatabaseImpl database = DbInternal.dbGetDatabaseImpl(db);
Tree tree = database.getTree();
rootIN = tree.withRootLatchedShared
(new GetRoot(DbInternal.dbGetDatabaseImpl(db)));
/* Second and third level. */
for (int i = 0; i < rootIN.getNEntries(); i++) {
/* Each level 2 IN. */
IN in = (IN) rootIN.fetchTarget(i);
for (int j = 0; j < in.getNEntries(); j++) {
BIN bin = (BIN) in.getTarget(j);
in.setKnownDeleted(j);
checkDeletedMatch(tree, bin, in, j, requireExactMatch);
}
}
}
/*
* Do a parent search, expect to find the parent, check that we do.
*/
private void checkDeletedMatch(Tree tree,
IN target,
IN parent,
int index,
boolean requireExactMatch)
throws DatabaseException {
target.latch();
SearchResult result = tree.getParentINForChildIN
(target, requireExactMatch, CacheMode.DEFAULT);
assertFalse(result.exactParentFound);
assertEquals("Target=" + target + " parent=" + parent,
index, result.index);
if (requireExactMatch) {
assertEquals(null, result.parent);
} else {
assertEquals(parent, result.parent);
parent.releaseLatch();
}
}
}
|
