Mercurial > jdk8-mips64-public > hotspot / annotate
test/compiler/6851282/Test.java@f90c822e73f8 (annotated)
test/compiler/6851282/Test.java
Wed, 27 Apr 2016 01:25:04 +0800
- author
- aoqi
- date
- Wed, 27 Apr 2016 01:25:04 +0800
- changeset 0
- f90c822e73f8
- child 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | /** |
| aoqi@0 | 26 | * @test |
| aoqi@0 | 27 | * @bug 6851282 |
| aoqi@0 | 28 | * @summary JIT miscompilation results in null entry in array when using CompressedOops |
| aoqi@0 | 29 | * |
| aoqi@0 | 30 | * @run main/othervm/timeout=600 -Xmx256m -XX:+IgnoreUnrecognizedVMOptions -XX:+UseCompressedOops Test |
| aoqi@0 | 31 | */ |
| aoqi@0 | 32 | |
| aoqi@0 | 33 | import java.util.ArrayList; |
| aoqi@0 | 34 | import java.util.List; |
| aoqi@0 | 35 | |
| aoqi@0 | 36 | public class Test { |
| aoqi@0 | 37 | void foo(A a, A[] as) { |
| aoqi@0 | 38 | for (A a1 : as) { |
| aoqi@0 | 39 | B[] filtered = a.c(a1); |
| aoqi@0 | 40 | for (B b : filtered) { |
| aoqi@0 | 41 | if (b == null) { |
| aoqi@0 | 42 | System.out.println("bug: b == null"); |
| aoqi@0 | 43 | System.exit(97); |
| aoqi@0 | 44 | } |
| aoqi@0 | 45 | } |
| aoqi@0 | 46 | } |
| aoqi@0 | 47 | } |
| aoqi@0 | 48 | |
| aoqi@0 | 49 | public static void main(String[] args) { |
| aoqi@0 | 50 | List<A> as = new ArrayList<A>(); |
| aoqi@0 | 51 | for (int i = 0; i < 5000; i++) { |
| aoqi@0 | 52 | List<B> bs = new ArrayList<B>(); |
| aoqi@0 | 53 | for (int j = i; j < i + 1000; j++) |
| aoqi@0 | 54 | bs.add(new B(j)); |
| aoqi@0 | 55 | as.add(new A(bs.toArray(new B[0]))); |
| aoqi@0 | 56 | } |
| aoqi@0 | 57 | new Test().foo(as.get(0), as.subList(1, as.size()).toArray(new A[0])); |
| aoqi@0 | 58 | } |
| aoqi@0 | 59 | } |
| aoqi@0 | 60 | |
| aoqi@0 | 61 | class A { |
| aoqi@0 | 62 | final B[] bs; |
| aoqi@0 | 63 | |
| aoqi@0 | 64 | public A(B[] bs) { |
| aoqi@0 | 65 | this.bs = bs; |
| aoqi@0 | 66 | } |
| aoqi@0 | 67 | |
| aoqi@0 | 68 | final B[] c(final A a) { |
| aoqi@0 | 69 | return new BoxedArray<B>(bs).filter(new Function<B, Boolean>() { |
| aoqi@0 | 70 | public Boolean apply(B arg) { |
| aoqi@0 | 71 | for (B b : a.bs) { |
| aoqi@0 | 72 | if (b.d == arg.d) |
| aoqi@0 | 73 | return true; |
| aoqi@0 | 74 | } |
| aoqi@0 | 75 | return false; |
| aoqi@0 | 76 | } |
| aoqi@0 | 77 | }); |
| aoqi@0 | 78 | } |
| aoqi@0 | 79 | } |
| aoqi@0 | 80 | |
| aoqi@0 | 81 | class BoxedArray<T> { |
| aoqi@0 | 82 | |
| aoqi@0 | 83 | private final T[] array; |
| aoqi@0 | 84 | |
| aoqi@0 | 85 | BoxedArray(T[] array) { |
| aoqi@0 | 86 | this.array = array; |
| aoqi@0 | 87 | } |
| aoqi@0 | 88 | |
| aoqi@0 | 89 | public T[] filter(Function<T, Boolean> function) { |
| aoqi@0 | 90 | boolean[] include = new boolean[array.length]; |
| aoqi@0 | 91 | int len = 0; |
| aoqi@0 | 92 | int i = 0; |
| aoqi@0 | 93 | while (i < array.length) { |
| aoqi@0 | 94 | if (function.apply(array[i])) { |
| aoqi@0 | 95 | include[i] = true; |
| aoqi@0 | 96 | len += 1; |
| aoqi@0 | 97 | } |
| aoqi@0 | 98 | i += 1; |
| aoqi@0 | 99 | } |
| aoqi@0 | 100 | T[] result = (T[]) java.lang.reflect.Array.newInstance(array.getClass().getComponentType(), len); |
| aoqi@0 | 101 | len = 0; |
| aoqi@0 | 102 | i = 0; |
| aoqi@0 | 103 | while (len < result.length) { |
| aoqi@0 | 104 | if (include[i]) { |
| aoqi@0 | 105 | result[len] = array[i]; |
| aoqi@0 | 106 | len += 1; |
| aoqi@0 | 107 | } |
| aoqi@0 | 108 | i += 1; |
| aoqi@0 | 109 | } |
| aoqi@0 | 110 | return result; |
| aoqi@0 | 111 | } |
| aoqi@0 | 112 | } |
| aoqi@0 | 113 | |
| aoqi@0 | 114 | interface Function<T, R> { |
| aoqi@0 | 115 | R apply(T arg); |
| aoqi@0 | 116 | } |
| aoqi@0 | 117 | |
| aoqi@0 | 118 | class B { |
| aoqi@0 | 119 | final int d; |
| aoqi@0 | 120 | public B(int d) { |
| aoqi@0 | 121 | this.d = d; |
| aoqi@0 | 122 | } |
| aoqi@0 | 123 | } |
| aoqi@0 | 124 |
