1.1 --- a/src/share/vm/opto/chaitin.cpp Tue Jan 06 16:10:11 2009 -0800
1.2 +++ b/src/share/vm/opto/chaitin.cpp Wed Jan 07 11:04:45 2009 -0800
1.3 @@ -307,7 +307,7 @@
1.4 if (C->failing()) return;
1.5
1.6 #ifdef ASSERT
1.7 - if( VerifyOpto ) {
1.8 + if( VerifyOpto || VerifyRegisterAllocator ) {
1.9 _cfg.verify();
1.10 verify_base_ptrs(&live_arena);
1.11 }
1.12 @@ -340,7 +340,7 @@
1.13 compress_uf_map_for_nodes();
1.14
1.15 #ifdef ASSERT
1.16 - if( VerifyOpto ) _ifg->verify(this);
1.17 + if( VerifyOpto || VerifyRegisterAllocator ) _ifg->verify(this);
1.18 #endif
1.19 } else {
1.20 ifg.SquareUp();
1.21 @@ -377,7 +377,7 @@
1.22 C->check_node_count(2*NodeLimitFudgeFactor, "out of nodes after split");
1.23 if (C->failing()) return;
1.24 #ifdef ASSERT
1.25 - if( VerifyOpto ) {
1.26 + if( VerifyOpto || VerifyRegisterAllocator ) {
1.27 _cfg.verify();
1.28 verify_base_ptrs(&live_arena);
1.29 }
1.30 @@ -412,7 +412,7 @@
1.31 }
1.32 compress_uf_map_for_nodes();
1.33 #ifdef ASSERT
1.34 - if( VerifyOpto ) _ifg->verify(this);
1.35 + if( VerifyOpto || VerifyRegisterAllocator ) _ifg->verify(this);
1.36 #endif
1.37 cache_lrg_info(); // Count degree of LRGs
1.38
1.39 @@ -956,7 +956,7 @@
1.40 while ((neighbor = elements.next()) != 0) {
1.41 LRG *n = &lrgs(neighbor);
1.42 #ifdef ASSERT
1.43 - if( VerifyOpto ) {
1.44 + if( VerifyOpto || VerifyRegisterAllocator ) {
1.45 assert( _ifg->effective_degree(neighbor) == n->degree(), "" );
1.46 }
1.47 #endif
