jdk1.8下的ConcurrentHashMap源码分析

1 、构造函数

    1.1空参构造函数

        

/**
* Creates a new, empty map with the default initial table size (16).
*/
public ConcurrentHashMap() {
}

    1.2指定初始化容量的构造函数

public ConcurrentHashMap(int initialCapacity) {
    if (initialCapacity < 0)//不能指定为复数
        throw new IllegalArgumentException();
    int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
               MAXIMUM_CAPACITY :
               tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
//获取传入参数的向上取2的n次方比如传入5，则实际的初始化容量为8，传入为16，实际的容量就是16，如果传入为17，则实际的容量的大小为32.
    this.sizeCtl = cap;
}

    1.3指定的初始化容量和加载因子的构造函数

public ConcurrentHashMap(int initialCapacity, float loadFactor) {
    this(initialCapacity, loadFactor, 1);//调用的其实是三个参数的构造函数，并发等级为1传入1.4
}

    1.4 指定初始化容量和加载因子和并发等级的构造函数

public ConcurrentHashMap(int initialCapacity,float loadFactor, int concurrencyLevel) {
    if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)//检验参数必须都>0
        throw new IllegalArgumentException();
    if (initialCapacity < concurrencyLevel)   // 如果初始容量<并发等级，会将初始化初始容量调整为=并发等级，即保证初始化容量是>=并发等级的
        initialCapacity = concurrencyLevel;   // as estimated threads
    long size = (long)(1.0 + (long)initialCapacity / loadFactor);//下面的代码都是为了计算实际的初始化容量cap，必须是向上取2的n次方的大小
    int cap = (size >= (long)MAXIMUM_CAPACITY) ?
        MAXIMUM_CAPACITY : tableSizeFor((int)size);
    this.sizeCtl = cap;//将数量付给sizeCtl
}

2、put方法

/** Implementation for put and putIfAbsent */
final V putVal(K key, V value, boolean onlyIfAbsent) {
    if (key == null || value == null) throw new NullPointerException();//ConcurrentHashMap不支持Key或value为空的元素（抛出空指针）
    int hash = spread(key.hashCode());//计算hash值（根据key的hashCode）   (h ^ (h >>> 16)) & HASH_BITS;
    int binCount = 0;
    for (Node<K,V>[] tab = table;;) {
        Node<K,V> f; int n, i, fh;
        if (tab == null || (n = tab.length) == 0)
            tab = initTable();//如果当前数组还没有初始化，那么就会调用初始化方法对桶进行初始化
        else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {通过数组角标和hash按位与计算出数组的角标，并且该位置上的链表的头节点或者tree的root节点==null的话
            if (casTabAt(tab, i, null,
                         new Node<K,V>(hash, key, value, null)))//通过CAS原子操作将数组[i]上的位置进行赋值操作，如果成功就跳出循环
                break;                   // no lock when adding to empty bin 当table[i]上的值为null的话，就不会加锁，cas插入到table[i]位置
        }
        else if ((fh = f.hash) == MOVED)//如果该位置上的元素的hash值为-1（MOVED），那么说明正在扩容
            tab = helpTransfer(tab, f);//帮助其他线程进行扩容操作
        else {//table[i]的位置上不是null，并且此时没有其他线程进行扩容
            V oldVal = null;//记录一下匹配上key的旧的value值
            //说明接下来应该是操作链表或者红黑树去遍历，我猜应该是CAS实现线程安全比较困难，所以这里也是通过加锁synchronized锁住table[i]所在对象。
            synchronized (f) {//加锁
                if (tabAt(tab, i) == f) {
                    if (fh >= 0) {//fh是f的hash，如果f的hash是>=0的话说明是一个链表，因为TreeBin的hash是-1，如果是一个树的话这里接收的其实不是TreeNode节点，而是一个TreeBin对
                                    //象，TreeBin对象继承了Node<>对象
                        binCount = 1;//
                        for (Node<K,V> e = f;; ++binCount) {//循环链表
                            K ek;
                            if (e.hash == hash &&
                                ((ek = e.key) == key ||
                                 (ek != null && key.equals(ek)))) {//比较hash+比较key.equals()或者直接比较key的值，如果相等，就覆盖旧的
                                oldVal = e.val;//记录旧的值
                                if (!onlyIfAbsent)
                                    e.val = value;//赋值后结束循环
                                break;
                            }
                            Node<K,V> pred = e;//如果不是当前节点，那就将e指向链表中的下一个节点（其实就是个循环遍历比较key的过程）
                            if ((e = e.next) == null) {//如果找到链表最后一个也没找到相同的key，那就再尾部插入一个新的节点，后结束循环
                                pred.next = new Node<K,V>(hash, key,
                                                          value, null);
                                break;
                            }
                        }
                    }
                    else if (f instanceof TreeBin) {//如果f是TreeBin的话，就调用putTreeVal方法循环遍历红黑树，并且修改val或将新节点插入到指定位置
                        Node<K,V> p;
                        binCount = 2;
                        if ((p = ((TreeBin<K,V>)f).putTreeVal(hash, key,
                                                       value)) != null) {//如果查找到了相同key的树节点，就替换
                            oldVal = p.val;
                            if (!onlyIfAbsent)
                                p.val = value;//替换值
                        }
                    }
                }
            }//注意这里是同步代码块的结尾，那么它的树化过程怎么保证线程安全呢？？？其实树化方法里面会重新加锁
            if (binCount != 0) {//binCount要么是链表的长度，要不就是当当前是树结构的时候，会将binCount=2
                if (binCount >= TREEIFY_THRESHOLD)//如果链表的长度是》=8，调用树化方法，但是需要注意的是树化方法也不一定会真实的转为树
                    treeifyBin(tab, i);
                if (oldVal != null)
                    return oldVal;//返回旧的节点值
                break;
            }
        }
    }
    addCount(1L, binCount);//可以先理解为hashmap中的count++，其实过程要复杂一些
    return null;
}

3、size()方法

/**
* 这里的size方法不是维护成员变量size，而是类似LongAdder类的数量方式获取
*/
public int size() {
    long n = sumCount();
    return ((n < 0L) ? 0 :
            (n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
            (int)n);
}
//调用的获取sumCount的方法（其实返回值就是整个CHM中的元素个数）
//这里面的sumCount由两部分组成，一是baseCount（基本个数），二是counterCells[]数组中的元素之和

final long sumCount() {
    CounterCell[] as = counterCells; CounterCell a;
    long sum = baseCount;
    if (as != null) {
        for (int i = 0; i < as.length; ++i) {
            if ((a = as[i]) != null)
                sum += a.value;
        }
    }
    return sum;
}

4、树化方法treeifyBin(Node<K,V>[] tab, int index)

/* ---------------- Conversion from/to TreeBins -------------- */


/**
* Replaces all linked nodes in bin at given index unless table is
* too small, in which case resizes instead.
*/
private final void treeifyBin(Node<K,V>[] tab, int index) {//tab是链表，index是table[i]的i即数组中的位置
    Node<K,V> b; int n, sc;
    if (tab != null) {
        if ((n = tab.length) < MIN_TREEIFY_CAPACITY)//这里会判断是否当前数组的容量是否<64,如果小于64的话，那么会尝试扩容，也就是说，只有数组的长度》=64，并且链表中的第九个元素到来到的话才会树化
            tryPresize(n << 1);//扩容1倍
        else if ((b = tabAt(tab, index)) != null && b.hash >= 0) {//length>=64并且当前桶中不是空，并且桶中第一个元素的hash>=0即不是树结构
            synchronized (b) {//这里树化过程会重新加锁
                if (tabAt(tab, index) == b) {//再判断一次是否有其他线程改变了该桶中的结构
                    TreeNode<K,V> hd = null, tl = null;
                    for (Node<K,V> e = b; e != null; e = e.next) {//循环链表
                        TreeNode<K,V> p =
                            new TreeNode<K,V>(e.hash, e.key, e.val,
                                              null, null);//构建一个树节点
                        if ((p.prev = tl) == null)//构建一个双向链表
                            hd = p;
                        else
                            tl.next = p;
                        tl = p;
                    }
                    setTabAt(tab, index, new TreeBin<K,V>(hd));//将root节点封装成TreeBin对象放回table[i]这个封装的过程会真实的把链表转变为一棵红黑树，然后unsafe的putObjectVolatile方法将TreeBin对象放回数组中
                }
            }
        }
    }
}

5、初始化方法initTable()

//ConcurrentHashMap map = new ConcurrentHashMap();map.put("key","value");就会调用初始化方法
private final Node<K,V>[] initTable() {
    Node<K,V>[] tab; int sc;
    while ((tab = table) == null || tab.length == 0) {
        if ((sc = sizeCtl) < 0)//sizeCtl默认是0，除非其他线程在当前线程之前将sizeCtrl改为了-1，即else if中的逻辑
            Thread.yield(); // lost initialization race; just spin 放弃cpu执行权
        else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {//多线程争取去更改sizeCtl，有点类似有争取锁的过程，只不过区别是这里的逻辑可以避免线程争取锁过程中的阻塞状态
            try {
                if ((tab = table) == null || tab.length == 0) {//更新成功，可以理解为抢占到锁了
                    int n = (sc > 0) ? sc : DEFAULT_CAPACITY;//初始长度为16
                    @SuppressWarnings("unchecked")
                    Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
                    table = tab = nt;
                    sc = n - (n >>> 2);//取容量的3/4
                }
            } finally {
                sizeCtl = sc;//改为这为正数后推出循环
            }
            break;
        }
    }
    return tab;
}//执行完该方法之后table的容量为16,sizeCtl为12 = 16*（3/4）

6、计数+1和扩容逻辑 addCount(1L, binCount);

/**
* Adds to count, and if table is too small and not already
* resizing, initiates transfer. If already resizing, helps
* perform transfer if work is available.  Rechecks occupancy
* after a transfer to see if another resize is already needed
* because resizings are lagging additions.
*
* @param x the count to add
* @param check if <0, don't check resize, if <= 1 only check if uncontended
*/
private final void addCount(long x, int check) {
    CounterCell[] as; long b, s;
    if ((as = counterCells) != null ||
        !U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) {
        CounterCell a; long v; int m;
        boolean uncontended = true;
        if (as == null || (m = as.length - 1) < 0 ||
            (a = as[ThreadLocalRandom.getProbe() & m]) == null ||
            !(uncontended =
              U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) {
            fullAddCount(x, uncontended);
            return;
        }
        if (check <= 1)
            return;
        s = sumCount();
    }
    if (check >= 0) {
        Node<K,V>[] tab, nt; int n, sc;
        while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
               (n = tab.length) < MAXIMUM_CAPACITY) {
            int rs = resizeStamp(n);
            if (sc < 0) {
                if ((sc >>> RESIZE_STAMP_SHIFT) != rs || sc == rs + 1 ||
                    sc == rs + MAX_RESIZERS || (nt = nextTable) == null ||
                    transferIndex <= 0)
                    break;
                if (U.compareAndSwapInt(this, SIZECTL, sc, sc + 1))
                    transfer(tab, nt);
            }
            else if (U.compareAndSwapInt(this, SIZECTL, sc,
                                         (rs << RESIZE_STAMP_SHIFT) + 2))
                transfer(tab, null);
            s = sumCount();
        }
    }
}