|
43972
|
1 |
/*
|
|
|
2 |
* Copyright (c) 2009, 2016, Oracle and/or its affiliates. All rights reserved.
|
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
4 |
*
|
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
|
7 |
* published by the Free Software Foundation.
|
|
|
8 |
*
|
|
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
13 |
* accompanied this code).
|
|
|
14 |
*
|
|
|
15 |
* You should have received a copy of the GNU General Public License version
|
|
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
18 |
*
|
|
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
20 |
* or visit www.oracle.com if you need additional information or have any
|
|
|
21 |
* questions.
|
|
|
22 |
*/
|
|
|
23 |
package org.graalvm.compiler.java;
|
|
|
24 |
|
|
46344
|
25 |
import static java.lang.String.format;
|
|
|
26 |
import static java.lang.reflect.Modifier.STATIC;
|
|
|
27 |
import static java.lang.reflect.Modifier.SYNCHRONIZED;
|
|
|
28 |
import static jdk.vm.ci.meta.DeoptimizationAction.InvalidateRecompile;
|
|
|
29 |
import static jdk.vm.ci.meta.DeoptimizationAction.InvalidateReprofile;
|
|
|
30 |
import static jdk.vm.ci.meta.DeoptimizationReason.JavaSubroutineMismatch;
|
|
|
31 |
import static jdk.vm.ci.meta.DeoptimizationReason.NullCheckException;
|
|
|
32 |
import static jdk.vm.ci.meta.DeoptimizationReason.RuntimeConstraint;
|
|
|
33 |
import static jdk.vm.ci.meta.DeoptimizationReason.TypeCheckedInliningViolated;
|
|
|
34 |
import static jdk.vm.ci.meta.DeoptimizationReason.UnreachedCode;
|
|
|
35 |
import static jdk.vm.ci.meta.DeoptimizationReason.Unresolved;
|
|
|
36 |
import static jdk.vm.ci.runtime.JVMCICompiler.INVOCATION_ENTRY_BCI;
|
|
43972
|
37 |
import static org.graalvm.compiler.bytecode.Bytecodes.AALOAD;
|
|
|
38 |
import static org.graalvm.compiler.bytecode.Bytecodes.AASTORE;
|
|
|
39 |
import static org.graalvm.compiler.bytecode.Bytecodes.ACONST_NULL;
|
|
|
40 |
import static org.graalvm.compiler.bytecode.Bytecodes.ALOAD;
|
|
|
41 |
import static org.graalvm.compiler.bytecode.Bytecodes.ALOAD_0;
|
|
|
42 |
import static org.graalvm.compiler.bytecode.Bytecodes.ALOAD_1;
|
|
|
43 |
import static org.graalvm.compiler.bytecode.Bytecodes.ALOAD_2;
|
|
|
44 |
import static org.graalvm.compiler.bytecode.Bytecodes.ALOAD_3;
|
|
|
45 |
import static org.graalvm.compiler.bytecode.Bytecodes.ANEWARRAY;
|
|
|
46 |
import static org.graalvm.compiler.bytecode.Bytecodes.ARETURN;
|
|
|
47 |
import static org.graalvm.compiler.bytecode.Bytecodes.ARRAYLENGTH;
|
|
|
48 |
import static org.graalvm.compiler.bytecode.Bytecodes.ASTORE;
|
|
|
49 |
import static org.graalvm.compiler.bytecode.Bytecodes.ASTORE_0;
|
|
|
50 |
import static org.graalvm.compiler.bytecode.Bytecodes.ASTORE_1;
|
|
|
51 |
import static org.graalvm.compiler.bytecode.Bytecodes.ASTORE_2;
|
|
|
52 |
import static org.graalvm.compiler.bytecode.Bytecodes.ASTORE_3;
|
|
|
53 |
import static org.graalvm.compiler.bytecode.Bytecodes.ATHROW;
|
|
|
54 |
import static org.graalvm.compiler.bytecode.Bytecodes.BALOAD;
|
|
|
55 |
import static org.graalvm.compiler.bytecode.Bytecodes.BASTORE;
|
|
|
56 |
import static org.graalvm.compiler.bytecode.Bytecodes.BIPUSH;
|
|
|
57 |
import static org.graalvm.compiler.bytecode.Bytecodes.BREAKPOINT;
|
|
|
58 |
import static org.graalvm.compiler.bytecode.Bytecodes.CALOAD;
|
|
|
59 |
import static org.graalvm.compiler.bytecode.Bytecodes.CASTORE;
|
|
|
60 |
import static org.graalvm.compiler.bytecode.Bytecodes.CHECKCAST;
|
|
|
61 |
import static org.graalvm.compiler.bytecode.Bytecodes.D2F;
|
|
|
62 |
import static org.graalvm.compiler.bytecode.Bytecodes.D2I;
|
|
|
63 |
import static org.graalvm.compiler.bytecode.Bytecodes.D2L;
|
|
|
64 |
import static org.graalvm.compiler.bytecode.Bytecodes.DADD;
|
|
|
65 |
import static org.graalvm.compiler.bytecode.Bytecodes.DALOAD;
|
|
|
66 |
import static org.graalvm.compiler.bytecode.Bytecodes.DASTORE;
|
|
|
67 |
import static org.graalvm.compiler.bytecode.Bytecodes.DCMPG;
|
|
|
68 |
import static org.graalvm.compiler.bytecode.Bytecodes.DCMPL;
|
|
|
69 |
import static org.graalvm.compiler.bytecode.Bytecodes.DCONST_0;
|
|
|
70 |
import static org.graalvm.compiler.bytecode.Bytecodes.DCONST_1;
|
|
|
71 |
import static org.graalvm.compiler.bytecode.Bytecodes.DDIV;
|
|
|
72 |
import static org.graalvm.compiler.bytecode.Bytecodes.DLOAD;
|
|
|
73 |
import static org.graalvm.compiler.bytecode.Bytecodes.DLOAD_0;
|
|
|
74 |
import static org.graalvm.compiler.bytecode.Bytecodes.DLOAD_1;
|
|
|
75 |
import static org.graalvm.compiler.bytecode.Bytecodes.DLOAD_2;
|
|
|
76 |
import static org.graalvm.compiler.bytecode.Bytecodes.DLOAD_3;
|
|
|
77 |
import static org.graalvm.compiler.bytecode.Bytecodes.DMUL;
|
|
|
78 |
import static org.graalvm.compiler.bytecode.Bytecodes.DNEG;
|
|
|
79 |
import static org.graalvm.compiler.bytecode.Bytecodes.DREM;
|
|
|
80 |
import static org.graalvm.compiler.bytecode.Bytecodes.DRETURN;
|
|
|
81 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSTORE;
|
|
|
82 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSTORE_0;
|
|
|
83 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSTORE_1;
|
|
|
84 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSTORE_2;
|
|
|
85 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSTORE_3;
|
|
|
86 |
import static org.graalvm.compiler.bytecode.Bytecodes.DSUB;
|
|
|
87 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP;
|
|
|
88 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP2;
|
|
|
89 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP2_X1;
|
|
|
90 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP2_X2;
|
|
|
91 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP_X1;
|
|
|
92 |
import static org.graalvm.compiler.bytecode.Bytecodes.DUP_X2;
|
|
|
93 |
import static org.graalvm.compiler.bytecode.Bytecodes.F2D;
|
|
|
94 |
import static org.graalvm.compiler.bytecode.Bytecodes.F2I;
|
|
|
95 |
import static org.graalvm.compiler.bytecode.Bytecodes.F2L;
|
|
|
96 |
import static org.graalvm.compiler.bytecode.Bytecodes.FADD;
|
|
|
97 |
import static org.graalvm.compiler.bytecode.Bytecodes.FALOAD;
|
|
|
98 |
import static org.graalvm.compiler.bytecode.Bytecodes.FASTORE;
|
|
|
99 |
import static org.graalvm.compiler.bytecode.Bytecodes.FCMPG;
|
|
|
100 |
import static org.graalvm.compiler.bytecode.Bytecodes.FCMPL;
|
|
|
101 |
import static org.graalvm.compiler.bytecode.Bytecodes.FCONST_0;
|
|
|
102 |
import static org.graalvm.compiler.bytecode.Bytecodes.FCONST_1;
|
|
|
103 |
import static org.graalvm.compiler.bytecode.Bytecodes.FCONST_2;
|
|
|
104 |
import static org.graalvm.compiler.bytecode.Bytecodes.FDIV;
|
|
|
105 |
import static org.graalvm.compiler.bytecode.Bytecodes.FLOAD;
|
|
|
106 |
import static org.graalvm.compiler.bytecode.Bytecodes.FLOAD_0;
|
|
|
107 |
import static org.graalvm.compiler.bytecode.Bytecodes.FLOAD_1;
|
|
|
108 |
import static org.graalvm.compiler.bytecode.Bytecodes.FLOAD_2;
|
|
|
109 |
import static org.graalvm.compiler.bytecode.Bytecodes.FLOAD_3;
|
|
|
110 |
import static org.graalvm.compiler.bytecode.Bytecodes.FMUL;
|
|
|
111 |
import static org.graalvm.compiler.bytecode.Bytecodes.FNEG;
|
|
|
112 |
import static org.graalvm.compiler.bytecode.Bytecodes.FREM;
|
|
|
113 |
import static org.graalvm.compiler.bytecode.Bytecodes.FRETURN;
|
|
|
114 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSTORE;
|
|
|
115 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSTORE_0;
|
|
|
116 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSTORE_1;
|
|
|
117 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSTORE_2;
|
|
|
118 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSTORE_3;
|
|
|
119 |
import static org.graalvm.compiler.bytecode.Bytecodes.FSUB;
|
|
|
120 |
import static org.graalvm.compiler.bytecode.Bytecodes.GETFIELD;
|
|
|
121 |
import static org.graalvm.compiler.bytecode.Bytecodes.GETSTATIC;
|
|
|
122 |
import static org.graalvm.compiler.bytecode.Bytecodes.GOTO;
|
|
|
123 |
import static org.graalvm.compiler.bytecode.Bytecodes.GOTO_W;
|
|
|
124 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2B;
|
|
|
125 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2C;
|
|
|
126 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2D;
|
|
|
127 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2F;
|
|
|
128 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2L;
|
|
|
129 |
import static org.graalvm.compiler.bytecode.Bytecodes.I2S;
|
|
|
130 |
import static org.graalvm.compiler.bytecode.Bytecodes.IADD;
|
|
|
131 |
import static org.graalvm.compiler.bytecode.Bytecodes.IALOAD;
|
|
|
132 |
import static org.graalvm.compiler.bytecode.Bytecodes.IAND;
|
|
|
133 |
import static org.graalvm.compiler.bytecode.Bytecodes.IASTORE;
|
|
|
134 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_0;
|
|
|
135 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_1;
|
|
|
136 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_2;
|
|
|
137 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_3;
|
|
|
138 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_4;
|
|
|
139 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_5;
|
|
|
140 |
import static org.graalvm.compiler.bytecode.Bytecodes.ICONST_M1;
|
|
|
141 |
import static org.graalvm.compiler.bytecode.Bytecodes.IDIV;
|
|
|
142 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFEQ;
|
|
|
143 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFGE;
|
|
|
144 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFGT;
|
|
|
145 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFLE;
|
|
|
146 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFLT;
|
|
|
147 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFNE;
|
|
|
148 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFNONNULL;
|
|
|
149 |
import static org.graalvm.compiler.bytecode.Bytecodes.IFNULL;
|
|
|
150 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ACMPEQ;
|
|
|
151 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ACMPNE;
|
|
|
152 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPEQ;
|
|
|
153 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPGE;
|
|
|
154 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPGT;
|
|
|
155 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPLE;
|
|
|
156 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPLT;
|
|
|
157 |
import static org.graalvm.compiler.bytecode.Bytecodes.IF_ICMPNE;
|
|
|
158 |
import static org.graalvm.compiler.bytecode.Bytecodes.IINC;
|
|
|
159 |
import static org.graalvm.compiler.bytecode.Bytecodes.ILOAD;
|
|
|
160 |
import static org.graalvm.compiler.bytecode.Bytecodes.ILOAD_0;
|
|
|
161 |
import static org.graalvm.compiler.bytecode.Bytecodes.ILOAD_1;
|
|
|
162 |
import static org.graalvm.compiler.bytecode.Bytecodes.ILOAD_2;
|
|
|
163 |
import static org.graalvm.compiler.bytecode.Bytecodes.ILOAD_3;
|
|
|
164 |
import static org.graalvm.compiler.bytecode.Bytecodes.IMUL;
|
|
|
165 |
import static org.graalvm.compiler.bytecode.Bytecodes.INEG;
|
|
|
166 |
import static org.graalvm.compiler.bytecode.Bytecodes.INSTANCEOF;
|
|
|
167 |
import static org.graalvm.compiler.bytecode.Bytecodes.INVOKEDYNAMIC;
|
|
|
168 |
import static org.graalvm.compiler.bytecode.Bytecodes.INVOKEINTERFACE;
|
|
|
169 |
import static org.graalvm.compiler.bytecode.Bytecodes.INVOKESPECIAL;
|
|
|
170 |
import static org.graalvm.compiler.bytecode.Bytecodes.INVOKESTATIC;
|
|
|
171 |
import static org.graalvm.compiler.bytecode.Bytecodes.INVOKEVIRTUAL;
|
|
|
172 |
import static org.graalvm.compiler.bytecode.Bytecodes.IOR;
|
|
|
173 |
import static org.graalvm.compiler.bytecode.Bytecodes.IREM;
|
|
|
174 |
import static org.graalvm.compiler.bytecode.Bytecodes.IRETURN;
|
|
|
175 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISHL;
|
|
|
176 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISHR;
|
|
|
177 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISTORE;
|
|
|
178 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISTORE_0;
|
|
|
179 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISTORE_1;
|
|
|
180 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISTORE_2;
|
|
|
181 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISTORE_3;
|
|
|
182 |
import static org.graalvm.compiler.bytecode.Bytecodes.ISUB;
|
|
|
183 |
import static org.graalvm.compiler.bytecode.Bytecodes.IUSHR;
|
|
|
184 |
import static org.graalvm.compiler.bytecode.Bytecodes.IXOR;
|
|
|
185 |
import static org.graalvm.compiler.bytecode.Bytecodes.JSR;
|
|
|
186 |
import static org.graalvm.compiler.bytecode.Bytecodes.JSR_W;
|
|
|
187 |
import static org.graalvm.compiler.bytecode.Bytecodes.L2D;
|
|
|
188 |
import static org.graalvm.compiler.bytecode.Bytecodes.L2F;
|
|
|
189 |
import static org.graalvm.compiler.bytecode.Bytecodes.L2I;
|
|
|
190 |
import static org.graalvm.compiler.bytecode.Bytecodes.LADD;
|
|
|
191 |
import static org.graalvm.compiler.bytecode.Bytecodes.LALOAD;
|
|
|
192 |
import static org.graalvm.compiler.bytecode.Bytecodes.LAND;
|
|
|
193 |
import static org.graalvm.compiler.bytecode.Bytecodes.LASTORE;
|
|
|
194 |
import static org.graalvm.compiler.bytecode.Bytecodes.LCMP;
|
|
|
195 |
import static org.graalvm.compiler.bytecode.Bytecodes.LCONST_0;
|
|
|
196 |
import static org.graalvm.compiler.bytecode.Bytecodes.LCONST_1;
|
|
|
197 |
import static org.graalvm.compiler.bytecode.Bytecodes.LDC;
|
|
|
198 |
import static org.graalvm.compiler.bytecode.Bytecodes.LDC2_W;
|
|
|
199 |
import static org.graalvm.compiler.bytecode.Bytecodes.LDC_W;
|
|
|
200 |
import static org.graalvm.compiler.bytecode.Bytecodes.LDIV;
|
|
|
201 |
import static org.graalvm.compiler.bytecode.Bytecodes.LLOAD;
|
|
|
202 |
import static org.graalvm.compiler.bytecode.Bytecodes.LLOAD_0;
|
|
|
203 |
import static org.graalvm.compiler.bytecode.Bytecodes.LLOAD_1;
|
|
|
204 |
import static org.graalvm.compiler.bytecode.Bytecodes.LLOAD_2;
|
|
|
205 |
import static org.graalvm.compiler.bytecode.Bytecodes.LLOAD_3;
|
|
|
206 |
import static org.graalvm.compiler.bytecode.Bytecodes.LMUL;
|
|
|
207 |
import static org.graalvm.compiler.bytecode.Bytecodes.LNEG;
|
|
|
208 |
import static org.graalvm.compiler.bytecode.Bytecodes.LOOKUPSWITCH;
|
|
|
209 |
import static org.graalvm.compiler.bytecode.Bytecodes.LOR;
|
|
|
210 |
import static org.graalvm.compiler.bytecode.Bytecodes.LREM;
|
|
|
211 |
import static org.graalvm.compiler.bytecode.Bytecodes.LRETURN;
|
|
|
212 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSHL;
|
|
|
213 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSHR;
|
|
|
214 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSTORE;
|
|
|
215 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSTORE_0;
|
|
|
216 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSTORE_1;
|
|
|
217 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSTORE_2;
|
|
|
218 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSTORE_3;
|
|
|
219 |
import static org.graalvm.compiler.bytecode.Bytecodes.LSUB;
|
|
|
220 |
import static org.graalvm.compiler.bytecode.Bytecodes.LUSHR;
|
|
|
221 |
import static org.graalvm.compiler.bytecode.Bytecodes.LXOR;
|
|
|
222 |
import static org.graalvm.compiler.bytecode.Bytecodes.MONITORENTER;
|
|
|
223 |
import static org.graalvm.compiler.bytecode.Bytecodes.MONITOREXIT;
|
|
|
224 |
import static org.graalvm.compiler.bytecode.Bytecodes.MULTIANEWARRAY;
|
|
|
225 |
import static org.graalvm.compiler.bytecode.Bytecodes.NEW;
|
|
|
226 |
import static org.graalvm.compiler.bytecode.Bytecodes.NEWARRAY;
|
|
|
227 |
import static org.graalvm.compiler.bytecode.Bytecodes.NOP;
|
|
|
228 |
import static org.graalvm.compiler.bytecode.Bytecodes.POP;
|
|
|
229 |
import static org.graalvm.compiler.bytecode.Bytecodes.POP2;
|
|
|
230 |
import static org.graalvm.compiler.bytecode.Bytecodes.PUTFIELD;
|
|
|
231 |
import static org.graalvm.compiler.bytecode.Bytecodes.PUTSTATIC;
|
|
|
232 |
import static org.graalvm.compiler.bytecode.Bytecodes.RET;
|
|
|
233 |
import static org.graalvm.compiler.bytecode.Bytecodes.RETURN;
|
|
|
234 |
import static org.graalvm.compiler.bytecode.Bytecodes.SALOAD;
|
|
|
235 |
import static org.graalvm.compiler.bytecode.Bytecodes.SASTORE;
|
|
|
236 |
import static org.graalvm.compiler.bytecode.Bytecodes.SIPUSH;
|
|
|
237 |
import static org.graalvm.compiler.bytecode.Bytecodes.SWAP;
|
|
|
238 |
import static org.graalvm.compiler.bytecode.Bytecodes.TABLESWITCH;
|
|
|
239 |
import static org.graalvm.compiler.bytecode.Bytecodes.nameOf;
|
|
|
240 |
import static org.graalvm.compiler.core.common.GraalOptions.DeoptALot;
|
|
|
241 |
import static org.graalvm.compiler.core.common.GraalOptions.GeneratePIC;
|
|
46344
|
242 |
import static org.graalvm.compiler.core.common.GraalOptions.HotSpotPrintInlining;
|
|
43972
|
243 |
import static org.graalvm.compiler.core.common.GraalOptions.PrintProfilingInformation;
|
|
|
244 |
import static org.graalvm.compiler.core.common.GraalOptions.ResolveClassBeforeStaticInvoke;
|
|
46344
|
245 |
import static org.graalvm.compiler.core.common.GraalOptions.StressExplicitExceptionCode;
|
|
43972
|
246 |
import static org.graalvm.compiler.core.common.GraalOptions.StressInvokeWithExceptionNode;
|
|
|
247 |
import static org.graalvm.compiler.core.common.type.StampFactory.objectNonNull;
|
|
|
248 |
import static org.graalvm.compiler.debug.GraalError.guarantee;
|
|
|
249 |
import static org.graalvm.compiler.debug.GraalError.shouldNotReachHere;
|
|
46344
|
250 |
import static org.graalvm.compiler.java.BytecodeParserOptions.TraceBytecodeParserLevel;
|
|
43972
|
251 |
import static org.graalvm.compiler.java.BytecodeParserOptions.TraceInlineDuringParsing;
|
|
|
252 |
import static org.graalvm.compiler.java.BytecodeParserOptions.TraceParserPlugins;
|
|
|
253 |
import static org.graalvm.compiler.java.BytecodeParserOptions.UseGuardedIntrinsics;
|
|
|
254 |
import static org.graalvm.compiler.nodes.graphbuilderconf.IntrinsicContext.CompilationContext.INLINE_DURING_PARSING;
|
|
|
255 |
import static org.graalvm.compiler.nodes.type.StampTool.isPointerNonNull;
|
|
46344
|
256 |
|
|
43972
|
257 |
import java.util.ArrayList;
|
|
|
258 |
import java.util.Collections;
|
|
|
259 |
import java.util.Comparator;
|
|
|
260 |
import java.util.Formatter;
|
|
|
261 |
import java.util.List;
|
|
|
262 |
|
|
|
263 |
import org.graalvm.compiler.bytecode.Bytecode;
|
|
|
264 |
import org.graalvm.compiler.bytecode.BytecodeDisassembler;
|
|
|
265 |
import org.graalvm.compiler.bytecode.BytecodeLookupSwitch;
|
|
|
266 |
import org.graalvm.compiler.bytecode.BytecodeProvider;
|
|
|
267 |
import org.graalvm.compiler.bytecode.BytecodeStream;
|
|
|
268 |
import org.graalvm.compiler.bytecode.BytecodeSwitch;
|
|
|
269 |
import org.graalvm.compiler.bytecode.BytecodeTableSwitch;
|
|
|
270 |
import org.graalvm.compiler.bytecode.Bytecodes;
|
|
46344
|
271 |
import org.graalvm.compiler.bytecode.Bytes;
|
|
43972
|
272 |
import org.graalvm.compiler.bytecode.ResolvedJavaMethodBytecode;
|
|
|
273 |
import org.graalvm.compiler.bytecode.ResolvedJavaMethodBytecodeProvider;
|
|
46371
|
274 |
import org.graalvm.compiler.core.common.LocationIdentity;
|
|
46344
|
275 |
import org.graalvm.compiler.core.common.PermanentBailoutException;
|
|
43972
|
276 |
import org.graalvm.compiler.core.common.calc.Condition;
|
|
|
277 |
import org.graalvm.compiler.core.common.calc.FloatConvert;
|
|
|
278 |
import org.graalvm.compiler.core.common.spi.ConstantFieldProvider;
|
|
|
279 |
import org.graalvm.compiler.core.common.type.ObjectStamp;
|
|
|
280 |
import org.graalvm.compiler.core.common.type.Stamp;
|
|
|
281 |
import org.graalvm.compiler.core.common.type.StampFactory;
|
|
|
282 |
import org.graalvm.compiler.core.common.type.StampPair;
|
|
|
283 |
import org.graalvm.compiler.core.common.type.TypeReference;
|
|
|
284 |
import org.graalvm.compiler.core.common.util.Util;
|
|
46344
|
285 |
import org.graalvm.compiler.debug.Assertions;
|
|
43972
|
286 |
import org.graalvm.compiler.debug.Debug;
|
|
|
287 |
import org.graalvm.compiler.debug.Debug.Scope;
|
|
|
288 |
import org.graalvm.compiler.debug.DebugCloseable;
|
|
|
289 |
import org.graalvm.compiler.debug.DebugCounter;
|
|
|
290 |
import org.graalvm.compiler.debug.GraalError;
|
|
|
291 |
import org.graalvm.compiler.debug.Indent;
|
|
|
292 |
import org.graalvm.compiler.debug.TTY;
|
|
|
293 |
import org.graalvm.compiler.graph.Graph.Mark;
|
|
|
294 |
import org.graalvm.compiler.graph.Node;
|
|
|
295 |
import org.graalvm.compiler.graph.NodeSourcePosition;
|
|
|
296 |
import org.graalvm.compiler.graph.iterators.NodeIterable;
|
|
|
297 |
import org.graalvm.compiler.java.BciBlockMapping.BciBlock;
|
|
|
298 |
import org.graalvm.compiler.java.BciBlockMapping.ExceptionDispatchBlock;
|
|
|
299 |
import org.graalvm.compiler.nodes.AbstractBeginNode;
|
|
|
300 |
import org.graalvm.compiler.nodes.AbstractMergeNode;
|
|
|
301 |
import org.graalvm.compiler.nodes.BeginNode;
|
|
|
302 |
import org.graalvm.compiler.nodes.BeginStateSplitNode;
|
|
|
303 |
import org.graalvm.compiler.nodes.CallTargetNode;
|
|
|
304 |
import org.graalvm.compiler.nodes.CallTargetNode.InvokeKind;
|
|
|
305 |
import org.graalvm.compiler.nodes.ConstantNode;
|
|
|
306 |
import org.graalvm.compiler.nodes.ControlSplitNode;
|
|
|
307 |
import org.graalvm.compiler.nodes.DeoptimizeNode;
|
|
|
308 |
import org.graalvm.compiler.nodes.EndNode;
|
|
|
309 |
import org.graalvm.compiler.nodes.EntryMarkerNode;
|
|
|
310 |
import org.graalvm.compiler.nodes.EntryProxyNode;
|
|
|
311 |
import org.graalvm.compiler.nodes.FieldLocationIdentity;
|
|
|
312 |
import org.graalvm.compiler.nodes.FixedGuardNode;
|
|
|
313 |
import org.graalvm.compiler.nodes.FixedNode;
|
|
|
314 |
import org.graalvm.compiler.nodes.FixedWithNextNode;
|
|
|
315 |
import org.graalvm.compiler.nodes.FrameState;
|
|
|
316 |
import org.graalvm.compiler.nodes.FullInfopointNode;
|
|
|
317 |
import org.graalvm.compiler.nodes.IfNode;
|
|
|
318 |
import org.graalvm.compiler.nodes.Invoke;
|
|
|
319 |
import org.graalvm.compiler.nodes.InvokeNode;
|
|
|
320 |
import org.graalvm.compiler.nodes.InvokeWithExceptionNode;
|
|
|
321 |
import org.graalvm.compiler.nodes.KillingBeginNode;
|
|
|
322 |
import org.graalvm.compiler.nodes.LogicConstantNode;
|
|
|
323 |
import org.graalvm.compiler.nodes.LogicNegationNode;
|
|
|
324 |
import org.graalvm.compiler.nodes.LogicNode;
|
|
|
325 |
import org.graalvm.compiler.nodes.LoopBeginNode;
|
|
|
326 |
import org.graalvm.compiler.nodes.LoopEndNode;
|
|
|
327 |
import org.graalvm.compiler.nodes.LoopExitNode;
|
|
|
328 |
import org.graalvm.compiler.nodes.MergeNode;
|
|
|
329 |
import org.graalvm.compiler.nodes.ParameterNode;
|
|
|
330 |
import org.graalvm.compiler.nodes.PiNode;
|
|
|
331 |
import org.graalvm.compiler.nodes.ReturnNode;
|
|
|
332 |
import org.graalvm.compiler.nodes.StartNode;
|
|
|
333 |
import org.graalvm.compiler.nodes.StateSplit;
|
|
|
334 |
import org.graalvm.compiler.nodes.StructuredGraph;
|
|
|
335 |
import org.graalvm.compiler.nodes.UnwindNode;
|
|
|
336 |
import org.graalvm.compiler.nodes.ValueNode;
|
|
|
337 |
import org.graalvm.compiler.nodes.calc.AddNode;
|
|
|
338 |
import org.graalvm.compiler.nodes.calc.AndNode;
|
|
|
339 |
import org.graalvm.compiler.nodes.calc.CompareNode;
|
|
|
340 |
import org.graalvm.compiler.nodes.calc.ConditionalNode;
|
|
|
341 |
import org.graalvm.compiler.nodes.calc.DivNode;
|
|
|
342 |
import org.graalvm.compiler.nodes.calc.FloatConvertNode;
|
|
|
343 |
import org.graalvm.compiler.nodes.calc.IntegerBelowNode;
|
|
|
344 |
import org.graalvm.compiler.nodes.calc.IntegerEqualsNode;
|
|
|
345 |
import org.graalvm.compiler.nodes.calc.IntegerLessThanNode;
|
|
|
346 |
import org.graalvm.compiler.nodes.calc.IsNullNode;
|
|
|
347 |
import org.graalvm.compiler.nodes.calc.LeftShiftNode;
|
|
|
348 |
import org.graalvm.compiler.nodes.calc.MulNode;
|
|
|
349 |
import org.graalvm.compiler.nodes.calc.NarrowNode;
|
|
|
350 |
import org.graalvm.compiler.nodes.calc.NegateNode;
|
|
|
351 |
import org.graalvm.compiler.nodes.calc.NormalizeCompareNode;
|
|
|
352 |
import org.graalvm.compiler.nodes.calc.ObjectEqualsNode;
|
|
|
353 |
import org.graalvm.compiler.nodes.calc.OrNode;
|
|
|
354 |
import org.graalvm.compiler.nodes.calc.RemNode;
|
|
|
355 |
import org.graalvm.compiler.nodes.calc.RightShiftNode;
|
|
|
356 |
import org.graalvm.compiler.nodes.calc.SignExtendNode;
|
|
|
357 |
import org.graalvm.compiler.nodes.calc.SignedDivNode;
|
|
|
358 |
import org.graalvm.compiler.nodes.calc.SignedRemNode;
|
|
|
359 |
import org.graalvm.compiler.nodes.calc.SubNode;
|
|
|
360 |
import org.graalvm.compiler.nodes.calc.UnsignedRightShiftNode;
|
|
|
361 |
import org.graalvm.compiler.nodes.calc.XorNode;
|
|
|
362 |
import org.graalvm.compiler.nodes.calc.ZeroExtendNode;
|
|
|
363 |
import org.graalvm.compiler.nodes.extended.AnchoringNode;
|
|
|
364 |
import org.graalvm.compiler.nodes.extended.BytecodeExceptionNode;
|
|
|
365 |
import org.graalvm.compiler.nodes.extended.IntegerSwitchNode;
|
|
|
366 |
import org.graalvm.compiler.nodes.extended.LoadHubNode;
|
|
|
367 |
import org.graalvm.compiler.nodes.extended.LoadMethodNode;
|
|
|
368 |
import org.graalvm.compiler.nodes.extended.MembarNode;
|
|
|
369 |
import org.graalvm.compiler.nodes.extended.ValueAnchorNode;
|
|
|
370 |
import org.graalvm.compiler.nodes.graphbuilderconf.ClassInitializationPlugin;
|
|
|
371 |
import org.graalvm.compiler.nodes.graphbuilderconf.GraphBuilderConfiguration;
|
|
|
372 |
import org.graalvm.compiler.nodes.graphbuilderconf.GraphBuilderConfiguration.BytecodeExceptionMode;
|
|
|
373 |
import org.graalvm.compiler.nodes.graphbuilderconf.GraphBuilderContext;
|
|
|
374 |
import org.graalvm.compiler.nodes.graphbuilderconf.InlineInvokePlugin;
|
|
|
375 |
import org.graalvm.compiler.nodes.graphbuilderconf.InlineInvokePlugin.InlineInfo;
|
|
|
376 |
import org.graalvm.compiler.nodes.graphbuilderconf.IntrinsicContext;
|
|
|
377 |
import org.graalvm.compiler.nodes.graphbuilderconf.InvocationPlugin;
|
|
|
378 |
import org.graalvm.compiler.nodes.graphbuilderconf.InvocationPlugins.InvocationPluginReceiver;
|
|
|
379 |
import org.graalvm.compiler.nodes.graphbuilderconf.NodePlugin;
|
|
|
380 |
import org.graalvm.compiler.nodes.graphbuilderconf.ProfilingPlugin;
|
|
|
381 |
import org.graalvm.compiler.nodes.java.ArrayLengthNode;
|
|
|
382 |
import org.graalvm.compiler.nodes.java.ExceptionObjectNode;
|
|
|
383 |
import org.graalvm.compiler.nodes.java.FinalFieldBarrierNode;
|
|
|
384 |
import org.graalvm.compiler.nodes.java.InstanceOfNode;
|
|
|
385 |
import org.graalvm.compiler.nodes.java.LoadFieldNode;
|
|
|
386 |
import org.graalvm.compiler.nodes.java.LoadIndexedNode;
|
|
|
387 |
import org.graalvm.compiler.nodes.java.MethodCallTargetNode;
|
|
|
388 |
import org.graalvm.compiler.nodes.java.MonitorEnterNode;
|
|
|
389 |
import org.graalvm.compiler.nodes.java.MonitorExitNode;
|
|
|
390 |
import org.graalvm.compiler.nodes.java.MonitorIdNode;
|
|
|
391 |
import org.graalvm.compiler.nodes.java.NewArrayNode;
|
|
|
392 |
import org.graalvm.compiler.nodes.java.NewInstanceNode;
|
|
|
393 |
import org.graalvm.compiler.nodes.java.NewMultiArrayNode;
|
|
|
394 |
import org.graalvm.compiler.nodes.java.RegisterFinalizerNode;
|
|
|
395 |
import org.graalvm.compiler.nodes.java.StoreFieldNode;
|
|
|
396 |
import org.graalvm.compiler.nodes.java.StoreIndexedNode;
|
|
|
397 |
import org.graalvm.compiler.nodes.spi.StampProvider;
|
|
|
398 |
import org.graalvm.compiler.nodes.type.StampTool;
|
|
|
399 |
import org.graalvm.compiler.nodes.util.GraphUtil;
|
|
46344
|
400 |
import org.graalvm.compiler.options.OptionValues;
|
|
43972
|
401 |
import org.graalvm.compiler.phases.OptimisticOptimizations;
|
|
46344
|
402 |
import org.graalvm.util.EconomicMap;
|
|
|
403 |
import org.graalvm.util.Equivalence;
|
|
43972
|
404 |
|
|
|
405 |
import jdk.vm.ci.code.BailoutException;
|
|
|
406 |
import jdk.vm.ci.code.BytecodeFrame;
|
|
|
407 |
import jdk.vm.ci.code.CodeUtil;
|
|
|
408 |
import jdk.vm.ci.code.site.InfopointReason;
|
|
|
409 |
import jdk.vm.ci.meta.ConstantPool;
|
|
|
410 |
import jdk.vm.ci.meta.ConstantReflectionProvider;
|
|
|
411 |
import jdk.vm.ci.meta.DeoptimizationAction;
|
|
|
412 |
import jdk.vm.ci.meta.DeoptimizationReason;
|
|
|
413 |
import jdk.vm.ci.meta.JavaConstant;
|
|
|
414 |
import jdk.vm.ci.meta.JavaField;
|
|
|
415 |
import jdk.vm.ci.meta.JavaKind;
|
|
|
416 |
import jdk.vm.ci.meta.JavaMethod;
|
|
|
417 |
import jdk.vm.ci.meta.JavaType;
|
|
|
418 |
import jdk.vm.ci.meta.JavaTypeProfile;
|
|
|
419 |
import jdk.vm.ci.meta.JavaTypeProfile.ProfiledType;
|
|
|
420 |
import jdk.vm.ci.meta.LineNumberTable;
|
|
|
421 |
import jdk.vm.ci.meta.MetaAccessProvider;
|
|
|
422 |
import jdk.vm.ci.meta.ProfilingInfo;
|
|
|
423 |
import jdk.vm.ci.meta.RawConstant;
|
|
|
424 |
import jdk.vm.ci.meta.ResolvedJavaField;
|
|
|
425 |
import jdk.vm.ci.meta.ResolvedJavaMethod;
|
|
|
426 |
import jdk.vm.ci.meta.ResolvedJavaType;
|
|
|
427 |
import jdk.vm.ci.meta.TriState;
|
|
|
428 |
|
|
|
429 |
/**
|
|
|
430 |
* The {@code GraphBuilder} class parses the bytecode of a method and builds the IR graph.
|
|
|
431 |
*/
|
|
|
432 |
public class BytecodeParser implements GraphBuilderContext {
|
|
|
433 |
|
|
|
434 |
/**
|
|
|
435 |
* The minimum value to which {@link BytecodeParserOptions#TraceBytecodeParserLevel} must be set
|
|
|
436 |
* to trace the bytecode instructions as they are parsed.
|
|
|
437 |
*/
|
|
|
438 |
public static final int TRACELEVEL_INSTRUCTIONS = 1;
|
|
|
439 |
|
|
|
440 |
/**
|
|
|
441 |
* The minimum value to which {@link BytecodeParserOptions#TraceBytecodeParserLevel} must be set
|
|
|
442 |
* to trace the frame state before each bytecode instruction as it is parsed.
|
|
|
443 |
*/
|
|
|
444 |
public static final int TRACELEVEL_STATE = 2;
|
|
|
445 |
|
|
|
446 |
/**
|
|
|
447 |
* Meters the number of actual bytecodes parsed.
|
|
|
448 |
*/
|
|
|
449 |
public static final DebugCounter BytecodesParsed = Debug.counter("BytecodesParsed");
|
|
|
450 |
|
|
|
451 |
protected static final DebugCounter EXPLICIT_EXCEPTIONS = Debug.counter("ExplicitExceptions");
|
|
|
452 |
|
|
|
453 |
/**
|
|
|
454 |
* A scoped object for tasks to be performed after parsing an intrinsic such as processing
|
|
|
455 |
* {@linkplain BytecodeFrame#isPlaceholderBci(int) placeholder} frames states.
|
|
|
456 |
*/
|
|
|
457 |
static class IntrinsicScope implements AutoCloseable {
|
|
|
458 |
FrameState stateBefore;
|
|
|
459 |
final Mark mark;
|
|
|
460 |
final BytecodeParser parser;
|
|
|
461 |
|
|
|
462 |
/**
|
|
|
463 |
* Creates a scope for root parsing an intrinsic.
|
|
|
464 |
*
|
|
|
465 |
* @param parser the parsing context of the intrinsic
|
|
|
466 |
*/
|
|
|
467 |
IntrinsicScope(BytecodeParser parser) {
|
|
|
468 |
this.parser = parser;
|
|
|
469 |
assert parser.parent == null;
|
|
|
470 |
assert parser.bci() == 0;
|
|
|
471 |
mark = null;
|
|
|
472 |
}
|
|
|
473 |
|
|
|
474 |
/**
|
|
|
475 |
* Creates a scope for parsing an intrinsic during graph builder inlining.
|
|
|
476 |
*
|
|
|
477 |
* @param parser the parsing context of the (non-intrinsic) method calling the intrinsic
|
|
|
478 |
* @param args the arguments to the call
|
|
|
479 |
*/
|
|
|
480 |
IntrinsicScope(BytecodeParser parser, JavaKind[] argSlotKinds, ValueNode[] args) {
|
|
|
481 |
assert !parser.parsingIntrinsic();
|
|
|
482 |
this.parser = parser;
|
|
|
483 |
mark = parser.getGraph().getMark();
|
|
|
484 |
stateBefore = parser.frameState.create(parser.bci(), parser.getNonIntrinsicAncestor(), false, argSlotKinds, args);
|
|
|
485 |
}
|
|
|
486 |
|
|
|
487 |
@Override
|
|
|
488 |
public void close() {
|
|
|
489 |
IntrinsicContext intrinsic = parser.intrinsicContext;
|
|
|
490 |
if (intrinsic != null && intrinsic.isPostParseInlined()) {
|
|
|
491 |
return;
|
|
|
492 |
}
|
|
|
493 |
|
|
|
494 |
processPlaceholderFrameStates(intrinsic);
|
|
|
495 |
}
|
|
|
496 |
|
|
|
497 |
/**
|
|
|
498 |
* Fixes up the {@linkplain BytecodeFrame#isPlaceholderBci(int) placeholder} frame states
|
|
|
499 |
* added to the graph while parsing/inlining the intrinsic for which this object exists.
|
|
|
500 |
*/
|
|
|
501 |
private void processPlaceholderFrameStates(IntrinsicContext intrinsic) {
|
|
|
502 |
FrameState stateAfterReturn = null;
|
|
|
503 |
StructuredGraph graph = parser.getGraph();
|
|
|
504 |
for (Node node : graph.getNewNodes(mark)) {
|
|
|
505 |
if (node instanceof FrameState) {
|
|
|
506 |
FrameState frameState = (FrameState) node;
|
|
|
507 |
if (BytecodeFrame.isPlaceholderBci(frameState.bci)) {
|
|
|
508 |
if (frameState.bci == BytecodeFrame.AFTER_BCI) {
|
|
|
509 |
FrameStateBuilder frameStateBuilder = parser.frameState;
|
|
|
510 |
if (frameState.stackSize() != 0) {
|
|
|
511 |
assert frameState.usages().count() == 1;
|
|
|
512 |
ValueNode returnVal = frameState.stackAt(0);
|
|
|
513 |
assert returnVal == frameState.usages().first();
|
|
|
514 |
|
|
|
515 |
if (parser.currentInvokeReturnType == null) {
|
|
|
516 |
assert intrinsic.isCompilationRoot();
|
|
|
517 |
FrameState newFrameState = graph.add(new FrameState(BytecodeFrame.INVALID_FRAMESTATE_BCI));
|
|
|
518 |
frameState.replaceAndDelete(newFrameState);
|
|
|
519 |
} else {
|
|
|
520 |
/*
|
|
|
521 |
* Swap the top-of-stack value with the side-effect return value
|
|
|
522 |
* using the frame state.
|
|
|
523 |
*/
|
|
|
524 |
JavaKind returnKind = parser.currentInvokeReturnType.getJavaKind();
|
|
|
525 |
ValueNode tos = frameStateBuilder.pop(returnKind);
|
|
|
526 |
assert tos.getStackKind() == returnVal.getStackKind();
|
|
|
527 |
FrameState newFrameState = frameStateBuilder.create(parser.stream.nextBCI(), parser.getNonIntrinsicAncestor(), false, new JavaKind[]{returnKind},
|
|
|
528 |
new ValueNode[]{returnVal});
|
|
|
529 |
frameState.replaceAndDelete(newFrameState);
|
|
|
530 |
frameStateBuilder.push(returnKind, tos);
|
|
|
531 |
}
|
|
|
532 |
} else {
|
|
|
533 |
if (stateAfterReturn == null) {
|
|
|
534 |
if (intrinsic != null) {
|
|
|
535 |
assert intrinsic.isCompilationRoot();
|
|
|
536 |
stateAfterReturn = graph.add(new FrameState(BytecodeFrame.INVALID_FRAMESTATE_BCI));
|
|
|
537 |
} else {
|
|
|
538 |
stateAfterReturn = frameStateBuilder.create(parser.stream.nextBCI(), null);
|
|
|
539 |
}
|
|
|
540 |
}
|
|
|
541 |
frameState.replaceAndDelete(stateAfterReturn);
|
|
|
542 |
}
|
|
|
543 |
} else if (frameState.bci == BytecodeFrame.BEFORE_BCI) {
|
|
|
544 |
if (stateBefore == null) {
|
|
|
545 |
stateBefore = graph.start().stateAfter();
|
|
|
546 |
}
|
|
|
547 |
if (stateBefore != frameState) {
|
|
|
548 |
frameState.replaceAndDelete(stateBefore);
|
|
|
549 |
}
|
|
|
550 |
} else {
|
|
|
551 |
assert frameState.bci == BytecodeFrame.INVALID_FRAMESTATE_BCI;
|
|
|
552 |
}
|
|
|
553 |
}
|
|
|
554 |
}
|
|
|
555 |
}
|
|
|
556 |
}
|
|
|
557 |
}
|
|
|
558 |
|
|
|
559 |
private static class Target {
|
|
|
560 |
FixedNode fixed;
|
|
|
561 |
FrameStateBuilder state;
|
|
|
562 |
|
|
|
563 |
Target(FixedNode fixed, FrameStateBuilder state) {
|
|
|
564 |
this.fixed = fixed;
|
|
|
565 |
this.state = state;
|
|
|
566 |
}
|
|
|
567 |
}
|
|
|
568 |
|
|
|
569 |
@SuppressWarnings("serial")
|
|
|
570 |
public static class BytecodeParserError extends GraalError {
|
|
|
571 |
|
|
|
572 |
public BytecodeParserError(Throwable cause) {
|
|
|
573 |
super(cause);
|
|
|
574 |
}
|
|
|
575 |
|
|
|
576 |
public BytecodeParserError(String msg, Object... args) {
|
|
|
577 |
super(msg, args);
|
|
|
578 |
}
|
|
|
579 |
}
|
|
|
580 |
|
|
|
581 |
private final GraphBuilderPhase.Instance graphBuilderInstance;
|
|
|
582 |
protected final StructuredGraph graph;
|
|
46344
|
583 |
protected final OptionValues options;
|
|
43972
|
584 |
|
|
|
585 |
private BciBlockMapping blockMap;
|
|
|
586 |
private LocalLiveness liveness;
|
|
|
587 |
protected final int entryBCI;
|
|
|
588 |
private final BytecodeParser parent;
|
|
|
589 |
|
|
|
590 |
private LineNumberTable lnt;
|
|
|
591 |
private int previousLineNumber;
|
|
|
592 |
private int currentLineNumber;
|
|
|
593 |
|
|
|
594 |
private ValueNode methodSynchronizedObject;
|
|
|
595 |
|
|
|
596 |
private ValueNode returnValue;
|
|
|
597 |
private FixedWithNextNode beforeReturnNode;
|
|
|
598 |
private ValueNode unwindValue;
|
|
|
599 |
private FixedWithNextNode beforeUnwindNode;
|
|
|
600 |
|
|
|
601 |
protected FixedWithNextNode lastInstr; // the last instruction added
|
|
|
602 |
private boolean controlFlowSplit;
|
|
|
603 |
private final InvocationPluginReceiver invocationPluginReceiver = new InvocationPluginReceiver(this);
|
|
|
604 |
|
|
|
605 |
private FixedWithNextNode[] firstInstructionArray;
|
|
|
606 |
private FrameStateBuilder[] entryStateArray;
|
|
|
607 |
|
|
|
608 |
private boolean finalBarrierRequired;
|
|
|
609 |
private ValueNode originalReceiver;
|
|
|
610 |
|
|
|
611 |
protected BytecodeParser(GraphBuilderPhase.Instance graphBuilderInstance, StructuredGraph graph, BytecodeParser parent, ResolvedJavaMethod method,
|
|
|
612 |
int entryBCI, IntrinsicContext intrinsicContext) {
|
|
|
613 |
this.bytecodeProvider = intrinsicContext == null ? new ResolvedJavaMethodBytecodeProvider() : intrinsicContext.getBytecodeProvider();
|
|
|
614 |
this.code = bytecodeProvider.getBytecode(method);
|
|
|
615 |
this.method = code.getMethod();
|
|
|
616 |
this.graphBuilderInstance = graphBuilderInstance;
|
|
|
617 |
this.graph = graph;
|
|
46344
|
618 |
this.options = graph.getOptions();
|
|
43972
|
619 |
this.graphBuilderConfig = graphBuilderInstance.graphBuilderConfig;
|
|
|
620 |
this.optimisticOpts = graphBuilderInstance.optimisticOpts;
|
|
|
621 |
this.metaAccess = graphBuilderInstance.metaAccess;
|
|
|
622 |
this.stampProvider = graphBuilderInstance.stampProvider;
|
|
|
623 |
this.constantReflection = graphBuilderInstance.constantReflection;
|
|
|
624 |
this.constantFieldProvider = graphBuilderInstance.constantFieldProvider;
|
|
|
625 |
this.stream = new BytecodeStream(code.getCode());
|
|
|
626 |
this.profilingInfo = graph.useProfilingInfo() ? code.getProfilingInfo() : null;
|
|
|
627 |
this.constantPool = code.getConstantPool();
|
|
|
628 |
this.intrinsicContext = intrinsicContext;
|
|
|
629 |
this.entryBCI = entryBCI;
|
|
|
630 |
this.parent = parent;
|
|
|
631 |
|
|
|
632 |
assert code.getCode() != null : "method must contain bytecodes: " + method;
|
|
|
633 |
|
|
|
634 |
if (graphBuilderConfig.insertFullInfopoints() && !parsingIntrinsic()) {
|
|
|
635 |
lnt = code.getLineNumberTable();
|
|
|
636 |
previousLineNumber = -1;
|
|
|
637 |
}
|
|
|
638 |
}
|
|
|
639 |
|
|
|
640 |
protected GraphBuilderPhase.Instance getGraphBuilderInstance() {
|
|
|
641 |
return graphBuilderInstance;
|
|
|
642 |
}
|
|
|
643 |
|
|
|
644 |
public ValueNode getReturnValue() {
|
|
|
645 |
return returnValue;
|
|
|
646 |
}
|
|
|
647 |
|
|
|
648 |
public FixedWithNextNode getBeforeReturnNode() {
|
|
|
649 |
return this.beforeReturnNode;
|
|
|
650 |
}
|
|
|
651 |
|
|
|
652 |
public ValueNode getUnwindValue() {
|
|
|
653 |
return unwindValue;
|
|
|
654 |
}
|
|
|
655 |
|
|
|
656 |
public FixedWithNextNode getBeforeUnwindNode() {
|
|
|
657 |
return this.beforeUnwindNode;
|
|
|
658 |
}
|
|
|
659 |
|
|
|
660 |
@SuppressWarnings("try")
|
|
|
661 |
protected void buildRootMethod() {
|
|
|
662 |
FrameStateBuilder startFrameState = new FrameStateBuilder(this, code, graph);
|
|
|
663 |
startFrameState.initializeForMethodStart(graph.getAssumptions(), graphBuilderConfig.eagerResolving() || intrinsicContext != null, graphBuilderConfig.getPlugins());
|
|
|
664 |
|
|
|
665 |
try (IntrinsicScope s = intrinsicContext != null ? new IntrinsicScope(this) : null) {
|
|
|
666 |
build(graph.start(), startFrameState);
|
|
|
667 |
}
|
|
|
668 |
|
|
|
669 |
cleanupFinalGraph();
|
|
|
670 |
ComputeLoopFrequenciesClosure.compute(graph);
|
|
|
671 |
}
|
|
|
672 |
|
|
|
673 |
@SuppressWarnings("try")
|
|
|
674 |
protected void build(FixedWithNextNode startInstruction, FrameStateBuilder startFrameState) {
|
|
46344
|
675 |
if (PrintProfilingInformation.getValue(options) && profilingInfo != null) {
|
|
43972
|
676 |
TTY.println("Profiling info for " + method.format("%H.%n(%p)"));
|
|
|
677 |
TTY.println(Util.indent(profilingInfo.toString(method, CodeUtil.NEW_LINE), " "));
|
|
|
678 |
}
|
|
|
679 |
|
|
|
680 |
try (Indent indent = Debug.logAndIndent("build graph for %s", method)) {
|
|
|
681 |
if (bytecodeProvider.shouldRecordMethodDependencies()) {
|
|
|
682 |
assert getParent() != null || method.equals(graph.method());
|
|
|
683 |
// Record method dependency in the graph
|
|
|
684 |
graph.recordMethod(method);
|
|
|
685 |
}
|
|
|
686 |
|
|
|
687 |
// compute the block map, setup exception handlers and get the entrypoint(s)
|
|
46344
|
688 |
BciBlockMapping newMapping = BciBlockMapping.create(stream, code, options);
|
|
43972
|
689 |
this.blockMap = newMapping;
|
|
|
690 |
this.firstInstructionArray = new FixedWithNextNode[blockMap.getBlockCount()];
|
|
|
691 |
this.entryStateArray = new FrameStateBuilder[blockMap.getBlockCount()];
|
|
|
692 |
if (!method.isStatic()) {
|
|
|
693 |
originalReceiver = startFrameState.loadLocal(0, JavaKind.Object);
|
|
|
694 |
}
|
|
|
695 |
|
|
|
696 |
/*
|
|
|
697 |
* Configure the assertion checking behavior of the FrameStateBuilder. This needs to be
|
|
|
698 |
* done only when assertions are enabled, so it is wrapped in an assertion itself.
|
|
|
699 |
*/
|
|
|
700 |
assert computeKindVerification(startFrameState);
|
|
|
701 |
|
|
|
702 |
try (Scope s = Debug.scope("LivenessAnalysis")) {
|
|
|
703 |
int maxLocals = method.getMaxLocals();
|
|
|
704 |
liveness = LocalLiveness.compute(stream, blockMap.getBlocks(), maxLocals, blockMap.getLoopCount());
|
|
|
705 |
} catch (Throwable e) {
|
|
|
706 |
throw Debug.handle(e);
|
|
|
707 |
}
|
|
|
708 |
|
|
|
709 |
lastInstr = startInstruction;
|
|
|
710 |
this.setCurrentFrameState(startFrameState);
|
|
|
711 |
stream.setBCI(0);
|
|
|
712 |
|
|
|
713 |
BciBlock startBlock = blockMap.getStartBlock();
|
|
|
714 |
if (this.parent == null) {
|
|
|
715 |
StartNode startNode = graph.start();
|
|
|
716 |
if (method.isSynchronized()) {
|
|
|
717 |
assert !parsingIntrinsic();
|
|
|
718 |
startNode.setStateAfter(createFrameState(BytecodeFrame.BEFORE_BCI, startNode));
|
|
|
719 |
} else {
|
|
|
720 |
if (!parsingIntrinsic()) {
|
|
|
721 |
if (graph.method() != null && graph.method().isJavaLangObjectInit()) {
|
|
|
722 |
/*
|
|
|
723 |
* Don't clear the receiver when Object.<init> is the compilation root.
|
|
|
724 |
* The receiver is needed as input to RegisterFinalizerNode.
|
|
|
725 |
*/
|
|
|
726 |
} else {
|
|
|
727 |
frameState.clearNonLiveLocals(startBlock, liveness, true);
|
|
|
728 |
}
|
|
|
729 |
assert bci() == 0;
|
|
|
730 |
startNode.setStateAfter(createFrameState(bci(), startNode));
|
|
|
731 |
} else {
|
|
|
732 |
if (startNode.stateAfter() == null) {
|
|
|
733 |
FrameState stateAfterStart = createStateAfterStartOfReplacementGraph();
|
|
|
734 |
startNode.setStateAfter(stateAfterStart);
|
|
|
735 |
}
|
|
|
736 |
}
|
|
|
737 |
}
|
|
|
738 |
}
|
|
|
739 |
|
|
|
740 |
if (method.isSynchronized()) {
|
|
46344
|
741 |
finishPrepare(lastInstr, BytecodeFrame.BEFORE_BCI);
|
|
|
742 |
|
|
43972
|
743 |
// add a monitor enter to the start block
|
|
|
744 |
methodSynchronizedObject = synchronizedObject(frameState, method);
|
|
|
745 |
frameState.clearNonLiveLocals(startBlock, liveness, true);
|
|
|
746 |
assert bci() == 0;
|
|
|
747 |
genMonitorEnter(methodSynchronizedObject, bci());
|
|
|
748 |
}
|
|
|
749 |
|
|
|
750 |
ProfilingPlugin profilingPlugin = this.graphBuilderConfig.getPlugins().getProfilingPlugin();
|
|
|
751 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
752 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
753 |
profilingPlugin.profileInvoke(this, method, stateBefore);
|
|
|
754 |
}
|
|
|
755 |
|
|
46344
|
756 |
finishPrepare(lastInstr, 0);
|
|
43972
|
757 |
|
|
|
758 |
genInfoPointNode(InfopointReason.METHOD_START, null);
|
|
|
759 |
|
|
|
760 |
currentBlock = blockMap.getStartBlock();
|
|
|
761 |
setEntryState(startBlock, frameState);
|
|
|
762 |
if (startBlock.isLoopHeader) {
|
|
|
763 |
appendGoto(startBlock);
|
|
|
764 |
} else {
|
|
|
765 |
setFirstInstruction(startBlock, lastInstr);
|
|
|
766 |
}
|
|
|
767 |
|
|
|
768 |
BciBlock[] blocks = blockMap.getBlocks();
|
|
|
769 |
for (BciBlock block : blocks) {
|
|
|
770 |
processBlock(block);
|
|
|
771 |
}
|
|
|
772 |
}
|
|
|
773 |
}
|
|
|
774 |
|
|
|
775 |
private boolean computeKindVerification(FrameStateBuilder startFrameState) {
|
|
|
776 |
if (blockMap.hasJsrBytecodes) {
|
|
|
777 |
/*
|
|
|
778 |
* The JSR return address is an int value, but stored using the astore bytecode. Instead
|
|
|
779 |
* of weakening the kind assertion checking for all methods, we disable it completely
|
|
|
780 |
* for methods that contain a JSR bytecode.
|
|
|
781 |
*/
|
|
|
782 |
startFrameState.disableKindVerification();
|
|
|
783 |
}
|
|
|
784 |
|
|
|
785 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
786 |
if (plugin.canChangeStackKind(this)) {
|
|
|
787 |
/*
|
|
|
788 |
* We have a plugin that can change the kind of values, so no kind assertion
|
|
|
789 |
* checking is possible.
|
|
|
790 |
*/
|
|
|
791 |
startFrameState.disableKindVerification();
|
|
|
792 |
}
|
|
|
793 |
}
|
|
|
794 |
return true;
|
|
|
795 |
}
|
|
|
796 |
|
|
|
797 |
/**
|
|
46344
|
798 |
* Hook for subclasses to modify synthetic code (start nodes and unwind nodes).
|
|
43972
|
799 |
*
|
|
46344
|
800 |
* @param instruction the current last instruction
|
|
|
801 |
* @param bci the current bci
|
|
43972
|
802 |
*/
|
|
46344
|
803 |
protected void finishPrepare(FixedWithNextNode instruction, int bci) {
|
|
43972
|
804 |
}
|
|
|
805 |
|
|
|
806 |
protected void cleanupFinalGraph() {
|
|
|
807 |
GraphUtil.normalizeLoops(graph);
|
|
|
808 |
|
|
|
809 |
// Remove dead parameters.
|
|
|
810 |
for (ParameterNode param : graph.getNodes(ParameterNode.TYPE)) {
|
|
|
811 |
if (param.hasNoUsages()) {
|
|
|
812 |
assert param.inputs().isEmpty();
|
|
|
813 |
param.safeDelete();
|
|
|
814 |
}
|
|
|
815 |
}
|
|
|
816 |
|
|
|
817 |
// Remove redundant begin nodes.
|
|
|
818 |
for (BeginNode beginNode : graph.getNodes(BeginNode.TYPE)) {
|
|
|
819 |
Node predecessor = beginNode.predecessor();
|
|
|
820 |
if (predecessor instanceof ControlSplitNode) {
|
|
|
821 |
// The begin node is necessary.
|
|
46344
|
822 |
} else if (!beginNode.hasUsages()) {
|
|
43972
|
823 |
GraphUtil.unlinkFixedNode(beginNode);
|
|
|
824 |
beginNode.safeDelete();
|
|
|
825 |
}
|
|
|
826 |
}
|
|
|
827 |
}
|
|
|
828 |
|
|
|
829 |
/**
|
|
|
830 |
* Creates the frame state after the start node of a graph for an {@link IntrinsicContext
|
|
|
831 |
* intrinsic} that is the parse root (either for root compiling or for post-parse inlining).
|
|
|
832 |
*/
|
|
|
833 |
private FrameState createStateAfterStartOfReplacementGraph() {
|
|
|
834 |
assert parent == null;
|
|
|
835 |
assert frameState.getMethod().equals(intrinsicContext.getIntrinsicMethod());
|
|
|
836 |
assert bci() == 0;
|
|
|
837 |
assert frameState.stackSize() == 0;
|
|
|
838 |
FrameState stateAfterStart;
|
|
|
839 |
if (intrinsicContext.isPostParseInlined()) {
|
|
|
840 |
stateAfterStart = graph.add(new FrameState(BytecodeFrame.BEFORE_BCI));
|
|
|
841 |
} else {
|
|
|
842 |
ResolvedJavaMethod original = intrinsicContext.getOriginalMethod();
|
|
|
843 |
ValueNode[] locals;
|
|
|
844 |
if (original.getMaxLocals() == frameState.localsSize() || original.isNative()) {
|
|
|
845 |
locals = new ValueNode[original.getMaxLocals()];
|
|
|
846 |
for (int i = 0; i < locals.length; i++) {
|
|
|
847 |
ValueNode node = frameState.locals[i];
|
|
|
848 |
if (node == FrameState.TWO_SLOT_MARKER) {
|
|
|
849 |
node = null;
|
|
|
850 |
}
|
|
|
851 |
locals[i] = node;
|
|
|
852 |
}
|
|
|
853 |
} else {
|
|
|
854 |
locals = new ValueNode[original.getMaxLocals()];
|
|
|
855 |
int parameterCount = original.getSignature().getParameterCount(!original.isStatic());
|
|
|
856 |
for (int i = 0; i < parameterCount; i++) {
|
|
|
857 |
ValueNode param = frameState.locals[i];
|
|
|
858 |
if (param == FrameState.TWO_SLOT_MARKER) {
|
|
|
859 |
param = null;
|
|
|
860 |
}
|
|
|
861 |
locals[i] = param;
|
|
|
862 |
assert param == null || param instanceof ParameterNode || param.isConstant();
|
|
|
863 |
}
|
|
|
864 |
}
|
|
|
865 |
ValueNode[] stack = {};
|
|
|
866 |
int stackSize = 0;
|
|
|
867 |
ValueNode[] locks = {};
|
|
|
868 |
List<MonitorIdNode> monitorIds = Collections.emptyList();
|
|
|
869 |
stateAfterStart = graph.add(new FrameState(null, new ResolvedJavaMethodBytecode(original), 0, locals, stack, stackSize, locks, monitorIds, false, false));
|
|
|
870 |
}
|
|
|
871 |
return stateAfterStart;
|
|
|
872 |
}
|
|
|
873 |
|
|
|
874 |
/**
|
|
|
875 |
* @param type the unresolved type of the constant
|
|
|
876 |
*/
|
|
|
877 |
protected void handleUnresolvedLoadConstant(JavaType type) {
|
|
|
878 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
879 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
880 |
}
|
|
|
881 |
|
|
|
882 |
/**
|
|
|
883 |
* @param type the unresolved type of the type check
|
|
|
884 |
* @param object the object value whose type is being checked against {@code type}
|
|
|
885 |
*/
|
|
|
886 |
protected void handleUnresolvedCheckCast(JavaType type, ValueNode object) {
|
|
|
887 |
assert !graphBuilderConfig.eagerResolving();
|
|
46371
|
888 |
append(new FixedGuardNode(graph.addOrUniqueWithInputs(IsNullNode.create(object)), Unresolved, InvalidateRecompile));
|
|
43972
|
889 |
frameState.push(JavaKind.Object, appendConstant(JavaConstant.NULL_POINTER));
|
|
|
890 |
}
|
|
|
891 |
|
|
|
892 |
/**
|
|
|
893 |
* @param type the unresolved type of the type check
|
|
|
894 |
* @param object the object value whose type is being checked against {@code type}
|
|
|
895 |
*/
|
|
|
896 |
protected void handleUnresolvedInstanceOf(JavaType type, ValueNode object) {
|
|
|
897 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
898 |
AbstractBeginNode successor = graph.add(new BeginNode());
|
|
|
899 |
DeoptimizeNode deopt = graph.add(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
46371
|
900 |
append(new IfNode(graph.addOrUniqueWithInputs(IsNullNode.create(object)), successor, deopt, 1));
|
|
43972
|
901 |
lastInstr = successor;
|
|
|
902 |
frameState.push(JavaKind.Int, appendConstant(JavaConstant.INT_0));
|
|
|
903 |
}
|
|
|
904 |
|
|
|
905 |
/**
|
|
|
906 |
* @param type the type being instantiated
|
|
|
907 |
*/
|
|
|
908 |
protected void handleUnresolvedNewInstance(JavaType type) {
|
|
|
909 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
910 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
911 |
}
|
|
|
912 |
|
|
|
913 |
/**
|
|
|
914 |
* @param type the type of the array being instantiated
|
|
|
915 |
* @param length the length of the array
|
|
|
916 |
*/
|
|
|
917 |
protected void handleUnresolvedNewObjectArray(JavaType type, ValueNode length) {
|
|
|
918 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
919 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
920 |
}
|
|
|
921 |
|
|
|
922 |
/**
|
|
|
923 |
* @param type the type being instantiated
|
|
|
924 |
* @param dims the dimensions for the multi-array
|
|
|
925 |
*/
|
|
|
926 |
protected void handleUnresolvedNewMultiArray(JavaType type, ValueNode[] dims) {
|
|
|
927 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
928 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
929 |
}
|
|
|
930 |
|
|
|
931 |
/**
|
|
|
932 |
* @param field the unresolved field
|
|
|
933 |
* @param receiver the object containing the field or {@code null} if {@code field} is static
|
|
|
934 |
*/
|
|
|
935 |
protected void handleUnresolvedLoadField(JavaField field, ValueNode receiver) {
|
|
|
936 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
937 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
938 |
}
|
|
|
939 |
|
|
|
940 |
/**
|
|
|
941 |
* @param field the unresolved field
|
|
|
942 |
* @param value the value being stored to the field
|
|
|
943 |
* @param receiver the object containing the field or {@code null} if {@code field} is static
|
|
|
944 |
*/
|
|
|
945 |
protected void handleUnresolvedStoreField(JavaField field, ValueNode value, ValueNode receiver) {
|
|
|
946 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
947 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
948 |
}
|
|
|
949 |
|
|
|
950 |
/**
|
|
|
951 |
* @param type
|
|
|
952 |
*/
|
|
|
953 |
protected void handleUnresolvedExceptionType(JavaType type) {
|
|
|
954 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
955 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
956 |
}
|
|
|
957 |
|
|
|
958 |
/**
|
|
|
959 |
* @param javaMethod
|
|
|
960 |
* @param invokeKind
|
|
|
961 |
*/
|
|
|
962 |
protected void handleUnresolvedInvoke(JavaMethod javaMethod, InvokeKind invokeKind) {
|
|
|
963 |
assert !graphBuilderConfig.eagerResolving();
|
|
|
964 |
append(new DeoptimizeNode(InvalidateRecompile, Unresolved));
|
|
|
965 |
}
|
|
|
966 |
|
|
|
967 |
private AbstractBeginNode handleException(ValueNode exceptionObject, int bci) {
|
|
|
968 |
assert bci == BytecodeFrame.BEFORE_BCI || bci == bci() : "invalid bci";
|
|
|
969 |
Debug.log("Creating exception dispatch edges at %d, exception object=%s, exception seen=%s", bci, exceptionObject, (profilingInfo == null ? "" : profilingInfo.getExceptionSeen(bci)));
|
|
|
970 |
|
|
|
971 |
FrameStateBuilder dispatchState = frameState.copy();
|
|
|
972 |
dispatchState.clearStack();
|
|
|
973 |
|
|
|
974 |
AbstractBeginNode dispatchBegin;
|
|
|
975 |
if (exceptionObject == null) {
|
|
|
976 |
ExceptionObjectNode newExceptionObject = graph.add(new ExceptionObjectNode(metaAccess));
|
|
|
977 |
dispatchBegin = newExceptionObject;
|
|
|
978 |
dispatchState.push(JavaKind.Object, dispatchBegin);
|
|
|
979 |
dispatchState.setRethrowException(true);
|
|
|
980 |
newExceptionObject.setStateAfter(dispatchState.create(bci, newExceptionObject));
|
|
|
981 |
} else {
|
|
|
982 |
dispatchBegin = graph.add(new BeginNode());
|
|
|
983 |
dispatchState.push(JavaKind.Object, exceptionObject);
|
|
|
984 |
dispatchState.setRethrowException(true);
|
|
|
985 |
}
|
|
|
986 |
this.controlFlowSplit = true;
|
|
|
987 |
FixedWithNextNode finishedDispatch = finishInstruction(dispatchBegin, dispatchState);
|
|
|
988 |
|
|
|
989 |
createHandleExceptionTarget(finishedDispatch, bci, dispatchState);
|
|
|
990 |
|
|
|
991 |
return dispatchBegin;
|
|
|
992 |
}
|
|
|
993 |
|
|
|
994 |
protected void createHandleExceptionTarget(FixedWithNextNode finishedDispatch, int bci, FrameStateBuilder dispatchState) {
|
|
|
995 |
BciBlock dispatchBlock = currentBlock.exceptionDispatchBlock();
|
|
|
996 |
/*
|
|
|
997 |
* The exception dispatch block is always for the last bytecode of a block, so if we are not
|
|
|
998 |
* at the endBci yet, there is no exception handler for this bci and we can unwind
|
|
|
999 |
* immediately.
|
|
|
1000 |
*/
|
|
|
1001 |
if (bci != currentBlock.endBci || dispatchBlock == null) {
|
|
|
1002 |
dispatchBlock = blockMap.getUnwindBlock();
|
|
|
1003 |
}
|
|
|
1004 |
|
|
|
1005 |
FixedNode target = createTarget(dispatchBlock, dispatchState);
|
|
|
1006 |
finishedDispatch.setNext(target);
|
|
|
1007 |
}
|
|
|
1008 |
|
|
|
1009 |
protected ValueNode genLoadIndexed(ValueNode array, ValueNode index, JavaKind kind) {
|
|
|
1010 |
return LoadIndexedNode.create(graph.getAssumptions(), array, index, kind, metaAccess, constantReflection);
|
|
|
1011 |
}
|
|
|
1012 |
|
|
|
1013 |
protected void genStoreIndexed(ValueNode array, ValueNode index, JavaKind kind, ValueNode value) {
|
|
|
1014 |
add(new StoreIndexedNode(array, index, kind, value));
|
|
|
1015 |
}
|
|
|
1016 |
|
|
|
1017 |
protected ValueNode genIntegerAdd(ValueNode x, ValueNode y) {
|
|
|
1018 |
return AddNode.create(x, y);
|
|
|
1019 |
}
|
|
|
1020 |
|
|
|
1021 |
protected ValueNode genIntegerSub(ValueNode x, ValueNode y) {
|
|
|
1022 |
return SubNode.create(x, y);
|
|
|
1023 |
}
|
|
|
1024 |
|
|
|
1025 |
protected ValueNode genIntegerMul(ValueNode x, ValueNode y) {
|
|
|
1026 |
return MulNode.create(x, y);
|
|
|
1027 |
}
|
|
|
1028 |
|
|
|
1029 |
protected ValueNode genFloatAdd(ValueNode x, ValueNode y) {
|
|
|
1030 |
return AddNode.create(x, y);
|
|
|
1031 |
}
|
|
|
1032 |
|
|
|
1033 |
protected ValueNode genFloatSub(ValueNode x, ValueNode y) {
|
|
|
1034 |
return SubNode.create(x, y);
|
|
|
1035 |
}
|
|
|
1036 |
|
|
|
1037 |
protected ValueNode genFloatMul(ValueNode x, ValueNode y) {
|
|
|
1038 |
return MulNode.create(x, y);
|
|
|
1039 |
}
|
|
|
1040 |
|
|
|
1041 |
protected ValueNode genFloatDiv(ValueNode x, ValueNode y) {
|
|
|
1042 |
return DivNode.create(x, y);
|
|
|
1043 |
}
|
|
|
1044 |
|
|
|
1045 |
protected ValueNode genFloatRem(ValueNode x, ValueNode y) {
|
|
|
1046 |
return new RemNode(x, y);
|
|
|
1047 |
}
|
|
|
1048 |
|
|
|
1049 |
protected ValueNode genIntegerDiv(ValueNode x, ValueNode y) {
|
|
|
1050 |
return new SignedDivNode(x, y);
|
|
|
1051 |
}
|
|
|
1052 |
|
|
|
1053 |
protected ValueNode genIntegerRem(ValueNode x, ValueNode y) {
|
|
|
1054 |
return new SignedRemNode(x, y);
|
|
|
1055 |
}
|
|
|
1056 |
|
|
|
1057 |
protected ValueNode genNegateOp(ValueNode x) {
|
|
46371
|
1058 |
return NegateNode.create(x);
|
|
43972
|
1059 |
}
|
|
|
1060 |
|
|
|
1061 |
protected ValueNode genLeftShift(ValueNode x, ValueNode y) {
|
|
46371
|
1062 |
return LeftShiftNode.create(x, y);
|
|
43972
|
1063 |
}
|
|
|
1064 |
|
|
|
1065 |
protected ValueNode genRightShift(ValueNode x, ValueNode y) {
|
|
46371
|
1066 |
return RightShiftNode.create(x, y);
|
|
43972
|
1067 |
}
|
|
|
1068 |
|
|
|
1069 |
protected ValueNode genUnsignedRightShift(ValueNode x, ValueNode y) {
|
|
|
1070 |
return new UnsignedRightShiftNode(x, y);
|
|
|
1071 |
}
|
|
|
1072 |
|
|
|
1073 |
protected ValueNode genAnd(ValueNode x, ValueNode y) {
|
|
|
1074 |
return AndNode.create(x, y);
|
|
|
1075 |
}
|
|
|
1076 |
|
|
|
1077 |
protected ValueNode genOr(ValueNode x, ValueNode y) {
|
|
|
1078 |
return OrNode.create(x, y);
|
|
|
1079 |
}
|
|
|
1080 |
|
|
|
1081 |
protected ValueNode genXor(ValueNode x, ValueNode y) {
|
|
|
1082 |
return XorNode.create(x, y);
|
|
|
1083 |
}
|
|
|
1084 |
|
|
|
1085 |
protected ValueNode genNormalizeCompare(ValueNode x, ValueNode y, boolean isUnorderedLess) {
|
|
|
1086 |
return NormalizeCompareNode.create(x, y, isUnorderedLess, constantReflection);
|
|
|
1087 |
}
|
|
|
1088 |
|
|
|
1089 |
protected ValueNode genFloatConvert(FloatConvert op, ValueNode input) {
|
|
|
1090 |
return FloatConvertNode.create(op, input);
|
|
|
1091 |
}
|
|
|
1092 |
|
|
|
1093 |
protected ValueNode genNarrow(ValueNode input, int bitCount) {
|
|
|
1094 |
return NarrowNode.create(input, bitCount);
|
|
|
1095 |
}
|
|
|
1096 |
|
|
|
1097 |
protected ValueNode genSignExtend(ValueNode input, int bitCount) {
|
|
|
1098 |
return SignExtendNode.create(input, bitCount);
|
|
|
1099 |
}
|
|
|
1100 |
|
|
|
1101 |
protected ValueNode genZeroExtend(ValueNode input, int bitCount) {
|
|
|
1102 |
return ZeroExtendNode.create(input, bitCount);
|
|
|
1103 |
}
|
|
|
1104 |
|
|
|
1105 |
protected void genGoto() {
|
|
|
1106 |
ProfilingPlugin profilingPlugin = this.graphBuilderConfig.getPlugins().getProfilingPlugin();
|
|
|
1107 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
1108 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
1109 |
int targetBci = currentBlock.getSuccessor(0).startBci;
|
|
|
1110 |
profilingPlugin.profileGoto(this, method, bci(), targetBci, stateBefore);
|
|
|
1111 |
}
|
|
|
1112 |
appendGoto(currentBlock.getSuccessor(0));
|
|
|
1113 |
assert currentBlock.numNormalSuccessors() == 1;
|
|
|
1114 |
}
|
|
|
1115 |
|
|
|
1116 |
protected LogicNode genObjectEquals(ValueNode x, ValueNode y) {
|
|
|
1117 |
return ObjectEqualsNode.create(x, y, constantReflection);
|
|
|
1118 |
}
|
|
|
1119 |
|
|
|
1120 |
protected LogicNode genIntegerEquals(ValueNode x, ValueNode y) {
|
|
46371
|
1121 |
return IntegerEqualsNode.create(x, y);
|
|
43972
|
1122 |
}
|
|
|
1123 |
|
|
|
1124 |
protected LogicNode genIntegerLessThan(ValueNode x, ValueNode y) {
|
|
46371
|
1125 |
return IntegerLessThanNode.create(x, y);
|
|
43972
|
1126 |
}
|
|
|
1127 |
|
|
|
1128 |
protected ValueNode genUnique(ValueNode x) {
|
|
|
1129 |
return graph.addOrUniqueWithInputs(x);
|
|
|
1130 |
}
|
|
|
1131 |
|
|
|
1132 |
protected LogicNode genUnique(LogicNode x) {
|
|
|
1133 |
return graph.addOrUniqueWithInputs(x);
|
|
|
1134 |
}
|
|
|
1135 |
|
|
|
1136 |
protected ValueNode genIfNode(LogicNode condition, FixedNode falseSuccessor, FixedNode trueSuccessor, double d) {
|
|
|
1137 |
return new IfNode(condition, falseSuccessor, trueSuccessor, d);
|
|
|
1138 |
}
|
|
|
1139 |
|
|
|
1140 |
protected void genThrow() {
|
|
|
1141 |
genInfoPointNode(InfopointReason.BYTECODE_POSITION, null);
|
|
|
1142 |
|
|
|
1143 |
ValueNode exception = frameState.pop(JavaKind.Object);
|
|
46371
|
1144 |
FixedGuardNode nullCheck = append(new FixedGuardNode(graph.addOrUniqueWithInputs(IsNullNode.create(exception)), NullCheckException, InvalidateReprofile, true));
|
|
|
1145 |
ValueNode nonNullException = graph.maybeAddOrUnique(PiNode.create(exception, exception.stamp().join(objectNonNull()), nullCheck));
|
|
43972
|
1146 |
lastInstr.setNext(handleException(nonNullException, bci()));
|
|
|
1147 |
}
|
|
|
1148 |
|
|
|
1149 |
protected LogicNode createInstanceOf(TypeReference type, ValueNode object) {
|
|
|
1150 |
return InstanceOfNode.create(type, object);
|
|
|
1151 |
}
|
|
|
1152 |
|
|
|
1153 |
protected AnchoringNode createAnchor(JavaTypeProfile profile) {
|
|
|
1154 |
if (profile == null || profile.getNotRecordedProbability() > 0.0) {
|
|
|
1155 |
return null;
|
|
|
1156 |
} else {
|
|
|
1157 |
return append(new ValueAnchorNode(null));
|
|
|
1158 |
}
|
|
|
1159 |
}
|
|
|
1160 |
|
|
|
1161 |
protected LogicNode createInstanceOf(TypeReference type, ValueNode object, JavaTypeProfile profile) {
|
|
|
1162 |
return InstanceOfNode.create(type, object, profile, createAnchor(profile));
|
|
|
1163 |
}
|
|
|
1164 |
|
|
|
1165 |
protected LogicNode createInstanceOfAllowNull(TypeReference type, ValueNode object, JavaTypeProfile profile) {
|
|
|
1166 |
return InstanceOfNode.createAllowNull(type, object, profile, createAnchor(profile));
|
|
|
1167 |
}
|
|
|
1168 |
|
|
|
1169 |
protected ValueNode genConditional(ValueNode x) {
|
|
46371
|
1170 |
return ConditionalNode.create((LogicNode) x);
|
|
43972
|
1171 |
}
|
|
|
1172 |
|
|
|
1173 |
protected NewInstanceNode createNewInstance(ResolvedJavaType type, boolean fillContents) {
|
|
|
1174 |
return new NewInstanceNode(type, fillContents);
|
|
|
1175 |
}
|
|
|
1176 |
|
|
|
1177 |
protected NewArrayNode createNewArray(ResolvedJavaType elementType, ValueNode length, boolean fillContents) {
|
|
|
1178 |
return new NewArrayNode(elementType, length, fillContents);
|
|
|
1179 |
}
|
|
|
1180 |
|
|
|
1181 |
protected NewMultiArrayNode createNewMultiArray(ResolvedJavaType type, ValueNode[] dimensions) {
|
|
|
1182 |
return new NewMultiArrayNode(type, dimensions);
|
|
|
1183 |
}
|
|
|
1184 |
|
|
|
1185 |
protected ValueNode genLoadField(ValueNode receiver, ResolvedJavaField field) {
|
|
|
1186 |
StampPair stamp = graphBuilderConfig.getPlugins().getOverridingStamp(this, field.getType(), false);
|
|
|
1187 |
if (stamp == null) {
|
|
46371
|
1188 |
return LoadFieldNode.create(getConstantFieldProvider(), getConstantReflection(), getMetaAccess(), getOptions(),
|
|
|
1189 |
getAssumptions(), receiver, field, false, false);
|
|
43972
|
1190 |
} else {
|
|
46371
|
1191 |
return LoadFieldNode.createOverrideStamp(getConstantFieldProvider(), getConstantReflection(), getMetaAccess(), getOptions(),
|
|
|
1192 |
stamp, receiver, field, false, false);
|
|
43972
|
1193 |
}
|
|
|
1194 |
}
|
|
|
1195 |
|
|
|
1196 |
protected ValueNode emitExplicitNullCheck(ValueNode receiver) {
|
|
|
1197 |
if (StampTool.isPointerNonNull(receiver.stamp())) {
|
|
|
1198 |
return receiver;
|
|
|
1199 |
}
|
|
|
1200 |
BytecodeExceptionNode exception = graph.add(new BytecodeExceptionNode(metaAccess, NullPointerException.class));
|
|
|
1201 |
AbstractBeginNode falseSucc = graph.add(new BeginNode());
|
|
46371
|
1202 |
ValueNode nonNullReceiver = graph.addOrUnique(PiNode.create(receiver, objectNonNull(), falseSucc));
|
|
|
1203 |
append(new IfNode(graph.addOrUniqueWithInputs(IsNullNode.create(receiver)), exception, falseSucc, 0.01));
|
|
43972
|
1204 |
lastInstr = falseSucc;
|
|
|
1205 |
|
|
|
1206 |
exception.setStateAfter(createFrameState(bci(), exception));
|
|
|
1207 |
exception.setNext(handleException(exception, bci()));
|
|
46344
|
1208 |
EXPLICIT_EXCEPTIONS.increment();
|
|
43972
|
1209 |
return nonNullReceiver;
|
|
|
1210 |
}
|
|
|
1211 |
|
|
|
1212 |
protected void emitExplicitBoundsCheck(ValueNode index, ValueNode length) {
|
|
|
1213 |
AbstractBeginNode trueSucc = graph.add(new BeginNode());
|
|
|
1214 |
BytecodeExceptionNode exception = graph.add(new BytecodeExceptionNode(metaAccess, ArrayIndexOutOfBoundsException.class, index));
|
|
46371
|
1215 |
append(new IfNode(genUnique(IntegerBelowNode.create(index, length)), trueSucc, exception, 0.99));
|
|
43972
|
1216 |
lastInstr = trueSucc;
|
|
|
1217 |
|
|
|
1218 |
exception.setStateAfter(createFrameState(bci(), exception));
|
|
|
1219 |
exception.setNext(handleException(exception, bci()));
|
|
|
1220 |
}
|
|
|
1221 |
|
|
|
1222 |
protected ValueNode genArrayLength(ValueNode x) {
|
|
|
1223 |
return ArrayLengthNode.create(x, constantReflection);
|
|
|
1224 |
}
|
|
|
1225 |
|
|
|
1226 |
protected void genStoreField(ValueNode receiver, ResolvedJavaField field, ValueNode value) {
|
|
|
1227 |
StoreFieldNode storeFieldNode = new StoreFieldNode(receiver, field, value);
|
|
|
1228 |
append(storeFieldNode);
|
|
|
1229 |
storeFieldNode.setStateAfter(this.createFrameState(stream.nextBCI(), storeFieldNode));
|
|
|
1230 |
}
|
|
|
1231 |
|
|
|
1232 |
/**
|
|
|
1233 |
* Ensure that concrete classes are at least linked before generating an invoke. Interfaces may
|
|
|
1234 |
* never be linked so simply return true for them.
|
|
|
1235 |
*
|
|
|
1236 |
* @param target
|
|
|
1237 |
* @return true if the declared holder is an interface or is linked
|
|
|
1238 |
*/
|
|
|
1239 |
private static boolean callTargetIsResolved(JavaMethod target) {
|
|
|
1240 |
if (target instanceof ResolvedJavaMethod) {
|
|
|
1241 |
ResolvedJavaMethod resolvedTarget = (ResolvedJavaMethod) target;
|
|
|
1242 |
ResolvedJavaType resolvedType = resolvedTarget.getDeclaringClass();
|
|
|
1243 |
return resolvedType.isInterface() || resolvedType.isLinked();
|
|
|
1244 |
}
|
|
|
1245 |
return false;
|
|
|
1246 |
}
|
|
|
1247 |
|
|
|
1248 |
protected void genInvokeStatic(JavaMethod target) {
|
|
|
1249 |
if (callTargetIsResolved(target)) {
|
|
|
1250 |
ResolvedJavaMethod resolvedTarget = (ResolvedJavaMethod) target;
|
|
|
1251 |
ResolvedJavaType holder = resolvedTarget.getDeclaringClass();
|
|
46344
|
1252 |
if (!holder.isInitialized() && ResolveClassBeforeStaticInvoke.getValue(options)) {
|
|
43972
|
1253 |
handleUnresolvedInvoke(target, InvokeKind.Static);
|
|
|
1254 |
} else {
|
|
|
1255 |
ValueNode classInit = null;
|
|
|
1256 |
ClassInitializationPlugin classInitializationPlugin = graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
1257 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedTarget.getDeclaringClass())) {
|
|
|
1258 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
1259 |
classInit = classInitializationPlugin.apply(this, resolvedTarget.getDeclaringClass(), stateBefore);
|
|
|
1260 |
}
|
|
|
1261 |
|
|
|
1262 |
ValueNode[] args = frameState.popArguments(resolvedTarget.getSignature().getParameterCount(false));
|
|
|
1263 |
Invoke invoke = appendInvoke(InvokeKind.Static, resolvedTarget, args);
|
|
|
1264 |
if (invoke != null) {
|
|
|
1265 |
invoke.setClassInit(classInit);
|
|
|
1266 |
}
|
|
|
1267 |
}
|
|
|
1268 |
} else {
|
|
|
1269 |
handleUnresolvedInvoke(target, InvokeKind.Static);
|
|
|
1270 |
}
|
|
|
1271 |
}
|
|
|
1272 |
|
|
|
1273 |
protected void genInvokeInterface(JavaMethod target) {
|
|
|
1274 |
if (callTargetIsResolved(target)) {
|
|
|
1275 |
ValueNode[] args = frameState.popArguments(target.getSignature().getParameterCount(true));
|
|
|
1276 |
appendInvoke(InvokeKind.Interface, (ResolvedJavaMethod) target, args);
|
|
|
1277 |
} else {
|
|
|
1278 |
handleUnresolvedInvoke(target, InvokeKind.Interface);
|
|
|
1279 |
}
|
|
|
1280 |
}
|
|
|
1281 |
|
|
|
1282 |
protected void genInvokeDynamic(JavaMethod target) {
|
|
|
1283 |
if (target instanceof ResolvedJavaMethod) {
|
|
|
1284 |
JavaConstant appendix = constantPool.lookupAppendix(stream.readCPI4(), Bytecodes.INVOKEDYNAMIC);
|
|
|
1285 |
if (appendix != null) {
|
|
|
1286 |
frameState.push(JavaKind.Object, ConstantNode.forConstant(appendix, metaAccess, graph));
|
|
|
1287 |
}
|
|
|
1288 |
ValueNode[] args = frameState.popArguments(target.getSignature().getParameterCount(false));
|
|
|
1289 |
appendInvoke(InvokeKind.Static, (ResolvedJavaMethod) target, args);
|
|
|
1290 |
} else {
|
|
|
1291 |
handleUnresolvedInvoke(target, InvokeKind.Static);
|
|
|
1292 |
}
|
|
|
1293 |
}
|
|
|
1294 |
|
|
|
1295 |
protected void genInvokeVirtual(JavaMethod target) {
|
|
|
1296 |
if (callTargetIsResolved(target)) {
|
|
|
1297 |
/*
|
|
|
1298 |
* Special handling for runtimes that rewrite an invocation of MethodHandle.invoke(...)
|
|
|
1299 |
* or MethodHandle.invokeExact(...) to a static adapter. HotSpot does this - see
|
|
|
1300 |
* https://wikis.oracle.com/display/HotSpotInternals/Method+handles +and+invokedynamic
|
|
|
1301 |
*/
|
|
|
1302 |
boolean hasReceiver = !((ResolvedJavaMethod) target).isStatic();
|
|
|
1303 |
JavaConstant appendix = constantPool.lookupAppendix(stream.readCPI(), Bytecodes.INVOKEVIRTUAL);
|
|
|
1304 |
if (appendix != null) {
|
|
|
1305 |
frameState.push(JavaKind.Object, ConstantNode.forConstant(appendix, metaAccess, graph));
|
|
|
1306 |
}
|
|
|
1307 |
ValueNode[] args = frameState.popArguments(target.getSignature().getParameterCount(hasReceiver));
|
|
|
1308 |
if (hasReceiver) {
|
|
|
1309 |
appendInvoke(InvokeKind.Virtual, (ResolvedJavaMethod) target, args);
|
|
|
1310 |
} else {
|
|
|
1311 |
appendInvoke(InvokeKind.Static, (ResolvedJavaMethod) target, args);
|
|
|
1312 |
}
|
|
|
1313 |
} else {
|
|
|
1314 |
handleUnresolvedInvoke(target, InvokeKind.Virtual);
|
|
|
1315 |
}
|
|
|
1316 |
|
|
|
1317 |
}
|
|
|
1318 |
|
|
|
1319 |
protected void genInvokeSpecial(JavaMethod target) {
|
|
|
1320 |
if (callTargetIsResolved(target)) {
|
|
|
1321 |
assert target != null;
|
|
|
1322 |
assert target.getSignature() != null;
|
|
|
1323 |
ValueNode[] args = frameState.popArguments(target.getSignature().getParameterCount(true));
|
|
|
1324 |
appendInvoke(InvokeKind.Special, (ResolvedJavaMethod) target, args);
|
|
|
1325 |
} else {
|
|
|
1326 |
handleUnresolvedInvoke(target, InvokeKind.Special);
|
|
|
1327 |
}
|
|
|
1328 |
}
|
|
|
1329 |
|
|
|
1330 |
private InvokeKind currentInvokeKind;
|
|
|
1331 |
private JavaType currentInvokeReturnType;
|
|
|
1332 |
protected FrameStateBuilder frameState;
|
|
|
1333 |
protected BciBlock currentBlock;
|
|
|
1334 |
protected final BytecodeStream stream;
|
|
|
1335 |
protected final GraphBuilderConfiguration graphBuilderConfig;
|
|
|
1336 |
protected final ResolvedJavaMethod method;
|
|
|
1337 |
protected final Bytecode code;
|
|
|
1338 |
protected final BytecodeProvider bytecodeProvider;
|
|
|
1339 |
protected final ProfilingInfo profilingInfo;
|
|
|
1340 |
protected final OptimisticOptimizations optimisticOpts;
|
|
|
1341 |
protected final ConstantPool constantPool;
|
|
|
1342 |
protected final MetaAccessProvider metaAccess;
|
|
|
1343 |
private final ConstantReflectionProvider constantReflection;
|
|
|
1344 |
private final ConstantFieldProvider constantFieldProvider;
|
|
|
1345 |
private final StampProvider stampProvider;
|
|
|
1346 |
protected final IntrinsicContext intrinsicContext;
|
|
|
1347 |
|
|
|
1348 |
@Override
|
|
|
1349 |
public InvokeKind getInvokeKind() {
|
|
|
1350 |
return currentInvokeKind;
|
|
|
1351 |
}
|
|
|
1352 |
|
|
|
1353 |
@Override
|
|
|
1354 |
public JavaType getInvokeReturnType() {
|
|
|
1355 |
return currentInvokeReturnType;
|
|
|
1356 |
}
|
|
|
1357 |
|
|
|
1358 |
private boolean forceInliningEverything;
|
|
|
1359 |
|
|
|
1360 |
@Override
|
|
|
1361 |
public void handleReplacedInvoke(InvokeKind invokeKind, ResolvedJavaMethod targetMethod, ValueNode[] args, boolean inlineEverything) {
|
|
|
1362 |
boolean previous = forceInliningEverything;
|
|
|
1363 |
forceInliningEverything = previous || inlineEverything;
|
|
|
1364 |
try {
|
|
|
1365 |
appendInvoke(invokeKind, targetMethod, args);
|
|
|
1366 |
} finally {
|
|
|
1367 |
forceInliningEverything = previous;
|
|
|
1368 |
}
|
|
|
1369 |
}
|
|
|
1370 |
|
|
46344
|
1371 |
@Override
|
|
|
1372 |
public void handleReplacedInvoke(CallTargetNode callTarget, JavaKind resultType) {
|
|
|
1373 |
createNonInlinedInvoke(callTarget, resultType, null);
|
|
|
1374 |
}
|
|
|
1375 |
|
|
43972
|
1376 |
private Invoke appendInvoke(InvokeKind initialInvokeKind, ResolvedJavaMethod initialTargetMethod, ValueNode[] args) {
|
|
|
1377 |
ResolvedJavaMethod targetMethod = initialTargetMethod;
|
|
|
1378 |
InvokeKind invokeKind = initialInvokeKind;
|
|
|
1379 |
if (initialInvokeKind.isIndirect()) {
|
|
|
1380 |
ResolvedJavaType contextType = this.frameState.getMethod().getDeclaringClass();
|
|
|
1381 |
ResolvedJavaMethod specialCallTarget = MethodCallTargetNode.findSpecialCallTarget(initialInvokeKind, args[0], initialTargetMethod, contextType);
|
|
|
1382 |
if (specialCallTarget != null) {
|
|
|
1383 |
invokeKind = InvokeKind.Special;
|
|
|
1384 |
targetMethod = specialCallTarget;
|
|
|
1385 |
}
|
|
|
1386 |
}
|
|
|
1387 |
|
|
|
1388 |
JavaKind resultType = targetMethod.getSignature().getReturnKind();
|
|
46344
|
1389 |
if (!parsingIntrinsic() && DeoptALot.getValue(options)) {
|
|
43972
|
1390 |
append(new DeoptimizeNode(DeoptimizationAction.None, RuntimeConstraint));
|
|
|
1391 |
frameState.pushReturn(resultType, ConstantNode.defaultForKind(resultType, graph));
|
|
|
1392 |
return null;
|
|
|
1393 |
}
|
|
|
1394 |
|
|
|
1395 |
JavaType returnType = targetMethod.getSignature().getReturnType(method.getDeclaringClass());
|
|
|
1396 |
if (graphBuilderConfig.eagerResolving() || parsingIntrinsic()) {
|
|
|
1397 |
returnType = returnType.resolve(targetMethod.getDeclaringClass());
|
|
|
1398 |
}
|
|
|
1399 |
if (invokeKind.hasReceiver()) {
|
|
46344
|
1400 |
args[0] = emitExplicitExceptions(args[0]);
|
|
43972
|
1401 |
}
|
|
|
1402 |
|
|
|
1403 |
InlineInfo inlineInfo = null;
|
|
|
1404 |
try {
|
|
|
1405 |
currentInvokeReturnType = returnType;
|
|
|
1406 |
currentInvokeKind = invokeKind;
|
|
|
1407 |
if (tryNodePluginForInvocation(args, targetMethod)) {
|
|
46344
|
1408 |
if (TraceParserPlugins.getValue(options)) {
|
|
43972
|
1409 |
traceWithContext("used node plugin for %s", targetMethod.format("%h.%n(%p)"));
|
|
|
1410 |
}
|
|
|
1411 |
return null;
|
|
|
1412 |
}
|
|
|
1413 |
|
|
46371
|
1414 |
if (invokeKind.hasReceiver() && args[0].isNullConstant()) {
|
|
|
1415 |
append(new DeoptimizeNode(InvalidateRecompile, NullCheckException));
|
|
|
1416 |
return null;
|
|
|
1417 |
}
|
|
|
1418 |
|
|
46344
|
1419 |
if (!invokeKind.isIndirect() || (UseGuardedIntrinsics.getValue(options) && !GeneratePIC.getValue(options))) {
|
|
43972
|
1420 |
if (tryInvocationPlugin(invokeKind, args, targetMethod, resultType, returnType)) {
|
|
46344
|
1421 |
if (TraceParserPlugins.getValue(options)) {
|
|
43972
|
1422 |
traceWithContext("used invocation plugin for %s", targetMethod.format("%h.%n(%p)"));
|
|
|
1423 |
}
|
|
|
1424 |
return null;
|
|
|
1425 |
}
|
|
|
1426 |
}
|
|
|
1427 |
if (invokeKind.isDirect()) {
|
|
|
1428 |
|
|
|
1429 |
inlineInfo = tryInline(args, targetMethod);
|
|
|
1430 |
if (inlineInfo == SUCCESSFULLY_INLINED) {
|
|
|
1431 |
return null;
|
|
|
1432 |
}
|
|
|
1433 |
}
|
|
|
1434 |
} finally {
|
|
|
1435 |
currentInvokeReturnType = null;
|
|
|
1436 |
currentInvokeKind = null;
|
|
|
1437 |
}
|
|
|
1438 |
|
|
|
1439 |
JavaTypeProfile profile = null;
|
|
46344
|
1440 |
if (invokeKind.isIndirect() && profilingInfo != null && this.optimisticOpts.useTypeCheckHints(getOptions())) {
|
|
43972
|
1441 |
profile = profilingInfo.getTypeProfile(bci());
|
|
|
1442 |
}
|
|
|
1443 |
return createNonInlinedInvoke(args, targetMethod, invokeKind, resultType, returnType, inlineInfo, profile);
|
|
|
1444 |
}
|
|
|
1445 |
|
|
|
1446 |
protected Invoke createNonInlinedInvoke(ValueNode[] args, ResolvedJavaMethod targetMethod, InvokeKind invokeKind,
|
|
|
1447 |
JavaKind resultType, JavaType returnType, InlineInfo inlineInfo, JavaTypeProfile profile) {
|
|
|
1448 |
|
|
|
1449 |
StampPair returnStamp = graphBuilderConfig.getPlugins().getOverridingStamp(this, returnType, false);
|
|
|
1450 |
if (returnStamp == null) {
|
|
|
1451 |
returnStamp = StampFactory.forDeclaredType(graph.getAssumptions(), returnType, false);
|
|
|
1452 |
}
|
|
|
1453 |
|
|
|
1454 |
MethodCallTargetNode callTarget = graph.add(createMethodCallTarget(invokeKind, targetMethod, args, returnStamp, profile));
|
|
46344
|
1455 |
Invoke invoke = createNonInlinedInvoke(callTarget, resultType, inlineInfo);
|
|
43972
|
1456 |
|
|
|
1457 |
for (InlineInvokePlugin plugin : graphBuilderConfig.getPlugins().getInlineInvokePlugins()) {
|
|
|
1458 |
plugin.notifyNotInlined(this, targetMethod, invoke);
|
|
|
1459 |
}
|
|
|
1460 |
|
|
|
1461 |
return invoke;
|
|
|
1462 |
}
|
|
|
1463 |
|
|
46344
|
1464 |
protected Invoke createNonInlinedInvoke(CallTargetNode callTarget, JavaKind resultType, InlineInfo inlineInfo) {
|
|
|
1465 |
if (omitInvokeExceptionEdge(callTarget, inlineInfo)) {
|
|
|
1466 |
return createInvoke(callTarget, resultType);
|
|
|
1467 |
} else {
|
|
|
1468 |
Invoke invoke = createInvokeWithException(callTarget, resultType);
|
|
|
1469 |
AbstractBeginNode beginNode = graph.add(KillingBeginNode.create(LocationIdentity.any()));
|
|
|
1470 |
invoke.setNext(beginNode);
|
|
|
1471 |
lastInstr = beginNode;
|
|
|
1472 |
return invoke;
|
|
|
1473 |
}
|
|
|
1474 |
}
|
|
|
1475 |
|
|
43972
|
1476 |
/**
|
|
|
1477 |
* If the method returns true, the invocation of the given {@link MethodCallTargetNode call
|
|
|
1478 |
* target} does not need an exception edge.
|
|
|
1479 |
*
|
|
|
1480 |
* @param callTarget The call target.
|
|
|
1481 |
*/
|
|
46344
|
1482 |
protected boolean omitInvokeExceptionEdge(CallTargetNode callTarget, InlineInfo lastInlineInfo) {
|
|
43972
|
1483 |
if (lastInlineInfo == InlineInfo.DO_NOT_INLINE_WITH_EXCEPTION) {
|
|
|
1484 |
return false;
|
|
|
1485 |
} else if (lastInlineInfo == InlineInfo.DO_NOT_INLINE_NO_EXCEPTION) {
|
|
|
1486 |
return true;
|
|
|
1487 |
} else if (graphBuilderConfig.getBytecodeExceptionMode() == BytecodeExceptionMode.CheckAll) {
|
|
|
1488 |
return false;
|
|
46344
|
1489 |
} else if (graphBuilderConfig.getBytecodeExceptionMode() == BytecodeExceptionMode.ExplicitOnly) {
|
|
|
1490 |
return false;
|
|
43972
|
1491 |
} else if (graphBuilderConfig.getBytecodeExceptionMode() == BytecodeExceptionMode.OmitAll) {
|
|
|
1492 |
return true;
|
|
|
1493 |
} else {
|
|
|
1494 |
assert graphBuilderConfig.getBytecodeExceptionMode() == BytecodeExceptionMode.Profile;
|
|
|
1495 |
// be conservative if information was not recorded (could result in endless
|
|
|
1496 |
// recompiles otherwise)
|
|
46344
|
1497 |
return (!StressInvokeWithExceptionNode.getValue(options) && optimisticOpts.useExceptionProbability(getOptions()) && profilingInfo != null &&
|
|
|
1498 |
profilingInfo.getExceptionSeen(bci()) == TriState.FALSE);
|
|
43972
|
1499 |
}
|
|
|
1500 |
}
|
|
|
1501 |
|
|
|
1502 |
/**
|
|
|
1503 |
* Contains all the assertion checking logic around the application of an
|
|
|
1504 |
* {@link InvocationPlugin}. This class is only loaded when assertions are enabled.
|
|
|
1505 |
*/
|
|
|
1506 |
class InvocationPluginAssertions {
|
|
|
1507 |
final InvocationPlugin plugin;
|
|
|
1508 |
final ValueNode[] args;
|
|
|
1509 |
final ResolvedJavaMethod targetMethod;
|
|
|
1510 |
final JavaKind resultType;
|
|
|
1511 |
final int beforeStackSize;
|
|
|
1512 |
final boolean needsNullCheck;
|
|
|
1513 |
final int nodeCount;
|
|
|
1514 |
final Mark mark;
|
|
|
1515 |
|
|
|
1516 |
InvocationPluginAssertions(InvocationPlugin plugin, ValueNode[] args, ResolvedJavaMethod targetMethod, JavaKind resultType) {
|
|
46344
|
1517 |
guarantee(Assertions.ENABLED, "%s should only be loaded and instantiated if assertions are enabled", getClass().getSimpleName());
|
|
43972
|
1518 |
this.plugin = plugin;
|
|
|
1519 |
this.targetMethod = targetMethod;
|
|
|
1520 |
this.args = args;
|
|
|
1521 |
this.resultType = resultType;
|
|
|
1522 |
this.beforeStackSize = frameState.stackSize();
|
|
|
1523 |
this.needsNullCheck = !targetMethod.isStatic() && args[0].getStackKind() == JavaKind.Object && !StampTool.isPointerNonNull(args[0].stamp());
|
|
|
1524 |
this.nodeCount = graph.getNodeCount();
|
|
|
1525 |
this.mark = graph.getMark();
|
|
|
1526 |
}
|
|
|
1527 |
|
|
|
1528 |
String error(String format, Object... a) {
|
|
|
1529 |
return String.format(format, a) + String.format("%n\tplugin at %s", plugin.getApplySourceLocation(metaAccess));
|
|
|
1530 |
}
|
|
|
1531 |
|
|
|
1532 |
boolean check(boolean pluginResult) {
|
|
|
1533 |
if (pluginResult == true) {
|
|
|
1534 |
int expectedStackSize = beforeStackSize + resultType.getSlotCount();
|
|
|
1535 |
assert expectedStackSize == frameState.stackSize() : error("plugin manipulated the stack incorrectly: expected=%d, actual=%d", expectedStackSize, frameState.stackSize());
|
|
|
1536 |
NodeIterable<Node> newNodes = graph.getNewNodes(mark);
|
|
|
1537 |
assert !needsNullCheck || isPointerNonNull(args[0].stamp()) : error("plugin needs to null check the receiver of %s: receiver=%s", targetMethod.format("%H.%n(%p)"), args[0]);
|
|
|
1538 |
for (Node n : newNodes) {
|
|
|
1539 |
if (n instanceof StateSplit) {
|
|
|
1540 |
StateSplit stateSplit = (StateSplit) n;
|
|
|
1541 |
assert stateSplit.stateAfter() != null || !stateSplit.hasSideEffect() : error("%s node added by plugin for %s need to have a non-null frame state: %s",
|
|
|
1542 |
StateSplit.class.getSimpleName(), targetMethod.format("%H.%n(%p)"), stateSplit);
|
|
|
1543 |
}
|
|
|
1544 |
}
|
|
|
1545 |
try {
|
|
|
1546 |
graphBuilderConfig.getPlugins().getInvocationPlugins().checkNewNodes(BytecodeParser.this, plugin, newNodes);
|
|
|
1547 |
} catch (Throwable t) {
|
|
|
1548 |
throw new AssertionError(error("Error in plugin"), t);
|
|
|
1549 |
}
|
|
|
1550 |
} else {
|
|
|
1551 |
assert nodeCount == graph.getNodeCount() : error("plugin that returns false must not create new nodes");
|
|
|
1552 |
assert beforeStackSize == frameState.stackSize() : error("plugin that returns false must not modify the stack");
|
|
|
1553 |
}
|
|
|
1554 |
return true;
|
|
|
1555 |
}
|
|
|
1556 |
}
|
|
|
1557 |
|
|
|
1558 |
protected static class IntrinsicGuard {
|
|
|
1559 |
final FixedWithNextNode lastInstr;
|
|
|
1560 |
final Mark mark;
|
|
|
1561 |
final AbstractBeginNode nonIntrinsicBranch;
|
|
|
1562 |
final ValueNode receiver;
|
|
|
1563 |
final JavaTypeProfile profile;
|
|
|
1564 |
|
|
|
1565 |
public IntrinsicGuard(FixedWithNextNode lastInstr, ValueNode receiver, Mark mark, AbstractBeginNode nonIntrinsicBranch, JavaTypeProfile profile) {
|
|
|
1566 |
this.lastInstr = lastInstr;
|
|
|
1567 |
this.receiver = receiver;
|
|
|
1568 |
this.mark = mark;
|
|
|
1569 |
this.nonIntrinsicBranch = nonIntrinsicBranch;
|
|
|
1570 |
this.profile = profile;
|
|
|
1571 |
}
|
|
|
1572 |
}
|
|
|
1573 |
|
|
|
1574 |
/**
|
|
|
1575 |
* Weaves a test of the receiver type to ensure the dispatch will select {@code targetMethod}
|
|
|
1576 |
* and not another method that overrides it. This should only be called if there is an intrinsic
|
|
|
1577 |
* (i.e., an {@link InvocationPlugin}) for {@code targetMethod} and the invocation is indirect.
|
|
|
1578 |
*
|
|
|
1579 |
* The control flow woven around the intrinsic is as follows:
|
|
|
1580 |
*
|
|
|
1581 |
* <pre>
|
|
|
1582 |
* if (LoadMethod(LoadHub(receiver)) == targetMethod) {
|
|
|
1583 |
* <intrinsic for targetMethod>
|
|
|
1584 |
* } else {
|
|
|
1585 |
* <virtual call to targetMethod>
|
|
|
1586 |
* }
|
|
|
1587 |
* </pre>
|
|
|
1588 |
*
|
|
|
1589 |
* The {@code else} branch is woven by {@link #afterInvocationPluginExecution}.
|
|
|
1590 |
*
|
|
|
1591 |
* @return {@code null} if the intrinsic cannot be used otherwise an object to be used by
|
|
|
1592 |
* {@link #afterInvocationPluginExecution} to weave code for the non-intrinsic branch
|
|
|
1593 |
*/
|
|
|
1594 |
protected IntrinsicGuard guardIntrinsic(ValueNode[] args, ResolvedJavaMethod targetMethod, InvocationPluginReceiver pluginReceiver) {
|
|
|
1595 |
ValueNode intrinsicReceiver = args[0];
|
|
|
1596 |
ResolvedJavaType receiverType = StampTool.typeOrNull(intrinsicReceiver);
|
|
|
1597 |
if (receiverType == null) {
|
|
|
1598 |
// The verifier guarantees it to be at least type declaring targetMethod
|
|
|
1599 |
receiverType = targetMethod.getDeclaringClass();
|
|
|
1600 |
}
|
|
|
1601 |
ResolvedJavaMethod resolvedMethod = receiverType.resolveMethod(targetMethod, method.getDeclaringClass());
|
|
46344
|
1602 |
if (resolvedMethod == null || resolvedMethod.equals(targetMethod)) {
|
|
43972
|
1603 |
assert resolvedMethod == null || targetMethod.getDeclaringClass().isAssignableFrom(resolvedMethod.getDeclaringClass());
|
|
|
1604 |
Mark mark = graph.getMark();
|
|
|
1605 |
FixedWithNextNode currentLastInstr = lastInstr;
|
|
|
1606 |
ValueNode nonNullReceiver = pluginReceiver.get();
|
|
|
1607 |
Stamp methodStamp = stampProvider.createMethodStamp();
|
|
|
1608 |
LoadHubNode hub = graph.unique(new LoadHubNode(stampProvider, nonNullReceiver));
|
|
|
1609 |
LoadMethodNode actual = append(new LoadMethodNode(methodStamp, targetMethod, receiverType, method.getDeclaringClass(), hub));
|
|
|
1610 |
ConstantNode expected = graph.unique(ConstantNode.forConstant(methodStamp, targetMethod.getEncoding(), getMetaAccess()));
|
|
46371
|
1611 |
LogicNode compare = graph.addOrUniqueWithInputs(CompareNode.createCompareNode(Condition.EQ, actual, expected, constantReflection));
|
|
43972
|
1612 |
|
|
|
1613 |
JavaTypeProfile profile = null;
|
|
46344
|
1614 |
if (profilingInfo != null && this.optimisticOpts.useTypeCheckHints(getOptions())) {
|
|
43972
|
1615 |
profile = profilingInfo.getTypeProfile(bci());
|
|
|
1616 |
if (profile != null) {
|
|
|
1617 |
JavaTypeProfile newProfile = adjustProfileForInvocationPlugin(profile, targetMethod);
|
|
|
1618 |
if (newProfile != profile) {
|
|
|
1619 |
if (newProfile.getTypes().length == 0) {
|
|
|
1620 |
// All profiled types select the intrinsic so
|
|
|
1621 |
// emit a fixed guard instead of a if-then-else.
|
|
|
1622 |
lastInstr = append(new FixedGuardNode(compare, TypeCheckedInliningViolated, InvalidateReprofile, false));
|
|
|
1623 |
return new IntrinsicGuard(currentLastInstr, intrinsicReceiver, mark, null, null);
|
|
|
1624 |
}
|
|
|
1625 |
} else {
|
|
|
1626 |
// No profiled types select the intrinsic so emit a virtual call
|
|
|
1627 |
return null;
|
|
|
1628 |
}
|
|
|
1629 |
profile = newProfile;
|
|
|
1630 |
}
|
|
|
1631 |
}
|
|
|
1632 |
|
|
|
1633 |
AbstractBeginNode intrinsicBranch = graph.add(new BeginNode());
|
|
|
1634 |
AbstractBeginNode nonIntrinsicBranch = graph.add(new BeginNode());
|
|
|
1635 |
append(new IfNode(compare, intrinsicBranch, nonIntrinsicBranch, 0.01));
|
|
|
1636 |
lastInstr = intrinsicBranch;
|
|
|
1637 |
return new IntrinsicGuard(currentLastInstr, intrinsicReceiver, mark, nonIntrinsicBranch, profile);
|
|
|
1638 |
} else {
|
|
|
1639 |
// Receiver selects an overriding method so emit a virtual call
|
|
|
1640 |
return null;
|
|
|
1641 |
}
|
|
|
1642 |
}
|
|
|
1643 |
|
|
|
1644 |
/**
|
|
|
1645 |
* Adjusts the profile for an indirect invocation of a virtual method for which there is an
|
|
|
1646 |
* intrinsic. The adjustment made by this method is to remove all types from the profile that do
|
|
|
1647 |
* not override {@code targetMethod}.
|
|
|
1648 |
*
|
|
|
1649 |
* @param profile the profile to adjust
|
|
|
1650 |
* @param targetMethod the virtual method for which there is an intrinsic
|
|
|
1651 |
* @return the adjusted profile or the original {@code profile} object if no adjustment was made
|
|
|
1652 |
*/
|
|
|
1653 |
protected JavaTypeProfile adjustProfileForInvocationPlugin(JavaTypeProfile profile, ResolvedJavaMethod targetMethod) {
|
|
|
1654 |
if (profile.getTypes().length > 0) {
|
|
|
1655 |
List<ProfiledType> retained = new ArrayList<>();
|
|
|
1656 |
double notRecordedProbability = profile.getNotRecordedProbability();
|
|
|
1657 |
for (ProfiledType ptype : profile.getTypes()) {
|
|
|
1658 |
if (!ptype.getType().resolveMethod(targetMethod, method.getDeclaringClass()).equals(targetMethod)) {
|
|
|
1659 |
retained.add(ptype);
|
|
|
1660 |
} else {
|
|
|
1661 |
notRecordedProbability += ptype.getProbability();
|
|
|
1662 |
}
|
|
|
1663 |
}
|
|
|
1664 |
if (!retained.isEmpty()) {
|
|
|
1665 |
if (retained.size() != profile.getTypes().length) {
|
|
|
1666 |
return new JavaTypeProfile(profile.getNullSeen(), notRecordedProbability, retained.toArray(new ProfiledType[retained.size()]));
|
|
|
1667 |
}
|
|
|
1668 |
} else {
|
|
|
1669 |
return new JavaTypeProfile(profile.getNullSeen(), notRecordedProbability, new ProfiledType[0]);
|
|
|
1670 |
}
|
|
|
1671 |
}
|
|
|
1672 |
return profile;
|
|
|
1673 |
}
|
|
|
1674 |
|
|
|
1675 |
/**
|
|
|
1676 |
* Performs any action required after execution of an invocation plugin. This includes
|
|
|
1677 |
* {@linkplain InvocationPluginAssertions#check(boolean) checking} invocation plugin invariants
|
|
|
1678 |
* as well as weaving the {@code else} branch of the code woven by {@link #guardIntrinsic} if
|
|
|
1679 |
* {@code guard != null}.
|
|
|
1680 |
*/
|
|
|
1681 |
protected void afterInvocationPluginExecution(boolean pluginResult, InvocationPluginAssertions assertions, IntrinsicGuard intrinsicGuard,
|
|
|
1682 |
InvokeKind invokeKind, ValueNode[] args, ResolvedJavaMethod targetMethod, JavaKind resultType, JavaType returnType) {
|
|
|
1683 |
assert assertions.check(pluginResult);
|
|
|
1684 |
if (intrinsicGuard != null) {
|
|
|
1685 |
if (pluginResult) {
|
|
|
1686 |
if (intrinsicGuard.nonIntrinsicBranch != null) {
|
|
|
1687 |
// Intrinsic emitted: emit a virtual call to the target method and
|
|
|
1688 |
// merge it with the intrinsic branch
|
|
|
1689 |
EndNode intrinsicEnd = append(new EndNode());
|
|
|
1690 |
|
|
|
1691 |
FrameStateBuilder intrinsicState = null;
|
|
|
1692 |
FrameStateBuilder nonIntrinisicState = null;
|
|
|
1693 |
if (resultType != JavaKind.Void) {
|
|
|
1694 |
intrinsicState = frameState.copy();
|
|
|
1695 |
frameState.pop(resultType);
|
|
|
1696 |
nonIntrinisicState = frameState;
|
|
|
1697 |
}
|
|
|
1698 |
|
|
|
1699 |
lastInstr = intrinsicGuard.nonIntrinsicBranch;
|
|
|
1700 |
createNonInlinedInvoke(args, targetMethod, invokeKind, resultType, returnType, null, intrinsicGuard.profile);
|
|
|
1701 |
|
|
|
1702 |
EndNode nonIntrinsicEnd = append(new EndNode());
|
|
|
1703 |
AbstractMergeNode mergeNode = graph.add(new MergeNode());
|
|
|
1704 |
|
|
|
1705 |
mergeNode.addForwardEnd(intrinsicEnd);
|
|
|
1706 |
if (intrinsicState != null) {
|
|
|
1707 |
intrinsicState.merge(mergeNode, nonIntrinisicState);
|
|
|
1708 |
frameState = intrinsicState;
|
|
|
1709 |
}
|
|
|
1710 |
mergeNode.addForwardEnd(nonIntrinsicEnd);
|
|
|
1711 |
mergeNode.setStateAfter(frameState.create(stream.nextBCI(), mergeNode));
|
|
|
1712 |
|
|
|
1713 |
lastInstr = mergeNode;
|
|
|
1714 |
}
|
|
|
1715 |
} else {
|
|
|
1716 |
// Intrinsic was not applied: remove intrinsic guard
|
|
|
1717 |
// and restore the original receiver node in the arguments array
|
|
|
1718 |
intrinsicGuard.lastInstr.setNext(null);
|
|
|
1719 |
GraphUtil.removeNewNodes(graph, intrinsicGuard.mark);
|
|
|
1720 |
lastInstr = intrinsicGuard.lastInstr;
|
|
|
1721 |
args[0] = intrinsicGuard.receiver;
|
|
|
1722 |
}
|
|
|
1723 |
}
|
|
|
1724 |
}
|
|
|
1725 |
|
|
|
1726 |
protected boolean tryInvocationPlugin(InvokeKind invokeKind, ValueNode[] args, ResolvedJavaMethod targetMethod, JavaKind resultType, JavaType returnType) {
|
|
|
1727 |
InvocationPlugin plugin = graphBuilderConfig.getPlugins().getInvocationPlugins().lookupInvocation(targetMethod);
|
|
|
1728 |
if (plugin != null) {
|
|
|
1729 |
|
|
|
1730 |
if (intrinsicContext != null && intrinsicContext.isCallToOriginal(targetMethod)) {
|
|
|
1731 |
// Self recursive intrinsic means the original
|
|
|
1732 |
// method should be called.
|
|
|
1733 |
assert !targetMethod.hasBytecodes() : "TODO: when does this happen?";
|
|
|
1734 |
return false;
|
|
|
1735 |
}
|
|
|
1736 |
|
|
|
1737 |
InvocationPluginReceiver pluginReceiver = invocationPluginReceiver.init(targetMethod, args);
|
|
|
1738 |
|
|
|
1739 |
IntrinsicGuard intrinsicGuard = null;
|
|
|
1740 |
if (invokeKind.isIndirect()) {
|
|
|
1741 |
intrinsicGuard = guardIntrinsic(args, targetMethod, pluginReceiver);
|
|
|
1742 |
if (intrinsicGuard == null) {
|
|
|
1743 |
return false;
|
|
|
1744 |
} else if (intrinsicGuard.nonIntrinsicBranch == null) {
|
|
|
1745 |
assert lastInstr instanceof FixedGuardNode;
|
|
|
1746 |
}
|
|
|
1747 |
}
|
|
|
1748 |
|
|
46344
|
1749 |
InvocationPluginAssertions assertions = Assertions.ENABLED ? new InvocationPluginAssertions(plugin, args, targetMethod, resultType) : null;
|
|
43972
|
1750 |
if (plugin.execute(this, targetMethod, pluginReceiver, args)) {
|
|
|
1751 |
afterInvocationPluginExecution(true, assertions, intrinsicGuard, invokeKind, args, targetMethod, resultType, returnType);
|
|
|
1752 |
return true;
|
|
|
1753 |
} else {
|
|
|
1754 |
afterInvocationPluginExecution(false, assertions, intrinsicGuard, invokeKind, args, targetMethod, resultType, returnType);
|
|
|
1755 |
}
|
|
|
1756 |
}
|
|
|
1757 |
return false;
|
|
|
1758 |
}
|
|
|
1759 |
|
|
|
1760 |
private boolean tryNodePluginForInvocation(ValueNode[] args, ResolvedJavaMethod targetMethod) {
|
|
|
1761 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
1762 |
if (plugin.handleInvoke(this, targetMethod, args)) {
|
|
|
1763 |
return true;
|
|
|
1764 |
}
|
|
|
1765 |
}
|
|
|
1766 |
return false;
|
|
|
1767 |
}
|
|
|
1768 |
|
|
|
1769 |
private static final InlineInfo SUCCESSFULLY_INLINED = InlineInfo.createStandardInlineInfo(null);
|
|
|
1770 |
|
|
|
1771 |
/**
|
|
|
1772 |
* Try to inline a method. If the method was inlined, returns {@link #SUCCESSFULLY_INLINED}.
|
|
|
1773 |
* Otherwise, it returns the {@link InlineInfo} that lead to the decision to not inline it, or
|
|
|
1774 |
* {@code null} if there is no {@link InlineInfo} for this method.
|
|
|
1775 |
*/
|
|
|
1776 |
private InlineInfo tryInline(ValueNode[] args, ResolvedJavaMethod targetMethod) {
|
|
|
1777 |
boolean canBeInlined = forceInliningEverything || parsingIntrinsic() || targetMethod.canBeInlined();
|
|
|
1778 |
if (!canBeInlined) {
|
|
|
1779 |
return null;
|
|
|
1780 |
}
|
|
|
1781 |
|
|
|
1782 |
if (forceInliningEverything) {
|
|
|
1783 |
if (inline(targetMethod, targetMethod, null, args)) {
|
|
|
1784 |
return SUCCESSFULLY_INLINED;
|
|
|
1785 |
} else {
|
|
|
1786 |
return null;
|
|
|
1787 |
}
|
|
|
1788 |
}
|
|
|
1789 |
|
|
|
1790 |
for (InlineInvokePlugin plugin : graphBuilderConfig.getPlugins().getInlineInvokePlugins()) {
|
|
|
1791 |
InlineInfo inlineInfo = plugin.shouldInlineInvoke(this, targetMethod, args);
|
|
|
1792 |
if (inlineInfo != null) {
|
|
|
1793 |
if (inlineInfo.getMethodToInline() != null) {
|
|
|
1794 |
if (inline(targetMethod, inlineInfo.getMethodToInline(), inlineInfo.getIntrinsicBytecodeProvider(), args)) {
|
|
|
1795 |
return SUCCESSFULLY_INLINED;
|
|
|
1796 |
}
|
|
|
1797 |
}
|
|
|
1798 |
/* Do not inline, and do not ask the remaining plugins. */
|
|
|
1799 |
return inlineInfo;
|
|
|
1800 |
}
|
|
|
1801 |
}
|
|
|
1802 |
return null;
|
|
|
1803 |
}
|
|
|
1804 |
|
|
46344
|
1805 |
private static final int ACCESSOR_BYTECODE_LENGTH = 5;
|
|
|
1806 |
|
|
|
1807 |
/**
|
|
|
1808 |
* Tries to inline {@code targetMethod} if it is an instance field accessor. This avoids the
|
|
|
1809 |
* overhead of creating and using a nested {@link BytecodeParser} object.
|
|
|
1810 |
*/
|
|
|
1811 |
private boolean tryFastInlineAccessor(ValueNode[] args, ResolvedJavaMethod targetMethod) {
|
|
|
1812 |
byte[] bytecode = targetMethod.getCode();
|
|
|
1813 |
if (bytecode.length == ACCESSOR_BYTECODE_LENGTH &&
|
|
|
1814 |
Bytes.beU1(bytecode, 0) == ALOAD_0 &&
|
|
|
1815 |
Bytes.beU1(bytecode, 1) == GETFIELD) {
|
|
|
1816 |
int b4 = Bytes.beU1(bytecode, 4);
|
|
|
1817 |
if (b4 >= IRETURN && b4 <= ARETURN) {
|
|
|
1818 |
int cpi = Bytes.beU2(bytecode, 2);
|
|
|
1819 |
JavaField field = targetMethod.getConstantPool().lookupField(cpi, targetMethod, GETFIELD);
|
|
|
1820 |
if (field instanceof ResolvedJavaField) {
|
|
|
1821 |
ValueNode receiver = invocationPluginReceiver.init(targetMethod, args).get();
|
|
|
1822 |
ResolvedJavaField resolvedField = (ResolvedJavaField) field;
|
|
|
1823 |
genGetField(resolvedField, receiver);
|
|
|
1824 |
printInlining(targetMethod, targetMethod, true, "inline accessor method (bytecode parsing)");
|
|
|
1825 |
return true;
|
|
|
1826 |
}
|
|
|
1827 |
}
|
|
|
1828 |
}
|
|
|
1829 |
return false;
|
|
|
1830 |
}
|
|
|
1831 |
|
|
43972
|
1832 |
@Override
|
|
|
1833 |
public boolean intrinsify(BytecodeProvider intrinsicBytecodeProvider, ResolvedJavaMethod targetMethod, ResolvedJavaMethod substitute, InvocationPlugin.Receiver receiver, ValueNode[] args) {
|
|
|
1834 |
if (receiver != null) {
|
|
|
1835 |
receiver.get();
|
|
|
1836 |
}
|
|
|
1837 |
boolean res = inline(targetMethod, substitute, intrinsicBytecodeProvider, args);
|
|
|
1838 |
assert res : "failed to inline " + substitute;
|
|
|
1839 |
return res;
|
|
|
1840 |
}
|
|
|
1841 |
|
|
|
1842 |
private boolean inline(ResolvedJavaMethod targetMethod, ResolvedJavaMethod inlinedMethod, BytecodeProvider intrinsicBytecodeProvider, ValueNode[] args) {
|
|
46344
|
1843 |
traceInlining(targetMethod, inlinedMethod);
|
|
|
1844 |
IntrinsicContext intrinsic = this.intrinsicContext;
|
|
|
1845 |
|
|
|
1846 |
if (intrinsic == null && !graphBuilderConfig.insertFullInfopoints() &&
|
|
|
1847 |
targetMethod.equals(inlinedMethod) &&
|
|
|
1848 |
(targetMethod.getModifiers() & (STATIC | SYNCHRONIZED)) == 0 &&
|
|
|
1849 |
tryFastInlineAccessor(args, targetMethod)) {
|
|
|
1850 |
return true;
|
|
43972
|
1851 |
}
|
|
46344
|
1852 |
|
|
43972
|
1853 |
if (intrinsic != null && intrinsic.isCallToOriginal(targetMethod)) {
|
|
|
1854 |
if (intrinsic.isCompilationRoot()) {
|
|
|
1855 |
// A root compiled intrinsic needs to deoptimize
|
|
|
1856 |
// if the slow path is taken. During frame state
|
|
|
1857 |
// assignment, the deopt node will get its stateBefore
|
|
|
1858 |
// from the start node of the intrinsic
|
|
|
1859 |
append(new DeoptimizeNode(InvalidateRecompile, RuntimeConstraint));
|
|
|
1860 |
printInlining(targetMethod, inlinedMethod, true, "compilation root (bytecode parsing)");
|
|
|
1861 |
return true;
|
|
|
1862 |
} else {
|
|
|
1863 |
// Otherwise inline the original method. Any frame state created
|
|
|
1864 |
// during the inlining will exclude frame(s) in the
|
|
|
1865 |
// intrinsic method (see HIRFrameStateBuilder.create(int bci)).
|
|
|
1866 |
if (intrinsic.getOriginalMethod().isNative()) {
|
|
|
1867 |
printInlining(targetMethod, inlinedMethod, false, "native method (bytecode parsing)");
|
|
|
1868 |
return false;
|
|
|
1869 |
}
|
|
|
1870 |
printInlining(targetMethod, inlinedMethod, true, "inline intrinsic (bytecode parsing)");
|
|
|
1871 |
parseAndInlineCallee(intrinsic.getOriginalMethod(), args, null);
|
|
|
1872 |
return true;
|
|
|
1873 |
}
|
|
|
1874 |
} else {
|
|
|
1875 |
boolean isIntrinsic = intrinsicBytecodeProvider != null;
|
|
|
1876 |
if (intrinsic == null && isIntrinsic) {
|
|
|
1877 |
assert !inlinedMethod.equals(targetMethod);
|
|
|
1878 |
intrinsic = new IntrinsicContext(targetMethod, inlinedMethod, intrinsicBytecodeProvider, INLINE_DURING_PARSING);
|
|
|
1879 |
}
|
|
|
1880 |
if (inlinedMethod.hasBytecodes()) {
|
|
|
1881 |
for (InlineInvokePlugin plugin : graphBuilderConfig.getPlugins().getInlineInvokePlugins()) {
|
|
|
1882 |
plugin.notifyBeforeInline(inlinedMethod);
|
|
|
1883 |
}
|
|
|
1884 |
printInlining(targetMethod, inlinedMethod, true, "inline method (bytecode parsing)");
|
|
|
1885 |
parseAndInlineCallee(inlinedMethod, args, intrinsic);
|
|
|
1886 |
for (InlineInvokePlugin plugin : graphBuilderConfig.getPlugins().getInlineInvokePlugins()) {
|
|
|
1887 |
plugin.notifyAfterInline(inlinedMethod);
|
|
|
1888 |
}
|
|
|
1889 |
} else {
|
|
|
1890 |
printInlining(targetMethod, inlinedMethod, false, "no bytecodes (abstract or native) (bytecode parsing)");
|
|
|
1891 |
return false;
|
|
|
1892 |
}
|
|
|
1893 |
}
|
|
|
1894 |
return true;
|
|
|
1895 |
}
|
|
|
1896 |
|
|
46344
|
1897 |
private void traceInlining(ResolvedJavaMethod targetMethod, ResolvedJavaMethod inlinedMethod) {
|
|
|
1898 |
if (TraceInlineDuringParsing.getValue(options) || TraceParserPlugins.getValue(options)) {
|
|
|
1899 |
if (targetMethod.equals(inlinedMethod)) {
|
|
|
1900 |
traceWithContext("inlining call to %s", inlinedMethod.format("%h.%n(%p)"));
|
|
|
1901 |
} else {
|
|
|
1902 |
traceWithContext("inlining call to %s as intrinsic for %s", inlinedMethod.format("%h.%n(%p)"), targetMethod.format("%h.%n(%p)"));
|
|
|
1903 |
}
|
|
|
1904 |
}
|
|
|
1905 |
}
|
|
|
1906 |
|
|
43972
|
1907 |
private void printInlining(ResolvedJavaMethod targetMethod, ResolvedJavaMethod inlinedMethod, boolean success, String msg) {
|
|
46344
|
1908 |
if (HotSpotPrintInlining.getValue(options)) {
|
|
43972
|
1909 |
if (targetMethod.equals(inlinedMethod)) {
|
|
|
1910 |
Util.printInlining(inlinedMethod, bci(), getDepth(), success, "%s", msg);
|
|
|
1911 |
} else {
|
|
|
1912 |
Util.printInlining(inlinedMethod, bci(), getDepth(), success, "%s intrinsic for %s", msg, targetMethod.format("%h.%n(%p)"));
|
|
|
1913 |
}
|
|
|
1914 |
}
|
|
|
1915 |
}
|
|
|
1916 |
|
|
|
1917 |
/**
|
|
|
1918 |
* Prints a line to {@link TTY} with a prefix indicating the current parse context. The prefix
|
|
|
1919 |
* is of the form:
|
|
|
1920 |
*
|
|
|
1921 |
* <pre>
|
|
|
1922 |
* {SPACE * n} {name of method being parsed} "(" {file name} ":" {line number} ")"
|
|
|
1923 |
* </pre>
|
|
|
1924 |
*
|
|
|
1925 |
* where {@code n} is the current inlining depth.
|
|
|
1926 |
*
|
|
|
1927 |
* @param format a format string
|
|
|
1928 |
* @param args arguments to the format string
|
|
|
1929 |
*/
|
|
|
1930 |
|
|
|
1931 |
protected void traceWithContext(String format, Object... args) {
|
|
|
1932 |
StackTraceElement where = code.asStackTraceElement(bci());
|
|
|
1933 |
TTY.println(format("%s%s (%s:%d) %s", nSpaces(getDepth()), method.isConstructor() ? method.format("%h.%n") : method.getName(), where.getFileName(), where.getLineNumber(),
|
|
|
1934 |
format(format, args)));
|
|
|
1935 |
}
|
|
|
1936 |
|
|
|
1937 |
protected BytecodeParserError asParserError(Throwable e) {
|
|
|
1938 |
if (e instanceof BytecodeParserError) {
|
|
|
1939 |
return (BytecodeParserError) e;
|
|
|
1940 |
}
|
|
|
1941 |
BytecodeParser bp = this;
|
|
|
1942 |
BytecodeParserError res = new BytecodeParserError(e);
|
|
|
1943 |
while (bp != null) {
|
|
|
1944 |
res.addContext("parsing " + bp.code.asStackTraceElement(bp.bci()));
|
|
|
1945 |
bp = bp.parent;
|
|
|
1946 |
}
|
|
|
1947 |
return res;
|
|
|
1948 |
}
|
|
|
1949 |
|
|
|
1950 |
@SuppressWarnings("try")
|
|
|
1951 |
protected void parseAndInlineCallee(ResolvedJavaMethod targetMethod, ValueNode[] args, IntrinsicContext calleeIntrinsicContext) {
|
|
|
1952 |
try (IntrinsicScope s = calleeIntrinsicContext != null && !parsingIntrinsic() ? new IntrinsicScope(this, targetMethod.getSignature().toParameterKinds(!targetMethod.isStatic()), args) : null) {
|
|
|
1953 |
|
|
|
1954 |
BytecodeParser parser = graphBuilderInstance.createBytecodeParser(graph, this, targetMethod, INVOCATION_ENTRY_BCI, calleeIntrinsicContext);
|
|
|
1955 |
FrameStateBuilder startFrameState = new FrameStateBuilder(parser, parser.code, graph);
|
|
|
1956 |
if (!targetMethod.isStatic()) {
|
|
|
1957 |
args[0] = nullCheckedValue(args[0]);
|
|
|
1958 |
}
|
|
|
1959 |
startFrameState.initializeFromArgumentsArray(args);
|
|
|
1960 |
parser.build(this.lastInstr, startFrameState);
|
|
|
1961 |
|
|
|
1962 |
FixedWithNextNode calleeBeforeReturnNode = parser.getBeforeReturnNode();
|
|
|
1963 |
this.lastInstr = calleeBeforeReturnNode;
|
|
|
1964 |
JavaKind calleeReturnKind = targetMethod.getSignature().getReturnKind();
|
|
|
1965 |
if (calleeBeforeReturnNode != null) {
|
|
|
1966 |
ValueNode calleeReturnValue = parser.getReturnValue();
|
|
|
1967 |
if (calleeReturnValue != null) {
|
|
|
1968 |
frameState.push(calleeReturnKind.getStackKind(), calleeReturnValue);
|
|
|
1969 |
}
|
|
|
1970 |
}
|
|
|
1971 |
|
|
|
1972 |
FixedWithNextNode calleeBeforeUnwindNode = parser.getBeforeUnwindNode();
|
|
|
1973 |
if (calleeBeforeUnwindNode != null) {
|
|
|
1974 |
ValueNode calleeUnwindValue = parser.getUnwindValue();
|
|
|
1975 |
assert calleeUnwindValue != null;
|
|
|
1976 |
calleeBeforeUnwindNode.setNext(handleException(calleeUnwindValue, bci()));
|
|
|
1977 |
}
|
|
|
1978 |
}
|
|
|
1979 |
}
|
|
|
1980 |
|
|
|
1981 |
public MethodCallTargetNode createMethodCallTarget(InvokeKind invokeKind, ResolvedJavaMethod targetMethod, ValueNode[] args, StampPair returnStamp, JavaTypeProfile profile) {
|
|
|
1982 |
return new MethodCallTargetNode(invokeKind, targetMethod, args, returnStamp, profile);
|
|
|
1983 |
}
|
|
|
1984 |
|
|
|
1985 |
protected InvokeNode createInvoke(CallTargetNode callTarget, JavaKind resultType) {
|
|
|
1986 |
InvokeNode invoke = append(new InvokeNode(callTarget, bci()));
|
|
|
1987 |
frameState.pushReturn(resultType, invoke);
|
|
|
1988 |
invoke.setStateAfter(createFrameState(stream.nextBCI(), invoke));
|
|
|
1989 |
return invoke;
|
|
|
1990 |
}
|
|
|
1991 |
|
|
|
1992 |
protected InvokeWithExceptionNode createInvokeWithException(CallTargetNode callTarget, JavaKind resultType) {
|
|
|
1993 |
if (currentBlock != null && stream.nextBCI() > currentBlock.endBci) {
|
|
|
1994 |
/*
|
|
|
1995 |
* Clear non-live locals early so that the exception handler entry gets the cleared
|
|
|
1996 |
* state.
|
|
|
1997 |
*/
|
|
|
1998 |
frameState.clearNonLiveLocals(currentBlock, liveness, false);
|
|
|
1999 |
}
|
|
|
2000 |
|
|
|
2001 |
AbstractBeginNode exceptionEdge = handleException(null, bci());
|
|
|
2002 |
InvokeWithExceptionNode invoke = append(new InvokeWithExceptionNode(callTarget, exceptionEdge, bci()));
|
|
|
2003 |
frameState.pushReturn(resultType, invoke);
|
|
|
2004 |
invoke.setStateAfter(createFrameState(stream.nextBCI(), invoke));
|
|
|
2005 |
return invoke;
|
|
|
2006 |
}
|
|
|
2007 |
|
|
|
2008 |
protected void genReturn(ValueNode returnVal, JavaKind returnKind) {
|
|
|
2009 |
if (parsingIntrinsic() && returnVal != null) {
|
|
|
2010 |
if (returnVal instanceof StateSplit) {
|
|
|
2011 |
StateSplit stateSplit = (StateSplit) returnVal;
|
|
|
2012 |
FrameState stateAfter = stateSplit.stateAfter();
|
|
|
2013 |
if (stateSplit.hasSideEffect()) {
|
|
|
2014 |
assert stateSplit != null;
|
|
|
2015 |
if (stateAfter.bci == BytecodeFrame.AFTER_BCI) {
|
|
|
2016 |
assert stateAfter.usages().count() == 1;
|
|
|
2017 |
assert stateAfter.usages().first() == stateSplit;
|
|
|
2018 |
stateAfter.replaceAtUsages(graph.add(new FrameState(BytecodeFrame.AFTER_BCI, returnVal)));
|
|
|
2019 |
GraphUtil.killWithUnusedFloatingInputs(stateAfter);
|
|
|
2020 |
} else {
|
|
|
2021 |
/*
|
|
|
2022 |
* This must be the return value from within a partial intrinsification.
|
|
|
2023 |
*/
|
|
|
2024 |
assert !BytecodeFrame.isPlaceholderBci(stateAfter.bci);
|
|
|
2025 |
}
|
|
|
2026 |
} else {
|
|
|
2027 |
assert stateAfter == null;
|
|
|
2028 |
}
|
|
|
2029 |
}
|
|
|
2030 |
}
|
|
|
2031 |
if (parent == null) {
|
|
|
2032 |
frameState.setRethrowException(false);
|
|
|
2033 |
frameState.clearStack();
|
|
|
2034 |
beforeReturn(returnVal, returnKind);
|
|
|
2035 |
append(new ReturnNode(returnVal));
|
|
|
2036 |
} else {
|
|
|
2037 |
if (blockMap.getReturnCount() == 1 || !controlFlowSplit) {
|
|
|
2038 |
// There is only a single return.
|
|
|
2039 |
beforeReturn(returnVal, returnKind);
|
|
|
2040 |
this.returnValue = returnVal;
|
|
|
2041 |
this.beforeReturnNode = this.lastInstr;
|
|
|
2042 |
this.lastInstr = null;
|
|
|
2043 |
} else {
|
|
|
2044 |
frameState.setRethrowException(false);
|
|
|
2045 |
frameState.clearStack();
|
|
|
2046 |
if (returnVal != null) {
|
|
|
2047 |
frameState.push(returnKind, returnVal);
|
|
|
2048 |
}
|
|
|
2049 |
assert blockMap.getReturnCount() > 1;
|
|
|
2050 |
appendGoto(blockMap.getReturnBlock());
|
|
|
2051 |
}
|
|
|
2052 |
}
|
|
|
2053 |
}
|
|
|
2054 |
|
|
|
2055 |
private void beforeReturn(ValueNode x, JavaKind kind) {
|
|
|
2056 |
if (graph.method() != null && graph.method().isJavaLangObjectInit()) {
|
|
|
2057 |
/*
|
|
|
2058 |
* Get the receiver from the initial state since bytecode rewriting could do arbitrary
|
|
|
2059 |
* things to the state of the locals.
|
|
|
2060 |
*/
|
|
|
2061 |
ValueNode receiver = graph.start().stateAfter().localAt(0);
|
|
|
2062 |
assert receiver != null && receiver.getStackKind() == JavaKind.Object;
|
|
|
2063 |
if (RegisterFinalizerNode.mayHaveFinalizer(receiver, graph.getAssumptions())) {
|
|
|
2064 |
append(new RegisterFinalizerNode(receiver));
|
|
|
2065 |
}
|
|
|
2066 |
}
|
|
|
2067 |
genInfoPointNode(InfopointReason.METHOD_END, x);
|
|
|
2068 |
if (finalBarrierRequired) {
|
|
|
2069 |
assert originalReceiver != null;
|
|
46344
|
2070 |
/*
|
|
|
2071 |
* When compiling an OSR with a final field store, don't bother tracking the original
|
|
|
2072 |
* receiver since the receiver cannot be EA'ed.
|
|
|
2073 |
*/
|
|
|
2074 |
append(new FinalFieldBarrierNode(entryBCI == INVOCATION_ENTRY_BCI ? originalReceiver : null));
|
|
43972
|
2075 |
}
|
|
|
2076 |
synchronizedEpilogue(BytecodeFrame.AFTER_BCI, x, kind);
|
|
|
2077 |
}
|
|
|
2078 |
|
|
|
2079 |
protected MonitorEnterNode createMonitorEnterNode(ValueNode x, MonitorIdNode monitorId) {
|
|
|
2080 |
return new MonitorEnterNode(x, monitorId);
|
|
|
2081 |
}
|
|
|
2082 |
|
|
|
2083 |
protected void genMonitorEnter(ValueNode x, int bci) {
|
|
|
2084 |
MonitorIdNode monitorId = graph.add(new MonitorIdNode(frameState.lockDepth(true)));
|
|
|
2085 |
MonitorEnterNode monitorEnter = append(createMonitorEnterNode(x, monitorId));
|
|
|
2086 |
frameState.pushLock(x, monitorId);
|
|
|
2087 |
monitorEnter.setStateAfter(createFrameState(bci, monitorEnter));
|
|
|
2088 |
}
|
|
|
2089 |
|
|
|
2090 |
protected void genMonitorExit(ValueNode x, ValueNode escapedReturnValue, int bci) {
|
|
|
2091 |
if (frameState.lockDepth(false) == 0) {
|
|
|
2092 |
throw bailout("unbalanced monitors: too many exits");
|
|
|
2093 |
}
|
|
|
2094 |
MonitorIdNode monitorId = frameState.peekMonitorId();
|
|
|
2095 |
ValueNode lockedObject = frameState.popLock();
|
|
|
2096 |
if (GraphUtil.originalValue(lockedObject) != GraphUtil.originalValue(x)) {
|
|
|
2097 |
throw bailout(String.format("unbalanced monitors: mismatch at monitorexit, %s != %s", GraphUtil.originalValue(x), GraphUtil.originalValue(lockedObject)));
|
|
|
2098 |
}
|
|
46344
|
2099 |
MonitorExitNode monitorExit = append(new MonitorExitNode(lockedObject, monitorId, escapedReturnValue));
|
|
43972
|
2100 |
monitorExit.setStateAfter(createFrameState(bci, monitorExit));
|
|
|
2101 |
}
|
|
|
2102 |
|
|
|
2103 |
protected void genJsr(int dest) {
|
|
|
2104 |
BciBlock successor = currentBlock.getJsrSuccessor();
|
|
|
2105 |
assert successor.startBci == dest : successor.startBci + " != " + dest + " @" + bci();
|
|
|
2106 |
JsrScope scope = currentBlock.getJsrScope();
|
|
|
2107 |
int nextBci = getStream().nextBCI();
|
|
|
2108 |
if (!successor.getJsrScope().pop().equals(scope)) {
|
|
|
2109 |
throw new JsrNotSupportedBailout("unstructured control flow (internal limitation)");
|
|
|
2110 |
}
|
|
|
2111 |
if (successor.getJsrScope().nextReturnAddress() != nextBci) {
|
|
|
2112 |
throw new JsrNotSupportedBailout("unstructured control flow (internal limitation)");
|
|
|
2113 |
}
|
|
|
2114 |
ConstantNode nextBciNode = getJsrConstant(nextBci);
|
|
|
2115 |
frameState.push(JavaKind.Object, nextBciNode);
|
|
|
2116 |
appendGoto(successor);
|
|
|
2117 |
}
|
|
|
2118 |
|
|
|
2119 |
protected void genRet(int localIndex) {
|
|
|
2120 |
BciBlock successor = currentBlock.getRetSuccessor();
|
|
|
2121 |
ValueNode local = frameState.loadLocal(localIndex, JavaKind.Object);
|
|
|
2122 |
JsrScope scope = currentBlock.getJsrScope();
|
|
|
2123 |
int retAddress = scope.nextReturnAddress();
|
|
|
2124 |
ConstantNode returnBciNode = getJsrConstant(retAddress);
|
|
46371
|
2125 |
LogicNode guard = IntegerEqualsNode.create(local, returnBciNode);
|
|
|
2126 |
guard = graph.addOrUniqueWithInputs(guard);
|
|
43972
|
2127 |
append(new FixedGuardNode(guard, JavaSubroutineMismatch, InvalidateReprofile));
|
|
|
2128 |
if (!successor.getJsrScope().equals(scope.pop())) {
|
|
|
2129 |
throw new JsrNotSupportedBailout("unstructured control flow (ret leaves more than one scope)");
|
|
|
2130 |
}
|
|
|
2131 |
appendGoto(successor);
|
|
|
2132 |
}
|
|
|
2133 |
|
|
|
2134 |
private ConstantNode getJsrConstant(long bci) {
|
|
|
2135 |
JavaConstant nextBciConstant = new RawConstant(bci);
|
|
|
2136 |
Stamp nextBciStamp = StampFactory.forConstant(nextBciConstant);
|
|
|
2137 |
ConstantNode nextBciNode = new ConstantNode(nextBciConstant, nextBciStamp);
|
|
|
2138 |
return graph.unique(nextBciNode);
|
|
|
2139 |
}
|
|
|
2140 |
|
|
|
2141 |
protected void genIntegerSwitch(ValueNode value, ArrayList<BciBlock> actualSuccessors, int[] keys, double[] keyProbabilities, int[] keySuccessors) {
|
|
|
2142 |
if (value.isConstant()) {
|
|
|
2143 |
JavaConstant constant = (JavaConstant) value.asConstant();
|
|
|
2144 |
int constantValue = constant.asInt();
|
|
|
2145 |
for (int i = 0; i < keys.length; ++i) {
|
|
|
2146 |
if (keys[i] == constantValue) {
|
|
|
2147 |
appendGoto(actualSuccessors.get(keySuccessors[i]));
|
|
|
2148 |
return;
|
|
|
2149 |
}
|
|
|
2150 |
}
|
|
|
2151 |
appendGoto(actualSuccessors.get(keySuccessors[keys.length]));
|
|
|
2152 |
} else {
|
|
|
2153 |
this.controlFlowSplit = true;
|
|
|
2154 |
double[] successorProbabilities = successorProbabilites(actualSuccessors.size(), keySuccessors, keyProbabilities);
|
|
|
2155 |
IntegerSwitchNode switchNode = append(new IntegerSwitchNode(value, actualSuccessors.size(), keys, keyProbabilities, keySuccessors));
|
|
|
2156 |
for (int i = 0; i < actualSuccessors.size(); i++) {
|
|
|
2157 |
switchNode.setBlockSuccessor(i, createBlockTarget(successorProbabilities[i], actualSuccessors.get(i), frameState));
|
|
|
2158 |
}
|
|
|
2159 |
}
|
|
|
2160 |
}
|
|
|
2161 |
|
|
|
2162 |
/**
|
|
|
2163 |
* Helper function that sums up the probabilities of all keys that lead to a specific successor.
|
|
|
2164 |
*
|
|
|
2165 |
* @return an array of size successorCount with the accumulated probability for each successor.
|
|
|
2166 |
*/
|
|
|
2167 |
private static double[] successorProbabilites(int successorCount, int[] keySuccessors, double[] keyProbabilities) {
|
|
|
2168 |
double[] probability = new double[successorCount];
|
|
|
2169 |
for (int i = 0; i < keySuccessors.length; i++) {
|
|
|
2170 |
probability[keySuccessors[i]] += keyProbabilities[i];
|
|
|
2171 |
}
|
|
|
2172 |
return probability;
|
|
|
2173 |
}
|
|
|
2174 |
|
|
|
2175 |
protected ConstantNode appendConstant(JavaConstant constant) {
|
|
|
2176 |
assert constant != null;
|
|
|
2177 |
return ConstantNode.forConstant(constant, metaAccess, graph);
|
|
|
2178 |
}
|
|
|
2179 |
|
|
|
2180 |
@Override
|
|
|
2181 |
public <T extends ValueNode> T append(T v) {
|
|
|
2182 |
if (v.graph() != null) {
|
|
|
2183 |
return v;
|
|
|
2184 |
}
|
|
|
2185 |
T added = graph.addOrUnique(v);
|
|
|
2186 |
if (added == v) {
|
|
|
2187 |
updateLastInstruction(v);
|
|
|
2188 |
}
|
|
|
2189 |
return added;
|
|
|
2190 |
}
|
|
|
2191 |
|
|
|
2192 |
@Override
|
|
|
2193 |
public <T extends ValueNode> T recursiveAppend(T v) {
|
|
|
2194 |
if (v.graph() != null) {
|
|
|
2195 |
return v;
|
|
|
2196 |
}
|
|
|
2197 |
T added = graph.addOrUniqueWithInputs(v);
|
|
|
2198 |
if (added == v) {
|
|
|
2199 |
updateLastInstruction(v);
|
|
|
2200 |
}
|
|
|
2201 |
return added;
|
|
|
2202 |
}
|
|
|
2203 |
|
|
|
2204 |
private <T extends ValueNode> void updateLastInstruction(T v) {
|
|
|
2205 |
if (v instanceof FixedNode) {
|
|
|
2206 |
FixedNode fixedNode = (FixedNode) v;
|
|
|
2207 |
lastInstr.setNext(fixedNode);
|
|
|
2208 |
if (fixedNode instanceof FixedWithNextNode) {
|
|
|
2209 |
FixedWithNextNode fixedWithNextNode = (FixedWithNextNode) fixedNode;
|
|
|
2210 |
assert fixedWithNextNode.next() == null : "cannot append instruction to instruction which isn't end";
|
|
|
2211 |
lastInstr = fixedWithNextNode;
|
|
|
2212 |
} else {
|
|
|
2213 |
lastInstr = null;
|
|
|
2214 |
}
|
|
|
2215 |
}
|
|
|
2216 |
}
|
|
|
2217 |
|
|
|
2218 |
private Target checkLoopExit(FixedNode target, BciBlock targetBlock, FrameStateBuilder state) {
|
|
|
2219 |
if (currentBlock != null) {
|
|
|
2220 |
long exits = currentBlock.loops & ~targetBlock.loops;
|
|
|
2221 |
if (exits != 0) {
|
|
|
2222 |
LoopExitNode firstLoopExit = null;
|
|
|
2223 |
LoopExitNode lastLoopExit = null;
|
|
|
2224 |
|
|
|
2225 |
int pos = 0;
|
|
|
2226 |
ArrayList<BciBlock> exitLoops = new ArrayList<>(Long.bitCount(exits));
|
|
|
2227 |
do {
|
|
|
2228 |
long lMask = 1L << pos;
|
|
|
2229 |
if ((exits & lMask) != 0) {
|
|
|
2230 |
exitLoops.add(blockMap.getLoopHeader(pos));
|
|
|
2231 |
exits &= ~lMask;
|
|
|
2232 |
}
|
|
|
2233 |
pos++;
|
|
|
2234 |
} while (exits != 0);
|
|
|
2235 |
|
|
|
2236 |
Collections.sort(exitLoops, new Comparator<BciBlock>() {
|
|
|
2237 |
|
|
|
2238 |
@Override
|
|
|
2239 |
public int compare(BciBlock o1, BciBlock o2) {
|
|
|
2240 |
return Long.bitCount(o2.loops) - Long.bitCount(o1.loops);
|
|
|
2241 |
}
|
|
|
2242 |
});
|
|
|
2243 |
|
|
|
2244 |
int bci = targetBlock.startBci;
|
|
|
2245 |
if (targetBlock instanceof ExceptionDispatchBlock) {
|
|
|
2246 |
bci = ((ExceptionDispatchBlock) targetBlock).deoptBci;
|
|
|
2247 |
}
|
|
|
2248 |
FrameStateBuilder newState = state.copy();
|
|
|
2249 |
for (BciBlock loop : exitLoops) {
|
|
|
2250 |
LoopBeginNode loopBegin = (LoopBeginNode) getFirstInstruction(loop);
|
|
|
2251 |
LoopExitNode loopExit = graph.add(new LoopExitNode(loopBegin));
|
|
|
2252 |
if (lastLoopExit != null) {
|
|
|
2253 |
lastLoopExit.setNext(loopExit);
|
|
|
2254 |
}
|
|
|
2255 |
if (firstLoopExit == null) {
|
|
|
2256 |
firstLoopExit = loopExit;
|
|
|
2257 |
}
|
|
|
2258 |
lastLoopExit = loopExit;
|
|
|
2259 |
Debug.log("Target %s Exits %s, scanning framestates...", targetBlock, loop);
|
|
|
2260 |
newState.clearNonLiveLocals(targetBlock, liveness, true);
|
|
|
2261 |
newState.insertLoopProxies(loopExit, getEntryState(loop));
|
|
|
2262 |
loopExit.setStateAfter(newState.create(bci, loopExit));
|
|
|
2263 |
}
|
|
|
2264 |
|
|
|
2265 |
lastLoopExit.setNext(target);
|
|
|
2266 |
return new Target(firstLoopExit, newState);
|
|
|
2267 |
}
|
|
|
2268 |
}
|
|
|
2269 |
return new Target(target, state);
|
|
|
2270 |
}
|
|
|
2271 |
|
|
|
2272 |
private FrameStateBuilder getEntryState(BciBlock block) {
|
|
|
2273 |
return entryStateArray[block.id];
|
|
|
2274 |
}
|
|
|
2275 |
|
|
|
2276 |
private void setEntryState(BciBlock block, FrameStateBuilder entryState) {
|
|
|
2277 |
this.entryStateArray[block.id] = entryState;
|
|
|
2278 |
}
|
|
|
2279 |
|
|
|
2280 |
private void setFirstInstruction(BciBlock block, FixedWithNextNode firstInstruction) {
|
|
|
2281 |
this.firstInstructionArray[block.id] = firstInstruction;
|
|
|
2282 |
}
|
|
|
2283 |
|
|
|
2284 |
private FixedWithNextNode getFirstInstruction(BciBlock block) {
|
|
|
2285 |
return firstInstructionArray[block.id];
|
|
|
2286 |
}
|
|
|
2287 |
|
|
|
2288 |
private FixedNode createTarget(double probability, BciBlock block, FrameStateBuilder stateAfter) {
|
|
|
2289 |
assert probability >= 0 && probability <= 1.01 : probability;
|
|
|
2290 |
if (isNeverExecutedCode(probability)) {
|
|
|
2291 |
return graph.add(new DeoptimizeNode(InvalidateReprofile, UnreachedCode));
|
|
|
2292 |
} else {
|
|
|
2293 |
assert block != null;
|
|
|
2294 |
return createTarget(block, stateAfter);
|
|
|
2295 |
}
|
|
|
2296 |
}
|
|
|
2297 |
|
|
|
2298 |
private FixedNode createTarget(BciBlock block, FrameStateBuilder state) {
|
|
|
2299 |
return createTarget(block, state, false, false);
|
|
|
2300 |
}
|
|
|
2301 |
|
|
|
2302 |
private FixedNode createTarget(BciBlock block, FrameStateBuilder state, boolean canReuseInstruction, boolean canReuseState) {
|
|
|
2303 |
assert block != null && state != null;
|
|
|
2304 |
assert !block.isExceptionEntry || state.stackSize() == 1;
|
|
|
2305 |
|
|
|
2306 |
if (getFirstInstruction(block) == null) {
|
|
|
2307 |
/*
|
|
|
2308 |
* This is the first time we see this block as a branch target. Create and return a
|
|
|
2309 |
* placeholder that later can be replaced with a MergeNode when we see this block again.
|
|
|
2310 |
*/
|
|
|
2311 |
FixedNode targetNode;
|
|
|
2312 |
if (canReuseInstruction && (block.getPredecessorCount() == 1 || !controlFlowSplit) && !block.isLoopHeader && (currentBlock.loops & ~block.loops) == 0) {
|
|
|
2313 |
setFirstInstruction(block, lastInstr);
|
|
|
2314 |
lastInstr = null;
|
|
|
2315 |
} else {
|
|
|
2316 |
setFirstInstruction(block, graph.add(new BeginNode()));
|
|
|
2317 |
}
|
|
|
2318 |
targetNode = getFirstInstruction(block);
|
|
|
2319 |
Target target = checkLoopExit(targetNode, block, state);
|
|
|
2320 |
FixedNode result = target.fixed;
|
|
|
2321 |
FrameStateBuilder currentEntryState = target.state == state ? (canReuseState ? state : state.copy()) : target.state;
|
|
|
2322 |
setEntryState(block, currentEntryState);
|
|
|
2323 |
currentEntryState.clearNonLiveLocals(block, liveness, true);
|
|
|
2324 |
|
|
|
2325 |
Debug.log("createTarget %s: first visit, result: %s", block, targetNode);
|
|
|
2326 |
return result;
|
|
|
2327 |
}
|
|
|
2328 |
|
|
|
2329 |
// We already saw this block before, so we have to merge states.
|
|
|
2330 |
if (!getEntryState(block).isCompatibleWith(state)) {
|
|
|
2331 |
throw bailout("stacks do not match; bytecodes would not verify");
|
|
|
2332 |
}
|
|
|
2333 |
|
|
|
2334 |
if (getFirstInstruction(block) instanceof LoopBeginNode) {
|
|
|
2335 |
assert (block.isLoopHeader && currentBlock.getId() >= block.getId()) : "must be backward branch";
|
|
|
2336 |
/*
|
|
|
2337 |
* Backward loop edge. We need to create a special LoopEndNode and merge with the loop
|
|
|
2338 |
* begin node created before.
|
|
|
2339 |
*/
|
|
|
2340 |
LoopBeginNode loopBegin = (LoopBeginNode) getFirstInstruction(block);
|
|
|
2341 |
LoopEndNode loopEnd = graph.add(new LoopEndNode(loopBegin));
|
|
|
2342 |
Target target = checkLoopExit(loopEnd, block, state);
|
|
|
2343 |
FixedNode result = target.fixed;
|
|
|
2344 |
getEntryState(block).merge(loopBegin, target.state);
|
|
|
2345 |
|
|
|
2346 |
Debug.log("createTarget %s: merging backward branch to loop header %s, result: %s", block, loopBegin, result);
|
|
|
2347 |
return result;
|
|
|
2348 |
}
|
|
|
2349 |
assert currentBlock == null || currentBlock.getId() < block.getId() : "must not be backward branch";
|
|
|
2350 |
assert getFirstInstruction(block).next() == null : "bytecodes already parsed for block";
|
|
|
2351 |
|
|
|
2352 |
if (getFirstInstruction(block) instanceof AbstractBeginNode && !(getFirstInstruction(block) instanceof AbstractMergeNode)) {
|
|
|
2353 |
/*
|
|
|
2354 |
* This is the second time we see this block. Create the actual MergeNode and the End
|
|
|
2355 |
* Node for the already existing edge.
|
|
|
2356 |
*/
|
|
|
2357 |
AbstractBeginNode beginNode = (AbstractBeginNode) getFirstInstruction(block);
|
|
|
2358 |
|
|
|
2359 |
// The EndNode for the already existing edge.
|
|
|
2360 |
EndNode end = graph.add(new EndNode());
|
|
|
2361 |
// The MergeNode that replaces the placeholder.
|
|
|
2362 |
AbstractMergeNode mergeNode = graph.add(new MergeNode());
|
|
|
2363 |
FixedNode next = beginNode.next();
|
|
|
2364 |
|
|
|
2365 |
if (beginNode.predecessor() instanceof ControlSplitNode) {
|
|
|
2366 |
beginNode.setNext(end);
|
|
|
2367 |
} else {
|
|
|
2368 |
beginNode.replaceAtPredecessor(end);
|
|
|
2369 |
beginNode.safeDelete();
|
|
|
2370 |
}
|
|
|
2371 |
|
|
|
2372 |
mergeNode.addForwardEnd(end);
|
|
|
2373 |
mergeNode.setNext(next);
|
|
|
2374 |
|
|
|
2375 |
setFirstInstruction(block, mergeNode);
|
|
|
2376 |
}
|
|
|
2377 |
|
|
|
2378 |
AbstractMergeNode mergeNode = (AbstractMergeNode) getFirstInstruction(block);
|
|
|
2379 |
|
|
|
2380 |
// The EndNode for the newly merged edge.
|
|
|
2381 |
EndNode newEnd = graph.add(new EndNode());
|
|
|
2382 |
Target target = checkLoopExit(newEnd, block, state);
|
|
|
2383 |
FixedNode result = target.fixed;
|
|
|
2384 |
getEntryState(block).merge(mergeNode, target.state);
|
|
|
2385 |
mergeNode.addForwardEnd(newEnd);
|
|
|
2386 |
|
|
|
2387 |
Debug.log("createTarget %s: merging state, result: %s", block, result);
|
|
|
2388 |
return result;
|
|
|
2389 |
}
|
|
|
2390 |
|
|
|
2391 |
/**
|
|
|
2392 |
* Returns a block begin node with the specified state. If the specified probability is 0, the
|
|
|
2393 |
* block deoptimizes immediately.
|
|
|
2394 |
*/
|
|
|
2395 |
private AbstractBeginNode createBlockTarget(double probability, BciBlock block, FrameStateBuilder stateAfter) {
|
|
|
2396 |
FixedNode target = createTarget(probability, block, stateAfter);
|
|
|
2397 |
AbstractBeginNode begin = BeginNode.begin(target);
|
|
|
2398 |
|
|
|
2399 |
assert !(target instanceof DeoptimizeNode && begin instanceof BeginStateSplitNode &&
|
|
|
2400 |
((BeginStateSplitNode) begin).stateAfter() != null) : "We are not allowed to set the stateAfter of the begin node," +
|
|
|
2401 |
" because we have to deoptimize to a bci _before_ the actual if, so that the interpreter can update the profiling information.";
|
|
|
2402 |
return begin;
|
|
|
2403 |
}
|
|
|
2404 |
|
|
|
2405 |
private ValueNode synchronizedObject(FrameStateBuilder state, ResolvedJavaMethod target) {
|
|
|
2406 |
if (target.isStatic()) {
|
|
|
2407 |
return appendConstant(getConstantReflection().asJavaClass(target.getDeclaringClass()));
|
|
|
2408 |
} else {
|
|
|
2409 |
return state.loadLocal(0, JavaKind.Object);
|
|
|
2410 |
}
|
|
|
2411 |
}
|
|
|
2412 |
|
|
|
2413 |
@SuppressWarnings("try")
|
|
|
2414 |
protected void processBlock(BciBlock block) {
|
|
|
2415 |
// Ignore blocks that have no predecessors by the time their bytecodes are parsed
|
|
|
2416 |
FixedWithNextNode firstInstruction = getFirstInstruction(block);
|
|
|
2417 |
if (firstInstruction == null) {
|
|
|
2418 |
Debug.log("Ignoring block %s", block);
|
|
|
2419 |
return;
|
|
|
2420 |
}
|
|
|
2421 |
try (Indent indent = Debug.logAndIndent("Parsing block %s firstInstruction: %s loopHeader: %b", block, firstInstruction, block.isLoopHeader)) {
|
|
|
2422 |
|
|
|
2423 |
lastInstr = firstInstruction;
|
|
|
2424 |
frameState = getEntryState(block);
|
|
|
2425 |
setCurrentFrameState(frameState);
|
|
|
2426 |
currentBlock = block;
|
|
|
2427 |
|
|
|
2428 |
if (firstInstruction instanceof AbstractMergeNode) {
|
|
|
2429 |
setMergeStateAfter(block, firstInstruction);
|
|
|
2430 |
}
|
|
|
2431 |
|
|
|
2432 |
if (block == blockMap.getReturnBlock()) {
|
|
|
2433 |
handleReturnBlock();
|
|
|
2434 |
} else if (block == blockMap.getUnwindBlock()) {
|
|
46344
|
2435 |
handleUnwindBlock((ExceptionDispatchBlock) block);
|
|
43972
|
2436 |
} else if (block instanceof ExceptionDispatchBlock) {
|
|
|
2437 |
createExceptionDispatch((ExceptionDispatchBlock) block);
|
|
|
2438 |
} else {
|
|
|
2439 |
frameState.setRethrowException(false);
|
|
|
2440 |
iterateBytecodesForBlock(block);
|
|
|
2441 |
}
|
|
|
2442 |
}
|
|
|
2443 |
}
|
|
|
2444 |
|
|
46344
|
2445 |
private void handleUnwindBlock(ExceptionDispatchBlock block) {
|
|
43972
|
2446 |
if (parent == null) {
|
|
46344
|
2447 |
finishPrepare(lastInstr, block.deoptBci);
|
|
43972
|
2448 |
frameState.setRethrowException(false);
|
|
|
2449 |
createUnwind();
|
|
|
2450 |
} else {
|
|
|
2451 |
ValueNode exception = frameState.pop(JavaKind.Object);
|
|
|
2452 |
this.unwindValue = exception;
|
|
|
2453 |
this.beforeUnwindNode = this.lastInstr;
|
|
|
2454 |
}
|
|
|
2455 |
}
|
|
|
2456 |
|
|
|
2457 |
private void handleReturnBlock() {
|
|
|
2458 |
JavaKind returnKind = method.getSignature().getReturnKind().getStackKind();
|
|
|
2459 |
ValueNode x = returnKind == JavaKind.Void ? null : frameState.pop(returnKind);
|
|
|
2460 |
assert frameState.stackSize() == 0;
|
|
|
2461 |
beforeReturn(x, returnKind);
|
|
|
2462 |
this.returnValue = x;
|
|
|
2463 |
this.beforeReturnNode = this.lastInstr;
|
|
|
2464 |
}
|
|
|
2465 |
|
|
|
2466 |
private void setMergeStateAfter(BciBlock block, FixedWithNextNode firstInstruction) {
|
|
|
2467 |
AbstractMergeNode abstractMergeNode = (AbstractMergeNode) firstInstruction;
|
|
|
2468 |
if (abstractMergeNode.stateAfter() == null) {
|
|
|
2469 |
int bci = block.startBci;
|
|
|
2470 |
if (block instanceof ExceptionDispatchBlock) {
|
|
|
2471 |
bci = ((ExceptionDispatchBlock) block).deoptBci;
|
|
|
2472 |
}
|
|
|
2473 |
abstractMergeNode.setStateAfter(createFrameState(bci, abstractMergeNode));
|
|
|
2474 |
}
|
|
|
2475 |
}
|
|
|
2476 |
|
|
|
2477 |
private void createUnwind() {
|
|
|
2478 |
assert frameState.stackSize() == 1 : frameState;
|
|
46344
|
2479 |
synchronizedEpilogue(BytecodeFrame.AFTER_EXCEPTION_BCI, null, null);
|
|
43972
|
2480 |
ValueNode exception = frameState.pop(JavaKind.Object);
|
|
|
2481 |
append(new UnwindNode(exception));
|
|
|
2482 |
}
|
|
|
2483 |
|
|
|
2484 |
private void synchronizedEpilogue(int bci, ValueNode currentReturnValue, JavaKind currentReturnValueKind) {
|
|
|
2485 |
if (method.isSynchronized()) {
|
|
|
2486 |
if (currentReturnValue != null) {
|
|
|
2487 |
frameState.push(currentReturnValueKind, currentReturnValue);
|
|
|
2488 |
}
|
|
|
2489 |
genMonitorExit(methodSynchronizedObject, currentReturnValue, bci);
|
|
|
2490 |
assert !frameState.rethrowException();
|
|
46344
|
2491 |
finishPrepare(lastInstr, bci);
|
|
43972
|
2492 |
}
|
|
|
2493 |
if (frameState.lockDepth(false) != 0) {
|
|
|
2494 |
throw bailout("unbalanced monitors: too few exits exiting frame");
|
|
|
2495 |
}
|
|
|
2496 |
}
|
|
|
2497 |
|
|
|
2498 |
private void createExceptionDispatch(ExceptionDispatchBlock block) {
|
|
|
2499 |
assert frameState.stackSize() == 1 : frameState;
|
|
|
2500 |
if (block.handler.isCatchAll()) {
|
|
|
2501 |
assert block.getSuccessorCount() == 1;
|
|
|
2502 |
appendGoto(block.getSuccessor(0));
|
|
|
2503 |
return;
|
|
|
2504 |
}
|
|
|
2505 |
|
|
|
2506 |
JavaType catchType = block.handler.getCatchType();
|
|
|
2507 |
if (graphBuilderConfig.eagerResolving()) {
|
|
|
2508 |
catchType = lookupType(block.handler.catchTypeCPI(), INSTANCEOF);
|
|
|
2509 |
}
|
|
|
2510 |
if (catchType instanceof ResolvedJavaType) {
|
|
|
2511 |
TypeReference checkedCatchType = TypeReference.createTrusted(graph.getAssumptions(), (ResolvedJavaType) catchType);
|
|
|
2512 |
|
|
|
2513 |
if (graphBuilderConfig.getSkippedExceptionTypes() != null) {
|
|
|
2514 |
for (ResolvedJavaType skippedType : graphBuilderConfig.getSkippedExceptionTypes()) {
|
|
|
2515 |
if (skippedType.isAssignableFrom(checkedCatchType.getType())) {
|
|
|
2516 |
BciBlock nextBlock = block.getSuccessorCount() == 1 ? blockMap.getUnwindBlock() : block.getSuccessor(1);
|
|
|
2517 |
ValueNode exception = frameState.stack[0];
|
|
|
2518 |
FixedNode trueSuccessor = graph.add(new DeoptimizeNode(InvalidateReprofile, UnreachedCode));
|
|
|
2519 |
FixedNode nextDispatch = createTarget(nextBlock, frameState);
|
|
|
2520 |
append(new IfNode(graph.addOrUniqueWithInputs(createInstanceOf(checkedCatchType, exception)), trueSuccessor, nextDispatch, 0));
|
|
|
2521 |
return;
|
|
|
2522 |
}
|
|
|
2523 |
}
|
|
|
2524 |
}
|
|
|
2525 |
|
|
|
2526 |
BciBlock nextBlock = block.getSuccessorCount() == 1 ? blockMap.getUnwindBlock() : block.getSuccessor(1);
|
|
|
2527 |
ValueNode exception = frameState.stack[0];
|
|
|
2528 |
/* Anchor for the piNode, which must be before any LoopExit inserted by createTarget. */
|
|
|
2529 |
BeginNode piNodeAnchor = graph.add(new BeginNode());
|
|
|
2530 |
ObjectStamp checkedStamp = StampFactory.objectNonNull(checkedCatchType);
|
|
|
2531 |
PiNode piNode = graph.addWithoutUnique(new PiNode(exception, checkedStamp));
|
|
|
2532 |
frameState.pop(JavaKind.Object);
|
|
|
2533 |
frameState.push(JavaKind.Object, piNode);
|
|
|
2534 |
FixedNode catchSuccessor = createTarget(block.getSuccessor(0), frameState);
|
|
|
2535 |
frameState.pop(JavaKind.Object);
|
|
|
2536 |
frameState.push(JavaKind.Object, exception);
|
|
|
2537 |
FixedNode nextDispatch = createTarget(nextBlock, frameState);
|
|
|
2538 |
piNodeAnchor.setNext(catchSuccessor);
|
|
|
2539 |
IfNode ifNode = append(new IfNode(graph.unique(createInstanceOf(checkedCatchType, exception)), piNodeAnchor, nextDispatch, 0.5));
|
|
|
2540 |
assert ifNode.trueSuccessor() == piNodeAnchor;
|
|
|
2541 |
piNode.setGuard(ifNode.trueSuccessor());
|
|
|
2542 |
} else {
|
|
|
2543 |
handleUnresolvedExceptionType(catchType);
|
|
|
2544 |
}
|
|
|
2545 |
}
|
|
|
2546 |
|
|
|
2547 |
private void appendGoto(BciBlock successor) {
|
|
|
2548 |
FixedNode targetInstr = createTarget(successor, frameState, true, true);
|
|
|
2549 |
if (lastInstr != null && lastInstr != targetInstr) {
|
|
|
2550 |
lastInstr.setNext(targetInstr);
|
|
|
2551 |
}
|
|
|
2552 |
}
|
|
|
2553 |
|
|
|
2554 |
@SuppressWarnings("try")
|
|
|
2555 |
protected void iterateBytecodesForBlock(BciBlock block) {
|
|
|
2556 |
if (block.isLoopHeader) {
|
|
|
2557 |
// Create the loop header block, which later will merge the backward branches of
|
|
|
2558 |
// the loop.
|
|
|
2559 |
controlFlowSplit = true;
|
|
|
2560 |
LoopBeginNode loopBegin = appendLoopBegin(this.lastInstr);
|
|
|
2561 |
lastInstr = loopBegin;
|
|
|
2562 |
|
|
|
2563 |
// Create phi functions for all local variables and operand stack slots.
|
|
|
2564 |
frameState.insertLoopPhis(liveness, block.loopId, loopBegin, forceLoopPhis(), stampFromValueForForcedPhis());
|
|
|
2565 |
loopBegin.setStateAfter(createFrameState(block.startBci, loopBegin));
|
|
|
2566 |
|
|
|
2567 |
/*
|
|
|
2568 |
* We have seen all forward branches. All subsequent backward branches will merge to the
|
|
|
2569 |
* loop header. This ensures that the loop header has exactly one non-loop predecessor.
|
|
|
2570 |
*/
|
|
|
2571 |
setFirstInstruction(block, loopBegin);
|
|
|
2572 |
/*
|
|
|
2573 |
* We need to preserve the frame state builder of the loop header so that we can merge
|
|
|
2574 |
* values for phi functions, so make a copy of it.
|
|
|
2575 |
*/
|
|
|
2576 |
setEntryState(block, frameState.copy());
|
|
|
2577 |
|
|
|
2578 |
Debug.log(" created loop header %s", loopBegin);
|
|
|
2579 |
} else if (lastInstr instanceof MergeNode) {
|
|
|
2580 |
/*
|
|
|
2581 |
* All inputs of non-loop phi nodes are known by now. We can infer the stamp for the
|
|
|
2582 |
* phi, so that parsing continues with more precise type information.
|
|
|
2583 |
*/
|
|
|
2584 |
frameState.inferPhiStamps((AbstractMergeNode) lastInstr);
|
|
|
2585 |
}
|
|
|
2586 |
assert lastInstr.next() == null : "instructions already appended at block " + block;
|
|
|
2587 |
Debug.log(" frameState: %s", frameState);
|
|
|
2588 |
|
|
|
2589 |
lastInstr = finishInstruction(lastInstr, frameState);
|
|
|
2590 |
|
|
|
2591 |
int endBCI = stream.endBCI();
|
|
|
2592 |
|
|
|
2593 |
stream.setBCI(block.startBci);
|
|
|
2594 |
int bci = block.startBci;
|
|
|
2595 |
BytecodesParsed.add(block.endBci - bci);
|
|
|
2596 |
|
|
|
2597 |
/* Reset line number for new block */
|
|
|
2598 |
if (graphBuilderConfig.insertFullInfopoints()) {
|
|
|
2599 |
previousLineNumber = -1;
|
|
|
2600 |
}
|
|
|
2601 |
|
|
|
2602 |
while (bci < endBCI) {
|
|
|
2603 |
if (graphBuilderConfig.insertFullInfopoints() && !parsingIntrinsic()) {
|
|
|
2604 |
currentLineNumber = lnt != null ? lnt.getLineNumber(bci) : -1;
|
|
|
2605 |
if (currentLineNumber != previousLineNumber) {
|
|
|
2606 |
genInfoPointNode(InfopointReason.BYTECODE_POSITION, null);
|
|
|
2607 |
previousLineNumber = currentLineNumber;
|
|
|
2608 |
}
|
|
|
2609 |
}
|
|
|
2610 |
|
|
|
2611 |
// read the opcode
|
|
|
2612 |
int opcode = stream.currentBC();
|
|
|
2613 |
assert traceState();
|
|
|
2614 |
assert traceInstruction(bci, opcode, bci == block.startBci);
|
|
|
2615 |
if (parent == null && bci == entryBCI) {
|
|
|
2616 |
if (block.getJsrScope() != JsrScope.EMPTY_SCOPE) {
|
|
|
2617 |
throw new JsrNotSupportedBailout("OSR into a JSR scope is not supported");
|
|
|
2618 |
}
|
|
|
2619 |
EntryMarkerNode x = append(new EntryMarkerNode());
|
|
|
2620 |
frameState.insertProxies(value -> graph.unique(new EntryProxyNode(value, x)));
|
|
|
2621 |
x.setStateAfter(createFrameState(bci, x));
|
|
|
2622 |
}
|
|
|
2623 |
|
|
|
2624 |
try (DebugCloseable context = openNodeContext()) {
|
|
|
2625 |
processBytecode(bci, opcode);
|
|
|
2626 |
} catch (BailoutException e) {
|
|
|
2627 |
// Don't wrap bailouts as parser errors
|
|
|
2628 |
throw e;
|
|
|
2629 |
} catch (Throwable e) {
|
|
|
2630 |
throw asParserError(e);
|
|
|
2631 |
}
|
|
|
2632 |
|
|
|
2633 |
if (lastInstr == null || lastInstr.next() != null) {
|
|
|
2634 |
break;
|
|
|
2635 |
}
|
|
|
2636 |
|
|
|
2637 |
stream.next();
|
|
|
2638 |
bci = stream.currentBCI();
|
|
|
2639 |
|
|
|
2640 |
assert block == currentBlock;
|
|
|
2641 |
assert checkLastInstruction();
|
|
|
2642 |
lastInstr = finishInstruction(lastInstr, frameState);
|
|
|
2643 |
if (bci < endBCI) {
|
|
|
2644 |
if (bci > block.endBci) {
|
|
|
2645 |
assert !block.getSuccessor(0).isExceptionEntry;
|
|
|
2646 |
assert block.numNormalSuccessors() == 1;
|
|
|
2647 |
// we fell through to the next block, add a goto and break
|
|
|
2648 |
appendGoto(block.getSuccessor(0));
|
|
|
2649 |
break;
|
|
|
2650 |
}
|
|
|
2651 |
}
|
|
|
2652 |
}
|
|
|
2653 |
}
|
|
|
2654 |
|
|
|
2655 |
private DebugCloseable openNodeContext() {
|
|
46371
|
2656 |
if ((graphBuilderConfig.trackNodeSourcePosition() || Debug.isDumpEnabledForMethod()) && !parsingIntrinsic()) {
|
|
43972
|
2657 |
return graph.withNodeSourcePosition(createBytecodePosition());
|
|
|
2658 |
}
|
|
|
2659 |
return null;
|
|
|
2660 |
}
|
|
|
2661 |
|
|
|
2662 |
/* Also a hook for subclasses. */
|
|
|
2663 |
protected boolean forceLoopPhis() {
|
|
|
2664 |
return graph.isOSR();
|
|
|
2665 |
}
|
|
|
2666 |
|
|
|
2667 |
/* Hook for subclasses. */
|
|
|
2668 |
protected boolean stampFromValueForForcedPhis() {
|
|
|
2669 |
return false;
|
|
|
2670 |
}
|
|
|
2671 |
|
|
|
2672 |
protected boolean checkLastInstruction() {
|
|
|
2673 |
if (lastInstr instanceof BeginNode) {
|
|
|
2674 |
// ignore
|
|
|
2675 |
} else if (lastInstr instanceof StateSplit) {
|
|
|
2676 |
StateSplit stateSplit = (StateSplit) lastInstr;
|
|
|
2677 |
if (stateSplit.hasSideEffect()) {
|
|
|
2678 |
assert stateSplit.stateAfter() != null : "side effect " + lastInstr + " requires a non-null stateAfter";
|
|
|
2679 |
}
|
|
|
2680 |
}
|
|
|
2681 |
return true;
|
|
|
2682 |
}
|
|
|
2683 |
|
|
|
2684 |
/* Also a hook for subclasses. */
|
|
|
2685 |
protected boolean disableLoopSafepoint() {
|
|
|
2686 |
return parsingIntrinsic();
|
|
|
2687 |
}
|
|
|
2688 |
|
|
|
2689 |
private LoopBeginNode appendLoopBegin(FixedWithNextNode fixedWithNext) {
|
|
|
2690 |
EndNode preLoopEnd = graph.add(new EndNode());
|
|
|
2691 |
LoopBeginNode loopBegin = graph.add(new LoopBeginNode());
|
|
|
2692 |
if (disableLoopSafepoint()) {
|
|
|
2693 |
loopBegin.disableSafepoint();
|
|
|
2694 |
}
|
|
|
2695 |
fixedWithNext.setNext(preLoopEnd);
|
|
|
2696 |
// Add the single non-loop predecessor of the loop header.
|
|
|
2697 |
loopBegin.addForwardEnd(preLoopEnd);
|
|
|
2698 |
return loopBegin;
|
|
|
2699 |
}
|
|
|
2700 |
|
|
|
2701 |
/**
|
|
|
2702 |
* Hook for subclasses to modify the last instruction or add other instructions.
|
|
|
2703 |
*
|
|
|
2704 |
* @param instr The last instruction (= fixed node) which was added.
|
|
|
2705 |
* @param state The current frame state.
|
|
|
2706 |
* @return Returns the (new) last instruction.
|
|
|
2707 |
*/
|
|
|
2708 |
protected FixedWithNextNode finishInstruction(FixedWithNextNode instr, FrameStateBuilder state) {
|
|
|
2709 |
return instr;
|
|
|
2710 |
}
|
|
|
2711 |
|
|
|
2712 |
private void genInfoPointNode(InfopointReason reason, ValueNode escapedReturnValue) {
|
|
|
2713 |
if (!parsingIntrinsic() && graphBuilderConfig.insertFullInfopoints()) {
|
|
|
2714 |
append(new FullInfopointNode(reason, createFrameState(bci(), null), escapedReturnValue));
|
|
|
2715 |
}
|
|
|
2716 |
}
|
|
|
2717 |
|
|
|
2718 |
private boolean traceState() {
|
|
46344
|
2719 |
if (Debug.isEnabled() && TraceBytecodeParserLevel.getValue(options) >= TRACELEVEL_STATE && Debug.isLogEnabled()) {
|
|
43972
|
2720 |
frameState.traceState();
|
|
|
2721 |
}
|
|
|
2722 |
return true;
|
|
|
2723 |
}
|
|
|
2724 |
|
|
|
2725 |
protected void genIf(ValueNode x, Condition cond, ValueNode y) {
|
|
|
2726 |
assert x.getStackKind() == y.getStackKind();
|
|
|
2727 |
assert currentBlock.getSuccessorCount() == 2;
|
|
|
2728 |
BciBlock trueBlock = currentBlock.getSuccessor(0);
|
|
|
2729 |
BciBlock falseBlock = currentBlock.getSuccessor(1);
|
|
|
2730 |
|
|
|
2731 |
if (trueBlock == falseBlock) {
|
|
|
2732 |
// The target block is the same independent of the condition.
|
|
|
2733 |
appendGoto(trueBlock);
|
|
|
2734 |
return;
|
|
|
2735 |
}
|
|
|
2736 |
|
|
|
2737 |
ValueNode a = x;
|
|
|
2738 |
ValueNode b = y;
|
|
|
2739 |
|
|
|
2740 |
// Check whether the condition needs to mirror the operands.
|
|
|
2741 |
if (cond.canonicalMirror()) {
|
|
|
2742 |
a = y;
|
|
|
2743 |
b = x;
|
|
|
2744 |
}
|
|
|
2745 |
|
|
|
2746 |
// Create the logic node for the condition.
|
|
|
2747 |
LogicNode condition = createLogicNode(cond, a, b);
|
|
|
2748 |
|
|
|
2749 |
// Check whether the condition needs to negate the result.
|
|
|
2750 |
boolean negate = cond.canonicalNegate();
|
|
46344
|
2751 |
genIf(condition, negate, trueBlock, falseBlock);
|
|
|
2752 |
}
|
|
|
2753 |
|
|
|
2754 |
protected void genIf(LogicNode conditionInput, boolean negateCondition, BciBlock trueBlockInput, BciBlock falseBlockInput) {
|
|
|
2755 |
BciBlock trueBlock = trueBlockInput;
|
|
|
2756 |
BciBlock falseBlock = falseBlockInput;
|
|
|
2757 |
LogicNode condition = conditionInput;
|
|
|
2758 |
FrameState stateBefore = null;
|
|
|
2759 |
ProfilingPlugin profilingPlugin = this.graphBuilderConfig.getPlugins().getProfilingPlugin();
|
|
|
2760 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2761 |
stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
2762 |
}
|
|
43972
|
2763 |
|
|
|
2764 |
// Remove a logic negation node and fold it into the negate boolean.
|
|
46344
|
2765 |
boolean negate = negateCondition;
|
|
43972
|
2766 |
if (condition instanceof LogicNegationNode) {
|
|
|
2767 |
LogicNegationNode logicNegationNode = (LogicNegationNode) condition;
|
|
|
2768 |
negate = !negate;
|
|
|
2769 |
condition = logicNegationNode.getValue();
|
|
|
2770 |
}
|
|
|
2771 |
|
|
|
2772 |
if (condition instanceof LogicConstantNode) {
|
|
|
2773 |
genConstantTargetIf(trueBlock, falseBlock, negate, condition);
|
|
|
2774 |
} else {
|
|
|
2775 |
if (condition.graph() == null) {
|
|
46371
|
2776 |
condition = genUnique(condition);
|
|
43972
|
2777 |
}
|
|
|
2778 |
|
|
|
2779 |
// Need to get probability based on current bci.
|
|
|
2780 |
double probability = branchProbability();
|
|
|
2781 |
|
|
|
2782 |
if (negate) {
|
|
|
2783 |
BciBlock tmpBlock = trueBlock;
|
|
|
2784 |
trueBlock = falseBlock;
|
|
|
2785 |
falseBlock = tmpBlock;
|
|
|
2786 |
probability = 1 - probability;
|
|
|
2787 |
}
|
|
|
2788 |
|
|
|
2789 |
if (isNeverExecutedCode(probability)) {
|
|
|
2790 |
append(new FixedGuardNode(condition, UnreachedCode, InvalidateReprofile, true));
|
|
|
2791 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2792 |
profilingPlugin.profileGoto(this, method, bci(), falseBlock.startBci, stateBefore);
|
|
|
2793 |
}
|
|
|
2794 |
appendGoto(falseBlock);
|
|
|
2795 |
return;
|
|
|
2796 |
} else if (isNeverExecutedCode(1 - probability)) {
|
|
|
2797 |
append(new FixedGuardNode(condition, UnreachedCode, InvalidateReprofile, false));
|
|
|
2798 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2799 |
profilingPlugin.profileGoto(this, method, bci(), trueBlock.startBci, stateBefore);
|
|
|
2800 |
}
|
|
|
2801 |
appendGoto(trueBlock);
|
|
|
2802 |
return;
|
|
|
2803 |
}
|
|
|
2804 |
|
|
|
2805 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2806 |
profilingPlugin.profileIf(this, method, bci(), condition, trueBlock.startBci, falseBlock.startBci, stateBefore);
|
|
|
2807 |
}
|
|
|
2808 |
|
|
|
2809 |
int oldBci = stream.currentBCI();
|
|
|
2810 |
int trueBlockInt = checkPositiveIntConstantPushed(trueBlock);
|
|
|
2811 |
if (trueBlockInt != -1) {
|
|
|
2812 |
int falseBlockInt = checkPositiveIntConstantPushed(falseBlock);
|
|
|
2813 |
if (falseBlockInt != -1) {
|
|
|
2814 |
if (tryGenConditionalForIf(trueBlock, falseBlock, condition, oldBci, trueBlockInt, falseBlockInt)) {
|
|
|
2815 |
return;
|
|
|
2816 |
}
|
|
|
2817 |
}
|
|
|
2818 |
}
|
|
|
2819 |
|
|
|
2820 |
this.controlFlowSplit = true;
|
|
|
2821 |
FixedNode trueSuccessor = createTarget(trueBlock, frameState, false, false);
|
|
|
2822 |
FixedNode falseSuccessor = createTarget(falseBlock, frameState, false, true);
|
|
|
2823 |
ValueNode ifNode = genIfNode(condition, trueSuccessor, falseSuccessor, probability);
|
|
|
2824 |
postProcessIfNode(ifNode);
|
|
|
2825 |
append(ifNode);
|
|
|
2826 |
}
|
|
|
2827 |
}
|
|
|
2828 |
|
|
|
2829 |
/**
|
|
|
2830 |
* Hook for subclasses to generate custom nodes before an IfNode.
|
|
|
2831 |
*/
|
|
|
2832 |
@SuppressWarnings("unused")
|
|
|
2833 |
protected void postProcessIfNode(ValueNode node) {
|
|
|
2834 |
}
|
|
|
2835 |
|
|
|
2836 |
private boolean tryGenConditionalForIf(BciBlock trueBlock, BciBlock falseBlock, LogicNode condition, int oldBci, int trueBlockInt, int falseBlockInt) {
|
|
|
2837 |
if (gotoOrFallThroughAfterConstant(trueBlock) && gotoOrFallThroughAfterConstant(falseBlock) && trueBlock.getSuccessor(0) == falseBlock.getSuccessor(0)) {
|
|
|
2838 |
genConditionalForIf(trueBlock, condition, oldBci, trueBlockInt, falseBlockInt, false);
|
|
|
2839 |
return true;
|
|
|
2840 |
} else if (this.parent != null && returnAfterConstant(trueBlock) && returnAfterConstant(falseBlock)) {
|
|
|
2841 |
genConditionalForIf(trueBlock, condition, oldBci, trueBlockInt, falseBlockInt, true);
|
|
|
2842 |
return true;
|
|
|
2843 |
}
|
|
|
2844 |
return false;
|
|
|
2845 |
}
|
|
|
2846 |
|
|
|
2847 |
private void genConditionalForIf(BciBlock trueBlock, LogicNode condition, int oldBci, int trueBlockInt, int falseBlockInt, boolean genReturn) {
|
|
|
2848 |
ConstantNode trueValue = graph.unique(ConstantNode.forInt(trueBlockInt));
|
|
|
2849 |
ConstantNode falseValue = graph.unique(ConstantNode.forInt(falseBlockInt));
|
|
|
2850 |
ValueNode conditionalNode = ConditionalNode.create(condition, trueValue, falseValue);
|
|
|
2851 |
if (conditionalNode.graph() == null) {
|
|
|
2852 |
conditionalNode = graph.addOrUnique(conditionalNode);
|
|
|
2853 |
}
|
|
|
2854 |
if (genReturn) {
|
|
|
2855 |
JavaKind returnKind = method.getSignature().getReturnKind().getStackKind();
|
|
|
2856 |
this.genReturn(conditionalNode, returnKind);
|
|
|
2857 |
} else {
|
|
|
2858 |
frameState.push(JavaKind.Int, conditionalNode);
|
|
|
2859 |
appendGoto(trueBlock.getSuccessor(0));
|
|
|
2860 |
stream.setBCI(oldBci);
|
|
|
2861 |
}
|
|
|
2862 |
}
|
|
|
2863 |
|
|
|
2864 |
private LogicNode createLogicNode(Condition cond, ValueNode a, ValueNode b) {
|
|
|
2865 |
LogicNode condition;
|
|
|
2866 |
assert !a.getStackKind().isNumericFloat();
|
|
|
2867 |
if (cond == Condition.EQ || cond == Condition.NE) {
|
|
|
2868 |
if (a.getStackKind() == JavaKind.Object) {
|
|
|
2869 |
condition = genObjectEquals(a, b);
|
|
|
2870 |
} else {
|
|
|
2871 |
condition = genIntegerEquals(a, b);
|
|
|
2872 |
}
|
|
|
2873 |
} else {
|
|
|
2874 |
assert a.getStackKind() != JavaKind.Object && !cond.isUnsigned();
|
|
|
2875 |
condition = genIntegerLessThan(a, b);
|
|
|
2876 |
}
|
|
|
2877 |
return condition;
|
|
|
2878 |
}
|
|
|
2879 |
|
|
|
2880 |
private void genConstantTargetIf(BciBlock trueBlock, BciBlock falseBlock, boolean negate, LogicNode condition) {
|
|
|
2881 |
LogicConstantNode constantLogicNode = (LogicConstantNode) condition;
|
|
|
2882 |
boolean value = constantLogicNode.getValue();
|
|
|
2883 |
if (negate) {
|
|
|
2884 |
value = !value;
|
|
|
2885 |
}
|
|
|
2886 |
BciBlock nextBlock = falseBlock;
|
|
|
2887 |
if (value) {
|
|
|
2888 |
nextBlock = trueBlock;
|
|
|
2889 |
}
|
|
|
2890 |
int startBci = nextBlock.startBci;
|
|
|
2891 |
int targetAtStart = stream.readUByte(startBci);
|
|
|
2892 |
if (targetAtStart == Bytecodes.GOTO && nextBlock.getPredecessorCount() == 1) {
|
|
|
2893 |
// This is an empty block. Skip it.
|
|
|
2894 |
BciBlock successorBlock = nextBlock.successors.get(0);
|
|
|
2895 |
ProfilingPlugin profilingPlugin = graphBuilderConfig.getPlugins().getProfilingPlugin();
|
|
|
2896 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2897 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
2898 |
profilingPlugin.profileGoto(this, method, bci(), successorBlock.startBci, stateBefore);
|
|
|
2899 |
}
|
|
|
2900 |
appendGoto(successorBlock);
|
|
|
2901 |
assert nextBlock.numNormalSuccessors() == 1;
|
|
|
2902 |
} else {
|
|
|
2903 |
ProfilingPlugin profilingPlugin = graphBuilderConfig.getPlugins().getProfilingPlugin();
|
|
|
2904 |
if (profilingPlugin != null && profilingPlugin.shouldProfile(this, method)) {
|
|
|
2905 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
2906 |
profilingPlugin.profileGoto(this, method, bci(), nextBlock.startBci, stateBefore);
|
|
|
2907 |
}
|
|
|
2908 |
appendGoto(nextBlock);
|
|
|
2909 |
}
|
|
|
2910 |
}
|
|
|
2911 |
|
|
|
2912 |
private int checkPositiveIntConstantPushed(BciBlock block) {
|
|
|
2913 |
stream.setBCI(block.startBci);
|
|
|
2914 |
int currentBC = stream.currentBC();
|
|
|
2915 |
if (currentBC >= Bytecodes.ICONST_0 && currentBC <= Bytecodes.ICONST_5) {
|
|
|
2916 |
int constValue = currentBC - Bytecodes.ICONST_0;
|
|
|
2917 |
return constValue;
|
|
|
2918 |
}
|
|
|
2919 |
return -1;
|
|
|
2920 |
}
|
|
|
2921 |
|
|
|
2922 |
private boolean gotoOrFallThroughAfterConstant(BciBlock block) {
|
|
|
2923 |
stream.setBCI(block.startBci);
|
|
|
2924 |
int currentBCI = stream.nextBCI();
|
|
|
2925 |
stream.setBCI(currentBCI);
|
|
|
2926 |
int currentBC = stream.currentBC();
|
|
|
2927 |
return stream.currentBCI() > block.endBci || currentBC == Bytecodes.GOTO || currentBC == Bytecodes.GOTO_W;
|
|
|
2928 |
}
|
|
|
2929 |
|
|
|
2930 |
private boolean returnAfterConstant(BciBlock block) {
|
|
|
2931 |
stream.setBCI(block.startBci);
|
|
|
2932 |
int currentBCI = stream.nextBCI();
|
|
|
2933 |
stream.setBCI(currentBCI);
|
|
|
2934 |
int currentBC = stream.currentBC();
|
|
|
2935 |
return currentBC == Bytecodes.IRETURN;
|
|
|
2936 |
}
|
|
|
2937 |
|
|
|
2938 |
@Override
|
|
|
2939 |
public StampProvider getStampProvider() {
|
|
|
2940 |
return stampProvider;
|
|
|
2941 |
}
|
|
|
2942 |
|
|
|
2943 |
@Override
|
|
|
2944 |
public MetaAccessProvider getMetaAccess() {
|
|
|
2945 |
return metaAccess;
|
|
|
2946 |
}
|
|
|
2947 |
|
|
|
2948 |
@Override
|
|
|
2949 |
public void push(JavaKind slotKind, ValueNode value) {
|
|
|
2950 |
assert value.isAlive();
|
|
|
2951 |
frameState.push(slotKind, value);
|
|
|
2952 |
}
|
|
|
2953 |
|
|
|
2954 |
@Override
|
|
|
2955 |
public ConstantReflectionProvider getConstantReflection() {
|
|
|
2956 |
return constantReflection;
|
|
|
2957 |
}
|
|
|
2958 |
|
|
|
2959 |
@Override
|
|
|
2960 |
public ConstantFieldProvider getConstantFieldProvider() {
|
|
|
2961 |
return constantFieldProvider;
|
|
|
2962 |
}
|
|
|
2963 |
|
|
|
2964 |
/**
|
|
|
2965 |
* Gets the graph being processed by this builder.
|
|
|
2966 |
*/
|
|
|
2967 |
@Override
|
|
|
2968 |
public StructuredGraph getGraph() {
|
|
|
2969 |
return graph;
|
|
|
2970 |
}
|
|
|
2971 |
|
|
|
2972 |
@Override
|
|
|
2973 |
public BytecodeParser getParent() {
|
|
|
2974 |
return parent;
|
|
|
2975 |
}
|
|
|
2976 |
|
|
|
2977 |
@Override
|
|
|
2978 |
public IntrinsicContext getIntrinsic() {
|
|
|
2979 |
return intrinsicContext;
|
|
|
2980 |
}
|
|
|
2981 |
|
|
|
2982 |
@Override
|
|
|
2983 |
public String toString() {
|
|
|
2984 |
Formatter fmt = new Formatter();
|
|
|
2985 |
BytecodeParser bp = this;
|
|
|
2986 |
String indent = "";
|
|
|
2987 |
while (bp != null) {
|
|
|
2988 |
if (bp != this) {
|
|
|
2989 |
fmt.format("%n%s", indent);
|
|
|
2990 |
}
|
|
|
2991 |
fmt.format("%s [bci: %d, intrinsic: %s]", bp.code.asStackTraceElement(bp.bci()), bp.bci(), bp.parsingIntrinsic());
|
|
|
2992 |
fmt.format("%n%s", new BytecodeDisassembler().disassemble(bp.code, bp.bci(), bp.bci() + 10));
|
|
|
2993 |
bp = bp.parent;
|
|
|
2994 |
indent += " ";
|
|
|
2995 |
}
|
|
|
2996 |
return fmt.toString();
|
|
|
2997 |
}
|
|
|
2998 |
|
|
|
2999 |
@Override
|
|
|
3000 |
public BailoutException bailout(String string) {
|
|
|
3001 |
FrameState currentFrameState = createFrameState(bci(), null);
|
|
|
3002 |
StackTraceElement[] elements = GraphUtil.approxSourceStackTraceElement(currentFrameState);
|
|
|
3003 |
BailoutException bailout = new PermanentBailoutException(string);
|
|
|
3004 |
throw GraphUtil.createBailoutException(string, bailout, elements);
|
|
|
3005 |
}
|
|
|
3006 |
|
|
|
3007 |
private FrameState createFrameState(int bci, StateSplit forStateSplit) {
|
|
|
3008 |
if (currentBlock != null && bci > currentBlock.endBci) {
|
|
|
3009 |
frameState.clearNonLiveLocals(currentBlock, liveness, false);
|
|
|
3010 |
}
|
|
|
3011 |
return frameState.create(bci, forStateSplit);
|
|
|
3012 |
}
|
|
|
3013 |
|
|
|
3014 |
@Override
|
|
|
3015 |
public void setStateAfter(StateSplit sideEffect) {
|
|
|
3016 |
assert sideEffect.hasSideEffect();
|
|
|
3017 |
FrameState stateAfter = createFrameState(stream.nextBCI(), sideEffect);
|
|
|
3018 |
sideEffect.setStateAfter(stateAfter);
|
|
|
3019 |
}
|
|
|
3020 |
|
|
|
3021 |
protected NodeSourcePosition createBytecodePosition() {
|
|
|
3022 |
return frameState.createBytecodePosition(bci());
|
|
|
3023 |
}
|
|
|
3024 |
|
|
|
3025 |
public void setCurrentFrameState(FrameStateBuilder frameState) {
|
|
|
3026 |
this.frameState = frameState;
|
|
|
3027 |
}
|
|
|
3028 |
|
|
|
3029 |
protected final BytecodeStream getStream() {
|
|
|
3030 |
return stream;
|
|
|
3031 |
}
|
|
|
3032 |
|
|
|
3033 |
@Override
|
|
|
3034 |
public int bci() {
|
|
|
3035 |
return stream.currentBCI();
|
|
|
3036 |
}
|
|
|
3037 |
|
|
|
3038 |
public void loadLocal(int index, JavaKind kind) {
|
|
|
3039 |
ValueNode value = frameState.loadLocal(index, kind);
|
|
|
3040 |
frameState.push(kind, value);
|
|
|
3041 |
}
|
|
|
3042 |
|
|
46344
|
3043 |
public void loadLocalObject(int index) {
|
|
|
3044 |
ValueNode value = frameState.loadLocal(index, JavaKind.Object);
|
|
|
3045 |
|
|
|
3046 |
int nextBCI = stream.nextBCI();
|
|
|
3047 |
int nextBC = stream.readUByte(nextBCI);
|
|
46371
|
3048 |
if (nextBCI <= currentBlock.endBci && nextBC == Bytecodes.GETFIELD) {
|
|
46344
|
3049 |
stream.next();
|
|
|
3050 |
genGetField(lookupField(stream.readCPI(), Bytecodes.GETFIELD), value);
|
|
|
3051 |
} else {
|
|
|
3052 |
frameState.push(JavaKind.Object, value);
|
|
|
3053 |
}
|
|
|
3054 |
}
|
|
|
3055 |
|
|
43972
|
3056 |
public void storeLocal(JavaKind kind, int index) {
|
|
|
3057 |
ValueNode value = frameState.pop(kind);
|
|
|
3058 |
frameState.storeLocal(index, kind, value);
|
|
|
3059 |
}
|
|
|
3060 |
|
|
|
3061 |
private void genLoadConstant(int cpi, int opcode) {
|
|
|
3062 |
Object con = lookupConstant(cpi, opcode);
|
|
|
3063 |
|
|
|
3064 |
if (con instanceof JavaType) {
|
|
|
3065 |
// this is a load of class constant which might be unresolved
|
|
|
3066 |
JavaType type = (JavaType) con;
|
|
|
3067 |
if (type instanceof ResolvedJavaType) {
|
|
|
3068 |
frameState.push(JavaKind.Object, appendConstant(getConstantReflection().asJavaClass((ResolvedJavaType) type)));
|
|
|
3069 |
} else {
|
|
|
3070 |
handleUnresolvedLoadConstant(type);
|
|
|
3071 |
}
|
|
|
3072 |
} else if (con instanceof JavaConstant) {
|
|
|
3073 |
JavaConstant constant = (JavaConstant) con;
|
|
|
3074 |
frameState.push(constant.getJavaKind(), appendConstant(constant));
|
|
|
3075 |
} else {
|
|
|
3076 |
throw new Error("lookupConstant returned an object of incorrect type");
|
|
|
3077 |
}
|
|
|
3078 |
}
|
|
|
3079 |
|
|
|
3080 |
private void genLoadIndexed(JavaKind kind) {
|
|
|
3081 |
ValueNode index = frameState.pop(JavaKind.Int);
|
|
|
3082 |
ValueNode array = emitExplicitExceptions(frameState.pop(JavaKind.Object), index);
|
|
|
3083 |
|
|
|
3084 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3085 |
if (plugin.handleLoadIndexed(this, array, index, kind)) {
|
|
|
3086 |
return;
|
|
|
3087 |
}
|
|
|
3088 |
}
|
|
|
3089 |
|
|
|
3090 |
frameState.push(kind, append(genLoadIndexed(array, index, kind)));
|
|
|
3091 |
}
|
|
|
3092 |
|
|
|
3093 |
private void genStoreIndexed(JavaKind kind) {
|
|
|
3094 |
ValueNode value = frameState.pop(kind);
|
|
|
3095 |
ValueNode index = frameState.pop(JavaKind.Int);
|
|
|
3096 |
ValueNode array = emitExplicitExceptions(frameState.pop(JavaKind.Object), index);
|
|
|
3097 |
|
|
|
3098 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3099 |
if (plugin.handleStoreIndexed(this, array, index, kind, value)) {
|
|
|
3100 |
return;
|
|
|
3101 |
}
|
|
|
3102 |
}
|
|
|
3103 |
|
|
|
3104 |
genStoreIndexed(array, index, kind, value);
|
|
|
3105 |
}
|
|
|
3106 |
|
|
|
3107 |
private void genArithmeticOp(JavaKind kind, int opcode) {
|
|
|
3108 |
ValueNode y = frameState.pop(kind);
|
|
|
3109 |
ValueNode x = frameState.pop(kind);
|
|
|
3110 |
ValueNode v;
|
|
|
3111 |
switch (opcode) {
|
|
|
3112 |
case IADD:
|
|
|
3113 |
case LADD:
|
|
|
3114 |
v = genIntegerAdd(x, y);
|
|
|
3115 |
break;
|
|
|
3116 |
case FADD:
|
|
|
3117 |
case DADD:
|
|
|
3118 |
v = genFloatAdd(x, y);
|
|
|
3119 |
break;
|
|
|
3120 |
case ISUB:
|
|
|
3121 |
case LSUB:
|
|
|
3122 |
v = genIntegerSub(x, y);
|
|
|
3123 |
break;
|
|
|
3124 |
case FSUB:
|
|
|
3125 |
case DSUB:
|
|
|
3126 |
v = genFloatSub(x, y);
|
|
|
3127 |
break;
|
|
|
3128 |
case IMUL:
|
|
|
3129 |
case LMUL:
|
|
|
3130 |
v = genIntegerMul(x, y);
|
|
|
3131 |
break;
|
|
|
3132 |
case FMUL:
|
|
|
3133 |
case DMUL:
|
|
|
3134 |
v = genFloatMul(x, y);
|
|
|
3135 |
break;
|
|
|
3136 |
case FDIV:
|
|
|
3137 |
case DDIV:
|
|
|
3138 |
v = genFloatDiv(x, y);
|
|
|
3139 |
break;
|
|
|
3140 |
case FREM:
|
|
|
3141 |
case DREM:
|
|
|
3142 |
v = genFloatRem(x, y);
|
|
|
3143 |
break;
|
|
|
3144 |
default:
|
|
|
3145 |
throw shouldNotReachHere();
|
|
|
3146 |
}
|
|
46371
|
3147 |
frameState.push(kind, recursiveAppend(v));
|
|
43972
|
3148 |
}
|
|
|
3149 |
|
|
|
3150 |
private void genIntegerDivOp(JavaKind kind, int opcode) {
|
|
|
3151 |
ValueNode y = frameState.pop(kind);
|
|
|
3152 |
ValueNode x = frameState.pop(kind);
|
|
|
3153 |
ValueNode v;
|
|
|
3154 |
switch (opcode) {
|
|
|
3155 |
case IDIV:
|
|
|
3156 |
case LDIV:
|
|
|
3157 |
v = genIntegerDiv(x, y);
|
|
|
3158 |
break;
|
|
|
3159 |
case IREM:
|
|
|
3160 |
case LREM:
|
|
|
3161 |
v = genIntegerRem(x, y);
|
|
|
3162 |
break;
|
|
|
3163 |
default:
|
|
|
3164 |
throw shouldNotReachHere();
|
|
|
3165 |
}
|
|
|
3166 |
frameState.push(kind, append(v));
|
|
|
3167 |
}
|
|
|
3168 |
|
|
|
3169 |
private void genNegateOp(JavaKind kind) {
|
|
|
3170 |
ValueNode x = frameState.pop(kind);
|
|
|
3171 |
frameState.push(kind, append(genNegateOp(x)));
|
|
|
3172 |
}
|
|
|
3173 |
|
|
|
3174 |
private void genShiftOp(JavaKind kind, int opcode) {
|
|
|
3175 |
ValueNode s = frameState.pop(JavaKind.Int);
|
|
|
3176 |
ValueNode x = frameState.pop(kind);
|
|
|
3177 |
ValueNode v;
|
|
|
3178 |
switch (opcode) {
|
|
|
3179 |
case ISHL:
|
|
|
3180 |
case LSHL:
|
|
|
3181 |
v = genLeftShift(x, s);
|
|
|
3182 |
break;
|
|
|
3183 |
case ISHR:
|
|
|
3184 |
case LSHR:
|
|
|
3185 |
v = genRightShift(x, s);
|
|
|
3186 |
break;
|
|
|
3187 |
case IUSHR:
|
|
|
3188 |
case LUSHR:
|
|
|
3189 |
v = genUnsignedRightShift(x, s);
|
|
|
3190 |
break;
|
|
|
3191 |
default:
|
|
|
3192 |
throw shouldNotReachHere();
|
|
|
3193 |
}
|
|
46371
|
3194 |
frameState.push(kind, recursiveAppend(v));
|
|
43972
|
3195 |
}
|
|
|
3196 |
|
|
|
3197 |
private void genLogicOp(JavaKind kind, int opcode) {
|
|
|
3198 |
ValueNode y = frameState.pop(kind);
|
|
|
3199 |
ValueNode x = frameState.pop(kind);
|
|
|
3200 |
ValueNode v;
|
|
|
3201 |
switch (opcode) {
|
|
|
3202 |
case IAND:
|
|
|
3203 |
case LAND:
|
|
|
3204 |
v = genAnd(x, y);
|
|
|
3205 |
break;
|
|
|
3206 |
case IOR:
|
|
|
3207 |
case LOR:
|
|
|
3208 |
v = genOr(x, y);
|
|
|
3209 |
break;
|
|
|
3210 |
case IXOR:
|
|
|
3211 |
case LXOR:
|
|
|
3212 |
v = genXor(x, y);
|
|
|
3213 |
break;
|
|
|
3214 |
default:
|
|
|
3215 |
throw shouldNotReachHere();
|
|
|
3216 |
}
|
|
46371
|
3217 |
frameState.push(kind, recursiveAppend(v));
|
|
43972
|
3218 |
}
|
|
|
3219 |
|
|
|
3220 |
private void genCompareOp(JavaKind kind, boolean isUnorderedLess) {
|
|
|
3221 |
ValueNode y = frameState.pop(kind);
|
|
|
3222 |
ValueNode x = frameState.pop(kind);
|
|
|
3223 |
frameState.push(JavaKind.Int, append(genNormalizeCompare(x, y, isUnorderedLess)));
|
|
|
3224 |
}
|
|
|
3225 |
|
|
|
3226 |
private void genFloatConvert(FloatConvert op, JavaKind from, JavaKind to) {
|
|
|
3227 |
ValueNode input = frameState.pop(from);
|
|
|
3228 |
frameState.push(to, append(genFloatConvert(op, input)));
|
|
|
3229 |
}
|
|
|
3230 |
|
|
|
3231 |
private void genSignExtend(JavaKind from, JavaKind to) {
|
|
|
3232 |
ValueNode input = frameState.pop(from);
|
|
|
3233 |
if (from != from.getStackKind()) {
|
|
|
3234 |
input = append(genNarrow(input, from.getBitCount()));
|
|
|
3235 |
}
|
|
46371
|
3236 |
frameState.push(to, recursiveAppend(genSignExtend(input, to.getBitCount())));
|
|
43972
|
3237 |
}
|
|
|
3238 |
|
|
|
3239 |
private void genZeroExtend(JavaKind from, JavaKind to) {
|
|
|
3240 |
ValueNode input = frameState.pop(from);
|
|
|
3241 |
if (from != from.getStackKind()) {
|
|
|
3242 |
input = append(genNarrow(input, from.getBitCount()));
|
|
|
3243 |
}
|
|
|
3244 |
frameState.push(to, append(genZeroExtend(input, to.getBitCount())));
|
|
|
3245 |
}
|
|
|
3246 |
|
|
|
3247 |
private void genNarrow(JavaKind from, JavaKind to) {
|
|
|
3248 |
ValueNode input = frameState.pop(from);
|
|
|
3249 |
frameState.push(to, append(genNarrow(input, to.getBitCount())));
|
|
|
3250 |
}
|
|
|
3251 |
|
|
|
3252 |
private void genIncrement() {
|
|
|
3253 |
int index = getStream().readLocalIndex();
|
|
|
3254 |
int delta = getStream().readIncrement();
|
|
|
3255 |
ValueNode x = frameState.loadLocal(index, JavaKind.Int);
|
|
|
3256 |
ValueNode y = appendConstant(JavaConstant.forInt(delta));
|
|
46371
|
3257 |
frameState.storeLocal(index, JavaKind.Int, recursiveAppend(genIntegerAdd(x, y)));
|
|
43972
|
3258 |
}
|
|
|
3259 |
|
|
|
3260 |
private void genIfZero(Condition cond) {
|
|
|
3261 |
ValueNode y = appendConstant(JavaConstant.INT_0);
|
|
|
3262 |
ValueNode x = frameState.pop(JavaKind.Int);
|
|
|
3263 |
genIf(x, cond, y);
|
|
|
3264 |
}
|
|
|
3265 |
|
|
|
3266 |
private void genIfNull(Condition cond) {
|
|
|
3267 |
ValueNode y = appendConstant(JavaConstant.NULL_POINTER);
|
|
|
3268 |
ValueNode x = frameState.pop(JavaKind.Object);
|
|
|
3269 |
genIf(x, cond, y);
|
|
|
3270 |
}
|
|
|
3271 |
|
|
|
3272 |
private void genIfSame(JavaKind kind, Condition cond) {
|
|
|
3273 |
ValueNode y = frameState.pop(kind);
|
|
|
3274 |
ValueNode x = frameState.pop(kind);
|
|
|
3275 |
genIf(x, cond, y);
|
|
|
3276 |
}
|
|
|
3277 |
|
|
|
3278 |
protected JavaType lookupType(int cpi, int bytecode) {
|
|
|
3279 |
maybeEagerlyResolve(cpi, bytecode);
|
|
|
3280 |
JavaType result = constantPool.lookupType(cpi, bytecode);
|
|
|
3281 |
assert !graphBuilderConfig.unresolvedIsError() || result instanceof ResolvedJavaType;
|
|
|
3282 |
return result;
|
|
|
3283 |
}
|
|
|
3284 |
|
|
|
3285 |
private JavaMethod lookupMethod(int cpi, int opcode) {
|
|
|
3286 |
maybeEagerlyResolve(cpi, opcode);
|
|
|
3287 |
JavaMethod result = constantPool.lookupMethod(cpi, opcode);
|
|
|
3288 |
/*
|
|
|
3289 |
* In general, one cannot assume that the declaring class being initialized is useful, since
|
|
|
3290 |
* the actual concrete receiver may be a different class (except for static calls). Also,
|
|
|
3291 |
* interfaces are initialized only under special circumstances, so that this assertion would
|
|
|
3292 |
* often fail for interface calls.
|
|
|
3293 |
*/
|
|
|
3294 |
assert !graphBuilderConfig.unresolvedIsError() ||
|
|
|
3295 |
(result instanceof ResolvedJavaMethod && (opcode != INVOKESTATIC || ((ResolvedJavaMethod) result).getDeclaringClass().isInitialized())) : result;
|
|
|
3296 |
return result;
|
|
|
3297 |
}
|
|
|
3298 |
|
|
|
3299 |
private JavaField lookupField(int cpi, int opcode) {
|
|
|
3300 |
maybeEagerlyResolve(cpi, opcode);
|
|
|
3301 |
JavaField result = constantPool.lookupField(cpi, method, opcode);
|
|
|
3302 |
if (graphBuilderConfig.eagerResolving()) {
|
|
|
3303 |
assert result instanceof ResolvedJavaField : "Not resolved: " + result;
|
|
|
3304 |
ResolvedJavaType declaringClass = ((ResolvedJavaField) result).getDeclaringClass();
|
|
|
3305 |
if (!declaringClass.isInitialized()) {
|
|
|
3306 |
assert declaringClass.isInterface() : "Declaring class not initialized but not an interface? " + declaringClass;
|
|
|
3307 |
declaringClass.initialize();
|
|
|
3308 |
}
|
|
|
3309 |
}
|
|
|
3310 |
assert !graphBuilderConfig.unresolvedIsError() || (result instanceof ResolvedJavaField && ((ResolvedJavaField) result).getDeclaringClass().isInitialized()) : result;
|
|
|
3311 |
return result;
|
|
|
3312 |
}
|
|
|
3313 |
|
|
|
3314 |
private Object lookupConstant(int cpi, int opcode) {
|
|
|
3315 |
maybeEagerlyResolve(cpi, opcode);
|
|
|
3316 |
Object result = constantPool.lookupConstant(cpi);
|
|
|
3317 |
assert !graphBuilderConfig.eagerResolving() || !(result instanceof JavaType) || (result instanceof ResolvedJavaType) : result;
|
|
|
3318 |
return result;
|
|
|
3319 |
}
|
|
|
3320 |
|
|
|
3321 |
private void maybeEagerlyResolve(int cpi, int bytecode) {
|
|
|
3322 |
if (intrinsicContext != null) {
|
|
|
3323 |
constantPool.loadReferencedType(cpi, bytecode);
|
|
|
3324 |
} else if (graphBuilderConfig.eagerResolving()) {
|
|
|
3325 |
/*
|
|
|
3326 |
* Since we're potentially triggering class initialization here, we need synchronization
|
|
|
3327 |
* to mitigate the potential for class initialization related deadlock being caused by
|
|
|
3328 |
* the compiler (e.g., https://github.com/graalvm/graal-core/pull/232/files#r90788550).
|
|
|
3329 |
*/
|
|
|
3330 |
synchronized (BytecodeParser.class) {
|
|
|
3331 |
constantPool.loadReferencedType(cpi, bytecode);
|
|
|
3332 |
}
|
|
|
3333 |
}
|
|
|
3334 |
}
|
|
|
3335 |
|
|
|
3336 |
private JavaTypeProfile getProfileForTypeCheck(TypeReference type) {
|
|
46344
|
3337 |
if (parsingIntrinsic() || profilingInfo == null || !optimisticOpts.useTypeCheckHints(getOptions()) || type.isExact()) {
|
|
43972
|
3338 |
return null;
|
|
|
3339 |
} else {
|
|
|
3340 |
return profilingInfo.getTypeProfile(bci());
|
|
|
3341 |
}
|
|
|
3342 |
}
|
|
|
3343 |
|
|
|
3344 |
private void genCheckCast() {
|
|
|
3345 |
int cpi = getStream().readCPI();
|
|
|
3346 |
JavaType type = lookupType(cpi, CHECKCAST);
|
|
|
3347 |
ValueNode object = frameState.pop(JavaKind.Object);
|
|
|
3348 |
|
|
|
3349 |
if (!(type instanceof ResolvedJavaType)) {
|
|
|
3350 |
handleUnresolvedCheckCast(type, object);
|
|
|
3351 |
return;
|
|
|
3352 |
}
|
|
|
3353 |
TypeReference checkedType = TypeReference.createTrusted(graph.getAssumptions(), (ResolvedJavaType) type);
|
|
|
3354 |
JavaTypeProfile profile = getProfileForTypeCheck(checkedType);
|
|
|
3355 |
|
|
|
3356 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3357 |
if (plugin.handleCheckCast(this, object, checkedType.getType(), profile)) {
|
|
|
3358 |
return;
|
|
|
3359 |
}
|
|
|
3360 |
}
|
|
|
3361 |
|
|
|
3362 |
ValueNode castNode = null;
|
|
|
3363 |
if (profile != null) {
|
|
|
3364 |
if (profile.getNullSeen().isFalse()) {
|
|
46344
|
3365 |
object = nullCheckedValue(object);
|
|
43972
|
3366 |
ResolvedJavaType singleType = profile.asSingleType();
|
|
|
3367 |
if (singleType != null && checkedType.getType().isAssignableFrom(singleType)) {
|
|
|
3368 |
LogicNode typeCheck = append(createInstanceOf(TypeReference.createExactTrusted(singleType), object, profile));
|
|
|
3369 |
if (typeCheck.isTautology()) {
|
|
|
3370 |
castNode = object;
|
|
|
3371 |
} else {
|
|
|
3372 |
FixedGuardNode fixedGuard = append(new FixedGuardNode(typeCheck, DeoptimizationReason.TypeCheckedInliningViolated, DeoptimizationAction.InvalidateReprofile, false));
|
|
46371
|
3373 |
castNode = append(PiNode.create(object, StampFactory.objectNonNull(TypeReference.createExactTrusted(singleType)), fixedGuard));
|
|
43972
|
3374 |
}
|
|
|
3375 |
}
|
|
|
3376 |
}
|
|
|
3377 |
}
|
|
46344
|
3378 |
|
|
|
3379 |
boolean nonNull = ((ObjectStamp) object.stamp()).nonNull();
|
|
43972
|
3380 |
if (castNode == null) {
|
|
|
3381 |
LogicNode condition = genUnique(createInstanceOfAllowNull(checkedType, object, null));
|
|
|
3382 |
if (condition.isTautology()) {
|
|
|
3383 |
castNode = object;
|
|
|
3384 |
} else {
|
|
|
3385 |
FixedGuardNode fixedGuard = append(new FixedGuardNode(condition, DeoptimizationReason.ClassCastException, DeoptimizationAction.InvalidateReprofile, false));
|
|
46371
|
3386 |
castNode = append(PiNode.create(object, StampFactory.object(checkedType, nonNull), fixedGuard));
|
|
43972
|
3387 |
}
|
|
|
3388 |
}
|
|
|
3389 |
frameState.push(JavaKind.Object, castNode);
|
|
|
3390 |
}
|
|
|
3391 |
|
|
|
3392 |
private void genInstanceOf() {
|
|
|
3393 |
int cpi = getStream().readCPI();
|
|
|
3394 |
JavaType type = lookupType(cpi, INSTANCEOF);
|
|
|
3395 |
ValueNode object = frameState.pop(JavaKind.Object);
|
|
|
3396 |
|
|
|
3397 |
if (!(type instanceof ResolvedJavaType)) {
|
|
|
3398 |
handleUnresolvedInstanceOf(type, object);
|
|
|
3399 |
return;
|
|
|
3400 |
}
|
|
|
3401 |
TypeReference resolvedType = TypeReference.createTrusted(graph.getAssumptions(), (ResolvedJavaType) type);
|
|
|
3402 |
JavaTypeProfile profile = getProfileForTypeCheck(resolvedType);
|
|
|
3403 |
|
|
|
3404 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3405 |
if (plugin.handleInstanceOf(this, object, resolvedType.getType(), profile)) {
|
|
|
3406 |
return;
|
|
|
3407 |
}
|
|
|
3408 |
}
|
|
|
3409 |
|
|
|
3410 |
LogicNode instanceOfNode = null;
|
|
|
3411 |
if (profile != null) {
|
|
|
3412 |
if (profile.getNullSeen().isFalse()) {
|
|
46344
|
3413 |
object = nullCheckedValue(object);
|
|
43972
|
3414 |
ResolvedJavaType singleType = profile.asSingleType();
|
|
|
3415 |
if (singleType != null) {
|
|
|
3416 |
LogicNode typeCheck = append(createInstanceOf(TypeReference.createExactTrusted(singleType), object, profile));
|
|
|
3417 |
if (!typeCheck.isTautology()) {
|
|
|
3418 |
append(new FixedGuardNode(typeCheck, DeoptimizationReason.TypeCheckedInliningViolated, DeoptimizationAction.InvalidateReprofile));
|
|
|
3419 |
}
|
|
|
3420 |
instanceOfNode = LogicConstantNode.forBoolean(resolvedType.getType().isAssignableFrom(singleType));
|
|
|
3421 |
}
|
|
|
3422 |
}
|
|
|
3423 |
}
|
|
|
3424 |
if (instanceOfNode == null) {
|
|
|
3425 |
instanceOfNode = createInstanceOf(resolvedType, object, null);
|
|
|
3426 |
}
|
|
46344
|
3427 |
LogicNode logicNode = genUnique(instanceOfNode);
|
|
|
3428 |
|
|
|
3429 |
int next = getStream().nextBCI();
|
|
|
3430 |
int value = getStream().readUByte(next);
|
|
46371
|
3431 |
if (next <= currentBlock.endBci && (value == Bytecodes.IFEQ || value == Bytecodes.IFNE)) {
|
|
46344
|
3432 |
getStream().next();
|
|
|
3433 |
BciBlock firstSucc = currentBlock.getSuccessor(0);
|
|
|
3434 |
BciBlock secondSucc = currentBlock.getSuccessor(1);
|
|
|
3435 |
if (firstSucc != secondSucc) {
|
|
|
3436 |
genIf(instanceOfNode, value != Bytecodes.IFNE, firstSucc, secondSucc);
|
|
|
3437 |
} else {
|
|
|
3438 |
appendGoto(firstSucc);
|
|
|
3439 |
}
|
|
|
3440 |
} else {
|
|
|
3441 |
// Most frequent for value is IRETURN, followed by ISTORE.
|
|
|
3442 |
frameState.push(JavaKind.Int, append(genConditional(logicNode)));
|
|
|
3443 |
}
|
|
43972
|
3444 |
}
|
|
|
3445 |
|
|
|
3446 |
void genNewInstance(int cpi) {
|
|
|
3447 |
JavaType type = lookupType(cpi, NEW);
|
|
|
3448 |
|
|
|
3449 |
if (!(type instanceof ResolvedJavaType) || !((ResolvedJavaType) type).isInitialized()) {
|
|
|
3450 |
handleUnresolvedNewInstance(type);
|
|
|
3451 |
return;
|
|
|
3452 |
}
|
|
|
3453 |
ResolvedJavaType resolvedType = (ResolvedJavaType) type;
|
|
|
3454 |
|
|
|
3455 |
ResolvedJavaType[] skippedExceptionTypes = this.graphBuilderConfig.getSkippedExceptionTypes();
|
|
|
3456 |
if (skippedExceptionTypes != null) {
|
|
|
3457 |
for (ResolvedJavaType exceptionType : skippedExceptionTypes) {
|
|
|
3458 |
if (exceptionType.isAssignableFrom(resolvedType)) {
|
|
|
3459 |
append(new DeoptimizeNode(DeoptimizationAction.InvalidateRecompile, RuntimeConstraint));
|
|
|
3460 |
return;
|
|
|
3461 |
}
|
|
|
3462 |
}
|
|
|
3463 |
}
|
|
|
3464 |
|
|
|
3465 |
ClassInitializationPlugin classInitializationPlugin = graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
3466 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedType)) {
|
|
|
3467 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
3468 |
classInitializationPlugin.apply(this, resolvedType, stateBefore);
|
|
|
3469 |
}
|
|
|
3470 |
|
|
|
3471 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3472 |
if (plugin.handleNewInstance(this, resolvedType)) {
|
|
|
3473 |
return;
|
|
|
3474 |
}
|
|
|
3475 |
}
|
|
|
3476 |
|
|
|
3477 |
frameState.push(JavaKind.Object, append(createNewInstance(resolvedType, true)));
|
|
|
3478 |
}
|
|
|
3479 |
|
|
|
3480 |
/**
|
|
|
3481 |
* Gets the kind of array elements for the array type code that appears in a
|
|
|
3482 |
* {@link Bytecodes#NEWARRAY} bytecode.
|
|
|
3483 |
*
|
|
|
3484 |
* @param code the array type code
|
|
|
3485 |
* @return the kind from the array type code
|
|
|
3486 |
*/
|
|
|
3487 |
private static Class<?> arrayTypeCodeToClass(int code) {
|
|
|
3488 |
switch (code) {
|
|
|
3489 |
case 4:
|
|
|
3490 |
return boolean.class;
|
|
|
3491 |
case 5:
|
|
|
3492 |
return char.class;
|
|
|
3493 |
case 6:
|
|
|
3494 |
return float.class;
|
|
|
3495 |
case 7:
|
|
|
3496 |
return double.class;
|
|
|
3497 |
case 8:
|
|
|
3498 |
return byte.class;
|
|
|
3499 |
case 9:
|
|
|
3500 |
return short.class;
|
|
|
3501 |
case 10:
|
|
|
3502 |
return int.class;
|
|
|
3503 |
case 11:
|
|
|
3504 |
return long.class;
|
|
|
3505 |
default:
|
|
|
3506 |
throw new IllegalArgumentException("unknown array type code: " + code);
|
|
|
3507 |
}
|
|
|
3508 |
}
|
|
|
3509 |
|
|
|
3510 |
private void genNewPrimitiveArray(int typeCode) {
|
|
|
3511 |
ResolvedJavaType elementType = metaAccess.lookupJavaType(arrayTypeCodeToClass(typeCode));
|
|
|
3512 |
ValueNode length = frameState.pop(JavaKind.Int);
|
|
|
3513 |
|
|
|
3514 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3515 |
if (plugin.handleNewArray(this, elementType, length)) {
|
|
|
3516 |
return;
|
|
|
3517 |
}
|
|
|
3518 |
}
|
|
|
3519 |
|
|
|
3520 |
frameState.push(JavaKind.Object, append(createNewArray(elementType, length, true)));
|
|
|
3521 |
}
|
|
|
3522 |
|
|
|
3523 |
private void genNewObjectArray(int cpi) {
|
|
|
3524 |
JavaType type = lookupType(cpi, ANEWARRAY);
|
|
|
3525 |
|
|
|
3526 |
if (!(type instanceof ResolvedJavaType)) {
|
|
|
3527 |
ValueNode length = frameState.pop(JavaKind.Int);
|
|
|
3528 |
handleUnresolvedNewObjectArray(type, length);
|
|
|
3529 |
return;
|
|
|
3530 |
}
|
|
|
3531 |
|
|
|
3532 |
ResolvedJavaType resolvedType = (ResolvedJavaType) type;
|
|
|
3533 |
|
|
|
3534 |
ClassInitializationPlugin classInitializationPlugin = this.graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
3535 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedType.getArrayClass())) {
|
|
|
3536 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
3537 |
classInitializationPlugin.apply(this, resolvedType.getArrayClass(), stateBefore);
|
|
|
3538 |
}
|
|
|
3539 |
|
|
|
3540 |
ValueNode length = frameState.pop(JavaKind.Int);
|
|
|
3541 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3542 |
if (plugin.handleNewArray(this, resolvedType, length)) {
|
|
|
3543 |
return;
|
|
|
3544 |
}
|
|
|
3545 |
}
|
|
|
3546 |
|
|
|
3547 |
frameState.push(JavaKind.Object, append(createNewArray(resolvedType, length, true)));
|
|
|
3548 |
}
|
|
|
3549 |
|
|
|
3550 |
private void genNewMultiArray(int cpi) {
|
|
|
3551 |
JavaType type = lookupType(cpi, MULTIANEWARRAY);
|
|
|
3552 |
int rank = getStream().readUByte(bci() + 3);
|
|
|
3553 |
ValueNode[] dims = new ValueNode[rank];
|
|
|
3554 |
|
|
|
3555 |
if (!(type instanceof ResolvedJavaType)) {
|
|
|
3556 |
for (int i = rank - 1; i >= 0; i--) {
|
|
|
3557 |
dims[i] = frameState.pop(JavaKind.Int);
|
|
|
3558 |
}
|
|
|
3559 |
handleUnresolvedNewMultiArray(type, dims);
|
|
|
3560 |
return;
|
|
|
3561 |
}
|
|
|
3562 |
ResolvedJavaType resolvedType = (ResolvedJavaType) type;
|
|
|
3563 |
|
|
|
3564 |
ClassInitializationPlugin classInitializationPlugin = this.graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
3565 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedType.getArrayClass())) {
|
|
|
3566 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
3567 |
classInitializationPlugin.apply(this, resolvedType.getArrayClass(), stateBefore);
|
|
|
3568 |
}
|
|
|
3569 |
|
|
|
3570 |
for (int i = rank - 1; i >= 0; i--) {
|
|
|
3571 |
dims[i] = frameState.pop(JavaKind.Int);
|
|
|
3572 |
}
|
|
|
3573 |
|
|
|
3574 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3575 |
if (plugin.handleNewMultiArray(this, resolvedType, dims)) {
|
|
|
3576 |
return;
|
|
|
3577 |
}
|
|
|
3578 |
}
|
|
|
3579 |
|
|
|
3580 |
frameState.push(JavaKind.Object, append(createNewMultiArray(resolvedType, dims)));
|
|
|
3581 |
}
|
|
|
3582 |
|
|
|
3583 |
private void genGetField(JavaField field) {
|
|
46344
|
3584 |
genGetField(field, frameState.pop(JavaKind.Object));
|
|
|
3585 |
}
|
|
|
3586 |
|
|
|
3587 |
private void genGetField(JavaField field, ValueNode receiverInput) {
|
|
|
3588 |
ValueNode receiver = emitExplicitExceptions(receiverInput);
|
|
|
3589 |
if (field instanceof ResolvedJavaField) {
|
|
|
3590 |
ResolvedJavaField resolvedField = (ResolvedJavaField) field;
|
|
|
3591 |
genGetField(resolvedField, receiver);
|
|
|
3592 |
} else {
|
|
43972
|
3593 |
handleUnresolvedLoadField(field, receiver);
|
|
|
3594 |
}
|
|
46344
|
3595 |
}
|
|
|
3596 |
|
|
|
3597 |
private void genGetField(ResolvedJavaField resolvedField, ValueNode receiver) {
|
|
|
3598 |
if (!parsingIntrinsic() && GeneratePIC.getValue(getOptions())) {
|
|
43972
|
3599 |
graph.recordField(resolvedField);
|
|
|
3600 |
}
|
|
|
3601 |
|
|
|
3602 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3603 |
if (plugin.handleLoadField(this, receiver, resolvedField)) {
|
|
|
3604 |
return;
|
|
|
3605 |
}
|
|
|
3606 |
}
|
|
|
3607 |
|
|
46344
|
3608 |
frameState.push(resolvedField.getJavaKind(), append(genLoadField(receiver, resolvedField)));
|
|
|
3609 |
if (resolvedField.getDeclaringClass().getName().equals("Ljava/lang/ref/Reference;") && resolvedField.getName().equals("referent")) {
|
|
43972
|
3610 |
LocationIdentity referentIdentity = new FieldLocationIdentity(resolvedField);
|
|
|
3611 |
append(new MembarNode(0, referentIdentity));
|
|
|
3612 |
}
|
|
|
3613 |
}
|
|
|
3614 |
|
|
|
3615 |
/**
|
|
|
3616 |
* @param receiver the receiver of an object based operation
|
|
|
3617 |
* @param index the index of an array based operation that is to be tested for out of bounds.
|
|
|
3618 |
* This is null for a non-array operation.
|
|
46344
|
3619 |
* @return the receiver value possibly modified to have a non-null stamp
|
|
43972
|
3620 |
*/
|
|
|
3621 |
protected ValueNode emitExplicitExceptions(ValueNode receiver, ValueNode index) {
|
|
46344
|
3622 |
if (needsExplicitException()) {
|
|
|
3623 |
ValueNode nonNullReceiver = emitExplicitNullCheck(receiver);
|
|
43972
|
3624 |
ValueNode length = append(genArrayLength(nonNullReceiver));
|
|
|
3625 |
emitExplicitBoundsCheck(index, length);
|
|
46344
|
3626 |
return nonNullReceiver;
|
|
43972
|
3627 |
}
|
|
46344
|
3628 |
return receiver;
|
|
|
3629 |
}
|
|
|
3630 |
|
|
|
3631 |
protected ValueNode emitExplicitExceptions(ValueNode receiver) {
|
|
|
3632 |
if (StampTool.isPointerNonNull(receiver) || !needsExplicitException()) {
|
|
|
3633 |
return receiver;
|
|
|
3634 |
} else {
|
|
|
3635 |
return emitExplicitNullCheck(receiver);
|
|
|
3636 |
}
|
|
|
3637 |
}
|
|
|
3638 |
|
|
|
3639 |
private boolean needsExplicitException() {
|
|
|
3640 |
BytecodeExceptionMode exceptionMode = graphBuilderConfig.getBytecodeExceptionMode();
|
|
|
3641 |
if (exceptionMode == BytecodeExceptionMode.CheckAll || StressExplicitExceptionCode.getValue(options)) {
|
|
|
3642 |
return true;
|
|
|
3643 |
} else if (exceptionMode == BytecodeExceptionMode.Profile && profilingInfo != null) {
|
|
|
3644 |
return profilingInfo.getExceptionSeen(bci()) == TriState.TRUE;
|
|
|
3645 |
}
|
|
|
3646 |
return false;
|
|
43972
|
3647 |
}
|
|
|
3648 |
|
|
|
3649 |
private void genPutField(JavaField field) {
|
|
46344
|
3650 |
genPutField(field, frameState.pop(field.getJavaKind()));
|
|
|
3651 |
}
|
|
|
3652 |
|
|
|
3653 |
private void genPutField(JavaField field, ValueNode value) {
|
|
|
3654 |
ValueNode receiver = emitExplicitExceptions(frameState.pop(JavaKind.Object));
|
|
|
3655 |
if (field instanceof ResolvedJavaField) {
|
|
|
3656 |
ResolvedJavaField resolvedField = (ResolvedJavaField) field;
|
|
|
3657 |
|
|
|
3658 |
if (!parsingIntrinsic() && GeneratePIC.getValue(getOptions())) {
|
|
|
3659 |
graph.recordField(resolvedField);
|
|
|
3660 |
}
|
|
|
3661 |
|
|
|
3662 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3663 |
if (plugin.handleStoreField(this, receiver, resolvedField, value)) {
|
|
|
3664 |
return;
|
|
|
3665 |
}
|
|
|
3666 |
}
|
|
|
3667 |
|
|
|
3668 |
if (resolvedField.isFinal() && method.isConstructor()) {
|
|
|
3669 |
finalBarrierRequired = true;
|
|
|
3670 |
}
|
|
|
3671 |
genStoreField(receiver, resolvedField, value);
|
|
|
3672 |
} else {
|
|
43972
|
3673 |
handleUnresolvedStoreField(field, value, receiver);
|
|
|
3674 |
}
|
|
|
3675 |
}
|
|
|
3676 |
|
|
|
3677 |
private void genGetStatic(JavaField field) {
|
|
46371
|
3678 |
ResolvedJavaField resolvedField = resolveStaticFieldAccess(field, null);
|
|
|
3679 |
if (resolvedField == null) {
|
|
43972
|
3680 |
return;
|
|
|
3681 |
}
|
|
|
3682 |
|
|
46344
|
3683 |
if (!parsingIntrinsic() && GeneratePIC.getValue(getOptions())) {
|
|
43972
|
3684 |
graph.recordField(resolvedField);
|
|
|
3685 |
}
|
|
|
3686 |
|
|
|
3687 |
/*
|
|
|
3688 |
* Javac does not allow use of "$assertionsDisabled" for a field name but Eclipse does, in
|
|
|
3689 |
* which case a suffix is added to the generated field.
|
|
|
3690 |
*/
|
|
|
3691 |
if ((parsingIntrinsic() || graphBuilderConfig.omitAssertions()) && resolvedField.isSynthetic() && resolvedField.getName().startsWith("$assertionsDisabled")) {
|
|
|
3692 |
frameState.push(field.getJavaKind(), ConstantNode.forBoolean(true, graph));
|
|
|
3693 |
return;
|
|
|
3694 |
}
|
|
|
3695 |
|
|
|
3696 |
ClassInitializationPlugin classInitializationPlugin = this.graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
3697 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedField.getDeclaringClass())) {
|
|
|
3698 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
3699 |
classInitializationPlugin.apply(this, resolvedField.getDeclaringClass(), stateBefore);
|
|
|
3700 |
}
|
|
|
3701 |
|
|
|
3702 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3703 |
if (plugin.handleLoadStaticField(this, resolvedField)) {
|
|
|
3704 |
return;
|
|
|
3705 |
}
|
|
|
3706 |
}
|
|
|
3707 |
|
|
|
3708 |
frameState.push(field.getJavaKind(), append(genLoadField(null, resolvedField)));
|
|
|
3709 |
}
|
|
|
3710 |
|
|
46371
|
3711 |
private ResolvedJavaField resolveStaticFieldAccess(JavaField field, ValueNode value) {
|
|
|
3712 |
if (field instanceof ResolvedJavaField) {
|
|
|
3713 |
ResolvedJavaField resolvedField = (ResolvedJavaField) field;
|
|
|
3714 |
if (resolvedField.getDeclaringClass().isInitialized()) {
|
|
|
3715 |
return resolvedField;
|
|
|
3716 |
}
|
|
|
3717 |
/*
|
|
|
3718 |
* Static fields have initialization semantics but may be safely accessed under certain
|
|
|
3719 |
* conditions while the class is being initialized. Executing in the clinit or init of
|
|
|
3720 |
* classes which are subtypes of the field holder are sure to be running in a context
|
|
|
3721 |
* where the access is safe.
|
|
|
3722 |
*/
|
|
|
3723 |
if (resolvedField.getDeclaringClass().isAssignableFrom(method.getDeclaringClass())) {
|
|
|
3724 |
if (method.isClassInitializer() || method.isConstructor()) {
|
|
|
3725 |
return resolvedField;
|
|
|
3726 |
}
|
|
|
3727 |
}
|
|
|
3728 |
}
|
|
|
3729 |
if (value == null) {
|
|
|
3730 |
handleUnresolvedLoadField(field, null);
|
|
|
3731 |
} else {
|
|
|
3732 |
handleUnresolvedStoreField(field, value, null);
|
|
|
3733 |
|
|
|
3734 |
}
|
|
|
3735 |
return null;
|
|
|
3736 |
}
|
|
|
3737 |
|
|
43972
|
3738 |
private void genPutStatic(JavaField field) {
|
|
|
3739 |
ValueNode value = frameState.pop(field.getJavaKind());
|
|
46371
|
3740 |
ResolvedJavaField resolvedField = resolveStaticFieldAccess(field, value);
|
|
|
3741 |
if (resolvedField == null) {
|
|
43972
|
3742 |
return;
|
|
|
3743 |
}
|
|
|
3744 |
|
|
46344
|
3745 |
if (!parsingIntrinsic() && GeneratePIC.getValue(getOptions())) {
|
|
43972
|
3746 |
graph.recordField(resolvedField);
|
|
|
3747 |
}
|
|
|
3748 |
|
|
|
3749 |
ClassInitializationPlugin classInitializationPlugin = this.graphBuilderConfig.getPlugins().getClassInitializationPlugin();
|
|
|
3750 |
if (classInitializationPlugin != null && classInitializationPlugin.shouldApply(this, resolvedField.getDeclaringClass())) {
|
|
|
3751 |
FrameState stateBefore = frameState.create(bci(), getNonIntrinsicAncestor(), false, null, null);
|
|
|
3752 |
classInitializationPlugin.apply(this, resolvedField.getDeclaringClass(), stateBefore);
|
|
|
3753 |
}
|
|
|
3754 |
|
|
|
3755 |
for (NodePlugin plugin : graphBuilderConfig.getPlugins().getNodePlugins()) {
|
|
|
3756 |
if (plugin.handleStoreStaticField(this, resolvedField, value)) {
|
|
|
3757 |
return;
|
|
|
3758 |
}
|
|
|
3759 |
}
|
|
|
3760 |
|
|
|
3761 |
genStoreField(null, resolvedField, value);
|
|
|
3762 |
}
|
|
|
3763 |
|
|
|
3764 |
private double[] switchProbability(int numberOfCases, int bci) {
|
|
|
3765 |
double[] prob = (profilingInfo == null ? null : profilingInfo.getSwitchProbabilities(bci));
|
|
|
3766 |
if (prob != null) {
|
|
|
3767 |
assert prob.length == numberOfCases;
|
|
|
3768 |
} else {
|
|
|
3769 |
Debug.log("Missing probability (switch) in %s at bci %d", method, bci);
|
|
|
3770 |
prob = new double[numberOfCases];
|
|
|
3771 |
for (int i = 0; i < numberOfCases; i++) {
|
|
|
3772 |
prob[i] = 1.0d / numberOfCases;
|
|
|
3773 |
}
|
|
|
3774 |
}
|
|
|
3775 |
assert allPositive(prob);
|
|
|
3776 |
return prob;
|
|
|
3777 |
}
|
|
|
3778 |
|
|
|
3779 |
private static boolean allPositive(double[] a) {
|
|
|
3780 |
for (double d : a) {
|
|
|
3781 |
if (d < 0) {
|
|
|
3782 |
return false;
|
|
|
3783 |
}
|
|
|
3784 |
}
|
|
|
3785 |
return true;
|
|
|
3786 |
}
|
|
|
3787 |
|
|
|
3788 |
static class SuccessorInfo {
|
|
|
3789 |
final int blockIndex;
|
|
|
3790 |
int actualIndex;
|
|
|
3791 |
|
|
|
3792 |
SuccessorInfo(int blockSuccessorIndex) {
|
|
|
3793 |
this.blockIndex = blockSuccessorIndex;
|
|
|
3794 |
actualIndex = -1;
|
|
|
3795 |
}
|
|
|
3796 |
}
|
|
|
3797 |
|
|
|
3798 |
private void genSwitch(BytecodeSwitch bs) {
|
|
|
3799 |
int bci = bci();
|
|
|
3800 |
ValueNode value = frameState.pop(JavaKind.Int);
|
|
|
3801 |
|
|
|
3802 |
int nofCases = bs.numberOfCases();
|
|
|
3803 |
double[] keyProbabilities = switchProbability(nofCases + 1, bci);
|
|
|
3804 |
|
|
46344
|
3805 |
EconomicMap<Integer, SuccessorInfo> bciToBlockSuccessorIndex = EconomicMap.create(Equivalence.DEFAULT);
|
|
43972
|
3806 |
for (int i = 0; i < currentBlock.getSuccessorCount(); i++) {
|
|
|
3807 |
assert !bciToBlockSuccessorIndex.containsKey(currentBlock.getSuccessor(i).startBci);
|
|
46344
|
3808 |
bciToBlockSuccessorIndex.put(currentBlock.getSuccessor(i).startBci, new SuccessorInfo(i));
|
|
43972
|
3809 |
}
|
|
|
3810 |
|
|
|
3811 |
ArrayList<BciBlock> actualSuccessors = new ArrayList<>();
|
|
|
3812 |
int[] keys = new int[nofCases];
|
|
|
3813 |
int[] keySuccessors = new int[nofCases + 1];
|
|
|
3814 |
int deoptSuccessorIndex = -1;
|
|
|
3815 |
int nextSuccessorIndex = 0;
|
|
|
3816 |
boolean constantValue = value.isConstant();
|
|
|
3817 |
for (int i = 0; i < nofCases + 1; i++) {
|
|
|
3818 |
if (i < nofCases) {
|
|
|
3819 |
keys[i] = bs.keyAt(i);
|
|
|
3820 |
}
|
|
|
3821 |
|
|
|
3822 |
if (!constantValue && isNeverExecutedCode(keyProbabilities[i])) {
|
|
|
3823 |
if (deoptSuccessorIndex < 0) {
|
|
|
3824 |
deoptSuccessorIndex = nextSuccessorIndex++;
|
|
|
3825 |
actualSuccessors.add(null);
|
|
|
3826 |
}
|
|
|
3827 |
keySuccessors[i] = deoptSuccessorIndex;
|
|
|
3828 |
} else {
|
|
|
3829 |
int targetBci = i >= nofCases ? bs.defaultTarget() : bs.targetAt(i);
|
|
|
3830 |
SuccessorInfo info = bciToBlockSuccessorIndex.get(targetBci);
|
|
|
3831 |
if (info.actualIndex < 0) {
|
|
|
3832 |
info.actualIndex = nextSuccessorIndex++;
|
|
|
3833 |
actualSuccessors.add(currentBlock.getSuccessor(info.blockIndex));
|
|
|
3834 |
}
|
|
|
3835 |
keySuccessors[i] = info.actualIndex;
|
|
|
3836 |
}
|
|
|
3837 |
}
|
|
|
3838 |
|
|
|
3839 |
genIntegerSwitch(value, actualSuccessors, keys, keyProbabilities, keySuccessors);
|
|
|
3840 |
|
|
|
3841 |
}
|
|
|
3842 |
|
|
|
3843 |
protected boolean isNeverExecutedCode(double probability) {
|
|
46344
|
3844 |
return probability == 0 && optimisticOpts.removeNeverExecutedCode(getOptions());
|
|
43972
|
3845 |
}
|
|
|
3846 |
|
|
|
3847 |
protected double branchProbability() {
|
|
|
3848 |
if (profilingInfo == null) {
|
|
|
3849 |
return 0.5;
|
|
|
3850 |
}
|
|
|
3851 |
assert assertAtIfBytecode();
|
|
|
3852 |
double probability = profilingInfo.getBranchTakenProbability(bci());
|
|
|
3853 |
if (probability < 0) {
|
|
|
3854 |
assert probability == -1 : "invalid probability";
|
|
|
3855 |
Debug.log("missing probability in %s at bci %d", code, bci());
|
|
|
3856 |
probability = 0.5;
|
|
|
3857 |
}
|
|
|
3858 |
|
|
46344
|
3859 |
if (!optimisticOpts.removeNeverExecutedCode(getOptions())) {
|
|
43972
|
3860 |
if (probability == 0) {
|
|
|
3861 |
probability = 0.0000001;
|
|
|
3862 |
} else if (probability == 1) {
|
|
|
3863 |
probability = 0.999999;
|
|
|
3864 |
}
|
|
|
3865 |
}
|
|
|
3866 |
return probability;
|
|
|
3867 |
}
|
|
|
3868 |
|
|
|
3869 |
private boolean assertAtIfBytecode() {
|
|
|
3870 |
int bytecode = stream.currentBC();
|
|
|
3871 |
switch (bytecode) {
|
|
|
3872 |
case IFEQ:
|
|
|
3873 |
case IFNE:
|
|
|
3874 |
case IFLT:
|
|
|
3875 |
case IFGE:
|
|
|
3876 |
case IFGT:
|
|
|
3877 |
case IFLE:
|
|
|
3878 |
case IF_ICMPEQ:
|
|
|
3879 |
case IF_ICMPNE:
|
|
|
3880 |
case IF_ICMPLT:
|
|
|
3881 |
case IF_ICMPGE:
|
|
|
3882 |
case IF_ICMPGT:
|
|
|
3883 |
case IF_ICMPLE:
|
|
|
3884 |
case IF_ACMPEQ:
|
|
|
3885 |
case IF_ACMPNE:
|
|
|
3886 |
case IFNULL:
|
|
|
3887 |
case IFNONNULL:
|
|
|
3888 |
return true;
|
|
|
3889 |
}
|
|
|
3890 |
assert false : String.format("%x is not an if bytecode", bytecode);
|
|
|
3891 |
return true;
|
|
|
3892 |
}
|
|
|
3893 |
|
|
|
3894 |
public final void processBytecode(int bci, int opcode) {
|
|
|
3895 |
int cpi;
|
|
|
3896 |
|
|
|
3897 |
// @formatter:off
|
|
|
3898 |
// Checkstyle: stop
|
|
|
3899 |
switch (opcode) {
|
|
|
3900 |
case NOP : /* nothing to do */ break;
|
|
|
3901 |
case ACONST_NULL : frameState.push(JavaKind.Object, appendConstant(JavaConstant.NULL_POINTER)); break;
|
|
|
3902 |
case ICONST_M1 : // fall through
|
|
|
3903 |
case ICONST_0 : // fall through
|
|
|
3904 |
case ICONST_1 : // fall through
|
|
|
3905 |
case ICONST_2 : // fall through
|
|
|
3906 |
case ICONST_3 : // fall through
|
|
|
3907 |
case ICONST_4 : // fall through
|
|
|
3908 |
case ICONST_5 : frameState.push(JavaKind.Int, appendConstant(JavaConstant.forInt(opcode - ICONST_0))); break;
|
|
|
3909 |
case LCONST_0 : // fall through
|
|
|
3910 |
case LCONST_1 : frameState.push(JavaKind.Long, appendConstant(JavaConstant.forLong(opcode - LCONST_0))); break;
|
|
|
3911 |
case FCONST_0 : // fall through
|
|
|
3912 |
case FCONST_1 : // fall through
|
|
|
3913 |
case FCONST_2 : frameState.push(JavaKind.Float, appendConstant(JavaConstant.forFloat(opcode - FCONST_0))); break;
|
|
|
3914 |
case DCONST_0 : // fall through
|
|
|
3915 |
case DCONST_1 : frameState.push(JavaKind.Double, appendConstant(JavaConstant.forDouble(opcode - DCONST_0))); break;
|
|
|
3916 |
case BIPUSH : frameState.push(JavaKind.Int, appendConstant(JavaConstant.forInt(stream.readByte()))); break;
|
|
|
3917 |
case SIPUSH : frameState.push(JavaKind.Int, appendConstant(JavaConstant.forInt(stream.readShort()))); break;
|
|
|
3918 |
case LDC : // fall through
|
|
|
3919 |
case LDC_W : // fall through
|
|
|
3920 |
case LDC2_W : genLoadConstant(stream.readCPI(), opcode); break;
|
|
|
3921 |
case ILOAD : loadLocal(stream.readLocalIndex(), JavaKind.Int); break;
|
|
|
3922 |
case LLOAD : loadLocal(stream.readLocalIndex(), JavaKind.Long); break;
|
|
|
3923 |
case FLOAD : loadLocal(stream.readLocalIndex(), JavaKind.Float); break;
|
|
|
3924 |
case DLOAD : loadLocal(stream.readLocalIndex(), JavaKind.Double); break;
|
|
46344
|
3925 |
case ALOAD : loadLocalObject(stream.readLocalIndex()); break;
|
|
43972
|
3926 |
case ILOAD_0 : // fall through
|
|
|
3927 |
case ILOAD_1 : // fall through
|
|
|
3928 |
case ILOAD_2 : // fall through
|
|
|
3929 |
case ILOAD_3 : loadLocal(opcode - ILOAD_0, JavaKind.Int); break;
|
|
|
3930 |
case LLOAD_0 : // fall through
|
|
|
3931 |
case LLOAD_1 : // fall through
|
|
|
3932 |
case LLOAD_2 : // fall through
|
|
|
3933 |
case LLOAD_3 : loadLocal(opcode - LLOAD_0, JavaKind.Long); break;
|
|
|
3934 |
case FLOAD_0 : // fall through
|
|
|
3935 |
case FLOAD_1 : // fall through
|
|
|
3936 |
case FLOAD_2 : // fall through
|
|
|
3937 |
case FLOAD_3 : loadLocal(opcode - FLOAD_0, JavaKind.Float); break;
|
|
|
3938 |
case DLOAD_0 : // fall through
|
|
|
3939 |
case DLOAD_1 : // fall through
|
|
|
3940 |
case DLOAD_2 : // fall through
|
|
|
3941 |
case DLOAD_3 : loadLocal(opcode - DLOAD_0, JavaKind.Double); break;
|
|
|
3942 |
case ALOAD_0 : // fall through
|
|
|
3943 |
case ALOAD_1 : // fall through
|
|
|
3944 |
case ALOAD_2 : // fall through
|
|
46344
|
3945 |
case ALOAD_3 : loadLocalObject(opcode - ALOAD_0); break;
|
|
43972
|
3946 |
case IALOAD : genLoadIndexed(JavaKind.Int ); break;
|
|
|
3947 |
case LALOAD : genLoadIndexed(JavaKind.Long ); break;
|
|
|
3948 |
case FALOAD : genLoadIndexed(JavaKind.Float ); break;
|
|
|
3949 |
case DALOAD : genLoadIndexed(JavaKind.Double); break;
|
|
|
3950 |
case AALOAD : genLoadIndexed(JavaKind.Object); break;
|
|
|
3951 |
case BALOAD : genLoadIndexed(JavaKind.Byte ); break;
|
|
|
3952 |
case CALOAD : genLoadIndexed(JavaKind.Char ); break;
|
|
|
3953 |
case SALOAD : genLoadIndexed(JavaKind.Short ); break;
|
|
|
3954 |
case ISTORE : storeLocal(JavaKind.Int, stream.readLocalIndex()); break;
|
|
|
3955 |
case LSTORE : storeLocal(JavaKind.Long, stream.readLocalIndex()); break;
|
|
|
3956 |
case FSTORE : storeLocal(JavaKind.Float, stream.readLocalIndex()); break;
|
|
|
3957 |
case DSTORE : storeLocal(JavaKind.Double, stream.readLocalIndex()); break;
|
|
|
3958 |
case ASTORE : storeLocal(JavaKind.Object, stream.readLocalIndex()); break;
|
|
|
3959 |
case ISTORE_0 : // fall through
|
|
|
3960 |
case ISTORE_1 : // fall through
|
|
|
3961 |
case ISTORE_2 : // fall through
|
|
|
3962 |
case ISTORE_3 : storeLocal(JavaKind.Int, opcode - ISTORE_0); break;
|
|
|
3963 |
case LSTORE_0 : // fall through
|
|
|
3964 |
case LSTORE_1 : // fall through
|
|
|
3965 |
case LSTORE_2 : // fall through
|
|
|
3966 |
case LSTORE_3 : storeLocal(JavaKind.Long, opcode - LSTORE_0); break;
|
|
|
3967 |
case FSTORE_0 : // fall through
|
|
|
3968 |
case FSTORE_1 : // fall through
|
|
|
3969 |
case FSTORE_2 : // fall through
|
|
|
3970 |
case FSTORE_3 : storeLocal(JavaKind.Float, opcode - FSTORE_0); break;
|
|
|
3971 |
case DSTORE_0 : // fall through
|
|
|
3972 |
case DSTORE_1 : // fall through
|
|
|
3973 |
case DSTORE_2 : // fall through
|
|
|
3974 |
case DSTORE_3 : storeLocal(JavaKind.Double, opcode - DSTORE_0); break;
|
|
|
3975 |
case ASTORE_0 : // fall through
|
|
|
3976 |
case ASTORE_1 : // fall through
|
|
|
3977 |
case ASTORE_2 : // fall through
|
|
|
3978 |
case ASTORE_3 : storeLocal(JavaKind.Object, opcode - ASTORE_0); break;
|
|
|
3979 |
case IASTORE : genStoreIndexed(JavaKind.Int ); break;
|
|
|
3980 |
case LASTORE : genStoreIndexed(JavaKind.Long ); break;
|
|
|
3981 |
case FASTORE : genStoreIndexed(JavaKind.Float ); break;
|
|
|
3982 |
case DASTORE : genStoreIndexed(JavaKind.Double); break;
|
|
|
3983 |
case AASTORE : genStoreIndexed(JavaKind.Object); break;
|
|
|
3984 |
case BASTORE : genStoreIndexed(JavaKind.Byte ); break;
|
|
|
3985 |
case CASTORE : genStoreIndexed(JavaKind.Char ); break;
|
|
|
3986 |
case SASTORE : genStoreIndexed(JavaKind.Short ); break;
|
|
|
3987 |
case POP : // fall through
|
|
|
3988 |
case POP2 : // fall through
|
|
|
3989 |
case DUP : // fall through
|
|
|
3990 |
case DUP_X1 : // fall through
|
|
|
3991 |
case DUP_X2 : // fall through
|
|
|
3992 |
case DUP2 : // fall through
|
|
|
3993 |
case DUP2_X1 : // fall through
|
|
|
3994 |
case DUP2_X2 : // fall through
|
|
|
3995 |
case SWAP : frameState.stackOp(opcode); break;
|
|
|
3996 |
case IADD : // fall through
|
|
|
3997 |
case ISUB : // fall through
|
|
|
3998 |
case IMUL : genArithmeticOp(JavaKind.Int, opcode); break;
|
|
|
3999 |
case IDIV : // fall through
|
|
|
4000 |
case IREM : genIntegerDivOp(JavaKind.Int, opcode); break;
|
|
|
4001 |
case LADD : // fall through
|
|
|
4002 |
case LSUB : // fall through
|
|
|
4003 |
case LMUL : genArithmeticOp(JavaKind.Long, opcode); break;
|
|
|
4004 |
case LDIV : // fall through
|
|
|
4005 |
case LREM : genIntegerDivOp(JavaKind.Long, opcode); break;
|
|
|
4006 |
case FADD : // fall through
|
|
|
4007 |
case FSUB : // fall through
|
|
|
4008 |
case FMUL : // fall through
|
|
|
4009 |
case FDIV : // fall through
|
|
|
4010 |
case FREM : genArithmeticOp(JavaKind.Float, opcode); break;
|
|
|
4011 |
case DADD : // fall through
|
|
|
4012 |
case DSUB : // fall through
|
|
|
4013 |
case DMUL : // fall through
|
|
|
4014 |
case DDIV : // fall through
|
|
|
4015 |
case DREM : genArithmeticOp(JavaKind.Double, opcode); break;
|
|
|
4016 |
case INEG : genNegateOp(JavaKind.Int); break;
|
|
|
4017 |
case LNEG : genNegateOp(JavaKind.Long); break;
|
|
|
4018 |
case FNEG : genNegateOp(JavaKind.Float); break;
|
|
|
4019 |
case DNEG : genNegateOp(JavaKind.Double); break;
|
|
|
4020 |
case ISHL : // fall through
|
|
|
4021 |
case ISHR : // fall through
|
|
|
4022 |
case IUSHR : genShiftOp(JavaKind.Int, opcode); break;
|
|
|
4023 |
case IAND : // fall through
|
|
|
4024 |
case IOR : // fall through
|
|
|
4025 |
case IXOR : genLogicOp(JavaKind.Int, opcode); break;
|
|
|
4026 |
case LSHL : // fall through
|
|
|
4027 |
case LSHR : // fall through
|
|
|
4028 |
case LUSHR : genShiftOp(JavaKind.Long, opcode); break;
|
|
|
4029 |
case LAND : // fall through
|
|
|
4030 |
case LOR : // fall through
|
|
|
4031 |
case LXOR : genLogicOp(JavaKind.Long, opcode); break;
|
|
|
4032 |
case IINC : genIncrement(); break;
|
|
|
4033 |
case I2F : genFloatConvert(FloatConvert.I2F, JavaKind.Int, JavaKind.Float); break;
|
|
|
4034 |
case I2D : genFloatConvert(FloatConvert.I2D, JavaKind.Int, JavaKind.Double); break;
|
|
|
4035 |
case L2F : genFloatConvert(FloatConvert.L2F, JavaKind.Long, JavaKind.Float); break;
|
|
|
4036 |
case L2D : genFloatConvert(FloatConvert.L2D, JavaKind.Long, JavaKind.Double); break;
|
|
|
4037 |
case F2I : genFloatConvert(FloatConvert.F2I, JavaKind.Float, JavaKind.Int); break;
|
|
|
4038 |
case F2L : genFloatConvert(FloatConvert.F2L, JavaKind.Float, JavaKind.Long); break;
|
|
|
4039 |
case F2D : genFloatConvert(FloatConvert.F2D, JavaKind.Float, JavaKind.Double); break;
|
|
|
4040 |
case D2I : genFloatConvert(FloatConvert.D2I, JavaKind.Double, JavaKind.Int); break;
|
|
|
4041 |
case D2L : genFloatConvert(FloatConvert.D2L, JavaKind.Double, JavaKind.Long); break;
|
|
|
4042 |
case D2F : genFloatConvert(FloatConvert.D2F, JavaKind.Double, JavaKind.Float); break;
|
|
|
4043 |
case L2I : genNarrow(JavaKind.Long, JavaKind.Int); break;
|
|
|
4044 |
case I2L : genSignExtend(JavaKind.Int, JavaKind.Long); break;
|
|
|
4045 |
case I2B : genSignExtend(JavaKind.Byte, JavaKind.Int); break;
|
|
|
4046 |
case I2S : genSignExtend(JavaKind.Short, JavaKind.Int); break;
|
|
|
4047 |
case I2C : genZeroExtend(JavaKind.Char, JavaKind.Int); break;
|
|
|
4048 |
case LCMP : genCompareOp(JavaKind.Long, false); break;
|
|
|
4049 |
case FCMPL : genCompareOp(JavaKind.Float, true); break;
|
|
|
4050 |
case FCMPG : genCompareOp(JavaKind.Float, false); break;
|
|
|
4051 |
case DCMPL : genCompareOp(JavaKind.Double, true); break;
|
|
|
4052 |
case DCMPG : genCompareOp(JavaKind.Double, false); break;
|
|
|
4053 |
case IFEQ : genIfZero(Condition.EQ); break;
|
|
|
4054 |
case IFNE : genIfZero(Condition.NE); break;
|
|
|
4055 |
case IFLT : genIfZero(Condition.LT); break;
|
|
|
4056 |
case IFGE : genIfZero(Condition.GE); break;
|
|
|
4057 |
case IFGT : genIfZero(Condition.GT); break;
|
|
|
4058 |
case IFLE : genIfZero(Condition.LE); break;
|
|
|
4059 |
case IF_ICMPEQ : genIfSame(JavaKind.Int, Condition.EQ); break;
|
|
|
4060 |
case IF_ICMPNE : genIfSame(JavaKind.Int, Condition.NE); break;
|
|
|
4061 |
case IF_ICMPLT : genIfSame(JavaKind.Int, Condition.LT); break;
|
|
|
4062 |
case IF_ICMPGE : genIfSame(JavaKind.Int, Condition.GE); break;
|
|
|
4063 |
case IF_ICMPGT : genIfSame(JavaKind.Int, Condition.GT); break;
|
|
|
4064 |
case IF_ICMPLE : genIfSame(JavaKind.Int, Condition.LE); break;
|
|
|
4065 |
case IF_ACMPEQ : genIfSame(JavaKind.Object, Condition.EQ); break;
|
|
|
4066 |
case IF_ACMPNE : genIfSame(JavaKind.Object, Condition.NE); break;
|
|
|
4067 |
case GOTO : genGoto(); break;
|
|
|
4068 |
case JSR : genJsr(stream.readBranchDest()); break;
|
|
|
4069 |
case RET : genRet(stream.readLocalIndex()); break;
|
|
|
4070 |
case TABLESWITCH : genSwitch(new BytecodeTableSwitch(getStream(), bci())); break;
|
|
|
4071 |
case LOOKUPSWITCH : genSwitch(new BytecodeLookupSwitch(getStream(), bci())); break;
|
|
|
4072 |
case IRETURN : genReturn(frameState.pop(JavaKind.Int), JavaKind.Int); break;
|
|
|
4073 |
case LRETURN : genReturn(frameState.pop(JavaKind.Long), JavaKind.Long); break;
|
|
|
4074 |
case FRETURN : genReturn(frameState.pop(JavaKind.Float), JavaKind.Float); break;
|
|
|
4075 |
case DRETURN : genReturn(frameState.pop(JavaKind.Double), JavaKind.Double); break;
|
|
|
4076 |
case ARETURN : genReturn(frameState.pop(JavaKind.Object), JavaKind.Object); break;
|
|
|
4077 |
case RETURN : genReturn(null, JavaKind.Void); break;
|
|
|
4078 |
case GETSTATIC : cpi = stream.readCPI(); genGetStatic(lookupField(cpi, opcode)); break;
|
|
|
4079 |
case PUTSTATIC : cpi = stream.readCPI(); genPutStatic(lookupField(cpi, opcode)); break;
|
|
|
4080 |
case GETFIELD : cpi = stream.readCPI(); genGetField(lookupField(cpi, opcode)); break;
|
|
|
4081 |
case PUTFIELD : cpi = stream.readCPI(); genPutField(lookupField(cpi, opcode)); break;
|
|
|
4082 |
case INVOKEVIRTUAL : cpi = stream.readCPI(); genInvokeVirtual(lookupMethod(cpi, opcode)); break;
|
|
|
4083 |
case INVOKESPECIAL : cpi = stream.readCPI(); genInvokeSpecial(lookupMethod(cpi, opcode)); break;
|
|
|
4084 |
case INVOKESTATIC : cpi = stream.readCPI(); genInvokeStatic(lookupMethod(cpi, opcode)); break;
|
|
|
4085 |
case INVOKEINTERFACE: cpi = stream.readCPI(); genInvokeInterface(lookupMethod(cpi, opcode)); break;
|
|
|
4086 |
case INVOKEDYNAMIC : cpi = stream.readCPI4(); genInvokeDynamic(lookupMethod(cpi, opcode)); break;
|
|
|
4087 |
case NEW : genNewInstance(stream.readCPI()); break;
|
|
|
4088 |
case NEWARRAY : genNewPrimitiveArray(stream.readLocalIndex()); break;
|
|
|
4089 |
case ANEWARRAY : genNewObjectArray(stream.readCPI()); break;
|
|
|
4090 |
case ARRAYLENGTH : genArrayLength(); break;
|
|
|
4091 |
case ATHROW : genThrow(); break;
|
|
|
4092 |
case CHECKCAST : genCheckCast(); break;
|
|
|
4093 |
case INSTANCEOF : genInstanceOf(); break;
|
|
|
4094 |
case MONITORENTER : genMonitorEnter(frameState.pop(JavaKind.Object), stream.nextBCI()); break;
|
|
|
4095 |
case MONITOREXIT : genMonitorExit(frameState.pop(JavaKind.Object), null, stream.nextBCI()); break;
|
|
|
4096 |
case MULTIANEWARRAY : genNewMultiArray(stream.readCPI()); break;
|
|
|
4097 |
case IFNULL : genIfNull(Condition.EQ); break;
|
|
|
4098 |
case IFNONNULL : genIfNull(Condition.NE); break;
|
|
|
4099 |
case GOTO_W : genGoto(); break;
|
|
|
4100 |
case JSR_W : genJsr(stream.readBranchDest()); break;
|
|
|
4101 |
case BREAKPOINT : throw new PermanentBailoutException("concurrent setting of breakpoint");
|
|
|
4102 |
default : throw new PermanentBailoutException("Unsupported opcode %d (%s) [bci=%d]", opcode, nameOf(opcode), bci);
|
|
|
4103 |
}
|
|
|
4104 |
// @formatter:on
|
|
|
4105 |
// Checkstyle: resume
|
|
|
4106 |
}
|
|
|
4107 |
|
|
|
4108 |
private void genArrayLength() {
|
|
46344
|
4109 |
ValueNode array = emitExplicitExceptions(frameState.pop(JavaKind.Object));
|
|
43972
|
4110 |
frameState.push(JavaKind.Int, append(genArrayLength(array)));
|
|
|
4111 |
}
|
|
|
4112 |
|
|
|
4113 |
@Override
|
|
|
4114 |
public ResolvedJavaMethod getMethod() {
|
|
|
4115 |
return method;
|
|
|
4116 |
}
|
|
|
4117 |
|
|
|
4118 |
@Override
|
|
|
4119 |
public Bytecode getCode() {
|
|
|
4120 |
return code;
|
|
|
4121 |
}
|
|
|
4122 |
|
|
|
4123 |
public FrameStateBuilder getFrameStateBuilder() {
|
|
|
4124 |
return frameState;
|
|
|
4125 |
}
|
|
|
4126 |
|
|
|
4127 |
protected boolean traceInstruction(int bci, int opcode, boolean blockStart) {
|
|
46344
|
4128 |
if (Debug.isEnabled() && TraceBytecodeParserLevel.getValue(options) >= TRACELEVEL_INSTRUCTIONS && Debug.isLogEnabled()) {
|
|
43972
|
4129 |
traceInstructionHelper(bci, opcode, blockStart);
|
|
|
4130 |
}
|
|
|
4131 |
return true;
|
|
|
4132 |
}
|
|
|
4133 |
|
|
|
4134 |
private void traceInstructionHelper(int bci, int opcode, boolean blockStart) {
|
|
|
4135 |
StringBuilder sb = new StringBuilder(40);
|
|
|
4136 |
sb.append(blockStart ? '+' : '|');
|
|
|
4137 |
if (bci < 10) {
|
|
|
4138 |
sb.append(" ");
|
|
|
4139 |
} else if (bci < 100) {
|
|
|
4140 |
sb.append(' ');
|
|
|
4141 |
}
|
|
|
4142 |
sb.append(bci).append(": ").append(Bytecodes.nameOf(opcode));
|
|
|
4143 |
for (int i = bci + 1; i < stream.nextBCI(); ++i) {
|
|
|
4144 |
sb.append(' ').append(stream.readUByte(i));
|
|
|
4145 |
}
|
|
|
4146 |
if (!currentBlock.getJsrScope().isEmpty()) {
|
|
|
4147 |
sb.append(' ').append(currentBlock.getJsrScope());
|
|
|
4148 |
}
|
|
|
4149 |
Debug.log("%s", sb);
|
|
|
4150 |
}
|
|
|
4151 |
|
|
|
4152 |
@Override
|
|
|
4153 |
public boolean parsingIntrinsic() {
|
|
|
4154 |
return intrinsicContext != null;
|
|
|
4155 |
}
|
|
|
4156 |
|
|
|
4157 |
@Override
|
|
|
4158 |
public BytecodeParser getNonIntrinsicAncestor() {
|
|
|
4159 |
BytecodeParser ancestor = parent;
|
|
|
4160 |
while (ancestor != null && ancestor.parsingIntrinsic()) {
|
|
|
4161 |
ancestor = ancestor.parent;
|
|
|
4162 |
}
|
|
|
4163 |
return ancestor;
|
|
|
4164 |
}
|
|
|
4165 |
|
|
|
4166 |
static String nSpaces(int n) {
|
|
|
4167 |
return n == 0 ? "" : format("%" + n + "s", "");
|
|
|
4168 |
}
|
|
|
4169 |
}
|