mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-22 09:29:31 +00:00
0b8c9a80f2
into their new header subdirectory: include/llvm/IR. This matches the directory structure of lib, and begins to correct a long standing point of file layout clutter in LLVM. There are still more header files to move here, but I wanted to handle them in separate commits to make tracking what files make sense at each layer easier. The only really questionable files here are the target intrinsic tablegen files. But that's a battle I'd rather not fight today. I've updated both CMake and Makefile build systems (I think, and my tests think, but I may have missed something). I've also re-sorted the includes throughout the project. I'll be committing updates to Clang, DragonEgg, and Polly momentarily. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171366 91177308-0d34-0410-b5e6-96231b3b80d8
93 lines
2.3 KiB
C++
93 lines
2.3 KiB
C++
//===- LeaksContext.h - LeadDetector 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/ADT/SmallPtrSet.h"
|
|
#include "llvm/IR/Value.h"
|
|
|
|
namespace llvm {
|
|
|
|
template <class T>
|
|
struct PrinterTrait {
|
|
static void print(const T* P) { errs() << P; }
|
|
};
|
|
|
|
template<>
|
|
struct PrinterTrait<Value> {
|
|
static void print(const Value* P) { errs() << *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) {
|
|
assert(Ts.count(o) == 0 && "Object already in set!");
|
|
if (Cache) {
|
|
assert(Cache != o && "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()) {
|
|
errs() << "Leaked " << Name << " objects found: " << Message << ":\n";
|
|
for (typename SmallPtrSet<const T*, 8>::iterator I = Ts.begin(),
|
|
E = Ts.end(); I != E; ++I) {
|
|
errs() << '\t';
|
|
PrinterTrait<T>::print(*I);
|
|
errs() << '\n';
|
|
}
|
|
errs() << '\n';
|
|
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
private:
|
|
SmallPtrSet<const T*, 8> Ts;
|
|
const T* Cache;
|
|
const char* Name;
|
|
};
|
|
|
|
}
|