| /external/llvm/unittests/IR/ |
| PatternMatch.cpp | 32 static void m_OrdFMin_expect_match_and_delete(Value *Cmp, Value *Select,
39 delete Cmp;
42 static void m_OrdFMin_expect_nomatch_and_delete(Value *Cmp, Value *Select,
47 delete Cmp;
50 static void m_OrdFMax_expect_match_and_delete(Value *Cmp, Value *Select,
57 delete Cmp;
60 static void m_OrdFMax_expect_nomatch_and_delete(Value *Cmp, Value *Select,
65 delete Cmp;
79 Value *Cmp = Builder.CreateFCmpOLT(L, R);
80 Value *Select = Builder.CreateSelect(Cmp, L, R)
[all...] |
| /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 | 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++/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));
|
| /external/chromium_org/chrome/browser/ui/views/ |
| accelerator_table_unittest.cc | 20 struct Cmp {
33 std::set<AcceleratorMapping, Cmp> acclerators;
48 std::set<AcceleratorMapping, Cmp> acclerators;
|
| /external/chromium_org/third_party/skia/src/core/ |
| 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/ |
| 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/llvm/lib/Support/ |
| Statistic.cpp | 91 int Cmp = std::strcmp(LHS->getName(), RHS->getName());
92 if (Cmp != 0) return Cmp < 0;
|
| /external/chromium_org/ash/accelerators/ |
| accelerator_table_unittest.cc | 15 struct Cmp {
30 std::set<AcceleratorData, Cmp> acclerators;
|
| /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/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/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 | 482 if (CmpInst *Cmp = dyn_cast<CmpInst>(I)) {
484 PHINode *PN = dyn_cast<PHINode>(Cmp->getOperand(0));
491 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB);
493 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, TD);
499 ResT = LVI->getPredicateOnEdge(Cmp->getPredicate(), LHS,
516 if (isa<Constant>(Cmp->getOperand(1)) && Cmp->getType()->isIntegerTy()) {
517 if (!isa<Instruction>(Cmp->getOperand(0)) ||
518 cast<Instruction>(Cmp->getOperand(0))->getParent() != BB) {
519 Constant *RHSCst = cast<Constant>(Cmp->getOperand(1))
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 186 /// specified instruction - everything before and including Cmp stays
187 /// in the old basic block, and everything after Cmp is moved to a
189 /// (with value of Cmp being the condition).
192 /// Cmp
196 /// Cmp
197 /// if (Cmp)
205 TerminatorInst *SplitBlockAndInsertIfThen(Instruction *Cmp,
|
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 343 // %3 = cmp i1 %1, %2
371 ICmpInst *Cmp = new ICmpInst(*BB, CmpInst::ICMP_EQ, LI1, LI2, "");
372 BranchInst::Create(NewBB, FailBB, Cmp, BB);
|
| /external/llvm/include/llvm/Support/ |
| PatternMatch.h | 860 CmpInst_t *Cmp = dyn_cast<CmpInst_t>(SI->getCondition());
861 if (!Cmp)
867 Value *LHS = Cmp->getOperand(0);
868 Value *RHS = Cmp->getOperand(1);
873 Cmp->getPredicate() : Cmp->getSwappedPredicate();
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | 386 RK_IntegerMinMax, ///< Min/max implemented in terms of select(cmp()).
389 RK_FloatMinMax ///< Min/max implemented in terms of select(cmp()).
[all...] |
