replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

remove folding set debug output 

llvm-svn: 34549
This commit is contained in:
Chris Lattner 2007-02-24 01:41:48 +00:00
parent fb94fe742b
commit a5821eca0d
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
llvm/lib/Support/FoldingSet.cpp
View File

@ -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.