LLVM  10.0.0svn
AlignmentFromAssumptions.cpp
Go to the documentation of this file.
1 //===----------------------- AlignmentFromAssumptions.cpp -----------------===//
2 // Set Load/Store Alignments From Assumptions
3 //
4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5 // See https://llvm.org/LICENSE.txt for license information.
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements a ScalarEvolution-based transformation to set
11 // the alignments of load, stores and memory intrinsics based on the truth
12 // expressions of assume intrinsics. The primary motivation is to handle
13 // complex alignment assumptions that apply to vector loads and stores that
14 // appear after vectorization and unrolling.
15 //
16 //===----------------------------------------------------------------------===//
17 
18 #define AA_NAME "alignment-from-assumptions"
19 #define DEBUG_TYPE AA_NAME
21 #include "llvm/ADT/SmallPtrSet.h"
22 #include "llvm/ADT/Statistic.h"
26 #include "llvm/Analysis/LoopInfo.h"
29 #include "llvm/IR/Constant.h"
30 #include "llvm/IR/Dominators.h"
31 #include "llvm/IR/Instruction.h"
32 #include "llvm/IR/Intrinsics.h"
33 #include "llvm/IR/Module.h"
34 #include "llvm/Support/Debug.h"
36 #include "llvm/Transforms/Scalar.h"
37 using namespace llvm;
38 
39 STATISTIC(NumLoadAlignChanged,
40  "Number of loads changed by alignment assumptions");
41 STATISTIC(NumStoreAlignChanged,
42  "Number of stores changed by alignment assumptions");
43 STATISTIC(NumMemIntAlignChanged,
44  "Number of memory intrinsics changed by alignment assumptions");
45 
46 namespace {
47 struct AlignmentFromAssumptions : public FunctionPass {
48  static char ID; // Pass identification, replacement for typeid
49  AlignmentFromAssumptions() : FunctionPass(ID) {
51  }
52 
53  bool runOnFunction(Function &F) override;
54 
55  void getAnalysisUsage(AnalysisUsage &AU) const override {
59 
60  AU.setPreservesCFG();
66  }
67 
69 };
70 }
71 
73 static const char aip_name[] = "Alignment from assumptions";
74 INITIALIZE_PASS_BEGIN(AlignmentFromAssumptions, AA_NAME,
75  aip_name, false, false)
79 INITIALIZE_PASS_END(AlignmentFromAssumptions, AA_NAME,
80  aip_name, false, false)
81 
83  return new AlignmentFromAssumptions();
84 }
85 
86 // Given an expression for the (constant) alignment, AlignSCEV, and an
87 // expression for the displacement between a pointer and the aligned address,
88 // DiffSCEV, compute the alignment of the displaced pointer if it can be reduced
89 // to a constant. Using SCEV to compute alignment handles the case where
90 // DiffSCEV is a recurrence with constant start such that the aligned offset
91 // is constant. e.g. {16,+,32} % 32 -> 16.
92 static unsigned getNewAlignmentDiff(const SCEV *DiffSCEV,
93  const SCEV *AlignSCEV,
94  ScalarEvolution *SE) {
95  // DiffUnits = Diff % int64_t(Alignment)
96  const SCEV *DiffUnitsSCEV = SE->getURemExpr(DiffSCEV, AlignSCEV);
97 
98  LLVM_DEBUG(dbgs() << "\talignment relative to " << *AlignSCEV << " is "
99  << *DiffUnitsSCEV << " (diff: " << *DiffSCEV << ")\n");
100 
101  if (const SCEVConstant *ConstDUSCEV =
102  dyn_cast<SCEVConstant>(DiffUnitsSCEV)) {
103  int64_t DiffUnits = ConstDUSCEV->getValue()->getSExtValue();
104 
105  // If the displacement is an exact multiple of the alignment, then the
106  // displaced pointer has the same alignment as the aligned pointer, so
107  // return the alignment value.
108  if (!DiffUnits)
109  return (unsigned)
110  cast<SCEVConstant>(AlignSCEV)->getValue()->getSExtValue();
111 
112  // If the displacement is not an exact multiple, but the remainder is a
113  // constant, then return this remainder (but only if it is a power of 2).
114  uint64_t DiffUnitsAbs = std::abs(DiffUnits);
115  if (isPowerOf2_64(DiffUnitsAbs))
116  return (unsigned) DiffUnitsAbs;
117  }
118 
119  return 0;
120 }
121 
122 // There is an address given by an offset OffSCEV from AASCEV which has an
123 // alignment AlignSCEV. Use that information, if possible, to compute a new
124 // alignment for Ptr.
125 static unsigned getNewAlignment(const SCEV *AASCEV, const SCEV *AlignSCEV,
126  const SCEV *OffSCEV, Value *Ptr,
127  ScalarEvolution *SE) {
128  const SCEV *PtrSCEV = SE->getSCEV(Ptr);
129  const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV);
130 
131  // On 32-bit platforms, DiffSCEV might now have type i32 -- we've always
132  // sign-extended OffSCEV to i64, so make sure they agree again.
133  DiffSCEV = SE->getNoopOrSignExtend(DiffSCEV, OffSCEV->getType());
134 
135  // What we really want to know is the overall offset to the aligned
136  // address. This address is displaced by the provided offset.
137  DiffSCEV = SE->getMinusSCEV(DiffSCEV, OffSCEV);
138 
139  LLVM_DEBUG(dbgs() << "AFI: alignment of " << *Ptr << " relative to "
140  << *AlignSCEV << " and offset " << *OffSCEV
141  << " using diff " << *DiffSCEV << "\n");
142 
143  unsigned NewAlignment = getNewAlignmentDiff(DiffSCEV, AlignSCEV, SE);
144  LLVM_DEBUG(dbgs() << "\tnew alignment: " << NewAlignment << "\n");
145 
146  if (NewAlignment) {
147  return NewAlignment;
148  } else if (const SCEVAddRecExpr *DiffARSCEV =
149  dyn_cast<SCEVAddRecExpr>(DiffSCEV)) {
150  // The relative offset to the alignment assumption did not yield a constant,
151  // but we should try harder: if we assume that a is 32-byte aligned, then in
152  // for (i = 0; i < 1024; i += 4) r += a[i]; not all of the loads from a are
153  // 32-byte aligned, but instead alternate between 32 and 16-byte alignment.
154  // As a result, the new alignment will not be a constant, but can still
155  // be improved over the default (of 4) to 16.
156 
157  const SCEV *DiffStartSCEV = DiffARSCEV->getStart();
158  const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE);
159 
160  LLVM_DEBUG(dbgs() << "\ttrying start/inc alignment using start "
161  << *DiffStartSCEV << " and inc " << *DiffIncSCEV << "\n");
162 
163  // Now compute the new alignment using the displacement to the value in the
164  // first iteration, and also the alignment using the per-iteration delta.
165  // If these are the same, then use that answer. Otherwise, use the smaller
166  // one, but only if it divides the larger one.
167  NewAlignment = getNewAlignmentDiff(DiffStartSCEV, AlignSCEV, SE);
168  unsigned NewIncAlignment = getNewAlignmentDiff(DiffIncSCEV, AlignSCEV, SE);
169 
170  LLVM_DEBUG(dbgs() << "\tnew start alignment: " << NewAlignment << "\n");
171  LLVM_DEBUG(dbgs() << "\tnew inc alignment: " << NewIncAlignment << "\n");
172 
173  if (!NewAlignment || !NewIncAlignment) {
174  return 0;
175  } else if (NewAlignment > NewIncAlignment) {
176  if (NewAlignment % NewIncAlignment == 0) {
177  LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewIncAlignment
178  << "\n");
179  return NewIncAlignment;
180  }
181  } else if (NewIncAlignment > NewAlignment) {
182  if (NewIncAlignment % NewAlignment == 0) {
183  LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewAlignment
184  << "\n");
185  return NewAlignment;
186  }
187  } else if (NewIncAlignment == NewAlignment) {
188  LLVM_DEBUG(dbgs() << "\tnew start/inc alignment: " << NewAlignment
189  << "\n");
190  return NewAlignment;
191  }
192  }
193 
194  return 0;
195 }
196 
198  Value *&AAPtr,
199  const SCEV *&AlignSCEV,
200  const SCEV *&OffSCEV) {
201  // An alignment assume must be a statement about the least-significant
202  // bits of the pointer being zero, possibly with some offset.
203  ICmpInst *ICI = dyn_cast<ICmpInst>(I->getArgOperand(0));
204  if (!ICI)
205  return false;
206 
207  // This must be an expression of the form: x & m == 0.
208  if (ICI->getPredicate() != ICmpInst::ICMP_EQ)
209  return false;
210 
211  // Swap things around so that the RHS is 0.
212  Value *CmpLHS = ICI->getOperand(0);
213  Value *CmpRHS = ICI->getOperand(1);
214  const SCEV *CmpLHSSCEV = SE->getSCEV(CmpLHS);
215  const SCEV *CmpRHSSCEV = SE->getSCEV(CmpRHS);
216  if (CmpLHSSCEV->isZero())
217  std::swap(CmpLHS, CmpRHS);
218  else if (!CmpRHSSCEV->isZero())
219  return false;
220 
221  BinaryOperator *CmpBO = dyn_cast<BinaryOperator>(CmpLHS);
222  if (!CmpBO || CmpBO->getOpcode() != Instruction::And)
223  return false;
224 
225  // Swap things around so that the right operand of the and is a constant
226  // (the mask); we cannot deal with variable masks.
227  Value *AndLHS = CmpBO->getOperand(0);
228  Value *AndRHS = CmpBO->getOperand(1);
229  const SCEV *AndLHSSCEV = SE->getSCEV(AndLHS);
230  const SCEV *AndRHSSCEV = SE->getSCEV(AndRHS);
231  if (isa<SCEVConstant>(AndLHSSCEV)) {
232  std::swap(AndLHS, AndRHS);
233  std::swap(AndLHSSCEV, AndRHSSCEV);
234  }
235 
236  const SCEVConstant *MaskSCEV = dyn_cast<SCEVConstant>(AndRHSSCEV);
237  if (!MaskSCEV)
238  return false;
239 
240  // The mask must have some trailing ones (otherwise the condition is
241  // trivial and tells us nothing about the alignment of the left operand).
242  unsigned TrailingOnes = MaskSCEV->getAPInt().countTrailingOnes();
243  if (!TrailingOnes)
244  return false;
245 
246  // Cap the alignment at the maximum with which LLVM can deal (and make sure
247  // we don't overflow the shift).
248  uint64_t Alignment;
249  TrailingOnes = std::min(TrailingOnes,
250  unsigned(sizeof(unsigned) * CHAR_BIT - 1));
251  Alignment = std::min(1u << TrailingOnes, +Value::MaximumAlignment);
252 
253  Type *Int64Ty = Type::getInt64Ty(I->getParent()->getParent()->getContext());
254  AlignSCEV = SE->getConstant(Int64Ty, Alignment);
255 
256  // The LHS might be a ptrtoint instruction, or it might be the pointer
257  // with an offset.
258  AAPtr = nullptr;
259  OffSCEV = nullptr;
260  if (PtrToIntInst *PToI = dyn_cast<PtrToIntInst>(AndLHS)) {
261  AAPtr = PToI->getPointerOperand();
262  OffSCEV = SE->getZero(Int64Ty);
263  } else if (const SCEVAddExpr* AndLHSAddSCEV =
264  dyn_cast<SCEVAddExpr>(AndLHSSCEV)) {
265  // Try to find the ptrtoint; subtract it and the rest is the offset.
266  for (SCEVAddExpr::op_iterator J = AndLHSAddSCEV->op_begin(),
267  JE = AndLHSAddSCEV->op_end(); J != JE; ++J)
268  if (const SCEVUnknown *OpUnk = dyn_cast<SCEVUnknown>(*J))
269  if (PtrToIntInst *PToI = dyn_cast<PtrToIntInst>(OpUnk->getValue())) {
270  AAPtr = PToI->getPointerOperand();
271  OffSCEV = SE->getMinusSCEV(AndLHSAddSCEV, *J);
272  break;
273  }
274  }
275 
276  if (!AAPtr)
277  return false;
278 
279  // Sign extend the offset to 64 bits (so that it is like all of the other
280  // expressions).
281  unsigned OffSCEVBits = OffSCEV->getType()->getPrimitiveSizeInBits();
282  if (OffSCEVBits < 64)
283  OffSCEV = SE->getSignExtendExpr(OffSCEV, Int64Ty);
284  else if (OffSCEVBits > 64)
285  return false;
286 
287  AAPtr = AAPtr->stripPointerCasts();
288  return true;
289 }
290 
292  Value *AAPtr;
293  const SCEV *AlignSCEV, *OffSCEV;
294  if (!extractAlignmentInfo(ACall, AAPtr, AlignSCEV, OffSCEV))
295  return false;
296 
297  // Skip ConstantPointerNull and UndefValue. Assumptions on these shouldn't
298  // affect other users.
299  if (isa<ConstantData>(AAPtr))
300  return false;
301 
302  const SCEV *AASCEV = SE->getSCEV(AAPtr);
303 
304  // Apply the assumption to all other users of the specified pointer.
307  for (User *J : AAPtr->users()) {
308  if (J == ACall)
309  continue;
310 
311  if (Instruction *K = dyn_cast<Instruction>(J))
312  if (isValidAssumeForContext(ACall, K, DT))
313  WorkList.push_back(K);
314  }
315 
316  while (!WorkList.empty()) {
317  Instruction *J = WorkList.pop_back_val();
318 
319  if (LoadInst *LI = dyn_cast<LoadInst>(J)) {
320  unsigned NewAlignment = getNewAlignment(AASCEV, AlignSCEV, OffSCEV,
321  LI->getPointerOperand(), SE);
322 
323  if (NewAlignment > LI->getAlignment()) {
324  LI->setAlignment(NewAlignment);
325  ++NumLoadAlignChanged;
326  }
327  } else if (StoreInst *SI = dyn_cast<StoreInst>(J)) {
328  unsigned NewAlignment = getNewAlignment(AASCEV, AlignSCEV, OffSCEV,
329  SI->getPointerOperand(), SE);
330 
331  if (NewAlignment > SI->getAlignment()) {
332  SI->setAlignment(NewAlignment);
333  ++NumStoreAlignChanged;
334  }
335  } else if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(J)) {
336  unsigned NewDestAlignment = getNewAlignment(AASCEV, AlignSCEV, OffSCEV,
337  MI->getDest(), SE);
338 
339  LLVM_DEBUG(dbgs() << "\tmem inst: " << NewDestAlignment << "\n";);
340  if (NewDestAlignment > MI->getDestAlignment()) {
341  MI->setDestAlignment(NewDestAlignment);
342  ++NumMemIntAlignChanged;
343  }
344 
345  // For memory transfers, there is also a source alignment that
346  // can be set.
347  if (MemTransferInst *MTI = dyn_cast<MemTransferInst>(MI)) {
348  unsigned NewSrcAlignment = getNewAlignment(AASCEV, AlignSCEV, OffSCEV,
349  MTI->getSource(), SE);
350 
351  LLVM_DEBUG(dbgs() << "\tmem trans: " << NewSrcAlignment << "\n";);
352 
353  if (NewSrcAlignment > MTI->getSourceAlignment()) {
354  MTI->setSourceAlignment(NewSrcAlignment);
355  ++NumMemIntAlignChanged;
356  }
357  }
358  }
359 
360  // Now that we've updated that use of the pointer, look for other uses of
361  // the pointer to update.
362  Visited.insert(J);
363  for (User *UJ : J->users()) {
364  Instruction *K = cast<Instruction>(UJ);
365  if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT))
366  WorkList.push_back(K);
367  }
368  }
369 
370  return true;
371 }
372 
374  if (skipFunction(F))
375  return false;
376 
377  auto &AC = getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);
378  ScalarEvolution *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE();
379  DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
380 
381  return Impl.runImpl(F, AC, SE, DT);
382 }
383 
385  ScalarEvolution *SE_,
386  DominatorTree *DT_) {
387  SE = SE_;
388  DT = DT_;
389 
390  bool Changed = false;
391  for (auto &AssumeVH : AC.assumptions())
392  if (AssumeVH)
393  Changed |= processAssumption(cast<CallInst>(AssumeVH));
394 
395  return Changed;
396 }
397 
400 
404  if (!runImpl(F, AC, &SE, &DT))
405  return PreservedAnalyses::all();
406 
408  PA.preserveSet<CFGAnalyses>();
409  PA.preserve<AAManager>();
411  PA.preserve<GlobalsAA>();
412  return PA;
413 }
Legacy wrapper pass to provide the GlobalsAAResult object.
INITIALIZE_PASS_BEGIN(AlignmentFromAssumptions, AA_NAME, aip_name, false, false) INITIALIZE_PASS_END(AlignmentFromAssumptions
static bool runImpl(Function &F, TargetLibraryInfo &TLI, DominatorTree &DT)
This is the entry point for all transforms.
AnalysisUsage & addPreserved()
Add the specified Pass class to the set of analyses preserved by this pass.
static PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
Definition: PassManager.h:776
This class represents lattice values for constants.
Definition: AllocatorList.h:23
BinaryOps getOpcode() const
Definition: InstrTypes.h:402
This is the interface for a simple mod/ref and alias analysis over globals.
static unsigned getNewAlignment(const SCEV *AASCEV, const SCEV *AlignSCEV, const SCEV *OffSCEV, Value *Ptr, ScalarEvolution *SE)
The main scalar evolution driver.
bool isZero() const
Return true if the expression is a constant zero.
This class represents a function call, abstracting a target machine&#39;s calling convention.
An immutable pass that tracks lazily created AssumptionCache objects.
A cache of @llvm.assume calls within a function.
bool isValidAssumeForContext(const Instruction *I, const Instruction *CxtI, const DominatorTree *DT=nullptr)
Return true if it is valid to use the assumptions provided by an assume intrinsic, I, at the point in the control-flow identified by the context instruction, CxtI.
STATISTIC(NumFunctions, "Total number of functions")
Analysis pass which computes a DominatorTree.
Definition: Dominators.h:230
F(f)
An instruction for reading from memory.
Definition: Instructions.h:167
static IntegerType * getInt64Ty(LLVMContext &C)
Definition: Type.cpp:176
FunctionPass * createAlignmentFromAssumptionsPass()
MutableArrayRef< WeakTrackingVH > assumptions()
Access the list of assumption handles currently tracked for this function.
Value * getArgOperand(unsigned i) const
Definition: InstrTypes.h:1241
AnalysisUsage & addRequired()
#define INITIALIZE_PASS_DEPENDENCY(depName)
Definition: PassSupport.h:50
static const unsigned MaximumAlignment
Definition: Value.h:644
This class represents a cast from a pointer to an integer.
const APInt & getAPInt() const
This node represents a polynomial recurrence on the trip count of the specified loop.
An instruction for storing to memory.
Definition: Instructions.h:320
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree...
Definition: Dominators.h:144
Value * getOperand(unsigned i) const
Definition: User.h:169
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM)
static bool runOnFunction(Function &F, bool PostInlining)
This means that we are dealing with an entirely unknown SCEV value, and only represent it as its LLVM...
#define AA_NAME
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:153
The instances of the Type class are immutable: once they are created, they are never changed...
Definition: Type.h:45
static const char aip_name[]
A manager for alias analyses.
std::pair< iterator, bool > insert(PtrType Ptr)
Inserts Ptr if and only if there is no element in the container equal to Ptr.
Definition: SmallPtrSet.h:370
Represent the analysis usage information of a pass.
constexpr bool isPowerOf2_64(uint64_t Value)
Return true if the argument is a power of two > 0 (64 bit edition.)
Definition: MathExtras.h:433
This instruction compares its operands according to the predicate given to the constructor.
Analysis pass providing a never-invalidated alias analysis result.
FunctionPass class - This class is used to implement most global optimizations.
Definition: Pass.h:284
size_type count(ConstPtrType Ptr) const
count - Return 1 if the specified pointer is in the set, 0 otherwise.
Definition: SmallPtrSet.h:381
const SCEV * getMinusSCEV(const SCEV *LHS, const SCEV *RHS, SCEV::NoWrapFlags Flags=SCEV::FlagAnyWrap, unsigned Depth=0)
Return LHS-RHS. Minus is represented in SCEV as A+B*-1.
LLVMContext & getContext() const
getContext - Return a reference to the LLVMContext associated with this function. ...
Definition: Function.cpp:205
const Value * stripPointerCasts() const
Strip off pointer casts, all-zero GEPs and address space casts.
Definition: Value.cpp:525
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: PassManager.h:159
INITIALIZE_PASS_END(RegBankSelect, DEBUG_TYPE, "Assign register bank of generic virtual registers", false, false) RegBankSelect
A function analysis which provides an AssumptionCache.
This is the common base class for memset/memcpy/memmove.
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements...
Definition: SmallPtrSet.h:417
Type * getType() const
Return the LLVM type of this SCEV expression.
const SCEV *const * op_iterator
This is a &#39;vector&#39; (really, a variable-sized array), optimized for the case when the array is small...
Definition: SmallVector.h:837
Module.h This file contains the declarations for the Module class.
const SCEV * getNoopOrSignExtend(const SCEV *V, Type *Ty)
Return a SCEV corresponding to a conversion of the input value to the specified type.
LLVM_NODISCARD T pop_back_val()
Definition: SmallVector.h:374
void setPreservesCFG()
This function should be called by the pass, iff they do not:
Definition: Pass.cpp:301
bool extractAlignmentInfo(CallInst *I, Value *&AAPtr, const SCEV *&AlignSCEV, const SCEV *&OffSCEV)
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:132
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition: BitVector.h:940
unsigned countTrailingOnes() const
Count the number of trailing one bits.
Definition: APInt.h:1652
This node represents an addition of some number of SCEVs.
iterator_range< user_iterator > users()
Definition: Value.h:419
Represents analyses that only rely on functions&#39; control flow.
Definition: PassManager.h:114
Analysis pass that exposes the ScalarEvolution for a function.
Predicate getPredicate() const
Return the predicate for this instruction.
Definition: InstrTypes.h:807
This class wraps the llvm.memcpy/memmove intrinsics.
This class represents an analyzed expression in the program.
static unsigned getNewAlignmentDiff(const SCEV *DiffSCEV, const SCEV *AlignSCEV, ScalarEvolution *SE)
LLVM_NODISCARD bool empty() const
Definition: SmallVector.h:55
void preserveSet()
Mark an analysis set as preserved.
Definition: PassManager.h:189
const Function * getParent() const
Return the enclosing method, or null if none.
Definition: BasicBlock.h:106
#define I(x, y, z)
Definition: MD5.cpp:58
void initializeAlignmentFromAssumptionsPass(PassRegistry &)
APFloat abs(APFloat X)
Returns the absolute value of the argument.
Definition: APFloat.h:1228
LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val)
Definition: Casting.h:332
void preserve()
Mark an analysis as preserved.
Definition: PassManager.h:174
const SCEV * getURemExpr(const SCEV *LHS, const SCEV *RHS)
Represents an unsigned remainder expression based on unsigned division.
unsigned getPrimitiveSizeInBits() const LLVM_READONLY
Return the basic size of this type if it is a primitive type.
Definition: Type.cpp:114
LLVM Value Representation.
Definition: Value.h:73
const SCEV * getSCEV(Value *V)
Return a SCEV expression for the full generality of the specified expression.
The legacy pass manager&#39;s analysis pass to compute loop information.
Definition: LoopInfo.h:1208
IRTranslator LLVM IR MI
bool runImpl(Function &F, AssumptionCache &AC, ScalarEvolution *SE_, DominatorTree *DT_)
A container for analyses that lazily runs them and caches their results.
Legacy analysis pass which computes a DominatorTree.
Definition: Dominators.h:259
A wrapper pass to provide the legacy pass manager access to a suitably prepared AAResults object...
#define LLVM_DEBUG(X)
Definition: Debug.h:122
const BasicBlock * getParent() const
Definition: Instruction.h:66
This class represents a constant integer value.