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