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

Lines Matching refs:use
105   // that same edge.  On this point we must use the Honor System.
226   assert((int)n > 0, "use imax -= n only with a positive count");
296   assert(Compile::current() == C, "must use operator new(Compile*)");
350   assert( is_not_dead(n0), "can not use dead node");
362   assert( is_not_dead(n0), "can not use dead node");
363   assert( is_not_dead(n1), "can not use dead node");
376   assert( is_not_dead(n0), "can not use dead node");
377   assert( is_not_dead(n1), "can not use dead node");
378   assert( is_not_dead(n2), "can not use dead node");
392   assert( is_not_dead(n0), "can not use dead node");
393   assert( is_not_dead(n1), "can not use dead node");
394   assert( is_not_dead(n2), "can not use dead node");
395   assert( is_not_dead(n3), "can not use dead node");
410   assert( is_not_dead(n0), "can not use dead node");
411   assert( is_not_dead(n1), "can not use dead node");
412   assert( is_not_dead(n2), "can not use dead node");
413   assert( is_not_dead(n3), "can not use dead node");
414   assert( is_not_dead(n4), "can not use dead node");
431   assert( is_not_dead(n0), "can not use dead node");
432   assert( is_not_dead(n1), "can not use dead node");
433   assert( is_not_dead(n2), "can not use dead node");
434   assert( is_not_dead(n3), "can not use dead node");
435   assert( is_not_dead(n4), "can not use dead node");
436   assert( is_not_dead(n5), "can not use dead node");
454   assert( is_not_dead(n0), "can not use dead node");
455   assert( is_not_dead(n1), "can not use dead node");
456   assert( is_not_dead(n2), "can not use dead node");
457   assert( is_not_dead(n3), "can not use dead node");
458   assert( is_not_dead(n4), "can not use dead node");
459   assert( is_not_dead(n5), "can not use dead node");
460   assert( is_not_dead(n6), "can not use dead node");
570     //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim");
572   assert(outcnt() == 0, "deleting a node must not leave a dangling use");
707   assert( is_not_dead(n), "can not use dead node");
728   assert( is_not_dead(n), "can not use dead node");
769   // First remove corresponding def-use edge
779   assert( is_not_dead(n), "can not use dead node");
787   if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge
890   assert( is_not_dead(n), "can not use dead node");
1019 // If you modify the 'this' pointer's inputs, you should use
1021 // some new internal piece) you may use 'init_req' to set the initial
1023 // either case, def-use info is correctly maintained.
1037 // When making a Node for a constant use 'phase->makecon' or 'phase->intcon'.
1039 // The Right Thing with def-use info.
1043 // the same Opcode as the 'this' pointer use 'clone'.
1216 // worklist but this call is more efficient.  Do not update use-def info
1236         Node* use = dead->last_out(k);
1237         igvn->hash_delete(use);       // Yank from hash table prior to mod
1238         if (use->in(0) == dead) {     // Found another dead node
1239           assert (!use->is_Con(), "Control for Con node should be Root node.");
1240           use->set_req(0, top);       // Cut dead edge to prevent processing
1241           nstack.push(use);           // the dead node again.
1243           for (uint j = 1; j < use->req(); j++) {
1244             if (use->in(j) == dead) { // Turn all dead inputs into TOP
1245               use->set_req(j, top);
1248           igvn->_worklist.push(use);
1340 // Nodes which use memory without consuming it, hence need antidependences.
1813     // Verify my input has a def-use edge to me
1815       // Count use-def edges from n to x
1820       // Count def-use edges from x to n
1825       assert( cnt == 0, "mismatched def-use edge counts" );
1969         Node* use = def->fast_out(i);
1970         if (use->Opcode() == opc &&
1971             use->req() == req()) {
1973           for (j = 0; j < use->req(); j++) {
1974             if (use->in(j) != in(j)) {
1978           if (j == use->req()) {
1979             return use;
1994     Node* use = raw_out(i);
1995     if (use->is_CFG() && use != this) {
1997       found = use;