Lines Matching refs:node
11 #include "src/compiler/node-marker.h"
12 #include "src/compiler/node-origin-table.h"
13 #include "src/compiler/node-properties.h"
14 #include "src/compiler/node.h"
115 Node* PeeledIteration::map(Node* node) {
120 if (impl->node_pairs_[i] == node) return impl->node_pairs_[i + 1];
122 return node;
138 for (Node* node : loop_tree_->HeaderNodes(loop)) {
139 copier.Insert(node, node->InputAt(kAssumedLoopEntryIndex));
163 for (Node* node : loop_tree_->HeaderNodes(loop)) {
164 if (node->opcode() == IrOpcode::kLoop) continue; // already done.
167 inputs.push_back(copier.map(node->InputAt(1 + i)));
172 const Operator* op = common_->ResizeMergeOrPhi(node->op(), backedges);
174 node->ReplaceInput(0, phi);
183 for (Node* node : loop_tree_->HeaderNodes(loop)) {
184 node->ReplaceInput(0, copier.map(node->InputAt(1)));
196 // Change the loop exit node to a merge node.
230 for (Node* node : loop_tree_->HeaderNodes(loop)) {
231 PrintF("%i ", node->id());
239 void LoopPeeler::EliminateLoopExit(Node* node) {
240 DCHECK_EQ(IrOpcode::kLoopExit, node->opcode());
243 for (Edge edge : node->use_edges()) {
256 NodeProperties::ReplaceUses(node, nullptr, nullptr,
257 NodeProperties::GetControlInput(node, 0));
258 node->Kill();
275 Node* node = queue.front();
278 if (node->opcode() == IrOpcode::kLoopExit) {
279 Node* control = NodeProperties::GetControlInput(node);
280 EliminateLoopExit(node);
286 for (int i = 0; i < node->op()->ControlInputCount(); i++) {
287 Node* control = NodeProperties::GetControlInput(node, i);