blob: 8c6550003dd72b0dbe78a4c0ca89148bc83349a2 [file] [log] [blame]
Chris Lattnerade686e2002-05-07 19:02:48 +00001//===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===//
Chris Lattner1bffea02001-10-15 17:31:51 +00002//
Chris Lattnerade686e2002-05-07 19:02:48 +00003// The LowerAllocations transformation is a target dependant tranformation
4// because it depends on the size of data types and alignment constraints.
Chris Lattner1bffea02001-10-15 17:31:51 +00005//
6//===----------------------------------------------------------------------===//
7
Chris Lattnere9ee3e52002-07-23 22:04:17 +00008#include "llvm/Transforms/Scalar.h"
Chris Lattner793c6b82002-01-31 00:45:11 +00009#include "llvm/Module.h"
Chris Lattner1bffea02001-10-15 17:31:51 +000010#include "llvm/DerivedTypes.h"
11#include "llvm/iMemory.h"
12#include "llvm/iOther.h"
Chris Lattner497c60c2002-05-07 18:12:18 +000013#include "llvm/Constants.h"
Chris Lattnerbd0ef772002-02-26 21:46:54 +000014#include "llvm/Pass.h"
Chris Lattner497c60c2002-05-07 18:12:18 +000015#include "llvm/Target/TargetData.h"
Chris Lattnera92f6962002-10-01 22:38:41 +000016#include "Support/Statistic.h"
Chris Lattner3dec1f22002-05-10 15:38:35 +000017
Chris Lattner697954c2002-01-20 22:54:45 +000018using std::vector;
19
Chris Lattnerbd0ef772002-02-26 21:46:54 +000020namespace {
Chris Lattnera92f6962002-10-01 22:38:41 +000021 Statistic<> NumLowered("lowerallocs", "Number of allocations lowered");
Chris Lattnerbd0ef772002-02-26 21:46:54 +000022
Chris Lattner3b2106f2002-09-25 23:47:47 +000023 /// LowerAllocations - Turn malloc and free instructions into %malloc and
24 /// %free calls.
25 ///
26 class LowerAllocations : public BasicBlockPass {
27 Function *MallocFunc; // Functions in the module we are processing
28 Function *FreeFunc; // Initialized by doInitialization
29 public:
30 LowerAllocations() : MallocFunc(0), FreeFunc(0) {}
Chris Lattnerbd0ef772002-02-26 21:46:54 +000031
Chris Lattner3b2106f2002-09-25 23:47:47 +000032 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
33 AU.addRequired<TargetData>();
34 }
Chris Lattnerbd0ef772002-02-26 21:46:54 +000035
Chris Lattner3b2106f2002-09-25 23:47:47 +000036 /// doPassInitialization - For the lower allocations pass, this ensures that
37 /// a module contains a declaration for a malloc and a free function.
38 ///
39 bool doInitialization(Module &M);
40
41 /// runOnBasicBlock - This method does the actual work of converting
42 /// instructions over, assuming that the pass has already been initialized.
43 ///
44 bool runOnBasicBlock(BasicBlock &BB);
45 };
Chris Lattnerbd0ef772002-02-26 21:46:54 +000046
Chris Lattner3b2106f2002-09-25 23:47:47 +000047 RegisterOpt<LowerAllocations>
48 X("lowerallocs", "Lower allocations from instructions to calls");
Chris Lattnerade686e2002-05-07 19:02:48 +000049}
Chris Lattnerbd0ef772002-02-26 21:46:54 +000050
Chris Lattnerade686e2002-05-07 19:02:48 +000051// createLowerAllocationsPass - Interface to this file...
Chris Lattner3b2106f2002-09-25 23:47:47 +000052Pass *createLowerAllocationsPass() {
53 return new LowerAllocations();
Chris Lattnerade686e2002-05-07 19:02:48 +000054}
Chris Lattner96c466b2002-04-29 14:57:45 +000055
Chris Lattner1bffea02001-10-15 17:31:51 +000056
Chris Lattnerf4de63f2002-01-21 07:31:50 +000057// doInitialization - For the lower allocations pass, this ensures that a
Chris Lattner1bffea02001-10-15 17:31:51 +000058// module contains a declaration for a malloc and a free function.
59//
60// This function is always successful.
61//
Chris Lattner7e708292002-06-25 16:13:24 +000062bool LowerAllocations::doInitialization(Module &M) {
Chris Lattnerbe591a72002-03-29 03:38:05 +000063 const FunctionType *MallocType =
64 FunctionType::get(PointerType::get(Type::SByteTy),
65 vector<const Type*>(1, Type::UIntTy), false);
66 const FunctionType *FreeType =
67 FunctionType::get(Type::VoidTy,
68 vector<const Type*>(1, PointerType::get(Type::SByteTy)),
69 false);
Chris Lattner1bffea02001-10-15 17:31:51 +000070
Chris Lattner7e708292002-06-25 16:13:24 +000071 MallocFunc = M.getOrInsertFunction("malloc", MallocType);
72 FreeFunc = M.getOrInsertFunction("free" , FreeType);
Chris Lattner1bffea02001-10-15 17:31:51 +000073
Chris Lattnerade686e2002-05-07 19:02:48 +000074 return true;
Chris Lattner1bffea02001-10-15 17:31:51 +000075}
76
Chris Lattner84453722002-01-21 23:34:02 +000077// runOnBasicBlock - This method does the actual work of converting
Chris Lattner1bffea02001-10-15 17:31:51 +000078// instructions over, assuming that the pass has already been initialized.
79//
Chris Lattner7e708292002-06-25 16:13:24 +000080bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {
Chris Lattner42c9c2c2001-10-18 05:27:33 +000081 bool Changed = false;
Chris Lattner7e708292002-06-25 16:13:24 +000082 assert(MallocFunc && FreeFunc && "Pass not initialized!");
83
84 BasicBlock::InstListType &BBIL = BB.getInstList();
Chris Lattner3b2106f2002-09-25 23:47:47 +000085 TargetData &DataLayout = getAnalysis<TargetData>();
Chris Lattner1bffea02001-10-15 17:31:51 +000086
87 // Loop over all of the instructions, looking for malloc or free instructions
Chris Lattner7e708292002-06-25 16:13:24 +000088 for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) {
89 if (MallocInst *MI = dyn_cast<MallocInst>(&*I)) {
Chris Lattner7e708292002-06-25 16:13:24 +000090 const Type *AllocTy = MI->getType()->getElementType();
Chris Lattner84453722002-01-21 23:34:02 +000091
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()) {
101 // Multiply it by the array size if neccesary...
Chris Lattner1d608ab2002-09-10 22:38:47 +0000102 MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),
103 MallocArg, "", I);
Chris Lattner1bffea02001-10-15 17:31:51 +0000104 }
Chris Lattner84453722002-01-21 23:34:02 +0000105
106 // Create the call to Malloc...
Chris Lattner79df7c02002-03-26 18:01:55 +0000107 CallInst *MCall = new CallInst(MallocFunc,
Chris Lattner1d608ab2002-09-10 22:38:47 +0000108 vector<Value*>(1, MallocArg), "", I);
Chris Lattner84453722002-01-21 23:34:02 +0000109
110 // Create a cast instruction to convert to the right type...
Chris Lattner1d608ab2002-09-10 22:38:47 +0000111 CastInst *MCast = new CastInst(MCall, MI->getType(), "", I);
Chris Lattner84453722002-01-21 23:34:02 +0000112
113 // Replace all uses of the old malloc inst with the cast inst
114 MI->replaceAllUsesWith(MCast);
Chris Lattner1d608ab2002-09-10 22:38:47 +0000115 I = --BBIL.erase(I); // remove and delete the malloc instr...
Chris Lattner84453722002-01-21 23:34:02 +0000116 Changed = true;
Chris Lattner3dec1f22002-05-10 15:38:35 +0000117 ++NumLowered;
Chris Lattner7e708292002-06-25 16:13:24 +0000118 } else if (FreeInst *FI = dyn_cast<FreeInst>(&*I)) {
Chris Lattner84453722002-01-21 23:34:02 +0000119 // Cast the argument to free into a ubyte*...
120 CastInst *MCast = new CastInst(FI->getOperand(0),
Chris Lattner1d608ab2002-09-10 22:38:47 +0000121 PointerType::get(Type::UByteTy), "", I);
Chris Lattner84453722002-01-21 23:34:02 +0000122
123 // Insert a call to the free function...
Chris Lattner1d608ab2002-09-10 22:38:47 +0000124 CallInst *FCall = new CallInst(FreeFunc, vector<Value*>(1, MCast), "", I);
Chris Lattner84453722002-01-21 23:34:02 +0000125
126 // Delete the old free instruction
Chris Lattner1d608ab2002-09-10 22:38:47 +0000127 I = --BBIL.erase(I);
Chris Lattner84453722002-01-21 23:34:02 +0000128 Changed = true;
Chris Lattner3dec1f22002-05-10 15:38:35 +0000129 ++NumLowered;
Chris Lattner1bffea02001-10-15 17:31:51 +0000130 }
131 }
132
Chris Lattner42c9c2c2001-10-18 05:27:33 +0000133 return Changed;
Chris Lattner1bffea02001-10-15 17:31:51 +0000134}