2583       break;
2584     case Node::Class_AllocateArray:
2585       expand_allocate_array(n->as_AllocateArray());
2586       break;
2587     case Node::Class_Lock:
2588       expand_lock_node(n->as_Lock());
2589       break;
2590     case Node::Class_Unlock:
2591       expand_unlock_node(n->as_Unlock());
2592       break;
2593     default:
2594       assert(false, "unknown node type in macro list");
2595     }
2596     assert(C->macro_count() < macro_count, "must have deleted a node from macro list");
2597     if (C->failing())  return true;
2598   }
2599 
2600   _igvn.set_delay_transform(false);
2601   _igvn.optimize();
2602   if (C->failing())  return true;
2603   BarrierSetC2* bs = BarrierSet::barrier_set()->barrier_set_c2();
2604   return bs->expand_macro_nodes(this);
2605 }

2583       break;
2584     case Node::Class_AllocateArray:
2585       expand_allocate_array(n->as_AllocateArray());
2586       break;
2587     case Node::Class_Lock:
2588       expand_lock_node(n->as_Lock());
2589       break;
2590     case Node::Class_Unlock:
2591       expand_unlock_node(n->as_Unlock());
2592       break;
2593     default:
2594       assert(false, "unknown node type in macro list");
2595     }
2596     assert(C->macro_count() < macro_count, "must have deleted a node from macro list");
2597     if (C->failing())  return true;
2598   }
2599 
2600   _igvn.set_delay_transform(false);
2601   _igvn.optimize();
2602   if (C->failing())  return true;
2603   return false;

2604 }