Quelle Main.java
Sprache: JAVA
/* * Copyright ( C ) 2018 The Android Open Source Project * * Licensed under the Apache License , Version 2 . 0 ( the " License " ) ; * you may not use this file except in compliance with the License . * You may obtain a copy of the License at * * http : //www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing , software * distributed under the License is distributed on an " AS IS " BASIS , * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND , either express or implied . * See the License for the specific language governing permissions and * limitations under the License . import java.lang.reflect.Method;// // Test loop optimizations, in particular scalar loop peeling and unrolling. public class Main {static final int LENGTH = 4 * 1024 ;int [] a = new int [LENGTH];int [] b = new int [LENGTH];private static final int LENGTH_A = LENGTH;private static final int LENGTH_B = 16 ;private static final int RESULT_POS = 4 ;double [][] mA;double [][] mB;double [][] mC;public Main() {new double [LENGTH_A][];new double [LENGTH_B][];new double [LENGTH_B][];for (int i = 0 ; i < LENGTH_A; i++) {new double [LENGTH_B];for (int i = 0 ; i < LENGTH_B; i++) {new double [LENGTH_A];new double [LENGTH_B];private static final void initMatrix(double [][] m) {for (int i = 0 ; i < m.length; i++) {for (int j = 0 ; j < m[i].length; j++) {double ) (i * LENGTH / (j + 1 ));private static final void initIntArray(int [] a) {for (int i = 0 ; i < a.length; i++) {4 ;private static final void initDoubleArray(double [] a) {for (int i = 0 ; i < a.length; i++) {double )(i % 4 );/// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (before) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<Phi>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<IndAdd>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Add:i\d+>> Add [<<Get0>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<Phi>>,<<Add>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (after) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<Phi>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<IndAdd>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Add:i\d+>> Add [<<Get0>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<Phi>>,<<Add>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<IndAdd>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IfA:v\d+>> If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0A:i\d+>> ArrayGet [<<Array>>,<<IndAdd>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAddA:i\d+>> Add [<<IndAdd>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1A:i\d+>> ArrayGet [<<Array>>,<<IndAddA>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddA:i\d+>> Add [<<Get0A>>,<<Get1A>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<IndAdd>>,<<AddA>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingLoadStoreElimination(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingLoadStoreElimination(int [] a) {for (int i = 0 ; i < LENGTH - 2 ; i++) {1 ];// Simple check that loop unrolling has happened. // /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IfA:v\d+>> If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<AddI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingSwitch(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingSwitch(int [] a) {for (int i = 0 ; i < LENGTH; i++) {switch (i % 3 ) {case 2 :break ;default :break ;// Simple check that loop unrolling has happened. // /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IfA:v\d+>> If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<AddI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingSwapElements(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingSwapElements(int [] array) {for (int i = 0 ; i < LENGTH - 2 ; i++) {if (array[i] > array[i + 1 ]) {int temp = array[i + 1 ];1 ] = array[i];// Simple check that loop unrolling has happened. // /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 16 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none // We have two other `ArrayGet` before the `If` that appears in the CHECK-DAG above. /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (before) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 16 loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IfA:v\d+>> If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: Add [<<AddI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingRInnerproduct(double[][], double[][], double[][], int, int) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingRInnerproduct(double [][] result,double [][] a,double [][] b,int row,int column) {// computes the inner product of A[row,*] and B[*,column] int i;0 .0 f;for (i = 0 ; i < LENGTH_B; i++) {// nested loop // [[[]]] /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 128 loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:none /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop2:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop3:B\d+>> outer_loop:<<Loop2>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi3>>,<<Limit>>] loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: Add [<<Phi3>>,<<Const1>>] loop:<<Loop3>> outer_loop:<<Loop2>> // Each one of the three `for` loops has an `if`. /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 128 loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:none /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop2:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop3:B\d+>> outer_loop:<<Loop2>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi3>>,<<Limit>>] loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: <<AddI:i\d+>> Add [<<Phi3>>,<<Const1>>] loop:<<Loop3>> outer_loop:<<Loop2>> // /// CHECK-DAG: If [<<Const0>>] loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop2>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop2>> // Loop unrolling adds a 4th `if`. It is the one with `Const0` above. /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingInTheNest(int [] a, int [] b, int x) {for (int k = 0 ; k < 16 ; k++) {for (int j = 0 ; j < 16 ; j++) {for (int i = 0 ; i < 128 ; i++) {1 ;// nested loop: // [ // if [] else [] // ] /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 128 loop:none /// CHECK-DAG: <<XThres:i\d+>> IntConstant 100 loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:none // /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop2:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Check2:z\d+>> GreaterThanOrEqual [<<Phi2>>,<<Limit>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Check2>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: <<AddI2:i\d+>> Add [<<Phi2>>,<<Const1>>] loop:<<Loop2>> outer_loop:<<Loop1>> // /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop3:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Check3:z\d+>> GreaterThanOrEqual [<<Phi3>>,<<Limit>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Check3>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: <<AddI3:i\d+>> Add [<<Phi3>>,<<Const1>>] loop:<<Loop3>> outer_loop:<<Loop1>> // Each one of the three `for` loops has an `if`. Plus an `if` inside the outer `for`. /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (before) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 128 loop:none /// CHECK-DAG: <<XThres:i\d+>> IntConstant 100 loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:none // /// CHECK-DAG: <<Phi2:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop2:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Check2:z\d+>> GreaterThanOrEqual [<<Phi2>>,<<Limit>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Check2>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: <<AddI2:i\d+>> Add [<<Phi2>>,<<Const1>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Const0>>] loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop2>> outer_loop:<<Loop1>> /// CHECK-DAG: Add [<<AddI2>>,<<Const1>>] loop:<<Loop2>> outer_loop:<<Loop1>> // /// CHECK-DAG: <<Phi3:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop3:B\d+>> outer_loop:<<Loop1>> /// CHECK-DAG: <<Check3:z\d+>> GreaterThanOrEqual [<<Phi3>>,<<Limit>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Check3>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: <<AddI3:i\d+>> Add [<<Phi3>>,<<Const1>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: If [<<Const0>>] loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArrayGet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: ArraySet loop:<<Loop3>> outer_loop:<<Loop1>> /// CHECK-DAG: Add [<<AddI3>>,<<Const1>>] loop:<<Loop3>> outer_loop:<<Loop1>> // LoopOptimization adds two `if`s. One for each loop unrolling. /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingTwoLoopsInTheNest(int[], int[], int) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingTwoLoopsInTheNest(int [] a, int [] b, int x) {for (int k = 0 ; k < 128 ; k++) {if (x > 100 ) {for (int j = 0 ; j < 128 ; j++) {else {for (int i = 0 ; i < 128 ; i++) {/// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (before) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Const2:i\d+>> IntConstant 2 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<PhiS:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<PhiT:i\d+>> Phi [<<Const2>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddS:i\d+>> Add [<<PhiS>>,<<Get0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddT:i\d+>> Mul [<<PhiT>>,<<Get0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<PhiI>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddArr:i\d+>> Add [<<AddS>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<PhiI>>,<<AddArr>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<STAdd:i\d+>> Add [<<PhiS>>,<<PhiT>>] loop:none /// CHECK-DAG: <<ZCheck:i\d+>> DivZeroCheck [<<STAdd>>] env:[[<<PhiS>>,<<PhiT>>,<<STAdd>>,<<Const1>>,_,<<Array>>]] loop:none /// CHECK-DAG: <<Div:i\d+>> Div [<<Const1>>,<<ZCheck>>] loop:none /// CHECK-DAG: Return [<<Div>>] loop:none /// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (after) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Const2:i\d+>> IntConstant 2 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none /// CHECK-DAG: <<PhiS:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<PhiT:i\d+>> Phi [<<Const2>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddS:i\d+>> Add [<<PhiS>>,<<Get0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddT:i\d+>> Mul [<<PhiT>>,<<Get0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<PhiI>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddArr:i\d+>> Add [<<AddS>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<PhiI>>,<<AddArr>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: GreaterThanOrEqual [<<AddI>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddIA:i\d+>> Add [<<AddI>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0A:i\d+>> ArrayGet [<<Array>>,<<AddIA>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddSA:i\d+>> Add [<<AddS>>,<<Get0A>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddTA:i\d+>> Mul [<<AddT>>,<<Get0A>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1A:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<AddArrA:i\d+>> Add [<<AddSA>>,<<Get1A>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<AddI>>,<<AddArrA>>] loop:<<Loop>> outer_loop:none // /// CHECK-DAG: <<RetPhiS:i\d+>> Phi [<<PhiS>>,<<AddS>>] loop:none /// CHECK-DAG: <<RetPhiT:i\d+>> Phi [<<PhiT>>,<<AddT>>] loop:none /// CHECK-DAG: <<STAdd:i\d+>> Add [<<RetPhiS>>,<<RetPhiT>>] loop:none /// CHECK-DAG: <<ZCheck:i\d+>> DivZeroCheck [<<STAdd>>] env:[[<<RetPhiS>>,<<RetPhiT>>,<<STAdd>>,<<Const1>>,_,<<Array>>]] loop:none /// CHECK-DAG: <<Div:i\d+>> Div [<<Const1>>,<<ZCheck>>] loop:none /// CHECK-DAG: Return [<<Div>>] loop:none /// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: int Main.unrollingSimpleLiveOuts(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final int unrollingSimpleLiveOuts(int [] a) {int s = 1 ;int t = 2 ;for (int i = 0 ; i < LENGTH - 2 ; i++) {int temp = a[i + 1 ];return 1 / (s + t);/// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (before) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Const2:i\d+>> IntConstant 2 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none // /// CHECK-DAG: <<OutPhiJ:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop0:B\d+>> outer_loop:none /// CHECK-DAG: <<OutPhiS:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop0>> outer_loop:none /// CHECK-DAG: <<OutPhiT:i\d+>> Phi [<<Const2>>,{{i\d+}}] loop:<<Loop0>> outer_loop:none // /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:<<Loop0>> /// CHECK-DAG: <<PhiS:i\d+>> Phi [<<OutPhiS>>,{{i\d+}}] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<PhiT:i\d+>> Phi [<<OutPhiT>>,{{i\d+}}] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddS:i\d+>> Add [<<PhiS>>,<<Get0>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddT:i\d+>> Mul [<<PhiT>>,<<Get0>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<PhiI>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddArr:i\d+>> Add [<<AddS>>,<<Get1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArraySet [<<Array>>,<<PhiI>>,<<AddArr>>] loop:<<Loop1>> outer_loop:<<Loop0>> // /// CHECK-DAG: Add [<<OutPhiJ>>,<<Const1>>] loop:<<Loop0>> outer_loop:none /// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (after) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Const2:i\d+>> IntConstant 2 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4094 loop:none // /// CHECK-DAG: <<OutPhiJ:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop0:B\d+>> outer_loop:none /// CHECK-DAG: <<OutPhiS:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop0>> outer_loop:none /// CHECK-DAG: <<OutPhiT:i\d+>> Phi [<<Const2>>,{{i\d+}}] loop:<<Loop0>> outer_loop:none // /// CHECK-DAG: <<PhiI:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:<<Loop0>> /// CHECK-DAG: <<PhiS:i\d+>> Phi [<<OutPhiS>>,{{i\d+}}] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<PhiT:i\d+>> Phi [<<OutPhiT>>,{{i\d+}}] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<PhiI>>,<<Limit>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddI:i\d+>> Add [<<PhiI>>,<<Const1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddS:i\d+>> Add [<<PhiS>>,<<Get0>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddT:i\d+>> Mul [<<PhiT>>,<<Get0>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<PhiI>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddArr:i\d+>> Add [<<AddS>>,<<Get1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArraySet [<<Array>>,<<PhiI>>,<<AddArr>>] loop:<<Loop1>> outer_loop:<<Loop0>> // /// CHECK-DAG: If [<<Const0>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddIA:i\d+>> Add [<<AddI>>,<<Const1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get0A:i\d+>> ArrayGet [<<Array>>,<<AddIA>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddSA:i\d+>> Add [<<AddS>>,<<Get0A>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddTA:i\d+>> Mul [<<AddT>>,<<Get0A>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Get1A:i\d+>> ArrayGet [<<Array>>,<<AddI>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<AddArrA:i\d+>> Add [<<AddSA>>,<<Get1A>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArraySet [<<Array>>,<<AddI>>,<<AddArrA>>] loop:<<Loop1>> outer_loop:<<Loop0>> // /// CHECK-DAG: <<RetPhiS:i\d+>> Phi [<<PhiS>>,<<AddS>>] loop:<<Loop0>> outer_loop:none /// CHECK-DAG: <<RetPhiT:i\d+>> Phi [<<PhiT>>,<<AddT>>] loop:<<Loop0>> outer_loop:none /// CHECK-DAG: Add [<<OutPhiJ>>,<<Const1>>] loop:<<Loop0>> outer_loop:none // /// CHECK-DAG: <<RetAdd:i\d+>> Add [<<OutPhiS>>,<<OutPhiT>>] loop:none /// CHECK-DAG: Return [<<RetAdd>>] loop:none /// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: int Main.unrollingLiveOutsNested(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final int unrollingLiveOutsNested(int [] a) {int s = 1 ;int t = 2 ;for (int j = 0 ; j < 16 ; j++) {for (int i = 0 ; i < LENGTH - 2 ; i++) {int temp = a[i + 1 ];return s + t;/// CHECK-START: void Main.unrollingInstanceOf(int[], java.lang.Object[]) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: InstanceOf loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingInstanceOf(int[], java.lang.Object[]) loop_optimization (before) /// CHECK: InstanceOf /// CHECK-NOT: InstanceOf /// CHECK-START: void Main.unrollingInstanceOf(int[], java.lang.Object[]) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: InstanceOf loop:<<Loop>> outer_loop:none /// CHECK-DAG: InstanceOf loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingInstanceOf(int[], java.lang.Object[]) loop_optimization (after) /// CHECK: InstanceOf /// CHECK: InstanceOf /// CHECK-NOT: InstanceOf public void unrollingInstanceOf(int [] a, Object[] obj_array) {for (int i = 0 ; i < LENGTH_B; i++) {if (obj_array[i] instanceof Integer) {1 ;/// CHECK-START: void Main.unrollingDivZeroCheck(int[], int) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: DivZeroCheck loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingDivZeroCheck(int[], int) loop_optimization (before) /// CHECK: DivZeroCheck /// CHECK-NOT: DivZeroCheck /// CHECK-START: void Main.unrollingDivZeroCheck(int[], int) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: DivZeroCheck loop:<<Loop>> outer_loop:none /// CHECK-DAG: DivZeroCheck loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingDivZeroCheck(int[], int) loop_optimization (after) /// CHECK: DivZeroCheck /// CHECK: DivZeroCheck /// CHECK-NOT: DivZeroCheck public void unrollingDivZeroCheck(int [] a, int r) {for (int i = 0 ; i < LENGTH_B; i++) {/// CHECK-START: void Main.unrollingTypeConversion(int[], double[]) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: TypeConversion loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingTypeConversion(int[], double[]) loop_optimization (before) /// CHECK: TypeConversion /// CHECK-NOT: TypeConversion /// CHECK-START: void Main.unrollingTypeConversion(int[], double[]) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: TypeConversion loop:<<Loop>> outer_loop:none /// CHECK-DAG: TypeConversion loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingTypeConversion(int[], double[]) loop_optimization (after) /// CHECK: TypeConversion /// CHECK: TypeConversion /// CHECK-NOT: TypeConversion public void unrollingTypeConversion(int [] a, double [] b) {for (int i = 0 ; i < LENGTH_B; i++) {int ) b[i];interface Itf {class SubMain extends Main implements Itf {/// CHECK-START: void Main.unrollingCheckCast(int[], java.lang.Object) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: CheckCast loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingCheckCast(int[], java.lang.Object) loop_optimization (before) /// CHECK: CheckCast /// CHECK-NOT: CheckCast /// CHECK-START: void Main.unrollingCheckCast(int[], java.lang.Object) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: CheckCast loop:<<Loop>> outer_loop:none /// CHECK-DAG: CheckCast loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingCheckCast(int[], java.lang.Object) loop_optimization (after) /// CHECK: CheckCast /// CHECK: CheckCast /// CHECK-NOT: CheckCast public void unrollingCheckCast(int [] a, Object o) {for (int i = 0 ; i < LENGTH_B; i++) {if (((SubMain)o) == o) {/// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (before) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4095 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<Phi>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<IndAdd>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Add:i\d+>> Add [<<Get0>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<Phi>>,<<Add>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (before) /// CHECK: Phi /// CHECK-NOT: Phi /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (before) /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (after) /// CHECK-DAG: Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (after) /// CHECK: Phi /// CHECK-NOT: Phi /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (after) /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.noUnrollingOddTripCount(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void noUnrollingOddTripCount(int [] a) {for (int i = 0 ; i < LENGTH - 1 ; i++) {1 ];/// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (before) /// CHECK-DAG: <<Array:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Limit:i\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<If:v\d+>> If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get0:i\d+>> ArrayGet [<<Array>>,<<Phi>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Get1:i\d+>> ArrayGet [<<Array>>,<<IndAdd>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Add:i\d+>> Add [<<Get0>>,<<Get1>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet [<<Array>>,<<Phi>>,<<Add>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (before) /// CHECK: Phi /// CHECK-NOT: Phi // One `if` for the `for` loop, and another one for a deoptimize. /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (before) /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (after) /// CHECK-DAG: Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (after) /// CHECK: Phi /// CHECK-NOT: Phi /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (after) /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.noUnrollingNotKnownTripCount(int[], int) loop_optimization (after) /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void noUnrollingNotKnownTripCount(int [] a, int n) {for (int i = 0 ; i < n; i++) {1 ];/// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (before) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Param>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (before) /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (after) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<Const0>>,<<Limit>>] loop:none /// CHECK-DAG: If [<<CheckA>>] loop:none /// CHECK-DAG: If [<<Param>>] loop:none /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArraySet loop:none /// CHECK-DAG: <<IndAddA:i\d+>> Add [<<Const0>>,<<Const1>>] loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<IndAddA>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.peelingSimple(int[], boolean) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.peelingSimple(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: If [<<Param>>] loop:none /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArraySet loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.peelingSimple(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: GreaterThanOrEqual /// CHECK-NOT: GreaterThanOrEqual /// CHECK-START: void Main.peelingSimple(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.peelingSimple(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.peelingSimple(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void peelingSimple(int [] a, boolean f) {for (int i = 0 ; i < LENGTH; i++) {if (f) {break ;1 ;// Often used idiom that, when not hoisted, prevents BCE and vectorization. // /// CHECK-START: void Main.peelingAddInts(int[]) loop_optimization (before) /// CHECK-DAG: <<Param:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<ConstNull:l\d+>> NullConstant loop:none /// CHECK-DAG: <<Eq:z\d+>> Equal [<<Param>>,<<ConstNull>>] loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If [<<Eq>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.peelingAddInts(int[]) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Param:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<ConstNull:l\d+>> NullConstant loop:none /// CHECK-DAG: <<Eq:z\d+>> Equal [<<Param>>,<<ConstNull>>] loop:none /// CHECK-DAG: If [<<Eq>>] loop:none /// CHECK-DAG: ArraySet loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,{{i\d+}}] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none // There's a 3rd `if` due to bounds checks. /// CHECK-START: void Main.peelingAddInts(int[]) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If private static final void peelingAddInts(int [] a) {for (int i = 0 ; a != null && i < a.length; i++) {1 ;/// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) loop_optimization (before) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<Phi0:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop0:B\d+>> outer_loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi1>>,<<Limit>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: If [<<Param>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArrayGet loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArraySet loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<IndAdd1:i\d+>> Add [<<Phi1>>,<<Const1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<IndAdd0:i\d+>> Add [<<Phi0>>,<<Const1>>] loop:<<Loop0>> outer_loop:none // The two loops have an `if`. The 3rd `if` is the explicit one in the innermost loop. /// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) loop_optimization (before) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<Phi0:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop0:B\d+>> outer_loop:none /// CHECK-DAG: If [<<Param>>] loop:<<Loop0>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop0>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop0>> outer_loop:none /// CHECK-DAG: <<Phi1:i\d+>> Phi [<<Const1>>,{{i\d+}}] loop:<<Loop1:B\d+>> outer_loop:<<Loop0>> /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi1>>,<<Limit>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: If [<<Check>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArrayGet loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: ArraySet loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<IndAdd1:i\d+>> Add [<<Phi1>>,<<Const1>>] loop:<<Loop1>> outer_loop:<<Loop0>> /// CHECK-DAG: <<IndAdd0:i\d+>> Add [<<Phi0>>,<<Const1>>] loop:<<Loop0>> outer_loop:none /// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If /// CHECK-START: void Main.peelingBreakFromNest(int[], boolean) dead_code_elimination$before_codegen (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void peelingBreakFromNest(int [] a, boolean f) {for (int i = 1 ; i < 32 ; i++) {for (int j = 0 ; j < LENGTH; j++) {if (f) {break outer;1 ;/// CHECK-START: int Main.peelingHoistOneControl(int) loop_optimization (before) /// CHECK-DAG: <<Param:i\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Check:z\d+>> NotEqual [<<Param>>,<<Const0>>] loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: int Main.peelingHoistOneControl(int) loop_optimization (before) /// CHECK: If /// CHECK-NOT: If /// CHECK-START: int Main.peelingHoistOneControl(int) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Param:i\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Check:z\d+>> NotEqual [<<Param>>,<<Const0>>] loop:none /// CHECK-DAG: If [<<Check>>] loop:none /// CHECK-DAG: SuspendCheck loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: Goto loop:<<Loop>> outer_loop:none // // Check that the loop has no instruction except SuspendCheck and Goto (indefinite loop). /// CHECK-NOT: loop:<<Loop>> outer_loop:none /// CHECK-START: int Main.peelingHoistOneControl(int) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK-NOT: If /// CHECK-START: int Main.peelingHoistOneControl(int) dead_code_elimination$before_codegen (after) /// CHECK-NOT: Phi /// CHECK-START: int Main.peelingHoistOneControl(int) dead_code_elimination$before_codegen (after) /// CHECK-NOT: Add private static final int peelingHoistOneControl(int x) {int i = 0 ;while (true ) {if (x == 0 )return 1 ;/// CHECK-START: int Main.peelingHoistOneControl(int, int) loop_optimization (before) /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-START: int Main.peelingHoistOneControl(int, int) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none // One `if` inside the loop (the one no longer invariant), two outside of it. /// CHECK-START: int Main.peelingHoistOneControl(int, int) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If private static final int peelingHoistOneControl(int x, int y) {while (true ) {if (x == 0 )return 1 ;if (y == 0 ) // no longer invariant return 2 ;/// CHECK-START: int Main.peelingHoistTwoControl(int, int, int) loop_optimization (before) /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none /// CHECK-START: int Main.peelingHoistTwoControl(int, int, int) dead_code_elimination$before_codegen (after) /// CHECK-DAG: <<Phi:i\d+>> Phi loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: If loop:<<Loop>> outer_loop:none // One `if` inside the loop (the one no longer invariant), three outside of it. /// CHECK-START: int Main.peelingHoistTwoControl(int, int, int) dead_code_elimination$before_codegen (after) /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK: If /// CHECK-NOT: If private static final int peelingHoistTwoControl(int x, int y, int z) {while (true ) {if (x == 0 )return 1 ;if (y == 0 )return 2 ;if (z == 0 ) // no longer invariant return 3 ;/// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (before) /// CHECK-DAG: <<Param:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 2 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (before) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (before) /// CHECK: ArraySet /// CHECK-NOT: ArraySet /// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (after) /// CHECK-DAG: <<Param:l\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 2 loop:none // Two peeled iterations /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArraySet loop:none /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArrayGet loop:none /// CHECK-DAG: ArraySet loop:none // Loop /// CHECK-DAG: <<Phi:i\d+>> Phi [{{i\d+}},{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArrayGet loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (after) /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK: ArrayGet /// CHECK-NOT: ArrayGet /// CHECK-START: void Main.unrollingFull(int[]) loop_optimization (after) /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK: ArraySet /// CHECK-NOT: ArraySet private static final void unrollingFull(int [] a) {for (int i = 0 ; i < 2 ; i++) {1 ];/// CHECK-START: void Main.$noinline$testUnrollingIntrinsic(int[]) loop_optimization (before) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.$noinline$testUnrollingIntrinsic(int[]) loop_optimization (before) /// CHECK: InvokeStaticOrDirect /// CHECK-NOT: InvokeStaticOrDirect /// CHECK-START: void Main.$noinline$testUnrollingIntrinsic(int[]) loop_optimization (after) /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:<<Loop>> outer_loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.$noinline$testUnrollingIntrinsic(int[]) loop_optimization (after) /// CHECK: InvokeStaticOrDirect /// CHECK: InvokeStaticOrDirect /// CHECK-NOT: InvokeStaticOrDirect public void $noinline$testUnrollingIntrinsic(int [] a) {for (int i = 0 ; i < LENGTH_B; i++) {/// CHECK-START: void Main.$noinline$testPeelingIntrinsic(int[], boolean) loop_optimization (before) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<Const0>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Param>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.$noinline$testPeelingIntrinsic(int[], boolean) loop_optimization (before) /// CHECK: InvokeStaticOrDirect /// CHECK-NOT: InvokeStaticOrDirect /// CHECK-START: void Main.$noinline$testPeelingIntrinsic(int[], boolean) loop_optimization (after) /// CHECK-DAG: <<Param:z\d+>> ParameterValue loop:none /// CHECK-DAG: <<Const0:i\d+>> IntConstant 0 loop:none /// CHECK-DAG: <<Const1:i\d+>> IntConstant 1 loop:none /// CHECK-DAG: <<Limit:i\d+>> IntConstant 4096 loop:none /// CHECK-DAG: <<CheckA:z\d+>> GreaterThanOrEqual [<<Const0>>,<<Limit>>] loop:none /// CHECK-DAG: If [<<CheckA>>] loop:none /// CHECK-DAG: If [<<Param>>] loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:none /// CHECK-DAG: ArraySet loop:none /// CHECK-DAG: <<IndAddA:i\d+>> Add [<<Const0>>,<<Const1>>] loop:none /// CHECK-DAG: <<Phi:i\d+>> Phi [<<IndAddA>>,{{i\d+}}] loop:<<Loop:B\d+>> outer_loop:none /// CHECK-DAG: <<Check:z\d+>> GreaterThanOrEqual [<<Phi>>,<<Limit>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Check>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: If [<<Const0>>] loop:<<Loop>> outer_loop:none /// CHECK-DAG: InvokeStaticOrDirect loop:<<Loop>> outer_loop:none /// CHECK-DAG: ArraySet loop:<<Loop>> outer_loop:none /// CHECK-DAG: <<IndAdd:i\d+>> Add [<<Phi>>,<<Const1>>] loop:<<Loop>> outer_loop:none /// CHECK-START: void Main.$noinline$testPeelingIntrinsic(int[], boolean) loop_optimization (after) /// CHECK: InvokeStaticOrDirect /// CHECK: InvokeStaticOrDirect /// CHECK-NOT: InvokeStaticOrDirect private static final void $noinline$testPeelingIntrinsic(int [] a, boolean f) {for (int i = 0 ; i < LENGTH; i++) {if (f) {break ;private static void expectEquals(int expected, int result) {if (expected != result) {throw new Error("Expected: " + expected + ", found: " + result);public void verifyUnrolling() throws Exception {int expected = 174291878 ;int found = 0 ;double [] doubleArray = new double [LENGTH_B];new Integer[LENGTH_B]);15 );new SubMain());// Call unrollingWhile(a); Class <?> c = Class .forName("PeelUnroll" );"unrollingWhile" , Class .forName("[I" ));null , arguments);128 );for (int i = 0 ; i < LENGTH; i++) {int )mC[RESULT_POS][RESULT_POS];public void verifyPeeling() throws Exception {1 , peelingHoistOneControl(0 )); // anything else loops 1 , peelingHoistOneControl(0 , 0 ));1 , peelingHoistOneControl(0 , 1 ));2 , peelingHoistOneControl(1 , 0 ));2 , peelingHoistOneControl(1 , 1 ));1 , peelingHoistTwoControl(0 , 0 , 0 ));1 , peelingHoistTwoControl(0 , 0 , 1 ));1 , peelingHoistTwoControl(0 , 1 , 0 ));1 , peelingHoistTwoControl(0 , 1 , 1 ));2 , peelingHoistTwoControl(1 , 0 , 0 ));2 , peelingHoistTwoControl(1 , 0 , 1 ));3 , peelingHoistTwoControl(1 , 1 , 0 ));3 , peelingHoistTwoControl(1 , 1 , 1 ));false );true );null ); // okay false );true );false );true );// Call unrollingWhileLiveOuts(a); Class <?> c = Class .forName("PeelUnroll" );"unrollingWhileLiveOuts" , Class .forName("[I" ));null , arguments);int expected = 335820223 ;int found = 0 ;for (int i = 0 ; i < a.length; i++) {public static void main(String[] args) throws Exception {new Main();"passed" );
Messung V0.5 in Prozent C=62 H=88 G=75
¤ Dauer der Verarbeitung: 0.45 Sekunden
(vorverarbeitet am 2026-06-29)
¤ *© Formatika GbR, Deutschland
2026-07-09
