mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-18 18:14:38 +02:00
8260621: (jrtfs) ThreadLocal memory leak in ImageBufferCache when using jrtfs
Reviewed-by: jlaskey, vtewari
This commit is contained in:
parent
82768d9a31
commit
c9873c416d
1 changed files with 50 additions and 27 deletions
|
@ -26,8 +26,10 @@ package jdk.internal.jimage;
|
||||||
|
|
||||||
import java.lang.ref.WeakReference;
|
import java.lang.ref.WeakReference;
|
||||||
import java.nio.ByteBuffer;
|
import java.nio.ByteBuffer;
|
||||||
|
import java.util.AbstractMap;
|
||||||
import java.util.Arrays;
|
import java.util.Arrays;
|
||||||
import java.util.Comparator;
|
import java.util.Comparator;
|
||||||
|
import java.util.Map;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* @implNote This class needs to maintain JDK 8 source compatibility.
|
* @implNote This class needs to maintain JDK 8 source compatibility.
|
||||||
|
@ -39,12 +41,31 @@ import java.util.Comparator;
|
||||||
class ImageBufferCache {
|
class ImageBufferCache {
|
||||||
private static final int MAX_CACHED_BUFFERS = 3;
|
private static final int MAX_CACHED_BUFFERS = 3;
|
||||||
private static final int LARGE_BUFFER = 0x10000;
|
private static final int LARGE_BUFFER = 0x10000;
|
||||||
private static final ThreadLocal<BufferReference[]> CACHE =
|
|
||||||
new ThreadLocal<BufferReference[]>() {
|
/*
|
||||||
|
* We used to have a class BufferReference extending from WeakReference<ByteBuffer>.
|
||||||
|
* BufferReference class had an instance field called "capacity". This field was
|
||||||
|
* used to make DECREASING_CAPACITY_NULLS_LAST comparator stable in the presence
|
||||||
|
* of GC clearing the WeakReference concurrently.
|
||||||
|
*
|
||||||
|
* But this scheme results in metaspace leak. The thread local is alive till the
|
||||||
|
* the thread is alive. And so ImageBufferCache$BufferReference class was kept alive.
|
||||||
|
* Because this class and ImageBufferCache$BufferReference are all loaded by a URL
|
||||||
|
* class loader from jrt-fs.jar, the class loader and so all the classes loaded by it
|
||||||
|
* were alive!
|
||||||
|
*
|
||||||
|
* Solution is to avoid using a URL loader loaded class type with thread local. All we
|
||||||
|
* need is a pair of WeakReference<ByteBuffer>, Integer (saved capacity for stability
|
||||||
|
* of comparator). We use Map.Entry as pair implementation. With this, all types used
|
||||||
|
* with thread local are bootstrap types and so no metaspace leak.
|
||||||
|
*/
|
||||||
|
@SuppressWarnings("unchecked")
|
||||||
|
private static final ThreadLocal<Map.Entry<WeakReference<ByteBuffer>, Integer>[]> CACHE =
|
||||||
|
new ThreadLocal<Map.Entry<WeakReference<ByteBuffer>, Integer>[]>() {
|
||||||
@Override
|
@Override
|
||||||
protected BufferReference[] initialValue() {
|
protected Map.Entry<WeakReference<ByteBuffer>, Integer>[] initialValue() {
|
||||||
// 1 extra slot to simplify logic of releaseBuffer()
|
// 1 extra slot to simplify logic of releaseBuffer()
|
||||||
return new BufferReference[MAX_CACHED_BUFFERS + 1];
|
return (Map.Entry<WeakReference<ByteBuffer>, Integer>[])new Map.Entry<?,?>[MAX_CACHED_BUFFERS + 1];
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
@ -62,15 +83,15 @@ class ImageBufferCache {
|
||||||
if (size > LARGE_BUFFER) {
|
if (size > LARGE_BUFFER) {
|
||||||
result = allocateBuffer(size);
|
result = allocateBuffer(size);
|
||||||
} else {
|
} else {
|
||||||
BufferReference[] cache = CACHE.get();
|
Map.Entry<WeakReference<ByteBuffer>, Integer>[] cache = CACHE.get();
|
||||||
|
|
||||||
// buffers are ordered by decreasing capacity
|
// buffers are ordered by decreasing capacity
|
||||||
// cache[MAX_CACHED_BUFFERS] is always null
|
// cache[MAX_CACHED_BUFFERS] is always null
|
||||||
for (int i = MAX_CACHED_BUFFERS - 1; i >= 0; i--) {
|
for (int i = MAX_CACHED_BUFFERS - 1; i >= 0; i--) {
|
||||||
BufferReference reference = cache[i];
|
Map.Entry<WeakReference<ByteBuffer>, Integer> reference = cache[i];
|
||||||
|
|
||||||
if (reference != null) {
|
if (reference != null) {
|
||||||
ByteBuffer buffer = reference.get();
|
ByteBuffer buffer = getByteBuffer(reference);
|
||||||
|
|
||||||
if (buffer != null && size <= buffer.capacity()) {
|
if (buffer != null && size <= buffer.capacity()) {
|
||||||
cache[i] = null;
|
cache[i] = null;
|
||||||
|
@ -96,40 +117,42 @@ class ImageBufferCache {
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
BufferReference[] cache = CACHE.get();
|
Map.Entry<WeakReference<ByteBuffer>, Integer>[] cache = CACHE.get();
|
||||||
|
|
||||||
// expunge cleared BufferRef(s)
|
// expunge cleared BufferRef(s)
|
||||||
for (int i = 0; i < MAX_CACHED_BUFFERS; i++) {
|
for (int i = 0; i < MAX_CACHED_BUFFERS; i++) {
|
||||||
BufferReference reference = cache[i];
|
Map.Entry<WeakReference<ByteBuffer>, Integer> reference = cache[i];
|
||||||
if (reference != null && reference.get() == null) {
|
if (reference != null && getByteBuffer(reference) == null) {
|
||||||
cache[i] = null;
|
cache[i] = null;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// insert buffer back with new BufferRef wrapping it
|
// insert buffer back with new BufferRef wrapping it
|
||||||
cache[MAX_CACHED_BUFFERS] = new BufferReference(buffer);
|
cache[MAX_CACHED_BUFFERS] = newCacheEntry(buffer);
|
||||||
Arrays.sort(cache, DECREASING_CAPACITY_NULLS_LAST);
|
Arrays.sort(cache, DECREASING_CAPACITY_NULLS_LAST);
|
||||||
// squeeze the smallest one out
|
// squeeze the smallest one out
|
||||||
cache[MAX_CACHED_BUFFERS] = null;
|
cache[MAX_CACHED_BUFFERS] = null;
|
||||||
}
|
}
|
||||||
|
|
||||||
private static Comparator<BufferReference> DECREASING_CAPACITY_NULLS_LAST =
|
private static Map.Entry<WeakReference<ByteBuffer>, Integer> newCacheEntry(ByteBuffer bb) {
|
||||||
new Comparator<BufferReference>() {
|
return new AbstractMap.SimpleEntry<WeakReference<ByteBuffer>, Integer>(
|
||||||
|
new WeakReference<ByteBuffer>(bb), bb.capacity());
|
||||||
|
}
|
||||||
|
|
||||||
|
private static int getCapacity(Map.Entry<WeakReference<ByteBuffer>, Integer> e) {
|
||||||
|
return e == null? 0 : e.getValue();
|
||||||
|
}
|
||||||
|
|
||||||
|
private static ByteBuffer getByteBuffer(Map.Entry<WeakReference<ByteBuffer>, Integer> e) {
|
||||||
|
return e == null? null : e.getKey().get();
|
||||||
|
}
|
||||||
|
|
||||||
|
private static Comparator<Map.Entry<WeakReference<ByteBuffer>, Integer>> DECREASING_CAPACITY_NULLS_LAST =
|
||||||
|
new Comparator<Map.Entry<WeakReference<ByteBuffer>, Integer>>() {
|
||||||
@Override
|
@Override
|
||||||
public int compare(BufferReference br1, BufferReference br2) {
|
public int compare(Map.Entry<WeakReference<ByteBuffer>, Integer> br1,
|
||||||
return Integer.compare(br2 == null ? 0 : br2.capacity,
|
Map.Entry<WeakReference<ByteBuffer>, Integer> br2) {
|
||||||
br1 == null ? 0 : br1.capacity);
|
return Integer.compare(getCapacity(br1), getCapacity(br2));
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
private static class BufferReference extends WeakReference<ByteBuffer> {
|
|
||||||
// saved capacity so that DECREASING_CAPACITY_NULLS_LAST comparator
|
|
||||||
// is stable in the presence of GC clearing the WeakReference concurrently
|
|
||||||
final int capacity;
|
|
||||||
|
|
||||||
BufferReference(ByteBuffer buffer) {
|
|
||||||
super(buffer);
|
|
||||||
capacity = buffer.capacity();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue