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