Searched defs:begin (Results 1 - 25 of 33) sorted by relevance

12

/art/disassembler/
H A Ddisassembler.cc47 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 Ddisassembler_arm64.cc34 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 Ddisassembler_mips.cc264 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 Ddisassembler_x86.cc29 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) {
/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());
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 Dbit_vector.h43 * object with begin() and end() suitable for range-based loops:
134 IndexIterator begin() const { function in class:art::BitVector::IndexContainer
H A Dstringpiece.h136 iterator begin() const { return ptr_; } function in class:art::StringPiece
H A Dhash_set.h160 Iterator begin() { function in class:art::HashSet
172 return begin() == end();
/art/runtime/
H A Ddex_file_verifier.h29 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 Dindirect_reference_table.h327 IrtIterator begin() { function in class:art::IndirectReferenceTable
H A Dparsed_options.cc873 const char* begin = &s[colon + 1]; local
875 size_t result = strtoul(begin, &end, 10);
876 if (begin == end || *end != '\0') {
H A Dsafe_map.h60 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 Dmem_map.cc64 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 Dimmune_region.h51 void SetBegin(mirror::Object* begin) { argument
52 begin_ = begin;
/art/compiler/utils/
H A Darray_ref.h113 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 Dcard_table.cc111 byte* begin = mem_map_->Begin() + offset_; local
115 << " begin: " << reinterpret_cast<void*>(begin)
118 << " heap begin: " << AddrFromCard(begin)
H A Dcard_table.h102 // For every dirty at least minumum age between begin and end invoke the visitor with the
129 CardTable(MemMap* begin, byte* biased_begin, size_t offset);
133 byte* begin = mem_map_->Begin() + offset_; local
135 return card_addr >= begin && card_addr < end;
147 // Card table doesn't begin at the beginning of the mem_map_, instead it is displaced by offset
H A Dspace_bitmap_test.cc42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument
45 begin_(begin),
/art/runtime/gc/space/
H A Dvalgrind_malloc_space-inl.h96 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 Dbump_pointer_space.cc45 BumpPointerSpace::BumpPointerSpace(const std::string& name, byte* begin, byte* limit) argument
46 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
H A Dmalloc_space.cc39 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 Ddlmalloc_space.cc38 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 Drosalloc_space.cc45 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 Dspace.h305 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 Dlarge_object_space.cc87 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())

Completed in 259 milliseconds

12