Lines Matching refs:node
37 #include "opto/node.hpp"
85 new_in = transform_later(new_in); // Register new node.
209 assert(false, "unexpected projection from allocation node.");
237 // It could be only one user, URShift node, in Object.clone() instrinsic
245 // Take Region node before eliminating post barrier since it also
246 // eliminates CastP2X node when it has only one user.
355 // We are looking for stored value, return Initialize node
356 // or memory edge from Allocate node.
368 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
449 assert(false, "Object is not scalar replaceable if a LoadStore node access its field");
454 assert(false, "unknown node on this path");
456 return NULL; // unknown node on this path
532 assert(false, "unexpected node");
550 Node* n = value_phis.node();
645 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";)
806 tty->print("=== At SafePoint node %d can't find value of Field: ",
812 tty->print("=== At SafePoint node %d can't find value of array element [%d]",
899 // Eliminate Initialize node.
1083 AllocateNode* alloc, // allocation node to be expanded
1411 // allocate node with the call
1423 // Identify the output projections from the allocate node and
1435 // An allocate node has separate memory projections for the uses on
1466 // An allocate node has separate i_o projections for the uses on the control
1579 // This can happen if a node is allocated but an uncommon trap occurs
1645 // true node, add prefetchdistance
1792 // for elimination. Later obj could be replaced with a new node (new phi)
1801 return; // This BoxLock node was processed already.
1804 // node for each locked region so mark all associated locks/unlocks as
1828 // Create new "eliminated" BoxLock node and use it in monitor debug info
1832 // Note: BoxLock node is marked eliminated only here and it is used
1838 // Replace old box node with new box for all users of the same object.
1892 // Only Lock node has JVMState needed here.
1898 // Note: BoxLock node is marked eliminated only here
1931 // Replace old box node with new eliminated box for all users
1940 // eliminate the node without expanding it.
1952 // Check that new "eliminated" BoxLock node is created.
1983 // There are 2 projections from the lock. The lock node will
1997 // Seach for MemBarAcquireLock node and delete it also.
2005 // Delete FastLock node also if this Lock node is unique user
2006 // (a loop peeling may clone a Lock node).
2014 // Seach for MemBarReleaseLock node and delete it also.
2213 // Call CAS-based locking scheme (FastLock node).
2387 n->Opcode() == Op_Opaque2, "unknown node type in macro list");
2401 // Make sure expansion will not cause node limit to be exceeded.
2402 // Worst case is a macro node gets expanded into about 50 nodes.
2436 // node is unreachable, so don't try to expand it
2454 assert(false, "unknown node type in macro list");
2456 assert(C->macro_count() < macro_count, "must have deleted a node from macro list");