-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
RecordRelationshipTraversalCursorTest.java
263 lines (232 loc) · 9.99 KB
/
RecordRelationshipTraversalCursorTest.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
/*
* 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.storageengine.impl.recordstorage;
import org.junit.After;
import org.junit.Before;
import org.junit.Rule;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Parameterized;
import java.io.File;
import java.util.Arrays;
import org.neo4j.io.fs.FileSystemAbstraction;
import org.neo4j.io.pagecache.PageCache;
import org.neo4j.kernel.configuration.Config;
import org.neo4j.kernel.impl.store.NeoStores;
import org.neo4j.kernel.impl.store.RecordStore;
import org.neo4j.kernel.impl.store.RelationshipStore;
import org.neo4j.kernel.impl.store.StoreFactory;
import org.neo4j.kernel.impl.store.id.DefaultIdGeneratorFactory;
import org.neo4j.kernel.impl.store.record.Record;
import org.neo4j.kernel.impl.store.record.RecordLoad;
import org.neo4j.kernel.impl.store.record.RelationshipGroupRecord;
import org.neo4j.kernel.impl.store.record.RelationshipRecord;
import org.neo4j.logging.NullLogProvider;
import org.neo4j.storageengine.api.RelationshipDirection;
import org.neo4j.test.rule.PageCacheAndDependenciesRule;
import org.neo4j.test.rule.fs.DefaultFileSystemRule;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import static org.neo4j.graphdb.factory.GraphDatabaseSettings.pagecache_memory;
import static org.neo4j.io.pagecache.tracing.cursor.context.EmptyVersionContextSupplier.EMPTY;
import static org.neo4j.kernel.impl.store.record.Record.NO_NEXT_RELATIONSHIP;
import static org.neo4j.storageengine.api.RelationshipDirection.INCOMING;
import static org.neo4j.storageengine.api.RelationshipDirection.LOOP;
import static org.neo4j.storageengine.api.RelationshipDirection.OUTGOING;
@RunWith( Parameterized.class )
public class RecordRelationshipTraversalCursorTest
{
private static final long FIRST_OWNING_NODE = 1;
private static final long SECOND_OWNING_NODE = 2;
private static final int TYPE = 0;
@Rule
public final PageCacheAndDependenciesRule storage = new PageCacheAndDependenciesRule( DefaultFileSystemRule::new, getClass() );
private NeoStores neoStores;
@Parameterized.Parameter
public RelationshipDirection direction;
@Parameterized.Parameter( value = 1 )
public boolean dense;
@Parameterized.Parameters
public static Iterable<Object[]> parameters()
{
return Arrays.asList( new Object[][]{
{LOOP, false},
{LOOP, true},
{OUTGOING, false},
{OUTGOING, true},
{INCOMING, false},
{INCOMING, true}
} );
}
@Before
public void setupStores()
{
File storeDir = storage.directory().absolutePath();
Config config = Config.defaults( pagecache_memory, "8m" );
PageCache pageCache = storage.pageCache();
FileSystemAbstraction fs = storage.fileSystem();
DefaultIdGeneratorFactory idGeneratorFactory = new DefaultIdGeneratorFactory( fs );
NullLogProvider logProvider = NullLogProvider.getInstance();
StoreFactory storeFactory = new StoreFactory( storeDir, config, idGeneratorFactory, pageCache, fs, logProvider, EMPTY );
neoStores = storeFactory.openAllNeoStores( true );
}
@After
public void shutDownStores() throws Exception
{
neoStores.close();
}
@Test
public void retrieveNodeRelationships()
{
createNodeRelationships();
try ( RecordRelationshipTraversalCursor cursor = getNodeRelationshipCursor() )
{
cursor.init( FIRST_OWNING_NODE, 1L );
assertTrue( cursor.next() );
cursor.init( FIRST_OWNING_NODE, 2 );
assertTrue( cursor.next() );
cursor.init( FIRST_OWNING_NODE, 3 );
assertTrue( cursor.next() );
}
}
@Test
public void retrieveUsedRelationshipChain()
{
createRelationshipChain( 4 );
long expectedNodeId = 1;
try ( RecordRelationshipTraversalCursor cursor = getNodeRelationshipCursor() )
{
cursor.init( FIRST_OWNING_NODE, 1 );
while ( cursor.next() )
{
assertEquals( "Should load next relationship in a sequence", expectedNodeId++, cursor.relationshipReference() );
}
}
}
@Test
public void retrieveRelationshipChainWithUnusedLink()
{
neoStores.getRelationshipStore().setHighId( 10 );
createRelationshipChain( 4 );
unUseRecord( 3 );
int[] expectedRelationshipIds = new int[]{1, 2, 4};
int relationshipIndex = 0;
try ( RecordRelationshipTraversalCursor cursor = getNodeRelationshipCursor() )
{
cursor.init( FIRST_OWNING_NODE, 1 );
while ( cursor.next() )
{
assertEquals( "Should load next relationship in a sequence",
expectedRelationshipIds[relationshipIndex++], cursor.relationshipReference() );
}
}
}
@Test
public void shouldHandleDenseNodeWithNoRelationships()
{
// This can actually happen, since we upgrade sparse node --> dense node when creating relationships,
// but we don't downgrade dense --> sparse when we delete relationships. So if we have a dense node
// which no longer has relationships, there was this assumption that we could just call getRecord
// on the NodeRecord#getNextRel() value. Although that value could actually be -1
try ( RecordRelationshipTraversalCursor cursor = getNodeRelationshipCursor() )
{
// WHEN
cursor.init( FIRST_OWNING_NODE, NO_NEXT_RELATIONSHIP.intValue() );
// THEN
assertFalse( cursor.next() );
}
}
private void createNodeRelationships()
{
RelationshipStore relationshipStore = neoStores.getRelationshipStore();
if ( dense )
{
RecordStore<RelationshipGroupRecord> relationshipGroupStore = neoStores.getRelationshipGroupStore();
relationshipGroupStore.updateRecord( createRelationshipGroup( 1, 1 ) );
relationshipGroupStore.updateRecord( createRelationshipGroup( 2, 2 ) );
relationshipGroupStore.updateRecord( createRelationshipGroup( 3, 3 ) );
}
relationshipStore.updateRecord( createRelationship( 1, NO_NEXT_RELATIONSHIP.intValue() ) );
relationshipStore.updateRecord( createRelationship( 2, NO_NEXT_RELATIONSHIP.intValue() ) );
relationshipStore.updateRecord( createRelationship( 3, NO_NEXT_RELATIONSHIP.intValue() ) );
}
private void unUseRecord( long recordId )
{
RelationshipStore relationshipStore = neoStores.getRelationshipStore();
RelationshipRecord relationshipRecord = relationshipStore.getRecord( recordId, new RelationshipRecord( -1 ),
RecordLoad.FORCE );
relationshipRecord.setInUse( false );
relationshipStore.updateRecord( relationshipRecord );
}
private RelationshipGroupRecord createRelationshipGroup( long id, long relationshipId )
{
return new RelationshipGroupRecord( id, TYPE, getFirstOut( relationshipId ),
getFirstIn( relationshipId ), getFirstLoop( relationshipId ), FIRST_OWNING_NODE, true );
}
private long getFirstLoop( long firstLoop )
{
return direction == LOOP ? firstLoop : Record.NO_NEXT_RELATIONSHIP.intValue();
}
private long getFirstIn( long firstIn )
{
return direction == INCOMING ? firstIn : Record.NO_NEXT_RELATIONSHIP.intValue();
}
private long getFirstOut( long firstOut )
{
return direction == OUTGOING ? firstOut : Record.NO_NEXT_RELATIONSHIP.intValue();
}
private void createRelationshipChain( int recordsInChain )
{
RelationshipStore relationshipStore = neoStores.getRelationshipStore();
for ( int i = 1; i < recordsInChain; i++ )
{
relationshipStore.updateRecord( createRelationship( i, i + 1 ) );
}
relationshipStore.updateRecord( createRelationship( recordsInChain, NO_NEXT_RELATIONSHIP.intValue() ) );
if ( dense )
{
RecordStore<RelationshipGroupRecord> relationshipGroupStore = neoStores.getRelationshipGroupStore();
for ( int i = 1; i < recordsInChain; i++ )
{
relationshipGroupStore.updateRecord( createRelationshipGroup( i, i ) );
}
relationshipGroupStore
.updateRecord( createRelationshipGroup( recordsInChain, NO_NEXT_RELATIONSHIP.intValue() ) );
}
}
private RelationshipRecord createRelationship( long id, long nextRelationship )
{
return new RelationshipRecord( id, true, getFirstNode(), getSecondNode(), TYPE, NO_NEXT_RELATIONSHIP.intValue(),
nextRelationship, NO_NEXT_RELATIONSHIP.intValue(), nextRelationship, false, false );
}
private long getSecondNode()
{
return getFirstNode() == FIRST_OWNING_NODE ? SECOND_OWNING_NODE : FIRST_OWNING_NODE;
}
private long getFirstNode()
{
return direction == OUTGOING ? FIRST_OWNING_NODE : SECOND_OWNING_NODE;
}
private RecordRelationshipTraversalCursor getNodeRelationshipCursor()
{
return new RecordRelationshipTraversalCursor( neoStores.getRelationshipStore(), neoStores.getRelationshipGroupStore() );
}
}