Mercurial > hg > graal-compiler
annotate src/share/vm/c1/c1_GraphBuilder.cpp @ 5925:4fabc16dc5bf
6910464: Lookupswitch and Tableswitch default branches not recognized as safepoints
Summary: C1 does not recognize the default branch of a lookupswitch or tableswitch bytecode to be a safepoint if backward.
Reviewed-by: kvn, never
author | roland |
---|---|
date | Fri, 02 Mar 2012 16:04:24 +0100 |
parents | 80107dc493db |
children | e5f73be4c7f1 |
rev | line source |
---|---|
0 | 1 /* |
4870
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
2 * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1540
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1540
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1540
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "c1/c1_CFGPrinter.hpp" | |
27 #include "c1/c1_Canonicalizer.hpp" | |
28 #include "c1/c1_Compilation.hpp" | |
29 #include "c1/c1_GraphBuilder.hpp" | |
30 #include "c1/c1_InstructionPrinter.hpp" | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
31 #include "ci/ciCallSite.hpp" |
1972 | 32 #include "ci/ciField.hpp" |
33 #include "ci/ciKlass.hpp" | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
34 #include "ci/ciMethodHandle.hpp" |
2405
3d58a4983660
7022998: JSR 292 recursive method handle calls inline themselves infinitely
twisti
parents:
2376
diff
changeset
|
35 #include "compiler/compileBroker.hpp" |
1972 | 36 #include "interpreter/bytecode.hpp" |
37 #include "runtime/sharedRuntime.hpp" | |
3791
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3255
diff
changeset
|
38 #include "runtime/compilationPolicy.hpp" |
1972 | 39 #include "utilities/bitMap.inline.hpp" |
0 | 40 |
41 class BlockListBuilder VALUE_OBJ_CLASS_SPEC { | |
42 private: | |
43 Compilation* _compilation; | |
44 IRScope* _scope; | |
45 | |
46 BlockList _blocks; // internal list of all blocks | |
47 BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder | |
48 | |
49 // fields used by mark_loops | |
50 BitMap _active; // for iteration of control flow graph | |
51 BitMap _visited; // for iteration of control flow graph | |
52 intArray _loop_map; // caches the information if a block is contained in a loop | |
53 int _next_loop_index; // next free loop number | |
54 int _next_block_number; // for reverse postorder numbering of blocks | |
55 | |
56 // accessors | |
57 Compilation* compilation() const { return _compilation; } | |
58 IRScope* scope() const { return _scope; } | |
59 ciMethod* method() const { return scope()->method(); } | |
60 XHandlers* xhandlers() const { return scope()->xhandlers(); } | |
61 | |
62 // unified bailout support | |
63 void bailout(const char* msg) const { compilation()->bailout(msg); } | |
64 bool bailed_out() const { return compilation()->bailed_out(); } | |
65 | |
66 // helper functions | |
67 BlockBegin* make_block_at(int bci, BlockBegin* predecessor); | |
68 void handle_exceptions(BlockBegin* current, int cur_bci); | |
69 void handle_jsr(BlockBegin* current, int sr_bci, int next_bci); | |
70 void store_one(BlockBegin* current, int local); | |
71 void store_two(BlockBegin* current, int local); | |
72 void set_entries(int osr_bci); | |
73 void set_leaders(); | |
74 | |
75 void make_loop_header(BlockBegin* block); | |
76 void mark_loops(); | |
77 int mark_loops(BlockBegin* b, bool in_subroutine); | |
78 | |
79 // debugging | |
80 #ifndef PRODUCT | |
81 void print(); | |
82 #endif | |
83 | |
84 public: | |
85 // creation | |
86 BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci); | |
87 | |
88 // accessors for GraphBuilder | |
89 BlockList* bci2block() const { return _bci2block; } | |
90 }; | |
91 | |
92 | |
93 // Implementation of BlockListBuilder | |
94 | |
95 BlockListBuilder::BlockListBuilder(Compilation* compilation, IRScope* scope, int osr_bci) | |
96 : _compilation(compilation) | |
97 , _scope(scope) | |
98 , _blocks(16) | |
99 , _bci2block(new BlockList(scope->method()->code_size(), NULL)) | |
100 , _next_block_number(0) | |
101 , _active() // size not known yet | |
102 , _visited() // size not known yet | |
103 , _next_loop_index(0) | |
104 , _loop_map() // size not known yet | |
105 { | |
106 set_entries(osr_bci); | |
107 set_leaders(); | |
108 CHECK_BAILOUT(); | |
109 | |
110 mark_loops(); | |
111 NOT_PRODUCT(if (PrintInitialBlockList) print()); | |
112 | |
113 #ifndef PRODUCT | |
114 if (PrintCFGToFile) { | |
115 stringStream title; | |
116 title.print("BlockListBuilder "); | |
117 scope->method()->print_name(&title); | |
118 CFGPrinter::print_cfg(_bci2block, title.as_string(), false, false); | |
119 } | |
120 #endif | |
121 } | |
122 | |
123 | |
124 void BlockListBuilder::set_entries(int osr_bci) { | |
125 // generate start blocks | |
126 BlockBegin* std_entry = make_block_at(0, NULL); | |
127 if (scope()->caller() == NULL) { | |
128 std_entry->set(BlockBegin::std_entry_flag); | |
129 } | |
130 if (osr_bci != -1) { | |
131 BlockBegin* osr_entry = make_block_at(osr_bci, NULL); | |
132 osr_entry->set(BlockBegin::osr_entry_flag); | |
133 } | |
134 | |
135 // generate exception entry blocks | |
136 XHandlers* list = xhandlers(); | |
137 const int n = list->length(); | |
138 for (int i = 0; i < n; i++) { | |
139 XHandler* h = list->handler_at(i); | |
140 BlockBegin* entry = make_block_at(h->handler_bci(), NULL); | |
141 entry->set(BlockBegin::exception_entry_flag); | |
142 h->set_entry_block(entry); | |
143 } | |
144 } | |
145 | |
146 | |
147 BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) { | |
148 assert(method()->bci_block_start().at(cur_bci), "wrong block starts of MethodLivenessAnalyzer"); | |
149 | |
150 BlockBegin* block = _bci2block->at(cur_bci); | |
151 if (block == NULL) { | |
152 block = new BlockBegin(cur_bci); | |
153 block->init_stores_to_locals(method()->max_locals()); | |
154 _bci2block->at_put(cur_bci, block); | |
155 _blocks.append(block); | |
156 | |
157 assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist"); | |
158 } | |
159 | |
160 if (predecessor != NULL) { | |
161 if (block->is_set(BlockBegin::exception_entry_flag)) { | |
162 BAILOUT_("Exception handler can be reached by both normal and exceptional control flow", block); | |
163 } | |
164 | |
165 predecessor->add_successor(block); | |
166 block->increment_total_preds(); | |
167 } | |
168 | |
169 return block; | |
170 } | |
171 | |
172 | |
173 inline void BlockListBuilder::store_one(BlockBegin* current, int local) { | |
174 current->stores_to_locals().set_bit(local); | |
175 } | |
176 inline void BlockListBuilder::store_two(BlockBegin* current, int local) { | |
177 store_one(current, local); | |
178 store_one(current, local + 1); | |
179 } | |
180 | |
181 | |
182 void BlockListBuilder::handle_exceptions(BlockBegin* current, int cur_bci) { | |
183 // Draws edges from a block to its exception handlers | |
184 XHandlers* list = xhandlers(); | |
185 const int n = list->length(); | |
186 | |
187 for (int i = 0; i < n; i++) { | |
188 XHandler* h = list->handler_at(i); | |
189 | |
190 if (h->covers(cur_bci)) { | |
191 BlockBegin* entry = h->entry_block(); | |
192 assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set"); | |
193 assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set"); | |
194 | |
195 // add each exception handler only once | |
196 if (!current->is_successor(entry)) { | |
197 current->add_successor(entry); | |
198 entry->increment_total_preds(); | |
199 } | |
200 | |
201 // stop when reaching catchall | |
202 if (h->catch_type() == 0) break; | |
203 } | |
204 } | |
205 } | |
206 | |
207 void BlockListBuilder::handle_jsr(BlockBegin* current, int sr_bci, int next_bci) { | |
208 // start a new block after jsr-bytecode and link this block into cfg | |
209 make_block_at(next_bci, current); | |
210 | |
211 // start a new block at the subroutine entry at mark it with special flag | |
212 BlockBegin* sr_block = make_block_at(sr_bci, current); | |
213 if (!sr_block->is_set(BlockBegin::subroutine_entry_flag)) { | |
214 sr_block->set(BlockBegin::subroutine_entry_flag); | |
215 } | |
216 } | |
217 | |
218 | |
219 void BlockListBuilder::set_leaders() { | |
220 bool has_xhandlers = xhandlers()->has_handlers(); | |
221 BlockBegin* current = NULL; | |
222 | |
223 // The information which bci starts a new block simplifies the analysis | |
224 // Without it, backward branches could jump to a bci where no block was created | |
225 // during bytecode iteration. This would require the creation of a new block at the | |
226 // branch target and a modification of the successor lists. | |
227 BitMap bci_block_start = method()->bci_block_start(); | |
228 | |
229 ciBytecodeStream s(method()); | |
230 while (s.next() != ciBytecodeStream::EOBC()) { | |
231 int cur_bci = s.cur_bci(); | |
232 | |
233 if (bci_block_start.at(cur_bci)) { | |
234 current = make_block_at(cur_bci, current); | |
235 } | |
236 assert(current != NULL, "must have current block"); | |
237 | |
238 if (has_xhandlers && GraphBuilder::can_trap(method(), s.cur_bc())) { | |
239 handle_exceptions(current, cur_bci); | |
240 } | |
241 | |
242 switch (s.cur_bc()) { | |
243 // track stores to local variables for selective creation of phi functions | |
244 case Bytecodes::_iinc: store_one(current, s.get_index()); break; | |
245 case Bytecodes::_istore: store_one(current, s.get_index()); break; | |
246 case Bytecodes::_lstore: store_two(current, s.get_index()); break; | |
247 case Bytecodes::_fstore: store_one(current, s.get_index()); break; | |
248 case Bytecodes::_dstore: store_two(current, s.get_index()); break; | |
249 case Bytecodes::_astore: store_one(current, s.get_index()); break; | |
250 case Bytecodes::_istore_0: store_one(current, 0); break; | |
251 case Bytecodes::_istore_1: store_one(current, 1); break; | |
252 case Bytecodes::_istore_2: store_one(current, 2); break; | |
253 case Bytecodes::_istore_3: store_one(current, 3); break; | |
254 case Bytecodes::_lstore_0: store_two(current, 0); break; | |
255 case Bytecodes::_lstore_1: store_two(current, 1); break; | |
256 case Bytecodes::_lstore_2: store_two(current, 2); break; | |
257 case Bytecodes::_lstore_3: store_two(current, 3); break; | |
258 case Bytecodes::_fstore_0: store_one(current, 0); break; | |
259 case Bytecodes::_fstore_1: store_one(current, 1); break; | |
260 case Bytecodes::_fstore_2: store_one(current, 2); break; | |
261 case Bytecodes::_fstore_3: store_one(current, 3); break; | |
262 case Bytecodes::_dstore_0: store_two(current, 0); break; | |
263 case Bytecodes::_dstore_1: store_two(current, 1); break; | |
264 case Bytecodes::_dstore_2: store_two(current, 2); break; | |
265 case Bytecodes::_dstore_3: store_two(current, 3); break; | |
266 case Bytecodes::_astore_0: store_one(current, 0); break; | |
267 case Bytecodes::_astore_1: store_one(current, 1); break; | |
268 case Bytecodes::_astore_2: store_one(current, 2); break; | |
269 case Bytecodes::_astore_3: store_one(current, 3); break; | |
270 | |
271 // track bytecodes that affect the control flow | |
272 case Bytecodes::_athrow: // fall through | |
273 case Bytecodes::_ret: // fall through | |
274 case Bytecodes::_ireturn: // fall through | |
275 case Bytecodes::_lreturn: // fall through | |
276 case Bytecodes::_freturn: // fall through | |
277 case Bytecodes::_dreturn: // fall through | |
278 case Bytecodes::_areturn: // fall through | |
279 case Bytecodes::_return: | |
280 current = NULL; | |
281 break; | |
282 | |
283 case Bytecodes::_ifeq: // fall through | |
284 case Bytecodes::_ifne: // fall through | |
285 case Bytecodes::_iflt: // fall through | |
286 case Bytecodes::_ifge: // fall through | |
287 case Bytecodes::_ifgt: // fall through | |
288 case Bytecodes::_ifle: // fall through | |
289 case Bytecodes::_if_icmpeq: // fall through | |
290 case Bytecodes::_if_icmpne: // fall through | |
291 case Bytecodes::_if_icmplt: // fall through | |
292 case Bytecodes::_if_icmpge: // fall through | |
293 case Bytecodes::_if_icmpgt: // fall through | |
294 case Bytecodes::_if_icmple: // fall through | |
295 case Bytecodes::_if_acmpeq: // fall through | |
296 case Bytecodes::_if_acmpne: // fall through | |
297 case Bytecodes::_ifnull: // fall through | |
298 case Bytecodes::_ifnonnull: | |
299 make_block_at(s.next_bci(), current); | |
300 make_block_at(s.get_dest(), current); | |
301 current = NULL; | |
302 break; | |
303 | |
304 case Bytecodes::_goto: | |
305 make_block_at(s.get_dest(), current); | |
306 current = NULL; | |
307 break; | |
308 | |
309 case Bytecodes::_goto_w: | |
310 make_block_at(s.get_far_dest(), current); | |
311 current = NULL; | |
312 break; | |
313 | |
314 case Bytecodes::_jsr: | |
315 handle_jsr(current, s.get_dest(), s.next_bci()); | |
316 current = NULL; | |
317 break; | |
318 | |
319 case Bytecodes::_jsr_w: | |
320 handle_jsr(current, s.get_far_dest(), s.next_bci()); | |
321 current = NULL; | |
322 break; | |
323 | |
324 case Bytecodes::_tableswitch: { | |
325 // set block for each case | |
2142 | 326 Bytecode_tableswitch sw(&s); |
327 int l = sw.length(); | |
0 | 328 for (int i = 0; i < l; i++) { |
2142 | 329 make_block_at(cur_bci + sw.dest_offset_at(i), current); |
0 | 330 } |
2142 | 331 make_block_at(cur_bci + sw.default_offset(), current); |
0 | 332 current = NULL; |
333 break; | |
334 } | |
335 | |
336 case Bytecodes::_lookupswitch: { | |
337 // set block for each case | |
2142 | 338 Bytecode_lookupswitch sw(&s); |
339 int l = sw.number_of_pairs(); | |
0 | 340 for (int i = 0; i < l; i++) { |
2142 | 341 make_block_at(cur_bci + sw.pair_at(i).offset(), current); |
0 | 342 } |
2142 | 343 make_block_at(cur_bci + sw.default_offset(), current); |
0 | 344 current = NULL; |
345 break; | |
346 } | |
347 } | |
348 } | |
349 } | |
350 | |
351 | |
352 void BlockListBuilder::mark_loops() { | |
353 ResourceMark rm; | |
354 | |
355 _active = BitMap(BlockBegin::number_of_blocks()); _active.clear(); | |
356 _visited = BitMap(BlockBegin::number_of_blocks()); _visited.clear(); | |
357 _loop_map = intArray(BlockBegin::number_of_blocks(), 0); | |
358 _next_loop_index = 0; | |
359 _next_block_number = _blocks.length(); | |
360 | |
361 // recursively iterate the control flow graph | |
362 mark_loops(_bci2block->at(0), false); | |
363 assert(_next_block_number >= 0, "invalid block numbers"); | |
364 } | |
365 | |
366 void BlockListBuilder::make_loop_header(BlockBegin* block) { | |
367 if (block->is_set(BlockBegin::exception_entry_flag)) { | |
368 // exception edges may look like loops but don't mark them as such | |
369 // since it screws up block ordering. | |
370 return; | |
371 } | |
372 if (!block->is_set(BlockBegin::parser_loop_header_flag)) { | |
373 block->set(BlockBegin::parser_loop_header_flag); | |
374 | |
375 assert(_loop_map.at(block->block_id()) == 0, "must not be set yet"); | |
376 assert(0 <= _next_loop_index && _next_loop_index < BitsPerInt, "_next_loop_index is used as a bit-index in integer"); | |
377 _loop_map.at_put(block->block_id(), 1 << _next_loop_index); | |
378 if (_next_loop_index < 31) _next_loop_index++; | |
379 } else { | |
380 // block already marked as loop header | |
1060 | 381 assert(is_power_of_2((unsigned int)_loop_map.at(block->block_id())), "exactly one bit must be set"); |
0 | 382 } |
383 } | |
384 | |
385 int BlockListBuilder::mark_loops(BlockBegin* block, bool in_subroutine) { | |
386 int block_id = block->block_id(); | |
387 | |
388 if (_visited.at(block_id)) { | |
389 if (_active.at(block_id)) { | |
390 // reached block via backward branch | |
391 make_loop_header(block); | |
392 } | |
393 // return cached loop information for this block | |
394 return _loop_map.at(block_id); | |
395 } | |
396 | |
397 if (block->is_set(BlockBegin::subroutine_entry_flag)) { | |
398 in_subroutine = true; | |
399 } | |
400 | |
401 // set active and visited bits before successors are processed | |
402 _visited.set_bit(block_id); | |
403 _active.set_bit(block_id); | |
404 | |
405 intptr_t loop_state = 0; | |
406 for (int i = block->number_of_sux() - 1; i >= 0; i--) { | |
407 // recursively process all successors | |
408 loop_state |= mark_loops(block->sux_at(i), in_subroutine); | |
409 } | |
410 | |
411 // clear active-bit after all successors are processed | |
412 _active.clear_bit(block_id); | |
413 | |
414 // reverse-post-order numbering of all blocks | |
415 block->set_depth_first_number(_next_block_number); | |
416 _next_block_number--; | |
417 | |
418 if (loop_state != 0 || in_subroutine ) { | |
419 // block is contained at least in one loop, so phi functions are necessary | |
420 // phi functions are also necessary for all locals stored in a subroutine | |
421 scope()->requires_phi_function().set_union(block->stores_to_locals()); | |
422 } | |
423 | |
424 if (block->is_set(BlockBegin::parser_loop_header_flag)) { | |
425 int header_loop_state = _loop_map.at(block_id); | |
426 assert(is_power_of_2((unsigned)header_loop_state), "exactly one bit must be set"); | |
427 | |
428 // If the highest bit is set (i.e. when integer value is negative), the method | |
429 // has 32 or more loops. This bit is never cleared because it is used for multiple loops | |
430 if (header_loop_state >= 0) { | |
431 clear_bits(loop_state, header_loop_state); | |
432 } | |
433 } | |
434 | |
435 // cache and return loop information for this block | |
436 _loop_map.at_put(block_id, loop_state); | |
437 return loop_state; | |
438 } | |
439 | |
440 | |
441 #ifndef PRODUCT | |
442 | |
443 int compare_depth_first(BlockBegin** a, BlockBegin** b) { | |
444 return (*a)->depth_first_number() - (*b)->depth_first_number(); | |
445 } | |
446 | |
447 void BlockListBuilder::print() { | |
448 tty->print("----- initial block list of BlockListBuilder for method "); | |
449 method()->print_short_name(); | |
450 tty->cr(); | |
451 | |
452 // better readability if blocks are sorted in processing order | |
453 _blocks.sort(compare_depth_first); | |
454 | |
455 for (int i = 0; i < _blocks.length(); i++) { | |
456 BlockBegin* cur = _blocks.at(i); | |
457 tty->print("%4d: B%-4d bci: %-4d preds: %-4d ", cur->depth_first_number(), cur->block_id(), cur->bci(), cur->total_preds()); | |
458 | |
459 tty->print(cur->is_set(BlockBegin::std_entry_flag) ? " std" : " "); | |
460 tty->print(cur->is_set(BlockBegin::osr_entry_flag) ? " osr" : " "); | |
461 tty->print(cur->is_set(BlockBegin::exception_entry_flag) ? " ex" : " "); | |
462 tty->print(cur->is_set(BlockBegin::subroutine_entry_flag) ? " sr" : " "); | |
463 tty->print(cur->is_set(BlockBegin::parser_loop_header_flag) ? " lh" : " "); | |
464 | |
465 if (cur->number_of_sux() > 0) { | |
466 tty->print(" sux: "); | |
467 for (int j = 0; j < cur->number_of_sux(); j++) { | |
468 BlockBegin* sux = cur->sux_at(j); | |
469 tty->print("B%d ", sux->block_id()); | |
470 } | |
471 } | |
472 tty->cr(); | |
473 } | |
474 } | |
475 | |
476 #endif | |
477 | |
478 | |
479 // A simple growable array of Values indexed by ciFields | |
480 class FieldBuffer: public CompilationResourceObj { | |
481 private: | |
482 GrowableArray<Value> _values; | |
483 | |
484 public: | |
485 FieldBuffer() {} | |
486 | |
487 void kill() { | |
488 _values.trunc_to(0); | |
489 } | |
490 | |
491 Value at(ciField* field) { | |
492 assert(field->holder()->is_loaded(), "must be a loaded field"); | |
493 int offset = field->offset(); | |
494 if (offset < _values.length()) { | |
495 return _values.at(offset); | |
496 } else { | |
497 return NULL; | |
498 } | |
499 } | |
500 | |
501 void at_put(ciField* field, Value value) { | |
502 assert(field->holder()->is_loaded(), "must be a loaded field"); | |
503 int offset = field->offset(); | |
504 _values.at_put_grow(offset, value, NULL); | |
505 } | |
506 | |
507 }; | |
508 | |
509 | |
510 // MemoryBuffer is fairly simple model of the current state of memory. | |
511 // It partitions memory into several pieces. The first piece is | |
512 // generic memory where little is known about the owner of the memory. | |
513 // This is conceptually represented by the tuple <O, F, V> which says | |
514 // that the field F of object O has value V. This is flattened so | |
515 // that F is represented by the offset of the field and the parallel | |
516 // arrays _objects and _values are used for O and V. Loads of O.F can | |
517 // simply use V. Newly allocated objects are kept in a separate list | |
518 // along with a parallel array for each object which represents the | |
519 // current value of its fields. Stores of the default value to fields | |
520 // which have never been stored to before are eliminated since they | |
521 // are redundant. Once newly allocated objects are stored into | |
522 // another object or they are passed out of the current compile they | |
523 // are treated like generic memory. | |
524 | |
525 class MemoryBuffer: public CompilationResourceObj { | |
526 private: | |
527 FieldBuffer _values; | |
528 GrowableArray<Value> _objects; | |
529 GrowableArray<Value> _newobjects; | |
530 GrowableArray<FieldBuffer*> _fields; | |
531 | |
532 public: | |
533 MemoryBuffer() {} | |
534 | |
535 StoreField* store(StoreField* st) { | |
536 if (!EliminateFieldAccess) { | |
537 return st; | |
538 } | |
539 | |
540 Value object = st->obj(); | |
541 Value value = st->value(); | |
542 ciField* field = st->field(); | |
543 if (field->holder()->is_loaded()) { | |
544 int offset = field->offset(); | |
545 int index = _newobjects.find(object); | |
546 if (index != -1) { | |
547 // newly allocated object with no other stores performed on this field | |
548 FieldBuffer* buf = _fields.at(index); | |
549 if (buf->at(field) == NULL && is_default_value(value)) { | |
550 #ifndef PRODUCT | |
551 if (PrintIRDuringConstruction && Verbose) { | |
552 tty->print_cr("Eliminated store for object %d:", index); | |
553 st->print_line(); | |
554 } | |
555 #endif | |
556 return NULL; | |
557 } else { | |
558 buf->at_put(field, value); | |
559 } | |
560 } else { | |
561 _objects.at_put_grow(offset, object, NULL); | |
562 _values.at_put(field, value); | |
563 } | |
564 | |
565 store_value(value); | |
566 } else { | |
567 // if we held onto field names we could alias based on names but | |
568 // we don't know what's being stored to so kill it all. | |
569 kill(); | |
570 } | |
571 return st; | |
572 } | |
573 | |
574 | |
575 // return true if this value correspond to the default value of a field. | |
576 bool is_default_value(Value value) { | |
577 Constant* con = value->as_Constant(); | |
578 if (con) { | |
579 switch (con->type()->tag()) { | |
580 case intTag: return con->type()->as_IntConstant()->value() == 0; | |
581 case longTag: return con->type()->as_LongConstant()->value() == 0; | |
582 case floatTag: return jint_cast(con->type()->as_FloatConstant()->value()) == 0; | |
583 case doubleTag: return jlong_cast(con->type()->as_DoubleConstant()->value()) == jlong_cast(0); | |
584 case objectTag: return con->type() == objectNull; | |
585 default: ShouldNotReachHere(); | |
586 } | |
587 } | |
588 return false; | |
589 } | |
590 | |
591 | |
592 // return either the actual value of a load or the load itself | |
593 Value load(LoadField* load) { | |
594 if (!EliminateFieldAccess) { | |
595 return load; | |
596 } | |
597 | |
598 if (RoundFPResults && UseSSE < 2 && load->type()->is_float_kind()) { | |
599 // can't skip load since value might get rounded as a side effect | |
600 return load; | |
601 } | |
602 | |
603 ciField* field = load->field(); | |
604 Value object = load->obj(); | |
605 if (field->holder()->is_loaded() && !field->is_volatile()) { | |
606 int offset = field->offset(); | |
607 Value result = NULL; | |
608 int index = _newobjects.find(object); | |
609 if (index != -1) { | |
610 result = _fields.at(index)->at(field); | |
611 } else if (_objects.at_grow(offset, NULL) == object) { | |
612 result = _values.at(field); | |
613 } | |
614 if (result != NULL) { | |
615 #ifndef PRODUCT | |
616 if (PrintIRDuringConstruction && Verbose) { | |
617 tty->print_cr("Eliminated load: "); | |
618 load->print_line(); | |
619 } | |
620 #endif | |
621 assert(result->type()->tag() == load->type()->tag(), "wrong types"); | |
622 return result; | |
623 } | |
624 } | |
625 return load; | |
626 } | |
627 | |
628 // Record this newly allocated object | |
629 void new_instance(NewInstance* object) { | |
630 int index = _newobjects.length(); | |
631 _newobjects.append(object); | |
632 if (_fields.at_grow(index, NULL) == NULL) { | |
633 _fields.at_put(index, new FieldBuffer()); | |
634 } else { | |
635 _fields.at(index)->kill(); | |
636 } | |
637 } | |
638 | |
639 void store_value(Value value) { | |
640 int index = _newobjects.find(value); | |
641 if (index != -1) { | |
642 // stored a newly allocated object into another object. | |
643 // Assume we've lost track of it as separate slice of memory. | |
644 // We could do better by keeping track of whether individual | |
645 // fields could alias each other. | |
646 _newobjects.remove_at(index); | |
647 // pull out the field info and store it at the end up the list | |
648 // of field info list to be reused later. | |
649 _fields.append(_fields.at(index)); | |
650 _fields.remove_at(index); | |
651 } | |
652 } | |
653 | |
654 void kill() { | |
655 _newobjects.trunc_to(0); | |
656 _objects.trunc_to(0); | |
657 _values.kill(); | |
658 } | |
659 }; | |
660 | |
661 | |
662 // Implementation of GraphBuilder's ScopeData | |
663 | |
664 GraphBuilder::ScopeData::ScopeData(ScopeData* parent) | |
665 : _parent(parent) | |
666 , _bci2block(NULL) | |
667 , _scope(NULL) | |
668 , _has_handler(false) | |
669 , _stream(NULL) | |
670 , _work_list(NULL) | |
671 , _parsing_jsr(false) | |
672 , _jsr_xhandlers(NULL) | |
673 , _caller_stack_size(-1) | |
674 , _continuation(NULL) | |
675 , _num_returns(0) | |
676 , _cleanup_block(NULL) | |
677 , _cleanup_return_prev(NULL) | |
678 , _cleanup_state(NULL) | |
679 { | |
680 if (parent != NULL) { | |
681 _max_inline_size = (intx) ((float) NestedInliningSizeRatio * (float) parent->max_inline_size() / 100.0f); | |
682 } else { | |
683 _max_inline_size = MaxInlineSize; | |
684 } | |
685 if (_max_inline_size < MaxTrivialSize) { | |
686 _max_inline_size = MaxTrivialSize; | |
687 } | |
688 } | |
689 | |
690 | |
691 void GraphBuilder::kill_all() { | |
692 if (UseLocalValueNumbering) { | |
693 vmap()->kill_all(); | |
694 } | |
695 _memory->kill(); | |
696 } | |
697 | |
698 | |
699 BlockBegin* GraphBuilder::ScopeData::block_at(int bci) { | |
700 if (parsing_jsr()) { | |
701 // It is necessary to clone all blocks associated with a | |
702 // subroutine, including those for exception handlers in the scope | |
703 // of the method containing the jsr (because those exception | |
704 // handlers may contain ret instructions in some cases). | |
705 BlockBegin* block = bci2block()->at(bci); | |
706 if (block != NULL && block == parent()->bci2block()->at(bci)) { | |
707 BlockBegin* new_block = new BlockBegin(block->bci()); | |
708 #ifndef PRODUCT | |
709 if (PrintInitialBlockList) { | |
710 tty->print_cr("CFG: cloned block %d (bci %d) as block %d for jsr", | |
711 block->block_id(), block->bci(), new_block->block_id()); | |
712 } | |
713 #endif | |
714 // copy data from cloned blocked | |
715 new_block->set_depth_first_number(block->depth_first_number()); | |
716 if (block->is_set(BlockBegin::parser_loop_header_flag)) new_block->set(BlockBegin::parser_loop_header_flag); | |
717 // Preserve certain flags for assertion checking | |
718 if (block->is_set(BlockBegin::subroutine_entry_flag)) new_block->set(BlockBegin::subroutine_entry_flag); | |
719 if (block->is_set(BlockBegin::exception_entry_flag)) new_block->set(BlockBegin::exception_entry_flag); | |
720 | |
721 // copy was_visited_flag to allow early detection of bailouts | |
722 // if a block that is used in a jsr has already been visited before, | |
723 // it is shared between the normal control flow and a subroutine | |
724 // BlockBegin::try_merge returns false when the flag is set, this leads | |
725 // to a compilation bailout | |
726 if (block->is_set(BlockBegin::was_visited_flag)) new_block->set(BlockBegin::was_visited_flag); | |
727 | |
728 bci2block()->at_put(bci, new_block); | |
729 block = new_block; | |
730 } | |
731 return block; | |
732 } else { | |
733 return bci2block()->at(bci); | |
734 } | |
735 } | |
736 | |
737 | |
738 XHandlers* GraphBuilder::ScopeData::xhandlers() const { | |
739 if (_jsr_xhandlers == NULL) { | |
740 assert(!parsing_jsr(), ""); | |
741 return scope()->xhandlers(); | |
742 } | |
743 assert(parsing_jsr(), ""); | |
744 return _jsr_xhandlers; | |
745 } | |
746 | |
747 | |
748 void GraphBuilder::ScopeData::set_scope(IRScope* scope) { | |
749 _scope = scope; | |
750 bool parent_has_handler = false; | |
751 if (parent() != NULL) { | |
752 parent_has_handler = parent()->has_handler(); | |
753 } | |
754 _has_handler = parent_has_handler || scope->xhandlers()->has_handlers(); | |
755 } | |
756 | |
757 | |
758 void GraphBuilder::ScopeData::set_inline_cleanup_info(BlockBegin* block, | |
759 Instruction* return_prev, | |
760 ValueStack* return_state) { | |
761 _cleanup_block = block; | |
762 _cleanup_return_prev = return_prev; | |
763 _cleanup_state = return_state; | |
764 } | |
765 | |
766 | |
767 void GraphBuilder::ScopeData::add_to_work_list(BlockBegin* block) { | |
768 if (_work_list == NULL) { | |
769 _work_list = new BlockList(); | |
770 } | |
771 | |
772 if (!block->is_set(BlockBegin::is_on_work_list_flag)) { | |
773 // Do not start parsing the continuation block while in a | |
774 // sub-scope | |
775 if (parsing_jsr()) { | |
776 if (block == jsr_continuation()) { | |
777 return; | |
778 } | |
779 } else { | |
780 if (block == continuation()) { | |
781 return; | |
782 } | |
783 } | |
784 block->set(BlockBegin::is_on_work_list_flag); | |
785 _work_list->push(block); | |
786 | |
787 sort_top_into_worklist(_work_list, block); | |
788 } | |
789 } | |
790 | |
791 | |
792 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) { | |
793 assert(worklist->top() == top, ""); | |
794 // sort block descending into work list | |
795 const int dfn = top->depth_first_number(); | |
796 assert(dfn != -1, "unknown depth first number"); | |
797 int i = worklist->length()-2; | |
798 while (i >= 0) { | |
799 BlockBegin* b = worklist->at(i); | |
800 if (b->depth_first_number() < dfn) { | |
801 worklist->at_put(i+1, b); | |
802 } else { | |
803 break; | |
804 } | |
805 i --; | |
806 } | |
807 if (i >= -1) worklist->at_put(i + 1, top); | |
808 } | |
809 | |
810 | |
811 BlockBegin* GraphBuilder::ScopeData::remove_from_work_list() { | |
812 if (is_work_list_empty()) { | |
813 return NULL; | |
814 } | |
815 return _work_list->pop(); | |
816 } | |
817 | |
818 | |
819 bool GraphBuilder::ScopeData::is_work_list_empty() const { | |
820 return (_work_list == NULL || _work_list->length() == 0); | |
821 } | |
822 | |
823 | |
824 void GraphBuilder::ScopeData::setup_jsr_xhandlers() { | |
825 assert(parsing_jsr(), ""); | |
826 // clone all the exception handlers from the scope | |
827 XHandlers* handlers = new XHandlers(scope()->xhandlers()); | |
828 const int n = handlers->length(); | |
829 for (int i = 0; i < n; i++) { | |
830 // The XHandlers need to be adjusted to dispatch to the cloned | |
831 // handler block instead of the default one but the synthetic | |
832 // unlocker needs to be handled specially. The synthetic unlocker | |
833 // should be left alone since there can be only one and all code | |
834 // should dispatch to the same one. | |
835 XHandler* h = handlers->handler_at(i); | |
1378
9f5b60a14736
6939930: exception unwind changes in 6919934 hurts compilation speed
never
parents:
1295
diff
changeset
|
836 assert(h->handler_bci() != SynchronizationEntryBCI, "must be real"); |
9f5b60a14736
6939930: exception unwind changes in 6919934 hurts compilation speed
never
parents:
1295
diff
changeset
|
837 h->set_entry_block(block_at(h->handler_bci())); |
0 | 838 } |
839 _jsr_xhandlers = handlers; | |
840 } | |
841 | |
842 | |
843 int GraphBuilder::ScopeData::num_returns() { | |
844 if (parsing_jsr()) { | |
845 return parent()->num_returns(); | |
846 } | |
847 return _num_returns; | |
848 } | |
849 | |
850 | |
851 void GraphBuilder::ScopeData::incr_num_returns() { | |
852 if (parsing_jsr()) { | |
853 parent()->incr_num_returns(); | |
854 } else { | |
855 ++_num_returns; | |
856 } | |
857 } | |
858 | |
859 | |
860 // Implementation of GraphBuilder | |
861 | |
862 #define INLINE_BAILOUT(msg) { inline_bailout(msg); return false; } | |
863 | |
864 | |
865 void GraphBuilder::load_constant() { | |
866 ciConstant con = stream()->get_constant(); | |
867 if (con.basic_type() == T_ILLEGAL) { | |
868 BAILOUT("could not resolve a constant"); | |
869 } else { | |
870 ValueType* t = illegalType; | |
871 ValueStack* patch_state = NULL; | |
872 switch (con.basic_type()) { | |
873 case T_BOOLEAN: t = new IntConstant (con.as_boolean()); break; | |
874 case T_BYTE : t = new IntConstant (con.as_byte ()); break; | |
875 case T_CHAR : t = new IntConstant (con.as_char ()); break; | |
876 case T_SHORT : t = new IntConstant (con.as_short ()); break; | |
877 case T_INT : t = new IntConstant (con.as_int ()); break; | |
878 case T_LONG : t = new LongConstant (con.as_long ()); break; | |
879 case T_FLOAT : t = new FloatConstant (con.as_float ()); break; | |
880 case T_DOUBLE : t = new DoubleConstant (con.as_double ()); break; | |
881 case T_ARRAY : t = new ArrayConstant (con.as_object ()->as_array ()); break; | |
882 case T_OBJECT : | |
883 { | |
884 ciObject* obj = con.as_object(); | |
1602 | 885 if (!obj->is_loaded() |
886 || (PatchALot && obj->klass() != ciEnv::current()->String_klass())) { | |
1819 | 887 patch_state = copy_state_before(); |
1602 | 888 t = new ObjectConstant(obj); |
0 | 889 } else { |
1602 | 890 assert(!obj->is_klass(), "must be java_mirror of klass"); |
0 | 891 t = new InstanceConstant(obj->as_instance()); |
892 } | |
893 break; | |
894 } | |
895 default : ShouldNotReachHere(); | |
896 } | |
897 Value x; | |
898 if (patch_state != NULL) { | |
899 x = new Constant(t, patch_state); | |
900 } else { | |
901 x = new Constant(t); | |
902 } | |
903 push(t, append(x)); | |
904 } | |
905 } | |
906 | |
907 | |
908 void GraphBuilder::load_local(ValueType* type, int index) { | |
1819 | 909 Value x = state()->local_at(index); |
910 assert(x != NULL && !x->type()->is_illegal(), "access of illegal local variable"); | |
0 | 911 push(type, x); |
912 } | |
913 | |
914 | |
915 void GraphBuilder::store_local(ValueType* type, int index) { | |
916 Value x = pop(type); | |
917 store_local(state(), x, type, index); | |
918 } | |
919 | |
920 | |
921 void GraphBuilder::store_local(ValueStack* state, Value x, ValueType* type, int index) { | |
922 if (parsing_jsr()) { | |
923 // We need to do additional tracking of the location of the return | |
924 // address for jsrs since we don't handle arbitrary jsr/ret | |
925 // constructs. Here we are figuring out in which circumstances we | |
926 // need to bail out. | |
927 if (x->type()->is_address()) { | |
928 scope_data()->set_jsr_return_address_local(index); | |
929 | |
930 // Also check parent jsrs (if any) at this time to see whether | |
931 // they are using this local. We don't handle skipping over a | |
932 // ret. | |
933 for (ScopeData* cur_scope_data = scope_data()->parent(); | |
934 cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope(); | |
935 cur_scope_data = cur_scope_data->parent()) { | |
936 if (cur_scope_data->jsr_return_address_local() == index) { | |
937 BAILOUT("subroutine overwrites return address from previous subroutine"); | |
938 } | |
939 } | |
940 } else if (index == scope_data()->jsr_return_address_local()) { | |
941 scope_data()->set_jsr_return_address_local(-1); | |
942 } | |
943 } | |
944 | |
945 state->store_local(index, round_fp(x)); | |
946 } | |
947 | |
948 | |
949 void GraphBuilder::load_indexed(BasicType type) { | |
1819 | 950 ValueStack* state_before = copy_state_for_exception(); |
0 | 951 Value index = ipop(); |
952 Value array = apop(); | |
953 Value length = NULL; | |
954 if (CSEArrayLength || | |
955 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) || | |
956 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) { | |
1819 | 957 length = append(new ArrayLength(array, state_before)); |
0 | 958 } |
1819 | 959 push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before))); |
0 | 960 } |
961 | |
962 | |
963 void GraphBuilder::store_indexed(BasicType type) { | |
1819 | 964 ValueStack* state_before = copy_state_for_exception(); |
0 | 965 Value value = pop(as_ValueType(type)); |
966 Value index = ipop(); | |
967 Value array = apop(); | |
968 Value length = NULL; | |
969 if (CSEArrayLength || | |
970 (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) || | |
971 (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant())) { | |
1819 | 972 length = append(new ArrayLength(array, state_before)); |
0 | 973 } |
1819 | 974 StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before); |
0 | 975 append(result); |
459 | 976 _memory->store_value(value); |
1791
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
977 |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
978 if (type == T_OBJECT && is_profiling()) { |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
979 // Note that we'd collect profile data in this method if we wanted it. |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
980 compilation()->set_would_profile(true); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
981 |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
982 if (profile_checkcasts()) { |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
983 result->set_profiled_method(method()); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
984 result->set_profiled_bci(bci()); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
985 result->set_should_profile(true); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
986 } |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
987 } |
0 | 988 } |
989 | |
990 | |
991 void GraphBuilder::stack_op(Bytecodes::Code code) { | |
992 switch (code) { | |
993 case Bytecodes::_pop: | |
994 { state()->raw_pop(); | |
995 } | |
996 break; | |
997 case Bytecodes::_pop2: | |
998 { state()->raw_pop(); | |
999 state()->raw_pop(); | |
1000 } | |
1001 break; | |
1002 case Bytecodes::_dup: | |
1003 { Value w = state()->raw_pop(); | |
1004 state()->raw_push(w); | |
1005 state()->raw_push(w); | |
1006 } | |
1007 break; | |
1008 case Bytecodes::_dup_x1: | |
1009 { Value w1 = state()->raw_pop(); | |
1010 Value w2 = state()->raw_pop(); | |
1011 state()->raw_push(w1); | |
1012 state()->raw_push(w2); | |
1013 state()->raw_push(w1); | |
1014 } | |
1015 break; | |
1016 case Bytecodes::_dup_x2: | |
1017 { Value w1 = state()->raw_pop(); | |
1018 Value w2 = state()->raw_pop(); | |
1019 Value w3 = state()->raw_pop(); | |
1020 state()->raw_push(w1); | |
1021 state()->raw_push(w3); | |
1022 state()->raw_push(w2); | |
1023 state()->raw_push(w1); | |
1024 } | |
1025 break; | |
1026 case Bytecodes::_dup2: | |
1027 { Value w1 = state()->raw_pop(); | |
1028 Value w2 = state()->raw_pop(); | |
1029 state()->raw_push(w2); | |
1030 state()->raw_push(w1); | |
1031 state()->raw_push(w2); | |
1032 state()->raw_push(w1); | |
1033 } | |
1034 break; | |
1035 case Bytecodes::_dup2_x1: | |
1036 { Value w1 = state()->raw_pop(); | |
1037 Value w2 = state()->raw_pop(); | |
1038 Value w3 = state()->raw_pop(); | |
1039 state()->raw_push(w2); | |
1040 state()->raw_push(w1); | |
1041 state()->raw_push(w3); | |
1042 state()->raw_push(w2); | |
1043 state()->raw_push(w1); | |
1044 } | |
1045 break; | |
1046 case Bytecodes::_dup2_x2: | |
1047 { Value w1 = state()->raw_pop(); | |
1048 Value w2 = state()->raw_pop(); | |
1049 Value w3 = state()->raw_pop(); | |
1050 Value w4 = state()->raw_pop(); | |
1051 state()->raw_push(w2); | |
1052 state()->raw_push(w1); | |
1053 state()->raw_push(w4); | |
1054 state()->raw_push(w3); | |
1055 state()->raw_push(w2); | |
1056 state()->raw_push(w1); | |
1057 } | |
1058 break; | |
1059 case Bytecodes::_swap: | |
1060 { Value w1 = state()->raw_pop(); | |
1061 Value w2 = state()->raw_pop(); | |
1062 state()->raw_push(w1); | |
1063 state()->raw_push(w2); | |
1064 } | |
1065 break; | |
1066 default: | |
1067 ShouldNotReachHere(); | |
1068 break; | |
1069 } | |
1070 } | |
1071 | |
1072 | |
1819 | 1073 void GraphBuilder::arithmetic_op(ValueType* type, Bytecodes::Code code, ValueStack* state_before) { |
0 | 1074 Value y = pop(type); |
1075 Value x = pop(type); | |
1076 // NOTE: strictfp can be queried from current method since we don't | |
1077 // inline methods with differing strictfp bits | |
1819 | 1078 Value res = new ArithmeticOp(code, x, y, method()->is_strict(), state_before); |
0 | 1079 // Note: currently single-precision floating-point rounding on Intel is handled at the LIRGenerator level |
1080 res = append(res); | |
1081 if (method()->is_strict()) { | |
1082 res = round_fp(res); | |
1083 } | |
1084 push(type, res); | |
1085 } | |
1086 | |
1087 | |
1088 void GraphBuilder::negate_op(ValueType* type) { | |
1089 push(type, append(new NegateOp(pop(type)))); | |
1090 } | |
1091 | |
1092 | |
1093 void GraphBuilder::shift_op(ValueType* type, Bytecodes::Code code) { | |
1094 Value s = ipop(); | |
1095 Value x = pop(type); | |
1096 // try to simplify | |
1097 // Note: This code should go into the canonicalizer as soon as it can | |
1098 // can handle canonicalized forms that contain more than one node. | |
1099 if (CanonicalizeNodes && code == Bytecodes::_iushr) { | |
1100 // pattern: x >>> s | |
1101 IntConstant* s1 = s->type()->as_IntConstant(); | |
1102 if (s1 != NULL) { | |
1103 // pattern: x >>> s1, with s1 constant | |
1104 ShiftOp* l = x->as_ShiftOp(); | |
1105 if (l != NULL && l->op() == Bytecodes::_ishl) { | |
1106 // pattern: (a << b) >>> s1 | |
1107 IntConstant* s0 = l->y()->type()->as_IntConstant(); | |
1108 if (s0 != NULL) { | |
1109 // pattern: (a << s0) >>> s1 | |
1110 const int s0c = s0->value() & 0x1F; // only the low 5 bits are significant for shifts | |
1111 const int s1c = s1->value() & 0x1F; // only the low 5 bits are significant for shifts | |
1112 if (s0c == s1c) { | |
1113 if (s0c == 0) { | |
1114 // pattern: (a << 0) >>> 0 => simplify to: a | |
1115 ipush(l->x()); | |
1116 } else { | |
1117 // pattern: (a << s0c) >>> s0c => simplify to: a & m, with m constant | |
1118 assert(0 < s0c && s0c < BitsPerInt, "adjust code below to handle corner cases"); | |
1119 const int m = (1 << (BitsPerInt - s0c)) - 1; | |
1120 Value s = append(new Constant(new IntConstant(m))); | |
1121 ipush(append(new LogicOp(Bytecodes::_iand, l->x(), s))); | |
1122 } | |
1123 return; | |
1124 } | |
1125 } | |
1126 } | |
1127 } | |
1128 } | |
1129 // could not simplify | |
1130 push(type, append(new ShiftOp(code, x, s))); | |
1131 } | |
1132 | |
1133 | |
1134 void GraphBuilder::logic_op(ValueType* type, Bytecodes::Code code) { | |
1135 Value y = pop(type); | |
1136 Value x = pop(type); | |
1137 push(type, append(new LogicOp(code, x, y))); | |
1138 } | |
1139 | |
1140 | |
1141 void GraphBuilder::compare_op(ValueType* type, Bytecodes::Code code) { | |
1819 | 1142 ValueStack* state_before = copy_state_before(); |
0 | 1143 Value y = pop(type); |
1144 Value x = pop(type); | |
1145 ipush(append(new CompareOp(code, x, y, state_before))); | |
1146 } | |
1147 | |
1148 | |
1149 void GraphBuilder::convert(Bytecodes::Code op, BasicType from, BasicType to) { | |
1150 push(as_ValueType(to), append(new Convert(op, pop(as_ValueType(from)), as_ValueType(to)))); | |
1151 } | |
1152 | |
1153 | |
1154 void GraphBuilder::increment() { | |
1155 int index = stream()->get_index(); | |
1156 int delta = stream()->is_wide() ? (signed short)Bytes::get_Java_u2(stream()->cur_bcp() + 4) : (signed char)(stream()->cur_bcp()[2]); | |
1157 load_local(intType, index); | |
1158 ipush(append(new Constant(new IntConstant(delta)))); | |
1159 arithmetic_op(intType, Bytecodes::_iadd); | |
1160 store_local(intType, index); | |
1161 } | |
1162 | |
1163 | |
1164 void GraphBuilder::_goto(int from_bci, int to_bci) { | |
1783 | 1165 Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci); |
1166 if (is_profiling()) { | |
1167 compilation()->set_would_profile(true); | |
1168 x->set_profiled_bci(bci()); | |
3997
940513efe83a
7097679: Tiered: events with bad bci to Gotos reduced from Ifs
iveresov
parents:
3901
diff
changeset
|
1169 if (profile_branches()) { |
940513efe83a
7097679: Tiered: events with bad bci to Gotos reduced from Ifs
iveresov
parents:
3901
diff
changeset
|
1170 x->set_profiled_method(method()); |
940513efe83a
7097679: Tiered: events with bad bci to Gotos reduced from Ifs
iveresov
parents:
3901
diff
changeset
|
1171 x->set_should_profile(true); |
940513efe83a
7097679: Tiered: events with bad bci to Gotos reduced from Ifs
iveresov
parents:
3901
diff
changeset
|
1172 } |
1783 | 1173 } |
1174 append(x); | |
0 | 1175 } |
1176 | |
1177 | |
1178 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) { | |
1179 BlockBegin* tsux = block_at(stream()->get_dest()); | |
1180 BlockBegin* fsux = block_at(stream()->next_bci()); | |
1181 bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci(); | |
1783 | 1182 Instruction *i = append(new If(x, cond, false, y, tsux, fsux, is_bb ? state_before : NULL, is_bb)); |
1183 | |
4943
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1184 assert(i->as_Goto() == NULL || |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1185 (i->as_Goto()->sux_at(0) == tsux && i->as_Goto()->is_safepoint() == tsux->bci() < stream()->cur_bci()) || |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1186 (i->as_Goto()->sux_at(0) == fsux && i->as_Goto()->is_safepoint() == fsux->bci() < stream()->cur_bci()), |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1187 "safepoint state of Goto returned by canonicalizer incorrect"); |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1188 |
1783 | 1189 if (is_profiling()) { |
1190 If* if_node = i->as_If(); | |
1191 if (if_node != NULL) { | |
1192 // Note that we'd collect profile data in this method if we wanted it. | |
1193 compilation()->set_would_profile(true); | |
1194 // At level 2 we need the proper bci to count backedges | |
1195 if_node->set_profiled_bci(bci()); | |
1196 if (profile_branches()) { | |
1197 // Successors can be rotated by the canonicalizer, check for this case. | |
1198 if_node->set_profiled_method(method()); | |
1199 if_node->set_should_profile(true); | |
1200 if (if_node->tsux() == fsux) { | |
1201 if_node->set_swapped(true); | |
1202 } | |
1203 } | |
1204 return; | |
1205 } | |
1206 | |
1207 // Check if this If was reduced to Goto. | |
1208 Goto *goto_node = i->as_Goto(); | |
1209 if (goto_node != NULL) { | |
1210 compilation()->set_would_profile(true); | |
3997
940513efe83a
7097679: Tiered: events with bad bci to Gotos reduced from Ifs
iveresov
parents:
3901
diff
changeset
|
1211 goto_node->set_profiled_bci(bci()); |
1783 | 1212 if (profile_branches()) { |
1213 goto_node->set_profiled_method(method()); | |
1214 goto_node->set_should_profile(true); | |
1215 // Find out which successor is used. | |
1216 if (goto_node->default_sux() == tsux) { | |
1217 goto_node->set_direction(Goto::taken); | |
1218 } else if (goto_node->default_sux() == fsux) { | |
1219 goto_node->set_direction(Goto::not_taken); | |
1220 } else { | |
1221 ShouldNotReachHere(); | |
1222 } | |
1223 } | |
1224 return; | |
1225 } | |
0 | 1226 } |
1227 } | |
1228 | |
1229 | |
1230 void GraphBuilder::if_zero(ValueType* type, If::Condition cond) { | |
1231 Value y = append(new Constant(intZero)); | |
1819 | 1232 ValueStack* state_before = copy_state_before(); |
0 | 1233 Value x = ipop(); |
1234 if_node(x, cond, y, state_before); | |
1235 } | |
1236 | |
1237 | |
1238 void GraphBuilder::if_null(ValueType* type, If::Condition cond) { | |
1239 Value y = append(new Constant(objectNull)); | |
1819 | 1240 ValueStack* state_before = copy_state_before(); |
0 | 1241 Value x = apop(); |
1242 if_node(x, cond, y, state_before); | |
1243 } | |
1244 | |
1245 | |
1246 void GraphBuilder::if_same(ValueType* type, If::Condition cond) { | |
1819 | 1247 ValueStack* state_before = copy_state_before(); |
0 | 1248 Value y = pop(type); |
1249 Value x = pop(type); | |
1250 if_node(x, cond, y, state_before); | |
1251 } | |
1252 | |
1253 | |
1254 void GraphBuilder::jsr(int dest) { | |
1255 // We only handle well-formed jsrs (those which are "block-structured"). | |
1256 // If the bytecodes are strange (jumping out of a jsr block) then we | |
1257 // might end up trying to re-parse a block containing a jsr which | |
1258 // has already been activated. Watch for this case and bail out. | |
1259 for (ScopeData* cur_scope_data = scope_data(); | |
1260 cur_scope_data != NULL && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope(); | |
1261 cur_scope_data = cur_scope_data->parent()) { | |
1262 if (cur_scope_data->jsr_entry_bci() == dest) { | |
1263 BAILOUT("too-complicated jsr/ret structure"); | |
1264 } | |
1265 } | |
1266 | |
1267 push(addressType, append(new Constant(new AddressConstant(next_bci())))); | |
1268 if (!try_inline_jsr(dest)) { | |
1269 return; // bailed out while parsing and inlining subroutine | |
1270 } | |
1271 } | |
1272 | |
1273 | |
1274 void GraphBuilder::ret(int local_index) { | |
1275 if (!parsing_jsr()) BAILOUT("ret encountered while not parsing subroutine"); | |
1276 | |
1277 if (local_index != scope_data()->jsr_return_address_local()) { | |
1278 BAILOUT("can not handle complicated jsr/ret constructs"); | |
1279 } | |
1280 | |
1281 // Rets simply become (NON-SAFEPOINT) gotos to the jsr continuation | |
1282 append(new Goto(scope_data()->jsr_continuation(), false)); | |
1283 } | |
1284 | |
1285 | |
1286 void GraphBuilder::table_switch() { | |
2142 | 1287 Bytecode_tableswitch sw(stream()); |
1288 const int l = sw.length(); | |
0 | 1289 if (CanonicalizeNodes && l == 1) { |
1290 // total of 2 successors => use If instead of switch | |
1291 // Note: This code should go into the canonicalizer as soon as it can | |
1292 // can handle canonicalized forms that contain more than one node. | |
2142 | 1293 Value key = append(new Constant(new IntConstant(sw.low_key()))); |
1294 BlockBegin* tsux = block_at(bci() + sw.dest_offset_at(0)); | |
1295 BlockBegin* fsux = block_at(bci() + sw.default_offset()); | |
0 | 1296 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci(); |
1819 | 1297 ValueStack* state_before = is_bb ? copy_state_before() : NULL; |
0 | 1298 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb)); |
1299 } else { | |
1300 // collect successors | |
1301 BlockList* sux = new BlockList(l + 1, NULL); | |
1302 int i; | |
1303 bool has_bb = false; | |
1304 for (i = 0; i < l; i++) { | |
2142 | 1305 sux->at_put(i, block_at(bci() + sw.dest_offset_at(i))); |
1306 if (sw.dest_offset_at(i) < 0) has_bb = true; | |
0 | 1307 } |
1308 // add default successor | |
5925
4fabc16dc5bf
6910464: Lookupswitch and Tableswitch default branches not recognized as safepoints
roland
parents:
4943
diff
changeset
|
1309 if (sw.default_offset() < 0) has_bb = true; |
2142 | 1310 sux->at_put(i, block_at(bci() + sw.default_offset())); |
1819 | 1311 ValueStack* state_before = has_bb ? copy_state_before() : NULL; |
4943
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1312 Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb)); |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1313 #ifdef ASSERT |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1314 if (res->as_Goto()) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1315 for (i = 0; i < l; i++) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1316 if (sux->at(i) == res->as_Goto()->sux_at(0)) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1317 assert(res->as_Goto()->is_safepoint() == sw.dest_offset_at(i) < 0, "safepoint state of Goto returned by canonicalizer incorrect"); |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1318 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1319 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1320 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1321 #endif |
0 | 1322 } |
1323 } | |
1324 | |
1325 | |
1326 void GraphBuilder::lookup_switch() { | |
2142 | 1327 Bytecode_lookupswitch sw(stream()); |
1328 const int l = sw.number_of_pairs(); | |
0 | 1329 if (CanonicalizeNodes && l == 1) { |
1330 // total of 2 successors => use If instead of switch | |
1331 // Note: This code should go into the canonicalizer as soon as it can | |
1332 // can handle canonicalized forms that contain more than one node. | |
1333 // simplify to If | |
2142 | 1334 LookupswitchPair pair = sw.pair_at(0); |
1335 Value key = append(new Constant(new IntConstant(pair.match()))); | |
1336 BlockBegin* tsux = block_at(bci() + pair.offset()); | |
1337 BlockBegin* fsux = block_at(bci() + sw.default_offset()); | |
0 | 1338 bool is_bb = tsux->bci() < bci() || fsux->bci() < bci(); |
1819 | 1339 ValueStack* state_before = is_bb ? copy_state_before() : NULL; |
0 | 1340 append(new If(ipop(), If::eql, true, key, tsux, fsux, state_before, is_bb)); |
1341 } else { | |
1342 // collect successors & keys | |
1343 BlockList* sux = new BlockList(l + 1, NULL); | |
1344 intArray* keys = new intArray(l, 0); | |
1345 int i; | |
1346 bool has_bb = false; | |
1347 for (i = 0; i < l; i++) { | |
2142 | 1348 LookupswitchPair pair = sw.pair_at(i); |
1349 if (pair.offset() < 0) has_bb = true; | |
1350 sux->at_put(i, block_at(bci() + pair.offset())); | |
1351 keys->at_put(i, pair.match()); | |
0 | 1352 } |
1353 // add default successor | |
5925
4fabc16dc5bf
6910464: Lookupswitch and Tableswitch default branches not recognized as safepoints
roland
parents:
4943
diff
changeset
|
1354 if (sw.default_offset() < 0) has_bb = true; |
2142 | 1355 sux->at_put(i, block_at(bci() + sw.default_offset())); |
1819 | 1356 ValueStack* state_before = has_bb ? copy_state_before() : NULL; |
4943
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1357 Instruction* res = append(new LookupSwitch(ipop(), sux, keys, state_before, has_bb)); |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1358 #ifdef ASSERT |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1359 if (res->as_Goto()) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1360 for (i = 0; i < l; i++) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1361 if (sux->at(i) == res->as_Goto()->sux_at(0)) { |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1362 assert(res->as_Goto()->is_safepoint() == sw.pair_at(i).offset() < 0, "safepoint state of Goto returned by canonicalizer incorrect"); |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1363 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1364 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1365 } |
80107dc493db
7126041: jdk7u4 b05 and b06 crash with RubyMine 3.2.4, works well with b04
roland
parents:
4871
diff
changeset
|
1366 #endif |
0 | 1367 } |
1368 } | |
1369 | |
1370 void GraphBuilder::call_register_finalizer() { | |
1371 // If the receiver requires finalization then emit code to perform | |
1372 // the registration on return. | |
1373 | |
1374 // Gather some type information about the receiver | |
1819 | 1375 Value receiver = state()->local_at(0); |
0 | 1376 assert(receiver != NULL, "must have a receiver"); |
1377 ciType* declared_type = receiver->declared_type(); | |
1378 ciType* exact_type = receiver->exact_type(); | |
1379 if (exact_type == NULL && | |
1380 receiver->as_Local() && | |
1381 receiver->as_Local()->java_index() == 0) { | |
1382 ciInstanceKlass* ik = compilation()->method()->holder(); | |
1383 if (ik->is_final()) { | |
1384 exact_type = ik; | |
1385 } else if (UseCHA && !(ik->has_subklass() || ik->is_interface())) { | |
1386 // test class is leaf class | |
1387 compilation()->dependency_recorder()->assert_leaf_type(ik); | |
1388 exact_type = ik; | |
1389 } else { | |
1390 declared_type = ik; | |
1391 } | |
1392 } | |
1393 | |
1394 // see if we know statically that registration isn't required | |
1395 bool needs_check = true; | |
1396 if (exact_type != NULL) { | |
1397 needs_check = exact_type->as_instance_klass()->has_finalizer(); | |
1398 } else if (declared_type != NULL) { | |
1399 ciInstanceKlass* ik = declared_type->as_instance_klass(); | |
1400 if (!Dependencies::has_finalizable_subclass(ik)) { | |
1401 compilation()->dependency_recorder()->assert_has_no_finalizable_subclasses(ik); | |
1402 needs_check = false; | |
1403 } | |
1404 } | |
1405 | |
1406 if (needs_check) { | |
1407 // Perform the registration of finalizable objects. | |
1819 | 1408 ValueStack* state_before = copy_state_for_exception(); |
0 | 1409 load_local(objectType, 0); |
1410 append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init, | |
1411 state()->pop_arguments(1), | |
1819 | 1412 true, state_before, true)); |
0 | 1413 } |
1414 } | |
1415 | |
1416 | |
1417 void GraphBuilder::method_return(Value x) { | |
1418 if (RegisterFinalizersAtInit && | |
1419 method()->intrinsic_id() == vmIntrinsics::_Object_init) { | |
1420 call_register_finalizer(); | |
1421 } | |
1422 | |
1423 // Check to see whether we are inlining. If so, Return | |
1424 // instructions become Gotos to the continuation point. | |
1425 if (continuation() != NULL) { | |
1426 assert(!method()->is_synchronized() || InlineSynchronizedMethods, "can not inline synchronized methods yet"); | |
1427 | |
2166
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1428 if (compilation()->env()->dtrace_method_probes()) { |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1429 // Report exit from inline methods |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1430 Values* args = new Values(1); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1431 args->push(append(new Constant(new ObjectConstant(method())))); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1432 append(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args)); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1433 } |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
1434 |
0 | 1435 // If the inlined method is synchronized, the monitor must be |
1436 // released before we jump to the continuation block. | |
1437 if (method()->is_synchronized()) { | |
1819 | 1438 assert(state()->locks_size() == 1, "receiver must be locked here"); |
1439 monitorexit(state()->lock_at(0), SynchronizationEntryBCI); | |
0 | 1440 } |
1441 | |
1819 | 1442 // State at end of inlined method is the state of the caller |
1443 // without the method parameters on stack, including the | |
1444 // return value, if any, of the inlined method on operand stack. | |
1445 set_state(state()->caller_state()->copy_for_parsing()); | |
0 | 1446 if (x != NULL) { |
1447 state()->push(x->type(), x); | |
1448 } | |
1449 Goto* goto_callee = new Goto(continuation(), false); | |
1450 | |
1451 // See whether this is the first return; if so, store off some | |
1452 // of the state for later examination | |
1453 if (num_returns() == 0) { | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1454 set_inline_cleanup_info(); |
0 | 1455 } |
1456 | |
1457 // The current bci() is in the wrong scope, so use the bci() of | |
1458 // the continuation point. | |
1459 append_with_bci(goto_callee, scope_data()->continuation()->bci()); | |
1460 incr_num_returns(); | |
1461 | |
1462 return; | |
1463 } | |
1464 | |
1465 state()->truncate_stack(0); | |
1466 if (method()->is_synchronized()) { | |
1467 // perform the unlocking before exiting the method | |
1468 Value receiver; | |
1469 if (!method()->is_static()) { | |
1470 receiver = _initial_state->local_at(0); | |
1471 } else { | |
1472 receiver = append(new Constant(new ClassConstant(method()->holder()))); | |
1473 } | |
1474 append_split(new MonitorExit(receiver, state()->unlock())); | |
1475 } | |
1476 | |
1477 append(new Return(x)); | |
1478 } | |
1479 | |
1480 | |
1481 void GraphBuilder::access_field(Bytecodes::Code code) { | |
1482 bool will_link; | |
1483 ciField* field = stream()->get_field(will_link); | |
1484 ciInstanceKlass* holder = field->holder(); | |
1485 BasicType field_type = field->type()->basic_type(); | |
1486 ValueType* type = as_ValueType(field_type); | |
1487 // call will_link again to determine if the field is valid. | |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1488 const bool needs_patching = !holder->is_loaded() || |
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1489 !field->will_link(method()->holder(), code) || |
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1490 PatchALot; |
0 | 1491 |
1819 | 1492 ValueStack* state_before = NULL; |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1493 if (!holder->is_initialized() || needs_patching) { |
0 | 1494 // save state before instruction for debug info when |
1495 // deoptimization happens during patching | |
1819 | 1496 state_before = copy_state_before(); |
0 | 1497 } |
1498 | |
1499 Value obj = NULL; | |
1500 if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) { | |
1819 | 1501 if (state_before != NULL) { |
0 | 1502 // build a patching constant |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2352
diff
changeset
|
1503 obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before); |
0 | 1504 } else { |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2352
diff
changeset
|
1505 obj = new Constant(new InstanceConstant(holder->java_mirror())); |
0 | 1506 } |
1507 } | |
1508 | |
1509 | |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1510 const int offset = !needs_patching ? field->offset() : -1; |
0 | 1511 switch (code) { |
1512 case Bytecodes::_getstatic: { | |
1513 // check for compile-time constants, i.e., initialized static final fields | |
1514 Instruction* constant = NULL; | |
1515 if (field->is_constant() && !PatchALot) { | |
1516 ciConstant field_val = field->constant_value(); | |
1517 BasicType field_type = field_val.basic_type(); | |
1518 switch (field_type) { | |
1519 case T_ARRAY: | |
1520 case T_OBJECT: | |
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
844
diff
changeset
|
1521 if (field_val.as_object()->should_be_constant()) { |
0 | 1522 constant = new Constant(as_ValueType(field_val)); |
1523 } | |
1524 break; | |
1525 | |
1526 default: | |
1527 constant = new Constant(as_ValueType(field_val)); | |
1528 } | |
1529 } | |
1530 if (constant != NULL) { | |
1531 push(type, append(constant)); | |
1532 } else { | |
1819 | 1533 if (state_before == NULL) { |
1534 state_before = copy_state_for_exception(); | |
1535 } | |
0 | 1536 push(type, append(new LoadField(append(obj), offset, field, true, |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1537 state_before, needs_patching))); |
0 | 1538 } |
1539 break; | |
1540 } | |
1541 case Bytecodes::_putstatic: | |
1542 { Value val = pop(type); | |
1819 | 1543 if (state_before == NULL) { |
1544 state_before = copy_state_for_exception(); | |
1545 } | |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1546 append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching)); |
0 | 1547 } |
1548 break; | |
1549 case Bytecodes::_getfield : | |
1550 { | |
1819 | 1551 if (state_before == NULL) { |
1552 state_before = copy_state_for_exception(); | |
1553 } | |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1554 LoadField* load = new LoadField(apop(), offset, field, false, state_before, needs_patching); |
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1555 Value replacement = !needs_patching ? _memory->load(load) : load; |
0 | 1556 if (replacement != load) { |
1819 | 1557 assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked"); |
0 | 1558 push(type, replacement); |
1559 } else { | |
1560 push(type, append(load)); | |
1561 } | |
1562 break; | |
1563 } | |
1564 | |
1565 case Bytecodes::_putfield : | |
1566 { Value val = pop(type); | |
1819 | 1567 if (state_before == NULL) { |
1568 state_before = copy_state_for_exception(); | |
1569 } | |
2352
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1570 StoreField* store = new StoreField(apop(), offset, field, val, false, state_before, needs_patching); |
425688247f3d
6965570: assert(!needs_patching && x->is_loaded(),"how do we know it's volatile if it's not loaded")
never
parents:
2318
diff
changeset
|
1571 if (!needs_patching) store = _memory->store(store); |
0 | 1572 if (store != NULL) { |
1573 append(store); | |
1574 } | |
1575 } | |
1576 break; | |
1577 default : | |
1578 ShouldNotReachHere(); | |
1579 break; | |
1580 } | |
1581 } | |
1582 | |
1583 | |
1584 Dependencies* GraphBuilder::dependency_recorder() const { | |
1585 assert(DeoptC1, "need debug information"); | |
1586 return compilation()->dependency_recorder(); | |
1587 } | |
1588 | |
1589 | |
1590 void GraphBuilder::invoke(Bytecodes::Code code) { | |
1591 bool will_link; | |
1592 ciMethod* target = stream()->get_method(will_link); | |
1593 // we have to make sure the argument size (incl. the receiver) | |
1594 // is correct for compilation (the call would fail later during | |
1595 // linkage anyway) - was bug (gri 7/28/99) | |
1596 if (target->is_loaded() && target->is_static() != (code == Bytecodes::_invokestatic)) BAILOUT("will cause link error"); | |
1597 ciInstanceKlass* klass = target->holder(); | |
1598 | |
1599 // check if CHA possible: if so, change the code to invoke_special | |
1600 ciInstanceKlass* calling_klass = method()->holder(); | |
1601 ciKlass* holder = stream()->get_declared_method_holder(); | |
1602 ciInstanceKlass* callee_holder = ciEnv::get_instance_klass_for_declared_method_holder(holder); | |
1603 ciInstanceKlass* actual_recv = callee_holder; | |
1604 | |
1605 // some methods are obviously bindable without any type checks so | |
1606 // convert them directly to an invokespecial. | |
1607 if (target->is_loaded() && !target->is_abstract() && | |
1608 target->can_be_statically_bound() && code == Bytecodes::_invokevirtual) { | |
1609 code = Bytecodes::_invokespecial; | |
1610 } | |
1611 | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1612 bool is_invokedynamic = code == Bytecodes::_invokedynamic; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1613 |
0 | 1614 // NEEDS_CLEANUP |
1615 // I've added the target-is_loaded() test below but I don't really understand | |
1616 // how klass->is_loaded() can be true and yet target->is_loaded() is false. | |
1617 // this happened while running the JCK invokevirtual tests under doit. TKR | |
1618 ciMethod* cha_monomorphic_target = NULL; | |
1619 ciMethod* exact_target = NULL; | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1620 Value better_receiver = NULL; |
1295 | 1621 if (UseCHA && DeoptC1 && klass->is_loaded() && target->is_loaded() && |
1622 !target->is_method_handle_invoke()) { | |
0 | 1623 Value receiver = NULL; |
1624 ciInstanceKlass* receiver_klass = NULL; | |
1625 bool type_is_exact = false; | |
1626 // try to find a precise receiver type | |
1627 if (will_link && !target->is_static()) { | |
1628 int index = state()->stack_size() - (target->arg_size_no_receiver() + 1); | |
1629 receiver = state()->stack_at(index); | |
1630 ciType* type = receiver->exact_type(); | |
1631 if (type != NULL && type->is_loaded() && | |
1632 type->is_instance_klass() && !type->as_instance_klass()->is_interface()) { | |
1633 receiver_klass = (ciInstanceKlass*) type; | |
1634 type_is_exact = true; | |
1635 } | |
1636 if (type == NULL) { | |
1637 type = receiver->declared_type(); | |
1638 if (type != NULL && type->is_loaded() && | |
1639 type->is_instance_klass() && !type->as_instance_klass()->is_interface()) { | |
1640 receiver_klass = (ciInstanceKlass*) type; | |
1641 if (receiver_klass->is_leaf_type() && !receiver_klass->is_final()) { | |
1642 // Insert a dependency on this type since | |
1643 // find_monomorphic_target may assume it's already done. | |
1644 dependency_recorder()->assert_leaf_type(receiver_klass); | |
1645 type_is_exact = true; | |
1646 } | |
1647 } | |
1648 } | |
1649 } | |
1650 if (receiver_klass != NULL && type_is_exact && | |
1651 receiver_klass->is_loaded() && code != Bytecodes::_invokespecial) { | |
1652 // If we have the exact receiver type we can bind directly to | |
1653 // the method to call. | |
1654 exact_target = target->resolve_invoke(calling_klass, receiver_klass); | |
1655 if (exact_target != NULL) { | |
1656 target = exact_target; | |
1657 code = Bytecodes::_invokespecial; | |
1658 } | |
1659 } | |
1660 if (receiver_klass != NULL && | |
1661 receiver_klass->is_subtype_of(actual_recv) && | |
1662 actual_recv->is_initialized()) { | |
1663 actual_recv = receiver_klass; | |
1664 } | |
1665 | |
1666 if ((code == Bytecodes::_invokevirtual && callee_holder->is_initialized()) || | |
1667 (code == Bytecodes::_invokeinterface && callee_holder->is_initialized() && !actual_recv->is_interface())) { | |
1668 // Use CHA on the receiver to select a more precise method. | |
1669 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, callee_holder, actual_recv); | |
1670 } else if (code == Bytecodes::_invokeinterface && callee_holder->is_loaded() && receiver != NULL) { | |
1671 // if there is only one implementor of this interface then we | |
1672 // may be able bind this invoke directly to the implementing | |
1673 // klass but we need both a dependence on the single interface | |
1674 // and on the method we bind to. Additionally since all we know | |
1675 // about the receiver type is the it's supposed to implement the | |
1676 // interface we have to insert a check that it's the class we | |
1677 // expect. Interface types are not checked by the verifier so | |
1678 // they are roughly equivalent to Object. | |
1679 ciInstanceKlass* singleton = NULL; | |
1680 if (target->holder()->nof_implementors() == 1) { | |
1681 singleton = target->holder()->implementor(0); | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1682 |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1683 assert(holder->is_interface(), "invokeinterface to non interface?"); |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1684 ciInstanceKlass* decl_interface = (ciInstanceKlass*)holder; |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1685 // the number of implementors for decl_interface is less or |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1686 // equal to the number of implementors for target->holder() so |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1687 // if number of implementors of target->holder() == 1 then |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1688 // number of implementors for decl_interface is 0 or 1. If |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1689 // it's 0 then no class implements decl_interface and there's |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1690 // no point in inlining. |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1691 if (!holder->is_loaded() || decl_interface->nof_implementors() != 1) { |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1692 singleton = NULL; |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1693 } |
0 | 1694 } |
1695 if (singleton) { | |
1696 cha_monomorphic_target = target->find_monomorphic_target(calling_klass, target->holder(), singleton); | |
1697 if (cha_monomorphic_target != NULL) { | |
1698 // If CHA is able to bind this invoke then update the class | |
1699 // to match that class, otherwise klass will refer to the | |
1700 // interface. | |
1701 klass = cha_monomorphic_target->holder(); | |
1702 actual_recv = target->holder(); | |
1703 | |
1704 // insert a check it's really the expected class. | |
1819 | 1705 CheckCast* c = new CheckCast(klass, receiver, copy_state_for_exception()); |
0 | 1706 c->set_incompatible_class_change_check(); |
1707 c->set_direct_compare(klass->is_final()); | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1708 // pass the result of the checkcast so that the compiler has |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1709 // more accurate type info in the inlinee |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1710 better_receiver = append_split(c); |
0 | 1711 } |
1712 } | |
1713 } | |
1714 } | |
1715 | |
1716 if (cha_monomorphic_target != NULL) { | |
1717 if (cha_monomorphic_target->is_abstract()) { | |
1718 // Do not optimize for abstract methods | |
1719 cha_monomorphic_target = NULL; | |
1720 } | |
1721 } | |
1722 | |
1723 if (cha_monomorphic_target != NULL) { | |
1724 if (!(target->is_final_method())) { | |
1725 // If we inlined because CHA revealed only a single target method, | |
1726 // then we are dependent on that target method not getting overridden | |
1727 // by dynamic class loading. Be sure to test the "static" receiver | |
1728 // dest_method here, as opposed to the actual receiver, which may | |
1729 // falsely lead us to believe that the receiver is final or private. | |
1730 dependency_recorder()->assert_unique_concrete_method(actual_recv, cha_monomorphic_target); | |
1731 } | |
1732 code = Bytecodes::_invokespecial; | |
1733 } | |
1734 // check if we could do inlining | |
1735 if (!PatchALot && Inline && klass->is_loaded() && | |
1736 (klass->is_initialized() || klass->is_interface() && target->holder()->is_initialized()) | |
1737 && target->will_link(klass, callee_holder, code)) { | |
1738 // callee is known => check if we have static binding | |
1739 assert(target->is_loaded(), "callee must be known"); | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1740 if (code == Bytecodes::_invokestatic || |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1741 code == Bytecodes::_invokespecial || |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1742 code == Bytecodes::_invokevirtual && target->is_final_method() || |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1743 code == Bytecodes::_invokedynamic) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1744 ciMethod* inline_target = (cha_monomorphic_target != NULL) ? cha_monomorphic_target : target; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1745 bool success = false; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1746 if (target->is_method_handle_invoke()) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1747 // method handle invokes |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1748 success = !is_invokedynamic ? for_method_handle_inline(target) : for_invokedynamic_inline(target); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1749 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1750 if (!success) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1751 // static binding => check if callee is ok |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
1752 success = try_inline(inline_target, (cha_monomorphic_target != NULL) || (exact_target != NULL), better_receiver); |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1753 } |
0 | 1754 CHECK_BAILOUT(); |
1755 | |
1756 #ifndef PRODUCT | |
1757 // printing | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1758 if (PrintInlining && !success) { |
0 | 1759 // if it was successfully inlined, then it was already printed. |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1760 print_inline_result(inline_target, success); |
0 | 1761 } |
1762 #endif | |
1763 clear_inline_bailout(); | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
1764 if (success) { |
0 | 1765 // Register dependence if JVMTI has either breakpoint |
1766 // setting or hotswapping of methods capabilities since they may | |
1767 // cause deoptimization. | |
780
c96bf21b756f
6788527: Server vm intermittently fails with assertion "live value must not be garbage" with fastdebug bits
kvn
parents:
726
diff
changeset
|
1768 if (compilation()->env()->jvmti_can_hotswap_or_post_breakpoint()) { |
0 | 1769 dependency_recorder()->assert_evol_method(inline_target); |
1770 } | |
1771 return; | |
1772 } | |
1773 } | |
1774 } | |
1775 // If we attempted an inline which did not succeed because of a | |
1776 // bailout during construction of the callee graph, the entire | |
1777 // compilation has to be aborted. This is fairly rare and currently | |
1778 // seems to only occur for jasm-generated classes which contain | |
1779 // jsr/ret pairs which are not associated with finally clauses and | |
1780 // do not have exception handlers in the containing method, and are | |
1781 // therefore not caught early enough to abort the inlining without | |
1782 // corrupting the graph. (We currently bail out with a non-empty | |
1783 // stack at a ret in these situations.) | |
1784 CHECK_BAILOUT(); | |
1785 | |
1786 // inlining not successful => standard invoke | |
1295 | 1787 bool is_loaded = target->is_loaded(); |
1788 bool has_receiver = | |
1789 code == Bytecodes::_invokespecial || | |
1790 code == Bytecodes::_invokevirtual || | |
1791 code == Bytecodes::_invokeinterface; | |
0 | 1792 ValueType* result_type = as_ValueType(target->return_type()); |
1295 | 1793 |
1794 // We require the debug info to be the "state before" because | |
1795 // invokedynamics may deoptimize. | |
1819 | 1796 ValueStack* state_before = is_invokedynamic ? copy_state_before() : copy_state_exhandling(); |
1295 | 1797 |
0 | 1798 Values* args = state()->pop_arguments(target->arg_size_no_receiver()); |
1295 | 1799 Value recv = has_receiver ? apop() : NULL; |
0 | 1800 int vtable_index = methodOopDesc::invalid_vtable_index; |
1801 | |
1802 #ifdef SPARC | |
1803 // Currently only supported on Sparc. | |
1804 // The UseInlineCaches only controls dispatch to invokevirtuals for | |
1805 // loaded classes which we weren't able to statically bind. | |
1806 if (!UseInlineCaches && is_loaded && code == Bytecodes::_invokevirtual | |
1807 && !target->can_be_statically_bound()) { | |
1808 // Find a vtable index if one is available | |
1809 vtable_index = target->resolve_vtable_index(calling_klass, callee_holder); | |
1810 } | |
1811 #endif | |
1812 | |
1813 if (recv != NULL && | |
1814 (code == Bytecodes::_invokespecial || | |
1783 | 1815 !is_loaded || target->is_final())) { |
0 | 1816 // invokespecial always needs a NULL check. invokevirtual where |
1817 // the target is final or where it's not known that whether the | |
1818 // target is final requires a NULL check. Otherwise normal | |
1819 // invokevirtual will perform the null check during the lookup | |
1820 // logic or the unverified entry point. Profiling of calls | |
1821 // requires that the null check is performed in all cases. | |
1822 null_check(recv); | |
1823 } | |
1824 | |
1783 | 1825 if (is_profiling()) { |
1826 if (recv != NULL && profile_calls()) { | |
1827 null_check(recv); | |
0 | 1828 } |
1783 | 1829 // Note that we'd collect profile data in this method if we wanted it. |
1830 compilation()->set_would_profile(true); | |
1831 | |
1832 if (profile_calls()) { | |
1833 assert(cha_monomorphic_target == NULL || exact_target == NULL, "both can not be set"); | |
1834 ciKlass* target_klass = NULL; | |
1835 if (cha_monomorphic_target != NULL) { | |
1836 target_klass = cha_monomorphic_target->holder(); | |
1837 } else if (exact_target != NULL) { | |
1838 target_klass = exact_target->holder(); | |
1839 } | |
1840 profile_call(recv, target_klass); | |
1841 } | |
0 | 1842 } |
1843 | |
1295 | 1844 Invoke* result = new Invoke(code, result_type, recv, args, vtable_index, target, state_before); |
0 | 1845 // push result |
1846 append_split(result); | |
1847 | |
1848 if (result_type != voidType) { | |
1849 if (method()->is_strict()) { | |
1850 push(result_type, round_fp(result)); | |
1851 } else { | |
1852 push(result_type, result); | |
1853 } | |
1854 } | |
1855 } | |
1856 | |
1857 | |
1858 void GraphBuilder::new_instance(int klass_index) { | |
1819 | 1859 ValueStack* state_before = copy_state_exhandling(); |
0 | 1860 bool will_link; |
1861 ciKlass* klass = stream()->get_klass(will_link); | |
1862 assert(klass->is_instance_klass(), "must be an instance klass"); | |
1819 | 1863 NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before); |
0 | 1864 _memory->new_instance(new_instance); |
1865 apush(append_split(new_instance)); | |
1866 } | |
1867 | |
1868 | |
1869 void GraphBuilder::new_type_array() { | |
1819 | 1870 ValueStack* state_before = copy_state_exhandling(); |
1871 apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before))); | |
0 | 1872 } |
1873 | |
1874 | |
1875 void GraphBuilder::new_object_array() { | |
1876 bool will_link; | |
1877 ciKlass* klass = stream()->get_klass(will_link); | |
1819 | 1878 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
0 | 1879 NewArray* n = new NewObjectArray(klass, ipop(), state_before); |
1880 apush(append_split(n)); | |
1881 } | |
1882 | |
1883 | |
1884 bool GraphBuilder::direct_compare(ciKlass* k) { | |
1885 if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) { | |
1886 ciInstanceKlass* ik = k->as_instance_klass(); | |
1887 if (ik->is_final()) { | |
1888 return true; | |
1889 } else { | |
1890 if (DeoptC1 && UseCHA && !(ik->has_subklass() || ik->is_interface())) { | |
1891 // test class is leaf class | |
1892 dependency_recorder()->assert_leaf_type(ik); | |
1893 return true; | |
1894 } | |
1895 } | |
1896 } | |
1897 return false; | |
1898 } | |
1899 | |
1900 | |
1901 void GraphBuilder::check_cast(int klass_index) { | |
1902 bool will_link; | |
1903 ciKlass* klass = stream()->get_klass(will_link); | |
1819 | 1904 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_for_exception(); |
0 | 1905 CheckCast* c = new CheckCast(klass, apop(), state_before); |
1906 apush(append_split(c)); | |
1907 c->set_direct_compare(direct_compare(klass)); | |
1783 | 1908 |
1909 if (is_profiling()) { | |
1910 // Note that we'd collect profile data in this method if we wanted it. | |
1911 compilation()->set_would_profile(true); | |
1912 | |
1913 if (profile_checkcasts()) { | |
1914 c->set_profiled_method(method()); | |
1915 c->set_profiled_bci(bci()); | |
1916 c->set_should_profile(true); | |
1917 } | |
0 | 1918 } |
1919 } | |
1920 | |
1921 | |
1922 void GraphBuilder::instance_of(int klass_index) { | |
1923 bool will_link; | |
1924 ciKlass* klass = stream()->get_klass(will_link); | |
1819 | 1925 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
0 | 1926 InstanceOf* i = new InstanceOf(klass, apop(), state_before); |
1927 ipush(append_split(i)); | |
1928 i->set_direct_compare(direct_compare(klass)); | |
1791
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1929 |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1930 if (is_profiling()) { |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1931 // Note that we'd collect profile data in this method if we wanted it. |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1932 compilation()->set_would_profile(true); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1933 |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1934 if (profile_checkcasts()) { |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1935 i->set_profiled_method(method()); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1936 i->set_profiled_bci(bci()); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1937 i->set_should_profile(true); |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1938 } |
3a294e483abc
6919069: client compiler needs to capture more profile information for tiered work
iveresov
parents:
1783
diff
changeset
|
1939 } |
0 | 1940 } |
1941 | |
1942 | |
1943 void GraphBuilder::monitorenter(Value x, int bci) { | |
1944 // save state before locking in case of deoptimization after a NullPointerException | |
1819 | 1945 ValueStack* state_before = copy_state_for_exception_with_bci(bci); |
1946 append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci); | |
0 | 1947 kill_all(); |
1948 } | |
1949 | |
1950 | |
1951 void GraphBuilder::monitorexit(Value x, int bci) { | |
1952 append_with_bci(new MonitorExit(x, state()->unlock()), bci); | |
1953 kill_all(); | |
1954 } | |
1955 | |
1956 | |
1957 void GraphBuilder::new_multi_array(int dimensions) { | |
1958 bool will_link; | |
1959 ciKlass* klass = stream()->get_klass(will_link); | |
1819 | 1960 ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling(); |
0 | 1961 |
1962 Values* dims = new Values(dimensions, NULL); | |
1963 // fill in all dimensions | |
1964 int i = dimensions; | |
1965 while (i-- > 0) dims->at_put(i, ipop()); | |
1966 // create array | |
1967 NewArray* n = new NewMultiArray(klass, dims, state_before); | |
1968 apush(append_split(n)); | |
1969 } | |
1970 | |
1971 | |
1972 void GraphBuilder::throw_op(int bci) { | |
1973 // We require that the debug info for a Throw be the "state before" | |
1974 // the Throw (i.e., exception oop is still on TOS) | |
1819 | 1975 ValueStack* state_before = copy_state_before_with_bci(bci); |
0 | 1976 Throw* t = new Throw(apop(), state_before); |
1819 | 1977 // operand stack not needed after a throw |
1978 state()->truncate_stack(0); | |
0 | 1979 append_with_bci(t, bci); |
1980 } | |
1981 | |
1982 | |
1983 Value GraphBuilder::round_fp(Value fp_value) { | |
1984 // no rounding needed if SSE2 is used | |
1985 if (RoundFPResults && UseSSE < 2) { | |
1986 // Must currently insert rounding node for doubleword values that | |
1987 // are results of expressions (i.e., not loads from memory or | |
1988 // constants) | |
1989 if (fp_value->type()->tag() == doubleTag && | |
1990 fp_value->as_Constant() == NULL && | |
1991 fp_value->as_Local() == NULL && // method parameters need no rounding | |
1992 fp_value->as_RoundFP() == NULL) { | |
1993 return append(new RoundFP(fp_value)); | |
1994 } | |
1995 } | |
1996 return fp_value; | |
1997 } | |
1998 | |
1999 | |
2000 Instruction* GraphBuilder::append_with_bci(Instruction* instr, int bci) { | |
1783 | 2001 Canonicalizer canon(compilation(), instr, bci); |
0 | 2002 Instruction* i1 = canon.canonical(); |
1819 | 2003 if (i1->is_linked() || !i1->can_be_linked()) { |
0 | 2004 // Canonicalizer returned an instruction which was already |
2005 // appended so simply return it. | |
2006 return i1; | |
1819 | 2007 } |
2008 | |
2009 if (UseLocalValueNumbering) { | |
0 | 2010 // Lookup the instruction in the ValueMap and add it to the map if |
2011 // it's not found. | |
2012 Instruction* i2 = vmap()->find_insert(i1); | |
2013 if (i2 != i1) { | |
2014 // found an entry in the value map, so just return it. | |
1819 | 2015 assert(i2->is_linked(), "should already be linked"); |
0 | 2016 return i2; |
2017 } | |
459 | 2018 ValueNumberingEffects vne(vmap()); |
2019 i1->visit(&vne); | |
0 | 2020 } |
2021 | |
1819 | 2022 // i1 was not eliminated => append it |
2023 assert(i1->next() == NULL, "shouldn't already be linked"); | |
2024 _last = _last->set_next(i1, canon.bci()); | |
2025 | |
2026 if (++_instruction_count >= InstructionCountCutoff && !bailed_out()) { | |
2027 // set the bailout state but complete normal processing. We | |
2028 // might do a little more work before noticing the bailout so we | |
2029 // want processing to continue normally until it's noticed. | |
2030 bailout("Method and/or inlining is too large"); | |
2031 } | |
0 | 2032 |
2033 #ifndef PRODUCT | |
1819 | 2034 if (PrintIRDuringConstruction) { |
2035 InstructionPrinter ip; | |
2036 ip.print_line(i1); | |
2037 if (Verbose) { | |
2038 state()->print(); | |
2039 } | |
2040 } | |
2041 #endif | |
2042 | |
2043 // save state after modification of operand stack for StateSplit instructions | |
2044 StateSplit* s = i1->as_StateSplit(); | |
2045 if (s != NULL) { | |
2046 if (EliminateFieldAccess) { | |
2047 Intrinsic* intrinsic = s->as_Intrinsic(); | |
2048 if (s->as_Invoke() != NULL || (intrinsic && !intrinsic->preserves_state())) { | |
2049 _memory->kill(); | |
0 | 2050 } |
2051 } | |
1819 | 2052 s->set_state(state()->copy(ValueStack::StateAfter, canon.bci())); |
2053 } | |
2054 | |
2055 // set up exception handlers for this instruction if necessary | |
2056 if (i1->can_trap()) { | |
2057 i1->set_exception_handlers(handle_exception(i1)); | |
2058 assert(i1->exception_state() != NULL || !i1->needs_exception_state() || bailed_out(), "handle_exception must set exception state"); | |
0 | 2059 } |
2060 return i1; | |
2061 } | |
2062 | |
2063 | |
2064 Instruction* GraphBuilder::append(Instruction* instr) { | |
2065 assert(instr->as_StateSplit() == NULL || instr->as_BlockEnd() != NULL, "wrong append used"); | |
2066 return append_with_bci(instr, bci()); | |
2067 } | |
2068 | |
2069 | |
2070 Instruction* GraphBuilder::append_split(StateSplit* instr) { | |
2071 return append_with_bci(instr, bci()); | |
2072 } | |
2073 | |
2074 | |
2075 void GraphBuilder::null_check(Value value) { | |
2076 if (value->as_NewArray() != NULL || value->as_NewInstance() != NULL) { | |
2077 return; | |
2078 } else { | |
2079 Constant* con = value->as_Constant(); | |
2080 if (con) { | |
2081 ObjectType* c = con->type()->as_ObjectType(); | |
2082 if (c && c->is_loaded()) { | |
2083 ObjectConstant* oc = c->as_ObjectConstant(); | |
2084 if (!oc || !oc->value()->is_null_object()) { | |
2085 return; | |
2086 } | |
2087 } | |
2088 } | |
2089 } | |
1819 | 2090 append(new NullCheck(value, copy_state_for_exception())); |
0 | 2091 } |
2092 | |
2093 | |
2094 | |
1819 | 2095 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) { |
2096 if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != NULL)) { | |
2097 assert(instruction->exception_state() == NULL | |
2098 || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState | |
2099 || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->jvmti_can_access_local_variables()), | |
2100 "exception_state should be of exception kind"); | |
0 | 2101 return new XHandlers(); |
2102 } | |
2103 | |
2104 XHandlers* exception_handlers = new XHandlers(); | |
2105 ScopeData* cur_scope_data = scope_data(); | |
1819 | 2106 ValueStack* cur_state = instruction->state_before(); |
2107 ValueStack* prev_state = NULL; | |
0 | 2108 int scope_count = 0; |
2109 | |
1819 | 2110 assert(cur_state != NULL, "state_before must be set"); |
0 | 2111 do { |
1819 | 2112 int cur_bci = cur_state->bci(); |
2113 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match"); | |
0 | 2114 assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci"); |
2115 | |
2116 // join with all potential exception handlers | |
2117 XHandlers* list = cur_scope_data->xhandlers(); | |
2118 const int n = list->length(); | |
2119 for (int i = 0; i < n; i++) { | |
2120 XHandler* h = list->handler_at(i); | |
2121 if (h->covers(cur_bci)) { | |
2122 // h is a potential exception handler => join it | |
2123 compilation()->set_has_exception_handlers(true); | |
2124 | |
2125 BlockBegin* entry = h->entry_block(); | |
2126 if (entry == block()) { | |
2127 // It's acceptable for an exception handler to cover itself | |
2128 // but we don't handle that in the parser currently. It's | |
2129 // very rare so we bailout instead of trying to handle it. | |
2130 BAILOUT_("exception handler covers itself", exception_handlers); | |
2131 } | |
2132 assert(entry->bci() == h->handler_bci(), "must match"); | |
2133 assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond"); | |
2134 | |
2135 // previously this was a BAILOUT, but this is not necessary | |
2136 // now because asynchronous exceptions are not handled this way. | |
1819 | 2137 assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match"); |
0 | 2138 |
2139 // xhandler start with an empty expression stack | |
1819 | 2140 if (cur_state->stack_size() != 0) { |
2141 cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci()); | |
2142 } | |
2143 if (instruction->exception_state() == NULL) { | |
2144 instruction->set_exception_state(cur_state); | |
2145 } | |
0 | 2146 |
2147 // Note: Usually this join must work. However, very | |
2148 // complicated jsr-ret structures where we don't ret from | |
2149 // the subroutine can cause the objects on the monitor | |
2150 // stacks to not match because blocks can be parsed twice. | |
2151 // The only test case we've seen so far which exhibits this | |
2152 // problem is caught by the infinite recursion test in | |
2153 // GraphBuilder::jsr() if the join doesn't work. | |
1819 | 2154 if (!entry->try_merge(cur_state)) { |
0 | 2155 BAILOUT_("error while joining with exception handler, prob. due to complicated jsr/rets", exception_handlers); |
2156 } | |
2157 | |
2158 // add current state for correct handling of phi functions at begin of xhandler | |
1819 | 2159 int phi_operand = entry->add_exception_state(cur_state); |
0 | 2160 |
2161 // add entry to the list of xhandlers of this block | |
2162 _block->add_exception_handler(entry); | |
2163 | |
2164 // add back-edge from xhandler entry to this block | |
2165 if (!entry->is_predecessor(_block)) { | |
2166 entry->add_predecessor(_block); | |
2167 } | |
2168 | |
2169 // clone XHandler because phi_operand and scope_count can not be shared | |
2170 XHandler* new_xhandler = new XHandler(h); | |
2171 new_xhandler->set_phi_operand(phi_operand); | |
2172 new_xhandler->set_scope_count(scope_count); | |
2173 exception_handlers->append(new_xhandler); | |
2174 | |
2175 // fill in exception handler subgraph lazily | |
2176 assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet"); | |
2177 cur_scope_data->add_to_work_list(entry); | |
2178 | |
2179 // stop when reaching catchall | |
2180 if (h->catch_type() == 0) { | |
2181 return exception_handlers; | |
2182 } | |
2183 } | |
2184 } | |
2185 | |
1819 | 2186 if (exception_handlers->length() == 0) { |
2187 // This scope and all callees do not handle exceptions, so the local | |
2188 // variables of this scope are not needed. However, the scope itself is | |
2189 // required for a correct exception stack trace -> clear out the locals. | |
2190 if (_compilation->env()->jvmti_can_access_local_variables()) { | |
2191 cur_state = cur_state->copy(ValueStack::ExceptionState, cur_state->bci()); | |
2192 } else { | |
2193 cur_state = cur_state->copy(ValueStack::EmptyExceptionState, cur_state->bci()); | |
2194 } | |
2195 if (prev_state != NULL) { | |
2196 prev_state->set_caller_state(cur_state); | |
2197 } | |
2198 if (instruction->exception_state() == NULL) { | |
2199 instruction->set_exception_state(cur_state); | |
2200 } | |
2201 } | |
2202 | |
0 | 2203 // Set up iteration for next time. |
2204 // If parsing a jsr, do not grab exception handlers from the | |
2205 // parent scopes for this method (already got them, and they | |
2206 // needed to be cloned) | |
1819 | 2207 |
2208 while (cur_scope_data->parsing_jsr()) { | |
2209 cur_scope_data = cur_scope_data->parent(); | |
0 | 2210 } |
1819 | 2211 |
2212 assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match"); | |
2213 assert(cur_state->locks_size() == 0 || cur_state->locks_size() == 1, "unlocking must be done in a catchall exception handler"); | |
2214 | |
2215 prev_state = cur_state; | |
2216 cur_state = cur_state->caller_state(); | |
2217 cur_scope_data = cur_scope_data->parent(); | |
2218 scope_count++; | |
0 | 2219 } while (cur_scope_data != NULL); |
2220 | |
2221 return exception_handlers; | |
2222 } | |
2223 | |
2224 | |
2225 // Helper class for simplifying Phis. | |
2226 class PhiSimplifier : public BlockClosure { | |
2227 private: | |
2228 bool _has_substitutions; | |
2229 Value simplify(Value v); | |
2230 | |
2231 public: | |
2232 PhiSimplifier(BlockBegin* start) : _has_substitutions(false) { | |
2233 start->iterate_preorder(this); | |
2234 if (_has_substitutions) { | |
2235 SubstitutionResolver sr(start); | |
2236 } | |
2237 } | |
2238 void block_do(BlockBegin* b); | |
2239 bool has_substitutions() const { return _has_substitutions; } | |
2240 }; | |
2241 | |
2242 | |
2243 Value PhiSimplifier::simplify(Value v) { | |
2244 Phi* phi = v->as_Phi(); | |
2245 | |
2246 if (phi == NULL) { | |
2247 // no phi function | |
2248 return v; | |
2249 } else if (v->has_subst()) { | |
2250 // already substituted; subst can be phi itself -> simplify | |
2251 return simplify(v->subst()); | |
2252 } else if (phi->is_set(Phi::cannot_simplify)) { | |
2253 // already tried to simplify phi before | |
2254 return phi; | |
2255 } else if (phi->is_set(Phi::visited)) { | |
2256 // break cycles in phi functions | |
2257 return phi; | |
2258 } else if (phi->type()->is_illegal()) { | |
2259 // illegal phi functions are ignored anyway | |
2260 return phi; | |
2261 | |
2262 } else { | |
2263 // mark phi function as processed to break cycles in phi functions | |
2264 phi->set(Phi::visited); | |
2265 | |
2266 // simplify x = [y, x] and x = [y, y] to y | |
2267 Value subst = NULL; | |
2268 int opd_count = phi->operand_count(); | |
2269 for (int i = 0; i < opd_count; i++) { | |
2270 Value opd = phi->operand_at(i); | |
2271 assert(opd != NULL, "Operand must exist!"); | |
2272 | |
2273 if (opd->type()->is_illegal()) { | |
2274 // if one operand is illegal, the entire phi function is illegal | |
2275 phi->make_illegal(); | |
2276 phi->clear(Phi::visited); | |
2277 return phi; | |
2278 } | |
2279 | |
2280 Value new_opd = simplify(opd); | |
2281 assert(new_opd != NULL, "Simplified operand must exist!"); | |
2282 | |
2283 if (new_opd != phi && new_opd != subst) { | |
2284 if (subst == NULL) { | |
2285 subst = new_opd; | |
2286 } else { | |
2287 // no simplification possible | |
2288 phi->set(Phi::cannot_simplify); | |
2289 phi->clear(Phi::visited); | |
2290 return phi; | |
2291 } | |
2292 } | |
2293 } | |
2294 | |
2295 // sucessfully simplified phi function | |
2296 assert(subst != NULL, "illegal phi function"); | |
2297 _has_substitutions = true; | |
2298 phi->clear(Phi::visited); | |
2299 phi->set_subst(subst); | |
2300 | |
2301 #ifndef PRODUCT | |
2302 if (PrintPhiFunctions) { | |
2303 tty->print_cr("simplified phi function %c%d to %c%d (Block B%d)", phi->type()->tchar(), phi->id(), subst->type()->tchar(), subst->id(), phi->block()->block_id()); | |
2304 } | |
2305 #endif | |
2306 | |
2307 return subst; | |
2308 } | |
2309 } | |
2310 | |
2311 | |
2312 void PhiSimplifier::block_do(BlockBegin* b) { | |
2313 for_each_phi_fun(b, phi, | |
2314 simplify(phi); | |
2315 ); | |
2316 | |
2317 #ifdef ASSERT | |
2318 for_each_phi_fun(b, phi, | |
2319 assert(phi->operand_count() != 1 || phi->subst() != phi, "missed trivial simplification"); | |
2320 ); | |
2321 | |
2322 ValueStack* state = b->state()->caller_state(); | |
1819 | 2323 for_each_state_value(state, value, |
2324 Phi* phi = value->as_Phi(); | |
2325 assert(phi == NULL || phi->block() != b, "must not have phi function to simplify in caller state"); | |
2326 ); | |
0 | 2327 #endif |
2328 } | |
2329 | |
2330 // This method is called after all blocks are filled with HIR instructions | |
2331 // It eliminates all Phi functions of the form x = [y, y] and x = [y, x] | |
2332 void GraphBuilder::eliminate_redundant_phis(BlockBegin* start) { | |
2333 PhiSimplifier simplifier(start); | |
2334 } | |
2335 | |
2336 | |
2337 void GraphBuilder::connect_to_end(BlockBegin* beg) { | |
2338 // setup iteration | |
2339 kill_all(); | |
2340 _block = beg; | |
1819 | 2341 _state = beg->state()->copy_for_parsing(); |
0 | 2342 _last = beg; |
2343 iterate_bytecodes_for_block(beg->bci()); | |
2344 } | |
2345 | |
2346 | |
2347 BlockEnd* GraphBuilder::iterate_bytecodes_for_block(int bci) { | |
2348 #ifndef PRODUCT | |
2349 if (PrintIRDuringConstruction) { | |
2350 tty->cr(); | |
2351 InstructionPrinter ip; | |
2352 ip.print_instr(_block); tty->cr(); | |
2353 ip.print_stack(_block->state()); tty->cr(); | |
2354 ip.print_inline_level(_block); | |
2355 ip.print_head(); | |
2356 tty->print_cr("locals size: %d stack size: %d", state()->locals_size(), state()->stack_size()); | |
2357 } | |
2358 #endif | |
2359 _skip_block = false; | |
2360 assert(state() != NULL, "ValueStack missing!"); | |
2361 ciBytecodeStream s(method()); | |
2362 s.reset_to_bci(bci); | |
2363 int prev_bci = bci; | |
2364 scope_data()->set_stream(&s); | |
2365 // iterate | |
2366 Bytecodes::Code code = Bytecodes::_illegal; | |
2367 bool push_exception = false; | |
2368 | |
2369 if (block()->is_set(BlockBegin::exception_entry_flag) && block()->next() == NULL) { | |
2370 // first thing in the exception entry block should be the exception object. | |
2371 push_exception = true; | |
2372 } | |
2373 | |
2374 while (!bailed_out() && last()->as_BlockEnd() == NULL && | |
2375 (code = stream()->next()) != ciBytecodeStream::EOBC() && | |
2376 (block_at(s.cur_bci()) == NULL || block_at(s.cur_bci()) == block())) { | |
1819 | 2377 assert(state()->kind() == ValueStack::Parsing, "invalid state kind"); |
0 | 2378 |
2379 // Check for active jsr during OSR compilation | |
2380 if (compilation()->is_osr_compile() | |
2381 && scope()->is_top_scope() | |
2382 && parsing_jsr() | |
2383 && s.cur_bci() == compilation()->osr_bci()) { | |
2384 bailout("OSR not supported while a jsr is active"); | |
2385 } | |
2386 | |
2387 if (push_exception) { | |
2388 apush(append(new ExceptionObject())); | |
2389 push_exception = false; | |
2390 } | |
2391 | |
2392 // handle bytecode | |
2393 switch (code) { | |
2394 case Bytecodes::_nop : /* nothing to do */ break; | |
2395 case Bytecodes::_aconst_null : apush(append(new Constant(objectNull ))); break; | |
2396 case Bytecodes::_iconst_m1 : ipush(append(new Constant(new IntConstant (-1)))); break; | |
2397 case Bytecodes::_iconst_0 : ipush(append(new Constant(intZero ))); break; | |
2398 case Bytecodes::_iconst_1 : ipush(append(new Constant(intOne ))); break; | |
2399 case Bytecodes::_iconst_2 : ipush(append(new Constant(new IntConstant ( 2)))); break; | |
2400 case Bytecodes::_iconst_3 : ipush(append(new Constant(new IntConstant ( 3)))); break; | |
2401 case Bytecodes::_iconst_4 : ipush(append(new Constant(new IntConstant ( 4)))); break; | |
2402 case Bytecodes::_iconst_5 : ipush(append(new Constant(new IntConstant ( 5)))); break; | |
2403 case Bytecodes::_lconst_0 : lpush(append(new Constant(new LongConstant ( 0)))); break; | |
2404 case Bytecodes::_lconst_1 : lpush(append(new Constant(new LongConstant ( 1)))); break; | |
2405 case Bytecodes::_fconst_0 : fpush(append(new Constant(new FloatConstant ( 0)))); break; | |
2406 case Bytecodes::_fconst_1 : fpush(append(new Constant(new FloatConstant ( 1)))); break; | |
2407 case Bytecodes::_fconst_2 : fpush(append(new Constant(new FloatConstant ( 2)))); break; | |
2408 case Bytecodes::_dconst_0 : dpush(append(new Constant(new DoubleConstant( 0)))); break; | |
2409 case Bytecodes::_dconst_1 : dpush(append(new Constant(new DoubleConstant( 1)))); break; | |
2410 case Bytecodes::_bipush : ipush(append(new Constant(new IntConstant(((signed char*)s.cur_bcp())[1])))); break; | |
2411 case Bytecodes::_sipush : ipush(append(new Constant(new IntConstant((short)Bytes::get_Java_u2(s.cur_bcp()+1))))); break; | |
2412 case Bytecodes::_ldc : // fall through | |
2413 case Bytecodes::_ldc_w : // fall through | |
2414 case Bytecodes::_ldc2_w : load_constant(); break; | |
2415 case Bytecodes::_iload : load_local(intType , s.get_index()); break; | |
2416 case Bytecodes::_lload : load_local(longType , s.get_index()); break; | |
2417 case Bytecodes::_fload : load_local(floatType , s.get_index()); break; | |
2418 case Bytecodes::_dload : load_local(doubleType , s.get_index()); break; | |
2419 case Bytecodes::_aload : load_local(instanceType, s.get_index()); break; | |
2420 case Bytecodes::_iload_0 : load_local(intType , 0); break; | |
2421 case Bytecodes::_iload_1 : load_local(intType , 1); break; | |
2422 case Bytecodes::_iload_2 : load_local(intType , 2); break; | |
2423 case Bytecodes::_iload_3 : load_local(intType , 3); break; | |
2424 case Bytecodes::_lload_0 : load_local(longType , 0); break; | |
2425 case Bytecodes::_lload_1 : load_local(longType , 1); break; | |
2426 case Bytecodes::_lload_2 : load_local(longType , 2); break; | |
2427 case Bytecodes::_lload_3 : load_local(longType , 3); break; | |
2428 case Bytecodes::_fload_0 : load_local(floatType , 0); break; | |
2429 case Bytecodes::_fload_1 : load_local(floatType , 1); break; | |
2430 case Bytecodes::_fload_2 : load_local(floatType , 2); break; | |
2431 case Bytecodes::_fload_3 : load_local(floatType , 3); break; | |
2432 case Bytecodes::_dload_0 : load_local(doubleType, 0); break; | |
2433 case Bytecodes::_dload_1 : load_local(doubleType, 1); break; | |
2434 case Bytecodes::_dload_2 : load_local(doubleType, 2); break; | |
2435 case Bytecodes::_dload_3 : load_local(doubleType, 3); break; | |
2436 case Bytecodes::_aload_0 : load_local(objectType, 0); break; | |
2437 case Bytecodes::_aload_1 : load_local(objectType, 1); break; | |
2438 case Bytecodes::_aload_2 : load_local(objectType, 2); break; | |
2439 case Bytecodes::_aload_3 : load_local(objectType, 3); break; | |
2440 case Bytecodes::_iaload : load_indexed(T_INT ); break; | |
2441 case Bytecodes::_laload : load_indexed(T_LONG ); break; | |
2442 case Bytecodes::_faload : load_indexed(T_FLOAT ); break; | |
2443 case Bytecodes::_daload : load_indexed(T_DOUBLE); break; | |
2444 case Bytecodes::_aaload : load_indexed(T_OBJECT); break; | |
2445 case Bytecodes::_baload : load_indexed(T_BYTE ); break; | |
2446 case Bytecodes::_caload : load_indexed(T_CHAR ); break; | |
2447 case Bytecodes::_saload : load_indexed(T_SHORT ); break; | |
2448 case Bytecodes::_istore : store_local(intType , s.get_index()); break; | |
2449 case Bytecodes::_lstore : store_local(longType , s.get_index()); break; | |
2450 case Bytecodes::_fstore : store_local(floatType , s.get_index()); break; | |
2451 case Bytecodes::_dstore : store_local(doubleType, s.get_index()); break; | |
2452 case Bytecodes::_astore : store_local(objectType, s.get_index()); break; | |
2453 case Bytecodes::_istore_0 : store_local(intType , 0); break; | |
2454 case Bytecodes::_istore_1 : store_local(intType , 1); break; | |
2455 case Bytecodes::_istore_2 : store_local(intType , 2); break; | |
2456 case Bytecodes::_istore_3 : store_local(intType , 3); break; | |
2457 case Bytecodes::_lstore_0 : store_local(longType , 0); break; | |
2458 case Bytecodes::_lstore_1 : store_local(longType , 1); break; | |
2459 case Bytecodes::_lstore_2 : store_local(longType , 2); break; | |
2460 case Bytecodes::_lstore_3 : store_local(longType , 3); break; | |
2461 case Bytecodes::_fstore_0 : store_local(floatType , 0); break; | |
2462 case Bytecodes::_fstore_1 : store_local(floatType , 1); break; | |
2463 case Bytecodes::_fstore_2 : store_local(floatType , 2); break; | |
2464 case Bytecodes::_fstore_3 : store_local(floatType , 3); break; | |
2465 case Bytecodes::_dstore_0 : store_local(doubleType, 0); break; | |
2466 case Bytecodes::_dstore_1 : store_local(doubleType, 1); break; | |
2467 case Bytecodes::_dstore_2 : store_local(doubleType, 2); break; | |
2468 case Bytecodes::_dstore_3 : store_local(doubleType, 3); break; | |
2469 case Bytecodes::_astore_0 : store_local(objectType, 0); break; | |
2470 case Bytecodes::_astore_1 : store_local(objectType, 1); break; | |
2471 case Bytecodes::_astore_2 : store_local(objectType, 2); break; | |
2472 case Bytecodes::_astore_3 : store_local(objectType, 3); break; | |
2473 case Bytecodes::_iastore : store_indexed(T_INT ); break; | |
2474 case Bytecodes::_lastore : store_indexed(T_LONG ); break; | |
2475 case Bytecodes::_fastore : store_indexed(T_FLOAT ); break; | |
2476 case Bytecodes::_dastore : store_indexed(T_DOUBLE); break; | |
2477 case Bytecodes::_aastore : store_indexed(T_OBJECT); break; | |
2478 case Bytecodes::_bastore : store_indexed(T_BYTE ); break; | |
2479 case Bytecodes::_castore : store_indexed(T_CHAR ); break; | |
2480 case Bytecodes::_sastore : store_indexed(T_SHORT ); break; | |
2481 case Bytecodes::_pop : // fall through | |
2482 case Bytecodes::_pop2 : // fall through | |
2483 case Bytecodes::_dup : // fall through | |
2484 case Bytecodes::_dup_x1 : // fall through | |
2485 case Bytecodes::_dup_x2 : // fall through | |
2486 case Bytecodes::_dup2 : // fall through | |
2487 case Bytecodes::_dup2_x1 : // fall through | |
2488 case Bytecodes::_dup2_x2 : // fall through | |
2489 case Bytecodes::_swap : stack_op(code); break; | |
2490 case Bytecodes::_iadd : arithmetic_op(intType , code); break; | |
2491 case Bytecodes::_ladd : arithmetic_op(longType , code); break; | |
2492 case Bytecodes::_fadd : arithmetic_op(floatType , code); break; | |
2493 case Bytecodes::_dadd : arithmetic_op(doubleType, code); break; | |
2494 case Bytecodes::_isub : arithmetic_op(intType , code); break; | |
2495 case Bytecodes::_lsub : arithmetic_op(longType , code); break; | |
2496 case Bytecodes::_fsub : arithmetic_op(floatType , code); break; | |
2497 case Bytecodes::_dsub : arithmetic_op(doubleType, code); break; | |
2498 case Bytecodes::_imul : arithmetic_op(intType , code); break; | |
2499 case Bytecodes::_lmul : arithmetic_op(longType , code); break; | |
2500 case Bytecodes::_fmul : arithmetic_op(floatType , code); break; | |
2501 case Bytecodes::_dmul : arithmetic_op(doubleType, code); break; | |
1819 | 2502 case Bytecodes::_idiv : arithmetic_op(intType , code, copy_state_for_exception()); break; |
2503 case Bytecodes::_ldiv : arithmetic_op(longType , code, copy_state_for_exception()); break; | |
0 | 2504 case Bytecodes::_fdiv : arithmetic_op(floatType , code); break; |
2505 case Bytecodes::_ddiv : arithmetic_op(doubleType, code); break; | |
1819 | 2506 case Bytecodes::_irem : arithmetic_op(intType , code, copy_state_for_exception()); break; |
2507 case Bytecodes::_lrem : arithmetic_op(longType , code, copy_state_for_exception()); break; | |
0 | 2508 case Bytecodes::_frem : arithmetic_op(floatType , code); break; |
2509 case Bytecodes::_drem : arithmetic_op(doubleType, code); break; | |
2510 case Bytecodes::_ineg : negate_op(intType ); break; | |
2511 case Bytecodes::_lneg : negate_op(longType ); break; | |
2512 case Bytecodes::_fneg : negate_op(floatType ); break; | |
2513 case Bytecodes::_dneg : negate_op(doubleType); break; | |
2514 case Bytecodes::_ishl : shift_op(intType , code); break; | |
2515 case Bytecodes::_lshl : shift_op(longType, code); break; | |
2516 case Bytecodes::_ishr : shift_op(intType , code); break; | |
2517 case Bytecodes::_lshr : shift_op(longType, code); break; | |
2518 case Bytecodes::_iushr : shift_op(intType , code); break; | |
2519 case Bytecodes::_lushr : shift_op(longType, code); break; | |
2520 case Bytecodes::_iand : logic_op(intType , code); break; | |
2521 case Bytecodes::_land : logic_op(longType, code); break; | |
2522 case Bytecodes::_ior : logic_op(intType , code); break; | |
2523 case Bytecodes::_lor : logic_op(longType, code); break; | |
2524 case Bytecodes::_ixor : logic_op(intType , code); break; | |
2525 case Bytecodes::_lxor : logic_op(longType, code); break; | |
2526 case Bytecodes::_iinc : increment(); break; | |
2527 case Bytecodes::_i2l : convert(code, T_INT , T_LONG ); break; | |
2528 case Bytecodes::_i2f : convert(code, T_INT , T_FLOAT ); break; | |
2529 case Bytecodes::_i2d : convert(code, T_INT , T_DOUBLE); break; | |
2530 case Bytecodes::_l2i : convert(code, T_LONG , T_INT ); break; | |
2531 case Bytecodes::_l2f : convert(code, T_LONG , T_FLOAT ); break; | |
2532 case Bytecodes::_l2d : convert(code, T_LONG , T_DOUBLE); break; | |
2533 case Bytecodes::_f2i : convert(code, T_FLOAT , T_INT ); break; | |
2534 case Bytecodes::_f2l : convert(code, T_FLOAT , T_LONG ); break; | |
2535 case Bytecodes::_f2d : convert(code, T_FLOAT , T_DOUBLE); break; | |
2536 case Bytecodes::_d2i : convert(code, T_DOUBLE, T_INT ); break; | |
2537 case Bytecodes::_d2l : convert(code, T_DOUBLE, T_LONG ); break; | |
2538 case Bytecodes::_d2f : convert(code, T_DOUBLE, T_FLOAT ); break; | |
2539 case Bytecodes::_i2b : convert(code, T_INT , T_BYTE ); break; | |
2540 case Bytecodes::_i2c : convert(code, T_INT , T_CHAR ); break; | |
2541 case Bytecodes::_i2s : convert(code, T_INT , T_SHORT ); break; | |
2542 case Bytecodes::_lcmp : compare_op(longType , code); break; | |
2543 case Bytecodes::_fcmpl : compare_op(floatType , code); break; | |
2544 case Bytecodes::_fcmpg : compare_op(floatType , code); break; | |
2545 case Bytecodes::_dcmpl : compare_op(doubleType, code); break; | |
2546 case Bytecodes::_dcmpg : compare_op(doubleType, code); break; | |
2547 case Bytecodes::_ifeq : if_zero(intType , If::eql); break; | |
2548 case Bytecodes::_ifne : if_zero(intType , If::neq); break; | |
2549 case Bytecodes::_iflt : if_zero(intType , If::lss); break; | |
2550 case Bytecodes::_ifge : if_zero(intType , If::geq); break; | |
2551 case Bytecodes::_ifgt : if_zero(intType , If::gtr); break; | |
2552 case Bytecodes::_ifle : if_zero(intType , If::leq); break; | |
2553 case Bytecodes::_if_icmpeq : if_same(intType , If::eql); break; | |
2554 case Bytecodes::_if_icmpne : if_same(intType , If::neq); break; | |
2555 case Bytecodes::_if_icmplt : if_same(intType , If::lss); break; | |
2556 case Bytecodes::_if_icmpge : if_same(intType , If::geq); break; | |
2557 case Bytecodes::_if_icmpgt : if_same(intType , If::gtr); break; | |
2558 case Bytecodes::_if_icmple : if_same(intType , If::leq); break; | |
2559 case Bytecodes::_if_acmpeq : if_same(objectType, If::eql); break; | |
2560 case Bytecodes::_if_acmpne : if_same(objectType, If::neq); break; | |
2561 case Bytecodes::_goto : _goto(s.cur_bci(), s.get_dest()); break; | |
2562 case Bytecodes::_jsr : jsr(s.get_dest()); break; | |
2563 case Bytecodes::_ret : ret(s.get_index()); break; | |
2564 case Bytecodes::_tableswitch : table_switch(); break; | |
2565 case Bytecodes::_lookupswitch : lookup_switch(); break; | |
2566 case Bytecodes::_ireturn : method_return(ipop()); break; | |
2567 case Bytecodes::_lreturn : method_return(lpop()); break; | |
2568 case Bytecodes::_freturn : method_return(fpop()); break; | |
2569 case Bytecodes::_dreturn : method_return(dpop()); break; | |
2570 case Bytecodes::_areturn : method_return(apop()); break; | |
2571 case Bytecodes::_return : method_return(NULL ); break; | |
2572 case Bytecodes::_getstatic : // fall through | |
2573 case Bytecodes::_putstatic : // fall through | |
2574 case Bytecodes::_getfield : // fall through | |
2575 case Bytecodes::_putfield : access_field(code); break; | |
2576 case Bytecodes::_invokevirtual : // fall through | |
2577 case Bytecodes::_invokespecial : // fall through | |
2578 case Bytecodes::_invokestatic : // fall through | |
726
be93aad57795
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
470
diff
changeset
|
2579 case Bytecodes::_invokedynamic : // fall through |
0 | 2580 case Bytecodes::_invokeinterface: invoke(code); break; |
1565 | 2581 case Bytecodes::_new : new_instance(s.get_index_u2()); break; |
0 | 2582 case Bytecodes::_newarray : new_type_array(); break; |
2583 case Bytecodes::_anewarray : new_object_array(); break; | |
1819 | 2584 case Bytecodes::_arraylength : { ValueStack* state_before = copy_state_for_exception(); ipush(append(new ArrayLength(apop(), state_before))); break; } |
0 | 2585 case Bytecodes::_athrow : throw_op(s.cur_bci()); break; |
1565 | 2586 case Bytecodes::_checkcast : check_cast(s.get_index_u2()); break; |
2587 case Bytecodes::_instanceof : instance_of(s.get_index_u2()); break; | |
0 | 2588 case Bytecodes::_monitorenter : monitorenter(apop(), s.cur_bci()); break; |
2589 case Bytecodes::_monitorexit : monitorexit (apop(), s.cur_bci()); break; | |
2590 case Bytecodes::_wide : ShouldNotReachHere(); break; | |
2591 case Bytecodes::_multianewarray : new_multi_array(s.cur_bcp()[3]); break; | |
2592 case Bytecodes::_ifnull : if_null(objectType, If::eql); break; | |
2593 case Bytecodes::_ifnonnull : if_null(objectType, If::neq); break; | |
2594 case Bytecodes::_goto_w : _goto(s.cur_bci(), s.get_far_dest()); break; | |
2595 case Bytecodes::_jsr_w : jsr(s.get_far_dest()); break; | |
2596 case Bytecodes::_breakpoint : BAILOUT_("concurrent setting of breakpoint", NULL); | |
2597 default : ShouldNotReachHere(); break; | |
2598 } | |
2599 // save current bci to setup Goto at the end | |
2600 prev_bci = s.cur_bci(); | |
2601 } | |
2602 CHECK_BAILOUT_(NULL); | |
2603 // stop processing of this block (see try_inline_full) | |
2604 if (_skip_block) { | |
2605 _skip_block = false; | |
2606 assert(_last && _last->as_BlockEnd(), ""); | |
2607 return _last->as_BlockEnd(); | |
2608 } | |
2609 // if there are any, check if last instruction is a BlockEnd instruction | |
2610 BlockEnd* end = last()->as_BlockEnd(); | |
2611 if (end == NULL) { | |
2612 // all blocks must end with a BlockEnd instruction => add a Goto | |
2613 end = new Goto(block_at(s.cur_bci()), false); | |
1819 | 2614 append(end); |
0 | 2615 } |
2616 assert(end == last()->as_BlockEnd(), "inconsistency"); | |
2617 | |
1819 | 2618 assert(end->state() != NULL, "state must already be present"); |
2619 assert(end->as_Return() == NULL || end->as_Throw() == NULL || end->state()->stack_size() == 0, "stack not needed for return and throw"); | |
0 | 2620 |
2621 // connect to begin & set state | |
2622 // NOTE that inlining may have changed the block we are parsing | |
2623 block()->set_end(end); | |
2624 // propagate state | |
2625 for (int i = end->number_of_sux() - 1; i >= 0; i--) { | |
2626 BlockBegin* sux = end->sux_at(i); | |
2627 assert(sux->is_predecessor(block()), "predecessor missing"); | |
2628 // be careful, bailout if bytecodes are strange | |
1819 | 2629 if (!sux->try_merge(end->state())) BAILOUT_("block join failed", NULL); |
0 | 2630 scope_data()->add_to_work_list(end->sux_at(i)); |
2631 } | |
2632 | |
2633 scope_data()->set_stream(NULL); | |
2634 | |
2635 // done | |
2636 return end; | |
2637 } | |
2638 | |
2639 | |
2640 void GraphBuilder::iterate_all_blocks(bool start_in_current_block_for_inlining) { | |
2641 do { | |
2642 if (start_in_current_block_for_inlining && !bailed_out()) { | |
2643 iterate_bytecodes_for_block(0); | |
2644 start_in_current_block_for_inlining = false; | |
2645 } else { | |
2646 BlockBegin* b; | |
2647 while ((b = scope_data()->remove_from_work_list()) != NULL) { | |
2648 if (!b->is_set(BlockBegin::was_visited_flag)) { | |
2649 if (b->is_set(BlockBegin::osr_entry_flag)) { | |
2650 // we're about to parse the osr entry block, so make sure | |
2651 // we setup the OSR edge leading into this block so that | |
2652 // Phis get setup correctly. | |
2653 setup_osr_entry_block(); | |
2654 // this is no longer the osr entry block, so clear it. | |
2655 b->clear(BlockBegin::osr_entry_flag); | |
2656 } | |
2657 b->set(BlockBegin::was_visited_flag); | |
2658 connect_to_end(b); | |
2659 } | |
2660 } | |
2661 } | |
2662 } while (!bailed_out() && !scope_data()->is_work_list_empty()); | |
2663 } | |
2664 | |
2665 | |
2666 bool GraphBuilder::_can_trap [Bytecodes::number_of_java_codes]; | |
2667 | |
2668 void GraphBuilder::initialize() { | |
2669 // the following bytecodes are assumed to potentially | |
2670 // throw exceptions in compiled code - note that e.g. | |
2671 // monitorexit & the return bytecodes do not throw | |
2672 // exceptions since monitor pairing proved that they | |
2673 // succeed (if monitor pairing succeeded) | |
2674 Bytecodes::Code can_trap_list[] = | |
2675 { Bytecodes::_ldc | |
2676 , Bytecodes::_ldc_w | |
2677 , Bytecodes::_ldc2_w | |
2678 , Bytecodes::_iaload | |
2679 , Bytecodes::_laload | |
2680 , Bytecodes::_faload | |
2681 , Bytecodes::_daload | |
2682 , Bytecodes::_aaload | |
2683 , Bytecodes::_baload | |
2684 , Bytecodes::_caload | |
2685 , Bytecodes::_saload | |
2686 , Bytecodes::_iastore | |
2687 , Bytecodes::_lastore | |
2688 , Bytecodes::_fastore | |
2689 , Bytecodes::_dastore | |
2690 , Bytecodes::_aastore | |
2691 , Bytecodes::_bastore | |
2692 , Bytecodes::_castore | |
2693 , Bytecodes::_sastore | |
2694 , Bytecodes::_idiv | |
2695 , Bytecodes::_ldiv | |
2696 , Bytecodes::_irem | |
2697 , Bytecodes::_lrem | |
2698 , Bytecodes::_getstatic | |
2699 , Bytecodes::_putstatic | |
2700 , Bytecodes::_getfield | |
2701 , Bytecodes::_putfield | |
2702 , Bytecodes::_invokevirtual | |
2703 , Bytecodes::_invokespecial | |
2704 , Bytecodes::_invokestatic | |
726
be93aad57795
6655646: dynamic languages need dynamically linked call sites
jrose
parents:
470
diff
changeset
|
2705 , Bytecodes::_invokedynamic |
0 | 2706 , Bytecodes::_invokeinterface |
2707 , Bytecodes::_new | |
2708 , Bytecodes::_newarray | |
2709 , Bytecodes::_anewarray | |
2710 , Bytecodes::_arraylength | |
2711 , Bytecodes::_athrow | |
2712 , Bytecodes::_checkcast | |
2713 , Bytecodes::_instanceof | |
2714 , Bytecodes::_monitorenter | |
2715 , Bytecodes::_multianewarray | |
2716 }; | |
2717 | |
2718 // inititialize trap tables | |
2719 for (int i = 0; i < Bytecodes::number_of_java_codes; i++) { | |
2720 _can_trap[i] = false; | |
2721 } | |
2722 // set standard trap info | |
2723 for (uint j = 0; j < ARRAY_SIZE(can_trap_list); j++) { | |
2724 _can_trap[can_trap_list[j]] = true; | |
2725 } | |
2726 } | |
2727 | |
2728 | |
2729 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) { | |
2730 assert(entry->is_set(f), "entry/flag mismatch"); | |
2731 // create header block | |
2732 BlockBegin* h = new BlockBegin(entry->bci()); | |
2733 h->set_depth_first_number(0); | |
2734 | |
2735 Value l = h; | |
2736 BlockEnd* g = new Goto(entry, false); | |
2737 l->set_next(g, entry->bci()); | |
2738 h->set_end(g); | |
2739 h->set(f); | |
2740 // setup header block end state | |
1819 | 2741 ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis) |
0 | 2742 assert(s->stack_is_empty(), "must have empty stack at entry point"); |
2743 g->set_state(s); | |
2744 return h; | |
2745 } | |
2746 | |
2747 | |
2748 | |
2749 BlockBegin* GraphBuilder::setup_start_block(int osr_bci, BlockBegin* std_entry, BlockBegin* osr_entry, ValueStack* state) { | |
2750 BlockBegin* start = new BlockBegin(0); | |
2751 | |
2752 // This code eliminates the empty start block at the beginning of | |
2753 // each method. Previously, each method started with the | |
2754 // start-block created below, and this block was followed by the | |
2755 // header block that was always empty. This header block is only | |
2756 // necesary if std_entry is also a backward branch target because | |
2757 // then phi functions may be necessary in the header block. It's | |
2758 // also necessary when profiling so that there's a single block that | |
2759 // can increment the interpreter_invocation_count. | |
2760 BlockBegin* new_header_block; | |
1783 | 2761 if (std_entry->number_of_preds() > 0 || count_invocations() || count_backedges()) { |
2762 new_header_block = header_block(std_entry, BlockBegin::std_entry_flag, state); | |
2763 } else { | |
0 | 2764 new_header_block = std_entry; |
2765 } | |
2766 | |
2767 // setup start block (root for the IR graph) | |
2768 Base* base = | |
2769 new Base( | |
2770 new_header_block, | |
2771 osr_entry | |
2772 ); | |
2773 start->set_next(base, 0); | |
2774 start->set_end(base); | |
2775 // create & setup state for start block | |
1819 | 2776 start->set_state(state->copy(ValueStack::StateAfter, std_entry->bci())); |
2777 base->set_state(state->copy(ValueStack::StateAfter, std_entry->bci())); | |
0 | 2778 |
2779 if (base->std_entry()->state() == NULL) { | |
2780 // setup states for header blocks | |
2781 base->std_entry()->merge(state); | |
2782 } | |
2783 | |
2784 assert(base->std_entry()->state() != NULL, ""); | |
2785 return start; | |
2786 } | |
2787 | |
2788 | |
2789 void GraphBuilder::setup_osr_entry_block() { | |
2790 assert(compilation()->is_osr_compile(), "only for osrs"); | |
2791 | |
2792 int osr_bci = compilation()->osr_bci(); | |
2793 ciBytecodeStream s(method()); | |
2794 s.reset_to_bci(osr_bci); | |
2795 s.next(); | |
2796 scope_data()->set_stream(&s); | |
2797 | |
2798 // create a new block to be the osr setup code | |
2799 _osr_entry = new BlockBegin(osr_bci); | |
2800 _osr_entry->set(BlockBegin::osr_entry_flag); | |
2801 _osr_entry->set_depth_first_number(0); | |
2802 BlockBegin* target = bci2block()->at(osr_bci); | |
2803 assert(target != NULL && target->is_set(BlockBegin::osr_entry_flag), "must be there"); | |
2804 // the osr entry has no values for locals | |
2805 ValueStack* state = target->state()->copy(); | |
2806 _osr_entry->set_state(state); | |
2807 | |
2808 kill_all(); | |
2809 _block = _osr_entry; | |
2810 _state = _osr_entry->state()->copy(); | |
1819 | 2811 assert(_state->bci() == osr_bci, "mismatch"); |
0 | 2812 _last = _osr_entry; |
2813 Value e = append(new OsrEntry()); | |
2814 e->set_needs_null_check(false); | |
2815 | |
2816 // OSR buffer is | |
2817 // | |
2818 // locals[nlocals-1..0] | |
2819 // monitors[number_of_locks-1..0] | |
2820 // | |
2821 // locals is a direct copy of the interpreter frame so in the osr buffer | |
2822 // so first slot in the local array is the last local from the interpreter | |
2823 // and last slot is local[0] (receiver) from the interpreter | |
2824 // | |
2825 // Similarly with locks. The first lock slot in the osr buffer is the nth lock | |
2826 // from the interpreter frame, the nth lock slot in the osr buffer is 0th lock | |
2827 // in the interpreter frame (the method lock if a sync method) | |
2828 | |
2829 // Initialize monitors in the compiled activation. | |
2830 | |
2831 int index; | |
2832 Value local; | |
2833 | |
2834 // find all the locals that the interpreter thinks contain live oops | |
2835 const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci); | |
2836 | |
2837 // compute the offset into the locals so that we can treat the buffer | |
2838 // as if the locals were still in the interpreter frame | |
2839 int locals_offset = BytesPerWord * (method()->max_locals() - 1); | |
2840 for_each_local_value(state, index, local) { | |
2841 int offset = locals_offset - (index + local->type()->size() - 1) * BytesPerWord; | |
2842 Value get; | |
2843 if (local->type()->is_object_kind() && !live_oops.at(index)) { | |
2844 // The interpreter thinks this local is dead but the compiler | |
2845 // doesn't so pretend that the interpreter passed in null. | |
2846 get = append(new Constant(objectNull)); | |
2847 } else { | |
2848 get = append(new UnsafeGetRaw(as_BasicType(local->type()), e, | |
2849 append(new Constant(new IntConstant(offset))), | |
2850 0, | |
2002 | 2851 true /*unaligned*/, true /*wide*/)); |
0 | 2852 } |
2853 _state->store_local(index, get); | |
2854 } | |
2855 | |
2856 // the storage for the OSR buffer is freed manually in the LIRGenerator. | |
2857 | |
2858 assert(state->caller_state() == NULL, "should be top scope"); | |
2859 state->clear_locals(); | |
2860 Goto* g = new Goto(target, false); | |
2861 append(g); | |
2862 _osr_entry->set_end(g); | |
2863 target->merge(_osr_entry->end()->state()); | |
2864 | |
2865 scope_data()->set_stream(NULL); | |
2866 } | |
2867 | |
2868 | |
2869 ValueStack* GraphBuilder::state_at_entry() { | |
1819 | 2870 ValueStack* state = new ValueStack(scope(), NULL); |
0 | 2871 |
2872 // Set up locals for receiver | |
2873 int idx = 0; | |
2874 if (!method()->is_static()) { | |
2875 // we should always see the receiver | |
2446 | 2876 state->store_local(idx, new Local(method()->holder(), objectType, idx)); |
0 | 2877 idx = 1; |
2878 } | |
2879 | |
2880 // Set up locals for incoming arguments | |
2881 ciSignature* sig = method()->signature(); | |
2882 for (int i = 0; i < sig->count(); i++) { | |
2883 ciType* type = sig->type_at(i); | |
2884 BasicType basic_type = type->basic_type(); | |
2885 // don't allow T_ARRAY to propagate into locals types | |
2886 if (basic_type == T_ARRAY) basic_type = T_OBJECT; | |
2887 ValueType* vt = as_ValueType(basic_type); | |
2446 | 2888 state->store_local(idx, new Local(type, vt, idx)); |
0 | 2889 idx += type->size(); |
2890 } | |
2891 | |
2892 // lock synchronized method | |
2893 if (method()->is_synchronized()) { | |
1819 | 2894 state->lock(NULL); |
0 | 2895 } |
2896 | |
2897 return state; | |
2898 } | |
2899 | |
2900 | |
2901 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope) | |
2902 : _scope_data(NULL) | |
2903 , _instruction_count(0) | |
2904 , _osr_entry(NULL) | |
2905 , _memory(new MemoryBuffer()) | |
2906 , _compilation(compilation) | |
2907 , _inline_bailout_msg(NULL) | |
2908 { | |
2909 int osr_bci = compilation->osr_bci(); | |
2910 | |
2911 // determine entry points and bci2block mapping | |
2912 BlockListBuilder blm(compilation, scope, osr_bci); | |
2913 CHECK_BAILOUT(); | |
2914 | |
2915 BlockList* bci2block = blm.bci2block(); | |
2916 BlockBegin* start_block = bci2block->at(0); | |
2917 | |
2918 push_root_scope(scope, bci2block, start_block); | |
2919 | |
2920 // setup state for std entry | |
2921 _initial_state = state_at_entry(); | |
2922 start_block->merge(_initial_state); | |
2923 | |
2924 // complete graph | |
2925 _vmap = new ValueMap(); | |
2926 switch (scope->method()->intrinsic_id()) { | |
2927 case vmIntrinsics::_dabs : // fall through | |
2928 case vmIntrinsics::_dsqrt : // fall through | |
2929 case vmIntrinsics::_dsin : // fall through | |
2930 case vmIntrinsics::_dcos : // fall through | |
2931 case vmIntrinsics::_dtan : // fall through | |
2932 case vmIntrinsics::_dlog : // fall through | |
2933 case vmIntrinsics::_dlog10 : // fall through | |
2934 { | |
2935 // Compiles where the root method is an intrinsic need a special | |
2936 // compilation environment because the bytecodes for the method | |
2937 // shouldn't be parsed during the compilation, only the special | |
2938 // Intrinsic node should be emitted. If this isn't done the the | |
2939 // code for the inlined version will be different than the root | |
2940 // compiled version which could lead to monotonicity problems on | |
2941 // intel. | |
2942 | |
2943 // Set up a stream so that appending instructions works properly. | |
2944 ciBytecodeStream s(scope->method()); | |
2945 s.reset_to_bci(0); | |
2946 scope_data()->set_stream(&s); | |
2947 s.next(); | |
2948 | |
2949 // setup the initial block state | |
2950 _block = start_block; | |
1819 | 2951 _state = start_block->state()->copy_for_parsing(); |
0 | 2952 _last = start_block; |
2953 load_local(doubleType, 0); | |
2954 | |
2955 // Emit the intrinsic node. | |
2956 bool result = try_inline_intrinsics(scope->method()); | |
2957 if (!result) BAILOUT("failed to inline intrinsic"); | |
2958 method_return(dpop()); | |
2959 | |
2960 // connect the begin and end blocks and we're all done. | |
2961 BlockEnd* end = last()->as_BlockEnd(); | |
2962 block()->set_end(end); | |
2963 break; | |
2964 } | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2965 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2966 case vmIntrinsics::_Reference_get: |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2967 { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2968 if (UseG1GC) { |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2969 // With java.lang.ref.reference.get() we must go through the |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2970 // intrinsic - when G1 is enabled - even when get() is the root |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2971 // method of the compile so that, if necessary, the value in |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2972 // the referent field of the reference object gets recorded by |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2973 // the pre-barrier code. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2974 // Specifically, if G1 is enabled, the value in the referent |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2975 // field is recorded by the G1 SATB pre barrier. This will |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2976 // result in the referent being marked live and the reference |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2977 // object removed from the list of discovered references during |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2978 // reference processing. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2979 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2980 // Set up a stream so that appending instructions works properly. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2981 ciBytecodeStream s(scope->method()); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2982 s.reset_to_bci(0); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2983 scope_data()->set_stream(&s); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2984 s.next(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2985 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2986 // setup the initial block state |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2987 _block = start_block; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2988 _state = start_block->state()->copy_for_parsing(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2989 _last = start_block; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2990 load_local(objectType, 0); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2991 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2992 // Emit the intrinsic node. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2993 bool result = try_inline_intrinsics(scope->method()); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2994 if (!result) BAILOUT("failed to inline intrinsic"); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2995 method_return(apop()); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2996 |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2997 // connect the begin and end blocks and we're all done. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2998 BlockEnd* end = last()->as_BlockEnd(); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
2999 block()->set_end(end); |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3000 break; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3001 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3002 // Otherwise, fall thru |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3003 } |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3004 |
0 | 3005 default: |
3006 scope_data()->add_to_work_list(start_block); | |
3007 iterate_all_blocks(); | |
3008 break; | |
3009 } | |
3010 CHECK_BAILOUT(); | |
3011 | |
3012 _start = setup_start_block(osr_bci, start_block, _osr_entry, _initial_state); | |
3013 | |
3014 eliminate_redundant_phis(_start); | |
3015 | |
3016 NOT_PRODUCT(if (PrintValueNumbering && Verbose) print_stats()); | |
3017 // for osr compile, bailout if some requirements are not fulfilled | |
3018 if (osr_bci != -1) { | |
3019 BlockBegin* osr_block = blm.bci2block()->at(osr_bci); | |
3020 assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile"); | |
3021 | |
3022 // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points | |
3023 if (!osr_block->state()->stack_is_empty()) { | |
3024 BAILOUT("stack not empty at OSR entry point"); | |
3025 } | |
3026 } | |
3027 #ifndef PRODUCT | |
3028 if (PrintCompilation && Verbose) tty->print_cr("Created %d Instructions", _instruction_count); | |
3029 #endif | |
3030 } | |
3031 | |
3032 | |
1819 | 3033 ValueStack* GraphBuilder::copy_state_before() { |
3034 return copy_state_before_with_bci(bci()); | |
3035 } | |
3036 | |
3037 ValueStack* GraphBuilder::copy_state_exhandling() { | |
3038 return copy_state_exhandling_with_bci(bci()); | |
3039 } | |
3040 | |
3041 ValueStack* GraphBuilder::copy_state_for_exception() { | |
3042 return copy_state_for_exception_with_bci(bci()); | |
3043 } | |
3044 | |
3045 ValueStack* GraphBuilder::copy_state_before_with_bci(int bci) { | |
3046 return state()->copy(ValueStack::StateBefore, bci); | |
0 | 3047 } |
3048 | |
1819 | 3049 ValueStack* GraphBuilder::copy_state_exhandling_with_bci(int bci) { |
3050 if (!has_handler()) return NULL; | |
3051 return state()->copy(ValueStack::StateBefore, bci); | |
3052 } | |
3053 | |
3054 ValueStack* GraphBuilder::copy_state_for_exception_with_bci(int bci) { | |
3055 ValueStack* s = copy_state_exhandling_with_bci(bci); | |
3056 if (s == NULL) { | |
3057 if (_compilation->env()->jvmti_can_access_local_variables()) { | |
3058 s = state()->copy(ValueStack::ExceptionState, bci); | |
3059 } else { | |
3060 s = state()->copy(ValueStack::EmptyExceptionState, bci); | |
3061 } | |
3062 } | |
3063 return s; | |
3064 } | |
0 | 3065 |
3066 int GraphBuilder::recursive_inline_level(ciMethod* cur_callee) const { | |
3067 int recur_level = 0; | |
3068 for (IRScope* s = scope(); s != NULL; s = s->caller()) { | |
3069 if (s->method() == cur_callee) { | |
3070 ++recur_level; | |
3071 } | |
3072 } | |
3073 return recur_level; | |
3074 } | |
3075 | |
3076 | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3077 bool GraphBuilder::try_inline(ciMethod* callee, bool holder_known, Value receiver) { |
0 | 3078 // Clear out any existing inline bailout condition |
3079 clear_inline_bailout(); | |
3080 | |
3081 if (callee->should_exclude()) { | |
3082 // callee is excluded | |
3083 INLINE_BAILOUT("excluded by CompilerOracle") | |
3844
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3084 } else if (callee->should_not_inline()) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3085 // callee is excluded |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3086 INLINE_BAILOUT("disallowed by CompilerOracle") |
0 | 3087 } else if (!callee->can_be_compiled()) { |
3088 // callee is not compilable (prob. has breakpoints) | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3089 INLINE_BAILOUT("not compilable (disabled)") |
0 | 3090 } else if (callee->intrinsic_id() != vmIntrinsics::_none && try_inline_intrinsics(callee)) { |
3091 // intrinsics can be native or not | |
3092 return true; | |
3093 } else if (callee->is_native()) { | |
3094 // non-intrinsic natives cannot be inlined | |
3095 INLINE_BAILOUT("non-intrinsic native") | |
3096 } else if (callee->is_abstract()) { | |
3097 INLINE_BAILOUT("abstract") | |
3098 } else { | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3099 return try_inline_full(callee, holder_known, NULL, receiver); |
0 | 3100 } |
3101 } | |
3102 | |
3103 | |
3104 bool GraphBuilder::try_inline_intrinsics(ciMethod* callee) { | |
3105 if (!InlineNatives ) INLINE_BAILOUT("intrinsic method inlining disabled"); | |
1540
99791ad65936
6953539: after 6892658 c1 reports that it doesn't inline StringBuffer.append
never
parents:
1397
diff
changeset
|
3106 if (callee->is_synchronized()) { |
99791ad65936
6953539: after 6892658 c1 reports that it doesn't inline StringBuffer.append
never
parents:
1397
diff
changeset
|
3107 // We don't currently support any synchronized intrinsics |
99791ad65936
6953539: after 6892658 c1 reports that it doesn't inline StringBuffer.append
never
parents:
1397
diff
changeset
|
3108 return false; |
99791ad65936
6953539: after 6892658 c1 reports that it doesn't inline StringBuffer.append
never
parents:
1397
diff
changeset
|
3109 } |
99791ad65936
6953539: after 6892658 c1 reports that it doesn't inline StringBuffer.append
never
parents:
1397
diff
changeset
|
3110 |
0 | 3111 // callee seems like a good candidate |
3112 // determine id | |
3113 bool preserves_state = false; | |
3114 bool cantrap = true; | |
3115 vmIntrinsics::ID id = callee->intrinsic_id(); | |
3116 switch (id) { | |
3117 case vmIntrinsics::_arraycopy : | |
3118 if (!InlineArrayCopy) return false; | |
3119 break; | |
3120 | |
3121 case vmIntrinsics::_currentTimeMillis: | |
3122 case vmIntrinsics::_nanoTime: | |
3123 preserves_state = true; | |
3124 cantrap = false; | |
3125 break; | |
3126 | |
3127 case vmIntrinsics::_floatToRawIntBits : | |
3128 case vmIntrinsics::_intBitsToFloat : | |
3129 case vmIntrinsics::_doubleToRawLongBits : | |
3130 case vmIntrinsics::_longBitsToDouble : | |
3131 if (!InlineMathNatives) return false; | |
3132 preserves_state = true; | |
3133 cantrap = false; | |
3134 break; | |
3135 | |
3136 case vmIntrinsics::_getClass : | |
3137 if (!InlineClassNatives) return false; | |
3138 preserves_state = true; | |
3139 break; | |
3140 | |
3141 case vmIntrinsics::_currentThread : | |
3142 if (!InlineThreadNatives) return false; | |
3143 preserves_state = true; | |
3144 cantrap = false; | |
3145 break; | |
3146 | |
3147 case vmIntrinsics::_dabs : // fall through | |
3148 case vmIntrinsics::_dsqrt : // fall through | |
3149 case vmIntrinsics::_dsin : // fall through | |
3150 case vmIntrinsics::_dcos : // fall through | |
3151 case vmIntrinsics::_dtan : // fall through | |
3152 case vmIntrinsics::_dlog : // fall through | |
3153 case vmIntrinsics::_dlog10 : // fall through | |
3154 if (!InlineMathNatives) return false; | |
3155 cantrap = false; | |
3156 preserves_state = true; | |
3157 break; | |
3158 | |
3159 // sun/misc/AtomicLong.attemptUpdate | |
3160 case vmIntrinsics::_attemptUpdate : | |
3161 if (!VM_Version::supports_cx8()) return false; | |
3162 if (!InlineAtomicLong) return false; | |
3163 preserves_state = true; | |
3164 break; | |
3165 | |
3166 // Use special nodes for Unsafe instructions so we can more easily | |
3167 // perform an address-mode optimization on the raw variants | |
3168 case vmIntrinsics::_getObject : return append_unsafe_get_obj(callee, T_OBJECT, false); | |
3169 case vmIntrinsics::_getBoolean: return append_unsafe_get_obj(callee, T_BOOLEAN, false); | |
3170 case vmIntrinsics::_getByte : return append_unsafe_get_obj(callee, T_BYTE, false); | |
3171 case vmIntrinsics::_getShort : return append_unsafe_get_obj(callee, T_SHORT, false); | |
3172 case vmIntrinsics::_getChar : return append_unsafe_get_obj(callee, T_CHAR, false); | |
3173 case vmIntrinsics::_getInt : return append_unsafe_get_obj(callee, T_INT, false); | |
3174 case vmIntrinsics::_getLong : return append_unsafe_get_obj(callee, T_LONG, false); | |
3175 case vmIntrinsics::_getFloat : return append_unsafe_get_obj(callee, T_FLOAT, false); | |
3176 case vmIntrinsics::_getDouble : return append_unsafe_get_obj(callee, T_DOUBLE, false); | |
3177 | |
3178 case vmIntrinsics::_putObject : return append_unsafe_put_obj(callee, T_OBJECT, false); | |
3179 case vmIntrinsics::_putBoolean: return append_unsafe_put_obj(callee, T_BOOLEAN, false); | |
3180 case vmIntrinsics::_putByte : return append_unsafe_put_obj(callee, T_BYTE, false); | |
3181 case vmIntrinsics::_putShort : return append_unsafe_put_obj(callee, T_SHORT, false); | |
3182 case vmIntrinsics::_putChar : return append_unsafe_put_obj(callee, T_CHAR, false); | |
3183 case vmIntrinsics::_putInt : return append_unsafe_put_obj(callee, T_INT, false); | |
3184 case vmIntrinsics::_putLong : return append_unsafe_put_obj(callee, T_LONG, false); | |
3185 case vmIntrinsics::_putFloat : return append_unsafe_put_obj(callee, T_FLOAT, false); | |
3186 case vmIntrinsics::_putDouble : return append_unsafe_put_obj(callee, T_DOUBLE, false); | |
3187 | |
3188 case vmIntrinsics::_getObjectVolatile : return append_unsafe_get_obj(callee, T_OBJECT, true); | |
3189 case vmIntrinsics::_getBooleanVolatile: return append_unsafe_get_obj(callee, T_BOOLEAN, true); | |
3190 case vmIntrinsics::_getByteVolatile : return append_unsafe_get_obj(callee, T_BYTE, true); | |
3191 case vmIntrinsics::_getShortVolatile : return append_unsafe_get_obj(callee, T_SHORT, true); | |
3192 case vmIntrinsics::_getCharVolatile : return append_unsafe_get_obj(callee, T_CHAR, true); | |
3193 case vmIntrinsics::_getIntVolatile : return append_unsafe_get_obj(callee, T_INT, true); | |
3194 case vmIntrinsics::_getLongVolatile : return append_unsafe_get_obj(callee, T_LONG, true); | |
3195 case vmIntrinsics::_getFloatVolatile : return append_unsafe_get_obj(callee, T_FLOAT, true); | |
3196 case vmIntrinsics::_getDoubleVolatile : return append_unsafe_get_obj(callee, T_DOUBLE, true); | |
3197 | |
3198 case vmIntrinsics::_putObjectVolatile : return append_unsafe_put_obj(callee, T_OBJECT, true); | |
3199 case vmIntrinsics::_putBooleanVolatile: return append_unsafe_put_obj(callee, T_BOOLEAN, true); | |
3200 case vmIntrinsics::_putByteVolatile : return append_unsafe_put_obj(callee, T_BYTE, true); | |
3201 case vmIntrinsics::_putShortVolatile : return append_unsafe_put_obj(callee, T_SHORT, true); | |
3202 case vmIntrinsics::_putCharVolatile : return append_unsafe_put_obj(callee, T_CHAR, true); | |
3203 case vmIntrinsics::_putIntVolatile : return append_unsafe_put_obj(callee, T_INT, true); | |
3204 case vmIntrinsics::_putLongVolatile : return append_unsafe_put_obj(callee, T_LONG, true); | |
3205 case vmIntrinsics::_putFloatVolatile : return append_unsafe_put_obj(callee, T_FLOAT, true); | |
3206 case vmIntrinsics::_putDoubleVolatile : return append_unsafe_put_obj(callee, T_DOUBLE, true); | |
3207 | |
3208 case vmIntrinsics::_getByte_raw : return append_unsafe_get_raw(callee, T_BYTE); | |
3209 case vmIntrinsics::_getShort_raw : return append_unsafe_get_raw(callee, T_SHORT); | |
3210 case vmIntrinsics::_getChar_raw : return append_unsafe_get_raw(callee, T_CHAR); | |
3211 case vmIntrinsics::_getInt_raw : return append_unsafe_get_raw(callee, T_INT); | |
3212 case vmIntrinsics::_getLong_raw : return append_unsafe_get_raw(callee, T_LONG); | |
3213 case vmIntrinsics::_getFloat_raw : return append_unsafe_get_raw(callee, T_FLOAT); | |
3214 case vmIntrinsics::_getDouble_raw : return append_unsafe_get_raw(callee, T_DOUBLE); | |
3215 | |
3216 case vmIntrinsics::_putByte_raw : return append_unsafe_put_raw(callee, T_BYTE); | |
3217 case vmIntrinsics::_putShort_raw : return append_unsafe_put_raw(callee, T_SHORT); | |
3218 case vmIntrinsics::_putChar_raw : return append_unsafe_put_raw(callee, T_CHAR); | |
3219 case vmIntrinsics::_putInt_raw : return append_unsafe_put_raw(callee, T_INT); | |
3220 case vmIntrinsics::_putLong_raw : return append_unsafe_put_raw(callee, T_LONG); | |
3221 case vmIntrinsics::_putFloat_raw : return append_unsafe_put_raw(callee, T_FLOAT); | |
3222 case vmIntrinsics::_putDouble_raw : return append_unsafe_put_raw(callee, T_DOUBLE); | |
3223 | |
3224 case vmIntrinsics::_prefetchRead : return append_unsafe_prefetch(callee, false, false); | |
3225 case vmIntrinsics::_prefetchWrite : return append_unsafe_prefetch(callee, false, true); | |
3226 case vmIntrinsics::_prefetchReadStatic : return append_unsafe_prefetch(callee, true, false); | |
3227 case vmIntrinsics::_prefetchWriteStatic : return append_unsafe_prefetch(callee, true, true); | |
3228 | |
3229 case vmIntrinsics::_checkIndex : | |
3230 if (!InlineNIOCheckIndex) return false; | |
3231 preserves_state = true; | |
3232 break; | |
3233 case vmIntrinsics::_putOrderedObject : return append_unsafe_put_obj(callee, T_OBJECT, true); | |
3234 case vmIntrinsics::_putOrderedInt : return append_unsafe_put_obj(callee, T_INT, true); | |
3235 case vmIntrinsics::_putOrderedLong : return append_unsafe_put_obj(callee, T_LONG, true); | |
3236 | |
3237 case vmIntrinsics::_compareAndSwapLong: | |
3238 if (!VM_Version::supports_cx8()) return false; | |
3239 // fall through | |
3240 case vmIntrinsics::_compareAndSwapInt: | |
3241 case vmIntrinsics::_compareAndSwapObject: | |
3242 append_unsafe_CAS(callee); | |
3243 return true; | |
3244 | |
3249
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3245 case vmIntrinsics::_Reference_get: |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3246 // It is only when G1 is enabled that we absolutely |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3247 // need to use the intrinsic version of Reference.get() |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3248 // so that the value in the referent field, if necessary, |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3249 // can be registered by the pre-barrier code. |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3250 if (!UseG1GC) return false; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3251 preserves_state = true; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3252 break; |
e1162778c1c8
7009266: G1: assert(obj->is_oop_or_null(true )) failed: Error
johnc
parents:
2376
diff
changeset
|
3253 |
0 | 3254 default : return false; // do not inline |
3255 } | |
3256 // create intrinsic node | |
3257 const bool has_receiver = !callee->is_static(); | |
3258 ValueType* result_type = as_ValueType(callee->return_type()); | |
1819 | 3259 ValueStack* state_before = copy_state_for_exception(); |
0 | 3260 |
3261 Values* args = state()->pop_arguments(callee->arg_size()); | |
1783 | 3262 |
3263 if (is_profiling()) { | |
0 | 3264 // Don't profile in the special case where the root method |
3265 // is the intrinsic | |
3266 if (callee != method()) { | |
1783 | 3267 // Note that we'd collect profile data in this method if we wanted it. |
3268 compilation()->set_would_profile(true); | |
3269 if (profile_calls()) { | |
3270 Value recv = NULL; | |
3271 if (has_receiver) { | |
3272 recv = args->at(0); | |
3273 null_check(recv); | |
3274 } | |
3275 profile_call(recv, NULL); | |
0 | 3276 } |
3277 } | |
3278 } | |
3279 | |
1819 | 3280 Intrinsic* result = new Intrinsic(result_type, id, args, has_receiver, state_before, |
0 | 3281 preserves_state, cantrap); |
3282 // append instruction & push result | |
3283 Value value = append_split(result); | |
3284 if (result_type != voidType) push(result_type, value); | |
3285 | |
3286 #ifndef PRODUCT | |
3287 // printing | |
3288 if (PrintInlining) { | |
3289 print_inline_result(callee, true); | |
3290 } | |
3291 #endif | |
3292 | |
3293 // done | |
3294 return true; | |
3295 } | |
3296 | |
3297 | |
3298 bool GraphBuilder::try_inline_jsr(int jsr_dest_bci) { | |
3299 // Introduce a new callee continuation point - all Ret instructions | |
3300 // will be replaced with Gotos to this point. | |
3301 BlockBegin* cont = block_at(next_bci()); | |
3302 assert(cont != NULL, "continuation must exist (BlockListBuilder starts a new block after a jsr"); | |
3303 | |
3304 // Note: can not assign state to continuation yet, as we have to | |
3305 // pick up the state from the Ret instructions. | |
3306 | |
3307 // Push callee scope | |
3308 push_scope_for_jsr(cont, jsr_dest_bci); | |
3309 | |
3310 // Temporarily set up bytecode stream so we can append instructions | |
3311 // (only using the bci of this stream) | |
3312 scope_data()->set_stream(scope_data()->parent()->stream()); | |
3313 | |
3314 BlockBegin* jsr_start_block = block_at(jsr_dest_bci); | |
3315 assert(jsr_start_block != NULL, "jsr start block must exist"); | |
3316 assert(!jsr_start_block->is_set(BlockBegin::was_visited_flag), "should not have visited jsr yet"); | |
3317 Goto* goto_sub = new Goto(jsr_start_block, false); | |
3318 // Must copy state to avoid wrong sharing when parsing bytecodes | |
3319 assert(jsr_start_block->state() == NULL, "should have fresh jsr starting block"); | |
1819 | 3320 jsr_start_block->set_state(copy_state_before_with_bci(jsr_dest_bci)); |
0 | 3321 append(goto_sub); |
3322 _block->set_end(goto_sub); | |
3323 _last = _block = jsr_start_block; | |
3324 | |
3325 // Clear out bytecode stream | |
3326 scope_data()->set_stream(NULL); | |
3327 | |
3328 scope_data()->add_to_work_list(jsr_start_block); | |
3329 | |
3330 // Ready to resume parsing in subroutine | |
3331 iterate_all_blocks(); | |
3332 | |
3333 // If we bailed out during parsing, return immediately (this is bad news) | |
3334 CHECK_BAILOUT_(false); | |
3335 | |
3336 // Detect whether the continuation can actually be reached. If not, | |
3337 // it has not had state set by the join() operations in | |
3338 // iterate_bytecodes_for_block()/ret() and we should not touch the | |
3339 // iteration state. The calling activation of | |
3340 // iterate_bytecodes_for_block will then complete normally. | |
3341 if (cont->state() != NULL) { | |
3342 if (!cont->is_set(BlockBegin::was_visited_flag)) { | |
3343 // add continuation to work list instead of parsing it immediately | |
3344 scope_data()->parent()->add_to_work_list(cont); | |
3345 } | |
3346 } | |
3347 | |
3348 assert(jsr_continuation() == cont, "continuation must not have changed"); | |
3349 assert(!jsr_continuation()->is_set(BlockBegin::was_visited_flag) || | |
3350 jsr_continuation()->is_set(BlockBegin::parser_loop_header_flag), | |
3351 "continuation can only be visited in case of backward branches"); | |
3352 assert(_last && _last->as_BlockEnd(), "block must have end"); | |
3353 | |
3354 // continuation is in work list, so end iteration of current block | |
3355 _skip_block = true; | |
3356 pop_scope_for_jsr(); | |
3357 | |
3358 return true; | |
3359 } | |
3360 | |
3361 | |
3362 // Inline the entry of a synchronized method as a monitor enter and | |
3363 // register the exception handler which releases the monitor if an | |
3364 // exception is thrown within the callee. Note that the monitor enter | |
3365 // cannot throw an exception itself, because the receiver is | |
3366 // guaranteed to be non-null by the explicit null check at the | |
3367 // beginning of inlining. | |
3368 void GraphBuilder::inline_sync_entry(Value lock, BlockBegin* sync_handler) { | |
3369 assert(lock != NULL && sync_handler != NULL, "lock or handler missing"); | |
3370 | |
3371 monitorenter(lock, SynchronizationEntryBCI); | |
3372 assert(_last->as_MonitorEnter() != NULL, "monitor enter expected"); | |
3373 _last->set_needs_null_check(false); | |
3374 | |
3375 sync_handler->set(BlockBegin::exception_entry_flag); | |
3376 sync_handler->set(BlockBegin::is_on_work_list_flag); | |
3377 | |
3378 ciExceptionHandler* desc = new ciExceptionHandler(method()->holder(), 0, method()->code_size(), -1, 0); | |
3379 XHandler* h = new XHandler(desc); | |
3380 h->set_entry_block(sync_handler); | |
3381 scope_data()->xhandlers()->append(h); | |
3382 scope_data()->set_has_handler(); | |
3383 } | |
3384 | |
3385 | |
3386 // If an exception is thrown and not handled within an inlined | |
3387 // synchronized method, the monitor must be released before the | |
3388 // exception is rethrown in the outer scope. Generate the appropriate | |
3389 // instructions here. | |
3390 void GraphBuilder::fill_sync_handler(Value lock, BlockBegin* sync_handler, bool default_handler) { | |
3391 BlockBegin* orig_block = _block; | |
3392 ValueStack* orig_state = _state; | |
3393 Instruction* orig_last = _last; | |
3394 _last = _block = sync_handler; | |
3395 _state = sync_handler->state()->copy(); | |
3396 | |
3397 assert(sync_handler != NULL, "handler missing"); | |
3398 assert(!sync_handler->is_set(BlockBegin::was_visited_flag), "is visited here"); | |
3399 | |
3400 assert(lock != NULL || default_handler, "lock or handler missing"); | |
3401 | |
3402 XHandler* h = scope_data()->xhandlers()->remove_last(); | |
3403 assert(h->entry_block() == sync_handler, "corrupt list of handlers"); | |
3404 | |
3405 block()->set(BlockBegin::was_visited_flag); | |
3406 Value exception = append_with_bci(new ExceptionObject(), SynchronizationEntryBCI); | |
3407 assert(exception->is_pinned(), "must be"); | |
3408 | |
2318
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3409 int bci = SynchronizationEntryBCI; |
2166
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3410 if (compilation()->env()->dtrace_method_probes()) { |
2318
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3411 // Report exit from inline methods. We don't have a stream here |
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3412 // so pass an explicit bci of SynchronizationEntryBCI. |
2166
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3413 Values* args = new Values(1); |
2318
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3414 args->push(append_with_bci(new Constant(new ObjectConstant(method())), bci)); |
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3415 append_with_bci(new RuntimeCall(voidType, "dtrace_method_exit", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), args), bci); |
2166
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3416 } |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3417 |
0 | 3418 if (lock) { |
3419 assert(state()->locks_size() > 0 && state()->lock_at(state()->locks_size() - 1) == lock, "lock is missing"); | |
1819 | 3420 if (!lock->is_linked()) { |
2318
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3421 lock = append_with_bci(lock, bci); |
0 | 3422 } |
3423 | |
3424 // exit the monitor in the context of the synchronized method | |
2318
6f3746e69a78
7021603: crash in fill_sync_handler with ExtendedDTrace probes
never
parents:
2167
diff
changeset
|
3425 monitorexit(lock, bci); |
0 | 3426 |
3427 // exit the context of the synchronized method | |
3428 if (!default_handler) { | |
3429 pop_scope(); | |
1819 | 3430 bci = _state->caller_state()->bci(); |
3431 _state = _state->caller_state()->copy_for_parsing(); | |
0 | 3432 } |
3433 } | |
3434 | |
3435 // perform the throw as if at the the call site | |
3436 apush(exception); | |
3437 throw_op(bci); | |
3438 | |
3439 BlockEnd* end = last()->as_BlockEnd(); | |
3440 block()->set_end(end); | |
3441 | |
3442 _block = orig_block; | |
3443 _state = orig_state; | |
3444 _last = orig_last; | |
3445 } | |
3446 | |
3447 | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3448 bool GraphBuilder::try_inline_full(ciMethod* callee, bool holder_known, BlockBegin* cont_block, Value receiver) { |
0 | 3449 assert(!callee->is_native(), "callee must not be native"); |
3791
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3255
diff
changeset
|
3450 if (CompilationPolicy::policy()->should_not_inline(compilation()->env(), callee)) { |
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3255
diff
changeset
|
3451 INLINE_BAILOUT("inlining prohibited by policy"); |
1783 | 3452 } |
0 | 3453 // first perform tests of things it's not possible to inline |
3454 if (callee->has_exception_handlers() && | |
3455 !InlineMethodsWithExceptionHandlers) INLINE_BAILOUT("callee has exception handlers"); | |
3456 if (callee->is_synchronized() && | |
3457 !InlineSynchronizedMethods ) INLINE_BAILOUT("callee is synchronized"); | |
3458 if (!callee->holder()->is_initialized()) INLINE_BAILOUT("callee's klass not initialized yet"); | |
3459 if (!callee->has_balanced_monitors()) INLINE_BAILOUT("callee's monitors do not match"); | |
3460 | |
3461 // Proper inlining of methods with jsrs requires a little more work. | |
3462 if (callee->has_jsrs() ) INLINE_BAILOUT("jsrs not handled properly by inliner yet"); | |
3463 | |
3464 // When SSE2 is used on intel, then no special handling is needed | |
3465 // for strictfp because the enum-constant is fixed at compile time, | |
3466 // the check for UseSSE2 is needed here | |
3467 if (strict_fp_requires_explicit_rounding && UseSSE < 2 && method()->is_strict() != callee->is_strict()) { | |
3468 INLINE_BAILOUT("caller and callee have different strict fp requirements"); | |
3469 } | |
3470 | |
2007
5ddfcf4b079e
7003554: (tiered) assert(is_null_object() || handle() != NULL) failed: cannot embed null pointer
iveresov
parents:
2002
diff
changeset
|
3471 if (is_profiling() && !callee->ensure_method_data()) { |
5ddfcf4b079e
7003554: (tiered) assert(is_null_object() || handle() != NULL) failed: cannot embed null pointer
iveresov
parents:
2002
diff
changeset
|
3472 INLINE_BAILOUT("mdo allocation failed"); |
5ddfcf4b079e
7003554: (tiered) assert(is_null_object() || handle() != NULL) failed: cannot embed null pointer
iveresov
parents:
2002
diff
changeset
|
3473 } |
3844
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3474 |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3475 // now perform tests that are based on flag settings |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3476 if (callee->should_inline()) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3477 // ignore heuristic controls on inlining |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3478 } else { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3479 if (inline_level() > MaxInlineLevel ) INLINE_BAILOUT("too-deep inlining"); |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3480 if (recursive_inline_level(callee) > MaxRecursiveInlineLevel) INLINE_BAILOUT("too-deep recursive inlining"); |
3897
de847cac9235
7078382: JSR 292: don't count method handle adapters against inlining budgets
twisti
parents:
3844
diff
changeset
|
3481 if (callee->code_size_for_inlining() > max_inline_size() ) INLINE_BAILOUT("callee is too large"); |
3844
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3482 |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3483 // don't inline throwable methods unless the inlining tree is rooted in a throwable class |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3484 if (callee->name() == ciSymbol::object_initializer_name() && |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3485 callee->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3486 // Throwable constructor call |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3487 IRScope* top = scope(); |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3488 while (top->caller() != NULL) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3489 top = top->caller(); |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3490 } |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3491 if (!top->method()->holder()->is_subclass_of(ciEnv::current()->Throwable_klass())) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3492 INLINE_BAILOUT("don't inline Throwable constructors"); |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3493 } |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3494 } |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3495 |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3496 if (compilation()->env()->num_inlined_bytecodes() > DesiredMethodLimit) { |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3497 INLINE_BAILOUT("total inlining greater than DesiredMethodLimit"); |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3498 } |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3499 } |
ce3e1d4dc416
7060619: C1 should respect inline and dontinline directives from CompilerOracle
never
parents:
3791
diff
changeset
|
3500 |
0 | 3501 #ifndef PRODUCT |
3502 // printing | |
3503 if (PrintInlining) { | |
3504 print_inline_result(callee, true); | |
3505 } | |
3506 #endif | |
3507 | |
3508 // NOTE: Bailouts from this point on, which occur at the | |
3509 // GraphBuilder level, do not cause bailout just of the inlining but | |
3510 // in fact of the entire compilation. | |
3511 | |
3512 BlockBegin* orig_block = block(); | |
3513 | |
3514 const int args_base = state()->stack_size() - callee->arg_size(); | |
3515 assert(args_base >= 0, "stack underflow during inlining"); | |
3516 | |
3517 // Insert null check if necessary | |
3518 Value recv = NULL; | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3519 if (code() != Bytecodes::_invokestatic && |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3520 code() != Bytecodes::_invokedynamic) { |
0 | 3521 // note: null check must happen even if first instruction of callee does |
3522 // an implicit null check since the callee is in a different scope | |
3523 // and we must make sure exception handling does the right thing | |
3524 assert(!callee->is_static(), "callee must not be static"); | |
3525 assert(callee->arg_size() > 0, "must have at least a receiver"); | |
3526 recv = state()->stack_at(args_base); | |
3527 null_check(recv); | |
3528 } | |
3529 | |
1783 | 3530 if (is_profiling()) { |
3531 // Note that we'd collect profile data in this method if we wanted it. | |
3532 // this may be redundant here... | |
3533 compilation()->set_would_profile(true); | |
3534 | |
3535 if (profile_calls()) { | |
3536 profile_call(recv, holder_known ? callee->holder() : NULL); | |
3537 } | |
0 | 3538 } |
3539 | |
3540 // Introduce a new callee continuation point - if the callee has | |
3541 // more than one return instruction or the return does not allow | |
3542 // fall-through of control flow, all return instructions of the | |
3543 // callee will need to be replaced by Goto's pointing to this | |
3544 // continuation point. | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3545 BlockBegin* cont = cont_block != NULL ? cont_block : block_at(next_bci()); |
0 | 3546 bool continuation_existed = true; |
3547 if (cont == NULL) { | |
3548 cont = new BlockBegin(next_bci()); | |
3549 // low number so that continuation gets parsed as early as possible | |
3550 cont->set_depth_first_number(0); | |
3551 #ifndef PRODUCT | |
3552 if (PrintInitialBlockList) { | |
3553 tty->print_cr("CFG: created block %d (bci %d) as continuation for inline at bci %d", | |
3554 cont->block_id(), cont->bci(), bci()); | |
3555 } | |
3556 #endif | |
3557 continuation_existed = false; | |
3558 } | |
3559 // Record number of predecessors of continuation block before | |
3560 // inlining, to detect if inlined method has edges to its | |
3561 // continuation after inlining. | |
3562 int continuation_preds = cont->number_of_preds(); | |
3563 | |
3564 // Push callee scope | |
3565 push_scope(callee, cont); | |
3566 | |
3567 // the BlockListBuilder for the callee could have bailed out | |
3568 CHECK_BAILOUT_(false); | |
3569 | |
3570 // Temporarily set up bytecode stream so we can append instructions | |
3571 // (only using the bci of this stream) | |
3572 scope_data()->set_stream(scope_data()->parent()->stream()); | |
3573 | |
3574 // Pass parameters into callee state: add assignments | |
3575 // note: this will also ensure that all arguments are computed before being passed | |
3576 ValueStack* callee_state = state(); | |
1819 | 3577 ValueStack* caller_state = state()->caller_state(); |
0 | 3578 { int i = args_base; |
3579 while (i < caller_state->stack_size()) { | |
3580 const int par_no = i - args_base; | |
3581 Value arg = caller_state->stack_at_inc(i); | |
3582 // NOTE: take base() of arg->type() to avoid problems storing | |
3583 // constants | |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3584 if (receiver != NULL && par_no == 0) { |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3585 arg = receiver; |
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3586 } |
0 | 3587 store_local(callee_state, arg, arg->type()->base(), par_no); |
3588 } | |
3589 } | |
3590 | |
3591 // Remove args from stack. | |
3592 // Note that we preserve locals state in case we can use it later | |
3593 // (see use of pop_scope() below) | |
3594 caller_state->truncate_stack(args_base); | |
1819 | 3595 assert(callee_state->stack_size() == 0, "callee stack must be empty"); |
0 | 3596 |
3597 Value lock; | |
3598 BlockBegin* sync_handler; | |
3599 | |
3600 // Inline the locking of the receiver if the callee is synchronized | |
3601 if (callee->is_synchronized()) { | |
3602 lock = callee->is_static() ? append(new Constant(new InstanceConstant(callee->holder()->java_mirror()))) | |
3603 : state()->local_at(0); | |
1819 | 3604 sync_handler = new BlockBegin(SynchronizationEntryBCI); |
0 | 3605 inline_sync_entry(lock, sync_handler); |
3606 } | |
3607 | |
2166
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3608 if (compilation()->env()->dtrace_method_probes()) { |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3609 Values* args = new Values(1); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3610 args->push(append(new Constant(new ObjectConstant(method())))); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3611 append(new RuntimeCall(voidType, "dtrace_method_entry", CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), args)); |
403dc4c1d7f5
6809483: hotspot:::method_entry are not correctly generated for "method()V"
never
parents:
2007
diff
changeset
|
3612 } |
0 | 3613 |
4116
973293defacd
7112085: assert(fr.interpreter_frame_expression_stack_size()==0) failed: only handle empty stacks
iveresov
parents:
3997
diff
changeset
|
3614 if (profile_inlined_calls()) { |
973293defacd
7112085: assert(fr.interpreter_frame_expression_stack_size()==0) failed: only handle empty stacks
iveresov
parents:
3997
diff
changeset
|
3615 profile_invocation(callee, copy_state_before_with_bci(SynchronizationEntryBCI)); |
973293defacd
7112085: assert(fr.interpreter_frame_expression_stack_size()==0) failed: only handle empty stacks
iveresov
parents:
3997
diff
changeset
|
3616 } |
973293defacd
7112085: assert(fr.interpreter_frame_expression_stack_size()==0) failed: only handle empty stacks
iveresov
parents:
3997
diff
changeset
|
3617 |
0 | 3618 BlockBegin* callee_start_block = block_at(0); |
3619 if (callee_start_block != NULL) { | |
3620 assert(callee_start_block->is_set(BlockBegin::parser_loop_header_flag), "must be loop header"); | |
3621 Goto* goto_callee = new Goto(callee_start_block, false); | |
3622 // The state for this goto is in the scope of the callee, so use | |
3623 // the entry bci for the callee instead of the call site bci. | |
3624 append_with_bci(goto_callee, 0); | |
3625 _block->set_end(goto_callee); | |
3626 callee_start_block->merge(callee_state); | |
3627 | |
3628 _last = _block = callee_start_block; | |
3629 | |
3630 scope_data()->add_to_work_list(callee_start_block); | |
3631 } | |
3632 | |
3633 // Clear out bytecode stream | |
3634 scope_data()->set_stream(NULL); | |
3635 | |
3636 // Ready to resume parsing in callee (either in the same block we | |
3637 // were in before or in the callee's start block) | |
3638 iterate_all_blocks(callee_start_block == NULL); | |
3639 | |
3640 // If we bailed out during parsing, return immediately (this is bad news) | |
3641 if (bailed_out()) return false; | |
3642 | |
3643 // iterate_all_blocks theoretically traverses in random order; in | |
3644 // practice, we have only traversed the continuation if we are | |
3645 // inlining into a subroutine | |
3646 assert(continuation_existed || | |
3647 !continuation()->is_set(BlockBegin::was_visited_flag), | |
3648 "continuation should not have been parsed yet if we created it"); | |
3649 | |
3650 // If we bailed out during parsing, return immediately (this is bad news) | |
3651 CHECK_BAILOUT_(false); | |
3652 | |
3653 // At this point we are almost ready to return and resume parsing of | |
3654 // the caller back in the GraphBuilder. The only thing we want to do | |
3655 // first is an optimization: during parsing of the callee we | |
3656 // generated at least one Goto to the continuation block. If we | |
3657 // generated exactly one, and if the inlined method spanned exactly | |
3658 // one block (and we didn't have to Goto its entry), then we snip | |
3659 // off the Goto to the continuation, allowing control to fall | |
3660 // through back into the caller block and effectively performing | |
3661 // block merging. This allows load elimination and CSE to take place | |
3662 // across multiple callee scopes if they are relatively simple, and | |
3663 // is currently essential to making inlining profitable. | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3664 if (cont_block == NULL) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3665 if (num_returns() == 1 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3666 && block() == orig_block |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3667 && block() == inline_cleanup_block()) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3668 _last = inline_cleanup_return_prev(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3669 _state = inline_cleanup_state(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3670 } else if (continuation_preds == cont->number_of_preds()) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3671 // Inlining caused that the instructions after the invoke in the |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3672 // caller are not reachable any more. So skip filling this block |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3673 // with instructions! |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3674 assert(cont == continuation(), ""); |
0 | 3675 assert(_last && _last->as_BlockEnd(), ""); |
3676 _skip_block = true; | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3677 } else { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3678 // Resume parsing in continuation block unless it was already parsed. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3679 // Note that if we don't change _last here, iteration in |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3680 // iterate_bytecodes_for_block will stop when we return. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3681 if (!continuation()->is_set(BlockBegin::was_visited_flag)) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3682 // add continuation to work list instead of parsing it immediately |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3683 assert(_last && _last->as_BlockEnd(), ""); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3684 scope_data()->parent()->add_to_work_list(continuation()); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3685 _skip_block = true; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3686 } |
0 | 3687 } |
3688 } | |
3689 | |
3690 // Fill the exception handler for synchronized methods with instructions | |
3691 if (callee->is_synchronized() && sync_handler->state() != NULL) { | |
3692 fill_sync_handler(lock, sync_handler); | |
3693 } else { | |
3694 pop_scope(); | |
3695 } | |
3696 | |
3697 compilation()->notice_inlined_method(callee); | |
3698 | |
3699 return true; | |
3700 } | |
3701 | |
3702 | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3703 bool GraphBuilder::for_method_handle_inline(ciMethod* callee) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3704 assert(!callee->is_static(), "change next line"); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3705 int index = state()->stack_size() - (callee->arg_size_no_receiver() + 1); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3706 Value receiver = state()->stack_at(index); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3707 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3708 if (receiver->type()->is_constant()) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3709 ciMethodHandle* method_handle = receiver->type()->as_ObjectType()->constant_value()->as_method_handle(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3710 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3711 // Set the callee to have access to the class and signature in |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3712 // the MethodHandleCompiler. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3713 method_handle->set_callee(callee); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3714 method_handle->set_caller(method()); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3715 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3716 // Get an adapter for the MethodHandle. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3717 ciMethod* method_handle_adapter = method_handle->get_method_handle_adapter(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3718 if (method_handle_adapter != NULL) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3719 return try_inline(method_handle_adapter, /*holder_known=*/ true); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3720 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3721 } else if (receiver->as_CheckCast()) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3722 // Match MethodHandle.selectAlternative idiom |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3723 Phi* phi = receiver->as_CheckCast()->obj()->as_Phi(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3724 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3725 if (phi != NULL && phi->operand_count() == 2) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3726 // Get the two MethodHandle inputs from the Phi. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3727 Value op1 = phi->operand_at(0); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3728 Value op2 = phi->operand_at(1); |
4870
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3729 ObjectType* op1type = op1->type()->as_ObjectType(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3730 ObjectType* op2type = op2->type()->as_ObjectType(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3731 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3732 if (op1type->is_constant() && op2type->is_constant()) { |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3733 ciMethodHandle* mh1 = op1type->constant_value()->as_method_handle(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3734 ciMethodHandle* mh2 = op2type->constant_value()->as_method_handle(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3735 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3736 // Set the callee to have access to the class and signature in |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3737 // the MethodHandleCompiler. |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3738 mh1->set_callee(callee); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3739 mh1->set_caller(method()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3740 mh2->set_callee(callee); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3741 mh2->set_caller(method()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3742 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3743 // Get adapters for the MethodHandles. |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3744 ciMethod* mh1_adapter = mh1->get_method_handle_adapter(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3745 ciMethod* mh2_adapter = mh2->get_method_handle_adapter(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3746 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3747 if (mh1_adapter != NULL && mh2_adapter != NULL) { |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3748 set_inline_cleanup_info(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3749 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3750 // Build the If guard |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3751 BlockBegin* one = new BlockBegin(next_bci()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3752 BlockBegin* two = new BlockBegin(next_bci()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3753 BlockBegin* end = new BlockBegin(next_bci()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3754 Instruction* iff = append(new If(phi, If::eql, false, op1, one, two, NULL, false)); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3755 block()->set_end(iff->as_BlockEnd()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3756 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3757 // Connect up the states |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3758 one->merge(block()->end()->state()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3759 two->merge(block()->end()->state()); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3760 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3761 // Save the state for the second inlinee |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3762 ValueStack* state_before = copy_state_before(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3763 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3764 // Parse first adapter |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3765 _last = _block = one; |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3766 if (!try_inline_full(mh1_adapter, /*holder_known=*/ true, end, NULL)) { |
4870
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3767 restore_inline_cleanup_info(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3768 block()->clear_end(); // remove appended iff |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3769 return false; |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3770 } |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3771 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3772 // Parse second adapter |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3773 _last = _block = two; |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3774 _state = state_before; |
4871
f067b4e0e04b
7090976: Eclipse/CDT causes a JVM crash while indexing C++ code
roland
parents:
4870
diff
changeset
|
3775 if (!try_inline_full(mh2_adapter, /*holder_known=*/ true, end, NULL)) { |
4870
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3776 restore_inline_cleanup_info(); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3777 block()->clear_end(); // remove appended iff |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3778 return false; |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3779 } |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3780 |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3781 connect_to_end(end); |
2f5980b127e3
7132180: JSR 292: C1 JVM crash with ClassValue/MethodHandle
twisti
parents:
4116
diff
changeset
|
3782 return true; |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3783 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3784 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3785 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3786 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3787 return false; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3788 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3789 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3790 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3791 bool GraphBuilder::for_invokedynamic_inline(ciMethod* callee) { |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3792 // Get the MethodHandle from the CallSite. |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3793 ciCallSite* call_site = stream()->get_call_site(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3794 ciMethodHandle* method_handle = call_site->get_target(); |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3795 |
3901
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3796 // Set the callee to have access to the class and signature in the |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3797 // MethodHandleCompiler. |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3798 method_handle->set_callee(callee); |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3799 method_handle->set_caller(method()); |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3800 |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3801 // Get an adapter for the MethodHandle. |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3802 ciMethod* method_handle_adapter = method_handle->get_invokedynamic_adapter(); |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3803 if (method_handle_adapter != NULL) { |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3804 if (try_inline(method_handle_adapter, /*holder_known=*/ true)) { |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3805 // Add a dependence for invalidation of the optimization. |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3806 if (!call_site->is_constant_call_site()) { |
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3807 dependency_recorder()->assert_call_site_target_value(call_site, method_handle); |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3808 } |
3901
aa67216400d3
7085404: JSR 292: VolatileCallSites should have push notification too
twisti
parents:
3900
diff
changeset
|
3809 return true; |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3810 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3811 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3812 return false; |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3813 } |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3814 |
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3897
diff
changeset
|
3815 |
0 | 3816 void GraphBuilder::inline_bailout(const char* msg) { |
3817 assert(msg != NULL, "inline bailout msg must exist"); | |
3818 _inline_bailout_msg = msg; | |
3819 } | |
3820 | |
3821 | |
3822 void GraphBuilder::clear_inline_bailout() { | |
3823 _inline_bailout_msg = NULL; | |
3824 } | |
3825 | |
3826 | |
3827 void GraphBuilder::push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start) { | |
3828 ScopeData* data = new ScopeData(NULL); | |
3829 data->set_scope(scope); | |
3830 data->set_bci2block(bci2block); | |
3831 _scope_data = data; | |
3832 _block = start; | |
3833 } | |
3834 | |
3835 | |
3836 void GraphBuilder::push_scope(ciMethod* callee, BlockBegin* continuation) { | |
3837 IRScope* callee_scope = new IRScope(compilation(), scope(), bci(), callee, -1, false); | |
3838 scope()->add_callee(callee_scope); | |
3839 | |
3840 BlockListBuilder blb(compilation(), callee_scope, -1); | |
3841 CHECK_BAILOUT(); | |
3842 | |
3843 if (!blb.bci2block()->at(0)->is_set(BlockBegin::parser_loop_header_flag)) { | |
3844 // this scope can be inlined directly into the caller so remove | |
3845 // the block at bci 0. | |
3846 blb.bci2block()->at_put(0, NULL); | |
3847 } | |
3848 | |
1819 | 3849 set_state(new ValueStack(callee_scope, state()->copy(ValueStack::CallerState, bci()))); |
0 | 3850 |
3851 ScopeData* data = new ScopeData(scope_data()); | |
3852 data->set_scope(callee_scope); | |
3853 data->set_bci2block(blb.bci2block()); | |
3854 data->set_continuation(continuation); | |
3855 _scope_data = data; | |
3856 } | |
3857 | |
3858 | |
3859 void GraphBuilder::push_scope_for_jsr(BlockBegin* jsr_continuation, int jsr_dest_bci) { | |
3860 ScopeData* data = new ScopeData(scope_data()); | |
3861 data->set_parsing_jsr(); | |
3862 data->set_jsr_entry_bci(jsr_dest_bci); | |
3863 data->set_jsr_return_address_local(-1); | |
3864 // Must clone bci2block list as we will be mutating it in order to | |
3865 // properly clone all blocks in jsr region as well as exception | |
3866 // handlers containing rets | |
3867 BlockList* new_bci2block = new BlockList(bci2block()->length()); | |
3868 new_bci2block->push_all(bci2block()); | |
3869 data->set_bci2block(new_bci2block); | |
3870 data->set_scope(scope()); | |
3871 data->setup_jsr_xhandlers(); | |
3872 data->set_continuation(continuation()); | |
3873 data->set_jsr_continuation(jsr_continuation); | |
3874 _scope_data = data; | |
3875 } | |
3876 | |
3877 | |
3878 void GraphBuilder::pop_scope() { | |
3879 int number_of_locks = scope()->number_of_locks(); | |
3880 _scope_data = scope_data()->parent(); | |
3881 // accumulate minimum number of monitor slots to be reserved | |
3882 scope()->set_min_number_of_locks(number_of_locks); | |
3883 } | |
3884 | |
3885 | |
3886 void GraphBuilder::pop_scope_for_jsr() { | |
3887 _scope_data = scope_data()->parent(); | |
3888 } | |
3889 | |
3890 bool GraphBuilder::append_unsafe_get_obj(ciMethod* callee, BasicType t, bool is_volatile) { | |
3891 if (InlineUnsafeOps) { | |
3892 Values* args = state()->pop_arguments(callee->arg_size()); | |
3893 null_check(args->at(0)); | |
3894 Instruction* offset = args->at(2); | |
3895 #ifndef _LP64 | |
3896 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); | |
3897 #endif | |
3898 Instruction* op = append(new UnsafeGetObject(t, args->at(1), offset, is_volatile)); | |
3899 push(op->type(), op); | |
3900 compilation()->set_has_unsafe_access(true); | |
3901 } | |
3902 return InlineUnsafeOps; | |
3903 } | |
3904 | |
3905 | |
3906 bool GraphBuilder::append_unsafe_put_obj(ciMethod* callee, BasicType t, bool is_volatile) { | |
3907 if (InlineUnsafeOps) { | |
3908 Values* args = state()->pop_arguments(callee->arg_size()); | |
3909 null_check(args->at(0)); | |
3910 Instruction* offset = args->at(2); | |
3911 #ifndef _LP64 | |
3912 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); | |
3913 #endif | |
3914 Instruction* op = append(new UnsafePutObject(t, args->at(1), offset, args->at(3), is_volatile)); | |
3915 compilation()->set_has_unsafe_access(true); | |
3916 kill_all(); | |
3917 } | |
3918 return InlineUnsafeOps; | |
3919 } | |
3920 | |
3921 | |
3922 bool GraphBuilder::append_unsafe_get_raw(ciMethod* callee, BasicType t) { | |
3923 if (InlineUnsafeOps) { | |
3924 Values* args = state()->pop_arguments(callee->arg_size()); | |
3925 null_check(args->at(0)); | |
3926 Instruction* op = append(new UnsafeGetRaw(t, args->at(1), false)); | |
3927 push(op->type(), op); | |
3928 compilation()->set_has_unsafe_access(true); | |
3929 } | |
3930 return InlineUnsafeOps; | |
3931 } | |
3932 | |
3933 | |
3934 bool GraphBuilder::append_unsafe_put_raw(ciMethod* callee, BasicType t) { | |
3935 if (InlineUnsafeOps) { | |
3936 Values* args = state()->pop_arguments(callee->arg_size()); | |
3937 null_check(args->at(0)); | |
3938 Instruction* op = append(new UnsafePutRaw(t, args->at(1), args->at(2))); | |
3939 compilation()->set_has_unsafe_access(true); | |
3940 } | |
3941 return InlineUnsafeOps; | |
3942 } | |
3943 | |
3944 | |
3945 bool GraphBuilder::append_unsafe_prefetch(ciMethod* callee, bool is_static, bool is_store) { | |
3946 if (InlineUnsafeOps) { | |
3947 Values* args = state()->pop_arguments(callee->arg_size()); | |
3948 int obj_arg_index = 1; // Assume non-static case | |
3949 if (is_static) { | |
3950 obj_arg_index = 0; | |
3951 } else { | |
3952 null_check(args->at(0)); | |
3953 } | |
3954 Instruction* offset = args->at(obj_arg_index + 1); | |
3955 #ifndef _LP64 | |
3956 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); | |
3957 #endif | |
3958 Instruction* op = is_store ? append(new UnsafePrefetchWrite(args->at(obj_arg_index), offset)) | |
3959 : append(new UnsafePrefetchRead (args->at(obj_arg_index), offset)); | |
3960 compilation()->set_has_unsafe_access(true); | |
3961 } | |
3962 return InlineUnsafeOps; | |
3963 } | |
3964 | |
3965 | |
3966 void GraphBuilder::append_unsafe_CAS(ciMethod* callee) { | |
1819 | 3967 ValueStack* state_before = copy_state_for_exception(); |
0 | 3968 ValueType* result_type = as_ValueType(callee->return_type()); |
3969 assert(result_type->is_int(), "int result"); | |
3970 Values* args = state()->pop_arguments(callee->arg_size()); | |
3971 | |
3972 // Pop off some args to speically handle, then push back | |
3973 Value newval = args->pop(); | |
3974 Value cmpval = args->pop(); | |
3975 Value offset = args->pop(); | |
3976 Value src = args->pop(); | |
3977 Value unsafe_obj = args->pop(); | |
3978 | |
3979 // Separately handle the unsafe arg. It is not needed for code | |
3980 // generation, but must be null checked | |
3981 null_check(unsafe_obj); | |
3982 | |
3983 #ifndef _LP64 | |
3984 offset = append(new Convert(Bytecodes::_l2i, offset, as_ValueType(T_INT))); | |
3985 #endif | |
3986 | |
3987 args->push(src); | |
3988 args->push(offset); | |
3989 args->push(cmpval); | |
3990 args->push(newval); | |
3991 | |
3992 // An unsafe CAS can alias with other field accesses, but we don't | |
3993 // know which ones so mark the state as no preserved. This will | |
3994 // cause CSE to invalidate memory across it. | |
3995 bool preserves_state = false; | |
1819 | 3996 Intrinsic* result = new Intrinsic(result_type, callee->intrinsic_id(), args, false, state_before, preserves_state); |
0 | 3997 append_split(result); |
3998 push(result_type, result); | |
3999 compilation()->set_has_unsafe_access(true); | |
4000 } | |
4001 | |
4002 | |
4003 #ifndef PRODUCT | |
4004 void GraphBuilder::print_inline_result(ciMethod* callee, bool res) { | |
2405
3d58a4983660
7022998: JSR 292 recursive method handle calls inline themselves infinitely
twisti
parents:
2376
diff
changeset
|
4005 CompileTask::print_inlining(callee, scope()->level(), bci(), _inline_bailout_msg); |
0 | 4006 if (res && CIPrintMethodCodes) { |
4007 callee->print_codes(); | |
4008 } | |
4009 } | |
4010 | |
4011 | |
4012 void GraphBuilder::print_stats() { | |
4013 vmap()->print(); | |
4014 } | |
4015 #endif // PRODUCT | |
4016 | |
4017 void GraphBuilder::profile_call(Value recv, ciKlass* known_holder) { | |
4018 append(new ProfileCall(method(), bci(), recv, known_holder)); | |
4019 } | |
4020 | |
1825 | 4021 void GraphBuilder::profile_invocation(ciMethod* callee, ValueStack* state) { |
4022 append(new ProfileInvoke(callee, state)); | |
0 | 4023 } |