| /art/compiler/dex/ |
| H A D | dex_to_dex_decompiler_test.cc | 69 int cmp = memcmp(original_dex_file->Begin(), local
72 ASSERT_EQ(0, cmp);
77 cmp = memcmp(original_dex_file->Begin(), updated_dex_file->Begin(), updated_dex_file->Size());
78 ASSERT_NE(0, cmp);
125 cmp = memcmp(original_dex_file->Begin(), updated_dex_file->Begin(), updated_dex_file->Size());
126 ASSERT_EQ(0, cmp);
|
| /art/compiler/utils/ |
| H A D | string_reference_test.cc | 48 StringReferenceValueComparator cmp; local
49 EXPECT_TRUE(cmp(sr1, sr2)); // "String1" < "String2" is true.
50 EXPECT_FALSE(cmp(sr2, sr1)); // "String2" < "String1" is false.
99 StringReferenceValueComparator cmp; local
104 EXPECT_EQ(expectedCmp12[index1][index2], cmp(sr1, sr2)) << index1 << " " << index2;
105 EXPECT_EQ(expectedCmp21[index2][index1], cmp(sr2, sr1)) << index1 << " " << index2;
|
| H A D | intrusive_forward_list_test.cc | 481 auto cmp = [](IFLTestValue lhs, IFLTestValue rhs) { local
484 CHECK(!std::is_sorted(ref.begin(), ref.end(), cmp));
485 ref.sort(cmp);
486 ifl.sort(cmp);
|
| H A D | intrusive_forward_list.h | 316 void merge(IntrusiveForwardList& other, Compare cmp) { argument
322 if (cmp(*other_current, *current)) {
336 void merge(IntrusiveForwardList&& other, Compare cmp) { argument
337 merge(other, cmp); // Use l-value overload.
343 void sort(Compare cmp) { argument
350 sort(cmp);
351 second_half.sort(cmp);
352 merge(second_half, cmp);
|
| /art/runtime/native/ |
| H A D | java_lang_reflect_Executable.cc | 241 int cmp = strcmp(lhs_data, rhs_data); local
242 if (cmp != 0) {
243 return (cmp < 0) ? -1 : 1;
|
| /art/runtime/ |
| H A D | safe_map.h | 49 explicit SafeMap(const key_compare& cmp, const allocator_type& allocator = allocator_type()) argument
50 : map_(cmp, allocator) {
|
| H A D | oat_file_manager.cc | 205 const int cmp = strcmp(cached_descriptor_, rhs.cached_descriptor_); local
206 if (cmp != 0) {
209 return cmp > 0;
|
| /art/compiler/optimizing/ |
| H A D | bounds_check_elimination_test.cc | 84 HInstruction* cmp = new (&allocator_) HGreaterThanOrEqual(parameter2, constant_0); local
85 HIf* if_inst = new (&allocator_) HIf(cmp);
86 block1->AddInstruction(cmp);
107 cmp = new (&allocator_) HLessThan(parameter2, array_length);
108 if_inst = new (&allocator_) HIf(cmp);
111 block3->AddInstruction(cmp);
182 HInstruction* cmp = new (&allocator_) HLessThanOrEqual(parameter2, constant_0); local
183 HIf* if_inst = new (&allocator_) HIf(cmp);
184 block1->AddInstruction(cmp);
248 HInstruction* cmp local
394 HInstruction* cmp = nullptr; local
512 HInstruction* cmp = nullptr; local
620 HInstruction* cmp = nullptr; local
721 HInstruction* cmp = nullptr; local
818 HInstruction* cmp = new (&allocator_) HGreaterThanOrEqual(phi_i, add); local
[all...] |
| H A D | induction_var_analysis.cc | 782 IfCondition cmp) {
785 switch (cmp) {
806 if (cmp == kCondNE && ((stride_value == +1 && IsTaken(lower_expr, upper_expr, kCondLE)) ||
808 cmp = stride_value > 0 ? kCondLT : kCondGT;
815 !FitsNarrowerControl(lower_expr, upper_expr, stride_value, a->type, cmp)) {
821 if ((stride_value > 0 && (cmp == kCondLT || cmp == kCondLE)) ||
822 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) {
823 VisitTripCount(loop, lower_expr, upper_expr, stride_expr, stride_value, type, cmp);
778 VisitCondition(HLoopInformation* loop, InductionInfo* a, InductionInfo* b, Primitive::Type type, IfCondition cmp) argument
828 VisitTripCount(HLoopInformation* loop, InductionInfo* lower_expr, InductionInfo* upper_expr, InductionInfo* stride_expr, int64_t stride_value, Primitive::Type type, IfCondition cmp) argument
904 IsTaken(InductionInfo* lower_expr, InductionInfo* upper_expr, IfCondition cmp) argument
932 IsFinite(InductionInfo* upper_expr, int64_t stride_value, Primitive::Type type, IfCondition cmp) argument
957 FitsNarrowerControl(InductionInfo* lower_expr, InductionInfo* upper_expr, int64_t stride_value, Primitive::Type type, IfCondition cmp) argument
[all...] |
| H A D | instruction_simplifier.cc | 621 static bool CmpHasBoolType(HInstruction* input, HInstruction* cmp) { argument
624 } else if (cmp->GetUses().HasExactlyOneElement()) {
627 HInstruction* user = cmp->GetUses().front().GetUser();
628 return user->IsPhi() && user->HasInput(input) && user->HasInput(cmp);
|
| /art/compiler/utils/arm/ |
| H A D | assembler_thumb2.cc | 602 void Thumb2Assembler::cmp(Register rn, const ShifterOperand& so, Condition cond) { function in class:art::arm::Thumb2Assembler
1550 // Special cmp for high registers.
3670 // We prefer to select the shorter code sequence rather than using plain cmp and cmn
3674 cmp(rn, shifter_op, cond);
3681 cmp(rn, ShifterOperand(IP), cond);
3694 cmp(rn, ShifterOperand(IP), cond);
3984 cmp(r, ShifterOperand(0));
3994 cmp(r, ShifterOperand(0));
|
| /art/compiler/utils/mips/ |
| H A D | assembler_mips.cc | 267 auto cmp = [](const DelayedAdvancePC& lhs, const DelayedAdvancePC& rhs) { local
270 CHECK(std::is_sorted(advances.begin(), advances.begin() + number_of_delayed_adjust_pcs, cmp));
271 CHECK(std::is_sorted(advances.begin() + number_of_delayed_adjust_pcs, advances.end(), cmp));
|