| /art/runtime/base/ |
| D | stl_util.h | 28 std::sort(v->begin(), v->end()); in STLSortAndRemoveDuplicates()
29 v->erase(std::unique(v->begin(), v->end()), v->end()); in STLSortAndRemoveDuplicates()
43 void STLDeleteContainerPointers(ForwardIterator begin, in STLDeleteContainerPointers() argument
45 while (begin != end) { in STLDeleteContainerPointers()
46 ForwardIterator temp = begin; in STLDeleteContainerPointers()
47 ++begin; in STLDeleteContainerPointers()
65 STLDeleteContainerPointers(container->begin(), container->end()); in STLDeleteElements()
75 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
|
| /art/disassembler/ |
| D | disassembler_arm64.cc | 34 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { in Dump() argument
35 uint32_t instruction = ReadU32(begin); in Dump()
37 os << FormatInstructionPointer(begin) in Dump()
42 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { in Dump() argument
43 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) { in Dump()
|
| D | disassembler.cc | 47 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { in FormatInstructionPointer() argument
49 return StringPrintf("%p", begin); in FormatInstructionPointer()
51 size_t offset = begin - disassembler_options_->base_address_; in FormatInstructionPointer()
|
| D | disassembler.h | 56 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);
|
| D | disassembler_mips.h | 31 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;
|
| D | disassembler_arm64.h | 34 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;
|
| D | disassembler_x86.h | 30 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;
|
| /art/compiler/sea_ir/ir/ |
| D | sea.cc | 34 for (std::vector<PhiInstructionNode*>::const_iterator cit = phis->begin(); in Traverse()
39 for (std::vector<InstructionNode*>::const_iterator cit = instructions->begin(); in Traverse()
46 for (std::vector<Region*>::const_iterator cit = ordered_regions_.begin(); in Traverse()
64 for (std::vector<sea_ir::Region*>::iterator succ_it = succs->begin(); in ComputeRPO()
81 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) { in ComputeIDominators()
87 for (crt_it = regions_.begin(); crt_it != regions_.end(); ++crt_it) { in ComputeIDominators()
96 for (std::vector<Region*>::iterator pred_it = preds->begin(); in ComputeIDominators()
106 for (std::vector<Region*>::const_iterator pred_it = preds->begin(); in ComputeIDominators()
125 for (std::vector<Region*>::iterator region_it = regions_.begin(); in ComputeIDominators()
153 for (std::vector<Region*>::iterator region_it = regions_.begin(); in ComputeDownExposedDefs()
[all …]
|
| D | regions_test.cc | 33 EXPECT_TRUE(std::find(regions->begin(), regions->end(), root) != regions->end()); in TEST_F()
34 EXPECT_TRUE(std::find(regions->begin(), regions->end(), then_region) != regions->end()); in TEST_F()
35 EXPECT_TRUE(std::find(regions->begin(), regions->end(), else_region) != regions->end()); in TEST_F()
48 EXPECT_TRUE(std::find(succs->begin(), succs->end(), then_region) != succs->end()); in TEST_F()
49 EXPECT_TRUE(std::find(succs->begin(), succs->end(), else_region) != succs->end()); in TEST_F()
|
| /art/compiler/utils/ |
| D | dedupe_set_test.cc | 54 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin())); in TEST()
66 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array2->begin())); in TEST()
78 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array3->begin())); in TEST()
|
| D | dedupe_set.h | 57 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
58 b.store_ptr->begin(), b.store_ptr->end()); in operator()
60 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
61 b.in_key->second->begin(), b.in_key->second->end()); in operator()
63 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
64 b.store_ptr->begin(), b.store_ptr->end()); in operator()
66 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
67 b.in_key->second->begin(), b.in_key->second->end()); in operator()
150 allocator_.construct(ret, key.begin(), key.end(), allocator_); in CreateStoreKey()
|
| D | array_ref.h | 113 iterator begin() { return array_; } in begin() function
114 const_iterator begin() const { return array_; } in begin() function
122 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
123 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend()
|
| /art/compiler/sea_ir/debug/ |
| D | dot_gen.cc | 27 for (std::vector<Region*>::const_iterator cit = graph->GetRegions()->begin(); in Initialize()
37 for (std::set<Region*>::const_iterator cit = dominated_regions->begin(); in Initialize()
48 def_it = definition_edges->begin(); in ToDotSSAEdges()
68 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin(); in ToDotSSAEdges()
80 def_it = definition_edges.begin(); in ToDotSSAEdges()
100 for (std::vector<InstructionNode*>::const_iterator cit = used_in->begin(); in ToDotSSAEdges()
128 for (std::vector<PhiInstructionNode*>::const_iterator cit = phi_instructions->begin(); in Visit()
133 for (std::vector<InstructionNode*>::const_iterator cit = instructions->begin(); in Visit()
140 for (std::vector<Region*>::const_iterator cit = successors->begin(); cit != successors->end(); in Visit()
|
| /art/runtime/gc/space/ |
| D | dlmalloc_space.cc | 38 DlMallocSpace::DlMallocSpace(const std::string& name, MemMap* mem_map, void* mspace, byte* begin, in DlMallocSpace() argument
42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in DlMallocSpace()
66 byte* begin = mem_map->Begin(); in CreateFromMemMap() local
69 name, mem_map, mspace, begin, end, begin + capacity, growth_limit, initial_size, in CreateFromMemMap()
72 return new DlMallocSpace(name, mem_map, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
112 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { in CreateMspace() argument
118 void* msp = create_mspace_with_base(begin, morecore_start, false /*locked*/); in CreateMspace()
152 void* allocator, byte* begin, byte* end, in CreateInstance() argument
155 return new DlMallocSpace(name, mem_map, allocator, begin, end, limit, growth_limit, in CreateInstance()
|
| D | rosalloc_space.cc | 45 art::gc::allocator::RosAlloc* rosalloc, byte* begin, byte* end, in RosAllocSpace() argument
48 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in RosAllocSpace()
73 byte* begin = mem_map->Begin(); in CreateFromMemMap() local
79 return new RosAllocSpace(name, mem_map, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
125 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, in CreateRosAlloc() argument
134 begin, morecore_start, maximum_size, in CreateRosAlloc()
167 byte* begin, byte* end, byte* limit, size_t growth_limit, in CreateInstance() argument
170 begin, end, limit, growth_limit, can_move_objects, starting_size_, in CreateInstance()
|
| /art/runtime/gc/accounting/ |
| D | heap_bitmap.cc | 28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), in ReplaceBitmap()
37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); in ReplaceLargeObjectBitmap()
57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); in RemoveContinuousSpaceBitmap()
69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap); in RemoveLargeObjectBitmap()
|
| D | card_table.cc | 111 byte* begin = mem_map_->Begin() + offset_; in CheckAddrIsInCardTable() local
115 << " begin: " << reinterpret_cast<void*>(begin) in CheckAddrIsInCardTable()
118 << " heap begin: " << AddrFromCard(begin) in CheckAddrIsInCardTable()
|
| D | card_table.h | 129 CardTable(MemMap* begin, byte* biased_begin, size_t offset);
133 byte* begin = mem_map_->Begin() + offset_; in IsValidCard() local
135 return card_addr >= begin && card_addr < end; in IsValidCard()
|
| /art/runtime/ |
| D | mem_map.cc | 64 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { in operator <<()
135 static bool ContainedWithinExistingMap(uintptr_t begin, in ContainedWithinExistingMap() argument
143 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in ContainedWithinExistingMap()
144 if ((begin >= it->start && begin < it->end) // start of new within old in ContainedWithinExistingMap()
153 begin, end, maps.c_str()); in ContainedWithinExistingMap()
159 static bool CheckNonOverlapping(uintptr_t begin, in CheckNonOverlapping() argument
167 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in CheckNonOverlapping()
168 if ((begin >= it->start && begin < it->end) // start of new within old in CheckNonOverlapping()
170 || (begin <= it->start && end > it->end)) { // start/end of new includes all of old in CheckNonOverlapping()
175 begin, end, in CheckNonOverlapping()
[all …]
|
| D | exception_test.cc | 84 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
85 fake_vmap_table_data.begin(), fake_vmap_table_data.end()); in SetUp()
86 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
87 fake_mapping_data.begin(), fake_mapping_data.end()); in SetUp()
88 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
89 fake_gc_map_.begin(), fake_gc_map_.end()); in SetUp()
91 fake_code_.begin(), fake_code_.end()); in SetUp()
|
| D | safe_map.h | 60 iterator begin() { return map_.begin(); } in begin() function
61 const_iterator begin() const { return map_.begin(); } in begin() function
99 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); in PutBefore()
|
| /art/compiler/sea_ir/types/ |
| D | type_inference_visitor.cc | 50 for (std::vector<const Type*>::const_iterator cit = operand_types.begin(); in Visit()
75 for (std::vector<InstructionNode*>::const_iterator cit = sources.begin(); cit != sources.end(); in GetOperandTypes()
88 type = *(types.begin()); in MergeTypes()
90 for (std::vector<const Type*>::const_iterator cit = types.begin(); in MergeTypes()
|
| D | type_inference.cc | 147 for (std::vector<Region*>::const_iterator region_it = regions->begin(); in ComputeTypes()
150 std::copy(phi_instructions->begin(), phi_instructions->end(), std::back_inserter(worklist)); in ComputeTypes()
152 std::copy(instructions->begin(), instructions->end(), std::back_inserter(worklist)); in ComputeTypes()
170 for (std::list<InstructionNode*>::const_iterator instruction_it = worklist.begin(); in ComputeTypes()
180 for (std::vector<InstructionNode*>::iterator consumer = consumers->begin(); in ComputeTypes()
|
| /art/compiler/ |
| D | common_compiler_test.cc | 124 for (FeatureList::iterator i = features.begin(); i != features.end(); i++) { in ParseFeatureList()
193 chunk->insert(chunk->begin(), vmap_table.begin(), vmap_table.end()); in MakeExecutable()
194 chunk->insert(chunk->begin(), mapping_table.begin(), mapping_table.end()); in MakeExecutable()
195 chunk->insert(chunk->begin(), gc_map.begin(), gc_map.end()); in MakeExecutable()
196 chunk->insert(chunk->begin(), padding, 0); in MakeExecutable()
197 chunk->insert(chunk->end(), code->begin(), code->end()); in MakeExecutable()
|
| /art/runtime/gc/collector/ |
| D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { in SetBegin() argument
52 begin_ = begin; in SetBegin()
|