-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
PropertyRecord.java
413 lines (365 loc) · 11.8 KB
/
PropertyRecord.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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
/*
* Copyright (c) 2002-2018 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.kernel.impl.store.record;
import java.util.Arrays;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.NoSuchElementException;
import org.neo4j.kernel.impl.store.PropertyType;
import static org.neo4j.kernel.impl.store.record.Record.NO_NEXT_PROPERTY;
import static org.neo4j.kernel.impl.store.record.Record.NO_PREVIOUS_PROPERTY;
/**
* PropertyRecord is a container for PropertyBlocks. PropertyRecords form
* a double linked list and each one holds one or more PropertyBlocks that
* are the actual property key/value pairs. Because PropertyBlocks are of
* variable length, a full PropertyRecord can be holding just one
* PropertyBlock.
*/
public class PropertyRecord extends AbstractBaseRecord implements Iterable<PropertyBlock>
{
private static final byte TYPE_NODE = 1;
private static final byte TYPE_REL = 2;
private long nextProp;
private long prevProp;
// Holds the purely physical representation of the loaded properties in this record. This is so that
// RecordPropertyCursor is able to use this raw data without the rather heavy and bloated data structures
// of PropertyBlock and thereabouts. So when a property record is loaded only these blocks are read,
// the construction of all PropertyBlock instances are loaded lazily when they are first needed, loaded
// by ensureBlocksLoaded().
// Modifications to a property record are still done on the PropertyBlock abstraction and so it's also
// that data that gets written to the log and record when it's time to do so.
private final long[] blocks = new long[PropertyType.getPayloadSizeLongs()];
private int blocksCursor;
// These MUST ONLY be populated if we're accessing PropertyBlocks. On just loading this record only the
// next/prev and blocks should be filled.
private final PropertyBlock[] blockRecords =
new PropertyBlock[PropertyType.getPayloadSizeLongs() /*we can have at most these many*/];
private boolean blocksLoaded;
private int blockRecordsCursor;
private long entityId;
private byte entityType;
private List<DynamicRecord> deletedRecords;
public PropertyRecord( long id )
{
super( id );
}
public PropertyRecord( long id, PrimitiveRecord primitive )
{
super( id );
primitive.setIdTo( this );
}
public PropertyRecord initialize( boolean inUse, long prevProp, long nextProp )
{
super.initialize( inUse );
this.prevProp = prevProp;
this.nextProp = nextProp;
this.deletedRecords = null;
this.blockRecordsCursor = blocksCursor = 0;
this.blocksLoaded = false;
return this;
}
@Override
public void clear()
{
super.initialize( false );
this.entityId = -1;
this.entityType = 0;
this.prevProp = NO_PREVIOUS_PROPERTY.intValue();
this.nextProp = NO_NEXT_PROPERTY.intValue();
this.deletedRecords = null;
this.blockRecordsCursor = blocksCursor = 0;
this.blocksLoaded = false;
}
public void setNodeId( long nodeId )
{
entityType = TYPE_NODE;
entityId = nodeId;
}
public void setRelId( long relId )
{
entityType = TYPE_REL;
entityId = relId;
}
public boolean isNodeSet()
{
return entityType == TYPE_NODE;
}
public boolean isRelSet()
{
return entityType == TYPE_REL;
}
public long getNodeId()
{
if ( isNodeSet() )
{
return entityId;
}
return -1;
}
public long getRelId()
{
if ( isRelSet() )
{
return entityId;
}
return -1;
}
public long getEntityId()
{
return entityId;
}
/**
* Gets the sum of the sizes of the blocks in this record, in bytes.
*/
public int size()
{
ensureBlocksLoaded();
int result = 0;
for ( int i = 0; i < blockRecordsCursor; i++ )
{
result += blockRecords[i].getSize();
}
return result;
}
public int numberOfProperties()
{
ensureBlocksLoaded();
return blockRecordsCursor;
}
@Override
public Iterator<PropertyBlock> iterator()
{
ensureBlocksLoaded();
return new Iterator<PropertyBlock>()
{
// state for the Iterator aspect of this class.
private int blockRecordsIteratorCursor;
private boolean canRemoveFromIterator;
@Override
public boolean hasNext()
{
return blockRecordsIteratorCursor < blockRecordsCursor;
}
@Override
public PropertyBlock next()
{
if ( !hasNext() )
{
throw new NoSuchElementException();
}
canRemoveFromIterator = true;
return blockRecords[blockRecordsIteratorCursor++];
}
@Override
public void remove()
{
if ( !canRemoveFromIterator )
{
throw new IllegalStateException(
"cursor:" + blockRecordsIteratorCursor + " canRemove:" + canRemoveFromIterator );
}
if ( --blockRecordsCursor > --blockRecordsIteratorCursor )
{
blockRecords[blockRecordsIteratorCursor] = blockRecords[blockRecordsCursor];
}
canRemoveFromIterator = false;
}
};
}
public List<DynamicRecord> getDeletedRecords()
{
return deletedRecords != null ? deletedRecords : Collections.emptyList();
}
public void addDeletedRecord( DynamicRecord record )
{
assert !record.inUse();
if ( deletedRecords == null )
{
deletedRecords = new LinkedList<>();
}
deletedRecords.add( record );
}
public void addPropertyBlock( PropertyBlock block )
{
ensureBlocksLoaded();
assert size() + block.getSize() <= PropertyType.getPayloadSize() :
"Exceeded capacity of property record " + this
+ ". My current size is reported as " + size() + "The added block was " + block +
" (note that size is " + block.getSize() + ")";
blockRecords[blockRecordsCursor++] = block;
}
/**
* Reads blocks[] and constructs {@link PropertyBlock} instances from them, making that abstraction
* available to the outside. Done the first time any PropertyBlock is needed or manipulated.
*/
private void ensureBlocksLoaded()
{
if ( !blocksLoaded )
{
assert blockRecordsCursor == 0;
// We haven't loaded the blocks yet, please do so now
int index = 0;
while ( index < blocksCursor )
{
PropertyType type = PropertyType.getPropertyTypeOrThrow( blocks[index] );
PropertyBlock block = new PropertyBlock();
int length = type.calculateNumberOfBlocksUsed( blocks[index] );
block.setValueBlocks( Arrays.copyOfRange( blocks, index, index + length ) );
blockRecords[blockRecordsCursor++] = block;
index += length;
}
blocksLoaded = true;
}
}
public void setPropertyBlock( PropertyBlock block )
{
removePropertyBlock( block.getKeyIndexId() );
addPropertyBlock( block );
}
public PropertyBlock getPropertyBlock( int keyIndex )
{
ensureBlocksLoaded();
for ( int i = 0; i < blockRecordsCursor; i++ )
{
PropertyBlock block = blockRecords[i];
if ( block.getKeyIndexId() == keyIndex )
{
return block;
}
}
return null;
}
public PropertyBlock removePropertyBlock( int keyIndex )
{
ensureBlocksLoaded();
for ( int i = 0; i < blockRecordsCursor; i++ )
{
if ( blockRecords[i].getKeyIndexId() == keyIndex )
{
PropertyBlock block = blockRecords[i];
if ( --blockRecordsCursor > i )
{
blockRecords[i] = blockRecords[blockRecordsCursor];
}
return block;
}
}
return null;
}
public void clearPropertyBlocks()
{
blockRecordsCursor = 0;
}
public long getNextProp()
{
return nextProp;
}
public void setNextProp( long nextProp )
{
this.nextProp = nextProp;
}
@Override
public String toString()
{
StringBuilder buf = new StringBuilder();
buf.append( "Property[" ).append( getId() ).append( ",used=" ).append( inUse() ).append( ",prev=" ).append(
prevProp ).append( ",next=" ).append( nextProp );
if ( entityId != -1 )
{
buf.append( entityType == TYPE_NODE ? ",node=" : ",rel=" ).append( entityId );
}
if ( blocksLoaded )
{
for ( int i = 0; i < blockRecordsCursor; i++ )
{
buf.append( ',' ).append( blockRecords[i] );
}
}
else
{
buf.append( ", (blocks not loaded)" );
}
if ( deletedRecords != null )
{
for ( DynamicRecord dyn : deletedRecords )
{
buf.append( ", del:" ).append( dyn );
}
}
buf.append( "]" );
return buf.toString();
}
public void setChanged( PrimitiveRecord primitive )
{
primitive.setIdTo( this );
}
public long getPrevProp()
{
return prevProp;
}
public void setPrevProp( long prev )
{
prevProp = prev;
}
@Override
public PropertyRecord clone()
{
PropertyRecord result = (PropertyRecord) new PropertyRecord( getId() ).initialize( inUse() );
result.nextProp = nextProp;
result.prevProp = prevProp;
result.entityId = entityId;
result.entityType = entityType;
System.arraycopy( blocks, 0, result.blocks, 0, blocks.length );
result.blocksCursor = blocksCursor;
for ( int i = 0; i < blockRecordsCursor; i++ )
{
result.blockRecords[i] = blockRecords[i].clone();
}
result.blockRecordsCursor = blockRecordsCursor;
result.blocksLoaded = blocksLoaded;
if ( deletedRecords != null )
{
for ( DynamicRecord deletedRecord : deletedRecords )
{
result.addDeletedRecord( deletedRecord.clone() );
}
}
return result;
}
public long[] getBlocks()
{
return blocks;
}
public void addLoadedBlock( long block )
{
assert blocksCursor + 1 <= blocks.length : "Capacity of " + blocks.length + " exceeded";
blocks[blocksCursor++] = block;
}
public int getBlockCapacity()
{
return blocks.length;
}
public int getNumberOfBlocks()
{
return blocksCursor;
}
}