LLVM  16.0.0git
PHITransAddr.cpp
Go to the documentation of this file.
1 //===- PHITransAddr.cpp - PHI Translation for Addresses -------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file implements the PHITransAddr class.
10 //
11 //===----------------------------------------------------------------------===//
12 
16 #include "llvm/Config/llvm-config.h"
17 #include "llvm/IR/Constants.h"
18 #include "llvm/IR/Dominators.h"
19 #include "llvm/IR/Instructions.h"
22 using namespace llvm;
23 
25  "gvn-add-phi-translation", cl::init(false), cl::Hidden,
26  cl::desc("Enable phi-translation of add instructions"));
27 
28 static bool CanPHITrans(Instruction *Inst) {
29  if (isa<PHINode>(Inst) ||
30  isa<GetElementPtrInst>(Inst))
31  return true;
32 
33  if (isa<CastInst>(Inst) &&
35  return true;
36 
37  if (Inst->getOpcode() == Instruction::Add &&
38  isa<ConstantInt>(Inst->getOperand(1)))
39  return true;
40 
41  return false;
42 }
43 
44 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
46  if (!Addr) {
47  dbgs() << "PHITransAddr: null\n";
48  return;
49  }
50  dbgs() << "PHITransAddr: " << *Addr << "\n";
51  for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
52  dbgs() << " Input #" << i << " is " << *InstInputs[i] << "\n";
53 }
54 #endif
55 
56 
57 static bool VerifySubExpr(Value *Expr,
58  SmallVectorImpl<Instruction*> &InstInputs) {
59  // If this is a non-instruction value, there is nothing to do.
60  Instruction *I = dyn_cast<Instruction>(Expr);
61  if (!I) return true;
62 
63  // If it's an instruction, it is either in Tmp or its operands recursively
64  // are.
65  SmallVectorImpl<Instruction *>::iterator Entry = find(InstInputs, I);
66  if (Entry != InstInputs.end()) {
67  InstInputs.erase(Entry);
68  return true;
69  }
70 
71  // If it isn't in the InstInputs list it is a subexpr incorporated into the
72  // address. Validate that it is phi translatable.
73  if (!CanPHITrans(I)) {
74  errs() << "Instruction in PHITransAddr is not phi-translatable:\n";
75  errs() << *I << '\n';
76  llvm_unreachable("Either something is missing from InstInputs or "
77  "CanPHITrans is wrong.");
78  }
79 
80  // Validate the operands of the instruction.
81  for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
82  if (!VerifySubExpr(I->getOperand(i), InstInputs))
83  return false;
84 
85  return true;
86 }
87 
88 /// Verify - Check internal consistency of this data structure. If the
89 /// structure is valid, it returns true. If invalid, it prints errors and
90 /// returns false.
91 bool PHITransAddr::Verify() const {
92  if (!Addr) return true;
93 
94  SmallVector<Instruction*, 8> Tmp(InstInputs.begin(), InstInputs.end());
95 
96  if (!VerifySubExpr(Addr, Tmp))
97  return false;
98 
99  if (!Tmp.empty()) {
100  errs() << "PHITransAddr contains extra instructions:\n";
101  for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
102  errs() << " InstInput #" << i << " is " << *InstInputs[i] << "\n";
103  llvm_unreachable("This is unexpected.");
104  }
105 
106  // a-ok.
107  return true;
108 }
109 
110 
111 /// IsPotentiallyPHITranslatable - If this needs PHI translation, return true
112 /// if we have some hope of doing it. This should be used as a filter to
113 /// avoid calling PHITranslateValue in hopeless situations.
115  // If the input value is not an instruction, or if it is not defined in CurBB,
116  // then we don't need to phi translate it.
117  Instruction *Inst = dyn_cast<Instruction>(Addr);
118  return !Inst || CanPHITrans(Inst);
119 }
120 
121 
122 static void RemoveInstInputs(Value *V,
123  SmallVectorImpl<Instruction*> &InstInputs) {
124  Instruction *I = dyn_cast<Instruction>(V);
125  if (!I) return;
126 
127  // If the instruction is in the InstInputs list, remove it.
128  SmallVectorImpl<Instruction *>::iterator Entry = find(InstInputs, I);
129  if (Entry != InstInputs.end()) {
130  InstInputs.erase(Entry);
131  return;
132  }
133 
134  assert(!isa<PHINode>(I) && "Error, removing something that isn't an input");
135 
136  // Otherwise, it must have instruction inputs itself. Zap them recursively.
137  for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
138  if (Instruction *Op = dyn_cast<Instruction>(I->getOperand(i)))
139  RemoveInstInputs(Op, InstInputs);
140  }
141 }
142 
143 Value *PHITransAddr::PHITranslateSubExpr(Value *V, BasicBlock *CurBB,
144  BasicBlock *PredBB,
145  const DominatorTree *DT) {
146  // If this is a non-instruction value, it can't require PHI translation.
147  Instruction *Inst = dyn_cast<Instruction>(V);
148  if (!Inst) return V;
149 
150  // Determine whether 'Inst' is an input to our PHI translatable expression.
151  bool isInput = is_contained(InstInputs, Inst);
152 
153  // Handle inputs instructions if needed.
154  if (isInput) {
155  if (Inst->getParent() != CurBB) {
156  // If it is an input defined in a different block, then it remains an
157  // input.
158  return Inst;
159  }
160 
161  // If 'Inst' is defined in this block and is an input that needs to be phi
162  // translated, we need to incorporate the value into the expression or fail.
163 
164  // In either case, the instruction itself isn't an input any longer.
165  InstInputs.erase(find(InstInputs, Inst));
166 
167  // If this is a PHI, go ahead and translate it.
168  if (PHINode *PN = dyn_cast<PHINode>(Inst))
169  return AddAsInput(PN->getIncomingValueForBlock(PredBB));
170 
171  // If this is a non-phi value, and it is analyzable, we can incorporate it
172  // into the expression by making all instruction operands be inputs.
173  if (!CanPHITrans(Inst))
174  return nullptr;
175 
176  // All instruction operands are now inputs (and of course, they may also be
177  // defined in this block, so they may need to be phi translated themselves.
178  for (unsigned i = 0, e = Inst->getNumOperands(); i != e; ++i)
179  if (Instruction *Op = dyn_cast<Instruction>(Inst->getOperand(i)))
180  InstInputs.push_back(Op);
181  }
182 
183  // Ok, it must be an intermediate result (either because it started that way
184  // or because we just incorporated it into the expression). See if its
185  // operands need to be phi translated, and if so, reconstruct it.
186 
187  if (CastInst *Cast = dyn_cast<CastInst>(Inst)) {
188  if (!isSafeToSpeculativelyExecute(Cast)) return nullptr;
189  Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
190  if (!PHIIn) return nullptr;
191  if (PHIIn == Cast->getOperand(0))
192  return Cast;
193 
194  // Find an available version of this cast.
195 
196  // Constants are trivial to find.
197  if (Constant *C = dyn_cast<Constant>(PHIIn))
198  return AddAsInput(ConstantExpr::getCast(Cast->getOpcode(),
199  C, Cast->getType()));
200 
201  // Otherwise we have to see if a casted version of the incoming pointer
202  // is available. If so, we can use it, otherwise we have to fail.
203  for (User *U : PHIIn->users()) {
204  if (CastInst *CastI = dyn_cast<CastInst>(U))
205  if (CastI->getOpcode() == Cast->getOpcode() &&
206  CastI->getType() == Cast->getType() &&
207  (!DT || DT->dominates(CastI->getParent(), PredBB)))
208  return CastI;
209  }
210  return nullptr;
211  }
212 
213  // Handle getelementptr with at least one PHI translatable operand.
214  if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) {
215  SmallVector<Value*, 8> GEPOps;
216  bool AnyChanged = false;
217  for (unsigned i = 0, e = GEP->getNumOperands(); i != e; ++i) {
218  Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
219  if (!GEPOp) return nullptr;
220 
221  AnyChanged |= GEPOp != GEP->getOperand(i);
222  GEPOps.push_back(GEPOp);
223  }
224 
225  if (!AnyChanged)
226  return GEP;
227 
228  // Simplify the GEP to handle 'gep x, 0' -> x etc.
229  if (Value *V = simplifyGEPInst(GEP->getSourceElementType(), GEPOps[0],
230  ArrayRef<Value *>(GEPOps).slice(1),
231  GEP->isInBounds(), {DL, TLI, DT, AC})) {
232  for (unsigned i = 0, e = GEPOps.size(); i != e; ++i)
233  RemoveInstInputs(GEPOps[i], InstInputs);
234 
235  return AddAsInput(V);
236  }
237 
238  // Scan to see if we have this GEP available.
239  Value *APHIOp = GEPOps[0];
240  for (User *U : APHIOp->users()) {
241  if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(U))
242  if (GEPI->getType() == GEP->getType() &&
243  GEPI->getSourceElementType() == GEP->getSourceElementType() &&
244  GEPI->getNumOperands() == GEPOps.size() &&
245  GEPI->getParent()->getParent() == CurBB->getParent() &&
246  (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
247  if (std::equal(GEPOps.begin(), GEPOps.end(), GEPI->op_begin()))
248  return GEPI;
249  }
250  }
251  return nullptr;
252  }
253 
254  // Handle add with a constant RHS.
255  if (Inst->getOpcode() == Instruction::Add &&
256  isa<ConstantInt>(Inst->getOperand(1))) {
257  // PHI translate the LHS.
258  Constant *RHS = cast<ConstantInt>(Inst->getOperand(1));
259  bool isNSW = cast<BinaryOperator>(Inst)->hasNoSignedWrap();
260  bool isNUW = cast<BinaryOperator>(Inst)->hasNoUnsignedWrap();
261 
262  Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
263  if (!LHS) return nullptr;
264 
265  // If the PHI translated LHS is an add of a constant, fold the immediates.
266  if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS))
267  if (BOp->getOpcode() == Instruction::Add)
268  if (ConstantInt *CI = dyn_cast<ConstantInt>(BOp->getOperand(1))) {
269  LHS = BOp->getOperand(0);
271  isNSW = isNUW = false;
272 
273  // If the old 'LHS' was an input, add the new 'LHS' as an input.
274  if (is_contained(InstInputs, BOp)) {
275  RemoveInstInputs(BOp, InstInputs);
276  AddAsInput(LHS);
277  }
278  }
279 
280  // See if the add simplifies away.
281  if (Value *Res = simplifyAddInst(LHS, RHS, isNSW, isNUW, {DL, TLI, DT, AC})) {
282  // If we simplified the operands, the LHS is no longer an input, but Res
283  // is.
284  RemoveInstInputs(LHS, InstInputs);
285  return AddAsInput(Res);
286  }
287 
288  // If we didn't modify the add, just return it.
289  if (LHS == Inst->getOperand(0) && RHS == Inst->getOperand(1))
290  return Inst;
291 
292  // Otherwise, see if we have this add available somewhere.
293  for (User *U : LHS->users()) {
294  if (BinaryOperator *BO = dyn_cast<BinaryOperator>(U))
295  if (BO->getOpcode() == Instruction::Add &&
296  BO->getOperand(0) == LHS && BO->getOperand(1) == RHS &&
297  BO->getParent()->getParent() == CurBB->getParent() &&
298  (!DT || DT->dominates(BO->getParent(), PredBB)))
299  return BO;
300  }
301 
302  return nullptr;
303  }
304 
305  // Otherwise, we failed.
306  return nullptr;
307 }
308 
309 
310 /// PHITranslateValue - PHI translate the current address up the CFG from
311 /// CurBB to Pred, updating our state to reflect any needed changes. If
312 /// 'MustDominate' is true, the translated value must dominate
313 /// PredBB. This returns true on failure and sets Addr to null.
315  const DominatorTree *DT,
316  bool MustDominate) {
317  assert(DT || !MustDominate);
318  assert(Verify() && "Invalid PHITransAddr!");
319  if (DT && DT->isReachableFromEntry(PredBB))
320  Addr = PHITranslateSubExpr(Addr, CurBB, PredBB, DT);
321  else
322  Addr = nullptr;
323  assert(Verify() && "Invalid PHITransAddr!");
324 
325  if (MustDominate)
326  // Make sure the value is live in the predecessor.
327  if (Instruction *Inst = dyn_cast_or_null<Instruction>(Addr))
328  if (!DT->dominates(Inst->getParent(), PredBB))
329  Addr = nullptr;
330 
331  return Addr == nullptr;
332 }
333 
334 /// PHITranslateWithInsertion - PHI translate this value into the specified
335 /// predecessor block, inserting a computation of the value if it is
336 /// unavailable.
337 ///
338 /// All newly created instructions are added to the NewInsts list. This
339 /// returns null on failure.
340 ///
343  const DominatorTree &DT,
344  SmallVectorImpl<Instruction*> &NewInsts) {
345  unsigned NISize = NewInsts.size();
346 
347  // Attempt to PHI translate with insertion.
348  Addr = InsertPHITranslatedSubExpr(Addr, CurBB, PredBB, DT, NewInsts);
349 
350  // If successful, return the new value.
351  if (Addr) return Addr;
352 
353  // If not, destroy any intermediate instructions inserted.
354  while (NewInsts.size() != NISize)
355  NewInsts.pop_back_val()->eraseFromParent();
356  return nullptr;
357 }
358 
359 
360 /// InsertPHITranslatedPointer - Insert a computation of the PHI translated
361 /// version of 'V' for the edge PredBB->CurBB into the end of the PredBB
362 /// block. All newly created instructions are added to the NewInsts list.
363 /// This returns null on failure.
364 ///
365 Value *PHITransAddr::
366 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB,
367  BasicBlock *PredBB, const DominatorTree &DT,
368  SmallVectorImpl<Instruction*> &NewInsts) {
369  // See if we have a version of this value already available and dominating
370  // PredBB. If so, there is no need to insert a new instance of it.
371  PHITransAddr Tmp(InVal, DL, AC);
372  if (!Tmp.PHITranslateValue(CurBB, PredBB, &DT, /*MustDominate=*/true))
373  return Tmp.getAddr();
374 
375  // We don't need to PHI translate values which aren't instructions.
376  auto *Inst = dyn_cast<Instruction>(InVal);
377  if (!Inst)
378  return nullptr;
379 
380  // Handle cast of PHI translatable value.
381  if (CastInst *Cast = dyn_cast<CastInst>(Inst)) {
382  if (!isSafeToSpeculativelyExecute(Cast)) return nullptr;
383  Value *OpVal = InsertPHITranslatedSubExpr(Cast->getOperand(0),
384  CurBB, PredBB, DT, NewInsts);
385  if (!OpVal) return nullptr;
386 
387  // Otherwise insert a cast at the end of PredBB.
388  CastInst *New = CastInst::Create(Cast->getOpcode(), OpVal, InVal->getType(),
389  InVal->getName() + ".phi.trans.insert",
390  PredBB->getTerminator());
391  New->setDebugLoc(Inst->getDebugLoc());
392  NewInsts.push_back(New);
393  return New;
394  }
395 
396  // Handle getelementptr with at least one PHI operand.
397  if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) {
398  SmallVector<Value*, 8> GEPOps;
399  BasicBlock *CurBB = GEP->getParent();
400  for (unsigned i = 0, e = GEP->getNumOperands(); i != e; ++i) {
401  Value *OpVal = InsertPHITranslatedSubExpr(GEP->getOperand(i),
402  CurBB, PredBB, DT, NewInsts);
403  if (!OpVal) return nullptr;
404  GEPOps.push_back(OpVal);
405  }
406 
408  GEP->getSourceElementType(), GEPOps[0], makeArrayRef(GEPOps).slice(1),
409  InVal->getName() + ".phi.trans.insert", PredBB->getTerminator());
410  Result->setDebugLoc(Inst->getDebugLoc());
411  Result->setIsInBounds(GEP->isInBounds());
412  NewInsts.push_back(Result);
413  return Result;
414  }
415 
416  // Handle add with a constant RHS.
418  isa<ConstantInt>(Inst->getOperand(1))) {
419 
420  // FIXME: This code works, but it is unclear that we actually want to insert
421  // a big chain of computation in order to make a value available in a block.
422  // This needs to be evaluated carefully to consider its cost trade offs.
423 
424  // PHI translate the LHS.
425  Value *OpVal = InsertPHITranslatedSubExpr(Inst->getOperand(0),
426  CurBB, PredBB, DT, NewInsts);
427  if (OpVal == nullptr)
428  return nullptr;
429 
430  BinaryOperator *Res = BinaryOperator::CreateAdd(OpVal, Inst->getOperand(1),
431  InVal->getName()+".phi.trans.insert",
432  PredBB->getTerminator());
433  Res->setHasNoSignedWrap(cast<BinaryOperator>(Inst)->hasNoSignedWrap());
434  Res->setHasNoUnsignedWrap(cast<BinaryOperator>(Inst)->hasNoUnsignedWrap());
435  NewInsts.push_back(Res);
436  return Res;
437  }
438 
439  return nullptr;
440 }
i
i
Definition: README.txt:29
RemoveInstInputs
static void RemoveInstInputs(Value *V, SmallVectorImpl< Instruction * > &InstInputs)
Definition: PHITransAddr.cpp:122
LLVM_DUMP_METHOD
#define LLVM_DUMP_METHOD
Mark debug helper function definitions like dump() that should not be stripped from debug builds.
Definition: Compiler.h:492
llvm::simplifyGEPInst
Value * simplifyGEPInst(Type *SrcTy, Value *Ptr, ArrayRef< Value * > Indices, bool InBounds, const SimplifyQuery &Q)
Given operands for a GetElementPtrInst, fold the result or return null.
Definition: InstructionSimplify.cpp:4723
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
llvm::SmallVectorImpl::erase
iterator erase(const_iterator CI)
Definition: SmallVector.h:723
llvm::PHITransAddr
PHITransAddr - An address value which tracks and handles phi translation.
Definition: PHITransAddr.h:35
llvm::BasicBlock::getParent
const Function * getParent() const
Return the enclosing method, or null if none.
Definition: BasicBlock.h:104
llvm::SmallVector< Instruction *, 8 >
ErrorHandling.h
llvm::CastInst::Create
static CastInst * Create(Instruction::CastOps, Value *S, Type *Ty, const Twine &Name="", Instruction *InsertBefore=nullptr)
Provides a way to construct any of the CastInst subclasses using an opcode instead of the subclass's ...
Definition: Instructions.cpp:3250
ValueTracking.h
llvm::DominatorTree
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition: Dominators.h:166
llvm::cl::Hidden
@ Hidden
Definition: CommandLine.h:140
EnableAddPhiTranslation
static cl::opt< bool > EnableAddPhiTranslation("gvn-add-phi-translation", cl::init(false), cl::Hidden, cl::desc("Enable phi-translation of add instructions"))
llvm::PHITransAddr::PHITranslateWithInsertion
Value * PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl< Instruction * > &NewInsts)
PHITranslateWithInsertion - PHI translate this value into the specified predecessor block,...
Definition: PHITransAddr.cpp:342
CanPHITrans
static bool CanPHITrans(Instruction *Inst)
Definition: PHITransAddr.cpp:28
llvm::Instruction::setHasNoUnsignedWrap
void setHasNoUnsignedWrap(bool b=true)
Set or clear the nuw flag on this instruction, which must be an operator which supports this flag.
Definition: Instruction.cpp:149
llvm::PHITransAddr::IsPotentiallyPHITranslatable
bool IsPotentiallyPHITranslatable() const
IsPotentiallyPHITranslatable - If this needs PHI translation, return true if we have some hope of doi...
Definition: PHITransAddr.cpp:114
llvm::errs
raw_fd_ostream & errs()
This returns a reference to a raw_ostream for standard error.
Definition: raw_ostream.cpp:891
RHS
Value * RHS
Definition: X86PartialReduction.cpp:76
llvm::BasicBlock
LLVM Basic Block Representation.
Definition: BasicBlock.h:55
llvm::lltok::equal
@ equal
Definition: LLToken.h:25
llvm::dbgs
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:163
llvm::DominatorTree::dominates
bool dominates(const BasicBlock *BB, const Use &U) const
Return true if the (end of the) basic block BB dominates the use U.
Definition: Dominators.cpp:122
PHITransAddr.h
LHS
Value * LHS
Definition: X86PartialReduction.cpp:75
llvm::ConstantInt
This is the shared class of boolean and integer constants.
Definition: Constants.h:79
llvm::Instruction::getOpcode
unsigned getOpcode() const
Returns a member of one of the enums like Instruction::Add.
Definition: Instruction.h:164
hasNoUnsignedWrap
static bool hasNoUnsignedWrap(BinaryOperator &I)
Definition: InstructionCombining.cpp:298
Constants.h
llvm::Instruction::setHasNoSignedWrap
void setHasNoSignedWrap(bool b=true)
Set or clear the nsw flag on this instruction, which must be an operator which supports this flag.
Definition: Instruction.cpp:153
llvm::User
Definition: User.h:44
C
(vector float) vec_cmpeq(*A, *B) C
Definition: README_ALTIVEC.txt:86
llvm::ms_demangle::QualifierMangleMode::Result
@ Result
llvm::Instruction
Definition: Instruction.h:42
llvm::ArrayRef::slice
ArrayRef< T > slice(size_t N, size_t M) const
slice(n, m) - Chop off the first N elements of the array, and keep M elements in the array.
Definition: ArrayRef.h:194
llvm::cl::opt< bool >
llvm::Constant
This is an important base class in LLVM.
Definition: Constant.h:41
llvm::Instruction::eraseFromParent
SymbolTableList< Instruction >::iterator eraseFromParent()
This method unlinks 'this' from the containing basic block and deletes it.
Definition: Instruction.cpp:77
VerifySubExpr
static bool VerifySubExpr(Value *Expr, SmallVectorImpl< Instruction * > &InstInputs)
Definition: PHITransAddr.cpp:57
llvm::find
auto find(R &&Range, const T &Val)
Provide wrappers to std::find which take ranges instead of having to pass begin/end explicitly.
Definition: STLExtras.h:1610
llvm::numbers::e
constexpr double e
Definition: MathExtras.h:53
I
#define I(x, y, z)
Definition: MD5.cpp:58
llvm::GetElementPtrInst
an instruction for type-safe pointer arithmetic to access elements of arrays and structs
Definition: Instructions.h:929
llvm::cl::init
initializer< Ty > init(const Ty &Val)
Definition: CommandLine.h:440
llvm::is_contained
bool is_contained(R &&Range, const E &Element)
Wrapper function around std::find to detect if an element exists in a container.
Definition: STLExtras.h:1673
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
llvm::ConstantExpr::getCast
static Constant * getCast(unsigned ops, Constant *C, Type *Ty, bool OnlyIfReduced=false)
Convenience function for getting a Cast operation.
Definition: Constants.cpp:1946
llvm::simplifyAddInst
Value * simplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW, const SimplifyQuery &Q)
Given operands for an Add, fold the result or return null.
Definition: InstructionSimplify.cpp:697
llvm::DominatorTree::isReachableFromEntry
bool isReachableFromEntry(const Use &U) const
Provide an overload for a Use.
Definition: Dominators.cpp:335
llvm::PHITransAddr::PHITranslateValue
bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT, bool MustDominate)
PHITranslateValue - PHI translate the current address up the CFG from CurBB to Pred,...
Definition: PHITransAddr.cpp:314
llvm::GetElementPtrInst::Create
static GetElementPtrInst * Create(Type *PointeeType, Value *Ptr, ArrayRef< Value * > IdxList, const Twine &NameStr="", Instruction *InsertBefore=nullptr)
Definition: Instructions.h:955
llvm::ArrayRef
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
Definition: APInt.h:32
llvm::BinaryOperator
Definition: InstrTypes.h:188
llvm::PHITransAddr::dump
void dump() const
Definition: PHITransAddr.cpp:45
llvm_unreachable
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
Definition: ErrorHandling.h:143
llvm::Value::getType
Type * getType() const
All values are typed, get the type of this value.
Definition: Value.h:255
llvm::PHITransAddr::Verify
bool Verify() const
Verify - Check internal consistency of this data structure.
Definition: PHITransAddr.cpp:91
llvm::CastInst
This is the base class for all instructions that perform data casts.
Definition: InstrTypes.h:429
llvm::Value::getName
StringRef getName() const
Return a constant reference to the value's name.
Definition: Value.cpp:308
llvm::AMDGPU::SendMsg::Op
Op
Definition: SIDefines.h:348
llvm::ConstantExpr::getAdd
static Constant * getAdd(Constant *C1, Constant *C2, bool HasNUW=false, bool HasNSW=false)
Definition: Constants.cpp:2630
isInput
static bool isInput(const StringSet<> &Prefixes, StringRef Arg)
Definition: OptTable.cpp:169
hasNoSignedWrap
static bool hasNoSignedWrap(BinaryOperator &I)
Definition: InstructionCombining.cpp:303
llvm::MCID::Add
@ Add
Definition: MCInstrDesc.h:185
llvm::makeArrayRef
ArrayRef< T > makeArrayRef(const T &OneElt)
Construct an ArrayRef from a single element.
Definition: ArrayRef.h:475
Instructions.h
llvm::User::getNumOperands
unsigned getNumOperands() const
Definition: User.h:191
llvm::Instruction::getDebugLoc
const DebugLoc & getDebugLoc() const
Return the debug location for this node as a DebugLoc.
Definition: Instruction.h:354
Dominators.h
llvm::Instruction::getParent
const BasicBlock * getParent() const
Definition: Instruction.h:91
InstructionSimplify.h
llvm::SmallVectorImpl::pop_back_val
T pop_back_val()
Definition: SmallVector.h:659
llvm::PHINode
Definition: Instructions.h:2699
llvm::BasicBlock::getTerminator
const Instruction * getTerminator() const LLVM_READONLY
Returns the terminator instruction if the block is well formed or null if the block is not well forme...
Definition: BasicBlock.h:119
llvm::SmallVectorImpl< Instruction * >
GEP
Hexagon Common GEP
Definition: HexagonCommonGEP.cpp:171
CreateAdd
static BinaryOperator * CreateAdd(Value *S1, Value *S2, const Twine &Name, Instruction *InsertBefore, Value *FlagsOp)
Definition: Reassociate.cpp:241
llvm::User::getOperand
Value * getOperand(unsigned i) const
Definition: User.h:169
llvm::cl::desc
Definition: CommandLine.h:413
raw_ostream.h
llvm::isSafeToSpeculativelyExecute
bool isSafeToSpeculativelyExecute(const Instruction *I, const Instruction *CtxI=nullptr, AssumptionCache *AC=nullptr, const DominatorTree *DT=nullptr, const TargetLibraryInfo *TLI=nullptr)
Return true if the instruction does not have any effects besides calculating the result and does not ...
Definition: ValueTracking.cpp:4733
llvm::Value
LLVM Value Representation.
Definition: Value.h:74
llvm::Value::users
iterator_range< user_iterator > users()
Definition: Value.h:421