src/share/vm/c1/c1_LIRAssembler.cpp

Wed, 27 Aug 2008 00:21:55 -0700

author
never
date
Wed, 27 Aug 2008 00:21:55 -0700
changeset 739
dc7f315e41f7
parent 435
a61af66fc99e
child 772
9ee9cf798b59
child 797
f8199438385b
permissions
-rw-r--r--

5108146: Merge i486 and amd64 cpu directories
6459804: Want client (c1) compiler for x86_64 (amd64) for faster start-up
Reviewed-by: kvn

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

mercurial