blob: f30ea43096d242974dd5505885b88be359b2ebed [file] [log] [blame]
Chris Lattner4fdb75f2003-02-06 21:29:49 +00001//===- AliasAnalysisEvaluator.cpp - Alias Analysis Accuracy Evaluator -----===//
John Criswell482202a2003-10-20 19:43:21 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
Chris Lattner4fdb75f2003-02-06 21:29:49 +00009//
10// This file implements a simple N^2 alias analysis accuracy evaluator.
11// Basically, for each function in the program, it simply queries to see how the
12// alias analysis implementation answers alias queries between each pair of
13// pointers in the function.
14//
15// This is inspired and adapted from code by: Naveen Neelakantam, Francesco
16// Spadini, and Wojciech Stryjewski.
17//
18//===----------------------------------------------------------------------===//
19
Chris Lattner4fdb75f2003-02-06 21:29:49 +000020#include "llvm/Function.h"
Misha Brukmanbf28cf62004-03-12 06:15:08 +000021#include "llvm/iOther.h"
22#include "llvm/iTerminators.h"
23#include "llvm/Pass.h"
Chris Lattner4fdb75f2003-02-06 21:29:49 +000024#include "llvm/Type.h"
Misha Brukmanbf28cf62004-03-12 06:15:08 +000025#include "llvm/Analysis/AliasAnalysis.h"
Chris Lattnerb0208e12003-02-09 20:40:13 +000026#include "llvm/Assembly/Writer.h"
Misha Brukmanbf28cf62004-03-12 06:15:08 +000027#include "llvm/Support/InstIterator.h"
Chris Lattnerb0208e12003-02-09 20:40:13 +000028#include "Support/CommandLine.h"
Reid Spencereb04d9b2004-07-04 12:19:56 +000029#include <iostream>
Chris Lattner83e21a02003-06-29 00:07:11 +000030#include <set>
Reid Spencereb04d9b2004-07-04 12:19:56 +000031
Chris Lattner8dee8412003-12-10 15:33:59 +000032using namespace llvm;
Brian Gaeke960707c2003-11-11 22:41:34 +000033
Chris Lattner4fdb75f2003-02-06 21:29:49 +000034namespace {
Chris Lattnereed1a6f2004-07-17 06:28:49 +000035 cl::opt<bool> PrintAll("print-all-alias-modref-info", cl::ReallyHidden);
36
Misha Brukmanbf28cf62004-03-12 06:15:08 +000037 cl::opt<bool> PrintNoAlias("print-no-aliases", cl::ReallyHidden);
38 cl::opt<bool> PrintMayAlias("print-may-aliases", cl::ReallyHidden);
39 cl::opt<bool> PrintMustAlias("print-must-aliases", cl::ReallyHidden);
40
41 cl::opt<bool> PrintNoModRef("print-no-modref", cl::ReallyHidden);
42 cl::opt<bool> PrintMod("print-mod", cl::ReallyHidden);
43 cl::opt<bool> PrintRef("print-ref", cl::ReallyHidden);
44 cl::opt<bool> PrintModRef("print-modref", cl::ReallyHidden);
Chris Lattnerb0208e12003-02-09 20:40:13 +000045
Chris Lattner4fdb75f2003-02-06 21:29:49 +000046 class AAEval : public FunctionPass {
Misha Brukmanbf28cf62004-03-12 06:15:08 +000047 unsigned NoAlias, MayAlias, MustAlias;
48 unsigned NoModRef, Mod, Ref, ModRef;
Chris Lattner4fdb75f2003-02-06 21:29:49 +000049
50 public:
51 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
52 AU.addRequired<AliasAnalysis>();
53 AU.setPreservesAll();
54 }
55
Misha Brukmanbf28cf62004-03-12 06:15:08 +000056 bool doInitialization(Module &M) {
57 NoAlias = MayAlias = MustAlias = 0;
58 NoModRef = Mod = Ref = ModRef = 0;
Chris Lattnereed1a6f2004-07-17 06:28:49 +000059
60 if (PrintAll) {
61 PrintNoAlias = PrintMayAlias = PrintMustAlias = true;
62 PrintNoModRef = PrintMod = PrintRef = PrintModRef = true;
63 }
Misha Brukmanbf28cf62004-03-12 06:15:08 +000064 return false;
65 }
66
Chris Lattner4fdb75f2003-02-06 21:29:49 +000067 bool runOnFunction(Function &F);
68 bool doFinalization(Module &M);
69 };
70
71 RegisterOpt<AAEval>
72 X("aa-eval", "Exhaustive Alias Analysis Precision Evaluator");
73}
74
Chris Lattner8dee8412003-12-10 15:33:59 +000075static inline void PrintResults(const char *Msg, bool P, Value *V1, Value *V2,
76 Module *M) {
Chris Lattnerb0208e12003-02-09 20:40:13 +000077 if (P) {
78 std::cerr << " " << Msg << ":\t";
Chris Lattner8dee8412003-12-10 15:33:59 +000079 WriteAsOperand(std::cerr, V1, true, true, M) << ", ";
80 WriteAsOperand(std::cerr, V2, true, true, M) << "\n";
Chris Lattnerb0208e12003-02-09 20:40:13 +000081 }
82}
83
Chris Lattner4fdb75f2003-02-06 21:29:49 +000084bool AAEval::runOnFunction(Function &F) {
85 AliasAnalysis &AA = getAnalysis<AliasAnalysis>();
86
Chris Lattner83e21a02003-06-29 00:07:11 +000087 std::set<Value *> Pointers;
Misha Brukmanbf28cf62004-03-12 06:15:08 +000088 std::set<CallSite> CallSites;
Chris Lattner4fdb75f2003-02-06 21:29:49 +000089
90 for (Function::aiterator I = F.abegin(), E = F.aend(); I != E; ++I)
91 if (isa<PointerType>(I->getType())) // Add all pointer arguments
Chris Lattner83e21a02003-06-29 00:07:11 +000092 Pointers.insert(I);
Chris Lattner4fdb75f2003-02-06 21:29:49 +000093
Chris Lattner83e21a02003-06-29 00:07:11 +000094 for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I) {
Chris Lattner2d3a7a62004-04-27 15:13:33 +000095 if (isa<PointerType>(I->getType())) // Add all pointer instructions
96 Pointers.insert(&*I);
97 for (User::op_iterator OI = (*I).op_begin(); OI != (*I).op_end(); ++OI)
Chris Lattner83e21a02003-06-29 00:07:11 +000098 if (isa<PointerType>((*OI)->getType()))
99 Pointers.insert(*OI);
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000100
Chris Lattner2d3a7a62004-04-27 15:13:33 +0000101 CallSite CS = CallSite::get(&*I);
Misha Brukman4483c9b2004-03-12 16:20:49 +0000102 if (CS.getInstruction()) CallSites.insert(CS);
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000103 }
104
105 if (PrintNoAlias || PrintMayAlias || PrintMustAlias ||
106 PrintNoModRef || PrintMod || PrintRef || PrintModRef)
Chris Lattnereed1a6f2004-07-17 06:28:49 +0000107 std::cerr << "Function: " << F.getName() << ": " << Pointers.size()
108 << " pointers, " << CallSites.size() << " call sites\n";
Chris Lattnerb0208e12003-02-09 20:40:13 +0000109
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000110 // iterate over the worklist, and run the full (n^2)/2 disambiguations
Chris Lattner83e21a02003-06-29 00:07:11 +0000111 for (std::set<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end();
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000112 I1 != E; ++I1)
Chris Lattner83e21a02003-06-29 00:07:11 +0000113 for (std::set<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2)
Chris Lattner13082d62003-02-26 19:29:16 +0000114 switch (AA.alias(*I1, 0, *I2, 0)) {
Chris Lattnerb0208e12003-02-09 20:40:13 +0000115 case AliasAnalysis::NoAlias:
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000116 PrintResults("NoAlias", PrintNoAlias, *I1, *I2, F.getParent());
117 ++NoAlias; break;
Chris Lattnerb0208e12003-02-09 20:40:13 +0000118 case AliasAnalysis::MayAlias:
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000119 PrintResults("MayAlias", PrintMayAlias, *I1, *I2, F.getParent());
120 ++MayAlias; break;
Chris Lattnerb0208e12003-02-09 20:40:13 +0000121 case AliasAnalysis::MustAlias:
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000122 PrintResults("MustAlias", PrintMustAlias, *I1, *I2, F.getParent());
123 ++MustAlias; break;
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000124 default:
125 std::cerr << "Unknown alias query result!\n";
126 }
127
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000128 // Mod/ref alias analysis: compare all pairs of calls and values
129 for (std::set<Value *>::iterator V = Pointers.begin(), Ve = Pointers.end();
130 V != Ve; ++V)
131 for (std::set<CallSite>::iterator C = CallSites.begin(),
132 Ce = CallSites.end(); C != Ce; ++C) {
133 Instruction *I = C->getInstruction();
134 switch (AA.getModRefInfo(*C, *V, (*V)->getType()->getPrimitiveSize())) {
135 case AliasAnalysis::NoModRef:
136 PrintResults("NoModRef", PrintNoModRef, I, *V, F.getParent());
137 ++NoModRef; break;
138 case AliasAnalysis::Mod:
139 PrintResults("Mod", PrintMod, I, *V, F.getParent());
140 ++Mod; break;
141 case AliasAnalysis::Ref:
142 PrintResults("Ref", PrintRef, I, *V, F.getParent());
143 ++Ref; break;
144 case AliasAnalysis::ModRef:
145 PrintResults("ModRef", PrintModRef, I, *V, F.getParent());
146 ++ModRef; break;
147 default:
148 std::cerr << "Unknown alias query result!\n";
149 }
150 }
151
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000152 return false;
153}
154
155bool AAEval::doFinalization(Module &M) {
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000156 unsigned AliasSum = NoAlias + MayAlias + MustAlias;
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000157 std::cerr << "===== Alias Analysis Evaluator Report =====\n";
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000158 if (AliasSum == 0) {
Chris Lattnereadcadc2003-02-08 23:04:50 +0000159 std::cerr << " Alias Analysis Evaluator Summary: No pointers!\n";
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000160 } else {
161 std::cerr << " " << AliasSum << " Total Alias Queries Performed\n";
162 std::cerr << " " << NoAlias << " no alias responses ("
163 << NoAlias*100/AliasSum << "%)\n";
164 std::cerr << " " << MayAlias << " may alias responses ("
165 << MayAlias*100/AliasSum << "%)\n";
166 std::cerr << " " << MustAlias << " must alias responses ("
167 << MustAlias*100/AliasSum <<"%)\n";
168 std::cerr << " Alias Analysis Evaluator Pointer Alias Summary: "
169 << NoAlias*100/AliasSum << "%/" << MayAlias*100/AliasSum << "%/"
170 << MustAlias*100/AliasSum << "%\n";
Chris Lattnereadcadc2003-02-08 23:04:50 +0000171 }
172
Misha Brukmanbf28cf62004-03-12 06:15:08 +0000173 // Display the summary for mod/ref analysis
174 unsigned ModRefSum = NoModRef + Mod + Ref + ModRef;
175 if (ModRefSum == 0) {
176 std::cerr << " Alias Analysis Mod/Ref Evaluator Summary: no mod/ref!\n";
177 } else {
178 std::cerr << " " << ModRefSum << " Total ModRef Queries Performed\n";
179 std::cerr << " " << NoModRef << " no mod/ref responses ("
180 << NoModRef*100/ModRefSum << "%)\n";
181 std::cerr << " " << Mod << " mod responses ("
182 << Mod*100/ModRefSum << "%)\n";
183 std::cerr << " " << Ref << " ref responses ("
184 << Ref*100/ModRefSum <<"%)\n";
185 std::cerr << " " << ModRef << " mod & ref responses ("
186 << ModRef*100/ModRefSum <<"%)\n";
187 std::cerr << " Alias Analysis Evaluator Mod/Ref Summary: "
188 << NoModRef*100/ModRefSum << "%/" << Mod*100/ModRefSum << "%/"
189 << Ref*100/ModRefSum << "%/" << ModRef*100/ModRefSum << "%\n";
190 }
191
Chris Lattner4fdb75f2003-02-06 21:29:49 +0000192 return false;
193}