-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
CentralJobSchedulerTest.java
319 lines (276 loc) · 9.91 KB
/
CentralJobSchedulerTest.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
/*
* 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.scheduler;
import org.junit.After;
import org.junit.Test;
import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.CancellationException;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.atomic.AtomicLong;
import java.util.concurrent.locks.LockSupport;
import org.neo4j.kernel.lifecycle.LifeSupport;
import org.neo4j.scheduler.JobScheduler;
import org.neo4j.scheduler.JobScheduler.JobHandle;
import org.neo4j.util.concurrent.BinaryLatch;
import static java.lang.Thread.sleep;
import static java.util.concurrent.TimeUnit.MILLISECONDS;
import static org.hamcrest.Matchers.both;
import static org.hamcrest.Matchers.equalTo;
import static org.hamcrest.Matchers.greaterThanOrEqualTo;
import static org.hamcrest.Matchers.is;
import static org.hamcrest.Matchers.lessThanOrEqualTo;
import static org.junit.Assert.assertThat;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
import static org.neo4j.scheduler.JobScheduler.Groups.indexPopulation;
public class CentralJobSchedulerTest
{
private final AtomicInteger invocations = new AtomicInteger();
private final LifeSupport life = new LifeSupport();
private final CentralJobScheduler scheduler = life.add( new CentralJobScheduler() );
private final Runnable countInvocationsJob = invocations::incrementAndGet;
@After
public void stopScheduler()
{
life.shutdown();
}
// Tests schedules a recurring job to run 5 times with 100ms in between.
// The timeout of 10s should be enough.
@Test( timeout = 10_000 )
public void shouldRunRecurringJob() throws Throwable
{
// Given
long period = 10;
int count = 5;
life.start();
// When
scheduler.scheduleRecurring( indexPopulation, countInvocationsJob, period, MILLISECONDS );
awaitInvocationCount( count );
scheduler.shutdown();
// Then assert that the recurring job was stopped (when the scheduler was shut down)
int actualInvocations = invocations.get();
sleep( period * 5 );
assertThat( invocations.get(), equalTo( actualInvocations ) );
}
@Test
public void shouldCancelRecurringJob() throws Exception
{
// Given
long period = 2;
life.start();
JobScheduler.JobHandle jobHandle =
scheduler.scheduleRecurring( indexPopulation, countInvocationsJob, period, MILLISECONDS );
awaitFirstInvocation();
// When
jobHandle.cancel( false );
try
{
jobHandle.waitTermination();
fail( "Task should be terminated" );
}
catch ( CancellationException ignored )
{
// task should be canceled
}
// Then
int recorded = invocations.get();
sleep( period * 100 );
// we can have task that is already running during cancellation so lets count it as well
assertThat( invocations.get(),
both( greaterThanOrEqualTo( recorded ) ).and( lessThanOrEqualTo( recorded + 1 ) ) );
}
@Test
public void shouldRunWithDelay() throws Throwable
{
// Given
life.start();
final AtomicLong runTime = new AtomicLong();
final CountDownLatch latch = new CountDownLatch( 1 );
long time = System.nanoTime();
scheduler.schedule( indexPopulation, () ->
{
runTime.set( System.nanoTime() );
latch.countDown();
}, 100, TimeUnit.MILLISECONDS );
latch.await();
assertTrue( time + TimeUnit.MILLISECONDS.toNanos( 100 ) <= runTime.get() );
}
@Test
public void longRunningScheduledJobsMustNotDelayOtherLongRunningJobs()
{
life.start();
List<JobHandle> handles = new ArrayList<>( 30 );
AtomicLong startedCounter = new AtomicLong();
BinaryLatch blockLatch = new BinaryLatch();
Runnable task = () ->
{
startedCounter.incrementAndGet();
blockLatch.await();
};
for ( int i = 0; i < 10; i++ )
{
handles.add( scheduler.schedule( indexPopulation, task, 0, TimeUnit.MILLISECONDS ) );
}
for ( int i = 0; i < 10; i++ )
{
handles.add( scheduler.scheduleRecurring( indexPopulation, task, Integer.MAX_VALUE, TimeUnit.MILLISECONDS ) );
}
for ( int i = 0; i < 10; i++ )
{
handles.add( scheduler.scheduleRecurring( indexPopulation, task, 0, Integer.MAX_VALUE, TimeUnit.MILLISECONDS ) );
}
long deadline = TimeUnit.SECONDS.toNanos( 10 ) + System.nanoTime();
do
{
if ( startedCounter.get() == handles.size() )
{
// All jobs got started. We're good!
blockLatch.release();
for ( JobHandle handle : handles )
{
handle.cancel( false );
}
return;
}
}
while ( System.nanoTime() < deadline );
fail( "Only managed to start " + startedCounter.get() + " tasks in 10 seconds, when " +
handles.size() + " was expected." );
}
@Test
public void shouldNotifyCancelListeners()
{
// GIVEN
CentralJobScheduler centralJobScheduler = new CentralJobScheduler();
centralJobScheduler.init();
// WHEN
AtomicBoolean halted = new AtomicBoolean();
Runnable job = () ->
{
while ( !halted.get() )
{
LockSupport.parkNanos( MILLISECONDS.toNanos( 10 ) );
}
};
JobHandle handle = centralJobScheduler.schedule( indexPopulation, job );
handle.registerCancelListener( mayBeInterrupted -> halted.set( true ) );
handle.cancel( false );
// THEN
assertTrue( halted.get() );
centralJobScheduler.shutdown();
}
@Test( timeout = 10_000 )
public void waitTerminationOnDelayedJobMustWaitUntilJobCompletion() throws Exception
{
CentralJobScheduler scheduler = new CentralJobScheduler();
scheduler.init();
AtomicBoolean triggered = new AtomicBoolean();
Runnable job = () ->
{
LockSupport.parkNanos( TimeUnit.MILLISECONDS.toNanos( 10 ) );
triggered.set( true );
};
JobHandle handle = scheduler.schedule( indexPopulation, job, 10, TimeUnit.MILLISECONDS );
handle.waitTermination();
assertTrue( triggered.get() );
}
@Test( timeout = 10_000 )
public void scheduledTasksThatThrowsMustPropagateException() throws Exception
{
CentralJobScheduler scheduler = new CentralJobScheduler();
scheduler.init();
RuntimeException boom = new RuntimeException( "boom" );
AtomicInteger triggerCounter = new AtomicInteger();
Runnable job = () ->
{
triggerCounter.incrementAndGet();
throw boom;
};
JobHandle handle = scheduler.scheduleRecurring( indexPopulation, job, 1, TimeUnit.MILLISECONDS );
try
{
handle.waitTermination();
fail( "waitTermination should have failed." );
}
catch ( ExecutionException e )
{
assertThat( e.getCause(), is( boom ) );
}
}
@Test( timeout = 10_000 )
public void scheduledTasksThatThrowsShouldStop() throws Exception
{
CentralJobScheduler scheduler = new CentralJobScheduler();
scheduler.init();
BinaryLatch triggerLatch = new BinaryLatch();
RuntimeException boom = new RuntimeException( "boom" );
AtomicInteger triggerCounter = new AtomicInteger();
Runnable job = () ->
{
triggerCounter.incrementAndGet();
triggerLatch.release();
throw boom;
};
scheduler.scheduleRecurring( indexPopulation, job, 1, TimeUnit.MILLISECONDS );
triggerLatch.await();
Thread.sleep( 50 );
assertThat( triggerCounter.get(), is( 1 ) );
}
@Test( timeout = 10_000 )
public void shutDownMustKillCancelledJobs()
{
CentralJobScheduler scheduler = new CentralJobScheduler();
scheduler.init();
BinaryLatch startLatch = new BinaryLatch();
BinaryLatch stopLatch = new BinaryLatch();
scheduler.schedule( indexPopulation, () ->
{
try
{
startLatch.release();
Thread.sleep( 100_000 );
}
catch ( InterruptedException e )
{
stopLatch.release();
throw new RuntimeException( e );
}
} );
startLatch.await();
scheduler.shutdown();
stopLatch.await();
}
private void awaitFirstInvocation() throws InterruptedException
{
awaitInvocationCount( 1 );
}
private void awaitInvocationCount( int count ) throws InterruptedException
{
while ( invocations.get() < count )
{
Thread.sleep( 10 );
}
}
}