File: subcommon01.java

package info (click to toggle)
openjdk-25 25.0.1%2B8-1~deb13u1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 825,408 kB
  • sloc: java: 5,585,680; cpp: 1,333,948; xml: 1,321,242; ansic: 488,034; asm: 404,003; objc: 21,088; sh: 15,106; javascript: 13,265; python: 8,319; makefile: 2,518; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (247 lines) | stat: -rw-r--r-- 6,345 bytes parent folder | download | duplicates (15)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
/*
 * Copyright (c) 2002, 2020, 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.
 */

/*
 * @test
 *
 * @summary converted from VM Testbase runtime/jbe/subcommon/subcommon01.
 * VM Testbase keywords: [quick, runtime]
 *
 * @library /vmTestbase
 *          /test/lib
 * @run main/othervm vm.compiler.jbe.subcommon.subcommon01.subcommon01
 */

package vm.compiler.jbe.subcommon.subcommon01;

/* -- Common subexpression elimination testing
Using both global and local common subexpressions in methods b5()
and b6() below to test common subexpression.
 */

import java.io.PrintStream;
import java.lang.Exception;

public class subcommon01 {
  static final int LEN = 500;

  public static void main(String args[]) {
    double a[]  = new double[LEN];
    double ao[] = new double[LEN];

    Preopt preOptRun = new Preopt();
    initAr(a);
    preOptRun.b1(a);
    preOptRun.b2(a);
    preOptRun.b3(a);
    preOptRun.b5(a);
    preOptRun.b2(a);
    preOptRun.b6(a);

    Opt optRun = new Opt();
    initAr(ao);
    optRun.b1(ao);
    optRun.b2(ao);
    optRun.b3(ao);
    optRun.b5(ao);
    optRun.b2(ao);
    optRun.b6(ao);

    eCheck(a, ao);
  }

  static int getLen() {
    return LEN;
  }

  static void initAr(double arr[]) {
    double r1, r2, r3;
    for (int r=0; r<LEN; r++) {
      r1 = LEN/(r+1);
      r2 = Math.sqrt(r1*r1);
      r3 = Math.sin(r2);
      arr[r] = r2/r3;
    }
  }

  static void pt(double arr[]) {
    System.out.println();
    for (int k=0; k<10; k++)
      System.out.print("a["+k+"]="+arr[k]);
  }

  static void eCheck(double b1[], double b2[]) {
    for (int k = 0; k < LEN; k++) {
      if (b1[k] != b2[k]) {
        System.out.println("eCheck fails in a["+k+"]");
        System.out.println("a ["+k+"]="+b1[k]);
        System.out.println("ao["+k+"]="+b2[k]);
        System.out.println("Test subcommon01 Failed.");
        throw new Error("Test subcommon01 Failed: eCheck fails in a[" + k + "]. a[" + k + "]=" + b1[k] + " != ao[" + k + "]=" + b2[k]);
      }
    }
    System.out.println("Test subcommon01 Passed.");
  }
}

class A {
  int m = 81;
  int n = 1;
  int i = 0;
  int j = 0;
  double v;
  double x = 1;
  double t3 = 0;
  double t5, t9, t14;
  int t1, t2, t4;
  int t6, t7, t8, t10;
  int t11, t12, t13, t15;

  void b1(double arr[]) {
    i = m-1;
    j = n;
    t1 = 4*n;
    try {
      v = arr[t1];
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.err.println("Bad input to subcommon01.b1. " +
                         "Expected a smaller number than " + subcommon01.getLen() +
                         ", got: ->" + t1 + "<-");
      System.out.println( e );
      System.exit(1);
    }
    //    System.out.println("Finish b1");
  }

  void b2(double arr[]) {
      t2 = 4*(++i);
      try {
        t3 = arr[t2];
      }
      catch (ArrayIndexOutOfBoundsException e) {
        System.err.println("Bad input to subcommon01.b2. " +
                           "Expected a smaller number than " + subcommon01.getLen() +
                           ", got: ->" + t2 + "<-");
        System.out.println( e );
        System.exit(1);
      }
      //    System.out.println("Finish b2");
  }


  void b3(double arr[]) {
      t4 = 4*(--j);
      try {
        t5 = arr[t4];
      }
      catch (ArrayIndexOutOfBoundsException e) {
        System.err.println("Bad input to subcommon01.b3. " +
                           "Expected a smaller number than " + subcommon01.getLen() +
                           ", got: ->" + t4 + "<-");
        System.out.println( e );
        System.exit(1);
      }
      //    System.out.println("Finish b3");
  }
}


class Preopt extends A {
  // Pre-optimized code
  void b5(double arr[]) {
    t6 = 4*i;
    try {
      x = arr[t6];
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.err.println("Bad input to subcommon01.b5. " +
                         "Expected a smaller number than " + subcommon01.getLen() +
                         ", got: ->" + t6 + "<-");
      System.out.println( e );
      System.exit(1);
    }
    t7 = 4*i;
    t8 = 4*j;
    try {
      t9 = arr[t8];
      arr[t7] = t9;
      t10 = 4*j;
      arr[t10] = x;
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.out.println( e );
      System.exit(1);
    }
    //    System.out.println("Finish b5");
  }

  void b6(double arr[]) {
    t11 = 4*i;
    t12 = 4*i;
    t13 = 4*n;
    try {
      x = arr[t11];
      t14 = arr[t13];
      arr[t12] = t14;
      t15 = 4*n;
      arr[t15] = x;
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.out.println( e );
      System.exit(1);
    }
    //    System.out.println("Finish b6");
  }
}

class Opt extends A {
  // The result of eliminating both global and local common subexpressions
  // from methods b5() and b6() resides in methods bopt5() and bopt6() respectively.
  void b5(double arropt[]) {
    x = t3;
    try {
      arropt[t2] = t5;
      arropt[t4] = x;
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.out.println( e );
      System.exit(1);
    }
    //    System.out.println("Finish b5");
  }

  void b6(double arropt[]) {
    x = t3;
    try {
      t14 = arropt[t1];
      arropt[t2] = t14;
      arropt[t1] = x;
    }
    catch (ArrayIndexOutOfBoundsException e) {
      System.out.println( e );
      System.exit(1);
    }
    //    System.out.println("Finish b6");
  }
}