| /art/compiler/optimizing/ |
| ssa_builder.h | 64 locals = new (GetGraph()->GetArena()) GrowableArray<HInstruction*>(
65 GetGraph()->GetArena(), GetGraph()->GetNumberOfVRegs());
66 locals->SetSize(GetGraph()->GetNumberOfVRegs());
|
| ssa_builder.cc | 179 for (HReversePostOrderIterator itb(*GetGraph()); !itb.Done(); itb.Advance()) {
204 equality_instr->ReplaceInput(GetGraph()->GetNullConstant(), int_operand == right ? 1 : 0);
211 for (HReversePostOrderIterator itb(*GetGraph()); !itb.Done(); itb.Advance()) {
235 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
257 SsaDeadPhiElimination dead_phis_for_type_propagation(GetGraph());
263 PrimitiveTypePropagation type_propagation(GetGraph());
274 SsaDeadPhiElimination dead_phis(GetGraph());
282 SsaRedundantPhiElimination redundant_phi(GetGraph());
298 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
322 if (GetGraph()->IsDebuggable())
[all...] |
| locations.cc | 26 : inputs_(instruction->GetBlock()->GetGraph()->GetArena(), instruction->InputCount()),
27 temps_(instruction->GetBlock()->GetGraph()->GetArena(), 0),
41 ArenaAllocator* arena = instruction->GetBlock()->GetGraph()->GetArena();
|
| instruction_simplifier.cc | 81 for (HReversePostOrderIterator it(*GetGraph()); !it.Done();) {
128 HNeg* neg = new (GetGraph()->GetArena()) HNeg(binop->GetType(), binop);
153 HAdd *add = new(GetGraph()->GetArena()) HAdd(instruction->GetType(),
234 equal, new (block->GetGraph()->GetArena()) HBooleanNot(input_value));
252 not_equal, new (block->GetGraph()->GetArena()) HBooleanNot(input_value));
350 HSub* sub = new(GetGraph()->GetArena()) HSub(instruction->GetType(), other, neg->GetInput());
405 instruction, new (GetGraph()->GetArena()) HNeg(type, input_other));
419 reciprocal = GetGraph()->GetDoubleConstant(1.0 / value);
425 reciprocal = GetGraph()->GetFloatConstant(1.0f / value);
431 instruction, new (GetGraph()->GetArena()) HMul(type, input_other, reciprocal))
[all...] |
| bounds_check_elimination.cc | 795 HGraph* graph = header->GetGraph();
817 HGraph* graph = header->GetGraph();
852 HGraph* graph = header->GetGraph();
[all...] |
| code_generator_arm64.cc | [all...] |
| code_generator_mips64.cc | [all...] |
| intrinsics.h | 100 HParallelMove parallel_move(codegen->GetGraph()->GetArena());
|
| prepare_for_register_allocation.cc | 23 for (HReversePostOrderIterator it(*GetGraph()); !it.Done(); it.Advance()) {
|
| constant_folding.cc | 176 instruction->ReplaceWith(GetGraph()->GetConstant(type, 0));
209 instruction->ReplaceWith(GetGraph()->GetConstant(type, 0));
226 instruction->ReplaceWith(GetGraph()->GetConstant(type, 0));
|
| code_generator_arm.cc | [all...] |
| nodes.cc | 391 HGraph* graph = header_->GetGraph();
478 instruction->SetId(block->GetGraph()->GetNextInstructionId());
499 instruction->SetId(GetGraph()->GetNextInstructionId());
513 instruction->SetId(GetGraph()->GetNextInstructionId());
523 phi->SetId(GetGraph()->GetNextInstructionId());
820 return GetBlock()->GetGraph()->GetIntConstant(value);
836 return GetBlock()->GetGraph()->GetIntConstant(value);
841 return GetBlock()->GetGraph()->GetLongConstant(value);
844 return GetBlock()->GetGraph()->GetIntConstant(static_cast<int32_t>(value));
931 HBasicBlock* new_block = new (GetGraph()->GetArena()) HBasicBlock(GetGraph(), GetDexPc())
[all...] |
| code_generator_x86_64.cc | 863 new (GetGraph()->GetArena()) LocationSummary(if_instr, LocationSummary::kNoCall);
886 LocationSummary* locations = new (GetGraph()->GetArena())
896 SlowPathCodeX86_64* slow_path = new (GetGraph()->GetArena())
[all...] |
| code_generator_x86.cc | 900 new (GetGraph()->GetArena()) LocationSummary(if_instr, LocationSummary::kNoCall);
[all...] |
| boolean_simplifier.cc | 66 HGraph* graph = cond->GetBlock()->GetGraph();
|
| code_generator.cc | 129 InitializeCodeGeneration(GetGraph()->GetNumberOfLocalVRegs()
130 + GetGraph()->GetTemporariesVRegSlots()
134 GetGraph()->GetMaximumNumberOfOutVRegs()
136 GetGraph()->GetBlocks());
239 DCHECK(block_order_->Get(0) == GetGraph()->GetEntryBlock());
262 uint16_t number_of_locals = GetGraph()->GetNumberOfLocalVRegs();
276 uint16_t number_of_locals = GetGraph()->GetNumberOfLocalVRegs();
[all...] |
| register_allocator.cc | 76 codegen->GetGraph()->GetMaximumNumberOfOutVRegs();
109 for (HLinearOrderIterator it(*codegen_->GetGraph()); !it.Done(); it.Advance()) {
153 for (HLinearPostOrderIterator it(*codegen_->GetGraph()); !it.Done(); it.Advance()) {
[all...] |
| graph_checker.cc | 125 if (!GetGraph()->HasBoundsChecks()) {
372 HBasicBlock* loop_block = GetGraph()->GetBlocks().Get(i);
|
| code_generator_arm.h | 283 block_labels_.SetSize(GetGraph()->GetBlocks().Size());
|
| code_generator_mips64.h | 261 block_labels_.SetSize(GetGraph()->GetBlocks().Size());
|
| code_generator_x86.h | 274 block_labels_.SetSize(GetGraph()->GetBlocks().Size());
|
| code_generator_x86_64.h | 265 block_labels_.SetSize(GetGraph()->GetBlocks().Size());
|
| code_generator.h | 139 HGraph* GetGraph() const { return graph_; }
|
| code_generator_arm64.h | 309 HGraph* graph = GetGraph();
|
| nodes.h | 533 HGraph* GetGraph() const { return graph_; }
[all...] |
