1 /*
2 * Copyright (c) 2005, 2014, 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 */
24
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/ciInstance.hpp"
34 #include "ci/ciObjArray.hpp"
35 #include "runtime/sharedRuntime.hpp"
36 #include "runtime/stubRoutines.hpp"
37 #include "runtime/vm_version.hpp"
38 #include "utilities/bitMap.inline.hpp"
39 #include "utilities/macros.hpp"
40 #if INCLUDE_ALL_GCS
41 #include "gc_implementation/g1/heapRegion.hpp"
42 #endif // INCLUDE_ALL_GCS
43
44 #ifdef ASSERT
45 #define __ gen()->lir(__FILE__, __LINE__)->
46 #else
47 #define __ gen()->lir()->
48 #endif
49
50 // TODO: ARM - Use some recognizable constant which still fits architectural constraints
51 #ifdef ARM
52 #define PATCHED_ADDR (204)
53 #else
54 #define PATCHED_ADDR (max_jint)
55 #endif
56
57 void PhiResolverState::reset(int max_vregs) {
58 // Initialize array sizes
59 _virtual_operands.at_put_grow(max_vregs - 1, NULL, NULL);
60 _virtual_operands.trunc_to(0);
61 _other_operands.at_put_grow(max_vregs - 1, NULL, NULL);
62 _other_operands.trunc_to(0);
63 _vreg_table.at_put_grow(max_vregs - 1, NULL, NULL);
64 _vreg_table.trunc_to(0);
65 }
66
67
68
69 //--------------------------------------------------------------
70 // PhiResolver
71
72 // Resolves cycles:
73 //
74 // r1 := r2 becomes temp := r1
75 // r2 := r1 r1 := r2
76 // r2 := temp
77 // and orders moves:
78 //
79 // r2 := r3 becomes r1 := r2
80 // r1 := r2 r2 := r3
81
82 PhiResolver::PhiResolver(LIRGenerator* gen, int max_vregs)
83 : _gen(gen)
84 , _state(gen->resolver_state())
85 , _temp(LIR_OprFact::illegalOpr)
86 {
87 // reinitialize the shared state arrays
88 _state.reset(max_vregs);
89 }
90
91
92 void PhiResolver::emit_move(LIR_Opr src, LIR_Opr dest) {
93 assert(src->is_valid(), "");
94 assert(dest->is_valid(), "");
95 __ move(src, dest);
96 }
97
98
99 void PhiResolver::move_temp_to(LIR_Opr dest) {
100 assert(_temp->is_valid(), "");
101 emit_move(_temp, dest);
102 NOT_PRODUCT(_temp = LIR_OprFact::illegalOpr);
103 }
104
105
106 void PhiResolver::move_to_temp(LIR_Opr src) {
107 assert(_temp->is_illegal(), "");
108 _temp = _gen->new_register(src->type());
109 emit_move(src, _temp);
110 }
111
112
113 // Traverse assignment graph in depth first order and generate moves in post order
114 // ie. two assignments: b := c, a := b start with node c:
115 // Call graph: move(NULL, c) -> move(c, b) -> move(b, a)
116 // Generates moves in this order: move b to a and move c to b
117 // ie. cycle a := b, b := a start with node a
118 // Call graph: move(NULL, a) -> move(a, b) -> move(b, a)
119 // Generates moves in this order: move b to temp, move a to b, move temp to a
120 void PhiResolver::move(ResolveNode* src, ResolveNode* dest) {
121 if (!dest->visited()) {
122 dest->set_visited();
123 for (int i = dest->no_of_destinations()-1; i >= 0; i --) {
124 move(dest, dest->destination_at(i));
125 }
126 } else if (!dest->start_node()) {
127 // cylce in graph detected
128 assert(_loop == NULL, "only one loop valid!");
129 _loop = dest;
130 move_to_temp(src->operand());
131 return;
132 } // else dest is a start node
133
134 if (!dest->assigned()) {
135 if (_loop == dest) {
136 move_temp_to(dest->operand());
137 dest->set_assigned();
138 } else if (src != NULL) {
139 emit_move(src->operand(), dest->operand());
140 dest->set_assigned();
141 }
142 }
143 }
144
145
146 PhiResolver::~PhiResolver() {
147 int i;
148 // resolve any cycles in moves from and to virtual registers
149 for (i = virtual_operands().length() - 1; i >= 0; i --) {
150 ResolveNode* node = virtual_operands()[i];
151 if (!node->visited()) {
152 _loop = NULL;
153 move(NULL, node);
154 node->set_start_node();
155 assert(_temp->is_illegal(), "move_temp_to() call missing");
156 }
157 }
158
159 // generate move for move from non virtual register to abitrary destination
160 for (i = other_operands().length() - 1; i >= 0; i --) {
161 ResolveNode* node = other_operands()[i];
162 for (int j = node->no_of_destinations() - 1; j >= 0; j --) {
163 emit_move(node->operand(), node->destination_at(j)->operand());
164 }
165 }
166 }
167
168
169 ResolveNode* PhiResolver::create_node(LIR_Opr opr, bool source) {
170 ResolveNode* node;
171 if (opr->is_virtual()) {
172 int vreg_num = opr->vreg_number();
173 node = vreg_table().at_grow(vreg_num, NULL);
174 assert(node == NULL || node->operand() == opr, "");
175 if (node == NULL) {
176 node = new ResolveNode(opr);
177 vreg_table()[vreg_num] = node;
178 }
179 // Make sure that all virtual operands show up in the list when
180 // they are used as the source of a move.
181 if (source && !virtual_operands().contains(node)) {
182 virtual_operands().append(node);
183 }
184 } else {
185 assert(source, "");
186 node = new ResolveNode(opr);
187 other_operands().append(node);
188 }
189 return node;
190 }
191
192
193 void PhiResolver::move(LIR_Opr src, LIR_Opr dest) {
194 assert(dest->is_virtual(), "");
195 // tty->print("move "); src->print(); tty->print(" to "); dest->print(); tty->cr();
196 assert(src->is_valid(), "");
197 assert(dest->is_valid(), "");
198 ResolveNode* source = source_node(src);
199 source->append(destination_node(dest));
200 }
201
202
203 //--------------------------------------------------------------
204 // LIRItem
205
206 void LIRItem::set_result(LIR_Opr opr) {
207 assert(value()->operand()->is_illegal() || value()->operand()->is_constant(), "operand should never change");
208 value()->set_operand(opr);
209
210 if (opr->is_virtual()) {
211 _gen->_instruction_for_operand.at_put_grow(opr->vreg_number(), value(), NULL);
212 }
213
214 _result = opr;
215 }
216
217 void LIRItem::load_item() {
218 if (result()->is_illegal()) {
219 // update the items result
220 _result = value()->operand();
221 }
222 if (!result()->is_register()) {
223 LIR_Opr reg = _gen->new_register(value()->type());
224 __ move(result(), reg);
225 if (result()->is_constant()) {
226 _result = reg;
227 } else {
228 set_result(reg);
229 }
230 }
231 }
232
233
234 void LIRItem::load_for_store(BasicType type) {
235 if (_gen->can_store_as_constant(value(), type)) {
236 _result = value()->operand();
237 if (!_result->is_constant()) {
238 _result = LIR_OprFact::value_type(value()->type());
239 }
240 } else if (type == T_BYTE || type == T_BOOLEAN) {
241 load_byte_item();
242 } else {
243 load_item();
244 }
245 }
246
247 void LIRItem::load_item_force(LIR_Opr reg) {
248 LIR_Opr r = result();
249 if (r != reg) {
250 #if !defined(ARM) && !defined(E500V2)
251 if (r->type() != reg->type()) {
252 // moves between different types need an intervening spill slot
253 r = _gen->force_to_spill(r, reg->type());
254 }
255 #endif
256 __ move(r, reg);
257 _result = reg;
258 }
259 }
260
261 ciObject* LIRItem::get_jobject_constant() const {
262 ObjectType* oc = type()->as_ObjectType();
263 if (oc) {
264 return oc->constant_value();
265 }
266 return NULL;
267 }
268
269
270 jint LIRItem::get_jint_constant() const {
271 assert(is_constant() && value() != NULL, "");
272 assert(type()->as_IntConstant() != NULL, "type check");
273 return type()->as_IntConstant()->value();
274 }
275
276
277 jint LIRItem::get_address_constant() const {
278 assert(is_constant() && value() != NULL, "");
279 assert(type()->as_AddressConstant() != NULL, "type check");
280 return type()->as_AddressConstant()->value();
281 }
282
283
284 jfloat LIRItem::get_jfloat_constant() const {
285 assert(is_constant() && value() != NULL, "");
286 assert(type()->as_FloatConstant() != NULL, "type check");
287 return type()->as_FloatConstant()->value();
288 }
289
290
291 jdouble LIRItem::get_jdouble_constant() const {
292 assert(is_constant() && value() != NULL, "");
293 assert(type()->as_DoubleConstant() != NULL, "type check");
294 return type()->as_DoubleConstant()->value();
295 }
296
297
298 jlong LIRItem::get_jlong_constant() const {
299 assert(is_constant() && value() != NULL, "");
300 assert(type()->as_LongConstant() != NULL, "type check");
301 return type()->as_LongConstant()->value();
302 }
303
304
305
306 //--------------------------------------------------------------
307
308
309 void LIRGenerator::init() {
310 _bs = Universe::heap()->barrier_set();
311 }
312
313
314 void LIRGenerator::block_do_prolog(BlockBegin* block) {
315 #ifndef PRODUCT
316 if (PrintIRWithLIR) {
317 block->print();
318 }
319 #endif
320
321 // set up the list of LIR instructions
322 assert(block->lir() == NULL, "LIR list already computed for this block");
323 _lir = new LIR_List(compilation(), block);
324 block->set_lir(_lir);
325
326 __ branch_destination(block->label());
327
328 if (LIRTraceExecution &&
329 Compilation::current()->hir()->start()->block_id() != block->block_id() &&
330 !block->is_set(BlockBegin::exception_entry_flag)) {
331 assert(block->lir()->instructions_list()->length() == 1, "should come right after br_dst");
332 trace_block_entry(block);
333 }
334 }
335
336
337 void LIRGenerator::block_do_epilog(BlockBegin* block) {
338 #ifndef PRODUCT
339 if (PrintIRWithLIR) {
340 tty->cr();
341 }
342 #endif
343
344 // LIR_Opr for unpinned constants shouldn't be referenced by other
345 // blocks so clear them out after processing the block.
346 for (int i = 0; i < _unpinned_constants.length(); i++) {
347 _unpinned_constants.at(i)->clear_operand();
348 }
349 _unpinned_constants.trunc_to(0);
350
351 // clear our any registers for other local constants
352 _constants.trunc_to(0);
353 _reg_for_constants.trunc_to(0);
354 }
355
356
357 void LIRGenerator::block_do(BlockBegin* block) {
358 CHECK_BAILOUT();
359
360 block_do_prolog(block);
361 set_block(block);
362
363 for (Instruction* instr = block; instr != NULL; instr = instr->next()) {
364 if (instr->is_pinned()) do_root(instr);
365 }
366
367 set_block(NULL);
368 block_do_epilog(block);
369 }
370
371
372 //-------------------------LIRGenerator-----------------------------
373
374 // This is where the tree-walk starts; instr must be root;
375 void LIRGenerator::do_root(Value instr) {
376 CHECK_BAILOUT();
377
378 InstructionMark im(compilation(), instr);
379
380 assert(instr->is_pinned(), "use only with roots");
381 assert(instr->subst() == instr, "shouldn't have missed substitution");
382
383 instr->visit(this);
384
385 assert(!instr->has_uses() || instr->operand()->is_valid() ||
386 instr->as_Constant() != NULL || bailed_out(), "invalid item set");
387 }
388
389
390 // This is called for each node in tree; the walk stops if a root is reached
391 void LIRGenerator::walk(Value instr) {
392 InstructionMark im(compilation(), instr);
393 //stop walk when encounter a root
394 if (instr->is_pinned() && instr->as_Phi() == NULL || instr->operand()->is_valid()) {
395 assert(instr->operand() != LIR_OprFact::illegalOpr || instr->as_Constant() != NULL, "this root has not yet been visited");
396 } else {
397 assert(instr->subst() == instr, "shouldn't have missed substitution");
398 instr->visit(this);
399 // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use");
400 }
401 }
402
403
404 CodeEmitInfo* LIRGenerator::state_for(Instruction* x, ValueStack* state, bool ignore_xhandler) {
405 assert(state != NULL, "state must be defined");
406
407 #ifndef PRODUCT
408 state->verify();
409 #endif
410
411 ValueStack* s = state;
412 for_each_state(s) {
413 if (s->kind() == ValueStack::EmptyExceptionState) {
414 assert(s->stack_size() == 0 && s->locals_size() == 0 && (s->locks_size() == 0 || s->locks_size() == 1), "state must be empty");
415 continue;
416 }
417
418 int index;
419 Value value;
420 for_each_stack_value(s, index, value) {
421 assert(value->subst() == value, "missed substitution");
422 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
423 walk(value);
424 assert(value->operand()->is_valid(), "must be evaluated now");
425 }
426 }
427
428 int bci = s->bci();
429 IRScope* scope = s->scope();
430 ciMethod* method = scope->method();
431
432 MethodLivenessResult liveness = method->liveness_at_bci(bci);
433 if (bci == SynchronizationEntryBCI) {
434 if (x->as_ExceptionObject() || x->as_Throw()) {
435 // all locals are dead on exit from the synthetic unlocker
436 liveness.clear();
437 } else {
438 assert(x->as_MonitorEnter() || x->as_ProfileInvoke(), "only other cases are MonitorEnter and ProfileInvoke");
439 }
440 }
441 if (!liveness.is_valid()) {
442 // Degenerate or breakpointed method.
443 bailout("Degenerate or breakpointed method");
444 } else {
445 assert((int)liveness.size() == s->locals_size(), "error in use of liveness");
446 for_each_local_value(s, index, value) {
447 assert(value->subst() == value, "missed substition");
448 if (liveness.at(index) && !value->type()->is_illegal()) {
449 if (!value->is_pinned() && value->as_Constant() == NULL && value->as_Local() == NULL) {
450 walk(value);
451 assert(value->operand()->is_valid(), "must be evaluated now");
452 }
453 } else {
454 // NULL out this local so that linear scan can assume that all non-NULL values are live.
455 s->invalidate_local(index);
456 }
457 }
458 }
459 }
460
461 return new CodeEmitInfo(state, ignore_xhandler ? NULL : x->exception_handlers(), x->check_flag(Instruction::DeoptimizeOnException));
462 }
463
464
465 CodeEmitInfo* LIRGenerator::state_for(Instruction* x) {
466 return state_for(x, x->exception_state());
467 }
468
469
470 void LIRGenerator::klass2reg_with_patching(LIR_Opr r, ciMetadata* obj, CodeEmitInfo* info, bool need_resolve) {
471 /* C2 relies on constant pool entries being resolved (ciTypeFlow), so if TieredCompilation
472 * is active and the class hasn't yet been resolved we need to emit a patch that resolves
473 * the class. */
474 if ((TieredCompilation && need_resolve) || !obj->is_loaded() || PatchALot) {
475 assert(info != NULL, "info must be set if class is not loaded");
476 __ klass2reg_patch(NULL, r, info);
477 } else {
478 // no patching needed
479 __ metadata2reg(obj->constant_encoding(), r);
480 }
481 }
482
483
484 void LIRGenerator::array_range_check(LIR_Opr array, LIR_Opr index,
485 CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info) {
486 CodeStub* stub = new RangeCheckStub(range_check_info, index);
487 if (index->is_constant()) {
488 cmp_mem_int(lir_cond_belowEqual, array, arrayOopDesc::length_offset_in_bytes(),
489 index->as_jint(), null_check_info);
490 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
491 } else {
492 cmp_reg_mem(lir_cond_aboveEqual, index, array,
493 arrayOopDesc::length_offset_in_bytes(), T_INT, null_check_info);
494 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
495 }
496 }
497
498
499 void LIRGenerator::nio_range_check(LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info) {
500 CodeStub* stub = new RangeCheckStub(info, index, true);
501 if (index->is_constant()) {
502 cmp_mem_int(lir_cond_belowEqual, buffer, java_nio_Buffer::limit_offset(), index->as_jint(), info);
503 __ branch(lir_cond_belowEqual, T_INT, stub); // forward branch
504 } else {
505 cmp_reg_mem(lir_cond_aboveEqual, index, buffer,
506 java_nio_Buffer::limit_offset(), T_INT, info);
507 __ branch(lir_cond_aboveEqual, T_INT, stub); // forward branch
508 }
509 __ move(index, result);
510 }
511
512
513
514 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) {
515 LIR_Opr result_op = result;
516 LIR_Opr left_op = left;
517 LIR_Opr right_op = right;
518
519 if (TwoOperandLIRForm && left_op != result_op) {
520 assert(right_op != result_op, "malformed");
521 __ move(left_op, result_op);
522 left_op = result_op;
523 }
524
525 switch(code) {
526 case Bytecodes::_dadd:
527 case Bytecodes::_fadd:
528 case Bytecodes::_ladd:
529 case Bytecodes::_iadd: __ add(left_op, right_op, result_op); break;
530 case Bytecodes::_fmul:
531 case Bytecodes::_lmul: __ mul(left_op, right_op, result_op); break;
532
533 case Bytecodes::_dmul:
534 {
535 if (is_strictfp) {
536 __ mul_strictfp(left_op, right_op, result_op, tmp_op); break;
537 } else {
538 __ mul(left_op, right_op, result_op); break;
539 }
540 }
541 break;
542
543 case Bytecodes::_imul:
544 {
545 bool did_strength_reduce = false;
546
547 if (right->is_constant()) {
548 int c = right->as_jint();
549 if (is_power_of_2(c)) {
550 // do not need tmp here
551 __ shift_left(left_op, exact_log2(c), result_op);
552 did_strength_reduce = true;
553 } else {
554 did_strength_reduce = strength_reduce_multiply(left_op, c, result_op, tmp_op);
555 }
556 }
557 // we couldn't strength reduce so just emit the multiply
558 if (!did_strength_reduce) {
559 __ mul(left_op, right_op, result_op);
560 }
561 }
562 break;
563
564 case Bytecodes::_dsub:
565 case Bytecodes::_fsub:
566 case Bytecodes::_lsub:
567 case Bytecodes::_isub: __ sub(left_op, right_op, result_op); break;
568
569 case Bytecodes::_fdiv: __ div (left_op, right_op, result_op); break;
570 // ldiv and lrem are implemented with a direct runtime call
571
572 case Bytecodes::_ddiv:
573 {
574 if (is_strictfp) {
575 __ div_strictfp (left_op, right_op, result_op, tmp_op); break;
576 } else {
577 __ div (left_op, right_op, result_op); break;
578 }
579 }
580 break;
581
582 case Bytecodes::_drem:
583 case Bytecodes::_frem: __ rem (left_op, right_op, result_op); break;
584
585 default: ShouldNotReachHere();
586 }
587 }
588
589
590 void LIRGenerator::arithmetic_op_int(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp) {
591 arithmetic_op(code, result, left, right, false, tmp);
592 }
593
594
595 void LIRGenerator::arithmetic_op_long(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info) {
596 arithmetic_op(code, result, left, right, false, LIR_OprFact::illegalOpr, info);
597 }
598
599
600 void LIRGenerator::arithmetic_op_fpu(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp) {
601 arithmetic_op(code, result, left, right, is_strictfp, tmp);
602 }
603
604
605 void LIRGenerator::shift_op(Bytecodes::Code code, LIR_Opr result_op, LIR_Opr value, LIR_Opr count, LIR_Opr tmp) {
606 if (TwoOperandLIRForm && value != result_op) {
607 assert(count != result_op, "malformed");
608 __ move(value, result_op);
609 value = result_op;
610 }
611
612 assert(count->is_constant() || count->is_register(), "must be");
613 switch(code) {
614 case Bytecodes::_ishl:
615 case Bytecodes::_lshl: __ shift_left(value, count, result_op, tmp); break;
616 case Bytecodes::_ishr:
617 case Bytecodes::_lshr: __ shift_right(value, count, result_op, tmp); break;
618 case Bytecodes::_iushr:
619 case Bytecodes::_lushr: __ unsigned_shift_right(value, count, result_op, tmp); break;
620 default: ShouldNotReachHere();
621 }
622 }
623
624
625 void LIRGenerator::logic_op (Bytecodes::Code code, LIR_Opr result_op, LIR_Opr left_op, LIR_Opr right_op) {
626 if (TwoOperandLIRForm && left_op != result_op) {
627 assert(right_op != result_op, "malformed");
628 __ move(left_op, result_op);
629 left_op = result_op;
630 }
631
632 switch(code) {
633 case Bytecodes::_iand:
634 case Bytecodes::_land: __ logical_and(left_op, right_op, result_op); break;
635
636 case Bytecodes::_ior:
637 case Bytecodes::_lor: __ logical_or(left_op, right_op, result_op); break;
638
639 case Bytecodes::_ixor:
640 case Bytecodes::_lxor: __ logical_xor(left_op, right_op, result_op); break;
641
642 default: ShouldNotReachHere();
643 }
644 }
645
646
647 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) {
648 if (!GenerateSynchronizationCode) return;
649 // for slow path, use debug info for state after successful locking
650 CodeStub* slow_path = new MonitorEnterStub(object, lock, info);
651 __ load_stack_address_monitor(monitor_no, lock);
652 // for handling NullPointerException, use debug info representing just the lock stack before this monitorenter
653 __ lock_object(hdr, object, lock, scratch, slow_path, info_for_exception);
654 }
655
656
657 void LIRGenerator::monitor_exit(LIR_Opr object, LIR_Opr lock, LIR_Opr new_hdr, LIR_Opr scratch, int monitor_no) {
658 if (!GenerateSynchronizationCode) return;
659 // setup registers
660 LIR_Opr hdr = lock;
661 lock = new_hdr;
662 CodeStub* slow_path = new MonitorExitStub(lock, UseFastLocking, monitor_no);
663 __ load_stack_address_monitor(monitor_no, lock);
664 __ unlock_object(hdr, object, lock, scratch, slow_path);
665 }
666
667 #ifndef PRODUCT
668 void LIRGenerator::print_if_not_loaded(const NewInstance* new_instance) {
669 if (PrintNotLoaded && !new_instance->klass()->is_loaded()) {
670 tty->print_cr(" ###class not loaded at new bci %d", new_instance->printable_bci());
671 } else if (PrintNotLoaded && (TieredCompilation && new_instance->is_unresolved())) {
672 tty->print_cr(" ###class not resolved at new bci %d", new_instance->printable_bci());
673 }
674 }
675 #endif
676
677 void LIRGenerator::new_instance(LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info) {
678 klass2reg_with_patching(klass_reg, klass, info, is_unresolved);
679 // If klass is not loaded we do not know if the klass has finalizers:
680 if (UseFastNewInstance && klass->is_loaded()
681 && !Klass::layout_helper_needs_slow_path(klass->layout_helper())) {
682
683 Runtime1::StubID stub_id = klass->is_initialized() ? Runtime1::fast_new_instance_id : Runtime1::fast_new_instance_init_check_id;
684
685 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, stub_id);
686
687 assert(klass->is_loaded(), "must be loaded");
688 // allocate space for instance
689 assert(klass->size_helper() >= 0, "illegal instance size");
690 const int instance_size = align_object_size(klass->size_helper());
691 __ allocate_object(dst, scratch1, scratch2, scratch3, scratch4,
692 oopDesc::header_size(), instance_size, klass_reg, !klass->is_initialized(), slow_path);
693 } else {
694 CodeStub* slow_path = new NewInstanceStub(klass_reg, dst, klass, info, Runtime1::new_instance_id);
695 __ branch(lir_cond_always, T_ILLEGAL, slow_path);
696 __ branch_destination(slow_path->continuation());
697 }
698 }
699
700
701 static bool is_constant_zero(Instruction* inst) {
702 IntConstant* c = inst->type()->as_IntConstant();
703 if (c) {
704 return (c->value() == 0);
705 }
706 return false;
707 }
708
709
710 static bool positive_constant(Instruction* inst) {
711 IntConstant* c = inst->type()->as_IntConstant();
712 if (c) {
713 return (c->value() >= 0);
714 }
715 return false;
716 }
717
718
719 static ciArrayKlass* as_array_klass(ciType* type) {
720 if (type != NULL && type->is_array_klass() && type->is_loaded()) {
721 return (ciArrayKlass*)type;
722 } else {
723 return NULL;
724 }
725 }
726
727 static ciType* phi_declared_type(Phi* phi) {
728 ciType* t = phi->operand_at(0)->declared_type();
729 if (t == NULL) {
730 return NULL;
731 }
732 for(int i = 1; i < phi->operand_count(); i++) {
733 if (t != phi->operand_at(i)->declared_type()) {
734 return NULL;
735 }
736 }
737 return t;
738 }
739
740 void LIRGenerator::arraycopy_helper(Intrinsic* x, int* flagsp, ciArrayKlass** expected_typep) {
741 Instruction* src = x->argument_at(0);
742 Instruction* src_pos = x->argument_at(1);
743 Instruction* dst = x->argument_at(2);
744 Instruction* dst_pos = x->argument_at(3);
745 Instruction* length = x->argument_at(4);
746
747 // first try to identify the likely type of the arrays involved
748 ciArrayKlass* expected_type = NULL;
749 bool is_exact = false, src_objarray = false, dst_objarray = false;
750 {
751 ciArrayKlass* src_exact_type = as_array_klass(src->exact_type());
752 ciArrayKlass* src_declared_type = as_array_klass(src->declared_type());
753 Phi* phi;
754 if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) {
755 src_declared_type = as_array_klass(phi_declared_type(phi));
756 }
757 ciArrayKlass* dst_exact_type = as_array_klass(dst->exact_type());
758 ciArrayKlass* dst_declared_type = as_array_klass(dst->declared_type());
759 if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) {
760 dst_declared_type = as_array_klass(phi_declared_type(phi));
761 }
762
763 if (src_exact_type != NULL && src_exact_type == dst_exact_type) {
764 // the types exactly match so the type is fully known
765 is_exact = true;
766 expected_type = src_exact_type;
767 } else if (dst_exact_type != NULL && dst_exact_type->is_obj_array_klass()) {
768 ciArrayKlass* dst_type = (ciArrayKlass*) dst_exact_type;
769 ciArrayKlass* src_type = NULL;
770 if (src_exact_type != NULL && src_exact_type->is_obj_array_klass()) {
771 src_type = (ciArrayKlass*) src_exact_type;
772 } else if (src_declared_type != NULL && src_declared_type->is_obj_array_klass()) {
773 src_type = (ciArrayKlass*) src_declared_type;
774 }
775 if (src_type != NULL) {
776 if (src_type->element_type()->is_subtype_of(dst_type->element_type())) {
777 is_exact = true;
778 expected_type = dst_type;
779 }
780 }
781 }
782 // at least pass along a good guess
783 if (expected_type == NULL) expected_type = dst_exact_type;
784 if (expected_type == NULL) expected_type = src_declared_type;
785 if (expected_type == NULL) expected_type = dst_declared_type;
786
787 src_objarray = (src_exact_type && src_exact_type->is_obj_array_klass()) || (src_declared_type && src_declared_type->is_obj_array_klass());
788 dst_objarray = (dst_exact_type && dst_exact_type->is_obj_array_klass()) || (dst_declared_type && dst_declared_type->is_obj_array_klass());
789 }
790
791 // if a probable array type has been identified, figure out if any
792 // of the required checks for a fast case can be elided.
793 int flags = LIR_OpArrayCopy::all_flags;
794
795 if (!src_objarray)
796 flags &= ~LIR_OpArrayCopy::src_objarray;
797 if (!dst_objarray)
798 flags &= ~LIR_OpArrayCopy::dst_objarray;
799
800 if (!x->arg_needs_null_check(0))
801 flags &= ~LIR_OpArrayCopy::src_null_check;
802 if (!x->arg_needs_null_check(2))
803 flags &= ~LIR_OpArrayCopy::dst_null_check;
804
805
806 if (expected_type != NULL) {
807 Value length_limit = NULL;
808
809 IfOp* ifop = length->as_IfOp();
810 if (ifop != NULL) {
811 // look for expressions like min(v, a.length) which ends up as
812 // x > y ? y : x or x >= y ? y : x
813 if ((ifop->cond() == If::gtr || ifop->cond() == If::geq) &&
814 ifop->x() == ifop->fval() &&
815 ifop->y() == ifop->tval()) {
816 length_limit = ifop->y();
817 }
818 }
819
820 // try to skip null checks and range checks
821 NewArray* src_array = src->as_NewArray();
822 if (src_array != NULL) {
823 flags &= ~LIR_OpArrayCopy::src_null_check;
824 if (length_limit != NULL &&
825 src_array->length() == length_limit &&
826 is_constant_zero(src_pos)) {
827 flags &= ~LIR_OpArrayCopy::src_range_check;
828 }
829 }
830
831 NewArray* dst_array = dst->as_NewArray();
832 if (dst_array != NULL) {
833 flags &= ~LIR_OpArrayCopy::dst_null_check;
834 if (length_limit != NULL &&
835 dst_array->length() == length_limit &&
836 is_constant_zero(dst_pos)) {
837 flags &= ~LIR_OpArrayCopy::dst_range_check;
838 }
839 }
840
841 // check from incoming constant values
842 if (positive_constant(src_pos))
843 flags &= ~LIR_OpArrayCopy::src_pos_positive_check;
844 if (positive_constant(dst_pos))
845 flags &= ~LIR_OpArrayCopy::dst_pos_positive_check;
846 if (positive_constant(length))
847 flags &= ~LIR_OpArrayCopy::length_positive_check;
848
849 // see if the range check can be elided, which might also imply
850 // that src or dst is non-null.
851 ArrayLength* al = length->as_ArrayLength();
852 if (al != NULL) {
853 if (al->array() == src) {
854 // it's the length of the source array
855 flags &= ~LIR_OpArrayCopy::length_positive_check;
856 flags &= ~LIR_OpArrayCopy::src_null_check;
857 if (is_constant_zero(src_pos))
858 flags &= ~LIR_OpArrayCopy::src_range_check;
859 }
860 if (al->array() == dst) {
861 // it's the length of the destination array
862 flags &= ~LIR_OpArrayCopy::length_positive_check;
863 flags &= ~LIR_OpArrayCopy::dst_null_check;
864 if (is_constant_zero(dst_pos))
865 flags &= ~LIR_OpArrayCopy::dst_range_check;
866 }
867 }
868 if (is_exact) {
869 flags &= ~LIR_OpArrayCopy::type_check;
870 }
871 }
872
873 IntConstant* src_int = src_pos->type()->as_IntConstant();
874 IntConstant* dst_int = dst_pos->type()->as_IntConstant();
875 if (src_int && dst_int) {
876 int s_offs = src_int->value();
877 int d_offs = dst_int->value();
878 if (src_int->value() >= dst_int->value()) {
879 flags &= ~LIR_OpArrayCopy::overlapping;
880 }
881 if (expected_type != NULL) {
882 BasicType t = expected_type->element_type()->basic_type();
883 int element_size = type2aelembytes(t);
884 if (((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
885 ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0)) {
886 flags &= ~LIR_OpArrayCopy::unaligned;
887 }
888 }
889 } else if (src_pos == dst_pos || is_constant_zero(dst_pos)) {
890 // src and dest positions are the same, or dst is zero so assume
891 // nonoverlapping copy.
892 flags &= ~LIR_OpArrayCopy::overlapping;
893 }
894
895 if (src == dst) {
896 // moving within a single array so no type checks are needed
897 if (flags & LIR_OpArrayCopy::type_check) {
898 flags &= ~LIR_OpArrayCopy::type_check;
899 }
900 }
901 *flagsp = flags;
902 *expected_typep = (ciArrayKlass*)expected_type;
903 }
904
905
906 LIR_Opr LIRGenerator::round_item(LIR_Opr opr) {
907 assert(opr->is_register(), "why spill if item is not register?");
908
909 if (RoundFPResults && UseSSE < 1 && opr->is_single_fpu()) {
910 LIR_Opr result = new_register(T_FLOAT);
911 set_vreg_flag(result, must_start_in_memory);
912 assert(opr->is_register(), "only a register can be spilled");
913 assert(opr->value_type()->is_float(), "rounding only for floats available");
914 __ roundfp(opr, LIR_OprFact::illegalOpr, result);
915 return result;
916 }
917 return opr;
918 }
919
920
921 LIR_Opr LIRGenerator::force_to_spill(LIR_Opr value, BasicType t) {
922 assert(type2size[t] == type2size[value->type()],
923 err_msg_res("size mismatch: t=%s, value->type()=%s", type2name(t), type2name(value->type())));
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 }
930
931 // create a spill location
932 LIR_Opr tmp = new_register(t);
933 set_vreg_flag(tmp, LIRGenerator::must_start_in_memory);
934
935 // move from register to spill
936 __ move(value, tmp);
937 return tmp;
938 }
939
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 }
956
957 LIR_Opr md_reg = new_register(T_METADATA);
958 __ metadata2reg(md->constant_encoding(), md_reg);
959
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()));
965
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 }
976
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.
992
993
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 }
1008
1009
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");
1016
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);
1021
1022 ValueStack* sux_state = sux->state();
1023 Value sux_value;
1024 int index;
1025
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");
1029
1030 for_each_stack_value(sux_state, index, sux_value) {
1031 move_to_phi(&resolver, cur_state->stack_at(index), sux_value);
1032 }
1033
1034 for_each_local_value(sux_state, index, sux_value) {
1035 move_to_phi(&resolver, cur_state->local_at(index), sux_value);
1036 }
1037
1038 assert(cur_state->caller_state() == sux_state->caller_state(), "caller states must be equal");
1039 }
1040 }
1041 }
1042
1043
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 }
1060
1061
1062 // Try to lock using register in hint
1063 LIR_Opr LIRGenerator::rlock(Value instr) {
1064 return new_register(instr->type());
1065 }
1066
1067
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 }
1074
1075
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 }
1088
1089 set_result(x, reg);
1090 return reg;
1091 }
1092
1093
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 }
1102
1103
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");
1107
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));
1112
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));
1120
1121 LIR_Opr result = new_register(T_OBJECT);
1122 __ move(exceptionOopOpr(), result);
1123 set_result(x, result);
1124 }
1125
1126
1127 //----------------------------------------------------------------------
1128 //----------------------------------------------------------------------
1129 //----------------------------------------------------------------------
1130 //----------------------------------------------------------------------
1131 // visitor functions
1132 //----------------------------------------------------------------------
1133 //----------------------------------------------------------------------
1134 //----------------------------------------------------------------------
1135 //----------------------------------------------------------------------
1136
1137 void LIRGenerator::do_Phi(Phi* x) {
1138 // phi functions are never visited directly
1139 ShouldNotReachHere();
1140 }
1141
1142
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 }
1173
1174
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 }
1180
1181
1182 void LIRGenerator::do_IfInstanceOf(IfInstanceOf* x) {
1183 Unimplemented();
1184 }
1185
1186
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_METADATA); // Method*
1192 LIR_OprList* args = new LIR_OprList();
1193 args->append(getThreadPointer());
1194 LIR_Opr meth = new_register(T_METADATA);
1195 __ metadata2reg(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 }
1199
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);
1205
1206 result.load_item_force(reg);
1207 __ return_op(result.result());
1208 }
1209 set_no_result(x);
1210 }
1211
1212 // Examble: ref.get()
1213 // Combination of LoadField and g1 pre-write barrier
1214 void LIRGenerator::do_Reference_get(Intrinsic* x) {
1215
1216 const int referent_offset = java_lang_ref_Reference::referent_offset;
1217 guarantee(referent_offset > 0, "referent offset not initialized");
1218
1219 assert(x->number_of_arguments() == 1, "wrong type");
1220
1221 LIRItem reference(x->argument_at(0), this);
1222 reference.load_item();
1223
1224 // need to perform the null check on the reference objecy
1225 CodeEmitInfo* info = NULL;
1226 if (x->needs_null_check()) {
1227 info = state_for(x);
1228 }
1229
1230 LIR_Address* referent_field_adr =
1231 new LIR_Address(reference.result(), referent_offset, T_OBJECT);
1232
1233 LIR_Opr result = rlock_result(x);
1234
1235 __ load(referent_field_adr, result, info);
1236
1237 // Register the value in the referent field with the pre-barrier
1238 pre_barrier(LIR_OprFact::illegalOpr /* addr_opr */,
1239 result /* pre_val */,
1240 false /* do_load */,
1241 false /* patch */,
1242 NULL /* info */);
1243 }
1244
1245 // Example: clazz.isInstance(object)
1246 void LIRGenerator::do_isInstance(Intrinsic* x) {
1247 assert(x->number_of_arguments() == 2, "wrong type");
1248
1249 // TODO could try to substitute this node with an equivalent InstanceOf
1250 // if clazz is known to be a constant Class. This will pick up newly found
1251 // constants after HIR construction. I'll leave this to a future change.
1252
1253 // as a first cut, make a simple leaf call to runtime to stay platform independent.
1254 // could follow the aastore example in a future change.
1255
1256 LIRItem clazz(x->argument_at(0), this);
1257 LIRItem object(x->argument_at(1), this);
1258 clazz.load_item();
1259 object.load_item();
1260 LIR_Opr result = rlock_result(x);
1261
1262 // need to perform null check on clazz
1263 if (x->needs_null_check()) {
1264 CodeEmitInfo* info = state_for(x);
1265 __ null_check(clazz.result(), info);
1266 }
1267
1268 LIR_Opr call_result = call_runtime(clazz.value(), object.value(),
1269 CAST_FROM_FN_PTR(address, Runtime1::is_instance_of),
1270 x->type(),
1271 NULL); // NULL CodeEmitInfo results in a leaf call
1272 __ move(call_result, result);
1273 }
1274
1275 // Example: object.getClass ()
1276 void LIRGenerator::do_getClass(Intrinsic* x) {
1277 assert(x->number_of_arguments() == 1, "wrong type");
1278
1279 LIRItem rcvr(x->argument_at(0), this);
1280 rcvr.load_item();
1281 LIR_Opr temp = new_register(T_METADATA);
1282 LIR_Opr result = rlock_result(x);
1283
1284 // need to perform the null check on the rcvr
1285 CodeEmitInfo* info = NULL;
1286 if (x->needs_null_check()) {
1287 info = state_for(x);
1288 }
1289
1290 // FIXME T_ADDRESS should actually be T_METADATA but it can't because the
1291 // meaning of these two is mixed up (see JDK-8026837).
1292 __ move(new LIR_Address(rcvr.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), temp, info);
1293 __ move_wide(new LIR_Address(temp, in_bytes(Klass::java_mirror_offset()), T_OBJECT), result);
1294 }
1295
1296
1297 // Example: Thread.currentThread()
1298 void LIRGenerator::do_currentThread(Intrinsic* x) {
1299 assert(x->number_of_arguments() == 0, "wrong type");
1300 LIR_Opr reg = rlock_result(x);
1301 __ move_wide(new LIR_Address(getThreadPointer(), in_bytes(JavaThread::threadObj_offset()), T_OBJECT), reg);
1302 }
1303
1304
1305 void LIRGenerator::do_RegisterFinalizer(Intrinsic* x) {
1306 assert(x->number_of_arguments() == 1, "wrong type");
1307 LIRItem receiver(x->argument_at(0), this);
1308
1309 receiver.load_item();
1310 BasicTypeList signature;
1311 signature.append(T_OBJECT); // receiver
1312 LIR_OprList* args = new LIR_OprList();
1313 args->append(receiver.result());
1314 CodeEmitInfo* info = state_for(x, x->state());
1315 call_runtime(&signature, args,
1316 CAST_FROM_FN_PTR(address, Runtime1::entry_for(Runtime1::register_finalizer_id)),
1317 voidType, info);
1318
1319 set_no_result(x);
1320 }
1321
1322
1323 //------------------------local access--------------------------------------
1324
1325 LIR_Opr LIRGenerator::operand_for_instruction(Instruction* x) {
1326 if (x->operand()->is_illegal()) {
1327 Constant* c = x->as_Constant();
1328 if (c != NULL) {
1329 x->set_operand(LIR_OprFact::value_type(c->type()));
1330 } else {
1331 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
1332 // allocate a virtual register for this local or phi
1333 x->set_operand(rlock(x));
1334 _instruction_for_operand.at_put_grow(x->operand()->vreg_number(), x, NULL);
1335 }
1336 }
1337 return x->operand();
1338 }
1339
1340
1341 Instruction* LIRGenerator::instruction_for_opr(LIR_Opr opr) {
1342 if (opr->is_virtual()) {
1343 return instruction_for_vreg(opr->vreg_number());
1344 }
1345 return NULL;
1346 }
1347
1348
1349 Instruction* LIRGenerator::instruction_for_vreg(int reg_num) {
1350 if (reg_num < _instruction_for_operand.length()) {
1351 return _instruction_for_operand.at(reg_num);
1352 }
1353 return NULL;
1354 }
1355
1356
1357 void LIRGenerator::set_vreg_flag(int vreg_num, VregFlag f) {
1358 if (_vreg_flags.size_in_bits() == 0) {
1359 BitMap2D temp(100, num_vreg_flags);
1360 temp.clear();
1361 _vreg_flags = temp;
1362 }
1363 _vreg_flags.at_put_grow(vreg_num, f, true);
1364 }
1365
1366 bool LIRGenerator::is_vreg_flag_set(int vreg_num, VregFlag f) {
1367 if (!_vreg_flags.is_valid_index(vreg_num, f)) {
1368 return false;
1369 }
1370 return _vreg_flags.at(vreg_num, f);
1371 }
1372
1373
1374 // Block local constant handling. This code is useful for keeping
1375 // unpinned constants and constants which aren't exposed in the IR in
1376 // registers. Unpinned Constant instructions have their operands
1377 // cleared when the block is finished so that other blocks can't end
1378 // up referring to their registers.
1379
1380 LIR_Opr LIRGenerator::load_constant(Constant* x) {
1381 assert(!x->is_pinned(), "only for unpinned constants");
1382 _unpinned_constants.append(x);
1383 return load_constant(LIR_OprFact::value_type(x->type())->as_constant_ptr());
1384 }
1385
1386
1387 LIR_Opr LIRGenerator::load_constant(LIR_Const* c) {
1388 BasicType t = c->type();
1389 for (int i = 0; i < _constants.length(); i++) {
1390 LIR_Const* other = _constants.at(i);
1391 if (t == other->type()) {
1392 switch (t) {
1393 case T_INT:
1394 case T_FLOAT:
1395 if (c->as_jint_bits() != other->as_jint_bits()) continue;
1396 break;
1397 case T_LONG:
1398 case T_DOUBLE:
1399 if (c->as_jint_hi_bits() != other->as_jint_hi_bits()) continue;
1400 if (c->as_jint_lo_bits() != other->as_jint_lo_bits()) continue;
1401 break;
1402 case T_OBJECT:
1403 if (c->as_jobject() != other->as_jobject()) continue;
1404 break;
1405 }
1406 return _reg_for_constants.at(i);
1407 }
1408 }
1409
1410 LIR_Opr result = new_register(t);
1411 __ move((LIR_Opr)c, result);
1412 _constants.append(c);
1413 _reg_for_constants.append(result);
1414 return result;
1415 }
1416
1417 // Various barriers
1418
1419 void LIRGenerator::pre_barrier(LIR_Opr addr_opr, LIR_Opr pre_val,
1420 bool do_load, bool patch, CodeEmitInfo* info) {
1421 // Do the pre-write barrier, if any.
1422 switch (_bs->kind()) {
1423 #if INCLUDE_ALL_GCS
1424 case BarrierSet::G1SATBCT:
1425 case BarrierSet::G1SATBCTLogging:
1426 G1SATBCardTableModRef_pre_barrier(addr_opr, pre_val, do_load, patch, info);
1427 break;
1428 #endif // INCLUDE_ALL_GCS
1429 case BarrierSet::CardTableModRef:
1430 case BarrierSet::CardTableExtension:
1431 // No pre barriers
1432 break;
1433 case BarrierSet::ModRef:
1434 case BarrierSet::Other:
1435 // No pre barriers
1436 break;
1437 default :
1438 ShouldNotReachHere();
1439
1440 }
1441 }
1442
1443 void LIRGenerator::post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1444 switch (_bs->kind()) {
1445 #if INCLUDE_ALL_GCS
1446 case BarrierSet::G1SATBCT:
1447 case BarrierSet::G1SATBCTLogging:
1448 G1SATBCardTableModRef_post_barrier(addr, new_val);
1449 break;
1450 #endif // INCLUDE_ALL_GCS
1451 case BarrierSet::CardTableModRef:
1452 case BarrierSet::CardTableExtension:
1453 CardTableModRef_post_barrier(addr, new_val);
1454 break;
1455 case BarrierSet::ModRef:
1456 case BarrierSet::Other:
1457 // No post barriers
1458 break;
1459 default :
1460 ShouldNotReachHere();
1461 }
1462 }
1463
1464 ////////////////////////////////////////////////////////////////////////
1465 #if INCLUDE_ALL_GCS
1466
1467 void LIRGenerator::G1SATBCardTableModRef_pre_barrier(LIR_Opr addr_opr, LIR_Opr pre_val,
1468 bool do_load, bool patch, CodeEmitInfo* info) {
1469 // First we test whether marking is in progress.
1470 BasicType flag_type;
1471 if (in_bytes(PtrQueue::byte_width_of_active()) == 4) {
1472 flag_type = T_INT;
1473 } else {
1474 guarantee(in_bytes(PtrQueue::byte_width_of_active()) == 1,
1475 "Assumption");
1476 flag_type = T_BYTE;
1477 }
1478 LIR_Opr thrd = getThreadPointer();
1479 LIR_Address* mark_active_flag_addr =
1480 new LIR_Address(thrd,
1481 in_bytes(JavaThread::satb_mark_queue_offset() +
1482 PtrQueue::byte_offset_of_active()),
1483 flag_type);
1484 // Read the marking-in-progress flag.
1485 LIR_Opr flag_val = new_register(T_INT);
1486 __ load(mark_active_flag_addr, flag_val);
1487 __ cmp(lir_cond_notEqual, flag_val, LIR_OprFact::intConst(0));
1488
1489 LIR_PatchCode pre_val_patch_code = lir_patch_none;
1490
1491 CodeStub* slow;
1492
1493 if (do_load) {
1494 assert(pre_val == LIR_OprFact::illegalOpr, "sanity");
1495 assert(addr_opr != LIR_OprFact::illegalOpr, "sanity");
1496
1497 if (patch)
1498 pre_val_patch_code = lir_patch_normal;
1499
1500 pre_val = new_register(T_OBJECT);
1501
1502 if (!addr_opr->is_address()) {
1503 assert(addr_opr->is_register(), "must be");
1504 addr_opr = LIR_OprFact::address(new LIR_Address(addr_opr, T_OBJECT));
1505 }
1506 slow = new G1PreBarrierStub(addr_opr, pre_val, pre_val_patch_code, info);
1507 } else {
1508 assert(addr_opr == LIR_OprFact::illegalOpr, "sanity");
1509 assert(pre_val->is_register(), "must be");
1510 assert(pre_val->type() == T_OBJECT, "must be an object");
1511 assert(info == NULL, "sanity");
1512
1513 slow = new G1PreBarrierStub(pre_val);
1514 }
1515
1516 __ branch(lir_cond_notEqual, T_INT, slow);
1517 __ branch_destination(slow->continuation());
1518 }
1519
1520 void LIRGenerator::G1SATBCardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1521 // If the "new_val" is a constant NULL, no barrier is necessary.
1522 if (new_val->is_constant() &&
1523 new_val->as_constant_ptr()->as_jobject() == NULL) return;
1524
1525 if (!new_val->is_register()) {
1526 LIR_Opr new_val_reg = new_register(T_OBJECT);
1527 if (new_val->is_constant()) {
1528 __ move(new_val, new_val_reg);
1529 } else {
1530 __ leal(new_val, new_val_reg);
1531 }
1532 new_val = new_val_reg;
1533 }
1534 assert(new_val->is_register(), "must be a register at this point");
1535
1536 if (addr->is_address()) {
1537 LIR_Address* address = addr->as_address_ptr();
1538 LIR_Opr ptr = new_pointer_register();
1539 if (!address->index()->is_valid() && address->disp() == 0) {
1540 __ move(address->base(), ptr);
1541 } else {
1542 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1543 __ leal(addr, ptr);
1544 }
1545 addr = ptr;
1546 }
1547 assert(addr->is_register(), "must be a register at this point");
1548
1549 LIR_Opr xor_res = new_pointer_register();
1550 LIR_Opr xor_shift_res = new_pointer_register();
1551 if (TwoOperandLIRForm ) {
1552 __ move(addr, xor_res);
1553 __ logical_xor(xor_res, new_val, xor_res);
1554 __ move(xor_res, xor_shift_res);
1555 __ unsigned_shift_right(xor_shift_res,
1556 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1557 xor_shift_res,
1558 LIR_OprDesc::illegalOpr());
1559 } else {
1560 __ logical_xor(addr, new_val, xor_res);
1561 __ unsigned_shift_right(xor_res,
1562 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1563 xor_shift_res,
1564 LIR_OprDesc::illegalOpr());
1565 }
1566
1567 if (!new_val->is_register()) {
1568 LIR_Opr new_val_reg = new_register(T_OBJECT);
1569 __ leal(new_val, new_val_reg);
1570 new_val = new_val_reg;
1571 }
1572 assert(new_val->is_register(), "must be a register at this point");
1573
1574 __ cmp(lir_cond_notEqual, xor_shift_res, LIR_OprFact::intptrConst(NULL_WORD));
1575
1576 CodeStub* slow = new G1PostBarrierStub(addr, new_val);
1577 __ branch(lir_cond_notEqual, LP64_ONLY(T_LONG) NOT_LP64(T_INT), slow);
1578 __ branch_destination(slow->continuation());
1579 }
1580
1581 #endif // INCLUDE_ALL_GCS
1582 ////////////////////////////////////////////////////////////////////////
1583
1584 void LIRGenerator::CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1585
1586 assert(sizeof(*((CardTableModRefBS*)_bs)->byte_map_base) == sizeof(jbyte), "adjust this code");
1587 LIR_Const* card_table_base = new LIR_Const(((CardTableModRefBS*)_bs)->byte_map_base);
1588 if (addr->is_address()) {
1589 LIR_Address* address = addr->as_address_ptr();
1590 // ptr cannot be an object because we use this barrier for array card marks
1591 // and addr can point in the middle of an array.
1592 LIR_Opr ptr = new_pointer_register();
1593 if (!address->index()->is_valid() && address->disp() == 0) {
1594 __ move(address->base(), ptr);
1595 } else {
1596 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1597 __ leal(addr, ptr);
1598 }
1599 addr = ptr;
1600 }
1601 assert(addr->is_register(), "must be a register at this point");
1602
1603 #ifdef ARM
1604 // TODO: ARM - move to platform-dependent code
1605 LIR_Opr tmp = FrameMap::R14_opr;
1606 if (VM_Version::supports_movw()) {
1607 __ move((LIR_Opr)card_table_base, tmp);
1608 } else {
1609 __ move(new LIR_Address(FrameMap::Rthread_opr, in_bytes(JavaThread::card_table_base_offset()), T_ADDRESS), tmp);
1610 }
1611
1612 CardTableModRefBS* ct = (CardTableModRefBS*)_bs;
1613 LIR_Address *card_addr = new LIR_Address(tmp, addr, (LIR_Address::Scale) -CardTableModRefBS::card_shift, 0, T_BYTE);
1614 if(((int)ct->byte_map_base & 0xff) == 0) {
1615 __ move(tmp, card_addr);
1616 } else {
1617 LIR_Opr tmp_zero = new_register(T_INT);
1618 __ move(LIR_OprFact::intConst(0), tmp_zero);
1619 __ move(tmp_zero, card_addr);
1620 }
1621 #else // ARM
1622 LIR_Opr tmp = new_pointer_register();
1623 if (TwoOperandLIRForm) {
1624 __ move(addr, tmp);
1625 __ unsigned_shift_right(tmp, CardTableModRefBS::card_shift, tmp);
1626 } else {
1627 __ unsigned_shift_right(addr, CardTableModRefBS::card_shift, tmp);
1628 }
1629 if (can_inline_as_constant(card_table_base)) {
1630 __ move(LIR_OprFact::intConst(0),
1631 new LIR_Address(tmp, card_table_base->as_jint(), T_BYTE));
1632 } else {
1633 __ move(LIR_OprFact::intConst(0),
1634 new LIR_Address(tmp, load_constant(card_table_base),
1635 T_BYTE));
1636 }
1637 #endif // ARM
1638 }
1639
1640
1641 //------------------------field access--------------------------------------
1642
1643 // Comment copied form templateTable_i486.cpp
1644 // ----------------------------------------------------------------------------
1645 // Volatile variables demand their effects be made known to all CPU's in
1646 // order. Store buffers on most chips allow reads & writes to reorder; the
1647 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1648 // memory barrier (i.e., it's not sufficient that the interpreter does not
1649 // reorder volatile references, the hardware also must not reorder them).
1650 //
1651 // According to the new Java Memory Model (JMM):
1652 // (1) All volatiles are serialized wrt to each other.
1653 // ALSO reads & writes act as aquire & release, so:
1654 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1655 // the read float up to before the read. It's OK for non-volatile memory refs
1656 // that happen before the volatile read to float down below it.
1657 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1658 // that happen BEFORE the write float down to after the write. It's OK for
1659 // non-volatile memory refs that happen after the volatile write to float up
1660 // before it.
1661 //
1662 // We only put in barriers around volatile refs (they are expensive), not
1663 // _between_ memory refs (that would require us to track the flavor of the
1664 // previous memory refs). Requirements (2) and (3) require some barriers
1665 // before volatile stores and after volatile loads. These nearly cover
1666 // requirement (1) but miss the volatile-store-volatile-load case. This final
1667 // case is placed after volatile-stores although it could just as well go
1668 // before volatile-loads.
1669
1670
1671 void LIRGenerator::do_StoreField(StoreField* x) {
1672 bool needs_patching = x->needs_patching();
1673 bool is_volatile = x->field()->is_volatile();
1674 BasicType field_type = x->field_type();
1675 bool is_oop = (field_type == T_ARRAY || field_type == T_OBJECT);
1676
1677 CodeEmitInfo* info = NULL;
1678 if (needs_patching) {
1679 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1680 info = state_for(x, x->state_before());
1681 } else if (x->needs_null_check()) {
1682 NullCheck* nc = x->explicit_null_check();
1683 if (nc == NULL) {
1684 info = state_for(x);
1685 } else {
1686 info = state_for(nc);
1687 }
1688 }
1689
1690
1691 LIRItem object(x->obj(), this);
1692 LIRItem value(x->value(), this);
1693
1694 object.load_item();
1695
1696 if (is_volatile || needs_patching) {
1697 // load item if field is volatile (fewer special cases for volatiles)
1698 // load item if field not initialized
1699 // load item if field not constant
1700 // because of code patching we cannot inline constants
1701 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1702 value.load_byte_item();
1703 } else {
1704 value.load_item();
1705 }
1706 } else {
1707 value.load_for_store(field_type);
1708 }
1709
1710 set_no_result(x);
1711
1712 #ifndef PRODUCT
1713 if (PrintNotLoaded && needs_patching) {
1714 tty->print_cr(" ###class not loaded at store_%s bci %d",
1715 x->is_static() ? "static" : "field", x->printable_bci());
1716 }
1717 #endif
1718
1719 if (x->needs_null_check() &&
1720 (needs_patching ||
1721 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1722 // emit an explicit null check because the offset is too large
1723 __ null_check(object.result(), new CodeEmitInfo(info));
1724 }
1725
1726 LIR_Address* address;
1727 if (needs_patching) {
1728 // we need to patch the offset in the instruction so don't allow
1729 // generate_address to try to be smart about emitting the -1.
1730 // Otherwise the patching code won't know how to find the
1731 // instruction to patch.
1732 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1733 } else {
1734 address = generate_address(object.result(), x->offset(), field_type);
1735 }
1736
1737 if (is_volatile && os::is_MP()) {
1738 __ membar_release();
1739 }
1740
1741 if (is_oop) {
1742 // Do the pre-write barrier, if any.
1743 pre_barrier(LIR_OprFact::address(address),
1744 LIR_OprFact::illegalOpr /* pre_val */,
1745 true /* do_load*/,
1746 needs_patching,
1747 (info ? new CodeEmitInfo(info) : NULL));
1748 }
1749
1750 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses;
1751 if (needs_atomic_access && !needs_patching) {
1752 volatile_field_store(value.result(), address, info);
1753 } else {
1754 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1755 __ store(value.result(), address, info, patch_code);
1756 }
1757
1758 if (is_oop) {
1759 // Store to object so mark the card of the header
1760 post_barrier(object.result(), value.result());
1761 }
1762
1763 if (is_volatile && os::is_MP()) {
1764 __ membar();
1765 }
1766 }
1767
1768
1769 void LIRGenerator::do_LoadField(LoadField* x) {
1770 bool needs_patching = x->needs_patching();
1771 bool is_volatile = x->field()->is_volatile();
1772 BasicType field_type = x->field_type();
1773
1774 CodeEmitInfo* info = NULL;
1775 if (needs_patching) {
1776 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1777 info = state_for(x, x->state_before());
1778 } else if (x->needs_null_check()) {
1779 NullCheck* nc = x->explicit_null_check();
1780 if (nc == NULL) {
1781 info = state_for(x);
1782 } else {
1783 info = state_for(nc);
1784 }
1785 }
1786
1787 LIRItem object(x->obj(), this);
1788
1789 object.load_item();
1790
1791 #ifndef PRODUCT
1792 if (PrintNotLoaded && needs_patching) {
1793 tty->print_cr(" ###class not loaded at load_%s bci %d",
1794 x->is_static() ? "static" : "field", x->printable_bci());
1795 }
1796 #endif
1797
1798 bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception();
1799 if (x->needs_null_check() &&
1800 (needs_patching ||
1801 MacroAssembler::needs_explicit_null_check(x->offset()) ||
1802 stress_deopt)) {
1803 LIR_Opr obj = object.result();
1804 if (stress_deopt) {
1805 obj = new_register(T_OBJECT);
1806 __ move(LIR_OprFact::oopConst(NULL), obj);
1807 }
1808 // emit an explicit null check because the offset is too large
1809 __ null_check(obj, new CodeEmitInfo(info));
1810 }
1811
1812 LIR_Opr reg = rlock_result(x, field_type);
1813 LIR_Address* address;
1814 if (needs_patching) {
1815 // we need to patch the offset in the instruction so don't allow
1816 // generate_address to try to be smart about emitting the -1.
1817 // Otherwise the patching code won't know how to find the
1818 // instruction to patch.
1819 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1820 } else {
1821 address = generate_address(object.result(), x->offset(), field_type);
1822 }
1823
1824 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses;
1825 if (needs_atomic_access && !needs_patching) {
1826 volatile_field_load(address, reg, info);
1827 } else {
1828 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1829 __ load(address, reg, info, patch_code);
1830 }
1831
1832 if (is_volatile && os::is_MP()) {
1833 __ membar_acquire();
1834 }
1835 }
1836
1837
1838 //------------------------java.nio.Buffer.checkIndex------------------------
1839
1840 // int java.nio.Buffer.checkIndex(int)
1841 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
1842 // NOTE: by the time we are in checkIndex() we are guaranteed that
1843 // the buffer is non-null (because checkIndex is package-private and
1844 // only called from within other methods in the buffer).
1845 assert(x->number_of_arguments() == 2, "wrong type");
1846 LIRItem buf (x->argument_at(0), this);
1847 LIRItem index(x->argument_at(1), this);
1848 buf.load_item();
1849 index.load_item();
1850
1851 LIR_Opr result = rlock_result(x);
1852 if (GenerateRangeChecks) {
1853 CodeEmitInfo* info = state_for(x);
1854 CodeStub* stub = new RangeCheckStub(info, index.result(), true);
1855 if (index.result()->is_constant()) {
1856 cmp_mem_int(lir_cond_belowEqual, buf.result(), java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
1857 __ branch(lir_cond_belowEqual, T_INT, stub);
1858 } else {
1859 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf.result(),
1860 java_nio_Buffer::limit_offset(), T_INT, info);
1861 __ branch(lir_cond_aboveEqual, T_INT, stub);
1862 }
1863 __ move(index.result(), result);
1864 } else {
1865 // Just load the index into the result register
1866 __ move(index.result(), result);
1867 }
1868 }
1869
1870
1871 //------------------------array access--------------------------------------
1872
1873
1874 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
1875 LIRItem array(x->array(), this);
1876 array.load_item();
1877 LIR_Opr reg = rlock_result(x);
1878
1879 CodeEmitInfo* info = NULL;
1880 if (x->needs_null_check()) {
1881 NullCheck* nc = x->explicit_null_check();
1882 if (nc == NULL) {
1883 info = state_for(x);
1884 } else {
1885 info = state_for(nc);
1886 }
1887 if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) {
1888 LIR_Opr obj = new_register(T_OBJECT);
1889 __ move(LIR_OprFact::oopConst(NULL), obj);
1890 __ null_check(obj, new CodeEmitInfo(info));
1891 }
1892 }
1893 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
1894 }
1895
1896
1897 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
1898 bool use_length = x->length() != NULL;
1899 LIRItem array(x->array(), this);
1900 LIRItem index(x->index(), this);
1901 LIRItem length(this);
1902 bool needs_range_check = x->compute_needs_range_check();
1903
1904 if (use_length && needs_range_check) {
1905 length.set_instruction(x->length());
1906 length.load_item();
1907 }
1908
1909 array.load_item();
1910 if (index.is_constant() && can_inline_as_constant(x->index())) {
1911 // let it be a constant
1912 index.dont_load_item();
1913 } else {
1914 index.load_item();
1915 }
1916
1917 CodeEmitInfo* range_check_info = state_for(x);
1918 CodeEmitInfo* null_check_info = NULL;
1919 if (x->needs_null_check()) {
1920 NullCheck* nc = x->explicit_null_check();
1921 if (nc != NULL) {
1922 null_check_info = state_for(nc);
1923 } else {
1924 null_check_info = range_check_info;
1925 }
1926 if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) {
1927 LIR_Opr obj = new_register(T_OBJECT);
1928 __ move(LIR_OprFact::oopConst(NULL), obj);
1929 __ null_check(obj, new CodeEmitInfo(null_check_info));
1930 }
1931 }
1932
1933 // emit array address setup early so it schedules better
1934 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), false);
1935
1936 if (GenerateRangeChecks && needs_range_check) {
1937 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
1938 __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result()));
1939 } else if (use_length) {
1940 // TODO: use a (modified) version of array_range_check that does not require a
1941 // constant length to be loaded to a register
1942 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1943 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result()));
1944 } else {
1945 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1946 // The range check performs the null check, so clear it out for the load
1947 null_check_info = NULL;
1948 }
1949 }
1950
1951 __ move(array_addr, rlock_result(x, x->elt_type()), null_check_info);
1952 }
1953
1954
1955 void LIRGenerator::do_NullCheck(NullCheck* x) {
1956 if (x->can_trap()) {
1957 LIRItem value(x->obj(), this);
1958 value.load_item();
1959 CodeEmitInfo* info = state_for(x);
1960 __ null_check(value.result(), info);
1961 }
1962 }
1963
1964
1965 void LIRGenerator::do_TypeCast(TypeCast* x) {
1966 LIRItem value(x->obj(), this);
1967 value.load_item();
1968 // the result is the same as from the node we are casting
1969 set_result(x, value.result());
1970 }
1971
1972
1973 void LIRGenerator::do_Throw(Throw* x) {
1974 LIRItem exception(x->exception(), this);
1975 exception.load_item();
1976 set_no_result(x);
1977 LIR_Opr exception_opr = exception.result();
1978 CodeEmitInfo* info = state_for(x, x->state());
1979
1980 #ifndef PRODUCT
1981 if (PrintC1Statistics) {
1982 increment_counter(Runtime1::throw_count_address(), T_INT);
1983 }
1984 #endif
1985
1986 // check if the instruction has an xhandler in any of the nested scopes
1987 bool unwind = false;
1988 if (info->exception_handlers()->length() == 0) {
1989 // this throw is not inside an xhandler
1990 unwind = true;
1991 } else {
1992 // get some idea of the throw type
1993 bool type_is_exact = true;
1994 ciType* throw_type = x->exception()->exact_type();
1995 if (throw_type == NULL) {
1996 type_is_exact = false;
1997 throw_type = x->exception()->declared_type();
1998 }
1999 if (throw_type != NULL && throw_type->is_instance_klass()) {
2000 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
2001 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
2002 }
2003 }
2004
2005 // do null check before moving exception oop into fixed register
2006 // to avoid a fixed interval with an oop during the null check.
2007 // Use a copy of the CodeEmitInfo because debug information is
2008 // different for null_check and throw.
2009 if (GenerateCompilerNullChecks &&
2010 (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL)) {
2011 // if the exception object wasn't created using new then it might be null.
2012 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
2013 }
2014
2015 if (compilation()->env()->jvmti_can_post_on_exceptions()) {
2016 // we need to go through the exception lookup path to get JVMTI
2017 // notification done
2018 unwind = false;
2019 }
2020
2021 // move exception oop into fixed register
2022 __ move(exception_opr, exceptionOopOpr());
2023
2024 if (unwind) {
2025 __ unwind_exception(exceptionOopOpr());
2026 } else {
2027 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
2028 }
2029 }
2030
2031
2032 void LIRGenerator::do_RoundFP(RoundFP* x) {
2033 LIRItem input(x->input(), this);
2034 input.load_item();
2035 LIR_Opr input_opr = input.result();
2036 assert(input_opr->is_register(), "why round if value is not in a register?");
2037 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
2038 if (input_opr->is_single_fpu()) {
2039 set_result(x, round_item(input_opr)); // This code path not currently taken
2040 } else {
2041 LIR_Opr result = new_register(T_DOUBLE);
2042 set_vreg_flag(result, must_start_in_memory);
2043 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
2044 set_result(x, result);
2045 }
2046 }
2047
2048 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
2049 LIRItem base(x->base(), this);
2050 LIRItem idx(this);
2051
2052 base.load_item();
2053 if (x->has_index()) {
2054 idx.set_instruction(x->index());
2055 idx.load_nonconstant();
2056 }
2057
2058 LIR_Opr reg = rlock_result(x, x->basic_type());
2059
2060 int log2_scale = 0;
2061 if (x->has_index()) {
2062 assert(x->index()->type()->tag() == intTag, "should not find non-int index");
2063 log2_scale = x->log2_scale();
2064 }
2065
2066 assert(!x->has_index() || idx.value() == x->index(), "should match");
2067
2068 LIR_Opr base_op = base.result();
2069 #ifndef _LP64
2070 if (x->base()->type()->tag() == longTag) {
2071 base_op = new_register(T_INT);
2072 __ convert(Bytecodes::_l2i, base.result(), base_op);
2073 } else {
2074 assert(x->base()->type()->tag() == intTag, "must be");
2075 }
2076 #endif
2077
2078 BasicType dst_type = x->basic_type();
2079 LIR_Opr index_op = idx.result();
2080
2081 LIR_Address* addr;
2082 if (index_op->is_constant()) {
2083 assert(log2_scale == 0, "must not have a scale");
2084 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
2085 } else {
2086 #ifdef X86
2087 #ifdef _LP64
2088 if (!index_op->is_illegal() && index_op->type() == T_INT) {
2089 LIR_Opr tmp = new_pointer_register();
2090 __ convert(Bytecodes::_i2l, index_op, tmp);
2091 index_op = tmp;
2092 }
2093 #endif
2094 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
2095 #elif defined(ARM)
2096 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
2097 #else
2098 if (index_op->is_illegal() || log2_scale == 0) {
2099 #ifdef _LP64
2100 if (!index_op->is_illegal() && index_op->type() == T_INT) {
2101 LIR_Opr tmp = new_pointer_register();
2102 __ convert(Bytecodes::_i2l, index_op, tmp);
2103 index_op = tmp;
2104 }
2105 #endif
2106 addr = new LIR_Address(base_op, index_op, dst_type);
2107 } else {
2108 LIR_Opr tmp = new_pointer_register();
2109 __ shift_left(index_op, log2_scale, tmp);
2110 addr = new LIR_Address(base_op, tmp, dst_type);
2111 }
2112 #endif
2113 }
2114
2115 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2116 __ unaligned_move(addr, reg);
2117 } else {
2118 if (dst_type == T_OBJECT && x->is_wide()) {
2119 __ move_wide(addr, reg);
2120 } else {
2121 __ move(addr, reg);
2122 }
2123 }
2124 }
2125
2126
2127 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2128 int log2_scale = 0;
2129 BasicType type = x->basic_type();
2130
2131 if (x->has_index()) {
2132 assert(x->index()->type()->tag() == intTag, "should not find non-int index");
2133 log2_scale = x->log2_scale();
2134 }
2135
2136 LIRItem base(x->base(), this);
2137 LIRItem value(x->value(), this);
2138 LIRItem idx(this);
2139
2140 base.load_item();
2141 if (x->has_index()) {
2142 idx.set_instruction(x->index());
2143 idx.load_item();
2144 }
2145
2146 if (type == T_BYTE || type == T_BOOLEAN) {
2147 value.load_byte_item();
2148 } else {
2149 value.load_item();
2150 }
2151
2152 set_no_result(x);
2153
2154 LIR_Opr base_op = base.result();
2155 #ifndef _LP64
2156 if (x->base()->type()->tag() == longTag) {
2157 base_op = new_register(T_INT);
2158 __ convert(Bytecodes::_l2i, base.result(), base_op);
2159 } else {
2160 assert(x->base()->type()->tag() == intTag, "must be");
2161 }
2162 #endif
2163
2164 LIR_Opr index_op = idx.result();
2165 if (log2_scale != 0) {
2166 // temporary fix (platform dependent code without shift on Intel would be better)
2167 index_op = new_pointer_register();
2168 #ifdef _LP64
2169 if(idx.result()->type() == T_INT) {
2170 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2171 } else {
2172 #endif
2173 // TODO: ARM also allows embedded shift in the address
2174 __ move(idx.result(), index_op);
2175 #ifdef _LP64
2176 }
2177 #endif
2178 __ shift_left(index_op, log2_scale, index_op);
2179 }
2180 #ifdef _LP64
2181 else if(!index_op->is_illegal() && index_op->type() == T_INT) {
2182 LIR_Opr tmp = new_pointer_register();
2183 __ convert(Bytecodes::_i2l, index_op, tmp);
2184 index_op = tmp;
2185 }
2186 #endif
2187
2188 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2189 __ move(value.result(), addr);
2190 }
2191
2192
2193 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2194 BasicType type = x->basic_type();
2195 LIRItem src(x->object(), this);
2196 LIRItem off(x->offset(), this);
2197
2198 off.load_item();
2199 src.load_item();
2200
2201 LIR_Opr value = rlock_result(x, x->basic_type());
2202
2203 get_Object_unsafe(value, src.result(), off.result(), type, x->is_volatile());
2204
2205 #if INCLUDE_ALL_GCS
2206 // We might be reading the value of the referent field of a
2207 // Reference object in order to attach it back to the live
2208 // object graph. If G1 is enabled then we need to record
2209 // the value that is being returned in an SATB log buffer.
2210 //
2211 // We need to generate code similar to the following...
2212 //
2213 // if (offset == java_lang_ref_Reference::referent_offset) {
2214 // if (src != NULL) {
2215 // if (klass(src)->reference_type() != REF_NONE) {
2216 // pre_barrier(..., value, ...);
2217 // }
2218 // }
2219 // }
2220
2221 if (UseG1GC && type == T_OBJECT) {
2222 bool gen_pre_barrier = true; // Assume we need to generate pre_barrier.
2223 bool gen_offset_check = true; // Assume we need to generate the offset guard.
2224 bool gen_source_check = true; // Assume we need to check the src object for null.
2225 bool gen_type_check = true; // Assume we need to check the reference_type.
2226
2227 if (off.is_constant()) {
2228 jlong off_con = (off.type()->is_int() ?
2229 (jlong) off.get_jint_constant() :
2230 off.get_jlong_constant());
2231
2232
2233 if (off_con != (jlong) java_lang_ref_Reference::referent_offset) {
2234 // The constant offset is something other than referent_offset.
2235 // We can skip generating/checking the remaining guards and
2236 // skip generation of the code stub.
2237 gen_pre_barrier = false;
2238 } else {
2239 // The constant offset is the same as referent_offset -
2240 // we do not need to generate a runtime offset check.
2241 gen_offset_check = false;
2242 }
2243 }
2244
2245 // We don't need to generate stub if the source object is an array
2246 if (gen_pre_barrier && src.type()->is_array()) {
2247 gen_pre_barrier = false;
2248 }
2249
2250 if (gen_pre_barrier) {
2251 // We still need to continue with the checks.
2252 if (src.is_constant()) {
2253 ciObject* src_con = src.get_jobject_constant();
2254 guarantee(src_con != NULL, "no source constant");
2255
2256 if (src_con->is_null_object()) {
2257 // The constant src object is null - We can skip
2258 // generating the code stub.
2259 gen_pre_barrier = false;
2260 } else {
2261 // Non-null constant source object. We still have to generate
2262 // the slow stub - but we don't need to generate the runtime
2263 // null object check.
2264 gen_source_check = false;
2265 }
2266 }
2267 }
2268 if (gen_pre_barrier && !PatchALot) {
2269 // Can the klass of object be statically determined to be
2270 // a sub-class of Reference?
2271 ciType* type = src.value()->declared_type();
2272 if ((type != NULL) && type->is_loaded()) {
2273 if (type->is_subtype_of(compilation()->env()->Reference_klass())) {
2274 gen_type_check = false;
2275 } else if (type->is_klass() &&
2276 !compilation()->env()->Object_klass()->is_subtype_of(type->as_klass())) {
2277 // Not Reference and not Object klass.
2278 gen_pre_barrier = false;
2279 }
2280 }
2281 }
2282
2283 if (gen_pre_barrier) {
2284 LabelObj* Lcont = new LabelObj();
2285
2286 // We can have generate one runtime check here. Let's start with
2287 // the offset check.
2288 if (gen_offset_check) {
2289 // if (offset != referent_offset) -> continue
2290 // If offset is an int then we can do the comparison with the
2291 // referent_offset constant; otherwise we need to move
2292 // referent_offset into a temporary register and generate
2293 // a reg-reg compare.
2294
2295 LIR_Opr referent_off;
2296
2297 if (off.type()->is_int()) {
2298 referent_off = LIR_OprFact::intConst(java_lang_ref_Reference::referent_offset);
2299 } else {
2300 assert(off.type()->is_long(), "what else?");
2301 referent_off = new_register(T_LONG);
2302 __ move(LIR_OprFact::longConst(java_lang_ref_Reference::referent_offset), referent_off);
2303 }
2304 __ cmp(lir_cond_notEqual, off.result(), referent_off);
2305 __ branch(lir_cond_notEqual, as_BasicType(off.type()), Lcont->label());
2306 }
2307 if (gen_source_check) {
2308 // offset is a const and equals referent offset
2309 // if (source == null) -> continue
2310 __ cmp(lir_cond_equal, src.result(), LIR_OprFact::oopConst(NULL));
2311 __ branch(lir_cond_equal, T_OBJECT, Lcont->label());
2312 }
2313 LIR_Opr src_klass = new_register(T_OBJECT);
2314 if (gen_type_check) {
2315 // We have determined that offset == referent_offset && src != null.
2316 // if (src->_klass->_reference_type == REF_NONE) -> continue
2317 __ move(new LIR_Address(src.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), src_klass);
2318 LIR_Address* reference_type_addr = new LIR_Address(src_klass, in_bytes(InstanceKlass::reference_type_offset()), T_BYTE);
2319 LIR_Opr reference_type = new_register(T_INT);
2320 __ move(reference_type_addr, reference_type);
2321 __ cmp(lir_cond_equal, reference_type, LIR_OprFact::intConst(REF_NONE));
2322 __ branch(lir_cond_equal, T_INT, Lcont->label());
2323 }
2324 {
2325 // We have determined that src->_klass->_reference_type != REF_NONE
2326 // so register the value in the referent field with the pre-barrier.
2327 pre_barrier(LIR_OprFact::illegalOpr /* addr_opr */,
2328 value /* pre_val */,
2329 false /* do_load */,
2330 false /* patch */,
2331 NULL /* info */);
2332 }
2333 __ branch_destination(Lcont->label());
2334 }
2335 }
2336 #endif // INCLUDE_ALL_GCS
2337
2338 if (x->is_volatile() && os::is_MP()) __ membar_acquire();
2339 }
2340
2341
2342 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2343 BasicType type = x->basic_type();
2344 LIRItem src(x->object(), this);
2345 LIRItem off(x->offset(), this);
2346 LIRItem data(x->value(), this);
2347
2348 src.load_item();
2349 if (type == T_BOOLEAN || type == T_BYTE) {
2350 data.load_byte_item();
2351 } else {
2352 data.load_item();
2353 }
2354 off.load_item();
2355
2356 set_no_result(x);
2357
2358 if (x->is_volatile() && os::is_MP()) __ membar_release();
2359 put_Object_unsafe(src.result(), off.result(), data.result(), type, x->is_volatile());
2360 if (x->is_volatile() && os::is_MP()) __ membar();
2361 }
2362
2363
2364 void LIRGenerator::do_UnsafePrefetch(UnsafePrefetch* x, bool is_store) {
2365 LIRItem src(x->object(), this);
2366 LIRItem off(x->offset(), this);
2367
2368 src.load_item();
2369 if (off.is_constant() && can_inline_as_constant(x->offset())) {
2370 // let it be a constant
2371 off.dont_load_item();
2372 } else {
2373 off.load_item();
2374 }
2375
2376 set_no_result(x);
2377
2378 LIR_Address* addr = generate_address(src.result(), off.result(), 0, 0, T_BYTE);
2379 __ prefetch(addr, is_store);
2380 }
2381
2382
2383 void LIRGenerator::do_UnsafePrefetchRead(UnsafePrefetchRead* x) {
2384 do_UnsafePrefetch(x, false);
2385 }
2386
2387
2388 void LIRGenerator::do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) {
2389 do_UnsafePrefetch(x, true);
2390 }
2391
2392
2393 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2394 int lng = x->length();
2395
2396 for (int i = 0; i < lng; i++) {
2397 SwitchRange* one_range = x->at(i);
2398 int low_key = one_range->low_key();
2399 int high_key = one_range->high_key();
2400 BlockBegin* dest = one_range->sux();
2401 if (low_key == high_key) {
2402 __ cmp(lir_cond_equal, value, low_key);
2403 __ branch(lir_cond_equal, T_INT, dest);
2404 } else if (high_key - low_key == 1) {
2405 __ cmp(lir_cond_equal, value, low_key);
2406 __ branch(lir_cond_equal, T_INT, dest);
2407 __ cmp(lir_cond_equal, value, high_key);
2408 __ branch(lir_cond_equal, T_INT, dest);
2409 } else {
2410 LabelObj* L = new LabelObj();
2411 __ cmp(lir_cond_less, value, low_key);
2412 __ branch(lir_cond_less, T_INT, L->label());
2413 __ cmp(lir_cond_lessEqual, value, high_key);
2414 __ branch(lir_cond_lessEqual, T_INT, dest);
2415 __ branch_destination(L->label());
2416 }
2417 }
2418 __ jump(default_sux);
2419 }
2420
2421
2422 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2423 SwitchRangeList* res = new SwitchRangeList();
2424 int len = x->length();
2425 if (len > 0) {
2426 BlockBegin* sux = x->sux_at(0);
2427 int key = x->lo_key();
2428 BlockBegin* default_sux = x->default_sux();
2429 SwitchRange* range = new SwitchRange(key, sux);
2430 for (int i = 0; i < len; i++, key++) {
2431 BlockBegin* new_sux = x->sux_at(i);
2432 if (sux == new_sux) {
2433 // still in same range
2434 range->set_high_key(key);
2435 } else {
2436 // skip tests which explicitly dispatch to the default
2437 if (sux != default_sux) {
2438 res->append(range);
2439 }
2440 range = new SwitchRange(key, new_sux);
2441 }
2442 sux = new_sux;
2443 }
2444 if (res->length() == 0 || res->last() != range) res->append(range);
2445 }
2446 return res;
2447 }
2448
2449
2450 // we expect the keys to be sorted by increasing value
2451 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2452 SwitchRangeList* res = new SwitchRangeList();
2453 int len = x->length();
2454 if (len > 0) {
2455 BlockBegin* default_sux = x->default_sux();
2456 int key = x->key_at(0);
2457 BlockBegin* sux = x->sux_at(0);
2458 SwitchRange* range = new SwitchRange(key, sux);
2459 for (int i = 1; i < len; i++) {
2460 int new_key = x->key_at(i);
2461 BlockBegin* new_sux = x->sux_at(i);
2462 if (key+1 == new_key && sux == new_sux) {
2463 // still in same range
2464 range->set_high_key(new_key);
2465 } else {
2466 // skip tests which explicitly dispatch to the default
2467 if (range->sux() != default_sux) {
2468 res->append(range);
2469 }
2470 range = new SwitchRange(new_key, new_sux);
2471 }
2472 key = new_key;
2473 sux = new_sux;
2474 }
2475 if (res->length() == 0 || res->last() != range) res->append(range);
2476 }
2477 return res;
2478 }
2479
2480
2481 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2482 LIRItem tag(x->tag(), this);
2483 tag.load_item();
2484 set_no_result(x);
2485
2486 if (x->is_safepoint()) {
2487 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2488 }
2489
2490 // move values into phi locations
2491 move_to_phi(x->state());
2492
2493 int lo_key = x->lo_key();
2494 int hi_key = x->hi_key();
2495 int len = x->length();
2496 LIR_Opr value = tag.result();
2497 if (UseTableRanges) {
2498 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2499 } else {
2500 for (int i = 0; i < len; i++) {
2501 __ cmp(lir_cond_equal, value, i + lo_key);
2502 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2503 }
2504 __ jump(x->default_sux());
2505 }
2506 }
2507
2508
2509 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2510 LIRItem tag(x->tag(), this);
2511 tag.load_item();
2512 set_no_result(x);
2513
2514 if (x->is_safepoint()) {
2515 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2516 }
2517
2518 // move values into phi locations
2519 move_to_phi(x->state());
2520
2521 LIR_Opr value = tag.result();
2522 if (UseTableRanges) {
2523 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2524 } else {
2525 int len = x->length();
2526 for (int i = 0; i < len; i++) {
2527 __ cmp(lir_cond_equal, value, x->key_at(i));
2528 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2529 }
2530 __ jump(x->default_sux());
2531 }
2532 }
2533
2534
2535 void LIRGenerator::do_Goto(Goto* x) {
2536 set_no_result(x);
2537
2538 if (block()->next()->as_OsrEntry()) {
2539 // need to free up storage used for OSR entry point
2540 LIR_Opr osrBuffer = block()->next()->operand();
2541 BasicTypeList signature;
2542 signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer
2543 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2544 __ move(osrBuffer, cc->args()->at(0));
2545 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2546 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2547 }
2548
2549 if (x->is_safepoint()) {
2550 ValueStack* state = x->state_before() ? x->state_before() : x->state();
2551
2552 // increment backedge counter if needed
2553 CodeEmitInfo* info = state_for(x, state);
2554 increment_backedge_counter(info, x->profiled_bci());
2555 CodeEmitInfo* safepoint_info = state_for(x, state);
2556 __ safepoint(safepoint_poll_register(), safepoint_info);
2557 }
2558
2559 // Gotos can be folded Ifs, handle this case.
2560 if (x->should_profile()) {
2561 ciMethod* method = x->profiled_method();
2562 assert(method != NULL, "method should be set if branch is profiled");
2563 ciMethodData* md = method->method_data_or_null();
2564 assert(md != NULL, "Sanity");
2565 ciProfileData* data = md->bci_to_data(x->profiled_bci());
2566 assert(data != NULL, "must have profiling data");
2567 int offset;
2568 if (x->direction() == Goto::taken) {
2569 assert(data->is_BranchData(), "need BranchData for two-way branches");
2570 offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2571 } else if (x->direction() == Goto::not_taken) {
2572 assert(data->is_BranchData(), "need BranchData for two-way branches");
2573 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2574 } else {
2575 assert(data->is_JumpData(), "need JumpData for branches");
2576 offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2577 }
2578 LIR_Opr md_reg = new_register(T_METADATA);
2579 __ metadata2reg(md->constant_encoding(), md_reg);
2580
2581 increment_counter(new LIR_Address(md_reg, offset,
2582 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2583 }
2584
2585 // emit phi-instruction move after safepoint since this simplifies
2586 // describing the state as the safepoint.
2587 move_to_phi(x->state());
2588
2589 __ jump(x->default_sux());
2590 }
2591
2592 /**
2593 * Emit profiling code if needed for arguments, parameters, return value types
2594 *
2595 * @param md MDO the code will update at runtime
2596 * @param md_base_offset common offset in the MDO for this profile and subsequent ones
2597 * @param md_offset offset in the MDO (on top of md_base_offset) for this profile
2598 * @param profiled_k current profile
2599 * @param obj IR node for the object to be profiled
2600 * @param mdp register to hold the pointer inside the MDO (md + md_base_offset).
2601 * Set once we find an update to make and use for next ones.
2602 * @param not_null true if we know obj cannot be null
2603 * @param signature_at_call_k signature at call for obj
2604 * @param callee_signature_k signature of callee for obj
2605 * at call and callee signatures differ at method handle call
2606 * @return the only klass we know will ever be seen at this profile point
2607 */
2608 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k,
2609 Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k,
2610 ciKlass* callee_signature_k) {
2611 ciKlass* result = NULL;
2612 bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k);
2613 bool do_update = !TypeEntries::is_type_unknown(profiled_k);
2614 // known not to be null or null bit already set and already set to
2615 // unknown: nothing we can do to improve profiling
2616 if (!do_null && !do_update) {
2617 return result;
2618 }
2619
2620 ciKlass* exact_klass = NULL;
2621 Compilation* comp = Compilation::current();
2622 if (do_update) {
2623 // try to find exact type, using CHA if possible, so that loading
2624 // the klass from the object can be avoided
2625 ciType* type = obj->exact_type();
2626 if (type == NULL) {
2627 type = obj->declared_type();
2628 type = comp->cha_exact_type(type);
2629 }
2630 assert(type == NULL || type->is_klass(), "type should be class");
2631 exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL;
2632
2633 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2634 }
2635
2636 if (!do_null && !do_update) {
2637 return result;
2638 }
2639
2640 ciKlass* exact_signature_k = NULL;
2641 if (do_update) {
2642 // Is the type from the signature exact (the only one possible)?
2643 exact_signature_k = signature_at_call_k->exact_klass();
2644 if (exact_signature_k == NULL) {
2645 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2646 } else {
2647 result = exact_signature_k;
2648 // Known statically. No need to emit any code: prevent
2649 // LIR_Assembler::emit_profile_type() from emitting useless code
2650 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2651 }
2652 // exact_klass and exact_signature_k can be both non NULL but
2653 // different if exact_klass is loaded after the ciObject for
2654 // exact_signature_k is created.
2655 if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) {
2656 // sometimes the type of the signature is better than the best type
2657 // the compiler has
2658 exact_klass = exact_signature_k;
2659 }
2660 if (callee_signature_k != NULL &&
2661 callee_signature_k != signature_at_call_k) {
2662 ciKlass* improved_klass = callee_signature_k->exact_klass();
2663 if (improved_klass == NULL) {
2664 improved_klass = comp->cha_exact_type(callee_signature_k);
2665 }
2666 if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) {
2667 exact_klass = exact_signature_k;
2668 }
2669 }
2670 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2671 }
2672
2673 if (!do_null && !do_update) {
2674 return result;
2675 }
2676
2677 if (mdp == LIR_OprFact::illegalOpr) {
2678 mdp = new_register(T_METADATA);
2679 __ metadata2reg(md->constant_encoding(), mdp);
2680 if (md_base_offset != 0) {
2681 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2682 mdp = new_pointer_register();
2683 __ leal(LIR_OprFact::address(base_type_address), mdp);
2684 }
2685 }
2686 LIRItem value(obj, this);
2687 value.load_item();
2688 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2689 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL);
2690 return result;
2691 }
2692
2693 // profile parameters on entry to the root of the compilation
2694 void LIRGenerator::profile_parameters(Base* x) {
2695 if (compilation()->profile_parameters()) {
2696 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2697 ciMethodData* md = scope()->method()->method_data_or_null();
2698 assert(md != NULL, "Sanity");
2699
2700 if (md->parameters_type_data() != NULL) {
2701 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
2702 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
2703 LIR_Opr mdp = LIR_OprFact::illegalOpr;
2704 for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) {
2705 LIR_Opr src = args->at(i);
2706 assert(!src->is_illegal(), "check");
2707 BasicType t = src->type();
2708 if (t == T_OBJECT || t == T_ARRAY) {
2709 intptr_t profiled_k = parameters->type(j);
2710 Local* local = x->state()->local_at(java_index)->as_Local();
2711 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2712 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2713 profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL);
2714 // If the profile is known statically set it once for all and do not emit any code
2715 if (exact != NULL) {
2716 md->set_parameter_type(j, exact);
2717 }
2718 j++;
2719 }
2720 java_index += type2size[t];
2721 }
2722 }
2723 }
2724 }
2725
2726 void LIRGenerator::do_Base(Base* x) {
2727 __ std_entry(LIR_OprFact::illegalOpr);
2728 // Emit moves from physical registers / stack slots to virtual registers
2729 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2730 IRScope* irScope = compilation()->hir()->top_scope();
2731 int java_index = 0;
2732 for (int i = 0; i < args->length(); i++) {
2733 LIR_Opr src = args->at(i);
2734 assert(!src->is_illegal(), "check");
2735 BasicType t = src->type();
2736
2737 // Types which are smaller than int are passed as int, so
2738 // correct the type which passed.
2739 switch (t) {
2740 case T_BYTE:
2741 case T_BOOLEAN:
2742 case T_SHORT:
2743 case T_CHAR:
2744 t = T_INT;
2745 break;
2746 }
2747
2748 LIR_Opr dest = new_register(t);
2749 __ move(src, dest);
2750
2751 // Assign new location to Local instruction for this local
2752 Local* local = x->state()->local_at(java_index)->as_Local();
2753 assert(local != NULL, "Locals for incoming arguments must have been created");
2754 #ifndef __SOFTFP__
2755 // The java calling convention passes double as long and float as int.
2756 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2757 #endif // __SOFTFP__
2758 local->set_operand(dest);
2759 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2760 java_index += type2size[t];
2761 }
2762
2763 if (compilation()->env()->dtrace_method_probes()) {
2764 BasicTypeList signature;
2765 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2766 signature.append(T_METADATA); // Method*
2767 LIR_OprList* args = new LIR_OprList();
2768 args->append(getThreadPointer());
2769 LIR_Opr meth = new_register(T_METADATA);
2770 __ metadata2reg(method()->constant_encoding(), meth);
2771 args->append(meth);
2772 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2773 }
2774
2775 if (method()->is_synchronized()) {
2776 LIR_Opr obj;
2777 if (method()->is_static()) {
2778 obj = new_register(T_OBJECT);
2779 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2780 } else {
2781 Local* receiver = x->state()->local_at(0)->as_Local();
2782 assert(receiver != NULL, "must already exist");
2783 obj = receiver->operand();
2784 }
2785 assert(obj->is_valid(), "must be valid");
2786
2787 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2788 LIR_Opr lock = new_register(T_INT);
2789 __ load_stack_address_monitor(0, lock);
2790
2791 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException));
2792 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2793
2794 // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2795 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2796 }
2797 }
2798 if (compilation()->age_code()) {
2799 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false);
2800 decrement_age(info);
2801 }
2802 // increment invocation counters if needed
2803 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2804 profile_parameters(x);
2805 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false);
2806 increment_invocation_counter(info);
2807 }
2808
2809 // all blocks with a successor must end with an unconditional jump
2810 // to the successor even if they are consecutive
2811 __ jump(x->default_sux());
2812 }
2813
2814
2815 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2816 // construct our frame and model the production of incoming pointer
2817 // to the OSR buffer.
2818 __ osr_entry(LIR_Assembler::osrBufferPointer());
2819 LIR_Opr result = rlock_result(x);
2820 __ move(LIR_Assembler::osrBufferPointer(), result);
2821 }
2822
2823
2824 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2825 assert(args->length() == arg_list->length(),
2826 err_msg_res("args=%d, arg_list=%d", args->length(), arg_list->length()));
2827 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
2828 LIRItem* param = args->at(i);
2829 LIR_Opr loc = arg_list->at(i);
2830 if (loc->is_register()) {
2831 param->load_item_force(loc);
2832 } else {
2833 LIR_Address* addr = loc->as_address_ptr();
2834 param->load_for_store(addr->type());
2835 if (addr->type() == T_OBJECT) {
2836 __ move_wide(param->result(), addr);
2837 } else
2838 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2839 __ unaligned_move(param->result(), addr);
2840 } else {
2841 __ move(param->result(), addr);
2842 }
2843 }
2844 }
2845
2846 if (x->has_receiver()) {
2847 LIRItem* receiver = args->at(0);
2848 LIR_Opr loc = arg_list->at(0);
2849 if (loc->is_register()) {
2850 receiver->load_item_force(loc);
2851 } else {
2852 assert(loc->is_address(), "just checking");
2853 receiver->load_for_store(T_OBJECT);
2854 __ move_wide(receiver->result(), loc->as_address_ptr());
2855 }
2856 }
2857 }
2858
2859
2860 // Visits all arguments, returns appropriate items without loading them
2861 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2862 LIRItemList* argument_items = new LIRItemList();
2863 if (x->has_receiver()) {
2864 LIRItem* receiver = new LIRItem(x->receiver(), this);
2865 argument_items->append(receiver);
2866 }
2867 for (int i = 0; i < x->number_of_arguments(); i++) {
2868 LIRItem* param = new LIRItem(x->argument_at(i), this);
2869 argument_items->append(param);
2870 }
2871 return argument_items;
2872 }
2873
2874
2875 // The invoke with receiver has following phases:
2876 // a) traverse and load/lock receiver;
2877 // b) traverse all arguments -> item-array (invoke_visit_argument)
2878 // c) push receiver on stack
2879 // d) load each of the items and push on stack
2880 // e) unlock receiver
2881 // f) move receiver into receiver-register %o0
2882 // g) lock result registers and emit call operation
2883 //
2884 // Before issuing a call, we must spill-save all values on stack
2885 // that are in caller-save register. "spill-save" moves thos registers
2886 // either in a free callee-save register or spills them if no free
2887 // callee save register is available.
2888 //
2889 // The problem is where to invoke spill-save.
2890 // - if invoked between e) and f), we may lock callee save
2891 // register in "spill-save" that destroys the receiver register
2892 // before f) is executed
2893 // - if we rearange the f) to be earlier, by loading %o0, it
2894 // may destroy a value on the stack that is currently in %o0
2895 // and is waiting to be spilled
2896 // - if we keep the receiver locked while doing spill-save,
2897 // we cannot spill it as it is spill-locked
2898 //
2899 void LIRGenerator::do_Invoke(Invoke* x) {
2900 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
2901
2902 LIR_OprList* arg_list = cc->args();
2903 LIRItemList* args = invoke_visit_arguments(x);
2904 LIR_Opr receiver = LIR_OprFact::illegalOpr;
2905
2906 // setup result register
2907 LIR_Opr result_register = LIR_OprFact::illegalOpr;
2908 if (x->type() != voidType) {
2909 result_register = result_register_for(x->type());
2910 }
2911
2912 CodeEmitInfo* info = state_for(x, x->state());
2913
2914 invoke_load_arguments(x, args, arg_list);
2915
2916 if (x->has_receiver()) {
2917 args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
2918 receiver = args->at(0)->result();
2919 }
2920
2921 // emit invoke code
2922 bool optimized = x->target_is_loaded() && x->target_is_final();
2923 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
2924
2925 // JSR 292
2926 // Preserve the SP over MethodHandle call sites.
2927 ciMethod* target = x->target();
2928 bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant?
2929 target->is_method_handle_intrinsic() ||
2930 target->is_compiled_lambda_form());
2931 if (is_method_handle_invoke) {
2932 info->set_is_method_handle_invoke(true);
2933 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
2934 }
2935
2936 switch (x->code()) {
2937 case Bytecodes::_invokestatic:
2938 __ call_static(target, result_register,
2939 SharedRuntime::get_resolve_static_call_stub(),
2940 arg_list, info);
2941 break;
2942 case Bytecodes::_invokespecial:
2943 case Bytecodes::_invokevirtual:
2944 case Bytecodes::_invokeinterface:
2945 // for final target we still produce an inline cache, in order
2946 // to be able to call mixed mode
2947 if (x->code() == Bytecodes::_invokespecial || optimized) {
2948 __ call_opt_virtual(target, receiver, result_register,
2949 SharedRuntime::get_resolve_opt_virtual_call_stub(),
2950 arg_list, info);
2951 } else if (x->vtable_index() < 0) {
2952 __ call_icvirtual(target, receiver, result_register,
2953 SharedRuntime::get_resolve_virtual_call_stub(),
2954 arg_list, info);
2955 } else {
2956 int entry_offset = InstanceKlass::vtable_start_offset() + x->vtable_index() * vtableEntry::size();
2957 int vtable_offset = entry_offset * wordSize + vtableEntry::method_offset_in_bytes();
2958 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
2959 }
2960 break;
2961 case Bytecodes::_invokedynamic: {
2962 __ call_dynamic(target, receiver, result_register,
2963 SharedRuntime::get_resolve_static_call_stub(),
2964 arg_list, info);
2965 break;
2966 }
2967 default:
2968 fatal(err_msg("unexpected bytecode: %s", Bytecodes::name(x->code())));
2969 break;
2970 }
2971
2972 // JSR 292
2973 // Restore the SP after MethodHandle call sites.
2974 if (is_method_handle_invoke) {
2975 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
2976 }
2977
2978 if (x->type()->is_float() || x->type()->is_double()) {
2979 // Force rounding of results from non-strictfp when in strictfp
2980 // scope (or when we don't know the strictness of the callee, to
2981 // be safe.)
2982 if (method()->is_strict()) {
2983 if (!x->target_is_loaded() || !x->target_is_strictfp()) {
2984 result_register = round_item(result_register);
2985 }
2986 }
2987 }
2988
2989 if (result_register->is_valid()) {
2990 LIR_Opr result = rlock_result(x);
2991 __ move(result_register, result);
2992 }
2993 }
2994
2995
2996 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
2997 assert(x->number_of_arguments() == 1, "wrong type");
2998 LIRItem value (x->argument_at(0), this);
2999 LIR_Opr reg = rlock_result(x);
3000 value.load_item();
3001 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
3002 __ move(tmp, reg);
3003 }
3004
3005
3006
3007 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3008 void LIRGenerator::do_IfOp(IfOp* x) {
3009 #ifdef ASSERT
3010 {
3011 ValueTag xtag = x->x()->type()->tag();
3012 ValueTag ttag = x->tval()->type()->tag();
3013 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3014 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3015 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3016 }
3017 #endif
3018
3019 LIRItem left(x->x(), this);
3020 LIRItem right(x->y(), this);
3021 left.load_item();
3022 if (can_inline_as_constant(right.value())) {
3023 right.dont_load_item();
3024 } else {
3025 right.load_item();
3026 }
3027
3028 LIRItem t_val(x->tval(), this);
3029 LIRItem f_val(x->fval(), this);
3030 t_val.dont_load_item();
3031 f_val.dont_load_item();
3032 LIR_Opr reg = rlock_result(x);
3033
3034 __ cmp(lir_cond(x->cond()), left.result(), right.result());
3035 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3036 }
3037
3038 void LIRGenerator::do_RuntimeCall(address routine, int expected_arguments, Intrinsic* x) {
3039 assert(x->number_of_arguments() == expected_arguments, "wrong type");
3040 LIR_Opr reg = result_register_for(x->type());
3041 __ call_runtime_leaf(routine, getThreadTemp(),
3042 reg, new LIR_OprList());
3043 LIR_Opr result = rlock_result(x);
3044 __ move(reg, result);
3045 }
3046
3047 #ifdef TRACE_HAVE_INTRINSICS
3048 void LIRGenerator::do_ThreadIDIntrinsic(Intrinsic* x) {
3049 LIR_Opr thread = getThreadPointer();
3050 LIR_Opr osthread = new_pointer_register();
3051 __ move(new LIR_Address(thread, in_bytes(JavaThread::osthread_offset()), osthread->type()), osthread);
3052 size_t thread_id_size = OSThread::thread_id_size();
3053 if (thread_id_size == (size_t) BytesPerLong) {
3054 LIR_Opr id = new_register(T_LONG);
3055 __ move(new LIR_Address(osthread, in_bytes(OSThread::thread_id_offset()), T_LONG), id);
3056 __ convert(Bytecodes::_l2i, id, rlock_result(x));
3057 } else if (thread_id_size == (size_t) BytesPerInt) {
3058 __ move(new LIR_Address(osthread, in_bytes(OSThread::thread_id_offset()), T_INT), rlock_result(x));
3059 } else {
3060 ShouldNotReachHere();
3061 }
3062 }
3063
3064 void LIRGenerator::do_ClassIDIntrinsic(Intrinsic* x) {
3065 CodeEmitInfo* info = state_for(x);
3066 CodeEmitInfo* info2 = new CodeEmitInfo(info); // Clone for the second null check
3067 BasicType klass_pointer_type = NOT_LP64(T_INT) LP64_ONLY(T_LONG);
3068 assert(info != NULL, "must have info");
3069 LIRItem arg(x->argument_at(1), this);
3070 arg.load_item();
3071 LIR_Opr klass = new_pointer_register();
3072 __ move(new LIR_Address(arg.result(), java_lang_Class::klass_offset_in_bytes(), klass_pointer_type), klass, info);
3073 LIR_Opr id = new_register(T_LONG);
3074 ByteSize offset = TRACE_ID_OFFSET;
3075 LIR_Address* trace_id_addr = new LIR_Address(klass, in_bytes(offset), T_LONG);
3076 __ move(trace_id_addr, id);
3077 __ logical_or(id, LIR_OprFact::longConst(0x01l), id);
3078 __ store(id, trace_id_addr);
3079 __ logical_and(id, LIR_OprFact::longConst(~0x3l), id);
3080 __ move(id, rlock_result(x));
3081 }
3082 #endif
3083
3084 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3085 switch (x->id()) {
3086 case vmIntrinsics::_intBitsToFloat :
3087 case vmIntrinsics::_doubleToRawLongBits :
3088 case vmIntrinsics::_longBitsToDouble :
3089 case vmIntrinsics::_floatToRawIntBits : {
3090 do_FPIntrinsics(x);
3091 break;
3092 }
3093
3094 #ifdef TRACE_HAVE_INTRINSICS
3095 case vmIntrinsics::_threadID: do_ThreadIDIntrinsic(x); break;
3096 case vmIntrinsics::_classID: do_ClassIDIntrinsic(x); break;
3097 case vmIntrinsics::_counterTime:
3098 do_RuntimeCall(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), 0, x);
3099 break;
3100 #endif
3101
3102 case vmIntrinsics::_currentTimeMillis:
3103 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), 0, x);
3104 break;
3105
3106 case vmIntrinsics::_nanoTime:
3107 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), 0, x);
3108 break;
3109
3110 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break;
3111 case vmIntrinsics::_isInstance: do_isInstance(x); break;
3112 case vmIntrinsics::_getClass: do_getClass(x); break;
3113 case vmIntrinsics::_currentThread: do_currentThread(x); break;
3114
3115 case vmIntrinsics::_dlog: // fall through
3116 case vmIntrinsics::_dlog10: // fall through
3117 case vmIntrinsics::_dabs: // fall through
3118 case vmIntrinsics::_dsqrt: // fall through
3119 case vmIntrinsics::_dtan: // fall through
3120 case vmIntrinsics::_dsin : // fall through
3121 case vmIntrinsics::_dcos : // fall through
3122 case vmIntrinsics::_dexp : // fall through
3123 case vmIntrinsics::_dpow : do_MathIntrinsic(x); break;
3124 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break;
3125
3126 // java.nio.Buffer.checkIndex
3127 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break;
3128
3129 case vmIntrinsics::_compareAndSwapObject:
3130 do_CompareAndSwap(x, objectType);
3131 break;
3132 case vmIntrinsics::_compareAndSwapInt:
3133 do_CompareAndSwap(x, intType);
3134 break;
3135 case vmIntrinsics::_compareAndSwapLong:
3136 do_CompareAndSwap(x, longType);
3137 break;
3138
3139 case vmIntrinsics::_loadFence :
3140 if (os::is_MP()) __ membar_acquire();
3141 break;
3142 case vmIntrinsics::_storeFence:
3143 if (os::is_MP()) __ membar_release();
3144 break;
3145 case vmIntrinsics::_fullFence :
3146 if (os::is_MP()) __ membar();
3147 break;
3148
3149 case vmIntrinsics::_Reference_get:
3150 do_Reference_get(x);
3151 break;
3152
3153 case vmIntrinsics::_updateCRC32:
3154 case vmIntrinsics::_updateBytesCRC32:
3155 case vmIntrinsics::_updateByteBufferCRC32:
3156 do_update_CRC32(x);
3157 break;
3158
3159 default: ShouldNotReachHere(); break;
3160 }
3161 }
3162
3163 void LIRGenerator::profile_arguments(ProfileCall* x) {
3164 if (compilation()->profile_arguments()) {
3165 int bci = x->bci_of_invoke();
3166 ciMethodData* md = x->method()->method_data_or_null();
3167 ciProfileData* data = md->bci_to_data(bci);
3168 if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) ||
3169 (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) {
3170 ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset();
3171 int base_offset = md->byte_offset_of_slot(data, extra);
3172 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3173 ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args();
3174
3175 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3176 int start = 0;
3177 int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments();
3178 if (x->inlined() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) {
3179 // first argument is not profiled at call (method handle invoke)
3180 assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected");
3181 start = 1;
3182 }
3183 ciSignature* callee_signature = x->callee()->signature();
3184 // method handle call to virtual method
3185 bool has_receiver = x->inlined() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc);
3186 ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL);
3187
3188 bool ignored_will_link;
3189 ciSignature* signature_at_call = NULL;
3190 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3191 ciSignatureStream signature_at_call_stream(signature_at_call);
3192
3193 // if called through method handle invoke, some arguments may have been popped
3194 for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) {
3195 int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset());
3196 ciKlass* exact = profile_type(md, base_offset, off,
3197 args->type(i), x->profiled_arg_at(i+start), mdp,
3198 !x->arg_needs_null_check(i+start),
3199 signature_at_call_stream.next_klass(), callee_signature_stream.next_klass());
3200 if (exact != NULL) {
3201 md->set_argument_type(bci, i, exact);
3202 }
3203 }
3204 } else {
3205 #ifdef ASSERT
3206 Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke());
3207 int n = x->nb_profiled_args();
3208 assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() ||
3209 (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))),
3210 "only at JSR292 bytecodes");
3211 #endif
3212 }
3213 }
3214 }
3215
3216 // profile parameters on entry to an inlined method
3217 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) {
3218 if (compilation()->profile_parameters() && x->inlined()) {
3219 ciMethodData* md = x->callee()->method_data_or_null();
3220 if (md != NULL) {
3221 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
3222 if (parameters_type_data != NULL) {
3223 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
3224 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3225 bool has_receiver = !x->callee()->is_static();
3226 ciSignature* sig = x->callee()->signature();
3227 ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL);
3228 int i = 0; // to iterate on the Instructions
3229 Value arg = x->recv();
3230 bool not_null = false;
3231 int bci = x->bci_of_invoke();
3232 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3233 // The first parameter is the receiver so that's what we start
3234 // with if it exists. One exception is method handle call to
3235 // virtual method: the receiver is in the args list
3236 if (arg == NULL || !Bytecodes::has_receiver(bc)) {
3237 i = 1;
3238 arg = x->profiled_arg_at(0);
3239 not_null = !x->arg_needs_null_check(0);
3240 }
3241 int k = 0; // to iterate on the profile data
3242 for (;;) {
3243 intptr_t profiled_k = parameters->type(k);
3244 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
3245 in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)),
3246 profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL);
3247 // If the profile is known statically set it once for all and do not emit any code
3248 if (exact != NULL) {
3249 md->set_parameter_type(k, exact);
3250 }
3251 k++;
3252 if (k >= parameters_type_data->number_of_parameters()) {
3253 #ifdef ASSERT
3254 int extra = 0;
3255 if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 &&
3256 x->nb_profiled_args() >= TypeProfileParmsLimit &&
3257 x->recv() != NULL && Bytecodes::has_receiver(bc)) {
3258 extra += 1;
3259 }
3260 assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?");
3261 #endif
3262 break;
3263 }
3264 arg = x->profiled_arg_at(i);
3265 not_null = !x->arg_needs_null_check(i);
3266 i++;
3267 }
3268 }
3269 }
3270 }
3271 }
3272
3273 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
3274 // Need recv in a temporary register so it interferes with the other temporaries
3275 LIR_Opr recv = LIR_OprFact::illegalOpr;
3276 LIR_Opr mdo = new_register(T_OBJECT);
3277 // tmp is used to hold the counters on SPARC
3278 LIR_Opr tmp = new_pointer_register();
3279
3280 if (x->nb_profiled_args() > 0) {
3281 profile_arguments(x);
3282 }
3283
3284 // profile parameters on inlined method entry including receiver
3285 if (x->recv() != NULL || x->nb_profiled_args() > 0) {
3286 profile_parameters_at_call(x);
3287 }
3288
3289 if (x->recv() != NULL) {
3290 LIRItem value(x->recv(), this);
3291 value.load_item();
3292 recv = new_register(T_OBJECT);
3293 __ move(value.result(), recv);
3294 }
3295 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3296 }
3297
3298 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3299 int bci = x->bci_of_invoke();
3300 ciMethodData* md = x->method()->method_data_or_null();
3301 ciProfileData* data = md->bci_to_data(bci);
3302 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3303 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3304 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3305
3306 bool ignored_will_link;
3307 ciSignature* signature_at_call = NULL;
3308 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3309
3310 // The offset within the MDO of the entry to update may be too large
3311 // to be used in load/store instructions on some platforms. So have
3312 // profile_type() compute the address of the profile in a register.
3313 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3314 ret->type(), x->ret(), mdp,
3315 !x->needs_null_check(),
3316 signature_at_call->return_type()->as_klass(),
3317 x->callee()->signature()->return_type()->as_klass());
3318 if (exact != NULL) {
3319 md->set_return_type(bci, exact);
3320 }
3321 }
3322
3323 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3324 // We can safely ignore accessors here, since c2 will inline them anyway,
3325 // accessors are also always mature.
3326 if (!x->inlinee()->is_accessor()) {
3327 CodeEmitInfo* info = state_for(x, x->state(), true);
3328 // Notify the runtime very infrequently only to take care of counter overflows
3329 increment_event_counter_impl(info, x->inlinee(), (1 << Tier23InlineeNotifyFreqLog) - 1, InvocationEntryBci, false, true);
3330 }
3331 }
3332
3333 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, int bci, bool backedge) {
3334 int freq_log;
3335 int level = compilation()->env()->comp_level();
3336 if (level == CompLevel_limited_profile) {
3337 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
3338 } else if (level == CompLevel_full_profile) {
3339 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
3340 } else {
3341 ShouldNotReachHere();
3342 }
3343 // Increment the appropriate invocation/backedge counter and notify the runtime.
3344 increment_event_counter_impl(info, info->scope()->method(), (1 << freq_log) - 1, bci, backedge, true);
3345 }
3346
3347 void LIRGenerator::decrement_age(CodeEmitInfo* info) {
3348 ciMethod* method = info->scope()->method();
3349 MethodCounters* mc_adr = method->ensure_method_counters();
3350 if (mc_adr != NULL) {
3351 LIR_Opr mc = new_pointer_register();
3352 __ move(LIR_OprFact::intptrConst(mc_adr), mc);
3353 int offset = in_bytes(MethodCounters::nmethod_age_offset());
3354 LIR_Address* counter = new LIR_Address(mc, offset, T_INT);
3355 LIR_Opr result = new_register(T_INT);
3356 __ load(counter, result);
3357 __ sub(result, LIR_OprFact::intConst(1), result);
3358 __ store(result, counter);
3359 // DeoptimizeStub will reexecute from the current state in code info.
3360 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured,
3361 Deoptimization::Action_make_not_entrant);
3362 __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0));
3363 __ branch(lir_cond_lessEqual, T_INT, deopt);
3364 }
3365 }
3366
3367
3368 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
3369 ciMethod *method, int frequency,
3370 int bci, bool backedge, bool notify) {
3371 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
3372 int level = _compilation->env()->comp_level();
3373 assert(level > CompLevel_simple, "Shouldn't be here");
3374
3375 int offset = -1;
3376 LIR_Opr counter_holder;
3377 if (level == CompLevel_limited_profile) {
3378 MethodCounters* counters_adr = method->ensure_method_counters();
3379 if (counters_adr == NULL) {
3380 bailout("method counters allocation failed");
3381 return;
3382 }
3383 counter_holder = new_pointer_register();
3384 __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder);
3385 offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() :
3386 MethodCounters::invocation_counter_offset());
3387 } else if (level == CompLevel_full_profile) {
3388 counter_holder = new_register(T_METADATA);
3389 offset = in_bytes(backedge ? MethodData::backedge_counter_offset() :
3390 MethodData::invocation_counter_offset());
3391 ciMethodData* md = method->method_data_or_null();
3392 assert(md != NULL, "Sanity");
3393 __ metadata2reg(md->constant_encoding(), counter_holder);
3394 } else {
3395 ShouldNotReachHere();
3396 }
3397 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
3398 LIR_Opr result = new_register(T_INT);
3399 __ load(counter, result);
3400 __ add(result, LIR_OprFact::intConst(InvocationCounter::count_increment), result);
3401 __ store(result, counter);
3402 if (notify) {
3403 LIR_Opr mask = load_immediate(frequency << InvocationCounter::count_shift, T_INT);
3404 LIR_Opr meth = new_register(T_METADATA);
3405 __ metadata2reg(method->constant_encoding(), meth);
3406 __ logical_and(result, mask, result);
3407 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
3408 // The bci for info can point to cmp for if's we want the if bci
3409 CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
3410 __ branch(lir_cond_equal, T_INT, overflow);
3411 __ branch_destination(overflow->continuation());
3412 }
3413 }
3414
3415 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
3416 LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
3417 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
3418
3419 if (x->pass_thread()) {
3420 signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
3421 args->append(getThreadPointer());
3422 }
3423
3424 for (int i = 0; i < x->number_of_arguments(); i++) {
3425 Value a = x->argument_at(i);
3426 LIRItem* item = new LIRItem(a, this);
3427 item->load_item();
3428 args->append(item->result());
3429 signature->append(as_BasicType(a->type()));
3430 }
3431
3432 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
3433 if (x->type() == voidType) {
3434 set_no_result(x);
3435 } else {
3436 __ move(result, rlock_result(x));
3437 }
3438 }
3439
3440 #ifdef ASSERT
3441 void LIRGenerator::do_Assert(Assert *x) {
3442 ValueTag tag = x->x()->type()->tag();
3443 If::Condition cond = x->cond();
3444
3445 LIRItem xitem(x->x(), this);
3446 LIRItem yitem(x->y(), this);
3447 LIRItem* xin = &xitem;
3448 LIRItem* yin = &yitem;
3449
3450 assert(tag == intTag, "Only integer assertions are valid!");
3451
3452 xin->load_item();
3453 yin->dont_load_item();
3454
3455 set_no_result(x);
3456
3457 LIR_Opr left = xin->result();
3458 LIR_Opr right = yin->result();
3459
3460 __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true);
3461 }
3462 #endif
3463
3464 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) {
3465
3466
3467 Instruction *a = x->x();
3468 Instruction *b = x->y();
3469 if (!a || StressRangeCheckElimination) {
3470 assert(!b || StressRangeCheckElimination, "B must also be null");
3471
3472 CodeEmitInfo *info = state_for(x, x->state());
3473 CodeStub* stub = new PredicateFailedStub(info);
3474
3475 __ jump(stub);
3476 } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) {
3477 int a_int = a->type()->as_IntConstant()->value();
3478 int b_int = b->type()->as_IntConstant()->value();
3479
3480 bool ok = false;
3481
3482 switch(x->cond()) {
3483 case Instruction::eql: ok = (a_int == b_int); break;
3484 case Instruction::neq: ok = (a_int != b_int); break;
3485 case Instruction::lss: ok = (a_int < b_int); break;
3486 case Instruction::leq: ok = (a_int <= b_int); break;
3487 case Instruction::gtr: ok = (a_int > b_int); break;
3488 case Instruction::geq: ok = (a_int >= b_int); break;
3489 case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break;
3490 case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break;
3491 default: ShouldNotReachHere();
3492 }
3493
3494 if (ok) {
3495
3496 CodeEmitInfo *info = state_for(x, x->state());
3497 CodeStub* stub = new PredicateFailedStub(info);
3498
3499 __ jump(stub);
3500 }
3501 } else {
3502
3503 ValueTag tag = x->x()->type()->tag();
3504 If::Condition cond = x->cond();
3505 LIRItem xitem(x->x(), this);
3506 LIRItem yitem(x->y(), this);
3507 LIRItem* xin = &xitem;
3508 LIRItem* yin = &yitem;
3509
3510 assert(tag == intTag, "Only integer deoptimizations are valid!");
3511
3512 xin->load_item();
3513 yin->dont_load_item();
3514 set_no_result(x);
3515
3516 LIR_Opr left = xin->result();
3517 LIR_Opr right = yin->result();
3518
3519 CodeEmitInfo *info = state_for(x, x->state());
3520 CodeStub* stub = new PredicateFailedStub(info);
3521
3522 __ cmp(lir_cond(cond), left, right);
3523 __ branch(lir_cond(cond), right->type(), stub);
3524 }
3525 }
3526
3527
3528 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
3529 LIRItemList args(1);
3530 LIRItem value(arg1, this);
3531 args.append(&value);
3532 BasicTypeList signature;
3533 signature.append(as_BasicType(arg1->type()));
3534
3535 return call_runtime(&signature, &args, entry, result_type, info);
3536 }
3537
3538
3539 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
3540 LIRItemList args(2);
3541 LIRItem value1(arg1, this);
3542 LIRItem value2(arg2, this);
3543 args.append(&value1);
3544 args.append(&value2);
3545 BasicTypeList signature;
3546 signature.append(as_BasicType(arg1->type()));
3547 signature.append(as_BasicType(arg2->type()));
3548
3549 return call_runtime(&signature, &args, entry, result_type, info);
3550 }
3551
3552
3553 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
3554 address entry, ValueType* result_type, CodeEmitInfo* info) {
3555 // get a result register
3556 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3557 LIR_Opr result = LIR_OprFact::illegalOpr;
3558 if (result_type->tag() != voidTag) {
3559 result = new_register(result_type);
3560 phys_reg = result_register_for(result_type);
3561 }
3562
3563 // move the arguments into the correct location
3564 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3565 assert(cc->length() == args->length(), "argument mismatch");
3566 for (int i = 0; i < args->length(); i++) {
3567 LIR_Opr arg = args->at(i);
3568 LIR_Opr loc = cc->at(i);
3569 if (loc->is_register()) {
3570 __ move(arg, loc);
3571 } else {
3572 LIR_Address* addr = loc->as_address_ptr();
3573 // if (!can_store_as_constant(arg)) {
3574 // LIR_Opr tmp = new_register(arg->type());
3575 // __ move(arg, tmp);
3576 // arg = tmp;
3577 // }
3578 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3579 __ unaligned_move(arg, addr);
3580 } else {
3581 __ move(arg, addr);
3582 }
3583 }
3584 }
3585
3586 if (info) {
3587 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3588 } else {
3589 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3590 }
3591 if (result->is_valid()) {
3592 __ move(phys_reg, result);
3593 }
3594 return result;
3595 }
3596
3597
3598 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
3599 address entry, ValueType* result_type, CodeEmitInfo* info) {
3600 // get a result register
3601 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3602 LIR_Opr result = LIR_OprFact::illegalOpr;
3603 if (result_type->tag() != voidTag) {
3604 result = new_register(result_type);
3605 phys_reg = result_register_for(result_type);
3606 }
3607
3608 // move the arguments into the correct location
3609 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3610
3611 assert(cc->length() == args->length(), "argument mismatch");
3612 for (int i = 0; i < args->length(); i++) {
3613 LIRItem* arg = args->at(i);
3614 LIR_Opr loc = cc->at(i);
3615 if (loc->is_register()) {
3616 arg->load_item_force(loc);
3617 } else {
3618 LIR_Address* addr = loc->as_address_ptr();
3619 arg->load_for_store(addr->type());
3620 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3621 __ unaligned_move(arg->result(), addr);
3622 } else {
3623 __ move(arg->result(), addr);
3624 }
3625 }
3626 }
3627
3628 if (info) {
3629 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3630 } else {
3631 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3632 }
3633 if (result->is_valid()) {
3634 __ move(phys_reg, result);
3635 }
3636 return result;
3637 }
3638
3639 void LIRGenerator::do_MemBar(MemBar* x) {
3640 if (os::is_MP()) {
3641 LIR_Code code = x->code();
3642 switch(code) {
3643 case lir_membar_acquire : __ membar_acquire(); break;
3644 case lir_membar_release : __ membar_release(); break;
3645 case lir_membar : __ membar(); break;
3646 case lir_membar_loadload : __ membar_loadload(); break;
3647 case lir_membar_storestore: __ membar_storestore(); break;
3648 case lir_membar_loadstore : __ membar_loadstore(); break;
3649 case lir_membar_storeload : __ membar_storeload(); break;
3650 default : ShouldNotReachHere(); break;
3651 }
3652 }
3653 }