Searched defs:begin (Results 1 - 25 of 60) sorted by relevance

123

/art/disassembler/
H A Ddisassembler.cc57 std::string Disassembler::FormatInstructionPointer(const uint8_t* begin) { argument
59 return StringPrintf("%p", begin);
61 size_t offset = begin - disassembler_options_->base_address_;
H A Ddisassembler_arm64.cc111 size_t DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin) { argument
112 const Instruction* instr = reinterpret_cast<const Instruction*>(begin);
114 os << FormatInstructionPointer(begin)
119 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
120 for (const uint8_t* cur = begin; cur < end; cur += kInstructionSize) {
H A Ddisassembler_arm.cc152 const uintptr_t begin = reinterpret_cast<uintptr_t>(options_->base_address_); local
159 literal_addr += begin;
166 if (literal_addr < begin || literal_addr > end - literal_size[type]) {
207 size_t DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin) { argument
209 // Remove the Thumb specifier bit; no effect if begin does not point to T32 code.
210 const uintptr_t instr_ptr = reinterpret_cast<uintptr_t>(begin) & ~1;
212 const bool is_t32 = (reinterpret_cast<uintptr_t>(begin) & 1) != 0;
231 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
232 DCHECK_LE(begin, end);
234 // Remove the Thumb specifier bit; no effect if begin doe
[all...]
/art/libartbase/base/
H A Dbit_vector-inl.h80 inline BitVector::IndexIterator BitVector::IndexContainer::begin() const { function in class:art::BitVector::IndexContainer
H A Diteration_range.h37 iterator begin() const { return first_; } function in class:art::IterationRange
59 typedef typename std::reverse_iterator<decltype(c.begin())> riter;
60 return MakeIterationRange(riter(c.end()), riter(c.begin()));
H A Dlength_prefixed_array.h46 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 Darray_ref.h119 iterator begin() { return array_; } function in class:art::ArrayRef
120 const_iterator begin() const { return array_; } function in class:art::ArrayRef
128 reverse_iterator rend() { return reverse_iterator(begin()); }
129 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
198 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
H A Darray_slice.h59 iterator begin() { return iterator(&AtUnchecked(0), element_size_); } function in class:art::ArraySlice
60 const_iterator begin() const { return const_iterator(&AtUnchecked(0), element_size_); } function in class:art::ArraySlice
68 reverse_iterator rend() { return reverse_iterator(begin()); }
69 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
H A Dstl_util.h39 void STLDeleteContainerPointers(ForwardIterator begin, argument
41 while (begin != end) {
42 ForwardIterator temp = begin;
43 ++begin;
50 // hash_set, or any other STL container which defines sensible begin(), end(),
61 STLDeleteContainerPointers(container->begin(), container->end());
72 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
94 auto it = std::find(container.begin(), container.end(), value);
96 return std::distance(container.begin(), it);
102 auto it = std::find(container.begin(), containe
[all...]
H A Dtransform_array_ref.h92 iterator begin() { return MakeIterator(base().begin()); } function in class:art::TransformArrayRef
93 const_iterator begin() const { return MakeIterator(base().cbegin()); } function in class:art::TransformArrayRef
101 reverse_iterator rend() { return reverse_iterator(begin()); }
102 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
165 return lhs.size() == rhs.size() && std::equal(lhs.begin(), lhs.end(), rhs.begin());
/art/libdexfile/dex/
H A Ddex_file_layout.cc25 int DexLayoutSection::MadviseLargestPageAlignedRegion(const uint8_t* begin, argument
28 DCHECK_LE(begin, end);
29 begin = AlignUp(begin, kPageSize);
31 if (begin < end) {
33 int result = madvise(const_cast<uint8_t*>(begin), end - begin, advice);
H A Dcode_item_accessors-inl.h69 inline DexInstructionIterator CodeItemInstructionAccessor::begin() const { function in class:art::CodeItemInstructionAccessor
133 int32_t index = DexFile::FindTryItem(try_items.begin(),
134 try_items.end() - try_items.begin(),
136 return index != -1 ? &try_items.begin()[index] : nullptr;
H A Ddex_cache_resolved_classes.h54 void AddClasses(InputIt begin, InputIt end) const { argument
55 classes_.insert(begin, end);
H A Ddex_file_verifier.h32 const uint8_t* begin,
44 const uint8_t* begin,
49 begin_(begin),
43 DexFileVerifier(const DexFile* dex_file, const uint8_t* begin, size_t size, const char* location, bool verify_checksum) argument
/art/runtime/gc/accounting/
H A Dbitmap.cc92 MemMap* mem_map, uintptr_t begin, size_t num_bits) {
93 return new MemoryRangeBitmap(mem_map, begin, num_bits);
91 CreateFromMemMap( MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
H A Dbitmap.h180 MemoryRangeBitmap(MemMap* mem_map, uintptr_t begin, size_t num_bits) argument
181 : Bitmap(mem_map, num_bits), cover_begin_(begin), cover_end_(begin + kAlignment * num_bits) {
H A Dcard_table.cc121 uint8_t* begin = mem_map_->Begin() + offset_; local
125 << " begin: " << reinterpret_cast<void*>(begin)
128 << " heap begin: " << AddrFromCard(begin)
H A Dread_barrier_table.h109 uint8_t* begin = mem_map_->Begin(); local
111 return entry_addr >= begin && entry_addr < end;
H A Dspace_bitmap_test.cc43 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, argument
46 begin_(begin),
/art/runtime/gc/collector/
H A Dimmune_region.h51 void SetBegin(mirror::Object* begin) { argument
52 begin_ = begin;
H A Dimmune_spaces.cc65 std::sort(intervals.begin(), intervals.end());
66 // Intervals are already sorted by begin, if a new interval begins at the end of the current
72 const uintptr_t begin = std::get<0>(interval); local
75 VLOG(collector) << "Interval " << reinterpret_cast<const void*>(begin) << "-"
77 DCHECK_GE(end, begin);
78 DCHECK_GE(begin, cur_end);
81 if (begin != cur_end) {
86 cur_begin = begin;
93 cur_heap_size += end - begin;
/art/cmdline/
H A Dtoken_range.h44 begin_(token_list_->begin()),
52 begin_(token_list_->begin()),
62 begin_(token_list_->begin()),
64 assert(it_begin >= token_list.begin());
72 begin_(token_list_->begin()),
79 begin_(token_list_->begin()),
90 assert(it_begin >= token_list->begin());
103 begin_(token_list_->begin()),
107 // Iterator type for begin() and end(). Guaranteed to be a RandomAccessIterator.
110 // Iterator type for const begin() an
146 iterator begin() const { function in struct:art::TokenRange
[all...]
/art/runtime/arch/
H A Dinstruction_set_features.cc193 for (auto it = features.begin(); it != features.end();) {
257 const char* const * begin = variants; local
258 const char* const * end = begin + num_variants;
259 return std::find(begin, end, variant) != end;
/art/runtime/
H A Dzip_archive.cc182 uint8_t* begin = map->Begin(); local
184 tmp += StringPrintf("%3d ", (unsigned int)begin[i]);
187 LOG(INFO) << "map address " << StringPrintf("%p", begin);
/art/compiler/utils/
H A Dintrusive_forward_list_test.cc64 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(); local
131 typename ListType::const_iterator converted_begin = begin;
145 ASSERT_TRUE(ifl.begin() == ifl.cbegin());
146 ASSERT_FALSE(ifl.begin() != ifl.cbegin());
150 ASSERT_TRUE(ifl.begin()
[all...]

Completed in 3543 milliseconds

123