blob: d3e0b807716ddb4cc77d7916fe79c206bb5b66ae (
plain)
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
|
//===- LowerWidenableCondition.cpp - Lower the guard intrinsic ---------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
//
// This pass lowers the llvm.widenable.condition intrinsic to default value
// which is i1 true.
//
//===----------------------------------------------------------------------===//
#include "llvm/Transforms/Scalar/LowerWidenableCondition.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Intrinsics.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/Transforms/Scalar.h"
using namespace llvm;
static bool lowerWidenableCondition(Function &F) {
// Check if we can cheaply rule out the possibility of not having any work to
// do.
auto *WCDecl = Intrinsic::getDeclarationIfExists(
F.getParent(), Intrinsic::experimental_widenable_condition);
if (!WCDecl || WCDecl->use_empty())
return false;
using namespace llvm::PatternMatch;
SmallVector<CallInst *, 8> ToLower;
// Traverse through the users of WCDecl.
// This is presumably cheaper than traversing all instructions in the
// function.
for (auto *U : WCDecl->users())
if (auto *CI = dyn_cast<CallInst>(U))
if (CI->getFunction() == &F)
ToLower.push_back(CI);
if (ToLower.empty())
return false;
for (auto *CI : ToLower) {
CI->replaceAllUsesWith(ConstantInt::getTrue(CI->getContext()));
CI->eraseFromParent();
}
return true;
}
PreservedAnalyses LowerWidenableConditionPass::run(Function &F,
FunctionAnalysisManager &AM) {
if (lowerWidenableCondition(F))
return PreservedAnalyses::none();
return PreservedAnalyses::all();
}
|
