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
|
/*
* This file is part of PowerDNS or dnsdist.
* Copyright -- PowerDNS.COM B.V. and its contributors
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* In addition, for the avoidance of any doubt, permission is granted to
* link this program with OpenSSL and to (re)distribute the binaries
* produced as the result of such linking.
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "malloctrace.hh"
#include <sstream>
#include <algorithm>
using std::string;
using std::map;
using std::vector;
MallocTracer* g_mtracer;
#if 1
#include <execinfo.h>
vector<void*> MallocTracer::makeBacktrace()
{
void *array[20]; //only care about last 17 functions (3 taken with tracing support)
size_t size = backtrace (array, 20);
return vector<void*>(array, array+size);
}
extern "C" {
extern void *__libc_malloc(size_t size);
extern void __libc_free(void* ptr);
void* malloc (size_t size)
{
if(!g_mtracer) {
void *mem = __libc_malloc(sizeof(MallocTracer));
g_mtracer = new(mem) MallocTracer;
}
return g_mtracer->malloc(size);
}
void free(void* ptr)
{
if(ptr)
g_mtracer->free(ptr);
}
}
#endif
static thread_local bool l_active;
void* MallocTracer::malloc(size_t size)
{
void* ret = __libc_malloc(size);
if(!l_active) {
l_active=true;
d_allocflux+=size;
d_allocs++;
d_totAllocated += size;
std::lock_guard<std::mutex> lock(d_mut);
auto& ent=d_stats[makeBacktrace()];
ent.count++;
ent.sizes[size]++;
d_sizes[ret]=size;
l_active=false;
}
return ret;
}
void MallocTracer::free(void* ptr)
{
__libc_free(ptr);
if(!l_active) {
l_active=true;
std::lock_guard<std::mutex> lock(d_mut);
auto f = d_sizes.find(ptr);
if(f != d_sizes.end()) {
d_totAllocated -= f->second;
d_sizes.erase(f);
}
l_active=false;
}
}
MallocTracer::allocators_t MallocTracer::topAllocators(int num)
{
l_active=true;
allocators_t ret;
for(const auto& e : d_stats) {
ret.push_back(make_pair(e.second, e.first));
}
std::sort(ret.begin(), ret.end(),
[](const allocators_t::value_type& a,
const allocators_t::value_type& b) {
return a.first.count < b.first.count;
});
if((unsigned int)num > ret.size())
ret.clear();
else if(num > 0)
ret.erase(ret.begin(), ret.begin() + (ret.size() - num));
l_active=false;
return ret;
}
std::string MallocTracer::topAllocatorsString(int num)
{
l_active=true;
auto raw = topAllocators(num);
l_active=true;
std::ostringstream ret;
for(const auto& e : raw) {
ret<<"Called "<<e.first.count<<" times\n";
for(const auto& u : e.first.sizes)
ret<<u.first<<"b: "<<u.second<<" times, ";
ret<<'\n';
char** strings = backtrace_symbols(&e.second[0], e.second.size());
for(unsigned int i=0; i < e.second.size(); ++i)
ret<<strings[i]<<'\n';
ret<<"-----\n";
}
string str =ret.str();
l_active=false;
return str;
}
void MallocTracer::clearAllocators()
{
l_active=true;
std::lock_guard<std::mutex> lock(d_mut);
d_stats.clear();
l_active=false;
}
|
