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

  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 490 int UpperBound, LowerBound;
492 UpperBound = Node2Index[X->NodeNum];
495 if (LowerBound < UpperBound) {
498 DFS(Y, UpperBound, HasLoop);
501 Shift(Visited, LowerBound, UpperBound);
515 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
527 if (Node2Index[s] == UpperBound) {
532 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
542 int UpperBound) {
547 for (i = LowerBound; i <= UpperBound; ++i)
    [all...]
  /external/webkit/Source/WebCore/platform/image-decoders/
ImageDecoder.cpp 246 UpperBound,
275 case UpperBound:
303 return getScaledValue<UpperBound>(m_scaledColumns, origX, searchStart);
313 return getScaledValue<UpperBound>(m_scaledRows, origY, searchStart);
  /external/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/clang/lib/StaticAnalyzer/Core/
GRState.cpp 274 DefinedOrUnknownSVal UpperBound,
276 if (Idx.isUnknown() || UpperBound.isUnknown())
279 // Build an expression for 0 <= Idx < UpperBound.
280 // This is the same as Idx + MIN < UpperBound + MIN, if overflow is allowed.
300 svalBuilder.evalBinOpNN(this, BO_Add, cast<NonLoc>(UpperBound),
  /external/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);
  /external/clang/lib/Basic/
SourceManager.cpp     [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineAndOrXor.cpp 358 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
359 return Builder->CreateICmpULT(Add, UpperBound);
    [all...]
  /external/clang/lib/CodeGen/
CGDebugInfo.cpp     [all...]
  /external/clang/lib/Sema/
SemaLookup.cpp     [all...]

Completed in 219 milliseconds