Lines Matching refs:node
112 // ie. two assignments: b := c, a := b start with node c:
115 // ie. cycle a := b, b := a start with node a
130 } // else dest is a start node
148 ResolveNode* node = virtual_operands()[i];
149 if (!node->visited()) {
151 move(NULL, node);
152 node->set_start_node();
159 ResolveNode* node = other_operands()[i];
160 for (int j = node->no_of_destinations() - 1; j >= 0; j --) {
161 emit_move(node->operand(), node->destination_at(j)->operand());
168 ResolveNode* node;
171 node = vreg_table().at_grow(vreg_num, NULL);
172 assert(node == NULL || node->operand() == opr, "");
173 if (node == NULL) {
174 node = new ResolveNode(opr);
175 vreg_table()[vreg_num] = node;
179 if (source && !virtual_operands().contains(node)) {
180 virtual_operands().append(node);
184 node = new ResolveNode(opr);
185 other_operands().append(node);
187 return node;
388 // This is called for each node in tree; the walk stops if a root is reached
1250 // TODO could try to substitute this node with an equivalent InstanceOf
1947 // the result is the same as from the node we are casting