diff options
| author | Reid Spencer <rspencer@reidspencer.com> | 2007-01-31 21:27:38 +0000 |
|---|---|---|
| committer | Reid Spencer <rspencer@reidspencer.com> | 2007-01-31 21:27:38 +0000 |
| commit | 9e693eb49949249f3b337623f4a849134fe75420 (patch) | |
| tree | e38836ac970610af83347077da4b54312b756215 /lib/Support/FoldingSet.cpp | |
| parent | 3471b60e9586c8923800b0ce1cea042efa2675e7 (diff) | |
| download | llvm-9e693eb49949249f3b337623f4a849134fe75420.tar.gz llvm-9e693eb49949249f3b337623f4a849134fe75420.tar.bz2 llvm-9e693eb49949249f3b337623f4a849134fe75420.tar.xz | |
Add some debug output.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33718 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support/FoldingSet.cpp')
| -rw-r--r-- | lib/Support/FoldingSet.cpp | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/lib/Support/FoldingSet.cpp b/lib/Support/FoldingSet.cpp index dbf3a583d8..1d04abf4e4 100644 --- a/lib/Support/FoldingSet.cpp +++ b/lib/Support/FoldingSet.cpp @@ -14,8 +14,10 @@ // //===----------------------------------------------------------------------===// +#define DEBUG_TYPE "foldingset" #include "llvm/ADT/FoldingSet.h" #include "llvm/Support/MathExtras.h" +#include "llvm/Support/Debug.h" #include <cassert> using namespace llvm; @@ -225,6 +227,7 @@ FoldingSetImpl::Node *FoldingSetImpl::FindNodeOrInsertPos(const NodeID &ID, /// FindNodeOrInsertPos. void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { // Do we need to grow the hashtable? + DEBUG(DOUT << "INSERT: " << N << '\n'); if (NumNodes+1 > NumBuckets*2) { GrowHashTable(); NodeID ID; @@ -255,6 +258,7 @@ bool FoldingSetImpl::RemoveNode(Node *N) { // Because each bucket is a circular list, we don't need to compute N's hash // to remove it. Chase around the list until we find the node (or bucket) // which points to N. + DEBUG(DOUT << "REMOVE: " << N << '\n'); void *Ptr = N->getNextInBucket(); if (Ptr == 0) return false; // Not in folding set. |