1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
|
//===- AttributorTest.cpp - Attributor unit tests ------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------------------------------------------------===//
#include "llvm/Transforms/IPO/Attributor.h"
#include "AttributorTestBase.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/Analysis/CGSCCPassManager.h"
#include "llvm/Analysis/CallGraphSCCPass.h"
#include "llvm/Analysis/LoopAnalysisManager.h"
#include "llvm/AsmParser/Parser.h"
#include "llvm/Support/Allocator.h"
#include "llvm/Testing/Support/Error.h"
#include "llvm/Transforms/Utils/CallGraphUpdater.h"
#include "gtest/gtest.h"
#include <memory>
namespace llvm {
TEST_F(AttributorTestBase, IRPPositionCallBaseContext) {
const char *ModuleString = R"(
define i32 @foo(i32 %a) {
entry:
ret i32 %a
}
)";
parseModule(ModuleString);
Function *F = M->getFunction("foo");
IRPosition Pos =
IRPosition::function(*F, (const llvm::CallBase *)(uintptr_t)0xDEADBEEF);
EXPECT_TRUE(Pos.hasCallBaseContext());
EXPECT_FALSE(Pos.stripCallBaseContext().hasCallBaseContext());
}
TEST_F(AttributorTestBase, TestCast) {
const char *ModuleString = R"(
define i32 @foo(i32 %a, i32 %b) {
entry:
%c = add i32 %a, %b
ret i32 %c
}
)";
Module &M = parseModule(ModuleString);
SetVector<Function *> Functions;
AnalysisGetter AG;
for (Function &F : M)
Functions.insert(&F);
CallGraphUpdater CGUpdater;
BumpPtrAllocator Allocator;
InformationCache InfoCache(M, AG, Allocator, nullptr);
Attributor A(Functions, InfoCache, CGUpdater);
Function *F = M.getFunction("foo");
const AbstractAttribute *AA =
&A.getOrCreateAAFor<AAIsDead>(IRPosition::function(*F));
EXPECT_TRUE(AA);
const auto *SFail = dyn_cast<AAAlign>(AA);
const auto *SSucc = dyn_cast<AAIsDead>(AA);
ASSERT_EQ(SFail, nullptr);
ASSERT_TRUE(SSucc);
}
TEST_F(AttributorTestBase, AAReachabilityTest) {
const char *ModuleString = R"(
@x = global i32 0
define void @func4() {
store i32 0, i32* @x
ret void
}
define void @func3() {
store i32 0, i32* @x
ret void
}
define void @func2() {
entry:
call void @func3()
ret void
}
define void @func1() {
entry:
call void @func2()
ret void
}
define void @func5(void ()* %unknown) {
entry:
call void %unknown()
ret void
}
define void @func6() {
entry:
call void @func5(void ()* @func3)
ret void
}
)";
Module &M = parseModule(ModuleString);
SetVector<Function *> Functions;
AnalysisGetter AG;
for (Function &F : M)
Functions.insert(&F);
CallGraphUpdater CGUpdater;
BumpPtrAllocator Allocator;
InformationCache InfoCache(M, AG, Allocator, nullptr);
Attributor A(Functions, InfoCache, CGUpdater);
Function *F1 = M.getFunction("func1");
Function *F3 = M.getFunction("func3");
Function *F4 = M.getFunction("func4");
Function *F6 = M.getFunction("func6");
const AAFunctionReachability &F1AA =
A.getOrCreateAAFor<AAFunctionReachability>(IRPosition::function(*F1));
const AAFunctionReachability &F6AA =
A.getOrCreateAAFor<AAFunctionReachability>(IRPosition::function(*F6));
F1AA.canReach(A, F3);
F1AA.canReach(A, F4);
F6AA.canReach(A, F4);
A.run();
ASSERT_TRUE(F1AA.canReach(A, F3));
ASSERT_FALSE(F1AA.canReach(A, F4));
// Assumed to be reacahable, since F6 can reach a function with
// a unknown callee.
ASSERT_TRUE(F6AA.canReach(A, F4));
}
} // namespace llvm
|