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