Wed, 18 Feb 2009 18:20:02 -0800 6807345: Bump HS15 build number to 02
trims [Wed, 18 Feb 2009 18:20:02 -0800] rev 2036
6807345: Bump HS15 build number to 02 Summary: Update the HS15 Build number to 02 Reviewed-by: jcoomes
Wed, 18 Feb 2009 18:14:18 -0800 Merge
trims [Wed, 18 Feb 2009 18:14:18 -0800] rev 2035
Merge
Tue, 17 Feb 2009 14:30:24 -0800 Merge
kvn [Tue, 17 Feb 2009 14:30:24 -0800] rev 2034
Merge
Tue, 17 Feb 2009 11:19:31 +0100 6805950: Typos in andL_rReg_imm instructions in x86_64.ad
twisti [Tue, 17 Feb 2009 11:19:31 +0100] rev 2033
6805950: Typos in andL_rReg_imm instructions in x86_64.ad Summary: There are two typos in andL_rReg_imm instructions in x86_64.ad. Reviewed-by: kvn
Mon, 16 Feb 2009 07:19:26 -0800 6805724: ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant.
twisti [Mon, 16 Feb 2009 07:19:26 -0800] rev 2032
6805724: ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant. Summary: C2, ModLNode::Ideal() generates functionally incorrect graph when divisor is any (2^k-1) constant. Reviewed-by: rasbold
Fri, 13 Feb 2009 09:09:35 -0800 6800154: Add comments to long_by_long_mulhi() for better understandability
twisti [Fri, 13 Feb 2009 09:09:35 -0800] rev 2031
6800154: Add comments to long_by_long_mulhi() for better understandability Summary: This patch adds a comment pointing to the Hacker's Delight version of the algorithm plus a verbatim copy of it. Furthermore it adds inline comments. Reviewed-by: kvn, jrose
Fri, 06 Feb 2009 13:31:03 -0800 6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly")
kvn [Fri, 06 Feb 2009 13:31:03 -0800] rev 2030
6791852: assert(b->_nodes[insidx] == n,"got insidx set incorrectly") Summary: Move the CreateEx up before each round of IFG construction Reviewed-by: never, phh
Thu, 05 Feb 2009 14:43:58 -0800 6799693: Server compiler leads to data corruption when expression throws an Exception
kvn [Thu, 05 Feb 2009 14:43:58 -0800] rev 2029
6799693: Server compiler leads to data corruption when expression throws an Exception Summary: Use merged memory state for an allocation's slow path. Reviewed-by: never
(0) -1000 -300 -100 -30 -10 -8 +8 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip