HomeSort by relevance Sort by last modified time
    Searched refs:UpperBound (Results 1 - 25 of 54) sorted by null

1 2 3

  /external/llvm/lib/Target/AMDGPU/
AMDGPUFrameLowering.cpp 89 int UpperBound = FI == -1 ? MFI->getNumObjects() : FI;
91 for (int i = MFI->getObjectIndexBegin(); i < UpperBound; ++i) {
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 519 int UpperBound, LowerBound;
521 UpperBound = Node2Index[X->NodeNum];
524 if (LowerBound < UpperBound) {
527 DFS(Y, UpperBound, HasLoop);
530 Shift(Visited, LowerBound, UpperBound);
544 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
559 if (Node2Index[s] == UpperBound) {
564 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
574 int UpperBound) {
579 for (i = LowerBound; i <= UpperBound; ++i)
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
ScheduleDAG.cpp 491 int UpperBound, LowerBound;
493 UpperBound = Node2Index[X->NodeNum];
496 if (LowerBound < UpperBound) {
499 DFS(Y, UpperBound, HasLoop);
502 Shift(Visited, LowerBound, UpperBound);
516 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
528 if (Node2Index[s] == UpperBound) {
533 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
543 int UpperBound) {
548 for (i = LowerBound; i <= UpperBound; ++i)
    [all...]
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 77 ConstantInt *LowerBound, ConstantInt *UpperBound,
195 /// The function recursively builds this tree. LowerBound and UpperBound are
201 ConstantInt *UpperBound, Value *Val,
212 if (Begin->Low == LowerBound && Begin->High == UpperBound) {
214 if (LowerBound && UpperBound)
216 UpperBound->getSExtValue() - LowerBound->getSExtValue();
263 if (UpperBound) {
264 dbgs() << UpperBound->getSExtValue() << "\n";
281 UpperBound, Val, NewNode, OrigBlock,
325 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High)
    [all...]
  /external/llvm/unittests/ADT/
SparseSetTest.cpp 189 const unsigned UpperBound = 300;
190 Set.setUniverse(UpperBound);
191 for (unsigned i = 0; i < UpperBound; ++i)
196 unsigned Expected = UpperBound;
203 for (unsigned i = 0; i < UpperBound; ++i)
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/
Scalar.h 187 int UpperBound = -1);
  /external/clang/lib/StaticAnalyzer/Checkers/
DynamicTypePropagation.cpp 598 const ObjCObjectPointerType *UpperBound = OrigObjectPtrType;
600 std::swap(LowerBound, UpperBound);
603 LowerBound = LowerBound->isObjCIdType() ? UpperBound : LowerBound;
604 UpperBound = UpperBound->isObjCIdType() ? LowerBound : UpperBound;
606 if (storeWhenMoreInformative(State, Sym, TrackedType, LowerBound, UpperBound,
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
LowerSwitch.cpp 206 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High);
207 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 526 const APInt &UpperBound = CUB->getAPInt();
527 DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
528 if (Xq.sgt(UpperBound) || Yq.sgt(UpperBound)) {
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
ScheduleDAG.h 678 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
682 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
ScheduleDAG.h 703 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
707 void Shift(BitVector& Visited, int LowerBound, int UpperBound);

Completed in 1137 milliseconds

1 2 3