Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 1 | //===-- PeepholeOpts.cpp --------------------------------------------------===// |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 2 | // |
Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 3 | // Support for performing several peephole opts in one or a few passes over the |
| 4 | // machine code of a method. |
| 5 | // |
| 6 | //===----------------------------------------------------------------------===// |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 7 | |
| 8 | #include "llvm/CodeGen/PeepholeOpts.h" |
Misha Brukman | b7551ef | 2002-10-28 20:00:31 +0000 | [diff] [blame] | 9 | #include "llvm/CodeGen/MachineFunction.h" |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 10 | #include "llvm/CodeGen/MachineInstr.h" |
| 11 | #include "llvm/Target/TargetMachine.h" |
Chris Lattner | 3501fea | 2003-01-14 22:00:31 +0000 | [diff] [blame] | 12 | #include "llvm/Target/TargetInstrInfo.h" |
Chris Lattner | f27eeea | 2002-12-29 02:50:35 +0000 | [diff] [blame] | 13 | #include "llvm/Target/TargetOptInfo.h" |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 14 | #include "llvm/BasicBlock.h" |
| 15 | #include "llvm/Pass.h" |
| 16 | |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 17 | //************************* Internal Functions *****************************/ |
| 18 | |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 19 | static inline void |
Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 20 | DeleteInstruction(MachineBasicBlock& mvec, |
| 21 | MachineBasicBlock::iterator& BBI, |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 22 | const TargetMachine& target) { |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 23 | // Check if this instruction is in a delay slot of its predecessor. |
Misha Brukman | f96eb64 | 2003-05-23 19:20:57 +0000 | [diff] [blame] | 24 | if (BBI != mvec.begin()) { |
Chris Lattner | 3501fea | 2003-01-14 22:00:31 +0000 | [diff] [blame] | 25 | const TargetInstrInfo& mii = target.getInstrInfo(); |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 26 | MachineInstr* predMI = *(BBI-1); |
Misha Brukman | f96eb64 | 2003-05-23 19:20:57 +0000 | [diff] [blame] | 27 | if (unsigned ndelay = mii.getNumDelaySlots(predMI->getOpCode())) { |
| 28 | // This instruction is in a delay slot of its predecessor, so |
| 29 | // replace it with a nop. By replacing in place, we save having |
| 30 | // to update the I-I maps. |
| 31 | // |
| 32 | assert(ndelay == 1 && "Not yet handling multiple-delay-slot targets"); |
| 33 | (*BBI)->replace(mii.getNOPOpCode(), 0); |
| 34 | return; |
| 35 | } |
| 36 | } |
Vikram S. Adve | 7e5167a | 2002-09-27 14:27:37 +0000 | [diff] [blame] | 37 | |
| 38 | // The instruction is not in a delay slot, so we can simply erase it. |
| 39 | mvec.erase(BBI); |
| 40 | BBI = mvec.end(); |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 41 | } |
| 42 | |
| 43 | //******************* Individual Peephole Optimizations ********************/ |
| 44 | |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 45 | inline bool |
Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 46 | RemoveUselessCopies(MachineBasicBlock& mvec, |
| 47 | MachineBasicBlock::iterator& BBI, |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 48 | const TargetMachine& target) { |
Misha Brukman | f96eb64 | 2003-05-23 19:20:57 +0000 | [diff] [blame] | 49 | if (target.getOptInfo().IsUselessCopy(*BBI)) { |
| 50 | DeleteInstruction(mvec, BBI, target); |
| 51 | return true; |
| 52 | } |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 53 | return false; |
| 54 | } |
| 55 | |
| 56 | |
| 57 | //************************ Class Implementations **************************/ |
| 58 | |
| 59 | class PeepholeOpts: public BasicBlockPass { |
| 60 | const TargetMachine ⌖ |
Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 61 | bool visit(MachineBasicBlock& mvec, |
| 62 | MachineBasicBlock::iterator BBI) const; |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 63 | public: |
| 64 | PeepholeOpts(const TargetMachine &T): target(T) { } |
| 65 | bool runOnBasicBlock(BasicBlock &BB); // apply this pass to each BB |
Chris Lattner | a8e40f5 | 2003-08-14 14:43:24 +0000 | [diff] [blame] | 66 | virtual const char *getPassName() const { return "Peephole Optimization"; } |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 67 | }; |
| 68 | |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 69 | // Apply a list of peephole optimizations to this machine instruction |
| 70 | // within its local context. They are allowed to delete MI or any |
| 71 | // instruction before MI, but not |
| 72 | // |
| 73 | bool PeepholeOpts::visit(MachineBasicBlock& mvec, |
| 74 | MachineBasicBlock::iterator BBI) const { |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 75 | /* Remove redundant copy instructions */ |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 76 | return RemoveUselessCopies(mvec, BBI, target); |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 77 | } |
| 78 | |
| 79 | |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 80 | bool PeepholeOpts::runOnBasicBlock(BasicBlock &BB) { |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 81 | // Get the machine instructions for this BB |
Misha Brukman | b7551ef | 2002-10-28 20:00:31 +0000 | [diff] [blame] | 82 | // FIXME: MachineBasicBlock::get() is deprecated, hence inlining the function |
| 83 | const Function *F = BB.getParent(); |
| 84 | MachineFunction &MF = MachineFunction::get(F); |
| 85 | MachineBasicBlock *MBB = NULL; |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 86 | for (MachineFunction::iterator I = MF.begin(), E = MF.end(); I != E; ++I) |
Misha Brukman | b7551ef | 2002-10-28 20:00:31 +0000 | [diff] [blame] | 87 | if (I->getBasicBlock() == &BB) |
| 88 | MBB = I; |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 89 | |
Misha Brukman | b7551ef | 2002-10-28 20:00:31 +0000 | [diff] [blame] | 90 | assert(MBB && "MachineBasicBlock object not found for specified block!"); |
| 91 | MachineBasicBlock &mvec = *MBB; |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 92 | |
| 93 | // Iterate over all machine instructions in the BB |
| 94 | // Use a reverse iterator to allow deletion of MI or any instruction after it. |
| 95 | // Insertions or deletions *before* MI are not safe. |
| 96 | // |
Chris Lattner | 55291ea | 2002-10-28 01:41:47 +0000 | [diff] [blame] | 97 | for (MachineBasicBlock::reverse_iterator RI=mvec.rbegin(), |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 98 | RE=mvec.rend(); RI != RE; ) { |
Misha Brukman | f96eb64 | 2003-05-23 19:20:57 +0000 | [diff] [blame] | 99 | MachineBasicBlock::iterator BBI = RI.base()-1; // save before incr |
| 100 | ++RI; // pre-increment to delete MI or after it |
| 101 | visit(mvec, BBI); |
| 102 | } |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 103 | |
| 104 | return true; |
| 105 | } |
| 106 | |
| 107 | |
| 108 | //===----------------------------------------------------------------------===// |
| 109 | // createPeepholeOptsPass - Public entrypoint for peephole optimization |
| 110 | // and this file as a whole... |
| 111 | // |
Chris Lattner | e96e263 | 2003-09-01 20:24:06 +0000 | [diff] [blame^] | 112 | FunctionPass* createPeepholeOptsPass(TargetMachine &T) { |
Vikram S. Adve | 25d80cd | 2002-09-20 00:42:11 +0000 | [diff] [blame] | 113 | return new PeepholeOpts(T); |
| 114 | } |