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
|
/*
* Copyright (c) 2022, 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.
*/
package compiler/interpreter;
/* JASM simplified from the following Java pattern:
*
* public class Custom {
*
* static void test(int v) {
* int i8 = 1;
* try {
* v += 1;
* } catch (ArithmeticException exc1) {
* } finally {
* for (; i8 < 100; i8++) {
* }
* }
* }
*
*/
super public class Custom {
public static Method test:"(I)V" stack 2 locals 3 {
iconst_1;
istore_1;
try t0;
iinc 0, 1;
endtry t0;
Loop:
iload_1;
bipush 100;
if_icmpge Lexit;
iinc 1, 1;
goto Loop; // deoptimize here on backwards branch
catch t0 java/lang/ArithmeticException; // unreachable block
astore_2;
Lexit:
return
}
}
|
