Thu, 27 May 2010 19:08:38 -0700
6941466: Oracle rebranding changes for Hotspot repositories
Summary: Change all the Sun copyrights to Oracle copyright
Reviewed-by: ohair
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1999, 2010, 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 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_c1_Instruction.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | |
duke@435 | 29 | // Implementation of Instruction |
duke@435 | 30 | |
duke@435 | 31 | |
duke@435 | 32 | int Instruction::_next_id = 0; |
duke@435 | 33 | |
duke@435 | 34 | #ifdef ASSERT |
duke@435 | 35 | void Instruction::create_hi_word() { |
duke@435 | 36 | assert(type()->is_double_word() && _hi_word == NULL, "only double word has high word"); |
duke@435 | 37 | _hi_word = new HiWord(this); |
duke@435 | 38 | } |
duke@435 | 39 | #endif |
duke@435 | 40 | |
duke@435 | 41 | Instruction::Condition Instruction::mirror(Condition cond) { |
duke@435 | 42 | switch (cond) { |
duke@435 | 43 | case eql: return eql; |
duke@435 | 44 | case neq: return neq; |
duke@435 | 45 | case lss: return gtr; |
duke@435 | 46 | case leq: return geq; |
duke@435 | 47 | case gtr: return lss; |
duke@435 | 48 | case geq: return leq; |
duke@435 | 49 | } |
duke@435 | 50 | ShouldNotReachHere(); |
duke@435 | 51 | return eql; |
duke@435 | 52 | } |
duke@435 | 53 | |
duke@435 | 54 | |
duke@435 | 55 | Instruction::Condition Instruction::negate(Condition cond) { |
duke@435 | 56 | switch (cond) { |
duke@435 | 57 | case eql: return neq; |
duke@435 | 58 | case neq: return eql; |
duke@435 | 59 | case lss: return geq; |
duke@435 | 60 | case leq: return gtr; |
duke@435 | 61 | case gtr: return leq; |
duke@435 | 62 | case geq: return lss; |
duke@435 | 63 | } |
duke@435 | 64 | ShouldNotReachHere(); |
duke@435 | 65 | return eql; |
duke@435 | 66 | } |
duke@435 | 67 | |
duke@435 | 68 | |
duke@435 | 69 | Instruction* Instruction::prev(BlockBegin* block) { |
duke@435 | 70 | Instruction* p = NULL; |
duke@435 | 71 | Instruction* q = block; |
duke@435 | 72 | while (q != this) { |
duke@435 | 73 | assert(q != NULL, "this is not in the block's instruction list"); |
duke@435 | 74 | p = q; q = q->next(); |
duke@435 | 75 | } |
duke@435 | 76 | return p; |
duke@435 | 77 | } |
duke@435 | 78 | |
duke@435 | 79 | |
duke@435 | 80 | #ifndef PRODUCT |
duke@435 | 81 | void Instruction::print() { |
duke@435 | 82 | InstructionPrinter ip; |
duke@435 | 83 | print(ip); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | |
duke@435 | 87 | void Instruction::print_line() { |
duke@435 | 88 | InstructionPrinter ip; |
duke@435 | 89 | ip.print_line(this); |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | |
duke@435 | 93 | void Instruction::print(InstructionPrinter& ip) { |
duke@435 | 94 | ip.print_head(); |
duke@435 | 95 | ip.print_line(this); |
duke@435 | 96 | tty->cr(); |
duke@435 | 97 | } |
duke@435 | 98 | #endif // PRODUCT |
duke@435 | 99 | |
duke@435 | 100 | |
duke@435 | 101 | // perform constant and interval tests on index value |
duke@435 | 102 | bool AccessIndexed::compute_needs_range_check() { |
duke@435 | 103 | Constant* clength = length()->as_Constant(); |
duke@435 | 104 | Constant* cindex = index()->as_Constant(); |
duke@435 | 105 | if (clength && cindex) { |
duke@435 | 106 | IntConstant* l = clength->type()->as_IntConstant(); |
duke@435 | 107 | IntConstant* i = cindex->type()->as_IntConstant(); |
duke@435 | 108 | if (l && i && i->value() < l->value() && i->value() >= 0) { |
duke@435 | 109 | return false; |
duke@435 | 110 | } |
duke@435 | 111 | } |
duke@435 | 112 | return true; |
duke@435 | 113 | } |
duke@435 | 114 | |
duke@435 | 115 | |
duke@435 | 116 | ciType* LoadIndexed::exact_type() const { |
duke@435 | 117 | ciType* array_type = array()->exact_type(); |
duke@435 | 118 | if (array_type == NULL) { |
duke@435 | 119 | return NULL; |
duke@435 | 120 | } |
duke@435 | 121 | assert(array_type->is_array_klass(), "what else?"); |
duke@435 | 122 | ciArrayKlass* ak = (ciArrayKlass*)array_type; |
duke@435 | 123 | |
duke@435 | 124 | if (ak->element_type()->is_instance_klass()) { |
duke@435 | 125 | ciInstanceKlass* ik = (ciInstanceKlass*)ak->element_type(); |
duke@435 | 126 | if (ik->is_loaded() && ik->is_final()) { |
duke@435 | 127 | return ik; |
duke@435 | 128 | } |
duke@435 | 129 | } |
duke@435 | 130 | return NULL; |
duke@435 | 131 | } |
duke@435 | 132 | |
duke@435 | 133 | |
duke@435 | 134 | ciType* LoadIndexed::declared_type() const { |
duke@435 | 135 | ciType* array_type = array()->declared_type(); |
duke@435 | 136 | if (array_type == NULL) { |
duke@435 | 137 | return NULL; |
duke@435 | 138 | } |
duke@435 | 139 | assert(array_type->is_array_klass(), "what else?"); |
duke@435 | 140 | ciArrayKlass* ak = (ciArrayKlass*)array_type; |
duke@435 | 141 | return ak->element_type(); |
duke@435 | 142 | } |
duke@435 | 143 | |
duke@435 | 144 | |
duke@435 | 145 | ciType* LoadField::declared_type() const { |
duke@435 | 146 | return field()->type(); |
duke@435 | 147 | } |
duke@435 | 148 | |
duke@435 | 149 | |
duke@435 | 150 | ciType* LoadField::exact_type() const { |
duke@435 | 151 | ciType* type = declared_type(); |
duke@435 | 152 | // for primitive arrays, the declared type is the exact type |
duke@435 | 153 | if (type->is_type_array_klass()) { |
duke@435 | 154 | return type; |
duke@435 | 155 | } |
duke@435 | 156 | if (type->is_instance_klass()) { |
duke@435 | 157 | ciInstanceKlass* ik = (ciInstanceKlass*)type; |
duke@435 | 158 | if (ik->is_loaded() && ik->is_final()) { |
duke@435 | 159 | return type; |
duke@435 | 160 | } |
duke@435 | 161 | } |
duke@435 | 162 | return NULL; |
duke@435 | 163 | } |
duke@435 | 164 | |
duke@435 | 165 | |
duke@435 | 166 | ciType* NewTypeArray::exact_type() const { |
duke@435 | 167 | return ciTypeArrayKlass::make(elt_type()); |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | |
duke@435 | 171 | ciType* NewObjectArray::exact_type() const { |
duke@435 | 172 | return ciObjArrayKlass::make(klass()); |
duke@435 | 173 | } |
duke@435 | 174 | |
duke@435 | 175 | |
duke@435 | 176 | ciType* NewInstance::exact_type() const { |
duke@435 | 177 | return klass(); |
duke@435 | 178 | } |
duke@435 | 179 | |
duke@435 | 180 | |
duke@435 | 181 | ciType* CheckCast::declared_type() const { |
duke@435 | 182 | return klass(); |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | ciType* CheckCast::exact_type() const { |
duke@435 | 186 | if (klass()->is_instance_klass()) { |
duke@435 | 187 | ciInstanceKlass* ik = (ciInstanceKlass*)klass(); |
duke@435 | 188 | if (ik->is_loaded() && ik->is_final()) { |
duke@435 | 189 | return ik; |
duke@435 | 190 | } |
duke@435 | 191 | } |
duke@435 | 192 | return NULL; |
duke@435 | 193 | } |
duke@435 | 194 | |
duke@435 | 195 | |
duke@435 | 196 | void ArithmeticOp::other_values_do(void f(Value*)) { |
duke@435 | 197 | if (lock_stack() != NULL) lock_stack()->values_do(f); |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | void NullCheck::other_values_do(void f(Value*)) { |
duke@435 | 201 | lock_stack()->values_do(f); |
duke@435 | 202 | } |
duke@435 | 203 | |
duke@435 | 204 | void AccessArray::other_values_do(void f(Value*)) { |
duke@435 | 205 | if (lock_stack() != NULL) lock_stack()->values_do(f); |
duke@435 | 206 | } |
duke@435 | 207 | |
duke@435 | 208 | |
duke@435 | 209 | // Implementation of AccessField |
duke@435 | 210 | |
duke@435 | 211 | void AccessField::other_values_do(void f(Value*)) { |
duke@435 | 212 | if (state_before() != NULL) state_before()->values_do(f); |
duke@435 | 213 | if (lock_stack() != NULL) lock_stack()->values_do(f); |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | |
duke@435 | 217 | // Implementation of StoreIndexed |
duke@435 | 218 | |
duke@435 | 219 | IRScope* StoreIndexed::scope() const { |
duke@435 | 220 | return lock_stack()->scope(); |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | |
duke@435 | 224 | // Implementation of ArithmeticOp |
duke@435 | 225 | |
duke@435 | 226 | bool ArithmeticOp::is_commutative() const { |
duke@435 | 227 | switch (op()) { |
duke@435 | 228 | case Bytecodes::_iadd: // fall through |
duke@435 | 229 | case Bytecodes::_ladd: // fall through |
duke@435 | 230 | case Bytecodes::_fadd: // fall through |
duke@435 | 231 | case Bytecodes::_dadd: // fall through |
duke@435 | 232 | case Bytecodes::_imul: // fall through |
duke@435 | 233 | case Bytecodes::_lmul: // fall through |
duke@435 | 234 | case Bytecodes::_fmul: // fall through |
duke@435 | 235 | case Bytecodes::_dmul: return true; |
duke@435 | 236 | } |
duke@435 | 237 | return false; |
duke@435 | 238 | } |
duke@435 | 239 | |
duke@435 | 240 | |
duke@435 | 241 | bool ArithmeticOp::can_trap() const { |
duke@435 | 242 | switch (op()) { |
duke@435 | 243 | case Bytecodes::_idiv: // fall through |
duke@435 | 244 | case Bytecodes::_ldiv: // fall through |
duke@435 | 245 | case Bytecodes::_irem: // fall through |
duke@435 | 246 | case Bytecodes::_lrem: return true; |
duke@435 | 247 | } |
duke@435 | 248 | return false; |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | |
duke@435 | 252 | // Implementation of LogicOp |
duke@435 | 253 | |
duke@435 | 254 | bool LogicOp::is_commutative() const { |
duke@435 | 255 | #ifdef ASSERT |
duke@435 | 256 | switch (op()) { |
duke@435 | 257 | case Bytecodes::_iand: // fall through |
duke@435 | 258 | case Bytecodes::_land: // fall through |
duke@435 | 259 | case Bytecodes::_ior : // fall through |
duke@435 | 260 | case Bytecodes::_lor : // fall through |
duke@435 | 261 | case Bytecodes::_ixor: // fall through |
duke@435 | 262 | case Bytecodes::_lxor: break; |
duke@435 | 263 | default : ShouldNotReachHere(); |
duke@435 | 264 | } |
duke@435 | 265 | #endif |
duke@435 | 266 | // all LogicOps are commutative |
duke@435 | 267 | return true; |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | |
duke@435 | 271 | // Implementation of CompareOp |
duke@435 | 272 | |
duke@435 | 273 | void CompareOp::other_values_do(void f(Value*)) { |
duke@435 | 274 | if (state_before() != NULL) state_before()->values_do(f); |
duke@435 | 275 | } |
duke@435 | 276 | |
duke@435 | 277 | |
duke@435 | 278 | // Implementation of IfOp |
duke@435 | 279 | |
duke@435 | 280 | bool IfOp::is_commutative() const { |
duke@435 | 281 | return cond() == eql || cond() == neq; |
duke@435 | 282 | } |
duke@435 | 283 | |
duke@435 | 284 | |
duke@435 | 285 | // Implementation of StateSplit |
duke@435 | 286 | |
duke@435 | 287 | void StateSplit::substitute(BlockList& list, BlockBegin* old_block, BlockBegin* new_block) { |
duke@435 | 288 | NOT_PRODUCT(bool assigned = false;) |
duke@435 | 289 | for (int i = 0; i < list.length(); i++) { |
duke@435 | 290 | BlockBegin** b = list.adr_at(i); |
duke@435 | 291 | if (*b == old_block) { |
duke@435 | 292 | *b = new_block; |
duke@435 | 293 | NOT_PRODUCT(assigned = true;) |
duke@435 | 294 | } |
duke@435 | 295 | } |
duke@435 | 296 | assert(assigned == true, "should have assigned at least once"); |
duke@435 | 297 | } |
duke@435 | 298 | |
duke@435 | 299 | |
duke@435 | 300 | IRScope* StateSplit::scope() const { |
duke@435 | 301 | return _state->scope(); |
duke@435 | 302 | } |
duke@435 | 303 | |
duke@435 | 304 | |
duke@435 | 305 | void StateSplit::state_values_do(void f(Value*)) { |
duke@435 | 306 | if (state() != NULL) state()->values_do(f); |
duke@435 | 307 | } |
duke@435 | 308 | |
duke@435 | 309 | |
duke@435 | 310 | void BlockBegin::state_values_do(void f(Value*)) { |
duke@435 | 311 | StateSplit::state_values_do(f); |
duke@435 | 312 | |
duke@435 | 313 | if (is_set(BlockBegin::exception_entry_flag)) { |
duke@435 | 314 | for (int i = 0; i < number_of_exception_states(); i++) { |
duke@435 | 315 | exception_state_at(i)->values_do(f); |
duke@435 | 316 | } |
duke@435 | 317 | } |
duke@435 | 318 | } |
duke@435 | 319 | |
duke@435 | 320 | |
duke@435 | 321 | void MonitorEnter::state_values_do(void f(Value*)) { |
duke@435 | 322 | StateSplit::state_values_do(f); |
duke@435 | 323 | _lock_stack_before->values_do(f); |
duke@435 | 324 | } |
duke@435 | 325 | |
duke@435 | 326 | |
duke@435 | 327 | void Intrinsic::state_values_do(void f(Value*)) { |
duke@435 | 328 | StateSplit::state_values_do(f); |
duke@435 | 329 | if (lock_stack() != NULL) lock_stack()->values_do(f); |
duke@435 | 330 | } |
duke@435 | 331 | |
duke@435 | 332 | |
duke@435 | 333 | // Implementation of Invoke |
duke@435 | 334 | |
duke@435 | 335 | |
duke@435 | 336 | Invoke::Invoke(Bytecodes::Code code, ValueType* result_type, Value recv, Values* args, |
twisti@1730 | 337 | int vtable_index, ciMethod* target, ValueStack* state_before) |
duke@435 | 338 | : StateSplit(result_type) |
duke@435 | 339 | , _code(code) |
duke@435 | 340 | , _recv(recv) |
duke@435 | 341 | , _args(args) |
duke@435 | 342 | , _vtable_index(vtable_index) |
duke@435 | 343 | , _target(target) |
twisti@1730 | 344 | , _state_before(state_before) |
duke@435 | 345 | { |
duke@435 | 346 | set_flag(TargetIsLoadedFlag, target->is_loaded()); |
duke@435 | 347 | set_flag(TargetIsFinalFlag, target_is_loaded() && target->is_final_method()); |
duke@435 | 348 | set_flag(TargetIsStrictfpFlag, target_is_loaded() && target->is_strict()); |
duke@435 | 349 | |
duke@435 | 350 | assert(args != NULL, "args must exist"); |
duke@435 | 351 | #ifdef ASSERT |
duke@435 | 352 | values_do(assert_value); |
duke@435 | 353 | #endif // ASSERT |
duke@435 | 354 | |
duke@435 | 355 | // provide an initial guess of signature size. |
duke@435 | 356 | _signature = new BasicTypeList(number_of_arguments() + (has_receiver() ? 1 : 0)); |
duke@435 | 357 | if (has_receiver()) { |
duke@435 | 358 | _signature->append(as_BasicType(receiver()->type())); |
twisti@1730 | 359 | } else if (is_invokedynamic()) { |
twisti@1730 | 360 | // Add the synthetic MethodHandle argument to the signature. |
twisti@1730 | 361 | _signature->append(T_OBJECT); |
duke@435 | 362 | } |
duke@435 | 363 | for (int i = 0; i < number_of_arguments(); i++) { |
duke@435 | 364 | ValueType* t = argument_at(i)->type(); |
duke@435 | 365 | BasicType bt = as_BasicType(t); |
duke@435 | 366 | _signature->append(bt); |
duke@435 | 367 | } |
duke@435 | 368 | } |
duke@435 | 369 | |
duke@435 | 370 | |
twisti@1730 | 371 | void Invoke::state_values_do(void f(Value*)) { |
twisti@1730 | 372 | StateSplit::state_values_do(f); |
twisti@1730 | 373 | if (state_before() != NULL) state_before()->values_do(f); |
twisti@1730 | 374 | if (state() != NULL) state()->values_do(f); |
twisti@1730 | 375 | } |
twisti@1730 | 376 | |
twisti@1730 | 377 | |
duke@435 | 378 | // Implementation of Contant |
duke@435 | 379 | intx Constant::hash() const { |
duke@435 | 380 | if (_state == NULL) { |
duke@435 | 381 | switch (type()->tag()) { |
duke@435 | 382 | case intTag: |
duke@435 | 383 | return HASH2(name(), type()->as_IntConstant()->value()); |
duke@435 | 384 | case longTag: |
duke@435 | 385 | { |
duke@435 | 386 | jlong temp = type()->as_LongConstant()->value(); |
duke@435 | 387 | return HASH3(name(), high(temp), low(temp)); |
duke@435 | 388 | } |
duke@435 | 389 | case floatTag: |
duke@435 | 390 | return HASH2(name(), jint_cast(type()->as_FloatConstant()->value())); |
duke@435 | 391 | case doubleTag: |
duke@435 | 392 | { |
duke@435 | 393 | jlong temp = jlong_cast(type()->as_DoubleConstant()->value()); |
duke@435 | 394 | return HASH3(name(), high(temp), low(temp)); |
duke@435 | 395 | } |
duke@435 | 396 | case objectTag: |
duke@435 | 397 | assert(type()->as_ObjectType()->is_loaded(), "can't handle unloaded values"); |
duke@435 | 398 | return HASH2(name(), type()->as_ObjectType()->constant_value()); |
duke@435 | 399 | } |
duke@435 | 400 | } |
duke@435 | 401 | return 0; |
duke@435 | 402 | } |
duke@435 | 403 | |
duke@435 | 404 | bool Constant::is_equal(Value v) const { |
duke@435 | 405 | if (v->as_Constant() == NULL) return false; |
duke@435 | 406 | |
duke@435 | 407 | switch (type()->tag()) { |
duke@435 | 408 | case intTag: |
duke@435 | 409 | { |
duke@435 | 410 | IntConstant* t1 = type()->as_IntConstant(); |
duke@435 | 411 | IntConstant* t2 = v->type()->as_IntConstant(); |
duke@435 | 412 | return (t1 != NULL && t2 != NULL && |
duke@435 | 413 | t1->value() == t2->value()); |
duke@435 | 414 | } |
duke@435 | 415 | case longTag: |
duke@435 | 416 | { |
duke@435 | 417 | LongConstant* t1 = type()->as_LongConstant(); |
duke@435 | 418 | LongConstant* t2 = v->type()->as_LongConstant(); |
duke@435 | 419 | return (t1 != NULL && t2 != NULL && |
duke@435 | 420 | t1->value() == t2->value()); |
duke@435 | 421 | } |
duke@435 | 422 | case floatTag: |
duke@435 | 423 | { |
duke@435 | 424 | FloatConstant* t1 = type()->as_FloatConstant(); |
duke@435 | 425 | FloatConstant* t2 = v->type()->as_FloatConstant(); |
duke@435 | 426 | return (t1 != NULL && t2 != NULL && |
duke@435 | 427 | jint_cast(t1->value()) == jint_cast(t2->value())); |
duke@435 | 428 | } |
duke@435 | 429 | case doubleTag: |
duke@435 | 430 | { |
duke@435 | 431 | DoubleConstant* t1 = type()->as_DoubleConstant(); |
duke@435 | 432 | DoubleConstant* t2 = v->type()->as_DoubleConstant(); |
duke@435 | 433 | return (t1 != NULL && t2 != NULL && |
duke@435 | 434 | jlong_cast(t1->value()) == jlong_cast(t2->value())); |
duke@435 | 435 | } |
duke@435 | 436 | case objectTag: |
duke@435 | 437 | { |
duke@435 | 438 | ObjectType* t1 = type()->as_ObjectType(); |
duke@435 | 439 | ObjectType* t2 = v->type()->as_ObjectType(); |
duke@435 | 440 | return (t1 != NULL && t2 != NULL && |
duke@435 | 441 | t1->is_loaded() && t2->is_loaded() && |
duke@435 | 442 | t1->constant_value() == t2->constant_value()); |
duke@435 | 443 | } |
duke@435 | 444 | } |
duke@435 | 445 | return false; |
duke@435 | 446 | } |
duke@435 | 447 | |
duke@435 | 448 | |
duke@435 | 449 | BlockBegin* Constant::compare(Instruction::Condition cond, Value right, |
duke@435 | 450 | BlockBegin* true_sux, BlockBegin* false_sux) { |
duke@435 | 451 | Constant* rc = right->as_Constant(); |
duke@435 | 452 | // other is not a constant |
duke@435 | 453 | if (rc == NULL) return NULL; |
duke@435 | 454 | |
duke@435 | 455 | ValueType* lt = type(); |
duke@435 | 456 | ValueType* rt = rc->type(); |
duke@435 | 457 | // different types |
duke@435 | 458 | if (lt->base() != rt->base()) return NULL; |
duke@435 | 459 | switch (lt->tag()) { |
duke@435 | 460 | case intTag: { |
duke@435 | 461 | int x = lt->as_IntConstant()->value(); |
duke@435 | 462 | int y = rt->as_IntConstant()->value(); |
duke@435 | 463 | switch (cond) { |
duke@435 | 464 | case If::eql: return x == y ? true_sux : false_sux; |
duke@435 | 465 | case If::neq: return x != y ? true_sux : false_sux; |
duke@435 | 466 | case If::lss: return x < y ? true_sux : false_sux; |
duke@435 | 467 | case If::leq: return x <= y ? true_sux : false_sux; |
duke@435 | 468 | case If::gtr: return x > y ? true_sux : false_sux; |
duke@435 | 469 | case If::geq: return x >= y ? true_sux : false_sux; |
duke@435 | 470 | } |
duke@435 | 471 | break; |
duke@435 | 472 | } |
duke@435 | 473 | case longTag: { |
duke@435 | 474 | jlong x = lt->as_LongConstant()->value(); |
duke@435 | 475 | jlong y = rt->as_LongConstant()->value(); |
duke@435 | 476 | switch (cond) { |
duke@435 | 477 | case If::eql: return x == y ? true_sux : false_sux; |
duke@435 | 478 | case If::neq: return x != y ? true_sux : false_sux; |
duke@435 | 479 | case If::lss: return x < y ? true_sux : false_sux; |
duke@435 | 480 | case If::leq: return x <= y ? true_sux : false_sux; |
duke@435 | 481 | case If::gtr: return x > y ? true_sux : false_sux; |
duke@435 | 482 | case If::geq: return x >= y ? true_sux : false_sux; |
duke@435 | 483 | } |
duke@435 | 484 | break; |
duke@435 | 485 | } |
duke@435 | 486 | case objectTag: { |
duke@435 | 487 | ciObject* xvalue = lt->as_ObjectType()->constant_value(); |
duke@435 | 488 | ciObject* yvalue = rt->as_ObjectType()->constant_value(); |
duke@435 | 489 | assert(xvalue != NULL && yvalue != NULL, "not constants"); |
duke@435 | 490 | if (xvalue->is_loaded() && yvalue->is_loaded()) { |
duke@435 | 491 | switch (cond) { |
duke@435 | 492 | case If::eql: return xvalue == yvalue ? true_sux : false_sux; |
duke@435 | 493 | case If::neq: return xvalue != yvalue ? true_sux : false_sux; |
duke@435 | 494 | } |
duke@435 | 495 | } |
duke@435 | 496 | break; |
duke@435 | 497 | } |
duke@435 | 498 | } |
duke@435 | 499 | return NULL; |
duke@435 | 500 | } |
duke@435 | 501 | |
duke@435 | 502 | |
duke@435 | 503 | void Constant::other_values_do(void f(Value*)) { |
duke@435 | 504 | if (state() != NULL) state()->values_do(f); |
duke@435 | 505 | } |
duke@435 | 506 | |
duke@435 | 507 | |
duke@435 | 508 | // Implementation of NewArray |
duke@435 | 509 | |
duke@435 | 510 | void NewArray::other_values_do(void f(Value*)) { |
duke@435 | 511 | if (state_before() != NULL) state_before()->values_do(f); |
duke@435 | 512 | } |
duke@435 | 513 | |
duke@435 | 514 | |
duke@435 | 515 | // Implementation of TypeCheck |
duke@435 | 516 | |
duke@435 | 517 | void TypeCheck::other_values_do(void f(Value*)) { |
duke@435 | 518 | if (state_before() != NULL) state_before()->values_do(f); |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | |
duke@435 | 522 | // Implementation of BlockBegin |
duke@435 | 523 | |
duke@435 | 524 | int BlockBegin::_next_block_id = 0; |
duke@435 | 525 | |
duke@435 | 526 | |
duke@435 | 527 | void BlockBegin::set_end(BlockEnd* end) { |
duke@435 | 528 | assert(end != NULL, "should not reset block end to NULL"); |
duke@435 | 529 | BlockEnd* old_end = _end; |
duke@435 | 530 | if (end == old_end) { |
duke@435 | 531 | return; |
duke@435 | 532 | } |
duke@435 | 533 | // Must make the predecessors/successors match up with the |
duke@435 | 534 | // BlockEnd's notion. |
duke@435 | 535 | int i, n; |
duke@435 | 536 | if (old_end != NULL) { |
duke@435 | 537 | // disconnect from the old end |
duke@435 | 538 | old_end->set_begin(NULL); |
duke@435 | 539 | |
duke@435 | 540 | // disconnect this block from it's current successors |
duke@435 | 541 | for (i = 0; i < _successors.length(); i++) { |
duke@435 | 542 | _successors.at(i)->remove_predecessor(this); |
duke@435 | 543 | } |
duke@435 | 544 | } |
duke@435 | 545 | _end = end; |
duke@435 | 546 | |
duke@435 | 547 | _successors.clear(); |
duke@435 | 548 | // Now reset successors list based on BlockEnd |
duke@435 | 549 | n = end->number_of_sux(); |
duke@435 | 550 | for (i = 0; i < n; i++) { |
duke@435 | 551 | BlockBegin* sux = end->sux_at(i); |
duke@435 | 552 | _successors.append(sux); |
duke@435 | 553 | sux->_predecessors.append(this); |
duke@435 | 554 | } |
duke@435 | 555 | _end->set_begin(this); |
duke@435 | 556 | } |
duke@435 | 557 | |
duke@435 | 558 | |
duke@435 | 559 | void BlockBegin::disconnect_edge(BlockBegin* from, BlockBegin* to) { |
duke@435 | 560 | // disconnect any edges between from and to |
duke@435 | 561 | #ifndef PRODUCT |
duke@435 | 562 | if (PrintIR && Verbose) { |
duke@435 | 563 | tty->print_cr("Disconnected edge B%d -> B%d", from->block_id(), to->block_id()); |
duke@435 | 564 | } |
duke@435 | 565 | #endif |
duke@435 | 566 | for (int s = 0; s < from->number_of_sux();) { |
duke@435 | 567 | BlockBegin* sux = from->sux_at(s); |
duke@435 | 568 | if (sux == to) { |
duke@435 | 569 | int index = sux->_predecessors.index_of(from); |
duke@435 | 570 | if (index >= 0) { |
duke@435 | 571 | sux->_predecessors.remove_at(index); |
duke@435 | 572 | } |
duke@435 | 573 | from->_successors.remove_at(s); |
duke@435 | 574 | } else { |
duke@435 | 575 | s++; |
duke@435 | 576 | } |
duke@435 | 577 | } |
duke@435 | 578 | } |
duke@435 | 579 | |
duke@435 | 580 | |
duke@435 | 581 | void BlockBegin::disconnect_from_graph() { |
duke@435 | 582 | // disconnect this block from all other blocks |
duke@435 | 583 | for (int p = 0; p < number_of_preds(); p++) { |
duke@435 | 584 | pred_at(p)->remove_successor(this); |
duke@435 | 585 | } |
duke@435 | 586 | for (int s = 0; s < number_of_sux(); s++) { |
duke@435 | 587 | sux_at(s)->remove_predecessor(this); |
duke@435 | 588 | } |
duke@435 | 589 | } |
duke@435 | 590 | |
duke@435 | 591 | void BlockBegin::substitute_sux(BlockBegin* old_sux, BlockBegin* new_sux) { |
duke@435 | 592 | // modify predecessors before substituting successors |
duke@435 | 593 | for (int i = 0; i < number_of_sux(); i++) { |
duke@435 | 594 | if (sux_at(i) == old_sux) { |
duke@435 | 595 | // remove old predecessor before adding new predecessor |
duke@435 | 596 | // otherwise there is a dead predecessor in the list |
duke@435 | 597 | new_sux->remove_predecessor(old_sux); |
duke@435 | 598 | new_sux->add_predecessor(this); |
duke@435 | 599 | } |
duke@435 | 600 | } |
duke@435 | 601 | old_sux->remove_predecessor(this); |
duke@435 | 602 | end()->substitute_sux(old_sux, new_sux); |
duke@435 | 603 | } |
duke@435 | 604 | |
duke@435 | 605 | |
duke@435 | 606 | |
duke@435 | 607 | // In general it is not possible to calculate a value for the field "depth_first_number" |
duke@435 | 608 | // of the inserted block, without recomputing the values of the other blocks |
duke@435 | 609 | // in the CFG. Therefore the value of "depth_first_number" in BlockBegin becomes meaningless. |
duke@435 | 610 | BlockBegin* BlockBegin::insert_block_between(BlockBegin* sux) { |
duke@435 | 611 | // Try to make the bci close to a block with a single pred or sux, |
duke@435 | 612 | // since this make the block layout algorithm work better. |
duke@435 | 613 | int bci = -1; |
duke@435 | 614 | if (sux->number_of_preds() == 1) { |
duke@435 | 615 | bci = sux->bci(); |
duke@435 | 616 | } else { |
duke@435 | 617 | bci = end()->bci(); |
duke@435 | 618 | } |
duke@435 | 619 | |
duke@435 | 620 | BlockBegin* new_sux = new BlockBegin(bci); |
duke@435 | 621 | |
duke@435 | 622 | // mark this block (special treatment when block order is computed) |
duke@435 | 623 | new_sux->set(critical_edge_split_flag); |
duke@435 | 624 | |
duke@435 | 625 | // This goto is not a safepoint. |
duke@435 | 626 | Goto* e = new Goto(sux, false); |
duke@435 | 627 | new_sux->set_next(e, bci); |
duke@435 | 628 | new_sux->set_end(e); |
duke@435 | 629 | // setup states |
duke@435 | 630 | ValueStack* s = end()->state(); |
duke@435 | 631 | new_sux->set_state(s->copy()); |
duke@435 | 632 | e->set_state(s->copy()); |
duke@435 | 633 | assert(new_sux->state()->locals_size() == s->locals_size(), "local size mismatch!"); |
duke@435 | 634 | assert(new_sux->state()->stack_size() == s->stack_size(), "stack size mismatch!"); |
duke@435 | 635 | assert(new_sux->state()->locks_size() == s->locks_size(), "locks size mismatch!"); |
duke@435 | 636 | |
duke@435 | 637 | // link predecessor to new block |
duke@435 | 638 | end()->substitute_sux(sux, new_sux); |
duke@435 | 639 | |
duke@435 | 640 | // The ordering needs to be the same, so remove the link that the |
duke@435 | 641 | // set_end call above added and substitute the new_sux for this |
duke@435 | 642 | // block. |
duke@435 | 643 | sux->remove_predecessor(new_sux); |
duke@435 | 644 | |
duke@435 | 645 | // the successor could be the target of a switch so it might have |
duke@435 | 646 | // multiple copies of this predecessor, so substitute the new_sux |
duke@435 | 647 | // for the first and delete the rest. |
duke@435 | 648 | bool assigned = false; |
duke@435 | 649 | BlockList& list = sux->_predecessors; |
duke@435 | 650 | for (int i = 0; i < list.length(); i++) { |
duke@435 | 651 | BlockBegin** b = list.adr_at(i); |
duke@435 | 652 | if (*b == this) { |
duke@435 | 653 | if (assigned) { |
duke@435 | 654 | list.remove_at(i); |
duke@435 | 655 | // reprocess this index |
duke@435 | 656 | i--; |
duke@435 | 657 | } else { |
duke@435 | 658 | assigned = true; |
duke@435 | 659 | *b = new_sux; |
duke@435 | 660 | } |
duke@435 | 661 | // link the new block back to it's predecessors. |
duke@435 | 662 | new_sux->add_predecessor(this); |
duke@435 | 663 | } |
duke@435 | 664 | } |
duke@435 | 665 | assert(assigned == true, "should have assigned at least once"); |
duke@435 | 666 | return new_sux; |
duke@435 | 667 | } |
duke@435 | 668 | |
duke@435 | 669 | |
duke@435 | 670 | void BlockBegin::remove_successor(BlockBegin* pred) { |
duke@435 | 671 | int idx; |
duke@435 | 672 | while ((idx = _successors.index_of(pred)) >= 0) { |
duke@435 | 673 | _successors.remove_at(idx); |
duke@435 | 674 | } |
duke@435 | 675 | } |
duke@435 | 676 | |
duke@435 | 677 | |
duke@435 | 678 | void BlockBegin::add_predecessor(BlockBegin* pred) { |
duke@435 | 679 | _predecessors.append(pred); |
duke@435 | 680 | } |
duke@435 | 681 | |
duke@435 | 682 | |
duke@435 | 683 | void BlockBegin::remove_predecessor(BlockBegin* pred) { |
duke@435 | 684 | int idx; |
duke@435 | 685 | while ((idx = _predecessors.index_of(pred)) >= 0) { |
duke@435 | 686 | _predecessors.remove_at(idx); |
duke@435 | 687 | } |
duke@435 | 688 | } |
duke@435 | 689 | |
duke@435 | 690 | |
duke@435 | 691 | void BlockBegin::add_exception_handler(BlockBegin* b) { |
duke@435 | 692 | assert(b != NULL && (b->is_set(exception_entry_flag)), "exception handler must exist"); |
duke@435 | 693 | // add only if not in the list already |
duke@435 | 694 | if (!_exception_handlers.contains(b)) _exception_handlers.append(b); |
duke@435 | 695 | } |
duke@435 | 696 | |
duke@435 | 697 | int BlockBegin::add_exception_state(ValueStack* state) { |
duke@435 | 698 | assert(is_set(exception_entry_flag), "only for xhandlers"); |
duke@435 | 699 | if (_exception_states == NULL) { |
duke@435 | 700 | _exception_states = new ValueStackStack(4); |
duke@435 | 701 | } |
duke@435 | 702 | _exception_states->append(state); |
duke@435 | 703 | return _exception_states->length() - 1; |
duke@435 | 704 | } |
duke@435 | 705 | |
duke@435 | 706 | |
duke@435 | 707 | void BlockBegin::iterate_preorder(boolArray& mark, BlockClosure* closure) { |
duke@435 | 708 | if (!mark.at(block_id())) { |
duke@435 | 709 | mark.at_put(block_id(), true); |
duke@435 | 710 | closure->block_do(this); |
duke@435 | 711 | BlockEnd* e = end(); // must do this after block_do because block_do may change it! |
duke@435 | 712 | { for (int i = number_of_exception_handlers() - 1; i >= 0; i--) exception_handler_at(i)->iterate_preorder(mark, closure); } |
duke@435 | 713 | { for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_preorder(mark, closure); } |
duke@435 | 714 | } |
duke@435 | 715 | } |
duke@435 | 716 | |
duke@435 | 717 | |
duke@435 | 718 | void BlockBegin::iterate_postorder(boolArray& mark, BlockClosure* closure) { |
duke@435 | 719 | if (!mark.at(block_id())) { |
duke@435 | 720 | mark.at_put(block_id(), true); |
duke@435 | 721 | BlockEnd* e = end(); |
duke@435 | 722 | { for (int i = number_of_exception_handlers() - 1; i >= 0; i--) exception_handler_at(i)->iterate_postorder(mark, closure); } |
duke@435 | 723 | { for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_postorder(mark, closure); } |
duke@435 | 724 | closure->block_do(this); |
duke@435 | 725 | } |
duke@435 | 726 | } |
duke@435 | 727 | |
duke@435 | 728 | |
duke@435 | 729 | void BlockBegin::iterate_preorder(BlockClosure* closure) { |
duke@435 | 730 | boolArray mark(number_of_blocks(), false); |
duke@435 | 731 | iterate_preorder(mark, closure); |
duke@435 | 732 | } |
duke@435 | 733 | |
duke@435 | 734 | |
duke@435 | 735 | void BlockBegin::iterate_postorder(BlockClosure* closure) { |
duke@435 | 736 | boolArray mark(number_of_blocks(), false); |
duke@435 | 737 | iterate_postorder(mark, closure); |
duke@435 | 738 | } |
duke@435 | 739 | |
duke@435 | 740 | |
duke@435 | 741 | void BlockBegin::block_values_do(void f(Value*)) { |
duke@435 | 742 | for (Instruction* n = this; n != NULL; n = n->next()) n->values_do(f); |
duke@435 | 743 | } |
duke@435 | 744 | |
duke@435 | 745 | |
duke@435 | 746 | #ifndef PRODUCT |
duke@435 | 747 | #define TRACE_PHI(code) if (PrintPhiFunctions) { code; } |
duke@435 | 748 | #else |
duke@435 | 749 | #define TRACE_PHI(coce) |
duke@435 | 750 | #endif |
duke@435 | 751 | |
duke@435 | 752 | |
duke@435 | 753 | bool BlockBegin::try_merge(ValueStack* new_state) { |
duke@435 | 754 | TRACE_PHI(tty->print_cr("********** try_merge for block B%d", block_id())); |
duke@435 | 755 | |
duke@435 | 756 | // local variables used for state iteration |
duke@435 | 757 | int index; |
duke@435 | 758 | Value new_value, existing_value; |
duke@435 | 759 | |
duke@435 | 760 | ValueStack* existing_state = state(); |
duke@435 | 761 | if (existing_state == NULL) { |
duke@435 | 762 | TRACE_PHI(tty->print_cr("first call of try_merge for this block")); |
duke@435 | 763 | |
duke@435 | 764 | if (is_set(BlockBegin::was_visited_flag)) { |
duke@435 | 765 | // this actually happens for complicated jsr/ret structures |
duke@435 | 766 | return false; // BAILOUT in caller |
duke@435 | 767 | } |
duke@435 | 768 | |
duke@435 | 769 | // copy state because it is altered |
duke@435 | 770 | new_state = new_state->copy(); |
duke@435 | 771 | |
duke@435 | 772 | // Use method liveness to invalidate dead locals |
duke@435 | 773 | MethodLivenessResult liveness = new_state->scope()->method()->liveness_at_bci(bci()); |
duke@435 | 774 | if (liveness.is_valid()) { |
duke@435 | 775 | assert((int)liveness.size() == new_state->locals_size(), "error in use of liveness"); |
duke@435 | 776 | |
duke@435 | 777 | for_each_local_value(new_state, index, new_value) { |
duke@435 | 778 | if (!liveness.at(index) || new_value->type()->is_illegal()) { |
duke@435 | 779 | new_state->invalidate_local(index); |
duke@435 | 780 | TRACE_PHI(tty->print_cr("invalidating dead local %d", index)); |
duke@435 | 781 | } |
duke@435 | 782 | } |
duke@435 | 783 | } |
duke@435 | 784 | |
duke@435 | 785 | if (is_set(BlockBegin::parser_loop_header_flag)) { |
duke@435 | 786 | TRACE_PHI(tty->print_cr("loop header block, initializing phi functions")); |
duke@435 | 787 | |
duke@435 | 788 | for_each_stack_value(new_state, index, new_value) { |
duke@435 | 789 | new_state->setup_phi_for_stack(this, index); |
duke@435 | 790 | TRACE_PHI(tty->print_cr("creating phi-function %c%d for stack %d", new_state->stack_at(index)->type()->tchar(), new_state->stack_at(index)->id(), index)); |
duke@435 | 791 | } |
duke@435 | 792 | |
duke@435 | 793 | BitMap requires_phi_function = new_state->scope()->requires_phi_function(); |
duke@435 | 794 | |
duke@435 | 795 | for_each_local_value(new_state, index, new_value) { |
duke@435 | 796 | bool requires_phi = requires_phi_function.at(index) || (new_value->type()->is_double_word() && requires_phi_function.at(index + 1)); |
duke@435 | 797 | if (requires_phi || !SelectivePhiFunctions) { |
duke@435 | 798 | new_state->setup_phi_for_local(this, index); |
duke@435 | 799 | TRACE_PHI(tty->print_cr("creating phi-function %c%d for local %d", new_state->local_at(index)->type()->tchar(), new_state->local_at(index)->id(), index)); |
duke@435 | 800 | } |
duke@435 | 801 | } |
duke@435 | 802 | } |
duke@435 | 803 | |
duke@435 | 804 | // initialize state of block |
duke@435 | 805 | set_state(new_state); |
duke@435 | 806 | |
duke@435 | 807 | } else if (existing_state->is_same_across_scopes(new_state)) { |
duke@435 | 808 | TRACE_PHI(tty->print_cr("exisiting state found")); |
duke@435 | 809 | |
duke@435 | 810 | // Inlining may cause the local state not to match up, so walk up |
duke@435 | 811 | // the new state until we get to the same scope as the |
duke@435 | 812 | // existing and then start processing from there. |
duke@435 | 813 | while (existing_state->scope() != new_state->scope()) { |
duke@435 | 814 | new_state = new_state->caller_state(); |
duke@435 | 815 | assert(new_state != NULL, "could not match up scopes"); |
duke@435 | 816 | |
duke@435 | 817 | assert(false, "check if this is necessary"); |
duke@435 | 818 | } |
duke@435 | 819 | |
duke@435 | 820 | assert(existing_state->scope() == new_state->scope(), "not matching"); |
duke@435 | 821 | assert(existing_state->locals_size() == new_state->locals_size(), "not matching"); |
duke@435 | 822 | assert(existing_state->stack_size() == new_state->stack_size(), "not matching"); |
duke@435 | 823 | |
duke@435 | 824 | if (is_set(BlockBegin::was_visited_flag)) { |
duke@435 | 825 | TRACE_PHI(tty->print_cr("loop header block, phis must be present")); |
duke@435 | 826 | |
duke@435 | 827 | if (!is_set(BlockBegin::parser_loop_header_flag)) { |
duke@435 | 828 | // this actually happens for complicated jsr/ret structures |
duke@435 | 829 | return false; // BAILOUT in caller |
duke@435 | 830 | } |
duke@435 | 831 | |
duke@435 | 832 | for_each_local_value(existing_state, index, existing_value) { |
duke@435 | 833 | Value new_value = new_state->local_at(index); |
duke@435 | 834 | if (new_value == NULL || new_value->type()->tag() != existing_value->type()->tag()) { |
duke@435 | 835 | // The old code invalidated the phi function here |
duke@435 | 836 | // Because dead locals are replaced with NULL, this is a very rare case now, so simply bail out |
duke@435 | 837 | return false; // BAILOUT in caller |
duke@435 | 838 | } |
duke@435 | 839 | } |
duke@435 | 840 | |
duke@435 | 841 | #ifdef ASSERT |
duke@435 | 842 | // check that all necessary phi functions are present |
duke@435 | 843 | for_each_stack_value(existing_state, index, existing_value) { |
duke@435 | 844 | assert(existing_value->as_Phi() != NULL && existing_value->as_Phi()->block() == this, "phi function required"); |
duke@435 | 845 | } |
duke@435 | 846 | for_each_local_value(existing_state, index, existing_value) { |
duke@435 | 847 | assert(existing_value == new_state->local_at(index) || (existing_value->as_Phi() != NULL && existing_value->as_Phi()->as_Phi()->block() == this), "phi function required"); |
duke@435 | 848 | } |
duke@435 | 849 | #endif |
duke@435 | 850 | |
duke@435 | 851 | } else { |
duke@435 | 852 | TRACE_PHI(tty->print_cr("creating phi functions on demand")); |
duke@435 | 853 | |
duke@435 | 854 | // create necessary phi functions for stack |
duke@435 | 855 | for_each_stack_value(existing_state, index, existing_value) { |
duke@435 | 856 | Value new_value = new_state->stack_at(index); |
duke@435 | 857 | Phi* existing_phi = existing_value->as_Phi(); |
duke@435 | 858 | |
duke@435 | 859 | if (new_value != existing_value && (existing_phi == NULL || existing_phi->block() != this)) { |
duke@435 | 860 | existing_state->setup_phi_for_stack(this, index); |
duke@435 | 861 | TRACE_PHI(tty->print_cr("creating phi-function %c%d for stack %d", existing_state->stack_at(index)->type()->tchar(), existing_state->stack_at(index)->id(), index)); |
duke@435 | 862 | } |
duke@435 | 863 | } |
duke@435 | 864 | |
duke@435 | 865 | // create necessary phi functions for locals |
duke@435 | 866 | for_each_local_value(existing_state, index, existing_value) { |
duke@435 | 867 | Value new_value = new_state->local_at(index); |
duke@435 | 868 | Phi* existing_phi = existing_value->as_Phi(); |
duke@435 | 869 | |
duke@435 | 870 | if (new_value == NULL || new_value->type()->tag() != existing_value->type()->tag()) { |
duke@435 | 871 | existing_state->invalidate_local(index); |
duke@435 | 872 | TRACE_PHI(tty->print_cr("invalidating local %d because of type mismatch", index)); |
duke@435 | 873 | } else if (new_value != existing_value && (existing_phi == NULL || existing_phi->block() != this)) { |
duke@435 | 874 | existing_state->setup_phi_for_local(this, index); |
duke@435 | 875 | TRACE_PHI(tty->print_cr("creating phi-function %c%d for local %d", existing_state->local_at(index)->type()->tchar(), existing_state->local_at(index)->id(), index)); |
duke@435 | 876 | } |
duke@435 | 877 | } |
duke@435 | 878 | } |
duke@435 | 879 | |
duke@435 | 880 | assert(existing_state->caller_state() == new_state->caller_state(), "caller states must be equal"); |
duke@435 | 881 | |
duke@435 | 882 | } else { |
duke@435 | 883 | assert(false, "stack or locks not matching (invalid bytecodes)"); |
duke@435 | 884 | return false; |
duke@435 | 885 | } |
duke@435 | 886 | |
duke@435 | 887 | TRACE_PHI(tty->print_cr("********** try_merge for block B%d successful", block_id())); |
duke@435 | 888 | |
duke@435 | 889 | return true; |
duke@435 | 890 | } |
duke@435 | 891 | |
duke@435 | 892 | |
duke@435 | 893 | #ifndef PRODUCT |
duke@435 | 894 | void BlockBegin::print_block() { |
duke@435 | 895 | InstructionPrinter ip; |
duke@435 | 896 | print_block(ip, false); |
duke@435 | 897 | } |
duke@435 | 898 | |
duke@435 | 899 | |
duke@435 | 900 | void BlockBegin::print_block(InstructionPrinter& ip, bool live_only) { |
duke@435 | 901 | ip.print_instr(this); tty->cr(); |
duke@435 | 902 | ip.print_stack(this->state()); tty->cr(); |
duke@435 | 903 | ip.print_inline_level(this); |
duke@435 | 904 | ip.print_head(); |
duke@435 | 905 | for (Instruction* n = next(); n != NULL; n = n->next()) { |
duke@435 | 906 | if (!live_only || n->is_pinned() || n->use_count() > 0) { |
duke@435 | 907 | ip.print_line(n); |
duke@435 | 908 | } |
duke@435 | 909 | } |
duke@435 | 910 | tty->cr(); |
duke@435 | 911 | } |
duke@435 | 912 | #endif // PRODUCT |
duke@435 | 913 | |
duke@435 | 914 | |
duke@435 | 915 | // Implementation of BlockList |
duke@435 | 916 | |
duke@435 | 917 | void BlockList::iterate_forward (BlockClosure* closure) { |
duke@435 | 918 | const int l = length(); |
duke@435 | 919 | for (int i = 0; i < l; i++) closure->block_do(at(i)); |
duke@435 | 920 | } |
duke@435 | 921 | |
duke@435 | 922 | |
duke@435 | 923 | void BlockList::iterate_backward(BlockClosure* closure) { |
duke@435 | 924 | for (int i = length() - 1; i >= 0; i--) closure->block_do(at(i)); |
duke@435 | 925 | } |
duke@435 | 926 | |
duke@435 | 927 | |
duke@435 | 928 | void BlockList::blocks_do(void f(BlockBegin*)) { |
duke@435 | 929 | for (int i = length() - 1; i >= 0; i--) f(at(i)); |
duke@435 | 930 | } |
duke@435 | 931 | |
duke@435 | 932 | |
duke@435 | 933 | void BlockList::values_do(void f(Value*)) { |
duke@435 | 934 | for (int i = length() - 1; i >= 0; i--) at(i)->block_values_do(f); |
duke@435 | 935 | } |
duke@435 | 936 | |
duke@435 | 937 | |
duke@435 | 938 | #ifndef PRODUCT |
duke@435 | 939 | void BlockList::print(bool cfg_only, bool live_only) { |
duke@435 | 940 | InstructionPrinter ip; |
duke@435 | 941 | for (int i = 0; i < length(); i++) { |
duke@435 | 942 | BlockBegin* block = at(i); |
duke@435 | 943 | if (cfg_only) { |
duke@435 | 944 | ip.print_instr(block); tty->cr(); |
duke@435 | 945 | } else { |
duke@435 | 946 | block->print_block(ip, live_only); |
duke@435 | 947 | } |
duke@435 | 948 | } |
duke@435 | 949 | } |
duke@435 | 950 | #endif // PRODUCT |
duke@435 | 951 | |
duke@435 | 952 | |
duke@435 | 953 | // Implementation of BlockEnd |
duke@435 | 954 | |
duke@435 | 955 | void BlockEnd::set_begin(BlockBegin* begin) { |
duke@435 | 956 | BlockList* sux = NULL; |
duke@435 | 957 | if (begin != NULL) { |
duke@435 | 958 | sux = begin->successors(); |
duke@435 | 959 | } else if (_begin != NULL) { |
duke@435 | 960 | // copy our sux list |
duke@435 | 961 | BlockList* sux = new BlockList(_begin->number_of_sux()); |
duke@435 | 962 | for (int i = 0; i < _begin->number_of_sux(); i++) { |
duke@435 | 963 | sux->append(_begin->sux_at(i)); |
duke@435 | 964 | } |
duke@435 | 965 | } |
duke@435 | 966 | _sux = sux; |
duke@435 | 967 | _begin = begin; |
duke@435 | 968 | } |
duke@435 | 969 | |
duke@435 | 970 | |
duke@435 | 971 | void BlockEnd::substitute_sux(BlockBegin* old_sux, BlockBegin* new_sux) { |
duke@435 | 972 | substitute(*_sux, old_sux, new_sux); |
duke@435 | 973 | } |
duke@435 | 974 | |
duke@435 | 975 | |
duke@435 | 976 | void BlockEnd::other_values_do(void f(Value*)) { |
duke@435 | 977 | if (state_before() != NULL) state_before()->values_do(f); |
duke@435 | 978 | } |
duke@435 | 979 | |
duke@435 | 980 | |
duke@435 | 981 | // Implementation of Phi |
duke@435 | 982 | |
duke@435 | 983 | // Normal phi functions take their operands from the last instruction of the |
duke@435 | 984 | // predecessor. Special handling is needed for xhanlder entries because there |
duke@435 | 985 | // the state of arbitrary instructions are needed. |
duke@435 | 986 | |
duke@435 | 987 | Value Phi::operand_at(int i) const { |
duke@435 | 988 | ValueStack* state; |
duke@435 | 989 | if (_block->is_set(BlockBegin::exception_entry_flag)) { |
duke@435 | 990 | state = _block->exception_state_at(i); |
duke@435 | 991 | } else { |
duke@435 | 992 | state = _block->pred_at(i)->end()->state(); |
duke@435 | 993 | } |
duke@435 | 994 | assert(state != NULL, ""); |
duke@435 | 995 | |
duke@435 | 996 | if (is_local()) { |
duke@435 | 997 | return state->local_at(local_index()); |
duke@435 | 998 | } else { |
duke@435 | 999 | return state->stack_at(stack_index()); |
duke@435 | 1000 | } |
duke@435 | 1001 | } |
duke@435 | 1002 | |
duke@435 | 1003 | |
duke@435 | 1004 | int Phi::operand_count() const { |
duke@435 | 1005 | if (_block->is_set(BlockBegin::exception_entry_flag)) { |
duke@435 | 1006 | return _block->number_of_exception_states(); |
duke@435 | 1007 | } else { |
duke@435 | 1008 | return _block->number_of_preds(); |
duke@435 | 1009 | } |
duke@435 | 1010 | } |
duke@435 | 1011 | |
duke@435 | 1012 | |
duke@435 | 1013 | // Implementation of Throw |
duke@435 | 1014 | |
duke@435 | 1015 | void Throw::state_values_do(void f(Value*)) { |
duke@435 | 1016 | BlockEnd::state_values_do(f); |
duke@435 | 1017 | } |