Lines Matching refs:use
88 // TODO: Should use a ShouldNotReachHereNode...
614 assert( local, "use _top instead of null" );
1279 assert(delay_slot == NULL, "no use of delay slot node");
1629 // We can use the same code as for the normal deopt handler, we
1900 Node *use = bb->_nodes[j];
1901 uint nlen = use->len();
1905 Node *def = use->in(k);
1909 uint l = _node_latency[def->_idx] + use->latency(k);
1914 _node_latency[use->_idx] = latency;
1919 use->dump();
2330 // Walk all the definitions, decrementing use counts, and
2331 // if a definition has a 0 use count, place it in the available list.
2336 // This method sets the use count within a basic block. We will ignore all
2338 // any node we reach that has a use count of 0 may be scheduled. This also
2379 if( _bbs[inp->_idx] == bb ) { // Block-local use?
2382 ++_uses[inp->_idx]; // Count 1 block-local use
2386 // If this instruction has a 0 use count, then it is available
2707 // See if current kill is also a use, and so is forced to be the pinch-point.
2713 // Yes, found a use/kill pinch-point
2728 void Scheduling::anti_do_use( Block *b, Node *use, OptoReg::Name use_reg ) {
2735 _bbs[use->_idx] == b ) {
2739 // Insert the pinch-point in the block just after the last use
2740 b->_nodes.insert(b->find_node(use)+1,pinch);
2744 add_prec_edge_from_to(pinch,use);
2763 // kills. No use is allowed to slide past a kill (or def). This requires
2768 // one use or more than one kill/def.
2820 Node* use = n->fast_out(i);
2821 if (use->is_Proj()) {
2822 RegMask rm = use->out_RegMask();// Make local copy
2847 // Add precedence edge from following safepoint to use of derived pointer
2892 // and use (or def), a pinch is inserted between them:
2943 Node* use = pinch->last_out(i);
2945 for (uint j = use->req(); j < use->len(); j++) {
2946 if (use->in(j) == pinch) {
2947 use->rm_prec(j);