1 /*
   2  * Copyright (c) 2005, 2018, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "c1/c1_Compilation.hpp"
  27 #include "c1/c1_Defs.hpp"
  28 #include "c1/c1_FrameMap.hpp"
  29 #include "c1/c1_Instruction.hpp"
  30 #include "c1/c1_LIRAssembler.hpp"
  31 #include "c1/c1_LIRGenerator.hpp"
  32 #include "c1/c1_ValueStack.hpp"
  33 #include "ci/ciArrayKlass.hpp"
  34 #include "ci/ciInstance.hpp"
  35 #include "ci/ciObjArray.hpp"
  36 #include "ci/ciUtilities.hpp"
  37 #include "ci/ciValueArrayKlass.hpp"
  38 #include "ci/ciValueKlass.hpp"
  39 #include "gc/shared/barrierSet.hpp"
  40 #include "gc/shared/c1/barrierSetC1.hpp"
  41 #include "runtime/arguments.hpp"
  42 #include "runtime/sharedRuntime.hpp"
  43 #include "runtime/stubRoutines.hpp"
  44 #include "runtime/vm_version.hpp"
  45 #include "utilities/bitMap.inline.hpp"
  46 #include "utilities/macros.hpp"
  47 
  48 #ifdef ASSERT
  49 #define __ gen()->lir(__FILE__, __LINE__)->
  50 #else
  51 #define __ gen()->lir()->
  52 #endif
  53 
  54 #ifndef PATCHED_ADDR
  55 #define PATCHED_ADDR  (max_jint)
  56 #endif
  57 
  58 void PhiResolverState::reset(int max_vregs) {
  59   // Initialize array sizes
  60   _virtual_operands.at_put_grow(max_vregs - 1, NULL, NULL);
  61   _virtual_operands.trunc_to(0);
  62   _other_operands.at_put_grow(max_vregs - 1, NULL, NULL);
  63   _other_operands.trunc_to(0);
  64   _vreg_table.at_put_grow(max_vregs - 1, NULL, NULL);
  65   _vreg_table.trunc_to(0);
  66 }
  67 
  68 
  69 
  70 //--------------------------------------------------------------
  71 // PhiResolver
  72 
  73 // Resolves cycles:
  74 //
  75 //  r1 := r2  becomes  temp := r1
  76 //  r2 := r1           r1 := r2
  77 //                     r2 := temp
  78 // and orders moves:
  79 //
  80 //  r2 := r3  becomes  r1 := r2
  81 //  r1 := r2           r2 := r3
  82 
  83 PhiResolver::PhiResolver(LIRGenerator* gen, int max_vregs)
  84  : _gen(gen)
  85  , _state(gen->resolver_state())
  86  , _temp(LIR_OprFact::illegalOpr)
  87 {
  88   // reinitialize the shared state arrays
  89   _state.reset(max_vregs);
  90 }
  91 
  92 
  93 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) {
  94   assert(src->is_valid(), "");
  95   assert(dest->is_valid(), "");
  96   __ move(src, dest);
  97 }
  98 
  99 
 100 void PhiResolver::move_temp_to(LIR_Opr dest) {
 101   assert(_temp->is_valid(), "");
 102   emit_move(_temp, dest);
 103   NOT_PRODUCT(_temp = LIR_OprFact::illegalOpr);
 104 }
 105 
 106 
 107 void PhiResolver::move_to_temp(LIR_Opr src) {
 108   assert(_temp->is_illegal(), "");
 109   _temp = _gen->new_register(src->type());
 110   emit_move(src, _temp);
 111 }
 112 
 113 
 114 // Traverse assignment graph in depth first order and generate moves in post order
 115 // ie. two assignments: b := c, a := b start with node c:
 116 // Call graph: move(NULL, c) -> move(c, b) -> move(b, a)
 117 // Generates moves in this order: move b to a and move c to b
 118 // ie. cycle a := b, b := a start with node a
 119 // Call graph: move(NULL, a) -> move(a, b) -> move(b, a)
 120 // Generates moves in this order: move b to temp, move a to b, move temp to a
 121 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) {
 122   if (!dest->visited()) {
 123     dest->set_visited();
 124     for (int i = dest->no_of_destinations()-1; i >= 0; i --) {
 125       move(dest, dest->destination_at(i));
 126     }
 127   } else if (!dest->start_node()) {
 128     // cylce in graph detected
 129     assert(_loop == NULL, "only one loop valid!");
 130     _loop = dest;
 131     move_to_temp(src->operand());
 132     return;
 133   } // else dest is a start node
 134 
 135   if (!dest->assigned()) {
 136     if (_loop == dest) {
 137       move_temp_to(dest->operand());
 138       dest->set_assigned();
 139     } else if (src != NULL) {
 140       emit_move(src->operand(), dest->operand());
 141       dest->set_assigned();
 142     }
 143   }
 144 }
 145 
 146 
 147 PhiResolver::~PhiResolver() {
 148   int i;
 149   // resolve any cycles in moves from and to virtual registers
 150   for (i = virtual_operands().length() - 1; i >= 0; i --) {
 151     ResolveNode* node = virtual_operands().at(i);
 152     if (!node->visited()) {
 153       _loop = NULL;
 154       move(NULL, node);
 155       node->set_start_node();
 156       assert(_temp->is_illegal(), "move_temp_to() call missing");
 157     }
 158   }
 159 
 160   // generate move for move from non virtual register to abitrary destination
 161   for (i = other_operands().length() - 1; i >= 0; i --) {
 162     ResolveNode* node = other_operands().at(i);
 163     for (int j = node->no_of_destinations() - 1; j >= 0; j --) {
 164       emit_move(node->operand(), node->destination_at(j)->operand());
 165     }
 166   }
 167 }
 168 
 169 
 170 ResolveNode* PhiResolver::create_node(LIR_Opr opr, bool source) {
 171   ResolveNode* node;
 172   if (opr->is_virtual()) {
 173     int vreg_num = opr->vreg_number();
 174     node = vreg_table().at_grow(vreg_num, NULL);
 175     assert(node == NULL || node->operand() == opr, "");
 176     if (node == NULL) {
 177       node = new ResolveNode(opr);
 178       vreg_table().at_put(vreg_num, node);
 179     }
 180     // Make sure that all virtual operands show up in the list when
 181     // they are used as the source of a move.
 182     if (source && !virtual_operands().contains(node)) {
 183       virtual_operands().append(node);
 184     }
 185   } else {
 186     assert(source, "");
 187     node = new ResolveNode(opr);
 188     other_operands().append(node);
 189   }
 190   return node;
 191 }
 192 
 193 
 194 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) {
 195   assert(dest->is_virtual(), "");
 196   // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr();
 197   assert(src->is_valid(), "");
 198   assert(dest->is_valid(), "");
 199   ResolveNode* source = source_node(src);
 200   source->append(destination_node(dest));
 201 }
 202 
 203 
 204 //--------------------------------------------------------------
 205 // LIRItem
 206 
 207 void LIRItem::set_result(LIR_Opr opr) {
 208   assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
 209   value()->set_operand(opr);
 210 
 211   if (opr->is_virtual()) {
 212     _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), NULL);
 213   }
 214 
 215   _result = opr;
 216 }
 217 
 218 void LIRItem::load_item() {
 219   if (result()->is_illegal()) {
 220     // update the items result
 221     _result = value()->operand();
 222   }
 223   if (!result()->is_register()) {
 224     LIR_Opr reg = _gen->new_register(value()->type());
 225     __ move(result(), reg);
 226     if (result()->is_constant()) {
 227       _result = reg;
 228     } else {
 229       set_result(reg);
 230     }
 231   }
 232 }
 233 
 234 
 235 void LIRItem::load_for_store(BasicType type) {
 236   if (_gen->can_store_as_constant(value(), type)) {
 237     _result = value()->operand();
 238     if (!_result->is_constant()) {
 239       _result = LIR_OprFact::value_type(value()->type());
 240     }
 241   } else if (type == T_BYTE || type == T_BOOLEAN) {
 242     load_byte_item();
 243   } else {
 244     load_item();
 245   }
 246 }
 247 
 248 void LIRItem::load_item_force(LIR_Opr reg) {
 249   LIR_Opr r = result();
 250   if (r != reg) {
 251 #if !defined(ARM) && !defined(E500V2)
 252     if (r->type() != reg->type()) {
 253       // moves between different types need an intervening spill slot
 254       r = _gen->force_to_spill(r, reg->type());
 255     }
 256 #endif
 257     __ move(r, reg);
 258     _result = reg;
 259   }
 260 }
 261 
 262 ciObject* LIRItem::get_jobject_constant() const {
 263   ObjectType* oc = type()->as_ObjectType();
 264   if (oc) {
 265     return oc->constant_value();
 266   }
 267   return NULL;
 268 }
 269 
 270 
 271 jint LIRItem::get_jint_constant() const {
 272   assert(is_constant() && value() != NULL, "");
 273   assert(type()->as_IntConstant() != NULL, "type check");
 274   return type()->as_IntConstant()->value();
 275 }
 276 
 277 
 278 jint LIRItem::get_address_constant() const {
 279   assert(is_constant() && value() != NULL, "");
 280   assert(type()->as_AddressConstant() != NULL, "type check");
 281   return type()->as_AddressConstant()->value();
 282 }
 283 
 284 
 285 jfloat LIRItem::get_jfloat_constant() const {
 286   assert(is_constant() && value() != NULL, "");
 287   assert(type()->as_FloatConstant() != NULL, "type check");
 288   return type()->as_FloatConstant()->value();
 289 }
 290 
 291 
 292 jdouble LIRItem::get_jdouble_constant() const {
 293   assert(is_constant() && value() != NULL, "");
 294   assert(type()->as_DoubleConstant() != NULL, "type check");
 295   return type()->as_DoubleConstant()->value();
 296 }
 297 
 298 
 299 jlong LIRItem::get_jlong_constant() const {
 300   assert(is_constant() && value() != NULL, "");
 301   assert(type()->as_LongConstant() != NULL, "type check");
 302   return type()->as_LongConstant()->value();
 303 }
 304 
 305 
 306 
 307 //--------------------------------------------------------------
 308 
 309 
 310 void LIRGenerator::block_do_prolog(BlockBegin* block) {
 311 #ifndef PRODUCT
 312   if (PrintIRWithLIR) {
 313     block->print();
 314   }
 315 #endif
 316 
 317   // set up the list of LIR instructions
 318   assert(block->lir() == NULL, "LIR list already computed for this block");
 319   _lir = new LIR_List(compilation(), block);
 320   block->set_lir(_lir);
 321 
 322   __ branch_destination(block->label());
 323 
 324   if (LIRTraceExecution &&
 325       Compilation::current()->hir()->start()->block_id() != block->block_id() &&
 326       !block->is_set(BlockBegin::exception_entry_flag)) {
 327     assert(block->lir()->instructions_list()->length() == 1, "should come right after br_dst");
 328     trace_block_entry(block);
 329   }
 330 }
 331 
 332 
 333 void LIRGenerator::block_do_epilog(BlockBegin* block) {
 334 #ifndef PRODUCT
 335   if (PrintIRWithLIR) {
 336     tty->cr();
 337   }
 338 #endif
 339 
 340   // LIR_Opr for unpinned constants shouldn't be referenced by other
 341   // blocks so clear them out after processing the block.
 342   for (int i = 0; i < _unpinned_constants.length(); i++) {
 343     _unpinned_constants.at(i)->clear_operand();
 344   }
 345   _unpinned_constants.trunc_to(0);
 346 
 347   // clear our any registers for other local constants
 348   _constants.trunc_to(0);
 349   _reg_for_constants.trunc_to(0);
 350 }
 351 
 352 
 353 void LIRGenerator::block_do(BlockBegin* block) {
 354   CHECK_BAILOUT();
 355 
 356   block_do_prolog(block);
 357   set_block(block);
 358 
 359   for (Instruction* instr = block; instr != NULL; instr = instr->next()) {
 360     if (instr->is_pinned()) do_root(instr);
 361   }
 362 
 363   set_block(NULL);
 364   block_do_epilog(block);
 365 }
 366 
 367 
 368 //-------------------------LIRGenerator-----------------------------
 369 
 370 // This is where the tree-walk starts; instr must be root;
 371 void LIRGenerator::do_root(Value instr) {
 372   CHECK_BAILOUT();
 373 
 374   InstructionMark im(compilation(), instr);
 375 
 376   assert(instr->is_pinned(), "use only with roots");
 377   assert(instr->subst() == instr, "shouldn't have missed substitution");
 378 
 379   instr->visit(this);
 380 
 381   assert(!instr->has_uses() || instr->operand()->is_valid() ||
 382          instr->as_Constant() != NULL || bailed_out(), "invalid item set");
 383 }
 384 
 385 
 386 // This is called for each node in tree; the walk stops if a root is reached
 387 void LIRGenerator::walk(Value instr) {
 388   InstructionMark im(compilation(), instr);
 389   //stop walk when encounter a root
 390   if ((instr->is_pinned() && instr->as_Phi() == NULL) || instr->operand()->is_valid()) {
 391     assert(instr->operand() != LIR_OprFact::illegalOpr || instr->as_Constant() != NULL, "this root has not yet been visited");
 392   } else {
 393     assert(instr->subst() == instr, "shouldn't have missed substitution");
 394     instr->visit(this);
 395     // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use");
 396   }
 397 }
 398 
 399 
 400 CodeEmitInfo* LIRGenerator::state_for(Instruction* x, ValueStack* state, bool ignore_xhandler) {
 401   assert(state != NULL, "state must be defined");
 402 
 403 #ifndef PRODUCT
 404   state->verify();
 405 #endif
 406 
 407   ValueStack* s = state;
 408   for_each_state(s) {
 409     if (s->kind() == ValueStack::EmptyExceptionState) {
 410       assert(s->stack_size() == 0 && s->locals_size() == 0 && (s->locks_size() == 0 || s->locks_size() == 1), "state must be empty");
 411       continue;
 412     }
 413 
 414     int index;
 415     Value value;
 416     for_each_stack_value(s, index, value) {
 417       assert(value->subst() == value, "missed substitution");
 418       if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
 419         walk(value);
 420         assert(value->operand()->is_valid(), "must be evaluated now");
 421       }
 422     }
 423 
 424     int bci = s->bci();
 425     IRScope* scope = s->scope();
 426     ciMethod* method = scope->method();
 427 
 428     MethodLivenessResult liveness = method->liveness_at_bci(bci);
 429     if (bci == SynchronizationEntryBCI) {
 430       if (x->as_ExceptionObject() || x->as_Throw()) {
 431         // all locals are dead on exit from the synthetic unlocker
 432         liveness.clear();
 433       } else {
 434         assert(x->as_MonitorEnter() || x->as_ProfileInvoke(), "only other cases are MonitorEnter and ProfileInvoke");
 435       }
 436     }
 437     if (!liveness.is_valid()) {
 438       // Degenerate or breakpointed method.
 439       bailout("Degenerate or breakpointed method");
 440     } else {
 441       assert((int)liveness.size() == s->locals_size(), "error in use of liveness");
 442       for_each_local_value(s, index, value) {
 443         assert(value->subst() == value, "missed substition");
 444         if (liveness.at(index) && !value->type()->is_illegal()) {
 445           if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
 446             walk(value);
 447             assert(value->operand()->is_valid(), "must be evaluated now");
 448           }
 449         } else {
 450           // NULL out this local so that linear scan can assume that all non-NULL values are live.
 451           s->invalidate_local(index);
 452         }
 453       }
 454     }
 455   }
 456 
 457   return new CodeEmitInfo(state, ignore_xhandler ? NULL : x->exception_handlers(), x->check_flag(Instruction::DeoptimizeOnException));
 458 }
 459 
 460 
 461 CodeEmitInfo* LIRGenerator::state_for(Instruction* x) {
 462   return state_for(x, x->exception_state());
 463 }
 464 
 465 
 466 void LIRGenerator::klass2reg_with_patching(LIR_Opr r, ciMetadata* obj, CodeEmitInfo* info, bool need_resolve) {
 467   /* C2 relies on constant pool entries being resolved (ciTypeFlow), so if TieredCompilation
 468    * is active and the class hasn't yet been resolved we need to emit a patch that resolves
 469    * the class. */
 470   if ((TieredCompilation && need_resolve) || !obj->is_loaded() || PatchALot) {
 471     assert(info != NULL, "info must be set if class is not loaded");
 472     __ klass2reg_patch(NULL, r, info);
 473   } else {
 474     // no patching needed
 475     __ metadata2reg(obj->constant_encoding(), r);
 476   }
 477 }
 478 
 479 
 480 void LIRGenerator::array_range_check(LIR_Opr array, LIR_Opr index,
 481                                     CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info) {
 482   CodeStub* stub = new RangeCheckStub(range_check_info, index, array);
 483   if (index->is_constant()) {
 484     cmp_mem_int(lir_cond_belowEqual, array, arrayOopDesc::length_offset_in_bytes(),
 485                 index->as_jint(), null_check_info);
 486     __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
 487   } else {
 488     cmp_reg_mem(lir_cond_aboveEqual, index, array,
 489                 arrayOopDesc::length_offset_in_bytes(), T_INT, null_check_info);
 490     __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
 491   }
 492 }
 493 
 494 
 495 void LIRGenerator::nio_range_check(LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info) {
 496   CodeStub* stub = new RangeCheckStub(info, index);
 497   if (index->is_constant()) {
 498     cmp_mem_int(lir_cond_belowEqual, buffer, java_nio_Buffer::limit_offset(), index->as_jint(), info);
 499     __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
 500   } else {
 501     cmp_reg_mem(lir_cond_aboveEqual, index, buffer,
 502                 java_nio_Buffer::limit_offset(), T_INT, info);
 503     __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
 504   }
 505   __ move(index, result);
 506 }
 507 
 508 
 509 
 510 void LIRGenerator::arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp_op, CodeEmitInfo* info) {
 511   LIR_Opr result_op = result;
 512   LIR_Opr left_op   = left;
 513   LIR_Opr right_op  = right;
 514 
 515   if (TwoOperandLIRForm && left_op != result_op) {
 516     assert(right_op != result_op, "malformed");
 517     __ move(left_op, result_op);
 518     left_op = result_op;
 519   }
 520 
 521   switch(code) {
 522     case Bytecodes::_dadd:
 523     case Bytecodes::_fadd:
 524     case Bytecodes::_ladd:
 525     case Bytecodes::_iadd:  __ add(left_op, right_op, result_op); break;
 526     case Bytecodes::_fmul:
 527     case Bytecodes::_lmul:  __ mul(left_op, right_op, result_op); break;
 528 
 529     case Bytecodes::_dmul:
 530       {
 531         if (is_strictfp) {
 532           __ mul_strictfp(left_op, right_op, result_op, tmp_op); break;
 533         } else {
 534           __ mul(left_op, right_op, result_op); break;
 535         }
 536       }
 537       break;
 538 
 539     case Bytecodes::_imul:
 540       {
 541         bool did_strength_reduce = false;
 542 
 543         if (right->is_constant()) {
 544           jint c = right->as_jint();
 545           if (c > 0 && is_power_of_2(c)) {
 546             // do not need tmp here
 547             __ shift_left(left_op, exact_log2(c), result_op);
 548             did_strength_reduce = true;
 549           } else {
 550             did_strength_reduce = strength_reduce_multiply(left_op, c, result_op, tmp_op);
 551           }
 552         }
 553         // we couldn't strength reduce so just emit the multiply
 554         if (!did_strength_reduce) {
 555           __ mul(left_op, right_op, result_op);
 556         }
 557       }
 558       break;
 559 
 560     case Bytecodes::_dsub:
 561     case Bytecodes::_fsub:
 562     case Bytecodes::_lsub:
 563     case Bytecodes::_isub: __ sub(left_op, right_op, result_op); break;
 564 
 565     case Bytecodes::_fdiv: __ div (left_op, right_op, result_op); break;
 566     // ldiv and lrem are implemented with a direct runtime call
 567 
 568     case Bytecodes::_ddiv:
 569       {
 570         if (is_strictfp) {
 571           __ div_strictfp (left_op, right_op, result_op, tmp_op); break;
 572         } else {
 573           __ div (left_op, right_op, result_op); break;
 574         }
 575       }
 576       break;
 577 
 578     case Bytecodes::_drem:
 579     case Bytecodes::_frem: __ rem (left_op, right_op, result_op); break;
 580 
 581     default: ShouldNotReachHere();
 582   }
 583 }
 584 
 585 
 586 void LIRGenerator::arithmetic_op_int(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp) {
 587   arithmetic_op(code, result, left, right, false, tmp);
 588 }
 589 
 590 
 591 void LIRGenerator::arithmetic_op_long(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info) {
 592   arithmetic_op(code, result, left, right, false, LIR_OprFact::illegalOpr, info);
 593 }
 594 
 595 
 596 void LIRGenerator::arithmetic_op_fpu(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp) {
 597   arithmetic_op(code, result, left, right, is_strictfp, tmp);
 598 }
 599 
 600 
 601 void LIRGenerator::shift_op(Bytecodes::Code code, LIR_Opr result_op, LIR_Opr value, LIR_Opr count, LIR_Opr tmp) {
 602 
 603   if (TwoOperandLIRForm && value != result_op
 604       // Only 32bit right shifts require two operand form on S390.
 605       S390_ONLY(&& (code == Bytecodes::_ishr || code == Bytecodes::_iushr))) {
 606     assert(count != result_op, "malformed");
 607     __ move(value, result_op);
 608     value = result_op;
 609   }
 610 
 611   assert(count->is_constant() || count->is_register(), "must be");
 612   switch(code) {
 613   case Bytecodes::_ishl:
 614   case Bytecodes::_lshl: __ shift_left(value, count, result_op, tmp); break;
 615   case Bytecodes::_ishr:
 616   case Bytecodes::_lshr: __ shift_right(value, count, result_op, tmp); break;
 617   case Bytecodes::_iushr:
 618   case Bytecodes::_lushr: __ unsigned_shift_right(value, count, result_op, tmp); break;
 619   default: ShouldNotReachHere();
 620   }
 621 }
 622 
 623 
 624 void LIRGenerator::logic_op (Bytecodes::Code code, LIR_Opr result_op, LIR_Opr left_op, LIR_Opr right_op) {
 625   if (TwoOperandLIRForm && left_op != result_op) {
 626     assert(right_op != result_op, "malformed");
 627     __ move(left_op, result_op);
 628     left_op = result_op;
 629   }
 630 
 631   switch(code) {
 632     case Bytecodes::_iand:
 633     case Bytecodes::_land:  __ logical_and(left_op, right_op, result_op); break;
 634 
 635     case Bytecodes::_ior:
 636     case Bytecodes::_lor:   __ logical_or(left_op, right_op, result_op);  break;
 637 
 638     case Bytecodes::_ixor:
 639     case Bytecodes::_lxor:  __ logical_xor(left_op, right_op, result_op); break;
 640 
 641     default: ShouldNotReachHere();
 642   }
 643 }
 644 
 645 
 646 void LIRGenerator::monitor_enter(LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info) {
 647   if (!GenerateSynchronizationCode) return;
 648   // for slow path, use debug info for state after successful locking
 649   CodeStub* slow_path = new MonitorEnterStub(object, lock, info);
 650   __ load_stack_address_monitor(monitor_no, lock);
 651   // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
 652   __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception);
 653 }
 654 
 655 
 656 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
 657   if (!GenerateSynchronizationCode) return;
 658   // setup registers
 659   LIR_Opr hdr = lock;
 660   lock = new_hdr;
 661   CodeStub* slow_path = new MonitorExitStub(lock, UseFastLocking, monitor_no);
 662   __ load_stack_address_monitor(monitor_no, lock);
 663   __ unlock_object(hdr, object, lock, scratch, slow_path);
 664 }
 665 
 666 #ifndef PRODUCT
 667 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) {
 668   if (PrintNotLoaded && !new_instance->klass()->is_loaded()) {
 669     tty->print_cr("   ###class not loaded at new bci %d", new_instance->printable_bci());
 670   } else if (PrintNotLoaded && (TieredCompilation && new_instance->is_unresolved())) {
 671     tty->print_cr("   ###class not resolved at new bci %d", new_instance->printable_bci());
 672   }
 673 }
 674 #endif
 675 
 676 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) {
 677   klass2reg_with_patching(klass_reg, klass, info, is_unresolved);
 678   // If klass is not loaded we do not know if the klass has finalizers:
 679   if (UseFastNewInstance && klass->is_loaded()
 680       && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
 681 
 682     Runtime1::StubID stub_id = klass->is_initialized() ? Runtime1::fast_new_instance_id : Runtime1::fast_new_instance_init_check_id;
 683 
 684     CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
 685 
 686     assert(klass->is_loaded(), "must be loaded");
 687     // allocate space for instance
 688     assert(klass->size_helper() >= 0, "illegal instance size");
 689     const int instance_size = align_object_size(klass->size_helper());
 690     __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
 691                        oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
 692   } else {
 693     CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, Runtime1::new_instance_id);
 694     __ branch(lir_cond_always, T_ILLEGAL, slow_path);
 695     __ branch_destination(slow_path->continuation());
 696   }
 697 }
 698 
 699 
 700 static bool is_constant_zero(Instruction* inst) {
 701   IntConstant* c = inst->type()->as_IntConstant();
 702   if (c) {
 703     return (c->value() == 0);
 704   }
 705   return false;
 706 }
 707 
 708 
 709 static bool positive_constant(Instruction* inst) {
 710   IntConstant* c = inst->type()->as_IntConstant();
 711   if (c) {
 712     return (c->value() >= 0);
 713   }
 714   return false;
 715 }
 716 
 717 
 718 static ciArrayKlass* as_array_klass(ciType* type) {
 719   if (type != NULL && type->is_array_klass() && type->is_loaded()) {
 720     return (ciArrayKlass*)type;
 721   } else {
 722     return NULL;
 723   }
 724 }
 725 
 726 static ciType* phi_declared_type(Phi* phi) {
 727   ciType* t = phi->operand_at(0)->declared_type();
 728   if (t == NULL) {
 729     return NULL;
 730   }
 731   for(int i = 1; i < phi->operand_count(); i++) {
 732     if (t != phi->operand_at(i)->declared_type()) {
 733       return NULL;
 734     }
 735   }
 736   return t;
 737 }
 738 
 739 void LIRGenerator::arraycopy_helper(Intrinsic* x, int* flagsp, ciArrayKlass** expected_typep) {
 740   Instruction* src     = x->argument_at(0);
 741   Instruction* src_pos = x->argument_at(1);
 742   Instruction* dst     = x->argument_at(2);
 743   Instruction* dst_pos = x->argument_at(3);
 744   Instruction* length  = x->argument_at(4);
 745 
 746   // first try to identify the likely type of the arrays involved
 747   ciArrayKlass* expected_type = NULL;
 748   bool is_exact = false, src_objarray = false, dst_objarray = false;
 749   {
 750     ciArrayKlass* src_exact_type    = as_array_klass(src->exact_type());
 751     ciArrayKlass* src_declared_type = as_array_klass(src->declared_type());
 752     Phi* phi;
 753     if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) {
 754       src_declared_type = as_array_klass(phi_declared_type(phi));
 755     }
 756     ciArrayKlass* dst_exact_type    = as_array_klass(dst->exact_type());
 757     ciArrayKlass* dst_declared_type = as_array_klass(dst->declared_type());
 758     if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) {
 759       dst_declared_type = as_array_klass(phi_declared_type(phi));
 760     }
 761 
 762     if (src_exact_type != NULL && src_exact_type == dst_exact_type) {
 763       // the types exactly match so the type is fully known
 764       is_exact = true;
 765       expected_type = src_exact_type;
 766     } else if (dst_exact_type != NULL && dst_exact_type->is_obj_array_klass()) {
 767       ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
 768       ciArrayKlass* src_type = NULL;
 769       if (src_exact_type != NULL && src_exact_type->is_obj_array_klass()) {
 770         src_type = (ciArrayKlass*) src_exact_type;
 771       } else if (src_declared_type != NULL && src_declared_type->is_obj_array_klass()) {
 772         src_type = (ciArrayKlass*) src_declared_type;
 773       }
 774       if (src_type != NULL) {
 775         if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
 776           is_exact = true;
 777           expected_type = dst_type;
 778         }
 779       }
 780     }
 781     // at least pass along a good guess
 782     if (expected_type == NULL) expected_type = dst_exact_type;
 783     if (expected_type == NULL) expected_type = src_declared_type;
 784     if (expected_type == NULL) expected_type = dst_declared_type;
 785 
 786     src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
 787     dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
 788   }
 789 
 790   // if a probable array type has been identified, figure out if any
 791   // of the required checks for a fast case can be elided.
 792   int flags = LIR_OpArrayCopy::all_flags;
 793 
 794   if (!src_objarray)
 795     flags &= ~LIR_OpArrayCopy::src_objarray;
 796   if (!dst_objarray)
 797     flags &= ~LIR_OpArrayCopy::dst_objarray;
 798 
 799   if (!x->arg_needs_null_check(0))
 800     flags &= ~LIR_OpArrayCopy::src_null_check;
 801   if (!x->arg_needs_null_check(2))
 802     flags &= ~LIR_OpArrayCopy::dst_null_check;
 803 
 804 
 805   if (expected_type != NULL) {
 806     Value length_limit = NULL;
 807 
 808     IfOp* ifop = length->as_IfOp();
 809     if (ifop != NULL) {
 810       // look for expressions like min(v, a.length) which ends up as
 811       //   x > y ? y : x  or  x >= y ? y : x
 812       if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
 813           ifop->x() == ifop->fval() &&
 814           ifop->y() == ifop->tval()) {
 815         length_limit = ifop->y();
 816       }
 817     }
 818 
 819     // try to skip null checks and range checks
 820     NewArray* src_array = src->as_NewArray();
 821     if (src_array != NULL) {
 822       flags &= ~LIR_OpArrayCopy::src_null_check;
 823       if (length_limit != NULL &&
 824           src_array->length() == length_limit &&
 825           is_constant_zero(src_pos)) {
 826         flags &= ~LIR_OpArrayCopy::src_range_check;
 827       }
 828     }
 829 
 830     NewArray* dst_array = dst->as_NewArray();
 831     if (dst_array != NULL) {
 832       flags &= ~LIR_OpArrayCopy::dst_null_check;
 833       if (length_limit != NULL &&
 834           dst_array->length() == length_limit &&
 835           is_constant_zero(dst_pos)) {
 836         flags &= ~LIR_OpArrayCopy::dst_range_check;
 837       }
 838     }
 839 
 840     // check from incoming constant values
 841     if (positive_constant(src_pos))
 842       flags &= ~LIR_OpArrayCopy::src_pos_positive_check;
 843     if (positive_constant(dst_pos))
 844       flags &= ~LIR_OpArrayCopy::dst_pos_positive_check;
 845     if (positive_constant(length))
 846       flags &= ~LIR_OpArrayCopy::length_positive_check;
 847 
 848     // see if the range check can be elided, which might also imply
 849     // that src or dst is non-null.
 850     ArrayLength* al = length->as_ArrayLength();
 851     if (al != NULL) {
 852       if (al->array() == src) {
 853         // it's the length of the source array
 854         flags &= ~LIR_OpArrayCopy::length_positive_check;
 855         flags &= ~LIR_OpArrayCopy::src_null_check;
 856         if (is_constant_zero(src_pos))
 857           flags &= ~LIR_OpArrayCopy::src_range_check;
 858       }
 859       if (al->array() == dst) {
 860         // it's the length of the destination array
 861         flags &= ~LIR_OpArrayCopy::length_positive_check;
 862         flags &= ~LIR_OpArrayCopy::dst_null_check;
 863         if (is_constant_zero(dst_pos))
 864           flags &= ~LIR_OpArrayCopy::dst_range_check;
 865       }
 866     }
 867     if (is_exact) {
 868       flags &= ~LIR_OpArrayCopy::type_check;
 869     }
 870   }
 871 
 872   IntConstant* src_int = src_pos->type()->as_IntConstant();
 873   IntConstant* dst_int = dst_pos->type()->as_IntConstant();
 874   if (src_int && dst_int) {
 875     int s_offs = src_int->value();
 876     int d_offs = dst_int->value();
 877     if (src_int->value() >= dst_int->value()) {
 878       flags &= ~LIR_OpArrayCopy::overlapping;
 879     }
 880     if (expected_type != NULL) {
 881       BasicType t = expected_type->element_type()->basic_type();
 882       int element_size = type2aelembytes(t);
 883       if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
 884           ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) {
 885         flags &= ~LIR_OpArrayCopy::unaligned;
 886       }
 887     }
 888   } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) {
 889     // src and dest positions are the same, or dst is zero so assume
 890     // nonoverlapping copy.
 891     flags &= ~LIR_OpArrayCopy::overlapping;
 892   }
 893 
 894   if (src == dst) {
 895     // moving within a single array so no type checks are needed
 896     if (flags & LIR_OpArrayCopy::type_check) {
 897       flags &= ~LIR_OpArrayCopy::type_check;
 898     }
 899   }
 900   *flagsp = flags;
 901   *expected_typep = (ciArrayKlass*)expected_type;
 902 }
 903 
 904 
 905 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) {
 906   assert(opr->is_register(), "why spill if item is not register?");
 907 
 908   if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) {
 909     LIR_Opr result = new_register(T_FLOAT);
 910     set_vreg_flag(result, must_start_in_memory);
 911     assert(opr->is_register(), "only a register can be spilled");
 912     assert(opr->value_type()->is_float(), "rounding only for floats available");
 913     __ roundfp(opr, LIR_OprFact::illegalOpr, result);
 914     return result;
 915   }
 916   return opr;
 917 }
 918 
 919 
 920 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) {
 921   assert(type2size[t] == type2size[value->type()],
 922          "size mismatch: t=%s, value->type()=%s", type2name(t), type2name(value->type()));
 923   if (!value->is_register()) {
 924     // force into a register
 925     LIR_Opr r = new_register(value->type());
 926     __ move(value, r);
 927     value = r;
 928   }
 929 
 930   // create a spill location
 931   LIR_Opr tmp = new_register(t);
 932   set_vreg_flag(tmp, LIRGenerator::must_start_in_memory);
 933 
 934   // move from register to spill
 935   __ move(value, tmp);
 936   return tmp;
 937 }
 938 
 939 void LIRGenerator::profile_branch(If* if_instr, If::Condition cond) {
 940   if (if_instr->should_profile()) {
 941     ciMethod* method = if_instr->profiled_method();
 942     assert(method != NULL, "method should be set if branch is profiled");
 943     ciMethodData* md = method->method_data_or_null();
 944     assert(md != NULL, "Sanity");
 945     ciProfileData* data = md->bci_to_data(if_instr->profiled_bci());
 946     assert(data != NULL, "must have profiling data");
 947     assert(data->is_BranchData(), "need BranchData for two-way branches");
 948     int taken_count_offset     = md->byte_offset_of_slot(data, BranchData::taken_offset());
 949     int not_taken_count_offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
 950     if (if_instr->is_swapped()) {
 951       int t = taken_count_offset;
 952       taken_count_offset = not_taken_count_offset;
 953       not_taken_count_offset = t;
 954     }
 955 
 956     LIR_Opr md_reg = new_register(T_METADATA);
 957     __ metadata2reg(md->constant_encoding(), md_reg);
 958 
 959     LIR_Opr data_offset_reg = new_pointer_register();
 960     __ cmove(lir_cond(cond),
 961              LIR_OprFact::intptrConst(taken_count_offset),
 962              LIR_OprFact::intptrConst(not_taken_count_offset),
 963              data_offset_reg, as_BasicType(if_instr->x()->type()));
 964 
 965     // MDO cells are intptr_t, so the data_reg width is arch-dependent.
 966     LIR_Opr data_reg = new_pointer_register();
 967     LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
 968     __ move(data_addr, data_reg);
 969     // Use leal instead of add to avoid destroying condition codes on x86
 970     LIR_Address* fake_incr_value = new LIR_Address(data_reg, DataLayout::counter_increment, T_INT);
 971     __ leal(LIR_OprFact::address(fake_incr_value), data_reg);
 972     __ move(data_reg, data_addr);
 973   }
 974 }
 975 
 976 // Phi technique:
 977 // This is about passing live values from one basic block to the other.
 978 // In code generated with Java it is rather rare that more than one
 979 // value is on the stack from one basic block to the other.
 980 // We optimize our technique for efficient passing of one value
 981 // (of type long, int, double..) but it can be extended.
 982 // When entering or leaving a basic block, all registers and all spill
 983 // slots are release and empty. We use the released registers
 984 // and spill slots to pass the live values from one block
 985 // to the other. The topmost value, i.e., the value on TOS of expression
 986 // stack is passed in registers. All other values are stored in spilling
 987 // area. Every Phi has an index which designates its spill slot
 988 // At exit of a basic block, we fill the register(s) and spill slots.
 989 // At entry of a basic block, the block_prolog sets up the content of phi nodes
 990 // and locks necessary registers and spilling slots.
 991 
 992 
 993 // move current value to referenced phi function
 994 void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val) {
 995   Phi* phi = sux_val->as_Phi();
 996   // cur_val can be null without phi being null in conjunction with inlining
 997   if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) {
 998     Phi* cur_phi = cur_val->as_Phi();
 999     if (cur_phi != NULL && cur_phi->is_illegal()) {
1000       // Phi and local would need to get invalidated
1001       // (which is unexpected for Linear Scan).
1002       // But this case is very rare so we simply bail out.
1003       bailout("propagation of illegal phi");
1004       return;
1005     }
1006     LIR_Opr operand = cur_val->operand();
1007     if (operand->is_illegal()) {
1008       assert(cur_val->as_Constant() != NULL || cur_val->as_Local() != NULL,
1009              "these can be produced lazily");
1010       operand = operand_for_instruction(cur_val);
1011     }
1012     resolver->move(operand, operand_for_instruction(phi));
1013   }
1014 }
1015 
1016 
1017 // Moves all stack values into their PHI position
1018 void LIRGenerator::move_to_phi(ValueStack* cur_state) {
1019   BlockBegin* bb = block();
1020   if (bb->number_of_sux() == 1) {
1021     BlockBegin* sux = bb->sux_at(0);
1022     assert(sux->number_of_preds() > 0, "invalid CFG");
1023 
1024     // a block with only one predecessor never has phi functions
1025     if (sux->number_of_preds() > 1) {
1026       int max_phis = cur_state->stack_size() + cur_state->locals_size();
1027       PhiResolver resolver(this, _virtual_register_number + max_phis * 2);
1028 
1029       ValueStack* sux_state = sux->state();
1030       Value sux_value;
1031       int index;
1032 
1033       assert(cur_state->scope() == sux_state->scope(), "not matching");
1034       assert(cur_state->locals_size() == sux_state->locals_size(), "not matching");
1035       assert(cur_state->stack_size() == sux_state->stack_size(), "not matching");
1036 
1037       for_each_stack_value(sux_state, index, sux_value) {
1038         move_to_phi(&resolver, cur_state->stack_at(index), sux_value);
1039       }
1040 
1041       for_each_local_value(sux_state, index, sux_value) {
1042         move_to_phi(&resolver, cur_state->local_at(index), sux_value);
1043       }
1044 
1045       assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal");
1046     }
1047   }
1048 }
1049 
1050 
1051 LIR_Opr LIRGenerator::new_register(BasicType type) {
1052   int vreg = _virtual_register_number;
1053   // add a little fudge factor for the bailout, since the bailout is
1054   // only checked periodically.  This gives a few extra registers to
1055   // hand out before we really run out, which helps us keep from
1056   // tripping over assertions.
1057   if (vreg + 20 >= LIR_OprDesc::vreg_max) {
1058     bailout("out of virtual registers");
1059     if (vreg + 2 >= LIR_OprDesc::vreg_max) {
1060       // wrap it around
1061       _virtual_register_number = LIR_OprDesc::vreg_base;
1062     }
1063   }
1064   _virtual_register_number += 1;
1065   return LIR_OprFact::virtual_register(vreg, type);
1066 }
1067 
1068 
1069 // Try to lock using register in hint
1070 LIR_Opr LIRGenerator::rlock(Value instr) {
1071   return new_register(instr->type());
1072 }
1073 
1074 
1075 // does an rlock and sets result
1076 LIR_Opr LIRGenerator::rlock_result(Value x) {
1077   LIR_Opr reg = rlock(x);
1078   set_result(x, reg);
1079   return reg;
1080 }
1081 
1082 
1083 // does an rlock and sets result
1084 LIR_Opr LIRGenerator::rlock_result(Value x, BasicType type) {
1085   LIR_Opr reg;
1086   switch (type) {
1087   case T_BYTE:
1088   case T_BOOLEAN:
1089     reg = rlock_byte(type);
1090     break;
1091   default:
1092     reg = rlock(x);
1093     break;
1094   }
1095 
1096   set_result(x, reg);
1097   return reg;
1098 }
1099 
1100 
1101 //---------------------------------------------------------------------
1102 ciObject* LIRGenerator::get_jobject_constant(Value value) {
1103   ObjectType* oc = value->type()->as_ObjectType();
1104   if (oc) {
1105     return oc->constant_value();
1106   }
1107   return NULL;
1108 }
1109 
1110 
1111 void LIRGenerator::do_ExceptionObject(ExceptionObject* x) {
1112   assert(block()->is_set(BlockBegin::exception_entry_flag), "ExceptionObject only allowed in exception handler block");
1113   assert(block()->next() == x, "ExceptionObject must be first instruction of block");
1114 
1115   // no moves are created for phi functions at the begin of exception
1116   // handlers, so assign operands manually here
1117   for_each_phi_fun(block(), phi,
1118                    operand_for_instruction(phi));
1119 
1120   LIR_Opr thread_reg = getThreadPointer();
1121   __ move_wide(new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT),
1122                exceptionOopOpr());
1123   __ move_wide(LIR_OprFact::oopConst(NULL),
1124                new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT));
1125   __ move_wide(LIR_OprFact::oopConst(NULL),
1126                new LIR_Address(thread_reg, in_bytes(JavaThread::exception_pc_offset()), T_OBJECT));
1127 
1128   LIR_Opr result = new_register(T_OBJECT);
1129   __ move(exceptionOopOpr(), result);
1130   set_result(x, result);
1131 }
1132 
1133 
1134 //----------------------------------------------------------------------
1135 //----------------------------------------------------------------------
1136 //----------------------------------------------------------------------
1137 //----------------------------------------------------------------------
1138 //                        visitor functions
1139 //----------------------------------------------------------------------
1140 //----------------------------------------------------------------------
1141 //----------------------------------------------------------------------
1142 //----------------------------------------------------------------------
1143 
1144 void LIRGenerator::do_Phi(Phi* x) {
1145   // phi functions are never visited directly
1146   ShouldNotReachHere();
1147 }
1148 
1149 
1150 // Code for a constant is generated lazily unless the constant is frequently used and can't be inlined.
1151 void LIRGenerator::do_Constant(Constant* x) {
1152   if (x->state_before() != NULL) {
1153     // Any constant with a ValueStack requires patching so emit the patch here
1154     LIR_Opr reg = rlock_result(x);
1155     CodeEmitInfo* info = state_for(x, x->state_before());
1156     __ oop2reg_patch(NULL, reg, info);
1157   } else if (x->use_count() > 1 && !can_inline_as_constant(x)) {
1158     if (!x->is_pinned()) {
1159       // unpinned constants are handled specially so that they can be
1160       // put into registers when they are used multiple times within a
1161       // block.  After the block completes their operand will be
1162       // cleared so that other blocks can't refer to that register.
1163       set_result(x, load_constant(x));
1164     } else {
1165       LIR_Opr res = x->operand();
1166       if (!res->is_valid()) {
1167         res = LIR_OprFact::value_type(x->type());
1168       }
1169       if (res->is_constant()) {
1170         LIR_Opr reg = rlock_result(x);
1171         __ move(res, reg);
1172       } else {
1173         set_result(x, res);
1174       }
1175     }
1176   } else {
1177     set_result(x, LIR_OprFact::value_type(x->type()));
1178   }
1179 }
1180 
1181 
1182 void LIRGenerator::do_Local(Local* x) {
1183   // operand_for_instruction has the side effect of setting the result
1184   // so there's no need to do it here.
1185   operand_for_instruction(x);
1186 }
1187 
1188 
1189 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) {
1190   Unimplemented();
1191 }
1192 
1193 
1194 void LIRGenerator::do_Return(Return* x) {
1195   if (compilation()->env()->dtrace_method_probes()) {
1196     BasicTypeList signature;
1197     signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT));    // thread
1198     signature.append(T_METADATA); // Method*
1199     LIR_OprList* args = new LIR_OprList();
1200     args->append(getThreadPointer());
1201     LIR_Opr meth = new_register(T_METADATA);
1202     __ metadata2reg(method()->constant_encoding(), meth);
1203     args->append(meth);
1204     call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), voidType, NULL);
1205   }
1206 
1207   if (x->type()->is_void()) {
1208     __ return_op(LIR_OprFact::illegalOpr);
1209   } else {
1210     LIR_Opr reg = result_register_for(x->type(), /*callee=*/true);
1211     LIRItem result(x->result(), this);
1212 
1213     result.load_item_force(reg);
1214     __ return_op(result.result());
1215   }
1216   set_no_result(x);
1217 }
1218 
1219 // Examble: ref.get()
1220 // Combination of LoadField and g1 pre-write barrier
1221 void LIRGenerator::do_Reference_get(Intrinsic* x) {
1222 
1223   const int referent_offset = java_lang_ref_Reference::referent_offset;
1224   guarantee(referent_offset > 0, "referent offset not initialized");
1225 
1226   assert(x->number_of_arguments() == 1, "wrong type");
1227 
1228   LIRItem reference(x->argument_at(0), this);
1229   reference.load_item();
1230 
1231   // need to perform the null check on the reference objecy
1232   CodeEmitInfo* info = NULL;
1233   if (x->needs_null_check()) {
1234     info = state_for(x);
1235   }
1236 
1237   LIR_Opr result = rlock_result(x, T_OBJECT);
1238   access_load_at(IN_HEAP | ON_WEAK_OOP_REF, T_OBJECT,
1239                  reference, LIR_OprFact::intConst(referent_offset), result);
1240 }
1241 
1242 // Example: clazz.isInstance(object)
1243 void LIRGenerator::do_isInstance(Intrinsic* x) {
1244   assert(x->number_of_arguments() == 2, "wrong type");
1245 
1246   // TODO could try to substitute this node with an equivalent InstanceOf
1247   // if clazz is known to be a constant Class. This will pick up newly found
1248   // constants after HIR construction. I'll leave this to a future change.
1249 
1250   // as a first cut, make a simple leaf call to runtime to stay platform independent.
1251   // could follow the aastore example in a future change.
1252 
1253   LIRItem clazz(x->argument_at(0), this);
1254   LIRItem object(x->argument_at(1), this);
1255   clazz.load_item();
1256   object.load_item();
1257   LIR_Opr result = rlock_result(x);
1258 
1259   // need to perform null check on clazz
1260   if (x->needs_null_check()) {
1261     CodeEmitInfo* info = state_for(x);
1262     __ null_check(clazz.result(), info);
1263   }
1264 
1265   LIR_Opr call_result = call_runtime(clazz.value(), object.value(),
1266                                      CAST_FROM_FN_PTR(address, Runtime1::is_instance_of),
1267                                      x->type(),
1268                                      NULL); // NULL CodeEmitInfo results in a leaf call
1269   __ move(call_result, result);
1270 }
1271 
1272 // Example: object.getClass ()
1273 void LIRGenerator::do_getClass(Intrinsic* x) {
1274   assert(x->number_of_arguments() == 1, "wrong type");
1275 
1276   LIRItem rcvr(x->argument_at(0), this);
1277   rcvr.load_item();
1278   LIR_Opr temp = new_register(T_METADATA);
1279   LIR_Opr result = rlock_result(x);
1280 
1281   // need to perform the null check on the rcvr
1282   CodeEmitInfo* info = NULL;
1283   if (x->needs_null_check()) {
1284     info = state_for(x);
1285   }
1286 
1287   // FIXME T_ADDRESS should actually be T_METADATA but it can't because the
1288   // meaning of these two is mixed up (see JDK-8026837).
1289   __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1290   __ move_wide(new LIR_Address(temp, in_bytes(Klass::java_mirror_offset()), T_ADDRESS), temp);
1291   // mirror = ((OopHandle)mirror)->resolve();
1292   access_load(IN_NATIVE, T_OBJECT,
1293               LIR_OprFact::address(new LIR_Address(temp, T_OBJECT)), result);
1294 }
1295 
1296 // java.lang.Class::isPrimitive()
1297 void LIRGenerator::do_isPrimitive(Intrinsic* x) {
1298   assert(x->number_of_arguments() == 1, "wrong type");
1299 
1300   LIRItem rcvr(x->argument_at(0), this);
1301   rcvr.load_item();
1302   LIR_Opr temp = new_register(T_METADATA);
1303   LIR_Opr result = rlock_result(x);
1304 
1305   CodeEmitInfo* info = NULL;
1306   if (x->needs_null_check()) {
1307     info = state_for(x);
1308   }
1309 
1310   __ move(new LIR_Address(rcvr.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1311   __ cmp(lir_cond_notEqual, temp, LIR_OprFact::intConst(0));
1312   __ cmove(lir_cond_notEqual, LIR_OprFact::intConst(0), LIR_OprFact::intConst(1), result, T_BOOLEAN);
1313 }
1314 
1315 
1316 // Example: Thread.currentThread()
1317 void LIRGenerator::do_currentThread(Intrinsic* x) {
1318   assert(x->number_of_arguments() == 0, "wrong type");
1319   LIR_Opr reg = rlock_result(x);
1320   __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg);
1321 }
1322 
1323 
1324 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) {
1325   assert(x->number_of_arguments() == 1, "wrong type");
1326   LIRItem receiver(x->argument_at(0), this);
1327 
1328   receiver.load_item();
1329   BasicTypeList signature;
1330   signature.append(T_OBJECT); // receiver
1331   LIR_OprList* args = new LIR_OprList();
1332   args->append(receiver.result());
1333   CodeEmitInfo* info = state_for(x, x->state());
1334   call_runtime(&signature, args,
1335                CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)),
1336                voidType, info);
1337 
1338   set_no_result(x);
1339 }
1340 
1341 
1342 //------------------------local access--------------------------------------
1343 
1344 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) {
1345   if (x->operand()->is_illegal()) {
1346     Constant* c = x->as_Constant();
1347     if (c != NULL) {
1348       x->set_operand(LIR_OprFact::value_type(c->type()));
1349     } else {
1350       assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
1351       // allocate a virtual register for this local or phi
1352       x->set_operand(rlock(x));
1353       _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL);
1354     }
1355   }
1356   return x->operand();
1357 }
1358 
1359 
1360 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) {
1361   if (opr->is_virtual()) {
1362     return instruction_for_vreg(opr->vreg_number());
1363   }
1364   return NULL;
1365 }
1366 
1367 
1368 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) {
1369   if (reg_num < _instruction_for_operand.length()) {
1370     return _instruction_for_operand.at(reg_num);
1371   }
1372   return NULL;
1373 }
1374 
1375 
1376 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) {
1377   if (_vreg_flags.size_in_bits() == 0) {
1378     BitMap2D temp(100, num_vreg_flags);
1379     _vreg_flags = temp;
1380   }
1381   _vreg_flags.at_put_grow(vreg_num, f, true);
1382 }
1383 
1384 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) {
1385   if (!_vreg_flags.is_valid_index(vreg_num, f)) {
1386     return false;
1387   }
1388   return _vreg_flags.at(vreg_num, f);
1389 }
1390 
1391 
1392 // Block local constant handling.  This code is useful for keeping
1393 // unpinned constants and constants which aren't exposed in the IR in
1394 // registers.  Unpinned Constant instructions have their operands
1395 // cleared when the block is finished so that other blocks can't end
1396 // up referring to their registers.
1397 
1398 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1399   assert(!x->is_pinned(), "only for unpinned constants");
1400   _unpinned_constants.append(x);
1401   return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1402 }
1403 
1404 
1405 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1406   BasicType t = c->type();
1407   for (int i = 0; i < _constants.length(); i++) {
1408     LIR_Const* other = _constants.at(i);
1409     if (t == other->type()) {
1410       switch (t) {
1411       case T_INT:
1412       case T_FLOAT:
1413         if (c->as_jint_bits() != other->as_jint_bits()) continue;
1414         break;
1415       case T_LONG:
1416       case T_DOUBLE:
1417         if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1418         if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1419         break;
1420       case T_OBJECT:
1421         if (c->as_jobject() != other->as_jobject()) continue;
1422         break;
1423       default:
1424         break;
1425       }
1426       return _reg_for_constants.at(i);
1427     }
1428   }
1429 
1430   LIR_Opr result = new_register(t);
1431   __ move((LIR_Opr)c, result);
1432   _constants.append(c);
1433   _reg_for_constants.append(result);
1434   return result;
1435 }
1436 
1437 //------------------------field access--------------------------------------
1438 
1439 void LIRGenerator::do_CompareAndSwap(Intrinsic* x, ValueType* type) {
1440   assert(x->number_of_arguments() == 4, "wrong type");
1441   LIRItem obj   (x->argument_at(0), this);  // object
1442   LIRItem offset(x->argument_at(1), this);  // offset of field
1443   LIRItem cmp   (x->argument_at(2), this);  // value to compare with field
1444   LIRItem val   (x->argument_at(3), this);  // replace field with val if matches cmp
1445   assert(obj.type()->tag() == objectTag, "invalid type");
1446 
1447   // In 64bit the type can be long, sparc doesn't have this assert
1448   // assert(offset.type()->tag() == intTag, "invalid type");
1449 
1450   assert(cmp.type()->tag() == type->tag(), "invalid type");
1451   assert(val.type()->tag() == type->tag(), "invalid type");
1452 
1453   LIR_Opr result = access_atomic_cmpxchg_at(IN_HEAP, as_BasicType(type),
1454                                             obj, offset, cmp, val);
1455   set_result(x, result);
1456 }
1457 
1458 // Comment copied form templateTable_i486.cpp
1459 // ----------------------------------------------------------------------------
1460 // Volatile variables demand their effects be made known to all CPU's in
1461 // order.  Store buffers on most chips allow reads & writes to reorder; the
1462 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1463 // memory barrier (i.e., it's not sufficient that the interpreter does not
1464 // reorder volatile references, the hardware also must not reorder them).
1465 //
1466 // According to the new Java Memory Model (JMM):
1467 // (1) All volatiles are serialized wrt to each other.
1468 // ALSO reads & writes act as aquire & release, so:
1469 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1470 // the read float up to before the read.  It's OK for non-volatile memory refs
1471 // that happen before the volatile read to float down below it.
1472 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1473 // that happen BEFORE the write float down to after the write.  It's OK for
1474 // non-volatile memory refs that happen after the volatile write to float up
1475 // before it.
1476 //
1477 // We only put in barriers around volatile refs (they are expensive), not
1478 // _between_ memory refs (that would require us to track the flavor of the
1479 // previous memory refs).  Requirements (2) and (3) require some barriers
1480 // before volatile stores and after volatile loads.  These nearly cover
1481 // requirement (1) but miss the volatile-store-volatile-load case.  This final
1482 // case is placed after volatile-stores although it could just as well go
1483 // before volatile-loads.
1484 
1485 
1486 void LIRGenerator::do_StoreField(StoreField* x) {
1487   bool needs_patching = x->needs_patching();
1488   bool is_volatile = x->field()->is_volatile();
1489   BasicType field_type = x->field_type();
1490 
1491   CodeEmitInfo* info = NULL;
1492   if (needs_patching) {
1493     assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1494     info = state_for(x, x->state_before());
1495   } else if (x->needs_null_check()) {
1496     NullCheck* nc = x->explicit_null_check();
1497     if (nc == NULL) {
1498       info = state_for(x);
1499     } else {
1500       info = state_for(nc);
1501     }
1502   }
1503 
1504   LIRItem object(x->obj(), this);
1505   LIRItem value(x->value(),  this);
1506 
1507   object.load_item();
1508 
1509   if (is_volatile || needs_patching) {
1510     // load item if field is volatile (fewer special cases for volatiles)
1511     // load item if field not initialized
1512     // load item if field not constant
1513     // because of code patching we cannot inline constants
1514     if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1515       value.load_byte_item();
1516     } else  {
1517       value.load_item();
1518     }
1519   } else {
1520     value.load_for_store(field_type);
1521   }
1522 
1523   set_no_result(x);
1524 
1525 #ifndef PRODUCT
1526   if (PrintNotLoaded && needs_patching) {
1527     tty->print_cr("   ###class not loaded at store_%s bci %d",
1528                   x->is_static() ?  "static" : "field", x->printable_bci());
1529   }
1530 #endif
1531 
1532   if (x->needs_null_check() &&
1533       (needs_patching ||
1534        MacroAssembler::needs_explicit_null_check(x->offset()))) {
1535     // Emit an explicit null check because the offset is too large.
1536     // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1537     // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1538     __ null_check(object.result(), new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1539   }
1540 
1541   DecoratorSet decorators = IN_HEAP;
1542   if (is_volatile) {
1543     decorators |= MO_SEQ_CST;
1544   }
1545   if (needs_patching) {
1546     decorators |= C1_NEEDS_PATCHING;
1547   }
1548 
1549   access_store_at(decorators, field_type, object, LIR_OprFact::intConst(x->offset()),
1550                   value.result(), info != NULL ? new CodeEmitInfo(info) : NULL, info);
1551 }
1552 
1553 // FIXME -- I can't find any other way to pass an address to access_load_at().
1554 class TempResolvedAddress: public Instruction {
1555  public:
1556   TempResolvedAddress(ValueType* type, LIR_Opr addr) : Instruction(type) {
1557     set_operand(addr);
1558   }
1559   virtual void input_values_do(ValueVisitor*) {}
1560   virtual void visit(InstructionVisitor* v)   {}
1561   virtual const char* name() const  { return "TempResolvedAddress"; }
1562 };
1563 
1564 void LIRGenerator::access_flattened_array(bool is_load, LIRItem& array, LIRItem& index, LIRItem& obj_item) {
1565   // Find the starting address of the source (inside the array)
1566   ciType* array_type = array.value()->declared_type();
1567   ciValueArrayKlass* value_array_klass = array_type->as_value_array_klass();
1568   assert(value_array_klass->is_loaded(), "must be");
1569 
1570   ciValueKlass* elem_klass = value_array_klass->element_klass()->as_value_klass();
1571   int array_header_size = value_array_klass->array_header_in_bytes();
1572   int shift = value_array_klass->log2_element_size();
1573 
1574 #ifndef _LP64
1575   LIR_Opr index_op = new_register(T_INT);
1576   // FIXME -- on 32-bit, the shift below can overflow, so we need to check that
1577   // the top (shift+1) bits of index_op must be zero, or
1578   // else throw ArrayIndexOutOfBoundsException
1579   if (index.result()->is_constant()) {
1580     jint const_index = index.result()->as_jint();
1581     __ move(LIR_OprFact::intConst(const_index << shift), index_op);
1582   } else {
1583     __ shift_left(index_op, shift, index.result());
1584   }
1585 #else
1586   LIR_Opr index_op = new_register(T_LONG);
1587   if (index.result()->is_constant()) {
1588     jint const_index = index.result()->as_jint();
1589     __ move(LIR_OprFact::longConst(const_index << shift), index_op);
1590   } else {
1591     __ convert(Bytecodes::_i2l, index.result(), index_op);
1592     // Need to shift manually, as LIR_Address can scale only up to 3.
1593     __ shift_left(index_op, shift, index_op);
1594   }
1595 #endif
1596 
1597   LIR_Opr elm_op = new_pointer_register();
1598   LIR_Address* elm_address = new LIR_Address(array.result(), index_op, array_header_size, T_ADDRESS);
1599   __ leal(LIR_OprFact::address(elm_address), elm_op);
1600 
1601   for (int i = 0; i < elem_klass->nof_nonstatic_fields(); i++) {
1602     ciField* inner_field = elem_klass->nonstatic_field_at(i);
1603     assert(!inner_field->is_flattened(), "flattened fields must have been expanded");
1604     int obj_offset = inner_field->offset();
1605     int elm_offset = obj_offset - elem_klass->first_field_offset(); // object header is not stored in array.
1606 
1607     BasicType field_type = inner_field->type()->basic_type();
1608     switch (field_type) {
1609     case T_BYTE:
1610     case T_BOOLEAN:
1611     case T_SHORT:
1612     case T_CHAR:
1613      field_type = T_INT;
1614       break;
1615     default:
1616       break;
1617     }
1618 
1619     LIR_Opr temp = new_register(field_type);
1620     TempResolvedAddress* elm_resolved_addr = new TempResolvedAddress(as_ValueType(field_type), elm_op);
1621     LIRItem elm_item(elm_resolved_addr, this);
1622 
1623     DecoratorSet decorators = IN_HEAP;
1624     if (is_load) {
1625       access_load_at(decorators, field_type,
1626                      elm_item, LIR_OprFact::intConst(elm_offset), temp,
1627                      NULL, NULL);
1628       access_store_at(decorators, field_type,
1629                       obj_item, LIR_OprFact::intConst(obj_offset), temp,
1630                       NULL, NULL);
1631     } else {
1632     access_load_at(decorators, field_type,
1633                    obj_item, LIR_OprFact::intConst(obj_offset), temp,
1634                    NULL, NULL);
1635     access_store_at(decorators, field_type,
1636                     elm_item, LIR_OprFact::intConst(elm_offset), temp,
1637                     NULL, NULL);
1638     }
1639   }
1640 }
1641 
1642 void LIRGenerator::maybe_deopt_value_array_access(LIRItem& array, CodeEmitInfo* null_check_info, CodeEmitInfo* deopt_info) {
1643   LIR_Opr klass = new_register(T_METADATA);
1644   __ move(new LIR_Address(array.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), klass, null_check_info);
1645   LIR_Opr layout = new_register(T_INT);
1646   __ move(new LIR_Address(klass, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
1647   __ shift_right(layout, Klass::_lh_array_tag_shift, layout);
1648   __ cmp(lir_cond_equal, layout, LIR_OprFact::intConst(Klass::_lh_array_tag_vt_value));
1649 
1650   CodeStub* stub = new DeoptimizeStub(deopt_info, Deoptimization::Reason_unloaded, Deoptimization::Action_reinterpret);
1651   __ branch(lir_cond_equal, T_ILLEGAL, stub);
1652 }
1653 
1654 void LIRGenerator::do_StoreIndexed(StoreIndexed* x) {
1655   assert(x->is_pinned(),"");
1656   bool is_flattened = x->array()->is_flattened_array();
1657   bool needs_range_check = x->compute_needs_range_check();
1658   bool use_length = x->length() != NULL;
1659   bool obj_store = x->elt_type() == T_ARRAY || x->elt_type() == T_OBJECT;
1660   bool needs_store_check = obj_store && !is_flattened &&
1661                                         (x->value()->as_Constant() == NULL ||
1662                                          !get_jobject_constant(x->value())->is_null_object() ||
1663                                          x->should_profile());
1664 
1665   LIRItem array(x->array(), this);
1666   LIRItem index(x->index(), this);
1667   LIRItem value(x->value(), this);
1668   LIRItem length(this);
1669 
1670   array.load_item();
1671   index.load_nonconstant();
1672 
1673   if (use_length && needs_range_check) {
1674     length.set_instruction(x->length());
1675     length.load_item();
1676 
1677   }
1678 
1679   if (needs_store_check || x->check_boolean() || is_flattened) {
1680     value.load_item();
1681   } else {
1682     value.load_for_store(x->elt_type());
1683   }
1684 
1685   set_no_result(x);
1686 
1687   // the CodeEmitInfo must be duplicated for each different
1688   // LIR-instruction because spilling can occur anywhere between two
1689   // instructions and so the debug information must be different
1690   CodeEmitInfo* range_check_info = state_for(x);
1691   CodeEmitInfo* null_check_info = NULL;
1692   if (x->needs_null_check()) {
1693     null_check_info = new CodeEmitInfo(range_check_info);
1694   }
1695 
1696   if (GenerateRangeChecks && needs_range_check) {
1697     if (use_length) {
1698       __ cmp(lir_cond_belowEqual, length.result(), index.result());
1699       __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
1700     } else {
1701       array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1702       // range_check also does the null check
1703       null_check_info = NULL;
1704     }
1705   }
1706 
1707   if (GenerateArrayStoreCheck && needs_store_check) {
1708     CodeEmitInfo* store_check_info = new CodeEmitInfo(range_check_info);
1709     array_store_check(value.result(), array.result(), store_check_info, x->profiled_method(), x->profiled_bci());
1710   }
1711 
1712   if (is_flattened) {
1713     if (x->array()->declared_type()->is_loaded()) {
1714       index.load_item();
1715       access_flattened_array(false, array, index, value);
1716       return;
1717     } else {
1718       // If the array is indeed flattened, deopt. Otherwise access it as a normal object array.
1719       CodeEmitInfo* deopt_info = state_for(x, x->state_before());
1720       maybe_deopt_value_array_access(array, null_check_info, deopt_info);
1721     }
1722   }
1723 
1724   DecoratorSet decorators = IN_HEAP | IS_ARRAY;
1725   if (x->check_boolean()) {
1726     decorators |= C1_MASK_BOOLEAN;
1727   }
1728 
1729   access_store_at(decorators, x->elt_type(), array, index.result(), value.result(),
1730                   NULL, null_check_info);
1731 }
1732 
1733 void LIRGenerator::access_load_at(DecoratorSet decorators, BasicType type,
1734                                   LIRItem& base, LIR_Opr offset, LIR_Opr result,
1735                                   CodeEmitInfo* patch_info, CodeEmitInfo* load_emit_info) {
1736   decorators |= ACCESS_READ;
1737   LIRAccess access(this, decorators, base, offset, type, patch_info, load_emit_info);
1738   if (access.is_raw()) {
1739     _barrier_set->BarrierSetC1::load_at(access, result);
1740   } else {
1741     _barrier_set->load_at(access, result);
1742   }
1743 }
1744 
1745 void LIRGenerator::access_load(DecoratorSet decorators, BasicType type,
1746                                LIR_Opr addr, LIR_Opr result) {
1747   decorators |= ACCESS_READ;
1748   LIRAccess access(this, decorators, LIR_OprFact::illegalOpr, LIR_OprFact::illegalOpr, type);
1749   access.set_resolved_addr(addr);
1750   if (access.is_raw()) {
1751     _barrier_set->BarrierSetC1::load(access, result);
1752   } else {
1753     _barrier_set->load(access, result);
1754   }
1755 }
1756 
1757 void LIRGenerator::access_store_at(DecoratorSet decorators, BasicType type,
1758                                    LIRItem& base, LIR_Opr offset, LIR_Opr value,
1759                                    CodeEmitInfo* patch_info, CodeEmitInfo* store_emit_info) {
1760   decorators |= ACCESS_WRITE;
1761   LIRAccess access(this, decorators, base, offset, type, patch_info, store_emit_info);
1762   if (access.is_raw()) {
1763     _barrier_set->BarrierSetC1::store_at(access, value);
1764   } else {
1765     _barrier_set->store_at(access, value);
1766   }
1767 }
1768 
1769 LIR_Opr LIRGenerator::access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type,
1770                                                LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value) {
1771   decorators |= ACCESS_READ;
1772   decorators |= ACCESS_WRITE;
1773   // Atomic operations are SEQ_CST by default
1774   decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1775   LIRAccess access(this, decorators, base, offset, type);
1776   if (access.is_raw()) {
1777     return _barrier_set->BarrierSetC1::atomic_cmpxchg_at(access, cmp_value, new_value);
1778   } else {
1779     return _barrier_set->atomic_cmpxchg_at(access, cmp_value, new_value);
1780   }
1781 }
1782 
1783 LIR_Opr LIRGenerator::access_atomic_xchg_at(DecoratorSet decorators, BasicType type,
1784                                             LIRItem& base, LIRItem& offset, LIRItem& value) {
1785   decorators |= ACCESS_READ;
1786   decorators |= ACCESS_WRITE;
1787   // Atomic operations are SEQ_CST by default
1788   decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1789   LIRAccess access(this, decorators, base, offset, type);
1790   if (access.is_raw()) {
1791     return _barrier_set->BarrierSetC1::atomic_xchg_at(access, value);
1792   } else {
1793     return _barrier_set->atomic_xchg_at(access, value);
1794   }
1795 }
1796 
1797 LIR_Opr LIRGenerator::access_atomic_add_at(DecoratorSet decorators, BasicType type,
1798                                            LIRItem& base, LIRItem& offset, LIRItem& value) {
1799   decorators |= ACCESS_READ;
1800   decorators |= ACCESS_WRITE;
1801   // Atomic operations are SEQ_CST by default
1802   decorators |= ((decorators & MO_DECORATOR_MASK) != 0) ? MO_SEQ_CST : 0;
1803   LIRAccess access(this, decorators, base, offset, type);
1804   if (access.is_raw()) {
1805     return _barrier_set->BarrierSetC1::atomic_add_at(access, value);
1806   } else {
1807     return _barrier_set->atomic_add_at(access, value);
1808   }
1809 }
1810 
1811 LIR_Opr LIRGenerator::access_resolve(DecoratorSet decorators, LIR_Opr obj) {
1812   // Use stronger ACCESS_WRITE|ACCESS_READ by default.
1813   if ((decorators & (ACCESS_READ | ACCESS_WRITE)) == 0) {
1814     decorators |= ACCESS_READ | ACCESS_WRITE;
1815   }
1816 
1817   return _barrier_set->resolve(this, decorators, obj);
1818 }
1819 
1820 void LIRGenerator::do_LoadField(LoadField* x) {
1821   bool needs_patching = x->needs_patching();
1822   bool is_volatile = x->field()->is_volatile();
1823   BasicType field_type = x->field_type();
1824 
1825   CodeEmitInfo* info = NULL;
1826   if (needs_patching) {
1827     assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1828     info = state_for(x, x->state_before());
1829   } else if (x->needs_null_check()) {
1830     NullCheck* nc = x->explicit_null_check();
1831     if (nc == NULL) {
1832       info = state_for(x);
1833     } else {
1834       info = state_for(nc);
1835     }
1836   }
1837 
1838   LIRItem object(x->obj(), this);
1839 
1840   object.load_item();
1841 
1842 #ifndef PRODUCT
1843   if (PrintNotLoaded && needs_patching) {
1844     tty->print_cr("   ###class not loaded at load_%s bci %d",
1845                   x->is_static() ?  "static" : "field", x->printable_bci());
1846   }
1847 #endif
1848 
1849   bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception();
1850   if (x->needs_null_check() &&
1851       (needs_patching ||
1852        MacroAssembler::needs_explicit_null_check(x->offset()) ||
1853        stress_deopt)) {
1854     LIR_Opr obj = object.result();
1855     if (stress_deopt) {
1856       obj = new_register(T_OBJECT);
1857       __ move(LIR_OprFact::oopConst(NULL), obj);
1858     }
1859     // Emit an explicit null check because the offset is too large.
1860     // If the class is not loaded and the object is NULL, we need to deoptimize to throw a
1861     // NoClassDefFoundError in the interpreter instead of an implicit NPE from compiled code.
1862     __ null_check(obj, new CodeEmitInfo(info), /* deoptimize */ needs_patching);
1863   }
1864 
1865   DecoratorSet decorators = IN_HEAP;
1866   if (is_volatile) {
1867     decorators |= MO_SEQ_CST;
1868   }
1869   if (needs_patching) {
1870     decorators |= C1_NEEDS_PATCHING;
1871   }
1872 
1873   LIR_Opr result = rlock_result(x, field_type);
1874   access_load_at(decorators, field_type,
1875                  object, LIR_OprFact::intConst(x->offset()), result,
1876                  info ? new CodeEmitInfo(info) : NULL, info);
1877 }
1878 
1879 
1880 //------------------------java.nio.Buffer.checkIndex------------------------
1881 
1882 // int java.nio.Buffer.checkIndex(int)
1883 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
1884   // NOTE: by the time we are in checkIndex() we are guaranteed that
1885   // the buffer is non-null (because checkIndex is package-private and
1886   // only called from within other methods in the buffer).
1887   assert(x->number_of_arguments() == 2, "wrong type");
1888   LIRItem buf  (x->argument_at(0), this);
1889   LIRItem index(x->argument_at(1), this);
1890   buf.load_item();
1891   index.load_item();
1892 
1893   LIR_Opr result = rlock_result(x);
1894   if (GenerateRangeChecks) {
1895     CodeEmitInfo* info = state_for(x);
1896     CodeStub* stub = new RangeCheckStub(info, index.result());
1897     LIR_Opr buf_obj = access_resolve(IS_NOT_NULL | ACCESS_READ, buf.result());
1898     if (index.result()->is_constant()) {
1899       cmp_mem_int(lir_cond_belowEqual, buf_obj, java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
1900       __ branch(lir_cond_belowEqual, T_INT, stub);
1901     } else {
1902       cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf_obj,
1903                   java_nio_Buffer::limit_offset(), T_INT, info);
1904       __ branch(lir_cond_aboveEqual, T_INT, stub);
1905     }
1906     __ move(index.result(), result);
1907   } else {
1908     // Just load the index into the result register
1909     __ move(index.result(), result);
1910   }
1911 }
1912 
1913 
1914 //------------------------array access--------------------------------------
1915 
1916 
1917 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
1918   LIRItem array(x->array(), this);
1919   array.load_item();
1920   LIR_Opr reg = rlock_result(x);
1921 
1922   CodeEmitInfo* info = NULL;
1923   if (x->needs_null_check()) {
1924     NullCheck* nc = x->explicit_null_check();
1925     if (nc == NULL) {
1926       info = state_for(x);
1927     } else {
1928       info = state_for(nc);
1929     }
1930     if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) {
1931       LIR_Opr obj = new_register(T_OBJECT);
1932       __ move(LIR_OprFact::oopConst(NULL), obj);
1933       __ null_check(obj, new CodeEmitInfo(info));
1934     }
1935   }
1936   __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
1937 }
1938 
1939 
1940 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
1941   bool use_length = x->length() != NULL;
1942   LIRItem array(x->array(), this);
1943   LIRItem index(x->index(), this);
1944   LIRItem length(this);
1945   bool needs_range_check = x->compute_needs_range_check();
1946 
1947   if (use_length && needs_range_check) {
1948     length.set_instruction(x->length());
1949     length.load_item();
1950   }
1951 
1952   array.load_item();
1953   if (index.is_constant() && can_inline_as_constant(x->index())) {
1954     // let it be a constant
1955     index.dont_load_item();
1956   } else {
1957     index.load_item();
1958   }
1959 
1960   CodeEmitInfo* range_check_info = state_for(x);
1961   CodeEmitInfo* null_check_info = NULL;
1962   if (x->needs_null_check()) {
1963     NullCheck* nc = x->explicit_null_check();
1964     if (nc != NULL) {
1965       null_check_info = state_for(nc);
1966     } else {
1967       null_check_info = range_check_info;
1968     }
1969     if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) {
1970       LIR_Opr obj = new_register(T_OBJECT);
1971       __ move(LIR_OprFact::oopConst(NULL), obj);
1972       __ null_check(obj, new CodeEmitInfo(null_check_info));
1973     }
1974   }
1975 
1976   if (GenerateRangeChecks && needs_range_check) {
1977     if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
1978       __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result(), array.result()));
1979     } else if (use_length) {
1980       // TODO: use a (modified) version of array_range_check that does not require a
1981       //       constant length to be loaded to a register
1982       __ cmp(lir_cond_belowEqual, length.result(), index.result());
1983       __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result(), array.result()));
1984     } else {
1985       array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1986       // The range check performs the null check, so clear it out for the load
1987       null_check_info = NULL;
1988     }
1989   }
1990 
1991   if (x->array()->is_flattened_array()) {
1992     if (x->array()->declared_type()->is_loaded()) {
1993       // Find the destination address (of the NewValueTypeInstance)
1994       LIR_Opr obj = x->vt()->operand();
1995       LIRItem obj_item(x->vt(), this);
1996 
1997       access_flattened_array(true, array, index, obj_item);
1998       set_no_result(x);
1999       return;
2000     } else {
2001       // If the array is indeed flattened, deopt. Otherwise access it as a normal object array.
2002       CodeEmitInfo* deopt_info = state_for(x, x->state_before());
2003       maybe_deopt_value_array_access(array, null_check_info, deopt_info);
2004     }
2005   }
2006   DecoratorSet decorators = IN_HEAP | IS_ARRAY;
2007   LIR_Opr result = rlock_result(x, x->elt_type());
2008   access_load_at(decorators, x->elt_type(),
2009                  array, index.result(), result,
2010                  NULL, null_check_info);
2011 }
2012 
2013 
2014 void LIRGenerator::do_NullCheck(NullCheck* x) {
2015   if (x->can_trap()) {
2016     LIRItem value(x->obj(), this);
2017     value.load_item();
2018     CodeEmitInfo* info = state_for(x);
2019     __ null_check(value.result(), info);
2020   }
2021 }
2022 
2023 
2024 void LIRGenerator::do_TypeCast(TypeCast* x) {
2025   LIRItem value(x->obj(), this);
2026   value.load_item();
2027   // the result is the same as from the node we are casting
2028   set_result(x, value.result());
2029 }
2030 
2031 
2032 void LIRGenerator::do_Throw(Throw* x) {
2033   LIRItem exception(x->exception(), this);
2034   exception.load_item();
2035   set_no_result(x);
2036   LIR_Opr exception_opr = exception.result();
2037   CodeEmitInfo* info = state_for(x, x->state());
2038 
2039 #ifndef PRODUCT
2040   if (PrintC1Statistics) {
2041     increment_counter(Runtime1::throw_count_address(), T_INT);
2042   }
2043 #endif
2044 
2045   // check if the instruction has an xhandler in any of the nested scopes
2046   bool unwind = false;
2047   if (info->exception_handlers()->length() == 0) {
2048     // this throw is not inside an xhandler
2049     unwind = true;
2050   } else {
2051     // get some idea of the throw type
2052     bool type_is_exact = true;
2053     ciType* throw_type = x->exception()->exact_type();
2054     if (throw_type == NULL) {
2055       type_is_exact = false;
2056       throw_type = x->exception()->declared_type();
2057     }
2058     if (throw_type != NULL && throw_type->is_instance_klass()) {
2059       ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
2060       unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
2061     }
2062   }
2063 
2064   // do null check before moving exception oop into fixed register
2065   // to avoid a fixed interval with an oop during the null check.
2066   // Use a copy of the CodeEmitInfo because debug information is
2067   // different for null_check and throw.
2068   if (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL) {
2069     // if the exception object wasn't created using new then it might be null.
2070     __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
2071   }
2072 
2073   if (compilation()->env()->jvmti_can_post_on_exceptions()) {
2074     // we need to go through the exception lookup path to get JVMTI
2075     // notification done
2076     unwind = false;
2077   }
2078 
2079   // move exception oop into fixed register
2080   __ move(exception_opr, exceptionOopOpr());
2081 
2082   if (unwind) {
2083     __ unwind_exception(exceptionOopOpr());
2084   } else {
2085     __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
2086   }
2087 }
2088 
2089 
2090 void LIRGenerator::do_RoundFP(RoundFP* x) {
2091   LIRItem input(x->input(), this);
2092   input.load_item();
2093   LIR_Opr input_opr = input.result();
2094   assert(input_opr->is_register(), "why round if value is not in a register?");
2095   assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
2096   if (input_opr->is_single_fpu()) {
2097     set_result(x, round_item(input_opr)); // This code path not currently taken
2098   } else {
2099     LIR_Opr result = new_register(T_DOUBLE);
2100     set_vreg_flag(result, must_start_in_memory);
2101     __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
2102     set_result(x, result);
2103   }
2104 }
2105 
2106 // Here UnsafeGetRaw may have x->base() and x->index() be int or long
2107 // on both 64 and 32 bits. Expecting x->base() to be always long on 64bit.
2108 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
2109   LIRItem base(x->base(), this);
2110   LIRItem idx(this);
2111 
2112   base.load_item();
2113   if (x->has_index()) {
2114     idx.set_instruction(x->index());
2115     idx.load_nonconstant();
2116   }
2117 
2118   LIR_Opr reg = rlock_result(x, x->basic_type());
2119 
2120   int   log2_scale = 0;
2121   if (x->has_index()) {
2122     log2_scale = x->log2_scale();
2123   }
2124 
2125   assert(!x->has_index() || idx.value() == x->index(), "should match");
2126 
2127   LIR_Opr base_op = base.result();
2128   LIR_Opr index_op = idx.result();
2129 #ifndef _LP64
2130   if (base_op->type() == T_LONG) {
2131     base_op = new_register(T_INT);
2132     __ convert(Bytecodes::_l2i, base.result(), base_op);
2133   }
2134   if (x->has_index()) {
2135     if (index_op->type() == T_LONG) {
2136       LIR_Opr long_index_op = index_op;
2137       if (index_op->is_constant()) {
2138         long_index_op = new_register(T_LONG);
2139         __ move(index_op, long_index_op);
2140       }
2141       index_op = new_register(T_INT);
2142       __ convert(Bytecodes::_l2i, long_index_op, index_op);
2143     } else {
2144       assert(x->index()->type()->tag() == intTag, "must be");
2145     }
2146   }
2147   // At this point base and index should be all ints.
2148   assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2149   assert(!x->has_index() || index_op->type() == T_INT, "index should be an int");
2150 #else
2151   if (x->has_index()) {
2152     if (index_op->type() == T_INT) {
2153       if (!index_op->is_constant()) {
2154         index_op = new_register(T_LONG);
2155         __ convert(Bytecodes::_i2l, idx.result(), index_op);
2156       }
2157     } else {
2158       assert(index_op->type() == T_LONG, "must be");
2159       if (index_op->is_constant()) {
2160         index_op = new_register(T_LONG);
2161         __ move(idx.result(), index_op);
2162       }
2163     }
2164   }
2165   // At this point base is a long non-constant
2166   // Index is a long register or a int constant.
2167   // We allow the constant to stay an int because that would allow us a more compact encoding by
2168   // embedding an immediate offset in the address expression. If we have a long constant, we have to
2169   // move it into a register first.
2170   assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a long non-constant");
2171   assert(!x->has_index() || (index_op->type() == T_INT && index_op->is_constant()) ||
2172                             (index_op->type() == T_LONG && !index_op->is_constant()), "unexpected index type");
2173 #endif
2174 
2175   BasicType dst_type = x->basic_type();
2176 
2177   LIR_Address* addr;
2178   if (index_op->is_constant()) {
2179     assert(log2_scale == 0, "must not have a scale");
2180     assert(index_op->type() == T_INT, "only int constants supported");
2181     addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
2182   } else {
2183 #ifdef X86
2184     addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
2185 #elif defined(GENERATE_ADDRESS_IS_PREFERRED)
2186     addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
2187 #else
2188     if (index_op->is_illegal() || log2_scale == 0) {
2189       addr = new LIR_Address(base_op, index_op, dst_type);
2190     } else {
2191       LIR_Opr tmp = new_pointer_register();
2192       __ shift_left(index_op, log2_scale, tmp);
2193       addr = new LIR_Address(base_op, tmp, dst_type);
2194     }
2195 #endif
2196   }
2197 
2198   if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2199     __ unaligned_move(addr, reg);
2200   } else {
2201     if (dst_type == T_OBJECT && x->is_wide()) {
2202       __ move_wide(addr, reg);
2203     } else {
2204       __ move(addr, reg);
2205     }
2206   }
2207 }
2208 
2209 
2210 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2211   int  log2_scale = 0;
2212   BasicType type = x->basic_type();
2213 
2214   if (x->has_index()) {
2215     log2_scale = x->log2_scale();
2216   }
2217 
2218   LIRItem base(x->base(), this);
2219   LIRItem value(x->value(), this);
2220   LIRItem idx(this);
2221 
2222   base.load_item();
2223   if (x->has_index()) {
2224     idx.set_instruction(x->index());
2225     idx.load_item();
2226   }
2227 
2228   if (type == T_BYTE || type == T_BOOLEAN) {
2229     value.load_byte_item();
2230   } else {
2231     value.load_item();
2232   }
2233 
2234   set_no_result(x);
2235 
2236   LIR_Opr base_op = base.result();
2237   LIR_Opr index_op = idx.result();
2238 
2239 #ifdef GENERATE_ADDRESS_IS_PREFERRED
2240   LIR_Address* addr = generate_address(base_op, index_op, log2_scale, 0, x->basic_type());
2241 #else
2242 #ifndef _LP64
2243   if (base_op->type() == T_LONG) {
2244     base_op = new_register(T_INT);
2245     __ convert(Bytecodes::_l2i, base.result(), base_op);
2246   }
2247   if (x->has_index()) {
2248     if (index_op->type() == T_LONG) {
2249       index_op = new_register(T_INT);
2250       __ convert(Bytecodes::_l2i, idx.result(), index_op);
2251     }
2252   }
2253   // At this point base and index should be all ints and not constants
2254   assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2255   assert(!x->has_index() || (index_op->type() == T_INT && !index_op->is_constant()), "index should be an non-constant int");
2256 #else
2257   if (x->has_index()) {
2258     if (index_op->type() == T_INT) {
2259       index_op = new_register(T_LONG);
2260       __ convert(Bytecodes::_i2l, idx.result(), index_op);
2261     }
2262   }
2263   // At this point base and index are long and non-constant
2264   assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a non-constant long");
2265   assert(!x->has_index() || (index_op->type() == T_LONG && !index_op->is_constant()), "index must be a non-constant long");
2266 #endif
2267 
2268   if (log2_scale != 0) {
2269     // temporary fix (platform dependent code without shift on Intel would be better)
2270     // TODO: ARM also allows embedded shift in the address
2271     LIR_Opr tmp = new_pointer_register();
2272     if (TwoOperandLIRForm) {
2273       __ move(index_op, tmp);
2274       index_op = tmp;
2275     }
2276     __ shift_left(index_op, log2_scale, tmp);
2277     if (!TwoOperandLIRForm) {
2278       index_op = tmp;
2279     }
2280   }
2281 
2282   LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2283 #endif // !GENERATE_ADDRESS_IS_PREFERRED
2284   __ move(value.result(), addr);
2285 }
2286 
2287 
2288 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2289   BasicType type = x->basic_type();
2290   LIRItem src(x->object(), this);
2291   LIRItem off(x->offset(), this);
2292 
2293   off.load_item();
2294   src.load_item();
2295 
2296   DecoratorSet decorators = IN_HEAP;
2297 
2298   if (x->is_volatile()) {
2299     decorators |= MO_SEQ_CST;
2300   }
2301   if (type == T_BOOLEAN) {
2302     decorators |= C1_MASK_BOOLEAN;
2303   }
2304   if (type == T_ARRAY || type == T_OBJECT) {
2305     decorators |= ON_UNKNOWN_OOP_REF;
2306   }
2307 
2308   LIR_Opr result = rlock_result(x, type);
2309   access_load_at(decorators, type,
2310                  src, off.result(), result);
2311 }
2312 
2313 
2314 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2315   BasicType type = x->basic_type();
2316   LIRItem src(x->object(), this);
2317   LIRItem off(x->offset(), this);
2318   LIRItem data(x->value(), this);
2319 
2320   src.load_item();
2321   if (type == T_BOOLEAN || type == T_BYTE) {
2322     data.load_byte_item();
2323   } else {
2324     data.load_item();
2325   }
2326   off.load_item();
2327 
2328   set_no_result(x);
2329 
2330   DecoratorSet decorators = IN_HEAP;
2331   if (type == T_ARRAY || type == T_OBJECT) {
2332     decorators |= ON_UNKNOWN_OOP_REF;
2333   }
2334   if (x->is_volatile()) {
2335     decorators |= MO_SEQ_CST;
2336   }
2337   access_store_at(decorators, type, src, off.result(), data.result());
2338 }
2339 
2340 void LIRGenerator::do_UnsafeGetAndSetObject(UnsafeGetAndSetObject* x) {
2341   BasicType type = x->basic_type();
2342   LIRItem src(x->object(), this);
2343   LIRItem off(x->offset(), this);
2344   LIRItem value(x->value(), this);
2345 
2346   DecoratorSet decorators = IN_HEAP | MO_SEQ_CST;
2347 
2348   if (type == T_ARRAY || type == T_OBJECT) {
2349     decorators |= ON_UNKNOWN_OOP_REF;
2350   }
2351 
2352   LIR_Opr result;
2353   if (x->is_add()) {
2354     result = access_atomic_add_at(decorators, type, src, off, value);
2355   } else {
2356     result = access_atomic_xchg_at(decorators, type, src, off, value);
2357   }
2358   set_result(x, result);
2359 }
2360 
2361 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2362   int lng = x->length();
2363 
2364   for (int i = 0; i < lng; i++) {
2365     SwitchRange* one_range = x->at(i);
2366     int low_key = one_range->low_key();
2367     int high_key = one_range->high_key();
2368     BlockBegin* dest = one_range->sux();
2369     if (low_key == high_key) {
2370       __ cmp(lir_cond_equal, value, low_key);
2371       __ branch(lir_cond_equal, T_INT, dest);
2372     } else if (high_key - low_key == 1) {
2373       __ cmp(lir_cond_equal, value, low_key);
2374       __ branch(lir_cond_equal, T_INT, dest);
2375       __ cmp(lir_cond_equal, value, high_key);
2376       __ branch(lir_cond_equal, T_INT, dest);
2377     } else {
2378       LabelObj* L = new LabelObj();
2379       __ cmp(lir_cond_less, value, low_key);
2380       __ branch(lir_cond_less, T_INT, L->label());
2381       __ cmp(lir_cond_lessEqual, value, high_key);
2382       __ branch(lir_cond_lessEqual, T_INT, dest);
2383       __ branch_destination(L->label());
2384     }
2385   }
2386   __ jump(default_sux);
2387 }
2388 
2389 
2390 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2391   SwitchRangeList* res = new SwitchRangeList();
2392   int len = x->length();
2393   if (len > 0) {
2394     BlockBegin* sux = x->sux_at(0);
2395     int key = x->lo_key();
2396     BlockBegin* default_sux = x->default_sux();
2397     SwitchRange* range = new SwitchRange(key, sux);
2398     for (int i = 0; i < len; i++, key++) {
2399       BlockBegin* new_sux = x->sux_at(i);
2400       if (sux == new_sux) {
2401         // still in same range
2402         range->set_high_key(key);
2403       } else {
2404         // skip tests which explicitly dispatch to the default
2405         if (sux != default_sux) {
2406           res->append(range);
2407         }
2408         range = new SwitchRange(key, new_sux);
2409       }
2410       sux = new_sux;
2411     }
2412     if (res->length() == 0 || res->last() != range)  res->append(range);
2413   }
2414   return res;
2415 }
2416 
2417 
2418 // we expect the keys to be sorted by increasing value
2419 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2420   SwitchRangeList* res = new SwitchRangeList();
2421   int len = x->length();
2422   if (len > 0) {
2423     BlockBegin* default_sux = x->default_sux();
2424     int key = x->key_at(0);
2425     BlockBegin* sux = x->sux_at(0);
2426     SwitchRange* range = new SwitchRange(key, sux);
2427     for (int i = 1; i < len; i++) {
2428       int new_key = x->key_at(i);
2429       BlockBegin* new_sux = x->sux_at(i);
2430       if (key+1 == new_key && sux == new_sux) {
2431         // still in same range
2432         range->set_high_key(new_key);
2433       } else {
2434         // skip tests which explicitly dispatch to the default
2435         if (range->sux() != default_sux) {
2436           res->append(range);
2437         }
2438         range = new SwitchRange(new_key, new_sux);
2439       }
2440       key = new_key;
2441       sux = new_sux;
2442     }
2443     if (res->length() == 0 || res->last() != range)  res->append(range);
2444   }
2445   return res;
2446 }
2447 
2448 
2449 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2450   LIRItem tag(x->tag(), this);
2451   tag.load_item();
2452   set_no_result(x);
2453 
2454   if (x->is_safepoint()) {
2455     __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2456   }
2457 
2458   // move values into phi locations
2459   move_to_phi(x->state());
2460 
2461   int lo_key = x->lo_key();
2462   int len = x->length();
2463   assert(lo_key <= (lo_key + (len - 1)), "integer overflow");
2464   LIR_Opr value = tag.result();
2465 
2466   if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2467     ciMethod* method = x->state()->scope()->method();
2468     ciMethodData* md = method->method_data_or_null();
2469     assert(md != NULL, "Sanity");
2470     ciProfileData* data = md->bci_to_data(x->state()->bci());
2471     assert(data != NULL, "must have profiling data");
2472     assert(data->is_MultiBranchData(), "bad profile data?");
2473     int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2474     LIR_Opr md_reg = new_register(T_METADATA);
2475     __ metadata2reg(md->constant_encoding(), md_reg);
2476     LIR_Opr data_offset_reg = new_pointer_register();
2477     LIR_Opr tmp_reg = new_pointer_register();
2478 
2479     __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2480     for (int i = 0; i < len; i++) {
2481       int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2482       __ cmp(lir_cond_equal, value, i + lo_key);
2483       __ move(data_offset_reg, tmp_reg);
2484       __ cmove(lir_cond_equal,
2485                LIR_OprFact::intptrConst(count_offset),
2486                tmp_reg,
2487                data_offset_reg, T_INT);
2488     }
2489 
2490     LIR_Opr data_reg = new_pointer_register();
2491     LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2492     __ move(data_addr, data_reg);
2493     __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2494     __ move(data_reg, data_addr);
2495   }
2496 
2497   if (UseTableRanges) {
2498     do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2499   } else {
2500     for (int i = 0; i < len; i++) {
2501       __ cmp(lir_cond_equal, value, i + lo_key);
2502       __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2503     }
2504     __ jump(x->default_sux());
2505   }
2506 }
2507 
2508 
2509 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2510   LIRItem tag(x->tag(), this);
2511   tag.load_item();
2512   set_no_result(x);
2513 
2514   if (x->is_safepoint()) {
2515     __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2516   }
2517 
2518   // move values into phi locations
2519   move_to_phi(x->state());
2520 
2521   LIR_Opr value = tag.result();
2522   int len = x->length();
2523 
2524   if (compilation()->env()->comp_level() == CompLevel_full_profile && UseSwitchProfiling) {
2525     ciMethod* method = x->state()->scope()->method();
2526     ciMethodData* md = method->method_data_or_null();
2527     assert(md != NULL, "Sanity");
2528     ciProfileData* data = md->bci_to_data(x->state()->bci());
2529     assert(data != NULL, "must have profiling data");
2530     assert(data->is_MultiBranchData(), "bad profile data?");
2531     int default_count_offset = md->byte_offset_of_slot(data, MultiBranchData::default_count_offset());
2532     LIR_Opr md_reg = new_register(T_METADATA);
2533     __ metadata2reg(md->constant_encoding(), md_reg);
2534     LIR_Opr data_offset_reg = new_pointer_register();
2535     LIR_Opr tmp_reg = new_pointer_register();
2536 
2537     __ move(LIR_OprFact::intptrConst(default_count_offset), data_offset_reg);
2538     for (int i = 0; i < len; i++) {
2539       int count_offset = md->byte_offset_of_slot(data, MultiBranchData::case_count_offset(i));
2540       __ cmp(lir_cond_equal, value, x->key_at(i));
2541       __ move(data_offset_reg, tmp_reg);
2542       __ cmove(lir_cond_equal,
2543                LIR_OprFact::intptrConst(count_offset),
2544                tmp_reg,
2545                data_offset_reg, T_INT);
2546     }
2547 
2548     LIR_Opr data_reg = new_pointer_register();
2549     LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
2550     __ move(data_addr, data_reg);
2551     __ add(data_reg, LIR_OprFact::intptrConst(1), data_reg);
2552     __ move(data_reg, data_addr);
2553   }
2554 
2555   if (UseTableRanges) {
2556     do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2557   } else {
2558     int len = x->length();
2559     for (int i = 0; i < len; i++) {
2560       __ cmp(lir_cond_equal, value, x->key_at(i));
2561       __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2562     }
2563     __ jump(x->default_sux());
2564   }
2565 }
2566 
2567 
2568 void LIRGenerator::do_Goto(Goto* x) {
2569   set_no_result(x);
2570 
2571   if (block()->next()->as_OsrEntry()) {
2572     // need to free up storage used for OSR entry point
2573     LIR_Opr osrBuffer = block()->next()->operand();
2574     BasicTypeList signature;
2575     signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer
2576     CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2577     __ move(osrBuffer, cc->args()->at(0));
2578     __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2579                          getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2580   }
2581 
2582   if (x->is_safepoint()) {
2583     ValueStack* state = x->state_before() ? x->state_before() : x->state();
2584 
2585     // increment backedge counter if needed
2586     CodeEmitInfo* info = state_for(x, state);
2587     increment_backedge_counter(info, x->profiled_bci());
2588     CodeEmitInfo* safepoint_info = state_for(x, state);
2589     __ safepoint(safepoint_poll_register(), safepoint_info);
2590   }
2591 
2592   // Gotos can be folded Ifs, handle this case.
2593   if (x->should_profile()) {
2594     ciMethod* method = x->profiled_method();
2595     assert(method != NULL, "method should be set if branch is profiled");
2596     ciMethodData* md = method->method_data_or_null();
2597     assert(md != NULL, "Sanity");
2598     ciProfileData* data = md->bci_to_data(x->profiled_bci());
2599     assert(data != NULL, "must have profiling data");
2600     int offset;
2601     if (x->direction() == Goto::taken) {
2602       assert(data->is_BranchData(), "need BranchData for two-way branches");
2603       offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2604     } else if (x->direction() == Goto::not_taken) {
2605       assert(data->is_BranchData(), "need BranchData for two-way branches");
2606       offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2607     } else {
2608       assert(data->is_JumpData(), "need JumpData for branches");
2609       offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2610     }
2611     LIR_Opr md_reg = new_register(T_METADATA);
2612     __ metadata2reg(md->constant_encoding(), md_reg);
2613 
2614     increment_counter(new LIR_Address(md_reg, offset,
2615                                       NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2616   }
2617 
2618   // emit phi-instruction move after safepoint since this simplifies
2619   // describing the state as the safepoint.
2620   move_to_phi(x->state());
2621 
2622   __ jump(x->default_sux());
2623 }
2624 
2625 /**
2626  * Emit profiling code if needed for arguments, parameters, return value types
2627  *
2628  * @param md                    MDO the code will update at runtime
2629  * @param md_base_offset        common offset in the MDO for this profile and subsequent ones
2630  * @param md_offset             offset in the MDO (on top of md_base_offset) for this profile
2631  * @param profiled_k            current profile
2632  * @param obj                   IR node for the object to be profiled
2633  * @param mdp                   register to hold the pointer inside the MDO (md + md_base_offset).
2634  *                              Set once we find an update to make and use for next ones.
2635  * @param not_null              true if we know obj cannot be null
2636  * @param signature_at_call_k   signature at call for obj
2637  * @param callee_signature_k    signature of callee for obj
2638  *                              at call and callee signatures differ at method handle call
2639  * @return                      the only klass we know will ever be seen at this profile point
2640  */
2641 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k,
2642                                     Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k,
2643                                     ciKlass* callee_signature_k) {
2644   ciKlass* result = NULL;
2645   bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k);
2646   bool do_update = !TypeEntries::is_type_unknown(profiled_k);
2647   // known not to be null or null bit already set and already set to
2648   // unknown: nothing we can do to improve profiling
2649   if (!do_null && !do_update) {
2650     return result;
2651   }
2652 
2653   ciKlass* exact_klass = NULL;
2654   Compilation* comp = Compilation::current();
2655   if (do_update) {
2656     // try to find exact type, using CHA if possible, so that loading
2657     // the klass from the object can be avoided
2658     ciType* type = obj->exact_type();
2659     if (type == NULL) {
2660       type = obj->declared_type();
2661       type = comp->cha_exact_type(type);
2662     }
2663     assert(type == NULL || type->is_klass(), "type should be class");
2664     exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL;
2665 
2666     do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2667   }
2668 
2669   if (!do_null && !do_update) {
2670     return result;
2671   }
2672 
2673   ciKlass* exact_signature_k = NULL;
2674   if (do_update) {
2675     // Is the type from the signature exact (the only one possible)?
2676     exact_signature_k = signature_at_call_k->exact_klass();
2677     if (exact_signature_k == NULL) {
2678       exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2679     } else {
2680       result = exact_signature_k;
2681       // Known statically. No need to emit any code: prevent
2682       // LIR_Assembler::emit_profile_type() from emitting useless code
2683       profiled_k = ciTypeEntries::with_status(result, profiled_k);
2684     }
2685     // exact_klass and exact_signature_k can be both non NULL but
2686     // different if exact_klass is loaded after the ciObject for
2687     // exact_signature_k is created.
2688     if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) {
2689       // sometimes the type of the signature is better than the best type
2690       // the compiler has
2691       exact_klass = exact_signature_k;
2692     }
2693     if (callee_signature_k != NULL &&
2694         callee_signature_k != signature_at_call_k) {
2695       ciKlass* improved_klass = callee_signature_k->exact_klass();
2696       if (improved_klass == NULL) {
2697         improved_klass = comp->cha_exact_type(callee_signature_k);
2698       }
2699       if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) {
2700         exact_klass = exact_signature_k;
2701       }
2702     }
2703     do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2704   }
2705 
2706   if (!do_null && !do_update) {
2707     return result;
2708   }
2709 
2710   if (mdp == LIR_OprFact::illegalOpr) {
2711     mdp = new_register(T_METADATA);
2712     __ metadata2reg(md->constant_encoding(), mdp);
2713     if (md_base_offset != 0) {
2714       LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2715       mdp = new_pointer_register();
2716       __ leal(LIR_OprFact::address(base_type_address), mdp);
2717     }
2718   }
2719   LIRItem value(obj, this);
2720   value.load_item();
2721   __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2722                   value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL);
2723   return result;
2724 }
2725 
2726 // profile parameters on entry to the root of the compilation
2727 void LIRGenerator::profile_parameters(Base* x) {
2728   if (compilation()->profile_parameters()) {
2729     CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2730     ciMethodData* md = scope()->method()->method_data_or_null();
2731     assert(md != NULL, "Sanity");
2732 
2733     if (md->parameters_type_data() != NULL) {
2734       ciParametersTypeData* parameters_type_data = md->parameters_type_data();
2735       ciTypeStackSlotEntries* parameters =  parameters_type_data->parameters();
2736       LIR_Opr mdp = LIR_OprFact::illegalOpr;
2737       for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) {
2738         LIR_Opr src = args->at(i);
2739         assert(!src->is_illegal(), "check");
2740         BasicType t = src->type();
2741         if (t == T_OBJECT || t == T_ARRAY) {
2742           intptr_t profiled_k = parameters->type(j);
2743           Local* local = x->state()->local_at(java_index)->as_Local();
2744           ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2745                                         in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2746                                         profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL);
2747           // If the profile is known statically set it once for all and do not emit any code
2748           if (exact != NULL) {
2749             md->set_parameter_type(j, exact);
2750           }
2751           j++;
2752         }
2753         java_index += type2size[t];
2754       }
2755     }
2756   }
2757 }
2758 
2759 void LIRGenerator::do_Base(Base* x) {
2760   __ std_entry(LIR_OprFact::illegalOpr);
2761   // Emit moves from physical registers / stack slots to virtual registers
2762   CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2763   IRScope* irScope = compilation()->hir()->top_scope();
2764   int java_index = 0;
2765   for (int i = 0; i < args->length(); i++) {
2766     LIR_Opr src = args->at(i);
2767     assert(!src->is_illegal(), "check");
2768     BasicType t = src->type();
2769 
2770     // Types which are smaller than int are passed as int, so
2771     // correct the type which passed.
2772     switch (t) {
2773     case T_BYTE:
2774     case T_BOOLEAN:
2775     case T_SHORT:
2776     case T_CHAR:
2777       t = T_INT;
2778       break;
2779     default:
2780       break;
2781     }
2782 
2783     LIR_Opr dest = new_register(t);
2784     __ move(src, dest);
2785 
2786     // Assign new location to Local instruction for this local
2787     Local* local = x->state()->local_at(java_index)->as_Local();
2788     assert(local != NULL, "Locals for incoming arguments must have been created");
2789 #ifndef __SOFTFP__
2790     // The java calling convention passes double as long and float as int.
2791     assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2792 #endif // __SOFTFP__
2793     local->set_operand(dest);
2794     _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2795     java_index += type2size[t];
2796   }
2797 
2798   if (compilation()->env()->dtrace_method_probes()) {
2799     BasicTypeList signature;
2800     signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT));    // thread
2801     signature.append(T_METADATA); // Method*
2802     LIR_OprList* args = new LIR_OprList();
2803     args->append(getThreadPointer());
2804     LIR_Opr meth = new_register(T_METADATA);
2805     __ metadata2reg(method()->constant_encoding(), meth);
2806     args->append(meth);
2807     call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2808   }
2809 
2810   if (method()->is_synchronized()) {
2811     LIR_Opr obj;
2812     if (method()->is_static()) {
2813       obj = new_register(T_OBJECT);
2814       __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2815     } else {
2816       Local* receiver = x->state()->local_at(0)->as_Local();
2817       assert(receiver != NULL, "must already exist");
2818       obj = receiver->operand();
2819     }
2820     assert(obj->is_valid(), "must be valid");
2821 
2822     if (method()->is_synchronized() && GenerateSynchronizationCode) {
2823       LIR_Opr lock = syncLockOpr();
2824       __ load_stack_address_monitor(0, lock);
2825 
2826       CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException));
2827       CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2828 
2829       // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2830       __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2831     }
2832   }
2833   if (compilation()->age_code()) {
2834     CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false);
2835     decrement_age(info);
2836   }
2837   // increment invocation counters if needed
2838   if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2839     profile_parameters(x);
2840     CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false);
2841     increment_invocation_counter(info);
2842   }
2843 
2844   // all blocks with a successor must end with an unconditional jump
2845   // to the successor even if they are consecutive
2846   __ jump(x->default_sux());
2847 }
2848 
2849 
2850 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2851   // construct our frame and model the production of incoming pointer
2852   // to the OSR buffer.
2853   __ osr_entry(LIR_Assembler::osrBufferPointer());
2854   LIR_Opr result = rlock_result(x);
2855   __ move(LIR_Assembler::osrBufferPointer(), result);
2856 }
2857 
2858 
2859 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2860   assert(args->length() == arg_list->length(),
2861          "args=%d, arg_list=%d", args->length(), arg_list->length());
2862   for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
2863     LIRItem* param = args->at(i);
2864     LIR_Opr loc = arg_list->at(i);
2865     if (loc->is_register()) {
2866       param->load_item_force(loc);
2867     } else {
2868       LIR_Address* addr = loc->as_address_ptr();
2869       param->load_for_store(addr->type());
2870       assert(addr->type() != T_VALUETYPE, "not supported yet");
2871       if (addr->type() == T_OBJECT) {
2872         __ move_wide(param->result(), addr);
2873       } else
2874         if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2875           __ unaligned_move(param->result(), addr);
2876         } else {
2877           __ move(param->result(), addr);
2878         }
2879     }
2880   }
2881 
2882   if (x->has_receiver()) {
2883     LIRItem* receiver = args->at(0);
2884     LIR_Opr loc = arg_list->at(0);
2885     if (loc->is_register()) {
2886       receiver->load_item_force(loc);
2887     } else {
2888       assert(loc->is_address(), "just checking");
2889       receiver->load_for_store(T_OBJECT);
2890       __ move_wide(receiver->result(), loc->as_address_ptr());
2891     }
2892   }
2893 }
2894 
2895 
2896 // Visits all arguments, returns appropriate items without loading them
2897 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2898   LIRItemList* argument_items = new LIRItemList();
2899   if (x->has_receiver()) {
2900     LIRItem* receiver = new LIRItem(x->receiver(), this);
2901     argument_items->append(receiver);
2902   }
2903   for (int i = 0; i < x->number_of_arguments(); i++) {
2904     LIRItem* param = new LIRItem(x->argument_at(i), this);
2905     argument_items->append(param);
2906   }
2907   return argument_items;
2908 }
2909 
2910 
2911 // The invoke with receiver has following phases:
2912 //   a) traverse and load/lock receiver;
2913 //   b) traverse all arguments -> item-array (invoke_visit_argument)
2914 //   c) push receiver on stack
2915 //   d) load each of the items and push on stack
2916 //   e) unlock receiver
2917 //   f) move receiver into receiver-register %o0
2918 //   g) lock result registers and emit call operation
2919 //
2920 // Before issuing a call, we must spill-save all values on stack
2921 // that are in caller-save register. "spill-save" moves those registers
2922 // either in a free callee-save register or spills them if no free
2923 // callee save register is available.
2924 //
2925 // The problem is where to invoke spill-save.
2926 // - if invoked between e) and f), we may lock callee save
2927 //   register in "spill-save" that destroys the receiver register
2928 //   before f) is executed
2929 // - if we rearrange f) to be earlier (by loading %o0) it
2930 //   may destroy a value on the stack that is currently in %o0
2931 //   and is waiting to be spilled
2932 // - if we keep the receiver locked while doing spill-save,
2933 //   we cannot spill it as it is spill-locked
2934 //
2935 void LIRGenerator::do_Invoke(Invoke* x) {
2936   CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
2937 
2938   LIR_OprList* arg_list = cc->args();
2939   LIRItemList* args = invoke_visit_arguments(x);
2940   LIR_Opr receiver = LIR_OprFact::illegalOpr;
2941 
2942   // setup result register
2943   LIR_Opr result_register = LIR_OprFact::illegalOpr;
2944   if (x->type() != voidType) {
2945     result_register = result_register_for(x->type());
2946   }
2947 
2948   CodeEmitInfo* info = state_for(x, x->state());
2949 
2950   invoke_load_arguments(x, args, arg_list);
2951 
2952   if (x->has_receiver()) {
2953     args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
2954     receiver = args->at(0)->result();
2955   }
2956 
2957   // emit invoke code
2958   assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
2959 
2960   // JSR 292
2961   // Preserve the SP over MethodHandle call sites, if needed.
2962   ciMethod* target = x->target();
2963   bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant?
2964                                   target->is_method_handle_intrinsic() ||
2965                                   target->is_compiled_lambda_form());
2966   if (is_method_handle_invoke) {
2967     info->set_is_method_handle_invoke(true);
2968     if(FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
2969         __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
2970     }
2971   }
2972 
2973   switch (x->code()) {
2974     case Bytecodes::_invokestatic:
2975       __ call_static(target, result_register,
2976                      SharedRuntime::get_resolve_static_call_stub(),
2977                      arg_list, info);
2978       break;
2979     case Bytecodes::_invokespecial:
2980     case Bytecodes::_invokevirtual:
2981     case Bytecodes::_invokeinterface:
2982       // for loaded and final (method or class) target we still produce an inline cache,
2983       // in order to be able to call mixed mode
2984       if (x->code() == Bytecodes::_invokespecial || x->target_is_final()) {
2985         __ call_opt_virtual(target, receiver, result_register,
2986                             SharedRuntime::get_resolve_opt_virtual_call_stub(),
2987                             arg_list, info);
2988       } else if (x->vtable_index() < 0) {
2989         __ call_icvirtual(target, receiver, result_register,
2990                           SharedRuntime::get_resolve_virtual_call_stub(),
2991                           arg_list, info);
2992       } else {
2993         int entry_offset = in_bytes(Klass::vtable_start_offset()) + x->vtable_index() * vtableEntry::size_in_bytes();
2994         int vtable_offset = entry_offset + vtableEntry::method_offset_in_bytes();
2995         __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
2996       }
2997       break;
2998     case Bytecodes::_invokedynamic: {
2999       __ call_dynamic(target, receiver, result_register,
3000                       SharedRuntime::get_resolve_static_call_stub(),
3001                       arg_list, info);
3002       break;
3003     }
3004     default:
3005       fatal("unexpected bytecode: %s", Bytecodes::name(x->code()));
3006       break;
3007   }
3008 
3009   // JSR 292
3010   // Restore the SP after MethodHandle call sites, if needed.
3011   if (is_method_handle_invoke
3012       && FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
3013     __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
3014   }
3015 
3016   if (x->type()->is_float() || x->type()->is_double()) {
3017     // Force rounding of results from non-strictfp when in strictfp
3018     // scope (or when we don't know the strictness of the callee, to
3019     // be safe.)
3020     if (method()->is_strict()) {
3021       if (!x->target_is_loaded() || !x->target_is_strictfp()) {
3022         result_register = round_item(result_register);
3023       }
3024     }
3025   }
3026 
3027   if (result_register->is_valid()) {
3028     LIR_Opr result = rlock_result(x);
3029     __ move(result_register, result);
3030   }
3031 }
3032 
3033 
3034 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
3035   assert(x->number_of_arguments() == 1, "wrong type");
3036   LIRItem value       (x->argument_at(0), this);
3037   LIR_Opr reg = rlock_result(x);
3038   value.load_item();
3039   LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
3040   __ move(tmp, reg);
3041 }
3042 
3043 
3044 
3045 // Code for  :  x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3046 void LIRGenerator::do_IfOp(IfOp* x) {
3047 #ifdef ASSERT
3048   {
3049     ValueTag xtag = x->x()->type()->tag();
3050     ValueTag ttag = x->tval()->type()->tag();
3051     assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3052     assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3053     assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3054   }
3055 #endif
3056 
3057   LIRItem left(x->x(), this);
3058   LIRItem right(x->y(), this);
3059   left.load_item();
3060   if (can_inline_as_constant(right.value())) {
3061     right.dont_load_item();
3062   } else {
3063     right.load_item();
3064   }
3065 
3066   LIRItem t_val(x->tval(), this);
3067   LIRItem f_val(x->fval(), this);
3068   t_val.dont_load_item();
3069   f_val.dont_load_item();
3070   LIR_Opr reg = rlock_result(x);
3071 
3072   __ cmp(lir_cond(x->cond()), left.result(), right.result());
3073   __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3074 }
3075 
3076 #ifdef JFR_HAVE_INTRINSICS
3077 void LIRGenerator::do_ClassIDIntrinsic(Intrinsic* x) {
3078   CodeEmitInfo* info = state_for(x);
3079   CodeEmitInfo* info2 = new CodeEmitInfo(info); // Clone for the second null check
3080 
3081   assert(info != NULL, "must have info");
3082   LIRItem arg(x->argument_at(0), this);
3083 
3084   arg.load_item();
3085   LIR_Opr klass = new_register(T_METADATA);
3086   __ move(new LIR_Address(arg.result(), java_lang_Class::klass_offset_in_bytes(), T_ADDRESS), klass, info);
3087   LIR_Opr id = new_register(T_LONG);
3088   ByteSize offset = KLASS_TRACE_ID_OFFSET;
3089   LIR_Address* trace_id_addr = new LIR_Address(klass, in_bytes(offset), T_LONG);
3090 
3091   __ move(trace_id_addr, id);
3092   __ logical_or(id, LIR_OprFact::longConst(0x01l), id);
3093   __ store(id, trace_id_addr);
3094 
3095 #ifdef TRACE_ID_META_BITS
3096   __ logical_and(id, LIR_OprFact::longConst(~TRACE_ID_META_BITS), id);
3097 #endif
3098 #ifdef TRACE_ID_SHIFT
3099   __ unsigned_shift_right(id, TRACE_ID_SHIFT, id);
3100 #endif
3101 
3102   __ move(id, rlock_result(x));
3103 }
3104 
3105 void LIRGenerator::do_getEventWriter(Intrinsic* x) {
3106   LabelObj* L_end = new LabelObj();
3107 
3108   LIR_Address* jobj_addr = new LIR_Address(getThreadPointer(),
3109                                            in_bytes(THREAD_LOCAL_WRITER_OFFSET_JFR),
3110                                            T_OBJECT);
3111   LIR_Opr result = rlock_result(x);
3112   __ move_wide(jobj_addr, result);
3113   __ cmp(lir_cond_equal, result, LIR_OprFact::oopConst(NULL));
3114   __ branch(lir_cond_equal, T_OBJECT, L_end->label());
3115 
3116   LIR_Opr jobj = new_register(T_OBJECT);
3117   __ move(result, jobj);
3118   access_load(IN_NATIVE, T_OBJECT, LIR_OprFact::address(new LIR_Address(jobj, T_OBJECT)), result);
3119 
3120   __ branch_destination(L_end->label());
3121 }
3122 
3123 #endif
3124 
3125 
3126 void LIRGenerator::do_RuntimeCall(address routine, Intrinsic* x) {
3127   assert(x->number_of_arguments() == 0, "wrong type");
3128   // Enforce computation of _reserved_argument_area_size which is required on some platforms.
3129   BasicTypeList signature;
3130   CallingConvention* cc = frame_map()->c_calling_convention(&signature);
3131   LIR_Opr reg = result_register_for(x->type());
3132   __ call_runtime_leaf(routine, getThreadTemp(),
3133                        reg, new LIR_OprList());
3134   LIR_Opr result = rlock_result(x);
3135   __ move(reg, result);
3136 }
3137 
3138 
3139 
3140 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3141   switch (x->id()) {
3142   case vmIntrinsics::_intBitsToFloat      :
3143   case vmIntrinsics::_doubleToRawLongBits :
3144   case vmIntrinsics::_longBitsToDouble    :
3145   case vmIntrinsics::_floatToRawIntBits   : {
3146     do_FPIntrinsics(x);
3147     break;
3148   }
3149 
3150 #ifdef JFR_HAVE_INTRINSICS
3151   case vmIntrinsics::_getClassId:
3152     do_ClassIDIntrinsic(x);
3153     break;
3154   case vmIntrinsics::_getEventWriter:
3155     do_getEventWriter(x);
3156     break;
3157   case vmIntrinsics::_counterTime:
3158     do_RuntimeCall(CAST_FROM_FN_PTR(address, JFR_TIME_FUNCTION), x);
3159     break;
3160 #endif
3161 
3162   case vmIntrinsics::_currentTimeMillis:
3163     do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), x);
3164     break;
3165 
3166   case vmIntrinsics::_nanoTime:
3167     do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), x);
3168     break;
3169 
3170   case vmIntrinsics::_Object_init:    do_RegisterFinalizer(x); break;
3171   case vmIntrinsics::_isInstance:     do_isInstance(x);    break;
3172   case vmIntrinsics::_isPrimitive:    do_isPrimitive(x);   break;
3173   case vmIntrinsics::_getClass:       do_getClass(x);      break;
3174   case vmIntrinsics::_currentThread:  do_currentThread(x); break;
3175 
3176   case vmIntrinsics::_dlog:           // fall through
3177   case vmIntrinsics::_dlog10:         // fall through
3178   case vmIntrinsics::_dabs:           // fall through
3179   case vmIntrinsics::_dsqrt:          // fall through
3180   case vmIntrinsics::_dtan:           // fall through
3181   case vmIntrinsics::_dsin :          // fall through
3182   case vmIntrinsics::_dcos :          // fall through
3183   case vmIntrinsics::_dexp :          // fall through
3184   case vmIntrinsics::_dpow :          do_MathIntrinsic(x); break;
3185   case vmIntrinsics::_arraycopy:      do_ArrayCopy(x);     break;
3186 
3187   case vmIntrinsics::_fmaD:           do_FmaIntrinsic(x); break;
3188   case vmIntrinsics::_fmaF:           do_FmaIntrinsic(x); break;
3189 
3190   // java.nio.Buffer.checkIndex
3191   case vmIntrinsics::_checkIndex:     do_NIOCheckIndex(x); break;
3192 
3193   case vmIntrinsics::_compareAndSetObject:
3194     do_CompareAndSwap(x, objectType);
3195     break;
3196   case vmIntrinsics::_compareAndSetInt:
3197     do_CompareAndSwap(x, intType);
3198     break;
3199   case vmIntrinsics::_compareAndSetLong:
3200     do_CompareAndSwap(x, longType);
3201     break;
3202 
3203   case vmIntrinsics::_loadFence :
3204     if (os::is_MP()) __ membar_acquire();
3205     break;
3206   case vmIntrinsics::_storeFence:
3207     if (os::is_MP()) __ membar_release();
3208     break;
3209   case vmIntrinsics::_fullFence :
3210     if (os::is_MP()) __ membar();
3211     break;
3212   case vmIntrinsics::_onSpinWait:
3213     __ on_spin_wait();
3214     break;
3215   case vmIntrinsics::_Reference_get:
3216     do_Reference_get(x);
3217     break;
3218 
3219   case vmIntrinsics::_updateCRC32:
3220   case vmIntrinsics::_updateBytesCRC32:
3221   case vmIntrinsics::_updateByteBufferCRC32:
3222     do_update_CRC32(x);
3223     break;
3224 
3225   case vmIntrinsics::_updateBytesCRC32C:
3226   case vmIntrinsics::_updateDirectByteBufferCRC32C:
3227     do_update_CRC32C(x);
3228     break;
3229 
3230   case vmIntrinsics::_vectorizedMismatch:
3231     do_vectorizedMismatch(x);
3232     break;
3233 
3234   default: ShouldNotReachHere(); break;
3235   }
3236 }
3237 
3238 void LIRGenerator::profile_arguments(ProfileCall* x) {
3239   if (compilation()->profile_arguments()) {
3240     int bci = x->bci_of_invoke();
3241     ciMethodData* md = x->method()->method_data_or_null();
3242     assert(md != NULL, "Sanity");
3243     ciProfileData* data = md->bci_to_data(bci);
3244     if (data != NULL) {
3245       if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) ||
3246           (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) {
3247         ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset();
3248         int base_offset = md->byte_offset_of_slot(data, extra);
3249         LIR_Opr mdp = LIR_OprFact::illegalOpr;
3250         ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args();
3251 
3252         Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3253         int start = 0;
3254         int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments();
3255         if (x->callee()->is_loaded() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) {
3256           // first argument is not profiled at call (method handle invoke)
3257           assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected");
3258           start = 1;
3259         }
3260         ciSignature* callee_signature = x->callee()->signature();
3261         // method handle call to virtual method
3262         bool has_receiver = x->callee()->is_loaded() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc);
3263         ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL);
3264 
3265         bool ignored_will_link;
3266         ciSignature* signature_at_call = NULL;
3267         x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3268         ciSignatureStream signature_at_call_stream(signature_at_call);
3269 
3270         // if called through method handle invoke, some arguments may have been popped
3271         for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) {
3272           int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset());
3273           ciKlass* exact = profile_type(md, base_offset, off,
3274               args->type(i), x->profiled_arg_at(i+start), mdp,
3275               !x->arg_needs_null_check(i+start),
3276               signature_at_call_stream.next_klass(), callee_signature_stream.next_klass());
3277           if (exact != NULL) {
3278             md->set_argument_type(bci, i, exact);
3279           }
3280         }
3281       } else {
3282 #ifdef ASSERT
3283         Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke());
3284         int n = x->nb_profiled_args();
3285         assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() ||
3286             (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))),
3287             "only at JSR292 bytecodes");
3288 #endif
3289       }
3290     }
3291   }
3292 }
3293 
3294 // profile parameters on entry to an inlined method
3295 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) {
3296   if (compilation()->profile_parameters() && x->inlined()) {
3297     ciMethodData* md = x->callee()->method_data_or_null();
3298     if (md != NULL) {
3299       ciParametersTypeData* parameters_type_data = md->parameters_type_data();
3300       if (parameters_type_data != NULL) {
3301         ciTypeStackSlotEntries* parameters =  parameters_type_data->parameters();
3302         LIR_Opr mdp = LIR_OprFact::illegalOpr;
3303         bool has_receiver = !x->callee()->is_static();
3304         ciSignature* sig = x->callee()->signature();
3305         ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL);
3306         int i = 0; // to iterate on the Instructions
3307         Value arg = x->recv();
3308         bool not_null = false;
3309         int bci = x->bci_of_invoke();
3310         Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3311         // The first parameter is the receiver so that's what we start
3312         // with if it exists. One exception is method handle call to
3313         // virtual method: the receiver is in the args list
3314         if (arg == NULL || !Bytecodes::has_receiver(bc)) {
3315           i = 1;
3316           arg = x->profiled_arg_at(0);
3317           not_null = !x->arg_needs_null_check(0);
3318         }
3319         int k = 0; // to iterate on the profile data
3320         for (;;) {
3321           intptr_t profiled_k = parameters->type(k);
3322           ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
3323                                         in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)),
3324                                         profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL);
3325           // If the profile is known statically set it once for all and do not emit any code
3326           if (exact != NULL) {
3327             md->set_parameter_type(k, exact);
3328           }
3329           k++;
3330           if (k >= parameters_type_data->number_of_parameters()) {
3331 #ifdef ASSERT
3332             int extra = 0;
3333             if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 &&
3334                 x->nb_profiled_args() >= TypeProfileParmsLimit &&
3335                 x->recv() != NULL && Bytecodes::has_receiver(bc)) {
3336               extra += 1;
3337             }
3338             assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?");
3339 #endif
3340             break;
3341           }
3342           arg = x->profiled_arg_at(i);
3343           not_null = !x->arg_needs_null_check(i);
3344           i++;
3345         }
3346       }
3347     }
3348   }
3349 }
3350 
3351 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
3352   // Need recv in a temporary register so it interferes with the other temporaries
3353   LIR_Opr recv = LIR_OprFact::illegalOpr;
3354   LIR_Opr mdo = new_register(T_METADATA);
3355   // tmp is used to hold the counters on SPARC
3356   LIR_Opr tmp = new_pointer_register();
3357 
3358   if (x->nb_profiled_args() > 0) {
3359     profile_arguments(x);
3360   }
3361 
3362   // profile parameters on inlined method entry including receiver
3363   if (x->recv() != NULL || x->nb_profiled_args() > 0) {
3364     profile_parameters_at_call(x);
3365   }
3366 
3367   if (x->recv() != NULL) {
3368     LIRItem value(x->recv(), this);
3369     value.load_item();
3370     recv = new_register(T_OBJECT);
3371     __ move(value.result(), recv);
3372   }
3373   __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3374 }
3375 
3376 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3377   int bci = x->bci_of_invoke();
3378   ciMethodData* md = x->method()->method_data_or_null();
3379   assert(md != NULL, "Sanity");
3380   ciProfileData* data = md->bci_to_data(bci);
3381   if (data != NULL) {
3382     assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3383     ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3384     LIR_Opr mdp = LIR_OprFact::illegalOpr;
3385 
3386     bool ignored_will_link;
3387     ciSignature* signature_at_call = NULL;
3388     x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3389 
3390     // The offset within the MDO of the entry to update may be too large
3391     // to be used in load/store instructions on some platforms. So have
3392     // profile_type() compute the address of the profile in a register.
3393     ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3394         ret->type(), x->ret(), mdp,
3395         !x->needs_null_check(),
3396         signature_at_call->return_type()->as_klass(),
3397         x->callee()->signature()->return_type()->as_klass());
3398     if (exact != NULL) {
3399       md->set_return_type(bci, exact);
3400     }
3401   }
3402 }
3403 
3404 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3405   // We can safely ignore accessors here, since c2 will inline them anyway,
3406   // accessors are also always mature.
3407   if (!x->inlinee()->is_accessor()) {
3408     CodeEmitInfo* info = state_for(x, x->state(), true);
3409     // Notify the runtime very infrequently only to take care of counter overflows
3410     int freq_log = Tier23InlineeNotifyFreqLog;
3411     double scale;
3412     if (_method->has_option_value("CompileThresholdScaling", scale)) {
3413       freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3414     }
3415     increment_event_counter_impl(info, x->inlinee(), LIR_OprFact::intConst(InvocationCounter::count_increment), right_n_bits(freq_log), InvocationEntryBci, false, true);
3416   }
3417 }
3418 
3419 void LIRGenerator::increment_backedge_counter_conditionally(LIR_Condition cond, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info, int left_bci, int right_bci, int bci) {
3420   if (compilation()->count_backedges()) {
3421     __ cmp(cond, left, right);
3422     LIR_Opr step = new_register(T_INT);
3423     LIR_Opr plus_one = LIR_OprFact::intConst(InvocationCounter::count_increment);
3424     LIR_Opr zero = LIR_OprFact::intConst(0);
3425     __ cmove(cond,
3426         (left_bci < bci) ? plus_one : zero,
3427         (right_bci < bci) ? plus_one : zero,
3428         step, left->type());
3429     increment_backedge_counter(info, step, bci);
3430   }
3431 }
3432 
3433 
3434 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, LIR_Opr step, int bci, bool backedge) {
3435   int freq_log = 0;
3436   int level = compilation()->env()->comp_level();
3437   if (level == CompLevel_limited_profile) {
3438     freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
3439   } else if (level == CompLevel_full_profile) {
3440     freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
3441   } else {
3442     ShouldNotReachHere();
3443   }
3444   // Increment the appropriate invocation/backedge counter and notify the runtime.
3445   double scale;
3446   if (_method->has_option_value("CompileThresholdScaling", scale)) {
3447     freq_log = CompilerConfig::scaled_freq_log(freq_log, scale);
3448   }
3449   increment_event_counter_impl(info, info->scope()->method(), step, right_n_bits(freq_log), bci, backedge, true);
3450 }
3451 
3452 void LIRGenerator::decrement_age(CodeEmitInfo* info) {
3453   ciMethod* method = info->scope()->method();
3454   MethodCounters* mc_adr = method->ensure_method_counters();
3455   if (mc_adr != NULL) {
3456     LIR_Opr mc = new_pointer_register();
3457     __ move(LIR_OprFact::intptrConst(mc_adr), mc);
3458     int offset = in_bytes(MethodCounters::nmethod_age_offset());
3459     LIR_Address* counter = new LIR_Address(mc, offset, T_INT);
3460     LIR_Opr result = new_register(T_INT);
3461     __ load(counter, result);
3462     __ sub(result, LIR_OprFact::intConst(1), result);
3463     __ store(result, counter);
3464     // DeoptimizeStub will reexecute from the current state in code info.
3465     CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured,
3466                                          Deoptimization::Action_make_not_entrant);
3467     __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0));
3468     __ branch(lir_cond_lessEqual, T_INT, deopt);
3469   }
3470 }
3471 
3472 
3473 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
3474                                                 ciMethod *method, LIR_Opr step, int frequency,
3475                                                 int bci, bool backedge, bool notify) {
3476   assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
3477   int level = _compilation->env()->comp_level();
3478   assert(level > CompLevel_simple, "Shouldn't be here");
3479 
3480   int offset = -1;
3481   LIR_Opr counter_holder = NULL;
3482   if (level == CompLevel_limited_profile) {
3483     MethodCounters* counters_adr = method->ensure_method_counters();
3484     if (counters_adr == NULL) {
3485       bailout("method counters allocation failed");
3486       return;
3487     }
3488     counter_holder = new_pointer_register();
3489     __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder);
3490     offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() :
3491                                  MethodCounters::invocation_counter_offset());
3492   } else if (level == CompLevel_full_profile) {
3493     counter_holder = new_register(T_METADATA);
3494     offset = in_bytes(backedge ? MethodData::backedge_counter_offset() :
3495                                  MethodData::invocation_counter_offset());
3496     ciMethodData* md = method->method_data_or_null();
3497     assert(md != NULL, "Sanity");
3498     __ metadata2reg(md->constant_encoding(), counter_holder);
3499   } else {
3500     ShouldNotReachHere();
3501   }
3502   LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
3503   LIR_Opr result = new_register(T_INT);
3504   __ load(counter, result);
3505   __ add(result, step, result);
3506   __ store(result, counter);
3507   if (notify && (!backedge || UseOnStackReplacement)) {
3508     LIR_Opr meth = LIR_OprFact::metadataConst(method->constant_encoding());
3509     // The bci for info can point to cmp for if's we want the if bci
3510     CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
3511     int freq = frequency << InvocationCounter::count_shift;
3512     if (freq == 0) {
3513       if (!step->is_constant()) {
3514         __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3515         __ branch(lir_cond_notEqual, T_ILLEGAL, overflow);
3516       } else {
3517         __ branch(lir_cond_always, T_ILLEGAL, overflow);
3518       }
3519     } else {
3520       LIR_Opr mask = load_immediate(freq, T_INT);
3521       if (!step->is_constant()) {
3522         // If step is 0, make sure the overflow check below always fails
3523         __ cmp(lir_cond_notEqual, step, LIR_OprFact::intConst(0));
3524         __ cmove(lir_cond_notEqual, result, LIR_OprFact::intConst(InvocationCounter::count_increment), result, T_INT);
3525       }
3526       __ logical_and(result, mask, result);
3527       __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
3528       __ branch(lir_cond_equal, T_INT, overflow);
3529     }
3530     __ branch_destination(overflow->continuation());
3531   }
3532 }
3533 
3534 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
3535   LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
3536   BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
3537 
3538   if (x->pass_thread()) {
3539     signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT));    // thread
3540     args->append(getThreadPointer());
3541   }
3542 
3543   for (int i = 0; i < x->number_of_arguments(); i++) {
3544     Value a = x->argument_at(i);
3545     LIRItem* item = new LIRItem(a, this);
3546     item->load_item();
3547     args->append(item->result());
3548     signature->append(as_BasicType(a->type()));
3549   }
3550 
3551   LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
3552   if (x->type() == voidType) {
3553     set_no_result(x);
3554   } else {
3555     __ move(result, rlock_result(x));
3556   }
3557 }
3558 
3559 #ifdef ASSERT
3560 void LIRGenerator::do_Assert(Assert *x) {
3561   ValueTag tag = x->x()->type()->tag();
3562   If::Condition cond = x->cond();
3563 
3564   LIRItem xitem(x->x(), this);
3565   LIRItem yitem(x->y(), this);
3566   LIRItem* xin = &xitem;
3567   LIRItem* yin = &yitem;
3568 
3569   assert(tag == intTag, "Only integer assertions are valid!");
3570 
3571   xin->load_item();
3572   yin->dont_load_item();
3573 
3574   set_no_result(x);
3575 
3576   LIR_Opr left = xin->result();
3577   LIR_Opr right = yin->result();
3578 
3579   __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true);
3580 }
3581 #endif
3582 
3583 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) {
3584 
3585 
3586   Instruction *a = x->x();
3587   Instruction *b = x->y();
3588   if (!a || StressRangeCheckElimination) {
3589     assert(!b || StressRangeCheckElimination, "B must also be null");
3590 
3591     CodeEmitInfo *info = state_for(x, x->state());
3592     CodeStub* stub = new PredicateFailedStub(info);
3593 
3594     __ jump(stub);
3595   } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) {
3596     int a_int = a->type()->as_IntConstant()->value();
3597     int b_int = b->type()->as_IntConstant()->value();
3598 
3599     bool ok = false;
3600 
3601     switch(x->cond()) {
3602       case Instruction::eql: ok = (a_int == b_int); break;
3603       case Instruction::neq: ok = (a_int != b_int); break;
3604       case Instruction::lss: ok = (a_int < b_int); break;
3605       case Instruction::leq: ok = (a_int <= b_int); break;
3606       case Instruction::gtr: ok = (a_int > b_int); break;
3607       case Instruction::geq: ok = (a_int >= b_int); break;
3608       case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break;
3609       case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break;
3610       default: ShouldNotReachHere();
3611     }
3612 
3613     if (ok) {
3614 
3615       CodeEmitInfo *info = state_for(x, x->state());
3616       CodeStub* stub = new PredicateFailedStub(info);
3617 
3618       __ jump(stub);
3619     }
3620   } else {
3621 
3622     ValueTag tag = x->x()->type()->tag();
3623     If::Condition cond = x->cond();
3624     LIRItem xitem(x->x(), this);
3625     LIRItem yitem(x->y(), this);
3626     LIRItem* xin = &xitem;
3627     LIRItem* yin = &yitem;
3628 
3629     assert(tag == intTag, "Only integer deoptimizations are valid!");
3630 
3631     xin->load_item();
3632     yin->dont_load_item();
3633     set_no_result(x);
3634 
3635     LIR_Opr left = xin->result();
3636     LIR_Opr right = yin->result();
3637 
3638     CodeEmitInfo *info = state_for(x, x->state());
3639     CodeStub* stub = new PredicateFailedStub(info);
3640 
3641     __ cmp(lir_cond(cond), left, right);
3642     __ branch(lir_cond(cond), right->type(), stub);
3643   }
3644 }
3645 
3646 
3647 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
3648   LIRItemList args(1);
3649   LIRItem value(arg1, this);
3650   args.append(&value);
3651   BasicTypeList signature;
3652   signature.append(as_BasicType(arg1->type()));
3653 
3654   return call_runtime(&signature, &args, entry, result_type, info);
3655 }
3656 
3657 
3658 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
3659   LIRItemList args(2);
3660   LIRItem value1(arg1, this);
3661   LIRItem value2(arg2, this);
3662   args.append(&value1);
3663   args.append(&value2);
3664   BasicTypeList signature;
3665   signature.append(as_BasicType(arg1->type()));
3666   signature.append(as_BasicType(arg2->type()));
3667 
3668   return call_runtime(&signature, &args, entry, result_type, info);
3669 }
3670 
3671 
3672 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
3673                                    address entry, ValueType* result_type, CodeEmitInfo* info) {
3674   // get a result register
3675   LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3676   LIR_Opr result = LIR_OprFact::illegalOpr;
3677   if (result_type->tag() != voidTag) {
3678     result = new_register(result_type);
3679     phys_reg = result_register_for(result_type);
3680   }
3681 
3682   // move the arguments into the correct location
3683   CallingConvention* cc = frame_map()->c_calling_convention(signature);
3684   assert(cc->length() == args->length(), "argument mismatch");
3685   for (int i = 0; i < args->length(); i++) {
3686     LIR_Opr arg = args->at(i);
3687     LIR_Opr loc = cc->at(i);
3688     if (loc->is_register()) {
3689       __ move(arg, loc);
3690     } else {
3691       LIR_Address* addr = loc->as_address_ptr();
3692 //           if (!can_store_as_constant(arg)) {
3693 //             LIR_Opr tmp = new_register(arg->type());
3694 //             __ move(arg, tmp);
3695 //             arg = tmp;
3696 //           }
3697       if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3698         __ unaligned_move(arg, addr);
3699       } else {
3700         __ move(arg, addr);
3701       }
3702     }
3703   }
3704 
3705   if (info) {
3706     __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3707   } else {
3708     __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3709   }
3710   if (result->is_valid()) {
3711     __ move(phys_reg, result);
3712   }
3713   return result;
3714 }
3715 
3716 
3717 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
3718                                    address entry, ValueType* result_type, CodeEmitInfo* info) {
3719   // get a result register
3720   LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3721   LIR_Opr result = LIR_OprFact::illegalOpr;
3722   if (result_type->tag() != voidTag) {
3723     result = new_register(result_type);
3724     phys_reg = result_register_for(result_type);
3725   }
3726 
3727   // move the arguments into the correct location
3728   CallingConvention* cc = frame_map()->c_calling_convention(signature);
3729 
3730   assert(cc->length() == args->length(), "argument mismatch");
3731   for (int i = 0; i < args->length(); i++) {
3732     LIRItem* arg = args->at(i);
3733     LIR_Opr loc = cc->at(i);
3734     if (loc->is_register()) {
3735       arg->load_item_force(loc);
3736     } else {
3737       LIR_Address* addr = loc->as_address_ptr();
3738       arg->load_for_store(addr->type());
3739       if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3740         __ unaligned_move(arg->result(), addr);
3741       } else {
3742         __ move(arg->result(), addr);
3743       }
3744     }
3745   }
3746 
3747   if (info) {
3748     __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3749   } else {
3750     __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3751   }
3752   if (result->is_valid()) {
3753     __ move(phys_reg, result);
3754   }
3755   return result;
3756 }
3757 
3758 void LIRGenerator::do_MemBar(MemBar* x) {
3759   if (os::is_MP()) {
3760     LIR_Code code = x->code();
3761     switch(code) {
3762       case lir_membar_acquire   : __ membar_acquire(); break;
3763       case lir_membar_release   : __ membar_release(); break;
3764       case lir_membar           : __ membar(); break;
3765       case lir_membar_loadload  : __ membar_loadload(); break;
3766       case lir_membar_storestore: __ membar_storestore(); break;
3767       case lir_membar_loadstore : __ membar_loadstore(); break;
3768       case lir_membar_storeload : __ membar_storeload(); break;
3769       default                   : ShouldNotReachHere(); break;
3770     }
3771   }
3772 }
3773 
3774 LIR_Opr LIRGenerator::mask_boolean(LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3775   LIR_Opr value_fixed = rlock_byte(T_BYTE);
3776   if (TwoOperandLIRForm) {
3777     __ move(value, value_fixed);
3778     __ logical_and(value_fixed, LIR_OprFact::intConst(1), value_fixed);
3779   } else {
3780     __ logical_and(value, LIR_OprFact::intConst(1), value_fixed);
3781   }
3782   LIR_Opr klass = new_register(T_METADATA);
3783   __ move(new LIR_Address(array, oopDesc::klass_offset_in_bytes(), T_ADDRESS), klass, null_check_info);
3784   null_check_info = NULL;
3785   LIR_Opr layout = new_register(T_INT);
3786   __ move(new LIR_Address(klass, in_bytes(Klass::layout_helper_offset()), T_INT), layout);
3787   int diffbit = Klass::layout_helper_boolean_diffbit();
3788   __ logical_and(layout, LIR_OprFact::intConst(diffbit), layout);
3789   __ cmp(lir_cond_notEqual, layout, LIR_OprFact::intConst(0));
3790   __ cmove(lir_cond_notEqual, value_fixed, value, value_fixed, T_BYTE);
3791   value = value_fixed;
3792   return value;
3793 }
3794 
3795 LIR_Opr LIRGenerator::maybe_mask_boolean(StoreIndexed* x, LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info) {
3796   if (x->check_boolean()) {
3797     value = mask_boolean(array, value, null_check_info);
3798   }
3799   return value;
3800 }