Lines Matching refs:node
8 #include "src/compiler/node.h"
9 #include "src/compiler/node-marker.h"
10 #include "src/compiler/node-properties.h"
21 // Temporary information for each node during marking.
23 Node* node;
30 Node* header;
43 // either a {Loop} node or a phi. The {Loop} node itself and its accompanying
48 // 1 bit per loop per node per direction are required during the marking phase.
76 if (ni.node == nullptr) continue;
78 int index = ni.node->id() * width_ + INDEX(i);
91 PrintF(" #%d:%s\n", ni.node->id(), ni.node->op()->mnemonic());
107 Node* end_;
124 bool PropagateBackwardMarks(Node* from, Node* to, int loop_filter) {
140 bool SetBackwardMark(Node* to, int loop_num) {
149 bool SetForwardMark(Node* to, int loop_num) {
158 bool PropagateForwardMarks(Node* from, Node* to) {
173 bool IsInLoop(Node* node, int loop_num) {
174 int offset = node->id() * width_ + INDEX(loop_num);
185 Node* node = queue_.front();
186 info(node);
188 queued_.Set(node, false);
192 if (node->opcode() == IrOpcode::kLoop) {
193 // found the loop node first.
194 loop_num = CreateLoopInfo(node);
195 } else if (NodeProperties::IsPhi(node)) {
197 Node* merge = node->InputAt(node->InputCount() - 1);
203 // Propagate marks backwards from this node.
204 for (int i = 0; i < node->InputCount(); i++) {
205 Node* input = node->InputAt(i);
211 if (PropagateBackwardMarks(node, input, loop_num)) Queue(input);
217 // Make a new loop if necessary for the given node.
218 int CreateLoopInfo(Node* node) {
219 int loop_num = LoopNum(node);
226 loops_.push_back({node, nullptr, nullptr, nullptr});
228 SetBackwardMark(node, loop_num);
229 loop_tree_->node_to_loop_num_[node->id()] = loop_num;
232 for (Node* use : node->uses()) {
274 Node* node = queue_.front();
276 queued_.Set(node, false);
277 for (Edge edge : node->use_edges()) {
278 Node* use = edge.from();
280 if (PropagateForwardMarks(node, use)) Queue(use);
286 bool IsBackedge(Node* use, Edge& edge) {
295 int LoopNum(Node* node) { return loop_tree_->node_to_loop_num_[node->id()]; }
297 NodeInfo& info(Node* node) {
298 NodeInfo& i = info_[node->id()];
299 if (i.node == nullptr) i.node = node;
303 void Queue(Node* node) {
304 if (!queued_.Get(node)) {
305 queue_.push_back(node);
306 queued_.Set(node, true);
321 // Place the node into the innermost nested loop of which it is a member.
323 if (ni.node == nullptr) continue;
327 int pos = ni.node->id() * width_;
345 if (LoopNum(ni.node) == innermost_index) {
355 // Serialize the node lists for loops into the loop tree.
370 if (ni.node == nullptr || !IsInLoop(ni.node, 1)) continue;
371 if (LoopNum(ni.node) == 1) {
381 // Serialize the node lists for the loop into the loop tree.
395 loop_tree_->loop_nodes_.push_back(ni->node);
396 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
402 loop_tree_->loop_nodes_.push_back(ni->node);
403 loop_tree_->node_to_loop_num_[ni->node->id()] = loop_num;
421 if (IsInLoop(ni.node, i)) {
462 Node* LoopTree::HeaderNode(Loop* loop) {
463 Node* first = *HeaderNodes(loop).begin();
466 Node* header = NodeProperties::GetControlInput(first);
