| /external/llvm/lib/Target/R600/ |
| H A D | AMDGPUFrameLowering.cpp | 81 int UpperBound = FI == -1 ? MFI->getNumObjects() : FI; local
83 for (int i = MFI->getObjectIndexBegin(); i < UpperBound; ++i) {
|
| /external/llvm/lib/Transforms/Utils/ |
| H A D | LowerSwitch.cpp | 69 ConstantInt *LowerBound, ConstantInt *UpperBound,
136 // LowerBound and UpperBound are used to keep track of the bounds for Val
141 ConstantInt *UpperBound, Value *Val,
151 if (Begin->Low == LowerBound && Begin->High == UpperBound) {
176 // have a value outside of a case range, so set the UpperBound to the highest
197 if (UpperBound) {
198 dbgs() << cast<ConstantInt>(UpperBound)->getSExtValue() << "\n";
206 UpperBound, Val, OrigBlock, Default);
259 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High); local
260 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
139 switchConvert(CaseItr Begin, CaseItr End, ConstantInt *LowerBound, ConstantInt *UpperBound, Value *Val, BasicBlock *OrigBlock, BasicBlock *Default) argument
375 ConstantInt *UpperBound = nullptr; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| H A D | ScheduleDAG.cpp | 521 int UpperBound, LowerBound;
523 UpperBound = Node2Index[X->NodeNum];
526 if (LowerBound < UpperBound) {
529 DFS(Y, UpperBound, HasLoop);
532 Shift(Visited, LowerBound, UpperBound);
546 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
561 if (Node2Index[s] == UpperBound) {
566 if (!Visited.test(s) && Node2Index[s] < UpperBound) {
576 int UpperBound) {
581 for (i = LowerBound; i <= UpperBound;
[all...] |
| /external/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 531 APInt UpperBound = CUB->getValue()->getValue(); local
532 DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
533 if (Xq.sgt(UpperBound) || Yq.sgt(UpperBound)) {
1031 if (const SCEV *UpperBound = collectUpperBound(CurLoop, Delta->getType())) {
1032 DEBUG(dbgs() << "\t UpperBound = " << *UpperBound);
1033 DEBUG(dbgs() << ", " << *UpperBound->getType() << "\n");
1038 const SCEV *Product = SE->getMulExpr(UpperBound, AbsCoeff);
1215 if (const SCEV *UpperBound
[all...] |
| /external/clang/utils/TableGen/ |
| H A D | NeonEmitter.cpp | 2104 std::string LowerBound, UpperBound; local
2112 UpperBound = "31";
2114 UpperBound = "63";
2122 UpperBound = utostr(Def->getReturnType().getElementSizeInBits() - 1);
2130 UpperBound = "RFT(TV, true)";
2135 UpperBound = "RFT(TV, false, true)";
2137 UpperBound = "RFT(TV, false, false)";
2142 UpperBound = utostr(T.getNumElements() - 1);
2154 if (UpperBound.size())
2155 OS << " u = " << UpperBound << ";"; local
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 706 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
710 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| H A D | compose.h | 252 if (label > open_parens_.UpperBound())
267 if (label > close_parens_.UpperBound())
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| H A D | ProgramState.cpp | 305 DefinedOrUnknownSVal UpperBound,
308 if (Idx.isUnknown() || UpperBound.isUnknown())
311 // Build an expression for 0 <= Idx < UpperBound.
312 // This is the same as Idx + MIN < UpperBound + MIN, if overflow is allowed.
333 svalBuilder.evalBinOpNN(this, BO_Add, UpperBound.castAs<NonLoc>(),
304 assumeInBound(DefinedOrUnknownSVal Idx, DefinedOrUnknownSVal UpperBound, bool Assumption, QualType indexTy) const argument
|
| /external/openfst/src/include/fst/ |
| H A D | util.h | 441 Key UpperBound() const { return max_key_; } function in class:fst::CompactSet
|
| /external/clang/lib/Sema/ |
| H A D | SemaLookup.cpp | 3520 unsigned UpperBound = (TypoStr.size() + 2) / 3 + 1; local
3521 unsigned ED = TypoStr.edit_distance(Name, true, UpperBound);
3522 if (ED >= UpperBound) return;
|
| /external/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineAndOrXor.cpp | 283 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi); local
284 return Builder->CreateICmpULT(Add, UpperBound);
|