/art/runtime/gc/space/ |
H A D | dlmalloc_space.cc | 40 void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, 42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 60 uint8_t* end = mem_map->Begin() + starting_size; local 62 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); 69 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, 72 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, 154 void* allocator, uint8_t* begin, uint8_t* end, 159 mem_map, initial_size_, name, allocator, begin, end, limit, growth_limit, 162 return new DlMallocSpace(mem_map, initial_size_, name, allocator, begin, end, limit, 226 // Trim to release memory at the end o 39 DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects, size_t starting_size) argument 153 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument 234 Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg), void* arg) argument 294 MSpaceChunkCallback(void* start, void* end, size_t used_bytes, void* arg) argument [all...] |
H A D | rosalloc_space.cc | 46 art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, 49 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 71 uint8_t* end = mem_map->Begin() + starting_size; local 73 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); 82 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, 85 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, 177 void* allocator, uint8_t* begin, uint8_t* end, 182 mem_map, initial_size_, name, reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, 186 reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, limit, 251 // Trim to release memory at the end o 45 RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects, size_t starting_size, bool low_memory_mode) argument 176 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument 261 Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg), void* arg) argument [all...] |
H A D | large_object_space.cc | 110 LargeObjectSpace::LargeObjectSpace(const std::string& name, uint8_t* begin, uint8_t* end) argument 113 total_objects_allocated_(0), begin_(begin), end_(end) { 179 CHECK(it != large_objects_.end()); 193 if (UNLIKELY(it == large_objects_.end())) { 212 CHECK(it != large_objects_.end()) << "Attempted to get size of a large object which is not live"; 244 return large_objects_.find(const_cast<mirror::Object*>(obj)) != large_objects_.end(); 247 return large_objects_.find(const_cast<mirror::Object*>(obj)) != large_objects_.end(); 363 FreeListSpace::FreeListSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end) argument 364 : LargeObjectSpace(name, begin, end), 367 const size_t space_capacity = end [all...] |
H A D | region_space.h | 32 typedef void(*WalkCallback)(void *start, void *end, size_t num_bytes, void* callback_arg); 242 Region(size_t idx, uint8_t* begin, uint8_t* end) argument 243 : idx_(idx), begin_(begin), top_(begin), end_(end), 247 DCHECK_LT(begin, end); 248 DCHECK_EQ(static_cast<size_t>(end - begin), kRegionSize); 468 uint8_t* end_; // The end address of the region.
|
H A D | space.h | 279 // The end of the address range covered by the space. 284 // Change the end of the space. Be careful with use since changing the end of a space to an 286 void SetEnd(uint8_t* end) { argument 287 end_.StoreRelaxed(end); 307 // Is object within this space? We check to see if the pointer is beyond the end first as 326 uint8_t* begin, uint8_t* end, uint8_t* limit) : 327 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { 333 // Current end of the space. 393 MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_ argument 325 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, uint8_t* begin, uint8_t* end, uint8_t* limit) argument 448 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, GcRetentionPolicy gc_retention_policy) argument [all...] |
/art/runtime/mirror/ |
H A D | string.cc | 46 const uint16_t* end = chars + count; local 47 while (p < end) { 270 void String::GetChars(int32_t start, int32_t end, Handle<CharArray> array, int32_t index) { argument 273 memcpy(data, value, (end - start) * sizeof(uint16_t));
|
/art/runtime/ |
H A D | oat_file_assistant_test.cc | 173 reservation_start < reservation_end && it != map->end(); ++it) { 175 reservation_start = std::max(reservation_start, it->end); 182 void ReserveImageSpaceChunk(uintptr_t start, uintptr_t end) { argument 183 if (start < end) { 187 reinterpret_cast<uint8_t*>(start), end - start, 999 std::reverse(target_path.begin(), target_path.end()); 1000 std::reverse(cwd_path.begin(), cwd_path.end()); 1012 // the end of target_path. 1018 std::reverse(target_path.begin(), target_path.end()); 1153 EXPECT_TRUE(oat_files.find(oat_file) == oat_files.end()); [all...] |
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...] |
H A D | oat_file.cc | 124 void SetEnd(const uint8_t* end) { argument 125 end_ = end; 218 // Return true on success, false if the read would go beyond the end of the OatFile. 1089 if (primary_it != oat_dex_files_.end()) { 1098 if (secondary_lb != secondary_oat_dex_files_.end() && key == secondary_lb->first) { 1106 if (canonical_it != oat_dex_files_.end()) { 1358 for (auto it = split.begin(), end = split.end(); it != end; it += 2) { 1406 for (auto it = split.begin(), end [all...] |
H A D | profiler.cc | 501 if (i == table[index]->end()) { 560 if (i == method_context_table->end()) { 602 if (pi != previous_.end()) { 642 if (pi != previous_.end()) { 649 if (ci == new_context_map.end()) { 763 // Now read each line until the end of file. Each line consists of 3 or 4 fields separated by / 839 // Now read each line until the end of file. Each line consists of 3 fields separated by '/'. 859 ProfileSet::iterator end = countSet.end(); local 861 for (ProfileSet::iterator it = countSet.begin(); it != end ; i 891 ProfileMap::iterator end = profile_map_.end(); local [all...] |
H A D | thread_list.cc | 101 return find(list_.begin(), list_.end(), thread) != list_.end(); 163 char* end; local 164 pid_t tid = strtol(e->d_name, &end, 10); 165 if (!*end) {
|
H A D | trace.cc | 109 if (it != art_method_id_map_.end()) { 637 uint8_t* end = buf + buf_size; local 639 while (ptr < end) { 858 if (seen_methods_.find(dex_file) == seen_methods_.end()) { 1005 uint8_t* end = buf_.get() + buf_size; local 1007 while (ptr < 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/test/449-checker-bce/src/ |
H A D | Main.java | 413 // references may be included in the end. 1013 // Added blocks at end for deoptimization. 1024 void foo1(int[] array, int start, int end, boolean expectInterpreter) { argument 1028 for (int i = start ; i < end; i++) { 1051 // Added blocks at end for deoptimization. 1062 void foo2(int[] array, int start, int end, boolean expectInterpreter) { argument 1066 for (int i = start ; i <= end; i++) { 1089 // Added blocks at end for deoptimization. 1100 void foo3(int[] array, int end, boolean expectInterpreter) { argument 1104 for (int i = 3 ; i <= end; 1139 foo4(int[] array, int end, boolean expectInterpreter) argument 1189 foo5(int[] array, int end, boolean expectInterpreter) argument 1255 foo6(int[] array, int start, int end, boolean expectInterpreter) argument 1291 foo7(int[] array, int start, int end, boolean lowEnd) argument 1338 foo8(int[][] matrix, int start, int end) argument 1397 partialLooping(int[] array, int start, int end) argument [all...] |
/art/cmdline/ |
H A D | cmdline_types.h | 160 char* end; local 161 uint64_t port = strtoul(port_string.c_str(), &end, 10); 162 if (*end != '\0' || port > 0xffff) { 218 // If this is the end of the string, the user 268 char* end = nullptr; local 270 double value = strtod(str.c_str(), &end); 272 if (*end != '\0') { 290 char* end; local 295 long long int result = strtoll(begin, &end, 10); // NOLINT [runtime/int] [4] 296 if (begin == end || *en [all...] |
/art/compiler/utils/ |
H A D | assembler_test_base.h | 401 std::istream_iterator<std::string> end; local 402 std::vector<std::string> tokens(start, end);
|
/art/disassembler/ |
H A D | disassembler_x86.cc | 35 void DisassemblerX86::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 37 for (const uint8_t* cur = begin; cur < end; cur += length) { 152 static std::string DumpCodeHex(const uint8_t* begin, const uint8_t* end) { argument 154 for (size_t i = 0; begin + i < end; ++i) {
|
/art/runtime/base/ |
H A D | hash_set.h | 290 iterator end() { function in class:art::HashSet 295 const_iterator end() const { function in class:art::HashSet 362 // Find an element, returns end() if not found. 550 // This value for not found is important so that iterator(this, FindIndex(...)) == end().
|
H A D | arena_allocator.h | 322 auto* end = reinterpret_cast<uint8_t*>(ptr) + ptr_size; variable 324 if (end == ptr_) { 325 DCHECK(!IsRunningOnMemoryTool()); // Red zone prevents end == ptr_.
|
/art/compiler/optimizing/ |
H A D | register_allocator.cc | 134 void RegisterAllocator::BlockRegister(Location location, size_t start, size_t end) { argument 152 interval->AddRange(start, end); 155 void RegisterAllocator::BlockRegisters(size_t start, size_t end, bool caller_save_only) { argument 158 BlockRegister(Location::RegisterLocation(i), start, end); local 163 BlockRegister(Location::FpuRegisterLocation(i), start, end); local 632 active_.end(), 644 active_.erase(active_kept_end, active_.end()); 765 // The input must be live until the end of `defined_by`, to comply to 766 // the linear scan algorithm. So we use `defined_by`'s end lifetime 897 // so if there are caller-save registers available at the end, w 1354 size_t end = interval->GetLastSibling()->GetEnd(); local [all...] |
H A D | instruction_builder.cc | 98 // locals from the pre header. Their inputs will be populated at the end of 357 const Instruction* const end = begin->RelativeAt(code_item_.insns_size_in_code_units_); local 358 for (const Instruction* inst = begin; inst < end; inst = inst->Next()) { 366 if (next < end) { 740 // The back-end code generator relies on this check in order to ensure that it will not 1685 if (it != skipped_interpreter_metadata_.end()) {
|
H A D | intrinsics_arm.cc | 163 Label end; local 165 __ CompareAndBranchIfNonZero(in_reg_hi, &end); 168 __ Bind(&end); 204 Label end; local 207 __ CompareAndBranchIfNonZero(in_reg_lo, &end); 211 __ Bind(&end); 1046 Label end; local 1104 __ b(&end); 1109 __ Bind(&end); 1553 // Compute base source address, base destination address, and end sourc [all...] |
/art/dexdump/ |
H A D | dexdump.cc | 123 // Strip leading [s; will be added to end. 460 const u4 end = start + pTry->insn_count_; local 461 fprintf(gOutFile, " 0x%04x - 0x%04x\n", start, end);
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.h | 74 uint8_t* end = fpr_base + ByteSize(rosalloc); variable 75 return end; 377 uintptr_t end = reinterpret_cast<uintptr_t>(End()); local 378 Slot* last_slot = reinterpret_cast<Slot*>(end - bracket_size); 451 void InspectAllSlots(void (*handler)(void* start, void* end, size_t used_bytes, void* callback_arg), void* arg); 651 kPageReleaseModeEnd, // Release empty pages at the end of the space. 654 // at the end of the space. 703 // the end of the memory region that's currently managed by this allocator. 707 // the end of the memory region that's ever managed by this allocator. 772 // The end addres [all...] |