基于数组的有界阻塞队列 —— ArrayBlockingQueue

{"type":"doc","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"blockquote","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","marks":[{"type":"strong"}],"text":"前言"}]},{"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":"在阅读完和 AQS 相关的锁以及同步辅助器之后，来一起阅读 JUC 下的和队列相关的源码。先从第一个开始：ArrayBlockingQueue。"}]},{"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":"公众号：liuzhihangs，记录工作学习中的技术、开发及源码笔记；时不时分享一些生活中的见闻感悟。欢迎大佬来指导！"}]}]},{"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}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"由数组支持的有界BlockingQueue阻塞队列。"}]},{"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":"这个队列的命令元素FIFO（先入先出）。 队列的头是元素一直在队列中时间最长。 队列的尾部是该元素已经在队列中的时间最短。 新元素插入到队列的尾部，并且队列检索操作获取在队列的头部元素。"}]},{"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":"这是一个典型的“有界缓冲区”，在其中一个固定大小的数组保持由生产者插入并受到消费者的提取的元素。 一旦创建，容量不能改变。 试图put 一个元素到一个满的队列将导致操作阻塞; 试图 take 从空队列一个元素将类似地阻塞。"}]},{"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":"此类支持订购等待生产者和消费者线程可选的公平政策。 默认情况下，这个顺序不能保证。 然而，队列公平设置为构建 true 保证线程以FIFO的顺序进行访问。 公平性通常会降低吞吐量，但减少了可变性和避免饥饿。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"基本使用"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"\npublic class ArrayBlockingQueueTest {\n\n private static final ArrayBlockingQueue QUEUE = new ArrayBlockingQueue<>(10);\n\n private static final CountDownLatch LATCH = new CountDownLatch(2);\n\n public static void main(String[] args) {\n\n ExecutorService pool = new ThreadPoolExecutor(2, 2, 0L, TimeUnit.MILLISECONDS,\n new LinkedBlockingQueue<>(1024),\n new ThreadFactoryBuilder().setNameFormat(\"Thread-pool-%d\").build(),\n new ThreadPoolExecutor.AbortPolicy());\n\n\n pool.submit(() -> {\n for (int i = 0; i < 100; i++) {\n try {\n Thread.sleep(1000L);\n\n QUEUE.put(\"鸡蛋\" + Thread.currentThread().getName());\n System.out.println(\"put 放入元素\");\n } catch (InterruptedException ignored) {\n }\n }\n LATCH.countDown();\n });\n\n\n pool.submit(() -> {\n\n for (int i = 0; i < 100; i++) {\n try {\n Thread.sleep(500L);\n\n String take = QUEUE.take();\n\n System.out.println(\"take = \" + take);\n } catch (InterruptedException ignored) {\n }\n }\n LATCH.countDown();\n\n });\n try {\n LATCH.await();\n } catch (InterruptedException ignored) {\n\n }\n pool.shutdown();\n }\n\n}\n"}]},{"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":"demo 只是临时写的一个，很简单的版本。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"问题疑问"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"numberedlist","attrs":{"start":"1","normalizeStart":1},"content":[{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":1,"align":null,"origin":null},"content":[{"type":"text","text":"ArrayBlockingQueue 的实现原理是什么？"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":2,"align":null,"origin":null},"content":[{"type":"text","text":"入队列和出队列方法之间的区别是什么？"}]}]}]},{"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}},{"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}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"基本结构"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/99/99706eb6e76af457513a2d9c58ad404e.png","alt":"ArrayBlockingQueue-uml-37BHBp","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}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"参数介绍"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"\n/** 数组 - 存储队列中的元素 */\nfinal Object[] items;\n\n/** 下一个 take, poll, peek or remove 的索引 */\nint takeIndex;\n\n/** 下一个 put, offer, or add 的索引 */\nint putIndex;\n\n/** 队列中的元素数 */\nint count;\n\n\n/** Main lock guarding all access */\nfinal ReentrantLock lock;\n\n/** take 操作时是否等待 */\nprivate final Condition notEmpty;\n\n/** put 操作时是否等待 */\nprivate final Condition notFull;\n"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"构造函数"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"public ArrayBlockingQueue(int capacity) {\n this(capacity, false);\n}\n\n// 指定容量，及是否公平\npublic ArrayBlockingQueue(int capacity, boolean fair) {\n if (capacity <= 0)\n throw new IllegalArgumentException();\n this.items = new Object[capacity];\n lock = new ReentrantLock(fair);\n notEmpty = lock.newCondition();\n notFull = lock.newCondition();\n}\n// 初始化的时候放入元素\npublic ArrayBlockingQueue(int capacity, boolean fair,\n Collection extends E> c) {\n this(capacity, fair);\n\n final ReentrantLock lock = this.lock;\n lock.lock(); // Lock only for visibility, not mutual exclusion\n try {\n int i = 0;\n try {\n for (E e : c) {\n checkNotNull(e);\n items[i++] = e;\n }\n } catch (ArrayIndexOutOfBoundsException ex) {\n throw new IllegalArgumentException();\n }\n count = i;\n putIndex = (i == capacity) ? 0 : i;\n } finally {\n lock.unlock();\n }\n}"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"添加元素"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"public boolean add(E e) {\n return super.add(e);\n}\n\n// 父类的方法，其实调用的也是 offer\npublic boolean add(E e) {\n if (offer(e))\n return true;\n else\n throw new IllegalStateException(\"Queue full\");\n}\n// 使用锁\npublic boolean offer(E e) {\n checkNotNull(e);\n // 加锁\n final ReentrantLock lock = this.lock;\n lock.lock();\n try {\n if (count == items.length)\n return false;\n else {\n enqueue(e);\n return true;\n }\n } finally {\n lock.unlock();\n }\n}\n// 放入元素， 如果队列满了，则等待\npublic void put(E e) throws InterruptedException {\n checkNotNull(e);\n final ReentrantLock lock = this.lock;\n lock.lockInterruptibly();\n try {\n while (count == items.length)\n notFull.await();\n enqueue(e);\n } finally {\n lock.unlock();\n }\n}"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"numberedlist","attrs":{"start":"1","normalizeStart":1},"content":[{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":1,"align":null,"origin":null},"content":[{"type":"text","text":"add 方法：调用的是父类 AbstractQueue 的 add 方法，内部调用的是 offer 方法，如果 offer 返回 false，则抛出异常。"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":2,"align":null,"origin":null},"content":[{"type":"text","text":"offer 方法：校验元素非空，加互斥锁，如果队列满了，则返回 false，如果队列未满，则调用 enqueue 方法，添加元素。"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":3,"align":null,"origin":null},"content":[{"type":"text","text":"put 方法：校验元素非空，加互斥锁，如果队列满了，则一直自旋等待，队列未满则调用 enqueue 方法，添加元素。"}]}]}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"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":"所以下面还是需要看一下 enqueue 方法："}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"// 只有在获取锁的时候才可以调用\nprivate void enqueue(E x) {\n // assert lock.getHoldCount() == 1;\n // assert items[putIndex] == null;\n final Object[] items = this.items;\n // putIndex 下一个 put, offer, or add 的索引\n // 对其进行赋值，然后进行 ++putIndex 操作\n items[putIndex] = x;\n // 如果等于长度，则指定为开始\n if (++putIndex == items.length)\n putIndex = 0;\n // 对元素数进行 ++\n count++;\n // 有元素入队列，唤醒在等待获取元素的线程\n notEmpty.signal();\n}"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"获取元素"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"public E poll() {\n final ReentrantLock lock = this.lock;\n lock.lock();\n try {\n return (count == 0) ? null : dequeue();\n } finally {\n lock.unlock();\n }\n}\n\npublic E take() throws InterruptedException {\n final ReentrantLock lock = this.lock;\n lock.lockInterruptibly();\n try {\n while (count == 0)\n notEmpty.await();\n return dequeue();\n } finally {\n lock.unlock();\n }\n}"}]},{"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":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"numberedlist","attrs":{"start":"1","normalizeStart":1},"content":[{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":1,"align":null,"origin":null},"content":[{"type":"text","text":"pool 和 take 都是从队列中获取元素，二者不同的是，当队列中没有元素时，poll 方法返回 null，而 take 方法会一直阻塞等待，直到从队列中获取到元素。"}]}]},{"type":"listitem","content":[{"type":"paragraph","attrs":{"indent":0,"number":2,"align":null,"origin":null},"content":[{"type":"text","text":"poll 和 take 方法获取元素都是调用的 dequeue 方法。"}]}]}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"private E dequeue() {\n // assert lock.getHoldCount() == 1;\n // assert items[takeIndex] != null;\n final Object[] items = this.items;\n @SuppressWarnings(\"unchecked\")\n // 获取元素并将元素置为 null\n E x = (E) items[takeIndex];\n items[takeIndex] = null;\n // takeIndex 下一个 take, poll, peek or remove 的索引\n // 指向下一个元素，并且 元素数减少\n if (++takeIndex == items.length)\n takeIndex = 0;\n count--;\n // 更新迭代器状态\n if (itrs != null)\n itrs.elementDequeued();\n // 唤醒等待放入元素的线程\n notFull.signal();\n return x;\n}"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"查看元素"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"codeblock","attrs":{"lang":"java"},"content":[{"type":"text","text":"public E peek() {\n final ReentrantLock lock = this.lock;\n lock.lock();\n try {\n return itemAt(takeIndex); // null when queue is empty\n } finally {\n lock.unlock();\n }\n}"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"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}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"Q&A"}]},{"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","marks":[{"type":"strong"}],"text":"Q: ArrayBlockingQueue 的实现原理？"}]},{"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","marks":[{"type":"strong"}],"text":"A:"},{"type":"text","text":" ArrayBlockingQueue 是基于数组实现的，内部使用 ReentrantLock 互斥锁，防止并发放置元素或者取出元素的冲突问题。"}]},{"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","marks":[{"type":"strong"}],"text":"Q: 入队列和出队列方法之间的区别是什么？"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"image","attrs":{"src":"https://static001.geekbang.org/infoq/2b/2bc87617c9a3e59eebdc5d915493568b.png","alt":null,"title":null,"style":null,"href":null,"fromPaste":true,"pastePass":true}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":4},"content":[{"type":"text","text":"结束语"}]},{"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":"ArrayBlockingQueue 中使用了 ReentrantLock 互斥锁，在元素入队列和出队列的时候都进行了加锁，所以同时只会有一个线程进行入队列或者出队列，从而保证线程安全。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}}]}