1 //===- Andersens.cpp - Andersen's Interprocedural Alias Analysis ----------===//
3 // The LLVM Compiler Infrastructure
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.
8 //===----------------------------------------------------------------------===//
10 // This file defines a very simple implementation of Andersen's interprocedural
11 // alias analysis. This implementation does not include any of the fancy
12 // features that make Andersen's reasonably efficient (like cycle elimination or
13 // variable substitution), but it should be useful for getting precision
14 // numbers and can be extended in the future.
16 // In pointer analysis terms, this is a subset-based, flow-insensitive,
17 // field-insensitive, and context-insensitive algorithm pointer algorithm.
19 // This algorithm is implemented as three stages:
20 // 1. Object identification.
21 // 2. Inclusion constraint identification.
22 // 3. Inclusion constraint solving.
24 // The object identification stage identifies all of the memory objects in the
25 // program, which includes globals, heap allocated objects, and stack allocated
28 // The inclusion constraint identification stage finds all inclusion constraints
29 // in the program by scanning the program, looking for pointer assignments and
30 // other statements that effect the points-to graph. For a statement like "A =
31 // B", this statement is processed to indicate that A can point to anything that
32 // B can point to. Constraints can handle copies, loads, and stores.
34 // The inclusion constraint solving phase iteratively propagates the inclusion
35 // constraints until a fixed point is reached. This is an O(N^3) algorithm.
37 // In the initial pass, all indirect function calls are completely ignored. As
38 // the analysis discovers new targets of function pointers, it iteratively
39 // resolves a precise (and conservative) call graph. Also related, this
40 // analysis initially assumes that all internal functions have known incoming
41 // pointers. If we find that an internal function's address escapes outside of
42 // the program, we update this assumption.
44 // Future Improvements:
45 // This implementation of Andersen's algorithm is extremely slow. To make it
46 // scale reasonably well, the inclusion constraints could be sorted (easy),
47 // offline variable substitution would be a huge win (straight-forward), and
48 // online cycle elimination (trickier) might help as well.
50 //===----------------------------------------------------------------------===//
52 #define DEBUG_TYPE "anders-aa"
53 #include "llvm/Constants.h"
54 #include "llvm/DerivedTypes.h"
55 #include "llvm/Instructions.h"
56 #include "llvm/Module.h"
57 #include "llvm/Pass.h"
58 #include "llvm/Support/InstIterator.h"
59 #include "llvm/Support/InstVisitor.h"
60 #include "llvm/Analysis/AliasAnalysis.h"
61 #include "llvm/Analysis/Passes.h"
62 #include "llvm/Support/Debug.h"
63 #include "llvm/ADT/Statistic.h"
70 NumIters("anders-aa", "Number of iterations to reach convergence");
72 NumConstraints("anders-aa", "Number of constraints");
74 NumNodes("anders-aa", "Number of nodes");
76 NumEscapingFunctions("anders-aa", "Number of internal functions that escape");
78 NumIndirectCallees("anders-aa", "Number of indirect callees found");
80 class Andersens : public ModulePass, public AliasAnalysis,
81 private InstVisitor<Andersens> {
82 /// Node class - This class is used to represent a memory object in the
83 /// program, and is the primitive used to build the points-to graph.
85 std::vector<Node*> Pointees;
89 Node *setValue(Value *V) {
90 assert(Val == 0 && "Value already set for this node!");
95 /// getValue - Return the LLVM value corresponding to this node.
97 Value *getValue() const { return Val; }
99 typedef std::vector<Node*>::const_iterator iterator;
100 iterator begin() const { return Pointees.begin(); }
101 iterator end() const { return Pointees.end(); }
103 /// addPointerTo - Add a pointer to the list of pointees of this node,
104 /// returning true if this caused a new pointer to be added, or false if
105 /// we already knew about the points-to relation.
106 bool addPointerTo(Node *N) {
107 std::vector<Node*>::iterator I = std::lower_bound(Pointees.begin(),
110 if (I != Pointees.end() && *I == N)
112 Pointees.insert(I, N);
116 /// intersects - Return true if the points-to set of this node intersects
117 /// with the points-to set of the specified node.
118 bool intersects(Node *N) const;
120 /// intersectsIgnoring - Return true if the points-to set of this node
121 /// intersects with the points-to set of the specified node on any nodes
122 /// except for the specified node to ignore.
123 bool intersectsIgnoring(Node *N, Node *Ignoring) const;
125 // Constraint application methods.
126 bool copyFrom(Node *N);
127 bool loadFrom(Node *N);
128 bool storeThrough(Node *N);
131 /// GraphNodes - This vector is populated as part of the object
132 /// identification stage of the analysis, which populates this vector with a
133 /// node for each memory object and fills in the ValueNodes map.
134 std::vector<Node> GraphNodes;
136 /// ValueNodes - This map indicates the Node that a particular Value* is
137 /// represented by. This contains entries for all pointers.
138 std::map<Value*, unsigned> ValueNodes;
140 /// ObjectNodes - This map contains entries for each memory object in the
141 /// program: globals, alloca's and mallocs.
142 std::map<Value*, unsigned> ObjectNodes;
144 /// ReturnNodes - This map contains an entry for each function in the
145 /// program that returns a value.
146 std::map<Function*, unsigned> ReturnNodes;
148 /// VarargNodes - This map contains the entry used to represent all pointers
149 /// passed through the varargs portion of a function call for a particular
150 /// function. An entry is not present in this map for functions that do not
151 /// take variable arguments.
152 std::map<Function*, unsigned> VarargNodes;
154 /// Constraint - Objects of this structure are used to represent the various
155 /// constraints identified by the algorithm. The constraints are 'copy',
156 /// for statements like "A = B", 'load' for statements like "A = *B", and
157 /// 'store' for statements like "*A = B".
159 enum ConstraintType { Copy, Load, Store } Type;
162 Constraint(ConstraintType Ty, Node *D, Node *S)
163 : Type(Ty), Dest(D), Src(S) {}
166 /// Constraints - This vector contains a list of all of the constraints
167 /// identified by the program.
168 std::vector<Constraint> Constraints;
170 /// EscapingInternalFunctions - This set contains all of the internal
171 /// functions that are found to escape from the program. If the address of
172 /// an internal function is passed to an external function or otherwise
173 /// escapes from the analyzed portion of the program, we must assume that
174 /// any pointer arguments can alias the universal node. This set keeps
175 /// track of those functions we are assuming to escape so far.
176 std::set<Function*> EscapingInternalFunctions;
178 /// IndirectCalls - This contains a list of all of the indirect call sites
179 /// in the program. Since the call graph is iteratively discovered, we may
180 /// need to add constraints to our graph as we find new targets of function
182 std::vector<CallSite> IndirectCalls;
184 /// IndirectCallees - For each call site in the indirect calls list, keep
185 /// track of the callees that we have discovered so far. As the analysis
186 /// proceeds, more callees are discovered, until the call graph finally
188 std::map<CallSite, std::vector<Function*> > IndirectCallees;
190 /// This enum defines the GraphNodes indices that correspond to important
199 bool runOnModule(Module &M) {
200 InitializeAliasAnalysis(this);
202 CollectConstraints(M);
203 DEBUG(PrintConstraints());
205 DEBUG(PrintPointsToGraph());
207 // Free the constraints list, as we don't need it to respond to alias
212 EscapingInternalFunctions.clear();
213 std::vector<Constraint>().swap(Constraints);
217 void releaseMemory() {
218 // FIXME: Until we have transitively required passes working correctly,
219 // this cannot be enabled! Otherwise, using -count-aa with the pass
220 // causes memory to be freed too early. :(
222 // The memory objects and ValueNodes data structures at the only ones that
223 // are still live after construction.
224 std::vector<Node>().swap(GraphNodes);
229 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
230 AliasAnalysis::getAnalysisUsage(AU);
231 AU.setPreservesAll(); // Does not transform code
234 //------------------------------------------------
235 // Implement the AliasAnalysis API
237 AliasResult alias(const Value *V1, unsigned V1Size,
238 const Value *V2, unsigned V2Size);
239 ModRefResult getModRefInfo(CallSite CS, Value *P, unsigned Size);
240 void getMustAliases(Value *P, std::vector<Value*> &RetVals);
241 bool pointsToConstantMemory(const Value *P);
243 virtual void deleteValue(Value *V) {
245 getAnalysis<AliasAnalysis>().deleteValue(V);
248 virtual void copyValue(Value *From, Value *To) {
249 ValueNodes[To] = ValueNodes[From];
250 getAnalysis<AliasAnalysis>().copyValue(From, To);
254 /// getNode - Return the node corresponding to the specified pointer scalar.
256 Node *getNode(Value *V) {
257 if (Constant *C = dyn_cast<Constant>(V))
258 if (!isa<GlobalValue>(C))
259 return getNodeForConstantPointer(C);
261 std::map<Value*, unsigned>::iterator I = ValueNodes.find(V);
262 if (I == ValueNodes.end()) {
264 assert(0 && "Value does not have a node in the points-to graph!");
266 return &GraphNodes[I->second];
269 /// getObject - Return the node corresponding to the memory object for the
270 /// specified global or allocation instruction.
271 Node *getObject(Value *V) {
272 std::map<Value*, unsigned>::iterator I = ObjectNodes.find(V);
273 assert(I != ObjectNodes.end() &&
274 "Value does not have an object in the points-to graph!");
275 return &GraphNodes[I->second];
278 /// getReturnNode - Return the node representing the return value for the
279 /// specified function.
280 Node *getReturnNode(Function *F) {
281 std::map<Function*, unsigned>::iterator I = ReturnNodes.find(F);
282 assert(I != ReturnNodes.end() && "Function does not return a value!");
283 return &GraphNodes[I->second];
286 /// getVarargNode - Return the node representing the variable arguments
287 /// formal for the specified function.
288 Node *getVarargNode(Function *F) {
289 std::map<Function*, unsigned>::iterator I = VarargNodes.find(F);
290 assert(I != VarargNodes.end() && "Function does not take var args!");
291 return &GraphNodes[I->second];
294 /// getNodeValue - Get the node for the specified LLVM value and set the
295 /// value for it to be the specified value.
296 Node *getNodeValue(Value &V) {
297 return getNode(&V)->setValue(&V);
300 void IdentifyObjects(Module &M);
301 void CollectConstraints(Module &M);
302 void SolveConstraints();
304 Node *getNodeForConstantPointer(Constant *C);
305 Node *getNodeForConstantPointerTarget(Constant *C);
306 void AddGlobalInitializerConstraints(Node *N, Constant *C);
308 void AddConstraintsForNonInternalLinkage(Function *F);
309 void AddConstraintsForCall(CallSite CS, Function *F);
310 bool AddConstraintsForExternalCall(CallSite CS, Function *F);
313 void PrintNode(Node *N);
314 void PrintConstraints();
315 void PrintPointsToGraph();
317 //===------------------------------------------------------------------===//
318 // Instruction visitation methods for adding constraints
320 friend class InstVisitor<Andersens>;
321 void visitReturnInst(ReturnInst &RI);
322 void visitInvokeInst(InvokeInst &II) { visitCallSite(CallSite(&II)); }
323 void visitCallInst(CallInst &CI) { visitCallSite(CallSite(&CI)); }
324 void visitCallSite(CallSite CS);
325 void visitAllocationInst(AllocationInst &AI);
326 void visitLoadInst(LoadInst &LI);
327 void visitStoreInst(StoreInst &SI);
328 void visitGetElementPtrInst(GetElementPtrInst &GEP);
329 void visitPHINode(PHINode &PN);
330 void visitCastInst(CastInst &CI);
331 void visitSetCondInst(SetCondInst &SCI) {} // NOOP!
332 void visitSelectInst(SelectInst &SI);
333 void visitVAArg(VAArgInst &I);
334 void visitInstruction(Instruction &I);
337 RegisterOpt<Andersens> X("anders-aa",
338 "Andersen's Interprocedural Alias Analysis");
339 RegisterAnalysisGroup<AliasAnalysis, Andersens> Y;
342 ModulePass *llvm::createAndersensPass() { return new Andersens(); }
344 //===----------------------------------------------------------------------===//
345 // AliasAnalysis Interface Implementation
346 //===----------------------------------------------------------------------===//
348 AliasAnalysis::AliasResult Andersens::alias(const Value *V1, unsigned V1Size,
349 const Value *V2, unsigned V2Size) {
350 Node *N1 = getNode(const_cast<Value*>(V1));
351 Node *N2 = getNode(const_cast<Value*>(V2));
353 // Check to see if the two pointers are known to not alias. They don't alias
354 // if their points-to sets do not intersect.
355 if (!N1->intersectsIgnoring(N2, &GraphNodes[NullObject]))
358 return AliasAnalysis::alias(V1, V1Size, V2, V2Size);
361 AliasAnalysis::ModRefResult
362 Andersens::getModRefInfo(CallSite CS, Value *P, unsigned Size) {
363 // The only thing useful that we can contribute for mod/ref information is
364 // when calling external function calls: if we know that memory never escapes
365 // from the program, it cannot be modified by an external call.
367 // NOTE: This is not really safe, at least not when the entire program is not
368 // available. The deal is that the external function could call back into the
369 // program and modify stuff. We ignore this technical niggle for now. This
370 // is, after all, a "research quality" implementation of Andersen's analysis.
371 if (Function *F = CS.getCalledFunction())
372 if (F->isExternal()) {
373 Node *N1 = getNode(P);
374 bool PointsToUniversalSet = false;
376 if (N1->begin() == N1->end())
377 return NoModRef; // P doesn't point to anything.
379 // Get the first pointee.
380 Node *FirstPointee = *N1->begin();
381 if (FirstPointee != &GraphNodes[UniversalSet])
382 return NoModRef; // P doesn't point to the universal set.
385 return AliasAnalysis::getModRefInfo(CS, P, Size);
388 /// getMustAlias - We can provide must alias information if we know that a
389 /// pointer can only point to a specific function or the null pointer.
390 /// Unfortunately we cannot determine must-alias information for global
391 /// variables or any other memory memory objects because we do not track whether
392 /// a pointer points to the beginning of an object or a field of it.
393 void Andersens::getMustAliases(Value *P, std::vector<Value*> &RetVals) {
394 Node *N = getNode(P);
395 Node::iterator I = N->begin();
397 // If there is exactly one element in the points-to set for the object...
400 Node *Pointee = *N->begin();
402 // If a function is the only object in the points-to set, then it must be
403 // the destination. Note that we can't handle global variables here,
404 // because we don't know if the pointer is actually pointing to a field of
405 // the global or to the beginning of it.
406 if (Value *V = Pointee->getValue()) {
407 if (Function *F = dyn_cast<Function>(V))
408 RetVals.push_back(F);
410 // If the object in the points-to set is the null object, then the null
411 // pointer is a must alias.
412 if (Pointee == &GraphNodes[NullObject])
413 RetVals.push_back(Constant::getNullValue(P->getType()));
418 AliasAnalysis::getMustAliases(P, RetVals);
421 /// pointsToConstantMemory - If we can determine that this pointer only points
422 /// to constant memory, return true. In practice, this means that if the
423 /// pointer can only point to constant globals, functions, or the null pointer,
426 bool Andersens::pointsToConstantMemory(const Value *P) {
427 Node *N = getNode((Value*)P);
428 for (Node::iterator I = N->begin(), E = N->end(); I != E; ++I) {
429 if (Value *V = (*I)->getValue()) {
430 if (!isa<GlobalValue>(V) || (isa<GlobalVariable>(V) &&
431 !cast<GlobalVariable>(V)->isConstant()))
432 return AliasAnalysis::pointsToConstantMemory(P);
434 if (*I != &GraphNodes[NullObject])
435 return AliasAnalysis::pointsToConstantMemory(P);
442 //===----------------------------------------------------------------------===//
443 // Object Identification Phase
444 //===----------------------------------------------------------------------===//
446 /// IdentifyObjects - This stage scans the program, adding an entry to the
447 /// GraphNodes list for each memory object in the program (global stack or
448 /// heap), and populates the ValueNodes and ObjectNodes maps for these objects.
450 void Andersens::IdentifyObjects(Module &M) {
451 unsigned NumObjects = 0;
453 // Object #0 is always the universal set: the object that we don't know
455 assert(NumObjects == UniversalSet && "Something changed!");
458 // Object #1 always represents the null pointer.
459 assert(NumObjects == NullPtr && "Something changed!");
462 // Object #2 always represents the null object (the object pointed to by null)
463 assert(NumObjects == NullObject && "Something changed!");
466 // Add all the globals first.
467 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
469 ObjectNodes[I] = NumObjects++;
470 ValueNodes[I] = NumObjects++;
473 // Add nodes for all of the functions and the instructions inside of them.
474 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {
475 // The function itself is a memory object.
476 ValueNodes[F] = NumObjects++;
477 ObjectNodes[F] = NumObjects++;
478 if (isa<PointerType>(F->getFunctionType()->getReturnType()))
479 ReturnNodes[F] = NumObjects++;
480 if (F->getFunctionType()->isVarArg())
481 VarargNodes[F] = NumObjects++;
483 // Add nodes for all of the incoming pointer arguments.
484 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
486 if (isa<PointerType>(I->getType()))
487 ValueNodes[I] = NumObjects++;
489 // Scan the function body, creating a memory object for each heap/stack
490 // allocation in the body of the function and a node to represent all
491 // pointer values defined by instructions and used as operands.
492 for (inst_iterator II = inst_begin(F), E = inst_end(F); II != E; ++II) {
493 // If this is an heap or stack allocation, create a node for the memory
495 if (isa<PointerType>(II->getType())) {
496 ValueNodes[&*II] = NumObjects++;
497 if (AllocationInst *AI = dyn_cast<AllocationInst>(&*II))
498 ObjectNodes[AI] = NumObjects++;
503 // Now that we know how many objects to create, make them all now!
504 GraphNodes.resize(NumObjects);
505 NumNodes += NumObjects;
508 //===----------------------------------------------------------------------===//
509 // Constraint Identification Phase
510 //===----------------------------------------------------------------------===//
512 /// getNodeForConstantPointer - Return the node corresponding to the constant
514 Andersens::Node *Andersens::getNodeForConstantPointer(Constant *C) {
515 assert(isa<PointerType>(C->getType()) && "Not a constant pointer!");
517 if (isa<ConstantPointerNull>(C) || isa<UndefValue>(C))
518 return &GraphNodes[NullPtr];
519 else if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
521 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
522 switch (CE->getOpcode()) {
523 case Instruction::GetElementPtr:
524 return getNodeForConstantPointer(CE->getOperand(0));
525 case Instruction::Cast:
526 if (isa<PointerType>(CE->getOperand(0)->getType()))
527 return getNodeForConstantPointer(CE->getOperand(0));
529 return &GraphNodes[UniversalSet];
531 std::cerr << "Constant Expr not yet handled: " << *CE << "\n";
535 assert(0 && "Unknown constant pointer!");
540 /// getNodeForConstantPointerTarget - Return the node POINTED TO by the
541 /// specified constant pointer.
542 Andersens::Node *Andersens::getNodeForConstantPointerTarget(Constant *C) {
543 assert(isa<PointerType>(C->getType()) && "Not a constant pointer!");
545 if (isa<ConstantPointerNull>(C))
546 return &GraphNodes[NullObject];
547 else if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
548 return getObject(GV);
549 else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
550 switch (CE->getOpcode()) {
551 case Instruction::GetElementPtr:
552 return getNodeForConstantPointerTarget(CE->getOperand(0));
553 case Instruction::Cast:
554 if (isa<PointerType>(CE->getOperand(0)->getType()))
555 return getNodeForConstantPointerTarget(CE->getOperand(0));
557 return &GraphNodes[UniversalSet];
559 std::cerr << "Constant Expr not yet handled: " << *CE << "\n";
563 assert(0 && "Unknown constant pointer!");
568 /// AddGlobalInitializerConstraints - Add inclusion constraints for the memory
569 /// object N, which contains values indicated by C.
570 void Andersens::AddGlobalInitializerConstraints(Node *N, Constant *C) {
571 if (C->getType()->isFirstClassType()) {
572 if (isa<PointerType>(C->getType()))
573 N->copyFrom(getNodeForConstantPointer(C));
575 } else if (C->isNullValue()) {
576 N->addPointerTo(&GraphNodes[NullObject]);
578 } else if (!isa<UndefValue>(C)) {
579 // If this is an array or struct, include constraints for each element.
580 assert(isa<ConstantArray>(C) || isa<ConstantStruct>(C));
581 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i)
582 AddGlobalInitializerConstraints(N, cast<Constant>(C->getOperand(i)));
586 /// AddConstraintsForNonInternalLinkage - If this function does not have
587 /// internal linkage, realize that we can't trust anything passed into or
588 /// returned by this function.
589 void Andersens::AddConstraintsForNonInternalLinkage(Function *F) {
590 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
591 if (isa<PointerType>(I->getType()))
592 // If this is an argument of an externally accessible function, the
593 // incoming pointer might point to anything.
594 Constraints.push_back(Constraint(Constraint::Copy, getNode(I),
595 &GraphNodes[UniversalSet]));
598 /// AddConstraintsForCall - If this is a call to a "known" function, add the
599 /// constraints and return true. If this is a call to an unknown function,
601 bool Andersens::AddConstraintsForExternalCall(CallSite CS, Function *F) {
602 assert(F->isExternal() && "Not an external function!");
604 // These functions don't induce any points-to constraints.
605 if (F->getName() == "atoi" || F->getName() == "atof" ||
606 F->getName() == "atol" || F->getName() == "atoll" ||
607 F->getName() == "remove" || F->getName() == "unlink" ||
608 F->getName() == "rename" || F->getName() == "memcmp" ||
609 F->getName() == "llvm.memset.i32" ||
610 F->getName() == "llvm.memset.i64" ||
611 F->getName() == "strcmp" || F->getName() == "strncmp" ||
612 F->getName() == "execl" || F->getName() == "execlp" ||
613 F->getName() == "execle" || F->getName() == "execv" ||
614 F->getName() == "execvp" || F->getName() == "chmod" ||
615 F->getName() == "puts" || F->getName() == "write" ||
616 F->getName() == "open" || F->getName() == "create" ||
617 F->getName() == "truncate" || F->getName() == "chdir" ||
618 F->getName() == "mkdir" || F->getName() == "rmdir" ||
619 F->getName() == "read" || F->getName() == "pipe" ||
620 F->getName() == "wait" || F->getName() == "time" ||
621 F->getName() == "stat" || F->getName() == "fstat" ||
622 F->getName() == "lstat" || F->getName() == "strtod" ||
623 F->getName() == "strtof" || F->getName() == "strtold" ||
624 F->getName() == "fopen" || F->getName() == "fdopen" ||
625 F->getName() == "freopen" ||
626 F->getName() == "fflush" || F->getName() == "feof" ||
627 F->getName() == "fileno" || F->getName() == "clearerr" ||
628 F->getName() == "rewind" || F->getName() == "ftell" ||
629 F->getName() == "ferror" || F->getName() == "fgetc" ||
630 F->getName() == "fgetc" || F->getName() == "_IO_getc" ||
631 F->getName() == "fwrite" || F->getName() == "fread" ||
632 F->getName() == "fgets" || F->getName() == "ungetc" ||
633 F->getName() == "fputc" ||
634 F->getName() == "fputs" || F->getName() == "putc" ||
635 F->getName() == "ftell" || F->getName() == "rewind" ||
636 F->getName() == "_IO_putc" || F->getName() == "fseek" ||
637 F->getName() == "fgetpos" || F->getName() == "fsetpos" ||
638 F->getName() == "printf" || F->getName() == "fprintf" ||
639 F->getName() == "sprintf" || F->getName() == "vprintf" ||
640 F->getName() == "vfprintf" || F->getName() == "vsprintf" ||
641 F->getName() == "scanf" || F->getName() == "fscanf" ||
642 F->getName() == "sscanf" || F->getName() == "__assert_fail" ||
643 F->getName() == "modf")
647 // These functions do induce points-to edges.
648 if (F->getName() == "llvm.memcpy.i32" || F->getName() == "llvm.memcpy.i64" ||
649 F->getName() == "llvm.memmove.i32" ||F->getName() == "llvm.memmove.i64" ||
650 F->getName() == "memmove") {
651 // Note: this is a poor approximation, this says Dest = Src, instead of
653 Constraints.push_back(Constraint(Constraint::Copy,
654 getNode(CS.getArgument(0)),
655 getNode(CS.getArgument(1))));
660 if (F->getName() == "realloc" || F->getName() == "strchr" ||
661 F->getName() == "strrchr" || F->getName() == "strstr" ||
662 F->getName() == "strtok") {
663 Constraints.push_back(Constraint(Constraint::Copy,
664 getNode(CS.getInstruction()),
665 getNode(CS.getArgument(0))));
674 /// CollectConstraints - This stage scans the program, adding a constraint to
675 /// the Constraints list for each instruction in the program that induces a
676 /// constraint, and setting up the initial points-to graph.
678 void Andersens::CollectConstraints(Module &M) {
679 // First, the universal set points to itself.
680 GraphNodes[UniversalSet].addPointerTo(&GraphNodes[UniversalSet]);
681 //Constraints.push_back(Constraint(Constraint::Load, &GraphNodes[UniversalSet],
682 // &GraphNodes[UniversalSet]));
683 Constraints.push_back(Constraint(Constraint::Store, &GraphNodes[UniversalSet],
684 &GraphNodes[UniversalSet]));
686 // Next, the null pointer points to the null object.
687 GraphNodes[NullPtr].addPointerTo(&GraphNodes[NullObject]);
689 // Next, add any constraints on global variables and their initializers.
690 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
692 // Associate the address of the global object as pointing to the memory for
693 // the global: &G = <G memory>
694 Node *Object = getObject(I);
696 getNodeValue(*I)->addPointerTo(Object);
698 if (I->hasInitializer()) {
699 AddGlobalInitializerConstraints(Object, I->getInitializer());
701 // If it doesn't have an initializer (i.e. it's defined in another
702 // translation unit), it points to the universal set.
703 Constraints.push_back(Constraint(Constraint::Copy, Object,
704 &GraphNodes[UniversalSet]));
708 for (Module::iterator F = M.begin(), E = M.end(); F != E; ++F) {
709 // Make the function address point to the function object.
710 getNodeValue(*F)->addPointerTo(getObject(F)->setValue(F));
712 // Set up the return value node.
713 if (isa<PointerType>(F->getFunctionType()->getReturnType()))
714 getReturnNode(F)->setValue(F);
715 if (F->getFunctionType()->isVarArg())
716 getVarargNode(F)->setValue(F);
718 // Set up incoming argument nodes.
719 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
721 if (isa<PointerType>(I->getType()))
724 if (!F->hasInternalLinkage())
725 AddConstraintsForNonInternalLinkage(F);
727 if (!F->isExternal()) {
728 // Scan the function body, creating a memory object for each heap/stack
729 // allocation in the body of the function and a node to represent all
730 // pointer values defined by instructions and used as operands.
733 // External functions that return pointers return the universal set.
734 if (isa<PointerType>(F->getFunctionType()->getReturnType()))
735 Constraints.push_back(Constraint(Constraint::Copy,
737 &GraphNodes[UniversalSet]));
739 // Any pointers that are passed into the function have the universal set
741 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
743 if (isa<PointerType>(I->getType())) {
744 // Pointers passed into external functions could have anything stored
746 Constraints.push_back(Constraint(Constraint::Store, getNode(I),
747 &GraphNodes[UniversalSet]));
748 // Memory objects passed into external function calls can have the
749 // universal set point to them.
750 Constraints.push_back(Constraint(Constraint::Copy,
751 &GraphNodes[UniversalSet],
755 // If this is an external varargs function, it can also store pointers
756 // into any pointers passed through the varargs section.
757 if (F->getFunctionType()->isVarArg())
758 Constraints.push_back(Constraint(Constraint::Store, getVarargNode(F),
759 &GraphNodes[UniversalSet]));
762 NumConstraints += Constraints.size();
766 void Andersens::visitInstruction(Instruction &I) {
768 return; // This function is just a big assert.
770 if (isa<BinaryOperator>(I))
772 // Most instructions don't have any effect on pointer values.
773 switch (I.getOpcode()) {
774 case Instruction::Br:
775 case Instruction::Switch:
776 case Instruction::Unwind:
777 case Instruction::Unreachable:
778 case Instruction::Free:
779 case Instruction::Shl:
780 case Instruction::Shr:
783 // Is this something we aren't handling yet?
784 std::cerr << "Unknown instruction: " << I;
789 void Andersens::visitAllocationInst(AllocationInst &AI) {
790 getNodeValue(AI)->addPointerTo(getObject(&AI)->setValue(&AI));
793 void Andersens::visitReturnInst(ReturnInst &RI) {
794 if (RI.getNumOperands() && isa<PointerType>(RI.getOperand(0)->getType()))
795 // return V --> <Copy/retval{F}/v>
796 Constraints.push_back(Constraint(Constraint::Copy,
797 getReturnNode(RI.getParent()->getParent()),
798 getNode(RI.getOperand(0))));
801 void Andersens::visitLoadInst(LoadInst &LI) {
802 if (isa<PointerType>(LI.getType()))
803 // P1 = load P2 --> <Load/P1/P2>
804 Constraints.push_back(Constraint(Constraint::Load, getNodeValue(LI),
805 getNode(LI.getOperand(0))));
808 void Andersens::visitStoreInst(StoreInst &SI) {
809 if (isa<PointerType>(SI.getOperand(0)->getType()))
810 // store P1, P2 --> <Store/P2/P1>
811 Constraints.push_back(Constraint(Constraint::Store,
812 getNode(SI.getOperand(1)),
813 getNode(SI.getOperand(0))));
816 void Andersens::visitGetElementPtrInst(GetElementPtrInst &GEP) {
817 // P1 = getelementptr P2, ... --> <Copy/P1/P2>
818 Constraints.push_back(Constraint(Constraint::Copy, getNodeValue(GEP),
819 getNode(GEP.getOperand(0))));
822 void Andersens::visitPHINode(PHINode &PN) {
823 if (isa<PointerType>(PN.getType())) {
824 Node *PNN = getNodeValue(PN);
825 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
826 // P1 = phi P2, P3 --> <Copy/P1/P2>, <Copy/P1/P3>, ...
827 Constraints.push_back(Constraint(Constraint::Copy, PNN,
828 getNode(PN.getIncomingValue(i))));
832 void Andersens::visitCastInst(CastInst &CI) {
833 Value *Op = CI.getOperand(0);
834 if (isa<PointerType>(CI.getType())) {
835 if (isa<PointerType>(Op->getType())) {
836 // P1 = cast P2 --> <Copy/P1/P2>
837 Constraints.push_back(Constraint(Constraint::Copy, getNodeValue(CI),
838 getNode(CI.getOperand(0))));
840 // P1 = cast int --> <Copy/P1/Univ>
842 Constraints.push_back(Constraint(Constraint::Copy, getNodeValue(CI),
843 &GraphNodes[UniversalSet]));
848 } else if (isa<PointerType>(Op->getType())) {
849 // int = cast P1 --> <Copy/Univ/P1>
851 Constraints.push_back(Constraint(Constraint::Copy,
852 &GraphNodes[UniversalSet],
853 getNode(CI.getOperand(0))));
855 getNode(CI.getOperand(0));
860 void Andersens::visitSelectInst(SelectInst &SI) {
861 if (isa<PointerType>(SI.getType())) {
862 Node *SIN = getNodeValue(SI);
863 // P1 = select C, P2, P3 ---> <Copy/P1/P2>, <Copy/P1/P3>
864 Constraints.push_back(Constraint(Constraint::Copy, SIN,
865 getNode(SI.getOperand(1))));
866 Constraints.push_back(Constraint(Constraint::Copy, SIN,
867 getNode(SI.getOperand(2))));
871 void Andersens::visitVAArg(VAArgInst &I) {
872 assert(0 && "vaarg not handled yet!");
875 /// AddConstraintsForCall - Add constraints for a call with actual arguments
876 /// specified by CS to the function specified by F. Note that the types of
877 /// arguments might not match up in the case where this is an indirect call and
878 /// the function pointer has been casted. If this is the case, do something
880 void Andersens::AddConstraintsForCall(CallSite CS, Function *F) {
881 // If this is a call to an external function, handle it directly to get some
882 // taste of context sensitivity.
883 if (F->isExternal() && AddConstraintsForExternalCall(CS, F))
886 if (isa<PointerType>(CS.getType())) {
887 Node *CSN = getNode(CS.getInstruction());
888 if (isa<PointerType>(F->getFunctionType()->getReturnType())) {
889 Constraints.push_back(Constraint(Constraint::Copy, CSN,
892 // If the function returns a non-pointer value, handle this just like we
893 // treat a nonpointer cast to pointer.
894 Constraints.push_back(Constraint(Constraint::Copy, CSN,
895 &GraphNodes[UniversalSet]));
897 } else if (isa<PointerType>(F->getFunctionType()->getReturnType())) {
898 Constraints.push_back(Constraint(Constraint::Copy,
899 &GraphNodes[UniversalSet],
903 Function::arg_iterator AI = F->arg_begin(), AE = F->arg_end();
904 CallSite::arg_iterator ArgI = CS.arg_begin(), ArgE = CS.arg_end();
905 for (; AI != AE && ArgI != ArgE; ++AI, ++ArgI)
906 if (isa<PointerType>(AI->getType())) {
907 if (isa<PointerType>((*ArgI)->getType())) {
908 // Copy the actual argument into the formal argument.
909 Constraints.push_back(Constraint(Constraint::Copy, getNode(AI),
912 Constraints.push_back(Constraint(Constraint::Copy, getNode(AI),
913 &GraphNodes[UniversalSet]));
915 } else if (isa<PointerType>((*ArgI)->getType())) {
916 Constraints.push_back(Constraint(Constraint::Copy,
917 &GraphNodes[UniversalSet],
921 // Copy all pointers passed through the varargs section to the varargs node.
922 if (F->getFunctionType()->isVarArg())
923 for (; ArgI != ArgE; ++ArgI)
924 if (isa<PointerType>((*ArgI)->getType()))
925 Constraints.push_back(Constraint(Constraint::Copy, getVarargNode(F),
927 // If more arguments are passed in than we track, just drop them on the floor.
930 void Andersens::visitCallSite(CallSite CS) {
931 if (isa<PointerType>(CS.getType()))
932 getNodeValue(*CS.getInstruction());
934 if (Function *F = CS.getCalledFunction()) {
935 AddConstraintsForCall(CS, F);
937 // We don't handle indirect call sites yet. Keep track of them for when we
938 // discover the call graph incrementally.
939 IndirectCalls.push_back(CS);
943 //===----------------------------------------------------------------------===//
944 // Constraint Solving Phase
945 //===----------------------------------------------------------------------===//
947 /// intersects - Return true if the points-to set of this node intersects
948 /// with the points-to set of the specified node.
949 bool Andersens::Node::intersects(Node *N) const {
950 iterator I1 = begin(), I2 = N->begin(), E1 = end(), E2 = N->end();
951 while (I1 != E1 && I2 != E2) {
952 if (*I1 == *I2) return true;
961 /// intersectsIgnoring - Return true if the points-to set of this node
962 /// intersects with the points-to set of the specified node on any nodes
963 /// except for the specified node to ignore.
964 bool Andersens::Node::intersectsIgnoring(Node *N, Node *Ignoring) const {
965 iterator I1 = begin(), I2 = N->begin(), E1 = end(), E2 = N->end();
966 while (I1 != E1 && I2 != E2) {
968 if (*I1 != Ignoring) return true;
970 } else if (*I1 < *I2)
978 // Copy constraint: all edges out of the source node get copied to the
979 // destination node. This returns true if a change is made.
980 bool Andersens::Node::copyFrom(Node *N) {
981 // Use a mostly linear-time merge since both of the lists are sorted.
982 bool Changed = false;
983 iterator I = N->begin(), E = N->end();
985 while (I != E && i != Pointees.size()) {
986 if (Pointees[i] < *I) {
988 } else if (Pointees[i] == *I) {
991 // We found a new element to copy over.
993 Pointees.insert(Pointees.begin()+i, *I);
999 Pointees.insert(Pointees.end(), I, E);
1006 bool Andersens::Node::loadFrom(Node *N) {
1007 bool Changed = false;
1008 for (iterator I = N->begin(), E = N->end(); I != E; ++I)
1009 Changed |= copyFrom(*I);
1013 bool Andersens::Node::storeThrough(Node *N) {
1014 bool Changed = false;
1015 for (iterator I = begin(), E = end(); I != E; ++I)
1016 Changed |= (*I)->copyFrom(N);
1021 /// SolveConstraints - This stage iteratively processes the constraints list
1022 /// propagating constraints (adding edges to the Nodes in the points-to graph)
1023 /// until a fixed point is reached.
1025 void Andersens::SolveConstraints() {
1026 bool Changed = true;
1027 unsigned Iteration = 0;
1031 DEBUG(std::cerr << "Starting iteration #" << Iteration++ << "!\n");
1033 // Loop over all of the constraints, applying them in turn.
1034 for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
1035 Constraint &C = Constraints[i];
1037 case Constraint::Copy:
1038 Changed |= C.Dest->copyFrom(C.Src);
1040 case Constraint::Load:
1041 Changed |= C.Dest->loadFrom(C.Src);
1043 case Constraint::Store:
1044 Changed |= C.Dest->storeThrough(C.Src);
1047 assert(0 && "Unknown constraint!");
1052 // Check to see if any internal function's addresses have been passed to
1053 // external functions. If so, we have to assume that their incoming
1054 // arguments could be anything. If there are any internal functions in
1055 // the universal node that we don't know about, we must iterate.
1056 for (Node::iterator I = GraphNodes[UniversalSet].begin(),
1057 E = GraphNodes[UniversalSet].end(); I != E; ++I)
1058 if (Function *F = dyn_cast_or_null<Function>((*I)->getValue()))
1059 if (F->hasInternalLinkage() &&
1060 EscapingInternalFunctions.insert(F).second) {
1061 // We found a function that is just now escaping. Mark it as if it
1062 // didn't have internal linkage.
1063 AddConstraintsForNonInternalLinkage(F);
1064 DEBUG(std::cerr << "Found escaping internal function: "
1065 << F->getName() << "\n");
1066 ++NumEscapingFunctions;
1069 // Check to see if we have discovered any new callees of the indirect call
1070 // sites. If so, add constraints to the analysis.
1071 for (unsigned i = 0, e = IndirectCalls.size(); i != e; ++i) {
1072 CallSite CS = IndirectCalls[i];
1073 std::vector<Function*> &KnownCallees = IndirectCallees[CS];
1074 Node *CN = getNode(CS.getCalledValue());
1076 for (Node::iterator NI = CN->begin(), E = CN->end(); NI != E; ++NI)
1077 if (Function *F = dyn_cast_or_null<Function>((*NI)->getValue())) {
1078 std::vector<Function*>::iterator IP =
1079 std::lower_bound(KnownCallees.begin(), KnownCallees.end(), F);
1080 if (IP == KnownCallees.end() || *IP != F) {
1081 // Add the constraints for the call now.
1082 AddConstraintsForCall(CS, F);
1083 DEBUG(std::cerr << "Found actual callee '"
1084 << F->getName() << "' for call: "
1085 << *CS.getInstruction() << "\n");
1086 ++NumIndirectCallees;
1087 KnownCallees.insert(IP, F);
1097 //===----------------------------------------------------------------------===//
1099 //===----------------------------------------------------------------------===//
1101 void Andersens::PrintNode(Node *N) {
1102 if (N == &GraphNodes[UniversalSet]) {
1103 std::cerr << "<universal>";
1105 } else if (N == &GraphNodes[NullPtr]) {
1106 std::cerr << "<nullptr>";
1108 } else if (N == &GraphNodes[NullObject]) {
1109 std::cerr << "<null>";
1113 assert(N->getValue() != 0 && "Never set node label!");
1114 Value *V = N->getValue();
1115 if (Function *F = dyn_cast<Function>(V)) {
1116 if (isa<PointerType>(F->getFunctionType()->getReturnType()) &&
1117 N == getReturnNode(F)) {
1118 std::cerr << F->getName() << ":retval";
1120 } else if (F->getFunctionType()->isVarArg() && N == getVarargNode(F)) {
1121 std::cerr << F->getName() << ":vararg";
1126 if (Instruction *I = dyn_cast<Instruction>(V))
1127 std::cerr << I->getParent()->getParent()->getName() << ":";
1128 else if (Argument *Arg = dyn_cast<Argument>(V))
1129 std::cerr << Arg->getParent()->getName() << ":";
1132 std::cerr << V->getName();
1134 std::cerr << "(unnamed)";
1136 if (isa<GlobalValue>(V) || isa<AllocationInst>(V))
1137 if (N == getObject(V))
1138 std::cerr << "<mem>";
1141 void Andersens::PrintConstraints() {
1142 std::cerr << "Constraints:\n";
1143 for (unsigned i = 0, e = Constraints.size(); i != e; ++i) {
1144 std::cerr << " #" << i << ": ";
1145 Constraint &C = Constraints[i];
1146 if (C.Type == Constraint::Store)
1150 if (C.Type == Constraint::Load)
1157 void Andersens::PrintPointsToGraph() {
1158 std::cerr << "Points-to graph:\n";
1159 for (unsigned i = 0, e = GraphNodes.size(); i != e; ++i) {
1160 Node *N = &GraphNodes[i];
1161 std::cerr << "[" << (N->end() - N->begin()) << "] ";
1163 std::cerr << "\t--> ";
1164 for (Node::iterator I = N->begin(), E = N->end(); I != E; ++I) {
1165 if (I != N->begin()) std::cerr << ", ";