/art/compiler/optimizing/ |
H A D | ssa_phi_elimination.cc | 89 HInstruction* current = block->GetFirstPhi(); local 92 while (current != nullptr) { 93 phi = current->AsPhi(); 94 next = current->GetNext(); 116 current = next; 180 HPhi* current = cycle_worklist[i]; local 181 DCHECK(!current->IsLoopHeaderPhi() || 182 current->GetBlock()->IsLoopPreHeaderFirstPredecessor()); 184 for (size_t j = 0; j < current->InputCount(); ++j) { 185 HInstruction* input = current [all...] |
H A D | live_interval_test.cc | 169 LiveRange* current = interval->GetFirstRange(); local 173 i < number_of_expected_ranges && current != nullptr; 174 ++i, current = current->GetNext()) { 175 if (expected[i][0] != current->GetStart()) { 178 if (expected[i][1] != current->GetEnd()) { 183 if (current != nullptr || i != number_of_expected_ranges) {
|
H A D | optimizing_unit_test.h | 68 HInstruction* current = it.Current(); local 69 if (current->IsSuspendCheck()) { 70 current->GetBlock()->RemoveInstruction(current);
|
H A D | gvn.cc | 483 HInstruction* current = block->GetFirstInstruction(); local 484 while (current != nullptr) { 485 // Save the next instruction in case `current` is removed from the graph. 486 HInstruction* next = current->GetNext(); 489 if (current->CanBeMoved()) { 490 if (current->IsBinaryOperation() && current->AsBinaryOperation()->IsCommutative()) { 493 current->AsBinaryOperation()->OrderInputs(); 495 HInstruction* existing = set->Lookup(current); 498 // current i [all...] |
H A D | ssa_liveness_analysis.cc | 50 HBasicBlock* current = *insert_pos; local 51 HLoopInformation* current_loop = current->GetLoopInformation(); 69 // current reverse post order in the graph, but it would require making 91 HBasicBlock* current = worklist.back(); local 93 graph_->linear_order_.push_back(current); 94 for (HBasicBlock* successor : current->GetSuccessors()) { 122 HInstruction* current = inst_it.Current(); local 123 codegen_->AllocateLocations(current); 124 LocationSummary* locations = current->GetLocations(); 126 instructions_from_ssa_index_.push_back(current); 140 HInstruction* current = inst_it.Current(); local 177 RecursivelyProcessInputs(HInstruction* current, HInstruction* actual_user, BitVector* live_in) argument 247 HInstruction* current = GetInstructionFromSsaIndex(idx); local 253 HInstruction* current = back_it.Current(); local 300 HInstruction* current = inst_it.Current(); local 319 HInstruction* current = GetInstructionFromSsaIndex(idx); local 568 LiveInterval* current = this; local [all...] |
H A D | graph_checker.cc | 120 HInstruction* current = it.Current(); local 122 if (!current->IsPhi()) { 126 if (current->GetNext() == nullptr && current != block->GetLastPhi()) { 130 current->GetId())); 132 current->Accept(this); 137 HInstruction* current = it.Current(); local 139 if (current->IsPhi()) { 143 if (current->GetNext() == nullptr && current ! [all...] |
H A D | code_generator.cc | 142 bool CodeGenerator::GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const { argument 143 DCHECK_EQ((*block_order_)[current_block_index_], current); 234 HInstruction* current = it.Current(); local 235 if (current->HasEnvironment()) { 239 MaybeRecordNativeDebugInfo(current, block->GetDexPc()); 241 DisassemblyScope disassembly_scope(current, *this); 242 DCHECK(CheckTypeConsistency(current)); 243 current->Accept(instruction_visitor); 540 // path or refer to the current method directly, no longer needs current metho 913 HInstruction* current = environment->GetInstructionAt(i); local 1127 HInstruction* current = it.Current(); local [all...] |
H A D | inliner.cc | 1122 HInstruction* current = instructions.Current(); local 1123 if (current->IsParameterValue()) { 1126 current->ReplaceWith(callee_graph->GetNullConstant()); 1128 current->ReplaceWith(callee_graph->GetIntConstant(argument->AsIntConstant()->GetValue())); 1130 current->ReplaceWith(callee_graph->GetLongConstant(argument->AsLongConstant()->GetValue())); 1132 current->ReplaceWith( 1135 current->ReplaceWith( 1138 current->SetReferenceTypeInfo(argument->GetReferenceTypeInfo()); 1139 current->AsParameterValue()->SetCanBeNull(argument->CanBeNull()); 1199 HInstruction* current [all...] |
H A D | register_allocator.cc | 78 // Always reserve for the current method and the graph's max out registers. 200 // can be after the current interval during linear scan. 220 // can be after the current interval during linear scan. 318 LiveInterval* current = instruction->GetLiveInterval(); local 319 if (current == nullptr) return; 325 DCHECK(unhandled.empty() || current->StartsBeforeOrAt(unhandled.back())); 327 if (codegen_->NeedsTwoRegisters(current->GetType())) { 328 current->AddHighInterval(); 339 if (safepoint_position == current->GetStart()) { 345 } else if (current 505 LiveInterval* current = it.CurrentInterval(); local 607 LiveInterval* current = unhandled_->back(); local 735 TryAllocateFreeReg(LiveInterval* current) argument 989 AllocateBlockedReg(LiveInterval* current) argument 1176 LiveInterval* current = (*array)[i - 1u]; local 1601 LiveInterval* current = interval; local 1837 LiveInterval* current = instruction->GetLiveInterval(); local 1954 HBasicBlock* current = it.Current(); local [all...] |
H A D | bounds_check_elimination.cc | 1384 // Does the current basic block dominate all back edges? If not, 1757 HBasicBlock* current = it.Current(); local 1758 if (visitor.IsAddedBlock(current)) { 1762 visitor.VisitBasicBlock(current); 1763 // Skip forward to the current block in case new basic blocks were inserted 1766 for ( ; !it.Done() && it.Current() != current; it.Advance()) {
|
H A D | instruction_builder.cc | 82 HBasicBlock* current = it.Current(); local 83 if (current == current_block_) { 85 } else if (current->IsTryBlock()) { 86 const HTryBoundary& try_entry = current->GetTryCatchInformation()->GetTryEntry(); 126 HInstruction* current = ValueOfLocalAt(predecessor, local); local 127 if (current == nullptr) { 130 } else if (current != value) { 333 // instruction of the current block is not a branching instruction. 745 // TODO: The actual method could still be referenced in the current dex file, so we 1295 // When this happens we cannot establish a direct relation between the current [all...] |
H A D | nodes.cc | 71 HBasicBlock* current = worklist.back(); local 72 uint32_t current_id = current->GetBlockId(); 73 if (successors_visited[current_id] == current->GetSuccessors().size()) { 77 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; 81 successor->AddBackEdge(current); 245 HBasicBlock* current = worklist.back(); local 246 uint32_t current_id = current->GetBlockId(); 247 if (successors_visited[current_id] == current->GetSuccessors().size()) { 250 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; 251 UpdateDominatorOfSuccessor(current, successo 749 HBasicBlock* current = other; local 1632 HInstruction* current = first_instruction_; local 2006 HInstruction* current = instr_it.Current(); local 2084 HBasicBlock* current = it.Current(); local 2141 HInstruction* current = it.Current(); local 2324 HInstruction* current = this; local [all...] |
H A D | ssa_liveness_analysis.h | 429 // The range at or immediately after the current position of linear scan 444 // Returns the first intersection of this interval with `current`, which 446 size_t FirstIntersectionWith(LiveInterval* current) const { 447 // Find the first range after the start of `current`. We use the search 449 DCHECK(GetStart() <= current->GetStart() || IsFixed()); 450 LiveRange* other_range = current->first_range_; 604 LiveRange* current = first_range_; local 609 if (position >= current->GetEnd()) { 611 previous = current; 612 current 668 LiveRange* current = first_range_; local 983 HBasicBlock* current = it.Current(); local 1025 HLoopInformation* current = it.Current(); local [all...] |
H A D | code_generator_mips.cc | 735 // Allocate the rest of the frame and store the current method pointer 1027 MipsManagedRegister current = local 1029 if (blocked_core_registers_[current.AsRegisterPairLow()] 1030 || blocked_core_registers_[current.AsRegisterPairHigh()]) {
|
H A D | code_generator_arm.cc | 856 ArmManagedRegister current = local 858 if (blocked_core_registers_[current.AsRegisterPairLow()] 859 || blocked_core_registers_[current.AsRegisterPairHigh()]) { 1896 // intermediate/temporary reference and because the current 6431 // intermediate/temporary reference and because the current
|
/art/runtime/ |
H A D | compiler_filter.cc | 133 bool CompilerFilter::IsAsGoodAs(Filter current, Filter target) { argument 134 return current >= target;
|
H A D | reference_table.cc | 217 mirror::Object* current = root.Read<kWithoutReadBarrier>(); local 220 if (current == prev) { 223 } else if (current->GetClass() == prev->GetClass() && 224 GetElementCount(current) == element_count) { 234 prev = current;
|
H A D | instrumentation.cc | 256 const InstrumentationStackFrame& current = *it; local 257 if (instrumentation_frame.frame_id_ >= current.frame_id_) { 1076 // TODO: improve the dex pc information here, requires knowledge of current PC as opposed to 1132 // TODO: improve the dex pc information here, requires knowledge of current PC as opposed to
|
H A D | oat_file_assistant.cc | 104 // Note: We check the current boot class path, regardless of the ISA 140 CompilerFilter::Filter current = oat_file->GetCompilerFilter(); local 141 return CompilerFilter::IsAsGoodAs(current, target); 149 CompilerFilter::Filter current = odex_file->GetCompilerFilter(); local 150 return CompilerFilter::IsAsGoodAs(current, target);
|
H A D | profiler.cc | 101 LOG(INFO) << "No current method available"; 252 // Update the current time. 449 // Record the current bounded stack into sampling results. 520 StackTrieNode* current = stack_trie_root_; local 522 current->IncreaseCount(); 538 StackTrieNode* child = current->FindChild(method_ref, dex_pc); 540 current = child; 547 StackTrieNode* new_node = new StackTrieNode(method_ref, dex_pc, method_size, current); 548 current->AppendChild(new_node); 549 current 627 StackTrieNode* current = node->GetParent(); local [all...] |
/art/compiler/utils/ |
H A D | intrusive_forward_list.h | 281 for (iterator current = begin(); current != end(); ++current) { 282 if (pred(*current)) { 284 current = prev; 286 prev = current; 297 iterator current = prev; local 298 ++current; 299 for (; current != end(); ++current) { 318 iterator current = begin(); local [all...] |
/art/imgdiag/ |
H A D | imgdiag.cc | 512 const uint8_t* current = begin_image_ptr + RoundUp(sizeof(ImageHeader), kObjectAlignment); local 513 while (reinterpret_cast<uintptr_t>(current) < reinterpret_cast<uintptr_t>(end_image_ptr)) { 514 CHECK_ALIGNED(current, kObjectAlignment); 515 mirror::Object* obj = reinterpret_cast<mirror::Object*>(const_cast<uint8_t*>(current)); 529 object_address = reinterpret_cast<uintptr_t>(current); 544 ptrdiff_t offset = current - begin_image_ptr; 549 bool different_image_object = memcmp(current, current_remote, obj->SizeOf()) != 0; 554 different_zygote_object = memcmp(current, zygote_ptr, obj->SizeOf()) != 0; 572 if (current[i] != current_remote[i]) { 591 if (current[ [all...] |
/art/runtime/gc/space/ |
H A D | image_space.cc | 118 << "We should always be generating an image for the current isa."; 599 uint8_t* current = Begin() + RoundUp(sizeof(ImageHeader), kObjectAlignment); local 600 while (current < End()) { 601 CHECK_ALIGNED(current, kObjectAlignment); 602 auto* obj = reinterpret_cast<mirror::Object*>(current); 608 current += RoundUp(obj->SizeOf(), kObjectAlignment);
|
/art/runtime/mirror/ |
H A D | class-inl.h | 457 Class* current = this; local 459 if (current == klass) { 462 current = current->GetSuperClass(); 463 } while (current != nullptr);
|
/art/oatdump/ |
H A D | oatdump.cc | 1147 StackMap current = code_info_.GetStackMapAt(i, encoding_); local 1149 current.GetNativePcOffset(encoding_.stack_map_encoding)) { 1153 last = current; 2001 for (size_t i = 100; i > 0; i--) { // i is the current number of standard deviations 2040 for (size_t i = 10; i > 0; i--) { // i is the current number of standard deviations
|