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

Lines Matching refs:use
217         // This is the first use of this intrinsic as a virtual call.
223         // This is the first use of this intrinsic as a non-virtual
298     Node* use = n->last_out(i);
299     bool is_in_table = initial_gvn()->hash_delete(use);
301     for (uint j = 0; j < use->len(); j++) {
302       if (use->in(j) == n) {
303         if (j < use->req())
304           use->set_req(j, nn);
306           use->set_prec(j, nn);
312       initial_gvn()->hash_find_insert(use);
314     record_for_igvn(use);
510   // constant section is big enough, use it.  Otherwise free the
945     set_initial_gvn(&gvn);    // not significant, but GraphKit guys use it pervasively
1341     // Arrays of bytes and of booleans both use 'bastore' and 'baload' so
1409     // use NotNull as the PTR.
2149     // Perform register allocation.  After Chaitin, use-def chains are
2399   // Check for 2-input instruction with "last use" on right input.
2402       n->in(1)->outcnt() > 1 && // left use is NOT a last use
2404       n->in(2)->outcnt() == 1 &&// right use IS a last use
2405       !n->in(2)->is_Con() ) {   // right use is not a constant
2413       // Move "last use" input to left by swapping inputs
2434   // Count all float operations that may use FPU
2455   // Count all double operations that may use FPU
2637         // use it to do implicit NULL check in address:
2645         // corresponds to use it as value in implicit_null_check().
2699           // and the uncommon path (== NULL) will use narrow_oop_reg directly
2770           Node *use = i.get();
2771           if (use->is_Proj() && p != use && use->as_Proj()->_con == p->_con) {
2772             proj = use;
3142     // Note that we use cumulative trap_count, not just md->trap_count.
3159 // Is not eager to return true, since this will cause the compiler to use
3224           Node* use = n->raw_out(i);
3225           if (checked.member(use))  continue;  // already checked
3226           if (visited.member(use))  continue;  // already in the graph
3227           if (use->is_Con())        continue;  // a dead ConNode is OK
3231           use->dump(2);
3233           checked.push(use);  // No repeats; pretend it is now checked.
3245 // ciEnv might use two Compile objects, if C2Compiler::compile_method decides
3337     // We use T_VOID as marker for jump-table entries (labels) which
3415     // We use T_VOID as marker for jump-table entries (labels) which
3479   // We can use the node pointer here to identify the right jump-table