Lines Matching refs:use
111 early != cin) { // If not equal, must use slower algorithm
686 // Clone code, as old values may be in use.
969 // bias >= 0 if stride >0, so if stride is 2^n we can use &(-stride)
1237 Node* use = old_phi->last_out(i);
1238 igvn.rehash_node_delayed(use);
1240 for (uint j = 0; j < use->len(); j++) {
1241 if (use->in(j) == old_phi) {
1242 if (j < use->req()) use->set_req (j, id_old_phi);
1243 else use->set_prec(j, id_old_phi);
1495 // Since I am just swapping inputs I do not need to update def-use info
1514 // backedges into a private merge point and use the merge point as
1686 // Failed to find a suitable safept on the dom-path. Now use
1949 // self (only loops that we can apply loop predication may use their predicates)
2739 // I use a modified Vick/Tarjan algorithm. I need pre- and a post- visit
2884 // loop and it would then get properly optimized. What's the use of
2954 // Def-use info will have some dead stuff; dead stuff will have no
3035 // Normally I would use a set_loop here. But in this one special
3170 bool PhaseIdealLoop::verify_dominance(Node* n, Node* use, Node* LCA, Node* early) {
3174 // Make sure that there's a dominance path from use to LCA
3175 Node* d = use;
3179 tty->print_cr("*** Use %d isn't dominated by def %s", use->_idx, n->_idx);
3181 use->dump();
3203 Node *use = c->in(0)->in(j);
3204 if (_verify_only && use->is_top()) continue;
3205 LCA = dom_lca_for_get_late_ctrl( LCA, use, n );
3206 if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error;
3210 // For CFG data-users, use is in the block just prior
3211 Node *use = has_ctrl(c) ? get_ctrl(c) : c->in(0);
3212 LCA = dom_lca_for_get_late_ctrl( LCA, use, n );
3213 if (verify) had_error = verify_dominance(n, use, LCA, early) || had_error;
3234 // We use a conservative algorithm to identify potential interfering
3236 // input of this load are examined. Any use which is not a load and is
3346 // Intended use does not involve any growth for the array, so it could
3360 // Intended use does not involve any growth for the array, so it could
3387 Node* use = n->raw_out(i);
3392 if( _nodes[use->_idx] != NULL || use->is_top() ) { // Not dead?
3396 if( use->in(0) && (use->is_CFG() || use->is_Phi()) ) {
3397 if( !visited.test(use->_idx) )
3398 worklist.push(use);
3399 } else if( !visited.test_set(use->_idx) ) {
3400 nstack.push(n, i); // Save parent and next use's index.
3401 n = use; // Process all children of current use.
3402 cnt = use->outcnt();
3408 _deadlist.push(use);
3418 // Get saved parent node and next use's index. Visit the rest of uses.