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
|
/*-
* See the file LICENSE for redistribution information.
*
* Copyright (c) 2002,2010 Oracle. All rights reserved.
*
* $Id: INListTest.java,v 1.44.2.2 2010/01/04 15:30:43 cwl Exp $
*/
package com.sleepycat.je.dbi;
import java.io.File;
import java.io.IOException;
import java.util.Iterator;
import junit.framework.TestCase;
import com.sleepycat.je.Database;
import com.sleepycat.je.DatabaseConfig;
import com.sleepycat.je.DatabaseEntry;
import com.sleepycat.je.DatabaseException;
import com.sleepycat.je.DbInternal;
import com.sleepycat.je.Environment;
import com.sleepycat.je.EnvironmentConfig;
import com.sleepycat.je.config.EnvironmentParams;
import com.sleepycat.je.junit.JUnitThread;
import com.sleepycat.je.log.FileManager;
import com.sleepycat.je.tree.IN;
import com.sleepycat.je.util.TestUtils;
public class INListTest extends TestCase {
private static String DB_NAME = "INListTestDb";
private File envHome;
private volatile int sequencer = 0;
private Environment env;
private EnvironmentImpl envImpl;
private Database db;
private DatabaseImpl dbImpl;
public INListTest() {
envHome = new File(System.getProperty(TestUtils.DEST_DIR));
}
public void setUp()
throws DatabaseException, IOException {
TestUtils.removeFiles("Setup", envHome, FileManager.JE_SUFFIX);
sequencer = 0;
EnvironmentConfig envConfig = TestUtils.initEnvConfig();
envConfig.setAllowCreate(true);
envConfig.setConfigParam(EnvironmentParams.ENV_RUN_EVICTOR.getName(),
"false");
env = new Environment(envHome, envConfig);
envImpl = DbInternal.envGetEnvironmentImpl(env);
DatabaseConfig dbConfig = new DatabaseConfig();
dbConfig.setAllowCreate(true);
db = env.openDatabase(null, DB_NAME, dbConfig);
dbImpl = DbInternal.dbGetDatabaseImpl(db);
}
private void close()
throws DatabaseException {
if (db != null) {
db.close();
}
if (env != null) {
env.close();
}
db = null;
dbImpl = null;
env = null;
envImpl = null;
}
public void tearDown()
throws DatabaseException, IOException {
try {
close();
} catch (Exception e) {
System.out.println("During tearDown: " + e);
}
TestUtils.removeFiles("TearDown", envHome, FileManager.JE_SUFFIX);
envHome = null;
}
/**
* This test was originally written when the INList had a major and minor
* latch. It was used to test the addition of INs holding the minor latch
* while another thread holds the major latch. Now that we're using
* ConcurrentHashMap this type of testing is not important, but I've left
* the test in place (without the latching) since it does exercise the
* INList API a little.
*/
public void testConcurrentAdditions()
throws Throwable {
final INList inList1 = new INList(envImpl);
inList1.enable();
JUnitThread tester1 =
new JUnitThread("testConcurrentAdditions-Thread1") {
public void testBody() {
try {
/* Create two initial elements. */
for (int i = 0; i < 2; i++) {
IN in = new IN(dbImpl, null, 1, 1);
inList1.add(in);
}
/* Wait for tester2 to try to acquire the
/* minor latch */
sequencer = 1;
while (sequencer <= 1) {
Thread.yield();
}
/*
* Sequencer is now 2. There should be three elements
* in the list right now because thread 2 added a third
* one.
*/
int count = 0;
Iterator iter = inList1.iterator();
while (iter.hasNext()) {
iter.next();
count++;
}
assertEquals(3, count);
/*
* Allow thread2 to run again. It will
* add another element and throw control
* back to thread 1.
*/
sequencer++; // now it's 3
while (sequencer <= 3) {
Thread.yield();
}
/*
* Check that the entry added by tester2 was really
* added.
*/
count = 0;
iter = inList1.iterator();
while (iter.hasNext()) {
iter.next();
count++;
}
assertEquals(4, count);
} catch (Throwable T) {
T.printStackTrace(System.out);
fail("Thread 1 caught some Throwable: " + T);
}
}
};
JUnitThread tester2 =
new JUnitThread("testConcurrentAdditions-Thread2") {
public void testBody() {
try {
/* Wait for tester1 to start */
while (sequencer < 1) {
Thread.yield();
}
assertEquals(1, sequencer);
inList1.add(new IN(dbImpl, null, 1, 1));
sequencer++;
/* Sequencer is now 2. */
while (sequencer < 3) {
Thread.yield();
}
assertEquals(3, sequencer);
/* Add one more element. */
inList1.add(new IN(dbImpl, null, 1, 1));
sequencer++;
} catch (Throwable T) {
T.printStackTrace(System.out);
fail("Thread 2 caught some Throwable: " + T);
}
}
};
tester1.start();
tester2.start();
tester1.finishTest();
tester2.finishTest();
}
/*
* Variations of this loop are used in the following tests to simulate the
* INList memory budget recalculation that is performed by the same loop
* construct in DirtyINMap.selectDirtyINsForCheckpoint.
*
* inList.memRecalcBegin();
* boolean completed = false;
* try {
* for (IN in : inList) {
* inList.memRecalcIterate(in);
* }
* completed = true;
* } finally {
* inList.memRecalcEnd(completed);
* }
*/
/**
* Scenario #1: IN size is unchanged during the iteration
* begin
* iterate -- add total IN size, mark processed
* end
*/
public void testMemBudgetReset1()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
for (IN in : inList) {
inList.memRecalcIterate(in);
}
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem, mb.getTreeMemoryUsage());
close();
}
/**
* Scenario #2: IN size is updated during the iteration
* begin
* update -- do not add delta because IN is not yet processed
* iterate -- add total IN size, mark processed
* update -- do add delta because IN was already processed
* end
*/
public void testMemBudgetReset2()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
/*
* Size changes must be greater than IN.ACCUMULATED_LIMIT to be
* counted in the budget, and byte array lengths should be a multiple
* of 4 to give predictable sizes, since array sizes are allowed in
* multiples of 4.
*/
final int SIZE = IN.ACCUMULATED_LIMIT + 100;
DatabaseEntry key = new DatabaseEntry(new byte[1]);
db.put(null, key, new DatabaseEntry(new byte[SIZE * 1]));
/* Test increasing size. */
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
db.put(null, key, new DatabaseEntry(new byte[SIZE * 2]));
for (IN in : inList) {
inList.memRecalcIterate(in);
}
db.put(null, key, new DatabaseEntry(new byte[SIZE * 3]));
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem + SIZE * 2, mb.getTreeMemoryUsage());
/* Test decreasing size. */
inList.memRecalcBegin();
completed = false;
try {
db.put(null, key, new DatabaseEntry(new byte[SIZE * 2]));
for (IN in : inList) {
inList.memRecalcIterate(in);
}
db.put(null, key, new DatabaseEntry(new byte[SIZE * 1]));
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem, mb.getTreeMemoryUsage());
close();
}
/**
* Scenario #3: IN is added during the iteration but not iterated
* begin
* add -- add IN size, mark processed
* end
*/
public void testMemBudgetReset3()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
IN newIn = new IN(dbImpl, null, 1, 1);
long size = newIn.getBudgetedMemorySize();
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
for (IN in : inList) {
inList.memRecalcIterate(in);
}
inList.add(newIn);
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem + size, mb.getTreeMemoryUsage());
close();
}
/**
* Scenario #4: IN is added during the iteration and is iterated
* begin
* add -- add IN size, mark processed
* iterate -- do not add size because IN was already processed
* end
*/
public void testMemBudgetReset4()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
IN newIn = new IN(dbImpl, null, 1, 1);
long size = newIn.getBudgetedMemorySize();
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
inList.add(newIn);
for (IN in : inList) {
inList.memRecalcIterate(in);
}
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem + size, mb.getTreeMemoryUsage());
close();
}
/**
* Scenario #5: IN is removed during the iteration but not iterated
* begin
* remove -- do not add delta because IN is not yet processed
* end
*/
public void testMemBudgetReset5()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
IN oldIn = inList.iterator().next();
long size = oldIn.getBudgetedMemorySize();
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
inList.remove(oldIn);
for (IN in : inList) {
inList.memRecalcIterate(in);
}
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem - size, mb.getTreeMemoryUsage());
close();
}
/**
* Scenario #6: IN is removed during the iteration and is iterated
* begin
* iterate -- add total IN size, mark processed
* remove -- add delta because IN was already processed
* end
*/
public void testMemBudgetReset6()
throws DatabaseException {
INList inList = envImpl.getInMemoryINs();
MemoryBudget mb = envImpl.getMemoryBudget();
IN oldIn = inList.iterator().next();
long size = oldIn.getBudgetedMemorySize();
long origTreeMem = mb.getTreeMemoryUsage();
inList.memRecalcBegin();
boolean completed = false;
try {
for (IN in : inList) {
inList.memRecalcIterate(in);
}
inList.remove(oldIn);
completed = true;
} finally {
inList.memRecalcEnd(completed);
}
assertEquals(origTreeMem - size, mb.getTreeMemoryUsage());
close();
}
}
|