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