You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@hbase.apache.org by ap...@apache.org on 2009/06/27 03:16:16 UTC
svn commit: r788913 [2/2] - in /hadoop/hbase/trunk_on_hadoop-0.18.3: ./
conf/ src/docs/src/documentation/ src/java/org/apache/hadoop/hbase/io/hfile/
src/java/org/apache/hadoop/hbase/regionserver/
src/test/org/apache/hadoop/hbase/io/ src/test/org/apache...
Added: hadoop/hbase/trunk_on_hadoop-0.18.3/src/test/org/apache/hadoop/hbase/io/hfile/TestLruBlockCache.java
URL: http://svn.apache.org/viewvc/hadoop/hbase/trunk_on_hadoop-0.18.3/src/test/org/apache/hadoop/hbase/io/hfile/TestLruBlockCache.java?rev=788913&view=auto
==============================================================================
--- hadoop/hbase/trunk_on_hadoop-0.18.3/src/test/org/apache/hadoop/hbase/io/hfile/TestLruBlockCache.java (added)
+++ hadoop/hbase/trunk_on_hadoop-0.18.3/src/test/org/apache/hadoop/hbase/io/hfile/TestLruBlockCache.java Sat Jun 27 01:16:15 2009
@@ -0,0 +1,507 @@
+/**
+ * Copyright 2009 The Apache Software Foundation
+ *
+ * Licensed to the Apache Software Foundation (ASF) under one
+ * or more contributor license agreements. See the NOTICE file
+ * distributed with this work for additional information
+ * regarding copyright ownership. The ASF licenses this file
+ * to you under the Apache License, Version 2.0 (the
+ * "License"); you may not use this file except in compliance
+ * with the License. You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+package org.apache.hadoop.hbase.io.hfile;
+
+import java.nio.ByteBuffer;
+import java.util.Random;
+
+import org.apache.hadoop.hbase.io.HeapSize;
+import org.apache.hadoop.hbase.util.ClassSize;
+
+import junit.framework.TestCase;
+
+/**
+ * Tests the concurrent LruBlockCache.<p>
+ *
+ * Tests will ensure it grows and shrinks in size properly,
+ * evictions run when they're supposed to and do what they should,
+ * and that cached blocks are accessible when expected to be.
+ */
+public class TestLruBlockCache extends TestCase {
+
+ public void testBackgroundEvictionThread() throws Exception {
+
+ long maxSize = 100000;
+
+ LruBlockCache cache = new LruBlockCache(maxSize,100);
+
+ Block [] blocks = generateFixedBlocks(10, 10000);
+
+ long expectedCacheSize = 0;
+
+ // Add all the blocks
+ for(Block block : blocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ expectedCacheSize += block.heapSize();
+ }
+
+ // Let the eviction run
+ int n = 0;
+ while(cache.getEvictionCount() == 0) {
+ System.out.println("sleep");
+ Thread.sleep(1000);
+ assertTrue(n++ < 2);
+ }
+ System.out.println("Background Evictions run: " + cache.getEvictionCount());
+
+ // A single eviction run should have occurred
+ assertEquals(cache.getEvictionCount(), 1);
+ }
+
+ public void testCacheSimple() throws Exception {
+
+ LruBlockCache cache = new LruBlockCache(1000000,10000);
+
+ Block [] blocks = generateRandomBlocks(10, 10000);
+
+ long emptyCacheSize = cache.heapSize();
+
+ long expectedCacheSize = emptyCacheSize;
+
+ // Confirm empty
+ for(Block block : blocks) {
+ assertTrue(cache.getBlock(block.blockName) == null);
+ }
+
+ // Add blocks
+ for(Block block : blocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ expectedCacheSize += block.heapSize();
+ }
+
+ // Verify correctly calculated cache heap size
+ assertEquals(expectedCacheSize, cache.heapSize());
+
+ // Check if all blocks are properly cached and retrieved
+ for(Block block : blocks) {
+ ByteBuffer buf = cache.getBlock(block.blockName);
+ assertTrue(buf != null);
+ assertEquals(buf.capacity(), block.buf.capacity());
+ }
+
+ // Re-add same blocks and ensure nothing has changed
+ for(Block block : blocks) {
+ try {
+ cache.cacheBlock(block.blockName, block.buf);
+ assertTrue("Cache should not allow re-caching a block", false);
+ } catch(RuntimeException re) {
+ // expected
+ }
+ }
+
+ // Verify correctly calculated cache heap size
+ assertEquals(expectedCacheSize, cache.heapSize());
+
+ // Check if all blocks are properly cached and retrieved
+ for(Block block : blocks) {
+ ByteBuffer buf = cache.getBlock(block.blockName);
+ assertTrue(buf != null);
+ assertEquals(buf.capacity(), block.buf.capacity());
+ }
+ }
+
+ public void testCacheEvictionSimple() throws Exception {
+
+ long maxSize = 100000;
+
+ LruBlockCache cache = new LruBlockCache(maxSize,100,false);
+
+ Block [] blocks = generateFixedBlocks(10, 10000);
+
+ long expectedCacheSize = 0;
+
+ // Add all the blocks
+ for(Block block : blocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ expectedCacheSize += block.heapSize();
+ }
+
+ // A single eviction run should have occurred
+ assertEquals(cache.getEvictionCount(), 1);
+
+ // Our expected size overruns acceptable limit
+ assertTrue(expectedCacheSize >
+ (maxSize * LruBlockCache.DEFAULT_ACCEPTABLE_FACTOR));
+
+ // But the cache did not grow beyond max
+ assertTrue(cache.cacheSize() < maxSize);
+
+ // And is still below the acceptable limit
+ assertTrue(cache.cacheSize() <
+ (maxSize * LruBlockCache.DEFAULT_ACCEPTABLE_FACTOR));
+
+ // All blocks except block 0 and 1 should be in the cache
+ assertTrue(cache.getBlock(blocks[0].blockName) == null);
+ assertTrue(cache.getBlock(blocks[1].blockName) == null);
+ for(int i=2;i<blocks.length;i++) {
+ assertEquals(cache.getBlock(blocks[i].blockName),
+ blocks[i].buf);
+ }
+ }
+
+ public void testCacheEvictionTwoPriorities() throws Exception {
+
+ long maxSize = 100000;
+
+ LruBlockCache cache = new LruBlockCache(maxSize,100,false);
+
+ Block [] singleBlocks = generateFixedBlocks(5, 10000, "single");
+ Block [] multiBlocks = generateFixedBlocks(5, 10000, "multi");
+
+ long expectedCacheSize = 0;
+
+ // Add and get the multi blocks
+ for(Block block : multiBlocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ expectedCacheSize += block.heapSize();
+ assertEquals(cache.getBlock(block.blockName), block.buf);
+ }
+
+ // Add the single blocks (no get)
+ for(Block block : singleBlocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ expectedCacheSize += block.heapSize();
+ }
+
+ // A single eviction run should have occurred
+ assertEquals(cache.getEvictionCount(), 1);
+
+ // We expect two entries evicted
+ assertEquals(cache.getEvictedCount(), 2);
+
+ // Our expected size overruns acceptable limit
+ assertTrue(expectedCacheSize >
+ (maxSize * LruBlockCache.DEFAULT_ACCEPTABLE_FACTOR));
+
+ // But the cache did not grow beyond max
+ assertTrue(cache.cacheSize() <= maxSize);
+
+ // And is now below the acceptable limit
+ assertTrue(cache.cacheSize() <=
+ (maxSize * LruBlockCache.DEFAULT_ACCEPTABLE_FACTOR));
+
+ // We expect fairness across the two priorities.
+ // This test makes multi go barely over its limit, in-memory
+ // empty, and the rest in single. Two single evictions and
+ // one multi eviction expected.
+ assertTrue(cache.getBlock(singleBlocks[0].blockName) == null);
+ assertTrue(cache.getBlock(multiBlocks[0].blockName) == null);
+
+ // And all others to be cached
+ for(int i=1;i<4;i++) {
+ assertEquals(cache.getBlock(singleBlocks[i].blockName),
+ singleBlocks[i].buf);
+ assertEquals(cache.getBlock(multiBlocks[i].blockName),
+ multiBlocks[i].buf);
+ }
+ }
+
+ public void testCacheEvictionThreePriorities() throws Exception {
+
+ long maxSize = 100000;
+ long blockSize = 9800;
+
+ LruBlockCache cache = new LruBlockCache(maxSize, blockSize, false,
+ (int)Math.ceil(1.2*maxSize/blockSize),
+ LruBlockCache.DEFAULT_LOAD_FACTOR,
+ LruBlockCache.DEFAULT_CONCURRENCY_LEVEL,
+ 0.98f, // min
+ 0.99f, // acceptable
+ 0.33f, // single
+ 0.33f, // multi
+ 0.34f);// memory
+
+
+ Block [] singleBlocks = generateFixedBlocks(5, blockSize, "single");
+ Block [] multiBlocks = generateFixedBlocks(5, blockSize, "multi");
+ Block [] memoryBlocks = generateFixedBlocks(5, blockSize, "memory");
+
+ long expectedCacheSize = 0;
+
+ // Add 3 blocks from each priority
+ for(int i=0;i<3;i++) {
+
+ // Just add single blocks
+ cache.cacheBlock(singleBlocks[i].blockName, singleBlocks[i].buf);
+ expectedCacheSize += singleBlocks[i].heapSize();
+
+ // Add and get multi blocks
+ cache.cacheBlock(multiBlocks[i].blockName, multiBlocks[i].buf);
+ expectedCacheSize += multiBlocks[i].heapSize();
+ cache.getBlock(multiBlocks[i].blockName);
+
+ // Add memory blocks as such
+ cache.cacheBlock(memoryBlocks[i].blockName, memoryBlocks[i].buf, true);
+ expectedCacheSize += memoryBlocks[i].heapSize();
+
+ }
+
+ // Do not expect any evictions yet
+ assertEquals(0, cache.getEvictionCount());
+
+ // Verify cache size
+ assertEquals(expectedCacheSize, cache.cacheSize());
+
+ // Insert a single block, oldest single should be evicted
+ cache.cacheBlock(singleBlocks[3].blockName, singleBlocks[3].buf);
+
+ // Single eviction, one thing evicted
+ assertEquals(1, cache.getEvictionCount());
+ assertEquals(1, cache.getEvictedCount());
+
+ // Verify oldest single block is the one evicted
+ assertEquals(null, cache.getBlock(singleBlocks[0].blockName));
+
+ // Change the oldest remaining single block to a multi
+ cache.getBlock(singleBlocks[1].blockName);
+
+ // Insert another single block
+ cache.cacheBlock(singleBlocks[4].blockName, singleBlocks[4].buf);
+
+ // Two evictions, two evicted.
+ assertEquals(2, cache.getEvictionCount());
+ assertEquals(2, cache.getEvictedCount());
+
+ // Oldest multi block should be evicted now
+ assertEquals(null, cache.getBlock(multiBlocks[0].blockName));
+
+ // Insert another memory block
+ cache.cacheBlock(memoryBlocks[3].blockName, memoryBlocks[3].buf, true);
+
+ // Three evictions, three evicted.
+ assertEquals(3, cache.getEvictionCount());
+ assertEquals(3, cache.getEvictedCount());
+
+ // Oldest memory block should be evicted now
+ assertEquals(null, cache.getBlock(memoryBlocks[0].blockName));
+
+ // Add a block that is twice as big (should force two evictions)
+ Block [] bigBlocks = generateFixedBlocks(3, blockSize*3, "big");
+ cache.cacheBlock(bigBlocks[0].blockName, bigBlocks[0].buf);
+
+ // Four evictions, six evicted (inserted block 3X size, expect +3 evicted)
+ assertEquals(4, cache.getEvictionCount());
+ assertEquals(6, cache.getEvictedCount());
+
+ // Expect three remaining singles to be evicted
+ assertEquals(null, cache.getBlock(singleBlocks[2].blockName));
+ assertEquals(null, cache.getBlock(singleBlocks[3].blockName));
+ assertEquals(null, cache.getBlock(singleBlocks[4].blockName));
+
+ // Make the big block a multi block
+ cache.getBlock(bigBlocks[0].blockName);
+
+ // Cache another single big block
+ cache.cacheBlock(bigBlocks[1].blockName, bigBlocks[1].buf);
+
+ // Five evictions, nine evicted (3 new)
+ assertEquals(5, cache.getEvictionCount());
+ assertEquals(9, cache.getEvictedCount());
+
+ // Expect three remaining multis to be evicted
+ assertEquals(null, cache.getBlock(singleBlocks[1].blockName));
+ assertEquals(null, cache.getBlock(multiBlocks[1].blockName));
+ assertEquals(null, cache.getBlock(multiBlocks[2].blockName));
+
+ // Cache a big memory block
+ cache.cacheBlock(bigBlocks[2].blockName, bigBlocks[2].buf, true);
+
+ // Six evictions, twelve evicted (3 new)
+ assertEquals(6, cache.getEvictionCount());
+ assertEquals(12, cache.getEvictedCount());
+
+ // Expect three remaining in-memory to be evicted
+ assertEquals(null, cache.getBlock(memoryBlocks[1].blockName));
+ assertEquals(null, cache.getBlock(memoryBlocks[2].blockName));
+ assertEquals(null, cache.getBlock(memoryBlocks[3].blockName));
+
+
+ }
+
+ // test scan resistance
+ public void testScanResistance() throws Exception {
+
+ long maxSize = 100000;
+ long blockSize = 9800;
+
+ LruBlockCache cache = new LruBlockCache(maxSize, blockSize, false,
+ (int)Math.ceil(1.2*maxSize/blockSize),
+ LruBlockCache.DEFAULT_LOAD_FACTOR,
+ LruBlockCache.DEFAULT_CONCURRENCY_LEVEL,
+ 0.66f, // min
+ 0.99f, // acceptable
+ 0.33f, // single
+ 0.33f, // multi
+ 0.34f);// memory
+
+ Block [] singleBlocks = generateFixedBlocks(20, blockSize, "single");
+ Block [] multiBlocks = generateFixedBlocks(5, blockSize, "multi");
+
+ // Add 5 multi blocks
+ for(Block block : multiBlocks) {
+ cache.cacheBlock(block.blockName, block.buf);
+ cache.getBlock(block.blockName);
+ }
+
+ // Add 5 single blocks
+ for(int i=0;i<5;i++) {
+ cache.cacheBlock(singleBlocks[i].blockName, singleBlocks[i].buf);
+ }
+
+ // An eviction ran
+ assertEquals(1, cache.getEvictionCount());
+
+ // To drop down to 2/3 capacity, we'll need to evict 4 blocks
+ assertEquals(4, cache.getEvictedCount());
+
+ // Should have been taken off equally from single and multi
+ assertEquals(null, cache.getBlock(singleBlocks[0].blockName));
+ assertEquals(null, cache.getBlock(singleBlocks[1].blockName));
+ assertEquals(null, cache.getBlock(multiBlocks[0].blockName));
+ assertEquals(null, cache.getBlock(multiBlocks[1].blockName));
+
+ // Let's keep "scanning" by adding single blocks. From here on we only
+ // expect evictions from the single bucket.
+
+ // Every time we reach 10 total blocks (every 4 inserts) we get 4 single
+ // blocks evicted. Inserting 13 blocks should yield 3 more evictions and
+ // 12 more evicted.
+
+ for(int i=5;i<18;i++) {
+ cache.cacheBlock(singleBlocks[i].blockName, singleBlocks[i].buf);
+ }
+
+ // 4 total evictions, 16 total evicted
+ assertEquals(4, cache.getEvictionCount());
+ assertEquals(16, cache.getEvictedCount());
+
+ // Should now have 7 total blocks
+ assertEquals(7, cache.size());
+
+ }
+
+ // test setMaxSize
+ public void testResizeBlockCache() throws Exception {
+
+ long maxSize = 300000;
+ long blockSize = 9750;
+
+ LruBlockCache cache = new LruBlockCache(maxSize, blockSize, false,
+ (int)Math.ceil(1.2*maxSize/blockSize),
+ LruBlockCache.DEFAULT_LOAD_FACTOR,
+ LruBlockCache.DEFAULT_CONCURRENCY_LEVEL,
+ 0.98f, // min
+ 0.99f, // acceptable
+ 0.33f, // single
+ 0.33f, // multi
+ 0.34f);// memory
+
+ Block [] singleBlocks = generateFixedBlocks(10, blockSize, "single");
+ Block [] multiBlocks = generateFixedBlocks(10, blockSize, "multi");
+ Block [] memoryBlocks = generateFixedBlocks(10, blockSize, "memory");
+
+ // Add all blocks from all priorities
+ for(int i=0;i<10;i++) {
+
+ // Just add single blocks
+ cache.cacheBlock(singleBlocks[i].blockName, singleBlocks[i].buf);
+
+ // Add and get multi blocks
+ cache.cacheBlock(multiBlocks[i].blockName, multiBlocks[i].buf);
+ cache.getBlock(multiBlocks[i].blockName);
+
+ // Add memory blocks as such
+ cache.cacheBlock(memoryBlocks[i].blockName, memoryBlocks[i].buf, true);
+ }
+
+ // Do not expect any evictions yet
+ assertEquals(0, cache.getEvictionCount());
+
+ // Resize to half capacity plus an extra block (otherwise we evict an extra)
+ cache.setMaxSize((long)(maxSize * 0.5f) + blockSize);
+
+ // Should have run a single eviction
+ assertEquals(1, cache.getEvictionCount());
+
+ // And we expect 1/2 of the blocks to be evicted
+ assertEquals(15, cache.getEvictedCount());
+
+ // And the oldest 5 blocks from each category should be gone
+ for(int i=0;i<5;i++) {
+ assertEquals(null, cache.getBlock(singleBlocks[i].blockName));
+ assertEquals(null, cache.getBlock(multiBlocks[i].blockName));
+ assertEquals(null, cache.getBlock(memoryBlocks[i].blockName));
+ }
+
+ // And the newest 5 blocks should still be accessible
+ for(int i=5;i<10;i++) {
+ assertEquals(singleBlocks[i].buf, cache.getBlock(singleBlocks[i].blockName));
+ assertEquals(multiBlocks[i].buf, cache.getBlock(multiBlocks[i].blockName));
+ assertEquals(memoryBlocks[i].buf, cache.getBlock(memoryBlocks[i].blockName));
+ }
+ }
+
+ private Block [] generateFixedBlocks(int numBlocks, int size, String pfx) {
+ Block [] blocks = new Block[numBlocks];
+ for(int i=0;i<numBlocks;i++) {
+ blocks[i] = new Block(pfx + i, size);
+ }
+ return blocks;
+ }
+
+ private Block [] generateFixedBlocks(int numBlocks, long size, String pfx) {
+ return generateFixedBlocks(numBlocks, (int)size, pfx);
+ }
+
+ private Block [] generateFixedBlocks(int numBlocks, int size) {
+ return generateFixedBlocks(numBlocks, size, "block");
+ }
+
+ private Block [] generateRandomBlocks(int numBlocks, int maxSize) {
+ Block [] blocks = new Block[numBlocks];
+ Random r = new Random();
+ for(int i=0;i<numBlocks;i++) {
+ blocks[i] = new Block("block" + i, r.nextInt(maxSize)+1);
+ }
+ return blocks;
+ }
+
+ private class Block implements HeapSize {
+ String blockName;
+ ByteBuffer buf;
+ boolean inMemory;
+
+ Block(String blockName, int size) {
+ this(blockName,size,false);
+ }
+
+ Block(String blockName, int size, boolean inMemory) {
+ this.blockName = blockName;
+ this.buf = ByteBuffer.allocate(size);
+ this.inMemory = inMemory;
+ }
+
+ public long heapSize() {
+ return CachedBlock.PER_BLOCK_OVERHEAD +
+ ClassSize.align(blockName.length()) +
+ ClassSize.align(buf.capacity());
+ }
+ }
+}