-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
QueueDistribution.java
119 lines (108 loc) · 3.97 KB
/
QueueDistribution.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
/*
* Copyright (c) 2002-2016 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.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.consistency.checking.full;
import org.neo4j.consistency.checking.full.RecordDistributor.RecordConsumer;
import org.neo4j.kernel.impl.store.record.RelationshipRecord;
/**
* Factory for creating {@link QueueDistribution}. Typically the distribution type is decided higher up
* in the call stack and the actual {@link QueueDistributor} is instantiated when more data is available
* deeper down in the call stack.
*/
public interface QueueDistribution
{
<RECORD> QueueDistributor<RECORD> distributor( long recordsPerCpu, int numberOfThreads );
/**
* Distributes records into {@link RecordConsumer}.
*/
public interface QueueDistributor<RECORD>
{
void distribute( RECORD record, RecordConsumer<RECORD> consumer ) throws InterruptedException;
}
/**
* Distributes records round-robin style to all queues.
*/
public static final QueueDistribution ROUND_ROBIN = new QueueDistribution()
{
@Override
public <RECORD> QueueDistributor<RECORD> distributor( long recordsPerCpu, int numberOfThreads )
{
return new RoundRobinQueueDistributor<>( numberOfThreads );
}
};
/**
* Distributes {@link RelationshipRecord} depending on the start/end node ids.
*/
public static final QueueDistribution RELATIONSHIPS = new QueueDistribution()
{
@Override
public QueueDistributor<RelationshipRecord> distributor( long recordsPerCpu, int numberOfThreads )
{
return new RelationshipNodesQueueDistributor( recordsPerCpu );
}
};
static class RoundRobinQueueDistributor<RECORD> implements QueueDistributor<RECORD>
{
private final int numberOfThreads;
private int nextQIndex;
public RoundRobinQueueDistributor( int numberOfThreads )
{
this.numberOfThreads = numberOfThreads;
}
@Override
public void distribute( RECORD record, RecordConsumer<RECORD> consumer ) throws InterruptedException
{
try
{
consumer.accept( record, nextQIndex );
}
finally
{
nextQIndex = (nextQIndex + 1) % numberOfThreads;
}
}
}
static class RelationshipNodesQueueDistributor implements QueueDistributor<RelationshipRecord>
{
private final long recordsPerCpu;
public RelationshipNodesQueueDistributor( long recordsPerCpu )
{
this.recordsPerCpu = recordsPerCpu;
}
@Override
public void distribute( RelationshipRecord relationship, RecordConsumer<RelationshipRecord> consumer )
throws InterruptedException
{
int qIndex1 = (int) (relationship.getFirstNode() / recordsPerCpu);
int qIndex2 = (int) (relationship.getSecondNode() / recordsPerCpu);
try
{
consumer.accept( relationship, qIndex1 );
if ( qIndex1 != qIndex2 )
{
consumer.accept( relationship, qIndex2 );
}
}
catch ( ArrayIndexOutOfBoundsException e )
{
throw e;
}
}
}
}