-
Notifications
You must be signed in to change notification settings - Fork 3
/
TopConsumersQuery.java
459 lines (396 loc) · 17.1 KB
/
TopConsumersQuery.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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
/*******************************************************************************
* Copyright (c) 2008, 2023 SAP AG and IBM Corporation.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License 2.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-2.0/
*
* SPDX-License-Identifier: EPL-2.0
*
* Contributors:
* SAP AG - initial API and implementation
* Andrew Johnson/IBM Corporation - add icon
*******************************************************************************/
package org.eclipse.mat.inspections;
import java.io.CharArrayWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Objects;
import java.util.StringTokenizer;
import org.eclipse.mat.SnapshotException;
import org.eclipse.mat.collect.ArrayInt;
import org.eclipse.mat.internal.Messages;
import org.eclipse.mat.query.BytesFormat;
import org.eclipse.mat.query.IQuery;
import org.eclipse.mat.query.IResult;
import org.eclipse.mat.query.annotations.Argument;
import org.eclipse.mat.query.annotations.Argument.Advice;
import org.eclipse.mat.query.annotations.Category;
import org.eclipse.mat.query.annotations.CommandName;
import org.eclipse.mat.query.annotations.HelpUrl;
import org.eclipse.mat.query.annotations.Icon;
import org.eclipse.mat.query.results.TextResult;
import org.eclipse.mat.snapshot.ClassHistogramRecord;
import org.eclipse.mat.snapshot.ClassLoaderHistogramRecord;
import org.eclipse.mat.snapshot.Histogram;
import org.eclipse.mat.snapshot.ISnapshot;
import org.eclipse.mat.snapshot.model.IClass;
import org.eclipse.mat.snapshot.model.IObject;
import org.eclipse.mat.snapshot.model.ObjectComparators;
import org.eclipse.mat.util.IProgressListener;
import org.eclipse.mat.util.SimpleMonitor;
import com.ibm.icu.text.NumberFormat;
@CommandName("top_consumers")
@Icon("/META-INF/icons/pie_chart.gif")
@Category(Category.HIDDEN)
@HelpUrl("/org.eclipse.mat.ui.help/reference/inspections/top_consumers.html")
public class TopConsumersQuery implements IQuery
{
NumberFormat percentFormatter = NumberFormat.getIntegerInstance();
NumberFormat numberFormatter = NumberFormat.getNumberInstance();
BytesFormat bytesFormatter = BytesFormat.getInstance();
{
percentFormatter.setMinimumFractionDigits(2);
percentFormatter.setMaximumFractionDigits(2);
}
static final String SEPARATOR = "--------------------------------------------------------------------------------"; //$NON-NLS-1$
@Argument
public ISnapshot snapshot;
@Argument(advice = Advice.HEAP_OBJECT, isMandatory = false, flag = Argument.UNFLAGGED)
public int[] objects;
@Argument(isMandatory = false, flag = "t")
public int thresholdPercent = 1;
public IResult execute(IProgressListener listener) throws Exception
{
SimpleMonitor monitor = new SimpleMonitor(Messages.TopConsumers2Query_TopConsumers, listener,
new int[] { 100, 100, 100 });
IProgressListener listener0 = listener;
CharArrayWriter outWriter = new CharArrayWriter(1000);
PrintWriter out = new PrintWriter(outWriter);
long totalHeap;
int[] topDominators;
listener = monitor.nextMonitor();
// nothing specified ->
// use the top-level dominators
if (objects == null)
{
totalHeap = snapshot.getSnapshotInfo().getUsedHeapSize();
topDominators = snapshot.getImmediateDominatedIds(-1);
}
else if (objects.length == 0)
{
return new TextResult(Messages.TopConsumers2Query_MsgNoObjects);
}
else
{
topDominators = snapshot.getTopAncestorsInDominatorTree(objects, listener);
totalHeap = 0;
for (int topDominator : topDominators)
{
totalHeap += snapshot.getRetainedHeapSize(topDominator);
}
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
long threshold = thresholdPercent * totalHeap / 100;
// find the biggest objects first
ArrayInt suspects = new ArrayInt();
if (objects == null || objects.length == 0) // nothing specified
{
int i = 0;
while (i < topDominators.length && snapshot.getRetainedHeapSize(topDominators[i]) > threshold)
{
suspects.add(topDominators[i]);
i++;
}
}
else
{
for (int i = 0; i < topDominators.length; i++)
{
if (snapshot.getRetainedHeapSize(topDominators[i]) > threshold)
suspects.add(topDominators[i]);
}
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
listener = monitor.nextMonitor();
Histogram histogram = groupByClasses(topDominators, listener);
// find suspect classes
ClassHistogramRecord[] classRecords = histogram.getClassHistogramRecords().toArray(new ClassHistogramRecord[0]);
Arrays.sort(classRecords, Histogram.reverseComparator(Histogram.COMPARATOR_FOR_RETAINEDHEAPSIZE));
int k = 0;
ArrayList<ClassHistogramRecord> suspectRecords = new ArrayList<ClassHistogramRecord>();
while (k < classRecords.length && classRecords[k].getRetainedHeapSize() > threshold)
{
suspectRecords.add(classRecords[k]);
k++;
}
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
// find suspect class loaders
ClassLoaderHistogramRecord[] classloaderRecords = histogram.getClassLoaderHistogramRecords().toArray(
new ClassLoaderHistogramRecord[0]);
Arrays.sort(classloaderRecords, Histogram.reverseComparator(Histogram.COMPARATOR_FOR_RETAINEDHEAPSIZE));
k = 0;
ArrayList<ClassLoaderHistogramRecord> classloaderSuspectRecords = new ArrayList<ClassLoaderHistogramRecord>();
while (k < classloaderRecords.length && classloaderRecords[k].getRetainedHeapSize() > threshold)
{
classloaderSuspectRecords.add(classloaderRecords[k]);
k++;
}
// group by packages
listener = monitor.nextMonitor();
PackageTreeNode root = groupByPackage(topDominators, snapshot, listener);
root.retainedSize = totalHeap;
root.dominators = new ArrayInt(topDominators);
// Print the results
out.println();
out.println(Messages.TopConsumers2Query_BiggestObjects + ":"); //$NON-NLS-1$
out.println(SEPARATOR);
int[] suspectsArr = suspects.toArray();
IObject[] objectArr = new IObject[suspectsArr.length];
for (int j = 0; j < suspectsArr.length; j++)
{
objectArr[j] = snapshot.getObject(suspectsArr[j]);
}
Arrays.sort(objectArr, ObjectComparators.getComparatorForRetainedHeapSizeDescending());
for (IObject obj : objectArr)
{
long retained = snapshot.getRetainedHeapSize(obj.getObjectId());
out.print(percentFormatter.format((double) (retained * 100) / (double) totalHeap));
out.print("% "); //$NON-NLS-1$
out.print(bytesFormatter.format(retained));
out.print(" "); //$NON-NLS-1$
out.print(obj.getTechnicalName());
String details = obj.getClassSpecificName();
if (details != null)
{
out.print(" "); //$NON-NLS-1$
out.print(details);
}
out.println();
}
out.println();
out.println(Messages.TopConsumers2Query_BiggestClasses + ":"); //$NON-NLS-1$
out.println(SEPARATOR);
for (ClassHistogramRecord rec : suspectRecords)
{
long retained = rec.getRetainedHeapSize();
out.print(percentFormatter.format((double) (retained * 100) / (double) totalHeap));
out.print("% "); //$NON-NLS-1$
out.print(bytesFormatter.format(retained));
out.print(" "); //$NON-NLS-1$
out.print(numberFormatter.format(rec.getNumberOfObjects()));
out.print(" "); //$NON-NLS-1$
out.print(rec.getLabel());
out.println();
}
out.println();
out.println(Messages.TopConsumers2Query_BiggestClassLoaders + ":"); //$NON-NLS-1$
out.println(SEPARATOR);
for (ClassLoaderHistogramRecord rec : classloaderSuspectRecords)
{
long retained = rec.getRetainedHeapSize();
out.print(percentFormatter.format((double) (retained * 100) / (double) totalHeap));
out.print("% "); //$NON-NLS-1$
out.print(bytesFormatter.format(retained));
out.print(" "); //$NON-NLS-1$
out.print(numberFormatter.format(rec.getNumberOfObjects()));
out.print(" "); //$NON-NLS-1$
out.print(rec.getLabel());
out.println();
}
out.println();
out.println(Messages.TopConsumers2Query_BiggestPackages + ":"); //$NON-NLS-1$
out.println(SEPARATOR);
out.println(Messages.TopConsumersQuery_ColumnLabels);
out.println(SEPARATOR);
printPackageTree(root, new StringBuilder(), totalHeap, threshold, out, snapshot);
out.close();
listener0.done();
return new TextResult(outWriter.toString());
}
private Histogram groupByClasses(int[] dominated, IProgressListener listener) throws SnapshotException
{
Histogram histogram = snapshot.getHistogram(dominated, listener);
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
Collection<ClassHistogramRecord> records = histogram.getClassHistogramRecords();
ClassHistogramRecord[] arr = new ClassHistogramRecord[records.size()];
int i = 0;
for (ClassHistogramRecord record : records)
{
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
record.setRetainedHeapSize(sumRetainedSize(record.getObjectIds(), snapshot));
arr[i++] = record;
}
Collection<ClassLoaderHistogramRecord> loaderRecords = histogram.getClassLoaderHistogramRecords();
ClassLoaderHistogramRecord[] loaderArr = new ClassLoaderHistogramRecord[loaderRecords.size()];
i = 0;
for (ClassLoaderHistogramRecord record : loaderRecords)
{
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
long retainedSize = 0;
for (ClassHistogramRecord classRecord : record.getClassHistogramRecords())
{
retainedSize += classRecord.getRetainedHeapSize();
}
record.setRetainedHeapSize(retainedSize);
loaderArr[i++] = record;
}
return histogram;
}
private long sumRetainedSize(int[] objectIds, ISnapshot snapshot) throws SnapshotException
{
long sum = 0;
for (int id : objectIds)
{
sum += snapshot.getRetainedHeapSize(id);
}
return sum;
}
private static class PackageTreeNode implements Comparable<PackageTreeNode>
{
@Override
public int hashCode()
{
return Objects.hash(packageName, retainedSize);
}
@Override
public boolean equals(Object obj)
{
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
PackageTreeNode other = (PackageTreeNode) obj;
return Objects.equals(packageName, other.packageName) && retainedSize == other.retainedSize;
}
public PackageTreeNode(String packageName)
{
this.packageName = packageName;
}
String packageName;
ArrayInt dominators = new ArrayInt();
Map<String, PackageTreeNode> subpackages = new HashMap<String, PackageTreeNode>();
long retainedSize;
public int compareTo(PackageTreeNode o)
{
if (retainedSize < o.retainedSize)
return 1;
if (retainedSize > o.retainedSize)
return -1;
return packageName.compareTo(o.packageName);
}
}
private PackageTreeNode groupByPackage(int[] dominators, ISnapshot snapshot, IProgressListener listener)
throws SnapshotException
{
PackageTreeNode root = new PackageTreeNode(Messages.TopConsumers2Query_Label_all);
PackageTreeNode current;
listener.beginTask(Messages.TopConsumers2Query_GroupingByPackage, (dominators.length + 999) / 1000);
int counter = 0;
for (int dominatorId : dominators)
{
if (listener.isCanceled())
throw new IProgressListener.OperationCanceledException();
long retainedSize = snapshot.getRetainedHeapSize(dominatorId);
current = root;
// for classes take their name instead of java.lang.Class
IClass objClass = snapshot.getClassOf(dominatorId);
if (IClass.JAVA_LANG_CLASS.equals(objClass.getName()))
{
IObject dominatorObj = snapshot.getObject(dominatorId);
if (dominatorObj instanceof IClass)
objClass = (IClass) dominatorObj;
}
String className = objClass.getName();
StringTokenizer tokenizer = new StringTokenizer(className, "."); //$NON-NLS-1$
while (tokenizer.hasMoreTokens())
{
String subpack = tokenizer.nextToken();
PackageTreeNode childNode = current.subpackages.get(subpack);
if (childNode == null)
{
childNode = new PackageTreeNode(subpack);
current.subpackages.put(subpack, childNode);
}
childNode.dominators.add(dominatorId);
childNode.retainedSize += retainedSize;
current = childNode;
}
if (++counter % 1000 == 0)
{
listener.worked(1);
}
}
listener.done();
return root;
}
private void printPackageTree(PackageTreeNode node, StringBuilder level, long totalHeap, long threshold,
PrintWriter out, ISnapshot snapshot) throws SnapshotException
{
// long totalHeap = snapshot.getSnapshotInfo().getUsedHeapSize();
StringBuilder output = new StringBuilder(level.length() + 100);
/* print the leading lines */
output.append(level);
/* print the object technical name */
output.append(node.packageName);
output.append(" ("); //$NON-NLS-1$
double percent = (double) (node.retainedSize * 100) / (double) totalHeap;
output.append(percentFormatter.format(percent));
output.append("%) "); //$NON-NLS-1$
output.append(bytesFormatter.format(node.retainedSize));
output.append(" "); //$NON-NLS-1$
output.append(numberFormatter.format(node.dominators.size()));
out.println(output);
PackageTreeNode[] children = node.subpackages.values().toArray(new PackageTreeNode[0]);
if (children != null)
{
Arrays.sort(children);
for (int i = 0; i < children.length; i++)
{
if (children[i].retainedSize < threshold)
{
break;
}
int k = level.indexOf("'-"); //$NON-NLS-1$
if (k != -1)
{
level.replace(k, k + 2, " "); //$NON-NLS-1$
}
else
{
k = level.indexOf("|-"); //$NON-NLS-1$
if (k != -1)
{
level.replace(k + 1, k + 2, " "); //$NON-NLS-1$
}
}
if ((i == children.length - 1) || (children[i + 1].retainedSize < threshold))
{
level.append('\'');
}
else
{
level.append('|');
}
level.append("- "); //$NON-NLS-1$
printPackageTree(children[i], level, totalHeap, threshold, out, snapshot);
}
}
if (level.length() >= 3)
{
level.delete(level.length() - 3, level.length());
}
}
}