Home
last modified time | relevance | path

Searched refs:HPhi (Results 1 – 23 of 23) sorted by relevance

/art/compiler/optimizing/
Dssa_builder.cc45 void AddToWorklist(HPhi* phi);
46 void AddDependentInstructionsToWorklist(HPhi* phi);
47 bool UpdateType(HPhi* phi);
50 GrowableArray<HPhi*> worklist_;
57 bool DeadPhiHandling::UpdateType(HPhi* phi) { in UpdateType()
73 Primitive::Type input_type = HPhi::ToPhiType(input->GetType()); in UpdateType()
122 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
140 HPhi* instruction = worklist_.Pop(); in ProcessWorklist()
150 void DeadPhiHandling::AddToWorklist(HPhi* instruction) { in AddToWorklist()
155 void DeadPhiHandling::AddDependentInstructionsToWorklist(HPhi* instruction) { in AddDependentInstructionsToWorklist()
[all …]
Dprimitive_type_propagation.cc36 : HPhi::ToPhiType(new_type); in MergeTypes()
42 bool PrimitiveTypePropagation::UpdateType(HPhi* phi) { in UpdateType()
90 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
102 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
112 HPhi* instruction = worklist_.Pop(); in ProcessWorklist()
119 void PrimitiveTypePropagation::AddToWorklist(HPhi* instruction) { in AddToWorklist()
126 HPhi* phi = it.Current()->GetUser()->AsPhi(); in AddDependentInstructionsToWorklist()
Dprimitive_type_propagation.h35 void AddToWorklist(HPhi* phi);
37 bool UpdateType(HPhi* phi);
40 GrowableArray<HPhi*> worklist_;
Dssa_phi_elimination.h43 GrowableArray<HPhi*> worklist_;
67 GrowableArray<HPhi*> worklist_;
Dssa_phi_elimination.cc31 HPhi* phi = inst_it.Current()->AsPhi(); in MarkDeadPhis()
48 HPhi* phi = worklist_.Pop(); in MarkDeadPhis()
67 HPhi* phi; in EliminateDeadPhis()
110 HPhi* phi = worklist_.Pop(); in Run()
Dreference_type_propagation.h50 void VisitPhi(HPhi* phi);
54 void UpdatePhi(HPhi* phi) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_);
Dssa_builder.h94 static HPhi* GetFloatDoubleOrReferenceEquivalentOfPhi(HPhi* phi, Primitive::Type type);
Dbounds_check_elimination_test.cc397 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); in BuildSSAGraph1()
537 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); in BuildSSAGraph2()
661 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); in BuildSSAGraph3()
776 HPhi* phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); in BuildSSAGraph4()
889 HPhi* phi_i = new (&allocator) HPhi(&allocator, 0, 0, Primitive::kPrimInt); in TEST()
905 HPhi* phi_j = new (&allocator) HPhi(&allocator, 0, 0, Primitive::kPrimInt); in TEST()
Dreference_type_propagation.cc202 void ReferenceTypePropagation::VisitPhi(HPhi* phi) { in VisitPhi()
276 void ReferenceTypePropagation::UpdatePhi(HPhi* instr) { in UpdatePhi()
305 HPhi* phi = instr->AsPhi(); in UpdateNullability()
Dgraph_checker.h117 void VisitPhi(HPhi* phi) OVERRIDE;
Dregister_allocator_test.cc316 HPhi* phi = loop_header->GetFirstPhi()->AsPhi(); in TEST()
463 HPhi** phi, in BuildIfElseWithPhi()
495 *phi = new (allocator) HPhi(allocator, 0, 0, Primitive::kPrimInt); in BuildIfElseWithPhi()
515 HPhi *phi; in TEST()
806 HPhi* user = new (&allocator) HPhi(&allocator, 0, 1, Primitive::kPrimInt); in TEST()
Dnodes.cc487 void HBasicBlock::AddPhi(HPhi* phi) { in AddPhi()
518 void HBasicBlock::InsertPhiAfter(HPhi* phi, HPhi* cursor) { in InsertPhiAfter()
547 void HBasicBlock::RemovePhi(HPhi* phi, bool ensure_safety) { in RemovePhi()
769 void HPhi::AddInput(HInstruction* input) { in AddInput()
775 void HPhi::RemoveInputAt(size_t index) { in RemoveInputAt()
1071 HPhi* phi = phi_it.Current()->AsPhi(); in DisconnectAndDelete()
1274 return_value = new (allocator) HPhi( in InlineInto()
1275 allocator, kNoRegNumber, 0, HPhi::ToPhiType(invoke->GetType())); in InlineInto()
Dlive_ranges_test.cc344 HPhi* phi = liveness.GetInstructionFromSsaIndex(1)->AsPhi(); in TEST()
448 HPhi* phi = liveness.GetInstructionFromSsaIndex(4)->AsPhi(); in TEST()
Dboolean_simplifier.cc115 HPhi* phi = merge_block->GetFirstPhi()->AsPhi(); in TryRemovingBooleanSelection()
Dgraph_checker.cc299 HPhi* phi = it.Current()->AsPhi(); in VisitBasicBlock()
444 void SSAChecker::VisitPhi(HPhi* phi) { in VisitPhi()
492 if (phi->GetType() != HPhi::ToPhiType(phi->GetType())) { in VisitPhi()
Dbounds_check_elimination.cc494 HPhi* induction_variable, in MonotonicValueRange()
975 HPhi* phi = new (graph->GetArena()) HPhi( in AddDeoptimizationArrayLength()
1086 HPhi* const induction_variable_; // Induction variable for this monotonic value range.
1466 static bool HasSameInputAtBackEdges(HPhi* phi) { in HasSameInputAtBackEdges()
1482 void VisitPhi(HPhi* phi) { in VisitPhi()
Dnodes.h47 class HPhi; variable
690 void AddPhi(HPhi* phi);
691 void InsertPhiAfter(HPhi* instruction, HPhi* cursor);
696 void RemovePhi(HPhi* phi, bool ensure_safety = true);
3024 class HPhi : public HInstruction {
3026 HPhi(ArenaAllocator* arena, uint32_t reg_number, size_t number_of_inputs, Primitive::Type type) in HPhi() function
3070 HPhi* GetNextEquivalentPhiWithSameType() { in GetNextEquivalentPhiWithSameType()
3097 DISALLOW_COPY_AND_ASSIGN(HPhi);
Dgraph_visualizer.cc192 void VisitPhi(HPhi* phi) OVERRIDE { in VisitPhi()
Dcode_generator_arm64.cc2434 void LocationsBuilderARM64::VisitPhi(HPhi* instruction) { in VisitPhi()
2442 void InstructionCodeGeneratorARM64::VisitPhi(HPhi* instruction) { in VisitPhi()
Dcode_generator_mips64.cc2842 void LocationsBuilderMIPS64::VisitPhi(HPhi* instruction) { in VisitPhi()
2850 void InstructionCodeGeneratorMIPS64::VisitPhi(HPhi* instruction ATTRIBUTE_UNUSED) { in VisitPhi()
Dcode_generator_arm.cc2769 void LocationsBuilderARM::VisitPhi(HPhi* instruction) { in VisitPhi()
2778 void InstructionCodeGeneratorARM::VisitPhi(HPhi* instruction) { in VisitPhi()
Dcode_generator_x86_64.cc3116 void LocationsBuilderX86_64::VisitPhi(HPhi* instruction) { in VisitPhi()
3125 void InstructionCodeGeneratorX86_64::VisitPhi(HPhi* instruction) { in VisitPhi()
Dcode_generator_x86.cc3159 void LocationsBuilderX86::VisitPhi(HPhi* instruction) { in VisitPhi()
3168 void InstructionCodeGeneratorX86::VisitPhi(HPhi* instruction) { in VisitPhi()