/art/disassembler/ |
H A D | disassembler.cc | 47 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { argument 49 return StringPrintf("%p", begin); 51 size_t offset = begin - disassembler_options_->base_address_;
|
H A D | disassembler_arm64.cc | 34 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { argument 35 uint32_t instruction = ReadU32(begin); 37 os << FormatInstructionPointer(begin) 42 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 43 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) {
|
H A D | disassembler_mips.cc | 264 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 265 for (const uint8_t* cur = begin; cur < end; cur += 4) {
|
H A D | disassembler_x86.cc | 29 size_t DisassemblerX86::Dump(std::ostream& os, const uint8_t* begin) { argument 30 return DumpInstruction(os, begin); 33 void DisassemblerX86::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 35 for (const uint8_t* cur = begin; cur < end; cur += length) {
|
H A D | disassembler_arm.cc | 30 size_t DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin) { argument 31 if ((reinterpret_cast<intptr_t>(begin) & 1) == 0) { 32 DumpArm(os, begin); 36 begin = reinterpret_cast<const uint8_t*>(reinterpret_cast<uintptr_t>(begin) & ~1); 37 return DumpThumb16(os, begin); 41 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 42 if ((reinterpret_cast<intptr_t>(begin) & 1) == 0) { 43 for (const uint8_t* cur = begin; cur < end; cur += 4) { 48 begin [all...] |
/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()); 43 void STLDeleteContainerPointers(ForwardIterator begin, argument 45 while (begin != end) { 46 ForwardIterator temp = begin; 47 ++begin; 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) {
|
H A D | bit_vector.h | 43 * object with begin() and end() suitable for range-based loops: 134 IndexIterator begin() const { function in class:art::BitVector::IndexContainer
|
H A D | stringpiece.h | 136 iterator begin() const { return ptr_; } function in class:art::StringPiece
|
/art/runtime/ |
H A D | dex_file_verifier.h | 29 static bool Verify(const DexFile* dex_file, const byte* begin, size_t size, 37 DexFileVerifier(const DexFile* dex_file, const byte* begin, size_t size, const char* location) argument 38 : dex_file_(dex_file), begin_(begin), size_(size), location_(location),
|
H A D | indirect_reference_table.h | 308 IrtIterator begin() { function in class:art::IndirectReferenceTable
|
H A D | parsed_options.cc | 874 const char* begin = &s[colon + 1]; local 876 size_t result = strtoul(begin, &end, 10); 877 if (begin == end || *end != '\0') {
|
H A D | safe_map.h | 60 iterator begin() { return map_.begin(); } function in class:art::SafeMap 61 const_iterator begin() const { return map_.begin(); } function in class:art::SafeMap 99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));
|
H A D | mem_map.cc | 64 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { 135 static bool ContainedWithinExistingMap(uintptr_t begin, argument 143 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { 144 if ((begin >= it->start && begin < it->end) // start of new within old 153 begin, end, maps.c_str()); 159 static bool CheckNonOverlapping(uintptr_t begin, argument 167 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { 168 if ((begin >= it->start && begin < i 476 MemMap(const std::string& name, byte* begin, size_t size, void* base_begin, size_t base_size, int prot, bool reuse) argument [all...] |
/art/runtime/gc/collector/ |
H A D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { argument 52 begin_ = begin;
|
/art/compiler/utils/ |
H A D | array_ref.h | 113 iterator begin() { return array_; } function in class:art::ArrayRef 114 const_iterator begin() const { return array_; } function in class:art::ArrayRef 122 reverse_iterator rend() { return reverse_iterator(begin()); } 123 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
|
/art/runtime/gc/accounting/ |
H A D | card_table.cc | 111 byte* begin = mem_map_->Begin() + offset_; local 115 << " begin: " << reinterpret_cast<void*>(begin) 118 << " heap begin: " << AddrFromCard(begin)
|
H A D | card_table.h | 103 // For every dirty at least minumum age between begin and end invoke the visitor with the 130 CardTable(MemMap* begin, byte* biased_begin, size_t offset); 134 byte* begin = mem_map_->Begin() + offset_; local 136 return card_addr >= begin && card_addr < end; 148 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
|
H A D | space_bitmap_test.cc | 42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument 45 begin_(begin),
|
/art/runtime/gc/space/ |
H A D | valgrind_malloc_space-inl.h | 96 A allocator, byte* begin, 100 S(name, mem_map, allocator, begin, end, limit, growth_limit, can_move_objects, starting_size, 95 ValgrindMallocSpace(const std::string& name, MemMap* mem_map, A allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, size_t initial_size, bool can_move_objects, size_t starting_size) argument
|
H A D | bump_pointer_space.cc | 45 BumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit) argument 46 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
|
H A D | malloc_space.cc | 39 byte* begin, byte* end, byte* 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. 222 << " begin=" << reinterpret_cast<void*>(Begin()) 38 MallocSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* 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 | 38 DlMallocSpace::DlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, argument 42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 66 byte* begin = mem_map->Begin(); local 69 name, mem_map, mspace, begin, end, begin + capacity, growth_limit, initial_size, 72 return new DlMallocSpace(name, mem_map, mspace, begin, end, begin + capacity, growth_limit, 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 151 CreateInstance(const std::string& name, MemMap* mem_map, void* allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects) argument [all...] |
H A D | rosalloc_space.cc | 45 art::gc::allocator::RosAlloc* rosalloc, byte* begin, byte* end, 48 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 73 byte* begin = mem_map->Begin(); local 79 return new RosAllocSpace(name, mem_map, rosalloc, begin, end, begin + capacity, growth_limit, 125 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, argument 130 // create rosalloc using our backing storage starting at begin and 134 begin, morecore_start, maximum_size, 167 byte* begin, byte* end, byte* limit, size_t growth_limit, 170 begin, en 44 RosAllocSpace(const std::string& name, MemMap* mem_map, art::gc::allocator::RosAlloc* rosalloc, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects, size_t starting_size, size_t initial_size, bool low_memory_mode) argument 166 CreateInstance(const std::string& name, MemMap* mem_map, void* allocator, byte* begin, byte* end, byte* limit, size_t growth_limit, bool can_move_objects) argument [all...] |
H A D | space.h | 305 byte* begin, byte* end, byte* limit) : 306 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { 372 MemMapSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end, byte* limit, argument 374 : ContinuousSpace(name, gc_retention_policy, begin, end, limit), 428 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, byte* begin, argument 430 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { 304 ContinuousSpace(const std::string& name, GcRetentionPolicy gc_retention_policy, byte* begin, byte* end, byte* limit) argument
|
H A D | large_object_space.cc | 87 LargeObjectSpace::LargeObjectSpace(const std::string& name, byte* begin, byte* end) argument 90 total_objects_allocated_(0), begin_(begin), end_(end) { 177 for (auto it = mem_maps_.begin(); it != mem_maps_.end(); ++it) { 294 FreeListSpace::FreeListSpace(const std::string& name, MemMap* mem_map, byte* begin, byte* end) argument 295 : LargeObjectSpace(name, begin, end), 298 const size_t space_capacity = end - begin; 467 << " begin: " << reinterpret_cast<void*>(Begin())
|