Lines Matching refs:Node
113 Node* map(Node* node) {
118 void Insert(Node* original, Node* copy) {
124 void CopyNodes(Graph* graph, Zone* tmp_zone, Node* dead, NodeRange nodes) {
127 for (Node* node : nodes) {
129 for (Node* input : node->inputs()) {
132 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]);
140 for (Node* original : nodes) {
141 Node* copy = pairs->at(node_map.Get(original));
148 bool Marked(Node* node) { return node_map.Get(node) > 0; }
159 Node* PeeledIteration::map(Node* node) {
172 Node* loop_node = loop_tree->GetLoopControl(loop);
173 for (Node* node : loop_tree->LoopNodes(loop)) {
174 for (Node* use : node->uses()) {
190 Node* loop_node = loop_tree->GetLoopControl(loop);
192 "Cannot peel loop %i. Loop exit without explicit mark: Node %i "
219 Node* dead = graph->NewNode(common->Dead());
222 for (Node* node : loop_tree->HeaderNodes(loop)) {
232 Node* loop_node = loop_tree->GetLoopControl(loop);
233 Node* new_entry;
242 Node* merge =
246 for (Node* node : loop_tree->HeaderNodes(loop)) {
252 for (Node* input : inputs) {
256 Node* phi = graph->NewNode(op, backedges + 1, &inputs[0]);
266 for (Node* node : loop_tree->HeaderNodes(loop)) {
276 for (Node* exit : loop_tree->ExitNodes(loop)) {
317 for (Node* node : loop_tree->HeaderNodes(loop)) {
326 void EliminateLoopExit(Node* node) {
332 Node* marker = edge.from();
363 ZoneQueue<Node*> queue(temp_zone);
367 Node* node = queue.front();
371 Node* control = NodeProperties::GetControlInput(node);
379 Node* control = NodeProperties::GetControlInput(node, i);