/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));
|
/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));
|
/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);
|
SkFloat.cpp | 257 int SkFloat::Cmp(int32_t packed_a, int32_t packed_b)
|
/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));
|
SkFloat.cpp | 257 int SkFloat::Cmp(int32_t packed_a, int32_t packed_b)
|
/external/llvm/lib/Support/ |
Statistic.cpp | 91 int Cmp = std::strcmp(LHS->getName(), RHS->getName()); 92 if (Cmp != 0) return Cmp < 0;
|
/external/llvm/lib/Transforms/Scalar/ |
LowerAtomic.cpp | 26 Value *Cmp = CXI->getCompareOperand(); 30 Value *Equal = Builder.CreateICmpEQ(Orig, Cmp);
|
CodeGenPrepare.cpp | 54 STATISTIC(NumCmpUses, "Number of uses of Cmp expressions replaced with uses of " 544 /// InsertedCmp - Only insert a cmp in each block once. 560 // Figure out which BB this cmp is used in. 563 // If this user is in the same block as the cmp, don't change the cmp. 566 // If we have already inserted a cmp into this block, use it. 578 // Replace a use of the cmp with a use of the new cmp. 583 // If we removed all uses, nuke the cmp. [all...] |
/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);
|
MachineScheduler.cpp | [all...] |
/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/Transforms/InstCombine/ |
InstCombineShifts.cpp | 739 Value *Cmp = Builder->CreateICmpEQ(II->getArgOperand(0), RHS); 740 return new ZExtInst(Cmp, II->getType());
|
InstCombineCompares.cpp | 194 /// cmp pred (load (gep GV, ...)), cmpcst 589 // ((gep Ptr, OFFSET) cmp Ptr) ---> (OFFSET cmp 0). 627 Value *Cmp = Builder->CreateICmp(ICmpInst::getSignedPredicate(Cond), 630 return ReplaceInstUsesWith(I, Cmp); 698 // ((gep Ptr, OFFSET1) cmp (gep Ptr, OFFSET2) ---> (OFFSET1 cmp OFFSET2) [all...] |
/external/clang/lib/CodeGen/ |
CGAtomic.cpp | 209 llvm::Value *Cmp = CGF.Builder.CreateICmpEQ(CXI, LoadVal1); 210 CGF.EmitStoreOfScalar(Cmp, CGF.MakeAddrLValue(Dest, E->getType())); [all...] |
/external/harfbuzz_ng/src/ |
hb-open-type-private.hh | 564 static inline int cmp (const IntType<Type,Size> *a, const IntType<Type,Size> *b) { return b->cmp (*a); } function in struct:OT::IntType 565 inline int cmp (IntType<Type,Size> va) const { Type a = va; Type b = v; return a < b ? -1 : a == b ? 0 : +1; } function in struct:OT::IntType 566 inline int cmp (Type a) const { Type b = v; return a < b ? -1 : a == b ? 0 : +1; } function in struct:OT::IntType 957 if (this->array[i].cmp (x) == 0) 961 struct Cmp { 962 static int cmp (const SearchType *a, const Type *b) { return b->cmp (*a); } function in struct:OT::SortedArrayOf::Cmp 964 const Type *p = (const Type *) bsearch (&x, this->array, this->len, sizeof (this->array[0]), (hb_compare_func_t) Cmp::cmp); [all...] |
/external/llvm/lib/Analysis/ |
InstructionSimplify.cpp | 81 CmpInst *Cmp = dyn_cast<CmpInst>(V); 82 if (!Cmp) 84 CmpInst::Predicate CPred = Cmp->getPredicate(); 85 Value *CLHS = Cmp->getOperand(0), *CRHS = Cmp->getOperand(1); 448 // Now that we have "cmp select(Cond, TV, FV), RHS", analyse it. 449 // Does "cmp TV, RHS" simplify? 456 // It didn't simplify. However if "cmp TV, RHS" is equal to the select 463 // Does "cmp FV, RHS" simplify? 470 // It didn't simplify. However if "cmp FV, RHS" is equal to the selec [all...] |
/external/clang/lib/Basic/ |
SourceManager.cpp | [all...] |
/external/llvm/lib/Bitcode/Reader/ |
BitcodeReader.cpp | [all...] |
/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/lib/Transforms/IPO/ |
GlobalOpt.cpp | [all...] |