Lines Matching refs:graph
81 HGraph* graph = CreateCFG(data); in TestCode() local
83 RemoveSuspendChecks(graph); in TestCode()
86 RunCode(target_config, *compiler_options, graph, [](HGraph*) {}, has_result, expected); in TestCode()
94 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); in TestCodeLong() local
96 RemoveSuspendChecks(graph); in TestCodeLong()
99 RunCode(target_config, *compiler_options, graph, [](HGraph*) {}, has_result, expected); in TestCodeLong()
415 HGraph* graph = CreateGraph(); in TEST_F() local
417 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
418 graph->AddBlock(entry); in TEST_F()
419 graph->SetEntryBlock(entry); in TEST_F()
422 HBasicBlock* first_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
423 graph->AddBlock(first_block); in TEST_F()
425 HIntConstant* constant0 = graph->GetIntConstant(0); in TEST_F()
426 HIntConstant* constant1 = graph->GetIntConstant(1); in TEST_F()
431 HBasicBlock* then_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
432 HBasicBlock* else_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
433 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
434 graph->SetExitBlock(exit_block); in TEST_F()
436 graph->AddBlock(then_block); in TEST_F()
437 graph->AddBlock(else_block); in TEST_F()
438 graph->AddBlock(exit_block); in TEST_F()
449 graph->BuildDominatorTree(); in TEST_F()
452 PrepareForRegisterAllocation(graph, *compiler_options).Run(); in TEST_F()
461 RunCode(target_config, *compiler_options, graph, hook_before_codegen, true, 0); in TEST_F()
477 HGraph* graph = CreateGraph(); in TEST_F() local
479 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
480 graph->AddBlock(entry_block); in TEST_F()
481 graph->SetEntryBlock(entry_block); in TEST_F()
483 HBasicBlock* code_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
484 graph->AddBlock(code_block); in TEST_F()
485 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
486 graph->AddBlock(exit_block); in TEST_F()
491 graph->SetExitBlock(exit_block); in TEST_F()
493 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); in TEST_F()
494 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); in TEST_F()
500 graph->BuildDominatorTree(); in TEST_F()
509 RunCode(target_config, *compiler_options, graph, hook_before_codegen, true, lhs[i] < rhs[i]); in TEST_F()
526 HGraph* graph = CreateGraph(); in TEST_F() local
528 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
529 graph->AddBlock(entry_block); in TEST_F()
530 graph->SetEntryBlock(entry_block); in TEST_F()
533 HBasicBlock* if_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
534 graph->AddBlock(if_block); in TEST_F()
535 HBasicBlock* if_true_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
536 graph->AddBlock(if_true_block); in TEST_F()
537 HBasicBlock* if_false_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
538 graph->AddBlock(if_false_block); in TEST_F()
539 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F()
540 graph->AddBlock(exit_block); in TEST_F()
543 graph->SetEntryBlock(entry_block); in TEST_F()
549 graph->SetExitBlock(exit_block); in TEST_F()
551 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); in TEST_F()
552 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); in TEST_F()
562 HIntConstant* cst_lt = graph->GetIntConstant(1); in TEST_F()
565 HIntConstant* cst_ge = graph->GetIntConstant(0); in TEST_F()
569 graph->BuildDominatorTree(); in TEST_F()
578 RunCode(target_config, *compiler_options, graph, hook_before_codegen, true, lhs[i] < rhs[i]); in TEST_F()
608 HGraph* graph = CreateGraph(); in TestComparison() local
610 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
611 graph->AddBlock(entry_block); in TestComparison()
612 graph->SetEntryBlock(entry_block); in TestComparison()
615 HBasicBlock* block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
616 graph->AddBlock(block); in TestComparison()
618 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph); in TestComparison()
619 graph->AddBlock(exit_block); in TestComparison()
620 graph->SetExitBlock(exit_block); in TestComparison()
629 op1 = graph->GetIntConstant(i); in TestComparison()
630 op2 = graph->GetIntConstant(j); in TestComparison()
633 op1 = graph->GetLongConstant(i); in TestComparison()
634 op2 = graph->GetLongConstant(j); in TestComparison()
686 graph->BuildDominatorTree(); in TestComparison()
689 RunCode(target_config, *compiler_options, graph, [](HGraph*) {}, true, expected_result); in TestComparison()
722 HGraph* graph = CreateGraph(); in TEST_F() local
723 arm::CodeGeneratorARMVIXL codegen(graph, *compiler_options); in TEST_F()
731 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()
796 HGraph* graph = CreateGraph(); in TEST_F() local
797 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options); in TEST_F()
801 graph->SetHasSIMD(true); in TEST_F()
803 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
821 graph->SetHasSIMD(false); in TEST_F()
832 HGraph* graph = CreateGraph(); in TEST_F() local
833 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options); in TEST_F()
847 HGraph* graph = CreateGraph(); in TEST_F() local
848 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options); in TEST_F()
866 HGraph* graph = CreateGraph(); in TEST_F() local
867 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options); in TEST_F()
870 graph->SetHasSIMD(true); in TEST_F()
886 HGraph* graph = CreateGraph(); in TEST_F() local
887 arm64::CodeGeneratorARM64 codegen(graph, *compiler_options); in TEST_F()
890 graph->SetHasSIMD(false); in TEST_F()