/art/test/028-array-write/src/ |
H A D | Main.java | 27 static public void report(long start, long end) { argument 32 System.out.println("Finished in " + ((end - start) / 1000000.0) 42 long start, end; 50 end = System.nanoTime(); 52 report(start, end); 56 long start, end; 68 end = System.nanoTime(); 70 report(start, end);
|
/art/test/559-bce-ssa/src/ |
H A D | Main.java | 19 public static void foo(int[] array, int[] array2, int start, int end) { argument 20 for (int i = start; i < end; ++i) {
|
/art/runtime/gc/allocator/ |
H A D | dlmalloc.h | 47 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* /*arg*/); 52 extern "C" void DlmallocBytesAllocatedCallback(void* start, void* end, size_t used_bytes, void* arg); 53 extern "C" void DlmallocObjectsAllocatedCallback(void* start, void* end, size_t used_bytes, void* arg);
|
H A D | dlmalloc.cc | 59 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* arg) { argument 66 end = reinterpret_cast<void*>(art::RoundDown(reinterpret_cast<uintptr_t>(end), art::kPageSize)); 67 if (end > start) { 68 size_t length = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start); 80 void* end ATTRIBUTE_UNUSED, 91 void* end ATTRIBUTE_UNUSED,
|
/art/test/004-InterfaceTest/src/ |
H A D | Main.java | 29 long end = System.currentTimeMillis(); 30 return (end - start); 40 long end = System.currentTimeMillis(); 41 return (end - start);
|
/art/runtime/gc/accounting/ |
H A D | heap_bitmap.cc | 28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), 30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap 37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); 38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap 57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); 58 DCHECK(it != continuous_space_bitmaps_.end()); 69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap); 70 DCHECK(it != large_object_bitmaps_.end());
|
H A D | card_table.cc | 112 void CardTable::ClearCardRange(uint8_t* start, uint8_t* end) { argument 114 memset(start, 0, end - start); 118 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize); 121 uint8_t* end_card = CardFromAddr(end); 127 // Handle unaligned regions at start / end. 139 uint8_t* end = mem_map_->End(); local 143 << " end: " << reinterpret_cast<void*>(end) 146 << " heap end: " << AddrFromCard(end) [all...] |
H A D | space_bitmap_test.cc | 43 const mirror::Object* end) 46 end_(end) {} 77 // This handles all the cases, having runs which start and end on the same word, and different 83 mirror::Object* end = local 85 BitmapVerify(space_bitmap.get(), start, end); 143 size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment); variable 146 reinterpret_cast<uintptr_t>(heap_begin) + end, c); 149 for (uintptr_t k = offset; k < end; k += kAlignment) { 42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, const mirror::Object* end) argument
|
/art/runtime/base/ |
H A D | stl_util.h | 30 std::sort(v->begin(), v->end()); 31 v->erase(std::unique(v->begin(), v->end()), v->end()); 46 ForwardIterator end) { 47 while (begin != end) { 56 // hash_set, or any other STL container which defines sensible begin(), end(), 67 STLDeleteContainerPointers(container->begin(), container->end()); 78 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 121 auto it = std::find(container.begin(), container.end(), value); 122 DCHECK(it != container.end()); // Mus 45 STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) argument [all...] |
H A D | hash_set_test.cc | 75 ASSERT_TRUE(after_it == hash_set.end()); 79 ASSERT_TRUE(it == hash_set.end()); 91 ASSERT_TRUE(it != hash_set.end()); 98 ASSERT_TRUE(it != hash_set.end()); 105 ASSERT_TRUE(it == hash_set.end()); 109 ASSERT_TRUE(it != hash_set.end()); 116 ASSERT_TRUE(hash_set.begin() == hash_set.end()); 134 for (auto it = hash_set.begin(); it != hash_set.end();) { 194 EXPECT_NE(hash_set.end(), hash_set.Find(initial_string)) 250 ASSERT_EQ(it1 == hash_set.end(), it 291 HashIntSequence(T begin, T end) argument [all...] |
/art/compiler/optimizing/ |
H A D | graph_visualizer.h | 40 size_t end; member in struct:art::GeneratedCodeInterval 62 void SetFrameEntryInterval(size_t start, size_t end) { argument 63 frame_entry_interval_ = {start, end}; 66 void AddInstructionInterval(HInstruction* instr, size_t start, size_t end) { argument 67 instruction_intervals_.Put(instr, {start, end}); 70 void AddSlowPathInterval(SlowPathCode* slow_path, size_t start, size_t end) { argument 71 slow_path_intervals_.push_back({slow_path, {start, end}});
|
/art/compiler/utils/ |
H A D | intrusive_forward_list_test.cc | 45 ASSERT_EQ(std::distance(expected.begin(), expected.end()), \ 46 std::distance(value.begin(), value.end())); \ 47 ASSERT_TRUE(std::equal(expected.begin(), expected.end(), value.begin())); \ 62 ASSERT_TRUE(ifl.end() == ifl.cend()); 63 ASSERT_FALSE(ifl.end() != ifl.cend()); 65 ASSERT_TRUE(ifl.begin() == ifl.end()); // Empty. 66 ASSERT_FALSE(ifl.begin() != ifl.end()); // Empty. 71 ASSERT_FALSE(ifl.begin() == ifl.end()); // Not empty. 72 ASSERT_TRUE(ifl.begin() != ifl.end()); // Not empty. 77 std::vector<IFLTestValue> storage(ref.begin(), ref.end()); [all...] |
H A D | dedupe_set_test.cc | 46 return new std::vector<uint8_t>(src.begin(), src.end()); 68 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin())); 77 ASSERT_TRUE(std::equal(test2.begin(), test2.end(), array2->begin())); 87 ASSERT_TRUE(std::equal(test3.begin(), test3.end(), array3->begin()));
|
/art/runtime/gc/collector/ |
H A D | immune_spaces.cc | 42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>; 51 // Update the end to include the other non-heap sections. 64 std::sort(intervals.begin(), intervals.end()); 65 // Intervals are already sorted by begin, if a new interval begins at the end of the current 72 const uintptr_t end = std::get<1>(interval); local 75 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap; 76 DCHECK_GE(end, begin); 78 // New interval is not at the end of the current one, start a new interval if we are a heap 88 cur_end = end; 92 cur_heap_size += end [all...] |
H A D | immune_region.h | 56 void SetEnd(mirror::Object* end) { argument 57 end_ = end;
|
/art/cmdline/ |
H A D | token_range.h | 43 end_(token_list_->end()) 51 end_(token_list_->end()) 61 end_(token_list_->end()) { 63 assert(it_end <= token_list.end()); 71 end_(token_list_->end()) 78 end_(token_list_->end()) 89 assert(it_end <= token_list->end()); 102 end_(token_list_->end()) 105 // Iterator type for begin() and end(). Guaranteed to be a RandomAccessIterator. 108 // Iterator type for const begin() and const end() 149 iterator end() const { function in struct:art::TokenRange [all...] |
/art/test/030-bad-finalizer/src/ |
H A D | Main.java | 53 long start, end; 58 end = System.nanoTime();
|
/art/test/023-many-interfaces/src/ |
H A D | ManyInterfaces.java | 173 private static void report(String label, long start, long end, int iter, argument 176 System.out.println(label + ": " + (end - start) / 1000 + "us" 177 + " (" + (end - start) / (iter*rept) + "ns per call)"); 194 long start, end; 207 end = System.nanoTime(); 208 report("testIface001", start, end, iter, rept); 212 end = System.nanoTime(); 213 report("testIface049", start, end, iter, rept); 217 end = System.nanoTime(); 218 report("testIface099", start, end, ite [all...] |
/art/compiler/dex/ |
H A D | verification_results.cc | 59 if (it != verified_methods_.end()) { 74 DCHECK(verified_methods_.find(ref) != verified_methods_.end()); 80 return (it != verified_methods_.end()) ? it->second : nullptr; 93 return (rejected_classes_.find(ref) != rejected_classes_.end());
|
/art/test/053-wait-some/src/ |
H A D | Main.java | 33 long start, end; 54 end = System.currentTimeMillis(); 56 long elapsed = end - start;
|
/art/runtime/ |
H A D | oat.cc | 37 SafeMap<std::string, std::string>::const_iterator end = variable_data->end(); local 38 for ( ; it != end; ++it) { 397 // Advance start until it is either end or \0. 398 static const char* ParseString(const char* start, const char* end) { argument 399 while (start < end && *start != 0) { 407 const char* end = ptr + key_value_store_size_; local 409 while (ptr < end) { 411 const char* str_end = ParseString(ptr, end); 412 if (str_end < end) { 433 const char* end = ptr + key_value_store_size_; local 503 SafeMap<std::string, std::string>::const_iterator end = key_value_store->end(); local [all...] |
H A D | mem_map.cc | 55 static_cast<uint32_t>(it->end), 65 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { 138 uintptr_t end = begin + size; local 147 end <= reinterpret_cast<uintptr_t>(map->End())) { 162 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { 163 if ((begin >= it->start && begin < it->end) // start of new within old 164 && (end > it->start && end <= it->end)) { // end o 177 CheckNonOverlapping(uintptr_t begin, uintptr_t end, std::string* error_msg) argument 680 void* end = map->BaseEnd(); local 909 volatile uint8_t* end = begin + base_size_; local [all...] |
/art/runtime/gc/ |
H A D | allocation_record.cc | 46 char* end; local 47 size_t value = strtoul(allocMaxString, &end, 10); 48 if (*end != '\0') { 62 char* end; local 63 size_t value = strtoul(recentAllocMaxString, &end, 10); 64 if (*end != '\0') { 78 char* end; local 79 size_t value = strtoul(stackDepthString, &end, 10); 80 if (*end != '\0') { 104 for (auto it = entries_.rbegin(), end [all...] |
/art/runtime/jdwp/ |
H A D | object_registry.cc | 124 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end(); 125 it != end && it->first == identity_hash_code; ++it) { 174 if (it == id_to_entry_.end()) { 190 CHECK(it != id_to_entry_.end()) << id; 199 CHECK(it != id_to_entry_.end()); 207 CHECK(it != id_to_entry_.end()); 237 CHECK(it != id_to_entry_.end()); 251 if (it == id_to_entry_.end()) { 261 for (auto inner_it = object_to_entry_.lower_bound(hash_code), end [all...] |
/art/disassembler/ |
H A D | disassembler_mips.h | 36 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
|