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