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