blob: 28d416b8cfc889690bd6bb37fcd3d6bfa544730d (
plain)
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
|
/*
* Copyright 2019 Google LLC
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package io.perfmark.java9;
import io.perfmark.Link;
import io.perfmark.PerfMark;
import io.perfmark.Tag;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.ForkJoinTask;
import java.util.concurrent.RecursiveTask;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
@RunWith(JUnit4.class)
public class PerfMarkStressTest {
@Test
public void fibonacci() {
ForkJoinPool fjp = new ForkJoinPool(8);
final class Fibonacci extends RecursiveTask<Long> {
private final long input;
private final Link link;
Fibonacci(long input, Link link) {
this.input = input;
this.link = link;
}
@Override
protected Long compute() {
Tag tag = PerfMark.createTag(input);
PerfMark.startTask("compute", tag);
PerfMark.linkIn(link);
try {
if (input >= 20) {
Link link2 = PerfMark.linkOut();
ForkJoinTask<Long> task1 = new Fibonacci(input - 1, link2).fork();
Fibonacci task2 = new Fibonacci(input - 2, link2);
return task2.compute() + task1.join();
} else {
return computeUnboxed(input);
}
} finally {
PerfMark.stopTask("compute", tag);
}
}
private long computeUnboxed(long n) {
if (n <= 1) {
return n;
}
return computeUnboxed(n - 1) + computeUnboxed(n - 2);
}
}
PerfMark.setEnabled(true);
PerfMark.startTask("calc");
Link link = PerfMark.linkOut();
ForkJoinTask<Long> task = new Fibonacci(30, link);
fjp.execute(task);
PerfMark.stopTask("calc");
Long res;
try {
res = task.get();
} catch (Exception e) {
throw new RuntimeException(e);
}
System.err.println(res);
fjp.shutdown();
}
}
|
