/art/runtime/gc/space/ |
H A D | bump_pointer_space.cc | 46 BumpPointerSpace::BumpPointerSpace(const std::string& name, uint8_t* begin, uint8_t* limit) argument 47 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
|
H A D | malloc_space.cc | 39 uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, 42 : ContinuousMemMapAllocSpace(name, mem_map, begin, end, limit, kGcRetentionPolicyAlwaysCollect), 142 // Should never be asked for negative footprint (ie before begin). Zero footprint is ok. 223 << " begin=" << reinterpret_cast<void*>(Begin()) 38 MallocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool create_bitmaps, bool can_move_objects, size_t starting_size, size_t initial_size) argument
|
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, 66 uint8_t* begin = mem_map->Begin(); local 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, 112 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { argument 115 // create mspace using our backing storage starting at begin and with a footprint of 118 void* msp = create_mspace_with_base(begin, morecore_star 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 [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, 77 uint8_t* begin = mem_map->Begin(); local 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, 131 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, argument 137 // create rosalloc using our backing storage starting at begin and 141 begin, morecore_star 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 [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) { 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 - begin; 539 << " begin: " << reinterpret_cast<void*>(Begin())
|
H A D | region_space.h | 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); 465 uint8_t* begin_; // The begin address of the region.
|
H A D | space.h | 326 uint8_t* begin, uint8_t* end, uint8_t* limit) : 327 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { 393 MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, argument 395 : ContinuousSpace(name, gc_retention_policy, begin, end, limit), 448 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, argument 450 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { 325 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, uint8_t* begin, uint8_t* end, uint8_t* limit) argument
|
/art/runtime/ |
H A D | indirect_reference_table.h | 329 IrtIterator begin() { function in class:art::IndirectReferenceTable
|
H A D | safe_map.h | 62 iterator begin() { return map_.begin(); } function in class:art::SafeMap 63 const_iterator begin() const { return map_.begin(); } function in class:art::SafeMap 106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); 112 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
|
H A D | utils.h | 203 // additionally allowing names that begin with '<' and end with '>'. 401 inline void FlushInstructionCache(char* begin, char* end) { argument 405 __builtin___clear_cache(begin, end);
|
H A D | mem_map.cc | 65 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { 137 uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); local 138 uintptr_t end = begin + size; 146 if (begin >= reinterpret_cast<uintptr_t>(map->Begin()) && 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 171 "any existing map. See process maps in the log.", begin, end); 177 static bool CheckNonOverlapping(uintptr_t begin, argument 186 for (BacktraceMap::const_iterator it = map->begin(); i 498 MemMap(const std::string& name, uint8_t* begin, size_t size, void* base_begin, size_t base_size, int prot, bool reuse, size_t redzone_size) argument 908 volatile uint8_t* begin = reinterpret_cast<volatile uint8_t*>(base_begin_); local [all...] |
H A D | oat_file.cc | 120 void SetBegin(const uint8_t* begin) { argument 121 begin_ = begin; 1358 for (auto it = split.begin(), end = split.end(); it != end; it += 2) { 1406 for (auto it = split.begin(), end = split.end(); it != end; it += 2) {
|
H A D | dex_file_verifier.cc | 131 bool DexFileVerifier::Verify(const DexFile* dex_file, const uint8_t* begin, size_t size, argument 133 std::unique_ptr<DexFileVerifier> verifier(new DexFileVerifier(dex_file, begin, size, location)); 2418 // functionality, as we're still verifying the dex file. begin and header correspond to the 2421 static std::string GetStringOrError(const uint8_t* const begin, argument 2430 reinterpret_cast<const DexFile::StringId*>(begin + header->string_ids_off_) + string_idx; 2434 const uint8_t* ptr = begin + string_id->string_data_off_; 2439 static std::string GetClassOrError(const uint8_t* const begin, argument 2449 reinterpret_cast<const DexFile::TypeId*>(begin + header->type_ids_off_) + class_idx; 2453 return GetStringOrError(begin, header, type_id->descriptor_idx_); 2456 static std::string GetFieldDescriptionOrError(const uint8_t* const begin, argument 2473 GetMethodDescriptionOrError(const uint8_t* const begin, const DexFile::Header* const header, uint32_t idx) argument 2573 FindMethodName(uint32_t method_index, const uint8_t* begin, const DexFile::Header* header, const char** str, std::string* error_msg) argument [all...] |
H A D | thread.cc | 116 uintptr_t* begin = reinterpret_cast<uintptr_t*>(&tlsPtr_.jni_entrypoints); local 119 for (uintptr_t* it = begin; it != end; ++it) {
|
H A D | debugger.cc | 1438 * expect slots to begin with arguments, but dex code places them at 1687 const uint8_t* begin = reinterpret_cast<const uint8_t*>(code_item->insns_); local 1688 const uint8_t* end = begin + byte_count; 1689 for (const uint8_t* p = begin; p != end; ++p) { 3404 gBreakpoints.erase(gBreakpoints.begin() + i); 4883 return std::distance(table_.begin(), it);
|
/art/compiler/utils/ |
H A D | intrusive_forward_list.h | 155 iterator begin() { return iterator(first_.next_hook); } function in class:art::IntrusiveForwardList 156 const_iterator begin() const { return const_iterator(first_.next_hook); } function in class:art::IntrusiveForwardList 164 bool empty() const { return begin() == end(); } 168 reference front() { return *begin(); } 169 const_reference front() const { return *begin(); } 281 for (iterator current = begin(); current != end(); ++current) { 296 iterator prev = begin(); 318 iterator current = begin(); 320 iterator other_current = other.begin(); 344 size_t n = std::distance(begin(), en [all...] |
/art/cmdline/ |
H A D | cmdline_types.h | 289 const char* begin = str.c_str(); local 295 long long int result = strtoll(begin, &end, 10); // NOLINT [runtime/int] [4] 296 if (begin == end || *end != '\0' || errno == EINVAL) {
|
/art/compiler/ |
H A D | oat_test.cc | 583 uintptr_t begin = reinterpret_cast<uintptr_t>(opened_oat_file->Begin()); local 584 EXPECT_EQ(begin, static_cast<uint32_t>(begin));
|
/art/disassembler/ |
H A D | disassembler_x86.cc | 31 size_t DisassemblerX86::Dump(std::ostream& os, const uint8_t* begin) { argument 32 return DumpInstruction(os, begin); 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) { 155 hex << StringPrintf("%02X", begin[i]);
|
H A D | disassembler_arm.cc | 33 size_t DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin) { argument 34 if ((reinterpret_cast<intptr_t>(begin) & 1) == 0) { 35 DumpArm(os, begin); 39 begin = reinterpret_cast<const uint8_t*>(reinterpret_cast<uintptr_t>(begin) & ~1); 40 return DumpThumb16(os, begin); 44 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 45 if ((reinterpret_cast<intptr_t>(begin) & 1) == 0) { 46 for (const uint8_t* cur = begin; cur < end; cur += 4) { 51 begin [all...] |
/art/runtime/base/ |
H A D | hash_set.h | 272 iterator begin() { function in class:art::HashSet 281 const_iterator begin() const { function in class:art::HashSet
|
/art/compiler/optimizing/ |
H A D | instruction_builder.cc | 356 const Instruction* const begin = Instruction::At(code_item_.insns_); local 357 const Instruction* const end = begin->RelativeAt(code_item_.insns_size_in_code_units_); 358 for (const Instruction* inst = begin; inst < end; inst = inst->Next()) {
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.cc | 129 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) { 405 if (lower_it != free_page_runs_.begin()) { 410 bool to_exit_loop = it == free_page_runs_.begin(); 575 uint8_t* begin = reinterpret_cast<uint8_t*>(new_run) + headerSizes[idx]; local 577 __builtin_prefetch(begin + i); 591 auto it = bt->begin(); 1892 for (auto it = thread_list.begin(); it != thread_list.end(); ++it) {
|
/art/runtime/gc/collector/ |
H A D | mark_sweep.cc | 812 uint8_t* begin, 820 begin_(begin), 977 uintptr_t begin, 981 begin_(begin), 1027 uintptr_t begin = reinterpret_cast<uintptr_t>(space->Begin()); local 1033 while (begin != end) { 1034 uintptr_t start = begin; 1035 uintptr_t delta = (end - begin) / n; 1037 if (delta < 16 * KB) delta = end - begin; 1038 begin 809 CardScanTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, uint8_t* begin, uint8_t* end, uint8_t minimum_age, size_t mark_stack_size, StackReference<mirror::Object>* mark_stack_obj, bool clear_card) argument 974 RecursiveMarkTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, uintptr_t begin, uintptr_t end) argument 1052 uintptr_t begin = reinterpret_cast<uintptr_t>(space->Begin()); local [all...] |