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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2002,2010 Oracle. All rights reserved.
*
* $Id: TreeDuplicateTest.java,v 1.50.2.2 2010/01/04 15:30:48 cwl Exp $
*/
package com.sleepycat.je.tree;
import com.sleepycat.je.CacheMode;
import com.sleepycat.je.DatabaseException;
import com.sleepycat.je.DbInternal;
import com.sleepycat.je.dbi.EnvironmentImpl;
import com.sleepycat.je.dbi.NullCursor;
import com.sleepycat.je.log.ReplicationContext;
import com.sleepycat.je.txn.BasicLocker;
import com.sleepycat.je.txn.LockResult;
import com.sleepycat.je.txn.Locker;
import com.sleepycat.je.util.TestUtils;
public class TreeDuplicateTest extends TreeTestBase {
public TreeDuplicateTest() {
super();
}
private static final int N_DUPLICATES_PER_KEY = N_KEYS;
private static final int N_TOP_LEVEL_KEYS = 10;
/**
* Rudimentary insert/retrieve test.
*/
public void testSimpleTreeCreation()
throws Throwable {
try {
initEnv(true);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.
createBasicLocker(DbInternal.envGetEnvironmentImpl(env));
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
try {
byte[][] keys = new byte[N_TOP_LEVEL_KEYS][];
LN[][] lns = new LN[N_TOP_LEVEL_KEYS][];
for (int i = 0; i < N_TOP_LEVEL_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
keys[i] = key;
lns[i] = new LN[N_DUPLICATES_PER_KEY];
TestUtils.generateRandomAlphaBytes(key);
for (int j = 0; j < N_DUPLICATES_PER_KEY; j++) {
byte[] data = new byte[N_KEY_BYTES];
TestUtils.generateRandomAlphaBytes(data);
LN ln = new LN(data, envImpl, false);
lns[i][j] = ln;
insertAndRetrieveDuplicate(key, ln, cursor);
}
}
for (int i = 0; i < N_TOP_LEVEL_KEYS; i++) {
byte[] key = keys[i];
for (int j = 0; j < N_DUPLICATES_PER_KEY; j++) {
LN ln = lns[i][j];
retrieveDuplicateLN(key, ln);
}
}
} finally {
txn.operationEnd();
}
} catch (Throwable t) {
t.printStackTrace();
throw t;
}
}
/**
* Make sure that IllegalArgumentException is returned from search(null).
*/
public void testNullRoot()
throws DatabaseException {
initEnv(false);
assertTrue(tree.search(null, Tree.SearchType.NORMAL,
-1, null, CacheMode.DEFAULT) ==
null);
TestUtils.checkLatchCount();
}
/**
* Insert a bunch of keys. Validate that getFirstNode and getLastNode
* return the right values.
*/
public void testGetFirstLast()
throws DatabaseException {
initEnv(true);
EnvironmentImpl envImpl = DbInternal.envGetEnvironmentImpl(env);
Locker txn = BasicLocker.
createBasicLocker(DbInternal.envGetEnvironmentImpl(env));
NullCursor cursor = new NullCursor(tree.getDatabase(), txn);
/* Make sure IllegalArgumentException is thrown for null args. */
try {
TestUtils.checkLatchCount();
tree.getFirstNode(null, null);
fail("Tree.getFirstNode didn't throw IllegalArgumentException");
} catch (IllegalArgumentException IAE) {
}
TestUtils.checkLatchCount();
try {
TestUtils.checkLatchCount();
tree.getLastNode(null, null);
fail("Tree.getLastNode didn't throw IllegalArgumentException");
} catch (IllegalArgumentException IAE) {
}
TestUtils.checkLatchCount();
byte[][] keys = new byte[N_TOP_LEVEL_KEYS][];
LN[][] lns = new LN[N_TOP_LEVEL_KEYS][];
byte[][] minKeys = new byte[N_TOP_LEVEL_KEYS][];
byte[][] maxKeys = new byte[N_TOP_LEVEL_KEYS][];
for (int i = 0; i < N_TOP_LEVEL_KEYS; i++) {
byte[] key = new byte[N_KEY_BYTES];
byte[] minKey = null;
byte[] maxKey = null;
keys[i] = key;
lns[i] = new LN[N_DUPLICATES_PER_KEY];
TestUtils.generateRandomAlphaBytes(key);
for (int j = 0; j < N_DUPLICATES_PER_KEY; j++) {
byte[] data = new byte[N_KEY_BYTES];
TestUtils.generateRandomAlphaBytes(data);
byte[] dupKey = data;
if (minKey == null) {
minKey = dupKey;
} else if (Key.compareKeys(dupKey, minKey, null) < 0) {
minKey = dupKey;
}
if (maxKey == null) {
maxKey = dupKey;
} else if (Key.compareKeys(maxKey, dupKey, null) < 0) {
maxKey = dupKey;
}
LN ln = new LN(data, envImpl, false);
lns[i][j] = ln;
insertAndRetrieveDuplicate(key, ln, cursor);
}
minKeys[i] = minKey;
maxKeys[i] = maxKey;
}
for (int i = 0; i < N_TOP_LEVEL_KEYS; i++) {
byte[] key = keys[i];
for (int j = 0; j < N_DUPLICATES_PER_KEY; j++) {
validateFirstLast(key, minKeys[i], maxKeys[i]);
}
}
txn.operationEnd();
}
/**
* Find the first and last dup for key and make sure they match the minKey
* and maxKey args.
*/
private void validateFirstLast(byte[] key, byte[] minKey, byte[] maxKey)
throws DatabaseException {
TestUtils.checkLatchCount();
/* find the top of the dup tree. */
IN dr = tree.search(key, Tree.SearchType.NORMAL, -1,
null, CacheMode.DEFAULT);
if (!(dr instanceof BIN)) {
fail("search didn't return a BIN for key: " + key);
}
BIN topBin = (BIN) dr;
int index = topBin.findEntry(key, false, true);
if (index == -1) {
fail("Didn't read back key: " + key);
}
Node dupEntry = topBin.getTarget(index);
if (!(dupEntry instanceof DIN)) {
fail("Didn't find a DIN");
}
topBin.releaseLatch();
DIN duplicateRoot = (DIN) dupEntry;
duplicateRoot.latch();
DBIN leftMostNode =
tree.getFirstNode(duplicateRoot, CacheMode.DEFAULT);
assertTrue(leftMostNode instanceof DBIN);
leftMostNode.releaseLatch();
assertTrue(Key.compareKeys(leftMostNode.getKey(0), minKey, null) == 0);
duplicateRoot.latch();
DBIN rightMostNode =
tree.getLastNode(duplicateRoot, CacheMode.DEFAULT);
assertTrue(rightMostNode instanceof DBIN);
rightMostNode.releaseLatch();
assertTrue(Key.compareKeys
(rightMostNode.getKey(rightMostNode.getNEntries() - 1), maxKey,
null) == 0);
TestUtils.checkLatchCount();
}
private void insertAndRetrieveDuplicate(byte[] key,
LN ln,
NullCursor cursor)
throws DatabaseException {
TestUtils.checkLatchCount();
assertTrue(tree.insert(ln, key, true, cursor,
new LockResult(null, null),
ReplicationContext.NO_REPLICATE));
TestUtils.checkLatchCount();
assertTrue(retrieveDuplicateLN(key, ln) == ln);
}
/**
* Helper routine to read the duplicate LN referred to by key.
*/
private LN retrieveDuplicateLN(byte[] key, LN ln)
throws DatabaseException {
TreeLocation location = new TreeLocation();
try {
assertTrue(tree.getParentBINForChildLN
(location, key, ln.getData(), ln,
false, false, false, CacheMode.DEFAULT));
return (LN) location.bin.getTarget(location.index);
} finally {
location.bin.releaseLatch();
TestUtils.checkLatchCount();
}
}
}
|
