summaryrefslogtreecommitdiff
path: root/lib/VMCore/LeaksContext.h
diff options
context:
space:
mode:
authorOwen Anderson <resistor@mac.com>2009-08-19 17:07:46 +0000
committerOwen Anderson <resistor@mac.com>2009-08-19 17:07:46 +0000
commitc34ebf65af0139eaf5cb0969fabcd32c0b6e1710 (patch)
tree477d2e09fc8965df7cafc3617180590d000ff7a4 /lib/VMCore/LeaksContext.h
parentde95c1b88be44d4af916af8fba9d7940b7e98e32 (diff)
downloadllvm-c34ebf65af0139eaf5cb0969fabcd32c0b6e1710.tar.gz
llvm-c34ebf65af0139eaf5cb0969fabcd32c0b6e1710.tar.bz2
llvm-c34ebf65af0139eaf5cb0969fabcd32c0b6e1710.tar.xz
Reapply my less-lock-contention-in-leak-detector patch, now with new files
actually added. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@79429 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore/LeaksContext.h')
-rw-r--r--lib/VMCore/LeaksContext.h90
1 files changed, 90 insertions, 0 deletions
diff --git a/lib/VMCore/LeaksContext.h b/lib/VMCore/LeaksContext.h
new file mode 100644
index 0000000000..4c45b86b5f
--- /dev/null
+++ b/lib/VMCore/LeaksContext.h
@@ -0,0 +1,90 @@
+//===---------------- ----LeaksContext.h - Implementation ------*- C++ -*--===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// This file defines various helper methods and classes used by
+// LLVMContextImpl for leaks detectors.
+//
+//===----------------------------------------------------------------------===//
+
+#include "llvm/Value.h"
+#include "llvm/Support/Streams.h"
+#include "llvm/ADT/SmallPtrSet.h"
+
+using namespace llvm;
+
+template <class T>
+struct PrinterTrait {
+ static void print(const T* P) { cerr << P; }
+};
+
+template<>
+struct PrinterTrait<Value> {
+ static void print(const Value* P) { cerr << *P; }
+};
+
+template <typename T>
+struct LeakDetectorImpl {
+ explicit LeakDetectorImpl(const char* const name = "") :
+ Cache(0), Name(name) { }
+
+ void clear() {
+ Cache = 0;
+ Ts.clear();
+ }
+
+ void setName(const char* n) {
+ Name = n;
+ }
+
+ // 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()) {
+ cerr << "Leaked " << Name << " objects found: " << Message << ":\n";
+ for (typename SmallPtrSet<const T*, 8>::iterator I = Ts.begin(),
+ E = Ts.end(); I != E; ++I) {
+ cerr << "\t";
+ PrinterTrait<T>::print(*I);
+ cerr << "\n";
+ }
+ cerr << '\n';
+
+ return true;
+ }
+
+ return false;
+ }
+
+private:
+ SmallPtrSet<const T*, 8> Ts;
+ const T* Cache;
+ const char* Name;
+};