[llvm-commits] [poolalloc] r120075 - /poolalloc/trunk/lib/DSA/DataStructureStats.cpp

[Arushi Aggarwal]

Author: aggarwa4
Date: Tue Nov 23 20:13:58 2010
New Revision: 120075

URL: http://llvm.org/viewvc/llvm-project?rev=120075&view=rev
Log:
Separately count access to incomplete nodes, to 
distinguish the reasons for Type-unknownness.

Modified:
    poolalloc/trunk/lib/DSA/DataStructureStats.cpp

Modified: poolalloc/trunk/lib/DSA/DataStructureStats.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/DSA/DataStructureStats.cpp?rev=120075&r1=120074&r2=120075&view=diff
==============================================================================
--- poolalloc/trunk/lib/DSA/DataStructureStats.cpp (original)
+++ poolalloc/trunk/lib/DSA/DataStructureStats.cpp Tue Nov 23 20:13:58 2010
@@ -44,6 +44,8 @@
                                 "Number of loads/stores which are access a DSNode with 3 type");
   STATISTIC (NumTypeCount4Accesses,
                                 "Number of loads/stores which are access a DSNode with >3 type");
+  STATISTIC (NumIncompleteAccesses,
+                                "Number of loads/stores which are on incomplete nodes");
 
   class DSGraphStats : public FunctionPass, public InstVisitor<DSGraphStats> {
     void countCallees(const Function &F);
@@ -147,8 +149,12 @@
     return true;
   else {
     DSNode* N = NH.getNode();
-    if (N->isNodeCompletelyFolded() || N->isIncompleteNode())
+    if (N->isNodeCompletelyFolded())
       return true;
+    if ( N->isIncompleteNode()){
+      ++NumIncompleteAccesses;
+      return true;
+    }
     // it is a complete node, now check how many types are present
    int count = 0;
    unsigned offset = NH.getOffset();