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