/art/compiler/optimizing/ |
H A D | intrinsics_mips.cc | 526 // Start by flipping the bits end-for-end so we can count the number of 1985 MipsLabel end; local 2051 __ B(&end); 2056 __ Bind(&end);
|
H A D | intrinsics_mips64.cc | 1239 // support is added to the MIPS64 back end. 1395 Mips64Label end; local 1461 __ Bc(&end); 1466 __ Bind(&end);
|
H A D | ssa_liveness_analysis.h | 55 * A live range contains the start and end of a range where an instruction or a temporary 60 LiveRange(size_t start, size_t end, LiveRange* next) : start_(start), end_(end), next_(next) { argument 61 DCHECK_LT(start, end); 323 // Note that the start of `first_range_` can be equal to `end`: two blocks 342 void AddRange(size_t start, size_t end) { argument 345 new (allocator_) LiveRange(start, end, first_range_); 346 } else if (first_range_->GetStart() == end) { 349 } else if (first_range_->GetStart() == start && first_range_->GetEnd() == end) { 352 DCHECK_GT(first_range_->GetStart(), end); 358 AddLoopRange(size_t start, size_t end) argument 494 size_t end = GetEnd(); local 522 size_t end = GetEnd(); local [all...] |
H A D | intrinsics_arm64.cc | 916 // We use a block to end the scratch scope before the write barrier, thus 1230 vixl::Label end; local 1291 __ B(&end); 1296 __ Bind(&end); 1809 // Compute base source address, base destination address, and end source address 2096 // We use a block to end the scratch scope before the write barrier, thus
|
H A D | intrinsics_x86.cc | 1305 NearLabel end, return_true, return_false; local 1365 __ jmp(&end); 1370 __ Bind(&end); 1502 // And join up at the end.
|
H A D | intrinsics_x86_64.cc | 1309 // Compute base source address, base destination address, and end source address. 1412 NearLabel end, return_true, return_false; local 1467 __ jmp(&end); 1472 __ Bind(&end); 1603 // And join up at the end.
|
H A D | code_generator_arm.cc | 813 frame_entry_interval->end = __ GetAdjustedPosition(frame_entry_interval->end); 816 it.second.end = __ GetAdjustedPosition(it.second.end); 820 it.code_interval.end = __ GetAdjustedPosition(it.code_interval.end); 1896 // intact/accessible until the end of the marking phase (the 3186 Label end; local 3202 __ b(&end); 3214 __ Bind(&end); [all...] |
H A D | code_generator_x86.cc | 2036 // intact/accessible until the end of the marking phase (the 3310 NearLabel end; local 3316 __ jmp(&end); 3354 __ Bind(&end); 4354 __ Bind(&method_patches_.back().label); // Bind the label at the end of the "movl" insn. 4360 // Bind a new fixup label at the end of the "movl" insn. 4396 __ Bind(label); // Bind the label at the end of the "call" insn. 4435 // intact/accessible until the end of the marking phase (the 4459 // Add the patch entry and bind its label at the end of the instruction. 4473 // The label points to the end o [all...] |
H A D | code_generator_x86_64.cc | 785 __ Bind(&method_patches_.back().label); // Bind the label at the end of the "movl" insn. 790 // Bind a new fixup label at the end of the "movl" insn. 827 __ Bind(label); // Bind the label at the end of the "call" insn. 867 // intact/accessible until the end of the marking phase (the 905 // The label points to the end of the "movl" insn but the literal offset for method 2245 // intact/accessible until the end of the marking phase (the 3398 NearLabel end; local 3403 __ jmp(&end); 3432 __ Bind(&end);
|
/art/disassembler/ |
H A D | disassembler_arm.cc | 44 void DisassemblerArm::Dump(std::ostream& os, const uint8_t* begin, const uint8_t* end) { argument 46 for (const uint8_t* cur = begin; cur < end; cur += 4) { 52 end = reinterpret_cast<const uint8_t*>(reinterpret_cast<uintptr_t>(end) & ~1); 53 for (const uint8_t* cur = begin; cur < end;) {
|
/art/runtime/gc/allocator/ |
H A D | rosalloc.cc | 75 << std::hex << (intptr_t)base_ << ", end=" 129 for (auto it = free_page_runs_.begin(); it != free_page_runs_.end(); ) { 173 // There is a free page run at the end. 178 // There is no free page run at the end. 196 // There was a free page run at the end. Expand its size. 202 // Otherwise, insert a new free page run at the end. 326 size_t end = page_map_size_; local 327 while (idx < end && page_map_[idx] == pm_part_type) { 358 DCHECK(free_page_runs_.find(fpr) == free_page_runs_.end()); 368 if (higher_it != free_page_runs_.end()) { 971 InspectAllSlots(void (*handler)(void* start, void* end, size_t used_bytes, void* callback_arg), void* arg) argument 1216 size_t end = page_map_size_; local 1318 size_t end = page_map_size_; local 1402 InspectAll(void (*handler)(void* start, void* end, size_t used_bytes, void* callback_arg), void* arg) argument 1428 void* end = reinterpret_cast<uint8_t*>(fpr) + fpr_size; local 1449 void* end = base_ + (i + num_pages) * kPageSize; local 2043 ReleasePageRange(uint8_t* start, uint8_t* end) argument [all...] |
/art/runtime/gc/collector/ |
H A D | concurrent_copying.cc | 186 LOG(INFO) << "GC end of InitializePhase"; 286 LOG(INFO) << "GC end of FlipThreadRoots"; 466 LOG(INFO) << "GC end of MarkingPhase"; 799 for (auto* it = heap_->allocation_stack_->Begin(), *end = heap_->allocation_stack_->End(); 800 it < end; ++it) { 1269 auto* end = GetAllocationStack()->End(); local 1271 CHECK_LT(it, end); 1369 LOG(INFO) << "GC end of ReclaimPhase"; 1740 if (it == skipped_blocks_map_.end()) { 1750 if (it == skipped_blocks_map_.end()) { [all...] |
H A D | mark_sweep.cc | 62 // having this can add overhead in ProcessReferences since we may end up doing many calls of 813 uint8_t* end, 821 end_(end), 884 // Align up the end address. For example, the image space's end 978 uintptr_t end) 982 end_(end) {} 1026 // This function does not handle heap end increasing, so we must use the space end. 1028 uintptr_t end local 809 CardScanTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, uint8_t* begin, uint8_t* end, uint8_t minimum_age, size_t mark_stack_size, StackReference<mirror::Object>* mark_stack_obj, bool clear_card) argument 974 RecursiveMarkTask(ThreadPool* thread_pool, MarkSweep* mark_sweep, accounting::ContinuousSpaceBitmap* bitmap, uintptr_t begin, uintptr_t end) argument 1053 uintptr_t end = reinterpret_cast<uintptr_t>(space->End()); local [all...] |
/art/runtime/gc/space/ |
H A D | image_space.cc | 51 uint8_t* end) 55 end, 56 end, 1214 // The location we want to map from is the first aligned page after the end of the stored 1221 "Image file size does not equal end of bitmap: size=%" PRIu64 " vs. %zu.", image_file_size, 1335 // Bitmap only needs to cover until the end of the mirror objects section. 1506 << ",end=" << reinterpret_cast<void*>(End()) 1548 // Image filenames already end with .art, no need to replace. 1575 *(input_image_file_name.end() - common - 1) == *(first_image.end() 47 ImageSpace(const std::string& image_filename, const char* image_location, MemMap* mem_map, accounting::ContinuousSpaceBitmap* live_bitmap, uint8_t* end) argument [all...] |
/art/runtime/interpreter/ |
H A D | unstarted_runtime.cc | 1033 jint end = shadow_frame->GetVReg(arg_offset + 2); local 1041 DCHECK_GE(end, string->GetLength()); 1046 DCHECK_LE(end - start, h_char_array->GetLength() - index); 1047 string->GetChars(start, end, h_char_array, index); 1317 char *end; local 1320 int64_t l = strtol(c_str, &end, 10); 1333 } else if (*end != '\0') { 1361 char *end; local 1364 int64_t l = strtol(c_str, &end, 10); 1378 } else if (*end ! [all...] |
/art/dex2oat/ |
H A D | dex2oat.cc | 599 char* end; local 600 image_base_ = strtoul(image_base_str, &end, 16); 601 if (end == image_base_str || *end != '\0') { 971 image_filenames_.push_back((char_backing_storage_.end() - 1)->c_str()); 975 oat_filenames_.push_back((char_backing_storage_.end() - 1)->c_str()); 1280 for (auto it = resolved_classes.begin(); it != resolved_classes.end(); ) { 1281 if (dex_files_locations.find(it->GetDexLocation()) == dex_files_locations.end()) { 1483 class_path_files.insert(class_path_files.end(), dex_files_.begin(), dex_files_.end()); [all...] |
/art/runtime/ |
H A D | dex_file.cc | 742 size_t end = signature.size(); local 744 while (offset < end) { 753 if (offset >= end) { // expect some descriptor following [ 761 if (offset >= end) { // unexpected early termination of descriptor 779 return offset == end; // return true if the signature had reached a sensible end 825 uint32_t end = start + ti->insn_count_; local 829 } else if (address >= end) { 911 // Emit all variables which are still alive at the end of the method. 963 LOG(ERROR) << "invalid stream - end withou 2493 uint32_t end = start + tries->insn_count_; local [all...] |
H A D | utils.cc | 90 // Check whether stack_addr is the base or end of the stack. 91 // (On Mac OS 10.7, it's the end.) 570 std::replace(descriptor.begin(), descriptor.end(), '.', '/'); 583 std::replace(result.begin(), result.end(), '/', '.'); 588 std::replace(result.begin(), result.end(), '/', '.'); 630 signature.erase(signature.begin() + signature.find(')'), signature.end()); 828 * Premature end for a type descriptor, but valid for 837 * legitimate end of a type descriptor. In the latter 838 * case, make sure that this is the end of the string 839 * and that it doesn't end wit 880 const char* end = p + s.size(); local 1881 char* end = nullptr; local [all...] |
H A D | thread.cc | 117 uintptr_t* end = reinterpret_cast<uintptr_t*>(reinterpret_cast<uint8_t*>(&tlsPtr_.quick_entrypoints) + local 119 for (uintptr_t* it = begin; it != end; ++it) { 291 // Append a bool array at the end to keep track of what vregs are updated by the debugger. 2900 // Set the stack end to that to be used during a stack overflow 2922 void Thread::SetTlab(uint8_t* start, uint8_t* end) { argument 2923 DCHECK_LE(start, end); 2926 tlsPtr_.thread_local_end = end;
|
H A D | debugger.cc | 326 return dex_pcs_.find(dex_pc) == dex_pcs_.end(); 1439 * the end. 1576 uint64_t start, end; local 1580 end = -1; 1584 end = code_item->insns_size_in_code_units_ - 1; 1588 expandBufAdd8BE(pReply, end); 1688 const uint8_t* end = begin + byte_count; local 1689 for (const uint8_t* p = begin; p != end; ++p) { 3068 // function, rather than the end of the returning function. 3755 size_t end local [all...] |
/art/compiler/driver/ |
H A D | compiler_driver.cc | 941 return image_classes_->find(descriptor) != image_classes_->end(); 956 return classes_to_compile_->find(descriptor) != classes_to_compile_->end(); 969 return methods_to_compile_->find(tmp.c_str()) != methods_to_compile_->end(); 1087 for (auto it = image_classes_->begin(), end = image_classes_->end(); it != end;) { 1231 if (data_->image_class_descriptors_->find(name) != data_->image_class_descriptors_->end()) { 1270 if (marked_objects_.find(object) != marked_objects_.end()) { 1346 // current dex file entry only at the end of dex_to_dex_references_. 1897 void ForAll(size_t begin, size_t end, CompilationVisito 1927 ForAllClosure(ParallelCompilationManager* manager, size_t end, CompilationVisitor* visitor) argument [all...] |
/art/compiler/utils/mips/ |
H A D | assembler_mips.cc | 71 CHECK(std::is_sorted(advances.begin() + number_of_delayed_adjust_pcs, advances.end(), cmp)); 104 // Switch from appending instructions at the end of the buffer to overwriting 119 // Other instructions are simply appended at the end here. 1880 // Now make the label object contain its own location (relative to the end of the preceding 1997 uint32_t end = old_size; local 2000 uint32_t size = end - branch.GetOldEndLocation(); 2002 end = branch.GetOldLocation();
|
/art/compiler/utils/mips64/ |
H A D | assembler_mips64.cc | 70 // Switch from appending instructions at the end of the buffer to overwriting 85 // Other instructions are simply appended at the end here. 1545 // Now make the label object contain its own location (relative to the end of the preceding 1665 uint32_t end = old_size; local 1668 uint32_t size = end - branch.GetOldEndLocation(); 1670 end = branch.GetOldLocation();
|
/art/runtime/verifier/ |
H A D | method_verifier.cc | 986 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "code did not end where expected (" 1007 uint32_t end = start + try_item->insn_count_; local 1008 if ((start >= end) || (start >= insns_size) || (end > insns_size)) { 1010 << " endAddr=" << end << " (size=" << insns_size << ")"; 1020 while (dex_pc < end) { 1344 /* make sure the end of the switch is in range */ 1346 Fail(VERIFY_ERROR_BAD_CLASS_HARD) << "invalid array data end: at " << cur_offset 1347 << ", data offset " << array_data_offset << ", end " 1475 /* make sure the end o [all...] |
/art/runtime/gc/ |
H A D | heap.cc | 92 // How many reserve entries are at the end of the allocation stack, these are only needed if the 1032 // TODO: Switch to standard begin and end to use ranged a based loop. 1033 for (auto* it = allocation_stack_->Begin(), *end = allocation_stack_->End(); it < end; ++it) { 1079 std::sort(continuous_spaces_.begin(), continuous_spaces_.end(), 1118 auto it = std::find(continuous_spaces_.begin(), continuous_spaces_.end(), continuous_space); 1119 DCHECK(it != continuous_spaces_.end()); 1126 auto it = std::find(discontinuous_spaces_.begin(), discontinuous_spaces_.end(), 1128 DCHECK(it != discontinuous_spaces_.end()); 1132 auto it = std::find(alloc_spaces_.begin(), alloc_spaces_.end(), spac 3302 uint8_t* end = space->End(); local [all...] |