| //===-- PASimple.cpp - Simple Pool Allocation Pass ------------------------===// |
| // |
| // The LLVM Compiler Infrastructure |
| // |
| // This file was developed by the LLVM research group and is distributed under |
| // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| // |
| // A minimal poolallocator that assignes all allocation to one common |
| // global pool. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| #define DEBUG_TYPE "poolalloc" |
| |
| #include "dsa/DataStructure.h" |
| #include "dsa/DSGraph.h" |
| #include "dsa/CallTargets.h" |
| #include "poolalloc/PoolAllocate.h" |
| #include "llvm/IR/Constants.h" |
| #include "llvm/IR/DataLayout.h" |
| #include "llvm/IR/DerivedTypes.h" |
| #include "llvm/IR/Instructions.h" |
| #include "llvm/IR/Module.h" |
| #include "llvm/IR/CFG.h" |
| #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
| #include "llvm/Transforms/Utils/Cloning.h" |
| #include "llvm/ADT/DepthFirstIterator.h" |
| #include "llvm/ADT/Statistic.h" |
| #include "llvm/ADT/STLExtras.h" |
| #include "llvm/Support/CommandLine.h" |
| #include "llvm/Support/Debug.h" |
| #include "llvm/Support/Timer.h" |
| |
| #include <iostream> |
| |
| using namespace llvm; |
| using namespace PA; |
| |
| char llvm::PoolAllocateSimple::ID = 0; |
| |
| namespace { |
| RegisterPass<PoolAllocateSimple> |
| X("poolalloc-simple", "Pool allocate everything into a single global pool"); |
| |
| RegisterAnalysisGroup<PoolAllocateGroup, true> PAGroup1(X); |
| } |
| |
| static inline Value * |
| castTo (Value * V, Type * Ty, std::string Name, Instruction * InsertPt) { |
| // |
| // Don't bother creating a cast if it's already the correct type. |
| // |
| if (V->getType() == Ty) |
| return V; |
| |
| // |
| // If it's a constant, just create a constant expression. |
| // |
| if (Constant * C = dyn_cast<Constant>(V)) { |
| Constant * CE = ConstantExpr::getZExtOrBitCast (C, Ty); |
| return CE; |
| } |
| |
| // |
| // Otherwise, insert a cast instruction. |
| // |
| return CastInst::CreateZExtOrBitCast (V, Ty, Name, InsertPt); |
| } |
| |
| void PoolAllocateSimple::getAnalysisUsage(AnalysisUsage &AU) const { |
| AU.addRequired<DataLayoutPass>(); |
| // Get the Target Data information and the Graphs |
| if (CompleteDSA) { |
| AU.addRequiredTransitive<EQTDDataStructures>(); |
| AU.addPreserved<EQTDDataStructures>(); |
| } else { |
| AU.addRequiredTransitive<BasicDataStructures>(); |
| AU.addPreserved<BasicDataStructures>(); |
| } |
| |
| AU.setPreservesAll(); |
| } |
| |
| // |
| // Function: FoldNodesInDSGraph() |
| // |
| // Description: |
| // This function will take the specified DSGraph and fold all DSNodes within |
| // it that are marked with the heap flag. |
| // |
| static void |
| FoldNodesInDSGraph (DSGraph & Graph) { |
| // Worklist of heap nodes to process |
| std::vector<DSNodeHandle> HeapNodes; |
| |
| // |
| // Go find all of the heap nodes. |
| // |
| DSGraph::node_iterator i; |
| DSGraph::node_iterator e = Graph.node_end(); |
| for (i = Graph.node_begin(); i != e; ++i) { |
| DSNode * Node = i; |
| if (Node->isHeapNode()) |
| HeapNodes.push_back (DSNodeHandle(Node)); |
| } |
| |
| // |
| // Fold all of the heap nodes; this makes them type-unknown. |
| // |
| for (unsigned i = 0; i < HeapNodes.size(); ++i) |
| HeapNodes[i].getNode()->foldNodeCompletely(); |
| return; |
| } |
| |
| bool PoolAllocateSimple::runOnModule(Module &M) { |
| if (M.begin() == M.end()) return false; |
| |
| // |
| // Get pointers to 8 and 32 bit LLVM integer types. |
| // |
| VoidType = Type::getVoidTy(M.getContext()); |
| Int8Type = IntegerType::getInt8Ty(M.getContext()); |
| Int32Type = IntegerType::getInt32Ty(M.getContext()); |
| |
| // Get the Target Data information and the Graphs |
| if (CompleteDSA) { |
| Graphs = &getAnalysis<EQTDDataStructures>(); |
| } else { |
| Graphs = &getAnalysis<BasicDataStructures>(); |
| } |
| assert (Graphs && "No DSA pass available!\n"); |
| const DataLayout & TD = getAnalysis<DataLayoutPass>().getDataLayout(); |
| |
| // Add the pool* prototypes to the module |
| AddPoolPrototypes(&M); |
| |
| // |
| // Create a single DSGraph which contains all of the information found in all |
| // the DSGraphs we got from DSA. We do this because we're going to start |
| // making modifications to the points-to results. |
| // |
| GlobalECs = Graphs->getGlobalECs(); |
| CombinedDSGraph = new DSGraph (GlobalECs, |
| TD, |
| Graphs->getTypeSS(), |
| Graphs->getGlobalsGraph()); |
| for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) { |
| if (Graphs->hasDSGraph (*I)) |
| CombinedDSGraph->cloneInto (Graphs->getDSGraph(*I)); |
| } |
| |
| // |
| // Now fold all of the heap nodes in our DSGraph (i.e., make them |
| // type-unknown). We do this because heap nodes may change type if we |
| // consider the effects of dangling pointers. |
| // |
| FoldNodesInDSGraph (*CombinedDSGraph); |
| FoldNodesInDSGraph (*(CombinedDSGraph->getGlobalsGraph())); |
| |
| // |
| // Create the global pool. |
| // |
| TheGlobalPool = CreateGlobalPool(1, 1, M); |
| |
| // |
| // Now that all call targets are available, rewrite the function bodies of |
| // the clones. |
| // |
| for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) { |
| // |
| // Skip functions that this pass added. |
| // |
| std::string name = I->getName(); |
| if (name == "__poolalloc_init") continue; |
| if (name == PoolInit->getName().str()) continue; |
| |
| // |
| // Skip declarations. |
| // |
| if (!(I->isDeclaration())) |
| ProcessFunctionBodySimple(*I, TD); |
| } |
| |
| return true; |
| } |
| |
| void |
| PoolAllocateSimple::ProcessFunctionBodySimple (Function& F, const DataLayout & TD) { |
| // Set of instructions to delete because they have been replaced. We record |
| // all instructions to delete first and then delete them later to avoid |
| // invalidating the iterators over the instruction list. |
| std::vector<Instruction*> toDelete; |
| |
| // |
| // Create a silly Function Info structure for this function. |
| // |
| FuncInfo FInfo(F); |
| FunctionInfo.insert (std::make_pair(&F, FInfo)); |
| |
| // |
| // Scan through all instructions in the function and modify call sites as |
| // necessary. |
| // |
| for (Function::iterator i = F.begin(), e = F.end(); i != e; ++i) { |
| for (BasicBlock::iterator ii = i->begin(), ee = i->end(); ii != ee; ++ii) { |
| if (CallInst * CI = dyn_cast<CallInst>(ii)) { |
| // |
| // Get the name of the called function. |
| // |
| CallSite CS(CI); |
| Function *CF = CS.getCalledFunction(); |
| if (ConstantExpr *CE = dyn_cast<ConstantExpr>(CS.getCalledValue())) { |
| if (CE->getOpcode() == Instruction::BitCast && |
| isa<Function>(CE->getOperand(0))) { |
| CF = cast<Function>(CE->getOperand(0)); |
| } |
| } |
| |
| // |
| // Process functions that we recognize as allocators. |
| // |
| if (CF && (CF->isDeclaration()) && (CF->getName() == "malloc")) { |
| // Associate the global pool decriptor with the DSNode |
| DSNode * Node = CombinedDSGraph->getNodeForValue(CI).getNode(); |
| FInfo.PoolDescriptors.insert(std::make_pair(Node,TheGlobalPool)); |
| |
| // Mark the call to malloc as an instruction to delete |
| toDelete.push_back(CI); |
| |
| // Insertion point - Instruction before which all our instructions go |
| Instruction *InsertPt = CI; |
| Value *Size = CS.getArgument(0); |
| |
| // Ensure the size and pointer arguments are of the correct type |
| if (Size->getType() != Int32Type) |
| Size = CastInst::CreateIntegerCast (Size, |
| Int32Type, |
| false, |
| Size->getName(), |
| InsertPt); |
| |
| // |
| // Remember the name of the old instruction and then clear it. This |
| // allows us to give the name to the new call to poolalloc(). |
| // |
| std::string Name = CI->getName(); CI->setName(""); |
| |
| // |
| // Insert the call to poolalloc() |
| // |
| Value* Opts[2] = {TheGlobalPool, Size}; |
| Instruction *V = CallInst::Create (PoolAlloc, |
| Opts, |
| Name, |
| InsertPt); |
| |
| // |
| // Update the DSGraph. |
| // |
| CombinedDSGraph->getScalarMap().replaceScalar (CI, V); |
| |
| Instruction *Casted = V; |
| if (V->getType() != CI->getType()) |
| Casted = CastInst::CreatePointerCast (V, CI->getType(), V->getName(), InsertPt); |
| |
| // Update def-use info |
| CI->replaceAllUsesWith(Casted); |
| } else if (CF && (CF->isDeclaration()) && (CF->getName() == "memalign")) { |
| DSNode * Node = CombinedDSGraph->getNodeForValue(CI).getNode(); |
| FInfo.PoolDescriptors.insert(std::make_pair(Node,TheGlobalPool)); |
| |
| // Mark the call to memalign as an instruction to delete |
| toDelete.push_back(CI); |
| |
| // Insertion point - Instruction before which all our instructions go |
| Instruction *InsertPt = CI; |
| Value *Size = CS.getArgument(0); |
| Value *Align = CS.getArgument(1); |
| |
| // Ensure the size and pointer arguments are of the correct type |
| if (Size->getType() != Int32Type) |
| Size = CastInst::CreateIntegerCast (Size, |
| Int32Type, |
| false, |
| Size->getName(), |
| InsertPt); |
| if (Align->getType() != Int32Type) |
| Align = CastInst::CreateIntegerCast (Align, |
| Int32Type, |
| false, |
| Align->getName(), |
| InsertPt); |
| // |
| // Remember the name of the old instruction and then clear it. This |
| // allows us to give the name to the new call to poolmemalign(). |
| // |
| std::string Name = CI->getName(); CI->setName(""); |
| |
| // |
| // Insert the call to poolalloc() |
| // |
| Value* Opts[3] = {TheGlobalPool, Align, Size}; |
| Instruction *V = CallInst::Create (PoolMemAlign, |
| Opts, |
| Name, |
| InsertPt); |
| |
| // |
| // Update the DSGraph. |
| // |
| CombinedDSGraph->getScalarMap().replaceScalar (CI, V); |
| |
| Instruction *Casted = V; |
| if (V->getType() != CI->getType()) |
| Casted = CastInst::CreatePointerCast (V, CI->getType(), V->getName(), InsertPt); |
| |
| // Update def-use info |
| CI->replaceAllUsesWith(Casted); |
| } else if (CF && (CF->isDeclaration()) && (CF->getName() == "realloc")) { |
| // Associate the global pool decriptor with the DSNode |
| DSNode * Node = CombinedDSGraph->getNodeForValue(CI).getNode(); |
| FInfo.PoolDescriptors.insert(std::make_pair(Node,TheGlobalPool)); |
| |
| // Mark the realloc as an instruction to delete |
| toDelete.push_back(ii); |
| |
| // Insertion point - Instruction before which all our instructions go |
| Instruction *InsertPt = CI; |
| Value *OldPtr = CS.getArgument(0); |
| Value *Size = CS.getArgument(1); |
| |
| // Ensure the size and pointer arguments are of the correct type |
| if (Size->getType() != Int32Type) |
| Size = CastInst::CreateIntegerCast (Size, |
| Int32Type, |
| false, |
| Size->getName(), |
| InsertPt); |
| |
| static Type *VoidPtrTy = PointerType::getUnqual(Int8Type); |
| if (OldPtr->getType() != VoidPtrTy) |
| OldPtr = CastInst::CreatePointerCast (OldPtr, |
| VoidPtrTy, |
| OldPtr->getName(), |
| InsertPt); |
| |
| std::string Name = CI->getName(); CI->setName(""); |
| Value* Opts[3] = {TheGlobalPool, OldPtr, Size}; |
| Instruction *V = CallInst::Create (PoolRealloc, |
| Opts, |
| Name, |
| InsertPt); |
| // |
| // Update the DSGraph. |
| // |
| CombinedDSGraph->getScalarMap().replaceScalar (CI, V); |
| |
| Instruction *Casted = V; |
| if (V->getType() != CI->getType()) |
| Casted = CastInst::CreatePointerCast (V, CI->getType(), V->getName(), InsertPt); |
| |
| // Update def-use info |
| CI->replaceAllUsesWith(Casted); |
| } else if (CF && (CF->isDeclaration()) && (CF->getName() == "calloc")) { |
| // Associate the global pool decriptor with the DSNode |
| DSNode * Node = CombinedDSGraph->getNodeForValue(CI).getNode(); |
| FInfo.PoolDescriptors.insert(std::make_pair(Node,TheGlobalPool)); |
| |
| // Mark the realloc as an instruction to delete |
| toDelete.push_back(ii); |
| |
| // Insertion point - Instruction before which all our instructions go |
| Instruction *InsertPt = CI; |
| Value *NumElements = CS.getArgument(0); |
| Value *Size = CS.getArgument(1); |
| |
| // Ensure the size and pointer arguments are of the correct type |
| if (Size->getType() != Int32Type) |
| Size = CastInst::CreateIntegerCast (Size, |
| Int32Type, |
| false, |
| Size->getName(), |
| InsertPt); |
| |
| if (NumElements->getType() != Int32Type) |
| NumElements = CastInst::CreateIntegerCast (NumElements, |
| Int32Type, |
| false, |
| NumElements->getName(), |
| InsertPt); |
| |
| std::string Name = CI->getName(); CI->setName(""); |
| Value* Opts[3] = {TheGlobalPool, NumElements, Size}; |
| Instruction *V = CallInst::Create (PoolCalloc, |
| Opts, |
| Name, |
| InsertPt); |
| |
| // |
| // Update the DSGraph. |
| // |
| CombinedDSGraph->getScalarMap().replaceScalar (CI, V); |
| |
| Instruction *Casted = V; |
| if (V->getType() != CI->getType()) |
| Casted = CastInst::CreatePointerCast (V, CI->getType(), V->getName(), InsertPt); |
| |
| // Update def-use info |
| CI->replaceAllUsesWith(Casted); |
| } else if (CF && (CF->isDeclaration()) && (CF->getName() == "strdup")) { |
| // Associate the global pool decriptor with the DSNode |
| DSNode * Node = CombinedDSGraph->getNodeForValue(CI).getNode(); |
| FInfo.PoolDescriptors.insert(std::make_pair(Node,TheGlobalPool)); |
| |
| // Mark the realloc as an instruction to delete |
| toDelete.push_back(ii); |
| |
| // Insertion point - Instruction before which all our instructions go |
| Instruction *InsertPt = CI; |
| Value *OldPtr = CS.getArgument(0); |
| |
| // Ensure the size and pointer arguments are of the correct type |
| static Type *VoidPtrTy = PointerType::getUnqual(Int8Type); |
| if (OldPtr->getType() != VoidPtrTy) |
| OldPtr = CastInst::CreatePointerCast (OldPtr, |
| VoidPtrTy, |
| OldPtr->getName(), |
| InsertPt); |
| |
| std::string Name = CI->getName(); CI->setName(""); |
| Value* Opts[2] = {TheGlobalPool, OldPtr}; |
| Instruction *V = CallInst::Create (PoolStrdup, |
| Opts, |
| Name, |
| InsertPt); |
| |
| // |
| // Update the DSGraph. |
| // |
| CombinedDSGraph->getScalarMap().replaceScalar (CI, V); |
| |
| Instruction *Casted = V; |
| if (V->getType() != CI->getType()) |
| Casted = CastInst::CreatePointerCast (V, CI->getType(), V->getName(), InsertPt); |
| |
| // Update def-use info |
| CI->replaceAllUsesWith(Casted); |
| } else if (CF && (CF->isDeclaration()) && ((CF->getName() == "free") || (CF->getName() == "cfree"))) { |
| Type * VoidPtrTy = PointerType::getUnqual(Int8Type); |
| Value * FreedNode = castTo (CI->getOperand(0), VoidPtrTy, "cast", ii); |
| toDelete.push_back(ii); |
| Value* args[] = {TheGlobalPool, FreedNode}; |
| CallInst::Create(PoolFree, args, "", ii); |
| } |
| |
| // |
| // Transform SAFECode run-time checks. For these calls, all we need to |
| // do is to replace the initial pool arguments with pointers to the global |
| // pool. |
| // |
| if (CF) { |
| unsigned Count = getNumInitialPoolArguments(CF->getName()); |
| Type * VoidPtrTy = PointerType::getUnqual(Int8Type); |
| Value * Pool = castTo (TheGlobalPool, VoidPtrTy, "pool", ii); |
| for (unsigned ArgIndex = 0; ArgIndex < Count; ArgIndex++ ) |
| CI->setArgOperand (ArgIndex, Pool); |
| } |
| } |
| } |
| } |
| |
| // |
| // Delete all instructions that were previously scheduled for deletion. |
| // |
| for (unsigned x = 0; x < toDelete.size(); ++x) |
| toDelete[x]->eraseFromParent(); |
| } |
| |
| /// CreateGlobalPool - Create a global pool descriptor object, and insert a |
| /// poolinit for it into the global constructor. |
| GlobalVariable * |
| PoolAllocateSimple::CreateGlobalPool (unsigned RecSize, |
| unsigned Align, |
| Module& M) { |
| // |
| // See if the global pool has already been created. If so, then just return |
| // it. |
| // |
| if (GlobalVariable * GV = M.getNamedGlobal ("__poolalloc_GlobalPool")) { |
| return GV; |
| } |
| |
| // |
| // Create the global pool descriptor. |
| // |
| GlobalVariable *GV = |
| new GlobalVariable(M, |
| getPoolType(&M.getContext()), false, GlobalValue::ExternalLinkage, |
| ConstantAggregateZero::get(getPoolType(&M.getContext())), |
| "__poolalloc_GlobalPool" |
| ); |
| |
| // |
| // Get the global pool constructor. Create and insert the poolinit call |
| // inside it. |
| // |
| Function *InitFunc = createGlobalPoolCtor(M); |
| Value *ElSize = ConstantInt::get(Int32Type, RecSize); |
| Value *AlignV = ConstantInt::get(Int32Type, Align); |
| Value *Opts[3] = { GV, ElSize, AlignV }; |
| |
| CallInst *InitCall = CallInst::Create(PoolInit, Opts, ""); |
| InitCall->insertBefore(&InitFunc->getEntryBlock().front()); |
| |
| return GV; |
| } |
