/art/compiler/utils/ |
H A D | intrusive_forward_list_test.cc | 45 ASSERT_EQ(std::distance(expected.begin(), expected.end()), \ 46 std::distance(value.begin(), value.end())); \ 47 ASSERT_TRUE(std::equal(expected.begin(), expected.end(), value.begin())); \ 52 IntrusiveForwardList<IFLTestValue>::iterator begin = ifl.begin(); local 54 IntrusiveForwardList<IFLTestValue>::const_iterator converted_begin = begin; 60 ASSERT_TRUE(ifl.begin() == ifl.cbegin()); 61 ASSERT_FALSE(ifl.begin() != ifl.cbegin()); 65 ASSERT_TRUE(ifl.begin() [all...] |
H A D | dedupe_set_test.cc | 46 return new std::vector<uint8_t>(src.begin(), src.end()); 68 ASSERT_TRUE(std::equal(test1.begin(), test1.end(), array1->begin())); 77 ASSERT_TRUE(std::equal(test2.begin(), test2.end(), array2->begin())); 87 ASSERT_TRUE(std::equal(test3.begin(), test3.end(), array3->begin()));
|
H A D | intrusive_forward_list.h | 155 iterator begin() { return iterator(first_.next_hook); } function in class:art::IntrusiveForwardList 156 const_iterator begin() const { return const_iterator(first_.next_hook); } function in class:art::IntrusiveForwardList 164 bool empty() const { return begin() == end(); } 168 reference front() { return *begin(); } 169 const_reference front() const { return *begin(); } 281 for (iterator current = begin(); current != end(); ++current) { 296 iterator prev = begin(); 318 iterator current = begin(); 320 iterator other_current = other.begin(); 344 size_t n = std::distance(begin(), en [all...] |
H A D | array_ref.h | 116 iterator begin() { return array_; } function in class:art::ArrayRef 117 const_iterator begin() const { return array_; } function in class:art::ArrayRef 125 reverse_iterator rend() { return reverse_iterator(begin()); } 126 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } 184 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
|
/art/runtime/base/ |
H A D | stl_util.h | 30 std::sort(v->begin(), v->end()); 31 v->erase(std::unique(v->begin(), v->end()), v->end()); 45 void STLDeleteContainerPointers(ForwardIterator begin, argument 47 while (begin != end) { 48 ForwardIterator temp = begin; 49 ++begin; 56 // hash_set, or any other STL container which defines sensible begin(), end(), 67 STLDeleteContainerPointers(container->begin(), container->end()); 78 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 121 auto it = std::find(container.begin(), containe [all...] |
H A D | array_slice.h | 103 StrideIterator<T> begin() { function in class:art::ArraySlice 107 StrideIterator<const T> begin() const { function in class:art::ArraySlice 120 return size() != 0 ? MakeIterationRange(begin(), end())
|
H A D | length_prefixed_array.h | 46 StrideIterator<T> begin(size_t element_size = sizeof(T), size_t alignment = alignof(T)) { function in class:art::LengthPrefixedArray 50 StrideIterator<const T> begin(size_t element_size = sizeof(T), function in class:art::LengthPrefixedArray 115 MakeIterationRange(arr->begin(element_size, alignment), arr->end(element_size, alignment)) :
|
/art/cmdline/ |
H A D | token_range.h | 42 begin_(token_list_->begin()), 50 begin_(token_list_->begin()), 60 begin_(token_list_->begin()), 62 assert(it_begin >= token_list.begin()); 70 begin_(token_list_->begin()), 77 begin_(token_list_->begin()), 88 assert(it_begin >= token_list->begin()); 101 begin_(token_list_->begin()), 105 // Iterator type for begin() and end(). Guaranteed to be a RandomAccessIterator. 108 // Iterator type for const begin() an 144 iterator begin() const { function in struct:art::TokenRange [all...] |
/art/disassembler/ |
H A D | disassembler.cc | 49 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { argument 51 return StringPrintf("%p", begin); 53 size_t offset = begin - disassembler_options_->base_address_;
|
H A D | disassembler_mips.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;
|
H A 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;
|
H A D | disassembler.h | 69 virtual size_t Dump(std::ostream& os, const uint8_t* begin) = 0; 71 virtual void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) = 0; 83 std::string FormatInstructionPointer(const uint8_t* begin);
|
H A D | disassembler_arm64.cc | 109 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { argument 110 const vixl::Instruction* instr = reinterpret_cast<const vixl::Instruction*>(begin); 112 os << FormatInstructionPointer(begin) 117 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 118 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) {
|
H A 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;
|
H A D | disassembler_arm64.h | 74 size_t Dump(std::ostream& os, const uint8_t* begin) OVERRIDE; 75 void Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) OVERRIDE;
|
/art/runtime/gc/collector/ |
H A D | immune_spaces.cc | 64 std::sort(intervals.begin(), intervals.end()); 65 // Intervals are already sorted by begin, if a new interval begins at the end of the current 71 const uintptr_t begin = std::get<0>(interval); local 74 VLOG(collector) << "Interval " << reinterpret_cast<const void*>(begin) << "-" 76 DCHECK_GE(end, begin); 77 DCHECK_GE(begin, cur_end); 80 if (begin != cur_end) { 85 cur_begin = begin; 92 cur_heap_size += end - begin;
|
H A D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { argument 52 begin_ = begin;
|
/art/runtime/gc/accounting/ |
H A D | heap_bitmap.cc | 28 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 D | bitmap.h | 181 MemoryRangeBitmap(MemMap* mem_map, uintptr_t begin, size_t num_bits) argument 182 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) {
|
/art/runtime/ |
H A D | dex_cache_resolved_classes.h | 46 void AddClasses(InputIt begin, InputIt end) const { argument 47 classes_.insert(begin, end);
|
H A D | safe_map.h | 62 iterator begin() { return map_.begin(); } function in class:art::SafeMap 63 const_iterator begin() const { return map_.begin(); } function in class:art::SafeMap 106 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k)); 112 DCHECK(pos == map_.begin() || map_.key_comp()((--const_iterator(pos))->first, k));
|
H A D | mem_map.cc | 65 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it) { 137 uintptr_t begin = reinterpret_cast<uintptr_t>(ptr); local 138 uintptr_t end = begin + size; 146 if (begin >= reinterpret_cast<uintptr_t>(map->Begin()) && 162 for (BacktraceMap::const_iterator it = map->begin(); it != map->end(); ++it) { 163 if ((begin >= it->start && begin < it->end) // start of new within old 171 "any existing map. See process maps in the log.", begin, end); 177 static bool CheckNonOverlapping(uintptr_t begin, argument 186 for (BacktraceMap::const_iterator it = map->begin(); i 498 MemMap(const std::string& name, uint8_t* begin, size_t size, void* base_begin, size_t base_size, int prot, bool reuse, size_t redzone_size) argument 908 volatile uint8_t* begin = reinterpret_cast<volatile uint8_t*>(base_begin_); local [all...] |
/art/runtime/gc/space/ |
H A D | dlmalloc_space.cc | 40 void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, 42 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 66 uint8_t* begin = mem_map->Begin(); local 69 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, 72 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, 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 39 DlMallocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, void* mspace, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects, size_t starting_size) argument 153 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument [all...] |
H A D | rosalloc_space.cc | 46 art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, 49 : MallocSpace(name, mem_map, begin, end, limit, growth_limit, true, can_move_objects, 77 uint8_t* begin = mem_map->Begin(); local 82 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, 85 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, 131 allocator::RosAlloc* RosAllocSpace::CreateRosAlloc(void* begin, size_t morecore_start, argument 137 // create rosalloc using our backing storage starting at begin and 141 begin, morecore_star 45 RosAllocSpace(MemMap* mem_map, size_t initial_size, const std::string& name, art::gc::allocator::RosAlloc* rosalloc, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects, size_t starting_size, bool low_memory_mode) argument 176 CreateInstance(MemMap* mem_map, const std::string& name, void* allocator, uint8_t* begin, uint8_t* end, uint8_t* limit, size_t growth_limit, bool can_move_objects) argument [all...] |
/art/runtime/gc/ |
H A D | task_processor.cc | 55 HeapTask* task = *tasks_.begin(); 60 tasks_.erase(tasks_.begin()); 87 if (*tasks_.begin() == task) {
|