Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 1 | //===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===// |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 9 | // |
Misha Brukman | be372b9 | 2003-08-21 22:14:26 +0000 | [diff] [blame] | 10 | // The LowerAllocations transformation is a target dependent tranformation |
Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 11 | // because it depends on the size of data types and alignment constraints. |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
Chris Lattner | 42706e4 | 2002-07-23 22:04:17 +0000 | [diff] [blame] | 15 | #include "llvm/Transforms/Scalar.h" |
Chris Lattner | d5d5678 | 2002-01-31 00:45:11 +0000 | [diff] [blame] | 16 | #include "llvm/Module.h" |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 17 | #include "llvm/DerivedTypes.h" |
| 18 | #include "llvm/iMemory.h" |
| 19 | #include "llvm/iOther.h" |
Chris Lattner | 9b55e5a | 2002-05-07 18:12:18 +0000 | [diff] [blame] | 20 | #include "llvm/Constants.h" |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 21 | #include "llvm/Pass.h" |
Chris Lattner | 9b55e5a | 2002-05-07 18:12:18 +0000 | [diff] [blame] | 22 | #include "llvm/Target/TargetData.h" |
Chris Lattner | bf3a099 | 2002-10-01 22:38:41 +0000 | [diff] [blame] | 23 | #include "Support/Statistic.h" |
Chris Lattner | 0b18c1d | 2002-05-10 15:38:35 +0000 | [diff] [blame] | 24 | |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame^] | 25 | namespace llvm { |
| 26 | |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 27 | namespace { |
Chris Lattner | bf3a099 | 2002-10-01 22:38:41 +0000 | [diff] [blame] | 28 | Statistic<> NumLowered("lowerallocs", "Number of allocations lowered"); |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 29 | |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 30 | /// LowerAllocations - Turn malloc and free instructions into %malloc and |
| 31 | /// %free calls. |
| 32 | /// |
| 33 | class LowerAllocations : public BasicBlockPass { |
| 34 | Function *MallocFunc; // Functions in the module we are processing |
| 35 | Function *FreeFunc; // Initialized by doInitialization |
| 36 | public: |
| 37 | LowerAllocations() : MallocFunc(0), FreeFunc(0) {} |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 38 | |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 39 | virtual void getAnalysisUsage(AnalysisUsage &AU) const { |
| 40 | AU.addRequired<TargetData>(); |
| 41 | } |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 42 | |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 43 | /// doPassInitialization - For the lower allocations pass, this ensures that |
| 44 | /// a module contains a declaration for a malloc and a free function. |
| 45 | /// |
| 46 | bool doInitialization(Module &M); |
| 47 | |
| 48 | /// runOnBasicBlock - This method does the actual work of converting |
| 49 | /// instructions over, assuming that the pass has already been initialized. |
| 50 | /// |
| 51 | bool runOnBasicBlock(BasicBlock &BB); |
| 52 | }; |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 53 | |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 54 | RegisterOpt<LowerAllocations> |
| 55 | X("lowerallocs", "Lower allocations from instructions to calls"); |
Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 56 | } |
Chris Lattner | 04805fa | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 57 | |
Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 58 | // createLowerAllocationsPass - Interface to this file... |
Brian Gaeke | 8c14ba9 | 2003-08-14 06:09:32 +0000 | [diff] [blame] | 59 | FunctionPass *createLowerAllocationsPass() { |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 60 | return new LowerAllocations(); |
Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 61 | } |
Chris Lattner | 37104aa | 2002-04-29 14:57:45 +0000 | [diff] [blame] | 62 | |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 63 | |
Chris Lattner | 0686e43 | 2002-01-21 07:31:50 +0000 | [diff] [blame] | 64 | // doInitialization - For the lower allocations pass, this ensures that a |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 65 | // module contains a declaration for a malloc and a free function. |
| 66 | // |
| 67 | // This function is always successful. |
| 68 | // |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 69 | bool LowerAllocations::doInitialization(Module &M) { |
Chris Lattner | 2887328 | 2003-08-31 00:22:27 +0000 | [diff] [blame] | 70 | const Type *SBPTy = PointerType::get(Type::SByteTy); |
| 71 | MallocFunc = M.getOrInsertFunction("malloc", SBPTy, Type::UIntTy, 0); |
| 72 | FreeFunc = M.getOrInsertFunction("free" , Type::VoidTy, SBPTy, 0); |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 73 | |
Chris Lattner | 77f791d | 2002-05-07 19:02:48 +0000 | [diff] [blame] | 74 | return true; |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 75 | } |
| 76 | |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 77 | // runOnBasicBlock - This method does the actual work of converting |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 78 | // instructions over, assuming that the pass has already been initialized. |
| 79 | // |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 80 | bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) { |
Chris Lattner | 6fea032 | 2001-10-18 05:27:33 +0000 | [diff] [blame] | 81 | bool Changed = false; |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 82 | assert(MallocFunc && FreeFunc && "Pass not initialized!"); |
| 83 | |
| 84 | BasicBlock::InstListType &BBIL = BB.getInstList(); |
Chris Lattner | 3cab9f0 | 2002-09-25 23:47:47 +0000 | [diff] [blame] | 85 | TargetData &DataLayout = getAnalysis<TargetData>(); |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 86 | |
| 87 | // Loop over all of the instructions, looking for malloc or free instructions |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 88 | for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) { |
Chris Lattner | 889f620 | 2003-04-23 16:37:45 +0000 | [diff] [blame] | 89 | if (MallocInst *MI = dyn_cast<MallocInst>(I)) { |
Chris Lattner | 113f4f4 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 90 | const Type *AllocTy = MI->getType()->getElementType(); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 91 | |
| 92 | // Get the number of bytes to be allocated for one element of the |
| 93 | // requested type... |
| 94 | unsigned Size = DataLayout.getTypeSize(AllocTy); |
| 95 | |
| 96 | // malloc(type) becomes sbyte *malloc(constint) |
| 97 | Value *MallocArg = ConstantUInt::get(Type::UIntTy, Size); |
| 98 | if (MI->getNumOperands() && Size == 1) { |
| 99 | MallocArg = MI->getOperand(0); // Operand * 1 = Operand |
| 100 | } else if (MI->getNumOperands()) { |
Misha Brukman | 7eb05a1 | 2003-08-18 14:43:39 +0000 | [diff] [blame] | 101 | // Multiply it by the array size if necessary... |
Chris Lattner | a239e68 | 2002-09-10 22:38:47 +0000 | [diff] [blame] | 102 | MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0), |
| 103 | MallocArg, "", I); |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 104 | } |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 105 | |
| 106 | // Create the call to Malloc... |
Chris Lattner | 57698e2 | 2002-03-26 18:01:55 +0000 | [diff] [blame] | 107 | CallInst *MCall = new CallInst(MallocFunc, |
Chris Lattner | 1f45f4e | 2003-04-23 16:18:14 +0000 | [diff] [blame] | 108 | std::vector<Value*>(1, MallocArg), "", I); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 109 | |
| 110 | // Create a cast instruction to convert to the right type... |
Chris Lattner | a239e68 | 2002-09-10 22:38:47 +0000 | [diff] [blame] | 111 | CastInst *MCast = new CastInst(MCall, MI->getType(), "", I); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 112 | |
| 113 | // Replace all uses of the old malloc inst with the cast inst |
| 114 | MI->replaceAllUsesWith(MCast); |
Chris Lattner | a239e68 | 2002-09-10 22:38:47 +0000 | [diff] [blame] | 115 | I = --BBIL.erase(I); // remove and delete the malloc instr... |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 116 | Changed = true; |
Chris Lattner | 0b18c1d | 2002-05-10 15:38:35 +0000 | [diff] [blame] | 117 | ++NumLowered; |
Chris Lattner | 889f620 | 2003-04-23 16:37:45 +0000 | [diff] [blame] | 118 | } else if (FreeInst *FI = dyn_cast<FreeInst>(I)) { |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 119 | // Cast the argument to free into a ubyte*... |
| 120 | CastInst *MCast = new CastInst(FI->getOperand(0), |
Chris Lattner | 652e7bf | 2003-05-15 18:25:13 +0000 | [diff] [blame] | 121 | PointerType::get(Type::SByteTy), "", I); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 122 | |
| 123 | // Insert a call to the free function... |
Chris Lattner | 1f45f4e | 2003-04-23 16:18:14 +0000 | [diff] [blame] | 124 | CallInst *FCall = new CallInst(FreeFunc, std::vector<Value*>(1, MCast), |
| 125 | "", I); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 126 | |
| 127 | // Delete the old free instruction |
Chris Lattner | a239e68 | 2002-09-10 22:38:47 +0000 | [diff] [blame] | 128 | I = --BBIL.erase(I); |
Chris Lattner | d07471d | 2002-01-21 23:34:02 +0000 | [diff] [blame] | 129 | Changed = true; |
Chris Lattner | 0b18c1d | 2002-05-10 15:38:35 +0000 | [diff] [blame] | 130 | ++NumLowered; |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 131 | } |
| 132 | } |
| 133 | |
Chris Lattner | 6fea032 | 2001-10-18 05:27:33 +0000 | [diff] [blame] | 134 | return Changed; |
Chris Lattner | 1bb5f8e | 2001-10-15 17:31:51 +0000 | [diff] [blame] | 135 | } |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame^] | 136 | |
| 137 | } // End llvm namespace |