Lines Matching defs:node
12 #include "src/compiler/node-marker.h"
13 #include "src/compiler/node-origin-table.h"
14 #include "src/compiler/node-properties.h"
15 #include "src/compiler/node.h"
75 // Return the innermost nested loop, if any, that contains {node}.
76 Loop* ContainingLoop(Node* node) {
77 if (node->id() >= node_to_loop_num_.size()) return nullptr;
78 int num = node_to_loop_num_[node->id()];
82 // Check if the {loop} contains the {node}, either directly or by containing
83 // a nested loop that contains {node}.
84 bool Contains(const Loop* loop, Node* node) {
85 for (Loop* c = ContainingLoop(node); c != nullptr; c = c->parent_) {
116 // Return the header control node for a loop.
137 // Return the node that represents the control, i.e. the loop node itself.
139 // TODO(turbofan): make the loop control node always first?
140 for (Node* node : HeaderNodes(loop)) {
141 if (node->opcode() == IrOpcode::kLoop) return node;
209 // Returns the mapping of {node} in the {copy_index}'th copy, or {node} itself
211 Node* map(Node* node, uint32_t copy_index);
214 V8_INLINE Node* map(Node* node) { return map(node, 0); }
251 bool Marked(Node* node) { return node_map_.Get(node) > 0; }
254 // Maps a node to its index in the {copies_} vector.