1 /* 2 * Copyright (c) 2009, 2012, 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.jtt.except; 24 25 import org.junit.Test; 26 27 import org.graalvm.compiler.jtt.JTTTest; 28 29 /** 30 * Some basic checking of the stack trace produced after a StackOverflowError. 31 */ 32 public class Catch_StackOverflowError_03 extends JTTTest { 33 34 private static final int PASS = 0; 35 private static final int FAIL = 1; 36 37 private static void recurseA() { 38 recurseB(); 39 } 40 41 private static void recurseB() { 42 recurseA(); 43 } 44 45 public static int test() { 46 try { 47 recurseA(); 48 } catch (StackOverflowError stackOverflowError) { 49 // Check that a method does not appear to be calling itself in the stack trace 50 // and check that recurse* is only called by either recurse* or test 51 StackTraceElement[] elements = null; 52 elements = stackOverflowError.getStackTrace(); 53 if (elements.length == 0) { 54 // Not much we can do about this perfectly legal situation 55 return PASS; 56 } 57 String lastMethodName = elements[0].getMethodName(); 58 for (int i = 1; i < elements.length; ++i) { 59 String methodName = elements[i].getMethodName(); 60 61 // Skip top-of-stack until we find a method with name "recurse*". 62 if (!methodName.startsWith("recurse")) { 63 continue; 64 } 65 66 // We reached the test method => done. 67 if (methodName.equals("test")) { 68 break; 69 } 70 71 // Stack elements must alternate between recurseA and recurseB 72 if (lastMethodName.equals(methodName) || (!methodName.equals("recurseA") && !methodName.equals("recurseB"))) { 73 return FAIL; 74 } 75 76 lastMethodName = methodName; 77 } 78 79 return PASS; 80 } 81 82 return FAIL; 83 } 84 85 @Test 86 public void run0() throws Throwable { 87 runTest("test"); 88 } 89 90 }