| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/multiset.cons/ |
| initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp;
24 typedef std::multiset<int, Cmp> C;
26 C m({1, 2, 3, 4, 5, 6}, Cmp(10));
36 assert(m.key_comp() == Cmp(10));
|
| initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp;
26 typedef std::multiset<int, Cmp, A> C;
28 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4));
38 assert(m.key_comp() == Cmp(10));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/set.cons/ |
| initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp;
24 typedef std::set<int, Cmp> C;
26 C m({1, 2, 3, 4, 5, 6}, Cmp(10));
36 assert(m.key_comp() == Cmp(10));
|
| initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp;
26 typedef std::set<int, Cmp, A> C;
28 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4));
38 assert(m.key_comp() == Cmp(10));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.cons/ |
| initializer_list_compare.pass.cpp | 23 typedef test_compare<std::less<int> > Cmp;
24 typedef std::multimap<int, double, Cmp> C;
38 Cmp(4)
52 assert(m.key_comp() == Cmp(4));
|
| initializer_list_compare_alloc.pass.cpp | 24 typedef test_compare<std::less<int> > Cmp;
26 typedef std::multimap<int, double, Cmp, A> C;
40 Cmp(4), A(5)
54 assert(m.key_comp() == Cmp(4));
|
| /external/skia/legacy/src/core/ |
| SkPtrRecorder.cpp | 21 int SkPtrSet::Cmp(const Pair& a, const Pair& b) {
34 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp);
50 int index = SkTSearch<Pair>(fList.begin(), count, pair, sizeof(pair), &Cmp);
|
| SkFP.h | 68 #define SkFPLT(a, b) (SkFloat::Cmp(a, b) < 0)
69 #define SkFPLE(a, b) (SkFloat::Cmp(a, b) <= 0)
70 #define SkFPGT(a, b) (SkFloat::Cmp(a, b) > 0)
71 #define SkFPGE(a, b) (SkFloat::Cmp(a, b) >= 0)
|
| SkFloat.h | 58 friend bool operator<(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) < 0; }
59 friend bool operator<=(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) <= 0; }
60 friend bool operator>(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) > 0; }
61 friend bool operator>=(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) >= 0; }
106 static int Cmp(int32_t, int32_t);
|
| /external/skia/src/core/ |
| SkPtrRecorder.cpp | 24 int SkPtrSet::Cmp(const Pair* a, const Pair* b) {
37 int index = SkTSearch<Pair, Cmp>(fList.begin(), count, pair, sizeof(pair));
53 int index = SkTSearch<Pair, Cmp>(fList.begin(), count, pair, sizeof(pair));
|
| SkFP.h | 68 #define SkFPLT(a, b) (SkFloat::Cmp(a, b) < 0)
69 #define SkFPLE(a, b) (SkFloat::Cmp(a, b) <= 0)
70 #define SkFPGT(a, b) (SkFloat::Cmp(a, b) > 0)
71 #define SkFPGE(a, b) (SkFloat::Cmp(a, b) >= 0)
|
| SkFloat.h | 58 friend bool operator<(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) < 0; }
59 friend bool operator<=(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) <= 0; }
60 friend bool operator>(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) > 0; }
61 friend bool operator>=(const SkFloat& a, const SkFloat& b) { return Cmp(a.fPacked, b.fPacked) >= 0; }
106 static int Cmp(int32_t, int32_t);
|
| SkPtrRecorder.h | 71 // we store the ptrs in sorted-order (using Cmp) so that we can efficiently
77 static int Cmp(const Pair* a, const Pair* b);
|
| /external/llvm/lib/Support/ |
| Statistic.cpp | 91 int Cmp = std::strcmp(LHS->getName(), RHS->getName());
92 if (Cmp != 0) return Cmp < 0;
|
| /external/skia/legacy/include/core/ |
| SkPtrRecorder.h | 68 // we store the ptrs in sorted-order (using Cmp) so that we can efficiently
74 static int Cmp(const Pair& a, const Pair& b);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 64 void emitBranchToTrap(Value *Cmp = 0);
100 /// If Cmp is non-null, perform a jump only if its value evaluates to true.
101 void BoundsChecking::emitBranchToTrap(Value *Cmp) {
103 ConstantInt *C = dyn_cast_or_null<ConstantInt>(Cmp);
109 Cmp = 0; // unconditional branch
118 if (Cmp)
119 BranchInst::Create(getTrapBB(), Cont, Cmp, OldBB);
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonHardwareLoops.cpp | 110 static Kind getSwappedComparison(Kind Cmp) {
111 assert ((!((Cmp & L) && (Cmp & G))) && "Malformed comparison operator");
112 if ((Cmp & L) || (Cmp & G))
113 return (Kind)(Cmp ^ (L|G));
114 return Cmp;
151 Comparison::Kind Cmp) const;
452 // Look for the cmp instruction to determine if we can get a useful trip
521 Comparison::Kind Cmp;
[all...] |
| /external/clang/utils/TableGen/ |
| OptParserEmitter.cpp | 51 if (int Cmp = StrCmpOptionName(A->getValueAsString("Name").c_str(),
53 return Cmp;
66 if (int Cmp = StrCmpOptionName(APre->c_str(), BPre->c_str()))
67 return Cmp;
|
| /external/llvm/utils/TableGen/ |
| OptParserEmitter.cpp | 51 if (int Cmp = StrCmpOptionName(A->getValueAsString("Name").c_str(),
53 return Cmp;
66 if (int Cmp = StrCmpOptionName(APre->c_str(), BPre->c_str()))
67 return Cmp;
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 26 Value *Cmp = CXI->getCompareOperand();
30 Value *Equal = Builder.CreateICmpEQ(Orig, Cmp);
|
| JumpThreading.cpp | 480 if (CmpInst *Cmp = dyn_cast<CmpInst>(I)) {
482 PHINode *PN = dyn_cast<PHINode>(Cmp->getOperand(0));
489 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB);
491 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, TD);
497 ResT = LVI->getPredicateOnEdge(Cmp->getPredicate(), LHS,
514 if (isa<Constant>(Cmp->getOperand(1)) && Cmp->getType()->isIntegerTy()) {
515 if (!isa<Instruction>(Cmp->getOperand(0)) ||
516 cast<Instruction>(Cmp->getOperand(0))->getParent() != BB) {
517 Constant *RHSCst = cast<Constant>(Cmp->getOperand(1))
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 208 /// specified instruction - everything before and including Cmp stays
209 /// in the old basic block, and everything after Cmp is moved to a
211 /// (with value of Cmp being the condition).
214 /// Cmp
218 /// Cmp
219 /// if (Cmp)
227 TerminatorInst *SplitBlockAndInsertIfThen(Instruction *Cmp,
|
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 317 // %3 = cmp i1 %1, %2
345 ICmpInst *Cmp = new ICmpInst(*BB, CmpInst::ICMP_EQ, LI1, LI2, "");
346 BranchInst::Create(NewBB, FailBB, Cmp, BB);
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 691 /// specified instruction - everything before and including Cmp stays
692 /// in the old basic block, and everything after Cmp is moved to a
694 /// (with value of Cmp being the condition).
697 /// Cmp
701 /// Cmp
702 /// if (Cmp)
710 TerminatorInst *llvm::SplitBlockAndInsertIfThen(Instruction *Cmp,
712 Instruction *SplitBefore = Cmp->getNextNode();
724 BranchInst::Create(/*ifTrue*/ThenBlock, /*ifFalse*/Tail, Cmp);
|
| /external/llvm/include/llvm/Support/ |
| PatternMatch.h | 847 ICmpInst *Cmp = dyn_cast<ICmpInst>(SI->getCondition());
848 if (!Cmp)
854 Value *LHS = Cmp->getOperand(0);
855 Value *RHS = Cmp->getOperand(1);
860 Cmp->getPredicate() : Cmp->getSwappedPredicate();
|
