Wed, 27 Aug 2014 08:19:12 -0400
8046598: Scalable Native memory tracking development
Summary: Enhance scalability of native memory tracking
Reviewed-by: coleenp, ctornqvi, gtriantafill
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2013, 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 | * @test |
aoqi@0 | 26 | * @bug 8007294 |
aoqi@0 | 27 | * @summary ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution |
aoqi@0 | 28 | * @run main/othervm -XX:+IgnoreUnrecognizedVMOptions -XX:+AlwaysIncrementalInline -XX:-UseOnStackReplacement -XX:-BackgroundCompilation Test8007294 |
aoqi@0 | 29 | * |
aoqi@0 | 30 | */ |
aoqi@0 | 31 | |
aoqi@0 | 32 | public class Test8007294 { |
aoqi@0 | 33 | |
aoqi@0 | 34 | int i1; |
aoqi@0 | 35 | int i2; |
aoqi@0 | 36 | |
aoqi@0 | 37 | Test8007294(int i1, int i2) { |
aoqi@0 | 38 | this.i1 = i1; |
aoqi@0 | 39 | this.i2 = i2; |
aoqi@0 | 40 | } |
aoqi@0 | 41 | |
aoqi@0 | 42 | static int m(int v) { |
aoqi@0 | 43 | return v; |
aoqi@0 | 44 | } |
aoqi@0 | 45 | |
aoqi@0 | 46 | static Test8007294 test1() { |
aoqi@0 | 47 | Test8007294 obj = new Test8007294(10, 100); |
aoqi@0 | 48 | int v1 = obj.i1; |
aoqi@0 | 49 | |
aoqi@0 | 50 | int v3 = m(v1); |
aoqi@0 | 51 | int v2 = obj.i2; |
aoqi@0 | 52 | obj.i2 = v3; |
aoqi@0 | 53 | obj.i1 = v2; |
aoqi@0 | 54 | |
aoqi@0 | 55 | return obj; |
aoqi@0 | 56 | } |
aoqi@0 | 57 | |
aoqi@0 | 58 | static int test2(int i) { |
aoqi@0 | 59 | int j = 0; |
aoqi@0 | 60 | if (i > 0) { |
aoqi@0 | 61 | j = 1; |
aoqi@0 | 62 | } |
aoqi@0 | 63 | |
aoqi@0 | 64 | int[] arr = new int[10]; |
aoqi@0 | 65 | arr[0] = 1; |
aoqi@0 | 66 | arr[1] = 2; |
aoqi@0 | 67 | int v1 = arr[j]; |
aoqi@0 | 68 | arr[0] = 3; |
aoqi@0 | 69 | arr[1] = 4; |
aoqi@0 | 70 | |
aoqi@0 | 71 | return v1; |
aoqi@0 | 72 | } |
aoqi@0 | 73 | |
aoqi@0 | 74 | static public void main(String[] args) { |
aoqi@0 | 75 | boolean failed = false; |
aoqi@0 | 76 | for (int i = 0; i < 20000; i++) { |
aoqi@0 | 77 | Test8007294 obj = test1(); |
aoqi@0 | 78 | if (obj.i1 != 100 || obj.i2 != 10) { |
aoqi@0 | 79 | System.out.println("FAILED test1 obj.i1 = " + obj.i1 +", obj.i2 = " + obj.i2); |
aoqi@0 | 80 | failed = true; |
aoqi@0 | 81 | break; |
aoqi@0 | 82 | } |
aoqi@0 | 83 | } |
aoqi@0 | 84 | for (int i = 0; i < 20000; i++) { |
aoqi@0 | 85 | int res = test2(1); |
aoqi@0 | 86 | if (res != 2) { |
aoqi@0 | 87 | System.out.println("FAILED test2 = " + res); |
aoqi@0 | 88 | failed = true; |
aoqi@0 | 89 | break; |
aoqi@0 | 90 | } |
aoqi@0 | 91 | } |
aoqi@0 | 92 | if (failed) { |
aoqi@0 | 93 | System.exit(97); |
aoqi@0 | 94 | } else { |
aoqi@0 | 95 | System.out.println("PASSED"); |
aoqi@0 | 96 | } |
aoqi@0 | 97 | } |
aoqi@0 | 98 | } |