Lines Matching refs:node
145 // The type of all node counts and indexes.
205 // from. This should allow fast access to node creation & deletion. This
281 // users of this node.
305 // Iterate over the out-edges of this node. Deletions are illegal.
309 // Does the node have an out at this position? (Used for iteration.)
312 // Iterate over the out-edges of this node. All changes are illegal.
315 // Iterate over the out-edges of this node, deleting one at a time.
320 // Iterate over the out-edges of this node. Deletions are illegal.
328 // Does the node have an out at this position? (Used for iteration.)
331 // Iterate over the out-edges of this node. All changes are illegal.
341 // Iterate over the out-edges of this node, deleting one at a time.
377 // Check whether node has become unreachable
386 assert( is_not_dead(n), "can not use dead node");
389 "remove node from hash table before modifying it");
395 // Light version of set_req() to init inputs after node creation.
398 is_not_dead(n), "can not use dead node");
401 "remove node from hash table before modifying it");
455 // Globally replace this node by a given new node, updating all uses.
457 // Globally replace this node by a given new node, updating all uses
458 // and cutting input edges of old node.
470 assert( is_not_dead(n), "can not use dead node");
476 // Set this node's index, used by cisc_version to replace current node
489 // If this node is in the hash table, make sure it doesn't need a rehash.
501 // Class id is the set of bits corresponded to the node class and all its
534 // This enum is used only for C2 ideal and mach nodes with is_<node>() methods
654 assert(c <= _max_classes, "invalid node class");
658 assert(fl <= _max_flags, "invalid node flag");
662 assert(fl <= _max_flags, "invalid node flag");
683 assert(is_##type(), "invalid node class"); \
776 // The data node which is safe to leave in dead loop during IGVN optimization.
788 // If this node is control-dependent on a test, can it be
811 // The node is a "macro" node which needs to be expanded before matching
813 // The node is expensive: the best control is set during loop opts
821 // If we find a better type for a node, try to record it permanently.
822 // Return true if this node actually changed.
826 // Get the address type with which this node uses and/or defs memory,
829 // Returns TypePtr::BOTTOM if the node touches memory "broadly".
832 // Return an existing node which computes the same function as this node.
840 // Return a node which is more "ideal" than the current node.
842 // treatise in node.cpp above the default implemention AND TEST WITH
854 // Check if 'this' node dominates or equal to 'sub'.
868 // Compute the latency from the def to this instruction of the ith input node
874 // the node is guaranteed never to compare equal to any other node.
875 // If we accidentally generate a hash with value NO_HASH the node
886 // Determine if a node is Counted loop induction variable.
890 // Return a node with opcode "opc" and same inputs as "this" if one can
927 // Convenience function to extract an integer constant from a node.
967 // More specifically, needs_anti_dependence_check returns true iff the node
992 void dump() const { dump("\n"); } // Print this node.
993 void dump(const char* suffix, outputStream *st = tty) const;// Print this node.
994 void dump(int depth) const; // Print this node, recursively to depth d
999 virtual void dump_spec(outputStream *st) const {}; // Print per-node info
1026 int _debug_idx; // Unique value assigned to every node.
1041 const Node* _last_del; // The last deleted node.
1057 const Node* _node; // the node containing the _out array
1058 uint _outcnt; // cached node->_outcnt
1059 uint _del_tick; // cached node->_del_tick
1062 void sample(const Node* node); // used by c'tor to set up for verifies
1063 void verify(const Node* node, bool at_end_ok = false);
1102 void sample(const Node* node); // Initialize _refresh_tick etc.
1103 void verify(const Node* node, bool at_end_ok = false);
1111 DUIterator(const Node* node, int dummy_to_avoid_conversion)
1112 { _idx = 0; debug_only(sample(node)); }
1150 // no reloading of pointers from the original node x. If you delete,
1165 void verify(const Node* node, bool at_end_ok = false);
1173 DUIterator_Fast(const Node* node, ptrdiff_t offset)
1174 { _outp = node->_out + offset; debug_only(sample(node)); }
1220 // no reloading of pointers from the original node x.
1225 void verify(const Node* node, bool at_end_ok = false);
1231 DUIterator_Last(const Node* node, ptrdiff_t offset)
1232 : DUIterator_Fast(node, offset) { }
1281 Node* node;
1285 SimpleDUIterator(Node* n): node(n), i(n->fast_outs(imax)) {}
1288 Node* get() { return node->fast_out(i); }
1303 void grow( uint i ); // Grow array node to fit
1407 Node *node; // Processed node
1408 uint indx; // Index of next node's child
1432 assert(_inode_top >= _inodes, "node stack underflow");
1439 top->node = n;
1442 Node *node() const {
1443 return _inode_top->node;
1447 return _inodes[i].node;
1457 _inode_top->node = n;
1498 // Make a new, clean node notes.
1562 // If this node is in the hash table, make sure it doesn't need a rehash.