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