src/share/vm/c1/c1_LIRAssembler.cpp

Wed, 03 Jul 2019 20:42:37 +0800

author
aoqi
date
Wed, 03 Jul 2019 20:42:37 +0800
changeset 9637
eef07cd490d4
parent 9138
b56ab8e56604
parent 9604
da2e98c027fd
permissions
-rw-r--r--

Merge

duke@435 1 /*
phh@9604 2 * Copyright (c) 2000, 2018, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
aoqi@1 25 /*
aoqi@1 26 * This file has been modified by Loongson Technology in 2015. These
aoqi@1 27 * modifications are Copyright (c) 2015 Loongson Technology, and are made
aoqi@1 28 * available on the same license terms set forth above.
aoqi@1 29 */
aoqi@1 30
stefank@2314 31 #include "precompiled.hpp"
stefank@2314 32 #include "c1/c1_Compilation.hpp"
stefank@2314 33 #include "c1/c1_Instruction.hpp"
stefank@2314 34 #include "c1/c1_InstructionPrinter.hpp"
stefank@2314 35 #include "c1/c1_LIRAssembler.hpp"
stefank@2314 36 #include "c1/c1_MacroAssembler.hpp"
stefank@2314 37 #include "c1/c1_ValueStack.hpp"
stefank@2314 38 #include "ci/ciInstance.hpp"
stefank@2314 39 #ifdef TARGET_ARCH_x86
stefank@2314 40 # include "nativeInst_x86.hpp"
stefank@2314 41 # include "vmreg_x86.inline.hpp"
stefank@2314 42 #endif
aoqi@1 43 #ifdef TARGET_ARCH_mips
aoqi@1 44 # include "nativeInst_mips.hpp"
aoqi@1 45 # include "vmreg_mips.inline.hpp"
aoqi@1 46 #endif
stefank@2314 47 #ifdef TARGET_ARCH_sparc
stefank@2314 48 # include "nativeInst_sparc.hpp"
stefank@2314 49 # include "vmreg_sparc.inline.hpp"
stefank@2314 50 #endif
stefank@2314 51 #ifdef TARGET_ARCH_zero
stefank@2314 52 # include "nativeInst_zero.hpp"
stefank@2314 53 # include "vmreg_zero.inline.hpp"
stefank@2314 54 #endif
bobv@2508 55 #ifdef TARGET_ARCH_arm
bobv@2508 56 # include "nativeInst_arm.hpp"
bobv@2508 57 # include "vmreg_arm.inline.hpp"
bobv@2508 58 #endif
bobv@2508 59 #ifdef TARGET_ARCH_ppc
bobv@2508 60 # include "nativeInst_ppc.hpp"
bobv@2508 61 # include "vmreg_ppc.inline.hpp"
bobv@2508 62 #endif
duke@435 63
duke@435 64
duke@435 65 void LIR_Assembler::patching_epilog(PatchingStub* patch, LIR_PatchCode patch_code, Register obj, CodeEmitInfo* info) {
duke@435 66 // we must have enough patching space so that call can be inserted
duke@435 67 while ((intx) _masm->pc() - (intx) patch->pc_start() < NativeCall::instruction_size) {
duke@435 68 _masm->nop();
duke@435 69 }
duke@435 70 patch->install(_masm, patch_code, obj, info);
neliasso@6688 71 append_code_stub(patch);
duke@435 72
duke@435 73 #ifdef ASSERT
roland@2174 74 Bytecodes::Code code = info->scope()->method()->java_code_at_bci(info->stack()->bci());
duke@435 75 if (patch->id() == PatchingStub::access_field_id) {
duke@435 76 switch (code) {
duke@435 77 case Bytecodes::_putstatic:
duke@435 78 case Bytecodes::_getstatic:
duke@435 79 case Bytecodes::_putfield:
duke@435 80 case Bytecodes::_getfield:
duke@435 81 break;
duke@435 82 default:
duke@435 83 ShouldNotReachHere();
duke@435 84 }
duke@435 85 } else if (patch->id() == PatchingStub::load_klass_id) {
duke@435 86 switch (code) {
duke@435 87 case Bytecodes::_new:
duke@435 88 case Bytecodes::_anewarray:
duke@435 89 case Bytecodes::_multianewarray:
duke@435 90 case Bytecodes::_instanceof:
duke@435 91 case Bytecodes::_checkcast:
coleenp@4037 92 break;
coleenp@4037 93 default:
coleenp@4037 94 ShouldNotReachHere();
coleenp@4037 95 }
coleenp@4037 96 } else if (patch->id() == PatchingStub::load_mirror_id) {
coleenp@4037 97 switch (code) {
coleenp@4037 98 case Bytecodes::_putstatic:
coleenp@4037 99 case Bytecodes::_getstatic:
duke@435 100 case Bytecodes::_ldc:
duke@435 101 case Bytecodes::_ldc_w:
duke@435 102 break;
duke@435 103 default:
duke@435 104 ShouldNotReachHere();
duke@435 105 }
roland@5628 106 } else if (patch->id() == PatchingStub::load_appendix_id) {
roland@5628 107 Bytecodes::Code bc_raw = info->scope()->method()->raw_code_at_bci(info->stack()->bci());
roland@5628 108 assert(Bytecodes::has_optional_appendix(bc_raw), "unexpected appendix resolution");
duke@435 109 } else {
duke@435 110 ShouldNotReachHere();
duke@435 111 }
duke@435 112 #endif
duke@435 113 }
duke@435 114
roland@5628 115 PatchingStub::PatchID LIR_Assembler::patching_id(CodeEmitInfo* info) {
roland@5628 116 IRScope* scope = info->scope();
roland@5628 117 Bytecodes::Code bc_raw = scope->method()->raw_code_at_bci(info->stack()->bci());
roland@5628 118 if (Bytecodes::has_optional_appendix(bc_raw)) {
roland@5628 119 return PatchingStub::load_appendix_id;
roland@5628 120 }
roland@5628 121 return PatchingStub::load_mirror_id;
roland@5628 122 }
duke@435 123
duke@435 124 //---------------------------------------------------------------
duke@435 125
duke@435 126
duke@435 127 LIR_Assembler::LIR_Assembler(Compilation* c):
duke@435 128 _compilation(c)
duke@435 129 , _masm(c->masm())
ysr@777 130 , _bs(Universe::heap()->barrier_set())
duke@435 131 , _frame_map(c->frame_map())
duke@435 132 , _current_block(NULL)
duke@435 133 , _pending_non_safepoint(NULL)
duke@435 134 , _pending_non_safepoint_offset(0)
duke@435 135 {
duke@435 136 _slow_case_stubs = new CodeStubList();
duke@435 137 }
duke@435 138
duke@435 139
duke@435 140 LIR_Assembler::~LIR_Assembler() {
phh@9604 141 // The unwind handler label may be unbound if this destructor is invoked because of a bail-out.
phh@9604 142 // Reset it here to avoid an assertion.
phh@9604 143 _unwind_handler_entry.reset();
duke@435 144 }
duke@435 145
duke@435 146
duke@435 147 void LIR_Assembler::check_codespace() {
duke@435 148 CodeSection* cs = _masm->code_section();
iveresov@3096 149 if (cs->remaining() < (int)(NOT_LP64(1*K)LP64_ONLY(2*K))) {
duke@435 150 BAILOUT("CodeBuffer overflow");
duke@435 151 }
duke@435 152 }
duke@435 153
duke@435 154
neliasso@6688 155 void LIR_Assembler::append_code_stub(CodeStub* stub) {
duke@435 156 _slow_case_stubs->append(stub);
duke@435 157 }
duke@435 158
duke@435 159 void LIR_Assembler::emit_stubs(CodeStubList* stub_list) {
duke@435 160 for (int m = 0; m < stub_list->length(); m++) {
duke@435 161 CodeStub* s = (*stub_list)[m];
duke@435 162
duke@435 163 check_codespace();
duke@435 164 CHECK_BAILOUT();
duke@435 165
duke@435 166 #ifndef PRODUCT
duke@435 167 if (CommentedAssembly) {
duke@435 168 stringStream st;
duke@435 169 s->print_name(&st);
duke@435 170 st.print(" slow case");
duke@435 171 _masm->block_comment(st.as_string());
duke@435 172 }
duke@435 173 #endif
duke@435 174 s->emit_code(this);
duke@435 175 #ifdef ASSERT
duke@435 176 s->assert_no_unbound_labels();
duke@435 177 #endif
duke@435 178 }
duke@435 179 }
duke@435 180
duke@435 181
duke@435 182 void LIR_Assembler::emit_slow_case_stubs() {
duke@435 183 emit_stubs(_slow_case_stubs);
duke@435 184 }
duke@435 185
duke@435 186
duke@435 187 bool LIR_Assembler::needs_icache(ciMethod* method) const {
duke@435 188 return !method->is_static();
duke@435 189 }
duke@435 190
duke@435 191
duke@435 192 int LIR_Assembler::code_offset() const {
duke@435 193 return _masm->offset();
duke@435 194 }
duke@435 195
duke@435 196
duke@435 197 address LIR_Assembler::pc() const {
duke@435 198 return _masm->pc();
duke@435 199 }
duke@435 200
roland@6723 201 // To bang the stack of this compiled method we use the stack size
roland@6723 202 // that the interpreter would need in case of a deoptimization. This
roland@6723 203 // removes the need to bang the stack in the deoptimization blob which
roland@6723 204 // in turn simplifies stack overflow handling.
roland@6723 205 int LIR_Assembler::bang_size_in_bytes() const {
roland@6723 206 return MAX2(initial_frame_size_in_bytes(), _compilation->interpreter_frame_size());
roland@6723 207 }
duke@435 208
duke@435 209 void LIR_Assembler::emit_exception_entries(ExceptionInfoList* info_list) {
duke@435 210 for (int i = 0; i < info_list->length(); i++) {
duke@435 211 XHandlers* handlers = info_list->at(i)->exception_handlers();
duke@435 212
duke@435 213 for (int j = 0; j < handlers->length(); j++) {
duke@435 214 XHandler* handler = handlers->handler_at(j);
duke@435 215 assert(handler->lir_op_id() != -1, "handler not processed by LinearScan");
duke@435 216 assert(handler->entry_code() == NULL ||
duke@435 217 handler->entry_code()->instructions_list()->last()->code() == lir_branch ||
duke@435 218 handler->entry_code()->instructions_list()->last()->code() == lir_delay_slot, "last operation must be branch");
duke@435 219
duke@435 220 if (handler->entry_pco() == -1) {
duke@435 221 // entry code not emitted yet
duke@435 222 if (handler->entry_code() != NULL && handler->entry_code()->instructions_list()->length() > 1) {
duke@435 223 handler->set_entry_pco(code_offset());
duke@435 224 if (CommentedAssembly) {
duke@435 225 _masm->block_comment("Exception adapter block");
duke@435 226 }
duke@435 227 emit_lir_list(handler->entry_code());
duke@435 228 } else {
duke@435 229 handler->set_entry_pco(handler->entry_block()->exception_handler_pco());
duke@435 230 }
duke@435 231
duke@435 232 assert(handler->entry_pco() != -1, "must be set now");
duke@435 233 }
duke@435 234 }
duke@435 235 }
duke@435 236 }
duke@435 237
duke@435 238
duke@435 239 void LIR_Assembler::emit_code(BlockList* hir) {
duke@435 240 if (PrintLIR) {
duke@435 241 print_LIR(hir);
duke@435 242 }
duke@435 243
duke@435 244 int n = hir->length();
duke@435 245 for (int i = 0; i < n; i++) {
duke@435 246 emit_block(hir->at(i));
duke@435 247 CHECK_BAILOUT();
duke@435 248 }
duke@435 249
duke@435 250 flush_debug_info(code_offset());
duke@435 251
duke@435 252 DEBUG_ONLY(check_no_unbound_labels());
duke@435 253 }
duke@435 254
duke@435 255
duke@435 256 void LIR_Assembler::emit_block(BlockBegin* block) {
duke@435 257 if (block->is_set(BlockBegin::backward_branch_target_flag)) {
duke@435 258 align_backward_branch_target();
duke@435 259 }
duke@435 260
duke@435 261 // if this block is the start of an exception handler, record the
duke@435 262 // PC offset of the first instruction for later construction of
duke@435 263 // the ExceptionHandlerTable
duke@435 264 if (block->is_set(BlockBegin::exception_entry_flag)) {
duke@435 265 block->set_exception_handler_pco(code_offset());
duke@435 266 }
duke@435 267
duke@435 268 #ifndef PRODUCT
duke@435 269 if (PrintLIRWithAssembly) {
duke@435 270 // don't print Phi's
duke@435 271 InstructionPrinter ip(false);
duke@435 272 block->print(ip);
duke@435 273 }
duke@435 274 #endif /* PRODUCT */
duke@435 275
duke@435 276 assert(block->lir() != NULL, "must have LIR");
never@739 277 X86_ONLY(assert(_masm->rsp_offset() == 0, "frame size should be fixed"));
duke@435 278
duke@435 279 #ifndef PRODUCT
duke@435 280 if (CommentedAssembly) {
duke@435 281 stringStream st;
roland@2174 282 st.print_cr(" block B%d [%d, %d]", block->block_id(), block->bci(), block->end()->printable_bci());
duke@435 283 _masm->block_comment(st.as_string());
duke@435 284 }
duke@435 285 #endif
duke@435 286
duke@435 287 emit_lir_list(block->lir());
duke@435 288
never@739 289 X86_ONLY(assert(_masm->rsp_offset() == 0, "frame size should be fixed"));
duke@435 290 }
duke@435 291
duke@435 292
duke@435 293 void LIR_Assembler::emit_lir_list(LIR_List* list) {
duke@435 294 peephole(list);
duke@435 295
duke@435 296 int n = list->length();
duke@435 297 for (int i = 0; i < n; i++) {
duke@435 298 LIR_Op* op = list->at(i);
duke@435 299
duke@435 300 check_codespace();
duke@435 301 CHECK_BAILOUT();
duke@435 302
duke@435 303 #ifndef PRODUCT
duke@435 304 if (CommentedAssembly) {
duke@435 305 // Don't record out every op since that's too verbose. Print
duke@435 306 // branches since they include block and stub names. Also print
duke@435 307 // patching moves since they generate funny looking code.
duke@435 308 if (op->code() == lir_branch ||
duke@435 309 (op->code() == lir_move && op->as_Op1()->patch_code() != lir_patch_none)) {
duke@435 310 stringStream st;
duke@435 311 op->print_on(&st);
duke@435 312 _masm->block_comment(st.as_string());
duke@435 313 }
duke@435 314 }
duke@435 315 if (PrintLIRWithAssembly) {
duke@435 316 // print out the LIR operation followed by the resulting assembly
duke@435 317 list->at(i)->print(); tty->cr();
duke@435 318 }
duke@435 319 #endif /* PRODUCT */
duke@435 320
duke@435 321 op->emit_code(this);
duke@435 322
duke@435 323 if (compilation()->debug_info_recorder()->recording_non_safepoints()) {
duke@435 324 process_debug_info(op);
duke@435 325 }
duke@435 326
duke@435 327 #ifndef PRODUCT
duke@435 328 if (PrintLIRWithAssembly) {
duke@435 329 _masm->code()->decode();
duke@435 330 }
duke@435 331 #endif /* PRODUCT */
duke@435 332 }
duke@435 333 }
duke@435 334
duke@435 335 #ifdef ASSERT
duke@435 336 void LIR_Assembler::check_no_unbound_labels() {
duke@435 337 CHECK_BAILOUT();
duke@435 338
duke@435 339 for (int i = 0; i < _branch_target_blocks.length() - 1; i++) {
duke@435 340 if (!_branch_target_blocks.at(i)->label()->is_bound()) {
duke@435 341 tty->print_cr("label of block B%d is not bound", _branch_target_blocks.at(i)->block_id());
duke@435 342 assert(false, "unbound label");
duke@435 343 }
duke@435 344 }
duke@435 345 }
duke@435 346 #endif
duke@435 347
duke@435 348 //----------------------------------debug info--------------------------------
duke@435 349
duke@435 350
duke@435 351 void LIR_Assembler::add_debug_info_for_branch(CodeEmitInfo* info) {
duke@435 352 _masm->code_section()->relocate(pc(), relocInfo::poll_type);
duke@435 353 int pc_offset = code_offset();
duke@435 354 flush_debug_info(pc_offset);
duke@435 355 info->record_debug_info(compilation()->debug_info_recorder(), pc_offset);
duke@435 356 if (info->exception_handlers() != NULL) {
duke@435 357 compilation()->add_exception_handlers_for_pco(pc_offset, info->exception_handlers());
duke@435 358 }
duke@435 359 }
duke@435 360
duke@435 361
twisti@1919 362 void LIR_Assembler::add_call_info(int pc_offset, CodeEmitInfo* cinfo) {
duke@435 363 flush_debug_info(pc_offset);
twisti@1919 364 cinfo->record_debug_info(compilation()->debug_info_recorder(), pc_offset);
duke@435 365 if (cinfo->exception_handlers() != NULL) {
duke@435 366 compilation()->add_exception_handlers_for_pco(pc_offset, cinfo->exception_handlers());
duke@435 367 }
duke@435 368 }
duke@435 369
duke@435 370 static ValueStack* debug_info(Instruction* ins) {
duke@435 371 StateSplit* ss = ins->as_StateSplit();
duke@435 372 if (ss != NULL) return ss->state();
roland@2174 373 return ins->state_before();
duke@435 374 }
duke@435 375
duke@435 376 void LIR_Assembler::process_debug_info(LIR_Op* op) {
duke@435 377 Instruction* src = op->source();
duke@435 378 if (src == NULL) return;
duke@435 379 int pc_offset = code_offset();
duke@435 380 if (_pending_non_safepoint == src) {
duke@435 381 _pending_non_safepoint_offset = pc_offset;
duke@435 382 return;
duke@435 383 }
duke@435 384 ValueStack* vstack = debug_info(src);
duke@435 385 if (vstack == NULL) return;
duke@435 386 if (_pending_non_safepoint != NULL) {
duke@435 387 // Got some old debug info. Get rid of it.
roland@2174 388 if (debug_info(_pending_non_safepoint) == vstack) {
duke@435 389 _pending_non_safepoint_offset = pc_offset;
duke@435 390 return;
duke@435 391 }
duke@435 392 if (_pending_non_safepoint_offset < pc_offset) {
duke@435 393 record_non_safepoint_debug_info();
duke@435 394 }
duke@435 395 _pending_non_safepoint = NULL;
duke@435 396 }
duke@435 397 // Remember the debug info.
duke@435 398 if (pc_offset > compilation()->debug_info_recorder()->last_pc_offset()) {
duke@435 399 _pending_non_safepoint = src;
duke@435 400 _pending_non_safepoint_offset = pc_offset;
duke@435 401 }
duke@435 402 }
duke@435 403
duke@435 404 // Index caller states in s, where 0 is the oldest, 1 its callee, etc.
duke@435 405 // Return NULL if n is too large.
duke@435 406 // Returns the caller_bci for the next-younger state, also.
duke@435 407 static ValueStack* nth_oldest(ValueStack* s, int n, int& bci_result) {
duke@435 408 ValueStack* t = s;
duke@435 409 for (int i = 0; i < n; i++) {
duke@435 410 if (t == NULL) break;
duke@435 411 t = t->caller_state();
duke@435 412 }
duke@435 413 if (t == NULL) return NULL;
duke@435 414 for (;;) {
duke@435 415 ValueStack* tc = t->caller_state();
duke@435 416 if (tc == NULL) return s;
duke@435 417 t = tc;
roland@2174 418 bci_result = tc->bci();
duke@435 419 s = s->caller_state();
duke@435 420 }
duke@435 421 }
duke@435 422
duke@435 423 void LIR_Assembler::record_non_safepoint_debug_info() {
duke@435 424 int pc_offset = _pending_non_safepoint_offset;
duke@435 425 ValueStack* vstack = debug_info(_pending_non_safepoint);
roland@2174 426 int bci = vstack->bci();
duke@435 427
duke@435 428 DebugInformationRecorder* debug_info = compilation()->debug_info_recorder();
duke@435 429 assert(debug_info->recording_non_safepoints(), "sanity");
duke@435 430
duke@435 431 debug_info->add_non_safepoint(pc_offset);
duke@435 432
duke@435 433 // Visit scopes from oldest to youngest.
duke@435 434 for (int n = 0; ; n++) {
duke@435 435 int s_bci = bci;
duke@435 436 ValueStack* s = nth_oldest(vstack, n, s_bci);
duke@435 437 if (s == NULL) break;
duke@435 438 IRScope* scope = s->scope();
cfang@1335 439 //Always pass false for reexecute since these ScopeDescs are never used for deopt
roland@2174 440 debug_info->describe_scope(pc_offset, scope->method(), s->bci(), false/*reexecute*/);
duke@435 441 }
duke@435 442
duke@435 443 debug_info->end_non_safepoint(pc_offset);
duke@435 444 }
duke@435 445
duke@435 446
duke@435 447 void LIR_Assembler::add_debug_info_for_null_check_here(CodeEmitInfo* cinfo) {
duke@435 448 add_debug_info_for_null_check(code_offset(), cinfo);
duke@435 449 }
duke@435 450
duke@435 451 void LIR_Assembler::add_debug_info_for_null_check(int pc_offset, CodeEmitInfo* cinfo) {
duke@435 452 ImplicitNullCheckStub* stub = new ImplicitNullCheckStub(pc_offset, cinfo);
neliasso@6688 453 append_code_stub(stub);
duke@435 454 }
duke@435 455
duke@435 456 void LIR_Assembler::add_debug_info_for_div0_here(CodeEmitInfo* info) {
duke@435 457 add_debug_info_for_div0(code_offset(), info);
duke@435 458 }
duke@435 459
duke@435 460 void LIR_Assembler::add_debug_info_for_div0(int pc_offset, CodeEmitInfo* cinfo) {
duke@435 461 DivByZeroStub* stub = new DivByZeroStub(pc_offset, cinfo);
neliasso@6688 462 append_code_stub(stub);
duke@435 463 }
duke@435 464
duke@435 465 void LIR_Assembler::emit_rtcall(LIR_OpRTCall* op) {
duke@435 466 rt_call(op->result_opr(), op->addr(), op->arguments(), op->tmp(), op->info());
duke@435 467 }
duke@435 468
duke@435 469
duke@435 470 void LIR_Assembler::emit_call(LIR_OpJavaCall* op) {
duke@435 471 verify_oop_map(op->info());
duke@435 472
duke@435 473 if (os::is_MP()) {
duke@435 474 // must align calls sites, otherwise they can't be updated atomically on MP hardware
duke@435 475 align_call(op->code());
duke@435 476 }
duke@435 477
duke@435 478 // emit the static call stub stuff out of line
duke@435 479 emit_static_call_stub();
vkempik@8427 480 CHECK_BAILOUT();
duke@435 481
duke@435 482 switch (op->code()) {
duke@435 483 case lir_static_call:
twisti@4003 484 case lir_dynamic_call:
twisti@1730 485 call(op, relocInfo::static_call_type);
duke@435 486 break;
duke@435 487 case lir_optvirtual_call:
twisti@1730 488 call(op, relocInfo::opt_virtual_call_type);
duke@435 489 break;
duke@435 490 case lir_icvirtual_call:
twisti@1730 491 ic_call(op);
duke@435 492 break;
duke@435 493 case lir_virtual_call:
twisti@1730 494 vtable_call(op);
duke@435 495 break;
twisti@4003 496 default:
twisti@4003 497 fatal(err_msg_res("unexpected op code: %s", op->name()));
twisti@4003 498 break;
duke@435 499 }
twisti@1730 500
twisti@2046 501 // JSR 292
twisti@2046 502 // Record if this method has MethodHandle invokes.
twisti@2046 503 if (op->is_method_handle_invoke()) {
twisti@2046 504 compilation()->set_has_method_handle_invokes(true);
twisti@2046 505 }
twisti@2046 506
never@739 507 #if defined(X86) && defined(TIERED)
duke@435 508 // C2 leave fpu stack dirty clean it
duke@435 509 if (UseSSE < 2) {
duke@435 510 int i;
duke@435 511 for ( i = 1; i <= 7 ; i++ ) {
duke@435 512 ffree(i);
duke@435 513 }
duke@435 514 if (!op->result_opr()->is_float_kind()) {
duke@435 515 ffree(0);
duke@435 516 }
duke@435 517 }
never@739 518 #endif // X86 && TIERED
duke@435 519 }
duke@435 520
duke@435 521
duke@435 522 void LIR_Assembler::emit_opLabel(LIR_OpLabel* op) {
duke@435 523 _masm->bind (*(op->label()));
duke@435 524 }
duke@435 525
duke@435 526
duke@435 527 void LIR_Assembler::emit_op1(LIR_Op1* op) {
duke@435 528 switch (op->code()) {
duke@435 529 case lir_move:
duke@435 530 if (op->move_kind() == lir_move_volatile) {
duke@435 531 assert(op->patch_code() == lir_patch_none, "can't patch volatiles");
duke@435 532 volatile_move_op(op->in_opr(), op->result_opr(), op->type(), op->info());
duke@435 533 } else {
duke@435 534 move_op(op->in_opr(), op->result_opr(), op->type(),
iveresov@2344 535 op->patch_code(), op->info(), op->pop_fpu_stack(),
iveresov@2344 536 op->move_kind() == lir_move_unaligned,
iveresov@2344 537 op->move_kind() == lir_move_wide);
duke@435 538 }
duke@435 539 break;
duke@435 540
duke@435 541 case lir_prefetchr:
duke@435 542 prefetchr(op->in_opr());
duke@435 543 break;
duke@435 544
duke@435 545 case lir_prefetchw:
duke@435 546 prefetchw(op->in_opr());
duke@435 547 break;
duke@435 548
duke@435 549 case lir_roundfp: {
duke@435 550 LIR_OpRoundFP* round_op = op->as_OpRoundFP();
duke@435 551 roundfp_op(round_op->in_opr(), round_op->tmp(), round_op->result_opr(), round_op->pop_fpu_stack());
duke@435 552 break;
duke@435 553 }
duke@435 554
duke@435 555 case lir_return:
duke@435 556 return_op(op->in_opr());
duke@435 557 break;
duke@435 558
duke@435 559 case lir_safepoint:
duke@435 560 if (compilation()->debug_info_recorder()->last_pc_offset() == code_offset()) {
duke@435 561 _masm->nop();
duke@435 562 }
duke@435 563 safepoint_poll(op->in_opr(), op->info());
duke@435 564 break;
duke@435 565
duke@435 566 case lir_fxch:
duke@435 567 fxch(op->in_opr()->as_jint());
duke@435 568 break;
duke@435 569
duke@435 570 case lir_fld:
duke@435 571 fld(op->in_opr()->as_jint());
duke@435 572 break;
duke@435 573
duke@435 574 case lir_ffree:
duke@435 575 ffree(op->in_opr()->as_jint());
duke@435 576 break;
duke@435 577
duke@435 578 case lir_branch:
duke@435 579 break;
duke@435 580
duke@435 581 case lir_push:
duke@435 582 push(op->in_opr());
duke@435 583 break;
duke@435 584
duke@435 585 case lir_pop:
duke@435 586 pop(op->in_opr());
duke@435 587 break;
duke@435 588
duke@435 589 case lir_neg:
duke@435 590 negate(op->in_opr(), op->result_opr());
duke@435 591 break;
duke@435 592
duke@435 593 case lir_leal:
duke@435 594 leal(op->in_opr(), op->result_opr());
duke@435 595 break;
duke@435 596
duke@435 597 case lir_null_check:
duke@435 598 if (GenerateCompilerNullChecks) {
duke@435 599 add_debug_info_for_null_check_here(op->info());
duke@435 600
duke@435 601 if (op->in_opr()->is_single_cpu()) {
duke@435 602 _masm->null_check(op->in_opr()->as_register());
duke@435 603 } else {
duke@435 604 Unimplemented();
duke@435 605 }
duke@435 606 }
duke@435 607 break;
duke@435 608
duke@435 609 case lir_monaddr:
duke@435 610 monitor_address(op->in_opr()->as_constant_ptr()->as_jint(), op->result_opr());
duke@435 611 break;
duke@435 612
iveresov@2138 613 #ifdef SPARC
iveresov@2138 614 case lir_pack64:
iveresov@2138 615 pack64(op->in_opr(), op->result_opr());
iveresov@2138 616 break;
iveresov@2138 617
iveresov@2138 618 case lir_unpack64:
iveresov@2138 619 unpack64(op->in_opr(), op->result_opr());
iveresov@2138 620 break;
iveresov@2138 621 #endif
iveresov@2138 622
never@1813 623 case lir_unwind:
never@1813 624 unwind_op(op->in_opr());
never@1813 625 break;
never@1813 626
duke@435 627 default:
duke@435 628 Unimplemented();
duke@435 629 break;
duke@435 630 }
duke@435 631 }
duke@435 632
duke@435 633
duke@435 634 void LIR_Assembler::emit_op0(LIR_Op0* op) {
duke@435 635 switch (op->code()) {
duke@435 636 case lir_word_align: {
duke@435 637 while (code_offset() % BytesPerWord != 0) {
duke@435 638 _masm->nop();
duke@435 639 }
duke@435 640 break;
duke@435 641 }
duke@435 642
duke@435 643 case lir_nop:
duke@435 644 assert(op->info() == NULL, "not supported");
duke@435 645 _masm->nop();
duke@435 646 break;
duke@435 647
duke@435 648 case lir_label:
duke@435 649 Unimplemented();
duke@435 650 break;
duke@435 651
duke@435 652 case lir_build_frame:
duke@435 653 build_frame();
duke@435 654 break;
duke@435 655
duke@435 656 case lir_std_entry:
duke@435 657 // init offsets
duke@435 658 offsets()->set_value(CodeOffsets::OSR_Entry, _masm->offset());
duke@435 659 _masm->align(CodeEntryAlignment);
duke@435 660 if (needs_icache(compilation()->method())) {
duke@435 661 check_icache();
duke@435 662 }
duke@435 663 offsets()->set_value(CodeOffsets::Verified_Entry, _masm->offset());
duke@435 664 _masm->verified_entry();
duke@435 665 build_frame();
duke@435 666 offsets()->set_value(CodeOffsets::Frame_Complete, _masm->offset());
duke@435 667 break;
duke@435 668
duke@435 669 case lir_osr_entry:
duke@435 670 offsets()->set_value(CodeOffsets::OSR_Entry, _masm->offset());
duke@435 671 osr_entry();
duke@435 672 break;
duke@435 673
duke@435 674 case lir_24bit_FPU:
duke@435 675 set_24bit_FPU();
duke@435 676 break;
duke@435 677
duke@435 678 case lir_reset_FPU:
duke@435 679 reset_FPU();
duke@435 680 break;
duke@435 681
duke@435 682 case lir_breakpoint:
duke@435 683 breakpoint();
duke@435 684 break;
duke@435 685
duke@435 686 case lir_fpop_raw:
duke@435 687 fpop();
duke@435 688 break;
duke@435 689
duke@435 690 case lir_membar:
duke@435 691 membar();
duke@435 692 break;
duke@435 693
duke@435 694 case lir_membar_acquire:
duke@435 695 membar_acquire();
duke@435 696 break;
duke@435 697
duke@435 698 case lir_membar_release:
duke@435 699 membar_release();
duke@435 700 break;
duke@435 701
jiangli@3592 702 case lir_membar_loadload:
jiangli@3592 703 membar_loadload();
jiangli@3592 704 break;
jiangli@3592 705
jiangli@3592 706 case lir_membar_storestore:
jiangli@3592 707 membar_storestore();
jiangli@3592 708 break;
jiangli@3592 709
jiangli@3592 710 case lir_membar_loadstore:
jiangli@3592 711 membar_loadstore();
jiangli@3592 712 break;
jiangli@3592 713
jiangli@3592 714 case lir_membar_storeload:
jiangli@3592 715 membar_storeload();
jiangli@3592 716 break;
jiangli@3592 717
duke@435 718 case lir_get_thread:
duke@435 719 get_thread(op->result_opr());
duke@435 720 break;
duke@435 721
duke@435 722 default:
duke@435 723 ShouldNotReachHere();
duke@435 724 break;
duke@435 725 }
duke@435 726 }
duke@435 727
duke@435 728
duke@435 729 void LIR_Assembler::emit_op2(LIR_Op2* op) {
duke@435 730 switch (op->code()) {
fujie@9138 731 #ifndef MIPS
duke@435 732 case lir_cmp:
duke@435 733 if (op->info() != NULL) {
duke@435 734 assert(op->in_opr1()->is_address() || op->in_opr2()->is_address(),
duke@435 735 "shouldn't be codeemitinfo for non-address operands");
duke@435 736 add_debug_info_for_null_check_here(op->info()); // exception possible
duke@435 737 }
duke@435 738 comp_op(op->condition(), op->in_opr1(), op->in_opr2(), op);
duke@435 739 break;
aoqi@1 740 #else
aoqi@1 741 case lir_null_check_for_branch:
aoqi@1 742 if (op->info() != NULL) {
aoqi@1 743 assert(op->in_opr1()->is_address() || op->in_opr2()->is_address(),
aoqi@1 744 "shouldn't be codeemitinfo for non-address operands");
aoqi@1 745 add_debug_info_for_null_check_here(op->info()); // exception possible
aoqi@1 746 }
aoqi@1 747 break;
aoqi@1 748 #endif
duke@435 749
duke@435 750 case lir_cmp_l2i:
duke@435 751 case lir_cmp_fd2i:
duke@435 752 case lir_ucmp_fd2i:
duke@435 753 comp_fl2i(op->code(), op->in_opr1(), op->in_opr2(), op->result_opr(), op);
duke@435 754 break;
duke@435 755
duke@435 756 case lir_cmove:
fujie@9138 757 #ifndef MIPS
iveresov@2412 758 cmove(op->condition(), op->in_opr1(), op->in_opr2(), op->result_opr(), op->type());
aoqi@1 759 #endif
duke@435 760 break;
duke@435 761
duke@435 762 case lir_shl:
duke@435 763 case lir_shr:
duke@435 764 case lir_ushr:
duke@435 765 if (op->in_opr2()->is_constant()) {
duke@435 766 shift_op(op->code(), op->in_opr1(), op->in_opr2()->as_constant_ptr()->as_jint(), op->result_opr());
duke@435 767 } else {
roland@3787 768 shift_op(op->code(), op->in_opr1(), op->in_opr2(), op->result_opr(), op->tmp1_opr());
duke@435 769 }
duke@435 770 break;
duke@435 771
duke@435 772 case lir_add:
duke@435 773 case lir_sub:
duke@435 774 case lir_mul:
duke@435 775 case lir_mul_strictfp:
duke@435 776 case lir_div:
duke@435 777 case lir_div_strictfp:
duke@435 778 case lir_rem:
duke@435 779 assert(op->fpu_pop_count() < 2, "");
duke@435 780 arith_op(
duke@435 781 op->code(),
duke@435 782 op->in_opr1(),
duke@435 783 op->in_opr2(),
duke@435 784 op->result_opr(),
duke@435 785 op->info(),
duke@435 786 op->fpu_pop_count() == 1);
duke@435 787 break;
duke@435 788
duke@435 789 case lir_abs:
duke@435 790 case lir_sqrt:
duke@435 791 case lir_sin:
duke@435 792 case lir_tan:
duke@435 793 case lir_cos:
duke@435 794 case lir_log:
duke@435 795 case lir_log10:
roland@3787 796 case lir_exp:
roland@3787 797 case lir_pow:
duke@435 798 intrinsic_op(op->code(), op->in_opr1(), op->in_opr2(), op->result_opr(), op);
duke@435 799 break;
duke@435 800
duke@435 801 case lir_logic_and:
duke@435 802 case lir_logic_or:
duke@435 803 case lir_logic_xor:
duke@435 804 logic_op(
duke@435 805 op->code(),
duke@435 806 op->in_opr1(),
duke@435 807 op->in_opr2(),
duke@435 808 op->result_opr());
duke@435 809 break;
duke@435 810
duke@435 811 case lir_throw:
never@1813 812 throw_op(op->in_opr1(), op->in_opr2(), op->info());
duke@435 813 break;
duke@435 814
roland@4106 815 case lir_xadd:
roland@4106 816 case lir_xchg:
roland@4106 817 atomic_op(op->code(), op->in_opr1(), op->in_opr2(), op->result_opr(), op->tmp1_opr());
roland@4106 818 break;
roland@4106 819
duke@435 820 default:
duke@435 821 Unimplemented();
duke@435 822 break;
duke@435 823 }
duke@435 824 }
duke@435 825
duke@435 826
duke@435 827 void LIR_Assembler::build_frame() {
roland@6723 828 _masm->build_frame(initial_frame_size_in_bytes(), bang_size_in_bytes());
duke@435 829 }
duke@435 830
duke@435 831
duke@435 832 void LIR_Assembler::roundfp_op(LIR_Opr src, LIR_Opr tmp, LIR_Opr dest, bool pop_fpu_stack) {
duke@435 833 assert((src->is_single_fpu() && dest->is_single_stack()) ||
duke@435 834 (src->is_double_fpu() && dest->is_double_stack()),
duke@435 835 "round_fp: rounds register -> stack location");
duke@435 836
duke@435 837 reg2stack (src, dest, src->type(), pop_fpu_stack);
duke@435 838 }
duke@435 839
duke@435 840
iveresov@2344 841 void LIR_Assembler::move_op(LIR_Opr src, LIR_Opr dest, BasicType type, LIR_PatchCode patch_code, CodeEmitInfo* info, bool pop_fpu_stack, bool unaligned, bool wide) {
duke@435 842 if (src->is_register()) {
duke@435 843 if (dest->is_register()) {
duke@435 844 assert(patch_code == lir_patch_none && info == NULL, "no patching and info allowed here");
duke@435 845 reg2reg(src, dest);
duke@435 846 } else if (dest->is_stack()) {
duke@435 847 assert(patch_code == lir_patch_none && info == NULL, "no patching and info allowed here");
duke@435 848 reg2stack(src, dest, type, pop_fpu_stack);
duke@435 849 } else if (dest->is_address()) {
iveresov@2344 850 reg2mem(src, dest, type, patch_code, info, pop_fpu_stack, wide, unaligned);
duke@435 851 } else {
duke@435 852 ShouldNotReachHere();
duke@435 853 }
duke@435 854
duke@435 855 } else if (src->is_stack()) {
duke@435 856 assert(patch_code == lir_patch_none && info == NULL, "no patching and info allowed here");
duke@435 857 if (dest->is_register()) {
duke@435 858 stack2reg(src, dest, type);
duke@435 859 } else if (dest->is_stack()) {
duke@435 860 stack2stack(src, dest, type);
duke@435 861 } else {
duke@435 862 ShouldNotReachHere();
duke@435 863 }
duke@435 864
duke@435 865 } else if (src->is_constant()) {
duke@435 866 if (dest->is_register()) {
duke@435 867 const2reg(src, dest, patch_code, info); // patching is possible
duke@435 868 } else if (dest->is_stack()) {
duke@435 869 assert(patch_code == lir_patch_none && info == NULL, "no patching and info allowed here");
duke@435 870 const2stack(src, dest);
duke@435 871 } else if (dest->is_address()) {
duke@435 872 assert(patch_code == lir_patch_none, "no patching allowed here");
iveresov@2344 873 const2mem(src, dest, type, info, wide);
duke@435 874 } else {
duke@435 875 ShouldNotReachHere();
duke@435 876 }
duke@435 877
duke@435 878 } else if (src->is_address()) {
iveresov@2344 879 mem2reg(src, dest, type, patch_code, info, wide, unaligned);
duke@435 880
duke@435 881 } else {
duke@435 882 ShouldNotReachHere();
duke@435 883 }
duke@435 884 }
duke@435 885
duke@435 886
duke@435 887 void LIR_Assembler::verify_oop_map(CodeEmitInfo* info) {
duke@435 888 #ifndef PRODUCT
adlertz@6218 889 if (VerifyOops) {
duke@435 890 OopMapStream s(info->oop_map());
duke@435 891 while (!s.is_done()) {
duke@435 892 OopMapValue v = s.current();
duke@435 893 if (v.is_oop()) {
duke@435 894 VMReg r = v.reg();
duke@435 895 if (!r->is_stack()) {
duke@435 896 stringStream st;
duke@435 897 st.print("bad oop %s at %d", r->as_Register()->name(), _masm->offset());
duke@435 898 #ifdef SPARC
duke@435 899 _masm->_verify_oop(r->as_Register(), strdup(st.as_string()), __FILE__, __LINE__);
duke@435 900 #else
duke@435 901 _masm->verify_oop(r->as_Register());
duke@435 902 #endif
duke@435 903 } else {
duke@435 904 _masm->verify_stack_oop(r->reg2stack() * VMRegImpl::stack_slot_size);
duke@435 905 }
duke@435 906 }
never@2733 907 check_codespace();
never@2733 908 CHECK_BAILOUT();
never@2733 909
duke@435 910 s.next();
duke@435 911 }
duke@435 912 }
duke@435 913 #endif
duke@435 914 }

mercurial