test/compiler/EscapeAnalysis/TestAllocatedEscapesPtrComparison.java

Wed, 27 Aug 2014 08:19:12 -0400

author
zgu
date
Wed, 27 Aug 2014 08:19:12 -0400
changeset 7074
833b0f92429a
parent 0
f90c822e73f8
permissions
-rw-r--r--

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 2014 Google, Inc. 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 8043354
aoqi@0 27 * @summary bcEscapeAnalyzer allocated_escapes not conservative enough
aoqi@0 28 * @run main/othervm -XX:CompileOnly=.visitAndPop TestAllocatedEscapesPtrComparison
aoqi@0 29 * @author Chuck Rasbold rasbold@google.com
aoqi@0 30 */
aoqi@0 31
aoqi@0 32 /*
aoqi@0 33 * Test always passes with -XX:-OptmimizePtrCompare
aoqi@0 34 */
aoqi@0 35
aoqi@0 36 import java.util.ArrayList;
aoqi@0 37 import java.util.List;
aoqi@0 38
aoqi@0 39 public class TestAllocatedEscapesPtrComparison {
aoqi@0 40
aoqi@0 41 static TestAllocatedEscapesPtrComparison dummy;
aoqi@0 42
aoqi@0 43 class Marker {
aoqi@0 44 }
aoqi@0 45
aoqi@0 46 List<Marker> markerList = new ArrayList<>();
aoqi@0 47
aoqi@0 48 // Suppress compilation of this method, it must be processed
aoqi@0 49 // by the bytecode escape analyzer.
aoqi@0 50
aoqi@0 51 // Make a new marker and put it on the List
aoqi@0 52 Marker getMarker() {
aoqi@0 53 // result escapes through markerList
aoqi@0 54 final Marker result = new Marker();
aoqi@0 55 markerList.add(result);
aoqi@0 56 return result;
aoqi@0 57 }
aoqi@0 58
aoqi@0 59 void visit(int depth) {
aoqi@0 60 // Make a new marker
aoqi@0 61 getMarker();
aoqi@0 62
aoqi@0 63 // Call visitAndPop every once in a while
aoqi@0 64 // Cap the depth of our recursive visits
aoqi@0 65 if (depth % 10 == 2) {
aoqi@0 66 visitAndPop(depth + 1);
aoqi@0 67 } else if (depth < 15) {
aoqi@0 68 visit(depth + 1);
aoqi@0 69 }
aoqi@0 70 }
aoqi@0 71
aoqi@0 72 void visitAndPop(int depth) {
aoqi@0 73 // Random dummy allocation to force EscapeAnalysis to process this method
aoqi@0 74 dummy = new TestAllocatedEscapesPtrComparison();
aoqi@0 75
aoqi@0 76 // Make a new marker
aoqi@0 77 Marker marker = getMarker();
aoqi@0 78
aoqi@0 79 visit(depth + 1);
aoqi@0 80
aoqi@0 81 // Walk and pop the marker list up to the current marker
aoqi@0 82 boolean found = false;
aoqi@0 83 for (int i = markerList.size() - 1; i >= 0; i--) {
aoqi@0 84 Marker removed = markerList.remove(i);
aoqi@0 85
aoqi@0 86 // In the failure, EA mistakenly converts this comparison to false
aoqi@0 87 if (removed == marker) {
aoqi@0 88 found = true;
aoqi@0 89 break;
aoqi@0 90 }
aoqi@0 91 }
aoqi@0 92
aoqi@0 93 if (!found) {
aoqi@0 94 throw new RuntimeException("test fails");
aoqi@0 95 }
aoqi@0 96 }
aoqi@0 97
aoqi@0 98
aoqi@0 99 public static void main(String args[]) {
aoqi@0 100 TestAllocatedEscapesPtrComparison tc = new TestAllocatedEscapesPtrComparison();
aoqi@0 101
aoqi@0 102 // Warmup and run enough times
aoqi@0 103 for (int i = 0; i < 20000; i++) {
aoqi@0 104 tc.visit(0);
aoqi@0 105 }
aoqi@0 106 }
aoqi@0 107 }

mercurial