ConcurrentHashMap
ConcurrentHashMap是是线程安全的哈希表，相当于线程安全的HashMap。其使用CAS+synchronized实现，而其上锁的，只是table数组的一个元素
key和value都不允许位null。
//table数组
transient volatile Node<K,V>[] table;
//扩容的下一个数组，最终会table=nextTable进行赋值。
private transient volatile Node<K,V>[] nextTable;
/**
* -1表示正在初始化
* -(1 + the number of active resizing threads)
* 0 表示table is null
* 下一次要调整table大小的元素数量，默认是table大小的0.75倍
*/
private transient volatile int sizeCtl;
//辅助计算size大小
private transient volatile CounterCell[] counterCells;
public int size() {
long n = sumCount();
return ((n < 0L) ? 0 :
(n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
(int)n);
}
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;
}
put
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 (ConcurrentHashMap.Node<K, V>[] tab = table; ; ) {
ConcurrentHashMap.Node<K, V> f;
int n, i, fh;
if (tab == null || (n = tab.length) == 0) {
//如果table没有初始化，初始化table
tab = initTable();
} else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
/**
* 这个位置没有值，直接通过CAS将键值对放进去
* 成功则推出循环，失败就会开始新的循环。
*/
if (casTabAt(tab, i, null,
new ConcurrentHashMap.Node<K, V>(hash, key, value, null))) {
break; // no lock when adding to empty bin
}
} else if ((fh = f.hash) == MOVED) {
/**
* static final int MOVED = -1; // hash for forwarding nodes
* static final int TREEBIN = -2; // hash for roots of trees
* static final int RESERVED = -3; // hash for transient reservations
* static final int HASH_BITS = 0x7fffffff; // usable bits of normal node hash
*/
tab = helpTransfer(tab, f);
} else {
V oldVal = null;
/**
* 只有在这个地方才加了锁
* 说明要插入的位置有数据，加锁操作
*/
synchronized (f) {
//f为数组的第一个数据
if (tabAt(tab, i) == f) {
if (fh >= 0) {
binCount = 1;
for (ConcurrentHashMap.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;
}
ConcurrentHashMap.Node<K, V> pred = e;
if ((e = e.next) == null) {
pred.next = new ConcurrentHashMap.Node<K, V>(hash, key,
value, null);
break;
}
}
} else if (f instanceof ConcurrentHashMap.TreeBin) {
ConcurrentHashMap.Node<K, V> p;
binCount = 2;
if ((p = ((ConcurrentHashMap.TreeBin<K, V>) f).putTreeVal(hash, key,
value)) != null) {
oldVal = p.val;
if (!onlyIfAbsent) {
p.val = value;
}
}
}
}
}
if (binCount != 0) {
//判断节点数量是否大于8，如果大于就需要把链表转化成红黑树
if (binCount >= TREEIFY_THRESHOLD)
treeifyBin(tab, i);
if (oldVal != null)
return oldVal;
break;
}
}
}
//将map的元素数量加1
addCount(1L, binCount);
return null;
}
addCount
/**
* @param x 添加的元素数量
* @param check 是tab中的数据为1，红黑树固定位2，链表和位置相关
*/
private final void addCount(long x, int check) {
CounterCell[] as;
long b, s;
if ((as = counterCells) != null ||
//CAS修改数量失败，现在是并发状态
!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))) {
//类似于LongAdder操作，在CounterCell[]添加要添加的数量
fullAddCount(x, uncontended);
return;
}
if (check <= 1)
return;
//求和CounterCell[]的数据
s = sumCount();
}
//查询是否需要扩容
if (check >= 0) {
Node<K, V>[] tab, nt;
int n, sc;
/**
*容量大于需要扩容的数量，就要扩容
* sizeCtl当前代表的是下一次要调整table大小的元素数量
*/
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;
//更改sizeCtl，进行扩容。
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();
}
}
}
transfer（扩容）
private final void transfer(Node<K, V>[] tab, Node<K, V>[] nextTab) {
int n = tab.length, stride;
if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE) {
stride = MIN_TRANSFER_STRIDE; // subdivide range
}
if (nextTab == null) { // initiating
try {
@SuppressWarnings("unchecked")
//构造一个nextTable对象 它的容量是原来的两倍
Node<K, V>[] nt = (Node<K, V>[]) new Node<?, ?>[n << 1];
nextTab = nt;
} catch (Throwable ex) { // try to cope with OOME
sizeCtl = Integer.MAX_VALUE;
return;
}
nextTable = nextTab;
transferIndex = n;
}
int nextn = nextTab.length;
ForwardingNode<K, V> fwd = new ForwardingNode<K, V>(nextTab);
//是否已经处理过
boolean advance = true;
boolean finishing = false; // to ensure sweep before committing nextTab
for (int i = 0, bound = 0; ; ) {
Node<K, V> f;
int fh;
while (advance) {
int nextIndex, nextBound;
if (--i >= bound || finishing)
advance = false;
else if ((nextIndex = transferIndex) <= 0) {
i = -1;
advance = false;
} else if (U.compareAndSwapInt
(this, TRANSFERINDEX, nextIndex,
nextBound = (nextIndex > stride ?
nextIndex - stride : 0))) {
bound = nextBound;
i = nextIndex - 1;
advance = false;
}
}
//判断整个扩容是否已完成或者当前线程扩容任务是否完成
if (i < 0 || i >= n || i + n >= nextn) {
int sc;
//整个扩容完成
if (finishing) {
nextTable = null;
table = nextTab;
//扩容阈值设置为原来容量的1.5倍,相当于现在容量的0.75倍
sizeCtl = (n << 1) - (n >>> 1);
return;
}
//当前线程扩容任务完成
if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, sc - 1)) {
if ((sc - 2) != resizeStamp(n) << RESIZE_STAMP_SHIFT)
return;
finishing = advance = true;
i = n; // recheck before commit
}
} else if ((f = tabAt(tab, i)) == null)
advance = casTabAt(tab, i, null, fwd);
else if ((fh = f.hash) == MOVED) {
/**
* 别的线程已经将这个位置的数据处理完成
* 这个也是可以别的线程帮助扩容的元婴
*/
advance = true; // already processed
} else {
//对当前节点及其所属的链表或者红黑树进行扩容
synchronized (f) {
if (tabAt(tab, i) == f) {
Node<K, V> ln, hn;
if (fh >= 0) {
//将链表分成两个链表
int runBit = fh & n;
Node<K, V> lastRun = f;
for (Node<K, V> p = f.next; p != null; p = p.next) {
int b = p.hash & n;
if (b != runBit) {
runBit = b;
lastRun = p;
}
}
if (runBit == 0) {
ln = lastRun;
hn = null;
} else {
hn = lastRun;
ln = null;
}
for (Node<K, V> p = f; p != lastRun; p = p.next) {
int ph = p.hash;
K pk = p.key;
V pv = p.val;
//通过hash值第n位不同作区分
if ((ph & n) == 0)
ln = new Node<K, V>(ph, pk, pv, ln);
else
hn = new Node<K, V>(ph, pk, pv, hn);
}
setTabAt(nextTab, i, ln);
setTabAt(nextTab, i + n, hn);
//在table的i位置上插入forwardNode(标记)节点
setTabAt(tab, i, fwd);
advance = true;
} else if (f instanceof TreeBin) {
TreeBin<K, V> t = (TreeBin<K, V>) f;
TreeNode<K, V> lo = null, loTail = null;
TreeNode<K, V> hi = null, hiTail = null;
int lc = 0, hc = 0;
for (Node<K, V> e = t.first; e != null; e = e.next) {
int h = e.hash;
TreeNode<K, V> p = new TreeNode<K, V>
(h, e.key, e.val, null, null);
if ((h & n) == 0) {
if ((p.prev = loTail) == null)
lo = p;
else
loTail.next = p;
loTail = p;
++lc;
} else {
if ((p.prev = hiTail) == null)
hi = p;
else
hiTail.next = p;
hiTail = p;
++hc;
}
}
ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) :
(hc != 0) ? new TreeBin<K, V>(lo) : t;
hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) :
(lc != 0) ? new TreeBin<K, V>(hi) : t;
setTabAt(nextTab, i, ln);
setTabAt(nextTab, i + n, hn);
setTabAt(tab, i, fwd);
advance = true;
}
}
}
}
}
}
扫一扫
92
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
