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