Searched refs:end (Results 1 - 25 of 221) sorted by relevance

123456789

/art/test/028-array-write/src/
H A DMain.java27 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/runtime/base/
H A Dstl_util.h28 std::sort(v->begin(), v->end());
29 v->erase(std::unique(v->begin(), v->end()), v->end());
44 ForwardIterator end) {
45 while (begin != end) {
54 // hash_set, or any other STL container which defines sensible begin(), end(),
65 STLDeleteContainerPointers(container->begin(), container->end());
76 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
43 STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) argument
/art/runtime/gc/allocator/
H A Ddlmalloc.h47 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 Ddlmalloc.cc59 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, size_t used_bytes,
89 extern "C" void DlmallocObjectsAllocatedCallback(void* start, void* end, size_t used_bytes, argument
92 UNUSED(end);
/art/test/004-InterfaceTest/src/
H A DMain.java29 long end = System.currentTimeMillis();
30 return (end - start);
40 long end = System.currentTimeMillis();
41 return (end - start);
/art/runtime/gc/accounting/
H A Dheap_bitmap.cc28 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 Dcard_table.cc110 void CardTable::ClearCardRange(uint8_t* start, uint8_t* end) { argument
112 memset(start, 0, end - start);
116 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize);
119 uint8_t* end_card = CardFromAddr(end);
125 // Handle unaligned regions at start / end.
137 uint8_t* end = mem_map_->End(); local
141 << " end: " << reinterpret_cast<void*>(end)
144 << " heap end: " << AddrFromCard(end)
[all...]
H A Dspace_bitmap_test.cc43 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/compiler/dex/quick/
H A Dlazy_debug_frame_opcode_writer.cc39 this->opcodes_.insert(this->opcodes_.end(),
49 this->opcodes_.insert(this->opcodes_.end(),
51 old_opcodes.end());
/art/cmdline/
H A Dtoken_range.h43 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 DMain.java53 long start, end;
58 end = System.nanoTime();
/art/test/023-many-interfaces/src/
H A DManyInterfaces.java173 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/test/053-wait-some/src/
H A DMain.java33 long start, end;
54 end = System.currentTimeMillis();
56 long elapsed = end - start;
/art/runtime/
H A Doat.cc37 SafeMap<std::string, std::string>::const_iterator end = variable_data->end(); local
38 for ( ; it != end; ++it) {
379 // Advance start until it is either end or \0.
380 static const char* ParseString(const char* start, const char* end) { argument
381 while (start < end && *start != 0) {
389 const char* end = ptr + key_value_store_size_; local
391 while (ptr < end) {
393 const char* str_end = ParseString(ptr, end);
394 if (str_end < end) {
415 const char* end = ptr + key_value_store_size_; local
464 SafeMap<std::string, std::string>::const_iterator end = key_value_store->end(); local
[all...]
H A Dleb128.h29 // just past the end of the read value. This function tolerates
57 // just past the end of the read value. This function tolerates
65 // just past the end of the read value. This function tolerates
148 for (uint8_t* end = EncodeUnsignedLeb128(dest, value); end < old_end; end++) {
150 end[-1] |= 0x80;
151 end[0] = 0;
197 void InsertBackUnsigned(It cur, It end) { argument
198 for (; cur != end;
208 InsertBackSigned(It cur, It end) argument
[all...]
H A Dmem_map.cc61 static_cast<uint32_t>(it->end),
71 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) {
144 uintptr_t end = begin + size; local
150 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) {
151 if ((begin >= it->start && begin < it->end) // start of new within old
152 && (end > it->start && end <= it->end)) { // end of new within old
158 "any existing map. See process maps in the log.", begin, end);
163 CheckNonOverlapping(uintptr_t begin, uintptr_t end, std::string* error_msg) argument
701 void* end = map->BaseEnd(); local
[all...]
/art/compiler/dex/
H A Dverification_results.cc60 if (it != verified_methods_.end()) {
76 DCHECK(verified_methods_.find(ref) != verified_methods_.end());
83 return (it != verified_methods_.end()) ? it->second : nullptr;
89 if (it != verified_methods_.end()) {
105 return (rejected_classes_.find(ref) != rejected_classes_.end());
/art/runtime/jit/
H A Djit_code_cache.cc85 uint8_t* JitCodeCache::AddDataArray(Thread* self, const uint8_t* begin, const uint8_t* end) { argument
87 const size_t size = end - begin;
91 std::copy(begin, end, data_cache_ptr_);
103 if (it != method_code_map_.end()) {
115 if (it != method_code_map_.end()) {
/art/test/449-checker-bce/src/
H A DMain.java636 void foo1(int[] array, int start, int end) { argument
638 // start >= 0, one for end <= array.length,
641 for (int i = start ; i < end; i++) {
671 void foo2(int[] array, int start, int end) { argument
673 // start >= 0, one for end <= array.length,
676 for (int i = start ; i <= end; i++) {
705 void foo3(int[] array, int end) { argument
706 // Two HDeoptimize will be added. One for end < array.length,
709 for (int i = 3 ; i <= end; i++) {
738 void foo4(int[] array, int end) { argument
779 foo5(int[] array, int end) argument
834 foo6(int[] array, int start, int end) argument
868 foo7(int[] array, int start, int end, boolean lowEnd) argument
912 foo8(int[][] matrix, int start, int end) argument
961 partialLooping(int[] array, int start, int end) argument
[all...]
/art/compiler/utils/
H A Ddedupe_set.h58 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
59 b.store_ptr->begin(), b.store_ptr->end());
61 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
62 b.in_key->second->begin(), b.in_key->second->end());
64 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
65 b.store_ptr->begin(), b.store_ptr->end());
67 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
68 b.in_key->second->begin(), b.in_key->second->end());
92 if (it != keys_[shard_bin].end()) {
151 allocator_.construct(ret, key.begin(), key.end(), allocator
[all...]
H A Ddedupe_set_test.cc54 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin()));
66 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array2->begin()));
78 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array3->begin()));
/art/runtime/jdwp/
H A Dobject_registry.cc124 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 Ddisassembler_mips.h35 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
/art/runtime/gc/space/
H A Dbump_pointer_space-inl.h48 uint8_t* end = end_.LoadRelaxed(); local
49 if (end + num_bytes > growth_end_) {
52 mirror::Object* obj = reinterpret_cast<mirror::Object*>(end);
53 end_.StoreRelaxed(end + num_bytes);
/art/test/021-string2/src/junit/framework/
H A DComparisonCompactor.java50 int end= Math.min(fExpected.length(), fActual.length());
51 for (; fPrefix < end; fPrefix++) {
72 int end= Math.min(fExpected.length() - fSuffix + 1 + fContextLength, fExpected.length());
73 return fExpected.substring(fExpected.length() - fSuffix + 1, end) + (fExpected.length() - fSuffix + 1 < fExpected.length() - fContextLength ? ELLIPSIS : "");

Completed in 622 milliseconds

123456789