Lines Matching refs:graph
89 HGraph* graph = CreateCFG(data); in TestCode() local
91 RemoveSuspendChecks(graph); in TestCode()
93 RunCode(target_config, *compiler_options_, graph, [](HGraph*) {}, has_result, expected); in TestCode()
101 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); in TestCodeLong() local
103 RemoveSuspendChecks(graph); in TestCodeLong()
105 RunCode(target_config, *compiler_options_, graph, [](HGraph*) {}, has_result, expected); in TestCodeLong()
421 HGraph* graph = CreateGraph(); in TEST_F() local
423 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
424 graph->AddBlock(entry); in TEST_F()
425 graph->SetEntryBlock(entry); in TEST_F()
428 HBasicBlock* first_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
429 graph->AddBlock(first_block); in TEST_F()
431 HIntConstant* constant0 = graph->GetIntConstant(0); in TEST_F()
432 HIntConstant* constant1 = graph->GetIntConstant(1); in TEST_F()
437 HBasicBlock* then_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
438 HBasicBlock* else_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
439 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
440 graph->SetExitBlock(exit_block); in TEST_F()
442 graph->AddBlock(then_block); in TEST_F()
443 graph->AddBlock(else_block); in TEST_F()
444 graph->AddBlock(exit_block); in TEST_F()
455 graph->BuildDominatorTree(); in TEST_F()
456 PrepareForRegisterAllocation(graph, *compiler_options_).Run(); in TEST_F()
466 RunCode(target_config, *compiler_options_, graph, hook_before_codegen, true, 0); in TEST_F()
482 HGraph* graph = CreateGraph(); in TEST_F() local
484 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
485 graph->AddBlock(entry_block); in TEST_F()
486 graph->SetEntryBlock(entry_block); in TEST_F()
488 HBasicBlock* code_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
489 graph->AddBlock(code_block); in TEST_F()
490 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
491 graph->AddBlock(exit_block); in TEST_F()
496 graph->SetExitBlock(exit_block); in TEST_F()
498 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); in TEST_F()
499 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); in TEST_F()
505 graph->BuildDominatorTree(); in TEST_F()
513 RunCode(target_config, *compiler_options_, graph, hook_before_codegen, true, lhs[i] < rhs[i]); in TEST_F()
530 HGraph* graph = CreateGraph(); in TEST_F() local
532 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
533 graph->AddBlock(entry_block); in TEST_F()
534 graph->SetEntryBlock(entry_block); in TEST_F()
537 HBasicBlock* if_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
538 graph->AddBlock(if_block); in TEST_F()
539 HBasicBlock* if_true_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
540 graph->AddBlock(if_true_block); in TEST_F()
541 HBasicBlock* if_false_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
542 graph->AddBlock(if_false_block); in TEST_F()
543 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
544 graph->AddBlock(exit_block); in TEST_F()
547 graph->SetEntryBlock(entry_block); in TEST_F()
553 graph->SetExitBlock(exit_block); in TEST_F()
555 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); in TEST_F()
556 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); in TEST_F()
566 HIntConstant* cst_lt = graph->GetIntConstant(1); in TEST_F()
569 HIntConstant* cst_ge = graph->GetIntConstant(0); in TEST_F()
573 graph->BuildDominatorTree(); in TEST_F()
581 RunCode(target_config, *compiler_options_, graph, hook_before_codegen, true, lhs[i] < rhs[i]); in TEST_F()
611 HGraph* graph = CreateGraph(); in TestComparison() local
613 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
614 graph->AddBlock(entry_block); in TestComparison()
615 graph->SetEntryBlock(entry_block); in TestComparison()
618 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
619 graph->AddBlock(block); in TestComparison()
621 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
622 graph->AddBlock(exit_block); in TestComparison()
623 graph->SetExitBlock(exit_block); in TestComparison()
632 op1 = graph->GetIntConstant(i); in TestComparison()
633 op2 = graph->GetIntConstant(j); in TestComparison()
636 op1 = graph->GetLongConstant(i); in TestComparison()
637 op2 = graph->GetLongConstant(j); in TestComparison()
689 graph->BuildDominatorTree(); in TestComparison()
691 RunCode(target_config, *compiler_options_, graph, [](HGraph*) {}, true, expected_result); in TestComparison()
723 HGraph* graph = CreateGraph(); in TEST_F() local
724 arm::CodeGeneratorARMVIXL codegen(graph, *compiler_options_); in TEST_F()
732 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
746 HGraph* graph = CreateGraph(); in TEST_F() local
747 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options_); in TEST_F()
777 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
795 HGraph* graph = CreateGraph(); in TEST_F() local
796 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options_); in TEST_F()
800 graph->SetHasSIMD(true); in TEST_F()
802 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
820 graph->SetHasSIMD(false); in TEST_F()
830 HGraph* graph = CreateGraph(); in TEST_F() local
831 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options_); in TEST_F()
843 HGraph* graph = CreateGraph(); in TEST_F() local
844 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options_); in TEST_F()
865 HGraph* graph = CreateGraph(); in TEST_F() local
867 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
868 graph->AddBlock(entry_block); in TEST_F()
869 graph->SetEntryBlock(entry_block); in TEST_F()
872 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
873 graph->AddBlock(block); in TEST_F()
875 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
876 graph->AddBlock(exit_block); in TEST_F()
877 graph->SetExitBlock(exit_block); in TEST_F()
891 graph->BuildDominatorTree(); in TEST_F()
893 mips::CodeGeneratorMIPS codegenMIPS(graph, *compiler_options_); in TEST_F()
912 RunCode(&codegenMIPS, graph, [](HGraph*) {}, false, 0); in TEST_F()