Lines Matching refs:def
570 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim");
769 // First remove corresponding def-use edge
787 if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge
1023 // either case, def-use info is correctly maintained.
1039 // The Right Thing with def-use info.
1216 // worklist but this call is more efficient. Do not update use-def info
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" );
1966 Node* def = in(1);
1967 if (def && def->outcnt() >= 2) {
1968 for (DUIterator_Fast dmax, i = def->fast_outs(dmax); i < dmax; i++) {
1969 Node* use = def->fast_out(i);