2012-12-05 22:11:48 +01:00
|
|
|
/*
|
|
|
|
* Copyright 2012 The Netty Project
|
|
|
|
*
|
|
|
|
* The Netty Project 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 io.netty.buffer;
|
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
import io.netty.util.internal.LongCounter;
|
2013-01-11 06:03:27 +01:00
|
|
|
import io.netty.util.internal.PlatformDependent;
|
2012-12-05 22:11:48 +01:00
|
|
|
import io.netty.util.internal.StringUtil;
|
|
|
|
|
|
|
|
import java.nio.ByteBuffer;
|
2015-05-13 17:15:06 +02:00
|
|
|
import java.util.ArrayList;
|
|
|
|
import java.util.Collections;
|
|
|
|
import java.util.List;
|
2016-03-14 17:25:43 +01:00
|
|
|
import java.util.concurrent.atomic.AtomicInteger;
|
2012-12-05 22:11:48 +01:00
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
abstract class PoolArena<T> implements PoolArenaMetric {
|
2015-10-09 21:03:03 +02:00
|
|
|
static final boolean HAS_UNSAFE = PlatformDependent.hasUnsafe();
|
2012-12-05 22:11:48 +01:00
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
enum SizeClass {
|
|
|
|
Tiny,
|
|
|
|
Small,
|
|
|
|
Normal
|
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
static final int numTinySubpagePools = 512 >>> 4;
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
final PooledByteBufAllocator parent;
|
|
|
|
|
|
|
|
private final int maxOrder;
|
2014-03-01 15:47:03 +01:00
|
|
|
final int pageSize;
|
|
|
|
final int pageShifts;
|
|
|
|
final int chunkSize;
|
|
|
|
final int subpageOverflowMask;
|
|
|
|
final int numSmallSubpagePools;
|
2013-03-05 15:55:41 +01:00
|
|
|
private final PoolSubpage<T>[] tinySubpagePools;
|
|
|
|
private final PoolSubpage<T>[] smallSubpagePools;
|
2012-12-05 22:11:48 +01:00
|
|
|
|
|
|
|
private final PoolChunkList<T> q050;
|
|
|
|
private final PoolChunkList<T> q025;
|
|
|
|
private final PoolChunkList<T> q000;
|
|
|
|
private final PoolChunkList<T> qInit;
|
|
|
|
private final PoolChunkList<T> q075;
|
|
|
|
private final PoolChunkList<T> q100;
|
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
private final List<PoolChunkListMetric> chunkListMetrics;
|
|
|
|
|
|
|
|
// Metrics for allocations and deallocations
|
|
|
|
private long allocationsNormal;
|
|
|
|
// We need to use the LongCounter here as this is not guarded via synchronized block.
|
2016-03-14 09:00:50 +01:00
|
|
|
private final LongCounter allocationsTiny = PlatformDependent.newLongCounter();
|
|
|
|
private final LongCounter allocationsSmall = PlatformDependent.newLongCounter();
|
2015-05-13 17:15:06 +02:00
|
|
|
private final LongCounter allocationsHuge = PlatformDependent.newLongCounter();
|
|
|
|
|
|
|
|
private long deallocationsTiny;
|
|
|
|
private long deallocationsSmall;
|
|
|
|
private long deallocationsNormal;
|
2016-03-14 09:00:50 +01:00
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
// We need to use the LongCounter here as this is not guarded via synchronized block.
|
|
|
|
private final LongCounter deallocationsHuge = PlatformDependent.newLongCounter();
|
|
|
|
|
2016-03-14 17:25:43 +01:00
|
|
|
// Number of thread caches backed by this arena.
|
|
|
|
final AtomicInteger numThreadCaches = new AtomicInteger();
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
// TODO: Test if adding padding helps under contention
|
|
|
|
//private long pad0, pad1, pad2, pad3, pad4, pad5, pad6, pad7;
|
|
|
|
|
|
|
|
protected PoolArena(PooledByteBufAllocator parent, int pageSize, int maxOrder, int pageShifts, int chunkSize) {
|
|
|
|
this.parent = parent;
|
|
|
|
this.pageSize = pageSize;
|
|
|
|
this.maxOrder = maxOrder;
|
|
|
|
this.pageShifts = pageShifts;
|
|
|
|
this.chunkSize = chunkSize;
|
|
|
|
subpageOverflowMask = ~(pageSize - 1);
|
2014-03-01 15:47:03 +01:00
|
|
|
tinySubpagePools = newSubpagePoolArray(numTinySubpagePools);
|
2012-12-05 22:11:48 +01:00
|
|
|
for (int i = 0; i < tinySubpagePools.length; i ++) {
|
2013-03-05 15:55:41 +01:00
|
|
|
tinySubpagePools[i] = newSubpagePoolHead(pageSize);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
numSmallSubpagePools = pageShifts - 9;
|
|
|
|
smallSubpagePools = newSubpagePoolArray(numSmallSubpagePools);
|
2012-12-05 22:11:48 +01:00
|
|
|
for (int i = 0; i < smallSubpagePools.length; i ++) {
|
2013-03-05 15:55:41 +01:00
|
|
|
smallSubpagePools[i] = newSubpagePoolHead(pageSize);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
q100 = new PoolChunkList<T>(null, 100, Integer.MAX_VALUE);
|
|
|
|
q075 = new PoolChunkList<T>(q100, 75, 100);
|
|
|
|
q050 = new PoolChunkList<T>(q075, 50, 100);
|
|
|
|
q025 = new PoolChunkList<T>(q050, 25, 75);
|
|
|
|
q000 = new PoolChunkList<T>(q025, 1, 50);
|
|
|
|
qInit = new PoolChunkList<T>(q000, Integer.MIN_VALUE, 25);
|
2012-12-05 22:11:48 +01:00
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
q100.prevList(q075);
|
|
|
|
q075.prevList(q050);
|
|
|
|
q050.prevList(q025);
|
|
|
|
q025.prevList(q000);
|
|
|
|
q000.prevList(null);
|
|
|
|
qInit.prevList(qInit);
|
2015-05-13 17:15:06 +02:00
|
|
|
|
|
|
|
List<PoolChunkListMetric> metrics = new ArrayList<PoolChunkListMetric>(6);
|
|
|
|
metrics.add(qInit);
|
|
|
|
metrics.add(q000);
|
|
|
|
metrics.add(q025);
|
|
|
|
metrics.add(q050);
|
|
|
|
metrics.add(q075);
|
|
|
|
metrics.add(q100);
|
|
|
|
chunkListMetrics = Collections.unmodifiableList(metrics);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2013-03-05 15:55:41 +01:00
|
|
|
private PoolSubpage<T> newSubpagePoolHead(int pageSize) {
|
|
|
|
PoolSubpage<T> head = new PoolSubpage<T>(pageSize);
|
|
|
|
head.prev = head;
|
|
|
|
head.next = head;
|
|
|
|
return head;
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
@SuppressWarnings("unchecked")
|
2013-03-05 15:55:41 +01:00
|
|
|
private PoolSubpage<T>[] newSubpagePoolArray(int size) {
|
|
|
|
return new PoolSubpage[size];
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
abstract boolean isDirect();
|
|
|
|
|
2012-12-19 08:48:53 +01:00
|
|
|
PooledByteBuf<T> allocate(PoolThreadCache cache, int reqCapacity, int maxCapacity) {
|
2012-12-05 22:11:48 +01:00
|
|
|
PooledByteBuf<T> buf = newByteBuf(maxCapacity);
|
2012-12-19 08:48:53 +01:00
|
|
|
allocate(cache, buf, reqCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
static int tinyIdx(int normCapacity) {
|
|
|
|
return normCapacity >>> 4;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int smallIdx(int normCapacity) {
|
|
|
|
int tableIdx = 0;
|
|
|
|
int i = normCapacity >>> 10;
|
|
|
|
while (i != 0) {
|
|
|
|
i >>>= 1;
|
|
|
|
tableIdx ++;
|
|
|
|
}
|
|
|
|
return tableIdx;
|
|
|
|
}
|
|
|
|
|
|
|
|
// capacity < pageSize
|
|
|
|
boolean isTinyOrSmall(int normCapacity) {
|
|
|
|
return (normCapacity & subpageOverflowMask) == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// normCapacity < 512
|
|
|
|
static boolean isTiny(int normCapacity) {
|
|
|
|
return (normCapacity & 0xFFFFFE00) == 0;
|
|
|
|
}
|
|
|
|
|
2012-12-19 08:48:53 +01:00
|
|
|
private void allocate(PoolThreadCache cache, PooledByteBuf<T> buf, final int reqCapacity) {
|
|
|
|
final int normCapacity = normalizeCapacity(reqCapacity);
|
2014-03-01 15:47:03 +01:00
|
|
|
if (isTinyOrSmall(normCapacity)) { // capacity < pageSize
|
2012-12-05 22:11:48 +01:00
|
|
|
int tableIdx;
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T>[] table;
|
2015-05-13 17:15:06 +02:00
|
|
|
boolean tiny = isTiny(normCapacity);
|
|
|
|
if (tiny) { // < 512
|
2014-03-01 15:47:03 +01:00
|
|
|
if (cache.allocateTiny(this, buf, reqCapacity, normCapacity)) {
|
|
|
|
// was able to allocate out of the cache so move on
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
tableIdx = tinyIdx(normCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
table = tinySubpagePools;
|
|
|
|
} else {
|
2014-03-01 15:47:03 +01:00
|
|
|
if (cache.allocateSmall(this, buf, reqCapacity, normCapacity)) {
|
|
|
|
// was able to allocate out of the cache so move on
|
|
|
|
return;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
2014-03-01 15:47:03 +01:00
|
|
|
tableIdx = smallIdx(normCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
table = smallSubpagePools;
|
|
|
|
}
|
|
|
|
|
2015-05-13 13:50:22 +02:00
|
|
|
final PoolSubpage<T> head = table[tableIdx];
|
2015-05-20 07:27:55 +02:00
|
|
|
|
|
|
|
/**
|
2015-10-22 22:09:41 +02:00
|
|
|
* Synchronize on the head. This is needed as {@link PoolChunk#allocateSubpage(int)} and
|
|
|
|
* {@link PoolChunk#free(long)} may modify the doubly linked list as well.
|
2015-05-20 07:27:55 +02:00
|
|
|
*/
|
|
|
|
synchronized (head) {
|
2013-03-05 15:55:41 +01:00
|
|
|
final PoolSubpage<T> s = head.next;
|
|
|
|
if (s != head) {
|
|
|
|
assert s.doNotDestroy && s.elemSize == normCapacity;
|
2012-12-05 22:11:48 +01:00
|
|
|
long handle = s.allocate();
|
2013-03-05 15:55:41 +01:00
|
|
|
assert handle >= 0;
|
|
|
|
s.chunk.initBufWithSubpage(buf, handle, reqCapacity);
|
2015-05-13 17:15:06 +02:00
|
|
|
|
|
|
|
if (tiny) {
|
2016-03-13 22:27:56 +01:00
|
|
|
allocationsTiny.increment();
|
2015-05-13 17:15:06 +02:00
|
|
|
} else {
|
2016-03-13 22:27:56 +01:00
|
|
|
allocationsSmall.increment();
|
2015-05-13 17:15:06 +02:00
|
|
|
}
|
2013-03-05 15:55:41 +01:00
|
|
|
return;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
}
|
2015-05-20 07:27:55 +02:00
|
|
|
allocateNormal(buf, reqCapacity, normCapacity);
|
|
|
|
return;
|
2015-05-13 13:50:22 +02:00
|
|
|
}
|
|
|
|
if (normCapacity <= chunkSize) {
|
2014-03-01 15:47:03 +01:00
|
|
|
if (cache.allocateNormal(this, buf, reqCapacity, normCapacity)) {
|
|
|
|
// was able to allocate out of the cache so move on
|
|
|
|
return;
|
|
|
|
}
|
2015-05-20 07:27:55 +02:00
|
|
|
allocateNormal(buf, reqCapacity, normCapacity);
|
2014-03-01 15:47:03 +01:00
|
|
|
} else {
|
|
|
|
// Huge allocations are never served via the cache so just call allocateHuge
|
2012-12-19 09:35:32 +01:00
|
|
|
allocateHuge(buf, reqCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-20 07:27:55 +02:00
|
|
|
private synchronized void allocateNormal(PooledByteBuf<T> buf, int reqCapacity, int normCapacity) {
|
|
|
|
++allocationsNormal;
|
2012-12-19 08:48:53 +01:00
|
|
|
if (q050.allocate(buf, reqCapacity, normCapacity) || q025.allocate(buf, reqCapacity, normCapacity) ||
|
|
|
|
q000.allocate(buf, reqCapacity, normCapacity) || qInit.allocate(buf, reqCapacity, normCapacity) ||
|
2013-03-05 15:55:41 +01:00
|
|
|
q075.allocate(buf, reqCapacity, normCapacity) || q100.allocate(buf, reqCapacity, normCapacity)) {
|
2012-12-05 22:11:48 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add a new chunk.
|
|
|
|
PoolChunk<T> c = newChunk(pageSize, maxOrder, pageShifts, chunkSize);
|
2012-12-19 08:48:53 +01:00
|
|
|
long handle = c.allocate(normCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
assert handle > 0;
|
2012-12-19 08:48:53 +01:00
|
|
|
c.initBuf(buf, handle, reqCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
qInit.add(c);
|
|
|
|
}
|
|
|
|
|
2012-12-19 09:35:32 +01:00
|
|
|
private void allocateHuge(PooledByteBuf<T> buf, int reqCapacity) {
|
2015-05-13 17:15:06 +02:00
|
|
|
allocationsHuge.increment();
|
2012-12-19 09:35:32 +01:00
|
|
|
buf.initUnpooled(newUnpooledChunk(reqCapacity), reqCapacity);
|
|
|
|
}
|
|
|
|
|
2015-05-19 15:03:29 +02:00
|
|
|
void free(PoolChunk<T> chunk, long handle, int normCapacity, PoolThreadCache cache) {
|
2012-12-19 09:35:32 +01:00
|
|
|
if (chunk.unpooled) {
|
2015-05-13 17:15:06 +02:00
|
|
|
allocationsHuge.decrement();
|
2012-12-19 09:35:32 +01:00
|
|
|
destroyChunk(chunk);
|
|
|
|
} else {
|
2015-05-25 21:00:24 +02:00
|
|
|
SizeClass sizeClass = sizeClass(normCapacity);
|
2015-05-19 15:03:29 +02:00
|
|
|
if (cache != null && cache.add(this, chunk, handle, normCapacity, sizeClass)) {
|
|
|
|
// cached so not free it.
|
|
|
|
return;
|
2014-03-01 15:47:03 +01:00
|
|
|
}
|
2015-05-19 15:03:29 +02:00
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
freeChunk(chunk, handle, sizeClass);
|
|
|
|
}
|
|
|
|
}
|
2014-09-02 07:15:58 +02:00
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
private SizeClass sizeClass(int normCapacity) {
|
|
|
|
if (!isTinyOrSmall(normCapacity)) {
|
|
|
|
return SizeClass.Normal;
|
|
|
|
}
|
|
|
|
return isTiny(normCapacity) ? SizeClass.Tiny : SizeClass.Small;
|
|
|
|
}
|
|
|
|
|
|
|
|
void freeChunk(PoolChunk<T> chunk, long handle, SizeClass sizeClass) {
|
|
|
|
final boolean destroyChunk;
|
|
|
|
synchronized (this) {
|
|
|
|
switch (sizeClass) {
|
|
|
|
case Normal:
|
|
|
|
++deallocationsNormal;
|
|
|
|
break;
|
|
|
|
case Small:
|
|
|
|
++deallocationsSmall;
|
|
|
|
break;
|
|
|
|
case Tiny:
|
|
|
|
++deallocationsTiny;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
throw new Error();
|
2013-11-30 19:48:40 +01:00
|
|
|
}
|
2015-05-25 21:00:24 +02:00
|
|
|
destroyChunk = !chunk.parent.free(chunk, handle);
|
|
|
|
}
|
|
|
|
if (destroyChunk) {
|
|
|
|
// destroyChunk not need to be called while holding the synchronized lock.
|
|
|
|
destroyChunk(chunk);
|
2012-12-19 09:35:32 +01:00
|
|
|
}
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T> findSubpagePoolHead(int elemSize) {
|
2012-12-05 22:11:48 +01:00
|
|
|
int tableIdx;
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T>[] table;
|
2014-03-01 15:47:03 +01:00
|
|
|
if (isTiny(elemSize)) { // < 512
|
2012-12-05 22:11:48 +01:00
|
|
|
tableIdx = elemSize >>> 4;
|
|
|
|
table = tinySubpagePools;
|
|
|
|
} else {
|
|
|
|
tableIdx = 0;
|
|
|
|
elemSize >>>= 10;
|
|
|
|
while (elemSize != 0) {
|
|
|
|
elemSize >>>= 1;
|
|
|
|
tableIdx ++;
|
|
|
|
}
|
|
|
|
table = smallSubpagePools;
|
|
|
|
}
|
|
|
|
|
2013-03-05 15:55:41 +01:00
|
|
|
return table[tableIdx];
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
int normalizeCapacity(int reqCapacity) {
|
2012-12-19 09:35:32 +01:00
|
|
|
if (reqCapacity < 0) {
|
|
|
|
throw new IllegalArgumentException("capacity: " + reqCapacity + " (expected: 0+)");
|
|
|
|
}
|
|
|
|
if (reqCapacity >= chunkSize) {
|
|
|
|
return reqCapacity;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
if (!isTiny(reqCapacity)) { // >= 512
|
2012-12-05 22:11:48 +01:00
|
|
|
// Doubled
|
2013-06-20 11:38:11 +02:00
|
|
|
|
|
|
|
int normalizedCapacity = reqCapacity;
|
2014-04-14 22:57:24 +02:00
|
|
|
normalizedCapacity --;
|
2013-06-20 11:38:11 +02:00
|
|
|
normalizedCapacity |= normalizedCapacity >>> 1;
|
|
|
|
normalizedCapacity |= normalizedCapacity >>> 2;
|
|
|
|
normalizedCapacity |= normalizedCapacity >>> 4;
|
|
|
|
normalizedCapacity |= normalizedCapacity >>> 8;
|
|
|
|
normalizedCapacity |= normalizedCapacity >>> 16;
|
|
|
|
normalizedCapacity ++;
|
|
|
|
|
|
|
|
if (normalizedCapacity < 0) {
|
|
|
|
normalizedCapacity >>>= 1;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
2013-06-20 11:38:11 +02:00
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
return normalizedCapacity;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Quantum-spaced
|
2012-12-19 08:48:53 +01:00
|
|
|
if ((reqCapacity & 15) == 0) {
|
|
|
|
return reqCapacity;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
2012-12-19 08:48:53 +01:00
|
|
|
return (reqCapacity & ~15) + 16;
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void reallocate(PooledByteBuf<T> buf, int newCapacity, boolean freeOldMemory) {
|
|
|
|
if (newCapacity < 0 || newCapacity > buf.maxCapacity()) {
|
|
|
|
throw new IllegalArgumentException("newCapacity: " + newCapacity);
|
|
|
|
}
|
|
|
|
|
|
|
|
int oldCapacity = buf.length;
|
|
|
|
if (oldCapacity == newCapacity) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
PoolChunk<T> oldChunk = buf.chunk;
|
|
|
|
long oldHandle = buf.handle;
|
|
|
|
T oldMemory = buf.memory;
|
|
|
|
int oldOffset = buf.offset;
|
2014-03-01 15:47:03 +01:00
|
|
|
int oldMaxLength = buf.maxLength;
|
2012-12-05 22:11:48 +01:00
|
|
|
int readerIndex = buf.readerIndex();
|
|
|
|
int writerIndex = buf.writerIndex();
|
|
|
|
|
2015-05-25 21:00:24 +02:00
|
|
|
allocate(parent.threadCache(), buf, newCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
if (newCapacity > oldCapacity) {
|
|
|
|
memoryCopy(
|
2013-11-04 15:18:21 +01:00
|
|
|
oldMemory, oldOffset,
|
|
|
|
buf.memory, buf.offset, oldCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
} else if (newCapacity < oldCapacity) {
|
|
|
|
if (readerIndex < newCapacity) {
|
|
|
|
if (writerIndex > newCapacity) {
|
|
|
|
writerIndex = newCapacity;
|
|
|
|
}
|
|
|
|
memoryCopy(
|
|
|
|
oldMemory, oldOffset + readerIndex,
|
|
|
|
buf.memory, buf.offset + readerIndex, writerIndex - readerIndex);
|
|
|
|
} else {
|
|
|
|
readerIndex = writerIndex = newCapacity;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
buf.setIndex(readerIndex, writerIndex);
|
|
|
|
|
|
|
|
if (freeOldMemory) {
|
2015-05-19 15:03:29 +02:00
|
|
|
free(oldChunk, oldHandle, oldMaxLength, buf.cache);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-03-14 17:25:43 +01:00
|
|
|
@Override
|
|
|
|
public int numThreadCaches() {
|
|
|
|
return numThreadCaches.get();
|
|
|
|
}
|
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
@Override
|
|
|
|
public int numTinySubpages() {
|
|
|
|
return tinySubpagePools.length;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public int numSmallSubpages() {
|
|
|
|
return smallSubpagePools.length;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public int numChunkLists() {
|
|
|
|
return chunkListMetrics.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public List<PoolSubpageMetric> tinySubpages() {
|
|
|
|
return subPageMetricList(tinySubpagePools);
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public List<PoolSubpageMetric> smallSubpages() {
|
|
|
|
return subPageMetricList(smallSubpagePools);
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public List<PoolChunkListMetric> chunkLists() {
|
|
|
|
return chunkListMetrics;
|
|
|
|
}
|
|
|
|
|
|
|
|
private static List<PoolSubpageMetric> subPageMetricList(PoolSubpage<?>[] pages) {
|
|
|
|
List<PoolSubpageMetric> metrics = new ArrayList<PoolSubpageMetric>();
|
|
|
|
for (int i = 1; i < pages.length; i ++) {
|
|
|
|
PoolSubpage<?> head = pages[i];
|
|
|
|
if (head.next == head) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
PoolSubpage<?> s = head.next;
|
|
|
|
for (;;) {
|
|
|
|
metrics.add(s);
|
|
|
|
s = s.next;
|
|
|
|
if (s == head) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return metrics;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numAllocations() {
|
2016-03-14 09:09:24 +01:00
|
|
|
final long allocsNormal;
|
|
|
|
synchronized (this) {
|
|
|
|
allocsNormal = allocationsNormal;
|
|
|
|
}
|
|
|
|
return allocationsTiny.value() + allocationsSmall.value() + allocsNormal + allocationsHuge.value();
|
2015-05-13 17:15:06 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numTinyAllocations() {
|
2016-03-13 22:27:56 +01:00
|
|
|
return allocationsTiny.value();
|
2015-05-13 17:15:06 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numSmallAllocations() {
|
2016-03-13 22:27:56 +01:00
|
|
|
return allocationsSmall.value();
|
2015-05-13 17:15:06 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2016-03-14 09:09:24 +01:00
|
|
|
public synchronized long numNormalAllocations() {
|
2015-05-13 17:15:06 +02:00
|
|
|
return allocationsNormal;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numDeallocations() {
|
2016-03-14 09:09:24 +01:00
|
|
|
final long deallocs;
|
|
|
|
synchronized (this) {
|
2016-03-17 10:06:37 +01:00
|
|
|
deallocs = deallocationsTiny + deallocationsSmall + deallocationsNormal;
|
2016-03-14 09:09:24 +01:00
|
|
|
}
|
|
|
|
return deallocs + deallocationsHuge.value();
|
2015-05-13 17:15:06 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2016-03-14 09:09:24 +01:00
|
|
|
public synchronized long numTinyDeallocations() {
|
2015-05-13 17:15:06 +02:00
|
|
|
return deallocationsTiny;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2016-03-14 09:09:24 +01:00
|
|
|
public synchronized long numSmallDeallocations() {
|
2015-05-13 17:15:06 +02:00
|
|
|
return deallocationsSmall;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2016-03-14 09:09:24 +01:00
|
|
|
public synchronized long numNormalDeallocations() {
|
2015-05-13 17:15:06 +02:00
|
|
|
return deallocationsNormal;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numHugeAllocations() {
|
|
|
|
return allocationsHuge.value();
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numHugeDeallocations() {
|
|
|
|
return deallocationsHuge.value();
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2016-03-14 09:09:24 +01:00
|
|
|
public long numActiveAllocations() {
|
2016-03-17 10:06:37 +01:00
|
|
|
long val = allocationsTiny.value() + allocationsSmall.value() + allocationsHuge.value()
|
|
|
|
- deallocationsHuge.value();
|
2016-03-14 09:09:24 +01:00
|
|
|
synchronized (this) {
|
2016-03-17 10:06:37 +01:00
|
|
|
val += allocationsNormal - (deallocationsTiny + deallocationsSmall + deallocationsNormal);
|
2016-03-14 09:09:24 +01:00
|
|
|
}
|
2015-05-13 17:15:06 +02:00
|
|
|
return val >= 0 ? val : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numActiveTinyAllocations() {
|
|
|
|
long val = numTinyAllocations() - numTinyDeallocations();
|
|
|
|
return val >= 0 ? val : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numActiveSmallAllocations() {
|
|
|
|
long val = numSmallAllocations() - numSmallDeallocations();
|
|
|
|
return val >= 0 ? val : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numActiveNormalAllocations() {
|
2016-03-14 09:09:24 +01:00
|
|
|
final long val;
|
|
|
|
synchronized (this) {
|
|
|
|
val = allocationsNormal - deallocationsNormal;
|
|
|
|
}
|
2015-05-13 17:15:06 +02:00
|
|
|
return val >= 0 ? val : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public long numActiveHugeAllocations() {
|
|
|
|
long val = numHugeAllocations() - numHugeDeallocations();
|
|
|
|
return val >= 0 ? val : 0;
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
protected abstract PoolChunk<T> newChunk(int pageSize, int maxOrder, int pageShifts, int chunkSize);
|
2012-12-19 09:35:32 +01:00
|
|
|
protected abstract PoolChunk<T> newUnpooledChunk(int capacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
protected abstract PooledByteBuf<T> newByteBuf(int maxCapacity);
|
|
|
|
protected abstract void memoryCopy(T src, int srcOffset, T dst, int dstOffset, int length);
|
|
|
|
protected abstract void destroyChunk(PoolChunk<T> chunk);
|
|
|
|
|
2015-05-13 17:15:06 +02:00
|
|
|
@Override
|
2012-12-05 22:11:48 +01:00
|
|
|
public synchronized String toString() {
|
2014-11-08 23:46:30 +01:00
|
|
|
StringBuilder buf = new StringBuilder()
|
|
|
|
.append("Chunk(s) at 0~25%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(qInit)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("Chunk(s) at 0~50%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(q000)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("Chunk(s) at 25~75%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(q025)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("Chunk(s) at 50~100%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(q050)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("Chunk(s) at 75~100%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(q075)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("Chunk(s) at 100%:")
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append(q100)
|
|
|
|
.append(StringUtil.NEWLINE)
|
|
|
|
.append("tiny subpages:");
|
2012-12-05 22:11:48 +01:00
|
|
|
for (int i = 1; i < tinySubpagePools.length; i ++) {
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T> head = tinySubpagePools[i];
|
|
|
|
if (head.next == head) {
|
2012-12-05 22:11:48 +01:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-11-08 23:46:30 +01:00
|
|
|
buf.append(StringUtil.NEWLINE)
|
|
|
|
.append(i)
|
|
|
|
.append(": ");
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T> s = head.next;
|
|
|
|
for (;;) {
|
|
|
|
buf.append(s);
|
|
|
|
s = s.next;
|
|
|
|
if (s == head) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
2014-11-08 23:46:30 +01:00
|
|
|
buf.append(StringUtil.NEWLINE)
|
|
|
|
.append("small subpages:");
|
2012-12-05 22:11:48 +01:00
|
|
|
for (int i = 1; i < smallSubpagePools.length; i ++) {
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T> head = smallSubpagePools[i];
|
|
|
|
if (head.next == head) {
|
2012-12-05 22:11:48 +01:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-11-08 23:46:30 +01:00
|
|
|
buf.append(StringUtil.NEWLINE)
|
|
|
|
.append(i)
|
|
|
|
.append(": ");
|
2013-03-05 15:55:41 +01:00
|
|
|
PoolSubpage<T> s = head.next;
|
|
|
|
for (;;) {
|
|
|
|
buf.append(s);
|
|
|
|
s = s.next;
|
|
|
|
if (s == head) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
buf.append(StringUtil.NEWLINE);
|
|
|
|
|
|
|
|
return buf.toString();
|
|
|
|
}
|
|
|
|
|
|
|
|
static final class HeapArena extends PoolArena<byte[]> {
|
|
|
|
|
|
|
|
HeapArena(PooledByteBufAllocator parent, int pageSize, int maxOrder, int pageShifts, int chunkSize) {
|
|
|
|
super(parent, pageSize, maxOrder, pageShifts, chunkSize);
|
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
@Override
|
|
|
|
boolean isDirect() {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
@Override
|
|
|
|
protected PoolChunk<byte[]> newChunk(int pageSize, int maxOrder, int pageShifts, int chunkSize) {
|
|
|
|
return new PoolChunk<byte[]>(this, new byte[chunkSize], pageSize, maxOrder, pageShifts, chunkSize);
|
|
|
|
}
|
|
|
|
|
2012-12-19 09:35:32 +01:00
|
|
|
@Override
|
|
|
|
protected PoolChunk<byte[]> newUnpooledChunk(int capacity) {
|
|
|
|
return new PoolChunk<byte[]>(this, new byte[capacity], capacity);
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
@Override
|
|
|
|
protected void destroyChunk(PoolChunk<byte[]> chunk) {
|
|
|
|
// Rely on GC.
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
protected PooledByteBuf<byte[]> newByteBuf(int maxCapacity) {
|
2015-10-09 21:03:03 +02:00
|
|
|
return HAS_UNSAFE ? PooledUnsafeHeapByteBuf.newUnsafeInstance(maxCapacity)
|
|
|
|
: PooledHeapByteBuf.newInstance(maxCapacity);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
protected void memoryCopy(byte[] src, int srcOffset, byte[] dst, int dstOffset, int length) {
|
|
|
|
if (length == 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
System.arraycopy(src, srcOffset, dst, dstOffset, length);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static final class DirectArena extends PoolArena<ByteBuffer> {
|
|
|
|
|
|
|
|
DirectArena(PooledByteBufAllocator parent, int pageSize, int maxOrder, int pageShifts, int chunkSize) {
|
|
|
|
super(parent, pageSize, maxOrder, pageShifts, chunkSize);
|
|
|
|
}
|
|
|
|
|
2014-03-01 15:47:03 +01:00
|
|
|
@Override
|
|
|
|
boolean isDirect() {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
@Override
|
|
|
|
protected PoolChunk<ByteBuffer> newChunk(int pageSize, int maxOrder, int pageShifts, int chunkSize) {
|
|
|
|
return new PoolChunk<ByteBuffer>(
|
|
|
|
this, ByteBuffer.allocateDirect(chunkSize), pageSize, maxOrder, pageShifts, chunkSize);
|
|
|
|
}
|
|
|
|
|
2012-12-19 09:35:32 +01:00
|
|
|
@Override
|
|
|
|
protected PoolChunk<ByteBuffer> newUnpooledChunk(int capacity) {
|
|
|
|
return new PoolChunk<ByteBuffer>(this, ByteBuffer.allocateDirect(capacity), capacity);
|
|
|
|
}
|
|
|
|
|
2012-12-05 22:11:48 +01:00
|
|
|
@Override
|
|
|
|
protected void destroyChunk(PoolChunk<ByteBuffer> chunk) {
|
2013-01-11 06:03:27 +01:00
|
|
|
PlatformDependent.freeDirectBuffer(chunk.memory);
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
protected PooledByteBuf<ByteBuffer> newByteBuf(int maxCapacity) {
|
2013-03-05 07:25:25 +01:00
|
|
|
if (HAS_UNSAFE) {
|
2013-06-10 12:52:56 +02:00
|
|
|
return PooledUnsafeDirectByteBuf.newInstance(maxCapacity);
|
2013-01-10 10:27:16 +01:00
|
|
|
} else {
|
2013-06-10 12:52:56 +02:00
|
|
|
return PooledDirectByteBuf.newInstance(maxCapacity);
|
2013-01-10 10:27:16 +01:00
|
|
|
}
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
protected void memoryCopy(ByteBuffer src, int srcOffset, ByteBuffer dst, int dstOffset, int length) {
|
|
|
|
if (length == 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-03-05 07:25:25 +01:00
|
|
|
if (HAS_UNSAFE) {
|
2013-01-10 10:27:16 +01:00
|
|
|
PlatformDependent.copyMemory(
|
|
|
|
PlatformDependent.directBufferAddress(src) + srcOffset,
|
|
|
|
PlatformDependent.directBufferAddress(dst) + dstOffset, length);
|
|
|
|
} else {
|
|
|
|
// We must duplicate the NIO buffers because they may be accessed by other Netty buffers.
|
|
|
|
src = src.duplicate();
|
|
|
|
dst = dst.duplicate();
|
|
|
|
src.position(srcOffset).limit(srcOffset + length);
|
|
|
|
dst.position(dstOffset);
|
|
|
|
dst.put(src);
|
|
|
|
}
|
2012-12-05 22:11:48 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|