1. Strong Reference
StrongReference 是 Java 的默认引用实现,它会尽可能长时间的存活于 JVM 内, 当没有任何对象指向它时Java GC 执行后将会被回收
- @Test
- public void strongReference() {
- Object referent = new Object();
- /**
- * 通过赋值创建 StrongReference
- */
- Object strongReference = referent;
- assertSame(referent, strongReference);
- referent = null;
- System.gc();
- /**
- * StrongReference 在 GC 后不会被回收
- */
- assertNotNull(strongReference);
- }
2. WeakReference & WeakHashMap
WeakReference, 顾名思义,是一个弱引用,当所引用的对象在 JVM 内不再有强引用时, Java GC 后 weak reference 将会被自动回收
- @Test
- public void weakReference() {
- Object referent = new Object();
- WeakReference<Object> weakRerference = new WeakReference<Object>(referent);
- assertSame(referent, weakRerference.get());
- referent = null;
- System.gc();
- /**
- * 一旦没有指向 referent 的强引用, weak reference 在 GC 后会被自动回收
- */
- assertNull(weakRerference.get());
- }
WeakHashMap 使用 WeakReference 作为 key, 一旦没有指向 key 的强引用, WeakHashMap 在Java GC 后将自动删除相关的 entry
- @Test
- public void weakHashMap() throws InterruptedException {
- Map<Object, Object> weakHashMap = new WeakHashMap<Object, Object>();
- Object key = new Object();
- Object value = new Object();
- weakHashMap.put(key, value);
- assertTrue(weakHashMap.containsValue(value));
- key = null;
- System.gc();
- /**
- * 等待无效 entries 进入 ReferenceQueue 以便下一次调用 getTable 时被清理
- */
- Thread.sleep(1000);
- /**
- * 一旦没有指向 key 的强引用, WeakHashMap 在 GC 后将自动删除相关的 entry
- */
- assertFalse(weakHashMap.containsValue(value));
- }
3. SoftReference
SoftReference 于 WeakReference 的特性基本一致, 最大的区别在于 SoftReference 会尽可能长的保留引用直到 JVM 内存不足时才会被回收(虚拟机保证), 这一特性使得 SoftReference 非常适合缓存应用
- @Test
- public void softReference() {
- Object referent = new Object();
- SoftReference<Object> softRerference = new SoftReference<Object>(referent);
- assertNotNull(softRerference.get());
- referent = null;
- System.gc();
- /**
- *soft references 只有在 jvm OutOfMemory 之前才会被回收, 所以它非常适合缓存应用
- */
- assertNotNull(softRerference.get());
- }
4. PhantomReference
作为本文主角, Phantom Reference(幽灵引用) 与 WeakReference 和 SoftReference 有很大的不同,因为它的 get() 方法永远返回 null, 这也正是它名字的由来
- @Test
- public void phantomReferenceAlwaysNull() {
- Object referent = new Object();
- PhantomReference<Object> phantomReference = new PhantomReference<Object>(referent, new ReferenceQueue<Object>());
- /**
- * phantom reference 的 get 方法永远返回 null
- */
- assertNull(phantomReference.get());
- }
诸位可能要问, 一个永远返回 null 的 reference 要来何用,请注意构造 PhantomReference 时的第二个参数 ReferenceQueue(事实上 WeakReference & SoftReference 也可以有这个参数),
PhantomReference 唯一的用处就是跟踪 referent何时被 enqueue 到 ReferenceQueue 中.
5. RererenceQueue
当一个 WeakReference 开始返回 null 时, 它所指向的对象已经准备被回收, 这时可以做一些合适的清理工作. 将一个 ReferenceQueue 传给一个 Reference 的构造函数, 当对象被回收时, 虚拟机会自动将这个对象插入到 ReferenceQueue 中, WeakHashMap 就是利用 ReferenceQueue 来清除 key 已经没有强引用的 entries.
- @Test
- public void referenceQueue() throws InterruptedException {
- Object referent = new Object();
- ReferenceQueue<Object> referenceQueue = new ReferenceQueue<Object>();
- WeakReference<Object> weakReference = new WeakReference<Object>(referent, referenceQueue);
- assertFalse(weakReference.isEnqueued());
- Reference<? extends Object> polled = referenceQueue.poll();
- assertNull(polled);
- referent = null;
- System.gc();
- assertTrue(weakReference.isEnqueued());
- Reference<? extends Object> removed = referenceQueue.remove();
- assertNotNull(removed);
- }
6.PhantomReferencevs WeakReference
PhantomReference有两个好处, 其一, 它可以让我们准确地知道对象何时被从内存中删除, 这个特性可以被用于一些特殊的需求中(例如 Distributed GC,XWork 和 google-guice 中也使用 PhantomReference 做了一些清理性工作).
其二, 它可以避免 finalization 带来的一些根本性问题, 上文提到 PhantomReference 的唯一作用就是跟踪 referent 何时被 enqueue 到 ReferenceQueue 中,但是 WeakReference 也有对应的功能, 两者的区别到底在哪呢 ?
这就要说到 Object 的 finalize 方法, 此方法将在 gc 执行前被调用, 如果某个对象重载了 finalize 方法并故意在方法内创建本身的强引用,这将导致这一轮的 GC 无法回收这个对象并有可能
引起任意次 GC, 最后的结果就是明明 JVM 内有很多 Garbage 却 OutOfMemory, 使用 PhantomReference 就可以避免这个问题, 因为 PhantomReference 是在 finalize 方法执行后回收的,也就意味着此时已经不可能拿到原来的引用,也就不会出现上述问题,当然这是一个很极端的例子, 一般不会出现.
7. 对比
Soft vs Weak vs Phantom References | ||||
---|---|---|---|---|
Type | Purpose | Use | When GCed | Implementing Class |
Strong Reference | An ordinary reference. Keeps objects alive as long as they are referenced. | normal reference. | Any object not pointed to can be reclaimed. | default |
Soft Reference | Keeps objects alive provided there’s enough memory. | to keep objects alive even after clients have removed their references (memory-sensitive caches), in case clients start asking for them again by key. | After a first gc pass, the JVM decides it still needs to reclaim more space. | java.lang.ref.SoftReference |
Weak Reference | Keeps objects alive only while they’re in use (reachable) by clients. | Containers that automatically delete objects no longer in use. | After gc determines the object is only weakly reachable | java.lang.ref.WeakReference java.util.WeakHashMap |
Phantom Reference | Lets you clean up after finalization but before the space is reclaimed (replaces or augments the use offinalize()) | Special clean up processing | After finalization. | java.lang.ref.PhantomReference |
GC、 Reference 与 ReferenceQueue 的交互
3、软引用和弱引用在添加到 ReferenceQueue 的时候,其指向真实内存的引用已经被置为空了,相关的内存也已经被释放掉了。而虚引用在添加到 ReferenceQueue 的时候,内存还没有释放,仍然可以对其进行访问。
- String str = new String( " hello " ); // ①
- ReferenceQueue < String > rq = new ReferenceQueue < String > (); // ②
- WeakReference < String > wf = new WeakReference < String > (str, rq); // ③
- str = null ; // ④取消"hello"对象的强引用
- String str1 = wf.get(); // ⑤假如"hello"对象没有被回收,str1引用"hello"对象
- // 假如"hello"对象没有被回收,rq.poll()返回null
- Reference <? extends String > ref = rq.poll(); // ⑥
在以上代码中,注意⑤⑥两处地方。假如“hello ”对象没有被回收 wf.get() 将返回“ hello ”字符串对象, rq.poll() 返回 null ;而加入“ hello ”对象已经被回收了,那么 wf.get() 返回 null , rq.poll() 返回 Reference 对象,但是此 Reference 对象中已经没有 str 对象的引用了 ( PhantomReference 则与WeakReference 、 SoftReference 不同 )。
引用机制与复杂数据结构的联合应用
了解了GC 机制、引用机制,并配合上 ReferenceQueue ,我们就可以实现一些防止内存溢出的复杂数据类型。
例如,SoftReference 具有构建 Cache 系统的特质,因此我们可以结合哈希表实现一个简单的缓存系统。这样既能保证能够尽可能多的缓存信息,又可以保证 Java 虚拟机不会因为内存泄露而抛出 OutOfMemoryError 。这种缓存机制特别适合于内存对象生命周期长,且生成内存对象的耗时比较长的情况,例如缓存列表封面图片等。对于一些生命周期较长,但是生成内存对象开销不大的情况,使用WeakReference 能够达到更好的内存管理的效果。
附SoftHashmap 的源码一份,相信看过之后,大家会对 Reference 机制的应用有更深入的理解。
- package com. *** .widget;
- // : SoftHashMap.java
- import java.util. * ;
- import java.lang.ref. * ;
- import android.util.Log;
- public class SoftHashMap extends AbstractMap {
- /** The internal HashMap that will hold the SoftReference. */
- private final Map hash = new HashMap();
- /** The number of "hard" references to hold internally. */
- private final int HARD_SIZE;
- /** The FIFO list of hard references, order of last access. */
- private final LinkedList hardCache = new LinkedList();
- /** Reference queue for cleared SoftReference objects. */
- private ReferenceQueue queue = new ReferenceQueue();
- // Strong Reference number
- public SoftHashMap() { this ( 100 ); }
- public SoftHashMap( int hardSize) { HARD_SIZE = hardSize; }
- public Object get(Object key) {
- Object result = null ;
- // We get the SoftReference represented by that key
- SoftReference soft_ref = (SoftReference)hash.get(key);
- if (soft_ref != null ) {
- // From the SoftReference we get the value, which can be
- // null if it was not in the map, or it was removed in
- // the processQueue() method defined below
- result = soft_ref.get();
- if (result == null ) {
- // If the value has been garbage collected, remove the
- // entry from the HashMap.
- hash.remove(key);
- } else {
- // We now add this object to the beginning of the hard
- // reference queue. One reference can occur more than
- // once, because lookups of the FIFO queue are slow, so
- // we don't want to search through it each time to remove
- // duplicates.
- // keep recent use object in memory
- hardCache.addFirst(result);
- if (hardCache.size() > HARD_SIZE) {
- // Remove the last entry if list longer than HARD_SIZE
- hardCache.removeLast();
- }
- }
- }
- return result;
- }
- /** We define our own subclass of SoftReference which contains
- not only the value but also the key to make it easier to find
- the entry in the HashMap after it's been garbage collected. */
- private static class SoftValue extends SoftReference {
- private final Object key; // always make data member final
- /** Did you know that an outer class can access private data
- members and methods of an inner class? I didn't know that!
- I thought it was only the inner class who could access the
- outer class's private information. An outer class can also
- access private members of an inner class inside its inner
- class. */
- private SoftValue(Object k, Object key, ReferenceQueue q) {
- super (k, q);
- this .key = key;
- }
- }
- /** Here we go through the ReferenceQueue and remove garbage
- collected SoftValue objects from the HashMap by looking them
- up using the SoftValue.key data member. */
- public void processQueue() {
- SoftValue sv;
- while ((sv = (SoftValue)queue.poll()) != null ) {
- if (sv.get() == null ) {
- Log.e( " processQueue " , " null " );
- } else {
- Log.e( " processQueue " , " Not null " );
- }
- hash.remove(sv.key); // we can access private data!
- Log.e( " SoftHashMap " , " release " + sv.key);
- }
- }
- /** Here we put the key, value pair into the HashMap using
- a SoftValue object. */
- public Object put(Object key, Object value) {
- processQueue(); // throw out garbage collected values first
- Log.e( " SoftHashMap " , " put into " + key);
- return hash.put(key, new SoftValue(value, key, queue));
- }
- public Object remove(Object key) {
- processQueue(); // throw out garbage collected values first
- return hash.remove(key);
- }
- public void clear() {
- hardCache.clear();
- processQueue(); // throw out garbage collected values
- hash.clear();
- }
- public int size() {
- processQueue(); // throw out garbage collected values first
- return hash.size();
- }
- public Set entrySet() {
- // no, no, you may NOT do that!!! GRRR
- throw new UnsupportedOperationException();
- }
- }
Java GC小结
一般的应用程序不会涉及到 Reference 编程, 但是了解这些知识会对理解Java GC 的工作原理以及性能调优有一定帮助, 在实现一些基础性设施比如缓存时也可能会用到, 希望本文能有所帮助.
原文链接:http://henryyang.iteye.com/blog/1188328