目录
常见问题
1.concurrentHashMap特点
类似hashtable,线程安全,效率高。key 和value不能为null。
2.concurrentHashMap如何保证效率高,又安全的?
数据结构上选择了HashMap类似的数组+链表+红黑树的方式实现,而加锁则采用CAS和synchronized
实现。
1.构造函数
sizeCtl:
sizeCtl 是 CHM 中最重要的状态变量,包括很多状态
-
sizeCtl = 0 :初始值, 初始容量16;
-
sizeCtl > 0 :
table 未初始化,表示初始化容量;
table 已初始化,表示扩容阈值(0.75n); -
sizeCtl = -1 :表示正在初始化;
-
sizeCtl < -1 :表示正在扩容
-
sizeCtl < -(1+n) :表示此时有n个线程共同完成扩容操作。
-
具体结构如图所示:
参考:https://www.cnblogs.com/sanzao/p/10792546.html#_label0
public ConcurrentHashMap(int initialCapacity, float loadFactor, int concurrencyLevel) {
if (loadFactor > 0.0F && initialCapacity >= 0 && concurrencyLevel > 0) {
if (initialCapacity < concurrencyLevel) {
initialCapacity = concurrencyLevel;
}
long size = (long)(1.0D + (double)((float)((long)initialCapacity) / loadFactor));
int cap = size >= 1073741824L ? 1073741824 : tableSizeFor((int)size);
this.sizeCtl = cap;
} else {
throw new IllegalArgumentException();
}
}
2.put方法
首先判断键值对是否为null,如果null 抛出异常。
通过key的hashcode得到hash值,该值为正数。
无线循环遍历
如果当前tab为null,初始化table数组,且返回
继续下次遍历,当前table数组不为null,创建一个node,添加进去
/** Implementation for put and putIfAbsent */
final V putVal(K key, V value, boolean onlyIfAbsent) {
if (key == null || value == null) throw new NullPointerException();
//正数的hash值
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)
//初始化table
tab = initTable();
//如果要插入的位置对象为null
else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
//创建一个node,通过cas 保证原子性,插入当前位置,返回
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) {
//如果当前node等于table的i位置的node,开始追加数据到链表
if (tabAt(tab, i) == f) {
if (fh >= 0) {
binCount = 1;
for (Node<K,V> e = f;; ++binCount) {
K ek;
//如果key相同,覆盖value
if (e.hash == hash &&
((ek = e.key) == key ||
(ek != null && key.equals(ek)))) {
oldVal = e.val;
if (!onlyIfAbsent)
e.val = value;//new value 覆盖oldvalue
break;
}
//如果key不相同,向后追加数据node
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;
}
} else if (f instanceof ReservationNode)
throw new IllegalStateException("Recursive update");
}
}
if (binCount != 0) {
//添加的数据 >= 树的阈值
if (binCount >= TREEIFY_THRESHOLD)
treeifyBin(tab, i);
if (oldVal != null)
return oldVal;
break;
}
}
}
addCount(1L, binCount);
return null;
}
2.1 initTable
根据sizeCtl判断当前状态,如果有线程正在初始化sizeCtl<0,让步,如果没有,初始化table数组。
private final Node<K,V>[] initTable() {
Node<K,V>[] tab; int sc;
while ((tab = table) == null || tab.length == 0) {
//sizeCtl<0 说明有线程正在进行初始化,然后当前线程让出资源。
if ((sc = sizeCtl) < 0)
Thread.yield(); // lost initialization race; just spin
//如果没有,把sizeCtl设置为-1,如果成功,开始初始化table,且设置长度为n
//如果失败,再次循环,去判断sizeCtl,这种形式自旋锁。
else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
try {
if ((tab = table) == null || tab.length == 0) {
//如果sc大于0,进行容量的初始化为16
int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
@SuppressWarnings("unchecked")
//进行初始化table
Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
table = tab = nt;
//设置sc的值为0.75n
//n>>>2 相当于除以4 n-n/4 = (3/4)*n
sc = n - (n >>> 2);
}
} finally {
//sizeCtl 变成了初始化后的阈值。
sizeCtl = sc;
}
break;
}
}
return tab;
}
2.2 addCount方法
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();
}
}
}
3.get方法
public V get(Object key) {
Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek;
int h = spread(key.hashCode());
if ((tab = table) != null && (n = tab.length) > 0 &&
(e = tabAt(tab, (n - 1) & h)) != null) {
//如果第一个位置就是,返回
if ((eh = e.hash) == h) {
if ((ek = e.key) == key || (ek != null && key.equals(ek)))
return e.val;
}
else if (eh < 0)
return (p = e.find(h, key)) != null ? p.val : null;
while ((e = e.next) != null) {
if (e.hash == h &&
((ek = e.key) == key || (ek != null && key.equals(ek))))
return e.val;
}
}
return null;
}