/art/compiler/optimizing/ |
H A D | register_allocator.cc | 72 // Always reserve for the current method and the graph's max out registers. 173 // can be after the current interval during linear scan. 193 // can be after the current interval during linear scan. 303 LiveInterval* current = instruction->GetLiveInterval(); local 304 if (current == nullptr) return; 310 DCHECK(unhandled.IsEmpty() || current->StartsBeforeOrAt(unhandled.Peek())); 312 if (codegen_->NeedsTwoRegisters(current->GetType())) { 313 current->AddHighInterval(); 324 if (safepoint_position == current->GetStart()) { 330 } else if (current 485 LiveInterval* current = it.CurrentInterval(); local 581 LiveInterval* current = unhandled_->Pop(); local 695 TryAllocateFreeReg(LiveInterval* current) argument 905 AllocateBlockedReg(LiveInterval* current) argument 1086 LiveInterval* current = array->Get(i - 1); local 1489 LiveInterval* current = interval; local 1670 LiveInterval* current = instruction->GetLiveInterval(); local 1748 HInstruction* current = liveness_.GetInstructionFromSsaIndex(idx); local 1758 HBasicBlock* current = it.Current(); local [all...] |
H A D | ssa_liveness_analysis.cc | 50 HBasicBlock* current = worklist->Get(insert_at - 1); local 51 HLoopInformation* current_loop = current->GetLoopInformation(); 69 // current reverse post order in the graph, but it would require making 90 HBasicBlock* current = worklist.Pop(); local 91 graph_->linear_order_.Add(current); 92 for (size_t i = 0, e = current->GetSuccessors().Size(); i < e; ++i) { 93 HBasicBlock* successor = current->GetSuccessors().Get(i); 121 HInstruction* current = inst_it.Current(); local 122 codegen_->AllocateLocations(current); 123 LocationSummary* locations = current 139 HInstruction* current = inst_it.Current(); local 205 HInstruction* current = instructions_from_ssa_index_.Get(idx); local 211 HInstruction* current = back_it.Current(); local 254 HInstruction* current = inst_it.Current(); local 270 HInstruction* current = instructions_from_ssa_index_.Get(idx); local 515 LiveInterval* current = this; local [all...] |
H A D | ssa_phi_elimination.cc | 35 HUseListNode<HInstruction*>* current = use_it.Current(); local 36 HInstruction* user = current->GetUser(); 65 HInstruction* current = block->GetFirstPhi(); local 68 while (current != nullptr) { 69 phi = current->AsPhi(); 70 next = current->GetNext(); 95 current = next; 145 HUseListNode<HInstruction*>* current = it.Current(); local 146 HInstruction* user = current->GetUser();
|
H A D | gvn.cc | 377 HInstruction* current = block->GetFirstInstruction(); local 378 while (current != nullptr) { 379 set->Kill(current->GetSideEffects()); 380 // Save the next instruction in case `current` is removed from the graph. 381 HInstruction* next = current->GetNext(); 382 if (current->CanBeMoved()) { 383 if (current->IsBinaryOperation() && current->AsBinaryOperation()->IsCommutative()) { 386 current->AsBinaryOperation()->OrderInputs(); 388 HInstruction* existing = set->Lookup(current); [all...] |
H A D | optimizing_unit_test.h | 67 HInstruction* current = it.Current(); local 68 if (current->IsSuspendCheck()) { 69 current->GetBlock()->RemoveInstruction(current);
|
H A D | inliner.cc | 251 HInstruction* current = instr_it.Current(); local 252 if (current->IsSuspendCheck()) { 256 if (current->CanThrow()) { 258 << " could not be inlined because " << current->DebugName() 263 if (current->NeedsEnvironment()) { 265 << " could not be inlined because " << current->DebugName() 270 if (!can_use_dex_cache && current->NeedsDexCache()) { 272 << " could not be inlined because " << current->DebugName()
|
H A D | nodes.cc | 446 HBasicBlock* current = other; local 447 while (current != nullptr) { 448 if (current == this) { 451 current = current->GetDominator(); 740 HUseListNode<HInstruction*>* current = it.Current(); local 741 HInstruction* user = current->GetUser(); 742 size_t input_index = current->GetIndex(); 748 HUseListNode<HEnvironment*>* current = it.Current(); local 749 HEnvironment* user = current 980 HInstruction* current = first_instruction_; local 1319 HBasicBlock* current = it.Current(); local 1364 HInstruction* current = it.Current(); local [all...] |
H A D | ssa_liveness_analysis.h | 425 // The range at or immediately after the current position of linear scan 440 // Returns the first intersection of this interval with `current`, which 442 size_t FirstIntersectionWith(LiveInterval* current) const { 443 // Find the first range after the start of `current`. We use the search 445 DCHECK(GetStart() <= current->GetStart() || IsFixed()); 446 LiveRange* other_range = current->first_range_; 591 LiveRange* current = first_range_; local 596 if (position >= current->GetEnd()) { 598 previous = current; 599 current 655 LiveRange* current = first_range_; local 971 HLoopInformation* current = it.Current(); local [all...] |
H A D | code_generator.cc | 135 + (is_64_bit ? 2 : 1) /* current method */, 140 bool CodeGenerator::GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const { argument 141 DCHECK_EQ(block_order_->Get(current_block_index_), current); 176 HInstruction* current = it.Current(); local 178 InitLocationsBaseline(current); 180 DCHECK(CheckTypeConsistency(current)); 181 current->Accept(instruction_visitor); 703 HInstruction* current = environment->GetInstructionAt(i); local 704 if (current == nullptr) { 712 DCHECK_EQ(current, locatio 891 HInstruction* current = it.Current(); local [all...] |
H A D | graph_checker.cc | 91 HInstruction* current = it.Current(); local 93 if (!current->IsPhi()) { 97 if (current->GetNext() == nullptr && current != block->GetLastPhi()) { 101 current->GetId())); 103 current->Accept(this); 108 HInstruction* current = it.Current(); local 110 if (current->IsPhi()) { 114 if (current->GetNext() == nullptr && 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 | ssa_builder.cc | 93 // If not, it will remain dead, and the algorithm will make the current phi dead 339 HInstruction* current = it.Current(); local 340 if (current->IsLocal()) { 341 current->GetBlock()->RemoveInstruction(current); 379 HInstruction* current = ValueOfLocal(block->GetPredecessors().Get(i), local); local 380 if (current == nullptr) { 383 } else if (current != value) { 409 // - HLoadLocal: replace them with the current value of the local. 410 // - HStoreLocal: update current valu [all...] |
H A D | bounds_check_elimination.cc | 1853 HBasicBlock* current = it.Current(); local 1854 if (current == last_visited_block) { 1857 DCHECK(current->IsLoopHeader()); 1860 if (visitor.IsAddedBlock(current)) { 1864 visitor.VisitBasicBlock(current); 1865 last_visited_block = current;
|
H A D | code_generator.h | 116 // The current index for core registers. 118 // The current index for floating-point registers. 120 // The current stack index. 143 bool GoesToNextBlock(HBasicBlock* current, HBasicBlock* next) const; 146 // Note that this follows the current calling convention. 451 // The current block index in `block_order_` of the block 458 // Whether an instruction in the graph accesses the current method.
|
H A D | nodes.h | 362 // The current id to assign to a newly added instruction. See HInstruction.id_. 713 // Set the loop_information_ on this block. Overrides the current 966 for (HUseListNode<T>* current = first_; current != nullptr; current = current->GetNext()) { 967 if (current == node) { 984 for (HUseListNode<T>* current = first_; current != nullptr; current [all...] |
H A D | code_generator_arm.cc | 423 ArmManagedRegister current = local 425 if (current.AsRegisterPairLow() == reg || current.AsRegisterPairHigh() == reg) { 482 ArmManagedRegister current = local 484 if (blocked_core_registers_[current.AsRegisterPairLow()] 485 || blocked_core_registers_[current.AsRegisterPairHigh()]) {
|
H A D | code_generator_x86.cc | 415 X86ManagedRegister current = local 417 if (current.AsRegisterPairLow() == reg || current.AsRegisterPairHigh() == reg) { 455 X86ManagedRegister current = local 457 if (blocked_core_registers_[current.AsRegisterPairLow()] 458 || blocked_core_registers_[current.AsRegisterPairHigh()]) {
|
/art/runtime/ |
H A D | profiler.cc | 99 LOG(INFO) << "No current method available"; 250 // Update the current time. 445 // Record the current bounded stack into sampling results. 511 StackTrieNode* current = stack_trie_root_; local 513 current->IncreaseCount(); 529 StackTrieNode* child = current->FindChild(method_ref, dex_pc); 531 current = child; 538 StackTrieNode* new_node = new StackTrieNode(method_ref, dex_pc, method_size, current); 539 current->AppendChild(new_node); 540 current 618 StackTrieNode* current = node->GetParent(); local [all...] |
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 | 251 const InstrumentationStackFrame& current = *it; local 252 if (instrumentation_frame.frame_id_ >= current.frame_id_) { 1000 // TODO: improve the dex pc information here, requires knowledge of current PC as opposed to 1053 // TODO: improve the dex pc information here, requires knowledge of current PC as opposed to
|
/art/imgdiag/ |
H A D | imgdiag.cc | 361 const uint8_t* current = begin_image_ptr + RoundUp(sizeof(ImageHeader), kObjectAlignment); local 362 while (reinterpret_cast<const uintptr_t>(current) 364 CHECK_ALIGNED(current, kObjectAlignment); 365 mirror::Object* obj = reinterpret_cast<mirror::Object*>(const_cast<uint8_t*>(current)); 379 object_address = reinterpret_cast<uintptr_t>(current); 396 ptrdiff_t offset = current - begin_image_ptr; 400 if (memcmp(current, current_remote, obj->SizeOf()) != 0) { 409 if (current[i] != current_remote[i]) { 431 if (current[i] != current_remote[i]) { 443 if (current[ [all...] |
/art/runtime/gc/space/ |
H A D | image_space.cc | 212 << "We should always be generating an image for the current isa."; 648 uint8_t* current = Begin() + RoundUp(sizeof(ImageHeader), kObjectAlignment); local 649 while (current < End()) { 650 CHECK_ALIGNED(current, kObjectAlignment); 651 auto* obj = reinterpret_cast<mirror::Object*>(current); 657 current += RoundUp(obj->SizeOf(), kObjectAlignment);
|
/art/runtime/mirror/ |
H A D | class-inl.h | 361 Class* current = this; local 363 if (current == klass) { 366 current = current->GetSuperClass(); 367 } while (current != nullptr);
|
/art/compiler/dex/ |
H A D | mir_graph.cc | 495 /* Always terminate the current block for conditional branches */ 699 /* Parse a Dex method and insert it into the MIRGraph at the current insert point. */ 826 * Terminate the current block if there are instructions 865 * forward branch so a block is already created. If the current 1166 MIR* current = first_mir_insn; local 1168 while (current != nullptr) { 1169 MIR* next = current->next; 1172 return current; 1175 current = next; 1266 MIR* BasicBlock::GetNextUnconditionalMir(MIRGraph* mir_graph, MIR* current) { argument [all...] |
/art/compiler/driver/ |
H A D | compiler_driver.cc | 976 Runtime* current = Runtime::Current(); local 979 current->GetThreadList()->SuspendAll(__FUNCTION__); 984 current->GetClassLinker(), 992 current->GetThreadList()->ResumeAll(); 1423 // The method is defined not within this dex file. We need a dex cache slot within the current 2047 // TODO multithreading support. We should ensure the current compilation thread has
|