Changes in directory llvm/lib/Support:
FoldingSet.cpp updated: 1.16 -> 1.17
---
Log message:
remove folding set debug output
---
Diffs of the changes: (+0 -4)
FoldingSet.cpp | 4 ----
1 files changed, 4 deletions(-)
Index: llvm/lib/Support/FoldingSet.cpp
diff -u llvm/lib/Support/FoldingSet.cpp:1.16
llvm/lib/Support/FoldingSet.cpp:1.17
--- llvm/lib/Support/FoldingSet.cpp:1.16 Sat Feb 3 19:48:10 2007
+++ llvm/lib/Support/FoldingSet.cpp Fri Feb 23 19:41:48 2007
@@ -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 @@
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 @@
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.
_______________________________________________
llvm-commits mailing list
llvm-commits@cs.uiuc.edu
http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits
