Alawn/Chronicle-Map
1
0
Fork 0
mirror of https://github.com/OpenHFT/Chronicle-Map.git synced 2021-09-13 01:26:12 +00:00
Code Releases Activity

Minor optimization in HashLookupSearch.nextPos()

Browse Source
This commit is contained in:
leventov
2016-07-17 23:36:00 +07:00
parent 7afe1eca13
commit 33daa3bb9b
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/main/java/net/openhft/chronicle/hash/impl/stage/entry/HashLookupSearch.java
+6 -5
View File
@@ -53,20 +53,21 @@ public abstract class HashLookupSearch {
public long nextPos() {
long pos = hlp.hashLookupPos;
CompactOffHeapLinearHashTable hl = hl();
while (true) {
// read volatile to make a happens-before edge between entry insertion from concurrent
// thread under update lock and this thread (reading the entry)
long entry = hl().readEntryVolatile(addr(), pos);
if (hl().empty(entry)) {
long entry = hl.readEntryVolatile(addr(), pos);
if (hl.empty(entry)) {
hlp.setHashLookupPos(pos);
return -1L;
}
pos = hl().step(pos);
pos = hl.step(pos);
if (pos == searchStartPos)
break;
if (hl().key(entry) == searchKey) {
if (hl.key(entry) == searchKey) {
hlp.setHashLookupPos(pos);
return hl().value(entry);
return hl.value(entry);
}
}
throw new IllegalStateException("HashLookup overflow should never occur");