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

12

/art/disassembler/
H A Ddisassembler.cc49 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { argument
51 return StringPrintf("%p", begin);
53 size_t offset = begin - disassembler_options_->base_address_;
H A Ddisassembler_arm64.cc102 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { argument
103 const vixl::Instruction* instr = reinterpret_cast<const vixl::Instruction*>(begin);
105 os << FormatInstructionPointer(begin)
110 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
111 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) {
H A Ddisassembler_mips.cc454 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
455 for (const uint8_t* cur = begin; cur < end; cur += 4) {
/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());
76 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
H A Diteration_range.h37 iterator begin() const { return first_; } function in class:art::IterationRange
H A Dbit_vector.h43 * object with begin() and end() suitable for range-based loops:
101 IndexIterator begin() const { function in class:art::BitVector::IndexContainer
H A Dstringpiece.h133 iterator begin() const { return ptr_; } function in class:art::StringPiece
/art/runtime/
H A Ddex_file_verifier.h29 static bool Verify(const DexFile* dex_file, const uint8_t* begin, size_t size,
37 DexFileVerifier(const DexFile* dex_file, const uint8_t* begin, size_t size, const char* location) argument
38 : dex_file_(dex_file), begin_(begin), size_(size), location_(location),
H A Dindirect_reference_table.h331 IrtIterator begin() { function in class:art::IndirectReferenceTable
H A Dsafe_map.h61 iterator begin() { return map_.begin(); } function in class:art::SafeMap
62 const_iterator begin() const { return map_.begin(); } function in class:art::SafeMap
100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k));
/art/runtime/gc/accounting/
H A Dbitmap.cc89 MemMap* mem_map, uintptr_t begin, size_t num_bits) {
90 return new MemoryRangeBitmap(mem_map, begin, num_bits);
88 CreateFromMemMap( MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
H A Dbitmap.h181 MemoryRangeBitmap(MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
182 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) {
H A Dcard_table.cc136 uint8_t* begin = mem_map_->Begin() + offset_; local
140 << " begin: " << reinterpret_cast<void*>(begin)
143 << " heap begin: " << AddrFromCard(begin)
H A Dread_barrier_table.h107 uint8_t* begin = mem_map_->Begin(); local
109 return entry_addr >= begin && entry_addr < end;
H A Dspace_bitmap_test.cc42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument
45 begin_(begin),
H A Dcard_table-inl.h213 << " begin: " << reinterpret_cast<void*>(mem_map_->Begin() + offset_)
228 uint8_t* begin = mem_map_->Begin() + offset_; local
230 return card_addr >= begin && card_addr < end;
236 << " begin: " << reinterpret_cast<void*>(mem_map_->Begin() + offset_)
/art/runtime/gc/collector/
H A Dimmune_region.h51 void SetBegin(mirror::Object* begin) { argument
52 begin_ = begin;
/art/cmdline/
H A Dtoken_range.h42 begin_(token_list_->begin()),
50 begin_(token_list_->begin()),
60 begin_(token_list_->begin()),
62 assert(it_begin >= token_list.begin());
70 begin_(token_list_->begin()),
77 begin_(token_list_->begin()),
88 assert(it_begin >= token_list->begin());
101 begin_(token_list_->begin()),
105 // Iterator type for begin() and end(). Guaranteed to be a RandomAccessIterator.
108 // Iterator type for const begin() an
144 iterator begin() const { function in struct:art::TokenRange
[all...]
/art/runtime/jit/
H A Djit_code_cache.cc85 uint8_t* JitCodeCache::AddDataArray(Thread* self, const uint8_t* begin, const uint8_t* end) { argument
87 const size_t size = end - begin;
91 std::copy(begin, end, data_cache_ptr_);
/art/runtime/arch/
H A Dinstruction_set_features.cc223 for (auto it = features.begin(); it != features.end();) {
293 const char* const * begin = variants; local
294 const char* const * end = begin + num_variants;
295 return std::find(begin, end, variant) != end;
/art/compiler/utils/
H A Darray_ref.h112 iterator begin() { return array_; } function in class:art::ArrayRef
113 const_iterator begin() const { return array_; } function in class:art::ArrayRef
121 reverse_iterator rend() { return reverse_iterator(begin()); }
122 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
171 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
/art/runtime/gc/space/
H A Dbump_pointer_space.cc46 BumpPointerSpace::BumpPointerSpace(const std::string& name, uint8_t* begin, uint8_t* limit) argument
47 : ContinuousMemMapAllocSpace(name, nullptr, begin, begin, limit,
H A Dmalloc_space.cc39 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 Ddlmalloc_space.cc38 void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit,
40 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
64 uint8_t* begin = mem_map->Begin(); local
67 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit,
70 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity,
110 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { argument
113 // create mspace using our backing storage starting at begin and with a footprint of
116 void* msp = create_mspace_with_base(begin, morecore_star
37 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
151 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 Drosalloc_space.cc49 art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end,
52 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects,
80 uint8_t* begin = mem_map->Begin(); local
85 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit,
88 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity,
134 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, argument
140 // create rosalloc using our backing storage starting at begin and
144 begin, morecore_star
48 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
179 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...]

Completed in 280 milliseconds

12