1 /*
 2  * Copyright (c) 2024, 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.  Oracle designates this
 8  * particular file as subject to the "Classpath" exception as provided
 9  * by Oracle in the LICENSE file that accompanied this code.
10  *
11  * This code is distributed in the hope that it will be useful, but WITHOUT
12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14  * version 2 for more details (a copy is included in the LICENSE file that
15  * accompanied this code).
16  *
17  * You should have received a copy of the GNU General Public License version
18  * 2 along with this work; if not, write to the Free Software Foundation,
19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20  *
21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22  * or visit www.oracle.com if you need additional information or have any
23  * questions.
24  */
25 
26 /*
27  * @test
28  * @modules jdk.incubator.code
29  * @run main TestAnfTransform
30  */
31 
32 import java.lang.reflect.Method;
33 
34 import jdk.incubator.code.Op;
35 import jdk.incubator.code.OpTransformer;
36 import jdk.incubator.code.analysis.AnfTransformer;
37 import jdk.incubator.code.analysis.SSA;
38 import jdk.incubator.code.analysis.NormalizeBlocksTransformer;
39 import jdk.incubator.code.op.CoreOp;
40 import jdk.incubator.code.CodeReflection;
41 import java.util.List;
42 
43 public class TestAnfTransform {
44 
45     @CodeReflection
46     public static int fibonacci(int v) {
47         if (v == 0) {
48             return 0;
49         } else if (v == 1) {
50             return 1;
51         }
52 
53         v = v - 2;
54         int s1, s2, t;
55         s1 = 0;
56         s2 = 1;
57 
58         while(v > 0) {
59             t = s1 + s2;
60             s1 = s2;
61             s2 = t;
62             v--;
63         }
64 
65         return s1 + s2;
66 
67     }
68 
69     public static void main(String[] args) {
70 
71         testRun("fibonacci", List.of(int.class), 20);
72 
73     }
74 
75     private static void testRun(String methodName, List<Class<?>> params, Object...args) {
76         try {
77             Class<TestAnfTransform> clazz = TestAnfTransform.class;
78             Method method = clazz.getDeclaredMethod(methodName,params.toArray(new Class[params.size()]));
79             CoreOp.FuncOp f = Op.ofMethod(method).orElseThrow();
80 
81             //Ensure we're fully lowered before testing.
82             var fz = f.transform(OpTransformer.LOWERING_TRANSFORMER);
83             fz = SSA.transform(fz);
84             fz = NormalizeBlocksTransformer.transform(fz);
85 
86             System.out.println(fz.toText());
87 
88             var res = new AnfTransformer(fz).transform();
89             System.out.println("---------------------");
90             System.out.println(res.toText());
91 
92         } catch (NoSuchMethodException e) {
93             throw new RuntimeException(e);
94         }
95     }
96 }