[llvm-commits] [llvm] r124058 - in /llvm/trunk/include/llvm/Analysis: DominatorInternals.h Dominators.h
Cameron Zwarich
zwarich at apple.com
Sat Jan 22 21:11:19 PST 2011
Author: zwarich
Date: Sat Jan 22 23:11:18 2011
New Revision: 124058
URL: http://llvm.org/viewvc/llvm-project?rev=124058&view=rev
Log:
Remove useless struct fields.
Modified:
llvm/trunk/include/llvm/Analysis/DominatorInternals.h
llvm/trunk/include/llvm/Analysis/Dominators.h
Modified: llvm/trunk/include/llvm/Analysis/DominatorInternals.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/DominatorInternals.h?rev=124058&r1=124057&r2=124058&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/DominatorInternals.h (original)
+++ llvm/trunk/include/llvm/Analysis/DominatorInternals.h Sat Jan 22 23:11:18 2011
@@ -43,8 +43,6 @@
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 @@
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 @@
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
Modified: llvm/trunk/include/llvm/Analysis/Dominators.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/Dominators.h?rev=124058&r1=124057&r2=124058&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/Dominators.h (original)
+++ llvm/trunk/include/llvm/Analysis/Dominators.h Sat Jan 22 23:11:18 2011
@@ -196,12 +196,10 @@
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;
More information about the llvm-commits
mailing list