| /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/test/020-string/ |
| D | expected.txt | 3 Compare result is 32
4 Compare unicode: -65302
|
| /art/runtime/ |
| D | dex_cache_resolved_classes.h | 37 int Compare(const DexCacheResolvedClasses& other) const { in Compare() function
75 return a.Compare(b) < 0;
|
| D | safe_map.h | 160 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>>
162 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
|
| /art/runtime/base/ |
| D | allocator.h | 159 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>>
161 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>>;
163 template<class Key, AllocatorTag kTag, class Compare = std::less<Key>>
164 using AllocationTrackingSet = std::set<Key, Compare, TrackingAllocator<Key, kTag>>;
|
| D | stringpiece.h | 151 int Compare(const StringPiece& rhs) const { in Compare() function
217 return x.Compare(y) < 0;
|
| D | variant_map.h | 105 virtual bool Compare(const VariantMapKeyRaw* other) const { in Compare() function
397 return lhs->Compare(rhs); in operator()
|
| /art/compiler/utils/ |
| D | intrusive_forward_list.h | 315 template <typename Compare>
316 void merge(IntrusiveForwardList& other, Compare cmp) { in merge()
335 template <typename Compare>
336 void merge(IntrusiveForwardList&& other, Compare cmp) { in merge()
342 template <typename Compare>
343 void sort(Compare cmp) { in sort()
|
| /art/test/003-omnibus-opcodes/src/ |
| D | Main.java | 42 Compare.run(); in run()
|
| D | Compare.java | 20 public class Compare { class
|
| /art/runtime/mirror/ |
| D | string.h | 140 int Compare(int32_t utf16_length, const char* utf8_data_in);
|
| D | class.cc | 643 int result = StringPiece(field.GetName()).Compare(name); in FindFieldByNameAndType()
645 result = StringPiece(field.GetTypeDescriptor()).Compare(type); in FindFieldByNameAndType()
|
| /art/compiler/dex/quick/ |
| D | dex_file_method_inliner.cc | 500 INTRINSIC(JavaLangInteger, Compare, II_I, kIntrinsicCompare, k32),
501 INTRINSIC(JavaLangLong, Compare, JJ_I, kIntrinsicCompare, k64),
|
| /art/compiler/optimizing/ |
| D | nodes.h | 1205 M(Compare, BinaryOperation) \
3097 int32_t Compare(T x, T y) const { return x > y ? 1 : (x < y ? -1 : 0); } in Compare() function
3104 return std::isunordered(x, y) ? (IsGtBias() ? 1 : -1) : Compare(x, y); in CompareFP()
3135 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), in Evaluate()
3179 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); in Evaluate()
3216 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); in Evaluate()
3253 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); in Evaluate()
3290 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); in Evaluate()
3327 return MakeConstantCondition(Compute(Compare(x->GetValue(), y->GetValue()), 0), GetDexPc()); in Evaluate()
3581 DECLARE_INSTRUCTION(Compare);
|