| /* |
| * Copyright (c) 2007, 2012, 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. |
| * |
| * 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 org.graalvm.compiler.jtt.micro; |
| |
| import org.junit.Test; |
| |
| import org.graalvm.compiler.jtt.JTTTest; |
| |
| /* |
| */ |
| public class BigIntParams01 extends JTTTest { |
| |
| public static int test(int num) { |
| int sum = 0; |
| if (num == 0) { |
| sum += testA(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(1, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(2, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(3, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(4, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(5, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(6, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(7, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testA(8, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| } else if (num == 1) { |
| sum += testB(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(1, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(2, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(3, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(4, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(5, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(6, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(7, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| sum += testB(8, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| } else if (num == 2) { |
| for (int i = 0; i < 9; i++) { |
| sum += testA(i, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| } |
| } else if (num == 3) { |
| for (int i = 0; i < 9; i++) { |
| sum += testB(i, 1, 2, 3, 4, 5, 6, 7, 8, 9); |
| } |
| } |
| return sum; |
| } |
| |
| private static int testA(int choice, int p0, int p1, int p2, int p3, int p4, int p5, int p6, int p7, int p8) { |
| switch (choice) { |
| case 0: |
| return p0; |
| case 1: |
| return p1; |
| case 2: |
| return p2; |
| case 3: |
| return p3; |
| case 4: |
| return p4; |
| case 5: |
| return p5; |
| case 6: |
| return p6; |
| case 7: |
| return p7; |
| case 8: |
| return p8; |
| } |
| return 42; |
| } |
| |
| private static long testB(int choice, long p0, long p1, long p2, long p3, long p4, long p5, long p6, long p7, long p8) { |
| switch (choice) { |
| case 0: |
| return p0; |
| case 1: |
| return p1; |
| case 2: |
| return p2; |
| case 3: |
| return p3; |
| case 4: |
| return p4; |
| case 5: |
| return p5; |
| case 6: |
| return p6; |
| case 7: |
| return p7; |
| case 8: |
| return p8; |
| } |
| return 42; |
| } |
| |
| @Test |
| public void run0() throws Throwable { |
| runTest("test", 0); |
| } |
| |
| @Test |
| public void run1() throws Throwable { |
| runTest("test", 1); |
| } |
| |
| @Test |
| public void run2() throws Throwable { |
| runTest("test", 2); |
| } |
| |
| @Test |
| public void run3() throws Throwable { |
| runTest("test", 3); |
| } |
| |
| @Test |
| public void run4() throws Throwable { |
| runTest("test", 4); |
| } |
| |
| } |