Home
last modified time | relevance | path

Searched refs:CreateEmptyBlock (Results 1 - 25 of 29) sorted by relevance

12

/arkcompiler/runtime_core/compiler/tests/
H A Drpo_test.cpp113 auto M = GetGraph()->CreateEmptyBlock(); in TEST_F()
114 auto N = GetGraph()->CreateEmptyBlock(); in TEST_F()
117 auto K = GetGraph()->CreateEmptyBlock(); in TEST_F()
243 auto N = GetGraph()->CreateEmptyBlock(); in TEST_F()
256 auto K = GetGraph()->CreateEmptyBlock(); in TEST_F()
H A Ddom_tree_test.cpp148 auto G = GetGraph()->CreateEmptyBlock(); in TEST_F()
H A Dunit_test.h138 BasicBlock *CreateEmptyBlock(Graph *graph) const in CreateEmptyBlock() function in panda::compiler::CommonTest
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Drpo_test.cpp119 auto m = GetGraph()->CreateEmptyBlock(); in TEST_F()
120 auto n = GetGraph()->CreateEmptyBlock(); in TEST_F()
123 auto k = GetGraph()->CreateEmptyBlock(); in TEST_F()
247 auto n = GetGraph()->CreateEmptyBlock(); in TEST_F()
253 auto k = GetGraph()->CreateEmptyBlock(); in TEST_F()
H A Dinst_generator.cpp822 auto block = graph->CreateEmptyBlock(); in CreateGraphWithOneBasicBlock()
833 auto block1 = graph->CreateEmptyBlock(); in CreateGraphWithTwoBasicBlock()
834 auto block2 = graph->CreateEmptyBlock(); in CreateGraphWithTwoBasicBlock()
846 auto blockMain = graph->CreateEmptyBlock(); in CreateGraphWithThreeBasicBlock()
847 auto blockTrue = graph->CreateEmptyBlock(); in CreateGraphWithThreeBasicBlock()
848 auto blockFalse = graph->CreateEmptyBlock(); in CreateGraphWithThreeBasicBlock()
866 auto blockMain = graph->CreateEmptyBlock(); in CreateGraphWithFourBasicBlock()
867 auto blockTrue = graph->CreateEmptyBlock(); in CreateGraphWithFourBasicBlock()
868 auto blockFalse = graph->CreateEmptyBlock(); in CreateGraphWithFourBasicBlock()
869 auto blockPhi = graph->CreateEmptyBlock(); in CreateGraphWithFourBasicBlock()
[all...]
H A Dunit_test.h198 BasicBlock *CreateEmptyBlock(Graph *graph) const in CreateEmptyBlock() function in ark::compiler::CommonTest
H A Dsavestate_optimization_tests.cpp105 auto block = GetGraph()->CreateEmptyBlock(); in TEST_F()
H A Ddom_tree_test.cpp153 auto g = GetGraph()->CreateEmptyBlock(); in TEST_F()
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
H A Dir_builder.h59 begin_bb = graph->CreateEmptyBlock(boundaries.begin_pc); in Init()
61 end_bb = graph->CreateEmptyBlock(boundaries.end_pc); in Init()
103 blocks_[pc] = GetGraph()->CreateEmptyBlock(); in CreateBlock()
H A Dir_builder.cpp463 auto catch_begin = GetGraph()->CreateEmptyBlock(); in ConnectTryCatchBlocks()
/arkcompiler/runtime_core/compiler/optimizer/ir/
H A Dbasicblock.cpp58 auto new_bb = GetGraph()->CreateEmptyBlock((next_inst != nullptr) ? next_inst->GetPc() : INVALID_PC); in SplitBlockAfterInstruction()
88 auto empty_bb = GetGraph()->CreateEmptyBlock(GetGuestPc()); in AddSucc()
102 auto empty_bb = GetGraph()->CreateEmptyBlock(GetGuestPc()); in ReplaceSucc()
112 auto block = GetGraph()->CreateEmptyBlock(succ->GetGuestPc()); in InsertNewBlockToSuccEdge()
120 auto block = GetGraph()->CreateEmptyBlock(this->GetGuestPc()); in InsertEmptyBlockBefore()
625 auto dominator = GetGraph()->CreateEmptyBlock(); in CreateImmediateDominator()
710 clone = target_graph->CreateEmptyBlock(); in Clone()
712 clone = target_graph->CreateEmptyBlock(GetId(), GetGuestPc()); in Clone()
715 clone = target_graph->CreateEmptyBlock(); in Clone()
H A Dgraph.cpp150 BasicBlock *Graph::CreateEmptyBlock(uint32_t guest_pc) in CreateEmptyBlock() function in panda::compiler::Graph
159 BasicBlock *Graph::CreateEmptyBlock(BasicBlock *base_block) in CreateEmptyBlock() function in panda::compiler::Graph
162 auto block = CreateEmptyBlock(); in CreateEmptyBlock()
170 BasicBlock *Graph::CreateEmptyBlock(uint32_t id, uint32_t guest_pc) in CreateEmptyBlock() function in panda::compiler::Graph
181 auto block = CreateEmptyBlock(0U); in CreateStartBlock()
188 auto block = CreateEmptyBlock(guest_pc); in CreateEndBlock()
H A Dgraph.h498 BasicBlock *CreateEmptyBlock(uint32_t guest_pc = INVALID_PC);
499 BasicBlock *CreateEmptyBlock(BasicBlock *base_block);
501 BasicBlock *CreateEmptyBlock(uint32_t id, uint32_t guest_pc);
H A Dgraph_cloner.cpp750 auto new_outside_succ = GetGraph()->CreateEmptyBlock(); in CreateNewOutsideSucc()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir_builder/
H A Dir_builder.h66 beginBb = graph->CreateEmptyBlock(boundaries.beginPc); in Init()
68 endBb = graph->CreateEmptyBlock(boundaries.endPc); in Init()
113 blocks_[pc] = GetGraph()->CreateEmptyBlock(); in CreateBlock()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dbasicblock.cpp484 auto newBb = GetGraph()->CreateEmptyBlock((nextInst != nullptr) ? nextInst->GetPc() : INVALID_PC);
515 auto emptyBb = GetGraph()->CreateEmptyBlock(GetGuestPc());
529 auto emptyBb = GetGraph()->CreateEmptyBlock(GetGuestPc());
539 auto block = GetGraph()->CreateEmptyBlock(succ->GetGuestPc());
547 auto block = GetGraph()->CreateEmptyBlock(this->GetGuestPc());
1323 auto dominator = GetGraph()->CreateEmptyBlock();
1408 clone = targetGraph->CreateEmptyBlock();
1410 clone = targetGraph->CreateEmptyBlock(GetId(), GetGuestPc());
1413 clone = targetGraph->CreateEmptyBlock();
H A Dgraph.cpp208 BasicBlock *Graph::CreateEmptyBlock(uint32_t guestPc) in CreateEmptyBlock() function in ark::compiler::Graph
216 BasicBlock *Graph::CreateEmptyBlock(BasicBlock *baseBlock) in CreateEmptyBlock() function in ark::compiler::Graph
219 auto block = CreateEmptyBlock(); in CreateEmptyBlock()
228 BasicBlock *Graph::CreateEmptyBlock(uint32_t id, uint32_t guestPc) in CreateEmptyBlock() function in ark::compiler::Graph
238 auto block = CreateEmptyBlock(0U); in CreateStartBlock()
245 auto block = CreateEmptyBlock(guestPc); in CreateEndBlock()
H A Dloop_unswitcher.cpp79 auto commonOuter = GetGraph()->CreateEmptyBlock(); in BuildLoopUnswitchControlFlow()
89 auto commonPredecessor = GetGraph()->CreateEmptyBlock(); in BuildLoopUnswitchControlFlow()
H A Dgraph.h636 BasicBlock *CreateEmptyBlock(uint32_t guestPc = INVALID_PC);
637 BasicBlock *CreateEmptyBlock(BasicBlock *baseBlock);
639 BasicBlock *CreateEmptyBlock(uint32_t id, uint32_t guestPc);
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dlicm_conditions.cpp289 auto singleConditionBlock = GetGraph()->CreateEmptyBlock(); in ReplaceChainWithSingleBlock()
297 auto phiBlock = GetGraph()->CreateEmptyBlock(); in ReplaceChainWithSingleBlock()
302 auto emptyBlock = GetGraph()->CreateEmptyBlock(); in ReplaceChainWithSingleBlock()
H A Doptimize_string_concat.cpp228 auto header = GetGraph()->CreateEmptyBlock(preHeader); in CreateAppendArgsLoop()
229 auto backEdge = GetGraph()->CreateEmptyBlock(preHeader); in CreateAppendArgsLoop()
H A Dloop_idioms.cpp245 auto intrinsicBlock = GetGraph()->CreateEmptyBlock(); in ReplaceArrayInitLoop()
H A Dinlining.cpp409 auto newCallBb = GetGraph()->CreateEmptyBlock(callBb); in InsertCallInst()
619 auto newCallBb = GetGraph()->CreateEmptyBlock(callBb); in MakeCallBbs()
636 auto callInlinedBlock = GetGraph()->CreateEmptyBlock(callBb); in InlineReceiver()
650 auto returnInlinedBlock = GetGraph()->CreateEmptyBlock(callBb); in InlineReceiver()
H A Dif_merging.cpp320 auto trueBranchBb = GetGraph()->CreateEmptyBlock(bb->GetGuestPc()); in SplitBlock()
/arkcompiler/runtime_core/static_core/compiler/tests/codegen/
H A Dcodegen_test_1.cpp115 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()
192 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()
261 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()
345 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()
435 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()
505 auto block = graph->CreateEmptyBlock(); in SRC_GRAPH()

Completed in 29 milliseconds

12