RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-01-31 09:22:31 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

remove folding set debug output

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34549 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-24 01:41:48 +00:00
parent 6b178a3801
commit 34aae111ff
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lib/Support/FoldingSet.cpp
View File

@ -14,10 +14,8 @@
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
#define DEBUG_TYPE "foldingset"
#include "llvm/ADT/FoldingSet.h" #include "llvm/ADT/FoldingSet.h"
#include "llvm/Support/MathExtras.h" #include "llvm/Support/MathExtras.h"
#include "llvm/Support/Debug.h"
#include <cassert> #include <cassert>
using namespace llvm; using namespace llvm;
@ -231,7 +229,6 @@ FoldingSetImpl::Node *FoldingSetImpl::FindNodeOrInsertPos(const NodeID &ID,
void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) { void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) {
assert(N->getNextInBucket() == 0); assert(N->getNextInBucket() == 0);
// Do we need to grow the hashtable? // Do we need to grow the hashtable?
DEBUG(DOUT << "INSERT: " << N << '\n');
if (NumNodes+1 > NumBuckets*2) { if (NumNodes+1 > NumBuckets*2) {
GrowHashTable(); GrowHashTable();
NodeID ID; NodeID ID;
@ -261,7 +258,6 @@ void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) {
bool FoldingSetImpl::RemoveNode(Node *N) { bool FoldingSetImpl::RemoveNode(Node *N) {
// Because each bucket is a circular list, we don't need to compute N's hash // Because each bucket is a circular list, we don't need to compute N's hash
// to remove it. // to remove it.
DEBUG(DOUT << "REMOVE: " << N << '\n');
void *Ptr = N->getNextInBucket(); void *Ptr = N->getNextInBucket();
if (Ptr == 0) return false; // Not in folding set. if (Ptr == 0) return false; // Not in folding set.