ConcurrentLinkedQueue在java的原理探究

private static class Node<E> {

    volatile E item;

    volatile Node<E> next;

    Node(E item) {

        UNSAFE.putObject(this, itemOffset, item);

    }

    boolean casItem(E cmp, E val) {

        return UNSAFE.compareAndSwapObject(this, itemOffset, cmp, val);

    }

    void lazySetNext(Node<E> val) {

        UNSAFE.putOrderedObject(this, nextOffset, val);

    }

    boolean casNext(Node<E> cmp, Node<E> val) {

        return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val);

}

public ConcurrentLinkedQueue() {

    head = tail = new Node<E>(null);

}