Home
last modified time | relevance | path

Searched refs:AddBlock (Results 1 – 25 of 32) sorted by relevance

12

/aosp12/art/compiler/optimizing/
H A Dbounds_check_elimination_test.cc68 graph_->AddBlock(entry); in TEST_F()
81 graph_->AddBlock(block1); in TEST_F()
89 graph_->AddBlock(block2); in TEST_F()
102 graph_->AddBlock(block3); in TEST_F()
139 graph_->AddBlock(exit); in TEST_F()
165 graph_->AddBlock(entry); in TEST_F()
210 graph_->AddBlock(exit); in TEST_F()
277 graph_->AddBlock(exit); in TEST_F()
385 graph->AddBlock(exit); in BuildSSAGraph1()
505 graph->AddBlock(exit); in BuildSSAGraph2()
[all …]
H A Dgvn_test.cc32 graph->AddBlock(entry); in TEST_F()
41 graph->AddBlock(block); in TEST_F()
113 graph->AddBlock(entry); in TEST_F()
122 graph->AddBlock(block); in TEST_F()
138 graph->AddBlock(then); in TEST_F()
139 graph->AddBlock(else_); in TEST_F()
140 graph->AddBlock(join); in TEST_F()
192 graph->AddBlock(entry); in TEST_F()
202 graph->AddBlock(block); in TEST_F()
221 graph->AddBlock(exit); in TEST_F()
[all …]
H A Dloop_optimization_test.cc61 graph_->AddBlock(entry_block_); in BuildGraph()
62 graph_->AddBlock(return_block_); in BuildGraph()
63 graph_->AddBlock(exit_block_); in BuildGraph()
81 graph_->AddBlock(header); in AddLoop()
82 graph_->AddBlock(body); in AddLoop()
223 graph_->AddBlock(header); in TEST_F()
224 graph_->AddBlock(body); in TEST_F()
275 graph_->AddBlock(if_block); in TEST_F()
276 graph_->AddBlock(preheader0); in TEST_F()
277 graph_->AddBlock(preheader1); in TEST_F()
H A Dlicm_test.cc57 graph_->AddBlock(entry_); in BuildLoop()
58 graph_->AddBlock(loop_preheader_); in BuildLoop()
59 graph_->AddBlock(loop_header_); in BuildLoop()
60 graph_->AddBlock(loop_body_); in BuildLoop()
61 graph_->AddBlock(return_); in BuildLoop()
62 graph_->AddBlock(exit_); in BuildLoop()
H A Dblock_builder.cc148 graph_->AddBlock(block); in ConnectBasicBlocks()
170 graph_->AddBlock(block); in ConnectBasicBlocks()
204 graph_->AddBlock(block); in ConnectBasicBlocks()
221 graph_->AddBlock(graph_->GetExitBlock()); in ConnectBasicBlocks()
342 graph_->AddBlock(new_catch_block); in InsertTryBoundaryBlocks()
431 graph_->AddBlock(loop_block); in InsertSynthesizedLoopsForOsr()
475 graph_->AddBlock(entry_block); in BuildIntrinsic()
476 graph_->AddBlock(body); in BuildIntrinsic()
477 graph_->AddBlock(exit_block); in BuildIntrinsic()
H A Dnodes_test.cc147 graph->AddBlock(entry); in TEST_F()
155 graph->AddBlock(first_block); in TEST_F()
162 graph->AddBlock(exit_block); in TEST_F()
187 graph->AddBlock(entry); in TEST_F()
212 graph->AddBlock(entry); in TEST_F()
230 graph->AddBlock(entry); in TEST_F()
H A Dcodegen_test.cc418 graph->AddBlock(entry); in TEST_F()
423 graph->AddBlock(first_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()
484 graph->AddBlock(code_block); in TEST_F()
486 graph->AddBlock(exit_block); in TEST_F()
534 graph->AddBlock(if_block); in TEST_F()
611 graph->AddBlock(entry_block); in TestComparison()
616 graph->AddBlock(block); in TestComparison()
[all …]
H A Dregister_allocator_test.cc493 graph->AddBlock(entry); in BuildIfElseWithPhi()
500 graph->AddBlock(block); in BuildIfElseWithPhi()
517 graph->AddBlock(then); in BuildIfElseWithPhi()
518 graph->AddBlock(else_); in BuildIfElseWithPhi()
519 graph->AddBlock(join); in BuildIfElseWithPhi()
643 graph->AddBlock(entry); in BuildFieldReturn()
650 graph->AddBlock(block); in BuildFieldReturn()
667 graph->AddBlock(exit); in BuildFieldReturn()
719 graph->AddBlock(entry); in BuildTwoSubs()
729 graph->AddBlock(block); in BuildTwoSubs()
[all …]
H A Dgraph_test.cc38 graph->AddBlock(if_block); in CreateIfBlock()
49 graph->AddBlock(block); in CreateGotoBlock()
63 graph->AddBlock(block); in CreateReturnBlock()
71 graph->AddBlock(block); in CreateExitBlock()
H A Dgraph_checker_test.cc40 graph->AddBlock(entry_block); in CreateSimpleCFG()
44 graph->AddBlock(exit_block); in CreateSimpleCFG()
H A Dinduction_var_analysis_test.cc54 graph_->AddBlock(loop_preheader_[d]); in BuildForLoop()
56 graph_->AddBlock(loop_header_[d]); in BuildForLoop()
62 graph_->AddBlock(loop_body_[d]); in BuildForLoop()
81 graph_->AddBlock(entry_); in BuildLoopNest()
84 graph_->AddBlock(return_); in BuildLoopNest()
86 graph_->AddBlock(exit_); in BuildLoopNest()
129 graph_->AddBlock(cond); in BuildIf()
130 graph_->AddBlock(ifTrue); in BuildIf()
131 graph_->AddBlock(ifFalse); in BuildIf()
H A Dssa_liveness_analysis_test.cc40 graph_->AddBlock(entry_); in SetUp()
48 graph->AddBlock(successor); in CreateSuccessor()
H A Dconstant_folding_test.cc738 graph_->AddBlock(entry_block); in TEST_F()
741 graph_->AddBlock(block); in TEST_F()
743 graph_->AddBlock(exit_block); in TEST_F()
H A Dscheduler_test.cc76 graph_->AddBlock(entry); in TestBuildDependencyGraphAndSchedule()
77 graph_->AddBlock(block1); in TestBuildDependencyGraphAndSchedule()
203 graph_->AddBlock(entry); in TestDependencyGraphOnAliasingArrayAccesses()
H A Dnodes.cc525 AddBlock(new_block); in SplitEdge()
623 AddBlock(preheader); in TransformLoopToSinglePreheaderFormat()
2135 GetGraph()->AddBlock(new_block); in SplitBefore()
2813 outer_graph->AddBlock(to); in InlineInto()
2953 AddBlock(if_block); in TransformLoopHeaderForBCE()
2954 AddBlock(true_block); in TransformLoopHeaderForBCE()
2955 AddBlock(false_block); in TransformLoopHeaderForBCE()
2956 AddBlock(new_pre_header); in TransformLoopHeaderForBCE()
3010 AddBlock(new_pre_header); in TransformLoopForVectorization()
3011 AddBlock(new_header); in TransformLoopForVectorization()
[all …]
H A Dinduction_var_range_test.cc64 graph_->AddBlock(entry_block_); in BuildGraph()
65 graph_->AddBlock(exit_block_); in BuildGraph()
87 graph_->AddBlock(loop_preheader_); in BuildLoop()
89 graph_->AddBlock(loop_header_); in BuildLoop()
91 graph_->AddBlock(loop_body_); in BuildLoop()
93 graph_->AddBlock(return_block); in BuildLoop()
H A Dnodes_vector_test.cc39 graph_->AddBlock(entry_block_); in BuildGraph()
40 graph_->AddBlock(exit_block_); in BuildGraph()
H A Dload_store_analysis_test.cc66 graph_->AddBlock(entry); in TEST_F()
149 graph_->AddBlock(entry); in TEST_F()
230 graph_->AddBlock(entry); in TEST_F()
324 graph_->AddBlock(entry); in TEST_F()
536 graph_->AddBlock(entry); in TEST_F()
655 graph_->AddBlock(entry); in TEST_F()
/aosp12/system/update_engine/payload_generator/
H A Dextent_ranges_unittest.cc139 ranges.AddBlock(0); in TEST()
141 ranges.AddBlock(1); in TEST()
142 ranges.AddBlock(3); in TEST()
148 ranges.AddBlock(2); in TEST()
152 ranges.AddBlock(kSparseHole); in TEST()
198 ranges_a.AddBlock(0); in TEST()
199 ranges_b.AddBlock(4); in TEST()
200 ranges_b.AddBlock(3); in TEST()
H A Dblock_mapping.cc44 BlockMapping::BlockId BlockMapping::AddBlock(const brillo::Blob& block_data) { in AddBlock() function in chromeos_update_engine::BlockMapping
45 return AddBlock(-1, 0, block_data); in AddBlock()
55 return AddBlock(fd, byte_offset, blob); in AddDiskBlock()
72 BlockMapping::BlockId BlockMapping::AddBlock(int fd, in AddBlock() function in chromeos_update_engine::BlockMapping
148 if (mapping.AddBlock(brillo::Blob(block_size, '\0')) != 0) in MapPartitionBlocks()
H A Dblock_mapping_unittest.cc51 EXPECT_EQ(0, bm_.AddBlock(blob)); in TEST_F()
53 EXPECT_EQ(1, bm_.AddBlock(blob)); in TEST_F()
74 EXPECT_EQ(0, bm_.AddBlock(block)); in TEST_F()
H A Dblock_mapping.h44 BlockId AddBlock(const brillo::Blob& block_data);
67 BlockId AddBlock(int fd, off_t byte_offset, const brillo::Blob& block_data);
H A Dextent_ranges.h53 void AddBlock(uint64_t block);
/aosp12/system/update_engine/common/
H A Dcow_operation_convert.cc57 modified_extents.AddBlock(dst_block); in ConvertToCowOperations()
H A Dcow_operation_convert_unittest.cc74 modified_extents.AddBlock(cow_op.dst_block); in VerifyCowMergeOp()

12