Go to the documentation of this file.
52 #define DEBUG_TYPE "correlated-value-propagation"
54 STATISTIC(NumPhis,
"Number of phis propagated");
55 STATISTIC(NumPhiCommon,
"Number of phis deleted via common incoming value");
56 STATISTIC(NumSelects,
"Number of selects propagated");
57 STATISTIC(NumMemAccess,
"Number of memory access targets propagated");
58 STATISTIC(NumCmps,
"Number of comparisons propagated");
59 STATISTIC(NumReturns,
"Number of return values propagated");
60 STATISTIC(NumDeadCases,
"Number of switch cases removed");
62 "Number of sdivs/srems whose width was decreased");
63 STATISTIC(NumSDivs,
"Number of sdiv converted to udiv");
65 "Number of udivs/urems whose width was decreased");
66 STATISTIC(NumAShrs,
"Number of ashr converted to lshr");
67 STATISTIC(NumSRems,
"Number of srem converted to urem");
68 STATISTIC(NumSExt,
"Number of sext converted to zext");
69 STATISTIC(NumAnd,
"Number of ands removed");
70 STATISTIC(NumNW,
"Number of no-wrap deductions");
71 STATISTIC(NumNSW,
"Number of no-signed-wrap deductions");
72 STATISTIC(NumNUW,
"Number of no-unsigned-wrap deductions");
73 STATISTIC(NumAddNW,
"Number of no-wrap deductions for add");
74 STATISTIC(NumAddNSW,
"Number of no-signed-wrap deductions for add");
75 STATISTIC(NumAddNUW,
"Number of no-unsigned-wrap deductions for add");
76 STATISTIC(NumSubNW,
"Number of no-wrap deductions for sub");
77 STATISTIC(NumSubNSW,
"Number of no-signed-wrap deductions for sub");
78 STATISTIC(NumSubNUW,
"Number of no-unsigned-wrap deductions for sub");
79 STATISTIC(NumMulNW,
"Number of no-wrap deductions for mul");
80 STATISTIC(NumMulNSW,
"Number of no-signed-wrap deductions for mul");
81 STATISTIC(NumMulNUW,
"Number of no-unsigned-wrap deductions for mul");
82 STATISTIC(NumShlNW,
"Number of no-wrap deductions for shl");
83 STATISTIC(NumShlNSW,
"Number of no-signed-wrap deductions for shl");
84 STATISTIC(NumShlNUW,
"Number of no-unsigned-wrap deductions for shl");
85 STATISTIC(NumAbs,
"Number of llvm.abs intrinsics removed");
86 STATISTIC(NumOverflows,
"Number of overflow checks removed");
88 "Number of saturating arithmetics converted to normal arithmetics");
89 STATISTIC(NumNonNull,
"Number of function pointer arguments marked non-null");
90 STATISTIC(NumMinMax,
"Number of llvm.[us]{min,max} intrinsics removed");
118 "Value Propagation",
false,
false)
126 return new CorrelatedValuePropagation();
130 if (
S->getType()->isVectorTy())
return false;
131 if (isa<Constant>(
S->getCondition()))
return false;
134 if (!
C)
return false;
137 if (!CI)
return false;
139 Value *ReplaceWith = CI->
isOne() ?
S->getTrueValue() :
S->getFalseValue();
140 S->replaceAllUsesWith(ReplaceWith);
141 S->eraseFromParent();
163 Value *CommonValue =
nullptr;
164 for (
unsigned i = 0,
e =
P->getNumIncomingValues();
i !=
e; ++
i) {
165 Value *Incoming =
P->getIncomingValue(
i);
166 if (
auto *IncomingConstant = dyn_cast<Constant>(Incoming)) {
167 IncomingConstants.push_back(std::make_pair(IncomingConstant,
i));
168 }
else if (!CommonValue) {
170 CommonValue = Incoming;
171 }
else if (Incoming != CommonValue) {
177 if (!CommonValue || IncomingConstants.empty())
182 if (
auto *CommonInst = dyn_cast<Instruction>(CommonValue))
189 for (
auto &IncomingConstant : IncomingConstants) {
191 BasicBlock *IncomingBB =
P->getIncomingBlock(IncomingConstant.second);
203 if (
auto *CommonInst = dyn_cast<Instruction>(CommonValue))
204 CommonInst->dropPoisonGeneratingFlags();
205 P->replaceAllUsesWith(CommonValue);
206 P->eraseFromParent();
213 bool Changed =
false;
216 for (
unsigned i = 0,
e =
P->getNumIncomingValues();
i <
e; ++
i) {
217 Value *Incoming =
P->getIncomingValue(
i);
218 if (isa<Constant>(Incoming))
continue;
230 Value *Condition =
SI->getCondition();
233 Condition,
P->getIncomingBlock(
i),
BB,
P)) {
234 if (
C->isOneValue()) {
235 V =
SI->getTrueValue();
236 }
else if (
C->isZeroValue()) {
237 V =
SI->getFalseValue();
249 Constant *
C = dyn_cast<Constant>(
SI->getFalseValue());
253 P->getIncomingBlock(
i),
BB,
P) !=
256 V =
SI->getTrueValue();
262 P->setIncomingValue(
i, V);
267 P->replaceAllUsesWith(V);
268 P->eraseFromParent();
282 Value *Pointer =
nullptr;
284 Pointer = L->getPointerOperand();
286 Pointer = cast<StoreInst>(
I)->getPointerOperand();
288 if (isa<Constant>(Pointer))
return false;
291 if (!
C)
return false;
294 I->replaceUsesOfWith(Pointer,
C);
303 Value *Op0 = Cmp->getOperand(0);
304 auto *
C = dyn_cast<Constant>(Cmp->getOperand(1));
316 Cmp->replaceAllUsesWith(TorF);
317 Cmp->eraseFromParent();
335 bool Changed =
false;
338 SuccessorsCount[Succ]++;
344 for (
auto CI =
SI->case_begin(), CE =
SI->case_end(); CI != CE;) {
354 CI =
SI.removeCase(CI);
359 Cond =
SI->getCondition();
363 if (--SuccessorsCount[Succ] == 0)
371 SI->setCondition(Case);
372 NumDeadCases +=
SI->getNumCases();
400 bool NewNSW,
bool NewNUW) {
408 case Instruction::Sub:
413 case Instruction::Mul:
418 case Instruction::Shl:
427 auto *Inst = dyn_cast<Instruction>(V);
434 Inst->setHasNoSignedWrap();
442 Inst->setHasNoUnsignedWrap();
453 bool IsIntMinPoison = cast<ConstantInt>(II->
getArgOperand(1))->isOne();
455 Type *Ty =
X->getType();
461 Result = LVI->
getPredicateAt(CmpInst::Predicate::ICMP_ULE,
X, IntMin, II,
472 Result = LVI->
getPredicateAt(CmpInst::Predicate::ICMP_SLE,
X, Zero, II,
478 bool Changed =
false;
479 if (!IsIntMinPoison) {
481 Result = LVI->
getPredicateAt(CmpInst::Predicate::ICMP_NE,
X, IntMin, II,
501 if (
auto *BO = dyn_cast<BinaryOperator>(NegX))
536 Value *NewI =
B.CreateInsertValue(Struct, NewOp, 0);
542 if (
auto *BO = dyn_cast<BinaryOperator>(NewOp))
550 bool NSW =
SI->isSigned();
551 bool NUW = !
SI->isSigned();
553 Opcode,
SI->getLHS(),
SI->getRHS(),
SI->getName(),
SI);
557 SI->replaceAllUsesWith(BinOp);
558 SI->eraseFromParent();
562 if (
auto *BO = dyn_cast<BinaryOperator>(BinOp))
575 if (
auto *MM = dyn_cast<MinMaxIntrinsic>(&CB)) {
579 if (
auto *WO = dyn_cast<WithOverflowInst>(&CB)) {
580 if (WO->getLHS()->getType()->isIntegerTy() &&
willNotOverflow(WO, LVI)) {
585 if (
auto *
SI = dyn_cast<SaturatingInst>(&CB)) {
591 bool Changed =
false;
601 for (
const Use &ConstU : DeoptBundle->Inputs) {
602 Use &U =
const_cast<Use&
>(ConstU);
605 if (isa<Constant>(V))
continue;
627 ArgNos.push_back(ArgNo);
636 NumNonNull += ArgNos.size();
674 Instr->
getOpcode() == Instruction::SRem);
684 std::array<Optional<ConstantRange>, 2> CRs;
685 unsigned MinSignedBits = 0;
688 MinSignedBits =
std::max(std::get<1>(
I)->getMinSignedBits(), MinSignedBits);
699 unsigned NewWidth = std::max<unsigned>(
PowerOf2Ceil(MinSignedBits), 8);
703 if (NewWidth >= OrigWidth)
706 ++NumSDivSRemsNarrowed;
709 auto *LHS =
B.CreateTruncOrBitCast(Instr->
getOperand(0), TruncTy,
710 Instr->
getName() +
".lhs.trunc");
711 auto *RHS =
B.CreateTruncOrBitCast(Instr->
getOperand(1), TruncTy,
712 Instr->
getName() +
".rhs.trunc");
714 auto *Sext =
B.CreateSExt(BO, Instr->
getType(), Instr->
getName() +
".sext");
715 if (
auto *BinOp = dyn_cast<BinaryOperator>(BO))
716 if (BinOp->getOpcode() == Instruction::SDiv)
717 BinOp->setIsExact(Instr->
isExact());
728 Instr->
getOpcode() == Instruction::URem);
737 unsigned MaxActiveBits = 0;
743 unsigned NewWidth = std::max<unsigned>(
PowerOf2Ceil(MaxActiveBits), 8);
750 ++NumUDivURemsNarrowed;
753 auto *LHS =
B.CreateTruncOrBitCast(Instr->
getOperand(0), TruncTy,
754 Instr->
getName() +
".lhs.trunc");
755 auto *RHS =
B.CreateTruncOrBitCast(Instr->
getOperand(1), TruncTy,
756 Instr->
getName() +
".rhs.trunc");
758 auto *Zext =
B.CreateZExt(BO, Instr->
getType(), Instr->
getName() +
".zext");
759 if (
auto *BinOp = dyn_cast<BinaryOperator>(BO))
760 if (BinOp->getOpcode() == Instruction::UDiv)
761 BinOp->setIsExact(Instr->
isExact());
777 std::array<Operand, 2> Ops;
780 Operand &
Op = std::get<0>(
I);
781 Op.V = std::get<1>(
I);
791 for (Operand &
Op : Ops) {
801 BinaryOperator::CreateURem(Ops[0].V, Ops[1].V, SDI->
getName(), SDI);
833 std::array<Operand, 2> Ops;
836 Operand &
Op = std::get<0>(
I);
837 Op.V = std::get<1>(
I);
847 for (Operand &
Op : Ops) {
857 BinaryOperator::CreateUDiv(Ops[0].V, Ops[1].V, SDI->
getName(), SDI);
859 UDiv->setIsExact(SDI->
isExact());
864 if (Ops[0].
D != Ops[1].
D)
878 Instr->
getOpcode() == Instruction::SRem);
882 if (Instr->
getOpcode() == Instruction::SDiv)
886 if (Instr->
getOpcode() == Instruction::SRem)
904 BO->setIsExact(SDI->
isExact());
948 bool Changed =
false;
949 bool NewNUW =
false, NewNSW =
false;
952 Opcode, RRange, OBO::NoUnsignedWrap);
958 Opcode, RRange, OBO::NoSignedWrap);
999 auto *
C = dyn_cast<CmpInst>(V);
1000 if (!
C)
return nullptr;
1002 Value *Op0 =
C->getOperand(0);
1003 Constant *Op1 = dyn_cast<Constant>(
C->getOperand(1));
1004 if (!Op1)
return nullptr;
1007 C->getPredicate(), Op0, Op1, At,
false);
1018 bool FnChanged =
false;
1025 bool BBChanged =
false;
1032 case Instruction::PHI:
1033 BBChanged |=
processPHI(cast<PHINode>(II), LVI, DT, SQ);
1035 case Instruction::ICmp:
1036 case Instruction::FCmp:
1037 BBChanged |=
processCmp(cast<CmpInst>(II), LVI);
1044 case Instruction::Invoke:
1047 case Instruction::SRem:
1048 case Instruction::SDiv:
1051 case Instruction::UDiv:
1052 case Instruction::URem:
1055 case Instruction::AShr:
1056 BBChanged |=
processAShr(cast<BinaryOperator>(II), LVI);
1058 case Instruction::SExt:
1059 BBChanged |=
processSExt(cast<SExtInst>(II), LVI);
1062 case Instruction::Sub:
1063 case Instruction::Mul:
1064 case Instruction::Shl:
1065 BBChanged |=
processBinOp(cast<BinaryOperator>(II), LVI);
1067 case Instruction::And:
1068 BBChanged |=
processAnd(cast<BinaryOperator>(II), LVI);
1074 switch (
Term->getOpcode()) {
1075 case Instruction::Switch:
1079 auto *RI = cast<ReturnInst>(
Term);
1083 auto *RetVal = RI->getReturnValue();
1085 if (isa<Constant>(RetVal))
break;
1088 RI->replaceUsesOfWith(RetVal,
C);
1094 FnChanged |= BBChanged;
1101 if (skipFunction(
F))
1104 LazyValueInfo *LVI = &getAnalysis<LazyValueInfoWrapperPass>().getLVI();
1105 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
Constant * getConstantOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB, Instruction *CxtI=nullptr)
Determine whether the specified value is known to be a constant on the specified edge.
Analysis pass providing a never-invalidated alias analysis result.
A set of analyses that are preserved following a run of a transformation pass.
Instruction::BinaryOps getBinaryOp() const
Returns the binary operation underlying the intrinsic.
static IntegerType * getInt1Ty(LLVMContext &C)
Optional< OperandBundleUse > getOperandBundle(StringRef Name) const
Return an operand bundle by name, if present.
Predicate
This enumeration lists the possible predicates for CmpInst subclasses.
InstListType::iterator iterator
Instruction iterators...
A wrapper class to simplify modification of SwitchInst cases along with their prof branch_weights met...
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
Tristate getPredicateOnEdge(unsigned Pred, Value *V, Constant *C, BasicBlock *FromBB, BasicBlock *ToBB, Instruction *CxtI=nullptr)
Determine whether the specified value comparison with a constant is known to be true or false on the ...
bool isMask(unsigned numBits) const
bool ule(const APInt &RHS) const
Unsigned less or equal comparison.
static Constant * get(StructType *T, ArrayRef< Constant * > V)
This currently compiles esp xmm0 movsd esp eax eax esp ret We should use not the dag combiner This is because dagcombine2 needs to be able to see through the X86ISD::Wrapper which DAGCombine can t really do The code for turning x load into a single vector load is target independent and should be moved to the dag combiner The code for turning x load into a vector load can only handle a direct load from a global or a direct load from the stack It should be generalized to handle any load from P
return AArch64::GPR64RegClass contains(Reg)
static Attribute get(LLVMContext &Context, AttrKind Kind, uint64_t Val=0)
Return a uniquified Attribute object.
const APInt & getValue() const
Return the constant as an APInt value reference.
Analysis to compute lazy value information.
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
LLVM_NODISCARD AttributeList addParamAttribute(LLVMContext &C, unsigned ArgNo, Attribute::AttrKind Kind) const
Add an argument attribute to the list.
This class represents an intrinsic that is based on a binary operation.
bool hasNoUnsignedWrap() const
Determine whether the no unsigned wrap flag is set.
void abandon()
Mark an analysis as abandoned.
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Constant * getConstant(Value *V, Instruction *CxtI)
Determine whether the specified value is known to be a constant at the specified instruction.
The instances of the Type class are immutable: once they are created, they are never changed.
AttributeList getAttributes() const
Return the parameter attributes for this call.
void initializeCorrelatedValuePropagationPass(PassRegistry &)
@ ICMP_SLE
signed less or equal
uint64_t PowerOf2Ceil(uint64_t A)
Returns the power of two which is greater than or equal to the given value.
NUW NUW NUW NUW Exact static Exact BinaryOperator * CreateNeg(Value *Op, const Twine &Name="", Instruction *InsertBefore=nullptr)
Helper functions to construct and inspect unary operations (NEG and NOT) via binary operators SUB and...
succ_range successors(Instruction *I)
INITIALIZE_PASS_END(RegBankSelect, DEBUG_TYPE, "Assign register bank of generic virtual registers", false, false) RegBankSelect
LLVM Basic Block Representation.
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
bool dominates(const BasicBlock *BB, const Use &U) const
Return true if the (end of the) basic block BB dominates the use U.
This is the shared class of boolean and integer constants.
unsigned getOpcode() const
Returns a member of one of the enums like Instruction::Add.
static PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
Predicate getNonStrictPredicate() const
For example, SGT -> SGE, SLT -> SLE, ULT -> ULE, UGT -> UGE.
(vector float) vec_cmpeq(*A, *B) C
void setAttributes(AttributeList A)
Set the parameter attributes for this call.
Represent the analysis usage information of a pass.
bool isVectorTy() const
True if this is an instance of VectorType.
unsigned getNoWrapKind() const
Returns one of OBO::NoSignedWrap or OBO::NoUnsignedWrap.
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
static ConstantRange makeGuaranteedNoWrapRegion(Instruction::BinaryOps BinOp, const ConstantRange &Other, unsigned NoWrapKind)
Produce the largest range containing all X such that "X BinOp Y" is guaranteed not to wrap (overflow)...
Represents a saturating add/sub intrinsic.
BinaryOps getOpcode() const
unsigned getScalarSizeInBits() const LLVM_READONLY
If this is a vector type, return the getPrimitiveSizeInBits value for the element type.
APInt getUnsignedMax() const
Return the largest unsigned value contained in the ConstantRange.
Value * SimplifyInstruction(Instruction *I, const SimplifyQuery &Q, OptimizationRemarkEmitter *ORE=nullptr)
See if we can compute a simplified version of this instruction.
Legacy analysis pass which computes a DominatorTree.
STATISTIC(NumFunctions, "Total number of functions")
static UndefValue * get(Type *T)
Static factory methods - Return an 'undef' object of the specified type.
static Constant * get(Type *Ty, uint64_t V, bool IsSigned=false)
If Ty is a vector type, return a Constant with a splat of the given value.
unsigned getIntegerBitWidth() const
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector")
This class is the base class for the comparison instructions.
This is an important base class in LLVM.
SymbolTableList< Instruction >::iterator eraseFromParent()
This method unlinks 'this' from the containing basic block and deletes it.
bool isSigned() const
Whether the intrinsic is signed or unsigned.
static GCRegistry::Add< StatepointGC > D("statepoint-example", "an example strategy for statepoint")
ConstantRange getConstantRange(Value *V, Instruction *CxtI, bool UndefAllowed=true)
Return the ConstantRange constraint that is known to hold for the specified value at the specified in...
Wrapper around LazyValueInfo.
void preserve()
Mark an analysis as preserved.
INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
static ConstantPointerNull * get(PointerType *T)
Static factory methods - Return objects of the specified value.
This is an important class for using LLVM in a threaded context.
Class to represent pointers.
void setDebugLoc(DebugLoc Loc)
Set the debug location information for this instruction.
Pass * createCorrelatedValuePropagationPass()
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This class represents the LLVM 'select' instruction.
ICmpInst::Predicate getPredicate() const
Returns the comparison predicate underlying the intrinsic.
This pass computes, caches, and vends lazy value constraint information.
detail::zippy< detail::zip_shortest, T, U, Args... > zip(T &&t, U &&u, Args &&... args)
zip iterator for two or more iteratable types.
Intrinsic::ID getIntrinsicID() const
Returns the intrinsic ID of the intrinsic called or Intrinsic::not_intrinsic if the called function i...
static APInt getAllOnesValue(unsigned numBits)
Get the all-ones value.
Class to represent struct types.
SmallVector< MachineOperand, 4 > Cond
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
Type * getType() const
All values are typed, get the type of this value.
AnalysisUsage & addPreserved()
Add the specified Pass class to the set of analyses preserved by this pass.
void replaceAllUsesWith(Value *V)
Change all uses of this to point to a new Value.
LLVMContext & getContext() const
All values hold a context through their type.
bool isExact() const
Determine whether the exact flag is set.
add sub stmia L5 ldr r0 bl L_printf $stub Instead of a and a wouldn t it be better to do three moves *Return an aggregate type is even return S
Utility class for integer operators which may exhibit overflow - Add, Sub, Mul, and Shl.
Represents an op.with.overflow intrinsic.
This class represents a sign extension of integer types.
StringRef getName() const
Return a constant reference to the value's name.
An instruction for reading from memory.
bool paramHasAttr(unsigned ArgNo, Attribute::AttrKind Kind) const
Determine whether the argument or parameter has the given attribute.
void setArgOperand(unsigned i, Value *v)
static ConstantInt * getFalse(LLVMContext &Context)
iterator_range< df_iterator< T > > depth_first(const T &G)
static bool runOnFunction(Function &F, bool PostInlining)
bool ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions=false, const TargetLibraryInfo *TLI=nullptr, DomTreeUpdater *DTU=nullptr)
If a terminator instruction is predicated on a constant value, convert it into an unconditional branc...
static ConstantInt * getTrue(LLVMContext &Context)
static Constant * getNullValue(Type *Ty)
Constructor to create a '0' constant of arbitrary type.
const SimplifyQuery getBestSimplifyQuery(Pass &, Function &)
static IntegerType * getIntNTy(LLVMContext &C, unsigned N)
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
unsigned arg_size() const
unsigned getActiveBits() const
Compute the maximal number of active bits needed to represent every value in this range.
bool contains(const APInt &Val) const
Return true if the specified value is in the set.
@ ICMP_SGE
signed greater or equal
static APInt getSignedMinValue(unsigned numBits)
Gets minimum signed value of APInt for a specific bit width.
This class represents a range of values.
A wrapper class for inspecting calls to intrinsic functions.
Analysis pass which computes a DominatorTree.
Pass interface - Implemented by all 'passes'.
This class represents min/max intrinsics.
Tristate
This is used to return true/false/dunno results.
const DebugLoc & getDebugLoc() const
Return the debug location for this node as a DebugLoc.
bool hasNoSignedWrap() const
Determine whether the no signed wrap flag is set.
Value * getArgOperand(unsigned i) const
Legacy wrapper pass to provide the GlobalsAAResult object.
Align max(MaybeAlign Lhs, Align Rhs)
void removePredecessor(BasicBlock *Pred, bool KeepOneInputPHIs=false)
Update PHI nodes in this BasicBlock before removal of predecessor Pred.
Base class for all callable instructions (InvokeInst and CallInst) Holds everything related to callin...
A container for analyses that lazily runs them and caches their results.
FunctionPass class - This class is used to implement most global optimizations.
bool isOne() const
This is just a convenience method to make client code smaller for a common case.
Common register allocation spilling lr str ldr sxth r3 ldr mla r4 can lr mov lr str ldr sxth r3 mla r4 and then merge mul and lr str ldr sxth r3 mla r4 It also increase the likelihood the store may become dead bb27 Successors according to LLVM BB
AnalysisUsage & addRequired()
Value * getOperand(unsigned i) const
static CastInst * CreateZExtOrBitCast(Value *S, Type *Ty, const Twine &Name="", Instruction *InsertBefore=nullptr)
Create a ZExt or BitCast cast instruction.
Tristate getPredicateAt(unsigned Pred, Value *V, Constant *C, Instruction *CxtI, bool UseBlockValue)
Determine whether the specified value comparison with a constant is known to be true or false at the ...
static BinaryOperator * Create(BinaryOps Op, Value *S1, Value *S2, const Twine &Name=Twine(), Instruction *InsertBefore=nullptr)
Construct a binary instruction, given the opcode and the two operands.
APFloat abs(APFloat X)
Returns the absolute value of the argument.
void applyUpdatesPermissive(ArrayRef< DominatorTree::UpdateType > Updates)
Submit updates to all available trees.
LLVM Value Representation.
iterator_range< User::op_iterator > args()
Iteration adapter for range-for loops.
static constexpr UpdateKind Delete
A Use represents the edge between a Value definition and its users.