/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | R600FrameLowering.cpp | 35 int UpperBound = FI == -1 ? MFI.getNumObjects() : FI; local 37 for (int i = MFI.getObjectIndexBegin(); i < UpperBound; ++i) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LibCallsShrinkWrap.cpp | 321 float UpperBound; local 324 UpperBound = 709.0f; 327 UpperBound = 88.0f; 330 UpperBound = 11356.0f; 337 return createCond(CI, CmpInst::FCMP_OGT, UpperBound); 343 float UpperBound, LowerBound; local 348 UpperBound = 710.0f; 353 UpperBound = 89.0f; 358 UpperBound = 11357.0f; 362 UpperBound [all...] |
H A D | LowerSwitch.cpp | 107 ConstantInt *LowerBound, ConstantInt *UpperBound, 112 ConstantInt *LowerBound, ConstantInt *UpperBound, 244 /// The function recursively builds this tree. LowerBound and UpperBound are 250 ConstantInt *UpperBound, Value *Val, 254 assert(LowerBound && UpperBound && "Bounds must be initialized"); 262 if (Begin->Low == LowerBound && Begin->High == UpperBound) { 264 NumMergedCases = UpperBound->getSExtValue() - LowerBound->getSExtValue(); 268 return newLeafBlock(*Begin, Val, LowerBound, UpperBound, OrigBlock, 305 << ", " << UpperBound->getSExtValue() << "]\n"); 319 UpperBound, Va 249 switchConvert(CaseItr Begin, CaseItr End, ConstantInt *LowerBound, ConstantInt *UpperBound, Value *Val, BasicBlock *Predecessor, BasicBlock *OrigBlock, BasicBlock *Default, const std::vector<IntRange> &UnreachableRanges) argument 333 newLeafBlock(CaseRange &Leaf, Value *Val, ConstantInt *LowerBound, ConstantInt *UpperBound, BasicBlock *OrigBlock, BasicBlock *Default) argument 368 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); local 474 ConstantInt *UpperBound = nullptr; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 549 int UpperBound, LowerBound; 551 UpperBound = Node2Index[X->NodeNum]; 554 if (LowerBound < UpperBound) { 557 DFS(Y, UpperBound, HasLoop); 560 Shift(Visited, LowerBound, UpperBound); 570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, 586 if (Node2Index[s] == UpperBound) { 591 if (!Visited.test(s) && Node2Index[s] < UpperBound) { 603 int UpperBound = Node2Index[TargetSU.NodeNum]; 608 if (LowerBound > UpperBound) { [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | LoopUnrollPass.h | 106 LoopUnrollOptions &setUpperBound(bool UpperBound) { argument 107 AllowUpperBound = UpperBound;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/ |
H A D | Scalar.h | 195 int Runtime = -1, int UpperBound = -1,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnrollPass.cpp | 205 UP.UpperBound = false; 244 UP.UpperBound = false; 262 UP.UpperBound = *UserUpperBound; 803 if (!(UP.UpperBound || MaxOrZero) || 822 TripMultiple = UP.UpperBound ? 1 : TripMultiple; 836 TripMultiple = UP.UpperBound ? 1 : TripMultiple; 1207 Optional<bool> UpperBound = None, 1214 ProvidedRuntime(Runtime), ProvidedUpperBound(UpperBound), 1275 int AllowPartial, int Runtime, int UpperBound, 1286 UpperBound 1273 createLoopUnrollPass(int OptLevel, bool OnlyWhenForced, bool ForgetAllSCEV, int Threshold, int Count, int AllowPartial, int Runtime, int UpperBound, int AllowPeeling) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | DynamicTypePropagation.cpp | 596 const ObjCObjectPointerType *UpperBound = OrigObjectPtrType; local 598 std::swap(LowerBound, UpperBound); 601 LowerBound = LowerBound->isObjCIdType() ? UpperBound : LowerBound; 602 UpperBound = UpperBound->isObjCIdType() ? LowerBound : UpperBound; 604 if (storeWhenMoreInformative(State, Sym, TrackedType, LowerBound, UpperBound,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DependenceAnalysis.cpp | 547 const APInt &UpperBound = CUB->getAPInt(); local 548 LLVM_DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n"); 549 if (Xq.sgt(UpperBound) || Yq.sgt(UpperBound)) { 1163 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) { 1164 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound); 1165 LLVM_DEBUG(dbgs() << ", " << *UpperBound->getType() << "\n"); 1170 const SCEV *Product = SE->getMulExpr(UpperBound, AbsCoeff); 1341 if (const SCEV *UpperBound [all...] |
H A D | MemorySSA.cpp | 1411 unsigned long UpperBound = VersionStack.size() - 1; local 1413 if (UpperBound - LocInfo.LowerBound > MaxCheckLimit) { 1417 << UpperBound - LocInfo.LowerBound 1426 while (UpperBound > LocInfo.LowerBound) { 1427 if (isa<MemoryPhi>(VersionStack[UpperBound])) { 1432 while (VersionStack[UpperBound] != Result) { 1433 assert(UpperBound != 0); 1434 --UpperBound; 1440 MemoryDef *MD = cast<MemoryDef>(VersionStack[UpperBound]); 1444 // Reset UpperBound t [all...] |
H A D | InlineCost.cpp | 414 void addCost(int64_t Inc, int64_t UpperBound = INT_MAX) { 415 assert(UpperBound > 0 && UpperBound <= INT_MAX && "invalid upper bound"); 416 Cost = (int)std::min(UpperBound, Cost + Inc);
|
H A D | ScalarEvolution.cpp | 7763 const SCEV *UpperBound = 7765 return ExitLimit(getCouldNotCompute(), UpperBound, false);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
H A D | ProgramState.cpp | 315 DefinedOrUnknownSVal UpperBound, 318 if (Idx.isUnknown() || UpperBound.isUnknown()) 321 // Build an expression for 0 <= Idx < UpperBound. 322 // This is the same as Idx + MIN < UpperBound + MIN, if overflow is allowed. 342 svalBuilder.evalBinOpNN(this, BO_Add, UpperBound.castAs<NonLoc>(), 314 assumeInBound(DefinedOrUnknownSVal Idx, DefinedOrUnknownSVal UpperBound, bool Assumption, QualType indexTy) const argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | InstructionSelectorImpl.h | 160 int64_t UpperBound = MatchTable[CurrentIdx++]; local 168 << LowerBound << ", " << UpperBound << "), Default=" << Default 171 if (Opcode < LowerBound || UpperBound <= Opcode) { 188 int64_t UpperBound = MatchTable[CurrentIdx++]; local 197 << UpperBound << "), Default=" << Default 215 if (TypeID < LowerBound || UpperBound <= TypeID) {
|
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | NeonEmitter.cpp | 2061 std::string LowerBound, UpperBound; 2071 UpperBound = "15"; 2073 UpperBound = "31"; 2075 UpperBound = "63"; 2083 UpperBound = utostr(Def->getReturnType().getElementSizeInBits() - 1); 2091 UpperBound = "RFT(TV, true)"; 2096 UpperBound = "RFT(TV, false, true)"; 2098 UpperBound = "RFT(TV, false, false)"; 2103 UpperBound = utostr(T.getNumElements() - 1); 2115 if (!UpperBound [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 710 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop); 714 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
H A D | BasicTTIImpl.h | 494 UP.Partial = UP.Runtime = UP.UpperBound = true;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFContext.cpp | 1045 if (Optional<int64_t> UpperBound = 1050 Size *= *UpperBound - LowerBound + 1;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaLookup.cpp | 4257 unsigned UpperBound = (TypoStr.size() + 2) / 3; 4258 unsigned ED = TypoStr.edit_distance(Name, true, UpperBound); 4259 if (ED > UpperBound) return;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | TargetTransformInfo.h | 490 bool UpperBound; member in struct:llvm::TargetTransformInfo::UnrollingPreferences
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 1262 UP.UpperBound = true;
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | GlobalISelEmitter.cpp | 5687 const int64_t UpperBound = Values.rbegin()->getRawValue() + 1; 5692 << MatchTable::IntValue(UpperBound) << MatchTable::Comment(")")
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGStmtOpenMP.cpp | 5281 enum { LowerBound = 5, UpperBound, Stride, LastIter }; 5284 auto *UBP = std::next(I, UpperBound);
|