Mercurial > jdk8-mips64-public > hotspot / file diff

     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/test/serviceability/sa/LingeredAppWithRecComputation.java	Mon Sep 23 20:26:18 2019 +0200
     1.3 @@ -0,0 +1,67 @@
     1.4 +/*
     1.5 + * Copyright (c) 2019, Red Hat Inc. All rights reserved.
     1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 + *
     1.8 + * This code is free software; you can redistribute it and/or modify it
     1.9 + * under the terms of the GNU General Public License version 2 only, as
    1.10 + * published by the Free Software Foundation.
    1.11 + *
    1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.14 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.15 + * version 2 for more details (a copy is included in the LICENSE file that
    1.16 + * accompanied this code).
    1.17 + *
    1.18 + * You should have received a copy of the GNU General Public License version
    1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.21 + *
    1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    1.23 + * or visit www.oracle.com if you need additional information or have any
    1.24 + * questions.
    1.25 + */
    1.26 +
    1.27 +import jdk.test.lib.apps.LingeredApp;
    1.28 +
    1.29 +public class LingeredAppWithRecComputation extends LingeredApp {
    1.30 +
    1.31 +    public static final String THREAD_NAME = "LingeredAppWithRecComputation.factorial()";
    1.32 +
    1.33 +    private long factorial(int n) {
    1.34 +        if (n <= 1) {
    1.35 +                return 1;
    1.36 +        }
    1.37 +        if (n == 2) {
    1.38 +                return 2;
    1.39 +        }
    1.40 +        return n * factorial(n - 1);
    1.41 +    }
    1.42 +
    1.43 +    public void testLoop() {
    1.44 +        long result = 0;
    1.45 +        long[] lastNResults = new long[20];
    1.46 +        int i = 0;
    1.47 +        int j = 0;
    1.48 +        while (true) {
    1.49 +            result = factorial(i);
    1.50 +            lastNResults[j] = result;
    1.51 +            if (i % 12 == 0) {
    1.52 +                    i = -1; // reset i
    1.53 +            }
    1.54 +            if (j % 19 == 0) {
    1.55 +                    j = -1; // reset j
    1.56 +            }
    1.57 +            i++; j++;
    1.58 +        }
    1.59 +    }
    1.60 +
    1.61 +    public static void main(String args[]) {
    1.62 +        LingeredAppWithRecComputation app = new LingeredAppWithRecComputation();
    1.63 +        Thread factorial = new Thread(() -> {
    1.64 +            app.testLoop();
    1.65 +        });
    1.66 +        factorial.setName(THREAD_NAME);
    1.67 +        factorial.start();
    1.68 +        LingeredApp.main(args);
    1.69 +    }
    1.70 + }