Thu, 04 Dec 2008 17:29:56 -0800 6739363: Xcheck jni doesn't check native function arguments
poonam [Thu, 04 Dec 2008 17:29:56 -0800] rev 1618
6739363: Xcheck jni doesn't check native function arguments Summary: Fix adds support for verifying arguments with -Xcheck:jni. Reviewed-by: coleenp
Thu, 04 Dec 2008 13:21:16 -0800 Merge
jmasa [Thu, 04 Dec 2008 13:21:16 -0800] rev 1617
Merge
Thu, 04 Dec 2008 09:04:46 -0800 Merge
jmasa [Thu, 04 Dec 2008 09:04:46 -0800] rev 1616
Merge
Wed, 03 Dec 2008 14:18:57 -0800 6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus()
iveresov [Wed, 03 Dec 2008 14:18:57 -0800] rev 1615
6779436: NUMA allocator: libnuma expects certain size of the buffer in numa_node_to_cpus() Summary: In os::Linux::rebuild_cpu_to_node_map() fix the size of the CPU bitmap. Fixed arithmetic in MutableNUMASpace::adaptive_chunk_size() that could cause overflows and underflows of the chunk_size variable. Reviewed-by: apetrusenko
Thu, 04 Dec 2008 08:55:34 -0800 Merge
kvn [Thu, 04 Dec 2008 08:55:34 -0800] rev 1614
Merge
Wed, 03 Dec 2008 13:41:37 -0800 6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now")
kvn [Wed, 03 Dec 2008 13:41:37 -0800] rev 1613
6775880: EA +DeoptimizeALot: assert(mon_info->owner()->is_locked(),"object must be locked now") Summary: Create new "eliminated" BoxLock node for monitor debug info when corresponding locks are eliminated. Reviewed-by: never
Tue, 25 Nov 2008 13:14:07 -0800 6756768: C1 generates invalid code
never [Tue, 25 Nov 2008 13:14:07 -0800] rev 1612
6756768: C1 generates invalid code Reviewed-by: kvn, jrose
Wed, 03 Dec 2008 14:44:48 -0800 Merge
jmasa [Wed, 03 Dec 2008 14:44:48 -0800] rev 1611
Merge
Mon, 01 Dec 2008 23:25:24 -0800 6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr [Mon, 01 Dec 2008 23:25:24 -0800] rev 1610
6778647: snap(), snap_policy() should be renamed setup(), setup_policy() Summary: Renamed Reference{Policy,Pocessor} methods from snap{,_policy}() to setup{,_policy}() Reviewed-by: apetrusenko
Thu, 27 Nov 2008 18:19:23 -0800 6743339: Enable building sa-jdi.jar and sawindbg.dll on Windows with hotspot build
poonam [Thu, 27 Nov 2008 18:19:23 -0800] rev 1609
6743339: Enable building sa-jdi.jar and sawindbg.dll on Windows with hotspot build Summary: These changes enable the SA binaries build with hotspot build on Windows Reviewed-by: swamyv
Wed, 26 Nov 2008 09:24:57 -0800 Merge
iveresov [Wed, 26 Nov 2008 09:24:57 -0800] rev 1608
Merge
Mon, 24 Nov 2008 09:53:31 -0800 6774607: SIGSEGV or (!is_null(v),"oop value can never be zero") assertion when running with CMS and COOPs
ysr [Mon, 24 Nov 2008 09:53:31 -0800] rev 1607
6774607: SIGSEGV or (!is_null(v),"oop value can never be zero") assertion when running with CMS and COOPs Summary: Use the more permissive set_klass_or_null() and klass_or_null() interfaces in ParNew's workqueue overflow code that manipulates the klass-word. Reviewed-by: coleenp
Thu, 20 Nov 2008 16:56:09 -0800 6684579: SoftReference processing can be made more efficient
ysr [Thu, 20 Nov 2008 16:56:09 -0800] rev 1606
6684579: SoftReference processing can be made more efficient Summary: For current soft-ref clearing policies, we can decide at marking time if a soft-reference will definitely not be cleared, postponing the decision of whether it will definitely be cleared to the final reference processing phase. This can be especially beneficial in the case of concurrent collectors where the marking is usually concurrent but reference processing is usually not. Reviewed-by: jmasa
Thu, 20 Nov 2008 12:27:41 -0800 6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr [Thu, 20 Nov 2008 12:27:41 -0800] rev 1605
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists Summary: When we encounter marking stack overflow during precleaning of Reference lists, we were using the overflow list mechanism, which can cause problems on account of mutating the mark word of the header because of conflicts with mutator accesses and updates of that field. Instead we should use the usual mechanism for overflow handling in concurrent phases, namely dirtying of the card on which the overflowed object lies. Since precleaning effectively does a form of discovered list processing, albeit with discovery enabled, we needed to adjust some code to be correct in the face of interleaved processing and discovery. Reviewed-by: apetrusenko, jcoomes
(0) -1000 -300 -100 -14 +14 +100 +300 +1000 +3000 +10000 +30000 tip