/art/test/442-checker-constant-folding/smali/ |
D | TestCmp.smali | 23 ## CHECK-DAG: <<Cmp:i\d+>> Compare [<<Const13>>,<<Const7>>] 33 ## CHECK-NOT: Compare 46 ## CHECK-DAG: <<Cmp:i\d+>> Compare [<<Const11>>,<<Const22>>] bias:gt 56 ## CHECK-NOT: Compare 69 ## CHECK-DAG: <<Cmp:i\d+>> Compare [<<Const33>>,<<Const44>>] bias:lt 79 ## CHECK-NOT: Compare 92 ## CHECK-DAG: <<Cmp:i\d+>> Compare [<<Const55>>,<<Const66>>] bias:gt 102 ## CHECK-NOT: Compare 115 ## CHECK-DAG: <<Cmp:i\d+>> Compare [<<Const77>>,<<Const88>>] bias:lt 125 ## CHECK-NOT: Compare [all …]
|
/art/libartbase/base/ |
D | tracking_safe_map.h | 25 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>> 27 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
|
D | intrusive_forward_list.h | 326 template <typename Compare> 327 void merge(IntrusiveForwardList& other, Compare cmp) { in merge() 346 template <typename Compare> 347 void merge(IntrusiveForwardList&& other, Compare cmp) { in merge() 353 template <typename Compare> 354 void sort(Compare cmp) { in sort()
|
D | variant_map.h | 106 virtual bool Compare(const VariantMapKeyRaw* other) const { in Compare() function 415 return lhs->Compare(rhs); in operator()
|
D | utils.h | 143 inline static int32_t Compare(T lhs, T rhs) { in Compare() function
|
D | bit_memory_region.h | 35 return Compare(lhs, rhs) < 0; in operator() 224 static int Compare(const BitMemoryRegion& lhs, const BitMemoryRegion& rhs) { in Compare() function
|
D | mem_map.cc | 53 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>> 55 std::multimap<Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>>;
|
D | bit_table.h | 95 BitMemoryRegion::Compare(table_data_, other.table_data_) == 0; in Equals()
|
/art/test/020-string/ |
D | expected-stdout.txt | 3 Compare result is greater than zero 4 Compare unicode: -65302
|
/art/test/003-omnibus-opcodes/src/ |
D | Main.java | 42 Compare.run(); in run()
|
D | Compare.java | 20 public class Compare { class
|
/art/libartbase/base/unix_file/ |
D | fd_file.h | 135 int Compare(FdFile* other);
|
D | fd_file_test.cc | 241 TEST_F(FdFileTest, Compare) { in TEST_F() argument 251 return a.GetFile()->Compare(b.GetFile()); in TEST_F()
|
D | fd_file.cc | 617 int FdFile::Compare(FdFile* other) { in Compare() function in unix_file::FdFile
|
/art/compiler/optimizing/ |
D | scheduler_arm.h | 80 M(Compare, unused) \
|
D | nodes.h | 1496 M(Compare, BinaryOperation) \ 3942 int32_t Compare(T x, T y) const { return x > y ? 1 : (x < y ? -1 : 0); } 3949 return std::isunordered(x, y) ? (IsGtBias() ? 1 : -1) : Compare(x, y); 3980 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), 4027 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); 4067 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); 4107 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); 4146 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); 4185 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); 4447 DECLARE_INSTRUCTION(Compare); [all …]
|
/art/runtime/interpreter/ |
D | interpreter_intrinsics.cc | 71 BINARY_II_INTRINSIC(MterpIntegerCompare, Compare, SetI); 104 BINARY_JJ_INTRINSIC(MterpLongCompare, Compare, SetI);
|
/art/runtime/gc/allocator/ |
D | rosalloc.h | 711 template<class Key, AllocatorTag kTag, class Compare = std::less<Key>> 712 using AllocationTrackingSet = std::set<Key, Compare, TrackingAllocator<Key, kTag>>;
|
/art/dex2oat/ |
D | dex2oat_image_test.cc | 156 return file1->Compare(file2.get()) == 0; in CompareFiles()
|
D | dex2oat_test.cc | 1137 EXPECT_EQ(unload_oat->Compare(no_unload_oat.get()), 0) in TEST_F() 1139 EXPECT_EQ(unload_vdex->Compare(no_unload_vdex.get()), 0) in TEST_F()
|
/art/libprofile/profile/ |
D | profile_compilation_info.h | 769 (BitMemoryRegion::Compare(method_bitmap, other.method_bitmap) == 0);
|