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) 2011, 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 7048332 |
aoqi@0 | 28 | * @summary Cadd_cmpLTMask doesn't handle 64-bit tmp register properly |
aoqi@0 | 29 | * |
aoqi@0 | 30 | * @run main/othervm -Xbatch Test7048332 |
aoqi@0 | 31 | */ |
aoqi@0 | 32 | |
aoqi@0 | 33 | |
aoqi@0 | 34 | public class Test7048332 { |
aoqi@0 | 35 | |
aoqi@0 | 36 | static int capacity = 2; |
aoqi@0 | 37 | static int first = 1; |
aoqi@0 | 38 | static int last = 2; |
aoqi@0 | 39 | |
aoqi@0 | 40 | static int test(int i1, int i2, int i3, int i4, int i5, int i6) { |
aoqi@0 | 41 | final int result; |
aoqi@0 | 42 | if (last >= first) { |
aoqi@0 | 43 | result = last - first; |
aoqi@0 | 44 | } else { |
aoqi@0 | 45 | result = last - first + capacity; |
aoqi@0 | 46 | } |
aoqi@0 | 47 | return result; |
aoqi@0 | 48 | } |
aoqi@0 | 49 | |
aoqi@0 | 50 | public static void main(String [] args) { |
aoqi@0 | 51 | for (int i = 0; i < 11000; i++) { |
aoqi@0 | 52 | last = (i & 1) << 1; // 0 or 2 |
aoqi@0 | 53 | int k = test(1, 2, 3, 4, 5, 6); |
aoqi@0 | 54 | if (k != 1) { |
aoqi@0 | 55 | System.out.println("FAILED: " + k + " != 1"); |
aoqi@0 | 56 | System.exit(97); |
aoqi@0 | 57 | } |
aoqi@0 | 58 | } |
aoqi@0 | 59 | } |
aoqi@0 | 60 | } |