Thu, 11 Feb 2010 15:52:19 -0800 6923991: G1: improve scalability of RSet scanning
iveresov [Thu, 11 Feb 2010 15:52:19 -0800] rev 4902
6923991: G1: improve scalability of RSet scanning Summary: Implemented block-based work stealing. Moved copying during the rset scanning phase to the main copying phase. Made the size of rset table depend on the region size. Reviewed-by: apetrusenko, tonyp
Tue, 09 Feb 2010 13:56:09 -0800 6782663: Data produced by PrintGCApplicationConcurrentTime and PrintGCApplicationStoppedTime is not accurate.
johnc [Tue, 09 Feb 2010 13:56:09 -0800] rev 4901
6782663: Data produced by PrintGCApplicationConcurrentTime and PrintGCApplicationStoppedTime is not accurate. Summary: Update and display the timers associated with these flags for all safepoints. Reviewed-by: ysr, jcoomes
Mon, 08 Feb 2010 14:23:01 -0500 6802453: G1: hr()->is_in_reserved(from),"Precondition."
tonyp [Mon, 08 Feb 2010 14:23:01 -0500] rev 4900
6802453: G1: hr()->is_in_reserved(from),"Precondition." Summary: The operations of re-using a RSet component and expanding the same RSet component were not mutually exlusive, and this could lead to RSets getting corrupted and entries being dropped. Reviewed-by: iveresov, johnc
Fri, 05 Feb 2010 11:05:50 -0500 6920977: G1: guarantee(k == probe->klass(),"klass should be in dictionary") fails
tonyp [Fri, 05 Feb 2010 11:05:50 -0500] rev 4899
6920977: G1: guarantee(k == probe->klass(),"klass should be in dictionary") fails Summary: the guarantee is too strict and the test will fail (incorrectly) if the class is not in the system dictionary but in the placeholders. Reviewed-by: acorn, phh
Fri, 12 Feb 2010 15:27:36 -0800 Merge
kvn [Fri, 12 Feb 2010 15:27:36 -0800] rev 4898
Merge
Fri, 12 Feb 2010 10:34:11 -0800 6926048: Improve Zero performance
kvn [Fri, 12 Feb 2010 10:34:11 -0800] rev 4897
6926048: Improve Zero performance Summary: Make Zero figure out result types in a similar way to C++ interpreter implementation. Reviewed-by: kvn Contributed-by: gbenson@redhat.com
Fri, 12 Feb 2010 08:54:13 -0800 6925249: assert(last_sp < (intptr_t*) interpreter_frame_monitor_begin(),"bad tos")
kvn [Fri, 12 Feb 2010 08:54:13 -0800] rev 4896
6925249: assert(last_sp < (intptr_t*) interpreter_frame_monitor_begin(),"bad tos") Summary: Fix assert since top deoptimized frame has last_sp == interpreter_frame_monitor_begin if there are no expressions. Reviewed-by: twisti
Tue, 09 Feb 2010 10:21:06 -0800 6924097: assert((_type == Type::MEMORY) == (_adr_type != 0),"adr_type for memory phis only")
kvn [Tue, 09 Feb 2010 10:21:06 -0800] rev 4895
6924097: assert((_type == Type::MEMORY) == (_adr_type != 0),"adr_type for memory phis only") Summary: Use PhiNode::make_blank(r, n) method to construct the phi. Reviewed-by: never
Tue, 09 Feb 2010 01:31:13 -0800 6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop")
kvn [Tue, 09 Feb 2010 01:31:13 -0800] rev 4894
6910618: C2: Error: assert(d->is_oop(),"JVM_ArrayCopy: dst not an oop") Summary: Mark in PcDesc call sites which return oop and save the result oop across objects reallocation during deoptimization. Reviewed-by: never
Mon, 08 Feb 2010 12:20:09 -0800 6910605: C2: NullPointerException/ClassCaseException is thrown when C2 with DeoptimizeALot is used
kvn [Mon, 08 Feb 2010 12:20:09 -0800] rev 4893
6910605: C2: NullPointerException/ClassCaseException is thrown when C2 with DeoptimizeALot is used Summary: Set the reexecute bit for runtime calls _new_array_Java when they used for _multianewarray bytecode. Reviewed-by: never
Sun, 07 Feb 2010 12:15:06 -0800 6923002: assert(false,"this call site should not be polymorphic")
kvn [Sun, 07 Feb 2010 12:15:06 -0800] rev 4892
6923002: assert(false,"this call site should not be polymorphic") Summary: Clear the total count when a receiver information is cleared. Reviewed-by: never, jrose
Fri, 05 Feb 2010 11:07:40 -0800 6920293: OptimizeStringConcat causing core dumps
never [Fri, 05 Feb 2010 11:07:40 -0800] rev 4891
6920293: OptimizeStringConcat causing core dumps Reviewed-by: kvn, twisti
(0) -3000 -1000 -300 -100 -12 +12 +100 +300 +1000 +3000 +10000 +30000 tip