1 //===-- PoolAllocate.cpp - Pool Allocation Pass ---------------------------===//
3 // This transform changes programs so that disjoint data structures are
4 // allocated out of different pools of memory, increasing locality and shrinking
7 //===----------------------------------------------------------------------===//
9 #include "llvm/Transforms/IPO/PoolAllocate.h"
10 #include "llvm/Transforms/CloneFunction.h"
11 #include "llvm/Analysis/DataStructure.h"
12 #include "llvm/Analysis/DataStructureGraph.h"
13 #include "llvm/Pass.h"
14 #include "llvm/Module.h"
15 #include "llvm/Function.h"
16 #include "llvm/BasicBlock.h"
17 #include "llvm/iMemory.h"
18 #include "llvm/iTerminators.h"
19 #include "llvm/iPHINode.h"
20 #include "llvm/iOther.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/ConstantVals.h"
23 #include "llvm/Target/TargetData.h"
24 #include "llvm/Support/InstVisitor.h"
25 #include "llvm/Argument.h"
26 #include "Support/DepthFirstIterator.h"
27 #include "Support/STLExtras.h"
30 // DEBUG_CREATE_POOLS - Enable this to turn on debug output for the pool
31 // creation phase in the top level function of a transformed data structure.
33 #define DEBUG_CREATE_POOLS 1
35 const Type *POINTERTYPE;
37 // FIXME: This is dependant on the sparc backend layout conventions!!
38 static TargetData TargetData("test");
42 DSNode *Node; // The node this pool allocation represents
43 Value *Handle; // LLVM value of the pool in the current context
44 const Type *NewType; // The transformed type of the memory objects
45 const Type *PoolType; // The type of the pool
47 const Type *getOldType() const { return Node->getType(); }
49 PoolInfo() { // Define a default ctor for map::operator[]
50 cerr << "Map subscript used to get element that doesn't exist!\n";
54 PoolInfo(DSNode *N, Value *H, const Type *NT, const Type *PT)
55 : Node(N), Handle(H), NewType(NT), PoolType(PT) {
56 // Handle can be null...
57 assert(N && NT && PT && "Pool info null!");
60 PoolInfo(DSNode *N) : Node(N), Handle(0), NewType(0), PoolType(0) {
61 assert(N && "Invalid pool info!");
63 // The new type of the memory object is the same as the old type, except
64 // that all of the pointer values are replaced with POINTERTYPE values.
65 assert(isa<StructType>(getOldType()) && "Can only handle structs!");
66 StructType *OldTy = cast<StructType>(getOldType());
67 vector<const Type *> NewElTypes;
68 NewElTypes.reserve(OldTy->getElementTypes().size());
69 for (StructType::ElementTypes::const_iterator
70 I = OldTy->getElementTypes().begin(),
71 E = OldTy->getElementTypes().end(); I != E; ++I)
72 if (PointerType *PT = dyn_cast<PointerType>(I->get()))
73 NewElTypes.push_back(POINTERTYPE);
75 NewElTypes.push_back(*I);
76 NewType = StructType::get(NewElTypes);
80 // ScalarInfo - Information about an LLVM value that we know points to some
81 // datastructure we are processing.
84 Value *Val; // Scalar value in Current Function
85 PoolInfo Pool; // The pool the scalar points into
87 ScalarInfo(Value *V, const PoolInfo &PI) : Val(V), Pool(PI) {
88 assert(V && "Null value passed to ScalarInfo ctor!");
92 // CallArgInfo - Information on one operand for a call that got expanded.
94 int ArgNo; // Call argument number this corresponds to
95 DSNode *Node; // The graph node for the pool
96 Value *PoolHandle; // The LLVM value that is the pool pointer
98 CallArgInfo(int Arg, DSNode *N, Value *PH)
99 : ArgNo(Arg), Node(N), PoolHandle(PH) {
100 assert(Arg >= -1 && N && PH && "Illegal values to CallArgInfo ctor!");
103 // operator< when sorting, sort by argument number.
104 bool operator<(const CallArgInfo &CAI) const {
105 return ArgNo < CAI.ArgNo;
109 // TransformFunctionInfo - Information about how a function eeds to be
112 struct TransformFunctionInfo {
113 // ArgInfo - Maintain information about the arguments that need to be
114 // processed. Each CallArgInfo corresponds to an argument that needs to
115 // have a pool pointer passed into the transformed function with it.
117 // As a special case, "argument" number -1 corresponds to the return value.
119 vector<CallArgInfo> ArgInfo;
121 // Func - The function to be transformed...
124 // The call instruction that is used to map CallArgInfo PoolHandle values
125 // into the new function values.
129 TransformFunctionInfo() : Func(0), Call(0) {}
131 bool operator<(const TransformFunctionInfo &TFI) const {
132 if (Func < TFI.Func) return true;
133 if (Func > TFI.Func) return false;
134 if (ArgInfo.size() < TFI.ArgInfo.size()) return true;
135 if (ArgInfo.size() > TFI.ArgInfo.size()) return false;
136 return ArgInfo < TFI.ArgInfo;
139 void finalizeConstruction() {
140 // Sort the vector so that the return value is first, followed by the
141 // argument records, in order. Note that this must be a stable sort so
142 // that the entries with the same sorting criteria (ie they are multiple
143 // pool entries for the same argument) are kept in depth first order.
144 stable_sort(ArgInfo.begin(), ArgInfo.end());
149 // Define the pass class that we implement...
150 struct PoolAllocate : public Pass {
152 POINTERTYPE = Type::UShortTy;
154 CurModule = 0; DS = 0;
155 PoolInit = PoolDestroy = PoolAlloc = PoolFree = 0;
158 // getPoolType - Get the type used by the backend for a pool of a particular
159 // type. This pool record is used to allocate nodes of type NodeType.
161 // Here, PoolTy = { NodeType*, sbyte*, uint }*
163 const StructType *getPoolType(const Type *NodeType) {
164 vector<const Type*> PoolElements;
165 PoolElements.push_back(PointerType::get(NodeType));
166 PoolElements.push_back(PointerType::get(Type::SByteTy));
167 PoolElements.push_back(Type::UIntTy);
168 return StructType::get(PoolElements);
173 // getAnalysisUsageInfo - This function requires data structure information
174 // to be able to see what is pool allocatable.
176 virtual void getAnalysisUsageInfo(Pass::AnalysisSet &Required,
177 Pass::AnalysisSet &,Pass::AnalysisSet &) {
178 Required.push_back(DataStructure::ID);
182 // CurModule - The module being processed.
185 // DS - The data structure graph for the module being processed.
188 // Prototypes that we add to support pool allocation...
189 Function *PoolInit, *PoolDestroy, *PoolAlloc, *PoolFree;
191 // The map of already transformed functions... note that the keys of this
192 // map do not have meaningful values for 'Call' or the 'PoolHandle' elements
193 // of the ArgInfo elements.
195 map<TransformFunctionInfo, Function*> TransformedFunctions;
197 // getTransformedFunction - Get a transformed function, or return null if
198 // the function specified hasn't been transformed yet.
200 Function *getTransformedFunction(TransformFunctionInfo &TFI) const {
201 map<TransformFunctionInfo, Function*>::const_iterator I =
202 TransformedFunctions.find(TFI);
203 if (I != TransformedFunctions.end()) return I->second;
208 // addPoolPrototypes - Add prototypes for the pool functions to the
209 // specified module and update the Pool* instance variables to point to
212 void addPoolPrototypes(Module *M);
215 // CreatePools - Insert instructions into the function we are processing to
216 // create all of the memory pool objects themselves. This also inserts
217 // destruction code. Add an alloca for each pool that is allocated to the
220 void CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
221 map<DSNode*, PoolInfo> &PoolDescs);
223 // processFunction - Convert a function to use pool allocation where
226 bool processFunction(Function *F);
228 // transformFunctionBody - This transforms the instruction in 'F' to use the
229 // pools specified in PoolDescs when modifying data structure nodes
230 // specified in the PoolDescs map. IPFGraph is the closed data structure
231 // graph for F, of which the PoolDescriptor nodes come from.
233 void transformFunctionBody(Function *F, FunctionDSGraph &IPFGraph,
234 map<DSNode*, PoolInfo> &PoolDescs);
236 // transformFunction - Transform the specified function the specified way.
237 // It we have already transformed that function that way, don't do anything.
238 // The nodes in the TransformFunctionInfo come out of callers data structure
239 // graph, and the PoolDescs passed in are the caller's.
241 void transformFunction(TransformFunctionInfo &TFI,
242 FunctionDSGraph &CallerIPGraph,
243 map<DSNode*, PoolInfo> &PoolDescs);
248 // isNotPoolableAlloc - This is a predicate that returns true if the specified
249 // allocation node in a data structure graph is eligable for pool allocation.
251 static bool isNotPoolableAlloc(const AllocDSNode *DS) {
252 if (DS->isAllocaNode()) return true; // Do not pool allocate alloca's.
254 MallocInst *MI = cast<MallocInst>(DS->getAllocation());
255 if (MI->isArrayAllocation() && !isa<Constant>(MI->getArraySize()))
256 return true; // Do not allow variable size allocations...
261 // processFunction - Convert a function to use pool allocation where
264 bool PoolAllocate::processFunction(Function *F) {
265 // Get the closed datastructure graph for the current function... if there are
266 // any allocations in this graph that are not escaping, we need to pool
267 // allocate them here!
269 FunctionDSGraph &IPGraph = DS->getClosedDSGraph(F);
271 // Get all of the allocations that do not escape the current function. Since
272 // they are still live (they exist in the graph at all), this means we must
273 // have scalar references to these nodes, but the scalars are never returned.
275 vector<AllocDSNode*> Allocs;
276 IPGraph.getNonEscapingAllocations(Allocs);
278 // Filter out allocations that we cannot handle. Currently, this includes
279 // variable sized array allocations and alloca's (which we do not want to
282 Allocs.erase(remove_if(Allocs.begin(), Allocs.end(), isNotPoolableAlloc),
286 if (Allocs.empty()) return false; // Nothing to do.
288 // Insert instructions into the function we are processing to create all of
289 // the memory pool objects themselves. This also inserts destruction code.
290 // This fills in the PoolDescs map to associate the alloc node with the
291 // allocation of the memory pool corresponding to it.
293 map<DSNode*, PoolInfo> PoolDescs;
294 CreatePools(F, Allocs, PoolDescs);
296 cerr << "Transformed Entry Function: \n" << F;
298 // Now we need to figure out what called functions we need to transform, and
299 // how. To do this, we look at all of the scalars, seeing which functions are
300 // either used as a scalar value (so they return a data structure), or are
301 // passed one of our scalar values.
303 transformFunctionBody(F, IPGraph, PoolDescs);
309 //===----------------------------------------------------------------------===//
311 // NewInstructionCreator - This class is used to traverse the function being
312 // modified, changing each instruction visit'ed to use and provide pointer
313 // indexes instead of real pointers. This is what changes the body of a
314 // function to use pool allocation.
316 class NewInstructionCreator : public InstVisitor<NewInstructionCreator> {
317 PoolAllocate &PoolAllocator;
318 vector<ScalarInfo> &Scalars;
319 map<CallInst*, TransformFunctionInfo> &CallMap;
320 map<Value*, Value*> &XFormMap; // Map old pointers to new indexes
323 Instruction *I; // Instruction to update
324 unsigned OpNum; // Operand number to update
325 Value *OldVal; // The old value it had
327 RefToUpdate(Instruction *i, unsigned o, Value *ov)
328 : I(i), OpNum(o), OldVal(ov) {}
330 vector<RefToUpdate> ReferencesToUpdate;
332 const ScalarInfo &getScalarRef(const Value *V) {
333 for (unsigned i = 0, e = Scalars.size(); i != e; ++i)
334 if (Scalars[i].Val == V) return Scalars[i];
335 assert(0 && "Scalar not found in getScalar!");
340 const ScalarInfo *getScalar(const Value *V) {
341 for (unsigned i = 0, e = Scalars.size(); i != e; ++i)
342 if (Scalars[i].Val == V) return &Scalars[i];
346 BasicBlock::iterator ReplaceInstWith(Instruction *I, Instruction *New) {
347 BasicBlock *BB = I->getParent();
348 BasicBlock::iterator RI = find(BB->begin(), BB->end(), I);
349 BB->getInstList().replaceWith(RI, New);
354 LoadInst *createPoolBaseInstruction(Value *PtrVal) {
355 const ScalarInfo &SC = getScalarRef(PtrVal);
356 vector<Value*> Args(3);
357 Args[0] = ConstantUInt::get(Type::UIntTy, 0); // No pointer offset
358 Args[1] = ConstantUInt::get(Type::UByteTy, 0); // Field #0 of pool descriptr
359 Args[2] = ConstantUInt::get(Type::UByteTy, 0); // Field #0 of poolalloc val
360 return new LoadInst(SC.Pool.Handle, Args, PtrVal->getName()+".poolbase");
365 NewInstructionCreator(PoolAllocate &PA, vector<ScalarInfo> &S,
366 map<CallInst*, TransformFunctionInfo> &C,
367 map<Value*, Value*> &X)
368 : PoolAllocator(PA), Scalars(S), CallMap(C), XFormMap(X) {}
371 // updateReferences - The NewInstructionCreator is responsible for creating
372 // new instructions to replace the old ones in the function, and then link up
373 // references to values to their new values. For it to do this, however, it
374 // keeps track of information about the value mapping of old values to new
375 // values that need to be patched up. Given this value map and a set of
376 // instruction operands to patch, updateReferences performs the updates.
378 void updateReferences() {
379 for (unsigned i = 0, e = ReferencesToUpdate.size(); i != e; ++i) {
380 RefToUpdate &Ref = ReferencesToUpdate[i];
381 Value *NewVal = XFormMap[Ref.OldVal];
384 if (isa<Constant>(Ref.OldVal) && // Refering to a null ptr?
385 cast<Constant>(Ref.OldVal)->isNullValue()) {
386 // Transform the null pointer into a null index... caching in XFormMap
387 XFormMap[Ref.OldVal] = NewVal =Constant::getNullConstant(POINTERTYPE);
388 //} else if (isa<Argument>(Ref.OldVal)) {
390 cerr << "Unknown reference to: " << Ref.OldVal << "\n";
391 assert(XFormMap[Ref.OldVal] &&
392 "Reference to value that was not updated found!");
396 Ref.I->setOperand(Ref.OpNum, NewVal);
398 ReferencesToUpdate.clear();
401 //===--------------------------------------------------------------------===//
402 // Transformation methods:
403 // These methods specify how each type of instruction is transformed by the
404 // NewInstructionCreator instance...
405 //===--------------------------------------------------------------------===//
407 void visitGetElementPtrInst(GetElementPtrInst *I) {
408 assert(0 && "Cannot transform get element ptr instructions yet!");
411 // Replace the load instruction with a new one.
412 void visitLoadInst(LoadInst *I) {
413 Instruction *PoolBase = createPoolBaseInstruction(I->getOperand(0));
415 // Cast our index to be a UIntTy so we can use it to index into the pool...
416 CastInst *Index = new CastInst(Constant::getNullConstant(POINTERTYPE),
417 Type::UIntTy, I->getOperand(0)->getName());
419 ReferencesToUpdate.push_back(RefToUpdate(Index, 0, I->getOperand(0)));
421 vector<Value*> Indices(I->idx_begin(), I->idx_end());
422 assert(Indices[0] == ConstantUInt::get(Type::UIntTy, 0) &&
423 "Cannot handle array indexing yet!");
425 Instruction *NewLoad = new LoadInst(PoolBase, Indices, I->getName());
427 // Replace the load instruction with the new load instruction...
428 BasicBlock::iterator II = ReplaceInstWith(I, NewLoad);
430 // Add the pool base calculator instruction before the load...
431 II = NewLoad->getParent()->getInstList().insert(II, PoolBase) + 1;
433 // Add the cast before the load instruction...
434 NewLoad->getParent()->getInstList().insert(II, Index);
436 // If not yielding a pool allocated pointer, use the new load value as the
437 // value in the program instead of the old load value...
440 I->replaceAllUsesWith(NewLoad);
443 // Replace the store instruction with a new one. In the store instruction,
444 // the value stored could be a pointer type, meaning that the new store may
445 // have to change one or both of it's operands.
447 void visitStoreInst(StoreInst *I) {
448 assert(getScalar(I->getOperand(1)) &&
449 "Store inst found only storing pool allocated pointer. "
452 Value *Val = I->getOperand(0); // The value to store...
453 // Check to see if the value we are storing is a data structure pointer...
454 if (const ScalarInfo *ValScalar = getScalar(I->getOperand(0)))
455 Val = Constant::getNullConstant(POINTERTYPE); // Yes, store a dummy
457 Instruction *PoolBase = createPoolBaseInstruction(I->getOperand(1));
459 // Cast our index to be a UIntTy so we can use it to index into the pool...
460 CastInst *Index = new CastInst(Constant::getNullConstant(POINTERTYPE),
461 Type::UIntTy, I->getOperand(1)->getName());
462 ReferencesToUpdate.push_back(RefToUpdate(Index, 0, I->getOperand(1)));
464 vector<Value*> Indices(I->idx_begin(), I->idx_end());
465 assert(Indices[0] == ConstantUInt::get(Type::UIntTy, 0) &&
466 "Cannot handle array indexing yet!");
468 Instruction *NewStore = new StoreInst(Val, PoolBase, Indices);
470 if (Val != I->getOperand(0)) // Value stored was a pointer?
471 ReferencesToUpdate.push_back(RefToUpdate(NewStore, 0, I->getOperand(0)));
474 // Replace the store instruction with the cast instruction...
475 BasicBlock::iterator II = ReplaceInstWith(I, Index);
477 // Add the pool base calculator instruction before the index...
478 II = Index->getParent()->getInstList().insert(II, PoolBase) + 2;
480 // Add the store after the cast instruction...
481 Index->getParent()->getInstList().insert(II, NewStore);
485 // Create call to poolalloc for every malloc instruction
486 void visitMallocInst(MallocInst *I) {
488 Args.push_back(getScalarRef(I).Pool.Handle);
489 CallInst *Call = new CallInst(PoolAllocator.PoolAlloc, Args, I->getName());
490 ReplaceInstWith(I, Call);
493 // Convert a call to poolfree for every free instruction...
494 void visitFreeInst(FreeInst *I) {
495 // Create a new call to poolfree before the free instruction
497 Args.push_back(Constant::getNullConstant(POINTERTYPE));
498 Args.push_back(getScalarRef(I->getOperand(0)).Pool.Handle);
499 Instruction *NewCall = new CallInst(PoolAllocator.PoolFree, Args);
500 ReplaceInstWith(I, NewCall);
501 ReferencesToUpdate.push_back(RefToUpdate(NewCall, 0, I->getOperand(0)));
504 // visitCallInst - Create a new call instruction with the extra arguments for
505 // all of the memory pools that the call needs.
507 void visitCallInst(CallInst *I) {
508 TransformFunctionInfo &TI = CallMap[I];
510 // Start with all of the old arguments...
511 vector<Value*> Args(I->op_begin()+1, I->op_end());
513 for (unsigned i = 0, e = TI.ArgInfo.size(); i != e; ++i) {
514 // Replace all of the pointer arguments with our new pointer typed values.
515 if (TI.ArgInfo[i].ArgNo != -1)
516 Args[TI.ArgInfo[i].ArgNo] = Constant::getNullConstant(POINTERTYPE);
518 // Add all of the pool arguments...
519 Args.push_back(TI.ArgInfo[i].PoolHandle);
522 Function *NF = PoolAllocator.getTransformedFunction(TI);
523 Instruction *NewCall = new CallInst(NF, Args, I->getName());
524 ReplaceInstWith(I, NewCall);
526 // Keep track of the mapping of operands so that we can resolve them to real
528 Value *RetVal = NewCall;
529 for (unsigned i = 0, e = TI.ArgInfo.size(); i != e; ++i)
530 if (TI.ArgInfo[i].ArgNo != -1)
531 ReferencesToUpdate.push_back(RefToUpdate(NewCall, TI.ArgInfo[i].ArgNo+1,
532 I->getOperand(TI.ArgInfo[i].ArgNo+1)));
534 RetVal = 0; // If returning a pointer, don't change retval...
536 // If not returning a pointer, use the new call as the value in the program
537 // instead of the old call...
540 I->replaceAllUsesWith(RetVal);
543 // visitPHINode - Create a new PHI node of POINTERTYPE for all of the old Phi
546 void visitPHINode(PHINode *PN) {
547 Value *DummyVal = Constant::getNullConstant(POINTERTYPE);
548 PHINode *NewPhi = new PHINode(POINTERTYPE, PN->getName());
549 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
550 NewPhi->addIncoming(DummyVal, PN->getIncomingBlock(i));
551 ReferencesToUpdate.push_back(RefToUpdate(NewPhi, i*2,
552 PN->getIncomingValue(i)));
555 ReplaceInstWith(PN, NewPhi);
558 // visitReturnInst - Replace ret instruction with a new return...
559 void visitReturnInst(ReturnInst *I) {
560 Instruction *Ret = new ReturnInst(Constant::getNullConstant(POINTERTYPE));
561 ReplaceInstWith(I, Ret);
562 ReferencesToUpdate.push_back(RefToUpdate(Ret, 0, I->getOperand(0)));
565 // visitSetCondInst - Replace a conditional test instruction with a new one
566 void visitSetCondInst(SetCondInst *SCI) {
567 BinaryOperator *I = (BinaryOperator*)SCI;
568 Value *DummyVal = Constant::getNullConstant(POINTERTYPE);
569 BinaryOperator *New = BinaryOperator::create(I->getOpcode(), DummyVal,
570 DummyVal, I->getName());
571 ReplaceInstWith(I, New);
573 ReferencesToUpdate.push_back(RefToUpdate(New, 0, I->getOperand(0)));
574 ReferencesToUpdate.push_back(RefToUpdate(New, 1, I->getOperand(1)));
576 // Make sure branches refer to the new condition...
577 I->replaceAllUsesWith(New);
580 void visitInstruction(Instruction *I) {
581 cerr << "Unknown instruction to FunctionBodyTransformer:\n" << I;
588 static void addCallInfo(DataStructure *DS,
589 TransformFunctionInfo &TFI, CallInst *CI, int Arg,
591 map<DSNode*, PoolInfo> &PoolDescs) {
592 assert(CI->getCalledFunction() && "Cannot handle indirect calls yet!");
593 assert(TFI.Func == 0 || TFI.Func == CI->getCalledFunction() &&
594 "Function call record should always call the same function!");
595 assert(TFI.Call == 0 || TFI.Call == CI &&
596 "Call element already filled in with different value!");
597 TFI.Func = CI->getCalledFunction();
599 //FunctionDSGraph &CalledGraph = DS->getClosedDSGraph(TFI.Func);
601 // For now, add the entire graph that is pointed to by the call argument.
602 // This graph can and should be pruned to only what the function itself will
603 // use, because often this will be a dramatically smaller subset of what we
606 for (df_iterator<DSNode*> I = df_begin(GraphNode), E = df_end(GraphNode);
608 TFI.ArgInfo.push_back(CallArgInfo(Arg, *I, PoolDescs[*I].Handle));
612 // transformFunctionBody - This transforms the instruction in 'F' to use the
613 // pools specified in PoolDescs when modifying data structure nodes specified in
614 // the PoolDescs map. Specifically, scalar values specified in the Scalars
615 // vector must be remapped. IPFGraph is the closed data structure graph for F,
616 // of which the PoolDescriptor nodes come from.
618 void PoolAllocate::transformFunctionBody(Function *F, FunctionDSGraph &IPFGraph,
619 map<DSNode*, PoolInfo> &PoolDescs) {
621 // Loop through the value map looking for scalars that refer to nonescaping
622 // allocations. Add them to the Scalars vector. Note that we may have
623 // multiple entries in the Scalars vector for each value if it points to more
626 map<Value*, PointerValSet> &ValMap = IPFGraph.getValueMap();
627 vector<ScalarInfo> Scalars;
629 cerr << "Building scalar map:\n";
631 for (map<Value*, PointerValSet>::iterator I = ValMap.begin(),
632 E = ValMap.end(); I != E; ++I) {
633 const PointerValSet &PVS = I->second; // Set of things pointed to by scalar
635 // Check to see if the scalar points to a data structure node...
636 for (unsigned i = 0, e = PVS.size(); i != e; ++i) {
637 assert(PVS[i].Index == 0 && "Nonzero not handled yet!");
639 // If the allocation is in the nonescaping set...
640 map<DSNode*, PoolInfo>::iterator AI = PoolDescs.find(PVS[i].Node);
641 if (AI != PoolDescs.end()) { // Add it to the list of scalars
642 Scalars.push_back(ScalarInfo(I->first, AI->second));
643 cerr << "\nScalar Mapping from:" << I->first
644 << "Scalar Mapping to: "; PVS.print(cerr);
651 cerr << "\nIn '" << F->getName()
652 << "': Found the following values that point to poolable nodes:\n";
654 for (unsigned i = 0, e = Scalars.size(); i != e; ++i)
655 cerr << Scalars[i].Val;
658 // CallMap - Contain an entry for every call instruction that needs to be
659 // transformed. Each entry in the map contains information about what we need
660 // to do to each call site to change it to work.
662 map<CallInst*, TransformFunctionInfo> CallMap;
664 // Now we need to figure out what called functions we need to transform, and
665 // how. To do this, we look at all of the scalars, seeing which functions are
666 // either used as a scalar value (so they return a data structure), or are
667 // passed one of our scalar values.
669 for (unsigned i = 0, e = Scalars.size(); i != e; ++i) {
670 Value *ScalarVal = Scalars[i].Val;
672 // Check to see if the scalar _IS_ a call...
673 if (CallInst *CI = dyn_cast<CallInst>(ScalarVal))
674 // If so, add information about the pool it will be returning...
675 addCallInfo(DS, CallMap[CI], CI, -1, Scalars[i].Pool.Node, PoolDescs);
677 // Check to see if the scalar is an operand to a call...
678 for (Value::use_iterator UI = ScalarVal->use_begin(),
679 UE = ScalarVal->use_end(); UI != UE; ++UI) {
680 if (CallInst *CI = dyn_cast<CallInst>(*UI)) {
681 // Find out which operand this is to the call instruction...
682 User::op_iterator OI = find(CI->op_begin(), CI->op_end(), ScalarVal);
683 assert(OI != CI->op_end() && "Call on use list but not an operand!?");
684 assert(OI != CI->op_begin() && "Pointer operand is call destination?");
686 // FIXME: This is broken if the same pointer is passed to a call more
687 // than once! It will get multiple entries for the first pointer.
689 // Add the operand number and pool handle to the call table...
690 addCallInfo(DS, CallMap[CI], CI, OI-CI->op_begin()-1,
691 Scalars[i].Pool.Node, PoolDescs);
696 // Print out call map...
697 for (map<CallInst*, TransformFunctionInfo>::iterator I = CallMap.begin();
698 I != CallMap.end(); ++I) {
699 cerr << "For call: " << I->first;
700 I->second.finalizeConstruction();
701 cerr << I->second.Func->getName() << " must pass pool pointer for args #";
702 for (unsigned i = 0; i < I->second.ArgInfo.size(); ++i)
703 cerr << I->second.ArgInfo[i].ArgNo << ", ";
707 // Loop through all of the call nodes, recursively creating the new functions
708 // that we want to call... This uses a map to prevent infinite recursion and
709 // to avoid duplicating functions unneccesarily.
711 for (map<CallInst*, TransformFunctionInfo>::iterator I = CallMap.begin(),
712 E = CallMap.end(); I != E; ++I) {
713 // Make sure the entries are sorted.
714 I->second.finalizeConstruction();
716 // Transform all of the functions we need, or at least ensure there is a
717 // cached version available.
718 transformFunction(I->second, IPFGraph, PoolDescs);
721 // Now that all of the functions that we want to call are available, transform
722 // the local function so that it uses the pools locally and passes them to the
723 // functions that we just hacked up.
726 // First step, find the instructions to be modified.
727 vector<Instruction*> InstToFix;
728 for (unsigned i = 0, e = Scalars.size(); i != e; ++i) {
729 Value *ScalarVal = Scalars[i].Val;
731 // Check to see if the scalar _IS_ an instruction. If so, it is involved.
732 if (Instruction *Inst = dyn_cast<Instruction>(ScalarVal))
733 InstToFix.push_back(Inst);
735 // All all of the instructions that use the scalar as an operand...
736 for (Value::use_iterator UI = ScalarVal->use_begin(),
737 UE = ScalarVal->use_end(); UI != UE; ++UI)
738 InstToFix.push_back(cast<Instruction>(*UI));
741 // Eliminate duplicates by sorting, then removing equal neighbors.
742 sort(InstToFix.begin(), InstToFix.end());
743 InstToFix.erase(unique(InstToFix.begin(), InstToFix.end()), InstToFix.end());
745 // Loop over all of the instructions to transform, creating the new
746 // replacement instructions for them. This also unlinks them from the
747 // function so they can be safely deleted later.
749 map<Value*, Value*> XFormMap;
750 NewInstructionCreator NIC(*this, Scalars, CallMap, XFormMap);
752 // Visit all instructions... creating the new instructions that we need and
753 // unlinking the old instructions from the function...
755 for (unsigned i = 0, e = InstToFix.size(); i != e; ++i) {
756 cerr << "Fixing: " << InstToFix[i];
757 NIC.visit(InstToFix[i]);
759 //NIC.visit(InstToFix.begin(), InstToFix.end());
761 // Make all instructions we will delete "let go" of their operands... so that
762 // we can safely delete Arguments whose types have changed...
764 for_each(InstToFix.begin(), InstToFix.end(),
765 mem_fun(&Instruction::dropAllReferences));
767 // Loop through all of the pointer arguments coming into the function,
768 // replacing them with arguments of POINTERTYPE to match the function type of
771 FunctionType::ParamTypes::const_iterator TI =
772 F->getFunctionType()->getParamTypes().begin();
773 for (Function::ArgumentListType::iterator I = F->getArgumentList().begin(),
774 E = F->getArgumentList().end(); I != E; ++I, ++TI) {
776 if (Arg->getType() != *TI) {
777 assert(isa<PointerType>(Arg->getType()) && *TI == POINTERTYPE);
778 Argument *NewArg = new Argument(*TI, Arg->getName());
779 XFormMap[Arg] = NewArg; // Map old arg into new arg...
782 // Replace the old argument and then delete it...
783 delete F->getArgumentList().replaceWith(I, NewArg);
787 // Now that all of the new instructions have been created, we can update all
788 // of the references to dummy values to be references to the actual values
789 // that are computed.
791 NIC.updateReferences();
793 cerr << "TRANSFORMED FUNCTION:\n" << F;
796 // Delete all of the "instructions to fix"
797 for_each(InstToFix.begin(), InstToFix.end(), deleter<Instruction>);
799 // Since we have liberally hacked the function to pieces, we want to inform
800 // the datastructure pass that its internal representation is out of date.
802 DS->invalidateFunction(F);
805 static void addNodeMapping(DSNode *SrcNode, const PointerValSet &PVS,
806 map<DSNode*, PointerValSet> &NodeMapping) {
807 for (unsigned i = 0, e = PVS.size(); i != e; ++i)
808 if (NodeMapping[SrcNode].add(PVS[i])) { // Not in map yet?
809 assert(PVS[i].Index == 0 && "Node indexing not supported yet!");
810 DSNode *DestNode = PVS[i].Node;
812 // Loop over all of the outgoing links in the mapped graph
813 for (unsigned l = 0, le = DestNode->getNumOutgoingLinks(); l != le; ++l) {
814 PointerValSet &SrcSet = SrcNode->getOutgoingLink(l);
815 const PointerValSet &DestSet = DestNode->getOutgoingLink(l);
817 // Add all of the node mappings now!
818 for (unsigned si = 0, se = SrcSet.size(); si != se; ++si) {
819 assert(SrcSet[si].Index == 0 && "Can't handle node offset!");
820 addNodeMapping(SrcSet[si].Node, DestSet, NodeMapping);
826 // CalculateNodeMapping - There is a partial isomorphism between the graph
827 // passed in and the graph that is actually used by the function. We need to
828 // figure out what this mapping is so that we can transformFunctionBody the
829 // instructions in the function itself. Note that every node in the graph that
830 // we are interested in must be both in the local graph of the called function,
831 // and in the local graph of the calling function. Because of this, we only
832 // define the mapping for these nodes [conveniently these are the only nodes we
833 // CAN define a mapping for...]
835 // The roots of the graph that we are transforming is rooted in the arguments
836 // passed into the function from the caller. This is where we start our
837 // mapping calculation.
839 // The NodeMapping calculated maps from the callers graph to the called graph.
841 static void CalculateNodeMapping(Function *F, TransformFunctionInfo &TFI,
842 FunctionDSGraph &CallerGraph,
843 FunctionDSGraph &CalledGraph,
844 map<DSNode*, PointerValSet> &NodeMapping) {
846 for (unsigned i = 0, e = TFI.ArgInfo.size(); i != e; ++i) {
847 // Figure out what nodes in the called graph the TFI.ArgInfo[i].Node node
850 // Only consider first node of sequence. Extra nodes may may be added
851 // to the TFI if the data structure requires more nodes than just the
852 // one the argument points to. We are only interested in the one the
853 // argument points to though.
855 if (TFI.ArgInfo[i].ArgNo != LastArgNo) {
856 if (TFI.ArgInfo[i].ArgNo == -1) {
857 addNodeMapping(TFI.ArgInfo[i].Node, CalledGraph.getRetNodes(),
860 // Figure out which node argument # ArgNo points to in the called graph.
861 Value *Arg = F->getArgumentList()[TFI.ArgInfo[i].ArgNo];
862 addNodeMapping(TFI.ArgInfo[i].Node, CalledGraph.getValueMap()[Arg],
865 LastArgNo = TFI.ArgInfo[i].ArgNo;
871 // transformFunction - Transform the specified function the specified way. It
872 // we have already transformed that function that way, don't do anything. The
873 // nodes in the TransformFunctionInfo come out of callers data structure graph.
875 void PoolAllocate::transformFunction(TransformFunctionInfo &TFI,
876 FunctionDSGraph &CallerIPGraph,
877 map<DSNode*, PoolInfo> &CallerPoolDesc) {
878 if (getTransformedFunction(TFI)) return; // Function xformation already done?
880 cerr << "********** Entering transformFunction for "
881 << TFI.Func->getName() << ":\n";
882 for (unsigned i = 0, e = TFI.ArgInfo.size(); i != e; ++i)
883 cerr << " ArgInfo[" << i << "] = " << TFI.ArgInfo[i].ArgNo << "\n";
886 const FunctionType *OldFuncType = TFI.Func->getFunctionType();
888 assert(!OldFuncType->isVarArg() && "Vararg functions not handled yet!");
890 // Build the type for the new function that we are transforming
891 vector<const Type*> ArgTys;
892 ArgTys.reserve(OldFuncType->getNumParams()+TFI.ArgInfo.size());
893 for (unsigned i = 0, e = OldFuncType->getNumParams(); i != e; ++i)
894 ArgTys.push_back(OldFuncType->getParamType(i));
896 const Type *RetType = OldFuncType->getReturnType();
898 // Add one pool pointer for every argument that needs to be supplemented.
899 for (unsigned i = 0, e = TFI.ArgInfo.size(); i != e; ++i) {
900 if (TFI.ArgInfo[i].ArgNo == -1)
901 RetType = POINTERTYPE; // Return a pointer
903 ArgTys[TFI.ArgInfo[i].ArgNo] = POINTERTYPE; // Pass a pointer
904 ArgTys.push_back(PointerType::get(CallerPoolDesc.find(TFI.ArgInfo[i].Node)
908 // Build the new function type...
909 const FunctionType *NewFuncType = FunctionType::get(RetType, ArgTys,
910 OldFuncType->isVarArg());
912 // The new function is internal, because we know that only we can call it.
913 // This also helps subsequent IP transformations to eliminate duplicated pool
914 // pointers (which look like the same value is always passed into a parameter,
915 // allowing it to be easily eliminated).
917 Function *NewFunc = new Function(NewFuncType, true,
918 TFI.Func->getName()+".poolxform");
919 CurModule->getFunctionList().push_back(NewFunc);
922 cerr << "Created function prototype: " << NewFunc << "\n";
924 // Add the newly formed function to the TransformedFunctions table so that
925 // infinite recursion does not occur!
927 TransformedFunctions[TFI] = NewFunc;
929 // Add arguments to the function... starting with all of the old arguments
930 vector<Value*> ArgMap;
931 for (unsigned i = 0, e = TFI.Func->getArgumentList().size(); i != e; ++i) {
932 const Argument *OFA = TFI.Func->getArgumentList()[i];
933 Argument *NFA = new Argument(OFA->getType(), OFA->getName());
934 NewFunc->getArgumentList().push_back(NFA);
935 ArgMap.push_back(NFA); // Keep track of the arguments
938 // Now add all of the arguments corresponding to pools passed in...
939 for (unsigned i = 0, e = TFI.ArgInfo.size(); i != e; ++i) {
940 CallArgInfo &AI = TFI.ArgInfo[i];
945 Name = ArgMap[AI.ArgNo]->getName(); // Get the arg name
946 const Type *Ty = PointerType::get(CallerPoolDesc[AI.Node].PoolType);
947 Argument *NFA = new Argument(Ty, Name+".pool");
948 NewFunc->getArgumentList().push_back(NFA);
951 // Now clone the body of the old function into the new function...
952 CloneFunctionInto(NewFunc, TFI.Func, ArgMap);
954 // Okay, now we have a function that is identical to the old one, except that
955 // it has extra arguments for the pools coming in. Now we have to get the
956 // data structure graph for the function we are replacing, and figure out how
957 // our graph nodes map to the graph nodes in the dest function.
959 FunctionDSGraph &DSGraph = DS->getClosedDSGraph(NewFunc);
961 // NodeMapping - Multimap from callers graph to called graph. We are
962 // guaranteed that the called function graph has more nodes than the caller,
963 // or exactly the same number of nodes. This is because the called function
964 // might not know that two nodes are merged when considering the callers
965 // context, but the caller obviously does. Because of this, a single node in
966 // the calling function's data structure graph can map to multiple nodes in
967 // the called functions graph.
969 map<DSNode*, PointerValSet> NodeMapping;
971 CalculateNodeMapping(NewFunc, TFI, CallerIPGraph, DSGraph,
974 // Print out the node mapping...
975 cerr << "\nNode mapping for call of " << NewFunc->getName() << "\n";
976 for (map<DSNode*, PointerValSet>::iterator I = NodeMapping.begin();
977 I != NodeMapping.end(); ++I) {
978 cerr << "Map: "; I->first->print(cerr);
979 cerr << "To: "; I->second.print(cerr);
983 // Fill in the PoolDescriptor information for the transformed function so that
984 // it can determine which value holds the pool descriptor for each data
985 // structure node that it accesses.
987 map<DSNode*, PoolInfo> PoolDescs;
989 cerr << "\nCalculating the pool descriptor map:\n";
991 // Calculate as much of the pool descriptor map as possible. Since we have
992 // the node mapping between the caller and callee functions, and we have the
993 // pool descriptor information of the caller, we can calculate a partical pool
994 // descriptor map for the called function.
996 // The nodes that we do not have complete information for are the ones that
997 // are accessed by loading pointers derived from arguments passed in, but that
998 // are not passed in directly. In this case, we have all of the information
999 // except a pool value. If the called function refers to this pool, the pool
1000 // value will be loaded from the pool graph and added to the map as neccesary.
1002 for (map<DSNode*, PointerValSet>::iterator I = NodeMapping.begin();
1003 I != NodeMapping.end(); ++I) {
1004 DSNode *CallerNode = I->first;
1005 PoolInfo &CallerPI = CallerPoolDesc[CallerNode];
1007 // Check to see if we have a node pointer passed in for this value...
1008 Value *CalleeValue = 0;
1009 for (unsigned a = 0, ae = TFI.ArgInfo.size(); a != ae; ++a)
1010 if (TFI.ArgInfo[a].Node == CallerNode) {
1011 // Calculate the argument number that the pool is to the function
1012 // call... The call instruction should not have the pool operands added
1014 unsigned ArgNo = TFI.Call->getNumOperands()-1+a;
1015 cerr << "Should be argument #: " << ArgNo << "[i = " << a << "]\n";
1016 assert(ArgNo < NewFunc->getArgumentList().size() &&
1017 "Call already has pool arguments added??");
1019 // Map the pool argument into the called function...
1020 CalleeValue = NewFunc->getArgumentList()[ArgNo];
1021 break; // Found value, quit loop
1024 // Loop over all of the data structure nodes that this incoming node maps to
1025 // Creating a PoolInfo structure for them.
1026 for (unsigned i = 0, e = I->second.size(); i != e; ++i) {
1027 assert(I->second[i].Index == 0 && "Doesn't handle subindexing yet!");
1028 DSNode *CalleeNode = I->second[i].Node;
1030 // Add the descriptor. We already know everything about it by now, much
1031 // of it is the same as the caller info.
1033 PoolDescs.insert(make_pair(CalleeNode,
1034 PoolInfo(CalleeNode, CalleeValue,
1036 CallerPI.PoolType)));
1040 // We must destroy the node mapping so that we don't have latent references
1041 // into the data structure graph for the new function. Otherwise we get
1042 // assertion failures when transformFunctionBody tries to invalidate the
1045 NodeMapping.clear();
1047 // Now that we know everything we need about the function, transform the body
1050 transformFunctionBody(NewFunc, DSGraph, PoolDescs);
1052 cerr << "Function after transformation:\n" << NewFunc;
1056 // CreatePools - Insert instructions into the function we are processing to
1057 // create all of the memory pool objects themselves. This also inserts
1058 // destruction code. Add an alloca for each pool that is allocated to the
1059 // PoolDescs vector.
1061 void PoolAllocate::CreatePools(Function *F, const vector<AllocDSNode*> &Allocs,
1062 map<DSNode*, PoolInfo> &PoolDescs) {
1063 // Find all of the return nodes in the function...
1064 vector<BasicBlock*> ReturnNodes;
1065 for (Function::iterator I = F->begin(), E = F->end(); I != E; ++I)
1066 if (isa<ReturnInst>((*I)->getTerminator()))
1067 ReturnNodes.push_back(*I);
1069 map<DSNode*, PATypeHolder> AbsPoolTyMap;
1071 // First pass over the allocations to process...
1072 for (unsigned i = 0, e = Allocs.size(); i != e; ++i) {
1073 // Create the pooldescriptor mapping... with null entries for everything
1074 // except the node & NewType fields.
1076 map<DSNode*, PoolInfo>::iterator PI =
1077 PoolDescs.insert(make_pair(Allocs[i], PoolInfo(Allocs[i]))).first;
1079 // Create the abstract pool types that will need to be resolved in a second
1080 // pass once an abstract type is created for each pool.
1082 // Can only handle limited shapes for now...
1083 StructType *OldNodeTy = cast<StructType>(Allocs[i]->getType());
1084 vector<const Type*> PoolTypes;
1086 // Pool type is the first element of the pool descriptor type...
1087 PoolTypes.push_back(getPoolType(PoolDescs[Allocs[i]].NewType));
1089 for (unsigned j = 0, e = OldNodeTy->getElementTypes().size(); j != e; ++j) {
1090 if (isa<PointerType>(OldNodeTy->getElementTypes()[j]))
1091 PoolTypes.push_back(OpaqueType::get());
1093 assert(OldNodeTy->getElementTypes()[j]->isPrimitiveType() &&
1094 "Complex types not handled yet!");
1096 assert(Allocs[i]->getNumLinks() == PoolTypes.size()-1 &&
1097 "Node should have same number of pointers as pool!");
1099 // Create the pool type, with opaque values for pointers...
1100 AbsPoolTyMap.insert(make_pair(Allocs[i], StructType::get(PoolTypes)));
1101 #ifdef DEBUG_CREATE_POOLS
1102 cerr << "POOL TY: " << AbsPoolTyMap.find(Allocs[i])->second.get() << "\n";
1106 // Now that we have types for all of the pool types, link them all together.
1107 for (unsigned i = 0, e = Allocs.size(); i != e; ++i) {
1108 PATypeHolder &PoolTyH = AbsPoolTyMap.find(Allocs[i])->second;
1110 // Resolve all of the outgoing pointer types of this pool node...
1111 for (unsigned p = 0, pe = Allocs[i]->getNumLinks(); p != pe; ++p) {
1112 PointerValSet &PVS = Allocs[i]->getLink(p);
1113 assert(!PVS.empty() && "Outgoing edge is empty, field unused, can"
1114 " probably just leave the type opaque or something dumb.");
1116 for (Out = 0; AbsPoolTyMap.count(PVS[Out].Node) == 0; ++Out)
1117 assert(Out != PVS.size() && "No edge to an outgoing allocation node!?");
1119 assert(PVS[Out].Index == 0 && "Subindexing not implemented yet!");
1121 // The actual struct type could change each time through the loop, so it's
1122 // NOT loop invariant.
1123 StructType *PoolTy = cast<StructType>(PoolTyH.get());
1125 // Get the opaque type...
1127 cast<DerivedType>(PoolTy->getElementTypes()[p+1].get());
1129 #ifdef DEBUG_CREATE_POOLS
1130 cerr << "Refining " << ElTy << " of " << PoolTy << " to "
1131 << AbsPoolTyMap.find(PVS[Out].Node)->second.get() << "\n";
1134 const Type *RefPoolTy = AbsPoolTyMap.find(PVS[Out].Node)->second.get();
1135 ElTy->refineAbstractTypeTo(PointerType::get(RefPoolTy));
1137 #ifdef DEBUG_CREATE_POOLS
1138 cerr << "Result pool type is: " << PoolTyH.get() << "\n";
1143 // Create the code that goes in the entry and exit nodes for the function...
1144 vector<Instruction*> EntryNodeInsts;
1145 for (unsigned i = 0, e = Allocs.size(); i != e; ++i) {
1146 PoolInfo &PI = PoolDescs[Allocs[i]];
1148 // Fill in the pool type for this pool...
1149 PI.PoolType = AbsPoolTyMap.find(Allocs[i])->second.get();
1150 assert(!PI.PoolType->isAbstract() &&
1151 "Pool type should not be abstract anymore!");
1153 // Add an allocation and a free for each pool...
1154 AllocaInst *PoolAlloc = new AllocaInst(PointerType::get(PI.PoolType),
1156 PI.Handle = PoolAlloc;
1157 EntryNodeInsts.push_back(PoolAlloc);
1158 AllocationInst *AI = Allocs[i]->getAllocation();
1160 // Initialize the pool. We need to know how big each allocation is. For
1161 // our purposes here, we assume we are allocating a scalar, or array of
1164 unsigned ElSize = TargetData.getTypeSize(AI->getAllocatedType());
1165 ElSize *= cast<ConstantUInt>(AI->getArraySize())->getValue();
1167 vector<Value*> Args;
1168 Args.push_back(ConstantUInt::get(Type::UIntTy, ElSize));
1169 Args.push_back(PoolAlloc); // Pool to initialize
1170 EntryNodeInsts.push_back(new CallInst(PoolInit, Args));
1172 // FIXME: add code to initialize inter pool links
1173 cerr << "TODO: add code to initialize inter pool links!\n";
1175 // Add code to destroy the pool in all of the exit nodes of the function...
1177 for (unsigned EN = 0, ENE = ReturnNodes.size(); EN != ENE; ++EN) {
1178 Instruction *Destroy = new CallInst(PoolDestroy, Args);
1180 // Insert it before the return instruction...
1181 BasicBlock *RetNode = ReturnNodes[EN];
1182 RetNode->getInstList().insert(RetNode->end()-1, Destroy);
1186 // Insert the entry node code into the entry block...
1187 F->getEntryNode()->getInstList().insert(F->getEntryNode()->begin()+1,
1188 EntryNodeInsts.begin(),
1189 EntryNodeInsts.end());
1193 // addPoolPrototypes - Add prototypes for the pool functions to the specified
1194 // module and update the Pool* instance variables to point to them.
1196 void PoolAllocate::addPoolPrototypes(Module *M) {
1197 // Get poolinit function...
1198 vector<const Type*> Args;
1199 Args.push_back(Type::UIntTy); // Num bytes per element
1200 FunctionType *PoolInitTy = FunctionType::get(Type::VoidTy, Args, true);
1201 PoolInit = M->getOrInsertFunction("poolinit", PoolInitTy);
1203 // Get pooldestroy function...
1204 Args.pop_back(); // Only takes a pool...
1205 FunctionType *PoolDestroyTy = FunctionType::get(Type::VoidTy, Args, true);
1206 PoolDestroy = M->getOrInsertFunction("pooldestroy", PoolDestroyTy);
1208 // Get the poolalloc function...
1209 FunctionType *PoolAllocTy = FunctionType::get(POINTERTYPE, Args, true);
1210 PoolAlloc = M->getOrInsertFunction("poolalloc", PoolAllocTy);
1212 // Get the poolfree function...
1213 Args.push_back(POINTERTYPE); // Pointer to free
1214 FunctionType *PoolFreeTy = FunctionType::get(Type::VoidTy, Args, true);
1215 PoolFree = M->getOrInsertFunction("poolfree", PoolFreeTy);
1217 // Add the %PoolTy type to the symbol table of the module...
1218 //M->addTypeName("PoolTy", PoolTy->getElementType());
1222 bool PoolAllocate::run(Module *M) {
1223 addPoolPrototypes(M);
1226 DS = &getAnalysis<DataStructure>();
1227 bool Changed = false;
1229 // We cannot use an iterator here because it will get invalidated when we add
1230 // functions to the module later...
1231 for (unsigned i = 0; i != M->size(); ++i)
1232 if (!M->getFunctionList()[i]->isExternal()) {
1233 Changed |= processFunction(M->getFunctionList()[i]);
1235 cerr << "Only processing one function\n";
1246 // createPoolAllocatePass - Global function to access the functionality of this
1249 Pass *createPoolAllocatePass() { return new PoolAllocate(); }