| /art/compiler/sea_ir/ir/ |
| D | regions_test.cc | 33 EXPECT_TRUE(std::find(regions->begin(), regions->end(), root) != regions->end()); in TEST_F()
34 EXPECT_TRUE(std::find(regions->begin(), regions->end(), then_region) != regions->end()); in TEST_F()
35 EXPECT_TRUE(std::find(regions->begin(), regions->end(), else_region) != regions->end()); in TEST_F()
48 EXPECT_TRUE(std::find(succs->begin(), succs->end(), then_region) != succs->end()); in TEST_F()
49 EXPECT_TRUE(std::find(succs->begin(), succs->end(), else_region) != succs->end()); in TEST_F()
|
| D | sea.cc | 35 cit != phis->end(); cit++) { in Traverse()
40 cit != instructions->end(); cit++) { in Traverse()
47 cit != ordered_regions_.end(); cit++ ) { in Traverse()
65 succ_it != succs->end(); ++succ_it) { in ComputeRPO()
81 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) { in ComputeIDominators()
87 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) { in ComputeIDominators()
97 pred_it != preds->end(); ++pred_it) { in ComputeIDominators()
98 if (processedNodes.end() != processedNodes.find((*pred_it))) { in ComputeIDominators()
107 pred_it != preds->end(); ++pred_it) { in ComputeIDominators()
126 region_it != regions_.end(); region_it++) { in ComputeIDominators()
[all …]
|
| /art/test/028-array-write/src/ |
| D | Main.java | 27 static public void report(long start, long end) { in report() argument
32 System.out.println("Finished in " + ((end - start) / 1000000.0) in report()
42 long start, end; in writeTest() local
50 end = System.nanoTime(); in writeTest()
52 report(start, end); in writeTest()
56 long start, end; in copyTest() local
68 end = System.nanoTime(); in copyTest()
70 report(start, end); in copyTest()
|
| /art/runtime/gc/accounting/ |
| D | heap_bitmap.cc | 28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), in ReplaceBitmap()
30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap in ReplaceBitmap()
37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); in ReplaceLargeObjectBitmap()
38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap in ReplaceLargeObjectBitmap()
57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); in RemoveContinuousSpaceBitmap()
58 DCHECK(it != continuous_space_bitmaps_.end()); in RemoveContinuousSpaceBitmap()
69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap); in RemoveLargeObjectBitmap()
70 DCHECK(it != large_object_bitmaps_.end()); in RemoveLargeObjectBitmap()
|
| D | space_bitmap_test.cc | 43 const mirror::Object* end) in BitmapVerify() argument
46 end_(end) {} in BitmapVerify()
83 mirror::Object* end = in TEST_F() local
85 BitmapVerify(space_bitmap.get(), start, end); in TEST_F()
143 size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment); in RunTest() local
146 reinterpret_cast<uintptr_t>(heap_begin) + end, c); in RunTest()
149 for (uintptr_t k = offset; k < end; k += kAlignment) { in RunTest()
|
| D | mod_union_table.cc | 177 references_.find(ref) == references_.end()) { in operator ()()
247 uintptr_t end = start + CardTable::kCardSize; in Dump() local
248 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << ","; in Dump()
254 uintptr_t end = start + CardTable::kCardSize; in Dump() local
255 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "->{"; in Dump()
274 uintptr_t end = start + CardTable::kCardSize; in UpdateAndMarkReferences() local
278 live_bitmap->VisitMarkedRange(start, end, add_visitor); in UpdateAndMarkReferences()
282 if (found == references_.end()) { in UpdateAndMarkReferences()
330 auto end = start + CardTable::kCardSize; in Dump() local
331 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "\n"; in Dump()
|
| /art/runtime/base/ |
| D | stl_util.h | 28 std::sort(v->begin(), v->end()); in STLSortAndRemoveDuplicates()
29 v->erase(std::unique(v->begin(), v->end()), v->end()); in STLSortAndRemoveDuplicates()
44 ForwardIterator end) { in STLDeleteContainerPointers() argument
45 while (begin != end) { in STLDeleteContainerPointers()
65 STLDeleteContainerPointers(container->begin(), container->end()); in STLDeleteElements()
75 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
|
| D | hash_set_test.cc | 73 ASSERT_TRUE(after_it == hash_set.end()); in TEST_F()
77 ASSERT_TRUE(it == hash_set.end()); in TEST_F()
89 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
96 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
103 ASSERT_TRUE(it == hash_set.end()); in TEST_F()
107 ASSERT_TRUE(it != hash_set.end()); in TEST_F()
114 ASSERT_TRUE(hash_set.begin() == hash_set.end()); in TEST_F()
132 for (auto it = hash_set.begin(); it != hash_set.end();) { in TEST_F()
192 ASSERT_EQ(it1 == hash_set.end(), it2 == std_set.end()); in TEST_F()
193 if (it1 != hash_set.end()) { in TEST_F()
|
| /art/test/023-many-interfaces/src/ |
| D | ManyInterfaces.java | 173 private static void report(String label, long start, long end, int iter, in report() argument
176 System.out.println(label + ": " + (end - start) / 1000 + "us" in report()
177 + " (" + (end - start) / (iter*rept) + "ns per call)"); in report()
194 long start, end; in run() local
207 end = System.nanoTime(); in run()
208 report("testIface001", start, end, iter, rept); in run()
212 end = System.nanoTime(); in run()
213 report("testIface049", start, end, iter, rept); in run()
217 end = System.nanoTime(); in run()
218 report("testIface099", start, end, iter, rept); in run()
[all …]
|
| /art/runtime/gc/allocator/ |
| D | dlmalloc.cc | 53 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* arg) { in DlmallocMadviseCallback() argument
60 end = reinterpret_cast<void*>(art::RoundDown(reinterpret_cast<uintptr_t>(end), art::kPageSize)); in DlmallocMadviseCallback()
61 if (end > start) { in DlmallocMadviseCallback()
62 size_t length = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start); in DlmallocMadviseCallback()
73 extern "C" void DlmallocBytesAllocatedCallback(void* start, void* end, size_t used_bytes, void* arg… in DlmallocBytesAllocatedCallback() argument
81 extern "C" void DlmallocObjectsAllocatedCallback(void* start, void* end, size_t used_bytes, void* a… in DlmallocObjectsAllocatedCallback() argument
|
| D | dlmalloc.h | 40 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* /*arg*/);
45 extern "C" void DlmallocBytesAllocatedCallback(void* start, void* end, size_t used_bytes, void* arg…
46 extern "C" void DlmallocObjectsAllocatedCallback(void* start, void* end, size_t used_bytes, void* a…
|
| D | rosalloc.cc | 116 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) { in AllocPages()
313 size_t end = page_map_size_; in FreePages() local
314 while (idx < end && page_map_[idx] == pm_part_type) { in FreePages()
345 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end()); in FreePages()
355 if (higher_it != free_page_runs_.end()) { in FreePages()
356 for (auto it = higher_it; it != free_page_runs_.end(); ) { in FreePages()
440 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end()); in FreePages()
445 DCHECK(free_page_runs_.find(fpr) != free_page_runs_.end()); in FreePages()
600 DCHECK(non_full_runs_[idx].find(current_run) == non_full_runs_[idx].end()); in AllocFromCurrentRunUnlocked()
601 DCHECK(full_runs_[idx].find(current_run) != full_runs_[idx].end()); in AllocFromCurrentRunUnlocked()
[all …]
|
| /art/runtime/ |
| D | mem_map.cc | 54 static_cast<uint32_t>(it->end), in operator <<()
64 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { in operator <<()
136 uintptr_t end, in ContainedWithinExistingMap() argument
143 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in ContainedWithinExistingMap()
144 if ((begin >= it->start && begin < it->end) // start of new within old in ContainedWithinExistingMap()
145 && (end > it->start && end <= it->end)) { // end of new within old in ContainedWithinExistingMap()
153 begin, end, maps.c_str()); in ContainedWithinExistingMap()
160 uintptr_t end, in CheckNonOverlapping() argument
167 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in CheckNonOverlapping()
168 if ((begin >= it->start && begin < it->end) // start of new within old in CheckNonOverlapping()
[all …]
|
| D | oat.cc | 32 SafeMap<std::string, std::string>::const_iterator end = variable_data->end(); in ComputeOatHeaderSize() local
33 for ( ; it != end; ++it) { in ComputeOatHeaderSize()
406 static const char* ParseString(const char* start, const char* end) { in ParseString() argument
407 while (start < end && *start != 0) { in ParseString()
415 const char* end = ptr + key_value_store_size_; in GetStoreValueByKey() local
417 while (ptr < end) { in GetStoreValueByKey()
419 const char* str_end = ParseString(ptr, end); in GetStoreValueByKey()
420 if (str_end < end) { in GetStoreValueByKey()
423 if (ParseString(str_end + 1, end) < end) { in GetStoreValueByKey()
428 ptr = ParseString(str_end + 1, end) + 1; in GetStoreValueByKey()
[all …]
|
| D | leb128_test.cc | 116 uint8_t* end = EncodeUnsignedLeb128(encoded_data, uleb128_tests[i].decoded); in TEST() local
117 size_t data_size = static_cast<size_t>(end - encoded_data); in TEST()
155 uint8_t* end = encoded_data; in TEST() local
157 end = EncodeUnsignedLeb128(end, uleb128_tests[i].decoded); in TEST()
159 size_t data_size = static_cast<size_t>(end - encoded_data); in TEST()
197 uint8_t* end = EncodeSignedLeb128(encoded_data, sleb128_tests[i].decoded); in TEST() local
198 size_t data_size = static_cast<size_t>(end - encoded_data); in TEST()
236 uint8_t* end = encoded_data; in TEST() local
238 end = EncodeSignedLeb128(end, sleb128_tests[i].decoded); in TEST()
240 size_t data_size = static_cast<size_t>(end - encoded_data); in TEST()
|
| /art/compiler/sea_ir/debug/ |
| D | dot_gen.cc | 28 cit != graph->GetRegions()->end(); cit++ ) { in Initialize()
38 cit != dominated_regions->end(); cit++ ) { in Initialize()
49 def_it != definition_edges->end(); def_it++) { in ToDotSSAEdges()
55 if (type_it != types_->end()) { in ToDotSSAEdges()
69 cit != used_in->end(); cit++) { in ToDotSSAEdges()
81 def_it != definition_edges.end(); def_it++) { in ToDotSSAEdges()
87 if (type_it != types_->end()) { in ToDotSSAEdges()
101 cit != used_in->end(); cit++) { in ToDotSSAEdges()
129 cit != phi_instructions->end(); cit++) { in Visit()
134 cit != instructions->end(); cit++) { in Visit()
[all …]
|
| /art/compiler/utils/ |
| D | dedupe_set.h | 57 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
58 b.store_ptr->begin(), b.store_ptr->end()); in operator()
60 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
61 b.in_key->second->begin(), b.in_key->second->end()); in operator()
63 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
64 b.store_ptr->begin(), b.store_ptr->end()); in operator()
66 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
67 b.in_key->second->begin(), b.in_key->second->end()); in operator()
91 if (it != keys_[shard_bin].end()) { in Add()
150 allocator_.construct(ret, key.begin(), key.end(), allocator_); in CreateStoreKey()
|
| /art/compiler/dex/ |
| D | mir_field_info.cc | 37 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
55 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
81 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
102 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve() local
|
| D | verification_results.cc | 66 if (it != verified_methods_.end()) { in ProcessVerifiedMethod()
77 DCHECK(verified_methods_.find(ref) != verified_methods_.end()); in ProcessVerifiedMethod()
84 return (it != verified_methods_.end()) ? it->second : nullptr; in GetVerifiedMethod()
90 if (it != verified_methods_.end()) { in RemoveVerifiedMethod()
106 return (rejected_classes_.find(ref) != rejected_classes_.end()); in IsClassRejected()
|
| /art/runtime/jdwp/ |
| D | object_registry.cc | 94 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end(); in ContainsLocked() local
95 it != end && it->first == identity_hash_code; ++it) { in ContainsLocked()
131 if (it == id_to_entry_.end()) { in InternalGet()
145 CHECK(it != id_to_entry_.end()) << id; in GetJObject()
154 CHECK(it != id_to_entry_.end()); in DisableCollection()
162 CHECK(it != id_to_entry_.end()); in EnableCollection()
192 CHECK(it != id_to_entry_.end()); in IsCollected()
206 if (it == id_to_entry_.end()) { in DisposeObject()
216 for (auto it = object_to_entry_.lower_bound(hash_code), end = object_to_entry_.end(); in DisposeObject() local
217 it != end && it->first == hash_code; ++it) { in DisposeObject()
|
| /art/test/004-InterfaceTest/src/ |
| D | Main.java | 29 long end = System.currentTimeMillis(); in test_virtual() local
30 return (end - start); in test_virtual()
40 long end = System.currentTimeMillis(); in test_interface() local
41 return (end - start); in test_interface()
|
| /art/runtime/gc/space/ |
| D | dlmalloc_space.cc | 39 byte* end, byte* limit, size_t growth_limit, in DlMallocSpace() argument
42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in DlMallocSpace()
60 byte* end = mem_map->Begin() + starting_size; in CreateFromMemMap() local
62 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); in CreateFromMemMap()
69 name, mem_map, mspace, begin, end, begin + capacity, growth_limit, initial_size, in CreateFromMemMap()
72 return new DlMallocSpace(name, mem_map, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
152 void* allocator, byte* begin, byte* end, in CreateInstance() argument
155 return new DlMallocSpace(name, mem_map, allocator, begin, end, limit, growth_limit, in CreateInstance()
247 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_a… in Walk() argument
307 static void MSpaceChunkCallback(void* start, void* end, size_t used_bytes, void* arg) { in MSpaceChunkCallback() argument
[all …]
|
| D | bump_pointer_space-inl.h | 44 byte* end = end_.LoadRelaxed(); in AllocThreadUnsafe() local
45 if (end + num_bytes > growth_end_) { in AllocThreadUnsafe()
48 mirror::Object* obj = reinterpret_cast<mirror::Object*>(end); in AllocThreadUnsafe()
49 end_.StoreRelaxed(end + num_bytes); in AllocThreadUnsafe()
|
| D | rosalloc_space.cc | 45 art::gc::allocator::RosAlloc* rosalloc, byte* begin, byte* end, in RosAllocSpace() argument
48 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in RosAllocSpace()
67 byte* end = mem_map->Begin() + starting_size; in CreateFromMemMap() local
69 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); in CreateFromMemMap()
79 return new RosAllocSpace(name, mem_map, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
167 byte* begin, byte* end, byte* limit, size_t growth_limit, in CreateInstance() argument
170 begin, end, limit, growth_limit, can_move_objects, starting_size_, in CreateInstance()
250 void RosAllocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_a… in Walk() argument
291 void (*callback)(void *start, void *end, size_t num_bytes, void* callback_arg), in InspectAllRosAllocWithSuspendAll() argument
308 void RosAllocSpace::InspectAllRosAlloc(void (*callback)(void *start, void *end, size_t num_bytes, v… in InspectAllRosAlloc() argument
|
| /art/test/053-wait-some/src/ |
| D | Main.java | 33 long start, end; in doit() local
54 end = System.currentTimeMillis(); in doit()
56 long elapsed = end - start; in doit()
|