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