diff options
| author | Chris Lattner <sabre@nondot.org> | 2007-02-24 01:41:48 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2007-02-24 01:41:48 +0000 |
| commit | 34aae111ffdc5e2506d2f611fb07406e030be589 (patch) | |
| tree | 2e5f091a4c81f322af71b6278b8421d8fca44f9a /lib | |
| parent | 6b178a3801955490886e5729cbc85fe8e68fdc77 (diff) | |
| download | external_llvm-34aae111ffdc5e2506d2f611fb07406e030be589.zip external_llvm-34aae111ffdc5e2506d2f611fb07406e030be589.tar.gz external_llvm-34aae111ffdc5e2506d2f611fb07406e030be589.tar.bz2 | |
remove folding set debug output
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34549 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/Support/FoldingSet.cpp | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/lib/Support/FoldingSet.cpp b/lib/Support/FoldingSet.cpp index ecb700d..6f7f5ea 100644 --- a/lib/Support/FoldingSet.cpp +++ b/lib/Support/FoldingSet.cpp @@ -14,10 +14,8 @@ // //===----------------------------------------------------------------------===// -#define DEBUG_TYPE "foldingset" #include "llvm/ADT/FoldingSet.h" #include "llvm/Support/MathExtras.h" -#include "llvm/Support/Debug.h" #include <cassert> using namespace llvm; @@ -231,7 +229,6 @@ FoldingSetImpl::Node *FoldingSetImpl::FindNodeOrInsertPos(const NodeID &ID, void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { assert(N->getNextInBucket() == 0); // Do we need to grow the hashtable? - DEBUG(DOUT << "INSERT: " << N << '\n'); if (NumNodes+1 > NumBuckets*2) { GrowHashTable(); NodeID ID; @@ -261,7 +258,6 @@ void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { bool FoldingSetImpl::RemoveNode(Node *N) { // Because each bucket is a circular list, we don't need to compute N's hash // to remove it. - DEBUG(DOUT << "REMOVE: " << N << '\n'); void *Ptr = N->getNextInBucket(); if (Ptr == 0) return false; // Not in folding set. |