Path: blob/main/contrib/llvm-project/llvm/lib/Analysis/AliasAnalysisEvaluator.cpp
35233 views
//===- AliasAnalysisEvaluator.cpp - Alias Analysis Accuracy Evaluator -----===//1//2// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.3// See https://llvm.org/LICENSE.txt for license information.4// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception5//6//===----------------------------------------------------------------------===//78#include "llvm/Analysis/AliasAnalysisEvaluator.h"9#include "llvm/ADT/SetVector.h"10#include "llvm/Analysis/AliasAnalysis.h"11#include "llvm/IR/DataLayout.h"12#include "llvm/IR/Function.h"13#include "llvm/IR/InstIterator.h"14#include "llvm/IR/Instructions.h"15#include "llvm/IR/Module.h"16#include "llvm/Support/CommandLine.h"17#include "llvm/Support/raw_ostream.h"18using namespace llvm;1920static cl::opt<bool> PrintAll("print-all-alias-modref-info", cl::ReallyHidden);2122static cl::opt<bool> PrintNoAlias("print-no-aliases", cl::ReallyHidden);23static cl::opt<bool> PrintMayAlias("print-may-aliases", cl::ReallyHidden);24static cl::opt<bool> PrintPartialAlias("print-partial-aliases", cl::ReallyHidden);25static cl::opt<bool> PrintMustAlias("print-must-aliases", cl::ReallyHidden);2627static cl::opt<bool> PrintNoModRef("print-no-modref", cl::ReallyHidden);28static cl::opt<bool> PrintRef("print-ref", cl::ReallyHidden);29static cl::opt<bool> PrintMod("print-mod", cl::ReallyHidden);30static cl::opt<bool> PrintModRef("print-modref", cl::ReallyHidden);3132static cl::opt<bool> EvalAAMD("evaluate-aa-metadata", cl::ReallyHidden);3334static void PrintResults(AliasResult AR, bool P,35std::pair<const Value *, Type *> Loc1,36std::pair<const Value *, Type *> Loc2,37const Module *M) {38if (PrintAll || P) {39Type *Ty1 = Loc1.second, *Ty2 = Loc2.second;40unsigned AS1 = Loc1.first->getType()->getPointerAddressSpace();41unsigned AS2 = Loc2.first->getType()->getPointerAddressSpace();42std::string o1, o2;43{44raw_string_ostream os1(o1), os2(o2);45Loc1.first->printAsOperand(os1, false, M);46Loc2.first->printAsOperand(os2, false, M);47}4849if (o2 < o1) {50std::swap(o1, o2);51std::swap(Ty1, Ty2);52std::swap(AS1, AS2);53// Change offset sign for the local AR, for printing only.54AR.swap();55}56errs() << " " << AR << ":\t";57Ty1->print(errs(), false, /* NoDetails */ true);58if (AS1 != 0)59errs() << " addrspace(" << AS1 << ")";60errs() << "* " << o1 << ", ";61Ty2->print(errs(), false, /* NoDetails */ true);62if (AS2 != 0)63errs() << " addrspace(" << AS2 << ")";64errs() << "* " << o2 << "\n";65}66}6768static inline void PrintModRefResults(69const char *Msg, bool P, Instruction *I,70std::pair<const Value *, Type *> Loc, Module *M) {71if (PrintAll || P) {72errs() << " " << Msg << ": Ptr: ";73Loc.second->print(errs(), false, /* NoDetails */ true);74errs() << "* ";75Loc.first->printAsOperand(errs(), false, M);76errs() << "\t<->" << *I << '\n';77}78}7980static inline void PrintModRefResults(const char *Msg, bool P, CallBase *CallA,81CallBase *CallB, Module *M) {82if (PrintAll || P) {83errs() << " " << Msg << ": " << *CallA << " <-> " << *CallB << '\n';84}85}8687static inline void PrintLoadStoreResults(AliasResult AR, bool P,88const Value *V1, const Value *V2,89const Module *M) {90if (PrintAll || P) {91errs() << " " << AR << ": " << *V1 << " <-> " << *V2 << '\n';92}93}9495PreservedAnalyses AAEvaluator::run(Function &F, FunctionAnalysisManager &AM) {96runInternal(F, AM.getResult<AAManager>(F));97return PreservedAnalyses::all();98}99100void AAEvaluator::runInternal(Function &F, AAResults &AA) {101const DataLayout &DL = F.getDataLayout();102103++FunctionCount;104105SetVector<std::pair<const Value *, Type *>> Pointers;106SmallSetVector<CallBase *, 16> Calls;107SetVector<Value *> Loads;108SetVector<Value *> Stores;109110for (Instruction &Inst : instructions(F)) {111if (auto *LI = dyn_cast<LoadInst>(&Inst)) {112Pointers.insert({LI->getPointerOperand(), LI->getType()});113Loads.insert(LI);114} else if (auto *SI = dyn_cast<StoreInst>(&Inst)) {115Pointers.insert({SI->getPointerOperand(),116SI->getValueOperand()->getType()});117Stores.insert(SI);118} else if (auto *CB = dyn_cast<CallBase>(&Inst))119Calls.insert(CB);120}121122if (PrintAll || PrintNoAlias || PrintMayAlias || PrintPartialAlias ||123PrintMustAlias || PrintNoModRef || PrintMod || PrintRef || PrintModRef)124errs() << "Function: " << F.getName() << ": " << Pointers.size()125<< " pointers, " << Calls.size() << " call sites\n";126127// iterate over the worklist, and run the full (n^2)/2 disambiguations128for (auto I1 = Pointers.begin(), E = Pointers.end(); I1 != E; ++I1) {129LocationSize Size1 = LocationSize::precise(DL.getTypeStoreSize(I1->second));130for (auto I2 = Pointers.begin(); I2 != I1; ++I2) {131LocationSize Size2 =132LocationSize::precise(DL.getTypeStoreSize(I2->second));133AliasResult AR = AA.alias(I1->first, Size1, I2->first, Size2);134switch (AR) {135case AliasResult::NoAlias:136PrintResults(AR, PrintNoAlias, *I1, *I2, F.getParent());137++NoAliasCount;138break;139case AliasResult::MayAlias:140PrintResults(AR, PrintMayAlias, *I1, *I2, F.getParent());141++MayAliasCount;142break;143case AliasResult::PartialAlias:144PrintResults(AR, PrintPartialAlias, *I1, *I2, F.getParent());145++PartialAliasCount;146break;147case AliasResult::MustAlias:148PrintResults(AR, PrintMustAlias, *I1, *I2, F.getParent());149++MustAliasCount;150break;151}152}153}154155if (EvalAAMD) {156// iterate over all pairs of load, store157for (Value *Load : Loads) {158for (Value *Store : Stores) {159AliasResult AR = AA.alias(MemoryLocation::get(cast<LoadInst>(Load)),160MemoryLocation::get(cast<StoreInst>(Store)));161switch (AR) {162case AliasResult::NoAlias:163PrintLoadStoreResults(AR, PrintNoAlias, Load, Store, F.getParent());164++NoAliasCount;165break;166case AliasResult::MayAlias:167PrintLoadStoreResults(AR, PrintMayAlias, Load, Store, F.getParent());168++MayAliasCount;169break;170case AliasResult::PartialAlias:171PrintLoadStoreResults(AR, PrintPartialAlias, Load, Store, F.getParent());172++PartialAliasCount;173break;174case AliasResult::MustAlias:175PrintLoadStoreResults(AR, PrintMustAlias, Load, Store, F.getParent());176++MustAliasCount;177break;178}179}180}181182// iterate over all pairs of store, store183for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end();184I1 != E; ++I1) {185for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) {186AliasResult AR = AA.alias(MemoryLocation::get(cast<StoreInst>(*I1)),187MemoryLocation::get(cast<StoreInst>(*I2)));188switch (AR) {189case AliasResult::NoAlias:190PrintLoadStoreResults(AR, PrintNoAlias, *I1, *I2, F.getParent());191++NoAliasCount;192break;193case AliasResult::MayAlias:194PrintLoadStoreResults(AR, PrintMayAlias, *I1, *I2, F.getParent());195++MayAliasCount;196break;197case AliasResult::PartialAlias:198PrintLoadStoreResults(AR, PrintPartialAlias, *I1, *I2, F.getParent());199++PartialAliasCount;200break;201case AliasResult::MustAlias:202PrintLoadStoreResults(AR, PrintMustAlias, *I1, *I2, F.getParent());203++MustAliasCount;204break;205}206}207}208}209210// Mod/ref alias analysis: compare all pairs of calls and values211for (CallBase *Call : Calls) {212for (const auto &Pointer : Pointers) {213LocationSize Size =214LocationSize::precise(DL.getTypeStoreSize(Pointer.second));215switch (AA.getModRefInfo(Call, Pointer.first, Size)) {216case ModRefInfo::NoModRef:217PrintModRefResults("NoModRef", PrintNoModRef, Call, Pointer,218F.getParent());219++NoModRefCount;220break;221case ModRefInfo::Mod:222PrintModRefResults("Just Mod", PrintMod, Call, Pointer, F.getParent());223++ModCount;224break;225case ModRefInfo::Ref:226PrintModRefResults("Just Ref", PrintRef, Call, Pointer, F.getParent());227++RefCount;228break;229case ModRefInfo::ModRef:230PrintModRefResults("Both ModRef", PrintModRef, Call, Pointer,231F.getParent());232++ModRefCount;233break;234}235}236}237238// Mod/ref alias analysis: compare all pairs of calls239for (CallBase *CallA : Calls) {240for (CallBase *CallB : Calls) {241if (CallA == CallB)242continue;243switch (AA.getModRefInfo(CallA, CallB)) {244case ModRefInfo::NoModRef:245PrintModRefResults("NoModRef", PrintNoModRef, CallA, CallB,246F.getParent());247++NoModRefCount;248break;249case ModRefInfo::Mod:250PrintModRefResults("Just Mod", PrintMod, CallA, CallB, F.getParent());251++ModCount;252break;253case ModRefInfo::Ref:254PrintModRefResults("Just Ref", PrintRef, CallA, CallB, F.getParent());255++RefCount;256break;257case ModRefInfo::ModRef:258PrintModRefResults("Both ModRef", PrintModRef, CallA, CallB,259F.getParent());260++ModRefCount;261break;262}263}264}265}266267static void PrintPercent(int64_t Num, int64_t Sum) {268errs() << "(" << Num * 100LL / Sum << "." << ((Num * 1000LL / Sum) % 10)269<< "%)\n";270}271272AAEvaluator::~AAEvaluator() {273if (FunctionCount == 0)274return;275276int64_t AliasSum =277NoAliasCount + MayAliasCount + PartialAliasCount + MustAliasCount;278errs() << "===== Alias Analysis Evaluator Report =====\n";279if (AliasSum == 0) {280errs() << " Alias Analysis Evaluator Summary: No pointers!\n";281} else {282errs() << " " << AliasSum << " Total Alias Queries Performed\n";283errs() << " " << NoAliasCount << " no alias responses ";284PrintPercent(NoAliasCount, AliasSum);285errs() << " " << MayAliasCount << " may alias responses ";286PrintPercent(MayAliasCount, AliasSum);287errs() << " " << PartialAliasCount << " partial alias responses ";288PrintPercent(PartialAliasCount, AliasSum);289errs() << " " << MustAliasCount << " must alias responses ";290PrintPercent(MustAliasCount, AliasSum);291errs() << " Alias Analysis Evaluator Pointer Alias Summary: "292<< NoAliasCount * 100 / AliasSum << "%/"293<< MayAliasCount * 100 / AliasSum << "%/"294<< PartialAliasCount * 100 / AliasSum << "%/"295<< MustAliasCount * 100 / AliasSum << "%\n";296}297298// Display the summary for mod/ref analysis299int64_t ModRefSum = NoModRefCount + RefCount + ModCount + ModRefCount;300if (ModRefSum == 0) {301errs() << " Alias Analysis Mod/Ref Evaluator Summary: no "302"mod/ref!\n";303} else {304errs() << " " << ModRefSum << " Total ModRef Queries Performed\n";305errs() << " " << NoModRefCount << " no mod/ref responses ";306PrintPercent(NoModRefCount, ModRefSum);307errs() << " " << ModCount << " mod responses ";308PrintPercent(ModCount, ModRefSum);309errs() << " " << RefCount << " ref responses ";310PrintPercent(RefCount, ModRefSum);311errs() << " " << ModRefCount << " mod & ref responses ";312PrintPercent(ModRefCount, ModRefSum);313errs() << " Alias Analysis Evaluator Mod/Ref Summary: "314<< NoModRefCount * 100 / ModRefSum << "%/"315<< ModCount * 100 / ModRefSum << "%/" << RefCount * 100 / ModRefSum316<< "%/" << ModRefCount * 100 / ModRefSum << "%\n";317}318}319320321