/
HashEntryStages.java
132 lines (105 loc) · 4.09 KB
/
HashEntryStages.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
/*
* Copyright (C) 2015 higherfrequencytrading.com
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package net.openhft.chronicle.hash.impl.stage.entry;
import net.openhft.chronicle.bytes.BytesStore;
import net.openhft.chronicle.bytes.NativeBytesStore;
import net.openhft.chronicle.hash.Data;
import net.openhft.chronicle.hash.HashEntry;
import net.openhft.chronicle.hash.impl.VanillaChronicleHashHolder;
import net.openhft.chronicle.hash.impl.stage.data.bytes.EntryKeyBytesData;
import net.openhft.chronicle.hash.impl.stage.hash.CheckOnEachPublicOperation;
import net.openhft.lang.io.Bytes;
import net.openhft.sg.Stage;
import net.openhft.sg.StageRef;
import net.openhft.sg.Staged;
import org.jetbrains.annotations.NotNull;
@Staged
public abstract class HashEntryStages<K> implements HashEntry<K> {
@StageRef public VanillaChronicleHashHolder<?, ?, ?> hh;
@StageRef public SegmentStages s;
@StageRef public CheckOnEachPublicOperation checkOnEachPublicOperation;
@StageRef public HashLookupPos hlp;
public final Bytes entryBytes = hh.h().ms.bytes();
public final BytesStore entryBS =
new NativeBytesStore<>(entryBytes.address(), entryBytes.capacity(), null, false);
public long pos = -1;
public void initPos(long pos) {
this.pos = pos;
}
public abstract void closePos();
@Stage("EntryOffset") public long keySizeOffset = -1;
public void initEntryOffset() {
keySizeOffset = s.entrySpaceOffset + pos * hh.h().chunkSize;
entryBytes.limit(entryBytes.capacity());
}
public long keySize = -1;
public void initKeySize(long keySize) {
this.keySize = keySize;
}
public long keyOffset = -1;
public void initKeyOffset(long keyOffset) {
this.keyOffset = keyOffset;
}
public void readExistingEntry(long pos) {
initPos(pos);
entryBytes.position(keySizeOffset);
initKeySize(hh.h().keySizeMarshaller.readSize(entryBytes));
initKeyOffset(entryBytes.position());
}
public void writeNewEntry(long pos, Data<?> key) {
initPos(pos);
initKeySize(key.size());
entryBytes.position(keySizeOffset);
hh.h().keySizeMarshaller.writeSize(entryBytes, keySize);
initKeyOffset(entryBytes.position());
key.writeTo(entryBS, keyOffset);
}
public void copyExistingEntry(long newPos, long bytesToCopy) {
long oldKeySizeOffset = keySizeOffset;
long oldKeyOffset = keyOffset;
initPos(newPos);
initKeyOffset(keySizeOffset + (oldKeyOffset - oldKeySizeOffset));
entryBS.write(keySizeOffset, entryBS, oldKeySizeOffset, bytesToCopy);
}
public long keyEnd() {
return keyOffset + keySize;
}
protected long entryEnd() {
return keyEnd();
}
long entrySize() {
return entryEnd() - keySizeOffset;
}
@StageRef EntryKeyBytesData<K> entryKey;
@NotNull
@Override
public Data<K> key() {
checkOnEachPublicOperation.checkOnEachPublicOperation();
return entryKey;
}
@Stage("EntrySizeInChunks") public int entrySizeInChunks = 0;
void initEntrySizeInChunks() {
entrySizeInChunks = hh.h().inChunks(entrySize());
}
public void initEntrySizeInChunks(int actuallyUsedChunks) {
entrySizeInChunks = actuallyUsedChunks;
}
public void innerRemoveEntryExceptHashLookupUpdate() {
s.free(pos, entrySizeInChunks);
s.entries(s.entries() - 1L);
s.incrementModCount();
}
}