• file
• revisions
• annotate
• diff
• comparison
• raw

test/compiler/6661247/Test.java@dbb05f6d93c4 (annotated)

test/compiler/6661247/Test.java

Mon, 28 Jul 2014 15:06:38 -0700

author

fzhinkin

date

Mon, 28 Jul 2014 15:06:38 -0700

changeset 6997

dbb05f6d93c4

parent 1907

c18cbe5936b8

child 6876

710a3c8b516e

permissions

-rw-r--r--

8051344: JVM crashed in Compile::start() during method parsing w/ UseRTMDeopt turned on
Summary: call rtm_deopt() only if there were no compilation bailouts before.
Reviewed-by: kvn

never@505	1	/*
trims@1907	2	* Copyright (c) 1997, 2008, Oracle and/or its affiliates. All rights reserved.
kamg@612	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
never@505	4	*
kamg@612	5	* This code is free software; you can redistribute it and/or modify it
kamg@612	6	* under the terms of the GNU General Public License version 2 only, as
kamg@612	7	* published by the Free Software Foundation.
never@505	8	*
kamg@612	9	* This code is distributed in the hope that it will be useful, but WITHOUT
kamg@612	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
kamg@612	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
kamg@612	12	* version 2 for more details (a copy is included in the LICENSE file that
kamg@612	13	* accompanied this code).
never@505	14	*
kamg@612	15	* You should have received a copy of the GNU General Public License version
kamg@612	16	* 2 along with this work; if not, write to the Free Software Foundation,
kamg@612	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
never@505	18	*
trims@1907	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907	20	* or visit www.oracle.com if you need additional information or have any
trims@1907	21	* questions.
never@505	22	*
never@505	23	*/
never@505	24
never@505	25	/*
never@505	26	* @test
never@505	27	* @bug 6661247
never@505	28	* @summary Internal bug in 32-bit HotSpot optimizer while bit manipulations
never@505	29	*/
never@505	30
never@505	31	import java.util.Random;
never@505	32	import java.nio.*;
never@505	33
never@505	34	// This isn't a completely reliable test for 6661247 since the results
never@505	35	// depend on what the local schedule looks like but it does reproduce
never@505	36	// the issue in current builds.
never@505	37
never@505	38	public class Test {
never@505	39
never@505	40	public static void test(boolean[] src, int srcPos, LongBuffer dest, long destPos, int count) {
never@505	41	int countStart = (destPos & 63) == 0 ? 0 : 64 - (int)(destPos & 63);
never@505	42	if (countStart > count)
never@505	43	countStart = count;
never@505	44	for (int srcPosMax = srcPos + countStart; srcPos < srcPosMax; srcPos++, destPos++) {
never@505	45	if (src[srcPos])
never@505	46	dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63));
never@505	47	else
never@505	48	dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63)));
never@505	49	}
never@505	50	count -= countStart;
never@505	51	int cnt = count >>> 6;
never@505	52	for (int k = (int)(destPos >>> 6), kMax = k + cnt; k < kMax; k++) {
never@505	53	int low = (src[srcPos] ? 1 : 0)
never@505	54	| (src[srcPos + 1] ? 1 << 1 : 0)
never@505	55	| (src[srcPos + 2] ? 1 << 2 : 0)
never@505	56	| (src[srcPos + 3] ? 1 << 3 : 0)
never@505	57	| (src[srcPos + 4] ? 1 << 4 : 0)
never@505	58	| (src[srcPos + 5] ? 1 << 5 : 0)
never@505	59	| (src[srcPos + 6] ? 1 << 6 : 0)
never@505	60	| (src[srcPos + 7] ? 1 << 7 : 0)
never@505	61	| (src[srcPos + 8] ? 1 << 8 : 0)
never@505	62	| (src[srcPos + 9] ? 1 << 9 : 0)
never@505	63	| (src[srcPos + 10] ? 1 << 10 : 0)
never@505	64	| (src[srcPos + 11] ? 1 << 11 : 0)
never@505	65	| (src[srcPos + 12] ? 1 << 12 : 0)
never@505	66	| (src[srcPos + 13] ? 1 << 13 : 0)
never@505	67	| (src[srcPos + 14] ? 1 << 14 : 0)
never@505	68	| (src[srcPos + 15] ? 1 << 15 : 0)
never@505	69	| (src[srcPos + 16] ? 1 << 16 : 0)
never@505	70	| (src[srcPos + 17] ? 1 << 17 : 0)
never@505	71	| (src[srcPos + 18] ? 1 << 18 : 0)
never@505	72	| (src[srcPos + 19] ? 1 << 19 : 0)
never@505	73	| (src[srcPos + 20] ? 1 << 20 : 0)
never@505	74	| (src[srcPos + 21] ? 1 << 21 : 0)
never@505	75	| (src[srcPos + 22] ? 1 << 22 : 0)
never@505	76	| (src[srcPos + 23] ? 1 << 23 : 0)
never@505	77	| (src[srcPos + 24] ? 1 << 24 : 0)
never@505	78	| (src[srcPos + 25] ? 1 << 25 : 0)
never@505	79	| (src[srcPos + 26] ? 1 << 26 : 0)
never@505	80	| (src[srcPos + 27] ? 1 << 27 : 0)
never@505	81	| (src[srcPos + 28] ? 1 << 28 : 0)
never@505	82	| (src[srcPos + 29] ? 1 << 29 : 0)
never@505	83	| (src[srcPos + 30] ? 1 << 30 : 0)
never@505	84	| (src[srcPos + 31] ? 1 << 31 : 0)
never@505	85	;
never@505	86	srcPos += 32;
never@505	87	int high = (src[srcPos] ? 1 : 0) // PROBLEM!
never@505	88	| (src[srcPos + 1] ? 1 << 1 : 0)
never@505	89	| (src[srcPos + 2] ? 1 << 2 : 0)
never@505	90	| (src[srcPos + 3] ? 1 << 3 : 0)
never@505	91	| (src[srcPos + 4] ? 1 << 4 : 0)
never@505	92	| (src[srcPos + 5] ? 1 << 5 : 0)
never@505	93	| (src[srcPos + 6] ? 1 << 6 : 0)
never@505	94	| (src[srcPos + 7] ? 1 << 7 : 0)
never@505	95	| (src[srcPos + 8] ? 1 << 8 : 0)
never@505	96	| (src[srcPos + 9] ? 1 << 9 : 0)
never@505	97	| (src[srcPos + 10] ? 1 << 10 : 0)
never@505	98	| (src[srcPos + 11] ? 1 << 11 : 0)
never@505	99	| (src[srcPos + 12] ? 1 << 12 : 0)
never@505	100	| (src[srcPos + 13] ? 1 << 13 : 0)
never@505	101	| (src[srcPos + 14] ? 1 << 14 : 0)
never@505	102	| (src[srcPos + 15] ? 1 << 15 : 0)
never@505	103	| (src[srcPos + 16] ? 1 << 16 : 0)
never@505	104	| (src[srcPos + 17] ? 1 << 17 : 0)
never@505	105	| (src[srcPos + 18] ? 1 << 18 : 0)
never@505	106	| (src[srcPos + 19] ? 1 << 19 : 0)
never@505	107	| (src[srcPos + 20] ? 1 << 20 : 0)
never@505	108	| (src[srcPos + 21] ? 1 << 21 : 0)
never@505	109	| (src[srcPos + 22] ? 1 << 22 : 0)
never@505	110	| (src[srcPos + 23] ? 1 << 23 : 0)
never@505	111	| (src[srcPos + 24] ? 1 << 24 : 0)
never@505	112	| (src[srcPos + 25] ? 1 << 25 : 0)
never@505	113	| (src[srcPos + 26] ? 1 << 26 : 0)
never@505	114	| (src[srcPos + 27] ? 1 << 27 : 0)
never@505	115	| (src[srcPos + 28] ? 1 << 28 : 0)
never@505	116	| (src[srcPos + 29] ? 1 << 29 : 0)
never@505	117	| (src[srcPos + 30] ? 1 << 30 : 0)
never@505	118	| (src[srcPos + 31] ? 1 << 31 : 0)
never@505	119	;
never@505	120	srcPos += 32;
never@505	121	dest.put(k, ((long)low & 0xFFFFFFFFL) | (((long)high) << 32));
never@505	122	destPos += 64;
never@505	123	}
never@505	124	int countFinish = count & 63;
never@505	125	for (int srcPosMax = srcPos + countFinish; srcPos < srcPosMax; srcPos++, destPos++) {
never@505	126	if (src[srcPos])
never@505	127	dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63));
never@505	128	else
never@505	129	dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63)));
never@505	130	}
never@505	131	}
never@505	132	public static void main(String[] args) {
never@505	133	Random r = new Random();
never@505	134	int entries = 1000;
never@505	135	boolean[] src = new boolean[entries * 64];
never@505	136	long[] dest = new long[entries];
never@505	137	long[] result = new long[entries];
never@505	138
never@505	139	for (int c = 0; c < 2000; c++) {
never@505	140	for (int i = 0; i < entries; i++) {
never@505	141	long l = r.nextLong();
never@505	142	for (int bit = 0; bit < 64; bit++) {
never@505	143	src[i * 64 + bit] = (l & (1L << bit)) != 0;
never@505	144	}
never@505	145	dest[i] = 0;
never@505	146	result[i] = l;
never@505	147	}
never@505	148	test(src, 0, LongBuffer.wrap(dest, 0, dest.length), 0, src.length);
never@505	149	for (int i = 0; i < entries; i++) {
never@505	150	if (dest[i] != result[i]) {
never@505	151	throw new InternalError(i + ": " + Long.toHexString(dest[i]) + " != " + Long.toHexString(result[i]));
never@505	152	}
never@505	153	}
never@505	154	}
never@505	155	}
never@505	156	}