Add a few comments.
authorOwen Anderson <resistor@mac.com>
Tue, 6 Nov 2007 05:26:02 +0000 (05:26 +0000)
committerOwen Anderson <resistor@mac.com>
Tue, 6 Nov 2007 05:26:02 +0000 (05:26 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43755 91177308-0d34-0410-b5e6-96231b3b80d8

lib/CodeGen/StrongPHIElimination.cpp

index c5e9c343fc7c92a05b9f3ab077bacab209d8684d..86224038a0204f223cdb10b9f205f64bf4d508e2 100644 (file)
@@ -146,6 +146,8 @@ void StrongPHIElimination::computeDFS(MachineFunction& MF) {
   }
 }
 
+/// PreorderSorter - a helper class that is used to sort registers
+/// according to the preorder number of their defining blocks
 class PreorderSorter {
 private:
   DenseMap<MachineBasicBlock*, unsigned>& preorder;
@@ -172,6 +174,8 @@ public:
   }
 };
 
+/// computeDomForest - compute the subforest of the DomTree corresponding
+/// to the defining blocks of the registers in question
 std::vector<StrongPHIElimination::DomForestNode*>
 StrongPHIElimination::computeDomForest(std::set<unsigned>& regs) {
   LiveVariables& LV = getAnalysis<LiveVariables>();
@@ -215,6 +219,7 @@ StrongPHIElimination::computeDomForest(std::set<unsigned>& regs) {
   return ret;
 }
 
+/// processPHI - Eliminate the given PHI node
 void StrongPHIElimination::processPHI(MachineInstr* P) {
   
 }