| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| initializer_list_compare.pass.cpp | 25 typedef test_compare<std::less<int> > Cmp;
26 typedef std::multimap<int, double, Cmp> C;
40 Cmp(4)
54 assert(m.key_comp() == Cmp(4));
58 typedef test_compare<std::less<int> > Cmp;
59 typedef std::multimap<int, double, Cmp, min_allocator<std::pair<const int, double>>> C;
73 Cmp(4)
87 assert(m.key_comp() == Cmp(4));
|
| initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp;
28 typedef std::multimap<int, double, Cmp, A> C;
42 Cmp(4), A(5)
56 assert(m.key_comp() == Cmp(4));
62 typedef test_compare<std::less<int> > Cmp;
64 typedef std::multimap<int, double, Cmp, A> C;
78 Cmp(4), A()
92 assert(m.key_comp() == Cmp(4));
|
| /external/libcxx/test/std/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));
|
| /external/libcxx/test/std/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 | 26 typedef test_compare<std::less<int> > Cmp;
28 typedef std::set<int, Cmp, A> C;
30 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4));
40 assert(m.key_comp() == Cmp(10));
45 typedef test_compare<std::less<int> > Cmp;
47 typedef std::set<int, Cmp, A> C;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| initializer_list_compare.pass.cpp | 25 typedef test_compare<std::less<int> > Cmp;
26 typedef std::multimap<int, double, Cmp> C;
40 Cmp(4)
54 assert(m.key_comp() == Cmp(4));
58 typedef test_compare<std::less<int> > Cmp;
59 typedef std::multimap<int, double, Cmp, min_allocator<std::pair<const int, double>>> C;
73 Cmp(4)
87 assert(m.key_comp() == Cmp(4));
|
| initializer_list_compare_alloc.pass.cpp | 26 typedef test_compare<std::less<int> > Cmp;
28 typedef std::multimap<int, double, Cmp, A> C;
42 Cmp(4), A(5)
56 assert(m.key_comp() == Cmp(4));
62 typedef test_compare<std::less<int> > Cmp;
64 typedef std::multimap<int, double, Cmp, A> C;
78 Cmp(4), A()
92 assert(m.key_comp() == Cmp(4));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/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++/libcxx/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 | 26 typedef test_compare<std::less<int> > Cmp;
28 typedef std::set<int, Cmp, A> C;
30 C m({1, 2, 3, 4, 5, 6}, Cmp(10), A(4));
40 assert(m.key_comp() == Cmp(10));
45 typedef test_compare<std::less<int> > Cmp;
47 typedef std::set<int, Cmp, A> C;
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_compare.py | 21 class Cmp:
26 return '<Cmp %s>' % self.arg
29 return cmp(self.arg, other)
32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)]
51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_compare.py | 21 class Cmp:
26 return '<Cmp %s>' % self.arg
29 return cmp(self.arg, other)
32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)]
51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_compare.py | 21 class Cmp:
26 return '<Cmp %s>' % self.arg
29 return cmp(self.arg, other)
32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)]
51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_compare.py | 21 class Cmp:
26 return '<Cmp %s>' % self.arg
29 return cmp(self.arg, other)
32 set1 = [2, 2.0, 2L, 2+0j, Coerce(2), Cmp(2.0)]
51 self.assertEqual(cmp(a, b), cmp(id(a), id(b)),
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 27 Value *Cmp = CXI->getCompareOperand();
31 Value *Equal = Builder.CreateICmpEQ(Orig, Cmp);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| BoundsChecking.cpp | 63 void emitBranchToTrap(Value *Cmp = nullptr);
96 /// If Cmp is non-null, perform a jump only if its value evaluates to true.
97 void BoundsChecking::emitBranchToTrap(Value *Cmp) {
99 ConstantInt *C = dyn_cast_or_null<ConstantInt>(Cmp);
105 Cmp = nullptr; // unconditional branch
114 if (Cmp)
115 BranchInst::Create(getTrapBB(), Cont, Cmp, OldBB);
|
| SanitizerCoverage.cpp | 87 cl::desc("Experimental tracing of CMP and similar "
477 Value *Cmp = IRB.CreateICmpSGE(Constant::getNullValue(Load->getType()), Load);
479 Cmp, &*IP, false, MDBuilder(*C).createBranchWeights(1, 100000));
|
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 420 // %3 = cmp i1 %1, %2
455 Value *Cmp = B.CreateICmpEQ(LI1, LI2);
462 B.CreateCondBr(Cmp, NewBB, FailBB, Weights);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64ConditionOptimizer.cpp | 34 // cmp w8, #4
38 // cmp w8, #6
45 // cmp w8, #5
49 // cmp w8, #5 // <-- CSE pass removes this instruction
55 // TODO: maybe handle TBNZ/TBZ the same way as CMP when used instead for "a < 0"
102 CmpInfo adjustCmp(MachineInstr *CmpMI, AArch64CC::CondCode Cmp);
104 bool adjustTo(MachineInstr *CmpMI, AArch64CC::CondCode Cmp, MachineInstr *To,
152 // cmp is an alias for subs with a dead destination register.
160 DEBUG(dbgs() << "Immediate of cmp is symbolic, " << *I << '\n');
163 DEBUG(dbgs() << "Immediate of cmp may be out of range, " << *I << '\n')
[all...] |
| /external/llvm/unittests/ProfileData/ |
| InstrProfTest.cpp | 443 auto Cmp = [](const InstrProfValueData &VD1, const InstrProfValueData &VD2) {
448 std::sort(&VD_0[0], &VD_0[5], Cmp);
462 std::sort(&VD_1[0], &VD_1[4], Cmp);
474 std::sort(&VD_2[0], &VD_2[3], Cmp);
484 std::sort(&VD_3[0], &VD_3[2], Cmp);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineShifts.cpp | 764 Value *Cmp = Builder->CreateICmpEQ(II->getArgOperand(0), RHS);
765 return new ZExtInst(Cmp, II->getType());
[all...] |
| InstCombineSelect.cpp | 507 if (ConstantInt *Cmp = dyn_cast<ConstantInt>(CmpRHS)) {
509 if (Pred == ICmpInst::ICMP_SGT && Cmp->isAllOnesValue()) {
512 } else if (Pred == ICmpInst::ICMP_SLT && Cmp->isNullValue()) {
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopUtils.cpp | 310 // reductions which are represented as a cmp followed by a select.
332 // pattern or more than just a select and cmp.
370 Instruction *Cmp = nullptr;
373 // We must handle the select(cmp()) as a single instruction. Advance to the
375 if ((Cmp = dyn_cast<ICmpInst>(I)) || (Cmp = dyn_cast<FCmpInst>(I))) {
376 if (!Cmp->hasOneUse() || !(Select = dyn_cast<SelectInst>(*I->user_begin())))
384 if (!(Cmp = dyn_cast<ICmpInst>(I->getOperand(0))) &&
385 !(Cmp = dyn_cast<FCmpInst>(I->getOperand(0))))
387 if (!Cmp->hasOneUse()
[all...] |
