/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_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_mips.cc | 574 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 575 for (const uint8_t* cur = begin; cur < end; cur += 4) {
|
/art/runtime/gc/accounting/ |
H A D | bitmap.cc | 90 MemMap* mem_map, uintptr_t begin, size_t num_bits) { 91 return new MemoryRangeBitmap(mem_map, begin, num_bits); 89 CreateFromMemMap( MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
|
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) {
|
H A D | card_table.cc | 138 uint8_t* begin = mem_map_->Begin() + offset_; local 142 << " begin: " << reinterpret_cast<void*>(begin) 145 << " heap begin: " << AddrFromCard(begin)
|
H A D | read_barrier_table.h | 107 uint8_t* begin = mem_map_->Begin(); local 109 return entry_addr >= begin && entry_addr < end;
|
H A D | space_bitmap_test.cc | 42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument 45 begin_(begin),
|
H A D | card_table-inl.h | 213 << " begin: " << reinterpret_cast<void*>(mem_map_->Begin() + offset_) 228 uint8_t* begin = mem_map_->Begin() + offset_; local 230 return card_addr >= begin && card_addr < end; 236 << " begin: " << reinterpret_cast<void*>(mem_map_->Begin() + offset_)
|
/art/runtime/gc/collector/ |
H A D | immune_region.h | 51 void SetBegin(mirror::Object* begin) { argument 52 begin_ = begin;
|
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_spaces_test.cc | 33 DummyOatFile(uint8_t* begin, uint8_t* end) : OatFile("Location", /*is_executable*/ false) { argument 34 begin_ = begin; 164 DummySpace(uint8_t* begin, uint8_t* end) argument 167 begin,
|
/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/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 | 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 | 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 | iteration_range.h | 37 iterator begin() const { return first_; } function in class:art::IterationRange
|
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)) :
|
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 | bit_vector.h | 44 * object with begin() and end() suitable for range-based loops: 102 IndexIterator begin() const { function in class:art::BitVector::IndexContainer
|
H A D | hash_set_test.cc | 116 ASSERT_TRUE(hash_set.begin() == hash_set.end()); 134 for (auto it = hash_set.begin(); it != hash_set.end();) { 291 size_t HashIntSequence(T begin, T end) { argument 293 for (auto iter = begin; iter != end; ++iter) { 301 return HashIntSequence(item.begin(), item.end()); 305 return HashIntSequence(item.begin(), item.end()); 313 auto aiter = a.begin(); 314 auto biter = b.begin();
|
H A D | stringpiece.h | 133 iterator begin() const { return ptr_; } function in class:art::StringPiece
|
/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 | dex_file_verifier.h | 29 static bool Verify(const DexFile* dex_file, const uint8_t* begin, size_t size, 37 DexFileVerifier(const DexFile* dex_file, const uint8_t* begin, size_t size, const char* location) argument 38 : dex_file_(dex_file), begin_(begin), size_(size), location_(location),
|
/art/runtime/arch/ |
H A D | instruction_set_features.cc | 223 for (auto it = features.begin(); it != features.end();) { 293 const char* const * begin = variants; local 294 const char* const * end = begin + num_variants; 295 return std::find(begin, end, variant) != end;
|