HomeSort by: relevance | last modified time | path
    Searched defs:UpperBound (Results 1 - 12 of 12) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
R600FrameLowering.cpp 31 int UpperBound = FI == -1 ? MFI.getNumObjects() : FI;
33 for (int i = MFI.getObjectIndexBegin(); i < UpperBound; ++i) {
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
map.bench.cpp 954 struct UpperBound : Base {
1034 makeCartesianProductBenchmark<UpperBound, AllModes, AllOrders>(MapSize);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LibCallsShrinkWrap.cpp 321 float UpperBound;
324 UpperBound = 709.0f;
327 UpperBound = 88.0f;
330 UpperBound = 11356.0f;
337 return createCond(CI, CmpInst::FCMP_OGT, UpperBound);
343 float UpperBound, LowerBound;
348 UpperBound = 710.0f;
353 UpperBound = 89.0f;
358 UpperBound = 11357.0f;
362 UpperBound = 709.0f
    [all...]
LowerSwitch.cpp 157 ConstantInt *UpperBound, BasicBlock *OrigBlock,
175 } else if (Leaf.High == UpperBound) {
188 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High);
189 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
217 /// The function recursively builds this tree. LowerBound and UpperBound are
222 ConstantInt *UpperBound, Value *Val,
226 assert(LowerBound && UpperBound && "Bounds must be initialized");
234 if (Begin->Low == LowerBound && Begin->High == UpperBound) {
236 NumMergedCases = UpperBound->getSExtValue() - LowerBound->getSExtValue();
240 return NewLeafBlock(*Begin, Val, LowerBound, UpperBound, OrigBlock
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
InstructionSelectorImpl.h 185 int64_t UpperBound = MatchTable[CurrentIdx++];
193 << LowerBound << ", " << UpperBound << "), Default=" << Default
196 if (Opcode < LowerBound || UpperBound <= Opcode) {
213 int64_t UpperBound = MatchTable[CurrentIdx++];
222 << UpperBound << "), Default=" << Default
240 if (TypeID < LowerBound || UpperBound <= TypeID) {
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DynamicTypePropagation.cpp 689 const ObjCObjectPointerType *UpperBound = OrigObjectPtrType;
691 std::swap(LowerBound, UpperBound);
694 LowerBound = LowerBound->isObjCIdType() ? UpperBound : LowerBound;
695 UpperBound = UpperBound->isObjCIdType() ? LowerBound : UpperBound;
697 if (storeWhenMoreInformative(State, Sym, TrackedType, LowerBound, UpperBound,
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
TargetTransformInfo.h 490 bool UpperBound;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
MemorySSA.cpp 1423 unsigned long UpperBound = VersionStack.size() - 1;
1425 if (UpperBound - LocInfo.LowerBound > MaxCheckLimit) {
1429 << UpperBound - LocInfo.LowerBound
1438 while (UpperBound > LocInfo.LowerBound) {
1439 if (isa<MemoryPhi>(VersionStack[UpperBound])) {
1444 while (VersionStack[UpperBound] != Result) {
1445 assert(UpperBound != 0);
1446 --UpperBound;
1452 MemoryDef *MD = cast<MemoryDef>(VersionStack[UpperBound]);
1459 --UpperBound;
    [all...]
DependenceAnalysis.cpp 547 const APInt &UpperBound = CUB->getAPInt();
548 LLVM_DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
549 if (Xq.sgt(UpperBound) || Yq.sgt(UpperBound)) {
1165 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) {
1166 LLVM_DEBUG(dbgs() << "\t UpperBound = " << *UpperBound);
1167 LLVM_DEBUG(dbgs() << ", " << *UpperBound->getType() << "\n");
1172 const SCEV *Product = SE->getMulExpr(UpperBound, AbsCoeff);
1269 // If i > upperbound, there is no dependence
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
LLVMContextImpl.h 307 Metadata *UpperBound;
310 MDNodeKeyImpl(Metadata *CountNode, Metadata *LowerBound, Metadata *UpperBound,
312 : CountNode(CountNode), LowerBound(LowerBound), UpperBound(UpperBound),
316 UpperBound(N->getRawUpperBound()), Stride(N->getRawStride()) {}
336 BoundsEqual(UpperBound, RHS->getRawUpperBound()) &&
344 LowerBound, UpperBound, Stride);
345 return hash_combine(CountNode, LowerBound, UpperBound, Stride);
352 Metadata *UpperBound;
355 MDNodeKeyImpl(Metadata *CountNode, Metadata *LowerBound, Metadata *UpperBound,
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Frontend/OpenMP/
OMPIRBuilder.cpp 948 // LowerBound, UpperBound, and STride for createCanonicalLoop
1283 Value *PUpperBound = Builder.CreateAlloca(IVTy, nullptr, "p.upperbound");
1294 Value *UpperBound = Builder.CreateSub(CLI->getTripCount(), One);
1295 Builder.CreateStore(UpperBound, PUpperBound);
1406 Value *PUpperBound = Builder.CreateAlloca(IVTy, nullptr, "p.upperbound");
1417 Value *UpperBound = CLI->getTripCount();
1418 Builder.CreateStore(UpperBound, PUpperBound);
1442 UpperBound, /* step */ One, Chunk});
1472 // * Use the UpperBound returned from the DynamicNext call.
1475 UpperBound = Builder.CreateLoad(IVTy, PUpperBound, "ub")
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGDebugInfo.cpp 745 auto *UpperBound = DBuilder.createExpression(Expr);
748 /*count*/ nullptr, LowerBound, UpperBound, /*stride*/ nullptr);
805 auto *UpperBound = DBuilder.createExpression(Expr);
807 /*count*/ nullptr, LowerBound, UpperBound, /*stride*/ nullptr);
2870 nullptr /*upperBound*/, nullptr /*stride*/);
2876 CountNode /*count*/, nullptr /*lowerBound*/, nullptr /*upperBound*/,
2905 ColumnCountNode /*count*/, nullptr /*lowerBound*/, nullptr /*upperBound*/,
2908 RowCountNode /*count*/, nullptr /*lowerBound*/, nullptr /*upperBound*/,
2966 nullptr /*upperBound*/, nullptr /*stride*/));
2972 CountNode /*count*/, nullptr /*lowerBound*/, nullptr /*upperBound*/,
    [all...]

Completed in 32 milliseconds