From 34aae111ffdc5e2506d2f611fb07406e030be589 Mon Sep 17 00:00:00 2001
From: Chris Lattner <sabre@nondot.org>
Date: Sat, 24 Feb 2007 01:41:48 +0000
Subject: [PATCH] remove folding set debug output

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34549 91177308-0d34-0410-b5e6-96231b3b80d8
---
 lib/Support/FoldingSet.cpp | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/lib/Support/FoldingSet.cpp b/lib/Support/FoldingSet.cpp
index ecb700dfd61..6f7f5ea4cbf 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.