非阻塞同步

1. 非阻塞的栈

//利用atomicReference实现非阻塞栈
public class ConcurrentStack<E> {
    //栈指针
    AtomicReference<Node<E>> top = new AtomicReference<Node<E>>();

    public void put(E item){
        Node<E> newHead = new Node<E>(item);
        Node<E> oldHead;
        do{
            oldHead = top.get();
            newHead.next = oldHead;
        }while(!top.compareAndSet(oldHead,newHead));
    }

    public E pop(){
        Node<E> newHead;
        Node<E> oldHead;
        do{
            oldHead = top.get();
            if(oldHead == null)
                return null;
            newHead = oldHead.next;
        }while(!top.compateAndSet(oldHead,newHead));
        return oldHead.item;
    }

    class Node<E>{
        public final E item;
        public Node<E> next;

        public Node(E item){
            this.item = item;
        }
    }
}

1. 非阻塞的链表( ConcurrentLinkedQueue实现 )

/**
* 非阻塞链表插入算法 
* 两个指针，一个指向头，一个指向尾
* 在插入操作时同时维护两个同步操作：1.插入新的节点，2.更新尾节点
**/

@ThreadSafe
public class LinkedQueue<E> {
    private static class Node<E>{
        final E item;
        final AtomicReference<Node<E>> next;

        public Node(E item,Node<E> next){
            this.item = item;
            this.next = new AtomicReference<Node<E>>(next);
        }
    }

    //哑节点
    private Node<E> dummy = new Node<E>(null,null);
    private final AtomicReference<Node<E>> head  
                = new AtomicReference<Node<E>>(dummy); 
    private final AtomicReference<Node<E>> tail
                = new AtomicReference<Node<E>>(dummy);

    //put
    public boolean put(E item){
        Node<E> newNode = new Node<E>(item,null);
        while(true){
            Node<E> curTail = tail.get();
            Node<E> tailNext = curTail.next.get();
            if(curTail == tail.get()){
                //如果尾节点的next不为null,则表示其处于中间状态，帮助完成
                if(tailNext != null){
                    tail.compareAndSet(curTail,tailNext);
                }else{  //处于稳定状态
                    //尝试插入
                    if(curTail.next.compareAndSet(null,newNode)){
                        //更新尾节点，不管成不成功，因为可能其他线程帮他做好了
                        tail.compareAndSet(curTail,newNode);
                        return true;
                    }
                }
            }
        }
    }
}

1. 在真正的ConcurrentLinkedQueue中，使用原子的域更新器来同步，这样主要是为了省去新建atomicReference的创建过程

private class Node<E>{
    private final E item;
    private volatile Node<E> next;

    public Node(E item){
        this.item = item;
    }
}

//第一个参数是类的类型，第二个是参数的类型，第三个是参数的名称
private AtomicReferenceFieldUpdater<Node,Node> nextUpdater
            = AtomicReferenceFieldUpdater.newUpdater(Node.class,Node.class,"next");

//ex.
public static void main(){
    Node<String> node = new Node<String>("hahaha");
    Node<String> newNode = new Node<String>("I want to be added");
    nextUpdater.compareAndSet(node,node.next,newNode);//就加好了
}