java自带的resize方法_Java ConcurrentHashMap的tryPresize方法

private final void tryPresize(int size) {

int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :tableSizeFor(size + (size >>> 1) + 1);

int sc;

while ((sc = sizeCtl) >= 0) {

Node[] tab = table; int n;

if (tab == null || (n = tab.length) == 0) {//初始化表

//省略

}

else if (c <= sc || n >= MAXIMUM_CAPACITY)

break;

else if (tab == table) {// 需要扩容

int rs = resizeStamp(n);

if (sc < 0) {// sc<0表示，已经有其他线程正在扩容。？？这个情况会发生嘛

Node[] nt;

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);

}

}

}