1 /* 2 * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 package org.graalvm.compiler.hotspot.test; 24 25 import org.graalvm.compiler.api.directives.GraalDirectives; 26 import org.junit.Assert; 27 import org.junit.Test; 28 29 /** 30 * Test on-stack-replacement with Graal. The test manually triggers a Graal OSR-compilation which is 31 * later invoked when hitting the backedge counter overflow. 32 */ 33 public class GraalOSRTest extends GraalOSRTestBase { 34 35 @Test 36 public void testOSR01() { 37 try { 38 testOSR(getInitialOptions(), "testReduceLoop"); 39 } catch (Throwable t) { 40 Assert.assertEquals("OSR compilation without OSR entry loop.", t.getMessage()); 41 } 42 } 43 44 @Test 45 public void testOSR02() { 46 testOSR(getInitialOptions(), "testSequentialLoop"); 47 } 48 49 @Test 50 public void testOSR03() { 51 testOSR(getInitialOptions(), "testNonReduceLoop"); 52 } 53 54 static int limit = 10000; 55 56 public static int sideEffect; 57 58 public static ReturnValue testReduceLoop() { 59 for (int i = 0; i < limit * limit; i++) { 60 GraalDirectives.blackhole(i); 61 if (GraalDirectives.inCompiledCode()) { 62 return ReturnValue.SUCCESS; 63 } 64 } 65 return ReturnValue.FAILURE; 66 } 67 68 public static ReturnValue testSequentialLoop() { 69 ReturnValue ret = ReturnValue.FAILURE; 70 for (int i = 1; i < limit * limit; i++) { 71 GraalDirectives.blackhole(i); 72 if (i % 7 == 0) { 73 ret = ReturnValue.SUCCESS; 74 } 75 } 76 GraalDirectives.controlFlowAnchor(); 77 if (sideEffect == 123) { 78 return ReturnValue.SIDE; 79 } 80 for (int i = 1; i < limit * limit; i++) { 81 GraalDirectives.blackhole(i); 82 if (i % 33 == 0) { 83 ret = ReturnValue.SUCCESS; 84 } 85 } 86 GraalDirectives.controlFlowAnchor(); 87 return ret; 88 } 89 90 public static ReturnValue testNonReduceLoop() { 91 ReturnValue ret = ReturnValue.FAILURE; 92 for (int i = 0; i < limit * limit; i++) { 93 GraalDirectives.blackhole(i); 94 if (i % 33 == 0) { 95 ret = ReturnValue.SUCCESS; 96 } 97 } 98 GraalDirectives.controlFlowAnchor(); 99 return ret; 100 } 101 102 }