Wed, 06 Aug 2008 11:57:31 -0400 6722565: G1: assert !r->is_on_unclean_list() fires
tonyp [Wed, 06 Aug 2008 11:57:31 -0400] rev 1387
6722565: G1: assert !r->is_on_unclean_list() fires Summary: Under certain circumstances, two cleanup threads can claim and process the same region. Reviewed-by: apetrusenko, ysr
Wed, 30 Jul 2008 10:45:52 -0700 6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425
iveresov [Wed, 30 Jul 2008 10:45:52 -0700] rev 1386
6652160: G1: assert(cur_used_bytes == _g1->recalculate_used(),"It should!") at g1CollectorPolicy.cpp:1425 Summary: In attempt_allocation_slow() wait for the concurrent cleanup to complete before modifying _summary_bytes_used. Reviewed-by: jmasa, apetrusenko
Thu, 10 Jul 2008 09:29:54 -0700 6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!)
iveresov [Thu, 10 Jul 2008 09:29:54 -0700] rev 1385
6723570: G1: assertion failure: p == current_top or oop(p)->is_oop(),"p is not a block start" (revisited!) Summary: Fixed the incorrect assigment to G1OffsetTableContigSpace::_gc_time_stamp. Also added a little more paranoia to operations on a global timestamp. Reviewed-by: tonyp
Thu, 03 Jul 2008 03:17:29 -0700 6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start")
iveresov [Thu, 03 Jul 2008 03:17:29 -0700] rev 1384
6702387: G1: assertion failure: assert(p == current_top || oop(p)->is_oop(),"p is not a block start") Summary: Do not coalesce dead and moved objects when removing self-forwarding pointers during the evacuation failure. Also fixed a issue in a BOT refinement code for TLABs. Reviewed-by: tonyp, jcoomes
Tue, 01 Jul 2008 11:59:44 -0700 Merge
ysr [Tue, 01 Jul 2008 11:59:44 -0700] rev 1383
Merge
Mon, 30 Jun 2008 17:04:59 -0700 6618726: Introduce -XX:+UnlockExperimentalVMOptions flag
ysr [Mon, 30 Jun 2008 17:04:59 -0700] rev 1382
6618726: Introduce -XX:+UnlockExperimentalVMOptions flag Summary: experimental() flags will protect features of an experimental nature that are not supported in the regular product build. Made UseG1GC an experimental flag. Reviewed-by: jmasa, kamg, coleenp
Thu, 26 Jun 2008 11:43:34 -0700 6718811: Mismerge of 6680469:macro.cpp
ysr [Thu, 26 Jun 2008 11:43:34 -0700] rev 1381
6718811: Mismerge of 6680469:macro.cpp Summary: Fixed the mismerge by deleting the lines that were inadvertently left in place. Reviewed-by: iveresov
Tue, 24 Jun 2008 13:20:34 -0700 Merge
ysr [Tue, 24 Jun 2008 13:20:34 -0700] rev 1380
Merge
Mon, 23 Jun 2008 16:49:37 -0700 6718086: CMS assert: _concurrent_iteration_safe_limit update missed
ysr [Mon, 23 Jun 2008 16:49:37 -0700] rev 1379
6718086: CMS assert: _concurrent_iteration_safe_limit update missed Summary: Initialize the field correctly in ContiguousSpace's constructor and initialize() methods, using the latter for the survivor spaces upon initial construction or a subsequent resizing of the young generation. Add some missing Space sub-class constructors. Reviewed-by: apetrusenko
Tue, 17 Jun 2008 08:40:48 -0700 Merge
ysr [Tue, 17 Jun 2008 08:40:48 -0700] rev 1378
Merge
Thu, 12 Jun 2008 14:02:35 -0700 Merge
ysr [Thu, 12 Jun 2008 14:02:35 -0700] rev 1377
Merge
Thu, 12 Jun 2008 13:50:55 -0700 Merge
ysr [Thu, 12 Jun 2008 13:50:55 -0700] rev 1376
Merge
Wed, 11 Jun 2008 05:12:19 -0700 6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...)
iveresov [Wed, 11 Jun 2008 05:12:19 -0700] rev 1375
6710665: G1: guarantee(_cm->out_of_regions() && _cm->region_stack_empty() && _task_queue->size() == 0, ...) Summary: Remove the incorrect assumptions from guarantee()s. Reviewed-by: ysr, tonyp
Thu, 05 Jun 2008 15:57:56 -0700 6711316: Open source the Garbage-First garbage collector
ysr [Thu, 05 Jun 2008 15:57:56 -0700] rev 1374
6711316: Open source the Garbage-First garbage collector Summary: First mercurial integration of the code for the Garbage-First garbage collector. Reviewed-by: apetrusenko, iveresov, jmasa, sgoldman, tonyp, ysr
(0) -1000 -300 -100 -14 +14 +100 +300 +1000 +3000 +10000 +30000 tip