Add a priority queue class, which is a wrapper around std::priority_queue

[oota-llvm.git] / lib / CodeGen / PrologEpilogInserter.cpp

diff --git a/lib/CodeGen/PrologEpilogInserter.cpp b/lib/CodeGen/PrologEpilogInserter.cpp
index 4a00ea095c90595da3ef14db05e4052798551683..c52da321c1e9a05e922486ff70c1a21f279bc3a7 100644 (file)
--- a/lib/CodeGen/PrologEpilogInserter.cpp
+++ b/lib/CodeGen/PrologEpilogInserter.cpp
@@ -68,7 +68,7 @@ namespace {
 
       // Allow the target machine to make final modifications to the function
       // before the frame layout is finalized.
-      Fn.getTarget().getRegisterInfo()->processFunctionBeforeFrameFinalized(Fn);
+      TRI->processFunctionBeforeFrameFinalized(Fn);
 
       // Calculate actual frame offsets for all of the abstract stack objects...
       calculateFrameObjectOffsets(Fn);
@@ -313,7 +313,7 @@ void PEI::calculateFrameObjectOffsets(MachineFunction &Fn) {
   // Loop over all of the stack objects, assigning sequential addresses...
   MachineFrameInfo *FFI = Fn.getFrameInfo();
 
-  unsigned MaxAlign = 0;
+  unsigned MaxAlign = FFI->getMaxAlignment();
 
   // Start at the beginning of the local area.
   // The Offset is the distance from the stack top in the direction
@@ -362,7 +362,8 @@ void PEI::calculateFrameObjectOffsets(MachineFunction &Fn) {
       FFI->setObjectOffset(i, -Offset);        // Set the computed offset
     }
   } else {
-    for (unsigned i = MaxCSFrameIndex; i >= MinCSFrameIndex; --i) {
+    int MaxCSFI = MaxCSFrameIndex, MinCSFI = MinCSFrameIndex;
+    for (int i = MaxCSFI; i >= MinCSFI ; --i) {
       unsigned Align = FFI->getObjectAlignment(i);
       // If the alignment of this object is greater than that of the stack, then
       // increase the stack alignment to match.
@@ -484,14 +485,16 @@ void PEI::calculateFrameObjectOffsets(MachineFunction &Fn) {
 /// prolog and epilog code to the function.
 ///
 void PEI::insertPrologEpilogCode(MachineFunction &Fn) {
+  const TargetRegisterInfo *TRI = Fn.getTarget().getRegisterInfo();
+
   // Add prologue to the function...
-  Fn.getTarget().getRegisterInfo()->emitPrologue(Fn);
+  TRI->emitPrologue(Fn);
 
   // Add epilogue to restore the callee-save registers in each exiting block
   for (MachineFunction::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
     // If last instruction is a return instruction, add an epilogue
     if (!I->empty() && I->back().getDesc().isReturn())
-      Fn.getTarget().getRegisterInfo()->emitEpilogue(Fn, *I);
+      TRI->emitEpilogue(Fn, *I);
   }
 }
 
@@ -520,57 +523,57 @@ void PEI::replaceFrameIndices(MachineFunction &Fn) {
       if (I->getOpcode() == TargetInstrInfo::DECLARE) {
         // Ignore it.
         ++I;
-       continue;
+        continue;
       }
 
       if (I->getOpcode() == FrameSetupOpcode ||
           I->getOpcode() == FrameDestroyOpcode) {
         // Remember how much SP has been adjusted to create the call
         // frame.
-       int Size = I->getOperand(0).getImm();
+        int Size = I->getOperand(0).getImm();
 
-       if ((!StackGrowsDown && I->getOpcode() == FrameSetupOpcode) ||
-           (StackGrowsDown && I->getOpcode() == FrameDestroyOpcode))
-         Size = -Size;
+        if ((!StackGrowsDown && I->getOpcode() == FrameSetupOpcode) ||
+            (StackGrowsDown && I->getOpcode() == FrameDestroyOpcode))
+          Size = -Size;
 
-       SPAdj += Size;
+        SPAdj += Size;
 
-       MachineBasicBlock::iterator PrevI = prior(I);
-       TRI.eliminateCallFramePseudoInstr(Fn, *BB, I);
+        MachineBasicBlock::iterator PrevI = prior(I);
+        TRI.eliminateCallFramePseudoInstr(Fn, *BB, I);
 
-       // Visit the instructions created by eliminateCallFramePseudoInstr().
-       I = next(PrevI);
-       continue;
+        // Visit the instructions created by eliminateCallFramePseudoInstr().
+        I = next(PrevI);
+        continue;
       }
 
       bool DoIncr = true;
 
       for (unsigned i = 0, e = MI->getNumOperands(); i != e; ++i)
-       if (MI->getOperand(i).isFrameIndex()) {
-         // Some instructions (e.g. inline asm instructions) can have
-         // multiple frame indices and/or cause eliminateFrameIndex
-         // to insert more than one instruction. We need the register
-         // scavenger to go through all of these instructions so that
-         // it can update its register information. We keep the
-         // iterator at the point before insertion so that we can
-         // revisit them in full.
-         bool AtBeginning = (I == BB->begin());
-         if (!AtBeginning) --I;
-
-         // If this instruction has a FrameIndex operand, we need to
-         // use that target machine register info object to eliminate
-         // it.
-         TRI.eliminateFrameIndex(MI, SPAdj, RS);
-
-         // Reset the iterator if we were at the beginning of the BB.
-         if (AtBeginning) {
-           I = BB->begin();
-           DoIncr = false;
-         }
-
-         MI = 0;
-         break;
-       }
+        if (MI->getOperand(i).isFrameIndex()) {
+          // Some instructions (e.g. inline asm instructions) can have
+          // multiple frame indices and/or cause eliminateFrameIndex
+          // to insert more than one instruction. We need the register
+          // scavenger to go through all of these instructions so that
+          // it can update its register information. We keep the
+          // iterator at the point before insertion so that we can
+          // revisit them in full.
+          bool AtBeginning = (I == BB->begin());
+          if (!AtBeginning) --I;
+
+          // If this instruction has a FrameIndex operand, we need to
+          // use that target machine register info object to eliminate
+          // it.
+          TRI.eliminateFrameIndex(MI, SPAdj, RS);
+
+          // Reset the iterator if we were at the beginning of the BB.
+          if (AtBeginning) {
+            I = BB->begin();
+            DoIncr = false;
+          }
+
+          MI = 0;
+          break;
+        }
 
       if (DoIncr) ++I;