src/share/vm/opto/chaitin.cpp

*** 305,315 ****
      // or we failed to split
      C->check_node_count(2*NodeLimitFudgeFactor, "out of nodes after physical split");
      if (C->failing())  return;
  
  #ifdef ASSERT
!     if( VerifyOpto ) {
        _cfg.verify();
        verify_base_ptrs(&live_arena);
      }
  #endif
      NOT_PRODUCT( C->verify_graph_edges(); )
--- 305,315 ----
      // or we failed to split
      C->check_node_count(2*NodeLimitFudgeFactor, "out of nodes after physical split");
      if (C->failing())  return;
  
  #ifdef ASSERT
!     if( VerifyOpto || VerifyRegisterAllocator ) {
        _cfg.verify();
        verify_base_ptrs(&live_arena);
      }
  #endif
      NOT_PRODUCT( C->verify_graph_edges(); )
*** 338,348 ****
        coalesce.coalesce_driver( );
      }
      compress_uf_map_for_nodes();
  
  #ifdef ASSERT
!     if( VerifyOpto ) _ifg->verify(this);
  #endif
    } else {
      ifg.SquareUp();
      ifg.Compute_Effective_Degree();
  #ifdef ASSERT
--- 338,348 ----
        coalesce.coalesce_driver( );
      }
      compress_uf_map_for_nodes();
  
  #ifdef ASSERT
!     if( VerifyOpto || VerifyRegisterAllocator ) _ifg->verify(this);
  #endif
    } else {
      ifg.SquareUp();
      ifg.Compute_Effective_Degree();
  #ifdef ASSERT
*** 375,385 ****
      _maxlrg = Split( _maxlrg );        // Split spilling LRG everywhere
      // Bail out if unique gets too large (ie - unique > MaxNodeLimit - 2*NodeLimitFudgeFactor)
      C->check_node_count(2*NodeLimitFudgeFactor, "out of nodes after split");
      if (C->failing())  return;
  #ifdef ASSERT
!     if( VerifyOpto ) {
        _cfg.verify();
        verify_base_ptrs(&live_arena);
      }
  #endif
  
--- 375,385 ----
      _maxlrg = Split( _maxlrg );        // Split spilling LRG everywhere
      // Bail out if unique gets too large (ie - unique > MaxNodeLimit - 2*NodeLimitFudgeFactor)
      C->check_node_count(2*NodeLimitFudgeFactor, "out of nodes after split");
      if (C->failing())  return;
  #ifdef ASSERT
!     if( VerifyOpto || VerifyRegisterAllocator ) {
        _cfg.verify();
        verify_base_ptrs(&live_arena);
      }
  #endif
  
*** 410,420 ****
        // Check for few live ranges determines how aggressive coalesce is.
        coalesce.coalesce_driver( );
      }
      compress_uf_map_for_nodes();
  #ifdef ASSERT
!     if( VerifyOpto ) _ifg->verify(this);
  #endif
      cache_lrg_info();           // Count degree of LRGs
  
      // Simplify the InterFerence Graph by removing LRGs of low degree.
      // LRGs of low degree are trivially colorable.
--- 410,420 ----
        // Check for few live ranges determines how aggressive coalesce is.
        coalesce.coalesce_driver( );
      }
      compress_uf_map_for_nodes();
  #ifdef ASSERT
!     if( VerifyOpto || VerifyRegisterAllocator ) _ifg->verify(this);
  #endif
      cache_lrg_info();           // Count degree of LRGs
  
      // Simplify the InterFerence Graph by removing LRGs of low degree.
      // LRGs of low degree are trivially colorable.
*** 954,964 ****
        IndexSetIterator elements(adj);
        uint neighbor;
        while ((neighbor = elements.next()) != 0) {
          LRG *n = &lrgs(neighbor);
  #ifdef ASSERT
!         if( VerifyOpto ) {
            assert( _ifg->effective_degree(neighbor) == n->degree(), "" );
          }
  #endif
  
          // Check for just becoming of-low-degree just counting registers.
--- 954,964 ----
        IndexSetIterator elements(adj);
        uint neighbor;
        while ((neighbor = elements.next()) != 0) {
          LRG *n = &lrgs(neighbor);
  #ifdef ASSERT
!         if( VerifyOpto || VerifyRegisterAllocator ) {
            assert( _ifg->effective_degree(neighbor) == n->degree(), "" );
          }
  #endif
  
          // Check for just becoming of-low-degree just counting registers.