1*795d594fSAndroid Build Coastguard Worker /* 2*795d594fSAndroid Build Coastguard Worker * Copyright (C) 2015 The Android Open Source Project 3*795d594fSAndroid Build Coastguard Worker * 4*795d594fSAndroid Build Coastguard Worker * Licensed under the Apache License, Version 2.0 (the "License"); 5*795d594fSAndroid Build Coastguard Worker * you may not use this file except in compliance with the License. 6*795d594fSAndroid Build Coastguard Worker * You may obtain a copy of the License at 7*795d594fSAndroid Build Coastguard Worker * 8*795d594fSAndroid Build Coastguard Worker * http://www.apache.org/licenses/LICENSE-2.0 9*795d594fSAndroid Build Coastguard Worker * 10*795d594fSAndroid Build Coastguard Worker * Unless required by applicable law or agreed to in writing, software 11*795d594fSAndroid Build Coastguard Worker * distributed under the License is distributed on an "AS IS" BASIS, 12*795d594fSAndroid Build Coastguard Worker * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13*795d594fSAndroid Build Coastguard Worker * See the License for the specific language governing permissions and 14*795d594fSAndroid Build Coastguard Worker * limitations under the License. 15*795d594fSAndroid Build Coastguard Worker */ 16*795d594fSAndroid Build Coastguard Worker 17*795d594fSAndroid Build Coastguard Worker public class Main { bar(int[] a)18*795d594fSAndroid Build Coastguard Worker public static int[] bar(int[] a) { 19*795d594fSAndroid Build Coastguard Worker a[0] = 0; 20*795d594fSAndroid Build Coastguard Worker a[1] = 0; 21*795d594fSAndroid Build Coastguard Worker a[2] = 0; 22*795d594fSAndroid Build Coastguard Worker // Up to this point, we record that the lower bound (inclusive) is 3. 23*795d594fSAndroid Build Coastguard Worker // The next instruction will record that the lower bound is 5. 24*795d594fSAndroid Build Coastguard Worker // The deoptimization code used to assume the lower bound has 25*795d594fSAndroid Build Coastguard Worker // to be the one it will add for the deoptimization check (here, it 26*795d594fSAndroid Build Coastguard Worker // would be 3). 27*795d594fSAndroid Build Coastguard Worker return new int[a.length - 5]; 28*795d594fSAndroid Build Coastguard Worker } 29*795d594fSAndroid Build Coastguard Worker foo(int[] a)30*795d594fSAndroid Build Coastguard Worker public static int[] foo(int[] a) { 31*795d594fSAndroid Build Coastguard Worker a[0] = 0; 32*795d594fSAndroid Build Coastguard Worker a[1] = 0; 33*795d594fSAndroid Build Coastguard Worker a[2] = 0; 34*795d594fSAndroid Build Coastguard Worker // Up to this point, we record that the lower bound (inclusive) is 3. 35*795d594fSAndroid Build Coastguard Worker // The next instruction will record that the lower bound is 1. 36*795d594fSAndroid Build Coastguard Worker // The deoptimization code used to assume the lower bound has 37*795d594fSAndroid Build Coastguard Worker // to be the one it will add for the deoptimization check (here, it 38*795d594fSAndroid Build Coastguard Worker // would be 3). 39*795d594fSAndroid Build Coastguard Worker return new int[a.length - 1]; 40*795d594fSAndroid Build Coastguard Worker } 41*795d594fSAndroid Build Coastguard Worker main(String[] args)42*795d594fSAndroid Build Coastguard Worker public static void main(String[] args) { 43*795d594fSAndroid Build Coastguard Worker int[] a = new int[5]; 44*795d594fSAndroid Build Coastguard Worker int[] result = bar(a); 45*795d594fSAndroid Build Coastguard Worker if (result.length != 0) { 46*795d594fSAndroid Build Coastguard Worker throw new Error("Expected 0, got " + result.length); 47*795d594fSAndroid Build Coastguard Worker } 48*795d594fSAndroid Build Coastguard Worker 49*795d594fSAndroid Build Coastguard Worker result = foo(a); 50*795d594fSAndroid Build Coastguard Worker if (result.length != 4) { 51*795d594fSAndroid Build Coastguard Worker throw new Error("Expected 5, got " + result.length); 52*795d594fSAndroid Build Coastguard Worker } 53*795d594fSAndroid Build Coastguard Worker } 54*795d594fSAndroid Build Coastguard Worker } 55