1 /*
2 * Copyright (c) 2005, 2015, 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_Defs.hpp"
28 #include "c1/c1_FrameMap.hpp"
29 #include "c1/c1_Instruction.hpp"
30 #include "c1/c1_LIRAssembler.hpp"
31 #include "c1/c1_LIRGenerator.hpp"
32 #include "c1/c1_ValueStack.hpp"
33 #include "ci/ciArrayKlass.hpp"
34 #include "ci/ciInstance.hpp"
35 #include "ci/ciObjArray.hpp"
36 #include "gc/shared/cardTableModRefBS.hpp"
37 #include "runtime/arguments.hpp"
38 #include "runtime/sharedRuntime.hpp"
39 #include "runtime/stubRoutines.hpp"
40 #include "runtime/vm_version.hpp"
41 #include "utilities/bitMap.inline.hpp"
42 #include "utilities/macros.hpp"
43 #if INCLUDE_ALL_GCS
44 #include "gc/g1/heapRegion.hpp"
45 #endif // INCLUDE_ALL_GCS
46
47 #ifdef ASSERT
48 #define __ gen()->lir(__FILE__, __LINE__)->
49 #else
50 #define __ gen()->lir()->
51 #endif
52
53 #ifndef PATCHED_ADDR
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::G1SATBCTLogging:
1425 G1SATBCardTableModRef_pre_barrier(addr_opr, pre_val, do_load, patch, info);
1426 break;
1427 #endif // INCLUDE_ALL_GCS
1428 case BarrierSet::CardTableModRef:
1429 case BarrierSet::CardTableExtension:
1430 // No pre barriers
1431 break;
1432 case BarrierSet::ModRef:
1433 // No pre barriers
1434 break;
1435 default :
1436 ShouldNotReachHere();
1437
1438 }
1439 }
1440
1441 void LIRGenerator::post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1442 switch (_bs->kind()) {
1443 #if INCLUDE_ALL_GCS
1444 case BarrierSet::G1SATBCTLogging:
1445 G1SATBCardTableModRef_post_barrier(addr, new_val);
1446 break;
1447 #endif // INCLUDE_ALL_GCS
1448 case BarrierSet::CardTableModRef:
1449 case BarrierSet::CardTableExtension:
1450 CardTableModRef_post_barrier(addr, new_val);
1451 break;
1452 case BarrierSet::ModRef:
1453 // No post barriers
1454 break;
1455 default :
1456 ShouldNotReachHere();
1457 }
1458 }
1459
1460 ////////////////////////////////////////////////////////////////////////
1461 #if INCLUDE_ALL_GCS
1462
1463 void LIRGenerator::G1SATBCardTableModRef_pre_barrier(LIR_Opr addr_opr, LIR_Opr pre_val,
1464 bool do_load, bool patch, CodeEmitInfo* info) {
1465 // First we test whether marking is in progress.
1466 BasicType flag_type;
1467 if (in_bytes(PtrQueue::byte_width_of_active()) == 4) {
1468 flag_type = T_INT;
1469 } else {
1470 guarantee(in_bytes(PtrQueue::byte_width_of_active()) == 1,
1471 "Assumption");
1472 // Use unsigned type T_BOOLEAN here rather than signed T_BYTE since some platforms, eg. ARM,
1473 // need to use unsigned instructions to use the large offset to load the satb_mark_queue.
1474 flag_type = T_BOOLEAN;
1475 }
1476 LIR_Opr thrd = getThreadPointer();
1477 LIR_Address* mark_active_flag_addr =
1478 new LIR_Address(thrd,
1479 in_bytes(JavaThread::satb_mark_queue_offset() +
1480 PtrQueue::byte_offset_of_active()),
1481 flag_type);
1482 // Read the marking-in-progress flag.
1483 LIR_Opr flag_val = new_register(T_INT);
1484 __ load(mark_active_flag_addr, flag_val);
1485 __ cmp(lir_cond_notEqual, flag_val, LIR_OprFact::intConst(0));
1486
1487 LIR_PatchCode pre_val_patch_code = lir_patch_none;
1488
1489 CodeStub* slow;
1490
1491 if (do_load) {
1492 assert(pre_val == LIR_OprFact::illegalOpr, "sanity");
1493 assert(addr_opr != LIR_OprFact::illegalOpr, "sanity");
1494
1495 if (patch)
1496 pre_val_patch_code = lir_patch_normal;
1497
1498 pre_val = new_register(T_OBJECT);
1499
1500 if (!addr_opr->is_address()) {
1501 assert(addr_opr->is_register(), "must be");
1502 addr_opr = LIR_OprFact::address(new LIR_Address(addr_opr, T_OBJECT));
1503 }
1504 slow = new G1PreBarrierStub(addr_opr, pre_val, pre_val_patch_code, info);
1505 } else {
1506 assert(addr_opr == LIR_OprFact::illegalOpr, "sanity");
1507 assert(pre_val->is_register(), "must be");
1508 assert(pre_val->type() == T_OBJECT, "must be an object");
1509 assert(info == NULL, "sanity");
1510
1511 slow = new G1PreBarrierStub(pre_val);
1512 }
1513
1514 __ branch(lir_cond_notEqual, T_INT, slow);
1515 __ branch_destination(slow->continuation());
1516 }
1517
1518 void LIRGenerator::G1SATBCardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1519 // If the "new_val" is a constant NULL, no barrier is necessary.
1520 if (new_val->is_constant() &&
1521 new_val->as_constant_ptr()->as_jobject() == NULL) return;
1522
1523 if (!new_val->is_register()) {
1524 LIR_Opr new_val_reg = new_register(T_OBJECT);
1525 if (new_val->is_constant()) {
1526 __ move(new_val, new_val_reg);
1527 } else {
1528 __ leal(new_val, new_val_reg);
1529 }
1530 new_val = new_val_reg;
1531 }
1532 assert(new_val->is_register(), "must be a register at this point");
1533
1534 if (addr->is_address()) {
1535 LIR_Address* address = addr->as_address_ptr();
1536 LIR_Opr ptr = new_pointer_register();
1537 if (!address->index()->is_valid() && address->disp() == 0) {
1538 __ move(address->base(), ptr);
1539 } else {
1540 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1541 __ leal(addr, ptr);
1542 }
1543 addr = ptr;
1544 }
1545 assert(addr->is_register(), "must be a register at this point");
1546
1547 LIR_Opr xor_res = new_pointer_register();
1548 LIR_Opr xor_shift_res = new_pointer_register();
1549 if (TwoOperandLIRForm ) {
1550 __ move(addr, xor_res);
1551 __ logical_xor(xor_res, new_val, xor_res);
1552 __ move(xor_res, xor_shift_res);
1553 __ unsigned_shift_right(xor_shift_res,
1554 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1555 xor_shift_res,
1556 LIR_OprDesc::illegalOpr());
1557 } else {
1558 __ logical_xor(addr, new_val, xor_res);
1559 __ unsigned_shift_right(xor_res,
1560 LIR_OprFact::intConst(HeapRegion::LogOfHRGrainBytes),
1561 xor_shift_res,
1562 LIR_OprDesc::illegalOpr());
1563 }
1564
1565 if (!new_val->is_register()) {
1566 LIR_Opr new_val_reg = new_register(T_OBJECT);
1567 __ leal(new_val, new_val_reg);
1568 new_val = new_val_reg;
1569 }
1570 assert(new_val->is_register(), "must be a register at this point");
1571
1572 __ cmp(lir_cond_notEqual, xor_shift_res, LIR_OprFact::intptrConst(NULL_WORD));
1573
1574 CodeStub* slow = new G1PostBarrierStub(addr, new_val);
1575 __ branch(lir_cond_notEqual, LP64_ONLY(T_LONG) NOT_LP64(T_INT), slow);
1576 __ branch_destination(slow->continuation());
1577 }
1578
1579 #endif // INCLUDE_ALL_GCS
1580 ////////////////////////////////////////////////////////////////////////
1581
1582 void LIRGenerator::CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val) {
1583 CardTableModRefBS* ct = barrier_set_cast<CardTableModRefBS>(_bs);
1584 assert(sizeof(*(ct->byte_map_base)) == sizeof(jbyte), "adjust this code");
1585 LIR_Const* card_table_base = new LIR_Const(ct->byte_map_base);
1586 if (addr->is_address()) {
1587 LIR_Address* address = addr->as_address_ptr();
1588 // ptr cannot be an object because we use this barrier for array card marks
1589 // and addr can point in the middle of an array.
1590 LIR_Opr ptr = new_pointer_register();
1591 if (!address->index()->is_valid() && address->disp() == 0) {
1592 __ move(address->base(), ptr);
1593 } else {
1594 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
1595 __ leal(addr, ptr);
1596 }
1597 addr = ptr;
1598 }
1599 assert(addr->is_register(), "must be a register at this point");
1600
1601 #ifdef CARDTABLEMODREF_POST_BARRIER_HELPER
1602 CardTableModRef_post_barrier_helper(addr, card_table_base);
1603 #else
1604 LIR_Opr tmp = new_pointer_register();
1605 if (TwoOperandLIRForm) {
1606 __ move(addr, tmp);
1607 __ unsigned_shift_right(tmp, CardTableModRefBS::card_shift, tmp);
1608 } else {
1609 __ unsigned_shift_right(addr, CardTableModRefBS::card_shift, tmp);
1610 }
1611
1612 LIR_Address* card_addr;
1613 if (can_inline_as_constant(card_table_base)) {
1614 card_addr = new LIR_Address(tmp, card_table_base->as_jint(), T_BYTE);
1615 } else {
1616 card_addr = new LIR_Address(tmp, load_constant(card_table_base), T_BYTE);
1617 }
1618
1619 LIR_Opr dirty = LIR_OprFact::intConst(CardTableModRefBS::dirty_card_val());
1620 if (UseCondCardMark) {
1621 LIR_Opr cur_value = new_register(T_INT);
1622 __ move(card_addr, cur_value);
1623
1624 LabelObj* L_already_dirty = new LabelObj();
1625 __ cmp(lir_cond_equal, cur_value, dirty);
1626 __ branch(lir_cond_equal, T_BYTE, L_already_dirty->label());
1627 __ move(dirty, card_addr);
1628 __ branch_destination(L_already_dirty->label());
1629 } else {
1630 __ move(dirty, card_addr);
1631 }
1632 #endif
1633 }
1634
1635
1636 //------------------------field access--------------------------------------
1637
1638 // Comment copied form templateTable_i486.cpp
1639 // ----------------------------------------------------------------------------
1640 // Volatile variables demand their effects be made known to all CPU's in
1641 // order. Store buffers on most chips allow reads & writes to reorder; the
1642 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
1643 // memory barrier (i.e., it's not sufficient that the interpreter does not
1644 // reorder volatile references, the hardware also must not reorder them).
1645 //
1646 // According to the new Java Memory Model (JMM):
1647 // (1) All volatiles are serialized wrt to each other.
1648 // ALSO reads & writes act as aquire & release, so:
1649 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
1650 // the read float up to before the read. It's OK for non-volatile memory refs
1651 // that happen before the volatile read to float down below it.
1652 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
1653 // that happen BEFORE the write float down to after the write. It's OK for
1654 // non-volatile memory refs that happen after the volatile write to float up
1655 // before it.
1656 //
1657 // We only put in barriers around volatile refs (they are expensive), not
1658 // _between_ memory refs (that would require us to track the flavor of the
1659 // previous memory refs). Requirements (2) and (3) require some barriers
1660 // before volatile stores and after volatile loads. These nearly cover
1661 // requirement (1) but miss the volatile-store-volatile-load case. This final
1662 // case is placed after volatile-stores although it could just as well go
1663 // before volatile-loads.
1664
1665
1666 void LIRGenerator::do_StoreField(StoreField* x) {
1667 bool needs_patching = x->needs_patching();
1668 bool is_volatile = x->field()->is_volatile();
1669 BasicType field_type = x->field_type();
1670 bool is_oop = (field_type == T_ARRAY || field_type == T_OBJECT);
1671
1672 CodeEmitInfo* info = NULL;
1673 if (needs_patching) {
1674 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1675 info = state_for(x, x->state_before());
1676 } else if (x->needs_null_check()) {
1677 NullCheck* nc = x->explicit_null_check();
1678 if (nc == NULL) {
1679 info = state_for(x);
1680 } else {
1681 info = state_for(nc);
1682 }
1683 }
1684
1685
1686 LIRItem object(x->obj(), this);
1687 LIRItem value(x->value(), this);
1688
1689 object.load_item();
1690
1691 if (is_volatile || needs_patching) {
1692 // load item if field is volatile (fewer special cases for volatiles)
1693 // load item if field not initialized
1694 // load item if field not constant
1695 // because of code patching we cannot inline constants
1696 if (field_type == T_BYTE || field_type == T_BOOLEAN) {
1697 value.load_byte_item();
1698 } else {
1699 value.load_item();
1700 }
1701 } else {
1702 value.load_for_store(field_type);
1703 }
1704
1705 set_no_result(x);
1706
1707 #ifndef PRODUCT
1708 if (PrintNotLoaded && needs_patching) {
1709 tty->print_cr(" ###class not loaded at store_%s bci %d",
1710 x->is_static() ? "static" : "field", x->printable_bci());
1711 }
1712 #endif
1713
1714 if (x->needs_null_check() &&
1715 (needs_patching ||
1716 MacroAssembler::needs_explicit_null_check(x->offset()))) {
1717 // emit an explicit null check because the offset is too large
1718 __ null_check(object.result(), new CodeEmitInfo(info));
1719 }
1720
1721 LIR_Address* address;
1722 if (needs_patching) {
1723 // we need to patch the offset in the instruction so don't allow
1724 // generate_address to try to be smart about emitting the -1.
1725 // Otherwise the patching code won't know how to find the
1726 // instruction to patch.
1727 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1728 } else {
1729 address = generate_address(object.result(), x->offset(), field_type);
1730 }
1731
1732 if (is_volatile && os::is_MP()) {
1733 __ membar_release();
1734 }
1735
1736 if (is_oop) {
1737 // Do the pre-write barrier, if any.
1738 pre_barrier(LIR_OprFact::address(address),
1739 LIR_OprFact::illegalOpr /* pre_val */,
1740 true /* do_load*/,
1741 needs_patching,
1742 (info ? new CodeEmitInfo(info) : NULL));
1743 }
1744
1745 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses;
1746 if (needs_atomic_access && !needs_patching) {
1747 volatile_field_store(value.result(), address, info);
1748 } else {
1749 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1750 __ store(value.result(), address, info, patch_code);
1751 }
1752
1753 if (is_oop) {
1754 // Store to object so mark the card of the header
1755 post_barrier(object.result(), value.result());
1756 }
1757
1758 if (is_volatile && os::is_MP()) {
1759 __ membar();
1760 }
1761 }
1762
1763
1764 void LIRGenerator::do_LoadField(LoadField* x) {
1765 bool needs_patching = x->needs_patching();
1766 bool is_volatile = x->field()->is_volatile();
1767 BasicType field_type = x->field_type();
1768
1769 CodeEmitInfo* info = NULL;
1770 if (needs_patching) {
1771 assert(x->explicit_null_check() == NULL, "can't fold null check into patching field access");
1772 info = state_for(x, x->state_before());
1773 } else if (x->needs_null_check()) {
1774 NullCheck* nc = x->explicit_null_check();
1775 if (nc == NULL) {
1776 info = state_for(x);
1777 } else {
1778 info = state_for(nc);
1779 }
1780 }
1781
1782 LIRItem object(x->obj(), this);
1783
1784 object.load_item();
1785
1786 #ifndef PRODUCT
1787 if (PrintNotLoaded && needs_patching) {
1788 tty->print_cr(" ###class not loaded at load_%s bci %d",
1789 x->is_static() ? "static" : "field", x->printable_bci());
1790 }
1791 #endif
1792
1793 bool stress_deopt = StressLoopInvariantCodeMotion && info && info->deoptimize_on_exception();
1794 if (x->needs_null_check() &&
1795 (needs_patching ||
1796 MacroAssembler::needs_explicit_null_check(x->offset()) ||
1797 stress_deopt)) {
1798 LIR_Opr obj = object.result();
1799 if (stress_deopt) {
1800 obj = new_register(T_OBJECT);
1801 __ move(LIR_OprFact::oopConst(NULL), obj);
1802 }
1803 // emit an explicit null check because the offset is too large
1804 __ null_check(obj, new CodeEmitInfo(info));
1805 }
1806
1807 LIR_Opr reg = rlock_result(x, field_type);
1808 LIR_Address* address;
1809 if (needs_patching) {
1810 // we need to patch the offset in the instruction so don't allow
1811 // generate_address to try to be smart about emitting the -1.
1812 // Otherwise the patching code won't know how to find the
1813 // instruction to patch.
1814 address = new LIR_Address(object.result(), PATCHED_ADDR, field_type);
1815 } else {
1816 address = generate_address(object.result(), x->offset(), field_type);
1817 }
1818
1819 bool needs_atomic_access = is_volatile || AlwaysAtomicAccesses;
1820 if (needs_atomic_access && !needs_patching) {
1821 volatile_field_load(address, reg, info);
1822 } else {
1823 LIR_PatchCode patch_code = needs_patching ? lir_patch_normal : lir_patch_none;
1824 __ load(address, reg, info, patch_code);
1825 }
1826
1827 if (is_volatile && os::is_MP()) {
1828 __ membar_acquire();
1829 }
1830 }
1831
1832
1833 //------------------------java.nio.Buffer.checkIndex------------------------
1834
1835 // int java.nio.Buffer.checkIndex(int)
1836 void LIRGenerator::do_NIOCheckIndex(Intrinsic* x) {
1837 // NOTE: by the time we are in checkIndex() we are guaranteed that
1838 // the buffer is non-null (because checkIndex is package-private and
1839 // only called from within other methods in the buffer).
1840 assert(x->number_of_arguments() == 2, "wrong type");
1841 LIRItem buf (x->argument_at(0), this);
1842 LIRItem index(x->argument_at(1), this);
1843 buf.load_item();
1844 index.load_item();
1845
1846 LIR_Opr result = rlock_result(x);
1847 if (GenerateRangeChecks) {
1848 CodeEmitInfo* info = state_for(x);
1849 CodeStub* stub = new RangeCheckStub(info, index.result(), true);
1850 if (index.result()->is_constant()) {
1851 cmp_mem_int(lir_cond_belowEqual, buf.result(), java_nio_Buffer::limit_offset(), index.result()->as_jint(), info);
1852 __ branch(lir_cond_belowEqual, T_INT, stub);
1853 } else {
1854 cmp_reg_mem(lir_cond_aboveEqual, index.result(), buf.result(),
1855 java_nio_Buffer::limit_offset(), T_INT, info);
1856 __ branch(lir_cond_aboveEqual, T_INT, stub);
1857 }
1858 __ move(index.result(), result);
1859 } else {
1860 // Just load the index into the result register
1861 __ move(index.result(), result);
1862 }
1863 }
1864
1865
1866 //------------------------array access--------------------------------------
1867
1868
1869 void LIRGenerator::do_ArrayLength(ArrayLength* x) {
1870 LIRItem array(x->array(), this);
1871 array.load_item();
1872 LIR_Opr reg = rlock_result(x);
1873
1874 CodeEmitInfo* info = NULL;
1875 if (x->needs_null_check()) {
1876 NullCheck* nc = x->explicit_null_check();
1877 if (nc == NULL) {
1878 info = state_for(x);
1879 } else {
1880 info = state_for(nc);
1881 }
1882 if (StressLoopInvariantCodeMotion && info->deoptimize_on_exception()) {
1883 LIR_Opr obj = new_register(T_OBJECT);
1884 __ move(LIR_OprFact::oopConst(NULL), obj);
1885 __ null_check(obj, new CodeEmitInfo(info));
1886 }
1887 }
1888 __ load(new LIR_Address(array.result(), arrayOopDesc::length_offset_in_bytes(), T_INT), reg, info, lir_patch_none);
1889 }
1890
1891
1892 void LIRGenerator::do_LoadIndexed(LoadIndexed* x) {
1893 bool use_length = x->length() != NULL;
1894 LIRItem array(x->array(), this);
1895 LIRItem index(x->index(), this);
1896 LIRItem length(this);
1897 bool needs_range_check = x->compute_needs_range_check();
1898
1899 if (use_length && needs_range_check) {
1900 length.set_instruction(x->length());
1901 length.load_item();
1902 }
1903
1904 array.load_item();
1905 if (index.is_constant() && can_inline_as_constant(x->index())) {
1906 // let it be a constant
1907 index.dont_load_item();
1908 } else {
1909 index.load_item();
1910 }
1911
1912 CodeEmitInfo* range_check_info = state_for(x);
1913 CodeEmitInfo* null_check_info = NULL;
1914 if (x->needs_null_check()) {
1915 NullCheck* nc = x->explicit_null_check();
1916 if (nc != NULL) {
1917 null_check_info = state_for(nc);
1918 } else {
1919 null_check_info = range_check_info;
1920 }
1921 if (StressLoopInvariantCodeMotion && null_check_info->deoptimize_on_exception()) {
1922 LIR_Opr obj = new_register(T_OBJECT);
1923 __ move(LIR_OprFact::oopConst(NULL), obj);
1924 __ null_check(obj, new CodeEmitInfo(null_check_info));
1925 }
1926 }
1927
1928 // emit array address setup early so it schedules better
1929 LIR_Address* array_addr = emit_array_address(array.result(), index.result(), x->elt_type(), false);
1930
1931 if (GenerateRangeChecks && needs_range_check) {
1932 if (StressLoopInvariantCodeMotion && range_check_info->deoptimize_on_exception()) {
1933 __ branch(lir_cond_always, T_ILLEGAL, new RangeCheckStub(range_check_info, index.result()));
1934 } else if (use_length) {
1935 // TODO: use a (modified) version of array_range_check that does not require a
1936 // constant length to be loaded to a register
1937 __ cmp(lir_cond_belowEqual, length.result(), index.result());
1938 __ branch(lir_cond_belowEqual, T_INT, new RangeCheckStub(range_check_info, index.result()));
1939 } else {
1940 array_range_check(array.result(), index.result(), null_check_info, range_check_info);
1941 // The range check performs the null check, so clear it out for the load
1942 null_check_info = NULL;
1943 }
1944 }
1945
1946 __ move(array_addr, rlock_result(x, x->elt_type()), null_check_info);
1947 }
1948
1949
1950 void LIRGenerator::do_NullCheck(NullCheck* x) {
1951 if (x->can_trap()) {
1952 LIRItem value(x->obj(), this);
1953 value.load_item();
1954 CodeEmitInfo* info = state_for(x);
1955 __ null_check(value.result(), info);
1956 }
1957 }
1958
1959
1960 void LIRGenerator::do_TypeCast(TypeCast* x) {
1961 LIRItem value(x->obj(), this);
1962 value.load_item();
1963 // the result is the same as from the node we are casting
1964 set_result(x, value.result());
1965 }
1966
1967
1968 void LIRGenerator::do_Throw(Throw* x) {
1969 LIRItem exception(x->exception(), this);
1970 exception.load_item();
1971 set_no_result(x);
1972 LIR_Opr exception_opr = exception.result();
1973 CodeEmitInfo* info = state_for(x, x->state());
1974
1975 #ifndef PRODUCT
1976 if (PrintC1Statistics) {
1977 increment_counter(Runtime1::throw_count_address(), T_INT);
1978 }
1979 #endif
1980
1981 // check if the instruction has an xhandler in any of the nested scopes
1982 bool unwind = false;
1983 if (info->exception_handlers()->length() == 0) {
1984 // this throw is not inside an xhandler
1985 unwind = true;
1986 } else {
1987 // get some idea of the throw type
1988 bool type_is_exact = true;
1989 ciType* throw_type = x->exception()->exact_type();
1990 if (throw_type == NULL) {
1991 type_is_exact = false;
1992 throw_type = x->exception()->declared_type();
1993 }
1994 if (throw_type != NULL && throw_type->is_instance_klass()) {
1995 ciInstanceKlass* throw_klass = (ciInstanceKlass*)throw_type;
1996 unwind = !x->exception_handlers()->could_catch(throw_klass, type_is_exact);
1997 }
1998 }
1999
2000 // do null check before moving exception oop into fixed register
2001 // to avoid a fixed interval with an oop during the null check.
2002 // Use a copy of the CodeEmitInfo because debug information is
2003 // different for null_check and throw.
2004 if (GenerateCompilerNullChecks &&
2005 (x->exception()->as_NewInstance() == NULL && x->exception()->as_ExceptionObject() == NULL)) {
2006 // if the exception object wasn't created using new then it might be null.
2007 __ null_check(exception_opr, new CodeEmitInfo(info, x->state()->copy(ValueStack::ExceptionState, x->state()->bci())));
2008 }
2009
2010 if (compilation()->env()->jvmti_can_post_on_exceptions()) {
2011 // we need to go through the exception lookup path to get JVMTI
2012 // notification done
2013 unwind = false;
2014 }
2015
2016 // move exception oop into fixed register
2017 __ move(exception_opr, exceptionOopOpr());
2018
2019 if (unwind) {
2020 __ unwind_exception(exceptionOopOpr());
2021 } else {
2022 __ throw_exception(exceptionPcOpr(), exceptionOopOpr(), info);
2023 }
2024 }
2025
2026
2027 void LIRGenerator::do_RoundFP(RoundFP* x) {
2028 LIRItem input(x->input(), this);
2029 input.load_item();
2030 LIR_Opr input_opr = input.result();
2031 assert(input_opr->is_register(), "why round if value is not in a register?");
2032 assert(input_opr->is_single_fpu() || input_opr->is_double_fpu(), "input should be floating-point value");
2033 if (input_opr->is_single_fpu()) {
2034 set_result(x, round_item(input_opr)); // This code path not currently taken
2035 } else {
2036 LIR_Opr result = new_register(T_DOUBLE);
2037 set_vreg_flag(result, must_start_in_memory);
2038 __ roundfp(input_opr, LIR_OprFact::illegalOpr, result);
2039 set_result(x, result);
2040 }
2041 }
2042
2043 // Here UnsafeGetRaw may have x->base() and x->index() be int or long
2044 // on both 64 and 32 bits. Expecting x->base() to be always long on 64bit.
2045 void LIRGenerator::do_UnsafeGetRaw(UnsafeGetRaw* x) {
2046 LIRItem base(x->base(), this);
2047 LIRItem idx(this);
2048
2049 base.load_item();
2050 if (x->has_index()) {
2051 idx.set_instruction(x->index());
2052 idx.load_nonconstant();
2053 }
2054
2055 LIR_Opr reg = rlock_result(x, x->basic_type());
2056
2057 int log2_scale = 0;
2058 if (x->has_index()) {
2059 log2_scale = x->log2_scale();
2060 }
2061
2062 assert(!x->has_index() || idx.value() == x->index(), "should match");
2063
2064 LIR_Opr base_op = base.result();
2065 LIR_Opr index_op = idx.result();
2066 #ifndef _LP64
2067 if (base_op->type() == T_LONG) {
2068 base_op = new_register(T_INT);
2069 __ convert(Bytecodes::_l2i, base.result(), base_op);
2070 }
2071 if (x->has_index()) {
2072 if (index_op->type() == T_LONG) {
2073 LIR_Opr long_index_op = index_op;
2074 if (index_op->is_constant()) {
2075 long_index_op = new_register(T_LONG);
2076 __ move(index_op, long_index_op);
2077 }
2078 index_op = new_register(T_INT);
2079 __ convert(Bytecodes::_l2i, long_index_op, index_op);
2080 } else {
2081 assert(x->index()->type()->tag() == intTag, "must be");
2082 }
2083 }
2084 // At this point base and index should be all ints.
2085 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2086 assert(!x->has_index() || index_op->type() == T_INT, "index should be an int");
2087 #else
2088 if (x->has_index()) {
2089 if (index_op->type() == T_INT) {
2090 if (!index_op->is_constant()) {
2091 index_op = new_register(T_LONG);
2092 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2093 }
2094 } else {
2095 assert(index_op->type() == T_LONG, "must be");
2096 if (index_op->is_constant()) {
2097 index_op = new_register(T_LONG);
2098 __ move(idx.result(), index_op);
2099 }
2100 }
2101 }
2102 // At this point base is a long non-constant
2103 // Index is a long register or a int constant.
2104 // We allow the constant to stay an int because that would allow us a more compact encoding by
2105 // embedding an immediate offset in the address expression. If we have a long constant, we have to
2106 // move it into a register first.
2107 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a long non-constant");
2108 assert(!x->has_index() || (index_op->type() == T_INT && index_op->is_constant()) ||
2109 (index_op->type() == T_LONG && !index_op->is_constant()), "unexpected index type");
2110 #endif
2111
2112 BasicType dst_type = x->basic_type();
2113
2114 LIR_Address* addr;
2115 if (index_op->is_constant()) {
2116 assert(log2_scale == 0, "must not have a scale");
2117 assert(index_op->type() == T_INT, "only int constants supported");
2118 addr = new LIR_Address(base_op, index_op->as_jint(), dst_type);
2119 } else {
2120 #ifdef X86
2121 addr = new LIR_Address(base_op, index_op, LIR_Address::Scale(log2_scale), 0, dst_type);
2122 #elif defined(GENERATE_ADDRESS_IS_PREFERRED)
2123 addr = generate_address(base_op, index_op, log2_scale, 0, dst_type);
2124 #else
2125 if (index_op->is_illegal() || log2_scale == 0) {
2126 addr = new LIR_Address(base_op, index_op, dst_type);
2127 } else {
2128 LIR_Opr tmp = new_pointer_register();
2129 __ shift_left(index_op, log2_scale, tmp);
2130 addr = new LIR_Address(base_op, tmp, dst_type);
2131 }
2132 #endif
2133 }
2134
2135 if (x->may_be_unaligned() && (dst_type == T_LONG || dst_type == T_DOUBLE)) {
2136 __ unaligned_move(addr, reg);
2137 } else {
2138 if (dst_type == T_OBJECT && x->is_wide()) {
2139 __ move_wide(addr, reg);
2140 } else {
2141 __ move(addr, reg);
2142 }
2143 }
2144 }
2145
2146
2147 void LIRGenerator::do_UnsafePutRaw(UnsafePutRaw* x) {
2148 int log2_scale = 0;
2149 BasicType type = x->basic_type();
2150
2151 if (x->has_index()) {
2152 log2_scale = x->log2_scale();
2153 }
2154
2155 LIRItem base(x->base(), this);
2156 LIRItem value(x->value(), this);
2157 LIRItem idx(this);
2158
2159 base.load_item();
2160 if (x->has_index()) {
2161 idx.set_instruction(x->index());
2162 idx.load_item();
2163 }
2164
2165 if (type == T_BYTE || type == T_BOOLEAN) {
2166 value.load_byte_item();
2167 } else {
2168 value.load_item();
2169 }
2170
2171 set_no_result(x);
2172
2173 LIR_Opr base_op = base.result();
2174 LIR_Opr index_op = idx.result();
2175
2176 #ifdef GENERATE_ADDRESS_IS_PREFERRED
2177 LIR_Address* addr = generate_address(base_op, index_op, log2_scale, 0, x->basic_type());
2178 #else
2179 #ifndef _LP64
2180 if (base_op->type() == T_LONG) {
2181 base_op = new_register(T_INT);
2182 __ convert(Bytecodes::_l2i, base.result(), base_op);
2183 }
2184 if (x->has_index()) {
2185 if (index_op->type() == T_LONG) {
2186 index_op = new_register(T_INT);
2187 __ convert(Bytecodes::_l2i, idx.result(), index_op);
2188 }
2189 }
2190 // At this point base and index should be all ints and not constants
2191 assert(base_op->type() == T_INT && !base_op->is_constant(), "base should be an non-constant int");
2192 assert(!x->has_index() || (index_op->type() == T_INT && !index_op->is_constant()), "index should be an non-constant int");
2193 #else
2194 if (x->has_index()) {
2195 if (index_op->type() == T_INT) {
2196 index_op = new_register(T_LONG);
2197 __ convert(Bytecodes::_i2l, idx.result(), index_op);
2198 }
2199 }
2200 // At this point base and index are long and non-constant
2201 assert(base_op->type() == T_LONG && !base_op->is_constant(), "base must be a non-constant long");
2202 assert(!x->has_index() || (index_op->type() == T_LONG && !index_op->is_constant()), "index must be a non-constant long");
2203 #endif
2204
2205 if (log2_scale != 0) {
2206 // temporary fix (platform dependent code without shift on Intel would be better)
2207 // TODO: ARM also allows embedded shift in the address
2208 __ shift_left(index_op, log2_scale, index_op);
2209 }
2210
2211 LIR_Address* addr = new LIR_Address(base_op, index_op, x->basic_type());
2212 #endif // !GENERATE_ADDRESS_IS_PREFERRED
2213 __ move(value.result(), addr);
2214 }
2215
2216
2217 void LIRGenerator::do_UnsafeGetObject(UnsafeGetObject* x) {
2218 BasicType type = x->basic_type();
2219 LIRItem src(x->object(), this);
2220 LIRItem off(x->offset(), this);
2221
2222 off.load_item();
2223 src.load_item();
2224
2225 LIR_Opr value = rlock_result(x, x->basic_type());
2226
2227 get_Object_unsafe(value, src.result(), off.result(), type, x->is_volatile());
2228
2229 #if INCLUDE_ALL_GCS
2230 // We might be reading the value of the referent field of a
2231 // Reference object in order to attach it back to the live
2232 // object graph. If G1 is enabled then we need to record
2233 // the value that is being returned in an SATB log buffer.
2234 //
2235 // We need to generate code similar to the following...
2236 //
2237 // if (offset == java_lang_ref_Reference::referent_offset) {
2238 // if (src != NULL) {
2239 // if (klass(src)->reference_type() != REF_NONE) {
2240 // pre_barrier(..., value, ...);
2241 // }
2242 // }
2243 // }
2244
2245 if (UseG1GC && type == T_OBJECT) {
2246 bool gen_pre_barrier = true; // Assume we need to generate pre_barrier.
2247 bool gen_offset_check = true; // Assume we need to generate the offset guard.
2248 bool gen_source_check = true; // Assume we need to check the src object for null.
2249 bool gen_type_check = true; // Assume we need to check the reference_type.
2250
2251 if (off.is_constant()) {
2252 jlong off_con = (off.type()->is_int() ?
2253 (jlong) off.get_jint_constant() :
2254 off.get_jlong_constant());
2255
2256
2257 if (off_con != (jlong) java_lang_ref_Reference::referent_offset) {
2258 // The constant offset is something other than referent_offset.
2259 // We can skip generating/checking the remaining guards and
2260 // skip generation of the code stub.
2261 gen_pre_barrier = false;
2262 } else {
2263 // The constant offset is the same as referent_offset -
2264 // we do not need to generate a runtime offset check.
2265 gen_offset_check = false;
2266 }
2267 }
2268
2269 // We don't need to generate stub if the source object is an array
2270 if (gen_pre_barrier && src.type()->is_array()) {
2271 gen_pre_barrier = false;
2272 }
2273
2274 if (gen_pre_barrier) {
2275 // We still need to continue with the checks.
2276 if (src.is_constant()) {
2277 ciObject* src_con = src.get_jobject_constant();
2278 guarantee(src_con != NULL, "no source constant");
2279
2280 if (src_con->is_null_object()) {
2281 // The constant src object is null - We can skip
2282 // generating the code stub.
2283 gen_pre_barrier = false;
2284 } else {
2285 // Non-null constant source object. We still have to generate
2286 // the slow stub - but we don't need to generate the runtime
2287 // null object check.
2288 gen_source_check = false;
2289 }
2290 }
2291 }
2292 if (gen_pre_barrier && !PatchALot) {
2293 // Can the klass of object be statically determined to be
2294 // a sub-class of Reference?
2295 ciType* type = src.value()->declared_type();
2296 if ((type != NULL) && type->is_loaded()) {
2297 if (type->is_subtype_of(compilation()->env()->Reference_klass())) {
2298 gen_type_check = false;
2299 } else if (type->is_klass() &&
2300 !compilation()->env()->Object_klass()->is_subtype_of(type->as_klass())) {
2301 // Not Reference and not Object klass.
2302 gen_pre_barrier = false;
2303 }
2304 }
2305 }
2306
2307 if (gen_pre_barrier) {
2308 LabelObj* Lcont = new LabelObj();
2309
2310 // We can have generate one runtime check here. Let's start with
2311 // the offset check.
2312 if (gen_offset_check) {
2313 // if (offset != referent_offset) -> continue
2314 // If offset is an int then we can do the comparison with the
2315 // referent_offset constant; otherwise we need to move
2316 // referent_offset into a temporary register and generate
2317 // a reg-reg compare.
2318
2319 LIR_Opr referent_off;
2320
2321 if (off.type()->is_int()) {
2322 referent_off = LIR_OprFact::intConst(java_lang_ref_Reference::referent_offset);
2323 } else {
2324 assert(off.type()->is_long(), "what else?");
2325 referent_off = new_register(T_LONG);
2326 __ move(LIR_OprFact::longConst(java_lang_ref_Reference::referent_offset), referent_off);
2327 }
2328 __ cmp(lir_cond_notEqual, off.result(), referent_off);
2329 __ branch(lir_cond_notEqual, as_BasicType(off.type()), Lcont->label());
2330 }
2331 if (gen_source_check) {
2332 // offset is a const and equals referent offset
2333 // if (source == null) -> continue
2334 __ cmp(lir_cond_equal, src.result(), LIR_OprFact::oopConst(NULL));
2335 __ branch(lir_cond_equal, T_OBJECT, Lcont->label());
2336 }
2337 LIR_Opr src_klass = new_register(T_OBJECT);
2338 if (gen_type_check) {
2339 // We have determined that offset == referent_offset && src != null.
2340 // if (src->_klass->_reference_type == REF_NONE) -> continue
2341 __ move(new LIR_Address(src.result(), oopDesc::klass_offset_in_bytes(), T_ADDRESS), src_klass);
2342 LIR_Address* reference_type_addr = new LIR_Address(src_klass, in_bytes(InstanceKlass::reference_type_offset()), T_BYTE);
2343 LIR_Opr reference_type = new_register(T_INT);
2344 __ move(reference_type_addr, reference_type);
2345 __ cmp(lir_cond_equal, reference_type, LIR_OprFact::intConst(REF_NONE));
2346 __ branch(lir_cond_equal, T_INT, Lcont->label());
2347 }
2348 {
2349 // We have determined that src->_klass->_reference_type != REF_NONE
2350 // so register the value in the referent field with the pre-barrier.
2351 pre_barrier(LIR_OprFact::illegalOpr /* addr_opr */,
2352 value /* pre_val */,
2353 false /* do_load */,
2354 false /* patch */,
2355 NULL /* info */);
2356 }
2357 __ branch_destination(Lcont->label());
2358 }
2359 }
2360 #endif // INCLUDE_ALL_GCS
2361
2362 if (x->is_volatile() && os::is_MP()) __ membar_acquire();
2363 }
2364
2365
2366 void LIRGenerator::do_UnsafePutObject(UnsafePutObject* x) {
2367 BasicType type = x->basic_type();
2368 LIRItem src(x->object(), this);
2369 LIRItem off(x->offset(), this);
2370 LIRItem data(x->value(), this);
2371
2372 src.load_item();
2373 if (type == T_BOOLEAN || type == T_BYTE) {
2374 data.load_byte_item();
2375 } else {
2376 data.load_item();
2377 }
2378 off.load_item();
2379
2380 set_no_result(x);
2381
2382 if (x->is_volatile() && os::is_MP()) __ membar_release();
2383 put_Object_unsafe(src.result(), off.result(), data.result(), type, x->is_volatile());
2384 if (x->is_volatile() && os::is_MP()) __ membar();
2385 }
2386
2387
2388 void LIRGenerator::do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux) {
2389 int lng = x->length();
2390
2391 for (int i = 0; i < lng; i++) {
2392 SwitchRange* one_range = x->at(i);
2393 int low_key = one_range->low_key();
2394 int high_key = one_range->high_key();
2395 BlockBegin* dest = one_range->sux();
2396 if (low_key == high_key) {
2397 __ cmp(lir_cond_equal, value, low_key);
2398 __ branch(lir_cond_equal, T_INT, dest);
2399 } else if (high_key - low_key == 1) {
2400 __ cmp(lir_cond_equal, value, low_key);
2401 __ branch(lir_cond_equal, T_INT, dest);
2402 __ cmp(lir_cond_equal, value, high_key);
2403 __ branch(lir_cond_equal, T_INT, dest);
2404 } else {
2405 LabelObj* L = new LabelObj();
2406 __ cmp(lir_cond_less, value, low_key);
2407 __ branch(lir_cond_less, T_INT, L->label());
2408 __ cmp(lir_cond_lessEqual, value, high_key);
2409 __ branch(lir_cond_lessEqual, T_INT, dest);
2410 __ branch_destination(L->label());
2411 }
2412 }
2413 __ jump(default_sux);
2414 }
2415
2416
2417 SwitchRangeArray* LIRGenerator::create_lookup_ranges(TableSwitch* x) {
2418 SwitchRangeList* res = new SwitchRangeList();
2419 int len = x->length();
2420 if (len > 0) {
2421 BlockBegin* sux = x->sux_at(0);
2422 int key = x->lo_key();
2423 BlockBegin* default_sux = x->default_sux();
2424 SwitchRange* range = new SwitchRange(key, sux);
2425 for (int i = 0; i < len; i++, key++) {
2426 BlockBegin* new_sux = x->sux_at(i);
2427 if (sux == new_sux) {
2428 // still in same range
2429 range->set_high_key(key);
2430 } else {
2431 // skip tests which explicitly dispatch to the default
2432 if (sux != default_sux) {
2433 res->append(range);
2434 }
2435 range = new SwitchRange(key, new_sux);
2436 }
2437 sux = new_sux;
2438 }
2439 if (res->length() == 0 || res->last() != range) res->append(range);
2440 }
2441 return res;
2442 }
2443
2444
2445 // we expect the keys to be sorted by increasing value
2446 SwitchRangeArray* LIRGenerator::create_lookup_ranges(LookupSwitch* x) {
2447 SwitchRangeList* res = new SwitchRangeList();
2448 int len = x->length();
2449 if (len > 0) {
2450 BlockBegin* default_sux = x->default_sux();
2451 int key = x->key_at(0);
2452 BlockBegin* sux = x->sux_at(0);
2453 SwitchRange* range = new SwitchRange(key, sux);
2454 for (int i = 1; i < len; i++) {
2455 int new_key = x->key_at(i);
2456 BlockBegin* new_sux = x->sux_at(i);
2457 if (key+1 == new_key && sux == new_sux) {
2458 // still in same range
2459 range->set_high_key(new_key);
2460 } else {
2461 // skip tests which explicitly dispatch to the default
2462 if (range->sux() != default_sux) {
2463 res->append(range);
2464 }
2465 range = new SwitchRange(new_key, new_sux);
2466 }
2467 key = new_key;
2468 sux = new_sux;
2469 }
2470 if (res->length() == 0 || res->last() != range) res->append(range);
2471 }
2472 return res;
2473 }
2474
2475
2476 void LIRGenerator::do_TableSwitch(TableSwitch* x) {
2477 LIRItem tag(x->tag(), this);
2478 tag.load_item();
2479 set_no_result(x);
2480
2481 if (x->is_safepoint()) {
2482 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2483 }
2484
2485 // move values into phi locations
2486 move_to_phi(x->state());
2487
2488 int lo_key = x->lo_key();
2489 int hi_key = x->hi_key();
2490 int len = x->length();
2491 LIR_Opr value = tag.result();
2492 if (UseTableRanges) {
2493 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2494 } else {
2495 for (int i = 0; i < len; i++) {
2496 __ cmp(lir_cond_equal, value, i + lo_key);
2497 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2498 }
2499 __ jump(x->default_sux());
2500 }
2501 }
2502
2503
2504 void LIRGenerator::do_LookupSwitch(LookupSwitch* x) {
2505 LIRItem tag(x->tag(), this);
2506 tag.load_item();
2507 set_no_result(x);
2508
2509 if (x->is_safepoint()) {
2510 __ safepoint(safepoint_poll_register(), state_for(x, x->state_before()));
2511 }
2512
2513 // move values into phi locations
2514 move_to_phi(x->state());
2515
2516 LIR_Opr value = tag.result();
2517 if (UseTableRanges) {
2518 do_SwitchRanges(create_lookup_ranges(x), value, x->default_sux());
2519 } else {
2520 int len = x->length();
2521 for (int i = 0; i < len; i++) {
2522 __ cmp(lir_cond_equal, value, x->key_at(i));
2523 __ branch(lir_cond_equal, T_INT, x->sux_at(i));
2524 }
2525 __ jump(x->default_sux());
2526 }
2527 }
2528
2529
2530 void LIRGenerator::do_Goto(Goto* x) {
2531 set_no_result(x);
2532
2533 if (block()->next()->as_OsrEntry()) {
2534 // need to free up storage used for OSR entry point
2535 LIR_Opr osrBuffer = block()->next()->operand();
2536 BasicTypeList signature;
2537 signature.append(NOT_LP64(T_INT) LP64_ONLY(T_LONG)); // pass a pointer to osrBuffer
2538 CallingConvention* cc = frame_map()->c_calling_convention(&signature);
2539 __ move(osrBuffer, cc->args()->at(0));
2540 __ call_runtime_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
2541 getThreadTemp(), LIR_OprFact::illegalOpr, cc->args());
2542 }
2543
2544 if (x->is_safepoint()) {
2545 ValueStack* state = x->state_before() ? x->state_before() : x->state();
2546
2547 // increment backedge counter if needed
2548 CodeEmitInfo* info = state_for(x, state);
2549 increment_backedge_counter(info, x->profiled_bci());
2550 CodeEmitInfo* safepoint_info = state_for(x, state);
2551 __ safepoint(safepoint_poll_register(), safepoint_info);
2552 }
2553
2554 // Gotos can be folded Ifs, handle this case.
2555 if (x->should_profile()) {
2556 ciMethod* method = x->profiled_method();
2557 assert(method != NULL, "method should be set if branch is profiled");
2558 ciMethodData* md = method->method_data_or_null();
2559 assert(md != NULL, "Sanity");
2560 ciProfileData* data = md->bci_to_data(x->profiled_bci());
2561 assert(data != NULL, "must have profiling data");
2562 int offset;
2563 if (x->direction() == Goto::taken) {
2564 assert(data->is_BranchData(), "need BranchData for two-way branches");
2565 offset = md->byte_offset_of_slot(data, BranchData::taken_offset());
2566 } else if (x->direction() == Goto::not_taken) {
2567 assert(data->is_BranchData(), "need BranchData for two-way branches");
2568 offset = md->byte_offset_of_slot(data, BranchData::not_taken_offset());
2569 } else {
2570 assert(data->is_JumpData(), "need JumpData for branches");
2571 offset = md->byte_offset_of_slot(data, JumpData::taken_offset());
2572 }
2573 LIR_Opr md_reg = new_register(T_METADATA);
2574 __ metadata2reg(md->constant_encoding(), md_reg);
2575
2576 increment_counter(new LIR_Address(md_reg, offset,
2577 NOT_LP64(T_INT) LP64_ONLY(T_LONG)), DataLayout::counter_increment);
2578 }
2579
2580 // emit phi-instruction move after safepoint since this simplifies
2581 // describing the state as the safepoint.
2582 move_to_phi(x->state());
2583
2584 __ jump(x->default_sux());
2585 }
2586
2587 /**
2588 * Emit profiling code if needed for arguments, parameters, return value types
2589 *
2590 * @param md MDO the code will update at runtime
2591 * @param md_base_offset common offset in the MDO for this profile and subsequent ones
2592 * @param md_offset offset in the MDO (on top of md_base_offset) for this profile
2593 * @param profiled_k current profile
2594 * @param obj IR node for the object to be profiled
2595 * @param mdp register to hold the pointer inside the MDO (md + md_base_offset).
2596 * Set once we find an update to make and use for next ones.
2597 * @param not_null true if we know obj cannot be null
2598 * @param signature_at_call_k signature at call for obj
2599 * @param callee_signature_k signature of callee for obj
2600 * at call and callee signatures differ at method handle call
2601 * @return the only klass we know will ever be seen at this profile point
2602 */
2603 ciKlass* LIRGenerator::profile_type(ciMethodData* md, int md_base_offset, int md_offset, intptr_t profiled_k,
2604 Value obj, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k,
2605 ciKlass* callee_signature_k) {
2606 ciKlass* result = NULL;
2607 bool do_null = !not_null && !TypeEntries::was_null_seen(profiled_k);
2608 bool do_update = !TypeEntries::is_type_unknown(profiled_k);
2609 // known not to be null or null bit already set and already set to
2610 // unknown: nothing we can do to improve profiling
2611 if (!do_null && !do_update) {
2612 return result;
2613 }
2614
2615 ciKlass* exact_klass = NULL;
2616 Compilation* comp = Compilation::current();
2617 if (do_update) {
2618 // try to find exact type, using CHA if possible, so that loading
2619 // the klass from the object can be avoided
2620 ciType* type = obj->exact_type();
2621 if (type == NULL) {
2622 type = obj->declared_type();
2623 type = comp->cha_exact_type(type);
2624 }
2625 assert(type == NULL || type->is_klass(), "type should be class");
2626 exact_klass = (type != NULL && type->is_loaded()) ? (ciKlass*)type : NULL;
2627
2628 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2629 }
2630
2631 if (!do_null && !do_update) {
2632 return result;
2633 }
2634
2635 ciKlass* exact_signature_k = NULL;
2636 if (do_update) {
2637 // Is the type from the signature exact (the only one possible)?
2638 exact_signature_k = signature_at_call_k->exact_klass();
2639 if (exact_signature_k == NULL) {
2640 exact_signature_k = comp->cha_exact_type(signature_at_call_k);
2641 } else {
2642 result = exact_signature_k;
2643 // Known statically. No need to emit any code: prevent
2644 // LIR_Assembler::emit_profile_type() from emitting useless code
2645 profiled_k = ciTypeEntries::with_status(result, profiled_k);
2646 }
2647 // exact_klass and exact_signature_k can be both non NULL but
2648 // different if exact_klass is loaded after the ciObject for
2649 // exact_signature_k is created.
2650 if (exact_klass == NULL && exact_signature_k != NULL && exact_klass != exact_signature_k) {
2651 // sometimes the type of the signature is better than the best type
2652 // the compiler has
2653 exact_klass = exact_signature_k;
2654 }
2655 if (callee_signature_k != NULL &&
2656 callee_signature_k != signature_at_call_k) {
2657 ciKlass* improved_klass = callee_signature_k->exact_klass();
2658 if (improved_klass == NULL) {
2659 improved_klass = comp->cha_exact_type(callee_signature_k);
2660 }
2661 if (exact_klass == NULL && improved_klass != NULL && exact_klass != improved_klass) {
2662 exact_klass = exact_signature_k;
2663 }
2664 }
2665 do_update = exact_klass == NULL || ciTypeEntries::valid_ciklass(profiled_k) != exact_klass;
2666 }
2667
2668 if (!do_null && !do_update) {
2669 return result;
2670 }
2671
2672 if (mdp == LIR_OprFact::illegalOpr) {
2673 mdp = new_register(T_METADATA);
2674 __ metadata2reg(md->constant_encoding(), mdp);
2675 if (md_base_offset != 0) {
2676 LIR_Address* base_type_address = new LIR_Address(mdp, md_base_offset, T_ADDRESS);
2677 mdp = new_pointer_register();
2678 __ leal(LIR_OprFact::address(base_type_address), mdp);
2679 }
2680 }
2681 LIRItem value(obj, this);
2682 value.load_item();
2683 __ profile_type(new LIR_Address(mdp, md_offset, T_METADATA),
2684 value.result(), exact_klass, profiled_k, new_pointer_register(), not_null, exact_signature_k != NULL);
2685 return result;
2686 }
2687
2688 // profile parameters on entry to the root of the compilation
2689 void LIRGenerator::profile_parameters(Base* x) {
2690 if (compilation()->profile_parameters()) {
2691 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2692 ciMethodData* md = scope()->method()->method_data_or_null();
2693 assert(md != NULL, "Sanity");
2694
2695 if (md->parameters_type_data() != NULL) {
2696 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
2697 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
2698 LIR_Opr mdp = LIR_OprFact::illegalOpr;
2699 for (int java_index = 0, i = 0, j = 0; j < parameters_type_data->number_of_parameters(); i++) {
2700 LIR_Opr src = args->at(i);
2701 assert(!src->is_illegal(), "check");
2702 BasicType t = src->type();
2703 if (t == T_OBJECT || t == T_ARRAY) {
2704 intptr_t profiled_k = parameters->type(j);
2705 Local* local = x->state()->local_at(java_index)->as_Local();
2706 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
2707 in_bytes(ParametersTypeData::type_offset(j)) - in_bytes(ParametersTypeData::type_offset(0)),
2708 profiled_k, local, mdp, false, local->declared_type()->as_klass(), NULL);
2709 // If the profile is known statically set it once for all and do not emit any code
2710 if (exact != NULL) {
2711 md->set_parameter_type(j, exact);
2712 }
2713 j++;
2714 }
2715 java_index += type2size[t];
2716 }
2717 }
2718 }
2719 }
2720
2721 void LIRGenerator::do_Base(Base* x) {
2722 __ std_entry(LIR_OprFact::illegalOpr);
2723 // Emit moves from physical registers / stack slots to virtual registers
2724 CallingConvention* args = compilation()->frame_map()->incoming_arguments();
2725 IRScope* irScope = compilation()->hir()->top_scope();
2726 int java_index = 0;
2727 for (int i = 0; i < args->length(); i++) {
2728 LIR_Opr src = args->at(i);
2729 assert(!src->is_illegal(), "check");
2730 BasicType t = src->type();
2731
2732 // Types which are smaller than int are passed as int, so
2733 // correct the type which passed.
2734 switch (t) {
2735 case T_BYTE:
2736 case T_BOOLEAN:
2737 case T_SHORT:
2738 case T_CHAR:
2739 t = T_INT;
2740 break;
2741 }
2742
2743 LIR_Opr dest = new_register(t);
2744 __ move(src, dest);
2745
2746 // Assign new location to Local instruction for this local
2747 Local* local = x->state()->local_at(java_index)->as_Local();
2748 assert(local != NULL, "Locals for incoming arguments must have been created");
2749 #ifndef __SOFTFP__
2750 // The java calling convention passes double as long and float as int.
2751 assert(as_ValueType(t)->tag() == local->type()->tag(), "check");
2752 #endif // __SOFTFP__
2753 local->set_operand(dest);
2754 _instruction_for_operand.at_put_grow(dest->vreg_number(), local, NULL);
2755 java_index += type2size[t];
2756 }
2757
2758 if (compilation()->env()->dtrace_method_probes()) {
2759 BasicTypeList signature;
2760 signature.append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
2761 signature.append(T_METADATA); // Method*
2762 LIR_OprList* args = new LIR_OprList();
2763 args->append(getThreadPointer());
2764 LIR_Opr meth = new_register(T_METADATA);
2765 __ metadata2reg(method()->constant_encoding(), meth);
2766 args->append(meth);
2767 call_runtime(&signature, args, CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), voidType, NULL);
2768 }
2769
2770 if (method()->is_synchronized()) {
2771 LIR_Opr obj;
2772 if (method()->is_static()) {
2773 obj = new_register(T_OBJECT);
2774 __ oop2reg(method()->holder()->java_mirror()->constant_encoding(), obj);
2775 } else {
2776 Local* receiver = x->state()->local_at(0)->as_Local();
2777 assert(receiver != NULL, "must already exist");
2778 obj = receiver->operand();
2779 }
2780 assert(obj->is_valid(), "must be valid");
2781
2782 if (method()->is_synchronized() && GenerateSynchronizationCode) {
2783 LIR_Opr lock = new_register(T_INT);
2784 __ load_stack_address_monitor(0, lock);
2785
2786 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, x->check_flag(Instruction::DeoptimizeOnException));
2787 CodeStub* slow_path = new MonitorEnterStub(obj, lock, info);
2788
2789 // receiver is guaranteed non-NULL so don't need CodeEmitInfo
2790 __ lock_object(syncTempOpr(), obj, lock, new_register(T_OBJECT), slow_path, NULL);
2791 }
2792 }
2793 if (compilation()->age_code()) {
2794 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, 0), NULL, false);
2795 decrement_age(info);
2796 }
2797 // increment invocation counters if needed
2798 if (!method()->is_accessor()) { // Accessors do not have MDOs, so no counting.
2799 profile_parameters(x);
2800 CodeEmitInfo* info = new CodeEmitInfo(scope()->start()->state()->copy(ValueStack::StateBefore, SynchronizationEntryBCI), NULL, false);
2801 increment_invocation_counter(info);
2802 }
2803
2804 // all blocks with a successor must end with an unconditional jump
2805 // to the successor even if they are consecutive
2806 __ jump(x->default_sux());
2807 }
2808
2809
2810 void LIRGenerator::do_OsrEntry(OsrEntry* x) {
2811 // construct our frame and model the production of incoming pointer
2812 // to the OSR buffer.
2813 __ osr_entry(LIR_Assembler::osrBufferPointer());
2814 LIR_Opr result = rlock_result(x);
2815 __ move(LIR_Assembler::osrBufferPointer(), result);
2816 }
2817
2818
2819 void LIRGenerator::invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list) {
2820 assert(args->length() == arg_list->length(),
2821 err_msg_res("args=%d, arg_list=%d", args->length(), arg_list->length()));
2822 for (int i = x->has_receiver() ? 1 : 0; i < args->length(); i++) {
2823 LIRItem* param = args->at(i);
2824 LIR_Opr loc = arg_list->at(i);
2825 if (loc->is_register()) {
2826 param->load_item_force(loc);
2827 } else {
2828 LIR_Address* addr = loc->as_address_ptr();
2829 param->load_for_store(addr->type());
2830 if (addr->type() == T_OBJECT) {
2831 __ move_wide(param->result(), addr);
2832 } else
2833 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
2834 __ unaligned_move(param->result(), addr);
2835 } else {
2836 __ move(param->result(), addr);
2837 }
2838 }
2839 }
2840
2841 if (x->has_receiver()) {
2842 LIRItem* receiver = args->at(0);
2843 LIR_Opr loc = arg_list->at(0);
2844 if (loc->is_register()) {
2845 receiver->load_item_force(loc);
2846 } else {
2847 assert(loc->is_address(), "just checking");
2848 receiver->load_for_store(T_OBJECT);
2849 __ move_wide(receiver->result(), loc->as_address_ptr());
2850 }
2851 }
2852 }
2853
2854
2855 // Visits all arguments, returns appropriate items without loading them
2856 LIRItemList* LIRGenerator::invoke_visit_arguments(Invoke* x) {
2857 LIRItemList* argument_items = new LIRItemList();
2858 if (x->has_receiver()) {
2859 LIRItem* receiver = new LIRItem(x->receiver(), this);
2860 argument_items->append(receiver);
2861 }
2862 for (int i = 0; i < x->number_of_arguments(); i++) {
2863 LIRItem* param = new LIRItem(x->argument_at(i), this);
2864 argument_items->append(param);
2865 }
2866 return argument_items;
2867 }
2868
2869
2870 // The invoke with receiver has following phases:
2871 // a) traverse and load/lock receiver;
2872 // b) traverse all arguments -> item-array (invoke_visit_argument)
2873 // c) push receiver on stack
2874 // d) load each of the items and push on stack
2875 // e) unlock receiver
2876 // f) move receiver into receiver-register %o0
2877 // g) lock result registers and emit call operation
2878 //
2879 // Before issuing a call, we must spill-save all values on stack
2880 // that are in caller-save register. "spill-save" moves those registers
2881 // either in a free callee-save register or spills them if no free
2882 // callee save register is available.
2883 //
2884 // The problem is where to invoke spill-save.
2885 // - if invoked between e) and f), we may lock callee save
2886 // register in "spill-save" that destroys the receiver register
2887 // before f) is executed
2888 // - if we rearrange f) to be earlier (by loading %o0) it
2889 // may destroy a value on the stack that is currently in %o0
2890 // and is waiting to be spilled
2891 // - if we keep the receiver locked while doing spill-save,
2892 // we cannot spill it as it is spill-locked
2893 //
2894 void LIRGenerator::do_Invoke(Invoke* x) {
2895 CallingConvention* cc = frame_map()->java_calling_convention(x->signature(), true);
2896
2897 LIR_OprList* arg_list = cc->args();
2898 LIRItemList* args = invoke_visit_arguments(x);
2899 LIR_Opr receiver = LIR_OprFact::illegalOpr;
2900
2901 // setup result register
2902 LIR_Opr result_register = LIR_OprFact::illegalOpr;
2903 if (x->type() != voidType) {
2904 result_register = result_register_for(x->type());
2905 }
2906
2907 CodeEmitInfo* info = state_for(x, x->state());
2908
2909 invoke_load_arguments(x, args, arg_list);
2910
2911 if (x->has_receiver()) {
2912 args->at(0)->load_item_force(LIR_Assembler::receiverOpr());
2913 receiver = args->at(0)->result();
2914 }
2915
2916 // emit invoke code
2917 bool optimized = x->target_is_loaded() && x->target_is_final();
2918 assert(receiver->is_illegal() || receiver->is_equal(LIR_Assembler::receiverOpr()), "must match");
2919
2920 // JSR 292
2921 // Preserve the SP over MethodHandle call sites, if needed.
2922 ciMethod* target = x->target();
2923 bool is_method_handle_invoke = (// %%% FIXME: Are both of these relevant?
2924 target->is_method_handle_intrinsic() ||
2925 target->is_compiled_lambda_form());
2926 if (is_method_handle_invoke) {
2927 info->set_is_method_handle_invoke(true);
2928 if(FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
2929 __ move(FrameMap::stack_pointer(), FrameMap::method_handle_invoke_SP_save_opr());
2930 }
2931 }
2932
2933 switch (x->code()) {
2934 case Bytecodes::_invokestatic:
2935 __ call_static(target, result_register,
2936 SharedRuntime::get_resolve_static_call_stub(),
2937 arg_list, info);
2938 break;
2939 case Bytecodes::_invokespecial:
2940 case Bytecodes::_invokevirtual:
2941 case Bytecodes::_invokeinterface:
2942 // for final target we still produce an inline cache, in order
2943 // to be able to call mixed mode
2944 if (x->code() == Bytecodes::_invokespecial || optimized) {
2945 __ call_opt_virtual(target, receiver, result_register,
2946 SharedRuntime::get_resolve_opt_virtual_call_stub(),
2947 arg_list, info);
2948 } else if (x->vtable_index() < 0) {
2949 __ call_icvirtual(target, receiver, result_register,
2950 SharedRuntime::get_resolve_virtual_call_stub(),
2951 arg_list, info);
2952 } else {
2953 int entry_offset = InstanceKlass::vtable_start_offset() + x->vtable_index() * vtableEntry::size();
2954 int vtable_offset = entry_offset * wordSize + vtableEntry::method_offset_in_bytes();
2955 __ call_virtual(target, receiver, result_register, vtable_offset, arg_list, info);
2956 }
2957 break;
2958 case Bytecodes::_invokedynamic: {
2959 __ call_dynamic(target, receiver, result_register,
2960 SharedRuntime::get_resolve_static_call_stub(),
2961 arg_list, info);
2962 break;
2963 }
2964 default:
2965 fatal(err_msg("unexpected bytecode: %s", Bytecodes::name(x->code())));
2966 break;
2967 }
2968
2969 // JSR 292
2970 // Restore the SP after MethodHandle call sites, if needed.
2971 if (is_method_handle_invoke
2972 && FrameMap::method_handle_invoke_SP_save_opr() != LIR_OprFact::illegalOpr) {
2973 __ move(FrameMap::method_handle_invoke_SP_save_opr(), FrameMap::stack_pointer());
2974 }
2975
2976 if (x->type()->is_float() || x->type()->is_double()) {
2977 // Force rounding of results from non-strictfp when in strictfp
2978 // scope (or when we don't know the strictness of the callee, to
2979 // be safe.)
2980 if (method()->is_strict()) {
2981 if (!x->target_is_loaded() || !x->target_is_strictfp()) {
2982 result_register = round_item(result_register);
2983 }
2984 }
2985 }
2986
2987 if (result_register->is_valid()) {
2988 LIR_Opr result = rlock_result(x);
2989 __ move(result_register, result);
2990 }
2991 }
2992
2993
2994 void LIRGenerator::do_FPIntrinsics(Intrinsic* x) {
2995 assert(x->number_of_arguments() == 1, "wrong type");
2996 LIRItem value (x->argument_at(0), this);
2997 LIR_Opr reg = rlock_result(x);
2998 value.load_item();
2999 LIR_Opr tmp = force_to_spill(value.result(), as_BasicType(x->type()));
3000 __ move(tmp, reg);
3001 }
3002
3003
3004
3005 // Code for : x->x() {x->cond()} x->y() ? x->tval() : x->fval()
3006 void LIRGenerator::do_IfOp(IfOp* x) {
3007 #ifdef ASSERT
3008 {
3009 ValueTag xtag = x->x()->type()->tag();
3010 ValueTag ttag = x->tval()->type()->tag();
3011 assert(xtag == intTag || xtag == objectTag, "cannot handle others");
3012 assert(ttag == addressTag || ttag == intTag || ttag == objectTag || ttag == longTag, "cannot handle others");
3013 assert(ttag == x->fval()->type()->tag(), "cannot handle others");
3014 }
3015 #endif
3016
3017 LIRItem left(x->x(), this);
3018 LIRItem right(x->y(), this);
3019 left.load_item();
3020 if (can_inline_as_constant(right.value())) {
3021 right.dont_load_item();
3022 } else {
3023 right.load_item();
3024 }
3025
3026 LIRItem t_val(x->tval(), this);
3027 LIRItem f_val(x->fval(), this);
3028 t_val.dont_load_item();
3029 f_val.dont_load_item();
3030 LIR_Opr reg = rlock_result(x);
3031
3032 __ cmp(lir_cond(x->cond()), left.result(), right.result());
3033 __ cmove(lir_cond(x->cond()), t_val.result(), f_val.result(), reg, as_BasicType(x->x()->type()));
3034 }
3035
3036 void LIRGenerator::do_RuntimeCall(address routine, int expected_arguments, Intrinsic* x) {
3037 assert(x->number_of_arguments() == expected_arguments, "wrong type");
3038 LIR_Opr reg = result_register_for(x->type());
3039 __ call_runtime_leaf(routine, getThreadTemp(),
3040 reg, new LIR_OprList());
3041 LIR_Opr result = rlock_result(x);
3042 __ move(reg, result);
3043 }
3044
3045 #ifdef TRACE_HAVE_INTRINSICS
3046 void LIRGenerator::do_ThreadIDIntrinsic(Intrinsic* x) {
3047 LIR_Opr thread = getThreadPointer();
3048 LIR_Opr osthread = new_pointer_register();
3049 __ move(new LIR_Address(thread, in_bytes(JavaThread::osthread_offset()), osthread->type()), osthread);
3050 size_t thread_id_size = OSThread::thread_id_size();
3051 if (thread_id_size == (size_t) BytesPerLong) {
3052 LIR_Opr id = new_register(T_LONG);
3053 __ move(new LIR_Address(osthread, in_bytes(OSThread::thread_id_offset()), T_LONG), id);
3054 __ convert(Bytecodes::_l2i, id, rlock_result(x));
3055 } else if (thread_id_size == (size_t) BytesPerInt) {
3056 __ move(new LIR_Address(osthread, in_bytes(OSThread::thread_id_offset()), T_INT), rlock_result(x));
3057 } else {
3058 ShouldNotReachHere();
3059 }
3060 }
3061
3062 void LIRGenerator::do_ClassIDIntrinsic(Intrinsic* x) {
3063 CodeEmitInfo* info = state_for(x);
3064 CodeEmitInfo* info2 = new CodeEmitInfo(info); // Clone for the second null check
3065 BasicType klass_pointer_type = NOT_LP64(T_INT) LP64_ONLY(T_LONG);
3066 assert(info != NULL, "must have info");
3067 LIRItem arg(x->argument_at(1), this);
3068 arg.load_item();
3069 LIR_Opr klass = new_pointer_register();
3070 __ move(new LIR_Address(arg.result(), java_lang_Class::klass_offset_in_bytes(), klass_pointer_type), klass, info);
3071 LIR_Opr id = new_register(T_LONG);
3072 ByteSize offset = TRACE_ID_OFFSET;
3073 LIR_Address* trace_id_addr = new LIR_Address(klass, in_bytes(offset), T_LONG);
3074 __ move(trace_id_addr, id);
3075 __ logical_or(id, LIR_OprFact::longConst(0x01l), id);
3076 __ store(id, trace_id_addr);
3077 __ logical_and(id, LIR_OprFact::longConst(~0x3l), id);
3078 __ move(id, rlock_result(x));
3079 }
3080 #endif
3081
3082 void LIRGenerator::do_Intrinsic(Intrinsic* x) {
3083 switch (x->id()) {
3084 case vmIntrinsics::_intBitsToFloat :
3085 case vmIntrinsics::_doubleToRawLongBits :
3086 case vmIntrinsics::_longBitsToDouble :
3087 case vmIntrinsics::_floatToRawIntBits : {
3088 do_FPIntrinsics(x);
3089 break;
3090 }
3091
3092 #ifdef TRACE_HAVE_INTRINSICS
3093 case vmIntrinsics::_threadID: do_ThreadIDIntrinsic(x); break;
3094 case vmIntrinsics::_classID: do_ClassIDIntrinsic(x); break;
3095 case vmIntrinsics::_counterTime:
3096 do_RuntimeCall(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), 0, x);
3097 break;
3098 #endif
3099
3100 case vmIntrinsics::_currentTimeMillis:
3101 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeMillis), 0, x);
3102 break;
3103
3104 case vmIntrinsics::_nanoTime:
3105 do_RuntimeCall(CAST_FROM_FN_PTR(address, os::javaTimeNanos), 0, x);
3106 break;
3107
3108 case vmIntrinsics::_Object_init: do_RegisterFinalizer(x); break;
3109 case vmIntrinsics::_isInstance: do_isInstance(x); break;
3110 case vmIntrinsics::_getClass: do_getClass(x); break;
3111 case vmIntrinsics::_currentThread: do_currentThread(x); break;
3112
3113 case vmIntrinsics::_dlog: // fall through
3114 case vmIntrinsics::_dlog10: // fall through
3115 case vmIntrinsics::_dabs: // fall through
3116 case vmIntrinsics::_dsqrt: // fall through
3117 case vmIntrinsics::_dtan: // fall through
3118 case vmIntrinsics::_dsin : // fall through
3119 case vmIntrinsics::_dcos : // fall through
3120 case vmIntrinsics::_dexp : // fall through
3121 case vmIntrinsics::_dpow : do_MathIntrinsic(x); break;
3122 case vmIntrinsics::_arraycopy: do_ArrayCopy(x); break;
3123
3124 // java.nio.Buffer.checkIndex
3125 case vmIntrinsics::_checkIndex: do_NIOCheckIndex(x); break;
3126
3127 case vmIntrinsics::_compareAndSwapObject:
3128 do_CompareAndSwap(x, objectType);
3129 break;
3130 case vmIntrinsics::_compareAndSwapInt:
3131 do_CompareAndSwap(x, intType);
3132 break;
3133 case vmIntrinsics::_compareAndSwapLong:
3134 do_CompareAndSwap(x, longType);
3135 break;
3136
3137 case vmIntrinsics::_loadFence :
3138 if (os::is_MP()) __ membar_acquire();
3139 break;
3140 case vmIntrinsics::_storeFence:
3141 if (os::is_MP()) __ membar_release();
3142 break;
3143 case vmIntrinsics::_fullFence :
3144 if (os::is_MP()) __ membar();
3145 break;
3146
3147 case vmIntrinsics::_Reference_get:
3148 do_Reference_get(x);
3149 break;
3150
3151 case vmIntrinsics::_updateCRC32:
3152 case vmIntrinsics::_updateBytesCRC32:
3153 case vmIntrinsics::_updateByteBufferCRC32:
3154 do_update_CRC32(x);
3155 break;
3156
3157 default: ShouldNotReachHere(); break;
3158 }
3159 }
3160
3161 void LIRGenerator::profile_arguments(ProfileCall* x) {
3162 if (compilation()->profile_arguments()) {
3163 int bci = x->bci_of_invoke();
3164 ciMethodData* md = x->method()->method_data_or_null();
3165 ciProfileData* data = md->bci_to_data(bci);
3166 if ((data->is_CallTypeData() && data->as_CallTypeData()->has_arguments()) ||
3167 (data->is_VirtualCallTypeData() && data->as_VirtualCallTypeData()->has_arguments())) {
3168 ByteSize extra = data->is_CallTypeData() ? CallTypeData::args_data_offset() : VirtualCallTypeData::args_data_offset();
3169 int base_offset = md->byte_offset_of_slot(data, extra);
3170 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3171 ciTypeStackSlotEntries* args = data->is_CallTypeData() ? ((ciCallTypeData*)data)->args() : ((ciVirtualCallTypeData*)data)->args();
3172
3173 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3174 int start = 0;
3175 int stop = data->is_CallTypeData() ? ((ciCallTypeData*)data)->number_of_arguments() : ((ciVirtualCallTypeData*)data)->number_of_arguments();
3176 if (x->inlined() && x->callee()->is_static() && Bytecodes::has_receiver(bc)) {
3177 // first argument is not profiled at call (method handle invoke)
3178 assert(x->method()->raw_code_at_bci(bci) == Bytecodes::_invokehandle, "invokehandle expected");
3179 start = 1;
3180 }
3181 ciSignature* callee_signature = x->callee()->signature();
3182 // method handle call to virtual method
3183 bool has_receiver = x->inlined() && !x->callee()->is_static() && !Bytecodes::has_receiver(bc);
3184 ciSignatureStream callee_signature_stream(callee_signature, has_receiver ? x->callee()->holder() : NULL);
3185
3186 bool ignored_will_link;
3187 ciSignature* signature_at_call = NULL;
3188 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3189 ciSignatureStream signature_at_call_stream(signature_at_call);
3190
3191 // if called through method handle invoke, some arguments may have been popped
3192 for (int i = 0; i < stop && i+start < x->nb_profiled_args(); i++) {
3193 int off = in_bytes(TypeEntriesAtCall::argument_type_offset(i)) - in_bytes(TypeEntriesAtCall::args_data_offset());
3194 ciKlass* exact = profile_type(md, base_offset, off,
3195 args->type(i), x->profiled_arg_at(i+start), mdp,
3196 !x->arg_needs_null_check(i+start),
3197 signature_at_call_stream.next_klass(), callee_signature_stream.next_klass());
3198 if (exact != NULL) {
3199 md->set_argument_type(bci, i, exact);
3200 }
3201 }
3202 } else {
3203 #ifdef ASSERT
3204 Bytecodes::Code code = x->method()->raw_code_at_bci(x->bci_of_invoke());
3205 int n = x->nb_profiled_args();
3206 assert(MethodData::profile_parameters() && (MethodData::profile_arguments_jsr292_only() ||
3207 (x->inlined() && ((code == Bytecodes::_invokedynamic && n <= 1) || (code == Bytecodes::_invokehandle && n <= 2)))),
3208 "only at JSR292 bytecodes");
3209 #endif
3210 }
3211 }
3212 }
3213
3214 // profile parameters on entry to an inlined method
3215 void LIRGenerator::profile_parameters_at_call(ProfileCall* x) {
3216 if (compilation()->profile_parameters() && x->inlined()) {
3217 ciMethodData* md = x->callee()->method_data_or_null();
3218 if (md != NULL) {
3219 ciParametersTypeData* parameters_type_data = md->parameters_type_data();
3220 if (parameters_type_data != NULL) {
3221 ciTypeStackSlotEntries* parameters = parameters_type_data->parameters();
3222 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3223 bool has_receiver = !x->callee()->is_static();
3224 ciSignature* sig = x->callee()->signature();
3225 ciSignatureStream sig_stream(sig, has_receiver ? x->callee()->holder() : NULL);
3226 int i = 0; // to iterate on the Instructions
3227 Value arg = x->recv();
3228 bool not_null = false;
3229 int bci = x->bci_of_invoke();
3230 Bytecodes::Code bc = x->method()->java_code_at_bci(bci);
3231 // The first parameter is the receiver so that's what we start
3232 // with if it exists. One exception is method handle call to
3233 // virtual method: the receiver is in the args list
3234 if (arg == NULL || !Bytecodes::has_receiver(bc)) {
3235 i = 1;
3236 arg = x->profiled_arg_at(0);
3237 not_null = !x->arg_needs_null_check(0);
3238 }
3239 int k = 0; // to iterate on the profile data
3240 for (;;) {
3241 intptr_t profiled_k = parameters->type(k);
3242 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(parameters_type_data, ParametersTypeData::type_offset(0)),
3243 in_bytes(ParametersTypeData::type_offset(k)) - in_bytes(ParametersTypeData::type_offset(0)),
3244 profiled_k, arg, mdp, not_null, sig_stream.next_klass(), NULL);
3245 // If the profile is known statically set it once for all and do not emit any code
3246 if (exact != NULL) {
3247 md->set_parameter_type(k, exact);
3248 }
3249 k++;
3250 if (k >= parameters_type_data->number_of_parameters()) {
3251 #ifdef ASSERT
3252 int extra = 0;
3253 if (MethodData::profile_arguments() && TypeProfileParmsLimit != -1 &&
3254 x->nb_profiled_args() >= TypeProfileParmsLimit &&
3255 x->recv() != NULL && Bytecodes::has_receiver(bc)) {
3256 extra += 1;
3257 }
3258 assert(i == x->nb_profiled_args() - extra || (TypeProfileParmsLimit != -1 && TypeProfileArgsLimit > TypeProfileParmsLimit), "unused parameters?");
3259 #endif
3260 break;
3261 }
3262 arg = x->profiled_arg_at(i);
3263 not_null = !x->arg_needs_null_check(i);
3264 i++;
3265 }
3266 }
3267 }
3268 }
3269 }
3270
3271 void LIRGenerator::do_ProfileCall(ProfileCall* x) {
3272 // Need recv in a temporary register so it interferes with the other temporaries
3273 LIR_Opr recv = LIR_OprFact::illegalOpr;
3274 LIR_Opr mdo = new_register(T_OBJECT);
3275 // tmp is used to hold the counters on SPARC
3276 LIR_Opr tmp = new_pointer_register();
3277
3278 if (x->nb_profiled_args() > 0) {
3279 profile_arguments(x);
3280 }
3281
3282 // profile parameters on inlined method entry including receiver
3283 if (x->recv() != NULL || x->nb_profiled_args() > 0) {
3284 profile_parameters_at_call(x);
3285 }
3286
3287 if (x->recv() != NULL) {
3288 LIRItem value(x->recv(), this);
3289 value.load_item();
3290 recv = new_register(T_OBJECT);
3291 __ move(value.result(), recv);
3292 }
3293 __ profile_call(x->method(), x->bci_of_invoke(), x->callee(), mdo, recv, tmp, x->known_holder());
3294 }
3295
3296 void LIRGenerator::do_ProfileReturnType(ProfileReturnType* x) {
3297 int bci = x->bci_of_invoke();
3298 ciMethodData* md = x->method()->method_data_or_null();
3299 ciProfileData* data = md->bci_to_data(bci);
3300 assert(data->is_CallTypeData() || data->is_VirtualCallTypeData(), "wrong profile data type");
3301 ciReturnTypeEntry* ret = data->is_CallTypeData() ? ((ciCallTypeData*)data)->ret() : ((ciVirtualCallTypeData*)data)->ret();
3302 LIR_Opr mdp = LIR_OprFact::illegalOpr;
3303
3304 bool ignored_will_link;
3305 ciSignature* signature_at_call = NULL;
3306 x->method()->get_method_at_bci(bci, ignored_will_link, &signature_at_call);
3307
3308 // The offset within the MDO of the entry to update may be too large
3309 // to be used in load/store instructions on some platforms. So have
3310 // profile_type() compute the address of the profile in a register.
3311 ciKlass* exact = profile_type(md, md->byte_offset_of_slot(data, ret->type_offset()), 0,
3312 ret->type(), x->ret(), mdp,
3313 !x->needs_null_check(),
3314 signature_at_call->return_type()->as_klass(),
3315 x->callee()->signature()->return_type()->as_klass());
3316 if (exact != NULL) {
3317 md->set_return_type(bci, exact);
3318 }
3319 }
3320
3321 void LIRGenerator::do_ProfileInvoke(ProfileInvoke* x) {
3322 // We can safely ignore accessors here, since c2 will inline them anyway,
3323 // accessors are also always mature.
3324 if (!x->inlinee()->is_accessor()) {
3325 CodeEmitInfo* info = state_for(x, x->state(), true);
3326 // Notify the runtime very infrequently only to take care of counter overflows
3327 int freq_log = Tier23InlineeNotifyFreqLog;
3328 double scale;
3329 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3330 freq_log = Arguments::scaled_freq_log(freq_log, scale);
3331 }
3332 increment_event_counter_impl(info, x->inlinee(), right_n_bits(freq_log), InvocationEntryBci, false, true);
3333 }
3334 }
3335
3336 void LIRGenerator::increment_event_counter(CodeEmitInfo* info, int bci, bool backedge) {
3337 int freq_log;
3338 int level = compilation()->env()->comp_level();
3339 if (level == CompLevel_limited_profile) {
3340 freq_log = (backedge ? Tier2BackedgeNotifyFreqLog : Tier2InvokeNotifyFreqLog);
3341 } else if (level == CompLevel_full_profile) {
3342 freq_log = (backedge ? Tier3BackedgeNotifyFreqLog : Tier3InvokeNotifyFreqLog);
3343 } else {
3344 ShouldNotReachHere();
3345 }
3346 // Increment the appropriate invocation/backedge counter and notify the runtime.
3347 double scale;
3348 if (_method->has_option_value("CompileThresholdScaling", scale)) {
3349 freq_log = Arguments::scaled_freq_log(freq_log, scale);
3350 }
3351 increment_event_counter_impl(info, info->scope()->method(), right_n_bits(freq_log), bci, backedge, true);
3352 }
3353
3354 void LIRGenerator::decrement_age(CodeEmitInfo* info) {
3355 ciMethod* method = info->scope()->method();
3356 MethodCounters* mc_adr = method->ensure_method_counters();
3357 if (mc_adr != NULL) {
3358 LIR_Opr mc = new_pointer_register();
3359 __ move(LIR_OprFact::intptrConst(mc_adr), mc);
3360 int offset = in_bytes(MethodCounters::nmethod_age_offset());
3361 LIR_Address* counter = new LIR_Address(mc, offset, T_INT);
3362 LIR_Opr result = new_register(T_INT);
3363 __ load(counter, result);
3364 __ sub(result, LIR_OprFact::intConst(1), result);
3365 __ store(result, counter);
3366 // DeoptimizeStub will reexecute from the current state in code info.
3367 CodeStub* deopt = new DeoptimizeStub(info, Deoptimization::Reason_tenured,
3368 Deoptimization::Action_make_not_entrant);
3369 __ cmp(lir_cond_lessEqual, result, LIR_OprFact::intConst(0));
3370 __ branch(lir_cond_lessEqual, T_INT, deopt);
3371 }
3372 }
3373
3374
3375 void LIRGenerator::increment_event_counter_impl(CodeEmitInfo* info,
3376 ciMethod *method, int frequency,
3377 int bci, bool backedge, bool notify) {
3378 assert(frequency == 0 || is_power_of_2(frequency + 1), "Frequency must be x^2 - 1 or 0");
3379 int level = _compilation->env()->comp_level();
3380 assert(level > CompLevel_simple, "Shouldn't be here");
3381
3382 int offset = -1;
3383 LIR_Opr counter_holder;
3384 if (level == CompLevel_limited_profile) {
3385 MethodCounters* counters_adr = method->ensure_method_counters();
3386 if (counters_adr == NULL) {
3387 bailout("method counters allocation failed");
3388 return;
3389 }
3390 counter_holder = new_pointer_register();
3391 __ move(LIR_OprFact::intptrConst(counters_adr), counter_holder);
3392 offset = in_bytes(backedge ? MethodCounters::backedge_counter_offset() :
3393 MethodCounters::invocation_counter_offset());
3394 } else if (level == CompLevel_full_profile) {
3395 counter_holder = new_register(T_METADATA);
3396 offset = in_bytes(backedge ? MethodData::backedge_counter_offset() :
3397 MethodData::invocation_counter_offset());
3398 ciMethodData* md = method->method_data_or_null();
3399 assert(md != NULL, "Sanity");
3400 __ metadata2reg(md->constant_encoding(), counter_holder);
3401 } else {
3402 ShouldNotReachHere();
3403 }
3404 LIR_Address* counter = new LIR_Address(counter_holder, offset, T_INT);
3405 LIR_Opr result = new_register(T_INT);
3406 __ load(counter, result);
3407 __ add(result, LIR_OprFact::intConst(InvocationCounter::count_increment), result);
3408 __ store(result, counter);
3409 if (notify) {
3410 LIR_Opr mask = load_immediate(frequency << InvocationCounter::count_shift, T_INT);
3411 LIR_Opr meth = new_register(T_METADATA);
3412 __ metadata2reg(method->constant_encoding(), meth);
3413 __ logical_and(result, mask, result);
3414 __ cmp(lir_cond_equal, result, LIR_OprFact::intConst(0));
3415 // The bci for info can point to cmp for if's we want the if bci
3416 CodeStub* overflow = new CounterOverflowStub(info, bci, meth);
3417 __ branch(lir_cond_equal, T_INT, overflow);
3418 __ branch_destination(overflow->continuation());
3419 }
3420 }
3421
3422 void LIRGenerator::do_RuntimeCall(RuntimeCall* x) {
3423 LIR_OprList* args = new LIR_OprList(x->number_of_arguments());
3424 BasicTypeList* signature = new BasicTypeList(x->number_of_arguments());
3425
3426 if (x->pass_thread()) {
3427 signature->append(LP64_ONLY(T_LONG) NOT_LP64(T_INT)); // thread
3428 args->append(getThreadPointer());
3429 }
3430
3431 for (int i = 0; i < x->number_of_arguments(); i++) {
3432 Value a = x->argument_at(i);
3433 LIRItem* item = new LIRItem(a, this);
3434 item->load_item();
3435 args->append(item->result());
3436 signature->append(as_BasicType(a->type()));
3437 }
3438
3439 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL);
3440 if (x->type() == voidType) {
3441 set_no_result(x);
3442 } else {
3443 __ move(result, rlock_result(x));
3444 }
3445 }
3446
3447 #ifdef ASSERT
3448 void LIRGenerator::do_Assert(Assert *x) {
3449 ValueTag tag = x->x()->type()->tag();
3450 If::Condition cond = x->cond();
3451
3452 LIRItem xitem(x->x(), this);
3453 LIRItem yitem(x->y(), this);
3454 LIRItem* xin = &xitem;
3455 LIRItem* yin = &yitem;
3456
3457 assert(tag == intTag, "Only integer assertions are valid!");
3458
3459 xin->load_item();
3460 yin->dont_load_item();
3461
3462 set_no_result(x);
3463
3464 LIR_Opr left = xin->result();
3465 LIR_Opr right = yin->result();
3466
3467 __ lir_assert(lir_cond(x->cond()), left, right, x->message(), true);
3468 }
3469 #endif
3470
3471 void LIRGenerator::do_RangeCheckPredicate(RangeCheckPredicate *x) {
3472
3473
3474 Instruction *a = x->x();
3475 Instruction *b = x->y();
3476 if (!a || StressRangeCheckElimination) {
3477 assert(!b || StressRangeCheckElimination, "B must also be null");
3478
3479 CodeEmitInfo *info = state_for(x, x->state());
3480 CodeStub* stub = new PredicateFailedStub(info);
3481
3482 __ jump(stub);
3483 } else if (a->type()->as_IntConstant() && b->type()->as_IntConstant()) {
3484 int a_int = a->type()->as_IntConstant()->value();
3485 int b_int = b->type()->as_IntConstant()->value();
3486
3487 bool ok = false;
3488
3489 switch(x->cond()) {
3490 case Instruction::eql: ok = (a_int == b_int); break;
3491 case Instruction::neq: ok = (a_int != b_int); break;
3492 case Instruction::lss: ok = (a_int < b_int); break;
3493 case Instruction::leq: ok = (a_int <= b_int); break;
3494 case Instruction::gtr: ok = (a_int > b_int); break;
3495 case Instruction::geq: ok = (a_int >= b_int); break;
3496 case Instruction::aeq: ok = ((unsigned int)a_int >= (unsigned int)b_int); break;
3497 case Instruction::beq: ok = ((unsigned int)a_int <= (unsigned int)b_int); break;
3498 default: ShouldNotReachHere();
3499 }
3500
3501 if (ok) {
3502
3503 CodeEmitInfo *info = state_for(x, x->state());
3504 CodeStub* stub = new PredicateFailedStub(info);
3505
3506 __ jump(stub);
3507 }
3508 } else {
3509
3510 ValueTag tag = x->x()->type()->tag();
3511 If::Condition cond = x->cond();
3512 LIRItem xitem(x->x(), this);
3513 LIRItem yitem(x->y(), this);
3514 LIRItem* xin = &xitem;
3515 LIRItem* yin = &yitem;
3516
3517 assert(tag == intTag, "Only integer deoptimizations are valid!");
3518
3519 xin->load_item();
3520 yin->dont_load_item();
3521 set_no_result(x);
3522
3523 LIR_Opr left = xin->result();
3524 LIR_Opr right = yin->result();
3525
3526 CodeEmitInfo *info = state_for(x, x->state());
3527 CodeStub* stub = new PredicateFailedStub(info);
3528
3529 __ cmp(lir_cond(cond), left, right);
3530 __ branch(lir_cond(cond), right->type(), stub);
3531 }
3532 }
3533
3534
3535 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) {
3536 LIRItemList args(1);
3537 LIRItem value(arg1, this);
3538 args.append(&value);
3539 BasicTypeList signature;
3540 signature.append(as_BasicType(arg1->type()));
3541
3542 return call_runtime(&signature, &args, entry, result_type, info);
3543 }
3544
3545
3546 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) {
3547 LIRItemList args(2);
3548 LIRItem value1(arg1, this);
3549 LIRItem value2(arg2, this);
3550 args.append(&value1);
3551 args.append(&value2);
3552 BasicTypeList signature;
3553 signature.append(as_BasicType(arg1->type()));
3554 signature.append(as_BasicType(arg2->type()));
3555
3556 return call_runtime(&signature, &args, entry, result_type, info);
3557 }
3558
3559
3560 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIR_OprList* args,
3561 address entry, ValueType* result_type, CodeEmitInfo* info) {
3562 // get a result register
3563 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3564 LIR_Opr result = LIR_OprFact::illegalOpr;
3565 if (result_type->tag() != voidTag) {
3566 result = new_register(result_type);
3567 phys_reg = result_register_for(result_type);
3568 }
3569
3570 // move the arguments into the correct location
3571 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3572 assert(cc->length() == args->length(), "argument mismatch");
3573 for (int i = 0; i < args->length(); i++) {
3574 LIR_Opr arg = args->at(i);
3575 LIR_Opr loc = cc->at(i);
3576 if (loc->is_register()) {
3577 __ move(arg, loc);
3578 } else {
3579 LIR_Address* addr = loc->as_address_ptr();
3580 // if (!can_store_as_constant(arg)) {
3581 // LIR_Opr tmp = new_register(arg->type());
3582 // __ move(arg, tmp);
3583 // arg = tmp;
3584 // }
3585 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3586 __ unaligned_move(arg, addr);
3587 } else {
3588 __ move(arg, addr);
3589 }
3590 }
3591 }
3592
3593 if (info) {
3594 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3595 } else {
3596 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3597 }
3598 if (result->is_valid()) {
3599 __ move(phys_reg, result);
3600 }
3601 return result;
3602 }
3603
3604
3605 LIR_Opr LIRGenerator::call_runtime(BasicTypeArray* signature, LIRItemList* args,
3606 address entry, ValueType* result_type, CodeEmitInfo* info) {
3607 // get a result register
3608 LIR_Opr phys_reg = LIR_OprFact::illegalOpr;
3609 LIR_Opr result = LIR_OprFact::illegalOpr;
3610 if (result_type->tag() != voidTag) {
3611 result = new_register(result_type);
3612 phys_reg = result_register_for(result_type);
3613 }
3614
3615 // move the arguments into the correct location
3616 CallingConvention* cc = frame_map()->c_calling_convention(signature);
3617
3618 assert(cc->length() == args->length(), "argument mismatch");
3619 for (int i = 0; i < args->length(); i++) {
3620 LIRItem* arg = args->at(i);
3621 LIR_Opr loc = cc->at(i);
3622 if (loc->is_register()) {
3623 arg->load_item_force(loc);
3624 } else {
3625 LIR_Address* addr = loc->as_address_ptr();
3626 arg->load_for_store(addr->type());
3627 if (addr->type() == T_LONG || addr->type() == T_DOUBLE) {
3628 __ unaligned_move(arg->result(), addr);
3629 } else {
3630 __ move(arg->result(), addr);
3631 }
3632 }
3633 }
3634
3635 if (info) {
3636 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info);
3637 } else {
3638 __ call_runtime_leaf(entry, getThreadTemp(), phys_reg, cc->args());
3639 }
3640 if (result->is_valid()) {
3641 __ move(phys_reg, result);
3642 }
3643 return result;
3644 }
3645
3646 void LIRGenerator::do_MemBar(MemBar* x) {
3647 if (os::is_MP()) {
3648 LIR_Code code = x->code();
3649 switch(code) {
3650 case lir_membar_acquire : __ membar_acquire(); break;
3651 case lir_membar_release : __ membar_release(); break;
3652 case lir_membar : __ membar(); break;
3653 case lir_membar_loadload : __ membar_loadload(); break;
3654 case lir_membar_storestore: __ membar_storestore(); break;
3655 case lir_membar_loadstore : __ membar_loadstore(); break;
3656 case lir_membar_storeload : __ membar_storeload(); break;
3657 default : ShouldNotReachHere(); break;
3658 }
3659 }
3660 }