blob: 96008881bbaba321325a9e0efee3ad73f709de54 [file] [log] [blame]
Chris Lattner77f791d2002-05-07 19:02:48 +00001//===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===//
John Criswell482202a2003-10-20 19:43:21 +00002//
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 Lattner1bb5f8e2001-10-15 17:31:51 +00009//
Misha Brukmanbe372b92003-08-21 22:14:26 +000010// The LowerAllocations transformation is a target dependent tranformation
Chris Lattner77f791d2002-05-07 19:02:48 +000011// because it depends on the size of data types and alignment constraints.
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000012//
13//===----------------------------------------------------------------------===//
14
Chris Lattner42706e42002-07-23 22:04:17 +000015#include "llvm/Transforms/Scalar.h"
Chris Lattnerd5d56782002-01-31 00:45:11 +000016#include "llvm/Module.h"
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000017#include "llvm/DerivedTypes.h"
18#include "llvm/iMemory.h"
19#include "llvm/iOther.h"
Chris Lattner9b55e5a2002-05-07 18:12:18 +000020#include "llvm/Constants.h"
Chris Lattner04805fa2002-02-26 21:46:54 +000021#include "llvm/Pass.h"
Chris Lattner9b55e5a2002-05-07 18:12:18 +000022#include "llvm/Target/TargetData.h"
Chris Lattnerbf3a0992002-10-01 22:38:41 +000023#include "Support/Statistic.h"
Chris Lattner0b18c1d2002-05-10 15:38:35 +000024
Chris Lattner04805fa2002-02-26 21:46:54 +000025namespace {
Chris Lattnerbf3a0992002-10-01 22:38:41 +000026 Statistic<> NumLowered("lowerallocs", "Number of allocations lowered");
Chris Lattner04805fa2002-02-26 21:46:54 +000027
Chris Lattner3cab9f02002-09-25 23:47:47 +000028 /// LowerAllocations - Turn malloc and free instructions into %malloc and
29 /// %free calls.
30 ///
31 class LowerAllocations : public BasicBlockPass {
32 Function *MallocFunc; // Functions in the module we are processing
33 Function *FreeFunc; // Initialized by doInitialization
34 public:
35 LowerAllocations() : MallocFunc(0), FreeFunc(0) {}
Chris Lattner04805fa2002-02-26 21:46:54 +000036
Chris Lattner3cab9f02002-09-25 23:47:47 +000037 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
38 AU.addRequired<TargetData>();
39 }
Chris Lattner04805fa2002-02-26 21:46:54 +000040
Chris Lattner3cab9f02002-09-25 23:47:47 +000041 /// doPassInitialization - For the lower allocations pass, this ensures that
42 /// a module contains a declaration for a malloc and a free function.
43 ///
44 bool doInitialization(Module &M);
45
46 /// runOnBasicBlock - This method does the actual work of converting
47 /// instructions over, assuming that the pass has already been initialized.
48 ///
49 bool runOnBasicBlock(BasicBlock &BB);
50 };
Chris Lattner04805fa2002-02-26 21:46:54 +000051
Chris Lattner3cab9f02002-09-25 23:47:47 +000052 RegisterOpt<LowerAllocations>
53 X("lowerallocs", "Lower allocations from instructions to calls");
Chris Lattner77f791d2002-05-07 19:02:48 +000054}
Chris Lattner04805fa2002-02-26 21:46:54 +000055
Chris Lattner77f791d2002-05-07 19:02:48 +000056// createLowerAllocationsPass - Interface to this file...
Brian Gaeke8c14ba92003-08-14 06:09:32 +000057FunctionPass *createLowerAllocationsPass() {
Chris Lattner3cab9f02002-09-25 23:47:47 +000058 return new LowerAllocations();
Chris Lattner77f791d2002-05-07 19:02:48 +000059}
Chris Lattner37104aa2002-04-29 14:57:45 +000060
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000061
Chris Lattner0686e432002-01-21 07:31:50 +000062// doInitialization - For the lower allocations pass, this ensures that a
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000063// module contains a declaration for a malloc and a free function.
64//
65// This function is always successful.
66//
Chris Lattner113f4f42002-06-25 16:13:24 +000067bool LowerAllocations::doInitialization(Module &M) {
Chris Lattner28873282003-08-31 00:22:27 +000068 const Type *SBPTy = PointerType::get(Type::SByteTy);
69 MallocFunc = M.getOrInsertFunction("malloc", SBPTy, Type::UIntTy, 0);
70 FreeFunc = M.getOrInsertFunction("free" , Type::VoidTy, SBPTy, 0);
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000071
Chris Lattner77f791d2002-05-07 19:02:48 +000072 return true;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000073}
74
Chris Lattnerd07471d2002-01-21 23:34:02 +000075// runOnBasicBlock - This method does the actual work of converting
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000076// instructions over, assuming that the pass has already been initialized.
77//
Chris Lattner113f4f42002-06-25 16:13:24 +000078bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {
Chris Lattner6fea0322001-10-18 05:27:33 +000079 bool Changed = false;
Chris Lattner113f4f42002-06-25 16:13:24 +000080 assert(MallocFunc && FreeFunc && "Pass not initialized!");
81
82 BasicBlock::InstListType &BBIL = BB.getInstList();
Chris Lattner3cab9f02002-09-25 23:47:47 +000083 TargetData &DataLayout = getAnalysis<TargetData>();
Chris Lattner1bb5f8e2001-10-15 17:31:51 +000084
85 // Loop over all of the instructions, looking for malloc or free instructions
Chris Lattner113f4f42002-06-25 16:13:24 +000086 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) {
Chris Lattner889f6202003-04-23 16:37:45 +000087 if (MallocInst *MI = dyn_cast<MallocInst>(I)) {
Chris Lattner113f4f42002-06-25 16:13:24 +000088 const Type *AllocTy = MI->getType()->getElementType();
Chris Lattnerd07471d2002-01-21 23:34:02 +000089
90 // Get the number of bytes to be allocated for one element of the
91 // requested type...
92 unsigned Size = DataLayout.getTypeSize(AllocTy);
93
94 // malloc(type) becomes sbyte *malloc(constint)
95 Value *MallocArg = ConstantUInt::get(Type::UIntTy, Size);
96 if (MI->getNumOperands() && Size == 1) {
97 MallocArg = MI->getOperand(0); // Operand * 1 = Operand
98 } else if (MI->getNumOperands()) {
Misha Brukman7eb05a12003-08-18 14:43:39 +000099 // Multiply it by the array size if necessary...
Chris Lattnera239e682002-09-10 22:38:47 +0000100 MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),
101 MallocArg, "", I);
Chris Lattner1bb5f8e2001-10-15 17:31:51 +0000102 }
Chris Lattnerd07471d2002-01-21 23:34:02 +0000103
104 // Create the call to Malloc...
Chris Lattner57698e22002-03-26 18:01:55 +0000105 CallInst *MCall = new CallInst(MallocFunc,
Chris Lattner1f45f4e2003-04-23 16:18:14 +0000106 std::vector<Value*>(1, MallocArg), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000107
108 // Create a cast instruction to convert to the right type...
Chris Lattnera239e682002-09-10 22:38:47 +0000109 CastInst *MCast = new CastInst(MCall, MI->getType(), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000110
111 // Replace all uses of the old malloc inst with the cast inst
112 MI->replaceAllUsesWith(MCast);
Chris Lattnera239e682002-09-10 22:38:47 +0000113 I = --BBIL.erase(I); // remove and delete the malloc instr...
Chris Lattnerd07471d2002-01-21 23:34:02 +0000114 Changed = true;
Chris Lattner0b18c1d2002-05-10 15:38:35 +0000115 ++NumLowered;
Chris Lattner889f6202003-04-23 16:37:45 +0000116 } else if (FreeInst *FI = dyn_cast<FreeInst>(I)) {
Chris Lattnerd07471d2002-01-21 23:34:02 +0000117 // Cast the argument to free into a ubyte*...
118 CastInst *MCast = new CastInst(FI->getOperand(0),
Chris Lattner652e7bf2003-05-15 18:25:13 +0000119 PointerType::get(Type::SByteTy), "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000120
121 // Insert a call to the free function...
Chris Lattner1f45f4e2003-04-23 16:18:14 +0000122 CallInst *FCall = new CallInst(FreeFunc, std::vector<Value*>(1, MCast),
123 "", I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000124
125 // Delete the old free instruction
Chris Lattnera239e682002-09-10 22:38:47 +0000126 I = --BBIL.erase(I);
Chris Lattnerd07471d2002-01-21 23:34:02 +0000127 Changed = true;
Chris Lattner0b18c1d2002-05-10 15:38:35 +0000128 ++NumLowered;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +0000129 }
130 }
131
Chris Lattner6fea0322001-10-18 05:27:33 +0000132 return Changed;
Chris Lattner1bb5f8e2001-10-15 17:31:51 +0000133}