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
|
/*
* WarmRoast
* Copyright (C) 2013 Albert Pham <http://www.sk89q.com>
*
* This program 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 me.lucko.spark.profiler;
import com.google.gson.stream.JsonWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.atomic.LongAdder;
/**
* Represents a node in the overall sampling stack.
*
* <p>The base implementation of this class is only used for the root of node structures. The
* {@link StackTraceNode} class is used for representing method calls in the structure.</p>
*/
public class StackNode implements Comparable<StackNode> {
private static final int MAX_STACK_DEPTH = 300;
/**
* The name of this node
*/
private final String name;
/**
* A map of this nodes children
*/
private final Map<String, StackNode> children = new ConcurrentHashMap<>();
/**
* The accumulated sample time for this node
*/
private final LongAdder totalTime = new LongAdder();
public StackNode(String name) {
this.name = name;
}
public String getName() {
return this.name;
}
public Collection<StackNode> getChildren() {
if (this.children.isEmpty()) {
return Collections.emptyList();
}
List<StackNode> list = new ArrayList<>(this.children.values());
list.sort(null);
return list;
}
private StackNode resolveChild(String name) {
return this.children.computeIfAbsent(name, StackNode::new);
}
private StackNode resolveChild(String className, String methodName) {
return this.children.computeIfAbsent(StackTraceNode.formName(className, methodName), name -> new StackTraceNode(className, methodName));
}
public long getTotalTime() {
return this.totalTime.longValue();
}
public void accumulateTime(long time) {
this.totalTime.add(time);
}
private void log(StackTraceElement[] elements, int skip, long time) {
accumulateTime(time);
if (skip >= MAX_STACK_DEPTH) {
return;
}
if (elements.length - skip == 0) {
return;
}
StackTraceElement bottom = elements[elements.length - (skip + 1)];
resolveChild(bottom.getClassName(), bottom.getMethodName()).log(elements, skip + 1, time);
}
public void log(StackTraceElement[] elements, long time) {
log(elements, 0, time);
}
@Override
public int compareTo(StackNode o) {
return getName().compareTo(o.getName());
}
public void serializeTo(JsonWriter writer) throws IOException {
writer.beginObject();
// append metadata about this node
appendMetadata(writer);
// include the total time recorded for this node
writer.name("totalTime").value(getTotalTime());
// append child nodes, if any are present
Collection<StackNode> childNodes = getChildren();
if (!childNodes.isEmpty()) {
writer.name("children").beginArray();
for (StackNode child : childNodes) {
child.serializeTo(writer);
}
writer.endArray();
}
writer.endObject();
}
protected void appendMetadata(JsonWriter writer) throws IOException {
writer.name("name").value(getName());
}
}
|
