Mon, 04 Apr 2011 19:03:35 -0700
6528013: C1 CTW failure with -XX:+VerifyOops assert(allocates2(pc),"")
Reviewed-by: kvn, iveresov
1 /*
2 * Copyright (c) 2005, 2011, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "c1/c1_Compilation.hpp"
27 #include "c1/c1_FrameMap.hpp"
28 #include "c1/c1_Instruction.hpp"
29 #include "c1/c1_LIRAssembler.hpp"
30 #include "c1/c1_LIRGenerator.hpp"
31 #include "c1/c1_ValueStack.hpp"
32 #include "ci/ciArrayKlass.hpp"
33 #include "ci/ciCPCache.hpp"
34 #include "ci/ciInstance.hpp"
35 #include "runtime/sharedRuntime.hpp"
36 #include "runtime/stubRoutines.hpp"
37 #include "utilities/bitMap.inline.hpp"
38 #ifndef SERIALGC
39 #include "gc_implementation/g1/heapRegion.hpp"
40 #endif
42 #ifdef ASSERT
43 #define __ gen()->lir(__FILE__, __LINE__)->
44 #else
45 #define __ gen()->lir()->
46 #endif
48 // TODO: ARM - Use some recognizable constant which still fits architectural constraints
49 #ifdef ARM
50 #define PATCHED_ADDR (204)
51 #else
52 #define PATCHED_ADDR (max_jint)
53 #endif
55 void PhiResolverState::reset(int max_vregs) {
56 // Initialize array sizes
57 _virtual_operands.at_put_grow(max_vregs - 1, NULL, NULL);
58 _virtual_operands.trunc_to(0);
59 _other_operands.at_put_grow(max_vregs - 1, NULL, NULL);
60 _other_operands.trunc_to(0);
61 _vreg_table.at_put_grow(max_vregs - 1, NULL, NULL);
62 _vreg_table.trunc_to(0);
63 }
67 //--------------------------------------------------------------
68 // PhiResolver
70 // Resolves cycles:
71 //
72 // r1 := r2 becomes temp := r1
73 // r2 := r1 r1 := r2
74 // r2 := temp
75 // and orders moves:
76 //
77 // r2 := r3 becomes r1 := r2
78 // r1 := r2 r2 := r3
80 PhiResolver::PhiResolver(LIRGenerator* gen, int max_vregs)
81 : _gen(gen)
82 , _state(gen->resolver_state())
83 , _temp(LIR_OprFact::illegalOpr)
84 {
85 // reinitialize the shared state arrays
86 _state.reset(max_vregs);
87 }
90 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) {
91 assert(src->is_valid(), "");
92 assert(dest->is_valid(), "");
93 __ move(src, dest);
94 }
97 void PhiResolver::move_temp_to(LIR_Opr dest) {
98 assert(_temp->is_valid(), "");
99 emit_move(_temp, dest);
100 NOT_PRODUCT(_temp = LIR_OprFact::illegalOpr);
101 }
104 void PhiResolver::move_to_temp(LIR_Opr src) {
105 assert(_temp->is_illegal(), "");
106 _temp = _gen->new_register(src->type());
107 emit_move(src, _temp);
108 }
111 // Traverse assignment graph in depth first order and generate moves in post order
112 // ie. two assignments: b := c, a := b start with node c:
113 // Call graph: move(NULL, c) -> move(c, b) -> move(b, a)
114 // Generates moves in this order: move b to a and move c to b
115 // ie. cycle a := b, b := a start with node a
116 // Call graph: move(NULL, a) -> move(a, b) -> move(b, a)
117 // Generates moves in this order: move b to temp, move a to b, move temp to a
118 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) {
119 if (!dest->visited()) {
120 dest->set_visited();
121 for (int i = dest->no_of_destinations()-1; i >= 0; i --) {
122 move(dest, dest->destination_at(i));
123 }
124 } else if (!dest->start_node()) {
125 // cylce in graph detected
126 assert(_loop == NULL, "only one loop valid!");
127 _loop = dest;
128 move_to_temp(src->operand());
129 return;
130 } // else dest is a start node
132 if (!dest->assigned()) {
133 if (_loop == dest) {
134 move_temp_to(dest->operand());
135 dest->set_assigned();
136 } else if (src != NULL) {
137 emit_move(src->operand(), dest->operand());
138 dest->set_assigned();
139 }
140 }
141 }
144 PhiResolver::~PhiResolver() {
145 int i;
146 // resolve any cycles in moves from and to virtual registers
147 for (i = virtual_operands().length() - 1; i >= 0; i --) {
148 ResolveNode* node = virtual_operands()[i];
149 if (!node->visited()) {
150 _loop = NULL;
151 move(NULL, node);
152 node->set_start_node();
153 assert(_temp->is_illegal(), "move_temp_to() call missing");
154 }
155 }
157 // generate move for move from non virtual register to abitrary destination
158 for (i = other_operands().length() - 1; i >= 0; i --) {
159 ResolveNode* node = other_operands()[i];
160 for (int j = node->no_of_destinations() - 1; j >= 0; j --) {
161 emit_move(node->operand(), node->destination_at(j)->operand());
162 }
163 }
164 }
167 ResolveNode* PhiResolver::create_node(LIR_Opr opr, bool source) {
168 ResolveNode* node;
169 if (opr->is_virtual()) {
170 int vreg_num = opr->vreg_number();
171 node = vreg_table().at_grow(vreg_num, NULL);
172 assert(node == NULL || node->operand() == opr, "");
173 if (node == NULL) {
174 node = new ResolveNode(opr);
175 vreg_table()[vreg_num] = node;
176 }
177 // Make sure that all virtual operands show up in the list when
178 // they are used as the source of a move.
179 if (source && !virtual_operands().contains(node)) {
180 virtual_operands().append(node);
181 }
182 } else {
183 assert(source, "");
184 node = new ResolveNode(opr);
185 other_operands().append(node);
186 }
187 return node;
188 }
191 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) {
192 assert(dest->is_virtual(), "");
193 // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr();
194 assert(src->is_valid(), "");
195 assert(dest->is_valid(), "");
196 ResolveNode* source = source_node(src);
197 source->append(destination_node(dest));
198 }
201 //--------------------------------------------------------------
202 // LIRItem
204 void LIRItem::set_result(LIR_Opr opr) {
205 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
206 value()->set_operand(opr);
208 if (opr->is_virtual()) {
209 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), NULL);
210 }
212 _result = opr;
213 }
215 void LIRItem::load_item() {
216 if (result()->is_illegal()) {
217 // update the items result
218 _result = value()->operand();
219 }
220 if (!result()->is_register()) {
221 LIR_Opr reg = _gen->new_register(value()->type());
222 __ move(result(), reg);
223 if (result()->is_constant()) {
224 _result = reg;
225 } else {
226 set_result(reg);
227 }
228 }
229 }
232 void LIRItem::load_for_store(BasicType type) {
233 if (_gen->can_store_as_constant(value(), type)) {
234 _result = value()->operand();
235 if (!_result->is_constant()) {
236 _result = LIR_OprFact::value_type(value()->type());
237 }
238 } else if (type == T_BYTE || type == T_BOOLEAN) {
239 load_byte_item();
240 } else {
241 load_item();
242 }
243 }
245 void LIRItem::load_item_force(LIR_Opr reg) {
246 LIR_Opr r = result();
247 if (r != reg) {
248 #if !defined(ARM) && !defined(E500V2)
249 if (r->type() != reg->type()) {
250 // moves between different types need an intervening spill slot
251 r = _gen->force_to_spill(r, reg->type());
252 }
253 #endif
254 __ move(r, reg);
255 _result = reg;
256 }
257 }
259 ciObject* LIRItem::get_jobject_constant() const {
260 ObjectType* oc = type()->as_ObjectType();
261 if (oc) {
262 return oc->constant_value();
263 }
264 return NULL;
265 }
268 jint LIRItem::get_jint_constant() const {
269 assert(is_constant() && value() != NULL, "");
270 assert(type()->as_IntConstant() != NULL, "type check");
271 return type()->as_IntConstant()->value();
272 }
275 jint LIRItem::get_address_constant() const {
276 assert(is_constant() && value() != NULL, "");
277 assert(type()->as_AddressConstant() != NULL, "type check");
278 return type()->as_AddressConstant()->value();
279 }
282 jfloat LIRItem::get_jfloat_constant() const {
283 assert(is_constant() && value() != NULL, "");
284 assert(type()->as_FloatConstant() != NULL, "type check");
285 return type()->as_FloatConstant()->value();
286 }
289 jdouble LIRItem::get_jdouble_constant() const {
290 assert(is_constant() && value() != NULL, "");
291 assert(type()->as_DoubleConstant() != NULL, "type check");
292 return type()->as_DoubleConstant()->value();
293 }
296 jlong LIRItem::get_jlong_constant() const {
297 assert(is_constant() && value() != NULL, "");
298 assert(type()->as_LongConstant() != NULL, "type check");
299 return type()->as_LongConstant()->value();
300 }
304 //--------------------------------------------------------------
307 void LIRGenerator::init() {
308 _bs = Universe::heap()->barrier_set();
309 }
312 void LIRGenerator::block_do_prolog(BlockBegin* block) {
313 #ifndef PRODUCT
314 if (PrintIRWithLIR) {
315 block->print();
316 }
317 #endif
319 // set up the list of LIR instructions
320 assert(block->lir() == NULL, "LIR list already computed for this block");
321 _lir = new LIR_List(compilation(), block);
322 block->set_lir(_lir);
324 __ branch_destination(block->label());
326 if (LIRTraceExecution &&
327 Compilation::current()->hir()->start()->block_id() != block->block_id() &&
328 !block->is_set(BlockBegin::exception_entry_flag)) {
329 assert(block->lir()->instructions_list()->length() == 1, "should come right after br_dst");
330 trace_block_entry(block);
331 }
332 }
335 void LIRGenerator::block_do_epilog(BlockBegin* block) {
336 #ifndef PRODUCT
337 if (PrintIRWithLIR) {
338 tty->cr();
339 }
340 #endif
342 // LIR_Opr for unpinned constants shouldn't be referenced by other
343 // blocks so clear them out after processing the block.
344 for (int i = 0; i < _unpinned_constants.length(); i++) {
345 _unpinned_constants.at(i)->clear_operand();
346 }
347 _unpinned_constants.trunc_to(0);
349 // clear our any registers for other local constants
350 _constants.trunc_to(0);
351 _reg_for_constants.trunc_to(0);
352 }
355 void LIRGenerator::block_do(BlockBegin* block) {
356 CHECK_BAILOUT();
358 block_do_prolog(block);
359 set_block(block);
361 for (Instruction* instr = block; instr != NULL; instr = instr->next()) {
362 if (instr->is_pinned()) do_root(instr);
363 }
365 set_block(NULL);
366 block_do_epilog(block);
367 }
370 //-------------------------LIRGenerator-----------------------------
372 // This is where the tree-walk starts; instr must be root;
373 void LIRGenerator::do_root(Value instr) {
374 CHECK_BAILOUT();
376 InstructionMark im(compilation(), instr);
378 assert(instr->is_pinned(), "use only with roots");
379 assert(instr->subst() == instr, "shouldn't have missed substitution");
381 instr->visit(this);
383 assert(!instr->has_uses() || instr->operand()->is_valid() ||
384 instr->as_Constant() != NULL || bailed_out(), "invalid item set");
385 }
388 // This is called for each node in tree; the walk stops if a root is reached
389 void LIRGenerator::walk(Value instr) {
390 InstructionMark im(compilation(), instr);
391 //stop walk when encounter a root
392 if (instr->is_pinned() && instr->as_Phi() == NULL || instr->operand()->is_valid()) {
393 assert(instr->operand() != LIR_OprFact::illegalOpr || instr->as_Constant() != NULL, "this root has not yet been visited");
394 } else {
395 assert(instr->subst() == instr, "shouldn't have missed substitution");
396 instr->visit(this);
397 // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use");
398 }
399 }
402 CodeEmitInfo* LIRGenerator::state_for(Instruction* x, ValueStack* state, bool ignore_xhandler) {
403 assert(state != NULL, "state must be defined");
405 ValueStack* s = state;
406 for_each_state(s) {
407 if (s->kind() == ValueStack::EmptyExceptionState) {
408 assert(s->stack_size() == 0 && s->locals_size() == 0 && (s->locks_size() == 0 || s->locks_size() == 1), "state must be empty");
409 continue;
410 }
412 int index;
413 Value value;
414 for_each_stack_value(s, index, value) {
415 assert(value->subst() == value, "missed substitution");
416 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
417 walk(value);
418 assert(value->operand()->is_valid(), "must be evaluated now");
419 }
420 }
422 int bci = s->bci();
423 IRScope* scope = s->scope();
424 ciMethod* method = scope->method();
426 MethodLivenessResult liveness = method->liveness_at_bci(bci);
427 if (bci == SynchronizationEntryBCI) {
428 if (x->as_ExceptionObject() || x->as_Throw()) {
429 // all locals are dead on exit from the synthetic unlocker
430 liveness.clear();
431 } else {
432 assert(x->as_MonitorEnter(), "only other case is MonitorEnter");
433 }
434 }
435 if (!liveness.is_valid()) {
436 // Degenerate or breakpointed method.
437 bailout("Degenerate or breakpointed method");
438 } else {
439 assert((int)liveness.size() == s->locals_size(), "error in use of liveness");
440 for_each_local_value(s, index, value) {
441 assert(value->subst() == value, "missed substition");
442 if (liveness.at(index) && !value->type()->is_illegal()) {
443 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
444 walk(value);
445 assert(value->operand()->is_valid(), "must be evaluated now");
446 }
447 } else {
448 // NULL out this local so that linear scan can assume that all non-NULL values are live.
449 s->invalidate_local(index);
450 }
451 }
452 }
453 }
455 return new CodeEmitInfo(state, ignore_xhandler ? NULL : x->exception_handlers());
456 }
459 CodeEmitInfo* LIRGenerator::state_for(Instruction* x) {
460 return state_for(x, x->exception_state());
461 }
464 void LIRGenerator::jobject2reg_with_patching(LIR_Opr r, ciObject* obj, CodeEmitInfo* info) {
465 if (!obj->is_loaded() || PatchALot) {
466 assert(info != NULL, "info must be set if class is not loaded");
467 __ oop2reg_patch(NULL, r, info);
468 } else {
469 // no patching needed
470 __ oop2reg(obj->constant_encoding(), r);
471 }
472 }
475 void LIRGenerator::array_range_check(LIR_Opr array, LIR_Opr index,
476 CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info) {
477 CodeStub* stub = new RangeCheckStub(range_check_info, index);
478 if (index->is_constant()) {
479 cmp_mem_int(lir_cond_belowEqual, array, arrayOopDesc::length_offset_in_bytes(),
480 index->as_jint(), null_check_info);
481 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
482 } else {
483 cmp_reg_mem(lir_cond_aboveEqual, index, array,
484 arrayOopDesc::length_offset_in_bytes(), T_INT, null_check_info);
485 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
486 }
487 }
490 void LIRGenerator::nio_range_check(LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info) {
491 CodeStub* stub = new RangeCheckStub(info, index, true);
492 if (index->is_constant()) {
493 cmp_mem_int(lir_cond_belowEqual, buffer, java_nio_Buffer::limit_offset(), index->as_jint(), info);
494 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
495 } else {
496 cmp_reg_mem(lir_cond_aboveEqual, index, buffer,
497 java_nio_Buffer::limit_offset(), T_INT, info);
498 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
499 }
500 __ move(index, result);
501 }
505 void LIRGenerator::arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp_op, CodeEmitInfo* info) {
506 LIR_Opr result_op = result;
507 LIR_Opr left_op = left;
508 LIR_Opr right_op = right;
510 if (TwoOperandLIRForm && left_op != result_op) {
511 assert(right_op != result_op, "malformed");
512 __ move(left_op, result_op);
513 left_op = result_op;
514 }
516 switch(code) {
517 case Bytecodes::_dadd:
518 case Bytecodes::_fadd:
519 case Bytecodes::_ladd:
520 case Bytecodes::_iadd: __ add(left_op, right_op, result_op); break;
521 case Bytecodes::_fmul:
522 case Bytecodes::_lmul: __ mul(left_op, right_op, result_op); break;
524 case Bytecodes::_dmul:
525 {
526 if (is_strictfp) {
527 __ mul_strictfp(left_op, right_op, result_op, tmp_op); break;
528 } else {
529 __ mul(left_op, right_op, result_op); break;
530 }
531 }
532 break;
534 case Bytecodes::_imul:
535 {
536 bool did_strength_reduce = false;
538 if (right->is_constant()) {
539 int c = right->as_jint();
540 if (is_power_of_2(c)) {
541 // do not need tmp here
542 __ shift_left(left_op, exact_log2(c), result_op);
543 did_strength_reduce = true;
544 } else {
545 did_strength_reduce = strength_reduce_multiply(left_op, c, result_op, tmp_op);
546 }
547 }
548 // we couldn't strength reduce so just emit the multiply
549 if (!did_strength_reduce) {
550 __ mul(left_op, right_op, result_op);
551 }
552 }
553 break;
555 case Bytecodes::_dsub:
556 case Bytecodes::_fsub:
557 case Bytecodes::_lsub:
558 case Bytecodes::_isub: __ sub(left_op, right_op, result_op); break;
560 case Bytecodes::_fdiv: __ div (left_op, right_op, result_op); break;
561 // ldiv and lrem are implemented with a direct runtime call
563 case Bytecodes::_ddiv:
564 {
565 if (is_strictfp) {
566 __ div_strictfp (left_op, right_op, result_op, tmp_op); break;
567 } else {
568 __ div (left_op, right_op, result_op); break;
569 }
570 }
571 break;
573 case Bytecodes::_drem:
574 case Bytecodes::_frem: __ rem (left_op, right_op, result_op); break;
576 default: ShouldNotReachHere();
577 }
578 }
581 void LIRGenerator::arithmetic_op_int(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp) {
582 arithmetic_op(code, result, left, right, false, tmp);
583 }
586 void LIRGenerator::arithmetic_op_long(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info) {
587 arithmetic_op(code, result, left, right, false, LIR_OprFact::illegalOpr, info);
588 }
591 void LIRGenerator::arithmetic_op_fpu(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp) {
592 arithmetic_op(code, result, left, right, is_strictfp, tmp);
593 }
596 void LIRGenerator::shift_op(Bytecodes::Code code, LIR_Opr result_op, LIR_Opr value, LIR_Opr count, LIR_Opr tmp) {
597 if (TwoOperandLIRForm && value != result_op) {
598 assert(count != result_op, "malformed");
599 __ move(value, result_op);
600 value = result_op;
601 }
603 assert(count->is_constant() || count->is_register(), "must be");
604 switch(code) {
605 case Bytecodes::_ishl:
606 case Bytecodes::_lshl: __ shift_left(value, count, result_op, tmp); break;
607 case Bytecodes::_ishr:
608 case Bytecodes::_lshr: __ shift_right(value, count, result_op, tmp); break;
609 case Bytecodes::_iushr:
610 case Bytecodes::_lushr: __ unsigned_shift_right(value, count, result_op, tmp); break;
611 default: ShouldNotReachHere();
612 }
613 }
616 void LIRGenerator::logic_op (Bytecodes::Code code, LIR_Opr result_op, LIR_Opr left_op, LIR_Opr right_op) {
617 if (TwoOperandLIRForm && left_op != result_op) {
618 assert(right_op != result_op, "malformed");
619 __ move(left_op, result_op);
620 left_op = result_op;
621 }
623 switch(code) {
624 case Bytecodes::_iand:
625 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break;
627 case Bytecodes::_ior:
628 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break;
630 case Bytecodes::_ixor:
631 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break;
633 default: ShouldNotReachHere();
634 }
635 }
638 void LIRGenerator::monitor_enter(LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info) {
639 if (!GenerateSynchronizationCode) return;
640 // for slow path, use debug info for state after successful locking
641 CodeStub* slow_path = new MonitorEnterStub(object, lock, info);
642 __ load_stack_address_monitor(monitor_no, lock);
643 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
644 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception);
645 }
648 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
649 if (!GenerateSynchronizationCode) return;
650 // setup registers
651 LIR_Opr hdr = lock;
652 lock = new_hdr;
653 CodeStub* slow_path = new MonitorExitStub(lock, UseFastLocking, monitor_no);
654 __ load_stack_address_monitor(monitor_no, lock);
655 __ unlock_object(hdr, object, lock, scratch, slow_path);
656 }
659 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) {
660 jobject2reg_with_patching(klass_reg, klass, info);
661 // If klass is not loaded we do not know if the klass has finalizers:
662 if (UseFastNewInstance && klass->is_loaded()
663 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
665 Runtime1::StubID stub_id = klass->is_initialized() ? Runtime1::fast_new_instance_id : Runtime1::fast_new_instance_init_check_id;
667 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
669 assert(klass->is_loaded(), "must be loaded");
670 // allocate space for instance
671 assert(klass->size_helper() >= 0, "illegal instance size");
672 const int instance_size = align_object_size(klass->size_helper());
673 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
674 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
675 } else {
676 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, Runtime1::new_instance_id);
677 __ branch(lir_cond_always, T_ILLEGAL, slow_path);
678 __ branch_destination(slow_path->continuation());
679 }
680 }
683 static bool is_constant_zero(Instruction* inst) {
684 IntConstant* c = inst->type()->as_IntConstant();
685 if (c) {
686 return (c->value() == 0);
687 }
688 return false;
689 }
692 static bool positive_constant(Instruction* inst) {
693 IntConstant* c = inst->type()->as_IntConstant();
694 if (c) {
695 return (c->value() >= 0);
696 }
697 return false;
698 }
701 static ciArrayKlass* as_array_klass(ciType* type) {
702 if (type != NULL && type->is_array_klass() && type->is_loaded()) {
703 return (ciArrayKlass*)type;
704 } else {
705 return NULL;
706 }
707 }
709 static Value maxvalue(IfOp* ifop) {
710 switch (ifop->cond()) {
711 case If::eql: return NULL;
712 case If::neq: return NULL;
713 case If::lss: // x < y ? x : y
714 case If::leq: // x <= y ? x : y
715 if (ifop->x() == ifop->tval() &&
716 ifop->y() == ifop->fval()) return ifop->y();
717 return NULL;
719 case If::gtr: // x > y ? y : x
720 case If::geq: // x >= y ? y : x
721 if (ifop->x() == ifop->tval() &&
722 ifop->y() == ifop->fval()) return ifop->y();
723 return NULL;
725 }
726 }
728 static ciType* phi_declared_type(Phi* phi) {
729 ciType* t = phi->operand_at(0)->declared_type();
730 if (t == NULL) {
731 return NULL;
732 }
733 for(int i = 1; i < phi->operand_count(); i++) {
734 if (t != phi->operand_at(i)->declared_type()) {
735 return NULL;
736 }
737 }
738 return t;
739 }
741 void LIRGenerator::arraycopy_helper(Intrinsic* x, int* flagsp, ciArrayKlass** expected_typep) {
742 Instruction* src = x->argument_at(0);
743 Instruction* src_pos = x->argument_at(1);
744 Instruction* dst = x->argument_at(2);
745 Instruction* dst_pos = x->argument_at(3);
746 Instruction* length = x->argument_at(4);
748 // first try to identify the likely type of the arrays involved
749 ciArrayKlass* expected_type = NULL;
750 bool is_exact = false, src_objarray = false, dst_objarray = false;
751 {
752 ciArrayKlass* src_exact_type = as_array_klass(src->exact_type());
753 ciArrayKlass* src_declared_type = as_array_klass(src->declared_type());
754 Phi* phi;
755 if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) {
756 src_declared_type = as_array_klass(phi_declared_type(phi));
757 }
758 ciArrayKlass* dst_exact_type = as_array_klass(dst->exact_type());
759 ciArrayKlass* dst_declared_type = as_array_klass(dst->declared_type());
760 if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) {
761 dst_declared_type = as_array_klass(phi_declared_type(phi));
762 }
764 if (src_exact_type != NULL && src_exact_type == dst_exact_type) {
765 // the types exactly match so the type is fully known
766 is_exact = true;
767 expected_type = src_exact_type;
768 } else if (dst_exact_type != NULL && dst_exact_type->is_obj_array_klass()) {
769 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
770 ciArrayKlass* src_type = NULL;
771 if (src_exact_type != NULL && src_exact_type->is_obj_array_klass()) {
772 src_type = (ciArrayKlass*) src_exact_type;
773 } else if (src_declared_type != NULL && src_declared_type->is_obj_array_klass()) {
774 src_type = (ciArrayKlass*) src_declared_type;
775 }
776 if (src_type != NULL) {
777 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
778 is_exact = true;
779 expected_type = dst_type;
780 }
781 }
782 }
783 // at least pass along a good guess
784 if (expected_type == NULL) expected_type = dst_exact_type;
785 if (expected_type == NULL) expected_type = src_declared_type;
786 if (expected_type == NULL) expected_type = dst_declared_type;
788 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
789 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
790 }
792 // if a probable array type has been identified, figure out if any
793 // of the required checks for a fast case can be elided.
794 int flags = LIR_OpArrayCopy::all_flags;
796 if (!src_objarray)
797 flags &= ~LIR_OpArrayCopy::src_objarray;
798 if (!dst_objarray)
799 flags &= ~LIR_OpArrayCopy::dst_objarray;
801 if (!x->arg_needs_null_check(0))
802 flags &= ~LIR_OpArrayCopy::src_null_check;
803 if (!x->arg_needs_null_check(2))
804 flags &= ~LIR_OpArrayCopy::dst_null_check;
807 if (expected_type != NULL) {
808 Value length_limit = NULL;
810 IfOp* ifop = length->as_IfOp();
811 if (ifop != NULL) {
812 // look for expressions like min(v, a.length) which ends up as
813 // x > y ? y : x or x >= y ? y : x
814 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
815 ifop->x() == ifop->fval() &&
816 ifop->y() == ifop->tval()) {
817 length_limit = ifop->y();
818 }
819 }
821 // try to skip null checks and range checks
822 NewArray* src_array = src->as_NewArray();
823 if (src_array != NULL) {
824 flags &= ~LIR_OpArrayCopy::src_null_check;
825 if (length_limit != NULL &&
826 src_array->length() == length_limit &&
827 is_constant_zero(src_pos)) {
828 flags &= ~LIR_OpArrayCopy::src_range_check;
829 }
830 }
832 NewArray* dst_array = dst->as_NewArray();
833 if (dst_array != NULL) {
834 flags &= ~LIR_OpArrayCopy::dst_null_check;
835 if (length_limit != NULL &&
836 dst_array->length() == length_limit &&
837 is_constant_zero(dst_pos)) {
838 flags &= ~LIR_OpArrayCopy::dst_range_check;
839 }
840 }
842 // check from incoming constant values
843 if (positive_constant(src_pos))
844 flags &= ~LIR_OpArrayCopy::src_pos_positive_check;
845 if (positive_constant(dst_pos))
846 flags &= ~LIR_OpArrayCopy::dst_pos_positive_check;
847 if (positive_constant(length))
848 flags &= ~LIR_OpArrayCopy::length_positive_check;
850 // see if the range check can be elided, which might also imply
851 // that src or dst is non-null.
852 ArrayLength* al = length->as_ArrayLength();
853 if (al != NULL) {
854 if (al->array() == src) {
855 // it's the length of the source array
856 flags &= ~LIR_OpArrayCopy::length_positive_check;
857 flags &= ~LIR_OpArrayCopy::src_null_check;
858 if (is_constant_zero(src_pos))
859 flags &= ~LIR_OpArrayCopy::src_range_check;
860 }
861 if (al->array() == dst) {
862 // it's the length of the destination array
863 flags &= ~LIR_OpArrayCopy::length_positive_check;
864 flags &= ~LIR_OpArrayCopy::dst_null_check;
865 if (is_constant_zero(dst_pos))
866 flags &= ~LIR_OpArrayCopy::dst_range_check;
867 }
868 }
869 if (is_exact) {
870 flags &= ~LIR_OpArrayCopy::type_check;
871 }
872 }
874 IntConstant* src_int = src_pos->type()->as_IntConstant();
875 IntConstant* dst_int = dst_pos->type()->as_IntConstant();
876 if (src_int && dst_int) {
877 int s_offs = src_int->value();
878 int d_offs = dst_int->value();
879 if (src_int->value() >= dst_int->value()) {
880 flags &= ~LIR_OpArrayCopy::overlapping;
881 }
882 if (expected_type != NULL) {
883 BasicType t = expected_type->element_type()->basic_type();
884 int element_size = type2aelembytes(t);
885 if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
886 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) {
887 flags &= ~LIR_OpArrayCopy::unaligned;
888 }
889 }
890 } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) {
891 // src and dest positions are the same, or dst is zero so assume
892 // nonoverlapping copy.
893 flags &= ~LIR_OpArrayCopy::overlapping;
894 }
896 if (src == dst) {
897 // moving within a single array so no type checks are needed
898 if (flags & LIR_OpArrayCopy::type_check) {
899 flags &= ~LIR_OpArrayCopy::type_check;
900 }
901 }
902 *flagsp = flags;
903 *expected_typep = (ciArrayKlass*)expected_type;
904 }
907 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) {
908 assert(opr->is_register(), "why spill if item is not register?");
910 if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) {
911 LIR_Opr result = new_register(T_FLOAT);
912 set_vreg_flag(result, must_start_in_memory);
913 assert(opr->is_register(), "only a register can be spilled");
914 assert(opr->value_type()->is_float(), "rounding only for floats available");
915 __ roundfp(opr, LIR_OprFact::illegalOpr, result);
916 return result;
917 }
918 return opr;
919 }
922 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) {
923 assert(type2size[t] == type2size[value->type()], "size mismatch");
924 if (!value->is_register()) {
925 // force into a register
926 LIR_Opr r = new_register(value->type());
927 __ move(value, r);
928 value = r;
929 }
931 // create a spill location
932 LIR_Opr tmp = new_register(t);
933 set_vreg_flag(tmp, LIRGenerator::must_start_in_memory);
935 // move from register to spill
936 __ move(value, tmp);
937 return tmp;
938 }
940 void LIRGenerator::profile_branch(If* if_instr, If::Condition cond) {
941 if (if_instr->should_profile()) {
942 ciMethod* method = if_instr->profiled_method();
943 assert(method != NULL, "method should be set if branch is profiled");
944 ciMethodData* md = method->method_data_or_null();
945 assert(md != NULL, "Sanity");
946 ciProfileData* data = md->bci_to_data(if_instr->profiled_bci());
947 assert(data != NULL, "must have profiling data");
948 assert(data->is_BranchData(), "need BranchData for two-way branches");
949 int taken_count_offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
950 int not_taken_count_offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
951 if (if_instr->is_swapped()) {
952 int t = taken_count_offset;
953 taken_count_offset = not_taken_count_offset;
954 not_taken_count_offset = t;
955 }
957 LIR_Opr md_reg = new_register(T_OBJECT);
958 __ oop2reg(md->constant_encoding(), md_reg);
960 LIR_Opr data_offset_reg = new_pointer_register();
961 __ cmove(lir_cond(cond),
962 LIR_OprFact::intptrConst(taken_count_offset),
963 LIR_OprFact::intptrConst(not_taken_count_offset),
964 data_offset_reg, as_BasicType(if_instr->x()->type()));
966 // MDO cells are intptr_t, so the data_reg width is arch-dependent.
967 LIR_Opr data_reg = new_pointer_register();
968 LIR_Address* data_addr = new LIR_Address(md_reg, data_offset_reg, data_reg->type());
969 __ move(data_addr, data_reg);
970 // Use leal instead of add to avoid destroying condition codes on x86
971 LIR_Address* fake_incr_value = new LIR_Address(data_reg, DataLayout::counter_increment, T_INT);
972 __ leal(LIR_OprFact::address(fake_incr_value), data_reg);
973 __ move(data_reg, data_addr);
974 }
975 }
977 // Phi technique:
978 // This is about passing live values from one basic block to the other.
979 // In code generated with Java it is rather rare that more than one
980 // value is on the stack from one basic block to the other.
981 // We optimize our technique for efficient passing of one value
982 // (of type long, int, double..) but it can be extended.
983 // When entering or leaving a basic block, all registers and all spill
984 // slots are release and empty. We use the released registers
985 // and spill slots to pass the live values from one block
986 // to the other. The topmost value, i.e., the value on TOS of expression
987 // stack is passed in registers. All other values are stored in spilling
988 // area. Every Phi has an index which designates its spill slot
989 // At exit of a basic block, we fill the register(s) and spill slots.
990 // At entry of a basic block, the block_prolog sets up the content of phi nodes
991 // and locks necessary registers and spilling slots.
994 // move current value to referenced phi function
995 void LIRGenerator::move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val) {
996 Phi* phi = sux_val->as_Phi();
997 // cur_val can be null without phi being null in conjunction with inlining
998 if (phi != NULL && cur_val != NULL && cur_val != phi && !phi->is_illegal()) {
999 LIR_Opr operand = cur_val->operand();
1000 if (cur_val->operand()->is_illegal()) {
1001 assert(cur_val->as_Constant() != NULL || cur_val->as_Local() != NULL,
1002 "these can be produced lazily");
1003 operand = operand_for_instruction(cur_val);
1004 }
1005 resolver->move(operand, operand_for_instruction(phi));
1006 }
1007 }
1010 // Moves all stack values into their PHI position
1011 void LIRGenerator::move_to_phi(ValueStack* cur_state) {
1012 BlockBegin* bb = block();
1013 if (bb->number_of_sux() == 1) {
1014 BlockBegin* sux = bb->sux_at(0);
1015 assert(sux->number_of_preds() > 0, "invalid CFG");
1017 // a block with only one predecessor never has phi functions
1018 if (sux->number_of_preds() > 1) {
1019 int max_phis = cur_state->stack_size() + cur_state->locals_size();
1020 PhiResolver resolver(this, _virtual_register_number + max_phis * 2);
1022 ValueStack* sux_state = sux->state();
1023 Value sux_value;
1024 int index;
1026 assert(cur_state->scope() == sux_state->scope(), "not matching");
1027 assert(cur_state->locals_size() == sux_state->locals_size(), "not matching");
1028 assert(cur_state->stack_size() == sux_state->stack_size(), "not matching");
1030 for_each_stack_value(sux_state, index, sux_value) {
1031 move_to_phi(&resolver, cur_state->stack_at(index), sux_value);
1032 }
1034 for_each_local_value(sux_state, index, sux_value) {
1035 move_to_phi(&resolver, cur_state->local_at(index), sux_value);
1036 }
1038 assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal");
1039 }
1040 }
1041 }
1044 LIR_Opr LIRGenerator::new_register(BasicType type) {
1045 int vreg = _virtual_register_number;
1046 // add a little fudge factor for the bailout, since the bailout is
1047 // only checked periodically. This gives a few extra registers to
1048 // hand out before we really run out, which helps us keep from
1049 // tripping over assertions.
1050 if (vreg + 20 >= LIR_OprDesc::vreg_max) {
1051 bailout("out of virtual registers");
1052 if (vreg + 2 >= LIR_OprDesc::vreg_max) {
1053 // wrap it around
1054 _virtual_register_number = LIR_OprDesc::vreg_base;
1055 }
1056 }
1057 _virtual_register_number += 1;
1058 return LIR_OprFact::virtual_register(vreg, type);
1059 }
1062 // Try to lock using register in hint
1063 LIR_Opr LIRGenerator::rlock(Value instr) {
1064 return new_register(instr->type());
1065 }
1068 // does an rlock and sets result
1069 LIR_Opr LIRGenerator::rlock_result(Value x) {
1070 LIR_Opr reg = rlock(x);
1071 set_result(x, reg);
1072 return reg;
1073 }
1076 // does an rlock and sets result
1077 LIR_Opr LIRGenerator::rlock_result(Value x, BasicType type) {
1078 LIR_Opr reg;
1079 switch (type) {
1080 case T_BYTE:
1081 case T_BOOLEAN:
1082 reg = rlock_byte(type);
1083 break;
1084 default:
1085 reg = rlock(x);
1086 break;
1087 }
1089 set_result(x, reg);
1090 return reg;
1091 }
1094 //---------------------------------------------------------------------
1095 ciObject* LIRGenerator::get_jobject_constant(Value value) {
1096 ObjectType* oc = value->type()->as_ObjectType();
1097 if (oc) {
1098 return oc->constant_value();
1099 }
1100 return NULL;
1101 }
1104 void LIRGenerator::do_ExceptionObject(ExceptionObject* x) {
1105 assert(block()->is_set(BlockBegin::exception_entry_flag), "ExceptionObject only allowed in exception handler block");
1106 assert(block()->next() == x, "ExceptionObject must be first instruction of block");
1108 // no moves are created for phi functions at the begin of exception
1109 // handlers, so assign operands manually here
1110 for_each_phi_fun(block(), phi,
1111 operand_for_instruction(phi));
1113 LIR_Opr thread_reg = getThreadPointer();
1114 __ move_wide(new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT),
1115 exceptionOopOpr());
1116 __ move_wide(LIR_OprFact::oopConst(NULL),
1117 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_oop_offset()), T_OBJECT));
1118 __ move_wide(LIR_OprFact::oopConst(NULL),
1119 new LIR_Address(thread_reg, in_bytes(JavaThread::exception_pc_offset()), T_OBJECT));
1121 LIR_Opr result = new_register(T_OBJECT);
1122 __ move(exceptionOopOpr(), result);
1123 set_result(x, result);
1124 }
1127 //----------------------------------------------------------------------
1128 //----------------------------------------------------------------------
1129 //----------------------------------------------------------------------
1130 //----------------------------------------------------------------------
1131 // visitor functions
1132 //----------------------------------------------------------------------
1133 //----------------------------------------------------------------------
1134 //----------------------------------------------------------------------
1135 //----------------------------------------------------------------------
1137 void LIRGenerator::do_Phi(Phi* x) {
1138 // phi functions are never visited directly
1139 ShouldNotReachHere();
1140 }
1143 // Code for a constant is generated lazily unless the constant is frequently used and can't be inlined.
1144 void LIRGenerator::do_Constant(Constant* x) {
1145 if (x->state_before() != NULL) {
1146 // Any constant with a ValueStack requires patching so emit the patch here
1147 LIR_Opr reg = rlock_result(x);
1148 CodeEmitInfo* info = state_for(x, x->state_before());
1149 __ oop2reg_patch(NULL, reg, info);
1150 } else if (x->use_count() > 1 && !can_inline_as_constant(x)) {
1151 if (!x->is_pinned()) {
1152 // unpinned constants are handled specially so that they can be
1153 // put into registers when they are used multiple times within a
1154 // block. After the block completes their operand will be
1155 // cleared so that other blocks can't refer to that register.
1156 set_result(x, load_constant(x));
1157 } else {
1158 LIR_Opr res = x->operand();
1159 if (!res->is_valid()) {
1160 res = LIR_OprFact::value_type(x->type());
1161 }
1162 if (res->is_constant()) {
1163 LIR_Opr reg = rlock_result(x);
1164 __ move(res, reg);
1165 } else {
1166 set_result(x, res);
1167 }
1168 }
1169 } else {
1170 set_result(x, LIR_OprFact::value_type(x->type()));
1171 }
1172 }
1175 void LIRGenerator::do_Local(Local* x) {
1176 // operand_for_instruction has the side effect of setting the result
1177 // so there's no need to do it here.
1178 operand_for_instruction(x);
1179 }
1182 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) {
1183 Unimplemented();
1184 }
1187 void LIRGenerator::do_Return(Return* x) {
1188 if (compilation()->env()->dtrace_method_probes()) {
1189 BasicTypeList signature;
1190 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
1191 signature.append(T_OBJECT); // methodOop
1192 LIR_OprList* args = new LIR_OprList();
1193 args->append(getThreadPointer());
1194 LIR_Opr meth = new_register(T_OBJECT);
1195 __ oop2reg(method()->constant_encoding(), meth);
1196 args->append(meth);
1197 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), voidType, NULL);
1198 }
1200 if (x->type()->is_void()) {
1201 __ return_op(LIR_OprFact::illegalOpr);
1202 } else {
1203 LIR_Opr reg = result_register_for(x->type(), /*callee=*/true);
1204 LIRItem result(x->result(), this);
1206 result.load_item_force(reg);
1207 __ return_op(result.result());
1208 }
1209 set_no_result(x);
1210 }
1213 // Example: object.getClass ()
1214 void LIRGenerator::do_getClass(Intrinsic* x) {
1215 assert(x->number_of_arguments() == 1, "wrong type");
1217 LIRItem rcvr(x->argument_at(0), this);
1218 rcvr.load_item();
1219 LIR_Opr result = rlock_result(x);
1221 // need to perform the null check on the rcvr
1222 CodeEmitInfo* info = NULL;
1223 if (x->needs_null_check()) {
1224 info = state_for(x);
1225 }
1226 __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_OBJECT), result, info);
1227 __ move_wide(new LIR_Address(result, Klass::java_mirror_offset_in_bytes() +
1228 klassOopDesc::klass_part_offset_in_bytes(), T_OBJECT), result);
1229 }
1232 // Example: Thread.currentThread()
1233 void LIRGenerator::do_currentThread(Intrinsic* x) {
1234 assert(x->number_of_arguments() == 0, "wrong type");
1235 LIR_Opr reg = rlock_result(x);
1236 __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg);
1237 }
1240 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) {
1241 assert(x->number_of_arguments() == 1, "wrong type");
1242 LIRItem receiver(x->argument_at(0), this);
1244 receiver.load_item();
1245 BasicTypeList signature;
1246 signature.append(T_OBJECT); // receiver
1247 LIR_OprList* args = new LIR_OprList();
1248 args->append(receiver.result());
1249 CodeEmitInfo* info = state_for(x, x->state());
1250 call_runtime(&signature, args,
1251 CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)),
1252 voidType, info);
1254 set_no_result(x);
1255 }
1258 //------------------------local access--------------------------------------
1260 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) {
1261 if (x->operand()->is_illegal()) {
1262 Constant* c = x->as_Constant();
1263 if (c != NULL) {
1264 x->set_operand(LIR_OprFact::value_type(c->type()));
1265 } else {
1266 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
1267 // allocate a virtual register for this local or phi
1268 x->set_operand(rlock(x));
1269 _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL);
1270 }
1271 }
1272 return x->operand();
1273 }
1276 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) {
1277 if (opr->is_virtual()) {
1278 return instruction_for_vreg(opr->vreg_number());
1279 }
1280 return NULL;
1281 }
1284 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) {
1285 if (reg_num < _instruction_for_operand.length()) {
1286 return _instruction_for_operand.at(reg_num);
1287 }
1288 return NULL;
1289 }
1292 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) {
1293 if (_vreg_flags.size_in_bits() == 0) {
1294 BitMap2D temp(100, num_vreg_flags);
1295 temp.clear();
1296 _vreg_flags = temp;
1297 }
1298 _vreg_flags.at_put_grow(vreg_num, f, true);
1299 }
1301 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) {
1302 if (!_vreg_flags.is_valid_index(vreg_num, f)) {
1303 return false;
1304 }
1305 return _vreg_flags.at(vreg_num, f);
1306 }
1309 // Block local constant handling. This code is useful for keeping
1310 // unpinned constants and constants which aren't exposed in the IR in
1311 // registers. Unpinned Constant instructions have their operands
1312 // cleared when the block is finished so that other blocks can't end
1313 // up referring to their registers.
1315 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1316 assert(!x->is_pinned(), "only for unpinned constants");
1317 _unpinned_constants.append(x);
1318 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1319 }
1322 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1323 BasicType t = c->type();
1324 for (int i = 0; i < _constants.length(); i++) {
1325 LIR_Const* other = _constants.at(i);
1326 if (t == other->type()) {
1327 switch (t) {
1328 case T_INT:
1329 case T_FLOAT:
1330 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1331 break;
1332 case T_LONG:
1333 case T_DOUBLE:
1334 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1335 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1336 break;
1337 case T_OBJECT:
1338 if (c->as_jobject() != other->as_jobject()) continue;
1339 break;
1340 }
1341 return _reg_for_constants.at(i);
1342 }
1343 }
1345 LIR_Opr result = new_register(t);
1346 __ move((LIR_Opr)c, result);
1347 _constants.append(c);
1348 _reg_for_constants.append(result);
1349 return result;
1350 }
1352 // Various barriers
1354 void LIRGenerator::pre_barrier(LIR_Opr addr_opr, bool patch, CodeEmitInfo* info) {
1355 // Do the pre-write barrier, if any.
1356 switch (_bs->kind()) {
1357 #ifndef SERIALGC
1358 case BarrierSet::G1SATBCT:
1359 case BarrierSet::G1SATBCTLogging:
1360 G1SATBCardTableModRef_pre_barrier(addr_opr, patch, info);
1361 break;
1362 #endif // SERIALGC
1363 case BarrierSet::CardTableModRef:
1364 case BarrierSet::CardTableExtension:
1365 // No pre barriers
1366 break;
1367 case BarrierSet::ModRef:
1368 case BarrierSet::Other:
1369 // No pre barriers
1370 break;
1371 default :
1372 ShouldNotReachHere();
1374 }
1375 }
1377 void LIRGenerator::post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1378 switch (_bs->kind()) {
1379 #ifndef SERIALGC
1380 case BarrierSet::G1SATBCT:
1381 case BarrierSet::G1SATBCTLogging:
1382 G1SATBCardTableModRef_post_barrier(addr, new_val);
1383 break;
1384 #endif // SERIALGC
1385 case BarrierSet::CardTableModRef:
1386 case BarrierSet::CardTableExtension:
1387 CardTableModRef_post_barrier(addr, new_val);
1388 break;
1389 case BarrierSet::ModRef:
1390 case BarrierSet::Other:
1391 // No post barriers
1392 break;
1393 default :
1394 ShouldNotReachHere();
1395 }
1396 }
1398 ////////////////////////////////////////////////////////////////////////
1399 #ifndef SERIALGC
1401 void LIRGenerator::G1SATBCardTableModRef_pre_barrier(LIR_Opr addr_opr, bool patch, CodeEmitInfo* info) {
1402 if (G1DisablePreBarrier) return;
1404 // First we test whether marking is in progress.
1405 BasicType flag_type;
1406 if (in_bytes(PtrQueue::byte_width_of_active()) == 4) {
1407 flag_type = T_INT;
1408 } else {
1409 guarantee(in_bytes(PtrQueue::byte_width_of_active()) == 1,
1410 "Assumption");
1411 flag_type = T_BYTE;
1412 }
1413 LIR_Opr thrd = getThreadPointer();
1414 LIR_Address* mark_active_flag_addr =
1415 new LIR_Address(thrd,
1416 in_bytes(JavaThread::satb_mark_queue_offset() +
1417 PtrQueue::byte_offset_of_active()),
1418 flag_type);
1419 // Read the marking-in-progress flag.
1420 LIR_Opr flag_val = new_register(T_INT);
1421 __ load(mark_active_flag_addr, flag_val);
1423 LIR_PatchCode pre_val_patch_code =
1424 patch ? lir_patch_normal : lir_patch_none;
1426 LIR_Opr pre_val = new_register(T_OBJECT);
1428 __ cmp(lir_cond_notEqual, flag_val, LIR_OprFact::intConst(0));
1429 if (!addr_opr->is_address()) {
1430 assert(addr_opr->is_register(), "must be");
1431 addr_opr = LIR_OprFact::address(new LIR_Address(addr_opr, T_OBJECT));
1432 }
1433 CodeStub* slow = new G1PreBarrierStub(addr_opr, pre_val, pre_val_patch_code,
1434 info);
1435 __ branch(lir_cond_notEqual, T_INT, slow);
1436 __ branch_destination(slow->continuation());
1437 }
1439 void LIRGenerator::G1SATBCardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1440 if (G1DisablePostBarrier) return;
1442 // If the "new_val" is a constant NULL, no barrier is necessary.
1443 if (new_val->is_constant() &&
1444 new_val->as_constant_ptr()->as_jobject() == NULL) return;
1446 if (!new_val->is_register()) {
1447 LIR_Opr new_val_reg = new_register(T_OBJECT);
1448 if (new_val->is_constant()) {
1449 __ move(new_val, new_val_reg);
1450 } else {
1451 __ leal(new_val, new_val_reg);
1452 }
1453 new_val = new_val_reg;
1454 }
1455 assert(new_val->is_register(), "must be a register at this point");
1457 if (addr->is_address()) {
1458 LIR_Address* address = addr->as_address_ptr();
1459 LIR_Opr ptr = new_register(T_OBJECT);
1460 if (!address->index()->is_valid() && address->disp() == 0) {
1461 __ move(address->base(), ptr);
1462 } else {
1463 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1464 __ leal(addr, ptr);
1465 }
1466 addr = ptr;
1467 }
1468 assert(addr->is_register(), "must be a register at this point");
1470 LIR_Opr xor_res = new_pointer_register();
1471 LIR_Opr xor_shift_res = new_pointer_register();
1472 if (TwoOperandLIRForm ) {
1473 __ move(addr, xor_res);
1474 __ logical_xor(xor_res, new_val, xor_res);
1475 __ move(xor_res, xor_shift_res);
1476 __ unsigned_shift_right(xor_shift_res,
1477 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1478 xor_shift_res,
1479 LIR_OprDesc::illegalOpr());
1480 } else {
1481 __ logical_xor(addr, new_val, xor_res);
1482 __ unsigned_shift_right(xor_res,
1483 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1484 xor_shift_res,
1485 LIR_OprDesc::illegalOpr());
1486 }
1488 if (!new_val->is_register()) {
1489 LIR_Opr new_val_reg = new_register(T_OBJECT);
1490 __ leal(new_val, new_val_reg);
1491 new_val = new_val_reg;
1492 }
1493 assert(new_val->is_register(), "must be a register at this point");
1495 __ cmp(lir_cond_notEqual, xor_shift_res, LIR_OprFact::intptrConst(NULL_WORD));
1497 CodeStub* slow = new G1PostBarrierStub(addr, new_val);
1498 __ branch(lir_cond_notEqual, LP64_ONLY(T_LONG) NOT_LP64(T_INT), slow);
1499 __ branch_destination(slow->continuation());
1500 }
1502 #endif // SERIALGC
1503 ////////////////////////////////////////////////////////////////////////
1505 void LIRGenerator::CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1507 assert(sizeof(*((CardTableModRefBS*)_bs)->byte_map_base) == sizeof(jbyte), "adjust this code");
1508 LIR_Const* card_table_base = new LIR_Const(((CardTableModRefBS*)_bs)->byte_map_base);
1509 if (addr->is_address()) {
1510 LIR_Address* address = addr->as_address_ptr();
1511 LIR_Opr ptr = new_register(T_OBJECT);
1512 if (!address->index()->is_valid() && address->disp() == 0) {
1513 __ move(address->base(), ptr);
1514 } else {
1515 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1516 __ leal(addr, ptr);
1517 }
1518 addr = ptr;
1519 }
1520 assert(addr->is_register(), "must be a register at this point");
1522 #ifdef ARM
1523 // TODO: ARM - move to platform-dependent code
1524 LIR_Opr tmp = FrameMap::R14_opr;
1525 if (VM_Version::supports_movw()) {
1526 __ move((LIR_Opr)card_table_base, tmp);
1527 } else {
1528 __ move(new LIR_Address(FrameMap::Rthread_opr, in_bytes(JavaThread::card_table_base_offset()), T_ADDRESS), tmp);
1529 }
1531 CardTableModRefBS* ct = (CardTableModRefBS*)_bs;
1532 LIR_Address *card_addr = new LIR_Address(tmp, addr, (LIR_Address::Scale) -CardTableModRefBS::card_shift, 0, T_BYTE);
1533 if(((int)ct->byte_map_base & 0xff) == 0) {
1534 __ move(tmp, card_addr);
1535 } else {
1536 LIR_Opr tmp_zero = new_register(T_INT);
1537 __ move(LIR_OprFact::intConst(0), tmp_zero);
1538 __ move(tmp_zero, card_addr);
1539 }
1540 #else // ARM
1541 LIR_Opr tmp = new_pointer_register();
1542 if (TwoOperandLIRForm) {
1543 __ move(addr, tmp);
1544 __ unsigned_shift_right(tmp, CardTableModRefBS::card_shift, tmp);
1545 } else {
1546 __ unsigned_shift_right(addr, CardTableModRefBS::card_shift, tmp);
1547 }
1548 if (can_inline_as_constant(card_table_base)) {
1549 __ move(LIR_OprFact::intConst(0),
1550 new LIR_Address(tmp, card_table_base->as_jint(), T_BYTE));
1551 } else {
1552 __ move(LIR_OprFact::intConst(0),
1553 new LIR_Address(tmp, load_constant(card_table_base),
1554 T_BYTE));
1555 }
1556 #endif // ARM
1557 }
1560 //------------------------field access--------------------------------------
1562 // Comment copied form templateTable_i486.cpp
1563 // ----------------------------------------------------------------------------
1564 // Volatile variables demand their effects be made known to all CPU's in
1565 // order. Store buffers on most chips allow reads & writes to reorder; the
1566 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1567 // memory barrier (i.e., it's not sufficient that the interpreter does not
1568 // reorder volatile references, the hardware also must not reorder them).
1569 //
1570 // According to the new Java Memory Model (JMM):
1571 // (1) All volatiles are serialized wrt to each other.
1572 // ALSO reads & writes act as aquire & release, so:
1573 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1574 // the read float up to before the read. It's OK for non-volatile memory refs
1575 // that happen before the volatile read to float down below it.
1576 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1577 // that happen BEFORE the write float down to after the write. It's OK for
1578 // non-volatile memory refs that happen after the volatile write to float up
1579 // before it.
1580 //
1581 // We only put in barriers around volatile refs (they are expensive), not
1582 // _between_ memory refs (that would require us to track the flavor of the
1583 // previous memory refs). Requirements (2) and (3) require some barriers
1584 // before volatile stores and after volatile loads. These nearly cover
1585 // requirement (1) but miss the volatile-store-volatile-load case. This final
1586 // case is placed after volatile-stores although it could just as well go
1587 // before volatile-loads.
1590 void LIRGenerator::do_StoreField(StoreField* x) {
1591 bool needs_patching = x->needs_patching();
1592 bool is_volatile = x->field()->is_volatile();
1593 BasicType field_type = x->field_type();
1594 bool is_oop = (field_type == T_ARRAY || field_type == T_OBJECT);
1596 CodeEmitInfo* info = NULL;
1597 if (needs_patching) {
1598 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1599 info = state_for(x, x->state_before());
1600 } else if (x->needs_null_check()) {
1601 NullCheck* nc = x->explicit_null_check();
1602 if (nc == NULL) {
1603 info = state_for(x);
1604 } else {
1605 info = state_for(nc);
1606 }
1607 }
1610 LIRItem object(x->obj(), this);
1611 LIRItem value(x->value(), this);
1613 object.load_item();
1615 if (is_volatile || needs_patching) {
1616 // load item if field is volatile (fewer special cases for volatiles)
1617 // load item if field not initialized
1618 // load item if field not constant
1619 // because of code patching we cannot inline constants
1620 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1621 value.load_byte_item();
1622 } else {
1623 value.load_item();
1624 }
1625 } else {
1626 value.load_for_store(field_type);
1627 }
1629 set_no_result(x);
1631 #ifndef PRODUCT
1632 if (PrintNotLoaded && needs_patching) {
1633 tty->print_cr(" ###class not loaded at store_%s bci %d",
1634 x->is_static() ? "static" : "field", x->printable_bci());
1635 }
1636 #endif
1638 if (x->needs_null_check() &&
1639 (needs_patching ||
1640 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1641 // emit an explicit null check because the offset is too large
1642 __ null_check(object.result(), new CodeEmitInfo(info));
1643 }
1645 LIR_Address* address;
1646 if (needs_patching) {
1647 // we need to patch the offset in the instruction so don't allow
1648 // generate_address to try to be smart about emitting the -1.
1649 // Otherwise the patching code won't know how to find the
1650 // instruction to patch.
1651 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1652 } else {
1653 address = generate_address(object.result(), x->offset(), field_type);
1654 }
1656 if (is_volatile && os::is_MP()) {
1657 __ membar_release();
1658 }
1660 if (is_oop) {
1661 // Do the pre-write barrier, if any.
1662 pre_barrier(LIR_OprFact::address(address),
1663 needs_patching,
1664 (info ? new CodeEmitInfo(info) : NULL));
1665 }
1667 if (is_volatile && !needs_patching) {
1668 volatile_field_store(value.result(), address, info);
1669 } else {
1670 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1671 __ store(value.result(), address, info, patch_code);
1672 }
1674 if (is_oop) {
1675 // Store to object so mark the card of the header
1676 post_barrier(object.result(), value.result());
1677 }
1679 if (is_volatile && os::is_MP()) {
1680 __ membar();
1681 }
1682 }
1685 void LIRGenerator::do_LoadField(LoadField* x) {
1686 bool needs_patching = x->needs_patching();
1687 bool is_volatile = x->field()->is_volatile();
1688 BasicType field_type = x->field_type();
1690 CodeEmitInfo* info = NULL;
1691 if (needs_patching) {
1692 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1693 info = state_for(x, x->state_before());
1694 } else if (x->needs_null_check()) {
1695 NullCheck* nc = x->explicit_null_check();
1696 if (nc == NULL) {
1697 info = state_for(x);
1698 } else {
1699 info = state_for(nc);
1700 }
1701 }
1703 LIRItem object(x->obj(), this);
1705 object.load_item();
1707 #ifndef PRODUCT
1708 if (PrintNotLoaded && needs_patching) {
1709 tty->print_cr(" ###class not loaded at load_%s bci %d",
1710 x->is_static() ? "static" : "field", x->printable_bci());
1711 }
1712 #endif
1714 if (x->needs_null_check() &&
1715 (needs_patching ||
1716 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1717 // emit an explicit null check because the offset is too large
1718 __ null_check(object.result(), new CodeEmitInfo(info));
1719 }
1721 LIR_Opr reg = rlock_result(x, field_type);
1722 LIR_Address* address;
1723 if (needs_patching) {
1724 // we need to patch the offset in the instruction so don't allow
1725 // generate_address to try to be smart about emitting the -1.
1726 // Otherwise the patching code won't know how to find the
1727 // instruction to patch.
1728 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1729 } else {
1730 address = generate_address(object.result(), x->offset(), field_type);
1731 }
1733 if (is_volatile && !needs_patching) {
1734 volatile_field_load(address, reg, info);
1735 } else {
1736 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1737 __ load(address, reg, info, patch_code);
1738 }
1740 if (is_volatile && os::is_MP()) {
1741 __ membar_acquire();
1742 }
1743 }
1746 //------------------------java.nio.Buffer.checkIndex------------------------
1748 // int java.nio.Buffer.checkIndex(int)
1749 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
1750 // NOTE: by the time we are in checkIndex() we are guaranteed that
1751 // the buffer is non-null (because checkIndex is package-private and
1752 // only called from within other methods in the buffer).
1753 assert(x->number_of_arguments() == 2, "wrong type");
1754 LIRItem buf (x->argument_at(0), this);
1755 LIRItem index(x->argument_at(1), this);
1756 buf.load_item();
1757 index.load_item();
1759 LIR_Opr result = rlock_result(x);
1760 if (GenerateRangeChecks) {
1761 CodeEmitInfo* info = state_for(x);
1762 CodeStub* stub = new RangeCheckStub(info, index.result(), true);
1763 if (index.result()->is_constant()) {
1764 cmp_mem_int(lir_cond_belowEqual, buf.result(), java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
1765 __ branch(lir_cond_belowEqual, T_INT, stub);
1766 } else {
1767 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf.result(),
1768 java_nio_Buffer::limit_offset(), T_INT, info);
1769 __ branch(lir_cond_aboveEqual, T_INT, stub);
1770 }
1771 __ move(index.result(), result);
1772 } else {
1773 // Just load the index into the result register
1774 __ move(index.result(), result);
1775 }
1776 }
1779 //------------------------array access--------------------------------------
1782 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
1783 LIRItem array(x->array(), this);
1784 array.load_item();
1785 LIR_Opr reg = rlock_result(x);
1787 CodeEmitInfo* info = NULL;
1788 if (x->needs_null_check()) {
1789 NullCheck* nc = x->explicit_null_check();
1790 if (nc == NULL) {
1791 info = state_for(x);
1792 } else {
1793 info = state_for(nc);
1794 }
1795 }
1796 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
1797 }
1800 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
1801 bool use_length = x->length() != NULL;
1802 LIRItem array(x->array(), this);
1803 LIRItem index(x->index(), this);
1804 LIRItem length(this);
1805 bool needs_range_check = true;
1807 if (use_length) {
1808 needs_range_check = x->compute_needs_range_check();
1809 if (needs_range_check) {
1810 length.set_instruction(x->length());
1811 length.load_item();
1812 }
1813 }
1815 array.load_item();
1816 if (index.is_constant() && can_inline_as_constant(x->index())) {
1817 // let it be a constant
1818 index.dont_load_item();
1819 } else {
1820 index.load_item();
1821 }
1823 CodeEmitInfo* range_check_info = state_for(x);
1824 CodeEmitInfo* null_check_info = NULL;
1825 if (x->needs_null_check()) {
1826 NullCheck* nc = x->explicit_null_check();
1827 if (nc != NULL) {
1828 null_check_info = state_for(nc);
1829 } else {
1830 null_check_info = range_check_info;
1831 }
1832 }
1834 // emit array address setup early so it schedules better
1835 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), false);
1837 if (GenerateRangeChecks && needs_range_check) {
1838 if (use_length) {
1839 // TODO: use a (modified) version of array_range_check that does not require a
1840 // constant length to be loaded to a register
1841 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1842 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result()));
1843 } else {
1844 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1845 // The range check performs the null check, so clear it out for the load
1846 null_check_info = NULL;
1847 }
1848 }
1850 __ move(array_addr, rlock_result(x, x->elt_type()), null_check_info);
1851 }
1854 void LIRGenerator::do_NullCheck(NullCheck* x) {
1855 if (x->can_trap()) {
1856 LIRItem value(x->obj(), this);
1857 value.load_item();
1858 CodeEmitInfo* info = state_for(x);
1859 __ null_check(value.result(), info);
1860 }
1861 }
1864 void LIRGenerator::do_Throw(Throw* x) {
1865 LIRItem exception(x->exception(), this);
1866 exception.load_item();
1867 set_no_result(x);
1868 LIR_Opr exception_opr = exception.result();
1869 CodeEmitInfo* info = state_for(x, x->state());
1871 #ifndef PRODUCT
1872 if (PrintC1Statistics) {
1873 increment_counter(Runtime1::throw_count_address(), T_INT);
1874 }
1875 #endif
1877 // check if the instruction has an xhandler in any of the nested scopes
1878 bool unwind = false;
1879 if (info->exception_handlers()->length() == 0) {
1880 // this throw is not inside an xhandler
1881 unwind = true;
1882 } else {
1883 // get some idea of the throw type
1884 bool type_is_exact = true;
1885 ciType* throw_type = x->exception()->exact_type();
1886 if (throw_type == NULL) {
1887 type_is_exact = false;
1888 throw_type = x->exception()->declared_type();
1889 }
1890 if (throw_type != NULL && throw_type->is_instance_klass()) {
1891 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
1892 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
1893 }
1894 }
1896 // do null check before moving exception oop into fixed register
1897 // to avoid a fixed interval with an oop during the null check.
1898 // Use a copy of the CodeEmitInfo because debug information is
1899 // different for null_check and throw.
1900 if (GenerateCompilerNullChecks &&
1901 (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL)) {
1902 // if the exception object wasn't created using new then it might be null.
1903 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
1904 }
1906 if (compilation()->env()->jvmti_can_post_on_exceptions()) {
1907 // we need to go through the exception lookup path to get JVMTI
1908 // notification done
1909 unwind = false;
1910 }
1912 // move exception oop into fixed register
1913 __ move(exception_opr, exceptionOopOpr());
1915 if (unwind) {
1916 __ unwind_exception(exceptionOopOpr());
1917 } else {
1918 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
1919 }
1920 }
1923 void LIRGenerator::do_RoundFP(RoundFP* x) {
1924 LIRItem input(x->input(), this);
1925 input.load_item();
1926 LIR_Opr input_opr = input.result();
1927 assert(input_opr->is_register(), "why round if value is not in a register?");
1928 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
1929 if (input_opr->is_single_fpu()) {
1930 set_result(x, round_item(input_opr)); // This code path not currently taken
1931 } else {
1932 LIR_Opr result = new_register(T_DOUBLE);
1933 set_vreg_flag(result, must_start_in_memory);
1934 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
1935 set_result(x, result);
1936 }
1937 }
1939 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
1940 LIRItem base(x->base(), this);
1941 LIRItem idx(this);
1943 base.load_item();
1944 if (x->has_index()) {
1945 idx.set_instruction(x->index());
1946 idx.load_nonconstant();
1947 }
1949 LIR_Opr reg = rlock_result(x, x->basic_type());
1951 int log2_scale = 0;
1952 if (x->has_index()) {
1953 assert(x->index()->type()->tag() == intTag, "should not find non-int index");
1954 log2_scale = x->log2_scale();
1955 }
1957 assert(!x->has_index() || idx.value() == x->index(), "should match");
1959 LIR_Opr base_op = base.result();
1960 #ifndef _LP64
1961 if (x->base()->type()->tag() == longTag) {
1962 base_op = new_register(T_INT);
1963 __ convert(Bytecodes::_l2i, base.result(), base_op);
1964 } else {
1965 assert(x->base()->type()->tag() == intTag, "must be");
1966 }
1967 #endif
1969 BasicType dst_type = x->basic_type();
1970 LIR_Opr index_op = idx.result();
1972 LIR_Address* addr;
1973 if (index_op->is_constant()) {
1974 assert(log2_scale == 0, "must not have a scale");
1975 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
1976 } else {
1977 #ifdef X86
1978 #ifdef _LP64
1979 if (!index_op->is_illegal() && index_op->type() == T_INT) {
1980 LIR_Opr tmp = new_pointer_register();
1981 __ convert(Bytecodes::_i2l, index_op, tmp);
1982 index_op = tmp;
1983 }
1984 #endif
1985 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
1986 #elif defined(ARM)
1987 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
1988 #else
1989 if (index_op->is_illegal() || log2_scale == 0) {
1990 #ifdef _LP64
1991 if (!index_op->is_illegal() && index_op->type() == T_INT) {
1992 LIR_Opr tmp = new_pointer_register();
1993 __ convert(Bytecodes::_i2l, index_op, tmp);
1994 index_op = tmp;
1995 }
1996 #endif
1997 addr = new LIR_Address(base_op, index_op, dst_type);
1998 } else {
1999 LIR_Opr tmp = new_pointer_register();
2000 __ shift_left(index_op, log2_scale, tmp);
2001 addr = new LIR_Address(base_op, tmp, dst_type);
2002 }
2003 #endif
2004 }
2006 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2007 __ unaligned_move(addr, reg);
2008 } else {
2009 if (dst_type == T_OBJECT && x->is_wide()) {
2010 __ move_wide(addr, reg);
2011 } else {
2012 __ move(addr, reg);
2013 }
2014 }
2015 }
2018 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2019 int log2_scale = 0;
2020 BasicType type = x->basic_type();
2022 if (x->has_index()) {
2023 assert(x->index()->type()->tag() == intTag, "should not find non-int index");
2024 log2_scale = x->log2_scale();
2025 }
2027 LIRItem base(x->base(), this);
2028 LIRItem value(x->value(), this);
2029 LIRItem idx(this);
2031 base.load_item();
2032 if (x->has_index()) {
2033 idx.set_instruction(x->index());
2034 idx.load_item();
2035 }
2037 if (type == T_BYTE || type == T_BOOLEAN) {
2038 value.load_byte_item();
2039 } else {
2040 value.load_item();
2041 }
2043 set_no_result(x);
2045 LIR_Opr base_op = base.result();
2046 #ifndef _LP64
2047 if (x->base()->type()->tag() == longTag) {
2048 base_op = new_register(T_INT);
2049 __ convert(Bytecodes::_l2i, base.result(), base_op);
2050 } else {
2051 assert(x->base()->type()->tag() == intTag, "must be");
2052 }
2053 #endif
2055 LIR_Opr index_op = idx.result();
2056 if (log2_scale != 0) {
2057 // temporary fix (platform dependent code without shift on Intel would be better)
2058 index_op = new_pointer_register();
2059 #ifdef _LP64
2060 if(idx.result()->type() == T_INT) {
2061 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2062 } else {
2063 #endif
2064 // TODO: ARM also allows embedded shift in the address
2065 __ move(idx.result(), index_op);
2066 #ifdef _LP64
2067 }
2068 #endif
2069 __ shift_left(index_op, log2_scale, index_op);
2070 }
2071 #ifdef _LP64
2072 else if(!index_op->is_illegal() && index_op->type() == T_INT) {
2073 LIR_Opr tmp = new_pointer_register();
2074 __ convert(Bytecodes::_i2l, index_op, tmp);
2075 index_op = tmp;
2076 }
2077 #endif
2079 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2080 __ move(value.result(), addr);
2081 }
2084 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2085 BasicType type = x->basic_type();
2086 LIRItem src(x->object(), this);
2087 LIRItem off(x->offset(), this);
2089 off.load_item();
2090 src.load_item();
2092 LIR_Opr reg = reg = rlock_result(x, x->basic_type());
2094 get_Object_unsafe(reg, src.result(), off.result(), type, x->is_volatile());
2095 if (x->is_volatile() && os::is_MP()) __ membar_acquire();
2096 }
2099 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2100 BasicType type = x->basic_type();
2101 LIRItem src(x->object(), this);
2102 LIRItem off(x->offset(), this);
2103 LIRItem data(x->value(), this);
2105 src.load_item();
2106 if (type == T_BOOLEAN || type == T_BYTE) {
2107 data.load_byte_item();
2108 } else {
2109 data.load_item();
2110 }
2111 off.load_item();
2113 set_no_result(x);
2115 if (x->is_volatile() && os::is_MP()) __ membar_release();
2116 put_Object_unsafe(src.result(), off.result(), data.result(), type, x->is_volatile());
2117 if (x->is_volatile() && os::is_MP()) __ membar();
2118 }
2121 void LIRGenerator::do_UnsafePrefetch(UnsafePrefetch* x, bool is_store) {
2122 LIRItem src(x->object(), this);
2123 LIRItem off(x->offset(), this);
2125 src.load_item();
2126 if (off.is_constant() && can_inline_as_constant(x->offset())) {
2127 // let it be a constant
2128 off.dont_load_item();
2129 } else {
2130 off.load_item();
2131 }
2133 set_no_result(x);
2135 LIR_Address* addr = generate_address(src.result(), off.result(), 0, 0, T_BYTE);
2136 __ prefetch(addr, is_store);
2137 }
2140 void LIRGenerator::do_UnsafePrefetchRead(UnsafePrefetchRead* x) {
2141 do_UnsafePrefetch(x, false);
2142 }
2145 void LIRGenerator::do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) {
2146 do_UnsafePrefetch(x, true);
2147 }
2150 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2151 int lng = x->length();
2153 for (int i = 0; i < lng; i++) {
2154 SwitchRange* one_range = x->at(i);
2155 int low_key = one_range->low_key();
2156 int high_key = one_range->high_key();
2157 BlockBegin* dest = one_range->sux();
2158 if (low_key == high_key) {
2159 __ cmp(lir_cond_equal, value, low_key);
2160 __ branch(lir_cond_equal, T_INT, dest);
2161 } else if (high_key - low_key == 1) {
2162 __ cmp(lir_cond_equal, value, low_key);
2163 __ branch(lir_cond_equal, T_INT, dest);
2164 __ cmp(lir_cond_equal, value, high_key);
2165 __ branch(lir_cond_equal, T_INT, dest);
2166 } else {
2167 LabelObj* L = new LabelObj();
2168 __ cmp(lir_cond_less, value, low_key);
2169 __ branch(lir_cond_less, L->label());
2170 __ cmp(lir_cond_lessEqual, value, high_key);
2171 __ branch(lir_cond_lessEqual, T_INT, dest);
2172 __ branch_destination(L->label());
2173 }
2174 }
2175 __ jump(default_sux);
2176 }
2179 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2180 SwitchRangeList* res = new SwitchRangeList();
2181 int len = x->length();
2182 if (len > 0) {
2183 BlockBegin* sux = x->sux_at(0);
2184 int key = x->lo_key();
2185 BlockBegin* default_sux = x->default_sux();
2186 SwitchRange* range = new SwitchRange(key, sux);
2187 for (int i = 0; i < len; i++, key++) {
2188 BlockBegin* new_sux = x->sux_at(i);
2189 if (sux == new_sux) {
2190 // still in same range
2191 range->set_high_key(key);
2192 } else {
2193 // skip tests which explicitly dispatch to the default
2194 if (sux != default_sux) {
2195 res->append(range);
2196 }
2197 range = new SwitchRange(key, new_sux);
2198 }
2199 sux = new_sux;
2200 }
2201 if (res->length() == 0 || res->last() != range) res->append(range);
2202 }
2203 return res;
2204 }
2207 // we expect the keys to be sorted by increasing value
2208 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2209 SwitchRangeList* res = new SwitchRangeList();
2210 int len = x->length();
2211 if (len > 0) {
2212 BlockBegin* default_sux = x->default_sux();
2213 int key = x->key_at(0);
2214 BlockBegin* sux = x->sux_at(0);
2215 SwitchRange* range = new SwitchRange(key, sux);
2216 for (int i = 1; i < len; i++) {
2217 int new_key = x->key_at(i);
2218 BlockBegin* new_sux = x->sux_at(i);
2219 if (key+1 == new_key && sux == new_sux) {
2220 // still in same range
2221 range->set_high_key(new_key);
2222 } else {
2223 // skip tests which explicitly dispatch to the default
2224 if (range->sux() != default_sux) {
2225 res->append(range);
2226 }
2227 range = new SwitchRange(new_key, new_sux);
2228 }
2229 key = new_key;
2230 sux = new_sux;
2231 }
2232 if (res->length() == 0 || res->last() != range) res->append(range);
2233 }
2234 return res;
2235 }
2238 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2239 LIRItem tag(x->tag(), this);
2240 tag.load_item();
2241 set_no_result(x);
2243 if (x->is_safepoint()) {
2244 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2245 }
2247 // move values into phi locations
2248 move_to_phi(x->state());
2250 int lo_key = x->lo_key();
2251 int hi_key = x->hi_key();
2252 int len = x->length();
2253 LIR_Opr value = tag.result();
2254 if (UseTableRanges) {
2255 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2256 } else {
2257 for (int i = 0; i < len; i++) {
2258 __ cmp(lir_cond_equal, value, i + lo_key);
2259 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2260 }
2261 __ jump(x->default_sux());
2262 }
2263 }
2266 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2267 LIRItem tag(x->tag(), this);
2268 tag.load_item();
2269 set_no_result(x);
2271 if (x->is_safepoint()) {
2272 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2273 }
2275 // move values into phi locations
2276 move_to_phi(x->state());
2278 LIR_Opr value = tag.result();
2279 if (UseTableRanges) {
2280 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2281 } else {
2282 int len = x->length();
2283 for (int i = 0; i < len; i++) {
2284 __ cmp(lir_cond_equal, value, x->key_at(i));
2285 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2286 }
2287 __ jump(x->default_sux());
2288 }
2289 }
2292 void LIRGenerator::do_Goto(Goto* x) {
2293 set_no_result(x);
2295 if (block()->next()->as_OsrEntry()) {
2296 // need to free up storage used for OSR entry point
2297 LIR_Opr osrBuffer = block()->next()->operand();
2298 BasicTypeList signature;
2299 signature.append(T_INT);
2300 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2301 __ move(osrBuffer, cc->args()->at(0));
2302 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2303 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2304 }
2306 if (x->is_safepoint()) {
2307 ValueStack* state = x->state_before() ? x->state_before() : x->state();
2309 // increment backedge counter if needed
2310 CodeEmitInfo* info = state_for(x, state);
2311 increment_backedge_counter(info, info->stack()->bci());
2312 CodeEmitInfo* safepoint_info = state_for(x, state);
2313 __ safepoint(safepoint_poll_register(), safepoint_info);
2314 }
2316 // Gotos can be folded Ifs, handle this case.
2317 if (x->should_profile()) {
2318 ciMethod* method = x->profiled_method();
2319 assert(method != NULL, "method should be set if branch is profiled");
2320 ciMethodData* md = method->method_data_or_null();
2321 assert(md != NULL, "Sanity");
2322 ciProfileData* data = md->bci_to_data(x->profiled_bci());
2323 assert(data != NULL, "must have profiling data");
2324 int offset;
2325 if (x->direction() == Goto::taken) {
2326 assert(data->is_BranchData(), "need BranchData for two-way branches");
2327 offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2328 } else if (x->direction() == Goto::not_taken) {
2329 assert(data->is_BranchData(), "need BranchData for two-way branches");
2330 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2331 } else {
2332 assert(data->is_JumpData(), "need JumpData for branches");
2333 offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2334 }
2335 LIR_Opr md_reg = new_register(T_OBJECT);
2336 __ oop2reg(md->constant_encoding(), md_reg);
2338 increment_counter(new LIR_Address(md_reg, offset,
2339 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2340 }
2342 // emit phi-instruction move after safepoint since this simplifies
2343 // describing the state as the safepoint.
2344 move_to_phi(x->state());
2346 __ jump(x->default_sux());
2347 }
2350 void LIRGenerator::do_Base(Base* x) {
2351 __ std_entry(LIR_OprFact::illegalOpr);
2352 // Emit moves from physical registers / stack slots to virtual registers
2353 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2354 IRScope* irScope = compilation()->hir()->top_scope();
2355 int java_index = 0;
2356 for (int i = 0; i < args->length(); i++) {
2357 LIR_Opr src = args->at(i);
2358 assert(!src->is_illegal(), "check");
2359 BasicType t = src->type();
2361 // Types which are smaller than int are passed as int, so
2362 // correct the type which passed.
2363 switch (t) {
2364 case T_BYTE:
2365 case T_BOOLEAN:
2366 case T_SHORT:
2367 case T_CHAR:
2368 t = T_INT;
2369 break;
2370 }
2372 LIR_Opr dest = new_register(t);
2373 __ move(src, dest);
2375 // Assign new location to Local instruction for this local
2376 Local* local = x->state()->local_at(java_index)->as_Local();
2377 assert(local != NULL, "Locals for incoming arguments must have been created");
2378 #ifndef __SOFTFP__
2379 // The java calling convention passes double as long and float as int.
2380 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2381 #endif // __SOFTFP__
2382 local->set_operand(dest);
2383 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2384 java_index += type2size[t];
2385 }
2387 if (compilation()->env()->dtrace_method_probes()) {
2388 BasicTypeList signature;
2389 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2390 signature.append(T_OBJECT); // methodOop
2391 LIR_OprList* args = new LIR_OprList();
2392 args->append(getThreadPointer());
2393 LIR_Opr meth = new_register(T_OBJECT);
2394 __ oop2reg(method()->constant_encoding(), meth);
2395 args->append(meth);
2396 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2397 }
2399 if (method()->is_synchronized()) {
2400 LIR_Opr obj;
2401 if (method()->is_static()) {
2402 obj = new_register(T_OBJECT);
2403 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2404 } else {
2405 Local* receiver = x->state()->local_at(0)->as_Local();
2406 assert(receiver != NULL, "must already exist");
2407 obj = receiver->operand();
2408 }
2409 assert(obj->is_valid(), "must be valid");
2411 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2412 LIR_Opr lock = new_register(T_INT);
2413 __ load_stack_address_monitor(0, lock);
2415 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL);
2416 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2418 // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2419 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2420 }
2421 }
2423 // increment invocation counters if needed
2424 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2425 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL);
2426 increment_invocation_counter(info);
2427 }
2429 // all blocks with a successor must end with an unconditional jump
2430 // to the successor even if they are consecutive
2431 __ jump(x->default_sux());
2432 }
2435 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2436 // construct our frame and model the production of incoming pointer
2437 // to the OSR buffer.
2438 __ osr_entry(LIR_Assembler::osrBufferPointer());
2439 LIR_Opr result = rlock_result(x);
2440 __ move(LIR_Assembler::osrBufferPointer(), result);
2441 }
2444 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2445 int i = (x->has_receiver() || x->is_invokedynamic()) ? 1 : 0;
2446 for (; i < args->length(); i++) {
2447 LIRItem* param = args->at(i);
2448 LIR_Opr loc = arg_list->at(i);
2449 if (loc->is_register()) {
2450 param->load_item_force(loc);
2451 } else {
2452 LIR_Address* addr = loc->as_address_ptr();
2453 param->load_for_store(addr->type());
2454 if (addr->type() == T_OBJECT) {
2455 __ move_wide(param->result(), addr);
2456 } else
2457 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2458 __ unaligned_move(param->result(), addr);
2459 } else {
2460 __ move(param->result(), addr);
2461 }
2462 }
2463 }
2465 if (x->has_receiver()) {
2466 LIRItem* receiver = args->at(0);
2467 LIR_Opr loc = arg_list->at(0);
2468 if (loc->is_register()) {
2469 receiver->load_item_force(loc);
2470 } else {
2471 assert(loc->is_address(), "just checking");
2472 receiver->load_for_store(T_OBJECT);
2473 __ move_wide(receiver->result(), loc->as_address_ptr());
2474 }
2475 }
2476 }
2479 // Visits all arguments, returns appropriate items without loading them
2480 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2481 LIRItemList* argument_items = new LIRItemList();
2482 if (x->has_receiver()) {
2483 LIRItem* receiver = new LIRItem(x->receiver(), this);
2484 argument_items->append(receiver);
2485 }
2486 if (x->is_invokedynamic()) {
2487 // Insert a dummy for the synthetic MethodHandle argument.
2488 argument_items->append(NULL);
2489 }
2490 int idx = x->has_receiver() ? 1 : 0;
2491 for (int i = 0; i < x->number_of_arguments(); i++) {
2492 LIRItem* param = new LIRItem(x->argument_at(i), this);
2493 argument_items->append(param);
2494 idx += (param->type()->is_double_word() ? 2 : 1);
2495 }
2496 return argument_items;
2497 }
2500 // The invoke with receiver has following phases:
2501 // a) traverse and load/lock receiver;
2502 // b) traverse all arguments -> item-array (invoke_visit_argument)
2503 // c) push receiver on stack
2504 // d) load each of the items and push on stack
2505 // e) unlock receiver
2506 // f) move receiver into receiver-register %o0
2507 // g) lock result registers and emit call operation
2508 //
2509 // Before issuing a call, we must spill-save all values on stack
2510 // that are in caller-save register. "spill-save" moves thos registers
2511 // either in a free callee-save register or spills them if no free
2512 // callee save register is available.
2513 //
2514 // The problem is where to invoke spill-save.
2515 // - if invoked between e) and f), we may lock callee save
2516 // register in "spill-save" that destroys the receiver register
2517 // before f) is executed
2518 // - if we rearange the f) to be earlier, by loading %o0, it
2519 // may destroy a value on the stack that is currently in %o0
2520 // and is waiting to be spilled
2521 // - if we keep the receiver locked while doing spill-save,
2522 // we cannot spill it as it is spill-locked
2523 //
2524 void LIRGenerator::do_Invoke(Invoke* x) {
2525 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
2527 LIR_OprList* arg_list = cc->args();
2528 LIRItemList* args = invoke_visit_arguments(x);
2529 LIR_Opr receiver = LIR_OprFact::illegalOpr;
2531 // setup result register
2532 LIR_Opr result_register = LIR_OprFact::illegalOpr;
2533 if (x->type() != voidType) {
2534 result_register = result_register_for(x->type());
2535 }
2537 CodeEmitInfo* info = state_for(x, x->state());
2539 // invokedynamics can deoptimize.
2540 CodeEmitInfo* deopt_info = x->is_invokedynamic() ? state_for(x, x->state_before()) : NULL;
2542 invoke_load_arguments(x, args, arg_list);
2544 if (x->has_receiver()) {
2545 args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
2546 receiver = args->at(0)->result();
2547 }
2549 // emit invoke code
2550 bool optimized = x->target_is_loaded() && x->target_is_final();
2551 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
2553 // JSR 292
2554 // Preserve the SP over MethodHandle call sites.
2555 ciMethod* target = x->target();
2556 if (target->is_method_handle_invoke()) {
2557 info->set_is_method_handle_invoke(true);
2558 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
2559 }
2561 switch (x->code()) {
2562 case Bytecodes::_invokestatic:
2563 __ call_static(target, result_register,
2564 SharedRuntime::get_resolve_static_call_stub(),
2565 arg_list, info);
2566 break;
2567 case Bytecodes::_invokespecial:
2568 case Bytecodes::_invokevirtual:
2569 case Bytecodes::_invokeinterface:
2570 // for final target we still produce an inline cache, in order
2571 // to be able to call mixed mode
2572 if (x->code() == Bytecodes::_invokespecial || optimized) {
2573 __ call_opt_virtual(target, receiver, result_register,
2574 SharedRuntime::get_resolve_opt_virtual_call_stub(),
2575 arg_list, info);
2576 } else if (x->vtable_index() < 0) {
2577 __ call_icvirtual(target, receiver, result_register,
2578 SharedRuntime::get_resolve_virtual_call_stub(),
2579 arg_list, info);
2580 } else {
2581 int entry_offset = instanceKlass::vtable_start_offset() + x->vtable_index() * vtableEntry::size();
2582 int vtable_offset = entry_offset * wordSize + vtableEntry::method_offset_in_bytes();
2583 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
2584 }
2585 break;
2586 case Bytecodes::_invokedynamic: {
2587 ciBytecodeStream bcs(x->scope()->method());
2588 bcs.force_bci(x->state()->bci());
2589 assert(bcs.cur_bc() == Bytecodes::_invokedynamic, "wrong stream");
2590 ciCPCache* cpcache = bcs.get_cpcache();
2592 // Get CallSite offset from constant pool cache pointer.
2593 int index = bcs.get_method_index();
2594 size_t call_site_offset = cpcache->get_f1_offset(index);
2596 // If this invokedynamic call site hasn't been executed yet in
2597 // the interpreter, the CallSite object in the constant pool
2598 // cache is still null and we need to deoptimize.
2599 if (cpcache->is_f1_null_at(index)) {
2600 // Cannot re-use same xhandlers for multiple CodeEmitInfos, so
2601 // clone all handlers. This is handled transparently in other
2602 // places by the CodeEmitInfo cloning logic but is handled
2603 // specially here because a stub isn't being used.
2604 x->set_exception_handlers(new XHandlers(x->exception_handlers()));
2606 DeoptimizeStub* deopt_stub = new DeoptimizeStub(deopt_info);
2607 __ jump(deopt_stub);
2608 }
2610 // Use the receiver register for the synthetic MethodHandle
2611 // argument.
2612 receiver = LIR_Assembler::receiverOpr();
2613 LIR_Opr tmp = new_register(objectType);
2615 // Load CallSite object from constant pool cache.
2616 __ oop2reg(cpcache->constant_encoding(), tmp);
2617 __ load(new LIR_Address(tmp, call_site_offset, T_OBJECT), tmp);
2619 // Load target MethodHandle from CallSite object.
2620 __ load(new LIR_Address(tmp, java_lang_invoke_CallSite::target_offset_in_bytes(), T_OBJECT), receiver);
2622 __ call_dynamic(target, receiver, result_register,
2623 SharedRuntime::get_resolve_opt_virtual_call_stub(),
2624 arg_list, info);
2625 break;
2626 }
2627 default:
2628 ShouldNotReachHere();
2629 break;
2630 }
2632 // JSR 292
2633 // Restore the SP after MethodHandle call sites.
2634 if (target->is_method_handle_invoke()) {
2635 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
2636 }
2638 if (x->type()->is_float() || x->type()->is_double()) {
2639 // Force rounding of results from non-strictfp when in strictfp
2640 // scope (or when we don't know the strictness of the callee, to
2641 // be safe.)
2642 if (method()->is_strict()) {
2643 if (!x->target_is_loaded() || !x->target_is_strictfp()) {
2644 result_register = round_item(result_register);
2645 }
2646 }
2647 }
2649 if (result_register->is_valid()) {
2650 LIR_Opr result = rlock_result(x);
2651 __ move(result_register, result);
2652 }
2653 }
2656 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
2657 assert(x->number_of_arguments() == 1, "wrong type");
2658 LIRItem value (x->argument_at(0), this);
2659 LIR_Opr reg = rlock_result(x);
2660 value.load_item();
2661 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
2662 __ move(tmp, reg);
2663 }
2667 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
2668 void LIRGenerator::do_IfOp(IfOp* x) {
2669 #ifdef ASSERT
2670 {
2671 ValueTag xtag = x->x()->type()->tag();
2672 ValueTag ttag = x->tval()->type()->tag();
2673 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
2674 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
2675 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
2676 }
2677 #endif
2679 LIRItem left(x->x(), this);
2680 LIRItem right(x->y(), this);
2681 left.load_item();
2682 if (can_inline_as_constant(right.value())) {
2683 right.dont_load_item();
2684 } else {
2685 right.load_item();
2686 }
2688 LIRItem t_val(x->tval(), this);
2689 LIRItem f_val(x->fval(), this);
2690 t_val.dont_load_item();
2691 f_val.dont_load_item();
2692 LIR_Opr reg = rlock_result(x);
2694 __ cmp(lir_cond(x->cond()), left.result(), right.result());
2695 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
2696 }
2699 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
2700 switch (x->id()) {
2701 case vmIntrinsics::_intBitsToFloat :
2702 case vmIntrinsics::_doubleToRawLongBits :
2703 case vmIntrinsics::_longBitsToDouble :
2704 case vmIntrinsics::_floatToRawIntBits : {
2705 do_FPIntrinsics(x);
2706 break;
2707 }
2709 case vmIntrinsics::_currentTimeMillis: {
2710 assert(x->number_of_arguments() == 0, "wrong type");
2711 LIR_Opr reg = result_register_for(x->type());
2712 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, os::javaTimeMillis), getThreadTemp(),
2713 reg, new LIR_OprList());
2714 LIR_Opr result = rlock_result(x);
2715 __ move(reg, result);
2716 break;
2717 }
2719 case vmIntrinsics::_nanoTime: {
2720 assert(x->number_of_arguments() == 0, "wrong type");
2721 LIR_Opr reg = result_register_for(x->type());
2722 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, os::javaTimeNanos), getThreadTemp(),
2723 reg, new LIR_OprList());
2724 LIR_Opr result = rlock_result(x);
2725 __ move(reg, result);
2726 break;
2727 }
2729 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break;
2730 case vmIntrinsics::_getClass: do_getClass(x); break;
2731 case vmIntrinsics::_currentThread: do_currentThread(x); break;
2733 case vmIntrinsics::_dlog: // fall through
2734 case vmIntrinsics::_dlog10: // fall through
2735 case vmIntrinsics::_dabs: // fall through
2736 case vmIntrinsics::_dsqrt: // fall through
2737 case vmIntrinsics::_dtan: // fall through
2738 case vmIntrinsics::_dsin : // fall through
2739 case vmIntrinsics::_dcos : do_MathIntrinsic(x); break;
2740 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break;
2742 // java.nio.Buffer.checkIndex
2743 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break;
2745 case vmIntrinsics::_compareAndSwapObject:
2746 do_CompareAndSwap(x, objectType);
2747 break;
2748 case vmIntrinsics::_compareAndSwapInt:
2749 do_CompareAndSwap(x, intType);
2750 break;
2751 case vmIntrinsics::_compareAndSwapLong:
2752 do_CompareAndSwap(x, longType);
2753 break;
2755 // sun.misc.AtomicLongCSImpl.attemptUpdate
2756 case vmIntrinsics::_attemptUpdate:
2757 do_AttemptUpdate(x);
2758 break;
2760 default: ShouldNotReachHere(); break;
2761 }
2762 }
2764 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
2765 // Need recv in a temporary register so it interferes with the other temporaries
2766 LIR_Opr recv = LIR_OprFact::illegalOpr;
2767 LIR_Opr mdo = new_register(T_OBJECT);
2768 // tmp is used to hold the counters on SPARC
2769 LIR_Opr tmp = new_pointer_register();
2770 if (x->recv() != NULL) {
2771 LIRItem value(x->recv(), this);
2772 value.load_item();
2773 recv = new_register(T_OBJECT);
2774 __ move(value.result(), recv);
2775 }
2776 __ profile_call(x->method(), x->bci_of_invoke(), mdo, recv, tmp, x->known_holder());
2777 }
2779 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
2780 // We can safely ignore accessors here, since c2 will inline them anyway,
2781 // accessors are also always mature.
2782 if (!x->inlinee()->is_accessor()) {
2783 CodeEmitInfo* info = state_for(x, x->state(), true);
2784 // Increment invocation counter, don't notify the runtime, because we don't inline loops,
2785 increment_event_counter_impl(info, x->inlinee(), 0, InvocationEntryBci, false, false);
2786 }
2787 }
2789 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, int bci, bool backedge) {
2790 int freq_log;
2791 int level = compilation()->env()->comp_level();
2792 if (level == CompLevel_limited_profile) {
2793 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
2794 } else if (level == CompLevel_full_profile) {
2795 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
2796 } else {
2797 ShouldNotReachHere();
2798 }
2799 // Increment the appropriate invocation/backedge counter and notify the runtime.
2800 increment_event_counter_impl(info, info->scope()->method(), (1 << freq_log) - 1, bci, backedge, true);
2801 }
2803 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
2804 ciMethod *method, int frequency,
2805 int bci, bool backedge, bool notify) {
2806 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
2807 int level = _compilation->env()->comp_level();
2808 assert(level > CompLevel_simple, "Shouldn't be here");
2810 int offset = -1;
2811 LIR_Opr counter_holder = new_register(T_OBJECT);
2812 LIR_Opr meth;
2813 if (level == CompLevel_limited_profile) {
2814 offset = in_bytes(backedge ? methodOopDesc::backedge_counter_offset() :
2815 methodOopDesc::invocation_counter_offset());
2816 __ oop2reg(method->constant_encoding(), counter_holder);
2817 meth = counter_holder;
2818 } else if (level == CompLevel_full_profile) {
2819 offset = in_bytes(backedge ? methodDataOopDesc::backedge_counter_offset() :
2820 methodDataOopDesc::invocation_counter_offset());
2821 ciMethodData* md = method->method_data_or_null();
2822 assert(md != NULL, "Sanity");
2823 __ oop2reg(md->constant_encoding(), counter_holder);
2824 meth = new_register(T_OBJECT);
2825 __ oop2reg(method->constant_encoding(), meth);
2826 } else {
2827 ShouldNotReachHere();
2828 }
2829 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
2830 LIR_Opr result = new_register(T_INT);
2831 __ load(counter, result);
2832 __ add(result, LIR_OprFact::intConst(InvocationCounter::count_increment), result);
2833 __ store(result, counter);
2834 if (notify) {
2835 LIR_Opr mask = load_immediate(frequency << InvocationCounter::count_shift, T_INT);
2836 __ logical_and(result, mask, result);
2837 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
2838 // The bci for info can point to cmp for if's we want the if bci
2839 CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
2840 __ branch(lir_cond_equal, T_INT, overflow);
2841 __ branch_destination(overflow->continuation());
2842 }
2843 }
2845 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
2846 LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
2847 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
2849 if (x->pass_thread()) {
2850 signature->append(T_ADDRESS);
2851 args->append(getThreadPointer());
2852 }
2854 for (int i = 0; i < x->number_of_arguments(); i++) {
2855 Value a = x->argument_at(i);
2856 LIRItem* item = new LIRItem(a, this);
2857 item->load_item();
2858 args->append(item->result());
2859 signature->append(as_BasicType(a->type()));
2860 }
2862 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
2863 if (x->type() == voidType) {
2864 set_no_result(x);
2865 } else {
2866 __ move(result, rlock_result(x));
2867 }
2868 }
2870 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
2871 LIRItemList args(1);
2872 LIRItem value(arg1, this);
2873 args.append(&value);
2874 BasicTypeList signature;
2875 signature.append(as_BasicType(arg1->type()));
2877 return call_runtime(&signature, &args, entry, result_type, info);
2878 }
2881 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
2882 LIRItemList args(2);
2883 LIRItem value1(arg1, this);
2884 LIRItem value2(arg2, this);
2885 args.append(&value1);
2886 args.append(&value2);
2887 BasicTypeList signature;
2888 signature.append(as_BasicType(arg1->type()));
2889 signature.append(as_BasicType(arg2->type()));
2891 return call_runtime(&signature, &args, entry, result_type, info);
2892 }
2895 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
2896 address entry, ValueType* result_type, CodeEmitInfo* info) {
2897 // get a result register
2898 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
2899 LIR_Opr result = LIR_OprFact::illegalOpr;
2900 if (result_type->tag() != voidTag) {
2901 result = new_register(result_type);
2902 phys_reg = result_register_for(result_type);
2903 }
2905 // move the arguments into the correct location
2906 CallingConvention* cc = frame_map()->c_calling_convention(signature);
2907 assert(cc->length() == args->length(), "argument mismatch");
2908 for (int i = 0; i < args->length(); i++) {
2909 LIR_Opr arg = args->at(i);
2910 LIR_Opr loc = cc->at(i);
2911 if (loc->is_register()) {
2912 __ move(arg, loc);
2913 } else {
2914 LIR_Address* addr = loc->as_address_ptr();
2915 // if (!can_store_as_constant(arg)) {
2916 // LIR_Opr tmp = new_register(arg->type());
2917 // __ move(arg, tmp);
2918 // arg = tmp;
2919 // }
2920 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2921 __ unaligned_move(arg, addr);
2922 } else {
2923 __ move(arg, addr);
2924 }
2925 }
2926 }
2928 if (info) {
2929 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
2930 } else {
2931 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
2932 }
2933 if (result->is_valid()) {
2934 __ move(phys_reg, result);
2935 }
2936 return result;
2937 }
2940 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
2941 address entry, ValueType* result_type, CodeEmitInfo* info) {
2942 // get a result register
2943 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
2944 LIR_Opr result = LIR_OprFact::illegalOpr;
2945 if (result_type->tag() != voidTag) {
2946 result = new_register(result_type);
2947 phys_reg = result_register_for(result_type);
2948 }
2950 // move the arguments into the correct location
2951 CallingConvention* cc = frame_map()->c_calling_convention(signature);
2953 assert(cc->length() == args->length(), "argument mismatch");
2954 for (int i = 0; i < args->length(); i++) {
2955 LIRItem* arg = args->at(i);
2956 LIR_Opr loc = cc->at(i);
2957 if (loc->is_register()) {
2958 arg->load_item_force(loc);
2959 } else {
2960 LIR_Address* addr = loc->as_address_ptr();
2961 arg->load_for_store(addr->type());
2962 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2963 __ unaligned_move(arg->result(), addr);
2964 } else {
2965 __ move(arg->result(), addr);
2966 }
2967 }
2968 }
2970 if (info) {
2971 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
2972 } else {
2973 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
2974 }
2975 if (result->is_valid()) {
2976 __ move(phys_reg, result);
2977 }
2978 return result;
2979 }