Print this page
rev 1025 : imported patch indy.compiler.patch
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/ci/ciTypeFlow.cpp
+++ new/src/share/vm/ci/ciTypeFlow.cpp
1 1 /*
2 2 * Copyright 2000-2009 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 21 * have any questions.
22 22 *
23 23 */
24 24
25 25 #include "incls/_precompiled.incl"
26 26 #include "incls/_ciTypeFlow.cpp.incl"
27 27
28 28 // ciTypeFlow::JsrSet
29 29 //
30 30 // A JsrSet represents some set of JsrRecords. This class
31 31 // is used to record a set of all jsr routines which we permit
32 32 // execution to return (ret) from.
33 33 //
34 34 // During abstract interpretation, JsrSets are used to determine
35 35 // whether two paths which reach a given block are unique, and
36 36 // should be cloned apart, or are compatible, and should merge
37 37 // together.
38 38
39 39 // ------------------------------------------------------------------
40 40 // ciTypeFlow::JsrSet::JsrSet
41 41 ciTypeFlow::JsrSet::JsrSet(Arena* arena, int default_len) {
42 42 if (arena != NULL) {
43 43 // Allocate growable array in Arena.
44 44 _set = new (arena) GrowableArray<JsrRecord*>(arena, default_len, 0, NULL);
45 45 } else {
46 46 // Allocate growable array in current ResourceArea.
47 47 _set = new GrowableArray<JsrRecord*>(4, 0, NULL, false);
48 48 }
49 49 }
50 50
51 51 // ------------------------------------------------------------------
52 52 // ciTypeFlow::JsrSet::copy_into
53 53 void ciTypeFlow::JsrSet::copy_into(JsrSet* jsrs) {
54 54 int len = size();
55 55 jsrs->_set->clear();
56 56 for (int i = 0; i < len; i++) {
57 57 jsrs->_set->append(_set->at(i));
58 58 }
59 59 }
60 60
61 61 // ------------------------------------------------------------------
62 62 // ciTypeFlow::JsrSet::is_compatible_with
63 63 //
64 64 // !!!! MISGIVINGS ABOUT THIS... disregard
65 65 //
66 66 // Is this JsrSet compatible with some other JsrSet?
67 67 //
68 68 // In set-theoretic terms, a JsrSet can be viewed as a partial function
69 69 // from entry addresses to return addresses. Two JsrSets A and B are
70 70 // compatible iff
71 71 //
72 72 // For any x,
73 73 // A(x) defined and B(x) defined implies A(x) == B(x)
74 74 //
75 75 // Less formally, two JsrSets are compatible when they have identical
76 76 // return addresses for any entry addresses they share in common.
77 77 bool ciTypeFlow::JsrSet::is_compatible_with(JsrSet* other) {
78 78 // Walk through both sets in parallel. If the same entry address
79 79 // appears in both sets, then the return address must match for
80 80 // the sets to be compatible.
81 81 int size1 = size();
82 82 int size2 = other->size();
83 83
84 84 // Special case. If nothing is on the jsr stack, then there can
85 85 // be no ret.
86 86 if (size2 == 0) {
87 87 return true;
88 88 } else if (size1 != size2) {
89 89 return false;
90 90 } else {
91 91 for (int i = 0; i < size1; i++) {
92 92 JsrRecord* record1 = record_at(i);
93 93 JsrRecord* record2 = other->record_at(i);
94 94 if (record1->entry_address() != record2->entry_address() ||
95 95 record1->return_address() != record2->return_address()) {
96 96 return false;
97 97 }
98 98 }
99 99 return true;
100 100 }
101 101
102 102 #if 0
103 103 int pos1 = 0;
104 104 int pos2 = 0;
105 105 int size1 = size();
106 106 int size2 = other->size();
107 107 while (pos1 < size1 && pos2 < size2) {
108 108 JsrRecord* record1 = record_at(pos1);
109 109 JsrRecord* record2 = other->record_at(pos2);
110 110 int entry1 = record1->entry_address();
111 111 int entry2 = record2->entry_address();
112 112 if (entry1 < entry2) {
113 113 pos1++;
114 114 } else if (entry1 > entry2) {
115 115 pos2++;
116 116 } else {
117 117 if (record1->return_address() == record2->return_address()) {
118 118 pos1++;
119 119 pos2++;
120 120 } else {
121 121 // These two JsrSets are incompatible.
122 122 return false;
123 123 }
124 124 }
125 125 }
126 126 // The two JsrSets agree.
127 127 return true;
128 128 #endif
129 129 }
130 130
131 131 // ------------------------------------------------------------------
132 132 // ciTypeFlow::JsrSet::insert_jsr_record
133 133 //
134 134 // Insert the given JsrRecord into the JsrSet, maintaining the order
135 135 // of the set and replacing any element with the same entry address.
136 136 void ciTypeFlow::JsrSet::insert_jsr_record(JsrRecord* record) {
137 137 int len = size();
138 138 int entry = record->entry_address();
139 139 int pos = 0;
140 140 for ( ; pos < len; pos++) {
141 141 JsrRecord* current = record_at(pos);
142 142 if (entry == current->entry_address()) {
143 143 // Stomp over this entry.
144 144 _set->at_put(pos, record);
145 145 assert(size() == len, "must be same size");
146 146 return;
147 147 } else if (entry < current->entry_address()) {
148 148 break;
149 149 }
150 150 }
151 151
152 152 // Insert the record into the list.
153 153 JsrRecord* swap = record;
154 154 JsrRecord* temp = NULL;
155 155 for ( ; pos < len; pos++) {
156 156 temp = _set->at(pos);
157 157 _set->at_put(pos, swap);
158 158 swap = temp;
159 159 }
160 160 _set->append(swap);
161 161 assert(size() == len+1, "must be larger");
162 162 }
163 163
164 164 // ------------------------------------------------------------------
165 165 // ciTypeFlow::JsrSet::remove_jsr_record
166 166 //
167 167 // Remove the JsrRecord with the given return address from the JsrSet.
168 168 void ciTypeFlow::JsrSet::remove_jsr_record(int return_address) {
169 169 int len = size();
170 170 for (int i = 0; i < len; i++) {
171 171 if (record_at(i)->return_address() == return_address) {
172 172 // We have found the proper entry. Remove it from the
173 173 // JsrSet and exit.
174 174 for (int j = i+1; j < len ; j++) {
175 175 _set->at_put(j-1, _set->at(j));
176 176 }
177 177 _set->trunc_to(len-1);
178 178 assert(size() == len-1, "must be smaller");
179 179 return;
180 180 }
181 181 }
182 182 assert(false, "verify: returning from invalid subroutine");
183 183 }
184 184
185 185 // ------------------------------------------------------------------
186 186 // ciTypeFlow::JsrSet::apply_control
187 187 //
188 188 // Apply the effect of a control-flow bytecode on the JsrSet. The
189 189 // only bytecodes that modify the JsrSet are jsr and ret.
190 190 void ciTypeFlow::JsrSet::apply_control(ciTypeFlow* analyzer,
191 191 ciBytecodeStream* str,
192 192 ciTypeFlow::StateVector* state) {
193 193 Bytecodes::Code code = str->cur_bc();
194 194 if (code == Bytecodes::_jsr) {
195 195 JsrRecord* record =
196 196 analyzer->make_jsr_record(str->get_dest(), str->next_bci());
197 197 insert_jsr_record(record);
198 198 } else if (code == Bytecodes::_jsr_w) {
199 199 JsrRecord* record =
200 200 analyzer->make_jsr_record(str->get_far_dest(), str->next_bci());
201 201 insert_jsr_record(record);
202 202 } else if (code == Bytecodes::_ret) {
203 203 Cell local = state->local(str->get_index());
204 204 ciType* return_address = state->type_at(local);
205 205 assert(return_address->is_return_address(), "verify: wrong type");
206 206 if (size() == 0) {
207 207 // Ret-state underflow: Hit a ret w/o any previous jsrs. Bail out.
208 208 // This can happen when a loop is inside a finally clause (4614060).
209 209 analyzer->record_failure("OSR in finally clause");
210 210 return;
211 211 }
212 212 remove_jsr_record(return_address->as_return_address()->bci());
213 213 }
214 214 }
215 215
216 216 #ifndef PRODUCT
217 217 // ------------------------------------------------------------------
218 218 // ciTypeFlow::JsrSet::print_on
219 219 void ciTypeFlow::JsrSet::print_on(outputStream* st) const {
220 220 st->print("{ ");
221 221 int num_elements = size();
222 222 if (num_elements > 0) {
223 223 int i = 0;
224 224 for( ; i < num_elements - 1; i++) {
225 225 _set->at(i)->print_on(st);
226 226 st->print(", ");
227 227 }
228 228 _set->at(i)->print_on(st);
229 229 st->print(" ");
230 230 }
231 231 st->print("}");
232 232 }
233 233 #endif
234 234
235 235 // ciTypeFlow::StateVector
236 236 //
237 237 // A StateVector summarizes the type information at some point in
238 238 // the program.
239 239
240 240 // ------------------------------------------------------------------
241 241 // ciTypeFlow::StateVector::type_meet
242 242 //
243 243 // Meet two types.
244 244 //
245 245 // The semi-lattice of types use by this analysis are modeled on those
246 246 // of the verifier. The lattice is as follows:
247 247 //
248 248 // top_type() >= all non-extremal types >= bottom_type
249 249 // and
250 250 // Every primitive type is comparable only with itself. The meet of
251 251 // reference types is determined by their kind: instance class,
252 252 // interface, or array class. The meet of two types of the same
253 253 // kind is their least common ancestor. The meet of two types of
254 254 // different kinds is always java.lang.Object.
255 255 ciType* ciTypeFlow::StateVector::type_meet_internal(ciType* t1, ciType* t2, ciTypeFlow* analyzer) {
256 256 assert(t1 != t2, "checked in caller");
257 257 if (t1->equals(top_type())) {
258 258 return t2;
259 259 } else if (t2->equals(top_type())) {
260 260 return t1;
261 261 } else if (t1->is_primitive_type() || t2->is_primitive_type()) {
262 262 // Special case null_type. null_type meet any reference type T
263 263 // is T. null_type meet null_type is null_type.
264 264 if (t1->equals(null_type())) {
265 265 if (!t2->is_primitive_type() || t2->equals(null_type())) {
266 266 return t2;
267 267 }
268 268 } else if (t2->equals(null_type())) {
269 269 if (!t1->is_primitive_type()) {
270 270 return t1;
271 271 }
272 272 }
273 273
274 274 // At least one of the two types is a non-top primitive type.
275 275 // The other type is not equal to it. Fall to bottom.
276 276 return bottom_type();
277 277 } else {
278 278 // Both types are non-top non-primitive types. That is,
279 279 // both types are either instanceKlasses or arrayKlasses.
280 280 ciKlass* object_klass = analyzer->env()->Object_klass();
281 281 ciKlass* k1 = t1->as_klass();
282 282 ciKlass* k2 = t2->as_klass();
283 283 if (k1->equals(object_klass) || k2->equals(object_klass)) {
284 284 return object_klass;
285 285 } else if (!k1->is_loaded() || !k2->is_loaded()) {
286 286 // Unloaded classes fall to java.lang.Object at a merge.
287 287 return object_klass;
288 288 } else if (k1->is_interface() != k2->is_interface()) {
289 289 // When an interface meets a non-interface, we get Object;
290 290 // This is what the verifier does.
291 291 return object_klass;
292 292 } else if (k1->is_array_klass() || k2->is_array_klass()) {
293 293 // When an array meets a non-array, we get Object.
294 294 // When objArray meets typeArray, we also get Object.
295 295 // And when typeArray meets different typeArray, we again get Object.
296 296 // But when objArray meets objArray, we look carefully at element types.
297 297 if (k1->is_obj_array_klass() && k2->is_obj_array_klass()) {
298 298 // Meet the element types, then construct the corresponding array type.
299 299 ciKlass* elem1 = k1->as_obj_array_klass()->element_klass();
300 300 ciKlass* elem2 = k2->as_obj_array_klass()->element_klass();
301 301 ciKlass* elem = type_meet_internal(elem1, elem2, analyzer)->as_klass();
302 302 // Do an easy shortcut if one type is a super of the other.
303 303 if (elem == elem1) {
304 304 assert(k1 == ciObjArrayKlass::make(elem), "shortcut is OK");
305 305 return k1;
306 306 } else if (elem == elem2) {
307 307 assert(k2 == ciObjArrayKlass::make(elem), "shortcut is OK");
308 308 return k2;
309 309 } else {
310 310 return ciObjArrayKlass::make(elem);
311 311 }
312 312 } else {
313 313 return object_klass;
314 314 }
315 315 } else {
316 316 // Must be two plain old instance klasses.
317 317 assert(k1->is_instance_klass(), "previous cases handle non-instances");
318 318 assert(k2->is_instance_klass(), "previous cases handle non-instances");
319 319 return k1->least_common_ancestor(k2);
320 320 }
321 321 }
322 322 }
323 323
324 324
325 325 // ------------------------------------------------------------------
326 326 // ciTypeFlow::StateVector::StateVector
327 327 //
328 328 // Build a new state vector
329 329 ciTypeFlow::StateVector::StateVector(ciTypeFlow* analyzer) {
330 330 _outer = analyzer;
331 331 _stack_size = -1;
332 332 _monitor_count = -1;
333 333 // Allocate the _types array
334 334 int max_cells = analyzer->max_cells();
335 335 _types = (ciType**)analyzer->arena()->Amalloc(sizeof(ciType*) * max_cells);
336 336 for (int i=0; i<max_cells; i++) {
337 337 _types[i] = top_type();
338 338 }
339 339 _trap_bci = -1;
340 340 _trap_index = 0;
341 341 _def_locals.clear();
342 342 }
343 343
344 344
345 345 // ------------------------------------------------------------------
346 346 // ciTypeFlow::get_start_state
347 347 //
348 348 // Set this vector to the method entry state.
349 349 const ciTypeFlow::StateVector* ciTypeFlow::get_start_state() {
350 350 StateVector* state = new StateVector(this);
351 351 if (is_osr_flow()) {
352 352 ciTypeFlow* non_osr_flow = method()->get_flow_analysis();
353 353 if (non_osr_flow->failing()) {
354 354 record_failure(non_osr_flow->failure_reason());
355 355 return NULL;
356 356 }
357 357 JsrSet* jsrs = new JsrSet(NULL, 16);
358 358 Block* non_osr_block = non_osr_flow->existing_block_at(start_bci(), jsrs);
359 359 if (non_osr_block == NULL) {
360 360 record_failure("cannot reach OSR point");
361 361 return NULL;
362 362 }
363 363 // load up the non-OSR state at this point
364 364 non_osr_block->copy_state_into(state);
365 365 int non_osr_start = non_osr_block->start();
366 366 if (non_osr_start != start_bci()) {
367 367 // must flow forward from it
368 368 if (CITraceTypeFlow) {
369 369 tty->print_cr(">> Interpreting pre-OSR block %d:", non_osr_start);
370 370 }
371 371 Block* block = block_at(non_osr_start, jsrs);
372 372 assert(block->limit() == start_bci(), "must flow forward to start");
373 373 flow_block(block, state, jsrs);
374 374 }
375 375 return state;
376 376 // Note: The code below would be an incorrect for an OSR flow,
377 377 // even if it were possible for an OSR entry point to be at bci zero.
378 378 }
379 379 // "Push" the method signature into the first few locals.
380 380 state->set_stack_size(-max_locals());
381 381 if (!method()->is_static()) {
382 382 state->push(method()->holder());
383 383 assert(state->tos() == state->local(0), "");
384 384 }
385 385 for (ciSignatureStream str(method()->signature());
386 386 !str.at_return_type();
387 387 str.next()) {
388 388 state->push_translate(str.type());
389 389 }
390 390 // Set the rest of the locals to bottom.
391 391 Cell cell = state->next_cell(state->tos());
392 392 state->set_stack_size(0);
393 393 int limit = state->limit_cell();
394 394 for (; cell < limit; cell = state->next_cell(cell)) {
395 395 state->set_type_at(cell, state->bottom_type());
396 396 }
397 397 // Lock an object, if necessary.
398 398 state->set_monitor_count(method()->is_synchronized() ? 1 : 0);
399 399 return state;
400 400 }
401 401
402 402 // ------------------------------------------------------------------
403 403 // ciTypeFlow::StateVector::copy_into
404 404 //
405 405 // Copy our value into some other StateVector
406 406 void ciTypeFlow::StateVector::copy_into(ciTypeFlow::StateVector* copy)
407 407 const {
408 408 copy->set_stack_size(stack_size());
409 409 copy->set_monitor_count(monitor_count());
410 410 Cell limit = limit_cell();
411 411 for (Cell c = start_cell(); c < limit; c = next_cell(c)) {
412 412 copy->set_type_at(c, type_at(c));
413 413 }
414 414 }
415 415
416 416 // ------------------------------------------------------------------
417 417 // ciTypeFlow::StateVector::meet
418 418 //
419 419 // Meets this StateVector with another, destructively modifying this
420 420 // one. Returns true if any modification takes place.
421 421 bool ciTypeFlow::StateVector::meet(const ciTypeFlow::StateVector* incoming) {
422 422 if (monitor_count() == -1) {
423 423 set_monitor_count(incoming->monitor_count());
424 424 }
425 425 assert(monitor_count() == incoming->monitor_count(), "monitors must match");
426 426
427 427 if (stack_size() == -1) {
428 428 set_stack_size(incoming->stack_size());
429 429 Cell limit = limit_cell();
430 430 #ifdef ASSERT
431 431 { for (Cell c = start_cell(); c < limit; c = next_cell(c)) {
432 432 assert(type_at(c) == top_type(), "");
433 433 } }
434 434 #endif
435 435 // Make a simple copy of the incoming state.
436 436 for (Cell c = start_cell(); c < limit; c = next_cell(c)) {
437 437 set_type_at(c, incoming->type_at(c));
438 438 }
439 439 return true; // it is always different the first time
440 440 }
441 441 #ifdef ASSERT
442 442 if (stack_size() != incoming->stack_size()) {
443 443 _outer->method()->print_codes();
444 444 tty->print_cr("!!!! Stack size conflict");
445 445 tty->print_cr("Current state:");
446 446 print_on(tty);
447 447 tty->print_cr("Incoming state:");
448 448 ((StateVector*)incoming)->print_on(tty);
449 449 }
450 450 #endif
451 451 assert(stack_size() == incoming->stack_size(), "sanity");
452 452
453 453 bool different = false;
454 454 Cell limit = limit_cell();
455 455 for (Cell c = start_cell(); c < limit; c = next_cell(c)) {
456 456 ciType* t1 = type_at(c);
457 457 ciType* t2 = incoming->type_at(c);
458 458 if (!t1->equals(t2)) {
459 459 ciType* new_type = type_meet(t1, t2);
460 460 if (!t1->equals(new_type)) {
461 461 set_type_at(c, new_type);
462 462 different = true;
463 463 }
464 464 }
465 465 }
466 466 return different;
467 467 }
468 468
469 469 // ------------------------------------------------------------------
470 470 // ciTypeFlow::StateVector::meet_exception
471 471 //
472 472 // Meets this StateVector with another, destructively modifying this
473 473 // one. The incoming state is coming via an exception. Returns true
474 474 // if any modification takes place.
475 475 bool ciTypeFlow::StateVector::meet_exception(ciInstanceKlass* exc,
476 476 const ciTypeFlow::StateVector* incoming) {
477 477 if (monitor_count() == -1) {
478 478 set_monitor_count(incoming->monitor_count());
479 479 }
480 480 assert(monitor_count() == incoming->monitor_count(), "monitors must match");
481 481
482 482 if (stack_size() == -1) {
483 483 set_stack_size(1);
484 484 }
485 485
486 486 assert(stack_size() == 1, "must have one-element stack");
487 487
488 488 bool different = false;
489 489
490 490 // Meet locals from incoming array.
491 491 Cell limit = local(_outer->max_locals()-1);
492 492 for (Cell c = start_cell(); c <= limit; c = next_cell(c)) {
493 493 ciType* t1 = type_at(c);
494 494 ciType* t2 = incoming->type_at(c);
495 495 if (!t1->equals(t2)) {
496 496 ciType* new_type = type_meet(t1, t2);
497 497 if (!t1->equals(new_type)) {
498 498 set_type_at(c, new_type);
499 499 different = true;
500 500 }
501 501 }
502 502 }
503 503
504 504 // Handle stack separately. When an exception occurs, the
505 505 // only stack entry is the exception instance.
506 506 ciType* tos_type = type_at_tos();
507 507 if (!tos_type->equals(exc)) {
508 508 ciType* new_type = type_meet(tos_type, exc);
509 509 if (!tos_type->equals(new_type)) {
510 510 set_type_at_tos(new_type);
511 511 different = true;
512 512 }
513 513 }
514 514
515 515 return different;
516 516 }
517 517
518 518 // ------------------------------------------------------------------
519 519 // ciTypeFlow::StateVector::push_translate
520 520 void ciTypeFlow::StateVector::push_translate(ciType* type) {
521 521 BasicType basic_type = type->basic_type();
522 522 if (basic_type == T_BOOLEAN || basic_type == T_CHAR ||
523 523 basic_type == T_BYTE || basic_type == T_SHORT) {
524 524 push_int();
525 525 } else {
526 526 push(type);
527 527 if (type->is_two_word()) {
528 528 push(half_type(type));
529 529 }
530 530 }
531 531 }
532 532
533 533 // ------------------------------------------------------------------
534 534 // ciTypeFlow::StateVector::do_aaload
535 535 void ciTypeFlow::StateVector::do_aaload(ciBytecodeStream* str) {
536 536 pop_int();
537 537 ciObjArrayKlass* array_klass = pop_objArray();
538 538 if (array_klass == NULL) {
539 539 // Did aaload on a null reference; push a null and ignore the exception.
540 540 // This instruction will never continue normally. All we have to do
541 541 // is report a value that will meet correctly with any downstream
542 542 // reference types on paths that will truly be executed. This null type
543 543 // meets with any reference type to yield that same reference type.
544 544 // (The compiler will generate an unconditional exception here.)
545 545 push(null_type());
546 546 return;
547 547 }
548 548 if (!array_klass->is_loaded()) {
549 549 // Only fails for some -Xcomp runs
550 550 trap(str, array_klass,
551 551 Deoptimization::make_trap_request
552 552 (Deoptimization::Reason_unloaded,
553 553 Deoptimization::Action_reinterpret));
554 554 return;
555 555 }
556 556 ciKlass* element_klass = array_klass->element_klass();
557 557 if (!element_klass->is_loaded() && element_klass->is_instance_klass()) {
558 558 Untested("unloaded array element class in ciTypeFlow");
559 559 trap(str, element_klass,
560 560 Deoptimization::make_trap_request
561 561 (Deoptimization::Reason_unloaded,
562 562 Deoptimization::Action_reinterpret));
563 563 } else {
564 564 push_object(element_klass);
565 565 }
566 566 }
567 567
568 568
569 569 // ------------------------------------------------------------------
570 570 // ciTypeFlow::StateVector::do_checkcast
571 571 void ciTypeFlow::StateVector::do_checkcast(ciBytecodeStream* str) {
572 572 bool will_link;
573 573 ciKlass* klass = str->get_klass(will_link);
574 574 if (!will_link) {
575 575 // VM's interpreter will not load 'klass' if object is NULL.
576 576 // Type flow after this block may still be needed in two situations:
577 577 // 1) C2 uses do_null_assert() and continues compilation for later blocks
578 578 // 2) C2 does an OSR compile in a later block (see bug 4778368).
579 579 pop_object();
580 580 do_null_assert(klass);
581 581 } else {
582 582 pop_object();
583 583 push_object(klass);
584 584 }
585 585 }
586 586
587 587 // ------------------------------------------------------------------
588 588 // ciTypeFlow::StateVector::do_getfield
589 589 void ciTypeFlow::StateVector::do_getfield(ciBytecodeStream* str) {
590 590 // could add assert here for type of object.
591 591 pop_object();
592 592 do_getstatic(str);
593 593 }
594 594
595 595 // ------------------------------------------------------------------
596 596 // ciTypeFlow::StateVector::do_getstatic
597 597 void ciTypeFlow::StateVector::do_getstatic(ciBytecodeStream* str) {
598 598 bool will_link;
599 599 ciField* field = str->get_field(will_link);
600 600 if (!will_link) {
601 601 trap(str, field->holder(), str->get_field_holder_index());
602 602 } else {
603 603 ciType* field_type = field->type();
604 604 if (!field_type->is_loaded()) {
605 605 // Normally, we need the field's type to be loaded if we are to
606 606 // do anything interesting with its value.
607 607 // We used to do this: trap(str, str->get_field_signature_index());
608 608 //
609 609 // There is one good reason not to trap here. Execution can
610 610 // get past this "getfield" or "getstatic" if the value of
611 611 // the field is null. As long as the value is null, the class
612 612 // does not need to be loaded! The compiler must assume that
613 613 // the value of the unloaded class reference is null; if the code
614 614 // ever sees a non-null value, loading has occurred.
615 615 //
616 616 // This actually happens often enough to be annoying. If the
617 617 // compiler throws an uncommon trap at this bytecode, you can
618 618 // get an endless loop of recompilations, when all the code
619 619 // needs to do is load a series of null values. Also, a trap
620 620 // here can make an OSR entry point unreachable, triggering the
621 621 // assert on non_osr_block in ciTypeFlow::get_start_state.
622 622 // (See bug 4379915.)
623 623 do_null_assert(field_type->as_klass());
624 624 } else {
625 625 push_translate(field_type);
626 626 }
627 627 }
|
↓ open down ↓ |
627 lines elided |
↑ open up ↑ |
628 628 }
629 629
630 630 // ------------------------------------------------------------------
631 631 // ciTypeFlow::StateVector::do_invoke
632 632 void ciTypeFlow::StateVector::do_invoke(ciBytecodeStream* str,
633 633 bool has_receiver) {
634 634 bool will_link;
635 635 ciMethod* method = str->get_method(will_link);
636 636 if (!will_link) {
637 637 // We weren't able to find the method.
638 - ciKlass* unloaded_holder = method->holder();
639 - trap(str, unloaded_holder, str->get_method_holder_index());
638 + if (str->cur_bc() == Bytecodes::_invokedynamic) {
639 + trap(str, NULL,
640 + Deoptimization::make_trap_request
641 + (Deoptimization::Reason_uninitialized,
642 + Deoptimization::Action_reinterpret));
643 + } else {
644 + ciKlass* unloaded_holder = method->holder();
645 + trap(str, unloaded_holder, str->get_method_holder_index());
646 + }
640 647 } else {
641 648 ciSignature* signature = method->signature();
642 649 ciSignatureStream sigstr(signature);
643 650 int arg_size = signature->size();
644 651 int stack_base = stack_size() - arg_size;
645 652 int i = 0;
646 653 for( ; !sigstr.at_return_type(); sigstr.next()) {
647 654 ciType* type = sigstr.type();
648 655 ciType* stack_type = type_at(stack(stack_base + i++));
649 656 // Do I want to check this type?
650 657 // assert(stack_type->is_subtype_of(type), "bad type for field value");
651 658 if (type->is_two_word()) {
652 659 ciType* stack_type2 = type_at(stack(stack_base + i++));
653 660 assert(stack_type2->equals(half_type(type)), "must be 2nd half");
654 661 }
655 662 }
656 663 assert(arg_size == i, "must match");
657 664 for (int j = 0; j < arg_size; j++) {
658 665 pop();
659 666 }
660 667 if (has_receiver) {
661 668 // Check this?
662 669 pop_object();
663 670 }
664 671 assert(!sigstr.is_done(), "must have return type");
665 672 ciType* return_type = sigstr.type();
666 673 if (!return_type->is_void()) {
667 674 if (!return_type->is_loaded()) {
668 675 // As in do_getstatic(), generally speaking, we need the return type to
669 676 // be loaded if we are to do anything interesting with its value.
670 677 // We used to do this: trap(str, str->get_method_signature_index());
671 678 //
672 679 // We do not trap here since execution can get past this invoke if
673 680 // the return value is null. As long as the value is null, the class
674 681 // does not need to be loaded! The compiler must assume that
675 682 // the value of the unloaded class reference is null; if the code
676 683 // ever sees a non-null value, loading has occurred.
677 684 //
678 685 // See do_getstatic() for similar explanation, as well as bug 4684993.
679 686 do_null_assert(return_type->as_klass());
680 687 } else {
681 688 push_translate(return_type);
682 689 }
683 690 }
684 691 }
685 692 }
686 693
687 694 // ------------------------------------------------------------------
688 695 // ciTypeFlow::StateVector::do_jsr
689 696 void ciTypeFlow::StateVector::do_jsr(ciBytecodeStream* str) {
690 697 push(ciReturnAddress::make(str->next_bci()));
691 698 }
692 699
693 700 // ------------------------------------------------------------------
694 701 // ciTypeFlow::StateVector::do_ldc
695 702 void ciTypeFlow::StateVector::do_ldc(ciBytecodeStream* str) {
696 703 ciConstant con = str->get_constant();
697 704 BasicType basic_type = con.basic_type();
698 705 if (basic_type == T_ILLEGAL) {
699 706 // OutOfMemoryError in the CI while loading constant
700 707 push_null();
701 708 outer()->record_failure("ldc did not link");
702 709 return;
703 710 }
704 711 if (basic_type == T_OBJECT || basic_type == T_ARRAY) {
705 712 ciObject* obj = con.as_object();
706 713 if (obj->is_null_object()) {
707 714 push_null();
708 715 } else if (obj->is_klass()) {
709 716 // The type of ldc <class> is java.lang.Class
710 717 push_object(outer()->env()->Class_klass());
711 718 } else {
712 719 push_object(obj->klass());
713 720 }
714 721 } else {
715 722 push_translate(ciType::make(basic_type));
716 723 }
717 724 }
718 725
719 726 // ------------------------------------------------------------------
720 727 // ciTypeFlow::StateVector::do_multianewarray
721 728 void ciTypeFlow::StateVector::do_multianewarray(ciBytecodeStream* str) {
722 729 int dimensions = str->get_dimensions();
723 730 bool will_link;
724 731 ciArrayKlass* array_klass = str->get_klass(will_link)->as_array_klass();
725 732 if (!will_link) {
726 733 trap(str, array_klass, str->get_klass_index());
727 734 } else {
728 735 for (int i = 0; i < dimensions; i++) {
729 736 pop_int();
730 737 }
731 738 push_object(array_klass);
732 739 }
733 740 }
734 741
735 742 // ------------------------------------------------------------------
736 743 // ciTypeFlow::StateVector::do_new
737 744 void ciTypeFlow::StateVector::do_new(ciBytecodeStream* str) {
738 745 bool will_link;
739 746 ciKlass* klass = str->get_klass(will_link);
740 747 if (!will_link || str->is_unresolved_klass()) {
741 748 trap(str, klass, str->get_klass_index());
742 749 } else {
743 750 push_object(klass);
744 751 }
745 752 }
746 753
747 754 // ------------------------------------------------------------------
748 755 // ciTypeFlow::StateVector::do_newarray
749 756 void ciTypeFlow::StateVector::do_newarray(ciBytecodeStream* str) {
750 757 pop_int();
751 758 ciKlass* klass = ciTypeArrayKlass::make((BasicType)str->get_index());
752 759 push_object(klass);
753 760 }
754 761
755 762 // ------------------------------------------------------------------
756 763 // ciTypeFlow::StateVector::do_putfield
757 764 void ciTypeFlow::StateVector::do_putfield(ciBytecodeStream* str) {
758 765 do_putstatic(str);
759 766 if (_trap_bci != -1) return; // unloaded field holder, etc.
760 767 // could add assert here for type of object.
761 768 pop_object();
762 769 }
763 770
764 771 // ------------------------------------------------------------------
765 772 // ciTypeFlow::StateVector::do_putstatic
766 773 void ciTypeFlow::StateVector::do_putstatic(ciBytecodeStream* str) {
767 774 bool will_link;
768 775 ciField* field = str->get_field(will_link);
769 776 if (!will_link) {
770 777 trap(str, field->holder(), str->get_field_holder_index());
771 778 } else {
772 779 ciType* field_type = field->type();
773 780 ciType* type = pop_value();
774 781 // Do I want to check this type?
775 782 // assert(type->is_subtype_of(field_type), "bad type for field value");
776 783 if (field_type->is_two_word()) {
777 784 ciType* type2 = pop_value();
778 785 assert(type2->is_two_word(), "must be 2nd half");
779 786 assert(type == half_type(type2), "must be 2nd half");
780 787 }
781 788 }
782 789 }
783 790
784 791 // ------------------------------------------------------------------
785 792 // ciTypeFlow::StateVector::do_ret
786 793 void ciTypeFlow::StateVector::do_ret(ciBytecodeStream* str) {
787 794 Cell index = local(str->get_index());
788 795
789 796 ciType* address = type_at(index);
790 797 assert(address->is_return_address(), "bad return address");
791 798 set_type_at(index, bottom_type());
792 799 }
793 800
794 801 // ------------------------------------------------------------------
795 802 // ciTypeFlow::StateVector::trap
796 803 //
797 804 // Stop interpretation of this path with a trap.
798 805 void ciTypeFlow::StateVector::trap(ciBytecodeStream* str, ciKlass* klass, int index) {
799 806 _trap_bci = str->cur_bci();
800 807 _trap_index = index;
801 808
802 809 // Log information about this trap:
803 810 CompileLog* log = outer()->env()->log();
804 811 if (log != NULL) {
805 812 int mid = log->identify(outer()->method());
806 813 int kid = (klass == NULL)? -1: log->identify(klass);
807 814 log->begin_elem("uncommon_trap method='%d' bci='%d'", mid, str->cur_bci());
808 815 char buf[100];
809 816 log->print(" %s", Deoptimization::format_trap_request(buf, sizeof(buf),
810 817 index));
811 818 if (kid >= 0)
812 819 log->print(" klass='%d'", kid);
813 820 log->end_elem();
814 821 }
815 822 }
816 823
817 824 // ------------------------------------------------------------------
818 825 // ciTypeFlow::StateVector::do_null_assert
819 826 // Corresponds to graphKit::do_null_assert.
820 827 void ciTypeFlow::StateVector::do_null_assert(ciKlass* unloaded_klass) {
821 828 if (unloaded_klass->is_loaded()) {
822 829 // We failed to link, but we can still compute with this class,
823 830 // since it is loaded somewhere. The compiler will uncommon_trap
824 831 // if the object is not null, but the typeflow pass can not assume
825 832 // that the object will be null, otherwise it may incorrectly tell
826 833 // the parser that an object is known to be null. 4761344, 4807707
827 834 push_object(unloaded_klass);
828 835 } else {
829 836 // The class is not loaded anywhere. It is safe to model the
830 837 // null in the typestates, because we can compile in a null check
831 838 // which will deoptimize us if someone manages to load the
832 839 // class later.
833 840 push_null();
834 841 }
835 842 }
836 843
837 844
838 845 // ------------------------------------------------------------------
839 846 // ciTypeFlow::StateVector::apply_one_bytecode
840 847 //
841 848 // Apply the effect of one bytecode to this StateVector
842 849 bool ciTypeFlow::StateVector::apply_one_bytecode(ciBytecodeStream* str) {
843 850 _trap_bci = -1;
844 851 _trap_index = 0;
845 852
846 853 if (CITraceTypeFlow) {
847 854 tty->print_cr(">> Interpreting bytecode %d:%s", str->cur_bci(),
848 855 Bytecodes::name(str->cur_bc()));
849 856 }
850 857
851 858 switch(str->cur_bc()) {
852 859 case Bytecodes::_aaload: do_aaload(str); break;
853 860
854 861 case Bytecodes::_aastore:
855 862 {
856 863 pop_object();
857 864 pop_int();
858 865 pop_objArray();
859 866 break;
860 867 }
861 868 case Bytecodes::_aconst_null:
862 869 {
863 870 push_null();
864 871 break;
865 872 }
866 873 case Bytecodes::_aload: load_local_object(str->get_index()); break;
867 874 case Bytecodes::_aload_0: load_local_object(0); break;
868 875 case Bytecodes::_aload_1: load_local_object(1); break;
869 876 case Bytecodes::_aload_2: load_local_object(2); break;
870 877 case Bytecodes::_aload_3: load_local_object(3); break;
871 878
872 879 case Bytecodes::_anewarray:
873 880 {
874 881 pop_int();
875 882 bool will_link;
876 883 ciKlass* element_klass = str->get_klass(will_link);
877 884 if (!will_link) {
878 885 trap(str, element_klass, str->get_klass_index());
879 886 } else {
880 887 push_object(ciObjArrayKlass::make(element_klass));
881 888 }
882 889 break;
883 890 }
884 891 case Bytecodes::_areturn:
885 892 case Bytecodes::_ifnonnull:
886 893 case Bytecodes::_ifnull:
887 894 {
888 895 pop_object();
889 896 break;
890 897 }
891 898 case Bytecodes::_monitorenter:
892 899 {
893 900 pop_object();
894 901 set_monitor_count(monitor_count() + 1);
895 902 break;
896 903 }
897 904 case Bytecodes::_monitorexit:
898 905 {
899 906 pop_object();
900 907 assert(monitor_count() > 0, "must be a monitor to exit from");
901 908 set_monitor_count(monitor_count() - 1);
902 909 break;
903 910 }
904 911 case Bytecodes::_arraylength:
905 912 {
906 913 pop_array();
907 914 push_int();
908 915 break;
909 916 }
910 917 case Bytecodes::_astore: store_local_object(str->get_index()); break;
911 918 case Bytecodes::_astore_0: store_local_object(0); break;
912 919 case Bytecodes::_astore_1: store_local_object(1); break;
913 920 case Bytecodes::_astore_2: store_local_object(2); break;
914 921 case Bytecodes::_astore_3: store_local_object(3); break;
915 922
916 923 case Bytecodes::_athrow:
917 924 {
918 925 NEEDS_CLEANUP;
919 926 pop_object();
920 927 break;
921 928 }
922 929 case Bytecodes::_baload:
923 930 case Bytecodes::_caload:
924 931 case Bytecodes::_iaload:
925 932 case Bytecodes::_saload:
926 933 {
927 934 pop_int();
928 935 ciTypeArrayKlass* array_klass = pop_typeArray();
929 936 // Put assert here for right type?
930 937 push_int();
931 938 break;
932 939 }
933 940 case Bytecodes::_bastore:
934 941 case Bytecodes::_castore:
935 942 case Bytecodes::_iastore:
936 943 case Bytecodes::_sastore:
937 944 {
938 945 pop_int();
939 946 pop_int();
940 947 pop_typeArray();
941 948 // assert here?
942 949 break;
943 950 }
944 951 case Bytecodes::_bipush:
945 952 case Bytecodes::_iconst_m1:
946 953 case Bytecodes::_iconst_0:
947 954 case Bytecodes::_iconst_1:
948 955 case Bytecodes::_iconst_2:
949 956 case Bytecodes::_iconst_3:
950 957 case Bytecodes::_iconst_4:
951 958 case Bytecodes::_iconst_5:
952 959 case Bytecodes::_sipush:
953 960 {
954 961 push_int();
955 962 break;
956 963 }
957 964 case Bytecodes::_checkcast: do_checkcast(str); break;
958 965
959 966 case Bytecodes::_d2f:
960 967 {
961 968 pop_double();
962 969 push_float();
963 970 break;
964 971 }
965 972 case Bytecodes::_d2i:
966 973 {
967 974 pop_double();
968 975 push_int();
969 976 break;
970 977 }
971 978 case Bytecodes::_d2l:
972 979 {
973 980 pop_double();
974 981 push_long();
975 982 break;
976 983 }
977 984 case Bytecodes::_dadd:
978 985 case Bytecodes::_ddiv:
979 986 case Bytecodes::_dmul:
980 987 case Bytecodes::_drem:
981 988 case Bytecodes::_dsub:
982 989 {
983 990 pop_double();
984 991 pop_double();
985 992 push_double();
986 993 break;
987 994 }
988 995 case Bytecodes::_daload:
989 996 {
990 997 pop_int();
991 998 ciTypeArrayKlass* array_klass = pop_typeArray();
992 999 // Put assert here for right type?
993 1000 push_double();
994 1001 break;
995 1002 }
996 1003 case Bytecodes::_dastore:
997 1004 {
998 1005 pop_double();
999 1006 pop_int();
1000 1007 pop_typeArray();
1001 1008 // assert here?
1002 1009 break;
1003 1010 }
1004 1011 case Bytecodes::_dcmpg:
1005 1012 case Bytecodes::_dcmpl:
1006 1013 {
1007 1014 pop_double();
1008 1015 pop_double();
1009 1016 push_int();
1010 1017 break;
1011 1018 }
1012 1019 case Bytecodes::_dconst_0:
1013 1020 case Bytecodes::_dconst_1:
1014 1021 {
1015 1022 push_double();
1016 1023 break;
1017 1024 }
1018 1025 case Bytecodes::_dload: load_local_double(str->get_index()); break;
1019 1026 case Bytecodes::_dload_0: load_local_double(0); break;
1020 1027 case Bytecodes::_dload_1: load_local_double(1); break;
1021 1028 case Bytecodes::_dload_2: load_local_double(2); break;
1022 1029 case Bytecodes::_dload_3: load_local_double(3); break;
1023 1030
1024 1031 case Bytecodes::_dneg:
1025 1032 {
1026 1033 pop_double();
1027 1034 push_double();
1028 1035 break;
1029 1036 }
1030 1037 case Bytecodes::_dreturn:
1031 1038 {
1032 1039 pop_double();
1033 1040 break;
1034 1041 }
1035 1042 case Bytecodes::_dstore: store_local_double(str->get_index()); break;
1036 1043 case Bytecodes::_dstore_0: store_local_double(0); break;
1037 1044 case Bytecodes::_dstore_1: store_local_double(1); break;
1038 1045 case Bytecodes::_dstore_2: store_local_double(2); break;
1039 1046 case Bytecodes::_dstore_3: store_local_double(3); break;
1040 1047
1041 1048 case Bytecodes::_dup:
1042 1049 {
1043 1050 push(type_at_tos());
1044 1051 break;
1045 1052 }
1046 1053 case Bytecodes::_dup_x1:
1047 1054 {
1048 1055 ciType* value1 = pop_value();
1049 1056 ciType* value2 = pop_value();
1050 1057 push(value1);
1051 1058 push(value2);
1052 1059 push(value1);
1053 1060 break;
1054 1061 }
1055 1062 case Bytecodes::_dup_x2:
1056 1063 {
1057 1064 ciType* value1 = pop_value();
1058 1065 ciType* value2 = pop_value();
1059 1066 ciType* value3 = pop_value();
1060 1067 push(value1);
1061 1068 push(value3);
1062 1069 push(value2);
1063 1070 push(value1);
1064 1071 break;
1065 1072 }
1066 1073 case Bytecodes::_dup2:
1067 1074 {
1068 1075 ciType* value1 = pop_value();
1069 1076 ciType* value2 = pop_value();
1070 1077 push(value2);
1071 1078 push(value1);
1072 1079 push(value2);
1073 1080 push(value1);
1074 1081 break;
1075 1082 }
1076 1083 case Bytecodes::_dup2_x1:
1077 1084 {
1078 1085 ciType* value1 = pop_value();
1079 1086 ciType* value2 = pop_value();
1080 1087 ciType* value3 = pop_value();
1081 1088 push(value2);
1082 1089 push(value1);
1083 1090 push(value3);
1084 1091 push(value2);
1085 1092 push(value1);
1086 1093 break;
1087 1094 }
1088 1095 case Bytecodes::_dup2_x2:
1089 1096 {
1090 1097 ciType* value1 = pop_value();
1091 1098 ciType* value2 = pop_value();
1092 1099 ciType* value3 = pop_value();
1093 1100 ciType* value4 = pop_value();
1094 1101 push(value2);
1095 1102 push(value1);
1096 1103 push(value4);
1097 1104 push(value3);
1098 1105 push(value2);
1099 1106 push(value1);
1100 1107 break;
1101 1108 }
1102 1109 case Bytecodes::_f2d:
1103 1110 {
1104 1111 pop_float();
1105 1112 push_double();
1106 1113 break;
1107 1114 }
1108 1115 case Bytecodes::_f2i:
1109 1116 {
1110 1117 pop_float();
1111 1118 push_int();
1112 1119 break;
1113 1120 }
1114 1121 case Bytecodes::_f2l:
1115 1122 {
1116 1123 pop_float();
1117 1124 push_long();
1118 1125 break;
1119 1126 }
1120 1127 case Bytecodes::_fadd:
1121 1128 case Bytecodes::_fdiv:
1122 1129 case Bytecodes::_fmul:
1123 1130 case Bytecodes::_frem:
1124 1131 case Bytecodes::_fsub:
1125 1132 {
1126 1133 pop_float();
1127 1134 pop_float();
1128 1135 push_float();
1129 1136 break;
1130 1137 }
1131 1138 case Bytecodes::_faload:
1132 1139 {
1133 1140 pop_int();
1134 1141 ciTypeArrayKlass* array_klass = pop_typeArray();
1135 1142 // Put assert here.
1136 1143 push_float();
1137 1144 break;
1138 1145 }
1139 1146 case Bytecodes::_fastore:
1140 1147 {
1141 1148 pop_float();
1142 1149 pop_int();
1143 1150 ciTypeArrayKlass* array_klass = pop_typeArray();
1144 1151 // Put assert here.
1145 1152 break;
1146 1153 }
1147 1154 case Bytecodes::_fcmpg:
1148 1155 case Bytecodes::_fcmpl:
1149 1156 {
1150 1157 pop_float();
1151 1158 pop_float();
1152 1159 push_int();
1153 1160 break;
1154 1161 }
1155 1162 case Bytecodes::_fconst_0:
1156 1163 case Bytecodes::_fconst_1:
1157 1164 case Bytecodes::_fconst_2:
1158 1165 {
1159 1166 push_float();
1160 1167 break;
1161 1168 }
1162 1169 case Bytecodes::_fload: load_local_float(str->get_index()); break;
1163 1170 case Bytecodes::_fload_0: load_local_float(0); break;
1164 1171 case Bytecodes::_fload_1: load_local_float(1); break;
1165 1172 case Bytecodes::_fload_2: load_local_float(2); break;
1166 1173 case Bytecodes::_fload_3: load_local_float(3); break;
1167 1174
1168 1175 case Bytecodes::_fneg:
1169 1176 {
1170 1177 pop_float();
1171 1178 push_float();
1172 1179 break;
1173 1180 }
1174 1181 case Bytecodes::_freturn:
1175 1182 {
1176 1183 pop_float();
1177 1184 break;
1178 1185 }
1179 1186 case Bytecodes::_fstore: store_local_float(str->get_index()); break;
1180 1187 case Bytecodes::_fstore_0: store_local_float(0); break;
1181 1188 case Bytecodes::_fstore_1: store_local_float(1); break;
1182 1189 case Bytecodes::_fstore_2: store_local_float(2); break;
1183 1190 case Bytecodes::_fstore_3: store_local_float(3); break;
1184 1191
1185 1192 case Bytecodes::_getfield: do_getfield(str); break;
1186 1193 case Bytecodes::_getstatic: do_getstatic(str); break;
1187 1194
1188 1195 case Bytecodes::_goto:
1189 1196 case Bytecodes::_goto_w:
1190 1197 case Bytecodes::_nop:
1191 1198 case Bytecodes::_return:
1192 1199 {
1193 1200 // do nothing.
1194 1201 break;
1195 1202 }
1196 1203 case Bytecodes::_i2b:
1197 1204 case Bytecodes::_i2c:
1198 1205 case Bytecodes::_i2s:
1199 1206 case Bytecodes::_ineg:
1200 1207 {
1201 1208 pop_int();
1202 1209 push_int();
1203 1210 break;
1204 1211 }
1205 1212 case Bytecodes::_i2d:
1206 1213 {
1207 1214 pop_int();
1208 1215 push_double();
1209 1216 break;
1210 1217 }
1211 1218 case Bytecodes::_i2f:
1212 1219 {
1213 1220 pop_int();
1214 1221 push_float();
1215 1222 break;
1216 1223 }
1217 1224 case Bytecodes::_i2l:
1218 1225 {
1219 1226 pop_int();
1220 1227 push_long();
1221 1228 break;
1222 1229 }
1223 1230 case Bytecodes::_iadd:
1224 1231 case Bytecodes::_iand:
1225 1232 case Bytecodes::_idiv:
1226 1233 case Bytecodes::_imul:
1227 1234 case Bytecodes::_ior:
1228 1235 case Bytecodes::_irem:
1229 1236 case Bytecodes::_ishl:
1230 1237 case Bytecodes::_ishr:
1231 1238 case Bytecodes::_isub:
1232 1239 case Bytecodes::_iushr:
1233 1240 case Bytecodes::_ixor:
1234 1241 {
1235 1242 pop_int();
1236 1243 pop_int();
1237 1244 push_int();
1238 1245 break;
1239 1246 }
1240 1247 case Bytecodes::_if_acmpeq:
1241 1248 case Bytecodes::_if_acmpne:
1242 1249 {
1243 1250 pop_object();
1244 1251 pop_object();
1245 1252 break;
1246 1253 }
1247 1254 case Bytecodes::_if_icmpeq:
1248 1255 case Bytecodes::_if_icmpge:
1249 1256 case Bytecodes::_if_icmpgt:
1250 1257 case Bytecodes::_if_icmple:
1251 1258 case Bytecodes::_if_icmplt:
1252 1259 case Bytecodes::_if_icmpne:
1253 1260 {
1254 1261 pop_int();
1255 1262 pop_int();
1256 1263 break;
1257 1264 }
1258 1265 case Bytecodes::_ifeq:
1259 1266 case Bytecodes::_ifle:
1260 1267 case Bytecodes::_iflt:
1261 1268 case Bytecodes::_ifge:
1262 1269 case Bytecodes::_ifgt:
1263 1270 case Bytecodes::_ifne:
1264 1271 case Bytecodes::_ireturn:
1265 1272 case Bytecodes::_lookupswitch:
1266 1273 case Bytecodes::_tableswitch:
1267 1274 {
1268 1275 pop_int();
1269 1276 break;
1270 1277 }
1271 1278 case Bytecodes::_iinc:
1272 1279 {
1273 1280 int lnum = str->get_index();
1274 1281 check_int(local(lnum));
1275 1282 store_to_local(lnum);
1276 1283 break;
1277 1284 }
1278 1285 case Bytecodes::_iload: load_local_int(str->get_index()); break;
1279 1286 case Bytecodes::_iload_0: load_local_int(0); break;
1280 1287 case Bytecodes::_iload_1: load_local_int(1); break;
1281 1288 case Bytecodes::_iload_2: load_local_int(2); break;
1282 1289 case Bytecodes::_iload_3: load_local_int(3); break;
1283 1290
1284 1291 case Bytecodes::_instanceof:
|
↓ open down ↓ |
635 lines elided |
↑ open up ↑ |
1285 1292 {
1286 1293 // Check for uncommon trap:
1287 1294 do_checkcast(str);
1288 1295 pop_object();
1289 1296 push_int();
1290 1297 break;
1291 1298 }
1292 1299 case Bytecodes::_invokeinterface: do_invoke(str, true); break;
1293 1300 case Bytecodes::_invokespecial: do_invoke(str, true); break;
1294 1301 case Bytecodes::_invokestatic: do_invoke(str, false); break;
1295 -
1296 1302 case Bytecodes::_invokevirtual: do_invoke(str, true); break;
1303 + case Bytecodes::_invokedynamic: do_invoke(str, false); break;
1297 1304
1298 1305 case Bytecodes::_istore: store_local_int(str->get_index()); break;
1299 1306 case Bytecodes::_istore_0: store_local_int(0); break;
1300 1307 case Bytecodes::_istore_1: store_local_int(1); break;
1301 1308 case Bytecodes::_istore_2: store_local_int(2); break;
1302 1309 case Bytecodes::_istore_3: store_local_int(3); break;
1303 1310
1304 1311 case Bytecodes::_jsr:
1305 1312 case Bytecodes::_jsr_w: do_jsr(str); break;
1306 1313
1307 1314 case Bytecodes::_l2d:
1308 1315 {
1309 1316 pop_long();
1310 1317 push_double();
1311 1318 break;
1312 1319 }
1313 1320 case Bytecodes::_l2f:
1314 1321 {
1315 1322 pop_long();
1316 1323 push_float();
1317 1324 break;
1318 1325 }
1319 1326 case Bytecodes::_l2i:
1320 1327 {
1321 1328 pop_long();
1322 1329 push_int();
1323 1330 break;
1324 1331 }
1325 1332 case Bytecodes::_ladd:
1326 1333 case Bytecodes::_land:
1327 1334 case Bytecodes::_ldiv:
1328 1335 case Bytecodes::_lmul:
1329 1336 case Bytecodes::_lor:
1330 1337 case Bytecodes::_lrem:
1331 1338 case Bytecodes::_lsub:
1332 1339 case Bytecodes::_lxor:
1333 1340 {
1334 1341 pop_long();
1335 1342 pop_long();
1336 1343 push_long();
1337 1344 break;
1338 1345 }
1339 1346 case Bytecodes::_laload:
1340 1347 {
1341 1348 pop_int();
1342 1349 ciTypeArrayKlass* array_klass = pop_typeArray();
1343 1350 // Put assert here for right type?
1344 1351 push_long();
1345 1352 break;
1346 1353 }
1347 1354 case Bytecodes::_lastore:
1348 1355 {
1349 1356 pop_long();
1350 1357 pop_int();
1351 1358 pop_typeArray();
1352 1359 // assert here?
1353 1360 break;
1354 1361 }
1355 1362 case Bytecodes::_lcmp:
1356 1363 {
1357 1364 pop_long();
1358 1365 pop_long();
1359 1366 push_int();
1360 1367 break;
1361 1368 }
1362 1369 case Bytecodes::_lconst_0:
1363 1370 case Bytecodes::_lconst_1:
1364 1371 {
1365 1372 push_long();
1366 1373 break;
1367 1374 }
1368 1375 case Bytecodes::_ldc:
1369 1376 case Bytecodes::_ldc_w:
1370 1377 case Bytecodes::_ldc2_w:
1371 1378 {
1372 1379 do_ldc(str);
1373 1380 break;
1374 1381 }
1375 1382
1376 1383 case Bytecodes::_lload: load_local_long(str->get_index()); break;
1377 1384 case Bytecodes::_lload_0: load_local_long(0); break;
1378 1385 case Bytecodes::_lload_1: load_local_long(1); break;
1379 1386 case Bytecodes::_lload_2: load_local_long(2); break;
1380 1387 case Bytecodes::_lload_3: load_local_long(3); break;
1381 1388
1382 1389 case Bytecodes::_lneg:
1383 1390 {
1384 1391 pop_long();
1385 1392 push_long();
1386 1393 break;
1387 1394 }
1388 1395 case Bytecodes::_lreturn:
1389 1396 {
1390 1397 pop_long();
1391 1398 break;
1392 1399 }
1393 1400 case Bytecodes::_lshl:
1394 1401 case Bytecodes::_lshr:
1395 1402 case Bytecodes::_lushr:
1396 1403 {
1397 1404 pop_int();
1398 1405 pop_long();
1399 1406 push_long();
1400 1407 break;
1401 1408 }
1402 1409 case Bytecodes::_lstore: store_local_long(str->get_index()); break;
1403 1410 case Bytecodes::_lstore_0: store_local_long(0); break;
1404 1411 case Bytecodes::_lstore_1: store_local_long(1); break;
1405 1412 case Bytecodes::_lstore_2: store_local_long(2); break;
1406 1413 case Bytecodes::_lstore_3: store_local_long(3); break;
1407 1414
1408 1415 case Bytecodes::_multianewarray: do_multianewarray(str); break;
1409 1416
1410 1417 case Bytecodes::_new: do_new(str); break;
1411 1418
1412 1419 case Bytecodes::_newarray: do_newarray(str); break;
1413 1420
1414 1421 case Bytecodes::_pop:
1415 1422 {
1416 1423 pop();
1417 1424 break;
1418 1425 }
1419 1426 case Bytecodes::_pop2:
1420 1427 {
1421 1428 pop();
1422 1429 pop();
1423 1430 break;
1424 1431 }
1425 1432
1426 1433 case Bytecodes::_putfield: do_putfield(str); break;
1427 1434 case Bytecodes::_putstatic: do_putstatic(str); break;
1428 1435
1429 1436 case Bytecodes::_ret: do_ret(str); break;
1430 1437
1431 1438 case Bytecodes::_swap:
1432 1439 {
1433 1440 ciType* value1 = pop_value();
1434 1441 ciType* value2 = pop_value();
1435 1442 push(value1);
1436 1443 push(value2);
1437 1444 break;
1438 1445 }
1439 1446 case Bytecodes::_wide:
1440 1447 default:
1441 1448 {
1442 1449 // The iterator should skip this.
1443 1450 ShouldNotReachHere();
1444 1451 break;
1445 1452 }
1446 1453 }
1447 1454
1448 1455 if (CITraceTypeFlow) {
1449 1456 print_on(tty);
1450 1457 }
1451 1458
1452 1459 return (_trap_bci != -1);
1453 1460 }
1454 1461
1455 1462 #ifndef PRODUCT
1456 1463 // ------------------------------------------------------------------
1457 1464 // ciTypeFlow::StateVector::print_cell_on
1458 1465 void ciTypeFlow::StateVector::print_cell_on(outputStream* st, Cell c) const {
1459 1466 ciType* type = type_at(c);
1460 1467 if (type == top_type()) {
1461 1468 st->print("top");
1462 1469 } else if (type == bottom_type()) {
1463 1470 st->print("bottom");
1464 1471 } else if (type == null_type()) {
1465 1472 st->print("null");
1466 1473 } else if (type == long2_type()) {
1467 1474 st->print("long2");
1468 1475 } else if (type == double2_type()) {
1469 1476 st->print("double2");
1470 1477 } else if (is_int(type)) {
1471 1478 st->print("int");
1472 1479 } else if (is_long(type)) {
1473 1480 st->print("long");
1474 1481 } else if (is_float(type)) {
1475 1482 st->print("float");
1476 1483 } else if (is_double(type)) {
1477 1484 st->print("double");
1478 1485 } else if (type->is_return_address()) {
1479 1486 st->print("address(%d)", type->as_return_address()->bci());
1480 1487 } else {
1481 1488 if (type->is_klass()) {
1482 1489 type->as_klass()->name()->print_symbol_on(st);
1483 1490 } else {
1484 1491 st->print("UNEXPECTED TYPE");
1485 1492 type->print();
1486 1493 }
1487 1494 }
1488 1495 }
1489 1496
1490 1497 // ------------------------------------------------------------------
1491 1498 // ciTypeFlow::StateVector::print_on
1492 1499 void ciTypeFlow::StateVector::print_on(outputStream* st) const {
1493 1500 int num_locals = _outer->max_locals();
1494 1501 int num_stack = stack_size();
1495 1502 int num_monitors = monitor_count();
1496 1503 st->print_cr(" State : locals %d, stack %d, monitors %d", num_locals, num_stack, num_monitors);
1497 1504 if (num_stack >= 0) {
1498 1505 int i;
1499 1506 for (i = 0; i < num_locals; i++) {
1500 1507 st->print(" local %2d : ", i);
1501 1508 print_cell_on(st, local(i));
1502 1509 st->cr();
1503 1510 }
1504 1511 for (i = 0; i < num_stack; i++) {
1505 1512 st->print(" stack %2d : ", i);
1506 1513 print_cell_on(st, stack(i));
1507 1514 st->cr();
1508 1515 }
1509 1516 }
1510 1517 }
1511 1518 #endif
1512 1519
1513 1520
1514 1521 // ------------------------------------------------------------------
1515 1522 // ciTypeFlow::SuccIter::next
1516 1523 //
1517 1524 void ciTypeFlow::SuccIter::next() {
1518 1525 int succ_ct = _pred->successors()->length();
1519 1526 int next = _index + 1;
1520 1527 if (next < succ_ct) {
1521 1528 _index = next;
1522 1529 _succ = _pred->successors()->at(next);
1523 1530 return;
1524 1531 }
1525 1532 for (int i = next - succ_ct; i < _pred->exceptions()->length(); i++) {
1526 1533 // Do not compile any code for unloaded exception types.
1527 1534 // Following compiler passes are responsible for doing this also.
1528 1535 ciInstanceKlass* exception_klass = _pred->exc_klasses()->at(i);
1529 1536 if (exception_klass->is_loaded()) {
1530 1537 _index = next;
1531 1538 _succ = _pred->exceptions()->at(i);
1532 1539 return;
1533 1540 }
1534 1541 next++;
1535 1542 }
1536 1543 _index = -1;
1537 1544 _succ = NULL;
1538 1545 }
1539 1546
1540 1547 // ------------------------------------------------------------------
1541 1548 // ciTypeFlow::SuccIter::set_succ
1542 1549 //
1543 1550 void ciTypeFlow::SuccIter::set_succ(Block* succ) {
1544 1551 int succ_ct = _pred->successors()->length();
1545 1552 if (_index < succ_ct) {
1546 1553 _pred->successors()->at_put(_index, succ);
1547 1554 } else {
1548 1555 int idx = _index - succ_ct;
1549 1556 _pred->exceptions()->at_put(idx, succ);
1550 1557 }
1551 1558 }
1552 1559
1553 1560 // ciTypeFlow::Block
1554 1561 //
1555 1562 // A basic block.
1556 1563
1557 1564 // ------------------------------------------------------------------
1558 1565 // ciTypeFlow::Block::Block
1559 1566 ciTypeFlow::Block::Block(ciTypeFlow* outer,
1560 1567 ciBlock *ciblk,
1561 1568 ciTypeFlow::JsrSet* jsrs) {
1562 1569 _ciblock = ciblk;
1563 1570 _exceptions = NULL;
1564 1571 _exc_klasses = NULL;
1565 1572 _successors = NULL;
1566 1573 _state = new (outer->arena()) StateVector(outer);
1567 1574 JsrSet* new_jsrs =
1568 1575 new (outer->arena()) JsrSet(outer->arena(), jsrs->size());
1569 1576 jsrs->copy_into(new_jsrs);
1570 1577 _jsrs = new_jsrs;
1571 1578 _next = NULL;
1572 1579 _on_work_list = false;
1573 1580 _backedge_copy = false;
1574 1581 _exception_entry = false;
1575 1582 _trap_bci = -1;
1576 1583 _trap_index = 0;
1577 1584 df_init();
1578 1585
1579 1586 if (CITraceTypeFlow) {
1580 1587 tty->print_cr(">> Created new block");
1581 1588 print_on(tty);
1582 1589 }
1583 1590
1584 1591 assert(this->outer() == outer, "outer link set up");
1585 1592 assert(!outer->have_block_count(), "must not have mapped blocks yet");
1586 1593 }
1587 1594
1588 1595 // ------------------------------------------------------------------
1589 1596 // ciTypeFlow::Block::df_init
1590 1597 void ciTypeFlow::Block::df_init() {
1591 1598 _pre_order = -1; assert(!has_pre_order(), "");
1592 1599 _post_order = -1; assert(!has_post_order(), "");
1593 1600 _loop = NULL;
1594 1601 _irreducible_entry = false;
1595 1602 _rpo_next = NULL;
1596 1603 }
1597 1604
1598 1605 // ------------------------------------------------------------------
1599 1606 // ciTypeFlow::Block::successors
1600 1607 //
1601 1608 // Get the successors for this Block.
1602 1609 GrowableArray<ciTypeFlow::Block*>*
1603 1610 ciTypeFlow::Block::successors(ciBytecodeStream* str,
1604 1611 ciTypeFlow::StateVector* state,
1605 1612 ciTypeFlow::JsrSet* jsrs) {
1606 1613 if (_successors == NULL) {
1607 1614 if (CITraceTypeFlow) {
1608 1615 tty->print(">> Computing successors for block ");
1609 1616 print_value_on(tty);
1610 1617 tty->cr();
1611 1618 }
1612 1619
1613 1620 ciTypeFlow* analyzer = outer();
1614 1621 Arena* arena = analyzer->arena();
1615 1622 Block* block = NULL;
1616 1623 bool has_successor = !has_trap() &&
1617 1624 (control() != ciBlock::fall_through_bci || limit() < analyzer->code_size());
1618 1625 if (!has_successor) {
1619 1626 _successors =
1620 1627 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1621 1628 // No successors
1622 1629 } else if (control() == ciBlock::fall_through_bci) {
1623 1630 assert(str->cur_bci() == limit(), "bad block end");
1624 1631 // This block simply falls through to the next.
1625 1632 _successors =
1626 1633 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1627 1634
1628 1635 Block* block = analyzer->block_at(limit(), _jsrs);
1629 1636 assert(_successors->length() == FALL_THROUGH, "");
1630 1637 _successors->append(block);
1631 1638 } else {
1632 1639 int current_bci = str->cur_bci();
1633 1640 int next_bci = str->next_bci();
1634 1641 int branch_bci = -1;
1635 1642 Block* target = NULL;
1636 1643 assert(str->next_bci() == limit(), "bad block end");
1637 1644 // This block is not a simple fall-though. Interpret
1638 1645 // the current bytecode to find our successors.
1639 1646 switch (str->cur_bc()) {
1640 1647 case Bytecodes::_ifeq: case Bytecodes::_ifne:
1641 1648 case Bytecodes::_iflt: case Bytecodes::_ifge:
1642 1649 case Bytecodes::_ifgt: case Bytecodes::_ifle:
1643 1650 case Bytecodes::_if_icmpeq: case Bytecodes::_if_icmpne:
1644 1651 case Bytecodes::_if_icmplt: case Bytecodes::_if_icmpge:
1645 1652 case Bytecodes::_if_icmpgt: case Bytecodes::_if_icmple:
1646 1653 case Bytecodes::_if_acmpeq: case Bytecodes::_if_acmpne:
1647 1654 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull:
1648 1655 // Our successors are the branch target and the next bci.
1649 1656 branch_bci = str->get_dest();
1650 1657 _successors =
1651 1658 new (arena) GrowableArray<Block*>(arena, 2, 0, NULL);
1652 1659 assert(_successors->length() == IF_NOT_TAKEN, "");
1653 1660 _successors->append(analyzer->block_at(next_bci, jsrs));
1654 1661 assert(_successors->length() == IF_TAKEN, "");
1655 1662 _successors->append(analyzer->block_at(branch_bci, jsrs));
1656 1663 break;
1657 1664
1658 1665 case Bytecodes::_goto:
1659 1666 branch_bci = str->get_dest();
1660 1667 _successors =
1661 1668 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1662 1669 assert(_successors->length() == GOTO_TARGET, "");
1663 1670 _successors->append(analyzer->block_at(branch_bci, jsrs));
1664 1671 break;
1665 1672
1666 1673 case Bytecodes::_jsr:
1667 1674 branch_bci = str->get_dest();
1668 1675 _successors =
1669 1676 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1670 1677 assert(_successors->length() == GOTO_TARGET, "");
1671 1678 _successors->append(analyzer->block_at(branch_bci, jsrs));
1672 1679 break;
1673 1680
1674 1681 case Bytecodes::_goto_w:
1675 1682 case Bytecodes::_jsr_w:
1676 1683 _successors =
1677 1684 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1678 1685 assert(_successors->length() == GOTO_TARGET, "");
1679 1686 _successors->append(analyzer->block_at(str->get_far_dest(), jsrs));
1680 1687 break;
1681 1688
1682 1689 case Bytecodes::_tableswitch: {
1683 1690 Bytecode_tableswitch *tableswitch =
1684 1691 Bytecode_tableswitch_at(str->cur_bcp());
1685 1692
1686 1693 int len = tableswitch->length();
1687 1694 _successors =
1688 1695 new (arena) GrowableArray<Block*>(arena, len+1, 0, NULL);
1689 1696 int bci = current_bci + tableswitch->default_offset();
1690 1697 Block* block = analyzer->block_at(bci, jsrs);
1691 1698 assert(_successors->length() == SWITCH_DEFAULT, "");
1692 1699 _successors->append(block);
1693 1700 while (--len >= 0) {
1694 1701 int bci = current_bci + tableswitch->dest_offset_at(len);
1695 1702 block = analyzer->block_at(bci, jsrs);
1696 1703 assert(_successors->length() >= SWITCH_CASES, "");
1697 1704 _successors->append_if_missing(block);
1698 1705 }
1699 1706 break;
1700 1707 }
1701 1708
1702 1709 case Bytecodes::_lookupswitch: {
1703 1710 Bytecode_lookupswitch *lookupswitch =
1704 1711 Bytecode_lookupswitch_at(str->cur_bcp());
1705 1712
1706 1713 int npairs = lookupswitch->number_of_pairs();
1707 1714 _successors =
1708 1715 new (arena) GrowableArray<Block*>(arena, npairs+1, 0, NULL);
1709 1716 int bci = current_bci + lookupswitch->default_offset();
1710 1717 Block* block = analyzer->block_at(bci, jsrs);
1711 1718 assert(_successors->length() == SWITCH_DEFAULT, "");
1712 1719 _successors->append(block);
1713 1720 while(--npairs >= 0) {
1714 1721 LookupswitchPair *pair = lookupswitch->pair_at(npairs);
1715 1722 int bci = current_bci + pair->offset();
1716 1723 Block* block = analyzer->block_at(bci, jsrs);
1717 1724 assert(_successors->length() >= SWITCH_CASES, "");
1718 1725 _successors->append_if_missing(block);
1719 1726 }
1720 1727 break;
1721 1728 }
1722 1729
1723 1730 case Bytecodes::_athrow: case Bytecodes::_ireturn:
1724 1731 case Bytecodes::_lreturn: case Bytecodes::_freturn:
1725 1732 case Bytecodes::_dreturn: case Bytecodes::_areturn:
1726 1733 case Bytecodes::_return:
1727 1734 _successors =
1728 1735 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1729 1736 // No successors
1730 1737 break;
1731 1738
1732 1739 case Bytecodes::_ret: {
1733 1740 _successors =
1734 1741 new (arena) GrowableArray<Block*>(arena, 1, 0, NULL);
1735 1742
1736 1743 Cell local = state->local(str->get_index());
1737 1744 ciType* return_address = state->type_at(local);
1738 1745 assert(return_address->is_return_address(), "verify: wrong type");
1739 1746 int bci = return_address->as_return_address()->bci();
1740 1747 assert(_successors->length() == GOTO_TARGET, "");
1741 1748 _successors->append(analyzer->block_at(bci, jsrs));
1742 1749 break;
1743 1750 }
1744 1751
1745 1752 case Bytecodes::_wide:
1746 1753 default:
1747 1754 ShouldNotReachHere();
1748 1755 break;
1749 1756 }
1750 1757 }
1751 1758 }
1752 1759 return _successors;
1753 1760 }
1754 1761
1755 1762 // ------------------------------------------------------------------
1756 1763 // ciTypeFlow::Block:compute_exceptions
1757 1764 //
1758 1765 // Compute the exceptional successors and types for this Block.
1759 1766 void ciTypeFlow::Block::compute_exceptions() {
1760 1767 assert(_exceptions == NULL && _exc_klasses == NULL, "repeat");
1761 1768
1762 1769 if (CITraceTypeFlow) {
1763 1770 tty->print(">> Computing exceptions for block ");
1764 1771 print_value_on(tty);
1765 1772 tty->cr();
1766 1773 }
1767 1774
1768 1775 ciTypeFlow* analyzer = outer();
1769 1776 Arena* arena = analyzer->arena();
1770 1777
1771 1778 // Any bci in the block will do.
1772 1779 ciExceptionHandlerStream str(analyzer->method(), start());
1773 1780
1774 1781 // Allocate our growable arrays.
1775 1782 int exc_count = str.count();
1776 1783 _exceptions = new (arena) GrowableArray<Block*>(arena, exc_count, 0, NULL);
1777 1784 _exc_klasses = new (arena) GrowableArray<ciInstanceKlass*>(arena, exc_count,
1778 1785 0, NULL);
1779 1786
1780 1787 for ( ; !str.is_done(); str.next()) {
1781 1788 ciExceptionHandler* handler = str.handler();
1782 1789 int bci = handler->handler_bci();
1783 1790 ciInstanceKlass* klass = NULL;
1784 1791 if (bci == -1) {
1785 1792 // There is no catch all. It is possible to exit the method.
1786 1793 break;
1787 1794 }
1788 1795 if (handler->is_catch_all()) {
1789 1796 klass = analyzer->env()->Throwable_klass();
1790 1797 } else {
1791 1798 klass = handler->catch_klass();
1792 1799 }
1793 1800 _exceptions->append(analyzer->block_at(bci, _jsrs));
1794 1801 _exc_klasses->append(klass);
1795 1802 }
1796 1803 }
1797 1804
1798 1805 // ------------------------------------------------------------------
1799 1806 // ciTypeFlow::Block::set_backedge_copy
1800 1807 // Use this only to make a pre-existing public block into a backedge copy.
1801 1808 void ciTypeFlow::Block::set_backedge_copy(bool z) {
1802 1809 assert(z || (z == is_backedge_copy()), "cannot make a backedge copy public");
1803 1810 _backedge_copy = z;
1804 1811 }
1805 1812
1806 1813 // ------------------------------------------------------------------
1807 1814 // ciTypeFlow::Block::is_clonable_exit
1808 1815 //
1809 1816 // At most 2 normal successors, one of which continues looping,
1810 1817 // and all exceptional successors must exit.
1811 1818 bool ciTypeFlow::Block::is_clonable_exit(ciTypeFlow::Loop* lp) {
1812 1819 int normal_cnt = 0;
1813 1820 int in_loop_cnt = 0;
1814 1821 for (SuccIter iter(this); !iter.done(); iter.next()) {
1815 1822 Block* succ = iter.succ();
1816 1823 if (iter.is_normal_ctrl()) {
1817 1824 if (++normal_cnt > 2) return false;
1818 1825 if (lp->contains(succ->loop())) {
1819 1826 if (++in_loop_cnt > 1) return false;
1820 1827 }
1821 1828 } else {
1822 1829 if (lp->contains(succ->loop())) return false;
1823 1830 }
1824 1831 }
1825 1832 return in_loop_cnt == 1;
1826 1833 }
1827 1834
1828 1835 // ------------------------------------------------------------------
1829 1836 // ciTypeFlow::Block::looping_succ
1830 1837 //
1831 1838 ciTypeFlow::Block* ciTypeFlow::Block::looping_succ(ciTypeFlow::Loop* lp) {
1832 1839 assert(successors()->length() <= 2, "at most 2 normal successors");
1833 1840 for (SuccIter iter(this); !iter.done(); iter.next()) {
1834 1841 Block* succ = iter.succ();
1835 1842 if (lp->contains(succ->loop())) {
1836 1843 return succ;
1837 1844 }
1838 1845 }
1839 1846 return NULL;
1840 1847 }
1841 1848
1842 1849 #ifndef PRODUCT
1843 1850 // ------------------------------------------------------------------
1844 1851 // ciTypeFlow::Block::print_value_on
1845 1852 void ciTypeFlow::Block::print_value_on(outputStream* st) const {
1846 1853 if (has_pre_order()) st->print("#%-2d ", pre_order());
1847 1854 if (has_rpo()) st->print("rpo#%-2d ", rpo());
1848 1855 st->print("[%d - %d)", start(), limit());
1849 1856 if (is_loop_head()) st->print(" lphd");
1850 1857 if (is_irreducible_entry()) st->print(" irred");
1851 1858 if (_jsrs->size() > 0) { st->print("/"); _jsrs->print_on(st); }
1852 1859 if (is_backedge_copy()) st->print("/backedge_copy");
1853 1860 }
1854 1861
1855 1862 // ------------------------------------------------------------------
1856 1863 // ciTypeFlow::Block::print_on
1857 1864 void ciTypeFlow::Block::print_on(outputStream* st) const {
1858 1865 if ((Verbose || WizardMode)) {
1859 1866 outer()->method()->print_codes_on(start(), limit(), st);
1860 1867 }
1861 1868 st->print_cr(" ==================================================== ");
1862 1869 st->print (" ");
1863 1870 print_value_on(st);
1864 1871 st->print(" Stored locals: "); def_locals()->print_on(st, outer()->method()->max_locals()); tty->cr();
1865 1872 if (loop() && loop()->parent() != NULL) {
1866 1873 st->print(" loops:");
1867 1874 Loop* lp = loop();
1868 1875 do {
1869 1876 st->print(" %d<-%d", lp->head()->pre_order(),lp->tail()->pre_order());
1870 1877 if (lp->is_irreducible()) st->print("(ir)");
1871 1878 lp = lp->parent();
1872 1879 } while (lp->parent() != NULL);
1873 1880 }
1874 1881 st->cr();
1875 1882 _state->print_on(st);
1876 1883 if (_successors == NULL) {
1877 1884 st->print_cr(" No successor information");
1878 1885 } else {
1879 1886 int num_successors = _successors->length();
1880 1887 st->print_cr(" Successors : %d", num_successors);
1881 1888 for (int i = 0; i < num_successors; i++) {
1882 1889 Block* successor = _successors->at(i);
1883 1890 st->print(" ");
1884 1891 successor->print_value_on(st);
1885 1892 st->cr();
1886 1893 }
1887 1894 }
1888 1895 if (_exceptions == NULL) {
1889 1896 st->print_cr(" No exception information");
1890 1897 } else {
1891 1898 int num_exceptions = _exceptions->length();
1892 1899 st->print_cr(" Exceptions : %d", num_exceptions);
1893 1900 for (int i = 0; i < num_exceptions; i++) {
1894 1901 Block* exc_succ = _exceptions->at(i);
1895 1902 ciInstanceKlass* exc_klass = _exc_klasses->at(i);
1896 1903 st->print(" ");
1897 1904 exc_succ->print_value_on(st);
1898 1905 st->print(" -- ");
1899 1906 exc_klass->name()->print_symbol_on(st);
1900 1907 st->cr();
1901 1908 }
1902 1909 }
1903 1910 if (has_trap()) {
1904 1911 st->print_cr(" Traps on %d with trap index %d", trap_bci(), trap_index());
1905 1912 }
1906 1913 st->print_cr(" ==================================================== ");
1907 1914 }
1908 1915 #endif
1909 1916
1910 1917 #ifndef PRODUCT
1911 1918 // ------------------------------------------------------------------
1912 1919 // ciTypeFlow::LocalSet::print_on
1913 1920 void ciTypeFlow::LocalSet::print_on(outputStream* st, int limit) const {
1914 1921 st->print("{");
1915 1922 for (int i = 0; i < max; i++) {
1916 1923 if (test(i)) st->print(" %d", i);
1917 1924 }
1918 1925 if (limit > max) {
1919 1926 st->print(" %d..%d ", max, limit);
1920 1927 }
1921 1928 st->print(" }");
1922 1929 }
1923 1930 #endif
1924 1931
1925 1932 // ciTypeFlow
1926 1933 //
1927 1934 // This is a pass over the bytecodes which computes the following:
1928 1935 // basic block structure
1929 1936 // interpreter type-states (a la the verifier)
1930 1937
1931 1938 // ------------------------------------------------------------------
1932 1939 // ciTypeFlow::ciTypeFlow
1933 1940 ciTypeFlow::ciTypeFlow(ciEnv* env, ciMethod* method, int osr_bci) {
1934 1941 _env = env;
1935 1942 _method = method;
1936 1943 _methodBlocks = method->get_method_blocks();
1937 1944 _max_locals = method->max_locals();
1938 1945 _max_stack = method->max_stack();
1939 1946 _code_size = method->code_size();
1940 1947 _has_irreducible_entry = false;
1941 1948 _osr_bci = osr_bci;
1942 1949 _failure_reason = NULL;
1943 1950 assert(start_bci() >= 0 && start_bci() < code_size() , "correct osr_bci argument");
1944 1951 _work_list = NULL;
1945 1952
1946 1953 _ciblock_count = _methodBlocks->num_blocks();
1947 1954 _idx_to_blocklist = NEW_ARENA_ARRAY(arena(), GrowableArray<Block*>*, _ciblock_count);
1948 1955 for (int i = 0; i < _ciblock_count; i++) {
1949 1956 _idx_to_blocklist[i] = NULL;
1950 1957 }
1951 1958 _block_map = NULL; // until all blocks are seen
1952 1959 _jsr_count = 0;
1953 1960 _jsr_records = NULL;
1954 1961 }
1955 1962
1956 1963 // ------------------------------------------------------------------
1957 1964 // ciTypeFlow::work_list_next
1958 1965 //
1959 1966 // Get the next basic block from our work list.
1960 1967 ciTypeFlow::Block* ciTypeFlow::work_list_next() {
1961 1968 assert(!work_list_empty(), "work list must not be empty");
1962 1969 Block* next_block = _work_list;
1963 1970 _work_list = next_block->next();
1964 1971 next_block->set_next(NULL);
1965 1972 next_block->set_on_work_list(false);
1966 1973 return next_block;
1967 1974 }
1968 1975
1969 1976 // ------------------------------------------------------------------
1970 1977 // ciTypeFlow::add_to_work_list
1971 1978 //
1972 1979 // Add a basic block to our work list.
1973 1980 // List is sorted by decreasing postorder sort (same as increasing RPO)
1974 1981 void ciTypeFlow::add_to_work_list(ciTypeFlow::Block* block) {
1975 1982 assert(!block->is_on_work_list(), "must not already be on work list");
1976 1983
1977 1984 if (CITraceTypeFlow) {
1978 1985 tty->print(">> Adding block ");
1979 1986 block->print_value_on(tty);
1980 1987 tty->print_cr(" to the work list : ");
1981 1988 }
1982 1989
1983 1990 block->set_on_work_list(true);
1984 1991
1985 1992 // decreasing post order sort
1986 1993
1987 1994 Block* prev = NULL;
1988 1995 Block* current = _work_list;
1989 1996 int po = block->post_order();
1990 1997 while (current != NULL) {
1991 1998 if (!current->has_post_order() || po > current->post_order())
1992 1999 break;
1993 2000 prev = current;
1994 2001 current = current->next();
1995 2002 }
1996 2003 if (prev == NULL) {
1997 2004 block->set_next(_work_list);
1998 2005 _work_list = block;
1999 2006 } else {
2000 2007 block->set_next(current);
2001 2008 prev->set_next(block);
2002 2009 }
2003 2010
2004 2011 if (CITraceTypeFlow) {
2005 2012 tty->cr();
2006 2013 }
2007 2014 }
2008 2015
2009 2016 // ------------------------------------------------------------------
2010 2017 // ciTypeFlow::block_at
2011 2018 //
2012 2019 // Return the block beginning at bci which has a JsrSet compatible
2013 2020 // with jsrs.
2014 2021 ciTypeFlow::Block* ciTypeFlow::block_at(int bci, ciTypeFlow::JsrSet* jsrs, CreateOption option) {
2015 2022 // First find the right ciBlock.
2016 2023 if (CITraceTypeFlow) {
2017 2024 tty->print(">> Requesting block for %d/", bci);
2018 2025 jsrs->print_on(tty);
2019 2026 tty->cr();
2020 2027 }
2021 2028
2022 2029 ciBlock* ciblk = _methodBlocks->block_containing(bci);
2023 2030 assert(ciblk->start_bci() == bci, "bad ciBlock boundaries");
2024 2031 Block* block = get_block_for(ciblk->index(), jsrs, option);
2025 2032
2026 2033 assert(block == NULL? (option == no_create): block->is_backedge_copy() == (option == create_backedge_copy), "create option consistent with result");
2027 2034
2028 2035 if (CITraceTypeFlow) {
2029 2036 if (block != NULL) {
2030 2037 tty->print(">> Found block ");
2031 2038 block->print_value_on(tty);
2032 2039 tty->cr();
2033 2040 } else {
2034 2041 tty->print_cr(">> No such block.");
2035 2042 }
2036 2043 }
2037 2044
2038 2045 return block;
2039 2046 }
2040 2047
2041 2048 // ------------------------------------------------------------------
2042 2049 // ciTypeFlow::make_jsr_record
2043 2050 //
2044 2051 // Make a JsrRecord for a given (entry, return) pair, if such a record
2045 2052 // does not already exist.
2046 2053 ciTypeFlow::JsrRecord* ciTypeFlow::make_jsr_record(int entry_address,
2047 2054 int return_address) {
2048 2055 if (_jsr_records == NULL) {
2049 2056 _jsr_records = new (arena()) GrowableArray<JsrRecord*>(arena(),
2050 2057 _jsr_count,
2051 2058 0,
2052 2059 NULL);
2053 2060 }
2054 2061 JsrRecord* record = NULL;
2055 2062 int len = _jsr_records->length();
2056 2063 for (int i = 0; i < len; i++) {
2057 2064 JsrRecord* record = _jsr_records->at(i);
2058 2065 if (record->entry_address() == entry_address &&
2059 2066 record->return_address() == return_address) {
2060 2067 return record;
2061 2068 }
2062 2069 }
2063 2070
2064 2071 record = new (arena()) JsrRecord(entry_address, return_address);
2065 2072 _jsr_records->append(record);
2066 2073 return record;
2067 2074 }
2068 2075
2069 2076 // ------------------------------------------------------------------
2070 2077 // ciTypeFlow::flow_exceptions
2071 2078 //
2072 2079 // Merge the current state into all exceptional successors at the
2073 2080 // current point in the code.
2074 2081 void ciTypeFlow::flow_exceptions(GrowableArray<ciTypeFlow::Block*>* exceptions,
2075 2082 GrowableArray<ciInstanceKlass*>* exc_klasses,
2076 2083 ciTypeFlow::StateVector* state) {
2077 2084 int len = exceptions->length();
2078 2085 assert(exc_klasses->length() == len, "must have same length");
2079 2086 for (int i = 0; i < len; i++) {
2080 2087 Block* block = exceptions->at(i);
2081 2088 ciInstanceKlass* exception_klass = exc_klasses->at(i);
2082 2089
2083 2090 if (!exception_klass->is_loaded()) {
2084 2091 // Do not compile any code for unloaded exception types.
2085 2092 // Following compiler passes are responsible for doing this also.
2086 2093 continue;
2087 2094 }
2088 2095
2089 2096 if (block->meet_exception(exception_klass, state)) {
2090 2097 // Block was modified and has PO. Add it to the work list.
2091 2098 if (block->has_post_order() &&
2092 2099 !block->is_on_work_list()) {
2093 2100 add_to_work_list(block);
2094 2101 }
2095 2102 }
2096 2103 }
2097 2104 }
2098 2105
2099 2106 // ------------------------------------------------------------------
2100 2107 // ciTypeFlow::flow_successors
2101 2108 //
2102 2109 // Merge the current state into all successors at the current point
2103 2110 // in the code.
2104 2111 void ciTypeFlow::flow_successors(GrowableArray<ciTypeFlow::Block*>* successors,
2105 2112 ciTypeFlow::StateVector* state) {
2106 2113 int len = successors->length();
2107 2114 for (int i = 0; i < len; i++) {
2108 2115 Block* block = successors->at(i);
2109 2116 if (block->meet(state)) {
2110 2117 // Block was modified and has PO. Add it to the work list.
2111 2118 if (block->has_post_order() &&
2112 2119 !block->is_on_work_list()) {
2113 2120 add_to_work_list(block);
2114 2121 }
2115 2122 }
2116 2123 }
2117 2124 }
2118 2125
2119 2126 // ------------------------------------------------------------------
2120 2127 // ciTypeFlow::can_trap
2121 2128 //
2122 2129 // Tells if a given instruction is able to generate an exception edge.
2123 2130 bool ciTypeFlow::can_trap(ciBytecodeStream& str) {
2124 2131 // Cf. GenerateOopMap::do_exception_edge.
2125 2132 if (!Bytecodes::can_trap(str.cur_bc())) return false;
2126 2133
2127 2134 switch (str.cur_bc()) {
2128 2135 case Bytecodes::_ldc:
2129 2136 case Bytecodes::_ldc_w:
2130 2137 case Bytecodes::_ldc2_w:
2131 2138 case Bytecodes::_aload_0:
2132 2139 // These bytecodes can trap for rewriting. We need to assume that
2133 2140 // they do not throw exceptions to make the monitor analysis work.
2134 2141 return false;
2135 2142
2136 2143 case Bytecodes::_ireturn:
2137 2144 case Bytecodes::_lreturn:
2138 2145 case Bytecodes::_freturn:
2139 2146 case Bytecodes::_dreturn:
2140 2147 case Bytecodes::_areturn:
2141 2148 case Bytecodes::_return:
2142 2149 // We can assume the monitor stack is empty in this analysis.
2143 2150 return false;
2144 2151
2145 2152 case Bytecodes::_monitorexit:
2146 2153 // We can assume monitors are matched in this analysis.
2147 2154 return false;
2148 2155 }
2149 2156
2150 2157 return true;
2151 2158 }
2152 2159
2153 2160 // ------------------------------------------------------------------
2154 2161 // ciTypeFlow::clone_loop_heads
2155 2162 //
2156 2163 // Clone the loop heads
2157 2164 bool ciTypeFlow::clone_loop_heads(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) {
2158 2165 bool rslt = false;
2159 2166 for (PreorderLoops iter(loop_tree_root()); !iter.done(); iter.next()) {
2160 2167 lp = iter.current();
2161 2168 Block* head = lp->head();
2162 2169 if (lp == loop_tree_root() ||
2163 2170 lp->is_irreducible() ||
2164 2171 !head->is_clonable_exit(lp))
2165 2172 continue;
2166 2173
2167 2174 // check not already cloned
2168 2175 if (head->backedge_copy_count() != 0)
2169 2176 continue;
2170 2177
2171 2178 // check _no_ shared head below us
2172 2179 Loop* ch;
2173 2180 for (ch = lp->child(); ch != NULL && ch->head() != head; ch = ch->sibling());
2174 2181 if (ch != NULL)
2175 2182 continue;
2176 2183
2177 2184 // Clone head
2178 2185 Block* new_head = head->looping_succ(lp);
2179 2186 Block* clone = clone_loop_head(lp, temp_vector, temp_set);
2180 2187 // Update lp's info
2181 2188 clone->set_loop(lp);
2182 2189 lp->set_head(new_head);
2183 2190 lp->set_tail(clone);
2184 2191 // And move original head into outer loop
2185 2192 head->set_loop(lp->parent());
2186 2193
2187 2194 rslt = true;
2188 2195 }
2189 2196 return rslt;
2190 2197 }
2191 2198
2192 2199 // ------------------------------------------------------------------
2193 2200 // ciTypeFlow::clone_loop_head
2194 2201 //
2195 2202 // Clone lp's head and replace tail's successors with clone.
2196 2203 //
2197 2204 // |
2198 2205 // v
2199 2206 // head <-> body
2200 2207 // |
2201 2208 // v
2202 2209 // exit
2203 2210 //
2204 2211 // new_head
2205 2212 //
2206 2213 // |
2207 2214 // v
2208 2215 // head ----------\
2209 2216 // | |
2210 2217 // | v
2211 2218 // | clone <-> body
2212 2219 // | |
2213 2220 // | /--/
2214 2221 // | |
2215 2222 // v v
2216 2223 // exit
2217 2224 //
2218 2225 ciTypeFlow::Block* ciTypeFlow::clone_loop_head(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) {
2219 2226 Block* head = lp->head();
2220 2227 Block* tail = lp->tail();
2221 2228 if (CITraceTypeFlow) {
2222 2229 tty->print(">> Requesting clone of loop head "); head->print_value_on(tty);
2223 2230 tty->print(" for predecessor "); tail->print_value_on(tty);
2224 2231 tty->cr();
2225 2232 }
2226 2233 Block* clone = block_at(head->start(), head->jsrs(), create_backedge_copy);
2227 2234 assert(clone->backedge_copy_count() == 1, "one backedge copy for all back edges");
2228 2235
2229 2236 assert(!clone->has_pre_order(), "just created");
2230 2237 clone->set_next_pre_order();
2231 2238
2232 2239 // Insert clone after (orig) tail in reverse post order
2233 2240 clone->set_rpo_next(tail->rpo_next());
2234 2241 tail->set_rpo_next(clone);
2235 2242
2236 2243 // tail->head becomes tail->clone
2237 2244 for (SuccIter iter(tail); !iter.done(); iter.next()) {
2238 2245 if (iter.succ() == head) {
2239 2246 iter.set_succ(clone);
2240 2247 }
2241 2248 }
2242 2249 flow_block(tail, temp_vector, temp_set);
2243 2250 if (head == tail) {
2244 2251 // For self-loops, clone->head becomes clone->clone
2245 2252 flow_block(clone, temp_vector, temp_set);
2246 2253 for (SuccIter iter(clone); !iter.done(); iter.next()) {
2247 2254 if (iter.succ() == head) {
2248 2255 iter.set_succ(clone);
2249 2256 break;
2250 2257 }
2251 2258 }
2252 2259 }
2253 2260 flow_block(clone, temp_vector, temp_set);
2254 2261
2255 2262 return clone;
2256 2263 }
2257 2264
2258 2265 // ------------------------------------------------------------------
2259 2266 // ciTypeFlow::flow_block
2260 2267 //
2261 2268 // Interpret the effects of the bytecodes on the incoming state
2262 2269 // vector of a basic block. Push the changed state to succeeding
2263 2270 // basic blocks.
2264 2271 void ciTypeFlow::flow_block(ciTypeFlow::Block* block,
2265 2272 ciTypeFlow::StateVector* state,
2266 2273 ciTypeFlow::JsrSet* jsrs) {
2267 2274 if (CITraceTypeFlow) {
2268 2275 tty->print("\n>> ANALYZING BLOCK : ");
2269 2276 tty->cr();
2270 2277 block->print_on(tty);
2271 2278 }
2272 2279 assert(block->has_pre_order(), "pre-order is assigned before 1st flow");
2273 2280
2274 2281 int start = block->start();
2275 2282 int limit = block->limit();
2276 2283 int control = block->control();
2277 2284 if (control != ciBlock::fall_through_bci) {
2278 2285 limit = control;
2279 2286 }
2280 2287
2281 2288 // Grab the state from the current block.
2282 2289 block->copy_state_into(state);
2283 2290 state->def_locals()->clear();
2284 2291
2285 2292 GrowableArray<Block*>* exceptions = block->exceptions();
2286 2293 GrowableArray<ciInstanceKlass*>* exc_klasses = block->exc_klasses();
2287 2294 bool has_exceptions = exceptions->length() > 0;
2288 2295
2289 2296 bool exceptions_used = false;
2290 2297
2291 2298 ciBytecodeStream str(method());
2292 2299 str.reset_to_bci(start);
2293 2300 Bytecodes::Code code;
2294 2301 while ((code = str.next()) != ciBytecodeStream::EOBC() &&
2295 2302 str.cur_bci() < limit) {
2296 2303 // Check for exceptional control flow from this point.
2297 2304 if (has_exceptions && can_trap(str)) {
2298 2305 flow_exceptions(exceptions, exc_klasses, state);
2299 2306 exceptions_used = true;
2300 2307 }
2301 2308 // Apply the effects of the current bytecode to our state.
2302 2309 bool res = state->apply_one_bytecode(&str);
2303 2310
2304 2311 // Watch for bailouts.
2305 2312 if (failing()) return;
2306 2313
2307 2314 if (res) {
2308 2315
2309 2316 // We have encountered a trap. Record it in this block.
2310 2317 block->set_trap(state->trap_bci(), state->trap_index());
2311 2318
2312 2319 if (CITraceTypeFlow) {
2313 2320 tty->print_cr(">> Found trap");
2314 2321 block->print_on(tty);
2315 2322 }
2316 2323
2317 2324 // Save set of locals defined in this block
2318 2325 block->def_locals()->add(state->def_locals());
2319 2326
2320 2327 // Record (no) successors.
2321 2328 block->successors(&str, state, jsrs);
2322 2329
2323 2330 assert(!has_exceptions || exceptions_used, "Not removing exceptions");
2324 2331
2325 2332 // Discontinue interpretation of this Block.
2326 2333 return;
2327 2334 }
2328 2335 }
2329 2336
2330 2337 GrowableArray<Block*>* successors = NULL;
2331 2338 if (control != ciBlock::fall_through_bci) {
2332 2339 // Check for exceptional control flow from this point.
2333 2340 if (has_exceptions && can_trap(str)) {
2334 2341 flow_exceptions(exceptions, exc_klasses, state);
2335 2342 exceptions_used = true;
2336 2343 }
2337 2344
2338 2345 // Fix the JsrSet to reflect effect of the bytecode.
2339 2346 block->copy_jsrs_into(jsrs);
2340 2347 jsrs->apply_control(this, &str, state);
2341 2348
2342 2349 // Find successor edges based on old state and new JsrSet.
2343 2350 successors = block->successors(&str, state, jsrs);
2344 2351
2345 2352 // Apply the control changes to the state.
2346 2353 state->apply_one_bytecode(&str);
2347 2354 } else {
2348 2355 // Fall through control
2349 2356 successors = block->successors(&str, NULL, NULL);
2350 2357 }
2351 2358
2352 2359 // Save set of locals defined in this block
2353 2360 block->def_locals()->add(state->def_locals());
2354 2361
2355 2362 // Remove untaken exception paths
2356 2363 if (!exceptions_used)
2357 2364 exceptions->clear();
2358 2365
2359 2366 // Pass our state to successors.
2360 2367 flow_successors(successors, state);
2361 2368 }
2362 2369
2363 2370 // ------------------------------------------------------------------
2364 2371 // ciTypeFlow::PostOrderLoops::next
2365 2372 //
2366 2373 // Advance to next loop tree using a postorder, left-to-right traversal.
2367 2374 void ciTypeFlow::PostorderLoops::next() {
2368 2375 assert(!done(), "must not be done.");
2369 2376 if (_current->sibling() != NULL) {
2370 2377 _current = _current->sibling();
2371 2378 while (_current->child() != NULL) {
2372 2379 _current = _current->child();
2373 2380 }
2374 2381 } else {
2375 2382 _current = _current->parent();
2376 2383 }
2377 2384 }
2378 2385
2379 2386 // ------------------------------------------------------------------
2380 2387 // ciTypeFlow::PreOrderLoops::next
2381 2388 //
2382 2389 // Advance to next loop tree using a preorder, left-to-right traversal.
2383 2390 void ciTypeFlow::PreorderLoops::next() {
2384 2391 assert(!done(), "must not be done.");
2385 2392 if (_current->child() != NULL) {
2386 2393 _current = _current->child();
2387 2394 } else if (_current->sibling() != NULL) {
2388 2395 _current = _current->sibling();
2389 2396 } else {
2390 2397 while (_current != _root && _current->sibling() == NULL) {
2391 2398 _current = _current->parent();
2392 2399 }
2393 2400 if (_current == _root) {
2394 2401 _current = NULL;
2395 2402 assert(done(), "must be done.");
2396 2403 } else {
2397 2404 assert(_current->sibling() != NULL, "must be more to do");
2398 2405 _current = _current->sibling();
2399 2406 }
2400 2407 }
2401 2408 }
2402 2409
2403 2410 // ------------------------------------------------------------------
2404 2411 // ciTypeFlow::Loop::sorted_merge
2405 2412 //
2406 2413 // Merge the branch lp into this branch, sorting on the loop head
2407 2414 // pre_orders. Returns the leaf of the merged branch.
2408 2415 // Child and sibling pointers will be setup later.
2409 2416 // Sort is (looking from leaf towards the root)
2410 2417 // descending on primary key: loop head's pre_order, and
2411 2418 // ascending on secondary key: loop tail's pre_order.
2412 2419 ciTypeFlow::Loop* ciTypeFlow::Loop::sorted_merge(Loop* lp) {
2413 2420 Loop* leaf = this;
2414 2421 Loop* prev = NULL;
2415 2422 Loop* current = leaf;
2416 2423 while (lp != NULL) {
2417 2424 int lp_pre_order = lp->head()->pre_order();
2418 2425 // Find insertion point for "lp"
2419 2426 while (current != NULL) {
2420 2427 if (current == lp)
2421 2428 return leaf; // Already in list
2422 2429 if (current->head()->pre_order() < lp_pre_order)
2423 2430 break;
2424 2431 if (current->head()->pre_order() == lp_pre_order &&
2425 2432 current->tail()->pre_order() > lp->tail()->pre_order()) {
2426 2433 break;
2427 2434 }
2428 2435 prev = current;
2429 2436 current = current->parent();
2430 2437 }
2431 2438 Loop* next_lp = lp->parent(); // Save future list of items to insert
2432 2439 // Insert lp before current
2433 2440 lp->set_parent(current);
2434 2441 if (prev != NULL) {
2435 2442 prev->set_parent(lp);
2436 2443 } else {
2437 2444 leaf = lp;
2438 2445 }
2439 2446 prev = lp; // Inserted item is new prev[ious]
2440 2447 lp = next_lp; // Next item to insert
2441 2448 }
2442 2449 return leaf;
2443 2450 }
2444 2451
2445 2452 // ------------------------------------------------------------------
2446 2453 // ciTypeFlow::build_loop_tree
2447 2454 //
2448 2455 // Incrementally build loop tree.
2449 2456 void ciTypeFlow::build_loop_tree(Block* blk) {
2450 2457 assert(!blk->is_post_visited(), "precondition");
2451 2458 Loop* innermost = NULL; // merge of loop tree branches over all successors
2452 2459
2453 2460 for (SuccIter iter(blk); !iter.done(); iter.next()) {
2454 2461 Loop* lp = NULL;
2455 2462 Block* succ = iter.succ();
2456 2463 if (!succ->is_post_visited()) {
2457 2464 // Found backedge since predecessor post visited, but successor is not
2458 2465 assert(succ->pre_order() <= blk->pre_order(), "should be backedge");
2459 2466
2460 2467 // Create a LoopNode to mark this loop.
2461 2468 lp = new (arena()) Loop(succ, blk);
2462 2469 if (succ->loop() == NULL)
2463 2470 succ->set_loop(lp);
2464 2471 // succ->loop will be updated to innermost loop on a later call, when blk==succ
2465 2472
2466 2473 } else { // Nested loop
2467 2474 lp = succ->loop();
2468 2475
2469 2476 // If succ is loop head, find outer loop.
2470 2477 while (lp != NULL && lp->head() == succ) {
2471 2478 lp = lp->parent();
2472 2479 }
2473 2480 if (lp == NULL) {
2474 2481 // Infinite loop, it's parent is the root
2475 2482 lp = loop_tree_root();
2476 2483 }
2477 2484 }
2478 2485
2479 2486 // Check for irreducible loop.
2480 2487 // Successor has already been visited. If the successor's loop head
2481 2488 // has already been post-visited, then this is another entry into the loop.
2482 2489 while (lp->head()->is_post_visited() && lp != loop_tree_root()) {
2483 2490 _has_irreducible_entry = true;
2484 2491 lp->set_irreducible(succ);
2485 2492 if (!succ->is_on_work_list()) {
2486 2493 // Assume irreducible entries need more data flow
2487 2494 add_to_work_list(succ);
2488 2495 }
2489 2496 Loop* plp = lp->parent();
2490 2497 if (plp == NULL) {
2491 2498 // This only happens for some irreducible cases. The parent
2492 2499 // will be updated during a later pass.
2493 2500 break;
2494 2501 }
2495 2502 lp = plp;
2496 2503 }
2497 2504
2498 2505 // Merge loop tree branch for all successors.
2499 2506 innermost = innermost == NULL ? lp : innermost->sorted_merge(lp);
2500 2507
2501 2508 } // end loop
2502 2509
2503 2510 if (innermost == NULL) {
2504 2511 assert(blk->successors()->length() == 0, "CFG exit");
2505 2512 blk->set_loop(loop_tree_root());
2506 2513 } else if (innermost->head() == blk) {
2507 2514 // If loop header, complete the tree pointers
2508 2515 if (blk->loop() != innermost) {
2509 2516 #if ASSERT
2510 2517 assert(blk->loop()->head() == innermost->head(), "same head");
2511 2518 Loop* dl;
2512 2519 for (dl = innermost; dl != NULL && dl != blk->loop(); dl = dl->parent());
2513 2520 assert(dl == blk->loop(), "blk->loop() already in innermost list");
2514 2521 #endif
2515 2522 blk->set_loop(innermost);
2516 2523 }
2517 2524 innermost->def_locals()->add(blk->def_locals());
2518 2525 Loop* l = innermost;
2519 2526 Loop* p = l->parent();
2520 2527 while (p && l->head() == blk) {
2521 2528 l->set_sibling(p->child()); // Put self on parents 'next child'
2522 2529 p->set_child(l); // Make self the first child of parent
2523 2530 p->def_locals()->add(l->def_locals());
2524 2531 l = p; // Walk up the parent chain
2525 2532 p = l->parent();
2526 2533 }
2527 2534 } else {
2528 2535 blk->set_loop(innermost);
2529 2536 innermost->def_locals()->add(blk->def_locals());
2530 2537 }
2531 2538 }
2532 2539
2533 2540 // ------------------------------------------------------------------
2534 2541 // ciTypeFlow::Loop::contains
2535 2542 //
2536 2543 // Returns true if lp is nested loop.
2537 2544 bool ciTypeFlow::Loop::contains(ciTypeFlow::Loop* lp) const {
2538 2545 assert(lp != NULL, "");
2539 2546 if (this == lp || head() == lp->head()) return true;
2540 2547 int depth1 = depth();
2541 2548 int depth2 = lp->depth();
2542 2549 if (depth1 > depth2)
2543 2550 return false;
2544 2551 while (depth1 < depth2) {
2545 2552 depth2--;
2546 2553 lp = lp->parent();
2547 2554 }
2548 2555 return this == lp;
2549 2556 }
2550 2557
2551 2558 // ------------------------------------------------------------------
2552 2559 // ciTypeFlow::Loop::depth
2553 2560 //
2554 2561 // Loop depth
2555 2562 int ciTypeFlow::Loop::depth() const {
2556 2563 int dp = 0;
2557 2564 for (Loop* lp = this->parent(); lp != NULL; lp = lp->parent())
2558 2565 dp++;
2559 2566 return dp;
2560 2567 }
2561 2568
2562 2569 #ifndef PRODUCT
2563 2570 // ------------------------------------------------------------------
2564 2571 // ciTypeFlow::Loop::print
2565 2572 void ciTypeFlow::Loop::print(outputStream* st, int indent) const {
2566 2573 for (int i = 0; i < indent; i++) st->print(" ");
2567 2574 st->print("%d<-%d %s",
2568 2575 is_root() ? 0 : this->head()->pre_order(),
2569 2576 is_root() ? 0 : this->tail()->pre_order(),
2570 2577 is_irreducible()?" irr":"");
2571 2578 st->print(" defs: ");
2572 2579 def_locals()->print_on(st, _head->outer()->method()->max_locals());
2573 2580 st->cr();
2574 2581 for (Loop* ch = child(); ch != NULL; ch = ch->sibling())
2575 2582 ch->print(st, indent+2);
2576 2583 }
2577 2584 #endif
2578 2585
2579 2586 // ------------------------------------------------------------------
2580 2587 // ciTypeFlow::df_flow_types
2581 2588 //
2582 2589 // Perform the depth first type flow analysis. Helper for flow_types.
2583 2590 void ciTypeFlow::df_flow_types(Block* start,
2584 2591 bool do_flow,
2585 2592 StateVector* temp_vector,
2586 2593 JsrSet* temp_set) {
2587 2594 int dft_len = 100;
2588 2595 GrowableArray<Block*> stk(arena(), dft_len, 0, NULL);
2589 2596
2590 2597 ciBlock* dummy = _methodBlocks->make_dummy_block();
2591 2598 JsrSet* root_set = new JsrSet(NULL, 0);
2592 2599 Block* root_head = new (arena()) Block(this, dummy, root_set);
2593 2600 Block* root_tail = new (arena()) Block(this, dummy, root_set);
2594 2601 root_head->set_pre_order(0);
2595 2602 root_head->set_post_order(0);
2596 2603 root_tail->set_pre_order(max_jint);
2597 2604 root_tail->set_post_order(max_jint);
2598 2605 set_loop_tree_root(new (arena()) Loop(root_head, root_tail));
2599 2606
2600 2607 stk.push(start);
2601 2608
2602 2609 _next_pre_order = 0; // initialize pre_order counter
2603 2610 _rpo_list = NULL;
2604 2611 int next_po = 0; // initialize post_order counter
2605 2612
2606 2613 // Compute RPO and the control flow graph
2607 2614 int size;
2608 2615 while ((size = stk.length()) > 0) {
2609 2616 Block* blk = stk.top(); // Leave node on stack
2610 2617 if (!blk->is_visited()) {
2611 2618 // forward arc in graph
2612 2619 assert (!blk->has_pre_order(), "");
2613 2620 blk->set_next_pre_order();
2614 2621
2615 2622 if (_next_pre_order >= MaxNodeLimit / 2) {
2616 2623 // Too many basic blocks. Bail out.
2617 2624 // This can happen when try/finally constructs are nested to depth N,
2618 2625 // and there is O(2**N) cloning of jsr bodies. See bug 4697245!
2619 2626 // "MaxNodeLimit / 2" is used because probably the parser will
2620 2627 // generate at least twice that many nodes and bail out.
2621 2628 record_failure("too many basic blocks");
2622 2629 return;
2623 2630 }
2624 2631 if (do_flow) {
2625 2632 flow_block(blk, temp_vector, temp_set);
2626 2633 if (failing()) return; // Watch for bailouts.
2627 2634 }
2628 2635 } else if (!blk->is_post_visited()) {
2629 2636 // cross or back arc
2630 2637 for (SuccIter iter(blk); !iter.done(); iter.next()) {
2631 2638 Block* succ = iter.succ();
2632 2639 if (!succ->is_visited()) {
2633 2640 stk.push(succ);
2634 2641 }
2635 2642 }
2636 2643 if (stk.length() == size) {
2637 2644 // There were no additional children, post visit node now
2638 2645 stk.pop(); // Remove node from stack
2639 2646
2640 2647 build_loop_tree(blk);
2641 2648 blk->set_post_order(next_po++); // Assign post order
2642 2649 prepend_to_rpo_list(blk);
2643 2650 assert(blk->is_post_visited(), "");
2644 2651
2645 2652 if (blk->is_loop_head() && !blk->is_on_work_list()) {
2646 2653 // Assume loop heads need more data flow
2647 2654 add_to_work_list(blk);
2648 2655 }
2649 2656 }
2650 2657 } else {
2651 2658 stk.pop(); // Remove post-visited node from stack
2652 2659 }
2653 2660 }
2654 2661 }
2655 2662
2656 2663 // ------------------------------------------------------------------
2657 2664 // ciTypeFlow::flow_types
2658 2665 //
2659 2666 // Perform the type flow analysis, creating and cloning Blocks as
2660 2667 // necessary.
2661 2668 void ciTypeFlow::flow_types() {
2662 2669 ResourceMark rm;
2663 2670 StateVector* temp_vector = new StateVector(this);
2664 2671 JsrSet* temp_set = new JsrSet(NULL, 16);
2665 2672
2666 2673 // Create the method entry block.
2667 2674 Block* start = block_at(start_bci(), temp_set);
2668 2675
2669 2676 // Load the initial state into it.
2670 2677 const StateVector* start_state = get_start_state();
2671 2678 if (failing()) return;
2672 2679 start->meet(start_state);
2673 2680
2674 2681 // Depth first visit
2675 2682 df_flow_types(start, true /*do flow*/, temp_vector, temp_set);
2676 2683
2677 2684 if (failing()) return;
2678 2685 assert(_rpo_list == start, "must be start");
2679 2686
2680 2687 // Any loops found?
2681 2688 if (loop_tree_root()->child() != NULL &&
2682 2689 env()->comp_level() >= CompLevel_full_optimization) {
2683 2690 // Loop optimizations are not performed on Tier1 compiles.
2684 2691
2685 2692 bool changed = clone_loop_heads(loop_tree_root(), temp_vector, temp_set);
2686 2693
2687 2694 // If some loop heads were cloned, recompute postorder and loop tree
2688 2695 if (changed) {
2689 2696 loop_tree_root()->set_child(NULL);
2690 2697 for (Block* blk = _rpo_list; blk != NULL;) {
2691 2698 Block* next = blk->rpo_next();
2692 2699 blk->df_init();
2693 2700 blk = next;
2694 2701 }
2695 2702 df_flow_types(start, false /*no flow*/, temp_vector, temp_set);
2696 2703 }
2697 2704 }
2698 2705
2699 2706 if (CITraceTypeFlow) {
2700 2707 tty->print_cr("\nLoop tree");
2701 2708 loop_tree_root()->print();
2702 2709 }
2703 2710
2704 2711 // Continue flow analysis until fixed point reached
2705 2712
2706 2713 debug_only(int max_block = _next_pre_order;)
2707 2714
2708 2715 while (!work_list_empty()) {
2709 2716 Block* blk = work_list_next();
2710 2717 assert (blk->has_post_order(), "post order assigned above");
2711 2718
2712 2719 flow_block(blk, temp_vector, temp_set);
2713 2720
2714 2721 assert (max_block == _next_pre_order, "no new blocks");
2715 2722 assert (!failing(), "no more bailouts");
2716 2723 }
2717 2724 }
2718 2725
2719 2726 // ------------------------------------------------------------------
2720 2727 // ciTypeFlow::map_blocks
2721 2728 //
2722 2729 // Create the block map, which indexes blocks in reverse post-order.
2723 2730 void ciTypeFlow::map_blocks() {
2724 2731 assert(_block_map == NULL, "single initialization");
2725 2732 int block_ct = _next_pre_order;
2726 2733 _block_map = NEW_ARENA_ARRAY(arena(), Block*, block_ct);
2727 2734 assert(block_ct == block_count(), "");
2728 2735
2729 2736 Block* blk = _rpo_list;
2730 2737 for (int m = 0; m < block_ct; m++) {
2731 2738 int rpo = blk->rpo();
2732 2739 assert(rpo == m, "should be sequential");
2733 2740 _block_map[rpo] = blk;
2734 2741 blk = blk->rpo_next();
2735 2742 }
2736 2743 assert(blk == NULL, "should be done");
2737 2744
2738 2745 for (int j = 0; j < block_ct; j++) {
2739 2746 assert(_block_map[j] != NULL, "must not drop any blocks");
2740 2747 Block* block = _block_map[j];
2741 2748 // Remove dead blocks from successor lists:
2742 2749 for (int e = 0; e <= 1; e++) {
2743 2750 GrowableArray<Block*>* l = e? block->exceptions(): block->successors();
2744 2751 for (int k = 0; k < l->length(); k++) {
2745 2752 Block* s = l->at(k);
2746 2753 if (!s->has_post_order()) {
2747 2754 if (CITraceTypeFlow) {
2748 2755 tty->print("Removing dead %s successor of #%d: ", (e? "exceptional": "normal"), block->pre_order());
2749 2756 s->print_value_on(tty);
2750 2757 tty->cr();
2751 2758 }
2752 2759 l->remove(s);
2753 2760 --k;
2754 2761 }
2755 2762 }
2756 2763 }
2757 2764 }
2758 2765 }
2759 2766
2760 2767 // ------------------------------------------------------------------
2761 2768 // ciTypeFlow::get_block_for
2762 2769 //
2763 2770 // Find a block with this ciBlock which has a compatible JsrSet.
2764 2771 // If no such block exists, create it, unless the option is no_create.
2765 2772 // If the option is create_backedge_copy, always create a fresh backedge copy.
2766 2773 ciTypeFlow::Block* ciTypeFlow::get_block_for(int ciBlockIndex, ciTypeFlow::JsrSet* jsrs, CreateOption option) {
2767 2774 Arena* a = arena();
2768 2775 GrowableArray<Block*>* blocks = _idx_to_blocklist[ciBlockIndex];
2769 2776 if (blocks == NULL) {
2770 2777 // Query only?
2771 2778 if (option == no_create) return NULL;
2772 2779
2773 2780 // Allocate the growable array.
2774 2781 blocks = new (a) GrowableArray<Block*>(a, 4, 0, NULL);
2775 2782 _idx_to_blocklist[ciBlockIndex] = blocks;
2776 2783 }
2777 2784
2778 2785 if (option != create_backedge_copy) {
2779 2786 int len = blocks->length();
2780 2787 for (int i = 0; i < len; i++) {
2781 2788 Block* block = blocks->at(i);
2782 2789 if (!block->is_backedge_copy() && block->is_compatible_with(jsrs)) {
2783 2790 return block;
2784 2791 }
2785 2792 }
2786 2793 }
2787 2794
2788 2795 // Query only?
2789 2796 if (option == no_create) return NULL;
2790 2797
2791 2798 // We did not find a compatible block. Create one.
2792 2799 Block* new_block = new (a) Block(this, _methodBlocks->block(ciBlockIndex), jsrs);
2793 2800 if (option == create_backedge_copy) new_block->set_backedge_copy(true);
2794 2801 blocks->append(new_block);
2795 2802 return new_block;
2796 2803 }
2797 2804
2798 2805 // ------------------------------------------------------------------
2799 2806 // ciTypeFlow::backedge_copy_count
2800 2807 //
2801 2808 int ciTypeFlow::backedge_copy_count(int ciBlockIndex, ciTypeFlow::JsrSet* jsrs) const {
2802 2809 GrowableArray<Block*>* blocks = _idx_to_blocklist[ciBlockIndex];
2803 2810
2804 2811 if (blocks == NULL) {
2805 2812 return 0;
2806 2813 }
2807 2814
2808 2815 int count = 0;
2809 2816 int len = blocks->length();
2810 2817 for (int i = 0; i < len; i++) {
2811 2818 Block* block = blocks->at(i);
2812 2819 if (block->is_backedge_copy() && block->is_compatible_with(jsrs)) {
2813 2820 count++;
2814 2821 }
2815 2822 }
2816 2823
2817 2824 return count;
2818 2825 }
2819 2826
2820 2827 // ------------------------------------------------------------------
2821 2828 // ciTypeFlow::do_flow
2822 2829 //
2823 2830 // Perform type inference flow analysis.
2824 2831 void ciTypeFlow::do_flow() {
2825 2832 if (CITraceTypeFlow) {
2826 2833 tty->print_cr("\nPerforming flow analysis on method");
2827 2834 method()->print();
2828 2835 if (is_osr_flow()) tty->print(" at OSR bci %d", start_bci());
2829 2836 tty->cr();
2830 2837 method()->print_codes();
2831 2838 }
2832 2839 if (CITraceTypeFlow) {
2833 2840 tty->print_cr("Initial CI Blocks");
2834 2841 print_on(tty);
2835 2842 }
2836 2843 flow_types();
2837 2844 // Watch for bailouts.
2838 2845 if (failing()) {
2839 2846 return;
2840 2847 }
2841 2848
2842 2849 map_blocks();
2843 2850
2844 2851 if (CIPrintTypeFlow || CITraceTypeFlow) {
2845 2852 rpo_print_on(tty);
2846 2853 }
2847 2854 }
2848 2855
2849 2856 // ------------------------------------------------------------------
2850 2857 // ciTypeFlow::record_failure()
2851 2858 // The ciTypeFlow object keeps track of failure reasons separately from the ciEnv.
2852 2859 // This is required because there is not a 1-1 relation between the ciEnv and
2853 2860 // the TypeFlow passes within a compilation task. For example, if the compiler
2854 2861 // is considering inlining a method, it will request a TypeFlow. If that fails,
2855 2862 // the compilation as a whole may continue without the inlining. Some TypeFlow
2856 2863 // requests are not optional; if they fail the requestor is responsible for
2857 2864 // copying the failure reason up to the ciEnv. (See Parse::Parse.)
2858 2865 void ciTypeFlow::record_failure(const char* reason) {
2859 2866 if (env()->log() != NULL) {
2860 2867 env()->log()->elem("failure reason='%s' phase='typeflow'", reason);
2861 2868 }
2862 2869 if (_failure_reason == NULL) {
2863 2870 // Record the first failure reason.
2864 2871 _failure_reason = reason;
2865 2872 }
2866 2873 }
2867 2874
2868 2875 #ifndef PRODUCT
2869 2876 // ------------------------------------------------------------------
2870 2877 // ciTypeFlow::print_on
2871 2878 void ciTypeFlow::print_on(outputStream* st) const {
2872 2879 // Walk through CI blocks
2873 2880 st->print_cr("********************************************************");
2874 2881 st->print ("TypeFlow for ");
2875 2882 method()->name()->print_symbol_on(st);
2876 2883 int limit_bci = code_size();
2877 2884 st->print_cr(" %d bytes", limit_bci);
2878 2885 ciMethodBlocks *mblks = _methodBlocks;
2879 2886 ciBlock* current = NULL;
2880 2887 for (int bci = 0; bci < limit_bci; bci++) {
2881 2888 ciBlock* blk = mblks->block_containing(bci);
2882 2889 if (blk != NULL && blk != current) {
2883 2890 current = blk;
2884 2891 current->print_on(st);
2885 2892
2886 2893 GrowableArray<Block*>* blocks = _idx_to_blocklist[blk->index()];
2887 2894 int num_blocks = (blocks == NULL) ? 0 : blocks->length();
2888 2895
2889 2896 if (num_blocks == 0) {
2890 2897 st->print_cr(" No Blocks");
2891 2898 } else {
2892 2899 for (int i = 0; i < num_blocks; i++) {
2893 2900 Block* block = blocks->at(i);
2894 2901 block->print_on(st);
2895 2902 }
2896 2903 }
2897 2904 st->print_cr("--------------------------------------------------------");
2898 2905 st->cr();
2899 2906 }
2900 2907 }
2901 2908 st->print_cr("********************************************************");
2902 2909 st->cr();
2903 2910 }
2904 2911
2905 2912 void ciTypeFlow::rpo_print_on(outputStream* st) const {
2906 2913 st->print_cr("********************************************************");
2907 2914 st->print ("TypeFlow for ");
2908 2915 method()->name()->print_symbol_on(st);
2909 2916 int limit_bci = code_size();
2910 2917 st->print_cr(" %d bytes", limit_bci);
2911 2918 for (Block* blk = _rpo_list; blk != NULL; blk = blk->rpo_next()) {
2912 2919 blk->print_on(st);
2913 2920 st->print_cr("--------------------------------------------------------");
2914 2921 st->cr();
2915 2922 }
2916 2923 st->print_cr("********************************************************");
2917 2924 st->cr();
2918 2925 }
2919 2926 #endif
|
↓ open down ↓ |
1613 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX