942 |
|
} |
943 |
|
|
944 |
|
/** |
945 |
< |
* Remove node if its key or value are null |
945 |
> |
* Removes node if its key or value are null. |
946 |
|
*/ |
947 |
|
final void removeIfReclaimed(Node r) { |
948 |
|
int hash = r.getLocator(); |
3045 |
|
} |
3046 |
|
|
3047 |
|
// Fenced store into segment table array. Unneeded when we have Fences |
3048 |
< |
static final void storeNode(Node[] table, |
3049 |
< |
int i, Node r) { |
3048 |
> |
static final void storeNode(Node[] table, |
3049 |
> |
int i, Node r) { |
3050 |
|
long nodeOffset = ((long) i << tableShift) + tableBase; |
3051 |
|
UNSAFE.putOrderedObject(table, nodeOffset, r); |
3052 |
|
} |
3053 |
|
|
3054 |
< |
static final void storeSegment(Segment[] segs, |
3055 |
< |
int i, Segment s) { |
3054 |
> |
static final void storeSegment(Segment[] segs, |
3055 |
> |
int i, Segment s) { |
3056 |
|
long segmentOffset = ((long) i << segmentsShift) + segmentsBase; |
3057 |
|
UNSAFE.putOrderedObject(segs, segmentOffset, s); |
3058 |
|
} |