| /art/cmdline/ |
| D | token_range.h | 42 begin_(token_list_->begin()), in TokenRange()
50 begin_(token_list_->begin()), in TokenRange()
60 begin_(token_list_->begin()),
62 assert(it_begin >= token_list.begin());
70 begin_(token_list_->begin()), in TokenRange()
77 begin_(token_list_->begin()), in TokenRange()
88 assert(it_begin >= token_list->begin()); in TokenRange()
101 begin_(token_list_->begin()), in TokenRange()
144 iterator begin() const { in begin() function
181 return std::equal(begin(), end(), other.begin());
[all …]
|
| /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()
76 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
|
| /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 | 58 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
59 b.store_ptr->begin(), b.store_ptr->end()); in operator()
61 return std::lexicographical_compare(a.store_ptr->begin(), a.store_ptr->end(), in operator()
62 b.in_key->second->begin(), b.in_key->second->end()); in operator()
64 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
65 b.store_ptr->begin(), b.store_ptr->end()); in operator()
67 return std::lexicographical_compare(a.in_key->second->begin(), a.in_key->second->end(), in operator()
68 b.in_key->second->begin(), b.in_key->second->end()); in operator()
151 allocator_.construct(ret, key.begin(), key.end(), allocator_); in CreateStoreKey()
|
| D | array_ref.h | 112 iterator begin() { return array_; } in begin() function
113 const_iterator begin() const { return array_; } in begin() function
121 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
122 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend()
171 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
|
| /art/compiler/ |
| D | compiled_method.cc | 35 quick_code_ = new SwapVector<uint8_t>(quick_code->begin(), quick_code->end(), in SetCode()
56 return std::equal(quick_code_->begin(), quick_code_->end(), rhs.quick_code_->begin()); in operator ==()
140 patches_(patches.begin(), patches.end(), driver->GetSwapSpaceAllocator()) { in CompiledMethod()
145 src_mapping_table_ = new SwapSrcMap(src_mapping_table->begin(), src_mapping_table->end(), in CompiledMethod()
149 nullptr : new SwapVector<uint8_t>(mapping_table.begin(), mapping_table.end(), in CompiledMethod()
151 vmap_table_ = new SwapVector<uint8_t>(vmap_table.begin(), vmap_table.end(), in CompiledMethod()
154 new SwapVector<uint8_t>(native_gc_map.begin(), native_gc_map.end(), in CompiledMethod()
157 new SwapVector<uint8_t>(cfi_info.begin(), cfi_info.end(), driver->GetSwapSpaceAllocator()); in CompiledMethod()
|
| D | common_compiler_test.cc | 86 chunk->insert(chunk->begin(), vmap_table->begin(), vmap_table->end()); in MakeExecutable()
88 chunk->insert(chunk->begin(), mapping_table->begin(), mapping_table->end()); in MakeExecutable()
91 chunk->insert(chunk->begin(), gc_map->begin(), gc_map->end()); in MakeExecutable()
93 chunk->insert(chunk->begin(), padding, 0); in MakeExecutable()
94 chunk->insert(chunk->end(), code->begin(), code->end()); in MakeExecutable()
|
| /art/disassembler/ |
| D | disassembler_arm64.cc | 102 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { in Dump() argument
103 const vixl::Instruction* instr = reinterpret_cast<const vixl::Instruction*>(begin); in Dump()
105 os << FormatInstructionPointer(begin) in Dump()
110 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { in Dump() argument
111 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) { in Dump()
|
| D | disassembler.cc | 49 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { in FormatInstructionPointer() argument
51 return StringPrintf("%p", begin); in FormatInstructionPointer()
53 size_t offset = begin - disassembler_options_->base_address_; in FormatInstructionPointer()
|
| D | disassembler.h | 62 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);
|
| D | disassembler_mips.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 | 32 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;
|
| D | disassembler_arm.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 | 67 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/runtime/gc/space/ |
| D | dlmalloc_space.cc | 38 void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, in DlMallocSpace() argument
40 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in DlMallocSpace()
64 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap() local
67 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
70 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, in CreateFromMemMap()
110 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { in CreateMspace() argument
116 void* msp = create_mspace_with_base(begin, morecore_start, false /*locked*/); in CreateMspace()
152 void* allocator, uint8_t* begin, uint8_t* end, in CreateInstance() argument
157 mem_map, initial_size_, name, allocator, begin, end, limit, growth_limit, in CreateInstance()
160 return new DlMallocSpace(mem_map, initial_size_, name, allocator, begin, end, limit, in CreateInstance()
|
| D | rosalloc_space.cc | 49 art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, in RosAllocSpace() argument
52 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in RosAllocSpace()
80 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap() local
85 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
88 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, in CreateFromMemMap()
134 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, in CreateRosAlloc() argument
144 begin, morecore_start, maximum_size, in CreateRosAlloc()
180 void* allocator, uint8_t* begin, uint8_t* end, in CreateInstance() argument
185 mem_map, initial_size_, name, reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, in CreateInstance()
189 reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, limit, in CreateInstance()
|
| D | space.h | 326 uint8_t* begin, uint8_t* end, uint8_t* limit) : in ContinuousSpace() argument
327 Space(name, gc_retention_policy), begin_(begin), end_(end), limit_(limit) { in ContinuousSpace()
393 …MemMapSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, uint8_t* end, uint8_t* limit, in MemMapSpace() argument
395 : ContinuousSpace(name, gc_retention_policy, begin, end, limit), in MemMapSpace()
449 ContinuousMemMapAllocSpace(const std::string& name, MemMap* mem_map, uint8_t* begin, in ContinuousMemMapAllocSpace() argument
451 : MemMapSpace(name, mem_map, begin, end, limit, gc_retention_policy) { in ContinuousMemMapAllocSpace()
|
| /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()
|
| /art/compiler/dex/quick/ |
| D | lazy_debug_frame_opcode_writer.cc | 40 old_opcodes.begin() + pos, in Patch()
41 old_opcodes.begin() + advance.pos); in Patch()
50 old_opcodes.begin() + pos, in Patch()
|
| /art/runtime/ |
| D | mem_map.cc | 71 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { in operator <<()
143 uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); in ContainedWithinExistingMap() local
144 uintptr_t end = begin + size; in ContainedWithinExistingMap()
150 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in ContainedWithinExistingMap()
151 if ((begin >= it->start && begin < it->end) // start of new within old in ContainedWithinExistingMap()
158 "any existing map. See process maps in the log.", begin, end); in ContainedWithinExistingMap()
163 static bool CheckNonOverlapping(uintptr_t begin, in CheckNonOverlapping() argument
171 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in CheckNonOverlapping()
172 if ((begin >= it->start && begin < it->end) // start of new within old in CheckNonOverlapping()
174 || (begin <= it->start && end > it->end)) { // start/end of new includes all of old in CheckNonOverlapping()
[all …]
|
| D | exception_test.cc | 85 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
86 fake_vmap_table_data.begin(), fake_vmap_table_data.end()); in SetUp()
87 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
88 fake_mapping_data.begin(), fake_mapping_data.end()); in SetUp()
89 fake_header_code_and_maps_.insert(fake_header_code_and_maps_.begin(), in SetUp()
90 fake_gc_map_.begin(), fake_gc_map_.end()); in SetUp()
92 fake_code_.begin(), fake_code_.end()); in SetUp()
|
| D | safe_map.h | 61 iterator begin() { return map_.begin(); } in begin() function
62 const_iterator begin() const { return map_.begin(); } in begin() function
100 DCHECK(pos == map_.begin() || map_.key_comp()((--iterator(pos))->first, k)); in PutBefore()
|
| /art/runtime/gc/collector/ |
| D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { in SetBegin() argument
52 begin_ = begin; in SetBegin()
|
| /art/runtime/jit/ |
| D | jit_code_cache.cc | 85 uint8_t* JitCodeCache::AddDataArray(Thread* self, const uint8_t* begin, const uint8_t* end) { in AddDataArray() argument
87 const size_t size = end - begin; in AddDataArray()
91 std::copy(begin, end, data_cache_ptr_); in AddDataArray()
|
| /art/runtime/gc/ |
| D | task_processor.cc | 55 HeapTask* task = *tasks_.begin(); in GetTask()
60 tasks_.erase(tasks_.begin()); in GetTask()
87 if (*tasks_.begin() == task) { in UpdateTargetRunTime()
|