| /art/libartbase/base/ |
| D | intrusive_forward_list_test.cc | 64 ASSERT_EQ(std::distance((expected).begin(), (expected).end()), \
65 std::distance((value).begin(), (value).end())); \
66 ASSERT_TRUE(std::equal((expected).begin(), (expected).end(), (value).begin())); \
129 typename ListType::iterator begin = ifl.begin(); in IteratorToConstIterator() local
131 typename ListType::const_iterator converted_begin = begin; in IteratorToConstIterator()
145 ASSERT_TRUE(ifl.begin() == ifl.cbegin()); in IteratorOperators()
146 ASSERT_FALSE(ifl.begin() != ifl.cbegin()); in IteratorOperators()
150 ASSERT_TRUE(ifl.begin() == ifl.end()); // Empty. in IteratorOperators()
151 ASSERT_FALSE(ifl.begin() != ifl.end()); // Empty. in IteratorOperators()
156 ASSERT_FALSE(ifl.begin() == ifl.end()); // Not empty. in IteratorOperators()
[all …]
|
| D | stl_util.h | 42 void STLDeleteContainerPointers(ForwardIterator begin, in STLDeleteContainerPointers() argument
44 while (begin != end) { in STLDeleteContainerPointers()
45 ForwardIterator temp = begin; in STLDeleteContainerPointers()
46 ++begin; in STLDeleteContainerPointers()
64 STLDeleteContainerPointers(container->begin(), container->end()); in STLDeleteElements()
75 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
97 auto it = std::find(container.begin(), container.end(), value); in IndexOfElement()
99 return std::distance(container.begin(), it); in IndexOfElement()
105 auto it = std::find(container.begin(), container.end(), value); in RemoveElement()
113 auto it = std::find(container.begin(), container.end(), old_value); in ReplaceElement()
[all …]
|
| D | transform_iterator_test.cc | 47 using vector_titer = decltype(MakeTransformIterator(input.begin(), add1)); in TEST()
75 std::copy(MakeTransformIterator(input.begin(), add1), in TEST()
100 ASSERT_EQ(input[i].value + 1, MakeTransformIterator(input.begin(), add1)[i]); in TEST()
112 ASSERT_EQ(MakeTransformIterator(input.begin(), add1) + i, in TEST()
113 MakeTransformIterator(input.begin() + i, add1)); in TEST()
130 (MakeTransformIterator(input.begin(), add1) + input.size()).base()); in TEST()
131 ASSERT_EQ(MakeTransformIterator(input.end(), add1) - MakeTransformIterator(input.begin(), add1), in TEST()
135 auto it = MakeTransformIterator(input.begin(), add1); in TEST()
150 using list_titer = decltype(MakeTransformIterator(input.begin(), sub1)); in TEST()
178 std::copy(MakeTransformIterator(input.begin(), sub1), in TEST()
[all …]
|
| D | iteration_range.h | 37 iterator begin() const { return first_; } in begin() function
54 return IterationRange<typename List::iterator>(list.begin(), list.end()); in MakeIterationRange()
64 typedef typename std::reverse_iterator<decltype(c.begin())> riter; in ReverseRange()
65 return MakeIterationRange(riter(c.end()), riter(c.begin())); in ReverseRange()
|
| D | memory_region.h | 41 return lhs.size() == rhs.size() && memcmp(lhs.begin(), rhs.begin(), lhs.size()) == 0; in operator()
56 uint8_t* begin() const { return reinterpret_cast<uint8_t*>(pointer_); } in begin() function
57 uint8_t* end() const { return begin() + size_; } in end()
125 return MemoryRegion(reinterpret_cast<void*>(begin() + offset), size_in); in Subregion()
139 return reinterpret_cast<T*>(begin() + offset); in ComputeInternalPointer()
|
| D | intrusive_forward_list.h | 166 iterator begin() { return iterator(first_.next_hook); } in begin() function
167 const_iterator begin() const { return const_iterator(first_.next_hook); } in begin() function
175 bool empty() const { return begin() == end(); } in empty()
179 reference front() { return *begin(); } in front()
180 const_reference front() const { return *begin(); } in front()
292 for (iterator current = begin(); current != end(); ++current) { in remove_if()
307 iterator prev = begin(); in unique()
329 iterator current = begin(); in merge()
331 iterator other_current = other.begin(); in merge()
355 size_t n = std::distance(begin(), end()); in sort()
[all …]
|
| D | array_ref.h | 119 iterator begin() { return array_; } in begin() function
120 const_iterator begin() const { return array_; } in begin() function
128 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
129 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend()
198 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
|
| D | transform_array_ref.h | 92 iterator begin() { return MakeIterator(base().begin()); } in begin() function
93 const_iterator begin() const { return MakeIterator(base().cbegin()); } in begin() function
101 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
102 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend()
165 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
|
| /art/cmdline/ |
| D | token_range.h | 44 begin_(token_list_->begin()), in TokenRange()
52 begin_(token_list_->begin()), in TokenRange()
62 begin_(token_list_->begin()),
64 assert(it_begin >= token_list.begin());
72 begin_(token_list_->begin()), in TokenRange()
79 begin_(token_list_->begin()), in TokenRange()
90 assert(it_begin >= token_list->begin()); in TokenRange()
103 begin_(token_list_->begin()), in TokenRange()
146 iterator begin() const { in begin() function
183 return std::equal(begin(), end(), other.begin());
[all …]
|
| /art/libdexfile/dex/ |
| D | dex_file_layout.cc | 26 int DexLayoutSection::MadviseLargestPageAlignedRegion(const uint8_t* begin, in MadviseLargestPageAlignedRegion() argument
30 UNUSED(begin); in MadviseLargestPageAlignedRegion()
35 DCHECK_LE(begin, end); in MadviseLargestPageAlignedRegion()
36 begin = AlignUp(begin, kPageSize); in MadviseLargestPageAlignedRegion()
38 if (begin < end) { in MadviseLargestPageAlignedRegion()
40 int result = madvise(const_cast<uint8_t*>(begin), end - begin, advice); in MadviseLargestPageAlignedRegion()
|
| /art/compiler/utils/ |
| D | dedupe_set_test.cc | 46 return new std::vector<uint8_t>(src.begin(), src.end()); in Copy()
68 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin())); in TEST()
77 ASSERT_TRUE(std::equal(test2.begin(), test2.end(), array2->begin())); in TEST()
87 ASSERT_TRUE(std::equal(test3.begin(), test3.end(), array3->begin())); in TEST()
|
| /art/runtime/gc/collector/ |
| D | immune_spaces.cc | 65 std::sort(intervals.begin(), intervals.end()); in CreateLargestImmuneRegion()
72 const uintptr_t begin = std::get<0>(interval); in CreateLargestImmuneRegion() local
75 VLOG(collector) << "Interval " << reinterpret_cast<const void*>(begin) << "-" in CreateLargestImmuneRegion()
77 DCHECK_GE(end, begin); in CreateLargestImmuneRegion()
78 DCHECK_GE(begin, cur_end); in CreateLargestImmuneRegion()
81 if (begin != cur_end) { in CreateLargestImmuneRegion()
86 cur_begin = begin; in CreateLargestImmuneRegion()
93 cur_heap_size += end - begin; in CreateLargestImmuneRegion()
|
| D | immune_region.h | 50 void SetBegin(mirror::Object* begin) { in SetBegin() argument
51 begin_ = begin; in SetBegin()
|
| /art/disassembler/ |
| D | disassembler_arm.cc | 152 const uintptr_t begin = reinterpret_cast<uintptr_t>(options_->base_address_); in PrintLiteral() local
159 literal_addr += begin; in PrintLiteral()
166 if (literal_addr < begin || literal_addr > end - literal_size[type]) { in PrintLiteral()
207 size_t DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin) { in Dump() argument
210 const uintptr_t instr_ptr = reinterpret_cast<uintptr_t>(begin) & ~1; in Dump()
212 const bool is_t32 = (reinterpret_cast<uintptr_t>(begin) & 1) != 0; in Dump()
231 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { in Dump() argument
232 DCHECK_LE(begin, end); in Dump()
235 const uintptr_t base = reinterpret_cast<uintptr_t>(begin) & ~1; in Dump()
237 const bool is_t32 = (reinterpret_cast<uintptr_t>(begin) & 1) != 0; in Dump()
[all …]
|
| D | disassembler_arm64.cc | 111 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { in Dump() argument
112 const Instruction* instr = reinterpret_cast<const Instruction*>(begin); in Dump()
114 os << FormatInstructionPointer(begin) in Dump()
119 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { in Dump() argument
120 for (const uint8_t* cur = begin; cur < end; cur += kInstructionSize) { in Dump()
|
| D | disassembler.cc | 70 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { in FormatInstructionPointer() argument
72 return StringPrintf("%p", begin); in FormatInstructionPointer()
74 size_t offset = begin - disassembler_options_->base_address_; in FormatInstructionPointer()
|
| D | disassembler.h | 76 virtual size_t Dump(std::ostream& os, const uint8_t* begin) = 0;
78 virtual void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) = 0;
87 std::string FormatInstructionPointer(const uint8_t* begin);
|
| D | disassembler_arm.h | 35 size_t Dump(std::ostream& os, const uint8_t* begin) override;
36 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) override;
|
| /art/runtime/ |
| D | reflective_handle_scope-inl.h | 47 std::for_each(fields_.begin(), fields_.begin() + field_pos_, visit_one); in VisitTargets()
48 std::for_each(methods_.begin(), methods_.begin() + method_pos_, visit_one); in VisitTargets()
|
| /art/runtime/gc/space/ |
| D | dlmalloc_space.cc | 45 uint8_t* begin, in DlMallocSpace() argument
53 begin, in DlMallocSpace()
85 uint8_t* begin = mem_map.Begin(); in CreateFromMemMap() local
92 begin, in CreateFromMemMap()
94 begin + capacity, growth_limit, in CreateFromMemMap()
102 begin, in CreateFromMemMap()
104 begin + capacity, in CreateFromMemMap()
151 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { in CreateMspace() argument
157 void* msp = create_mspace_with_base(begin, morecore_start, 0 /*locked*/); in CreateMspace()
195 uint8_t* begin, in CreateInstance() argument
[all …]
|
| D | rosalloc_space.cc | 51 uint8_t* begin, in RosAllocSpace() argument
60 begin, in RosAllocSpace()
101 uint8_t* begin = mem_map.Begin(); in CreateFromMemMap() local
110 begin, in CreateFromMemMap()
112 begin + capacity, in CreateFromMemMap()
122 begin, in CreateFromMemMap()
124 begin + capacity, in CreateFromMemMap()
179 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, in CreateRosAlloc() argument
189 begin, morecore_start, maximum_size, in CreateRosAlloc()
227 uint8_t* begin, in CreateInstance() argument
[all …]
|
| /art/runtime/arch/ |
| D | instruction_set_features.cc | 173 std::transform(std::begin(features), std::end(features), std::begin(features), in AddFeaturesFromString()
175 auto empty_strings_begin = std::copy_if(std::begin(features), std::end(features), in AddFeaturesFromString()
176 std::begin(features), in AddFeaturesFromString()
246 const char* const * begin = variants; in FindVariantInArray() local
247 const char* const * end = begin + num_variants; in FindVariantInArray()
248 return std::find(begin, end, variant) != end; in FindVariantInArray()
|
| /art/runtime/mirror/ |
| D | field.cc | 38 new_range.begin(), new_range.end(), [&](const auto& f) { return &f == new_value; }); in VisitTarget()
40 SetArtFieldIndex<false>(std::distance(new_range.begin(), position)); in VisitTarget()
92 iter_range.begin(), iter_range.end(), [&](const auto& f) { return &f == field; }); in CreateFromArtField()
95 std::distance(iter_range.begin(), position)); in CreateFromArtField()
|
| /art/test/527-checker-array-access-split/src/ |
| D | Main.java | 569 public final static void checkGVNForFatalChecks(int begin, int end, char[] buf1, int[] buf2) { in checkGVNForFatalChecks() argument
570 buf1[begin] = 'a'; in checkGVNForFatalChecks()
571 buf2[0] = begin / end; in checkGVNForFatalChecks()
|
| /art/runtime/jit/ |
| D | debugger_interface.cc | 487 DCHECK(std::is_sorted(removed.begin(), removed.end())); in RepackEntries()
510 std::sort(entries.begin(), entries.end(), cmp); // Sort by address. in RepackEntries()
513 for (auto group_it = entries.begin(); group_it != entries.end();) { in RepackEntries()
518 auto begin = group_it; in RepackEntries() local
519 auto end = std::find_if(begin, entries.end(), [=](auto* e) { return e->addr_ >= group_end; }); in RepackEntries()
520 CHECK(end > begin); in RepackEntries()
521 ArrayRef<const JITCodeEntry*> elfs(&*begin, end - begin); in RepackEntries()
524 auto removed_begin = std::lower_bound(removed.begin(), removed.end(), group_ptr); in RepackEntries()
525 auto removed_end = std::lower_bound(removed.begin(), removed.end(), group_end); in RepackEntries()
533 if (elfs.size() == 1 && removed_subset.empty() && (*begin)->is_compressed_ == compress) { in RepackEntries()
[all …]
|