[llvm-commits] CVS: llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp PrologEpilogCodeInserter.cpp PeepholeOpts.cpp MappingInfo.cpp EmitAssembly.cpp

Alkis Evlogimenos alkis at cs.uiuc.edu
Wed Feb 11 20:28:26 PST 2004


Changes in directory llvm/lib/Target/Sparc:

SparcV9CodeEmitter.cpp updated: 1.54 -> 1.55
PrologEpilogCodeInserter.cpp updated: 1.33 -> 1.34
PeepholeOpts.cpp updated: 1.18 -> 1.19
MappingInfo.cpp updated: 1.15 -> 1.16
EmitAssembly.cpp updated: 1.104 -> 1.105

---
Log message:

Change MachineBasicBlock's vector of MachineInstr pointers into an
ilist of MachineInstr objects. This allows constant time removal and
insertion of MachineInstr instances from anywhere in each
MachineBasicBlock. It also allows for constant time splicing of
MachineInstrs into or out of MachineBasicBlocks.


---
Diffs of the changes:  (+13 -21)

Index: llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp
diff -u llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp:1.54 llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp:1.55
--- llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp:1.54	Wed Feb 11 00:04:51 2004
+++ llvm/lib/Target/Sparc/SparcV9CodeEmitter.cpp	Wed Feb 11 20:27:09 2004
@@ -778,7 +778,7 @@
   currBB = MBB.getBasicBlock();
   BBLocations[currBB] = MCE.getCurrentPCValue();
   for (MachineBasicBlock::iterator I = MBB.begin(), E = MBB.end(); I != E; ++I){
-    unsigned binCode = getBinaryCodeForInstr(**I);
+    unsigned binCode = getBinaryCodeForInstr(*I);
     if (binCode == (1 << 30)) {
       // this is an invalid call: the addr is out of bounds. that means a code
       // sequence has already been emitted, and this is a no-op


Index: llvm/lib/Target/Sparc/PrologEpilogCodeInserter.cpp
diff -u llvm/lib/Target/Sparc/PrologEpilogCodeInserter.cpp:1.33 llvm/lib/Target/Sparc/PrologEpilogCodeInserter.cpp:1.34
--- llvm/lib/Target/Sparc/PrologEpilogCodeInserter.cpp:1.33	Wed Feb 11 14:47:32 2004
+++ llvm/lib/Target/Sparc/PrologEpilogCodeInserter.cpp	Wed Feb 11 20:27:09 2004
@@ -157,12 +157,12 @@
       unsigned numNOPs = 0;
       while (termMvec.back()->getOpcode() == V9::NOP)
       {
-        assert( termMvec.back() == MBB.back());
-        delete MBB.pop_back();
+        assert( termMvec.back() == &MBB.back());
         termMvec.pop_back();
+        MBB.erase(&MBB.back());
         ++numNOPs;
       }
-      assert(termMvec.back() == MBB.back());
+      assert(termMvec.back() == &MBB.back());
         
       // Check that we found the right number of NOPs and have the right
       // number of instructions to replace them.


Index: llvm/lib/Target/Sparc/PeepholeOpts.cpp
diff -u llvm/lib/Target/Sparc/PeepholeOpts.cpp:1.18 llvm/lib/Target/Sparc/PeepholeOpts.cpp:1.19
--- llvm/lib/Target/Sparc/PeepholeOpts.cpp:1.18	Wed Feb 11 14:47:32 2004
+++ llvm/lib/Target/Sparc/PeepholeOpts.cpp	Wed Feb 11 20:27:09 2004
@@ -31,14 +31,14 @@
   // Check if this instruction is in a delay slot of its predecessor.
   if (BBI != mvec.begin()) {
       const TargetInstrInfo& mii = target.getInstrInfo();
-      MachineInstr* predMI = *(BBI-1);
+      MachineBasicBlock::iterator predMI = BBI; --predMI;
       if (unsigned ndelay = mii.getNumDelaySlots(predMI->getOpcode())) {
         // This instruction is in a delay slot of its predecessor, so
         // replace it with a nop. By replacing in place, we save having
         // to update the I-I maps.
         // 
         assert(ndelay == 1 && "Not yet handling multiple-delay-slot targets");
-        (*BBI)->replace(mii.getNOPOpCode(), 0);
+        BBI->replace(mii.getNOPOpCode(), 0);
         return;
       }
   }
@@ -99,7 +99,7 @@
 RemoveUselessCopies(MachineBasicBlock& mvec,
                     MachineBasicBlock::iterator& BBI,
                     const TargetMachine& target) {
-  if (IsUselessCopy(target, *BBI)) {
+  if (IsUselessCopy(target, BBI)) {
     DeleteInstruction(mvec, BBI, target);
     return true;
   }
@@ -148,16 +148,8 @@
   assert(MBB && "MachineBasicBlock object not found for specified block!");
   MachineBasicBlock &mvec = *MBB;
 
-  // Iterate over all machine instructions in the BB
-  // Use a reverse iterator to allow deletion of MI or any instruction after it.
-  // Insertions or deletions *before* MI are not safe.
-  // 
-  for (MachineBasicBlock::reverse_iterator RI=mvec.rbegin(),
-         RE=mvec.rend(); RI != RE; ) {
-    MachineBasicBlock::iterator BBI = RI.base()-1; // save before incr
-    ++RI;             // pre-increment to delete MI or after it
-    visit(mvec, BBI);
-  }
+  for (MachineBasicBlock::iterator I = mvec.begin(), E = mvec.end(); I != E; )
+    visit(mvec, I++);
 
   return true;
 }


Index: llvm/lib/Target/Sparc/MappingInfo.cpp
diff -u llvm/lib/Target/Sparc/MappingInfo.cpp:1.15 llvm/lib/Target/Sparc/MappingInfo.cpp:1.16
--- llvm/lib/Target/Sparc/MappingInfo.cpp:1.15	Tue Nov 11 16:41:33 2003
+++ llvm/lib/Target/Sparc/MappingInfo.cpp	Wed Feb 11 20:27:09 2004
@@ -153,7 +153,7 @@
   for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
        BI != BE; ++BI) {
     MachineBasicBlock &miBB = *BI;
-    key[miBB[0]] = i;
+    key[&miBB.front()] = i;
     i = i+(miBB.size());
   }
 }
@@ -174,7 +174,7 @@
     unsigned j = 0;
     for(MachineBasicBlock::iterator miI = miBB.begin(), miE = miBB.end();
         miI != miE; ++miI, ++j) {
-      key[*miI] = j;
+      key[miI] = j;
     }
   }
 }
@@ -195,7 +195,7 @@
        BI != BE; ++BI, ++bb) {
     MachineBasicBlock &miBB = *BI;
     writeNumber(bb);
-    writeNumber(BBkey[miBB[0]]);
+    writeNumber(BBkey[&miBB.front()]);
     writeNumber(miBB.size());
   }
 }


Index: llvm/lib/Target/Sparc/EmitAssembly.cpp
diff -u llvm/lib/Target/Sparc/EmitAssembly.cpp:1.104 llvm/lib/Target/Sparc/EmitAssembly.cpp:1.105
--- llvm/lib/Target/Sparc/EmitAssembly.cpp:1.104	Wed Feb 11 14:47:31 2004
+++ llvm/lib/Target/Sparc/EmitAssembly.cpp	Wed Feb 11 20:27:09 2004
@@ -721,7 +721,7 @@
   // Loop over all of the instructions in the basic block...
   for (MachineBasicBlock::const_iterator MII = MBB.begin(), MIE = MBB.end();
        MII != MIE; ++MII)
-    emitMachineInst(*MII);
+    emitMachineInst(MII);
   toAsm << "\n";  // Separate BB's with newlines
 }
 





More information about the llvm-commits mailing list