ArrayBlockingQueue 的性能瓶颈

最新推荐文章于 2024-12-11 16:56:18 发布

原创

最新推荐文章于 2024-12-11 16:56:18 发布 · 2.1k 阅读

1 ·

CC 4.0 BY-SA版权

先看看ArrayBlockingQueue的源码，主要有两个方法

先看put方法：向队列的尾部插入元素，若已满则等待。

/**
 * Inserts the specified element at the tail of this queue, waiting
 * for space to become available if the queue is full.
 *
 * @throws InterruptedException {@inheritDoc}
 * @throws NullPointerException {@inheritDoc}
 */
public void put(E e) throws InterruptedException {
    checkNotNull(e);
    final ReentrantLock lock = this.lock;
    lock.lockInterruptibly();
    try {
        while (count == items.length)
            notFull.await();
        enqueue(e);
    } finally {
        lock.unlock();
    }
}

/**
 * Inserts element at current put position, advances, and signals.
 * Call only when holding lock.
 */
private void enqueue(E x) {
    // assert lock.getHoldCount() == 1;
    // assert items[putIndex] == null;
    final Object[] items = this.items;
    items[putInd