3196   // an infinite loop may have been eliminated by the optimizer,
3197   // in which case the graph will be empty.
3198   if (root()->req() == 1) {
3199     record_method_not_compilable("trivial infinite loop");
3200     return true;
3201   }
3202 
3203   // Expensive nodes have their control input set to prevent the GVN
3204   // from freely commoning them. There's no GVN beyond this point so
3205   // no need to keep the control input. We want the expensive nodes to
3206   // be freely moved to the least frequent code path by gcm.
3207   assert(OptimizeExpensiveOps || expensive_count() == 0, "optimization off but list non empty?");
3208   for (int i = 0; i < expensive_count(); i++) {
3209     _expensive_nodes->at(i)->set_req(0, NULL);
3210   }
3211 
3212   Final_Reshape_Counts frc;
3213 
3214   // Visit everybody reachable!
3215   // Allocate stack of size C->unique()/2 to avoid frequent realloc
3216   Node_Stack nstack(unique() >> 1);
3217   final_graph_reshaping_walk(nstack, root(), frc);
3218 
3219   // Check for unreachable (from below) code (i.e., infinite loops).
3220   for( uint i = 0; i < frc._tests.size(); i++ ) {
3221     MultiBranchNode *n = frc._tests[i]->as_MultiBranch();
3222     // Get number of CFG targets.
3223     // Note that PCTables include exception targets after calls.
3224     uint required_outcnt = n->required_outcnt();
3225     if (n->outcnt() != required_outcnt) {
3226       // Check for a few special cases.  Rethrow Nodes never take the
3227       // 'fall-thru' path, so expected kids is 1 less.
3228       if (n->is_PCTable() && n->in(0) && n->in(0)->in(0)) {
3229         if (n->in(0)->in(0)->is_Call()) {
3230           CallNode *call = n->in(0)->in(0)->as_Call();
3231           if (call->entry_point() == OptoRuntime::rethrow_stub()) {
3232             required_outcnt--;      // Rethrow always has 1 less kid
3233           } else if (call->req() > TypeFunc::Parms &&
3234                      call->is_CallDynamicJava()) {
3235             // Check for null receiver. In such case, the optimizer has
3236             // detected that the virtual call will always result in a null

3196   // an infinite loop may have been eliminated by the optimizer,
3197   // in which case the graph will be empty.
3198   if (root()->req() == 1) {
3199     record_method_not_compilable("trivial infinite loop");
3200     return true;
3201   }
3202 
3203   // Expensive nodes have their control input set to prevent the GVN
3204   // from freely commoning them. There's no GVN beyond this point so
3205   // no need to keep the control input. We want the expensive nodes to
3206   // be freely moved to the least frequent code path by gcm.
3207   assert(OptimizeExpensiveOps || expensive_count() == 0, "optimization off but list non empty?");
3208   for (int i = 0; i < expensive_count(); i++) {
3209     _expensive_nodes->at(i)->set_req(0, NULL);
3210   }
3211 
3212   Final_Reshape_Counts frc;
3213 
3214   // Visit everybody reachable!
3215   // Allocate stack of size C->unique()/2 to avoid frequent realloc
3216   Node_Stack nstack(live_nodes() >> 1);
3217   final_graph_reshaping_walk(nstack, root(), frc);
3218 
3219   // Check for unreachable (from below) code (i.e., infinite loops).
3220   for( uint i = 0; i < frc._tests.size(); i++ ) {
3221     MultiBranchNode *n = frc._tests[i]->as_MultiBranch();
3222     // Get number of CFG targets.
3223     // Note that PCTables include exception targets after calls.
3224     uint required_outcnt = n->required_outcnt();
3225     if (n->outcnt() != required_outcnt) {
3226       // Check for a few special cases.  Rethrow Nodes never take the
3227       // 'fall-thru' path, so expected kids is 1 less.
3228       if (n->is_PCTable() && n->in(0) && n->in(0)->in(0)) {
3229         if (n->in(0)->in(0)->is_Call()) {
3230           CallNode *call = n->in(0)->in(0)->as_Call();
3231           if (call->entry_point() == OptoRuntime::rethrow_stub()) {
3232             required_outcnt--;      // Rethrow always has 1 less kid
3233           } else if (call->req() > TypeFunc::Parms &&
3234                      call->is_CallDynamicJava()) {
3235             // Check for null receiver. In such case, the optimizer has
3236             // detected that the virtual call will always result in a null