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

Lines Matching defs:that
9  * This code is distributed in the hope that it will be useful, but WITHOUT
12  * version 2 for more details (a copy is included in the LICENSE file that
59     // Arrange that the lowest five decimal digits of _debug_idx
100   // Ensure that the loop body has just deleted the last guy produced.
102   // Ensure that at least one copy of the last-seen edge was deleted.
104   // Unfortunately, we have no way to verify that all the deletions delete
105   // that same edge.  On this point we must use the Honor System.
113 void DUIterator_Common::reset(const DUIterator_Common& that) {
114   if (this == &that)  return;  // ignore assignment to self
117     _last = that._last;
118     _vdui = that._vdui;
123   const Node* node = that._node;
156 void DUIterator::reset(const DUIterator& that) {
157   if (this == &that)  return;  // self assignment is always a no-op
158   assert(that._refresh_tick == 0, "assign only the result of Node::outs()");
159   assert(that._idx          == 0, "assign only the result of Node::outs()");
160   assert(_idx               == that._idx, "already assigned _idx");
163     sample(that._node);
165     DUIterator_Common::reset(that);
181   // If this assert triggers, it means that a loop used refresh_out_pos
184   // This iterator enforces the rule that you must keep trying the loop
208     // Note that the limit imax, not the pointer i, gets updated with the
212     // Fudge the _last field so that the common assert will be happy.
231   // Fudge the _last field so that the common assert will be happy.
236 void DUIterator_Fast::reset(const DUIterator_Fast& that) {
237   assert(_outp              == that._outp, "already assigned _outp");
238   DUIterator_Common::reset(that);
282 // (Aren't you thankful that Java finals don't require so many tricks?)
654   // This assertion makes sure that Node::_max is wide enough to
678   // This assertion makes sure that Node::_max is wide enough to
954 // Nodes that end basic blocks, e.g. IfTrue/IfFalse, JumpProjNode, Root,
981 // Return a node that the given node is equivalent to.
1091 // We already know that if any path back to Root or Start reaches 'this',
1124         // to make sure that it did not walk in a cycle.
1131       // We assume there are no alternative paths that avoid 'dom'.
1191       // Set 0 bit to indicate that both paths were taken.
1744 // For each input edge to a node (ie - for each Use-Def edge), verify that