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

12345

/art/test/559-bce-ssa/src/
H A DMain.java19 public static void foo(int[] array, int[] array2, int start, int end) { argument
20 for (int i = start; i < end; ++i) {
/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.h56 void SetEnd(mirror::Object* end) { argument
57 end_ = end;
H A Dimmune_spaces.cc42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
51 // Update the end to include the other non-heap sections.
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
72 const uintptr_t end = std::get<1>(interval); local
75 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap;
76 DCHECK_GE(end, begin);
78 // New interval is not at the end of the current one, start a new interval if we are a heap
88 cur_end = end;
92 cur_heap_size += end
[all...]
/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/compiler/optimizing/
H A Dgraph_visualizer.h40 size_t end; member in struct:art::GeneratedCodeInterval
62 void SetFrameEntryInterval(size_t start, size_t end) { argument
63 frame_entry_interval_ = {start, end};
66 void AddInstructionInterval(HInstruction* instr, size_t start, size_t end) { argument
67 instruction_intervals_.Put(instr, {start, end});
70 void AddSlowPathInterval(SlowPathCode* slow_path, size_t start, size_t end) { argument
71 slow_path_intervals_.push_back({slow_path, {start, end}});
/art/disassembler/
H A Ddisassembler_arm64.cc117 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 Ddisassembler_mips.cc574 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/base/
H A Darray_slice.h111 StrideIterator<T> end() { function in class:art::ArraySlice
115 StrideIterator<const T> end() const { function in class:art::ArraySlice
120 return size() != 0 ? MakeIterationRange(begin(), end())
H A Diteration_range.h38 iterator end() const { return last_; } function in class:art::IterationRange
H A Dlength_prefixed_array.h55 StrideIterator<T> end(size_t element_size = sizeof(T), size_t alignment = alignof(T)) { function in class:art::LengthPrefixedArray
59 StrideIterator<const T> end(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 Dstl_util.h30 std::sort(v->begin(), v->end());
31 v->erase(std::unique(v->begin(), v->end()), v->end());
46 ForwardIterator end) {
47 while (begin != end) {
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(), container.end(), value);
122 DCHECK(it != container.end()); // Mus
45 STLDeleteContainerPointers(ForwardIterator begin, ForwardIterator end) argument
[all...]
/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
119 // Clear a range of cards that covers start to end, start and end must be aligned to kCardSize.
120 void ClearCardRange(uint8_t* start, uint8_t* end);
H A Dcard_table.cc112 void CardTable::ClearCardRange(uint8_t* start, uint8_t* end) { argument
114 memset(start, 0, end - start);
118 CHECK_ALIGNED(reinterpret_cast<uintptr_t>(end), kCardSize);
121 uint8_t* end_card = CardFromAddr(end);
127 // Handle unaligned regions at start / end.
139 uint8_t* end = mem_map_->End(); local
143 << " end: " << reinterpret_cast<void*>(end)
146 << " 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.cc156 DCHECK(dirty_cards_.find(card_addr) != dirty_cards_.end());
166 auto end = start + CardTable::kCardSize; local
167 os << reinterpret_cast<void*>(start) << "-" << reinterpret_cast<void*>(end) << "\n";
176 auto end = start + CardTable::kCardSize; local
178 DCHECK_LE(end, space_->Limit());
/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,
91 void* end ATTRIBUTE_UNUSED,
/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...]
/art/tools/ahat/src/
H A DDoc.java56 * contents and the 'end' method to end the table.
69 * contents and the 'end' method to end the table.
84 * end().
96 void end(); method in interface:Doc
H A DHtmlDoc.java164 public void end() { method in class:HtmlDoc
/art/compiler/dex/
H A Dverified_method.cc72 return (it != devirt_map_.end()) ? &it->second : nullptr;
78 return (it != dequicken_map_.end()) ? &it->second : nullptr;
82 return std::binary_search(safe_cast_set_.begin(), safe_cast_set_.end(), pc);
92 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); local
93 for (; inst < end; inst = inst->Next()) {
130 // verification, we might end up sharpening to a wrong implementation. Just abort.
138 const Instruction* end = Instruction::At(insns + code_item->insns_size_in_code_units_); local
140 for (; inst < end; inst = inst->Next()) {
215 const Instruction* end = Instruction::At(code_item->insns_ + local
218 for (; inst < end; ins
[all...]
/art/compiler/utils/arm/
H A Dassembler_thumb2_test.cc47 registers_.insert(end(registers_),
376 Label start, end; local
382 __ b(&end, arm::EQ);
388 __ Bind(&end);
974 // First part: as TwoCbzBeyondMaxOffset but add one 16-bit instruction to the end,
1010 // will push the literal out of range, so we shall end up with "ldr.w".
/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;

Completed in 441 milliseconds

12345