Home
last modified time | relevance | path

Searched defs:block (Results 1 – 25 of 163) sorted by relevance

1234567

/arkcompiler/runtime_core/compiler/optimizer/analysis/
Ddominators_tree.h54 void SetAncestor(BasicBlock *dest, BasicBlock *block) in SetAncestor()
58 BasicBlock *GetAncestor(BasicBlock *block) const in GetAncestor()
66 BlocksVector &GetBucket(BasicBlock *block) in GetBucket()
74 void SetIdom(BasicBlock *dest, BasicBlock *block) in SetIdom()
78 BasicBlock *GetIdom(BasicBlock *block) const in GetIdom()
86 void SetLabel(BasicBlock *dest, BasicBlock *block) in SetLabel()
90 BasicBlock *GetLabel(BasicBlock *block) const in GetLabel()
98 void SetParent(BasicBlock *dest, BasicBlock *block) in SetParent()
102 BasicBlock *GetParent(BasicBlock *block) const in GetParent()
114 int32_t GetSemi(BasicBlock *block) const in GetSemi()
[all …]
Ddominators_tree.cpp26 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
50 void DominatorsTree::AdjustImmediateDominators(BasicBlock *block) in AdjustImmediateDominators()
65 void DominatorsTree::ComputeImmediateDominators(BasicBlock *block) in ComputeImmediateDominators()
97 void DominatorsTree::Compress(BasicBlock *block) in Compress()
114 void DominatorsTree::DfsNumbering(BasicBlock *block) in DfsNumbering()
138 BasicBlock *DominatorsTree::Eval(BasicBlock *block) in Eval()
181 void DominatorsTree::SetDomPair(BasicBlock *dominator, BasicBlock *block) in SetDomPair()
222 inline uint32_t DominatorsTree::GetBlockId(BasicBlock *block) in GetBlockId()
Dloop_analyzer.cpp39 for (auto block : GetGraph()->GetVectorBlocks()) { in ResetLoopInfo() local
80 void LoopAnalyzer::BackEdgeSearch(BasicBlock *block) in BackEdgeSearch()
235 auto block = *it; in PopulateLoops() local
260 for (auto block : GetGraph()->GetBlocksRPO()) { in PopulateLoops() local
276 void LoopAnalyzer::NaturalLoopSearch(Loop *loop, BasicBlock *block) in NaturalLoopSearch()
310 void Loop::AppendBlock(BasicBlock *block) in AppendBlock()
317 void Loop::RemoveBlock(BasicBlock *block) in RemoveBlock()
374 for (auto block : GetBlocks()) { in CheckInfinity() local
416 for (auto block : loop->GetBlocks()) { in IsLoopSingleBackEdgeExitPoint() local
Dlinear_order.cpp48 void LinearOrder::HandlePrevInstruction(BasicBlock *block, BasicBlock *prev_block) in HandlePrevInstruction()
106 for (auto block : blocks) { in MakeLinearOrder() local
121 BasicBlock *LinearOrder::LeastLikelySuccessor(const BasicBlock *block) in LeastLikelySuccessor()
151 void LinearOrder::DFSAndDeferLeastFrequentBranches(BasicBlock *block, size_t *blocks_count) in DFSAndDeferLeastFrequentBranches()
Dliveness_analyzer.cpp104 bool LivenessAnalyzer::AllForwardEdgesVisited(BasicBlock *block) in AllForwardEdgesVisited()
151 … auto pc_compare = [succ](auto block) { return block->GetGuestPc() > succ->GetGuestPc(); }; in LinearizeBlocks()
159 auto is_same_or_inner_loop = [succ](auto block) { in LinearizeBlocks()
177 for (auto block : linear_blocks_) { in CheckLinearOrder() local
181 for (auto block : linear_blocks_) { in CheckLinearOrder() local
210 for (auto block : GetLinearizedBlocks()) { in BuildInstLifeNumbers() local
240 auto block = *it; in BuildInstLifeIntervals() local
251 InstLiveSet *LivenessAnalyzer::GetInitInstLiveSet(BasicBlock *block) in GetInitInstLiveSet()
295 void LivenessAnalyzer::ProcessBlockLiveInstructions(BasicBlock *block, InstLiveSet *live_set) in ProcessBlockLiveInstructions()
443 void LivenessAnalyzer::SetBlockLiveRange(BasicBlock *block, LiveRange life_range) in SetBlockLiveRange()
[all …]
Dloop_analyzer.h62 void AppendBackEdge(BasicBlock *block) in AppendBackEdge()
68 void ReplaceBackEdge(BasicBlock *block, BasicBlock *new_block) in ReplaceBackEdge()
78 bool HasBackEdge(BasicBlock *block) const in HasBackEdge()
84 void RemoveBackEdge(BasicBlock *block) in RemoveBackEdge()
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
Ddominators_tree.h52 void SetAncestor(BasicBlock *dest, BasicBlock *block) in SetAncestor()
56 BasicBlock *GetAncestor(BasicBlock *block) const in GetAncestor()
64 BlocksVector &GetBucket(BasicBlock *block) in GetBucket()
72 void SetIdom(BasicBlock *dest, BasicBlock *block) in SetIdom()
76 BasicBlock *GetIdom(BasicBlock *block) const in GetIdom()
84 void SetLabel(BasicBlock *dest, BasicBlock *block) in SetLabel()
88 BasicBlock *GetLabel(BasicBlock *block) const in GetLabel()
96 void SetParent(BasicBlock *dest, BasicBlock *block) in SetParent()
100 BasicBlock *GetParent(BasicBlock *block) const in GetParent()
112 int32_t GetSemi(BasicBlock *block) const in GetSemi()
[all …]
Ddominators_tree.cpp26 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
50 void DominatorsTree::AdjustImmediateDominators(BasicBlock *block) in AdjustImmediateDominators()
65 void DominatorsTree::ComputeImmediateDominators(BasicBlock *block) in ComputeImmediateDominators()
97 void DominatorsTree::Compress(BasicBlock *block) in Compress()
114 void DominatorsTree::DfsNumbering(BasicBlock *block) in DfsNumbering()
138 BasicBlock *DominatorsTree::Eval(BasicBlock *block) in Eval()
181 void DominatorsTree::SetDomPair(BasicBlock *dominator, BasicBlock *block) in SetDomPair()
222 inline uint32_t DominatorsTree::GetBlockId(BasicBlock *block) in GetBlockId()
Dlinear_order.cpp56 void LinearOrder::HandlePrevInstruction(BasicBlock *block, BasicBlock *prevBlock) in HandlePrevInstruction()
119 for (auto block : blocks) { in MakeLinearOrder() local
134 BasicBlock *LinearOrder::LeastLikelySuccessor(const BasicBlock *block) in LeastLikelySuccessor()
159 BasicBlock *LinearOrder::LeastLikelySuccessorByBranchCounter(const BasicBlock *block) in LeastLikelySuccessorByBranchCounter()
185 int64_t LinearOrder::GetBranchCounter(const BasicBlock *block, bool trueSucc) in GetBranchCounter()
197 bool LinearOrder::IsConditionChainCounter(const BasicBlock *block) in IsConditionChainCounter()
222 int64_t LinearOrder::GetConditionChainCounter(const BasicBlock *block, bool trueSucc) in GetConditionChainCounter()
231 int64_t LinearOrder::GetConditionChainTrueSuccessorCounter(const BasicBlock *block) in GetConditionChainTrueSuccessorCounter()
256 int64_t LinearOrder::GetConditionChainFalseSuccessorCounter(const BasicBlock *block) in GetConditionChainFalseSuccessorCounter()
283 BasicBlock *LinearOrder::LeastLikelySuccessorByPreference(const BasicBlock *block) in LeastLikelySuccessorByPreference()
[all …]
Dloop_analyzer.cpp39 for (auto block : GetGraph()->GetVectorBlocks()) { in ResetLoopInfo() local
80 void LoopAnalyzer::BackEdgeSearch(BasicBlock *block) in BackEdgeSearch()
246 auto block = *it; in PopulateLoops() local
266 for (auto block : GetGraph()->GetBlocksRPO()) { in PopulateLoops() local
282 void LoopAnalyzer::NaturalLoopSearch(Loop *loop, BasicBlock *block) in NaturalLoopSearch()
318 void Loop::AppendBlock(BasicBlock *block) in AppendBlock()
325 void Loop::RemoveBlock(BasicBlock *block) in RemoveBlock()
382 for (auto block : GetBlocks()) { in CheckInfinity() local
424 for (auto block : loop->GetBlocks()) { in IsLoopSingleBackEdgeExitPoint() local
/arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/
Dinterop_intrinsic_optimization.cpp92 InteropIntrinsicOptimization::BlockInfo &InteropIntrinsicOptimization::GetInfo(BasicBlock *block) in GetInfo()
97 void InteropIntrinsicOptimization::MergeScopesInsideBlock(BasicBlock *block) in MergeScopesInsideBlock()
243 for (auto *block : loop->GetBlocks()) { in FindForbiddenLoops() local
274 bool InteropIntrinsicOptimization::IsForbiddenLoopEntry(BasicBlock *block) in IsForbiddenLoopEntry()
280 static auto GetInstsIter(BasicBlock *block) in GetInstsIter()
336 void InteropIntrinsicOptimization::IterateBlockFromBoundary(BasicBlock *block) in IterateBlockFromBoundary()
370 void InteropIntrinsicOptimization::BlockBoundaryDfs(BasicBlock *block) in BlockBoundaryDfs()
394 static bool MoveBlockStartIntoScope(BasicBlock *block) in MoveBlockStartIntoScope()
413 static bool MoveBlockEndIntoScope(BasicBlock *block) in MoveBlockEndIntoScope()
436 for (auto *block : currentComponentBlocks_) { in MergeCurrentComponentWithNeighbours() local
[all …]
/arkcompiler/runtime_core/static_core/runtime/
Dglobal_handle_storage-inl.h45 auto block = allocator_->New<std::array<Node, GLOBAL_BLOCK_SIZE>>(); in NewGlobalHandle() local
89 …lHandleStorage<coretypes::TaggedType>::DealUpdateObject(std::array<Node, GLOBAL_BLOCK_SIZE> *block, in DealUpdateObject()
107 auto block = globalNodes_->at(i); in UpdateHeapObject() local
113 auto block = globalNodes_->back(); in UpdateHeapObject() local
120 …lHandleStorage<coretypes::TaggedType>::DealVisitGCRoots(std::array<Node, GLOBAL_BLOCK_SIZE> *block, in DealVisitGCRoots()
137 auto block = globalNodes_->at(i); in VisitGCRoots() local
143 auto block = globalNodes_->back(); in VisitGCRoots() local
/arkcompiler/runtime_core/compiler/optimizer/ir/
Dgraph.cpp25 static void MarkBlocksRec(Marker mrk, BasicBlock *block) in MarkBlocksRec()
109 void Graph::AddBlock(BasicBlock *block) in AddBlock()
118 void Graph::AddBlock(BasicBlock *block, uint32_t id) in AddBlock()
153 auto block = GetAllocator()->New<BasicBlock>(this, guest_pc); in CreateEmptyBlock() local
162 auto block = CreateEmptyBlock(); in CreateEmptyBlock() local
172 auto block = GetAllocator()->New<BasicBlock>(this, guest_pc); in CreateEmptyBlock() local
180 auto block = CreateEmptyBlock(0U); in CreateStartBlock() local
187 auto block = CreateEmptyBlock(guest_pc); in CreateEndBlock() local
192 void RemovePredecessorUpdateDF(BasicBlock *block, BasicBlock *rm_pred) in RemovePredecessorUpdateDF()
220 void Graph::RemoveSuccessors(BasicBlock *block) in RemoveSuccessors()
[all …]
Dgraph_checker.cpp44 for (auto block : graph->GetVectorBlocks()) { in UserInputCheck() local
103 for (auto block : GetGraph()->GetVectorBlocks()) { in Check() local
138 void GraphChecker::CheckBlock([[maybe_unused]] BasicBlock *block) in CheckBlock()
161 void GraphChecker::CheckControlFlow(BasicBlock *block) in CheckControlFlow()
186 void GraphChecker::CheckDataFlow(BasicBlock *block) in CheckDataFlow()
247 for (auto block : GetGraph()->GetEndBlock()->GetPredsBlocks()) { in CheckCallReturnInlined() local
356 void GraphChecker::CheckNoLowLevel(BasicBlock *block) in CheckNoLowLevel()
368 for ([[maybe_unused]] auto block : loop->GetBlocks()) { in MarkBlocksInLoop() local
377 bool GraphChecker::CheckBlockHasPredecessor(BasicBlock *block, BasicBlock *predecessor) in CheckBlockHasPredecessor()
388 bool GraphChecker::CheckBlockHasSuccessor(BasicBlock *block, BasicBlock *successor) in CheckBlockHasSuccessor()
[all …]
Dgraph_cloner.h179 bool HasClone(const BasicBlock *block) in HasClone()
184 BasicBlock *GetClone(const BasicBlock *block) in GetClone()
223 for (const auto &block : blocks) { in CloneBlocksAndInstructions() local
239 void CloneInstructions(const BasicBlock *block, BasicBlock *clone, size_t *inst_count) in CloneInstructions()
304 void CloneEdges(BasicBlock *block) in CloneEdges()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
Dgraph.cpp35 static void MarkBlocksRec(Marker mrk, BasicBlock *block) in MarkBlocksRec()
156 void Graph::AddBlock(BasicBlock *block) in AddBlock()
165 void Graph::AddBlock(BasicBlock *block, uint32_t id) in AddBlock()
210 auto block = GetAllocator()->New<BasicBlock>(this, guestPc); in CreateEmptyBlock() local
219 auto block = CreateEmptyBlock(); in CreateEmptyBlock() local
230 auto block = GetAllocator()->New<BasicBlock>(this, guestPc); in CreateEmptyBlock() local
238 auto block = CreateEmptyBlock(0U); in CreateStartBlock() local
245 auto block = CreateEmptyBlock(guestPc); in CreateEndBlock() local
250 void RemovePredecessorUpdateDF(BasicBlock *block, BasicBlock *rmPred) in RemovePredecessorUpdateDF()
278 void Graph::RemoveSuccessors(BasicBlock *block) in RemoveSuccessors()
[all …]
Dvisualizer_printer.cpp26 for (const auto &block : graph_->GetBlocksRPO()) { in Print() local
66 for (const auto &block : blocks) { in PrintDependences() local
72 void VisualizerPrinter::PrintBasicBlock(BasicBlock *block) in PrintBasicBlock()
95 void VisualizerPrinter::PrintInsts(BasicBlock *block) in PrintInsts()
Dgraph_cloner.h173 BasicBlock *GetClone(const BasicBlock *block) in GetClone()
182 void CloneEdges(BasicBlock *block) in CloneEdges()
210 for (const auto &block : blocks) { in CloneBlocksAndInstructions() local
299 bool HasClone(const BasicBlock *block) in HasClone()
311 void CloneInstructions(const BasicBlock *block, BasicBlock *clone, size_t *instCount) in CloneInstructions()
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
Ddeoptimize_elimination.cpp44 auto block = inst->GetBasicBlock(); in ReplaceDeoptimizeIfByUnconditionalDeoptimize() local
55 auto block = GetGraph()->GetStartBlock(); in RemoveSafePoints() local
147 auto block = inst->GetBasicBlock(); in VisitDeoptimizeIf() local
176 auto block = inst->GetBasicBlock(); in TryToRemoveRedundantSaveState() local
221 bool DeoptimizeElimination::CanRemoveGuardRec(BasicBlock *block, Inst *guard, const Marker &mrk, in CanRemoveGuardRec()
270 auto block = guard->GetBasicBlock(); in RemoveGuard() local
283 auto block = inst->GetBasicBlock(); in RemoveDeoptimizeIf() local
Dcode_sink.cpp71 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
95 bool CodeSink::ProcessBlock(BasicBlock *block) in ProcessBlock()
174 BasicBlock *block = inst->GetBasicBlock(); in SinkInstruction() local
203 BasicBlock *block = inst->GetBasicBlock(); in IsAcceptableTarget() local
/arkcompiler/runtime_core/static_core/irtoc/lang/
Dirtoc.rb88 def function(name, **kwargs, &block)
94 def cpp_function(name, &block)
100 def macro(name, &block)
106 def scoped_macro(name, &block)
/arkcompiler/runtime_core/bytecode_optimizer/
Dreg_acc_alloc.cpp30 compiler::BasicBlock *block = src_inst->GetBasicBlock(); in IsAccWriteBetween() local
199 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
217 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
226 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
/arkcompiler/runtime_core/static_core/bytecode_optimizer/
Dreg_acc_alloc.cpp28 compiler::BasicBlock *block = srcInst->GetBasicBlock(); in IsAccWriteBetween() local
241 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
261 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
271 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
280 for (auto block : GetGraph()->GetBlocksRPO()) { in RunImpl() local
/arkcompiler/runtime_core/static_core/libllvmbackend/lowering/
Dllvm_ir_constructor.h131 void SetCurrentBasicBlock(llvm::BasicBlock *block) in SetCurrentBasicBlock()
148 llvm::BasicBlock *GetHeadBlock(BasicBlock *block) in GetHeadBlock()
156 llvm::BasicBlock *GetTailBlock(BasicBlock *block) in GetTailBlock()
/arkcompiler/ets_runtime/ecmascript/
Dbyte_array.cpp25 auto *block = reinterpret_cast<uint8_t *>(pointer) + offset; in Set() local
33 auto *block = reinterpret_cast<uint8_t *>(pointer) + offset; in Get() local

1234567