/art/compiler/optimizing/ |
D | code_generator.cc | 978 std::unique_ptr<CodeGenerator> CodeGenerator::Create(HGraph* graph, in Create() argument 981 ArenaAllocator* allocator = graph->GetAllocator(); in Create() 987 new (allocator) arm::CodeGeneratorARMVIXL(graph, compiler_options, stats)); in Create() 993 new (allocator) arm64::CodeGeneratorARM64(graph, compiler_options, stats)); in Create() 999 new (allocator) x86::CodeGeneratorX86(graph, compiler_options, stats)); in Create() 1005 new (allocator) x86_64::CodeGeneratorX86_64(graph, compiler_options, stats)); in Create() 1013 CodeGenerator::CodeGenerator(HGraph* graph, in CodeGenerator() argument 1026 blocked_core_registers_(graph->GetAllocator()->AllocArray<bool>(number_of_core_registers, in CodeGenerator() 1028 blocked_fpu_registers_(graph->GetAllocator()->AllocArray<bool>(number_of_fpu_registers, in CodeGenerator() 1038 graph_(graph), in CodeGenerator() [all …]
|
D | block_builder.h | 30 HBasicBlockBuilder(HGraph* graph,
|
D | constant_folding.cc | 25 explicit HConstantFoldingVisitor(HGraph* graph) in HConstantFoldingVisitor() argument 26 : HGraphDelegateVisitor(graph) {} in HConstantFoldingVisitor() 45 explicit InstructionWithAbsorbingInputSimplifier(HGraph* graph) : HGraphVisitor(graph) {} in InstructionWithAbsorbingInputSimplifier() argument
|
D | gvn.cc | 356 GlobalValueNumberer(HGraph* graph, in GlobalValueNumberer() argument 358 : graph_(graph), in GlobalValueNumberer() 359 allocator_(graph->GetArenaStack()), in GlobalValueNumberer() 361 sets_(graph->GetBlocks().size(), nullptr, allocator_.Adapter(kArenaAllocGvn)), in GlobalValueNumberer() 363 &allocator_, graph->GetBlocks().size(), /* expandable= */ false, kArenaAllocGvn) { in GlobalValueNumberer()
|
D | reference_type_propagation.h | 33 ReferenceTypePropagation(HGraph* graph,
|
D | code_generator_arm64.h | 288 InstructionCodeGeneratorARM64(HGraph* graph, CodeGeneratorARM64* codegen); 409 LocationsBuilderARM64(HGraph* graph, CodeGeneratorARM64* codegen) in LocationsBuilderARM64() argument 410 : HGraphVisitor(graph), codegen_(codegen) {} in LocationsBuilderARM64() 442 InstructionCodeGeneratorARM64Neon(HGraph* graph, CodeGeneratorARM64* codegen) : in InstructionCodeGeneratorARM64Neon() argument 443 InstructionCodeGeneratorARM64(graph, codegen) {} in InstructionCodeGeneratorARM64Neon() 462 LocationsBuilderARM64Neon(HGraph* graph, CodeGeneratorARM64* codegen) : in LocationsBuilderARM64Neon() argument 463 LocationsBuilderARM64(graph, codegen) {} in LocationsBuilderARM64Neon() 475 InstructionCodeGeneratorARM64Sve(HGraph* graph, CodeGeneratorARM64* codegen) : in InstructionCodeGeneratorARM64Sve() argument 476 InstructionCodeGeneratorARM64(graph, codegen) {} in InstructionCodeGeneratorARM64Sve() 495 LocationsBuilderARM64Sve(HGraph* graph, CodeGeneratorARM64* codegen) : in LocationsBuilderARM64Sve() argument [all …]
|
D | ssa_liveness_analysis_test.cc | 46 HGraph* graph = block->GetGraph(); in CreateSuccessor() local 47 HBasicBlock* successor = new (GetAllocator()) HBasicBlock(graph); in CreateSuccessor() 48 graph->AddBlock(successor); in CreateSuccessor()
|
D | load_store_analysis.h | 197 explicit HeapLocationCollector(HGraph* graph, ScopedArenaAllocator* allocator) in HeapLocationCollector() argument 198 : HGraphVisitor(graph), in HeapLocationCollector() 606 explicit LoadStoreAnalysis(HGraph* graph, ScopedArenaAllocator* local_allocator) in LoadStoreAnalysis() argument 607 : graph_(graph), in LoadStoreAnalysis() 608 heap_location_collector_(graph, local_allocator) {} in LoadStoreAnalysis()
|
D | dead_code_elimination.cc | 28 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { in MarkReachableBlocks() argument 30 ScopedArenaAllocator allocator(graph->GetArenaStack()); in MarkReachableBlocks() 35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks() 36 worklist.push_back(graph->GetEntryBlock()); in MarkReachableBlocks()
|
D | code_generator.h | 189 static std::unique_ptr<CodeGenerator> Create(HGraph* graph, 717 CodeGenerator(HGraph* graph, 926 SlowPathGenerator(HGraph* graph, CodeGenerator* codegen) in SlowPathGenerator() argument 927 : graph_(graph), in SlowPathGenerator() 930 graph->GetAllocator()->Adapter(kArenaAllocSlowPaths)) {} in SlowPathGenerator() 1021 InstructionCodeGenerator(HGraph* graph, CodeGenerator* codegen) in InstructionCodeGenerator() argument 1022 : HGraphVisitor(graph), in InstructionCodeGenerator() 1023 deopt_slow_paths_(graph, codegen) {} in InstructionCodeGenerator()
|
D | graph_visualizer.h | 103 HGraph* graph,
|
D | select_generator.cc | 26 HSelectGenerator::HSelectGenerator(HGraph* graph, in HSelectGenerator() argument 29 : HOptimization(graph, name, stats) { in HSelectGenerator()
|
D | instruction_simplifier_arm.cc | 36 InstructionSimplifierArmVisitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArmVisitor() argument 37 : HGraphVisitor(graph), stats_(stats) {} in InstructionSimplifierArmVisitor()
|
D | instruction_simplifier_arm64.cc | 36 InstructionSimplifierArm64Visitor(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm64Visitor() argument 37 : HGraphVisitor(graph), stats_(stats) {} in InstructionSimplifierArm64Visitor()
|
D | bounds_check_elimination.cc | 510 BCEVisitor(HGraph* graph, in BCEVisitor() argument 513 : HGraphVisitor(graph), in BCEVisitor() 514 allocator_(graph->GetArenaStack()), in BCEVisitor() 515 maps_(graph->GetBlocks().size(), in BCEVisitor() 528 initial_block_size_(graph->GetBlocks().size()), in BCEVisitor() 1977 HGraph* graph = GetGraph(); in NewPhi() local 1980 case DataType::Type::kReference: zero = graph->GetNullConstant(); break; in NewPhi() 1981 case DataType::Type::kFloat32: zero = graph->GetFloatConstant(0); break; in NewPhi() 1982 case DataType::Type::kFloat64: zero = graph->GetDoubleConstant(0); break; in NewPhi() 1983 default: zero = graph->GetConstant(type, 0); break; in NewPhi() [all …]
|
D | block_builder.cc | 27 HBasicBlockBuilder::HBasicBlockBuilder(HGraph* graph, in HBasicBlockBuilder() argument 31 : allocator_(graph->GetAllocator()), in HBasicBlockBuilder() 32 graph_(graph), in HBasicBlockBuilder()
|
D | ssa_liveness_analysis.h | 1175 SsaLivenessAnalysis(HGraph* graph, CodeGenerator* codegen, ScopedArenaAllocator* allocator) in SsaLivenessAnalysis() argument 1176 : graph_(graph), in SsaLivenessAnalysis() 1179 block_infos_(graph->GetBlocks().size(), in SsaLivenessAnalysis() 1286 HGraph* graph = instruction->GetBlock()->GetGraph(); in ShouldBeLiveForEnvironment() local 1287 if (graph->IsDebuggable()) return true; in ShouldBeLiveForEnvironment() 1290 if (env_holder->IsSuspendCheck() && graph->IsCompilingOsr()) return true; in ShouldBeLiveForEnvironment() 1291 if (graph -> IsDeadReferenceSafe()) return false; in ShouldBeLiveForEnvironment()
|
D | code_generator_x86.h | 177 LocationsBuilderX86(HGraph* graph, CodeGeneratorX86* codegen) in LocationsBuilderX86() argument 178 : HGraphVisitor(graph), codegen_(codegen) {} in LocationsBuilderX86() 212 InstructionCodeGeneratorX86(HGraph* graph, CodeGeneratorX86* codegen); 348 CodeGeneratorX86(HGraph* graph,
|
D | code_generator_x86_64.h | 181 LocationsBuilderX86_64(HGraph* graph, CodeGeneratorX86_64* codegen) in LocationsBuilderX86_64() argument 182 : HGraphVisitor(graph), codegen_(codegen) {} in LocationsBuilderX86_64() 216 InstructionCodeGeneratorX86_64(HGraph* graph, CodeGeneratorX86_64* codegen); 331 CodeGeneratorX86_64(HGraph* graph,
|
D | scheduler_test.cc | 185 HGraph* graph = CreateCFG(data); in CompileWithRandomSchedulerAndRun() local 188 HInstructionScheduling scheduling(graph, target_config.GetInstructionSet()); in CompileWithRandomSchedulerAndRun() 195 graph, in CompileWithRandomSchedulerAndRun()
|
D | load_store_elimination.cc | 89 LSEVisitor(HGraph* graph, in LSEVisitor() argument 93 : HGraphDelegateVisitor(graph, stats), in LSEVisitor() 96 allocator_(graph->GetArenaStack()), in LSEVisitor() 97 heap_values_for_(graph->GetBlocks().size(), in LSEVisitor()
|
D | induction_var_analysis.cc | 230 HInductionVarAnalysis::HInductionVarAnalysis(HGraph* graph, const char* name) in HInductionVarAnalysis() argument 231 : HOptimization(graph, name), in HInductionVarAnalysis() 233 stack_(graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis() 235 graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis() 236 scc_(graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis() 238 graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis() 241 graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)), in HInductionVarAnalysis() 243 graph->GetAllocator()->Adapter(kArenaAllocInductionVarAnalysis)) { in HInductionVarAnalysis()
|
D | reference_type_propagation.cc | 45 RTPVisitor(HGraph* graph, in RTPVisitor() argument 49 : HGraphDelegateVisitor(graph), in RTPVisitor() 52 allocator_(graph->GetArenaStack()), in RTPVisitor() 117 ReferenceTypePropagation::ReferenceTypePropagation(HGraph* graph, in ReferenceTypePropagation() argument 122 : HOptimization(graph, name), in ReferenceTypePropagation()
|
D | graph_visualizer.cc | 183 HGraphVisualizerPrinter(HGraph* graph, in HGraphVisualizerPrinter() argument 190 : HGraphDelegateVisitor(graph), in HGraphVisualizerPrinter() 894 HGraph* graph, in HGraphVisualizer() argument 896 : output_(output), graph_(graph), codegen_(codegen) {} in HGraphVisualizer()
|
/art/test/498-type-propagation/smali/ |
D | TypePropagation.smali | 22 # When building the SSA graph, we will create a phi for v0, which will be of type
|