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.SSA; 37 import jdk.incubator.code.analysis.NormalizeBlocksTransformer; 38 import jdk.incubator.code.dialect.core.CoreOp; 39 import jdk.incubator.code.CodeReflection; 40 import java.util.List; 41 42 public class TestAnfTransform { 43 44 @CodeReflection 45 public static int fibonacci(int v) { 46 if (v == 0) { 47 return 0; 48 } else if (v == 1) { 49 return 1; 50 } 51 52 v = v - 2; 53 int s1, s2, t; 54 s1 = 0; 55 s2 = 1; 56 57 while(v > 0) { 58 t = s1 + s2; 59 s1 = s2; 60 s2 = t; 61 v--; 62 } 63 64 return s1 + s2; 65 66 } 67 68 public static void main(String[] args) { 69 70 testRun("fibonacci", List.of(int.class), 20); 71 72 } 73 74 private static void testRun(String methodName, List<Class<?>> params, Object...args) { 75 try { 76 Class<TestAnfTransform> clazz = TestAnfTransform.class; 77 Method method = clazz.getDeclaredMethod(methodName,params.toArray(new Class[params.size()])); 78 CoreOp.FuncOp f = Op.ofMethod(method).orElseThrow(); 79 80 //Ensure we're fully lowered before testing. 81 var fz = f.transform(OpTransformer.LOWERING_TRANSFORMER); 82 fz = SSA.transform(fz); 83 fz = NormalizeBlocksTransformer.transform(fz); 84 85 System.out.println(fz.toText()); 86 87 var res = new AnfTransformer(fz).transform(); 88 System.out.println("---------------------"); 89 System.out.println(res.toText()); 90 91 } catch (NoSuchMethodException e) { 92 throw new RuntimeException(e); 93 } 94 } 95 }