| /third_party/node/deps/v8/src/compiler/ |
| D | loop-unrolling.cc | 17 void UnrollLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, uint32_t depth, in UnrollLoop() argument
21 DCHECK_EQ(loop_node->opcode(), IrOpcode::kLoop); in UnrollLoop()
24 if (loop_node->InputCount() < 2) return; in UnrollLoop()
55 for (Node* node : loop_node->uses()) { in UnrollLoop()
102 if (node->InputAt(1) == loop_node) { in UnrollLoop()
166 for (int input_index = 1; input_index < loop_node->InputCount(); in UnrollLoop()
169 COPY(loop_node, unrolling_count - 1)->InputAt(input_index); in UnrollLoop()
172 COPY(loop_node, copy_index) in UnrollLoop()
174 COPY(loop_node, copy_index - 1)->InputAt(input_index)); in UnrollLoop()
176 COPY(loop_node, 0) in UnrollLoop()
[all …]
|
| D | wasm-loop-peeling.cc | 17 void PeelWasmLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, Graph* graph, in PeelWasmLoop() argument
21 DCHECK_EQ(loop_node->opcode(), IrOpcode::kLoop); in PeelWasmLoop()
24 if (loop_node->InputCount() < 2) return; in PeelWasmLoop()
37 Node* peeled_iteration_header = copier.map(loop_node); in PeelWasmLoop()
49 for (Node* node : loop_node->uses()) { in PeelWasmLoop()
56 DCHECK_EQ(node->InputAt(1), loop_node); in PeelWasmLoop()
95 use_edge.UpdateTo(loop_node->InputAt(0)); in PeelWasmLoop()
123 loop_node->ReplaceInput(0, peeled_iteration_header); in PeelWasmLoop()
124 for (Edge use_edge : loop_node->use_edges()) { in PeelWasmLoop()
|
| D | loop-peeling.cc | 149 Node* loop_node = loop_tree_->GetLoopControl(loop); in Peel() local
151 int backedges = loop_node->InputCount() - 1; in Peel()
156 for (int i = 1; i < loop_node->InputCount(); i++) { in Peel()
157 inputs.push_back(copier.map(loop_node->InputAt(i))); in Peel()
186 new_entry = copier.map(loop_node->InputAt(1)); in Peel()
188 loop_node->ReplaceInput(0, new_entry); in Peel()
|
| D | wasm-loop-peeling.h | 24 void PeelWasmLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, Graph* graph,
|
| D | loop-unrolling.h | 35 void UnrollLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, uint32_t depth,
|
| D | loop-analysis.cc | 679 Node* loop_node = loop_tree->GetLoopControl(loop); in HasMarkedExits() local
686 unmarked_exit = (node->InputAt(1) != loop_node); in HasMarkedExits()
690 unmarked_exit = (node->InputAt(1)->InputAt(1) != loop_node); in HasMarkedExits()
700 loop_node->id(), node->id(), node->op()->mnemonic(), use->id(), in HasMarkedExits()
|
| D | raw-machine-assembler.cc | 230 Node* loop_node; in MakeReschedulable() member
364 loop_header.loop_node->ReplaceInput(0, control_loop_entry); in MakeReschedulable()
365 loop_header.loop_node->ReplaceInput(1, control_backedge); in MakeReschedulable()
|
| D | wasm-compiler.h | 265 Node* LoopExit(Node* loop_node);
|
| D | bytecode-graph-builder.cc | 3927 Node* loop_node = merge_environments_[current_loop]->GetControlDependency(); in BuildLoopExitsUntilLoop() local
3930 environment()->PrepareForLoopExit(loop_node, loop_info.assignments(), in BuildLoopExitsUntilLoop()
|
| D | wasm-compiler.cc | 594 Node* WasmGraphBuilder::LoopExit(Node* loop_node) { in LoopExit() argument
595 DCHECK(loop_node->opcode() == IrOpcode::kLoop); in LoopExit()
597 graph()->NewNode(mcgraph()->common()->LoopExit(), control(), loop_node); in LoopExit()
|
| /third_party/mesa3d/src/compiler/nir/ |
| D | nir_lower_memory_model.c | 221 foreach_list_typed(nir_cf_node, loop_node, node, &loop->body) in lower_make_visible()
222 loop_progress |= lower_make_visible(loop_node, cur_modes); in lower_make_visible()
260 foreach_list_typed_reverse(nir_cf_node, loop_node, node, &loop->body) in lower_make_available()
261 loop_progress |= lower_make_available(loop_node, cur_modes); in lower_make_available()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | loop_descriptor.cpp | 583 for (DominatorTreeNode& loop_node : in PopulateList()
586 if (dom_tree.Dominates(dom_merge_node, &loop_node)) continue; in PopulateList()
587 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
589 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
|
| /third_party/spirv-tools/source/opt/ |
| D | loop_descriptor.cpp | 584 for (DominatorTreeNode& loop_node : in PopulateList()
587 if (dom_tree.Dominates(dom_merge_node, &loop_node)) continue; in PopulateList()
588 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
590 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | loop_descriptor.cpp | 583 for (DominatorTreeNode& loop_node : in PopulateList()
586 if (dom_tree.Dominates(dom_merge_node, &loop_node)) continue; in PopulateList()
587 current_loop->AddBasicBlock(loop_node.bb_); in PopulateList()
589 std::make_pair(loop_node.bb_->id(), current_loop)); in PopulateList()
|
| /third_party/node/deps/v8/src/wasm/ |
| D | graph-builder-interface.cc | 104 TFNode* loop_node = nullptr; // loop header of this loop. member
206 TFNode* loop_node = builder_->Loop(control()); in Loop() local
224 loop_infos_.emplace_back(loop_node, nesting_depth, true); in Loop()
227 builder_->SetControl(loop_node); in Loop()
228 decoder->control_at(0)->loop_node = loop_node; in Loop()
1801 builder_->LoopExit(loop->loop_node); in BuildLoopExits()
|
| /third_party/node/deps/v8/src/regexp/ |
| D | regexp-compiler.cc | 3546 that->info()->AddFromFollowing(that->loop_node()->info()); in VisitLoopChoiceLoopNode()
3746 EnsureAnalyzed(that->loop_node()); in VisitLoopChoice()
3920 RegExpNode* loop_node = RegExpQuantifier::ToNode( in PreprocessRegExp() local
3932 false, loop_node))); in PreprocessRegExp()
3935 node = loop_node; in PreprocessRegExp()
|
| D | regexp-nodes.h | 729 RegExpNode* loop_node() { return loop_node_; } in loop_node() function
|