HBASE-16194 Should count in MSLAB chunk allocation into heap size change when adding duplicate cells
This commit is contained in:
parent
fe915e10d6
commit
e03d4fbb0a
|
@ -49,6 +49,8 @@ import org.apache.hadoop.hbase.util.EnvironmentEdgeManager;
|
||||||
import org.apache.hadoop.hbase.util.ReflectionUtils;
|
import org.apache.hadoop.hbase.util.ReflectionUtils;
|
||||||
import org.apache.htrace.Trace;
|
import org.apache.htrace.Trace;
|
||||||
|
|
||||||
|
import com.google.common.annotations.VisibleForTesting;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* The MemStore holds in-memory modifications to the Store. Modifications
|
* The MemStore holds in-memory modifications to the Store. Modifications
|
||||||
* are {@link Cell}s. When asked to flush, current memstore is moved
|
* are {@link Cell}s. When asked to flush, current memstore is moved
|
||||||
|
@ -226,7 +228,8 @@ public class DefaultMemStore implements MemStore {
|
||||||
@Override
|
@Override
|
||||||
public long add(Cell cell) {
|
public long add(Cell cell) {
|
||||||
Cell toAdd = maybeCloneWithAllocator(cell);
|
Cell toAdd = maybeCloneWithAllocator(cell);
|
||||||
return internalAdd(toAdd);
|
boolean mslabUsed = (toAdd != cell);
|
||||||
|
return internalAdd(toAdd, mslabUsed);
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
|
@ -264,20 +267,38 @@ public class DefaultMemStore implements MemStore {
|
||||||
* allocator, and doesn't take the lock.
|
* allocator, and doesn't take the lock.
|
||||||
*
|
*
|
||||||
* Callers should ensure they already have the read lock taken
|
* Callers should ensure they already have the read lock taken
|
||||||
|
* @param toAdd the cell to add
|
||||||
|
* @param mslabUsed whether using MSLAB
|
||||||
|
* @return the heap size change in bytes
|
||||||
*/
|
*/
|
||||||
private long internalAdd(final Cell toAdd) {
|
private long internalAdd(final Cell toAdd, boolean mslabUsed) {
|
||||||
long s = heapSizeChange(toAdd, addToCellSet(toAdd));
|
boolean notPresent = addToCellSet(toAdd);
|
||||||
|
long s = heapSizeChange(toAdd, notPresent);
|
||||||
|
// If there's already a same cell in the CellSet and we are using MSLAB, we must count in the
|
||||||
|
// MSLAB allocation size as well, or else there will be memory leak (occupied heap size larger
|
||||||
|
// than the counted number)
|
||||||
|
if (!notPresent && mslabUsed) {
|
||||||
|
s += getCellLength(toAdd);
|
||||||
|
}
|
||||||
timeRangeTracker.includeTimestamp(toAdd);
|
timeRangeTracker.includeTimestamp(toAdd);
|
||||||
this.size.addAndGet(s);
|
this.size.addAndGet(s);
|
||||||
return s;
|
return s;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Get cell length after serialized in {@link KeyValue}
|
||||||
|
*/
|
||||||
|
@VisibleForTesting
|
||||||
|
int getCellLength(Cell cell) {
|
||||||
|
return KeyValueUtil.length(cell);
|
||||||
|
}
|
||||||
|
|
||||||
private Cell maybeCloneWithAllocator(Cell cell) {
|
private Cell maybeCloneWithAllocator(Cell cell) {
|
||||||
if (allocator == null) {
|
if (allocator == null) {
|
||||||
return cell;
|
return cell;
|
||||||
}
|
}
|
||||||
|
|
||||||
int len = KeyValueUtil.length(cell);
|
int len = getCellLength(cell);
|
||||||
ByteRange alloc = allocator.allocateBytes(len);
|
ByteRange alloc = allocator.allocateBytes(len);
|
||||||
if (alloc == null) {
|
if (alloc == null) {
|
||||||
// The allocation was too large, allocator decided
|
// The allocation was too large, allocator decided
|
||||||
|
@ -328,12 +349,9 @@ public class DefaultMemStore implements MemStore {
|
||||||
*/
|
*/
|
||||||
@Override
|
@Override
|
||||||
public long delete(Cell deleteCell) {
|
public long delete(Cell deleteCell) {
|
||||||
long s = 0;
|
|
||||||
Cell toAdd = maybeCloneWithAllocator(deleteCell);
|
Cell toAdd = maybeCloneWithAllocator(deleteCell);
|
||||||
s += heapSizeChange(toAdd, addToCellSet(toAdd));
|
boolean mslabUsed = (toAdd != deleteCell);
|
||||||
timeRangeTracker.includeTimestamp(toAdd);
|
return internalAdd(toAdd, mslabUsed);
|
||||||
this.size.addAndGet(s);
|
|
||||||
return s;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -574,7 +592,7 @@ public class DefaultMemStore implements MemStore {
|
||||||
// hitting OOME - see TestMemStore.testUpsertMSLAB for a
|
// hitting OOME - see TestMemStore.testUpsertMSLAB for a
|
||||||
// test that triggers the pathological case if we don't avoid MSLAB
|
// test that triggers the pathological case if we don't avoid MSLAB
|
||||||
// here.
|
// here.
|
||||||
long addedSize = internalAdd(cell);
|
long addedSize = internalAdd(cell, false);
|
||||||
|
|
||||||
// Get the Cells for the row/family/qualifier regardless of timestamp.
|
// Get the Cells for the row/family/qualifier regardless of timestamp.
|
||||||
// For this case we want to clean up any other puts
|
// For this case we want to clean up any other puts
|
||||||
|
|
|
@ -29,6 +29,7 @@ import org.apache.hadoop.conf.Configuration;
|
||||||
import org.apache.hadoop.hbase.util.ByteRange;
|
import org.apache.hadoop.hbase.util.ByteRange;
|
||||||
import org.apache.hadoop.hbase.util.SimpleMutableByteRange;
|
import org.apache.hadoop.hbase.util.SimpleMutableByteRange;
|
||||||
|
|
||||||
|
import com.google.common.annotations.VisibleForTesting;
|
||||||
import com.google.common.base.Preconditions;
|
import com.google.common.base.Preconditions;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
@ -206,6 +207,11 @@ public class HeapMemStoreLAB implements MemStoreLAB {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@VisibleForTesting
|
||||||
|
Chunk getCurrentChunk() {
|
||||||
|
return this.curChunk.get();
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* A chunk of memory out of which allocations are sliced.
|
* A chunk of memory out of which allocations are sliced.
|
||||||
*/
|
*/
|
||||||
|
@ -311,5 +317,10 @@ public class HeapMemStoreLAB implements MemStoreLAB {
|
||||||
" allocs=" + allocCount.get() + "waste=" +
|
" allocs=" + allocCount.get() + "waste=" +
|
||||||
(data.length - nextFreeOffset.get());
|
(data.length - nextFreeOffset.get());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@VisibleForTesting
|
||||||
|
int getNextFreeOffset() {
|
||||||
|
return this.nextFreeOffset.get();
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -91,6 +91,27 @@ public class TestDefaultMemStore extends TestCase {
|
||||||
assertTrue(Bytes.toString(found.getValue()), CellUtil.matchingValue(samekey, found));
|
assertTrue(Bytes.toString(found.getValue()), CellUtil.matchingValue(samekey, found));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public void testPutSameCell() {
|
||||||
|
byte[] bytes = Bytes.toBytes(getName());
|
||||||
|
KeyValue kv = new KeyValue(bytes, bytes, bytes, bytes);
|
||||||
|
long sizeChangeForFirstCell = this.memstore.add(kv);
|
||||||
|
long sizeChangeForSecondCell = this.memstore.add(kv);
|
||||||
|
// make sure memstore size increase won't double-count MSLAB chunk size
|
||||||
|
assertEquals(DefaultMemStore.heapSizeChange(kv, true), sizeChangeForFirstCell);
|
||||||
|
if (this.memstore.allocator != null) {
|
||||||
|
// make sure memstore size increased when using MSLAB
|
||||||
|
assertEquals(memstore.getCellLength(kv), sizeChangeForSecondCell);
|
||||||
|
// make sure chunk size increased even when writing the same cell, if using MSLAB
|
||||||
|
if (this.memstore.allocator instanceof HeapMemStoreLAB) {
|
||||||
|
assertEquals(2 * memstore.getCellLength(kv),
|
||||||
|
((HeapMemStoreLAB) this.memstore.allocator).getCurrentChunk().getNextFreeOffset());
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
// make sure no memstore size change w/o MSLAB
|
||||||
|
assertEquals(0, sizeChangeForSecondCell);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Test memstore snapshot happening while scanning.
|
* Test memstore snapshot happening while scanning.
|
||||||
* @throws IOException
|
* @throws IOException
|
||||||
|
|
Loading…
Reference in New Issue