| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPUFrameLowering.cpp | 87 int UpperBound = FI == -1 ? MFI->getNumObjects() : FI;
89 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/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 83 ConstantInt *LowerBound, ConstantInt *UpperBound,
201 /// The function recursively builds this tree. LowerBound and UpperBound are
207 ConstantInt *UpperBound, Value *Val,
218 if (Begin->Low == LowerBound && Begin->High == UpperBound) {
220 if (LowerBound && UpperBound)
222 UpperBound->getSExtValue() - LowerBound->getSExtValue();
269 if (UpperBound) {
270 dbgs() << UpperBound->getSExtValue() << "\n";
287 UpperBound, Val, NewNode, OrigBlock,
331 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Leaf.High)
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| DynamicTypePropagation.cpp | 573 const ObjCObjectPointerType *UpperBound = OrigObjectPtrType;
575 std::swap(LowerBound, UpperBound);
578 LowerBound = LowerBound->isObjCIdType() ? UpperBound : LowerBound;
579 UpperBound = UpperBound->isObjCIdType() ? LowerBound : UpperBound;
581 if (storeWhenMoreInformative(State, Sym, TrackedType, LowerBound, UpperBound,
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 531 APInt UpperBound = CUB->getAPInt();
532 DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
533 if (Xq.sgt(UpperBound) || Yq.sgt(UpperBound)) {
[all...] |
| ScalarEvolution.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 706 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
710 void Shift(BitVector& Visited, int LowerBound, int UpperBound);
|
| /external/clang/utils/TableGen/ |
| NeonEmitter.cpp | [all...] |
| /frameworks/compile/libbcc/lib/Renderscript/ |
| RSKernelExpand.cpp | 389 /// for (i = LowerBound; i < UpperBound; i++)
399 /// @param UpperBound The maximal value of the loop iterator
404 llvm::Value *UpperBound,
406 bccAssert(LowerBound->getType() == UpperBound->getType());
423 // if (LowerBound < Upperbound)
427 Cond = Builder.CreateICmpULT(LowerBound, UpperBound);
435 // if (iv.next < Upperbound)
444 Cond = Builder.CreateICmpULT(IVNext, UpperBound);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| 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>(),
|
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAndOrXor.cpp | 320 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
321 return Builder->CreateICmpULT(Add, UpperBound);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| wininet.h | [all...] |
| /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/ |
| org.sat4j.pb_2.3.5.v201308161310.jar | |
| /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
| org.sat4j.pb_2.3.5.v20130525.jar | |
