[llvm-commits] CVS: llvm/lib/VMCore/Type.cpp

[Chris Lattner]

Changes in directory llvm/lib/VMCore:

Type.cpp updated: 1.93 -> 1.94

---
Log message:

Remove the statistics


---
Diffs of the changes:  (+0 -11)

Index: llvm/lib/VMCore/Type.cpp
diff -u llvm/lib/VMCore/Type.cpp:1.93 llvm/lib/VMCore/Type.cpp:1.94
--- llvm/lib/VMCore/Type.cpp:1.93	Mon Feb  9 14:23:44 2004
+++ llvm/lib/VMCore/Type.cpp	Mon Feb  9 15:01:23 2004
@@ -17,15 +17,9 @@
 #include "Support/DepthFirstIterator.h"
 #include "Support/StringExtras.h"
 #include "Support/STLExtras.h"
-#include "Support/Statistic.h"
 #include <algorithm>
-
 using namespace llvm;
 
-static Statistic<> NumSlowTypes("type", "num slow types");
-static Statistic<> NumTypeEqualsCalls("type", "num typeequals calls");
-static Statistic<> NumTypeEquals("type", "num types actually equal");
-
 // DEBUG_MERGE_TYPES - Enable this #define to see how and when derived types are
 // created and later destroyed, all in an effort to make sure that there is only
 // a single canonical version of a type.
@@ -657,8 +651,6 @@
       }
       
     } else {
-      ++NumSlowTypes;
-
       // Now we check to see if there is an existing entry in the table which is
       // structurally identical to the newly refined type.  If so, this type
       // gets refined to the pre-existing type.
@@ -667,11 +659,8 @@
       tie(I, E) = TypesByHash.equal_range(TypeHash);
       Entry = E;
       for (; I != E; ++I) {
-        ++NumTypeEqualsCalls;
         if (I->second != Ty) {
           if (TypesEqual(Ty, I->second)) {
-            ++NumTypeEquals;
-            
             assert(Ty->isAbstract() && "Replacing a non-abstract type?");
             TypeClass *NewTy = cast<TypeClass>((Type*)I->second.get());