Remove useless struct fields.

llvm-svn: 124058

2 files changed, 2 insertions, 10 deletions

diff --git a/llvm/include/llvm/Analysis/DominatorInternals.h b/llvm/include/llvm/Analysis/DominatorInternals.h
index 6f66580025c..7f468836d2d 100644
--- a/llvm/include/llvm/Analysis/DominatorInternals.h
+++ b/llvm/include/llvm/Analysis/DominatorInternals.h
@@ -43,8 +43,6 @@ unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
 
   Vertex.push_back(V);        // Vertex[n] = V;
   //Info[V].Ancestor = 0;     // Ancestor[n] = 0
-  //Info[V].Child = 0;        // Child[v] = 0
-  VInfo.Size = 1;             // Size[v] = 1
 
   for (succ_iterator SI = succ_begin(V), E = succ_end(V); SI != E; ++SI) {
     InfoRec &SuccVInfo = DT.Info[*SI];
@@ -73,8 +71,6 @@ unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
 
       DT.Vertex.push_back(BB);       // Vertex[n] = V;
       //BBInfo[V].Ancestor = 0;   // Ancestor[n] = 0
-      //BBInfo[V].Child = 0;      // Child[v] = 0
-      BBInfo.Size = 1;            // Size[v] = 1
 
       if (IsChildOfArtificialExit)
         BBInfo.Parent = 1;
@@ -174,8 +170,6 @@ void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
 
     DT.Vertex.push_back(NULL);       // Vertex[n] = V;
       //BBInfo[V].Ancestor = 0;   // Ancestor[n] = 0
-      //BBInfo[V].Child = 0;      // Child[v] = 0
-    BBInfo.Size = 1;            // Size[v] = 1
   }
 
   // Step #1: Number blocks in depth-first order and initialize variables used
diff --git a/llvm/include/llvm/Analysis/Dominators.h b/llvm/include/llvm/Analysis/Dominators.h
index d8a254c7f9f..133e1231f98 100644
--- a/llvm/include/llvm/Analysis/Dominators.h
+++ b/llvm/include/llvm/Analysis/Dominators.h
@@ -196,12 +196,10 @@ protected:
   struct InfoRec {
     unsigned DFSNum;
     unsigned Semi;
-    unsigned Size;
-    NodeT *Label, *Child;
+    NodeT *Label;
     unsigned Parent, Ancestor;
 
-    InfoRec() : DFSNum(0), Semi(0), Size(0), Label(0), Child(0), Parent(0),
-                Ancestor(0) {}
+    InfoRec() : DFSNum(0), Semi(0), Label(0), Parent(0), Ancestor(0) {}
   };
 
   DenseMap<NodeT*, NodeT*> IDoms;