1003 |
|
} |
1004 |
|
else if ((fh = f.hash) == MOVED) |
1005 |
|
tab = helpTransfer(tab, f); |
1006 |
< |
else if (onlyIfAbsent && fh == hash && // check first node |
1007 |
< |
((fk = f.key) == key || fk != null && key.equals(fk)) && |
1008 |
< |
(fv = f.val) != null) |
1006 |
> |
else if (onlyIfAbsent // check first node without acquiring lock |
1007 |
> |
&& fh == hash |
1008 |
> |
&& ((fk = f.key) == key || (fk != null && key.equals(fk))) |
1009 |
> |
&& (fv = f.val) != null) |
1010 |
|
return fv; |
1011 |
|
else { |
1012 |
|
V oldVal = null; |
1700 |
|
} |
1701 |
|
else if ((fh = f.hash) == MOVED) |
1702 |
|
tab = helpTransfer(tab, f); |
1703 |
< |
else if (fh == h && // check first node |
1704 |
< |
((fk = f.key) == key || fk != null && key.equals(fk)) && |
1705 |
< |
(fv = f.val) != null) |
1703 |
> |
else if (fh == h // check first node without acquiring lock |
1704 |
> |
&& ((fk = f.key) == key || (fk != null && key.equals(fk))) |
1705 |
> |
&& (fv = f.val) != null) |
1706 |
|
return fv; |
1707 |
|
else { |
1708 |
|
boolean added = false; |