src/share/vm/c1/c1_LIRAssembler.cpp

Sat, 01 Sep 2012 13:25:18 -0400

author
coleenp
date
Sat, 01 Sep 2012 13:25:18 -0400
changeset 4037
da91efe96a93
parent 4003
7a302948f5a4
child 4106
7eca5de9e0b6
permissions
-rw-r--r--

6964458: Reimplement class meta-data storage to use native memory
Summary: Remove PermGen, allocate meta-data in metaspace linked to class loaders, rewrite GC walking, rewrite and rename metadata to be C++ classes
Reviewed-by: jmasa, stefank, never, coleenp, kvn, brutisso, mgerdin, dholmes, jrose, twisti, roland
Contributed-by: jmasa <jon.masamitsu@oracle.com>, stefank <stefan.karlsson@oracle.com>, mgerdin <mikael.gerdin@oracle.com>, never <tom.rodriguez@oracle.com>

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

mercurial