/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
H A D | memory_coalescing.h | 74 void ReplacePair(Inst *first, Inst *second, Inst *insertAfter); 76 Inst *ReplaceLoadArray(Inst *first, Inst *second, Inst *insertAfter); 77 Inst *ReplaceLoadArrayI(Inst *first, Inst *second, Inst *insertAfter); 78 Inst *ReplaceLoadObject(Inst *first, Inst *second, Inst *insertAfter); 79 Inst *ReplaceStoreArray(Inst *first, Inst *second, Inst *insertAfter); 80 Inst *ReplaceStoreArrayI(Inst *first, Inst *second, Inst *insertAfter); 81 Inst *ReplaceStoreObject(Inst *first, Inst *second, Inst *insertAfter);
|
H A D | memory_coalescing.cpp | 436 Inst *insertAfter = nullptr; in TryAddCoalescedPair() local 475 insertAfter = instUpperAfter; in TryAddCoalescedPair() 477 insertAfter = cand; in TryAddCoalescedPair() 482 InsertPair(first, second, insertAfter); in TryAddCoalescedPair() 649 void InsertPair(Inst *first, Inst *second, Inst *insertAfter) in InsertPair() argument 658 paired = ReplaceLoadArray(first, second, insertAfter); in InsertPair() 661 paired = ReplaceLoadArrayI(first, second, insertAfter); in InsertPair() 664 paired = ReplaceStoreArray(first, second, insertAfter); in InsertPair() 667 paired = ReplaceStoreArrayI(first, second, insertAfter); in InsertPair() 670 paired = ReplaceLoadObject(first, second, insertAfter); in InsertPair() 693 ReplaceLoadArray(Inst *first, Inst *second, Inst *insertAfter) ReplaceLoadArray() argument 710 ReplaceLoadObject(Inst *first, Inst *second, Inst *insertAfter) ReplaceLoadObject() argument 735 ReplaceLoadArrayI(Inst *first, Inst *second, Inst *insertAfter) ReplaceLoadArrayI() argument 752 ReplaceStoreArray(Inst *first, Inst *second, Inst *insertAfter) ReplaceStoreArray() argument 772 ReplaceStoreObject(Inst *first, Inst *second, Inst *insertAfter) ReplaceStoreObject() argument 799 ReplaceStoreArrayI(Inst *first, Inst *second, Inst *insertAfter) ReplaceStoreArrayI() argument [all...] |
H A D | checks_elimination.cpp | 802 auto insertAfter = ss; in FindOptimalSaveStateForHoist() local 808 if (input->IsDominate(insertAfter)) { in FindOptimalSaveStateForHoist() 811 if (insertAfter->GetBasicBlock() == input->GetBasicBlock()) { in FindOptimalSaveStateForHoist() 812 insertAfter = input; in FindOptimalSaveStateForHoist() 822 *optimalInsertAfter = insertAfter; in FindOptimalSaveStateForHoist() 823 if (insertAfter != ss) { in FindOptimalSaveStateForHoist() 847 auto [ss, insertAfter] = helpers; in InsertBoundsCheckDeoptimization() 848 auto block = insertAfter->GetBasicBlock(); in InsertBoundsCheckDeoptimization() 864 InsertInstAfter(newLeft, insertAfter, block); in InsertBoundsCheckDeoptimization() 865 insertAfter in InsertBoundsCheckDeoptimization() 944 Inst *insertAfter = loopUpper->IsDominate(ss) ? ss : loopUpper; InsertDeoptimizationForIndexOverflow() local 1189 Inst *insertAfter = nullptr; MoveCheckOutOfLoop() local 1248 auto insertAfter = lenArray->IsDominate(saveState) ? saveState : lenArray; ReplaceOneBoundsCheckToDeoptimizationInLoop() local [all...] |
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/ |
H A D | analysis.h | 104 explicit InstAppender(BasicBlock *block, Inst *insertAfter = nullptr) : block_(block), prev_(insertAfter) {} in InstAppender()
|
/arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/ |
H A D | interop_intrinsic_optimization.h | 144 void ReplaceInst(Inst *inst, Inst **newInst, Inst *insertAfter); 146 void HoistAndEliminateRec(BasicBlock *block, const BlockInfo &startInfo, Inst **newInst, Inst *insertAfter);
|
H A D | interop_intrinsic_optimization.cpp | 908 void InteropIntrinsicOptimization::ReplaceInst(Inst *inst, Inst **newInst, Inst *insertAfter) in ReplaceInst() argument 914 ASSERT(insertAfter != nullptr); in ReplaceInst() 918 insertAfter->InsertAfter(inst); in ReplaceInst() 980 Inst *insertAfter) in HoistAndEliminateRec() 985 ReplaceInst(inst, newInst, insertAfter); in HoistAndEliminateRec() 996 HoistAndEliminateRec(succ, startInfo, newInst, insertAfter); in HoistAndEliminateRec() 1045 Inst *insertAfter = nullptr; in HoistAndEliminate() local 1049 std::tie(newInst, insertAfter) = GetHoistPosition(block, boundaryInst); in HoistAndEliminate() 1057 HoistAndEliminateRec(block, GetInfo(block), &newInst, insertAfter); in HoistAndEliminate() 979 HoistAndEliminateRec(BasicBlock *block, const BlockInfo &startInfo, Inst **newInst, Inst *insertAfter) HoistAndEliminateRec() argument
|
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_util/include/ |
H A D | ptr_list_ref.h | 417 void insertAfter(const_iterator where, pointer value) in insertAfter() function in maple::PtrListRef 433 void insertAfter(const_pointer where, pointer value) in insertAfter() function in maple::PtrListRef 435 this->insertAfter(const_iterator(where), value); in insertAfter()
|
/arkcompiler/ets_runtime/ecmascript/compiler/ |
H A D | array_bounds_check_elimination.cpp | 746 GateRef insertAfter = acc_.GetState(loopHeader->GetState(), 0); // after end in ProcessIndexCheck() local 747 GateRef stateIn = insertAfter; in ProcessIndexCheck() 748 GateRef dependIn = insertAfter; in ProcessIndexCheck() 749 acc_.GetStateInAndDependIn(insertAfter, stateIn, dependIn); in ProcessIndexCheck() 886 GateRef insertAfter = info->list_.front(); in InBlockMotion() local 887 GateRef length = FindBoundGate(acc_.GetValueIn(insertAfter, 0)); in InBlockMotion() 890 Environment env(insertAfter, circuit_, &builder_); in InBlockMotion()
|
H A D | gate_accessor.cpp | 1701 // When ifOp or loopExit, insertAfter 1705 void GateAccessor::GetStateInAndDependIn(GateRef insertAfter, GateRef &stateIn, GateRef &dependIn) 1707 if (GetOpCode(insertAfter) == OpCode::IF_TRUE || GetOpCode(insertAfter) == OpCode::IF_FALSE 1708 || GetOpCode(insertAfter) == OpCode::IF_SUCCESS) { 1709 auto uses = Uses(insertAfter); 1712 stateIn = insertAfter; 1719 } else if (GetOpCode(insertAfter) == OpCode::MERGE) { 1720 auto uses = Uses(insertAfter); 1723 stateIn = insertAfter; [all...] |
H A D | array_bounds_check_elimination.h | 140 void CopyStateInAndDependIn(GateRef &stateIn, GateRef &dependIn, GateRef insertAfter);
|
H A D | gate_accessor.h | 485 void GetStateInAndDependIn(GateRef insertAfter, GateRef &stateIn, GateRef &dependIn);
|
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/be/ |
H A D | lower.cpp | 613 StmtNode *insertAfter = nullptr; in CleanupBranches() local 617 insertAfter = prev; in CleanupBranches() 623 insertAfter = curr; in CleanupBranches() 629 StmtNode *iaNext = insertAfter->GetNext(); in CleanupBranches() 635 insertAfter->SetNext(cmtB); in CleanupBranches() 636 cmtB->SetPrev(insertAfter); in CleanupBranches() 638 if (insertAfter == curr) { in CleanupBranches()
|
/arkcompiler/runtime_core/static_core/libllvmbackend/transforms/passes/ |
H A D | insert_safepoints.cpp | 46 call->insertAfter(point); in InsertInlinedPoll()
|
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_ir/src/ |
H A D | mir_nodes.cpp | 98 stmtNodeList.insertAfter(stmtNode1, stmtNode2); in InsertAfter()
|