Searched defs:end (Results 1 - 25 of 90) sorted by relevance

1234

/art/runtime/base/
H A Dstl_util.h28 std::sort(v->begin(), v->end());
29 v->erase(std::unique(v->begin(), v->end()), v->end());
44 ForwardIterator end) {
45 while (begin != end) {
54 // hash_set, or any other STL container which defines sensible begin(), end(),
65 STLDeleteContainerPointers(container->begin(), container->end());
76 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
43 STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) argument
H A Diteration_range.h38 iterator end() const { return last_; } function in class:art::IterationRange
H A Dbit_vector.h43 * object with begin() and end() suitable for range-based loops:
63 // Helper function to check for end without comparing with bit_vector.Indexes().end().
105 IndexIterator end() const { function in class:art::BitVector::IndexContainer
195 // Count the number of bits that are set in range [0, end).
196 uint32_t NumSetBits(uint32_t end) const;
236 // Number of bits set in range [0, end) in storage. (No range check.)
237 static uint32_t NumSetBits(const uint32_t* storage, uint32_t end);
/art/test/028-array-write/src/
H A DMain.java27 static public void report(long start, long end) { argument
32 System.out.println("Finished in " + ((end - start) / 1000000.0)
42 long start, end;
50 end = System.nanoTime();
52 report(start, end);
56 long start, end;
68 end = System.nanoTime();
70 report(start, end);
/art/runtime/gc/collector/
H A Dimmune_region.h55 void SetEnd(mirror::Object* end) { argument
56 end_ = end;
/art/runtime/gc/space/
H A Dbump_pointer_space-inl.h48 uint8_t* end = end_.LoadRelaxed(); local
49 if (end + num_bytes > growth_end_) {
52 mirror::Object* obj = reinterpret_cast<mirror::Object*>(end);
53 end_.StoreRelaxed(end + num_bytes);
/art/cmdline/
H A Dtoken_range.h43 end_(token_list_->end())
51 end_(token_list_->end())
61 end_(token_list_->end()) {
63 assert(it_end <= token_list.end());
71 end_(token_list_->end())
78 end_(token_list_->end())
89 assert(it_end <= token_list->end());
102 end_(token_list_->end())
105 // Iterator type for begin() and end(). Guaranteed to be a RandomAccessIterator.
108 // Iterator type for const begin() and const end()
149 iterator end() const { function in struct:art::TokenRange
[all...]
/art/disassembler/
H A Ddisassembler_arm64.cc110 void DisassemblerArm64::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
111 for (const uint8_t* cur = begin; cur < end; cur += vixl::kInstructionSize) {
H A Ddisassembler_mips.cc454 void DisassemblerMips::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument
455 for (const uint8_t* cur = begin; cur < end; cur += 4) {
/art/runtime/gc/accounting/
H A Dcard_table.h75 void VisitClear(const void* start, const void* end, const Visitor& visitor) { argument
77 uint8_t* card_end = CardFromAddr(end);
104 // For every dirty at least minumum age between begin and end invoke the visitor with the
118 void ClearCardRange(uint8_t* start, uint8_t* end);
H A Dcard_table.cc110 void CardTable::ClearCardRange(uint8_t* start, uint8_t* end) { argument
112 memset(start, 0, end - start);
116 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize);
119 uint8_t* end_card = CardFromAddr(end);
125 // Handle unaligned regions at start / end.
137 uint8_t* end = mem_map_->End(); local
141 << " end: " << reinterpret_cast<void*>(end)
144 << " heap end: " << AddrFromCard(end)
[all...]
H A Dcard_table_test.cc119 uint8_t* end = cend - end_offset; local
122 card_table_->ModifyCardsAtomic(start, end, visitor, visitor);
129 for (uint8_t* cur = end + CardTable::kCardSize; cur < HeapLimit();
135 for (uint8_t* cur = start; cur < AlignUp(end, CardTable::kCardSize);
H A Dread_barrier_table.h108 uint8_t* end = mem_map_->End(); local
109 return entry_addr >= begin && entry_addr < end;
H A Dremembered_set.cc149 DCHECK(dirty_cards_.find(card_addr) != dirty_cards_.end());
159 auto end = start + CardTable::kCardSize; local
160 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "\n";
169 auto end = start + CardTable::kCardSize; local
171 DCHECK_LE(end, space_->Limit());
H A Dspace_bitmap_test.cc43 const mirror::Object* end)
46 end_(end) {}
77 // This handles all the cases, having runs which start and end on the same word, and different
83 mirror::Object* end = local
85 BitmapVerify(space_bitmap.get(), start, end);
143 size_t end = offset + RoundDown(r.next() % (remain + 1), kAlignment); variable
146 reinterpret_cast<uintptr_t>(heap_begin) + end, c);
149 for (uintptr_t k = offset; k < end; k += kAlignment) {
42 BitmapVerify(ContinuousSpaceBitmap* bitmap, const mirror::Object* begin, const mirror::Object* end) argument
/art/runtime/gc/allocator/
H A Ddlmalloc.cc59 extern "C" void DlmallocMadviseCallback(void* start, void* end, size_t used_bytes, void* arg) { argument
66 end = reinterpret_cast<void*>(art::RoundDown(reinterpret_cast<uintptr_t>(end), art::kPageSize));
67 if (end > start) {
68 size_t length = reinterpret_cast<uint8_t*>(end) - reinterpret_cast<uint8_t*>(start);
80 void* end ATTRIBUTE_UNUSED, size_t used_bytes,
89 extern "C" void DlmallocObjectsAllocatedCallback(void* start, void* end, size_t used_bytes, argument
92 UNUSED(end);
/art/runtime/jit/
H A Djit_code_cache.cc85 uint8_t* JitCodeCache::AddDataArray(Thread* self, const uint8_t* begin, const uint8_t* end) { argument
87 const size_t size = end - begin;
91 std::copy(begin, end, data_cache_ptr_);
103 if (it != method_code_map_.end()) {
115 if (it != method_code_map_.end()) {
/art/runtime/
H A Dleb128_test.cc117 uint8_t* end = EncodeUnsignedLeb128(encoded_data, uleb128_tests[i].decoded); local
118 size_t data_size = static_cast<size_t>(end - encoded_data);
156 uint8_t* end = encoded_data; local
158 end = EncodeUnsignedLeb128(end, uleb128_tests[i].decoded);
160 size_t data_size = static_cast<size_t>(end - encoded_data);
198 uint8_t* end = EncodeSignedLeb128(encoded_data, sleb128_tests[i].decoded); local
199 size_t data_size = static_cast<size_t>(end - encoded_data);
237 uint8_t* end = encoded_data; local
239 end
[all...]
H A Dvmap_table.h66 size_t end = DecodeUnsignedLeb128(&table); local
73 for (size_t i = 0; i < end; ++i) {
H A Dleb128.h29 // just past the end of the read value. This function tolerates
57 // just past the end of the read value. This function tolerates
65 // just past the end of the read value. This function tolerates
148 for (uint8_t* end = EncodeUnsignedLeb128(dest, value); end < old_end; end++) {
150 end[-1] |= 0x80;
151 end[0] = 0;
197 void InsertBackUnsigned(It cur, It end) { argument
198 for (; cur != end;
208 InsertBackSigned(It cur, It end) argument
[all...]
H A Dthread-inl.h227 StackReference<mirror::Object>* end) {
230 DCHECK(end != nullptr);
232 DCHECK_ALIGNED(end, sizeof(StackReference<mirror::Object>));
233 DCHECK_LT(start, end);
234 tlsPtr_.thread_local_alloc_stack_end = end;
226 SetThreadLocalAllocationStack(StackReference<mirror::Object>* start, StackReference<mirror::Object>* end) argument
H A Dutils.h48 char* end; local
49 unsigned long long int result = strtoull(in, &end, 0); // NOLINT(runtime/int)
50 if (in == end || *end != '\0') {
62 char* end; local
63 long long int result = strtoll(in, &end, 0); // NOLINT(runtime/int)
64 if (in == end || *end != '\0') {
180 // additionally allowing names that begin with '<' and end with '>'.
/art/runtime/arch/
H A Dinstruction_set_features.cc223 for (auto it = features.begin(); it != features.end();) {
294 const char* const * end = begin + num_variants; local
295 return std::find(begin, end, variant) != end;
/art/runtime/native/
H A Djava_lang_String.cc83 static void String_getCharsNoCheck(JNIEnv* env, jobject java_this, jint start, jint end, argument
88 soa.Decode<mirror::String*>(java_this)->GetChars(start, end, char_array, index);
/art/compiler/dex/
H A Dverified_method.cc76 return (it != devirt_map_.end()) ? &it->second : nullptr;
82 return (it != dequicken_map_.end()) ? &it->second : nullptr;
86 return std::binary_search(safe_cast_set_.begin(), safe_cast_set_.end(), pc);
210 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); local
211 for (; inst < end; inst = inst->Next()) {
248 // verification, we might end up sharpening to a wrong implementation. Just abort.
256 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); local
258 for (; inst < end; inst = inst->Next()) {
332 const Instruction* end = Instruction::At(code_item->insns_ + local
335 for (; inst < end; ins
[all...]

Completed in 445 milliseconds

1234