Lines Matching defs:uses
695 // The convention the interpreter uses is that the second local
765 // The convention the interpreter uses is that the second local
784 // The convention the interpreter uses is that the second local
2114 // If this does not have uses then schedule it
2337 // uses outside the current basic block. As we are doing a backwards walk,
2341 // the available list to the set of instructions that have no uses within this
2374 // Account for all uses
2394 tty->print("# uses: %3d: ", _uses[n->_idx]);
2511 // in the block that have no uses within the block.
2709 Node *uses = kill->is_Proj() ? kill->in(0) : kill;
2710 for( uint i=1; i<uses->req(); i++ ) {
2711 if( _regalloc->get_reg_first(uses->in(i)) == def_reg ||
2712 _regalloc->get_reg_second(uses->in(i)) == def_reg ) {
2760 // of: a def, then some uses (connected to the def by true dependencies),
2761 // then some kills (defs with no uses), finally the cycle repeats with a new
2762 // def. The uses are allowed to float relative to each other, as are the
2764 // antidependencies between all uses of a single def and all kills that
2797 int is_def = n->outcnt(); // def if some uses prior to adding precedence edges
2890 // register is anti-dependent on a set of uses (or defs), rather