001/*
002 * Copyright (c) 2009, 2012, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.jtt.except;
024
025import org.junit.*;
026
027import com.oracle.graal.jtt.*;
028
029/**
030 * Some basic checking of the stack trace produced after a StackOverflowError.
031 */
032public class Catch_StackOverflowError_03 extends JTTTest {
033
034    private static final int PASS = 0;
035    private static final int FAIL = 1;
036
037    private static void recurseA() {
038        recurseB();
039    }
040
041    private static void recurseB() {
042        recurseA();
043    }
044
045    public static int test() {
046        try {
047            recurseA();
048        } catch (StackOverflowError stackOverflowError) {
049            // Check that a method does not appear to be calling itself in the stack trace
050            // and check that recurse* is only called by either recurse* or test
051            StackTraceElement[] elements = null;
052            elements = stackOverflowError.getStackTrace();
053            if (elements.length == 0) {
054                // Not much we can do about this perfectly legal situation
055                return PASS;
056            }
057            String lastMethodName = elements[0].getMethodName();
058            for (int i = 1; i < elements.length; ++i) {
059                String methodName = elements[i].getMethodName();
060
061                // Skip top-of-stack until we find a method with name "recurse*".
062                if (!methodName.startsWith("recurse")) {
063                    continue;
064                }
065
066                // We reached the test method => done.
067                if (methodName.equals("test")) {
068                    break;
069                }
070
071                // Stack elements must alternate between recurseA and recurseB
072                if (lastMethodName.equals(methodName) || (!methodName.equals("recurseA") && !methodName.equals("recurseB"))) {
073                    return FAIL;
074                }
075
076                lastMethodName = methodName;
077            }
078
079            return PASS;
080        }
081
082        return FAIL;
083    }
084
085    @Test
086    public void run0() throws Throwable {
087        runTest("test");
088    }
089
090}