在Java中，如果并发执行`insert（）`和`size（）`是否会有死锁？

Question

代码看起来像这样（ link ）：

/***
 * Excerpted from "Seven Concurrency Models in Seven Weeks",
***/
import java.util.concurrent.locks.ReentrantLock;

class ConcurrentSortedList {

  private class Node {
    int value;
    Node prev;
    Node next;
    ReentrantLock lock = new ReentrantLock();

    Node() {}

    Node(int value, Node prev, Node next) {
      this.value = value; this.prev = prev; this.next = next;
    }
  }

  private final Node head;
  private final Node tail;

  public ConcurrentSortedList() {
    head = new Node(); tail = new Node();
    head.next = tail; tail.prev = head;
  }

  public void insert(int value) {
    Node current = head;
    current.lock.lock(); 
    Node next = current.next;
    try {
      while (true) {
        next.lock.lock(); 
        try {
          if (next == tail || next.value < value) { 
            Node node = new Node(value, current, next); 
            next.prev = node;
            current.next = node;
            return; 
          }
        } finally { current.lock.unlock(); } 
        current = next;
        next = current.next;
      }
    } finally { next.lock.unlock(); } 
  }

  public int size() {
    Node current = tail;
    int count = 0;

    while (current.prev != head) {
      ReentrantLock lock = current.lock;
      lock.lock();
      try {
        ++count;
        current = current.prev;
      } finally { lock.unlock(); }
    }

    return count;
  }

}

它说它使用了交接锁定 。 insert()从列表头到列表尾获取锁定， size()从列表头到列表头部获取锁定。 size()和insert()可以并发执行。

但是我认为size()和insert()不能并发执行。 因为如果insert持有aNode上的锁并请求aNode.next上的锁，而size持有aNode.next上的锁并请求aNode上的锁，则将出现死锁。

有人对此有想法吗？ 谢谢！

Answer 1

我看到.. size()将在请求新锁之前释放当前锁。.因此不会出现死锁。