src/share/vm/c1/c1_LIRAssembler.cpp

Tue, 23 Nov 2010 13:22:55 -0800

author
stefank
date
Tue, 23 Nov 2010 13:22:55 -0800
changeset 2314
f95d63e2154a
parent 2174
f02a8bbe6ed4
child 2344
ac637b7220d1
permissions
-rw-r--r--

6989984: Use standard include model for Hospot
Summary: Replaced MakeDeps and the includeDB files with more standardized solutions.
Reviewed-by: coleenp, kvn, kamg

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

mercurial