| /art/compiler/utils/ |
| 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 | 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()
|
| D | intrusive_forward_list.h | 165 iterator begin() { return iterator(first_.next_hook); } in begin() function
166 const_iterator begin() const { return const_iterator(first_.next_hook); } in begin() function
174 bool empty() const { return begin() == end(); } in empty()
178 reference front() { return *begin(); } in front()
179 const_reference front() const { return *begin(); } in front()
291 for (iterator current = begin(); current != end(); ++current) { in remove_if()
306 iterator prev = begin(); in unique()
328 iterator current = begin(); in merge()
330 iterator other_current = other.begin(); in merge()
354 size_t n = std::distance(begin(), end()); in sort()
[all …]
|
| /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/runtime/base/ |
| D | stl_util.h | 39 void STLDeleteContainerPointers(ForwardIterator begin, in STLDeleteContainerPointers() argument
41 while (begin != end) { in STLDeleteContainerPointers()
42 ForwardIterator temp = begin; in STLDeleteContainerPointers()
43 ++begin; in STLDeleteContainerPointers()
61 STLDeleteContainerPointers(container->begin(), container->end()); in STLDeleteElements()
72 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { in STLDeleteValues()
94 auto it = std::find(container.begin(), container.end(), value); in IndexOfElement()
96 return std::distance(container.begin(), it); in IndexOfElement()
102 auto it = std::find(container.begin(), container.end(), value); in RemoveElement()
110 auto it = std::find(container.begin(), container.end(), old_value); in ReplaceElement()
[all …]
|
| D | transform_iterator_test.cc | 48 using vector_titer = decltype(MakeTransformIterator(input.begin(), add1)); in TEST()
76 std::copy(MakeTransformIterator(input.begin(), add1), in TEST()
101 ASSERT_EQ(input[i].value + 1, MakeTransformIterator(input.begin(), add1)[i]); in TEST()
113 ASSERT_EQ(MakeTransformIterator(input.begin(), add1) + i, in TEST()
114 MakeTransformIterator(input.begin() + i, add1)); in TEST()
131 (MakeTransformIterator(input.begin(), add1) + input.size()).base()); in TEST()
132 ASSERT_EQ(MakeTransformIterator(input.end(), add1) - MakeTransformIterator(input.begin(), add1), in TEST()
136 auto it = MakeTransformIterator(input.begin(), add1); in TEST()
151 using list_titer = decltype(MakeTransformIterator(input.begin(), sub1)); in TEST()
179 std::copy(MakeTransformIterator(input.begin(), sub1), in TEST()
[all …]
|
| D | iteration_range.h | 37 iterator begin() const { return first_; } in begin() function
59 typedef typename std::reverse_iterator<decltype(c.begin())> riter; in ReverseRange()
60 return MakeIterationRange(riter(c.end()), riter(c.begin())); in ReverseRange()
|
| 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()
192 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());
|
| D | array_slice.h | 59 iterator begin() { return iterator(&AtUnchecked(0), element_size_); } in begin() function
60 const_iterator begin() const { return const_iterator(&AtUnchecked(0), element_size_); } in begin() function
68 reverse_iterator rend() { return reverse_iterator(begin()); } in rend()
69 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } in rend()
|
| /art/runtime/gc/collector/ |
| D | immune_spaces.cc | 64 std::sort(intervals.begin(), intervals.end()); in CreateLargestImmuneRegion()
71 const uintptr_t begin = std::get<0>(interval); in CreateLargestImmuneRegion() local
74 VLOG(collector) << "Interval " << reinterpret_cast<const void*>(begin) << "-" in CreateLargestImmuneRegion()
76 DCHECK_GE(end, begin); in CreateLargestImmuneRegion()
77 DCHECK_GE(begin, cur_end); in CreateLargestImmuneRegion()
80 if (begin != cur_end) { in CreateLargestImmuneRegion()
85 cur_begin = begin; in CreateLargestImmuneRegion()
92 cur_heap_size += end - begin; in CreateLargestImmuneRegion()
|
| D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { in SetBegin() argument
52 begin_ = begin; in SetBegin()
|
| /art/disassembler/ |
| D | disassembler_arm.cc | 142 const uintptr_t begin = reinterpret_cast<uintptr_t>(options_->base_address_); in PrintLiteral() local
147 literal_addr += begin; in PrintLiteral()
154 if (literal_addr < begin || literal_addr > end - literal_size[type]) { in PrintLiteral()
195 size_t DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin) { in Dump() argument
198 const uintptr_t instr_ptr = reinterpret_cast<uintptr_t>(begin) & ~1; in Dump()
200 const bool is_t32 = (reinterpret_cast<uintptr_t>(begin) & 1) != 0; in Dump()
218 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { in Dump() argument
219 DCHECK_LE(begin, end); in Dump()
222 const uintptr_t base = reinterpret_cast<uintptr_t>(begin) & ~1; in Dump()
224 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 | 57 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { in FormatInstructionPointer() argument
59 return StringPrintf("%p", begin); in FormatInstructionPointer()
61 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_mips.h | 36 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE;
37 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
|
| 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;
|
| 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;
|
| /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/runtime/gc/space/ |
| D | dlmalloc_space.cc | 41 void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, in DlMallocSpace() argument
43 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in DlMallocSpace()
67 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap() local
70 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
73 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, in CreateFromMemMap()
113 void* DlMallocSpace::CreateMspace(void* begin, size_t morecore_start, size_t initial_size) { in CreateMspace() argument
119 void* msp = create_mspace_with_base(begin, morecore_start, false /*locked*/); in CreateMspace()
155 void* allocator, uint8_t* begin, uint8_t* end, in CreateInstance() argument
160 mem_map, initial_size_, name, allocator, begin, end, limit, growth_limit, in CreateInstance()
163 return new DlMallocSpace(mem_map, initial_size_, name, allocator, begin, end, limit, in CreateInstance()
|
| D | rosalloc_space.cc | 47 art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, in RosAllocSpace() argument
50 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, in RosAllocSpace()
78 uint8_t* begin = mem_map->Begin(); in CreateFromMemMap() local
83 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
86 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, in CreateFromMemMap()
132 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, in CreateRosAlloc() argument
142 begin, morecore_start, maximum_size, in CreateRosAlloc()
178 void* allocator, uint8_t* begin, uint8_t* end, in CreateInstance() argument
183 mem_map, initial_size_, name, reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, in CreateInstance()
187 reinterpret_cast<allocator::RosAlloc*>(allocator), begin, end, limit, in CreateInstance()
|
| /art/runtime/ |
| D | memory_region.h | 40 return lhs.size() == rhs.size() && memcmp(lhs.begin(), rhs.begin(), lhs.size()) == 0; in operator()
55 uint8_t* begin() const { return reinterpret_cast<uint8_t*>(pointer_); } in begin() function
56 uint8_t* end() const { return begin() + size_; } in end()
140 const uint8_t* address = begin() + bit_offset / kBitsPerByte; in LoadBits()
185 return MemoryRegion(reinterpret_cast<void*>(begin() + offset), size_in); in Subregion()
199 return reinterpret_cast<T*>(begin() + offset); in ComputeInternalPointer()
|
| D | utils.h | 285 inline void FlushInstructionCache(char* begin, char* end) { in FlushInstructionCache() argument
286 __builtin___clear_cache(begin, end); in FlushInstructionCache()
289 inline void FlushDataCache(char* begin, char* end) { in FlushDataCache() argument
292 __builtin___clear_cache(begin, end); in FlushDataCache()
316 const uint8_t* begin = static_cast<const uint8_t*>(pointer); in BoundsCheckedCast() local
317 const uint8_t* end = begin + sizeof(*result); in BoundsCheckedCast()
318 if (begin < bound_begin || end > bound_end || begin > end) { in BoundsCheckedCast()
342 int MadviseLargestPageAlignedRegion(const uint8_t* begin, const uint8_t* end, int advice);
|
| D | mem_map.cc | 76 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { in operator <<()
148 uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); in ContainedWithinExistingMap() local
149 uintptr_t end = begin + size; in ContainedWithinExistingMap()
157 if (begin >= reinterpret_cast<uintptr_t>(map->Begin()) && in ContainedWithinExistingMap()
173 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in ContainedWithinExistingMap()
174 if ((begin >= it->start && begin < it->end) // start of new within old in ContainedWithinExistingMap()
182 "any existing map. See process maps in the log.", begin, end); in ContainedWithinExistingMap()
188 static bool CheckNonOverlapping(uintptr_t begin, in CheckNonOverlapping() argument
197 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { in CheckNonOverlapping()
198 if ((begin >= it->start && begin < it->end) // start of new within old in CheckNonOverlapping()
[all …]
|