Searched refs:begin (Results 1 - 25 of 134) sorted by relevance

123456

/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
/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/compiler/dex/quick/
H A Dlazy_debug_frame_opcode_writer.cc40 old_opcodes.begin() + pos,
41 old_opcodes.begin() + advance.pos);
50 old_opcodes.begin() + pos,
/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_mips.h34 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
35 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
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_x86.h32 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
33 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
H A Ddisassembler.h62 virtual size_t Dump(std::ostream& os, const uint8_t* begin) = 0;
64 virtual void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) = 0;
72 std::string FormatInstructionPointer(const uint8_t* begin);
H A Ddisassembler_arm.h31 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
32 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
H A Ddisassembler_arm64.h67 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
68 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
/art/compiler/utils/
H A Ddedupe_set_test.cc54 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin()));
66 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array2->begin()));
78 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array3->begin()));
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());
H A Ddedupe_set.h58 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
59 b.store_ptr->begin(), b.store_ptr->end());
61 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
62 b.in_key->second->begin(), b.in_key->second->end());
64 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
65 b.store_ptr->begin(), b.store_ptr->end());
67 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
68 b.in_key->second->begin(), b.in_key->second->end());
151 allocator_.construct(ret, key.begin(), key.end(), allocator_);
/art/runtime/gc/accounting/
H A Dheap_bitmap.cc28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(),
37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap);
57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap);
69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap);
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) {
/art/compiler/
H A Dcompiled_method.cc35 quick_code_ = new SwapVector<uint8_t>(quick_code->begin(), quick_code->end(),
56 return std::equal(quick_code_->begin(), quick_code_->end(), rhs.quick_code_->begin());
140 patches_(patches.begin(), patches.end(), driver->GetSwapSpaceAllocator()) {
145 src_mapping_table_ = new SwapSrcMap(src_mapping_table->begin(), src_mapping_table->end(),
149 nullptr : new SwapVector<uint8_t>(mapping_table.begin(), mapping_table.end(),
151 vmap_table_ = new SwapVector<uint8_t>(vmap_table.begin(), vmap_table.end(),
154 new SwapVector<uint8_t>(native_gc_map.begin(), native_gc_map.end(),
157 new SwapVector<uint8_t>(cfi_info.begin(), cfi_info.end(), driver->GetSwapSpaceAllocator());
/art/runtime/gc/collector/
H A Dimmune_region.h51 void SetBegin(mirror::Object* begin) { argument
52 begin_ = begin;
/art/runtime/
H A Dexception_test.cc85 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
86 fake_vmap_table_data.begin(), fake_vmap_table_data.end());
87 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
88 fake_mapping_data.begin(), fake_mapping_data.end());
89 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
90 fake_gc_map_.begin(), fake_gc_map_.end());
92 fake_code_.begin(), fake_code_.end());
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));
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),
/art/runtime/gc/space/
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...]
/art/runtime/gc/
H A Dtask_processor.cc55 HeapTask* task = *tasks_.begin();
60 tasks_.erase(tasks_.begin());
87 if (*tasks_.begin() == task) {
/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_);

Completed in 301 milliseconds

123456