jdk1.8中ConcurrentHashMap

最新推荐文章于 2023-12-20 15:11:46 发布

泮小俊233

最新推荐文章于 2023-12-20 15:11:46 发布

阅读量322

点赞数 1

分类专栏：源码学习 jdk 文章标签： Java 源码 ConcurrentHashMap

本文链接：https://blog.csdn.net/panxj856856/article/details/80655526

版权

本文详细解析了JDK1.8中ConcurrentHashMap的初始化过程，包括如何计算合适的容量，以及put操作时的步骤。在put操作中，首先通过CAS设置sizeCtl标志初始化，然后创建Node数组。在初始化完成后，通过key的hash和数组长度取余定位节点位置。如果位置为空，直接通过CAS插入；否则，根据节点状态进行锁操作或者帮助扩容。文章还介绍了扩容时的位运算技巧，以及如何通过 ForwardingNode 节点协调并发扩容。整个过程确保了并发安全和高效性。

摘要由CSDN通过智能技术生成

ConcurrentHashMap我们先看其构造方法，主要是对内部的大小进行配置

    public ConcurrentHashMap(int initialCapacity,
                             float loadFactor, int concurrencyLevel) {
        if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
            throw new IllegalArgumentException();
        if (initialCapacity < concurrencyLevel)   // Use at least as many bins
            initialCapacity = concurrencyLevel;   // as estimated threads
        long size = (long)(1.0 + (long)initialCapacity / loadFactor);
        int cap = (size >= (long)MAXIMUM_CAPACITY) ?
            MAXIMUM_CAPACITY : tableSizeFor((int)size);
        this.sizeCtl = cap;
    }

先是对负载因子、初始化容量、并行度三个参数验证，再保证初始化容量不小于并行度，然后通过初始化容量跟负载因子计算出map容量：size = (long)(1.0 + (long)initialCapacity / loadFactor)，然后保证容量大小不大于MAXIMUM_CAPACITY并且是2的n次方。

    private static final int tableSizeFor(int c) {
        int n = c - 1;
        n |= n >>> 1;
        n |= n >>> 2;
        n |= n >>> 4;
        n |= n >>> 8;
        n |= n >>> 16;
        return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
    }

通过位运算巧妙算出正好不小于c的2的n次方的数值，作为map的容量。初识化操作仅仅计算下参数，并未对真正的存储结构进行初始化。

我们来看下put()操作。

    public V put(K key, V value) {
        return putVal(key, value, false);
    }
    /** Implementation for put and putIfAbsent */
    final V putVal(K key, V value, boolean onlyIfAbsent) {
        if (key == null || value == null) throw new NullPointerException();
        int hash = spread(key.hashCode());
        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) {
                if (casTabAt(tab, i, null,
                             new Node<K,V>(hash, key, value, null)))
                    break;                   // no lock when adding to empty bin
            }
            else if ((fh = f.hash) == MOVED)
                tab = helpTransfer(tab, f);
            else {
                V oldVal = null;
                synchronized (f) {
                    if (tabAt(tab, i) == f) {
                        if (fh >= 0) {
                            binCount = 1;
                            for (Node<K,V> e = f;; ++binCount) {
                                K ek;
                                if (e.hash == hash &&
                                    ((ek = e.key) == key ||
                                     (ek != null && key.equals(ek)))) {
                                    oldVal = e.val;
                                    if (!onlyIfAbsent)
                                        e.val = value;
                                    break;
                                }
                                Node<K,V> pred = e;
                                if ((e = e.next) == null) {
                                    pred.next = new Node<K,V>(hash, key,
                                                              value, null);
                                    break;
                                }
                            }
                        }
                        else if (f instanceof TreeBin) {
                            Node<K,V> p;
                            binCount = 2;
                            if ((p = ((TreeBin<K,V>)f).putTreeVal(hash, key,
                                                           value)) != null) {
                                oldVal = p.val;
                                if (!onlyIfAbsent)
                                    p.val = value;
                            }
                        }
                    }
                }
                if (binCount != 0) {
                    if (binCount >= TREEIFY_THRESHOLD)
                        treeifyBin(tab, i);
                    if (oldVal != null)
                        return oldVal;
                    break;
                }
            }
        }
        addCount(1L, binCount);
        return null;
    }

如果第一次调用put，此时tab为null，于是调用initTable()

    private final Node<K,V>[] initTable() {
        Node<K,V>[] tab; int sc;
        while ((tab = table) == null || tab.length == 0) {
            if ((sc = sizeCtl) < 0)
                Thread.yield(); // lost initialization race; just spin
            else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
                try {
                    if ((tab = table) == null || tab.length == 0) {
                        int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
                        @SuppressWarnings("unchecked"