Java Reference核心原理分析

{"type":"doc","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"带着问题,看源码针对性会更强一点、印象会更深刻、并且效果也会更好。所以我先卖个关子,提两个问题(没准下次跳槽时就被问到)。"}]},{"type":"bulletedlist","content":[{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"我们可以用ByteBuffer的allocateDirect方法,申请一块堆外内存创建一个DirectByteBuffer对象,然后利用它去操作堆外内存。这些申请完的堆外内存,我们可以回收吗?可以的话是通过什么样的机制回收的?"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"大家应该都知道WeakHashMap可以用来实现内存相对敏感的本地缓存,为什么WeakHashMap合适这种业务场景,其内部实现会做什么特殊处理呢?"}]}]}]},{"type":"heading","attrs":{"align":null,"level":1},"content":[{"type":"text","text":"GC可到达性与JDK中Reference类型"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"上面提到的两个问题,其答案都在JDK的Reference里面。JDK早期版本中并没有Reference相关的类,这导致对象被GC回收后如果想做一些额外的清理工作(比如socket、堆外内存等)是无法实现的,同样如果想要根据堆内存的实际使用情况决定要不要去清理一些内存敏感的对象也是法实现的。为此JDK1.2中引入的Reference相关的类,即今天要介绍的Reference、SoftReference、WeakReference、PhantomReference,还有与之相关的Cleaner、ReferenceQueue、ReferenceHandler等。与Reference相关核心类基本都在java.lang.ref包下面。其类关系如下:"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/4a/4ad1ea5f8488ba94c74f0c0deedbfaa4.png","alt":"reference.png","title":null,"style":null,"href":null,"fromPaste":true,"pastePass":true}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"其中,SoftReference代表软引用对象,垃圾回收器会根据内存需求酌情回收软引用指向的对象。普通的GC并不会回收软引用,只有在即将OOM的时候(也就是最后一次Full GC)如果被引用的对象只有SoftReference指向的引用,才会回收。WeakReference代表弱引用对象,当发生GC时,如果被引用的对象只有WeakReference指向的引用,就会被回收。PhantomReference代表虚引用对象(也有叫幻象引用的,个人认为还是虚引用更加贴切),其是一种特殊的引用类型,不能通过虚引用获取到其关联的对象,但当GC时如果其引用的对象被回收,这个事件程序可以感知,这样我们可以做相应的处理。最后就是最常见强引用对象,也就是通常我们new出来的对象。在继续介绍Reference相关类的源码前,先来简单的看一下GC如何决定一个对象是否可被回收。其基本思路是从GC Root开始向下搜索,如果对象与GC Root之间存在引用链,则对象是可达的,GC会根据是否可到达与可到达性决定对象是否可以被回收。而对象的可达性与引用类型密切相关,对象的可到达性可分为5种。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"强可到达,如果从GC Root搜索后,发现对象与GC Root之间存在强引用链则为强可到达。强引用链即有强引用对象,引用了该对象。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"软可到达,如果从GC Root搜索后,发现对象与GC Root之间不存在强引用链,但存在软引用链,则为软可到达。软引用链即有软引用对象,引用了该对象。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"弱可到达,如果从GC Root搜索后,发现对象与GC Root之间不存在强引用链与软引用链,但有弱引用链,则为弱可到达。弱引用链即有弱引用对象,引用了该对象。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"虚可到达,如果从GC Root搜索后,发现对象与GC Root之间只存在虚引用链则为虚可到达。虚引用链即有虚引用对象,引用了该对象。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"不可达,如果从GC Root搜索后,找不到对象与GC Root之间的引用链,则为不可到达。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"看一个简单的列子:"}]},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/8b/8b60c7e32ba011ba09aec69a613b0fe4.png","alt":"objectReach.png","title":null,"style":null,"href":null,"fromPaste":true,"pastePass":true}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"ObjectA为强可到达,ObjectB也为强可到达,虽然ObjectB对象被SoftReference ObjcetE 引用但由于其还被ObjectA引用所以为强可到达;而ObjectC和ObjectD为弱引用达到,虽然ObjectD对象被PhantomReference ObjcetG引用但由于其还被ObjectC引用,而ObjectC又为弱引用达到,所以ObjectD为弱引用达到;而ObjectH与ObjectI是不可到达。引用链的强弱有关系依次是 强引用 > 软引用 > 弱引用 > 虚引用,如果有更强的引用关系存在,那么引用链到达性,将由更强的引用有关系决定。"}]},{"type":"heading","attrs":{"align":null,"level":1},"content":[{"type":"text","text":"Reference核心处理流程"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"JVM在GC时如果当前对象只被Reference对象引用,JVM会根据Reference具体类型与堆内存的使用情况决定是否把对应的Reference对象加入到一个由Reference构成的pending链表上,如果能加入pending链表JVM同时会通知ReferenceHandler线程进行处理。ReferenceHandler线程是在Reference类被初始化时调用的,其是一个守护进程并且拥有最高的优先级。Reference类静态初始化块代码如下:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"static {\n //省略部分代码...\n Thread handler = new ReferenceHandler(tg, \"Reference Handler\");\n handler.setPriority(Thread.MAX_PRIORITY);\n handler.setDaemon(true);\n handler.start();\n //省略部分代码...\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"而ReferenceHandler线程内部的run方法会不断地从Reference构成的pending链表上获取Reference对象,如果能获取则根据Reference的具体类型进行不同的处理,不能则调用wait方法等待GC回收对象处理pending链表的通知。ReferenceHandler线程run方法源码:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"public void run() {\n //死循环,线程启动后会一直运行\n while (true) {\n tryHandlePending(true);\n }\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"run内部调用的tryHandlePending源码:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"static boolean tryHandlePending(boolean waitForNotify) {\n Reference r;\n Cleaner c;\n try {\n synchronized (lock) {\n if (pending != null) {\n r = pending;\n //instanceof 可能会抛出OOME,所以在将r从pending链上断开前,做这个处理\n c = r instanceof Cleaner ? (Cleaner) r : null;\n //将将r从pending链上断开\n pending = r.discovered;\n r.discovered = null;\n } else {\n //等待CG后的通知\n if (waitForNotify) {\n lock.wait();\n }\n //重试\n return waitForNotify;\n }\n }\n } catch (OutOfMemoryError x) {\n //当抛出OOME时,放弃CPU的运行时间,这样有希望收回一些存活的引用并且GC能回收部分空间。同时能避免频繁地自旋重试,导致连续的OOME异常\n Thread.yield();\n //重试\n return true;\n } catch (InterruptedException x) {\n //重试\n return true;\n }\n //如果是Cleaner类型的Reference调用其clean方法并退出\n if (c != null) {\n c.clean();\n return true;\n }\n ReferenceQueue super Object> q = r.queue;\n //如果Reference有注册ReferenceQueue,则处理pending指向的Reference结点将其加入ReferenceQueue中\n if (q != ReferenceQueue.NULL) q.enqueue(r);\n return true;\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"上面tryHandlePending方法中比较重要的点是c.clean()与q.enqueue®,这个是文章最开始提到的两个问题答案的入口。Cleaner的clean方法用于完成清理工作,而ReferenceQueue是将被回收对象加入到对应的Reference列队中,等待其他线程的后继处理。更具体地关于Cleaner与ReferenceQueue后面会再详细说明。Reference的核心处理流程可总结如下:"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/58/58765255eb1b5e1a687d22d730c5eaed.png","alt":"reference处理流程.png","title":null,"style":null,"href":null,"fromPaste":true,"pastePass":true}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"对Reference的核心处理流程有整体了解后,再来回过头细看一下Reference类的源码。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"/* Reference实例有四种内部的状态\n * Active: 新创建Reference的实例其状态为Active。当GC检测到Reference引用的referent可达到状态发生改变时,\n * 为改变Reference的状态为Pending或Inactive。这个取决于创建Reference实例时是否注册过ReferenceQueue。\n * 注册过其状态会转换为Pending,同时GC会将其加入pending-Reference链表中,否则为转换为Inactive状态。\n * Pending: 代表Reference是pending-Reference链表的成员,等待ReferenceHandler线程调用Cleaner#clean\n * 或ReferenceQueue#enqueue操作。未注册过ReferenceQueue的实例不会达到这个状态\n * Enqueued: Reference实例成为其被创建时注册过的ReferenceQueue的成员,代表已入队列。当其从ReferenceQueue\n * 中移除后,其状态会变为Inactive。\n * Inactive: 什么也不会做,一旦处理该状态,就不可再转换。\n * 不同状态时,Reference对应的queue与成员next变量值(next可理解为ReferenceQueue中的下个结点的引用)如下:\n * Active: queue为Reference实例被创建时注册的ReferenceQueue,如果没注册为Null。此时,next为null,\n * Reference实例与queue真正产生关系。\n * Pending: queue为Reference实例被创建时注册的ReferenceQueue。next为当前实例本身。\n * Enqueued: queue为ReferenceQueue.ENQUEUED代表当前实例已入队列。next为queue中的下一实列结点,\n * 如果是queue尾部则为当前实例本身\n * Inactive: queue为ReferenceQueue.NULL,当前实例已从queue中移除与queue无关联。next为当前实例本身。\n */\npublic abstract class Reference {\n// Reference 引用的对象\nprivate T referent;\n/* Reference注册的queue用于ReferenceHandler线程入队列处理与用户线程取Reference处理。\n * 其取值会根据Reference不同状态发生改变,具体取值见上面的分析\n */\nvolatile ReferenceQueue super T> queue;\n// 可理解为注册的queue中的下一个结点的引用。其取值会根据Reference不同状态发生改变,具体取值见上面的分析\nvolatile Reference next;\n/* 其由VM维护,取值会根据Reference不同状态发生改变,\n * 状态为active时,代表由GC维护的discovered-Reference链表的下个节点,如果是尾部则为当前实例本身\n * 状态为pending时,代表pending-Reference的下个节点的引用。否则为null\n */\ntransient private Reference discovered;\n/* pending-Reference 链表头指针,GC回收referent后会将Reference加pending-Reference链表。\n * 同时ReferenceHandler线程会获取pending指针,不为空时Cleaner.clean()或入列queue。\n * pending-Reference会采用discovered引用接链表的下个节点。\n */\nprivate static Reference pending = null;\n// 可理解为注册的queue中的下一个结点的引用。其取值会根据Reference不同状态发生改变,具体取值见上面的分析\nvolatile Reference next;\n//用于CG同步Reference成员变量值的对象。\nstatic private class Lock { }\nprivate static Lock lock = new Lock();\n//省略部分代码...\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"上面解释了Reference中的主要成员的作用,其中比较重要是Reference内部维护的不同状态,其状态不同成员变量queue、pending、discovered、next的取值都会发生变化。Reference的主要方法如下:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"//构造函数,指定引用的对象referent\nReference(T referent) {\n this(referent, null);\n}\n//构造函数,指定引用的对象referent与注册的queue\nReference(T referent, ReferenceQueue super T> queue) {\n this.referent = referent;\n this.queue = (queue == null) ? ReferenceQueue.NULL : queue;\n}\n//获取引用的对象referent\npublic T get() {\n return this.referent;\n}\n//将当前对象加入创建时注册的queue中\npublic boolean enqueue() {\n return this.queue.enqueue(this);\n}\n"}]},{"type":"heading","attrs":{"align":null,"level":1},"content":[{"type":"text","text":"ReferenecQueue与Cleaner源码分析"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"先来看下ReferenceQueue的主要成员变量的含义。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"//代表Reference的queue为null。Null为ReferenceQueue子类\nstatic ReferenceQueue NULL = new Null<>();\n//代表Reference已加入当前ReferenceQueue中。\nstatic ReferenceQueue ENQUEUED = new Null<>();\n//用于同步的对象\nprivate Lock lock = new Lock();\n//当前ReferenceQueue中的头节点\nprivate volatile Reference extends T> head = null;\n//ReferenceQueue的长度\nprivate long queueLength = 0;\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"ReferenceQueue中比较重要的方法为enqueue、poll、remove方法。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"//入列队enqueue方法,只被Reference类调用,也就是上面分析中ReferenceHandler线程为调用\nboolean enqueue(Reference extends T> r) {\n\t//获取同步对象lock对应的监视器对象\n synchronized (lock) {\n //获取r关联的ReferenceQueue,如果创建r时未注册ReferenceQueue则为NULL,同样如果r已从ReferenceQueue中移除其也为null\n ReferenceQueue> queue = r.queue;\n //判断queue是否为NULL 或者 r已加入ReferenceQueue中,是的话则入队列失败\n if ((queue == NULL) || (queue == ENQUEUED)) {\n return false;\n }\n assert queue == this;\n //设置r的queue为已入队列\n r.queue = ENQUEUED;\n //如果ReferenceQueue头节点为null则r的next节点指向当前节点,否则指向头节点\n r.next = (head == null) ? r : head;\n //更新ReferenceQueue头节点\n head = r;\n //列队长度加1\n queueLength++;\n //为FinalReference类型引用增加FinalRefCount数量\n if (r instanceof FinalReference) {\n sun.misc.VM.addFinalRefCount(1);\n }\n //通知remove操作队列有节点\n lock.notifyAll();\n return true;\n }\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"poll方法源码相对简单,其就是从ReferenceQueue的头节点获取Reference。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"public Reference extends T> poll() {\n //头结点为null直接返回,代表Reference还没有加入ReferenceQueue中\n if (head == null)\n return null;\n //获取同步对象lock对应的监视器对象\n synchronized (lock) {\n return reallyPoll();\n }\n}\n//从队列中真正poll元素的方法\nprivate Reference extends T> reallyPoll() {\n Reference extends T> r = head;\n //double check 头节点不为null\n if (r != null) {\n \t//保存头节点的下个节点引用\n Reference extends T> rn = r.next;\n //更新queue头节点引用\n head = (rn == r) ? null : rn;\n //更新Reference的queue值,代表r已从队列中移除\n\t\tr.queue = NULL;\n\t\t//更新Reference的next为其本身\n r.next = r;\n queueLength--;\n //为FinalReference节点FinalRefCount数量减1\n if (r instanceof FinalReference) {\n sun.misc.VM.addFinalRefCount(-1);\n }\n //返回获取的节点\n return r;\n }\n return null;\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"remove方法的源码如下:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"public Reference extends T> remove(long timeout) throws IllegalArgumentException, InterruptedException {\n if (timeout < 0) {\n throw new IllegalArgumentException(\"Negative timeout value\");\n }\n //获取同步对象lock对应的监视器对象\n synchronized (lock) {\n \t//获取队列头节点指向的Reference\n Reference extends T> r = reallyPoll();\n //获取到返回\n if (r != null) return r;\n long start = (timeout == 0) ? 0 : System.nanoTime();\n //在timeout时间内尝试重试获取\n for (;;) {\n \t//等待队列上有结点通知\n lock.wait(timeout);\n //获取队列中的头节点指向的Reference\n r = reallyPoll();\n //获取到返回\n if (r != null) return r;\n if (timeout != 0) {\n long end = System.nanoTime();\n timeout -= (end - start) / 1000_000;\n //已超时但还没有获取到队列中的头节点指向的Reference返回null\n if (timeout <= 0) return null;\n start = end;\n }\n }\n }\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"简单的分析完ReferenceQueue的源码后,再来整体回顾一下Reference的核心处理流程。JVM在GC时如果当前对象只被Reference对象引用,JVM会根据Reference具体类型与堆内存的使用情况决定是否把对应的Reference对象加入到一个由Reference构成的pending链表上,如果能加入pending链表JVM同时会通知ReferenceHandler线程进行处理。ReferenceHandler线程收到通知后会调用Cleaner#clean或ReferenceQueue#enqueue方法进行处理。如果引用当前对象的Reference类型为WeakReference且堆内存不足,那么JVM就会把WeakReference加入到pending-Reference链表上,然后ReferenceHandler线程收到通知后会异步地做入队列操作。而我们的应用程序中的线程便可以不断地去拉取ReferenceQueue中的元素来感知JVM的堆内存是否出现了不足的情况,最终达到根据堆内存的情况来做一些处理的操作。实际上WeakHashMap低层便是过通上述过程实现的,只不过实现细节上有所偏差,这个后面再分析。再来看看ReferenceHandler线程收到通知后可能会调用的另外一个类Cleaner的实现。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"同样先看一下Cleaner的成员变量,再看主要的方法实现。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"//继承了PhantomReference类也就是虚引用,PhantomReference源码很简单只是重写了get方法返回null\npublic class Cleaner extends PhantomReference {\n\t/* 虚队列,命名很到位。之前说CG把ReferenceQueue加入pending-Reference链中后,ReferenceHandler线程在处理时\n * 是不会将对应的Reference加入列队的,而是调用Cleaner.clean方法。但如果Reference不注册ReferenceQueue,GC处理时\n * 又无法把他加入到pending-Reference链中,所以Cleaner里面有了一个dummyQueue成员变量。\n */\n private static final ReferenceQueue dummyQueue = new ReferenceQueue();\n //Cleaner链表的头结点\n private static Cleaner first = null;\n //当前Cleaner节点的后续节点\n private Cleaner next = null;\n //当前Cleaner节点的前续节点\n private Cleaner prev = null;\n //真正执行清理工作的Runnable对象,实际clean内部调用thunk.run()方法\n private final Runnable thunk;\n //省略部分代码...\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"从上面的成变量分析知道Cleaner实现了双向链表的结构。先看构造函数与clean方法。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"//私有方法,不能直接new\nprivate Cleaner(Object var1, Runnable var2) {\n super(var1, dummyQueue);\n this.thunk = var2;\n}\n//创建Cleaner对象,同时加入Cleaner链中。\npublic static Cleaner create(Object var0, Runnable var1) {\n return var1 == null ? null : add(new Cleaner(var0, var1));\n}\n//头插法将新创意的Cleaner对象加入双向链表,synchronized保证同步\nprivate static synchronized Cleaner add(Cleaner var0) {\n if (first != null) {\n var0.next = first;\n first.prev = var0;\n }\n //更新头节点引用\n first = var0;\n return var0;\n}\n\npublic void clean() {\n\t//从Cleaner链表中先移除当前节点\n if (remove(this)) {\n try {\n \t//调用thunk.run()方法执行对应清理逻辑\n this.thunk.run();\n } catch (final Throwable var2) {\n //省略部分代码..\n }\n\n }\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"可以看到Cleaner的实现还是比较简单,Cleaner实现为PhantomReference类型的引用。当JVM GC时如果发现当前处理的对象只被PhantomReference类型对象引用,同之前说的一样其会将该Reference加pending-Reference链中上,只是ReferenceHandler线程在处理时如果PhantomReference类型实际类型又是Cleaner的话。其就是调用Cleaner.clean方法做清理逻辑处理。Cleaner实际是DirectByteBuffer分配的堆外内存收回的实现,具体见下面的分析。"}]},{"type":"heading","attrs":{"align":null,"level":1},"content":[{"type":"text","text":"DirectByteBuffer堆外内存回收与WeakHashMap敏感内存回收"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"绕开了一大圈终于回到了文章最开始提到的两个问题,先来看一下分配给DirectByteBuffer堆外内存是如何回收的。在创建DirectByteBuffer时我们实际是调用ByteBuffer#allocateDirect方法,而其实现如下:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"public static ByteBuffer allocateDirect(int capacity) {\n return new DirectByteBuffer(capacity);\n}\n\nDirectByteBuffer(int cap) {\n //省略部分代码...\n try {\n \t//调用unsafe分配内存\n base = unsafe.allocateMemory(size);\n } catch (OutOfMemoryError x) {\n //省略部分代码...\n }\n //省略部分代码...\n //前面分析中的Cleaner对象创建,持有当前DirectByteBuffer的引用\n cleaner = Cleaner.create(this, new Deallocator(base, size, cap));\n att = null;\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"里面和DirectByteBuffer堆外内存回收相关的代码便是Cleaner.create(this, new Deallocator(base, size, cap))这部分。还记得之前说实际的清理逻辑是里面和DirectByteBuffer堆外内存回收相关的代码便是Cleaner里面的Runnable#run方法吗?直接看Deallocator.run方法源码:"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"public void run() {\n if (address == 0) {\n // Paranoia\n return;\n }\n //通过unsafe.freeMemory释放创建的堆外内存\n unsafe.freeMemory(address);\n address = 0;\n Bits.unreserveMemory(size, capacity);\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"终于找到了分配给DirectByteBuffer堆外内存是如何回收的的答案。再总结一下,创建DirectByteBuffer对象时会创建一个Cleaner对象,Cleaner对象持有了DirectByteBuffer对象的引用。当JVM在GC时,如果发现DirectByteBuffer被地方法没被引用啦,JVM会将其对应的Cleaner加入到pending-reference链表中,同时通知ReferenceHandler线程处理,ReferenceHandler收到通知后,会调用Cleaner#clean方法,而对于DirectByteBuffer创建的Cleaner对象其clean方法内部会调用unsafe.freeMemory释放堆外内存。最终达到了DirectByteBuffer对象被GC回收其对应的堆外内存也被回收的目的。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"再来看一下文章开始提到的另外一个问题WeakHashMap如何实现敏感内存的回收。实际WeakHashMap实现上其Entry继承了WeakReference。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"\n//Entry继承了WeakReference, WeakReference引用的是Map的key\nprivate static class Entry extends WeakReference implements Map.Entry {\n V value;\n final int hash;\n Entry next;\n /**\n * 创建Entry对象,上面分析过的ReferenceQueue,这个queue实际是WeakHashMap的成员变量,\n * 创建WeakHashMap时其便被初始化 final ReferenceQueue queue = new ReferenceQueue<>()\n */\n Entry(Object key, V value,\n ReferenceQueue queue,\n int hash, Entry next) {\n super(key, queue);\n this.value = value;\n this.hash = hash;\n this.next = next;\n }\n //省略部分原码...\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"往WeakHashMap添加元素时,实际都会调用Entry的构造方法,也就是会创建一个WeakReference对象,这个对象的引用的是WeakHashMap刚加入的Key,而所有的WeakReference对象关联在同一个ReferenceQueue上。我们上面说过JVM在GC时,如果发现当前对象只有被WeakReference对象引用,那么会把其对应的WeakReference对象加入到pending-reference链表上,并通知ReferenceHandler线程处理。而ReferenceHandler线程收到通知后,对于WeakReference对象会调用ReferenceQueue#enqueue方法把他加入队列里面。现在我们只要关注queue里面的元素在WeakHashMap里面是在哪里被拿出去啦做了什么样的操作,就能找到文章开始问题的答案啦。最终能定位到WeakHashMap的expungeStaleEntries方法。"}]},{"type":"codeblock","attrs":{"lang":null},"content":[{"type":"text","text":"private void expungeStaleEntries() {\n //不断地从ReferenceQueue中取出,那些只有被WeakReference对象引用的对象的Reference\n for (Object x; (x = queue.poll()) != null; ) {\n synchronized (queue) {\n //转为 entry\n Entry e = (Entry) x;\n //计算其对应的桶的下标\n int i = indexFor(e.hash, table.length);\n //取出桶中元素\n Entry prev = table[i];\n Entry p = prev;\n //桶中对应位置有元素,遍历桶链表所有元素\n while (p != null) {\n Entry next = p.next;\n //如果当前元素(也就是entry)与queue取出的一致,将entry从链表中去除\n if (p == e) {\n if (prev == e)\n table[i] = next;\n else\n prev.next = next;\n // Must not null out e.next;\n //清空entry对应的value\n e.value = null;\n size--;\n break;\n }\n prev = p;\n p = next;\n }\n }\n }\n}\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"现在只看一下WeakHashMap哪些地方会调用expungeStaleEntries方法就知道什么时候WeakHashMap里面的Key变得软可达时我们就可以将其对应的Entry从WeakHashMap里面移除。直接调用有三个地方分别是getTable方法、size方法、resize方法。 getTable方法又被很多地方调用如get、containsKey、put、remove、containsValue、replaceAll。最终看下来,只要对WeakHashMap进行操作就行调用expungeStaleEntries方法。所有只要操作了WeakHashMap,没WeakHashMap里面被再用到的Key对应的Entry就会被清除。再来总结一下,为什么WeakHashMap适合作为内存敏感缓存的实现。当JVM 在GC时,如果发现WeakHashMap里面某些Key没地方在被引用啦(WeakReference除外),JVM会将其对应的WeakReference对象加入到pending-reference链表上,并通知ReferenceHandler线程处理。而ReferenceHandler线程收到通知后将对应引用Key的WeakReference对象加入到 WeakHashMap内部的ReferenceQueue中,下次再对WeakHashMap做操作时,WeakHashMap内部会清除那些没有被引用的Key对应的Entry。这样就达到了每操作WeakHashMap时,自动的检索并清量没有被引用的Key对应的Entry的目地。"}]},{"type":"heading","attrs":{"align":null,"level":1},"content":[{"type":"text","text":"总结"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"本文通过两个问题引出了JDK中Reference相关类的源码分析,最终给出了问题的答案。但实际上一般开发规范中都会建议禁止重写Object#finalize方法同样与Reference类关系密切(具体而言是Finalizer类)。受篇幅的限制本文并未给出分析,有待各位自己看源码啦。半年没有写文章啦,有点对不住关注的小伙伴。希望看完本文各位或多或少能有所收获。如果觉得本文不错就帮忙转发记得标一下出处,谢谢。后面我还会继续分享一些自己觉得比较重要的东西给大家。由于个人能力有限,文中不足与错误还望指正。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":3},"content":[{"type":"text","text":"看完三件事❤️"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"如果你觉得这篇内容对你还蛮有帮助,我想邀请你帮我三个小忙:"}]},{"type":"numberedlist","attrs":{"start":null,"normalizeStart":1},"content":[{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":1,"align":null,"origin":null},"content":[{"type":"text","text":"点赞,转发,有你们的 『点赞和评论』,才是我创造的动力。"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":2,"align":null,"origin":null},"content":[{"type":"text","text":"关注公众号 『 "},{"type":"text","marks":[{"type":"strong"}],"text":"java烂猪皮"},{"type":"text","text":" 』,不定期分享原创知识。"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":3,"align":null,"origin":null},"content":[{"type":"text","text":"同时可以期待后续文章ing🚀"}]}]}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":""}]},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/34/34172ad7f3cc8e0f28bd1fc6ca2d2b68.png","alt":null,"title":"","style":[{"key":"width","value":"50%"},{"key":"bordertype","value":"none"}],"href":"","fromPaste":false,"pastePass":false}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":""}]},{"type":"blockquote","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"本文作者:叶易 "}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"出处:https://club.perfma.com/article/125010"}]}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}}]}
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章