RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-22 19:49:49 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove useless struct fields.

Browse Source 
llvm-svn: 124058
This commit is contained in:
Cameron Zwarich 2011-01-23 05:11:18 +00:00
parent 2f271f19aa
commit f881ff46fe
2 changed files with 2 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
include/llvm/Analysis/DominatorInternals.h
View File

@ -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

6
include/llvm/Analysis/Dominators.h
View File

@ -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;