/*
 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.  Oracle designates this
 * particular file as subject to the "Classpath" exception as provided
 * by Oracle in the LICENSE file that accompanied this code.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
package resources;

public class StackTrackerTest {
    private static String testStatic(int a, Class<?> clz) {
        int i = 10;

        try {
            int j = i + 10;
            if (j > 10) {
                consumeInt(j - 10);
            } else {
                consumeInt(j);
            }
            int x = 0;
            out:
            while (x++ < 10) {
                consumeInt(x);
                for(int z=x;z>=0;z--) {
                    consumeInt(x);
                    if (convertInt(z) == 1L) {
                        break out;
                    }
                }
            }
            return "ok";
        } catch (Throwable l) {

        }

        return "fail";
    }

    private static void consumeInt(int x) {
        System.out.println(x);
    }

    private static long convertInt(int x) {
        return x + 1;
    }
}
