summaryrefslogtreecommitdiffstats
path: root/test/513-array-deopt/src/Main.java
blob: a0ae4c3556e8609d0953cd996d1ae4daa48c46ef (plain)
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
/*
 * Copyright (C) 2015 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.
 */

public class Main {
  public static int[] bar(int[] a) {
    a[0] = 0;
    a[1] = 0;
    a[2] = 0;
    // Up to this point, we record that the lower bound is 2.
    // The next instruction will record that the lower bound is 5.
    // The deoptimization code used to assume the lower bound has
    // to be check it will add for the deoptimization (here, it
    // would be 2).
    return new int[a.length - 5];
  }

  public static void main(String[] args) {
    int[] a = new int[5];
    a = bar(a);
    if (a.length != 0) {
      throw new Error("Expected 0, got " + a.length);
    }
  }
}