blob: c8e7f4c6a52adbecdfcf57b2fbffe0a7243f4cc6 (
plain)
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
|
//===-- LeakDetector.cpp - Implement LeakDetector interface ---------------===//
//
// The LLVM Compiler Infrastructure
//
// This file was developed by the LLVM research group and is distributed under
// the University of Illinois Open Source License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file implements the LeakDetector class.
//
//===----------------------------------------------------------------------===//
#include "llvm/Support/LeakDetector.h"
#include "llvm/Value.h"
#include <iostream>
#include <set>
using namespace llvm;
namespace {
template <class T>
struct PrinterTrait {
static void print(const T* P) { std::cerr << P; }
};
template<>
struct PrinterTrait<Value> {
static void print(const Value* P) { std::cerr << *P; }
};
template <typename T>
struct LeakDetectorImpl {
LeakDetectorImpl(const char* const name) : Cache(0), Name(name) { }
// Because the most common usage pattern, by far, is to add a
// garbage object, then remove it immediately, we optimize this
// case. When an object is added, it is not added to the set
// immediately, it is added to the CachedValue Value. If it is
// immediately removed, no set search need be performed.
void addGarbage(const T* o) {
if (Cache) {
assert(Ts.count(Cache) == 0 && "Object already in set!");
Ts.insert(Cache);
}
Cache = o;
}
void removeGarbage(const T* o) {
if (o == Cache)
Cache = 0; // Cache hit
else
Ts.erase(o);
}
bool hasGarbage(const std::string& Message) {
addGarbage(0); // Flush the Cache
assert(Cache == 0 && "No value should be cached anymore!");
if (!Ts.empty()) {
std::cerr
<< "Leaked " << Name << " objects found: " << Message << ":\n";
for (typename std::set<const T*>::iterator I = Ts.begin(),
E = Ts.end(); I != E; ++I) {
std::cerr << "\t";
PrinterTrait<T>::print(*I);
std::cerr << "\n";
}
std::cerr << '\n';
return true;
}
return false;
}
private:
std::set<const T*> Ts;
const T* Cache;
const char* const Name;
};
LeakDetectorImpl<void> *Objects;
LeakDetectorImpl<Value> *LLVMObjects;
LeakDetectorImpl<void> &getObjects() {
if (Objects == 0)
Objects = new LeakDetectorImpl<void>("GENERIC");
return *Objects;
}
LeakDetectorImpl<Value> &getLLVMObjects() {
if (LLVMObjects == 0)
LLVMObjects = new LeakDetectorImpl<Value>("LLVM");
return *LLVMObjects;
}
void clearGarbage() {
delete Objects;
delete LLVMObjects;
Objects = 0;
LLVMObjects = 0;
}
}
void LeakDetector::addGarbageObjectImpl(void *Object) {
getObjects().addGarbage(Object);
}
void LeakDetector::addGarbageObjectImpl(const Value *Object) {
getLLVMObjects().addGarbage(Object);
}
void LeakDetector::removeGarbageObjectImpl(void *Object) {
getObjects().removeGarbage(Object);
}
void LeakDetector::removeGarbageObjectImpl(const Value *Object) {
getLLVMObjects().removeGarbage(Object);
}
void LeakDetector::checkForGarbageImpl(const std::string &Message) {
// use non-short-circuit version so that both checks are performed
if (getObjects().hasGarbage(Message) |
getLLVMObjects().hasGarbage(Message))
std::cerr << "\nThis is probably because you removed an object, but didn't "
"delete it. Please check your code for memory leaks.\n";
// Clear out results so we don't get duplicate warnings on
// next call...
clearGarbage();
}
|
