*** old/src/share/vm/opto/loopnode.cpp	Fri Feb  4 14:12:16 2011
--- new/src/share/vm/opto/loopnode.cpp	Fri Feb  4 14:12:16 2011

*** 1478,1487 ****
--- 1478,1489 ----
  //=============================================================================
  //----------------------------build_and_optimize-------------------------------
  // Create a PhaseLoop.  Build the ideal Loop tree.  Map each Ideal Node to
  // its corresponding LoopNode.  If 'optimize' is true, do some loop cleanups.
  void PhaseIdealLoop::build_and_optimize(bool do_split_ifs, bool do_loop_pred) {
+   ResourceMark rm;
+ 
    int old_progress = C->major_progress();
  
    // Reset major-progress flag for the driver's heuristics
    C->clear_major_progress();
  

*** 2011,2021 ****
--- 2013,2023 ----
      }
    }
    if (_dom_stk == NULL) {
      uint init_size = C->unique() / 100; // Guess that 1/100 is a reasonable initial size.
      if (init_size < 10) init_size = 10;
!     _dom_stk = new (C->node_arena()) GrowableArray<uint>(C->node_arena(), init_size, 0, 0);
!     _dom_stk = new GrowableArray<uint>(init_size);
    }
    // Compute new depth for each node.
    for (i = 0; i < _idom_size; i++) {
      uint j = i;
      // Run up the dom tree to find a node with a depth