| /art/test/580-fp16/src-art/ |
| D | Main.java | 277 assertTrue(FP16.less(FP16.NEGATIVE_INFINITY, FP16.POSITIVE_INFINITY)); in testLess()
278 assertTrue(FP16.less(FP16.MAX_VALUE, FP16.POSITIVE_INFINITY)); in testLess()
279 assertFalse(FP16.less(FP16.POSITIVE_INFINITY, FP16.MAX_VALUE)); in testLess()
280 assertFalse(FP16.less(FP16.LOWEST_VALUE, FP16.NEGATIVE_INFINITY)); in testLess()
281 assertTrue(FP16.less(FP16.NEGATIVE_INFINITY, FP16.LOWEST_VALUE)); in testLess()
282 assertFalse(FP16.less(FP16.POSITIVE_ZERO, FP16.NEGATIVE_ZERO)); in testLess()
283 assertFalse(FP16.less(FP16.NEGATIVE_ZERO, FP16.POSITIVE_ZERO)); in testLess()
284 assertFalse(FP16.less(FP16.NaN, FP16.toHalf(12.3f))); in testLess()
285 assertFalse(FP16.less(FP16.toHalf(12.3f), FP16.NaN)); in testLess()
286 assertTrue(FP16.less(FP16.MIN_VALUE, FP16.MIN_NORMAL)); in testLess()
[all …]
|
| /art/test/530-checker-loops2/ |
| D | info.txt | 1 Test on loop optimizations, in particular around less common induction.
|
| /art/libartbase/base/ |
| D | tracking_safe_map.h | 25 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>>
|
| D | arena_containers.h | 58 template <typename T, typename Comparator = std::less<T>>
64 template <typename T, typename Comparator = std::less<T>>
67 template <typename K, typename V, typename Comparator = std::less<K>>
|
| D | scoped_arena_containers.h | 56 template <typename T, typename Comparator = std::less<T>>
62 template <typename T, typename Comparator = std::less<T>>
65 template <typename K, typename V, typename Comparator = std::less<K>>
|
| D | intrusive_forward_list.h | 321 merge(other, std::less<value_type>()); in merge()
351 sort(std::less<value_type>()); in sort()
|
| D | safe_map.h | 30 template <typename K, typename V, typename Comparator = std::less<K>,
|
| /art/tools/ahat/src/main/com/android/ahat/ |
| D | SubsetSelector.java | 89 int less = Math.max(0, mLimit - kIncrAmount); in render() local
92 menu.appendLink(mQuery.with(mId, less), DocString.text("show less")); in render()
|
| /art/compiler/optimizing/ |
| D | superblock_cloner_test.cc | 160 HBasicBlockMap bb_map(std::less<HBasicBlock*>(), arena->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
161 HInstructionMap hir_map(std::less<HInstruction*>(), arena->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
302 std::less<HBasicBlock*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
304 std::less<HInstruction*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
339 std::less<HBasicBlock*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
341 std::less<HInstruction*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
376 std::less<HBasicBlock*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
378 std::less<HInstruction*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
657 HBasicBlockMap bb_map(std::less<HBasicBlock*>(), arena->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
658 HInstructionMap hir_map(std::less<HInstruction*>(), arena->Adapter(kArenaAllocSuperblockCloner)); in TEST_F()
|
| D | graph_visualizer.h | 59 instruction_intervals_(std::less<const HInstruction*>(), allocator->Adapter()),
|
| D | block_builder.cc | 44 quicken_index_for_dex_pc_(std::less<uint32_t>(), in HBasicBlockBuilder()
283 std::less<uint32_t>(), local_allocator_->Adapter(kArenaAllocGraphBuilder)); in InsertTryBoundaryBlocks()
308 std::less<uint32_t>(), local_allocator_->Adapter(kArenaAllocGraphBuilder)); in InsertTryBoundaryBlocks()
|
| D | select_generator.cc | 98 std::less<HInstruction*>(), allocator.Adapter(kArenaAllocSelectGenerator)); in Run()
|
| D | superblock_cloner.cc | 843 live_outs_(std::less<HInstruction*>(), in SuperblockCloner()
864 std::less<HInstruction*>(), graph_->GetAllocator()->Adapter(kArenaAllocSuperblockCloner)); in IsSubgraphClonable()
1200 : bb_map_(std::less<HBasicBlock*>(), in LoopClonerSimpleHelper()
1202 hir_map_(std::less<HInstruction*>(), in LoopClonerSimpleHelper()
|
| D | induction_var_analysis.cc | 234 map_(std::less<HInstruction*>(), in HInductionVarAnalysis()
237 cycle_(std::less<HInstruction*>(), in HInductionVarAnalysis()
240 induction_(std::less<HLoopInformation*>(), in HInductionVarAnalysis()
242 cycles_(std::less<HPhi*>(), in HInductionVarAnalysis()
1199 std::less<HInstruction*>(), in AssignInfo()
|
| /art/runtime/gc/accounting/ |
| D | remembered_set.h | 47 typedef std::set<uint8_t*, std::less<uint8_t*>,
|
| D | mod_union_table.h | 55 typedef std::set<uint8_t*, std::less<uint8_t*>,
|
| /art/runtime/ |
| D | dex_reference_collection.h | 40 std::less<const DexFile*>,
|
| /art/compiler/driver/ |
| D | compiled_method_storage.h | 84 std::less<ThunkMapKey>,
|
| D | compiled_method_storage.cc | 157 thunk_map_(std::less<ThunkMapKey>(), SwapAllocator<ThunkMapValueType>(swap_space_.get())) { in CompiledMethodStorage()
|
| /art/test/670-bitstring-type-check/ |
| D | build | 57 // less bits for the level 1 character. 1025 classes at level 2 similarly guarantees
58 // an overflow if the number of bits for level 2 character is 10 or less. To test
|
| /art/test/435-try-finally-without-catch/ |
| D | info.txt | 20 special block(s) related to `catch'-less `try' statement(s), the
|
| /art/test/503-dead-instructions/smali/ |
| D | DeadInstructions.smali | 60 # Provide less arguments than we should.
|
| /art/libprofile/profile/ |
| D | profile_compilation_info.h | 164 classes(std::less<ClassReference>(), allocator->Adapter(kArenaAllocProfile)) {} in DexPcData()
610 method_map(std::less<uint16_t>(), allocator->Adapter(kArenaAllocProfile)), in DexFileData()
611 class_set(std::less<dex::TypeIndex>(), allocator->Adapter(kArenaAllocProfile)), in DexFileData()
|
| /art/runtime/verifier/ |
| D | register_line-inl.h | 202 reg_to_lock_depths_(std::less<uint32_t>(), in RegisterLine()
|
| /art/runtime/gc/collector/ |
| D | garbage_collector.cc | 105 return std::less()(a.first, b.first); in ExtractRssFromMincore()
|