blob: be66edf9fa584bffa3e10cb5ec4716fe27278ef8 [file] [log] [blame]
Chris Lattner77f791d2002-05-07 19:02:48 +00001//===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===//
Chris Lattner1bb5f8e2001-10-15 17:31:51 +00002//
Misha Brukmanbe372b92003-08-21 22:14:26 +00003// The LowerAllocations transformation is a target dependent tranformation
Chris Lattner77f791d2002-05-07 19:02:48 +00004// because it depends on the size of data types and alignment constraints.
Chris Lattner1bb5f8e2001-10-15 17:31:51 +00005//
6//===----------------------------------------------------------------------===//
7
Chris Lattner42706e42002-07-23 22:04:17 +00008#include "llvm/Transforms/Scalar.h"
Chris Lattnerd5d56782002-01-31 00:45:11 +00009#include "llvm/Module.h"
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000010#include "llvm/DerivedTypes.h"
11#include "llvm/iMemory.h"
12#include "llvm/iOther.h"
Chris Lattner9b55e5a2002-05-07 18:12:18 +000013#include "llvm/Constants.h"
Chris Lattner04805fa2002-02-26 21:46:54 +000014#include "llvm/Pass.h"
Chris Lattner9b55e5a2002-05-07 18:12:18 +000015#include "llvm/Target/TargetData.h"
Chris Lattnerbf3a0992002-10-01 22:38:41 +000016#include "Support/Statistic.h"
Chris Lattner0b18c1d2002-05-10 15:38:35 +000017
Chris Lattner04805fa2002-02-26 21:46:54 +000018namespace {
Chris Lattnerbf3a0992002-10-01 22:38:41 +000019 Statistic<> NumLowered("lowerallocs", "Number of allocations lowered");
Chris Lattner04805fa2002-02-26 21:46:54 +000020
Chris Lattner3cab9f02002-09-25 23:47:47 +000021 /// LowerAllocations - Turn malloc and free instructions into %malloc and
22 /// %free calls.
23 ///
24 class LowerAllocations : public BasicBlockPass {
25 Function *MallocFunc; // Functions in the module we are processing
26 Function *FreeFunc; // Initialized by doInitialization
27 public:
28 LowerAllocations() : MallocFunc(0), FreeFunc(0) {}
Chris Lattner04805fa2002-02-26 21:46:54 +000029
Chris Lattner3cab9f02002-09-25 23:47:47 +000030 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
31 AU.addRequired<TargetData>();
32 }
Chris Lattner04805fa2002-02-26 21:46:54 +000033
Chris Lattner3cab9f02002-09-25 23:47:47 +000034 /// doPassInitialization - For the lower allocations pass, this ensures that
35 /// a module contains a declaration for a malloc and a free function.
36 ///
37 bool doInitialization(Module &M);
38
39 /// runOnBasicBlock - This method does the actual work of converting
40 /// instructions over, assuming that the pass has already been initialized.
41 ///
42 bool runOnBasicBlock(BasicBlock &BB);
43 };
Chris Lattner04805fa2002-02-26 21:46:54 +000044
Chris Lattner3cab9f02002-09-25 23:47:47 +000045 RegisterOpt<LowerAllocations>
46 X("lowerallocs", "Lower allocations from instructions to calls");
Chris Lattner77f791d2002-05-07 19:02:48 +000047}
Chris Lattner04805fa2002-02-26 21:46:54 +000048
Chris Lattner77f791d2002-05-07 19:02:48 +000049// createLowerAllocationsPass - Interface to this file...
Brian Gaeke8c14ba92003-08-14 06:09:32 +000050FunctionPass *createLowerAllocationsPass() {
Chris Lattner3cab9f02002-09-25 23:47:47 +000051 return new LowerAllocations();
Chris Lattner77f791d2002-05-07 19:02:48 +000052}
Chris Lattner37104aa2002-04-29 14:57:45 +000053
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000054
Chris Lattner0686e432002-01-21 07:31:50 +000055// doInitialization - For the lower allocations pass, this ensures that a
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000056// module contains a declaration for a malloc and a free function.
57//
58// This function is always successful.
59//
Chris Lattner113f4f42002-06-25 16:13:24 +000060bool LowerAllocations::doInitialization(Module &M) {
Chris Lattner28873282003-08-31 00:22:27 +000061 const Type *SBPTy = PointerType::get(Type::SByteTy);
62 MallocFunc = M.getOrInsertFunction("malloc", SBPTy, Type::UIntTy, 0);
63 FreeFunc = M.getOrInsertFunction("free" , Type::VoidTy, SBPTy, 0);
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000064
Chris Lattner77f791d2002-05-07 19:02:48 +000065 return true;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000066}
67
Chris Lattnerd07471d2002-01-21 23:34:02 +000068// runOnBasicBlock - This method does the actual work of converting
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000069// instructions over, assuming that the pass has already been initialized.
70//
Chris Lattner113f4f42002-06-25 16:13:24 +000071bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {
Chris Lattner6fea0322001-10-18 05:27:33 +000072 bool Changed = false;
Chris Lattner113f4f42002-06-25 16:13:24 +000073 assert(MallocFunc && FreeFunc && "Pass not initialized!");
74
75 BasicBlock::InstListType &BBIL = BB.getInstList();
Chris Lattner3cab9f02002-09-25 23:47:47 +000076 TargetData &DataLayout = getAnalysis<TargetData>();
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000077
78 // Loop over all of the instructions, looking for malloc or free instructions
Chris Lattner113f4f42002-06-25 16:13:24 +000079 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) {
Chris Lattner889f6202003-04-23 16:37:45 +000080 if (MallocInst *MI = dyn_cast<MallocInst>(I)) {
Chris Lattner113f4f42002-06-25 16:13:24 +000081 const Type *AllocTy = MI->getType()->getElementType();
Chris Lattnerd07471d2002-01-21 23:34:02 +000082
83 // Get the number of bytes to be allocated for one element of the
84 // requested type...
85 unsigned Size = DataLayout.getTypeSize(AllocTy);
86
87 // malloc(type) becomes sbyte *malloc(constint)
88 Value *MallocArg = ConstantUInt::get(Type::UIntTy, Size);
89 if (MI->getNumOperands() && Size == 1) {
90 MallocArg = MI->getOperand(0); // Operand * 1 = Operand
91 } else if (MI->getNumOperands()) {
Misha Brukman7eb05a12003-08-18 14:43:39 +000092 // Multiply it by the array size if necessary...
Chris Lattnera239e682002-09-10 22:38:47 +000093 MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),
94 MallocArg, "", I);
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000095 }
Chris Lattnerd07471d2002-01-21 23:34:02 +000096
97 // Create the call to Malloc...
Chris Lattner57698e22002-03-26 18:01:55 +000098 CallInst *MCall = new CallInst(MallocFunc,
Chris Lattner1f45f4e2003-04-23 16:18:14 +000099 std::vector<Value*>(1, MallocArg), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000100
101 // Create a cast instruction to convert to the right type...
Chris Lattnera239e682002-09-10 22:38:47 +0000102 CastInst *MCast = new CastInst(MCall, MI->getType(), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000103
104 // Replace all uses of the old malloc inst with the cast inst
105 MI->replaceAllUsesWith(MCast);
Chris Lattnera239e682002-09-10 22:38:47 +0000106 I = --BBIL.erase(I); // remove and delete the malloc instr...
Chris Lattnerd07471d2002-01-21 23:34:02 +0000107 Changed = true;
Chris Lattner0b18c1d2002-05-10 15:38:35 +0000108 ++NumLowered;
Chris Lattner889f6202003-04-23 16:37:45 +0000109 } else if (FreeInst *FI = dyn_cast<FreeInst>(I)) {
Chris Lattnerd07471d2002-01-21 23:34:02 +0000110 // Cast the argument to free into a ubyte*...
111 CastInst *MCast = new CastInst(FI->getOperand(0),
Chris Lattner652e7bf2003-05-15 18:25:13 +0000112 PointerType::get(Type::SByteTy), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000113
114 // Insert a call to the free function...
Chris Lattner1f45f4e2003-04-23 16:18:14 +0000115 CallInst *FCall = new CallInst(FreeFunc, std::vector<Value*>(1, MCast),
116 "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000117
118 // Delete the old free instruction
Chris Lattnera239e682002-09-10 22:38:47 +0000119 I = --BBIL.erase(I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000120 Changed = true;
Chris Lattner0b18c1d2002-05-10 15:38:35 +0000121 ++NumLowered;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +0000122 }
123 }
124
Chris Lattner6fea0322001-10-18 05:27:33 +0000125 return Changed;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +0000126}