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
|
// Copyright 2015 The Bazel Authors. All rights reserved.
//
// 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 com.google.devtools.build.lib.profiler.statistics;
import com.google.common.collect.Maps;
import com.google.common.collect.Multimaps;
import com.google.common.collect.Ordering;
import com.google.common.collect.TreeMultimap;
import com.google.devtools.build.lib.profiler.ProfileInfo;
import com.google.devtools.build.lib.profiler.ProfileInfo.Task;
import com.google.devtools.build.lib.profiler.ProfilePhase;
import com.google.devtools.build.lib.profiler.ProfilerTask;
import java.util.Arrays;
import java.util.EnumMap;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
/**
* Compute and store statistics of all {@link ProfilerTask}s that begin with VFS_ in sorted order.
*/
public final class PhaseVfsStatistics implements Iterable<ProfilerTask> {
/**
* Pair of duration and count for sorting by duration first and count in case of tie
*/
public static class Stat implements Comparable<Stat> {
public long duration;
public long count;
@Override
public int compareTo(Stat o) {
return this.duration == o.duration
? Long.compare(this.count, o.count)
: Long.compare(this.duration, o.duration);
}
}
private final ProfilePhase phase;
private final EnumMap<ProfilerTask, TreeMultimap<Stat, String>> sortedStatistics;
private final String workSpaceName;
public PhaseVfsStatistics(final String workSpaceName, ProfilePhase phase, ProfileInfo info) {
this.workSpaceName = workSpaceName;
this.phase = phase;
this.sortedStatistics = Maps.newEnumMap(ProfilerTask.class);
Task phaseTask = info.getPhaseTask(phase);
if (phaseTask == null) {
return;
}
collectVfsEntries(info.getTasksForPhase(phaseTask));
}
public ProfilePhase getProfilePhase() {
return phase;
}
public boolean isEmpty() {
return sortedStatistics.isEmpty();
}
public Iterable<Entry<Stat, String>> getSortedStatistics(ProfilerTask taskType) {
return sortedStatistics.get(taskType).entries();
}
public int getStatisticsCount(ProfilerTask taskType) {
return sortedStatistics.get(taskType).size();
}
@Override
public Iterator<ProfilerTask> iterator() {
return sortedStatistics.keySet().iterator();
}
/**
* Group into VFS operations and build maps from path to duration.
*/
private void collectVfsEntries(List<Task> taskList) {
EnumMap<ProfilerTask, Map<String, Stat>> stats = Maps.newEnumMap(ProfilerTask.class);
for (Task task : taskList) {
collectVfsEntries(Arrays.asList(task.subtasks));
if (!task.type.name().startsWith("VFS_")) {
continue;
}
Map<String, Stat> statsForType = stats.get(task.type);
if (statsForType == null) {
statsForType = new HashMap<>();
stats.put(task.type, statsForType);
}
String path = currentPathMapping(task.getDescription());
Stat stat = statsForType.get(path);
if (stat == null) {
stat = new Stat();
}
stat.duration += task.duration;
stat.count++;
statsForType.put(path, stat);
}
// Reverse the maps to get maps from duration to path. We use a TreeMultimap to sort by
// duration and because durations are not unique.
for (ProfilerTask type : stats.keySet()) {
Map<String, Stat> statsForType = stats.get(type);
TreeMultimap<Stat, String> sortedStats =
TreeMultimap.create(Ordering.natural().reverse(), Ordering.natural());
Multimaps.invertFrom(Multimaps.forMap(statsForType), sortedStats);
sortedStatistics.put(type, sortedStats);
}
}
private String currentPathMapping(String input) {
if (workSpaceName.isEmpty()) {
return input;
} else {
return input.substring(input.lastIndexOf("/" + workSpaceName) + 1);
}
}
}
|
