forked from cloudfoundry/jvmkill
-
Notifications
You must be signed in to change notification settings - Fork 1
/
heapstats.c++
95 lines (79 loc) · 3.45 KB
/
heapstats.c++
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
/*
* Copyright (c) 2015 the original author or authors.
*
* 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.
*/
#include <sys/types.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <iostream>
#include <chrono>
#include <thread>
#include "heapstatshashtable.h"
HeapStatsHashtable::HeapStatsHashtable(int maxEntries) {
heapHistogramMaxEntries = maxEntries;
}
HeapStatsHashtable::~HeapStatsHashtable() {
javaObjects.clear();
}
void HeapStatsHashtable::recordObject(const char *className, size_t objectSize) {
const std::string classNameString (className);
size_t objectCount = 1;
if (javaObjects.count(classNameString) > 0) {
objectSize = javaObjects.at(classNameString).objectSize + objectSize;
objectCount = javaObjects.at(classNameString).objectCount + objectCount;
javaObjects.erase(classNameString);
}
javaObjects.insert (std::pair<std::string, ObjectCount>(classNameString, {objectSize, objectCount}) );
}
bool sorter (std::pair<std::string, ObjectCount> i, std::pair<std::string, ObjectCount> j) {
return (i.second.objectSize > j.second.objectSize);
}
void HeapStatsHashtable::print(std::ostream& os) const {
std::vector<std::pair<std::string, ObjectCount> > tmpObjects(javaObjects.begin(), javaObjects.end());
std::sort(tmpObjects.begin(), tmpObjects.end(), sorter);
std::vector<std::pair<std::string, ObjectCount>>::size_type maxEntries =
(std::vector<std::pair<std::string, ObjectCount>>::size_type)heapHistogramMaxEntries;
if (maxEntries > 0 && tmpObjects.size() > maxEntries) {
tmpObjects.resize(maxEntries);
}
size_t longestClassName = 10;
for (std::vector<std::pair<std::string, ObjectCount> >::iterator it=tmpObjects.begin(); it!=tmpObjects.end(); it++) {
if ((*it).first.size() > longestClassName) {
longestClassName = (*it).first.size();
}
}
std::string heading = "Class Name";
heading.resize(longestClassName, ' ');
os << "| Instance Count | Total Bytes | " << heading << " |" << std::endl;
std::chrono::milliseconds timespan(1);
int entries = 0;
for (std::vector<std::pair<std::string, ObjectCount> >::iterator it=tmpObjects.begin(); it!=tmpObjects.end(); it++) {
entries++;
if (heapHistogramMaxEntries > 0 && entries > heapHistogramMaxEntries) {
break;
}
(*it).first.resize(longestClassName, ' ');
std::string totalSize = std::to_string((*it).second.objectSize);
totalSize.resize(11, ' ');
std::string totalCount = std::to_string((*it).second.objectCount);
totalCount.resize(14, ' ');
// Reduce the risk of loggregator missing some entries.
std::this_thread::sleep_for(timespan);
os << "| " << totalCount << " | " << totalSize << " | " << (*it).first << " |" << std::endl;
}
// Reduce the risk of loggregator missing some entries.
std::this_thread::sleep_for(timespan);
}