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

12345

/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) {
/art/disassembler/
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.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.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.h56 virtual size_t Dump(std::ostream& os, const uint8_t* begin) = 0;
58 virtual void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) = 0;
66 std::string FormatInstructionPointer(const uint8_t* begin);
H A Ddisassembler_arm64.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_x86.h30 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
31 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
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;
/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 Ddedupe_set.h57 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
58 b.store_ptr->begin(), b.store_ptr->end());
60 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(),
61 b.in_key->second->begin(), b.in_key->second->end());
63 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
64 b.store_ptr->begin(), b.store_ptr->end());
66 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(),
67 b.in_key->second->begin(), b.in_key->second->end());
150 allocator_.construct(ret, key.begin(), key.end(), allocator_);
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/compiler/sea_ir/ir/
H A Dregions_test.cc33 EXPECT_TRUE(std::find(regions->begin(), regions->end(), root) != regions->end());
34 EXPECT_TRUE(std::find(regions->begin(), regions->end(), then_region) != regions->end());
35 EXPECT_TRUE(std::find(regions->begin(), regions->end(), else_region) != regions->end());
48 EXPECT_TRUE(std::find(succs->begin(), succs->end(), then_region) != succs->end());
49 EXPECT_TRUE(std::find(succs->begin(), succs->end(), else_region) != succs->end());
H A Dsea.cc34 for (std::vector<PhiInstructionNode*>::const_iterator cit = phis->begin();
39 for (std::vector<InstructionNode*>::const_iterator cit = instructions->begin();
46 for (std::vector<Region*>::const_iterator cit = ordered_regions_.begin();
64 for (std::vector<sea_ir::Region*>::iterator succ_it = succs->begin();
81 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) {
87 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) {
96 for (std::vector<Region*>::iterator pred_it = preds->begin();
106 for (std::vector<Region*>::const_iterator pred_it = preds->begin();
125 for (std::vector<Region*>::iterator region_it = regions_.begin();
153 for (std::vector<Region*>::iterator region_it = regions_.begin();
[all...]
/art/runtime/gc/collector/
H A Dimmune_region.h51 void SetBegin(mirror::Object* begin) { argument
52 begin_ = begin;
/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 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
/art/compiler/sea_ir/debug/
H A Ddot_gen.cc27 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin();
37 for (std::set<Region*>::const_iterator cit = dominated_regions->begin();
48 def_it = definition_edges->begin();
68 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin();
80 def_it = definition_edges.begin();
100 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin();
128 for (std::vector<PhiInstructionNode*>::const_iterator cit = phi_instructions->begin();
133 for (std::vector<InstructionNode*>::const_iterator cit = instructions->begin();
140 for (std::vector<Region*>::const_iterator cit = successors->begin(); cit != successors->end();
/art/runtime/gc/space/
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...]
/art/runtime/
H A Dexception_test.cc84 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
85 fake_vmap_table_data.begin(), fake_vmap_table_data.end());
86 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
87 fake_mapping_data.begin(), fake_mapping_data.end());
88 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(),
89 fake_gc_map_.begin(), fake_gc_map_.end());
91 fake_code_.begin(), fake_code_.end());
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/compiler/sea_ir/types/
H A Dtype_inference_visitor.cc50 for (std::vector<const Type*>::const_iterator cit = operand_types.begin();
75 for (std::vector<InstructionNode*>::const_iterator cit = sources.begin(); cit != sources.end();
88 type = *(types.begin());
90 for (std::vector<const Type*>::const_iterator cit = types.begin();
H A Dtype_inference.cc147 for (std::vector<Region*>::const_iterator region_it = regions->begin();
150 std::copy(phi_instructions->begin(), phi_instructions->end(), std::back_inserter(worklist));
152 std::copy(instructions->begin(), instructions->end(), std::back_inserter(worklist));
170 for (std::list<InstructionNode*>::const_iterator instruction_it = worklist.begin();
180 for (std::vector<InstructionNode*>::iterator consumer = consumers->begin();
/art/compiler/
H A Dcommon_compiler_test.cc124 for (FeatureList::iterator i = features.begin(); i != features.end(); i++) {
193 chunk->insert(chunk->begin(), vmap_table.begin(), vmap_table.end());
194 chunk->insert(chunk->begin(), mapping_table.begin(), mapping_table.end());
195 chunk->insert(chunk->begin(), gc_map.begin(), gc_map.end());
196 chunk->insert(chunk->begin(), padding, 0);
197 chunk->insert(chunk->end(), code->begin(), code->end());

Completed in 358 milliseconds

12345