Wed, 06 Apr 2011 17:32:09 -0700 6992789: assert(phi->_idx >= nodes_size()) failed: only new Phi per instance memory slice
kvn [Wed, 06 Apr 2011 17:32:09 -0700] rev 9115
6992789: assert(phi->_idx >= nodes_size()) failed: only new Phi per instance memory slice Summary: Swap checks: check for regular memory slice first and keep input phi. Reviewed-by: never
Wed, 06 Apr 2011 16:02:50 -0700 7034513: enable fast accessors and empty methods for ZERO and -Xint
never [Wed, 06 Apr 2011 16:02:50 -0700] rev 9114
7034513: enable fast accessors and empty methods for ZERO and -Xint Reviewed-by: kvn, iveresov
Tue, 05 Apr 2011 19:16:52 -0700 7033779: CodeCache::largest_free_block may need to hold the CodeCache lock
never [Tue, 05 Apr 2011 19:16:52 -0700] rev 9113
7033779: CodeCache::largest_free_block may need to hold the CodeCache lock Reviewed-by: kvn
Tue, 05 Apr 2011 02:31:46 -0700 Merge
never [Tue, 05 Apr 2011 02:31:46 -0700] rev 9112
Merge
Tue, 05 Apr 2011 00:31:09 -0700 6777083: assert(target != __null,"must not be null")
never [Tue, 05 Apr 2011 00:31:09 -0700] rev 9111
6777083: assert(target != __null,"must not be null") Reviewed-by: iveresov, kvn
Tue, 05 Apr 2011 00:27:58 -0700 Merge
kvn [Tue, 05 Apr 2011 00:27:58 -0700] rev 9110
Merge
Mon, 04 Apr 2011 19:02:36 -0700 7004547: regular loop unroll should not unroll more than max unrolling
kvn [Mon, 04 Apr 2011 19:02:36 -0700] rev 9109
7004547: regular loop unroll should not unroll more than max unrolling Summary: Take into account that after unroll conjoined heads and tails will fold. Reviewed-by: never
Mon, 04 Apr 2011 22:17:15 -0700 Merge
never [Mon, 04 Apr 2011 22:17:15 -0700] rev 9108
Merge
Mon, 04 Apr 2011 19:03:35 -0700 6528013: C1 CTW failure with -XX:+VerifyOops assert(allocates2(pc),"")
never [Mon, 04 Apr 2011 19:03:35 -0700] rev 9107
6528013: C1 CTW failure with -XX:+VerifyOops assert(allocates2(pc),"") Reviewed-by: kvn, iveresov
Mon, 04 Apr 2011 18:48:49 -0700 Merge
iveresov [Mon, 04 Apr 2011 18:48:49 -0700] rev 9106
Merge
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip