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
|
/*========================== begin_copyright_notice ============================
Copyright (C) 2017-2021 Intel Corporation
SPDX-License-Identifier: MIT
============================= end_copyright_notice ===========================*/
#include "Compiler/IGCPassSupport.h"
#include "common/LLVMWarningsPush.hpp"
#include "llvm/ADT/PostOrderIterator.h"
#include "llvm/Analysis/CallGraph.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Constants.h"
#include "llvm/Pass.h"
#include "common/LLVMWarningsPop.hpp"
using namespace llvm;
namespace {
class PruneUnusedArguments : public ModulePass {
public:
static char ID;
PruneUnusedArguments();
bool runOnModule(Module& M) override;
void getAnalysisUsage(AnalysisUsage& AU) const override {
AU.addRequired<CallGraphWrapperPass>();
AU.addPreserved<CallGraphWrapperPass>();
AU.setPreservesCFG();
}
};
} // namespace
namespace IGC {
llvm::ModulePass* createPruneUnusedArgumentsPass() {
return new PruneUnusedArguments();
}
} // namespace IGC
IGC_INITIALIZE_PASS_BEGIN(PruneUnusedArguments, "PruneUnusedArguments", "PruneUnusedArguments", false, false)
IGC_INITIALIZE_PASS_DEPENDENCY(CallGraphWrapperPass)
IGC_INITIALIZE_PASS_END(PruneUnusedArguments, "PruneUnusedArguments", "PruneUnusedArguments", false, false)
char PruneUnusedArguments::ID = 0;
/// Optimize unused arguments, all indirectly unused arguments will be replaced
/// with undef and vISA emission will skip these copies. This is in fact a
/// cleanup to the unification passes, which run early in the pipeline. With
/// subroutines, this issue becomes worse.
///
/// Note that (1) we do not delete those dead arguments since there may have
/// metadata on those functions; (2) the way we do private memory resolution may
/// introduce uses to r0 or payloadHeader(!!). For this reason, we run this pass
/// after private meomry resolution and no other pass should introduce such uses
/// after. If r0 is given by an intrinsic, then this is not an issue by design.
///
bool PruneUnusedArguments::runOnModule(Module& M) {
CallGraph& CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
// Visit functions in a post order DFS, i.e. reversed topological ordering. If
// an argument is not used then let its callers pass undef.
bool Changed = false;
for (auto I = po_begin(CG.getExternalCallingNode()),
E = po_end(CG.getExternalCallingNode());
I != E; ++I) {
auto CGNode = *I;
// Skip external and indirect nodes.
if (auto F = CGNode->getFunction()) {
// Conservatively declarations use all arguments.
if (F->isDeclaration())
continue;
// Ignore externally linked functions
if (F->hasFnAttribute("referenced-indirectly") ||
F->hasFnAttribute("invoke_simd_target"))
continue;
// Collect unused arguments and their indices.
SmallVector<std::pair<Argument*, unsigned>, 8> UnusedArgs;
unsigned Index = 0;
for (auto& Arg : F->args()) {
if (Arg.use_empty())
UnusedArgs.push_back(std::make_pair(&Arg, Index));
Index++;
}
if (UnusedArgs.empty())
continue;
// Update call sites.
for (auto U : F->users()) {
CallInst* CI = dyn_cast<CallInst>(U);
if (!CI)
continue;
for (auto Item : UnusedArgs) {
auto Arg = Item.first;
auto Index = Item.second;
if (!isa<UndefValue>(CI->getArgOperand(Index))) {
CI->setArgOperand(Index, UndefValue::get(Arg->getType()));
Changed = true;
}
}
}
}
}
return Changed;
}
PruneUnusedArguments::PruneUnusedArguments() : ModulePass(ID) {
initializePruneUnusedArgumentsPass(*PassRegistry::getPassRegistry());
}
|
