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