/art/compiler/ |
H A D | leb128_encoder.h | 45 void InsertBack(It cur, It end) { argument 46 for (; cur != end; ++cur) {
|
/art/runtime/base/ |
H A D | stl_util.h | 28 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()); 75 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 43 STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) argument
|
H A D | stringpiece.h | 118 // Does "this" end with "x" 137 iterator end() const { return ptr_ + length_; } function in class:art::StringPiece
|
/art/runtime/gc/allocator/ |
H A D | dlmalloc.cc | 53 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* arg) { argument 60 end = reinterpret_cast<void*>(art::RoundDown(reinterpret_cast<uintptr_t>(end), art::kPageSize)); 61 if (end > start) { 62 size_t length = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start);
|
/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/runtime/gc/accounting/ |
H A D | space_bitmap_test.cc | 44 BitmapVerify(SpaceBitmap* bitmap, const mirror::Object* begin, const mirror::Object* end) argument 47 end_(end) {} 78 // This handles all the cases, having runs which start and end on the same word, and different 84 mirror::Object* end = local 86 BitmapVerify(space_bitmap.get(), start, end);
|
H A D | card_table.cc | 85 byte* __attribute__((unused)) end = mem_map_->End(); local 107 byte* end = mem_map_->End(); local 111 << " end: " << reinterpret_cast<void*>(end) 114 << " heap end: " << AddrFromCard(end)
|
H A D | card_table.h | 73 void VisitClear(const void* start, const void* end, const Visitor& visitor) { argument 75 byte* card_end = CardFromAddr(end); 102 // For every dirty at least minumum age between begin and end invoke the visitor with the 133 byte* end = mem_map_->End(); local 134 return card_addr >= begin && card_addr < end;
|
H A D | mod_union_table.cc | 151 references_.find(ref) == references_.end()) { 203 std::set<const Object*> reference_set(it.second.begin(), it.second.end()); 206 uintptr_t end = start + CardTable::kCardSize; local 210 live_bitmap->VisitMarkedRange(start, end, visitor); 220 uintptr_t end = start + CardTable::kCardSize; local 221 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << ","; 227 uintptr_t end = start + CardTable::kCardSize; local 228 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "->{"; 247 uintptr_t end = start + CardTable::kCardSize; local 251 live_bitmap->VisitMarkedRange(start, end, visito 297 auto end = start + CardTable::kCardSize; local 314 auto end = start + CardTable::kCardSize; local [all...] |
H A D | space_bitmap.cc | 82 // Not sure if doing this trim is necessary, since nothing past the end of the heap capacity 107 uintptr_t end = OffsetToIndex(HeapLimit() - heap_begin_ - 1); local 109 for (uintptr_t i = 0; i <= end; ++i) { 149 size_t end = OffsetToIndex(sweep_end - live_bitmap.heap_begin_ - 1); local 150 CHECK_LT(end, live_bitmap.Size() / kWordSize); 153 for (size_t i = start; i <= end; i++) { 253 uintptr_t end = Size() / kWordSize; local 254 for (uintptr_t i = 0; i < end; ++i) { 284 << ",end=" << reinterpret_cast<const void*>(bitmap.HeapLimit())
|
/art/compiler/utils/ |
H A D | dedupe_set.h | 51 iterator end() { return keys_.end(); } function in class:art::DedupeSet 52 const_iterator end() const { return keys_.end(); } function in class:art::DedupeSet 59 if (it != keys_.end()) {
|
/art/runtime/ |
H A D | memory_region.h | 45 byte* end() const { return start() + size_; } function in class:art::MemoryRegion
|
H A D | vmap_table.h | 61 size_t end = DecodeUnsignedLeb128(&table); local 62 for (size_t i = 0; i < end; ++i) {
|
H A D | disassembler_mips.cc | 268 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 269 for (const uint8_t* cur = begin; cur < end; cur += 4) {
|
H A D | safe_map.h | 48 iterator end() { return map_.end(); } function in class:art::SafeMap 49 const_iterator end() const { return map_.end(); } function in class:art::SafeMap 66 DCHECK(it != map_.end());
|
H A D | indirect_reference_table.h | 306 IrtIterator end() { function in class:art::IndirectReferenceTable
|
H A D | thread_list.cc | 52 return find(list_.begin(), list_.end(), thread) != list_.end(); 98 char* end; local 99 pid_t tid = strtol(e->d_name, &end, 10); 100 if (!*end) { 197 uint64_t end = NanoTime(); local 200 if (NsToMs(end - start) > threshold) {
|
H A D | disassembler_x86.cc | 34 void DisassemblerX86::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 36 for (const uint8_t* cur = begin; cur < end; cur += length) {
|
H A D | dex_file.cc | 537 size_t end = signature.size(); local 539 while (offset < end) { 549 if (offset >= end) { // expect some descriptor following [ 558 if (offset >= end) { // unexpected early termination of descriptor 579 return offset == end; // return true if the signature had reached a sensible end 643 uint32_t end = start + ti->insn_count_; local 647 } else if (address >= end) { 1055 uint32_t end = start + tries->insn_count_; local 1056 if (address < end) { [all...] |
/art/runtime/gc/space/ |
H A D | large_object_space.cc | 81 CHECK(found != mem_maps_.end()) << "Attempted to free large object which was not live"; 94 CHECK(found != mem_maps_.end()) << "Attempted to get size of a large object which is not live"; 111 for (MemMaps::iterator it = mem_maps_.begin(); it != mem_maps_.end(); ++it) { 122 return mem_maps_.find(const_cast<mirror::Object*>(obj)) != mem_maps_.end(); 125 return mem_maps_.find(const_cast<mirror::Object*>(obj)) != mem_maps_.end(); 137 FreeListSpace::FreeListSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end) argument 140 end_(end), 143 free_end_ = end - begin; 167 CHECK(found != free_blocks_.end()); 180 // coalesced with the free end regio [all...] |
H A D | space.h | 201 // Is object within this space? We check to see if the pointer is beyond the end first as 216 byte* begin, byte* end) : 217 Space(name, gc_retention_policy), begin_(begin), end_(end) { 224 // Current end of the space. 215 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, byte* begin, byte* end) argument
|
H A D | dlmalloc_space.cc | 105 byte* end, size_t growth_limit, size_t initial_size) : 106 DlMallocSpace(name, mem_map, mspace, begin, end, growth_limit) { 120 byte* end, size_t growth_limit) 121 : MemMapSpace(name, mem_map, end - begin, kGcRetentionPolicyAlwaysCollect), 202 byte* end = mem_map->Begin() + starting_size; local 204 CHECK_MEMORY_CALL(mprotect, (end, capacity - initial_size, PROT_NONE), name); 211 space = new ValgrindDlMallocSpace(name, mem_map_ptr, mspace, mem_map_ptr->Begin(), end, 214 space = new DlMallocSpace(name, mem_map_ptr, mspace, mem_map_ptr->Begin(), end, growth_limit); 314 byte* end = mem_map->Begin() + starting_size; local 316 CHECK_MEMORY_CALL(mprotect, (end, capacit 104 ValgrindDlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, byte* end, size_t growth_limit, size_t initial_size) argument 119 DlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, byte* end, size_t growth_limit) argument 466 Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg), void* arg) argument [all...] |
/art/runtime/mirror/ |
H A D | string.cc | 52 const uint16_t* end = chars + count; local 53 while (p < end) {
|
/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/dex2oat/ |
H A D | dex2oat.cc | 403 char* end; local 404 int result = strtol(in, &end, 10); 405 if (in == end || *end != '\0') { 660 char* end; local 661 image_base = strtoul(image_base_str, &end, 16); 662 if (end == image_base_str || *end != '\0') {
|