Cross Reference: /openjdk7/hotspot/src/share/vm/opto/compile.cpp

Lines Matching refs:node
50 #include "opto/node.hpp"
87 // Constant table base node singleton.
336   // If 'top' is cached, declare it useful to preserve cached node
359     // If node with index node_idx is not in useful set,
360     // mark it as dead in dead node list.
394         // Only need to remove this out-edge to the useless node
411   // Remove useless expensive node
790   // After parsing, node notes are no longer automagic.
1123 // Install the cached top node, and make sure Node::is_top works correctly.
1138   // Get useful node list by walking the graph.
1157   // Get useful node list by walking the graph.
1204     assert(tn->is_Con(), "top node must be a constant");
1205     assert(((ConNode*)tn)->type() == Type::TOP, "top node must have correct type");
1206     assert(tn->in(0) != NULL, "must have live top node");
1236   // Leave a bread crumb trail pointing to the original node:
1245   // This is a copy onto a pre-existing node, which may already have notes.
2396   if ( n->outcnt() == 0 ) return; // dead node
2592         // Look for existing ConN node of the same exact type.
2630         // and Matcher can fold a DecodeN node into address by using
2636         // On other platforms (Sparc) we have to keep new DecodeN node and
2643         // Pin the new DecodeN node to non-null path on these platform (Sparc)
2644         // to keep the information to which NULL check the new DecodeN node
2890       if (in2->outcnt() == 0) { // Remove dead node
2915 // requires that the walk visits a node's inputs before visiting the node.
2920   frc._visited.set(root->_idx); // first, mark node as visited
2942       n = nstack.node();   // Get node from stack
2945       nstack.pop();        // Shift to the next node on stack
2955   // if the DecodeN node is referenced only in a debug info.
3217       // Now make sure that no visited node is used by an unvisited node.
3228           // At this point, we have found a dead node which is DU-reachable.
3479   // We can use the node pointer here to identify the right jump-table
3506     assert(*constant_addr == (((address) n) + i), err_msg_res("all jump-table entries must contain adjusted node pointer: " INTPTR_FORMAT " == " INTPTR_FORMAT, *constant_addr, (((address) n) + i)));