Mercurial > hg > truffle
annotate src/share/vm/c1/c1_LIR.cpp @ 1359:23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
Summary: Make sure that two marking cycles do not overlap, i.e., a new one can only start after the concurrent marking thread finishes all its work. In the fix I piggy-back a couple of minor extra fixes: some general code reformatting for consistency (only around the code I modified), the removal of a field (G1CollectorPolicy::_should_initiate_conc_mark) which doesn't seem to be used at all (it's only set but never read), as well as moving the "is GC locker active" test earlier into the G1 pause / Full GC and using a more appropriate method for it.
Reviewed-by: johnc, jmasa, jcoomes, ysr
author | tonyp |
---|---|
date | Tue, 06 Apr 2010 10:59:45 -0400 |
parents | fc2c71045ada |
children | 9f5b60a14736 |
rev | line source |
---|---|
0 | 1 /* |
1295 | 2 * Copyright 2000-2010 Sun Microsystems, Inc. All Rights Reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 # include "incls/_precompiled.incl" | |
26 # include "incls/_c1_LIR.cpp.incl" | |
27 | |
28 Register LIR_OprDesc::as_register() const { | |
29 return FrameMap::cpu_rnr2reg(cpu_regnr()); | |
30 } | |
31 | |
32 Register LIR_OprDesc::as_register_lo() const { | |
33 return FrameMap::cpu_rnr2reg(cpu_regnrLo()); | |
34 } | |
35 | |
36 Register LIR_OprDesc::as_register_hi() const { | |
37 return FrameMap::cpu_rnr2reg(cpu_regnrHi()); | |
38 } | |
39 | |
304 | 40 #if defined(X86) |
0 | 41 |
42 XMMRegister LIR_OprDesc::as_xmm_float_reg() const { | |
43 return FrameMap::nr2xmmreg(xmm_regnr()); | |
44 } | |
45 | |
46 XMMRegister LIR_OprDesc::as_xmm_double_reg() const { | |
47 assert(xmm_regnrLo() == xmm_regnrHi(), "assumed in calculation"); | |
48 return FrameMap::nr2xmmreg(xmm_regnrLo()); | |
49 } | |
50 | |
304 | 51 #endif // X86 |
0 | 52 |
53 | |
54 #ifdef SPARC | |
55 | |
56 FloatRegister LIR_OprDesc::as_float_reg() const { | |
57 return FrameMap::nr2floatreg(fpu_regnr()); | |
58 } | |
59 | |
60 FloatRegister LIR_OprDesc::as_double_reg() const { | |
61 return FrameMap::nr2floatreg(fpu_regnrHi()); | |
62 } | |
63 | |
64 #endif | |
65 | |
66 LIR_Opr LIR_OprFact::illegalOpr = LIR_OprFact::illegal(); | |
67 | |
68 LIR_Opr LIR_OprFact::value_type(ValueType* type) { | |
69 ValueTag tag = type->tag(); | |
70 switch (tag) { | |
71 case objectTag : { | |
72 ClassConstant* c = type->as_ClassConstant(); | |
73 if (c != NULL && !c->value()->is_loaded()) { | |
74 return LIR_OprFact::oopConst(NULL); | |
75 } else { | |
76 return LIR_OprFact::oopConst(type->as_ObjectType()->encoding()); | |
77 } | |
78 } | |
1297
c466efa608d5
6932496: c1: deoptimization of jsr subroutine fails on sparcv9
roland
parents:
1295
diff
changeset
|
79 case addressTag: return LIR_OprFact::addressConst(type->as_AddressConstant()->value()); |
0 | 80 case intTag : return LIR_OprFact::intConst(type->as_IntConstant()->value()); |
81 case floatTag : return LIR_OprFact::floatConst(type->as_FloatConstant()->value()); | |
82 case longTag : return LIR_OprFact::longConst(type->as_LongConstant()->value()); | |
83 case doubleTag : return LIR_OprFact::doubleConst(type->as_DoubleConstant()->value()); | |
304 | 84 default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1); |
0 | 85 } |
86 } | |
87 | |
88 | |
89 LIR_Opr LIR_OprFact::dummy_value_type(ValueType* type) { | |
90 switch (type->tag()) { | |
91 case objectTag: return LIR_OprFact::oopConst(NULL); | |
1297
c466efa608d5
6932496: c1: deoptimization of jsr subroutine fails on sparcv9
roland
parents:
1295
diff
changeset
|
92 case addressTag:return LIR_OprFact::addressConst(0); |
0 | 93 case intTag: return LIR_OprFact::intConst(0); |
94 case floatTag: return LIR_OprFact::floatConst(0.0); | |
95 case longTag: return LIR_OprFact::longConst(0); | |
96 case doubleTag: return LIR_OprFact::doubleConst(0.0); | |
304 | 97 default: ShouldNotReachHere(); return LIR_OprFact::intConst(-1); |
0 | 98 } |
99 return illegalOpr; | |
100 } | |
101 | |
102 | |
103 | |
104 //--------------------------------------------------- | |
105 | |
106 | |
107 LIR_Address::Scale LIR_Address::scale(BasicType type) { | |
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
0
diff
changeset
|
108 int elem_size = type2aelembytes(type); |
0 | 109 switch (elem_size) { |
110 case 1: return LIR_Address::times_1; | |
111 case 2: return LIR_Address::times_2; | |
112 case 4: return LIR_Address::times_4; | |
113 case 8: return LIR_Address::times_8; | |
114 } | |
115 ShouldNotReachHere(); | |
116 return LIR_Address::times_1; | |
117 } | |
118 | |
119 | |
120 #ifndef PRODUCT | |
121 void LIR_Address::verify() const { | |
122 #ifdef SPARC | |
123 assert(scale() == times_1, "Scaled addressing mode not available on SPARC and should not be used"); | |
124 assert(disp() == 0 || index()->is_illegal(), "can't have both"); | |
125 #endif | |
126 #ifdef _LP64 | |
127 assert(base()->is_cpu_register(), "wrong base operand"); | |
128 assert(index()->is_illegal() || index()->is_double_cpu(), "wrong index operand"); | |
129 assert(base()->type() == T_OBJECT || base()->type() == T_LONG, | |
130 "wrong type for addresses"); | |
131 #else | |
132 assert(base()->is_single_cpu(), "wrong base operand"); | |
133 assert(index()->is_illegal() || index()->is_single_cpu(), "wrong index operand"); | |
134 assert(base()->type() == T_OBJECT || base()->type() == T_INT, | |
135 "wrong type for addresses"); | |
136 #endif | |
137 } | |
138 #endif | |
139 | |
140 | |
141 //--------------------------------------------------- | |
142 | |
143 char LIR_OprDesc::type_char(BasicType t) { | |
144 switch (t) { | |
145 case T_ARRAY: | |
146 t = T_OBJECT; | |
147 case T_BOOLEAN: | |
148 case T_CHAR: | |
149 case T_FLOAT: | |
150 case T_DOUBLE: | |
151 case T_BYTE: | |
152 case T_SHORT: | |
153 case T_INT: | |
154 case T_LONG: | |
155 case T_OBJECT: | |
156 case T_ADDRESS: | |
157 case T_VOID: | |
158 return ::type2char(t); | |
159 | |
160 case T_ILLEGAL: | |
161 return '?'; | |
162 | |
163 default: | |
164 ShouldNotReachHere(); | |
304 | 165 return '?'; |
0 | 166 } |
167 } | |
168 | |
169 #ifndef PRODUCT | |
170 void LIR_OprDesc::validate_type() const { | |
171 | |
172 #ifdef ASSERT | |
173 if (!is_pointer() && !is_illegal()) { | |
174 switch (as_BasicType(type_field())) { | |
175 case T_LONG: | |
176 assert((kind_field() == cpu_register || kind_field() == stack_value) && size_field() == double_size, "must match"); | |
177 break; | |
178 case T_FLOAT: | |
179 assert((kind_field() == fpu_register || kind_field() == stack_value) && size_field() == single_size, "must match"); | |
180 break; | |
181 case T_DOUBLE: | |
182 assert((kind_field() == fpu_register || kind_field() == stack_value) && size_field() == double_size, "must match"); | |
183 break; | |
184 case T_BOOLEAN: | |
185 case T_CHAR: | |
186 case T_BYTE: | |
187 case T_SHORT: | |
188 case T_INT: | |
189 case T_OBJECT: | |
190 case T_ARRAY: | |
191 assert((kind_field() == cpu_register || kind_field() == stack_value) && size_field() == single_size, "must match"); | |
192 break; | |
193 | |
194 case T_ILLEGAL: | |
195 // XXX TKR also means unknown right now | |
196 // assert(is_illegal(), "must match"); | |
197 break; | |
198 | |
199 default: | |
200 ShouldNotReachHere(); | |
201 } | |
202 } | |
203 #endif | |
204 | |
205 } | |
206 #endif // PRODUCT | |
207 | |
208 | |
209 bool LIR_OprDesc::is_oop() const { | |
210 if (is_pointer()) { | |
211 return pointer()->is_oop_pointer(); | |
212 } else { | |
213 OprType t= type_field(); | |
214 assert(t != unknown_type, "not set"); | |
215 return t == object_type; | |
216 } | |
217 } | |
218 | |
219 | |
220 | |
221 void LIR_Op2::verify() const { | |
222 #ifdef ASSERT | |
223 switch (code()) { | |
224 case lir_cmove: | |
225 break; | |
226 | |
227 default: | |
228 assert(!result_opr()->is_register() || !result_opr()->is_oop_register(), | |
229 "can't produce oops from arith"); | |
230 } | |
231 | |
232 if (TwoOperandLIRForm) { | |
233 switch (code()) { | |
234 case lir_add: | |
235 case lir_sub: | |
236 case lir_mul: | |
237 case lir_mul_strictfp: | |
238 case lir_div: | |
239 case lir_div_strictfp: | |
240 case lir_rem: | |
241 case lir_logic_and: | |
242 case lir_logic_or: | |
243 case lir_logic_xor: | |
244 case lir_shl: | |
245 case lir_shr: | |
246 assert(in_opr1() == result_opr(), "opr1 and result must match"); | |
247 assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid"); | |
248 break; | |
249 | |
250 // special handling for lir_ushr because of write barriers | |
251 case lir_ushr: | |
252 assert(in_opr1() == result_opr() || in_opr2()->is_constant(), "opr1 and result must match or shift count is constant"); | |
253 assert(in_opr1()->is_valid() && in_opr2()->is_valid(), "must be valid"); | |
254 break; | |
255 | |
256 } | |
257 } | |
258 #endif | |
259 } | |
260 | |
261 | |
262 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block) | |
263 : LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL) | |
264 , _cond(cond) | |
265 , _type(type) | |
266 , _label(block->label()) | |
267 , _block(block) | |
268 , _ublock(NULL) | |
269 , _stub(NULL) { | |
270 } | |
271 | |
272 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, CodeStub* stub) : | |
273 LIR_Op(lir_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL) | |
274 , _cond(cond) | |
275 , _type(type) | |
276 , _label(stub->entry()) | |
277 , _block(NULL) | |
278 , _ublock(NULL) | |
279 , _stub(stub) { | |
280 } | |
281 | |
282 LIR_OpBranch::LIR_OpBranch(LIR_Condition cond, BasicType type, BlockBegin* block, BlockBegin* ublock) | |
283 : LIR_Op(lir_cond_float_branch, LIR_OprFact::illegalOpr, (CodeEmitInfo*)NULL) | |
284 , _cond(cond) | |
285 , _type(type) | |
286 , _label(block->label()) | |
287 , _block(block) | |
288 , _ublock(ublock) | |
289 , _stub(NULL) | |
290 { | |
291 } | |
292 | |
293 void LIR_OpBranch::change_block(BlockBegin* b) { | |
294 assert(_block != NULL, "must have old block"); | |
295 assert(_block->label() == label(), "must be equal"); | |
296 | |
297 _block = b; | |
298 _label = b->label(); | |
299 } | |
300 | |
301 void LIR_OpBranch::change_ublock(BlockBegin* b) { | |
302 assert(_ublock != NULL, "must have old block"); | |
303 _ublock = b; | |
304 } | |
305 | |
306 void LIR_OpBranch::negate_cond() { | |
307 switch (_cond) { | |
308 case lir_cond_equal: _cond = lir_cond_notEqual; break; | |
309 case lir_cond_notEqual: _cond = lir_cond_equal; break; | |
310 case lir_cond_less: _cond = lir_cond_greaterEqual; break; | |
311 case lir_cond_lessEqual: _cond = lir_cond_greater; break; | |
312 case lir_cond_greaterEqual: _cond = lir_cond_less; break; | |
313 case lir_cond_greater: _cond = lir_cond_lessEqual; break; | |
314 default: ShouldNotReachHere(); | |
315 } | |
316 } | |
317 | |
318 | |
319 LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr result, LIR_Opr object, ciKlass* klass, | |
320 LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, | |
321 bool fast_check, CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch, | |
322 CodeStub* stub, | |
323 ciMethod* profiled_method, | |
324 int profiled_bci) | |
325 : LIR_Op(code, result, NULL) | |
326 , _object(object) | |
327 , _array(LIR_OprFact::illegalOpr) | |
328 , _klass(klass) | |
329 , _tmp1(tmp1) | |
330 , _tmp2(tmp2) | |
331 , _tmp3(tmp3) | |
332 , _fast_check(fast_check) | |
333 , _stub(stub) | |
334 , _info_for_patch(info_for_patch) | |
335 , _info_for_exception(info_for_exception) | |
336 , _profiled_method(profiled_method) | |
337 , _profiled_bci(profiled_bci) { | |
338 if (code == lir_checkcast) { | |
339 assert(info_for_exception != NULL, "checkcast throws exceptions"); | |
340 } else if (code == lir_instanceof) { | |
341 assert(info_for_exception == NULL, "instanceof throws no exceptions"); | |
342 } else { | |
343 ShouldNotReachHere(); | |
344 } | |
345 } | |
346 | |
347 | |
348 | |
349 LIR_OpTypeCheck::LIR_OpTypeCheck(LIR_Code code, LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, CodeEmitInfo* info_for_exception, ciMethod* profiled_method, int profiled_bci) | |
350 : LIR_Op(code, LIR_OprFact::illegalOpr, NULL) | |
351 , _object(object) | |
352 , _array(array) | |
353 , _klass(NULL) | |
354 , _tmp1(tmp1) | |
355 , _tmp2(tmp2) | |
356 , _tmp3(tmp3) | |
357 , _fast_check(false) | |
358 , _stub(NULL) | |
359 , _info_for_patch(NULL) | |
360 , _info_for_exception(info_for_exception) | |
361 , _profiled_method(profiled_method) | |
362 , _profiled_bci(profiled_bci) { | |
363 if (code == lir_store_check) { | |
364 _stub = new ArrayStoreExceptionStub(info_for_exception); | |
365 assert(info_for_exception != NULL, "store_check throws exceptions"); | |
366 } else { | |
367 ShouldNotReachHere(); | |
368 } | |
369 } | |
370 | |
371 | |
372 LIR_OpArrayCopy::LIR_OpArrayCopy(LIR_Opr src, LIR_Opr src_pos, LIR_Opr dst, LIR_Opr dst_pos, LIR_Opr length, | |
373 LIR_Opr tmp, ciArrayKlass* expected_type, int flags, CodeEmitInfo* info) | |
374 : LIR_Op(lir_arraycopy, LIR_OprFact::illegalOpr, info) | |
375 , _tmp(tmp) | |
376 , _src(src) | |
377 , _src_pos(src_pos) | |
378 , _dst(dst) | |
379 , _dst_pos(dst_pos) | |
380 , _flags(flags) | |
381 , _expected_type(expected_type) | |
382 , _length(length) { | |
383 _stub = new ArrayCopyStub(this); | |
384 } | |
385 | |
386 | |
387 //-------------------verify-------------------------- | |
388 | |
389 void LIR_Op1::verify() const { | |
390 switch(code()) { | |
391 case lir_move: | |
392 assert(in_opr()->is_valid() && result_opr()->is_valid(), "must be"); | |
393 break; | |
394 case lir_null_check: | |
395 assert(in_opr()->is_register(), "must be"); | |
396 break; | |
397 case lir_return: | |
398 assert(in_opr()->is_register() || in_opr()->is_illegal(), "must be"); | |
399 break; | |
400 } | |
401 } | |
402 | |
403 void LIR_OpRTCall::verify() const { | |
404 assert(strcmp(Runtime1::name_for_address(addr()), "<unknown function>") != 0, "unknown function"); | |
405 } | |
406 | |
407 //-------------------visits-------------------------- | |
408 | |
409 // complete rework of LIR instruction visitor. | |
410 // The virtual calls for each instruction type is replaced by a big | |
411 // switch that adds the operands for each instruction | |
412 | |
413 void LIR_OpVisitState::visit(LIR_Op* op) { | |
414 // copy information from the LIR_Op | |
415 reset(); | |
416 set_op(op); | |
417 | |
418 switch (op->code()) { | |
419 | |
420 // LIR_Op0 | |
421 case lir_word_align: // result and info always invalid | |
422 case lir_backwardbranch_target: // result and info always invalid | |
423 case lir_build_frame: // result and info always invalid | |
424 case lir_fpop_raw: // result and info always invalid | |
425 case lir_24bit_FPU: // result and info always invalid | |
426 case lir_reset_FPU: // result and info always invalid | |
427 case lir_breakpoint: // result and info always invalid | |
428 case lir_membar: // result and info always invalid | |
429 case lir_membar_acquire: // result and info always invalid | |
430 case lir_membar_release: // result and info always invalid | |
431 { | |
432 assert(op->as_Op0() != NULL, "must be"); | |
433 assert(op->_info == NULL, "info not used by this instruction"); | |
434 assert(op->_result->is_illegal(), "not used"); | |
435 break; | |
436 } | |
437 | |
438 case lir_nop: // may have info, result always invalid | |
439 case lir_std_entry: // may have result, info always invalid | |
440 case lir_osr_entry: // may have result, info always invalid | |
441 case lir_get_thread: // may have result, info always invalid | |
442 { | |
443 assert(op->as_Op0() != NULL, "must be"); | |
444 if (op->_info != NULL) do_info(op->_info); | |
445 if (op->_result->is_valid()) do_output(op->_result); | |
446 break; | |
447 } | |
448 | |
449 | |
450 // LIR_OpLabel | |
451 case lir_label: // result and info always invalid | |
452 { | |
453 assert(op->as_OpLabel() != NULL, "must be"); | |
454 assert(op->_info == NULL, "info not used by this instruction"); | |
455 assert(op->_result->is_illegal(), "not used"); | |
456 break; | |
457 } | |
458 | |
459 | |
460 // LIR_Op1 | |
461 case lir_fxch: // input always valid, result and info always invalid | |
462 case lir_fld: // input always valid, result and info always invalid | |
463 case lir_ffree: // input always valid, result and info always invalid | |
464 case lir_push: // input always valid, result and info always invalid | |
465 case lir_pop: // input always valid, result and info always invalid | |
466 case lir_return: // input always valid, result and info always invalid | |
467 case lir_leal: // input and result always valid, info always invalid | |
468 case lir_neg: // input and result always valid, info always invalid | |
469 case lir_monaddr: // input and result always valid, info always invalid | |
470 case lir_null_check: // input and info always valid, result always invalid | |
471 case lir_move: // input and result always valid, may have info | |
472 case lir_prefetchr: // input always valid, result and info always invalid | |
473 case lir_prefetchw: // input always valid, result and info always invalid | |
474 { | |
475 assert(op->as_Op1() != NULL, "must be"); | |
476 LIR_Op1* op1 = (LIR_Op1*)op; | |
477 | |
478 if (op1->_info) do_info(op1->_info); | |
479 if (op1->_opr->is_valid()) do_input(op1->_opr); | |
480 if (op1->_result->is_valid()) do_output(op1->_result); | |
481 | |
482 break; | |
483 } | |
484 | |
485 case lir_safepoint: | |
486 { | |
487 assert(op->as_Op1() != NULL, "must be"); | |
488 LIR_Op1* op1 = (LIR_Op1*)op; | |
489 | |
490 assert(op1->_info != NULL, ""); do_info(op1->_info); | |
491 if (op1->_opr->is_valid()) do_temp(op1->_opr); // safepoints on SPARC need temporary register | |
492 assert(op1->_result->is_illegal(), "safepoint does not produce value"); | |
493 | |
494 break; | |
495 } | |
496 | |
497 // LIR_OpConvert; | |
498 case lir_convert: // input and result always valid, info always invalid | |
499 { | |
500 assert(op->as_OpConvert() != NULL, "must be"); | |
501 LIR_OpConvert* opConvert = (LIR_OpConvert*)op; | |
502 | |
503 assert(opConvert->_info == NULL, "must be"); | |
504 if (opConvert->_opr->is_valid()) do_input(opConvert->_opr); | |
505 if (opConvert->_result->is_valid()) do_output(opConvert->_result); | |
506 do_stub(opConvert->_stub); | |
507 | |
508 break; | |
509 } | |
510 | |
511 // LIR_OpBranch; | |
512 case lir_branch: // may have info, input and result register always invalid | |
513 case lir_cond_float_branch: // may have info, input and result register always invalid | |
514 { | |
515 assert(op->as_OpBranch() != NULL, "must be"); | |
516 LIR_OpBranch* opBranch = (LIR_OpBranch*)op; | |
517 | |
518 if (opBranch->_info != NULL) do_info(opBranch->_info); | |
519 assert(opBranch->_result->is_illegal(), "not used"); | |
520 if (opBranch->_stub != NULL) opBranch->stub()->visit(this); | |
521 | |
522 break; | |
523 } | |
524 | |
525 | |
526 // LIR_OpAllocObj | |
527 case lir_alloc_object: | |
528 { | |
529 assert(op->as_OpAllocObj() != NULL, "must be"); | |
530 LIR_OpAllocObj* opAllocObj = (LIR_OpAllocObj*)op; | |
531 | |
532 if (opAllocObj->_info) do_info(opAllocObj->_info); | |
533 if (opAllocObj->_opr->is_valid()) do_input(opAllocObj->_opr); | |
534 if (opAllocObj->_tmp1->is_valid()) do_temp(opAllocObj->_tmp1); | |
535 if (opAllocObj->_tmp2->is_valid()) do_temp(opAllocObj->_tmp2); | |
536 if (opAllocObj->_tmp3->is_valid()) do_temp(opAllocObj->_tmp3); | |
537 if (opAllocObj->_tmp4->is_valid()) do_temp(opAllocObj->_tmp4); | |
538 if (opAllocObj->_result->is_valid()) do_output(opAllocObj->_result); | |
539 do_stub(opAllocObj->_stub); | |
540 break; | |
541 } | |
542 | |
543 | |
544 // LIR_OpRoundFP; | |
545 case lir_roundfp: { | |
546 assert(op->as_OpRoundFP() != NULL, "must be"); | |
547 LIR_OpRoundFP* opRoundFP = (LIR_OpRoundFP*)op; | |
548 | |
549 assert(op->_info == NULL, "info not used by this instruction"); | |
550 assert(opRoundFP->_tmp->is_illegal(), "not used"); | |
551 do_input(opRoundFP->_opr); | |
552 do_output(opRoundFP->_result); | |
553 | |
554 break; | |
555 } | |
556 | |
557 | |
558 // LIR_Op2 | |
559 case lir_cmp: | |
560 case lir_cmp_l2i: | |
561 case lir_ucmp_fd2i: | |
562 case lir_cmp_fd2i: | |
563 case lir_add: | |
564 case lir_sub: | |
565 case lir_mul: | |
566 case lir_div: | |
567 case lir_rem: | |
568 case lir_sqrt: | |
569 case lir_abs: | |
570 case lir_logic_and: | |
571 case lir_logic_or: | |
572 case lir_logic_xor: | |
573 case lir_shl: | |
574 case lir_shr: | |
575 case lir_ushr: | |
576 { | |
577 assert(op->as_Op2() != NULL, "must be"); | |
578 LIR_Op2* op2 = (LIR_Op2*)op; | |
579 | |
580 if (op2->_info) do_info(op2->_info); | |
581 if (op2->_opr1->is_valid()) do_input(op2->_opr1); | |
582 if (op2->_opr2->is_valid()) do_input(op2->_opr2); | |
583 if (op2->_tmp->is_valid()) do_temp(op2->_tmp); | |
584 if (op2->_result->is_valid()) do_output(op2->_result); | |
585 | |
586 break; | |
587 } | |
588 | |
589 // special handling for cmove: right input operand must not be equal | |
590 // to the result operand, otherwise the backend fails | |
591 case lir_cmove: | |
592 { | |
593 assert(op->as_Op2() != NULL, "must be"); | |
594 LIR_Op2* op2 = (LIR_Op2*)op; | |
595 | |
596 assert(op2->_info == NULL && op2->_tmp->is_illegal(), "not used"); | |
597 assert(op2->_opr1->is_valid() && op2->_opr2->is_valid() && op2->_result->is_valid(), "used"); | |
598 | |
599 do_input(op2->_opr1); | |
600 do_input(op2->_opr2); | |
601 do_temp(op2->_opr2); | |
602 do_output(op2->_result); | |
603 | |
604 break; | |
605 } | |
606 | |
607 // vspecial handling for strict operations: register input operands | |
608 // as temp to guarantee that they do not overlap with other | |
609 // registers | |
610 case lir_mul_strictfp: | |
611 case lir_div_strictfp: | |
612 { | |
613 assert(op->as_Op2() != NULL, "must be"); | |
614 LIR_Op2* op2 = (LIR_Op2*)op; | |
615 | |
616 assert(op2->_info == NULL, "not used"); | |
617 assert(op2->_opr1->is_valid(), "used"); | |
618 assert(op2->_opr2->is_valid(), "used"); | |
619 assert(op2->_result->is_valid(), "used"); | |
620 | |
621 do_input(op2->_opr1); do_temp(op2->_opr1); | |
622 do_input(op2->_opr2); do_temp(op2->_opr2); | |
623 if (op2->_tmp->is_valid()) do_temp(op2->_tmp); | |
624 do_output(op2->_result); | |
625 | |
626 break; | |
627 } | |
628 | |
629 case lir_throw: | |
630 case lir_unwind: { | |
631 assert(op->as_Op2() != NULL, "must be"); | |
632 LIR_Op2* op2 = (LIR_Op2*)op; | |
633 | |
634 if (op2->_info) do_info(op2->_info); | |
635 if (op2->_opr1->is_valid()) do_temp(op2->_opr1); | |
636 if (op2->_opr2->is_valid()) do_input(op2->_opr2); // exception object is input parameter | |
637 assert(op2->_result->is_illegal(), "no result"); | |
638 | |
639 break; | |
640 } | |
641 | |
642 | |
643 case lir_tan: | |
644 case lir_sin: | |
953
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
645 case lir_cos: |
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
646 case lir_log: |
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
647 case lir_log10: { |
0 | 648 assert(op->as_Op2() != NULL, "must be"); |
649 LIR_Op2* op2 = (LIR_Op2*)op; | |
650 | |
953
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
651 // On x86 tan/sin/cos need two temporary fpu stack slots and |
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
652 // log/log10 need one so handle opr2 and tmp as temp inputs. |
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
653 // Register input operand as temp to guarantee that it doesn't |
ff1a29907b6c
6855215: Calculation error (NaN) after about 1500 calculations
never
parents:
304
diff
changeset
|
654 // overlap with the input. |
0 | 655 assert(op2->_info == NULL, "not used"); |
656 assert(op2->_opr1->is_valid(), "used"); | |
657 do_input(op2->_opr1); do_temp(op2->_opr1); | |
658 | |
659 if (op2->_opr2->is_valid()) do_temp(op2->_opr2); | |
660 if (op2->_tmp->is_valid()) do_temp(op2->_tmp); | |
661 if (op2->_result->is_valid()) do_output(op2->_result); | |
662 | |
663 break; | |
664 } | |
665 | |
666 | |
667 // LIR_Op3 | |
668 case lir_idiv: | |
669 case lir_irem: { | |
670 assert(op->as_Op3() != NULL, "must be"); | |
671 LIR_Op3* op3= (LIR_Op3*)op; | |
672 | |
673 if (op3->_info) do_info(op3->_info); | |
674 if (op3->_opr1->is_valid()) do_input(op3->_opr1); | |
675 | |
676 // second operand is input and temp, so ensure that second operand | |
677 // and third operand get not the same register | |
678 if (op3->_opr2->is_valid()) do_input(op3->_opr2); | |
679 if (op3->_opr2->is_valid()) do_temp(op3->_opr2); | |
680 if (op3->_opr3->is_valid()) do_temp(op3->_opr3); | |
681 | |
682 if (op3->_result->is_valid()) do_output(op3->_result); | |
683 | |
684 break; | |
685 } | |
686 | |
687 | |
688 // LIR_OpJavaCall | |
689 case lir_static_call: | |
690 case lir_optvirtual_call: | |
691 case lir_icvirtual_call: | |
1295 | 692 case lir_virtual_call: |
693 case lir_dynamic_call: { | |
694 LIR_OpJavaCall* opJavaCall = op->as_OpJavaCall(); | |
695 assert(opJavaCall != NULL, "must be"); | |
0 | 696 |
697 if (opJavaCall->_receiver->is_valid()) do_input(opJavaCall->_receiver); | |
698 | |
699 // only visit register parameters | |
700 int n = opJavaCall->_arguments->length(); | |
701 for (int i = 0; i < n; i++) { | |
702 if (!opJavaCall->_arguments->at(i)->is_pointer()) { | |
703 do_input(*opJavaCall->_arguments->adr_at(i)); | |
704 } | |
705 } | |
706 | |
707 if (opJavaCall->_info) do_info(opJavaCall->_info); | |
1301
fc2c71045ada
6934966: JSR 292 add C1 logic for saved SP over MethodHandle calls
twisti
parents:
1297
diff
changeset
|
708 if (opJavaCall->is_method_handle_invoke()) do_temp(FrameMap::method_handle_invoke_SP_save_opr()); |
0 | 709 do_call(); |
710 if (opJavaCall->_result->is_valid()) do_output(opJavaCall->_result); | |
711 | |
712 break; | |
713 } | |
714 | |
715 | |
716 // LIR_OpRTCall | |
717 case lir_rtcall: { | |
718 assert(op->as_OpRTCall() != NULL, "must be"); | |
719 LIR_OpRTCall* opRTCall = (LIR_OpRTCall*)op; | |
720 | |
721 // only visit register parameters | |
722 int n = opRTCall->_arguments->length(); | |
723 for (int i = 0; i < n; i++) { | |
724 if (!opRTCall->_arguments->at(i)->is_pointer()) { | |
725 do_input(*opRTCall->_arguments->adr_at(i)); | |
726 } | |
727 } | |
728 if (opRTCall->_info) do_info(opRTCall->_info); | |
729 if (opRTCall->_tmp->is_valid()) do_temp(opRTCall->_tmp); | |
730 do_call(); | |
731 if (opRTCall->_result->is_valid()) do_output(opRTCall->_result); | |
732 | |
733 break; | |
734 } | |
735 | |
736 | |
737 // LIR_OpArrayCopy | |
738 case lir_arraycopy: { | |
739 assert(op->as_OpArrayCopy() != NULL, "must be"); | |
740 LIR_OpArrayCopy* opArrayCopy = (LIR_OpArrayCopy*)op; | |
741 | |
742 assert(opArrayCopy->_result->is_illegal(), "unused"); | |
743 assert(opArrayCopy->_src->is_valid(), "used"); do_input(opArrayCopy->_src); do_temp(opArrayCopy->_src); | |
744 assert(opArrayCopy->_src_pos->is_valid(), "used"); do_input(opArrayCopy->_src_pos); do_temp(opArrayCopy->_src_pos); | |
745 assert(opArrayCopy->_dst->is_valid(), "used"); do_input(opArrayCopy->_dst); do_temp(opArrayCopy->_dst); | |
746 assert(opArrayCopy->_dst_pos->is_valid(), "used"); do_input(opArrayCopy->_dst_pos); do_temp(opArrayCopy->_dst_pos); | |
747 assert(opArrayCopy->_length->is_valid(), "used"); do_input(opArrayCopy->_length); do_temp(opArrayCopy->_length); | |
748 assert(opArrayCopy->_tmp->is_valid(), "used"); do_temp(opArrayCopy->_tmp); | |
749 if (opArrayCopy->_info) do_info(opArrayCopy->_info); | |
750 | |
751 // the implementation of arraycopy always has a call into the runtime | |
752 do_call(); | |
753 | |
754 break; | |
755 } | |
756 | |
757 | |
758 // LIR_OpLock | |
759 case lir_lock: | |
760 case lir_unlock: { | |
761 assert(op->as_OpLock() != NULL, "must be"); | |
762 LIR_OpLock* opLock = (LIR_OpLock*)op; | |
763 | |
764 if (opLock->_info) do_info(opLock->_info); | |
765 | |
766 // TODO: check if these operands really have to be temp | |
767 // (or if input is sufficient). This may have influence on the oop map! | |
768 assert(opLock->_lock->is_valid(), "used"); do_temp(opLock->_lock); | |
769 assert(opLock->_hdr->is_valid(), "used"); do_temp(opLock->_hdr); | |
770 assert(opLock->_obj->is_valid(), "used"); do_temp(opLock->_obj); | |
771 | |
772 if (opLock->_scratch->is_valid()) do_temp(opLock->_scratch); | |
773 assert(opLock->_result->is_illegal(), "unused"); | |
774 | |
775 do_stub(opLock->_stub); | |
776 | |
777 break; | |
778 } | |
779 | |
780 | |
781 // LIR_OpDelay | |
782 case lir_delay_slot: { | |
783 assert(op->as_OpDelay() != NULL, "must be"); | |
784 LIR_OpDelay* opDelay = (LIR_OpDelay*)op; | |
785 | |
786 visit(opDelay->delay_op()); | |
787 break; | |
788 } | |
789 | |
790 // LIR_OpTypeCheck | |
791 case lir_instanceof: | |
792 case lir_checkcast: | |
793 case lir_store_check: { | |
794 assert(op->as_OpTypeCheck() != NULL, "must be"); | |
795 LIR_OpTypeCheck* opTypeCheck = (LIR_OpTypeCheck*)op; | |
796 | |
797 if (opTypeCheck->_info_for_exception) do_info(opTypeCheck->_info_for_exception); | |
798 if (opTypeCheck->_info_for_patch) do_info(opTypeCheck->_info_for_patch); | |
799 if (opTypeCheck->_object->is_valid()) do_input(opTypeCheck->_object); | |
800 if (opTypeCheck->_array->is_valid()) do_input(opTypeCheck->_array); | |
801 if (opTypeCheck->_tmp1->is_valid()) do_temp(opTypeCheck->_tmp1); | |
802 if (opTypeCheck->_tmp2->is_valid()) do_temp(opTypeCheck->_tmp2); | |
803 if (opTypeCheck->_tmp3->is_valid()) do_temp(opTypeCheck->_tmp3); | |
804 if (opTypeCheck->_result->is_valid()) do_output(opTypeCheck->_result); | |
805 do_stub(opTypeCheck->_stub); | |
806 break; | |
807 } | |
808 | |
809 // LIR_OpCompareAndSwap | |
810 case lir_cas_long: | |
811 case lir_cas_obj: | |
812 case lir_cas_int: { | |
813 assert(op->as_OpCompareAndSwap() != NULL, "must be"); | |
814 LIR_OpCompareAndSwap* opCompareAndSwap = (LIR_OpCompareAndSwap*)op; | |
815 | |
816 if (opCompareAndSwap->_info) do_info(opCompareAndSwap->_info); | |
817 if (opCompareAndSwap->_addr->is_valid()) do_input(opCompareAndSwap->_addr); | |
818 if (opCompareAndSwap->_cmp_value->is_valid()) do_input(opCompareAndSwap->_cmp_value); | |
819 if (opCompareAndSwap->_new_value->is_valid()) do_input(opCompareAndSwap->_new_value); | |
820 if (opCompareAndSwap->_tmp1->is_valid()) do_temp(opCompareAndSwap->_tmp1); | |
821 if (opCompareAndSwap->_tmp2->is_valid()) do_temp(opCompareAndSwap->_tmp2); | |
822 if (opCompareAndSwap->_result->is_valid()) do_output(opCompareAndSwap->_result); | |
823 | |
824 break; | |
825 } | |
826 | |
827 | |
828 // LIR_OpAllocArray; | |
829 case lir_alloc_array: { | |
830 assert(op->as_OpAllocArray() != NULL, "must be"); | |
831 LIR_OpAllocArray* opAllocArray = (LIR_OpAllocArray*)op; | |
832 | |
833 if (opAllocArray->_info) do_info(opAllocArray->_info); | |
834 if (opAllocArray->_klass->is_valid()) do_input(opAllocArray->_klass); do_temp(opAllocArray->_klass); | |
835 if (opAllocArray->_len->is_valid()) do_input(opAllocArray->_len); do_temp(opAllocArray->_len); | |
836 if (opAllocArray->_tmp1->is_valid()) do_temp(opAllocArray->_tmp1); | |
837 if (opAllocArray->_tmp2->is_valid()) do_temp(opAllocArray->_tmp2); | |
838 if (opAllocArray->_tmp3->is_valid()) do_temp(opAllocArray->_tmp3); | |
839 if (opAllocArray->_tmp4->is_valid()) do_temp(opAllocArray->_tmp4); | |
840 if (opAllocArray->_result->is_valid()) do_output(opAllocArray->_result); | |
841 do_stub(opAllocArray->_stub); | |
842 break; | |
843 } | |
844 | |
845 // LIR_OpProfileCall: | |
846 case lir_profile_call: { | |
847 assert(op->as_OpProfileCall() != NULL, "must be"); | |
848 LIR_OpProfileCall* opProfileCall = (LIR_OpProfileCall*)op; | |
849 | |
850 if (opProfileCall->_recv->is_valid()) do_temp(opProfileCall->_recv); | |
851 assert(opProfileCall->_mdo->is_valid(), "used"); do_temp(opProfileCall->_mdo); | |
852 assert(opProfileCall->_tmp1->is_valid(), "used"); do_temp(opProfileCall->_tmp1); | |
853 break; | |
854 } | |
855 | |
856 default: | |
857 ShouldNotReachHere(); | |
858 } | |
859 } | |
860 | |
861 | |
862 void LIR_OpVisitState::do_stub(CodeStub* stub) { | |
863 if (stub != NULL) { | |
864 stub->visit(this); | |
865 } | |
866 } | |
867 | |
868 XHandlers* LIR_OpVisitState::all_xhandler() { | |
869 XHandlers* result = NULL; | |
870 | |
871 int i; | |
872 for (i = 0; i < info_count(); i++) { | |
873 if (info_at(i)->exception_handlers() != NULL) { | |
874 result = info_at(i)->exception_handlers(); | |
875 break; | |
876 } | |
877 } | |
878 | |
879 #ifdef ASSERT | |
880 for (i = 0; i < info_count(); i++) { | |
881 assert(info_at(i)->exception_handlers() == NULL || | |
882 info_at(i)->exception_handlers() == result, | |
883 "only one xhandler list allowed per LIR-operation"); | |
884 } | |
885 #endif | |
886 | |
887 if (result != NULL) { | |
888 return result; | |
889 } else { | |
890 return new XHandlers(); | |
891 } | |
892 | |
893 return result; | |
894 } | |
895 | |
896 | |
897 #ifdef ASSERT | |
898 bool LIR_OpVisitState::no_operands(LIR_Op* op) { | |
899 visit(op); | |
900 | |
901 return opr_count(inputMode) == 0 && | |
902 opr_count(outputMode) == 0 && | |
903 opr_count(tempMode) == 0 && | |
904 info_count() == 0 && | |
905 !has_call() && | |
906 !has_slow_case(); | |
907 } | |
908 #endif | |
909 | |
910 //--------------------------------------------------- | |
911 | |
912 | |
913 void LIR_OpJavaCall::emit_code(LIR_Assembler* masm) { | |
914 masm->emit_call(this); | |
915 } | |
916 | |
917 void LIR_OpRTCall::emit_code(LIR_Assembler* masm) { | |
918 masm->emit_rtcall(this); | |
919 } | |
920 | |
921 void LIR_OpLabel::emit_code(LIR_Assembler* masm) { | |
922 masm->emit_opLabel(this); | |
923 } | |
924 | |
925 void LIR_OpArrayCopy::emit_code(LIR_Assembler* masm) { | |
926 masm->emit_arraycopy(this); | |
927 masm->emit_code_stub(stub()); | |
928 } | |
929 | |
930 void LIR_Op0::emit_code(LIR_Assembler* masm) { | |
931 masm->emit_op0(this); | |
932 } | |
933 | |
934 void LIR_Op1::emit_code(LIR_Assembler* masm) { | |
935 masm->emit_op1(this); | |
936 } | |
937 | |
938 void LIR_OpAllocObj::emit_code(LIR_Assembler* masm) { | |
939 masm->emit_alloc_obj(this); | |
940 masm->emit_code_stub(stub()); | |
941 } | |
942 | |
943 void LIR_OpBranch::emit_code(LIR_Assembler* masm) { | |
944 masm->emit_opBranch(this); | |
945 if (stub()) { | |
946 masm->emit_code_stub(stub()); | |
947 } | |
948 } | |
949 | |
950 void LIR_OpConvert::emit_code(LIR_Assembler* masm) { | |
951 masm->emit_opConvert(this); | |
952 if (stub() != NULL) { | |
953 masm->emit_code_stub(stub()); | |
954 } | |
955 } | |
956 | |
957 void LIR_Op2::emit_code(LIR_Assembler* masm) { | |
958 masm->emit_op2(this); | |
959 } | |
960 | |
961 void LIR_OpAllocArray::emit_code(LIR_Assembler* masm) { | |
962 masm->emit_alloc_array(this); | |
963 masm->emit_code_stub(stub()); | |
964 } | |
965 | |
966 void LIR_OpTypeCheck::emit_code(LIR_Assembler* masm) { | |
967 masm->emit_opTypeCheck(this); | |
968 if (stub()) { | |
969 masm->emit_code_stub(stub()); | |
970 } | |
971 } | |
972 | |
973 void LIR_OpCompareAndSwap::emit_code(LIR_Assembler* masm) { | |
974 masm->emit_compare_and_swap(this); | |
975 } | |
976 | |
977 void LIR_Op3::emit_code(LIR_Assembler* masm) { | |
978 masm->emit_op3(this); | |
979 } | |
980 | |
981 void LIR_OpLock::emit_code(LIR_Assembler* masm) { | |
982 masm->emit_lock(this); | |
983 if (stub()) { | |
984 masm->emit_code_stub(stub()); | |
985 } | |
986 } | |
987 | |
988 | |
989 void LIR_OpDelay::emit_code(LIR_Assembler* masm) { | |
990 masm->emit_delay(this); | |
991 } | |
992 | |
993 | |
994 void LIR_OpProfileCall::emit_code(LIR_Assembler* masm) { | |
995 masm->emit_profile_call(this); | |
996 } | |
997 | |
998 | |
999 // LIR_List | |
1000 LIR_List::LIR_List(Compilation* compilation, BlockBegin* block) | |
1001 : _operations(8) | |
1002 , _compilation(compilation) | |
1003 #ifndef PRODUCT | |
1004 , _block(block) | |
1005 #endif | |
1006 #ifdef ASSERT | |
1007 , _file(NULL) | |
1008 , _line(0) | |
1009 #endif | |
1010 { } | |
1011 | |
1012 | |
1013 #ifdef ASSERT | |
1014 void LIR_List::set_file_and_line(const char * file, int line) { | |
1015 const char * f = strrchr(file, '/'); | |
1016 if (f == NULL) f = strrchr(file, '\\'); | |
1017 if (f == NULL) { | |
1018 f = file; | |
1019 } else { | |
1020 f++; | |
1021 } | |
1022 _file = f; | |
1023 _line = line; | |
1024 } | |
1025 #endif | |
1026 | |
1027 | |
1028 void LIR_List::append(LIR_InsertionBuffer* buffer) { | |
1029 assert(this == buffer->lir_list(), "wrong lir list"); | |
1030 const int n = _operations.length(); | |
1031 | |
1032 if (buffer->number_of_ops() > 0) { | |
1033 // increase size of instructions list | |
1034 _operations.at_grow(n + buffer->number_of_ops() - 1, NULL); | |
1035 // insert ops from buffer into instructions list | |
1036 int op_index = buffer->number_of_ops() - 1; | |
1037 int ip_index = buffer->number_of_insertion_points() - 1; | |
1038 int from_index = n - 1; | |
1039 int to_index = _operations.length() - 1; | |
1040 for (; ip_index >= 0; ip_index --) { | |
1041 int index = buffer->index_at(ip_index); | |
1042 // make room after insertion point | |
1043 while (index < from_index) { | |
1044 _operations.at_put(to_index --, _operations.at(from_index --)); | |
1045 } | |
1046 // insert ops from buffer | |
1047 for (int i = buffer->count_at(ip_index); i > 0; i --) { | |
1048 _operations.at_put(to_index --, buffer->op_at(op_index --)); | |
1049 } | |
1050 } | |
1051 } | |
1052 | |
1053 buffer->finish(); | |
1054 } | |
1055 | |
1056 | |
1057 void LIR_List::oop2reg_patch(jobject o, LIR_Opr reg, CodeEmitInfo* info) { | |
1058 append(new LIR_Op1(lir_move, LIR_OprFact::oopConst(o), reg, T_OBJECT, lir_patch_normal, info)); | |
1059 } | |
1060 | |
1061 | |
1062 void LIR_List::load(LIR_Address* addr, LIR_Opr src, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1063 append(new LIR_Op1( | |
1064 lir_move, | |
1065 LIR_OprFact::address(addr), | |
1066 src, | |
1067 addr->type(), | |
1068 patch_code, | |
1069 info)); | |
1070 } | |
1071 | |
1072 | |
1073 void LIR_List::volatile_load_mem_reg(LIR_Address* address, LIR_Opr dst, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1074 append(new LIR_Op1( | |
1075 lir_move, | |
1076 LIR_OprFact::address(address), | |
1077 dst, | |
1078 address->type(), | |
1079 patch_code, | |
1080 info, lir_move_volatile)); | |
1081 } | |
1082 | |
1083 void LIR_List::volatile_load_unsafe_reg(LIR_Opr base, LIR_Opr offset, LIR_Opr dst, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1084 append(new LIR_Op1( | |
1085 lir_move, | |
1086 LIR_OprFact::address(new LIR_Address(base, offset, type)), | |
1087 dst, | |
1088 type, | |
1089 patch_code, | |
1090 info, lir_move_volatile)); | |
1091 } | |
1092 | |
1093 | |
1094 void LIR_List::prefetch(LIR_Address* addr, bool is_store) { | |
1095 append(new LIR_Op1( | |
1096 is_store ? lir_prefetchw : lir_prefetchr, | |
1097 LIR_OprFact::address(addr))); | |
1098 } | |
1099 | |
1100 | |
1101 void LIR_List::store_mem_int(jint v, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1102 append(new LIR_Op1( | |
1103 lir_move, | |
1104 LIR_OprFact::intConst(v), | |
1105 LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)), | |
1106 type, | |
1107 patch_code, | |
1108 info)); | |
1109 } | |
1110 | |
1111 | |
1112 void LIR_List::store_mem_oop(jobject o, LIR_Opr base, int offset_in_bytes, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1113 append(new LIR_Op1( | |
1114 lir_move, | |
1115 LIR_OprFact::oopConst(o), | |
1116 LIR_OprFact::address(new LIR_Address(base, offset_in_bytes, type)), | |
1117 type, | |
1118 patch_code, | |
1119 info)); | |
1120 } | |
1121 | |
1122 | |
1123 void LIR_List::store(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1124 append(new LIR_Op1( | |
1125 lir_move, | |
1126 src, | |
1127 LIR_OprFact::address(addr), | |
1128 addr->type(), | |
1129 patch_code, | |
1130 info)); | |
1131 } | |
1132 | |
1133 | |
1134 void LIR_List::volatile_store_mem_reg(LIR_Opr src, LIR_Address* addr, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1135 append(new LIR_Op1( | |
1136 lir_move, | |
1137 src, | |
1138 LIR_OprFact::address(addr), | |
1139 addr->type(), | |
1140 patch_code, | |
1141 info, | |
1142 lir_move_volatile)); | |
1143 } | |
1144 | |
1145 void LIR_List::volatile_store_unsafe_reg(LIR_Opr src, LIR_Opr base, LIR_Opr offset, BasicType type, CodeEmitInfo* info, LIR_PatchCode patch_code) { | |
1146 append(new LIR_Op1( | |
1147 lir_move, | |
1148 src, | |
1149 LIR_OprFact::address(new LIR_Address(base, offset, type)), | |
1150 type, | |
1151 patch_code, | |
1152 info, lir_move_volatile)); | |
1153 } | |
1154 | |
1155 | |
1156 void LIR_List::idiv(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) { | |
1157 append(new LIR_Op3( | |
1158 lir_idiv, | |
1159 left, | |
1160 right, | |
1161 tmp, | |
1162 res, | |
1163 info)); | |
1164 } | |
1165 | |
1166 | |
1167 void LIR_List::idiv(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) { | |
1168 append(new LIR_Op3( | |
1169 lir_idiv, | |
1170 left, | |
1171 LIR_OprFact::intConst(right), | |
1172 tmp, | |
1173 res, | |
1174 info)); | |
1175 } | |
1176 | |
1177 | |
1178 void LIR_List::irem(LIR_Opr left, LIR_Opr right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) { | |
1179 append(new LIR_Op3( | |
1180 lir_irem, | |
1181 left, | |
1182 right, | |
1183 tmp, | |
1184 res, | |
1185 info)); | |
1186 } | |
1187 | |
1188 | |
1189 void LIR_List::irem(LIR_Opr left, int right, LIR_Opr res, LIR_Opr tmp, CodeEmitInfo* info) { | |
1190 append(new LIR_Op3( | |
1191 lir_irem, | |
1192 left, | |
1193 LIR_OprFact::intConst(right), | |
1194 tmp, | |
1195 res, | |
1196 info)); | |
1197 } | |
1198 | |
1199 | |
1200 void LIR_List::cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info) { | |
1201 append(new LIR_Op2( | |
1202 lir_cmp, | |
1203 condition, | |
1204 LIR_OprFact::address(new LIR_Address(base, disp, T_INT)), | |
1205 LIR_OprFact::intConst(c), | |
1206 info)); | |
1207 } | |
1208 | |
1209 | |
1210 void LIR_List::cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Address* addr, CodeEmitInfo* info) { | |
1211 append(new LIR_Op2( | |
1212 lir_cmp, | |
1213 condition, | |
1214 reg, | |
1215 LIR_OprFact::address(addr), | |
1216 info)); | |
1217 } | |
1218 | |
1219 void LIR_List::allocate_object(LIR_Opr dst, LIR_Opr t1, LIR_Opr t2, LIR_Opr t3, LIR_Opr t4, | |
1220 int header_size, int object_size, LIR_Opr klass, bool init_check, CodeStub* stub) { | |
1221 append(new LIR_OpAllocObj( | |
1222 klass, | |
1223 dst, | |
1224 t1, | |
1225 t2, | |
1226 t3, | |
1227 t4, | |
1228 header_size, | |
1229 object_size, | |
1230 init_check, | |
1231 stub)); | |
1232 } | |
1233 | |
1234 void LIR_List::allocate_array(LIR_Opr dst, LIR_Opr len, LIR_Opr t1,LIR_Opr t2, LIR_Opr t3,LIR_Opr t4, BasicType type, LIR_Opr klass, CodeStub* stub) { | |
1235 append(new LIR_OpAllocArray( | |
1236 klass, | |
1237 len, | |
1238 dst, | |
1239 t1, | |
1240 t2, | |
1241 t3, | |
1242 t4, | |
1243 type, | |
1244 stub)); | |
1245 } | |
1246 | |
1247 void LIR_List::shift_left(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) { | |
1248 append(new LIR_Op2( | |
1249 lir_shl, | |
1250 value, | |
1251 count, | |
1252 dst, | |
1253 tmp)); | |
1254 } | |
1255 | |
1256 void LIR_List::shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) { | |
1257 append(new LIR_Op2( | |
1258 lir_shr, | |
1259 value, | |
1260 count, | |
1261 dst, | |
1262 tmp)); | |
1263 } | |
1264 | |
1265 | |
1266 void LIR_List::unsigned_shift_right(LIR_Opr value, LIR_Opr count, LIR_Opr dst, LIR_Opr tmp) { | |
1267 append(new LIR_Op2( | |
1268 lir_ushr, | |
1269 value, | |
1270 count, | |
1271 dst, | |
1272 tmp)); | |
1273 } | |
1274 | |
1275 void LIR_List::fcmp2int(LIR_Opr left, LIR_Opr right, LIR_Opr dst, bool is_unordered_less) { | |
1276 append(new LIR_Op2(is_unordered_less ? lir_ucmp_fd2i : lir_cmp_fd2i, | |
1277 left, | |
1278 right, | |
1279 dst)); | |
1280 } | |
1281 | |
1282 void LIR_List::lock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, LIR_Opr scratch, CodeStub* stub, CodeEmitInfo* info) { | |
1283 append(new LIR_OpLock( | |
1284 lir_lock, | |
1285 hdr, | |
1286 obj, | |
1287 lock, | |
1288 scratch, | |
1289 stub, | |
1290 info)); | |
1291 } | |
1292 | |
1293 void LIR_List::unlock_object(LIR_Opr hdr, LIR_Opr obj, LIR_Opr lock, CodeStub* stub) { | |
1294 append(new LIR_OpLock( | |
1295 lir_unlock, | |
1296 hdr, | |
1297 obj, | |
1298 lock, | |
1299 LIR_OprFact::illegalOpr, | |
1300 stub, | |
1301 NULL)); | |
1302 } | |
1303 | |
1304 | |
1305 void check_LIR() { | |
1306 // cannot do the proper checking as PRODUCT and other modes return different results | |
1307 // guarantee(sizeof(LIR_OprDesc) == wordSize, "may not have a v-table"); | |
1308 } | |
1309 | |
1310 | |
1311 | |
1312 void LIR_List::checkcast (LIR_Opr result, LIR_Opr object, ciKlass* klass, | |
1313 LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check, | |
1314 CodeEmitInfo* info_for_exception, CodeEmitInfo* info_for_patch, CodeStub* stub, | |
1315 ciMethod* profiled_method, int profiled_bci) { | |
1316 append(new LIR_OpTypeCheck(lir_checkcast, result, object, klass, | |
1317 tmp1, tmp2, tmp3, fast_check, info_for_exception, info_for_patch, stub, | |
1318 profiled_method, profiled_bci)); | |
1319 } | |
1320 | |
1321 | |
1322 void LIR_List::instanceof(LIR_Opr result, LIR_Opr object, ciKlass* klass, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, bool fast_check, CodeEmitInfo* info_for_patch) { | |
1323 append(new LIR_OpTypeCheck(lir_instanceof, result, object, klass, tmp1, tmp2, tmp3, fast_check, NULL, info_for_patch, NULL, NULL, 0)); | |
1324 } | |
1325 | |
1326 | |
1327 void LIR_List::store_check(LIR_Opr object, LIR_Opr array, LIR_Opr tmp1, LIR_Opr tmp2, LIR_Opr tmp3, CodeEmitInfo* info_for_exception) { | |
1328 append(new LIR_OpTypeCheck(lir_store_check, object, array, tmp1, tmp2, tmp3, info_for_exception, NULL, 0)); | |
1329 } | |
1330 | |
1331 | |
1332 void LIR_List::cas_long(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value, LIR_Opr t1, LIR_Opr t2) { | |
1333 // Compare and swap produces condition code "zero" if contents_of(addr) == cmp_value, | |
1334 // implying successful swap of new_value into addr | |
1335 append(new LIR_OpCompareAndSwap(lir_cas_long, addr, cmp_value, new_value, t1, t2)); | |
1336 } | |
1337 | |
1338 void LIR_List::cas_obj(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value, LIR_Opr t1, LIR_Opr t2) { | |
1339 // Compare and swap produces condition code "zero" if contents_of(addr) == cmp_value, | |
1340 // implying successful swap of new_value into addr | |
1341 append(new LIR_OpCompareAndSwap(lir_cas_obj, addr, cmp_value, new_value, t1, t2)); | |
1342 } | |
1343 | |
1344 void LIR_List::cas_int(LIR_Opr addr, LIR_Opr cmp_value, LIR_Opr new_value, LIR_Opr t1, LIR_Opr t2) { | |
1345 // Compare and swap produces condition code "zero" if contents_of(addr) == cmp_value, | |
1346 // implying successful swap of new_value into addr | |
1347 append(new LIR_OpCompareAndSwap(lir_cas_int, addr, cmp_value, new_value, t1, t2)); | |
1348 } | |
1349 | |
1350 | |
1351 #ifdef PRODUCT | |
1352 | |
1353 void print_LIR(BlockList* blocks) { | |
1354 } | |
1355 | |
1356 #else | |
1357 // LIR_OprDesc | |
1358 void LIR_OprDesc::print() const { | |
1359 print(tty); | |
1360 } | |
1361 | |
1362 void LIR_OprDesc::print(outputStream* out) const { | |
1363 if (is_illegal()) { | |
1364 return; | |
1365 } | |
1366 | |
1367 out->print("["); | |
1368 if (is_pointer()) { | |
1369 pointer()->print_value_on(out); | |
1370 } else if (is_single_stack()) { | |
1371 out->print("stack:%d", single_stack_ix()); | |
1372 } else if (is_double_stack()) { | |
1373 out->print("dbl_stack:%d",double_stack_ix()); | |
1374 } else if (is_virtual()) { | |
1375 out->print("R%d", vreg_number()); | |
1376 } else if (is_single_cpu()) { | |
1377 out->print(as_register()->name()); | |
1378 } else if (is_double_cpu()) { | |
1379 out->print(as_register_hi()->name()); | |
1380 out->print(as_register_lo()->name()); | |
304 | 1381 #if defined(X86) |
0 | 1382 } else if (is_single_xmm()) { |
1383 out->print(as_xmm_float_reg()->name()); | |
1384 } else if (is_double_xmm()) { | |
1385 out->print(as_xmm_double_reg()->name()); | |
1386 } else if (is_single_fpu()) { | |
1387 out->print("fpu%d", fpu_regnr()); | |
1388 } else if (is_double_fpu()) { | |
1389 out->print("fpu%d", fpu_regnrLo()); | |
1390 #else | |
1391 } else if (is_single_fpu()) { | |
1392 out->print(as_float_reg()->name()); | |
1393 } else if (is_double_fpu()) { | |
1394 out->print(as_double_reg()->name()); | |
1395 #endif | |
1396 | |
1397 } else if (is_illegal()) { | |
1398 out->print("-"); | |
1399 } else { | |
1400 out->print("Unknown Operand"); | |
1401 } | |
1402 if (!is_illegal()) { | |
1403 out->print("|%c", type_char()); | |
1404 } | |
1405 if (is_register() && is_last_use()) { | |
1406 out->print("(last_use)"); | |
1407 } | |
1408 out->print("]"); | |
1409 } | |
1410 | |
1411 | |
1412 // LIR_Address | |
1413 void LIR_Const::print_value_on(outputStream* out) const { | |
1414 switch (type()) { | |
1297
c466efa608d5
6932496: c1: deoptimization of jsr subroutine fails on sparcv9
roland
parents:
1295
diff
changeset
|
1415 case T_ADDRESS:out->print("address:%d",as_jint()); break; |
0 | 1416 case T_INT: out->print("int:%d", as_jint()); break; |
1417 case T_LONG: out->print("lng:%lld", as_jlong()); break; | |
1418 case T_FLOAT: out->print("flt:%f", as_jfloat()); break; | |
1419 case T_DOUBLE: out->print("dbl:%f", as_jdouble()); break; | |
1420 case T_OBJECT: out->print("obj:0x%x", as_jobject()); break; | |
1421 default: out->print("%3d:0x%x",type(), as_jdouble()); break; | |
1422 } | |
1423 } | |
1424 | |
1425 // LIR_Address | |
1426 void LIR_Address::print_value_on(outputStream* out) const { | |
1427 out->print("Base:"); _base->print(out); | |
1428 if (!_index->is_illegal()) { | |
1429 out->print(" Index:"); _index->print(out); | |
1430 switch (scale()) { | |
1431 case times_1: break; | |
1432 case times_2: out->print(" * 2"); break; | |
1433 case times_4: out->print(" * 4"); break; | |
1434 case times_8: out->print(" * 8"); break; | |
1435 } | |
1436 } | |
1437 out->print(" Disp: %d", _disp); | |
1438 } | |
1439 | |
1440 // debug output of block header without InstructionPrinter | |
1441 // (because phi functions are not necessary for LIR) | |
1442 static void print_block(BlockBegin* x) { | |
1443 // print block id | |
1444 BlockEnd* end = x->end(); | |
1445 tty->print("B%d ", x->block_id()); | |
1446 | |
1447 // print flags | |
1448 if (x->is_set(BlockBegin::std_entry_flag)) tty->print("std "); | |
1449 if (x->is_set(BlockBegin::osr_entry_flag)) tty->print("osr "); | |
1450 if (x->is_set(BlockBegin::exception_entry_flag)) tty->print("ex "); | |
1451 if (x->is_set(BlockBegin::subroutine_entry_flag)) tty->print("jsr "); | |
1452 if (x->is_set(BlockBegin::backward_branch_target_flag)) tty->print("bb "); | |
1453 if (x->is_set(BlockBegin::linear_scan_loop_header_flag)) tty->print("lh "); | |
1454 if (x->is_set(BlockBegin::linear_scan_loop_end_flag)) tty->print("le "); | |
1455 | |
1456 // print block bci range | |
1457 tty->print("[%d, %d] ", x->bci(), (end == NULL ? -1 : end->bci())); | |
1458 | |
1459 // print predecessors and successors | |
1460 if (x->number_of_preds() > 0) { | |
1461 tty->print("preds: "); | |
1462 for (int i = 0; i < x->number_of_preds(); i ++) { | |
1463 tty->print("B%d ", x->pred_at(i)->block_id()); | |
1464 } | |
1465 } | |
1466 | |
1467 if (x->number_of_sux() > 0) { | |
1468 tty->print("sux: "); | |
1469 for (int i = 0; i < x->number_of_sux(); i ++) { | |
1470 tty->print("B%d ", x->sux_at(i)->block_id()); | |
1471 } | |
1472 } | |
1473 | |
1474 // print exception handlers | |
1475 if (x->number_of_exception_handlers() > 0) { | |
1476 tty->print("xhandler: "); | |
1477 for (int i = 0; i < x->number_of_exception_handlers(); i++) { | |
1478 tty->print("B%d ", x->exception_handler_at(i)->block_id()); | |
1479 } | |
1480 } | |
1481 | |
1482 tty->cr(); | |
1483 } | |
1484 | |
1485 void print_LIR(BlockList* blocks) { | |
1486 tty->print_cr("LIR:"); | |
1487 int i; | |
1488 for (i = 0; i < blocks->length(); i++) { | |
1489 BlockBegin* bb = blocks->at(i); | |
1490 print_block(bb); | |
1491 tty->print("__id_Instruction___________________________________________"); tty->cr(); | |
1492 bb->lir()->print_instructions(); | |
1493 } | |
1494 } | |
1495 | |
1496 void LIR_List::print_instructions() { | |
1497 for (int i = 0; i < _operations.length(); i++) { | |
1498 _operations.at(i)->print(); tty->cr(); | |
1499 } | |
1500 tty->cr(); | |
1501 } | |
1502 | |
1503 // LIR_Ops printing routines | |
1504 // LIR_Op | |
1505 void LIR_Op::print_on(outputStream* out) const { | |
1506 if (id() != -1 || PrintCFGToFile) { | |
1507 out->print("%4d ", id()); | |
1508 } else { | |
1509 out->print(" "); | |
1510 } | |
1511 out->print(name()); out->print(" "); | |
1512 print_instr(out); | |
1513 if (info() != NULL) out->print(" [bci:%d]", info()->bci()); | |
1514 #ifdef ASSERT | |
1515 if (Verbose && _file != NULL) { | |
1516 out->print(" (%s:%d)", _file, _line); | |
1517 } | |
1518 #endif | |
1519 } | |
1520 | |
1521 const char * LIR_Op::name() const { | |
1522 const char* s = NULL; | |
1523 switch(code()) { | |
1524 // LIR_Op0 | |
1525 case lir_membar: s = "membar"; break; | |
1526 case lir_membar_acquire: s = "membar_acquire"; break; | |
1527 case lir_membar_release: s = "membar_release"; break; | |
1528 case lir_word_align: s = "word_align"; break; | |
1529 case lir_label: s = "label"; break; | |
1530 case lir_nop: s = "nop"; break; | |
1531 case lir_backwardbranch_target: s = "backbranch"; break; | |
1532 case lir_std_entry: s = "std_entry"; break; | |
1533 case lir_osr_entry: s = "osr_entry"; break; | |
1534 case lir_build_frame: s = "build_frm"; break; | |
1535 case lir_fpop_raw: s = "fpop_raw"; break; | |
1536 case lir_24bit_FPU: s = "24bit_FPU"; break; | |
1537 case lir_reset_FPU: s = "reset_FPU"; break; | |
1538 case lir_breakpoint: s = "breakpoint"; break; | |
1539 case lir_get_thread: s = "get_thread"; break; | |
1540 // LIR_Op1 | |
1541 case lir_fxch: s = "fxch"; break; | |
1542 case lir_fld: s = "fld"; break; | |
1543 case lir_ffree: s = "ffree"; break; | |
1544 case lir_push: s = "push"; break; | |
1545 case lir_pop: s = "pop"; break; | |
1546 case lir_null_check: s = "null_check"; break; | |
1547 case lir_return: s = "return"; break; | |
1548 case lir_safepoint: s = "safepoint"; break; | |
1549 case lir_neg: s = "neg"; break; | |
1550 case lir_leal: s = "leal"; break; | |
1551 case lir_branch: s = "branch"; break; | |
1552 case lir_cond_float_branch: s = "flt_cond_br"; break; | |
1553 case lir_move: s = "move"; break; | |
1554 case lir_roundfp: s = "roundfp"; break; | |
1555 case lir_rtcall: s = "rtcall"; break; | |
1556 case lir_throw: s = "throw"; break; | |
1557 case lir_unwind: s = "unwind"; break; | |
1558 case lir_convert: s = "convert"; break; | |
1559 case lir_alloc_object: s = "alloc_obj"; break; | |
1560 case lir_monaddr: s = "mon_addr"; break; | |
1561 // LIR_Op2 | |
1562 case lir_cmp: s = "cmp"; break; | |
1563 case lir_cmp_l2i: s = "cmp_l2i"; break; | |
1564 case lir_ucmp_fd2i: s = "ucomp_fd2i"; break; | |
1565 case lir_cmp_fd2i: s = "comp_fd2i"; break; | |
1566 case lir_cmove: s = "cmove"; break; | |
1567 case lir_add: s = "add"; break; | |
1568 case lir_sub: s = "sub"; break; | |
1569 case lir_mul: s = "mul"; break; | |
1570 case lir_mul_strictfp: s = "mul_strictfp"; break; | |
1571 case lir_div: s = "div"; break; | |
1572 case lir_div_strictfp: s = "div_strictfp"; break; | |
1573 case lir_rem: s = "rem"; break; | |
1574 case lir_abs: s = "abs"; break; | |
1575 case lir_sqrt: s = "sqrt"; break; | |
1576 case lir_sin: s = "sin"; break; | |
1577 case lir_cos: s = "cos"; break; | |
1578 case lir_tan: s = "tan"; break; | |
1579 case lir_log: s = "log"; break; | |
1580 case lir_log10: s = "log10"; break; | |
1581 case lir_logic_and: s = "logic_and"; break; | |
1582 case lir_logic_or: s = "logic_or"; break; | |
1583 case lir_logic_xor: s = "logic_xor"; break; | |
1584 case lir_shl: s = "shift_left"; break; | |
1585 case lir_shr: s = "shift_right"; break; | |
1586 case lir_ushr: s = "ushift_right"; break; | |
1587 case lir_alloc_array: s = "alloc_array"; break; | |
1588 // LIR_Op3 | |
1589 case lir_idiv: s = "idiv"; break; | |
1590 case lir_irem: s = "irem"; break; | |
1591 // LIR_OpJavaCall | |
1592 case lir_static_call: s = "static"; break; | |
1593 case lir_optvirtual_call: s = "optvirtual"; break; | |
1594 case lir_icvirtual_call: s = "icvirtual"; break; | |
1595 case lir_virtual_call: s = "virtual"; break; | |
1295 | 1596 case lir_dynamic_call: s = "dynamic"; break; |
0 | 1597 // LIR_OpArrayCopy |
1598 case lir_arraycopy: s = "arraycopy"; break; | |
1599 // LIR_OpLock | |
1600 case lir_lock: s = "lock"; break; | |
1601 case lir_unlock: s = "unlock"; break; | |
1602 // LIR_OpDelay | |
1603 case lir_delay_slot: s = "delay"; break; | |
1604 // LIR_OpTypeCheck | |
1605 case lir_instanceof: s = "instanceof"; break; | |
1606 case lir_checkcast: s = "checkcast"; break; | |
1607 case lir_store_check: s = "store_check"; break; | |
1608 // LIR_OpCompareAndSwap | |
1609 case lir_cas_long: s = "cas_long"; break; | |
1610 case lir_cas_obj: s = "cas_obj"; break; | |
1611 case lir_cas_int: s = "cas_int"; break; | |
1612 // LIR_OpProfileCall | |
1613 case lir_profile_call: s = "profile_call"; break; | |
1614 | |
1615 case lir_none: ShouldNotReachHere();break; | |
1616 default: s = "illegal_op"; break; | |
1617 } | |
1618 return s; | |
1619 } | |
1620 | |
1621 // LIR_OpJavaCall | |
1622 void LIR_OpJavaCall::print_instr(outputStream* out) const { | |
1623 out->print("call: "); | |
1624 out->print("[addr: 0x%x]", address()); | |
1625 if (receiver()->is_valid()) { | |
1626 out->print(" [recv: "); receiver()->print(out); out->print("]"); | |
1627 } | |
1628 if (result_opr()->is_valid()) { | |
1629 out->print(" [result: "); result_opr()->print(out); out->print("]"); | |
1630 } | |
1631 } | |
1632 | |
1633 // LIR_OpLabel | |
1634 void LIR_OpLabel::print_instr(outputStream* out) const { | |
1635 out->print("[label:0x%x]", _label); | |
1636 } | |
1637 | |
1638 // LIR_OpArrayCopy | |
1639 void LIR_OpArrayCopy::print_instr(outputStream* out) const { | |
1640 src()->print(out); out->print(" "); | |
1641 src_pos()->print(out); out->print(" "); | |
1642 dst()->print(out); out->print(" "); | |
1643 dst_pos()->print(out); out->print(" "); | |
1644 length()->print(out); out->print(" "); | |
1645 tmp()->print(out); out->print(" "); | |
1646 } | |
1647 | |
1648 // LIR_OpCompareAndSwap | |
1649 void LIR_OpCompareAndSwap::print_instr(outputStream* out) const { | |
1650 addr()->print(out); out->print(" "); | |
1651 cmp_value()->print(out); out->print(" "); | |
1652 new_value()->print(out); out->print(" "); | |
1653 tmp1()->print(out); out->print(" "); | |
1654 tmp2()->print(out); out->print(" "); | |
1655 | |
1656 } | |
1657 | |
1658 // LIR_Op0 | |
1659 void LIR_Op0::print_instr(outputStream* out) const { | |
1660 result_opr()->print(out); | |
1661 } | |
1662 | |
1663 // LIR_Op1 | |
1664 const char * LIR_Op1::name() const { | |
1665 if (code() == lir_move) { | |
1666 switch (move_kind()) { | |
1667 case lir_move_normal: | |
1668 return "move"; | |
1669 case lir_move_unaligned: | |
1670 return "unaligned move"; | |
1671 case lir_move_volatile: | |
1672 return "volatile_move"; | |
1673 default: | |
1674 ShouldNotReachHere(); | |
1675 return "illegal_op"; | |
1676 } | |
1677 } else { | |
1678 return LIR_Op::name(); | |
1679 } | |
1680 } | |
1681 | |
1682 | |
1683 void LIR_Op1::print_instr(outputStream* out) const { | |
1684 _opr->print(out); out->print(" "); | |
1685 result_opr()->print(out); out->print(" "); | |
1686 print_patch_code(out, patch_code()); | |
1687 } | |
1688 | |
1689 | |
1690 // LIR_Op1 | |
1691 void LIR_OpRTCall::print_instr(outputStream* out) const { | |
1692 intx a = (intx)addr(); | |
1693 out->print(Runtime1::name_for_address(addr())); | |
1694 out->print(" "); | |
1695 tmp()->print(out); | |
1696 } | |
1697 | |
1698 void LIR_Op1::print_patch_code(outputStream* out, LIR_PatchCode code) { | |
1699 switch(code) { | |
1700 case lir_patch_none: break; | |
1701 case lir_patch_low: out->print("[patch_low]"); break; | |
1702 case lir_patch_high: out->print("[patch_high]"); break; | |
1703 case lir_patch_normal: out->print("[patch_normal]"); break; | |
1704 default: ShouldNotReachHere(); | |
1705 } | |
1706 } | |
1707 | |
1708 // LIR_OpBranch | |
1709 void LIR_OpBranch::print_instr(outputStream* out) const { | |
1710 print_condition(out, cond()); out->print(" "); | |
1711 if (block() != NULL) { | |
1712 out->print("[B%d] ", block()->block_id()); | |
1713 } else if (stub() != NULL) { | |
1714 out->print("["); | |
1715 stub()->print_name(out); | |
1716 out->print(": 0x%x]", stub()); | |
1717 if (stub()->info() != NULL) out->print(" [bci:%d]", stub()->info()->bci()); | |
1718 } else { | |
1719 out->print("[label:0x%x] ", label()); | |
1720 } | |
1721 if (ublock() != NULL) { | |
1722 out->print("unordered: [B%d] ", ublock()->block_id()); | |
1723 } | |
1724 } | |
1725 | |
1726 void LIR_Op::print_condition(outputStream* out, LIR_Condition cond) { | |
1727 switch(cond) { | |
1728 case lir_cond_equal: out->print("[EQ]"); break; | |
1729 case lir_cond_notEqual: out->print("[NE]"); break; | |
1730 case lir_cond_less: out->print("[LT]"); break; | |
1731 case lir_cond_lessEqual: out->print("[LE]"); break; | |
1732 case lir_cond_greaterEqual: out->print("[GE]"); break; | |
1733 case lir_cond_greater: out->print("[GT]"); break; | |
1734 case lir_cond_belowEqual: out->print("[BE]"); break; | |
1735 case lir_cond_aboveEqual: out->print("[AE]"); break; | |
1736 case lir_cond_always: out->print("[AL]"); break; | |
1737 default: out->print("[%d]",cond); break; | |
1738 } | |
1739 } | |
1740 | |
1741 // LIR_OpConvert | |
1742 void LIR_OpConvert::print_instr(outputStream* out) const { | |
1743 print_bytecode(out, bytecode()); | |
1744 in_opr()->print(out); out->print(" "); | |
1745 result_opr()->print(out); out->print(" "); | |
1746 } | |
1747 | |
1748 void LIR_OpConvert::print_bytecode(outputStream* out, Bytecodes::Code code) { | |
1749 switch(code) { | |
1750 case Bytecodes::_d2f: out->print("[d2f] "); break; | |
1751 case Bytecodes::_d2i: out->print("[d2i] "); break; | |
1752 case Bytecodes::_d2l: out->print("[d2l] "); break; | |
1753 case Bytecodes::_f2d: out->print("[f2d] "); break; | |
1754 case Bytecodes::_f2i: out->print("[f2i] "); break; | |
1755 case Bytecodes::_f2l: out->print("[f2l] "); break; | |
1756 case Bytecodes::_i2b: out->print("[i2b] "); break; | |
1757 case Bytecodes::_i2c: out->print("[i2c] "); break; | |
1758 case Bytecodes::_i2d: out->print("[i2d] "); break; | |
1759 case Bytecodes::_i2f: out->print("[i2f] "); break; | |
1760 case Bytecodes::_i2l: out->print("[i2l] "); break; | |
1761 case Bytecodes::_i2s: out->print("[i2s] "); break; | |
1762 case Bytecodes::_l2i: out->print("[l2i] "); break; | |
1763 case Bytecodes::_l2f: out->print("[l2f] "); break; | |
1764 case Bytecodes::_l2d: out->print("[l2d] "); break; | |
1765 default: | |
1766 out->print("[?%d]",code); | |
1767 break; | |
1768 } | |
1769 } | |
1770 | |
1771 void LIR_OpAllocObj::print_instr(outputStream* out) const { | |
1772 klass()->print(out); out->print(" "); | |
1773 obj()->print(out); out->print(" "); | |
1774 tmp1()->print(out); out->print(" "); | |
1775 tmp2()->print(out); out->print(" "); | |
1776 tmp3()->print(out); out->print(" "); | |
1777 tmp4()->print(out); out->print(" "); | |
1778 out->print("[hdr:%d]", header_size()); out->print(" "); | |
1779 out->print("[obj:%d]", object_size()); out->print(" "); | |
1780 out->print("[lbl:0x%x]", stub()->entry()); | |
1781 } | |
1782 | |
1783 void LIR_OpRoundFP::print_instr(outputStream* out) const { | |
1784 _opr->print(out); out->print(" "); | |
1785 tmp()->print(out); out->print(" "); | |
1786 result_opr()->print(out); out->print(" "); | |
1787 } | |
1788 | |
1789 // LIR_Op2 | |
1790 void LIR_Op2::print_instr(outputStream* out) const { | |
1791 if (code() == lir_cmove) { | |
1792 print_condition(out, condition()); out->print(" "); | |
1793 } | |
1794 in_opr1()->print(out); out->print(" "); | |
1795 in_opr2()->print(out); out->print(" "); | |
1796 if (tmp_opr()->is_valid()) { tmp_opr()->print(out); out->print(" "); } | |
1797 result_opr()->print(out); | |
1798 } | |
1799 | |
1800 void LIR_OpAllocArray::print_instr(outputStream* out) const { | |
1801 klass()->print(out); out->print(" "); | |
1802 len()->print(out); out->print(" "); | |
1803 obj()->print(out); out->print(" "); | |
1804 tmp1()->print(out); out->print(" "); | |
1805 tmp2()->print(out); out->print(" "); | |
1806 tmp3()->print(out); out->print(" "); | |
1807 tmp4()->print(out); out->print(" "); | |
1808 out->print("[type:0x%x]", type()); out->print(" "); | |
1809 out->print("[label:0x%x]", stub()->entry()); | |
1810 } | |
1811 | |
1812 | |
1813 void LIR_OpTypeCheck::print_instr(outputStream* out) const { | |
1814 object()->print(out); out->print(" "); | |
1815 if (code() == lir_store_check) { | |
1816 array()->print(out); out->print(" "); | |
1817 } | |
1818 if (code() != lir_store_check) { | |
1819 klass()->print_name_on(out); out->print(" "); | |
1820 if (fast_check()) out->print("fast_check "); | |
1821 } | |
1822 tmp1()->print(out); out->print(" "); | |
1823 tmp2()->print(out); out->print(" "); | |
1824 tmp3()->print(out); out->print(" "); | |
1825 result_opr()->print(out); out->print(" "); | |
1826 if (info_for_exception() != NULL) out->print(" [bci:%d]", info_for_exception()->bci()); | |
1827 } | |
1828 | |
1829 | |
1830 // LIR_Op3 | |
1831 void LIR_Op3::print_instr(outputStream* out) const { | |
1832 in_opr1()->print(out); out->print(" "); | |
1833 in_opr2()->print(out); out->print(" "); | |
1834 in_opr3()->print(out); out->print(" "); | |
1835 result_opr()->print(out); | |
1836 } | |
1837 | |
1838 | |
1839 void LIR_OpLock::print_instr(outputStream* out) const { | |
1840 hdr_opr()->print(out); out->print(" "); | |
1841 obj_opr()->print(out); out->print(" "); | |
1842 lock_opr()->print(out); out->print(" "); | |
1843 if (_scratch->is_valid()) { | |
1844 _scratch->print(out); out->print(" "); | |
1845 } | |
1846 out->print("[lbl:0x%x]", stub()->entry()); | |
1847 } | |
1848 | |
1849 | |
1850 void LIR_OpDelay::print_instr(outputStream* out) const { | |
1851 _op->print_on(out); | |
1852 } | |
1853 | |
1854 | |
1855 // LIR_OpProfileCall | |
1856 void LIR_OpProfileCall::print_instr(outputStream* out) const { | |
1857 profiled_method()->name()->print_symbol_on(out); | |
1858 out->print("."); | |
1859 profiled_method()->holder()->name()->print_symbol_on(out); | |
1860 out->print(" @ %d ", profiled_bci()); | |
1861 mdo()->print(out); out->print(" "); | |
1862 recv()->print(out); out->print(" "); | |
1863 tmp1()->print(out); out->print(" "); | |
1864 } | |
1865 | |
1866 | |
1867 #endif // PRODUCT | |
1868 | |
1869 // Implementation of LIR_InsertionBuffer | |
1870 | |
1871 void LIR_InsertionBuffer::append(int index, LIR_Op* op) { | |
1872 assert(_index_and_count.length() % 2 == 0, "must have a count for each index"); | |
1873 | |
1874 int i = number_of_insertion_points() - 1; | |
1875 if (i < 0 || index_at(i) < index) { | |
1876 append_new(index, 1); | |
1877 } else { | |
1878 assert(index_at(i) == index, "can append LIR_Ops in ascending order only"); | |
1879 assert(count_at(i) > 0, "check"); | |
1880 set_count_at(i, count_at(i) + 1); | |
1881 } | |
1882 _ops.push(op); | |
1883 | |
1884 DEBUG_ONLY(verify()); | |
1885 } | |
1886 | |
1887 #ifdef ASSERT | |
1888 void LIR_InsertionBuffer::verify() { | |
1889 int sum = 0; | |
1890 int prev_idx = -1; | |
1891 | |
1892 for (int i = 0; i < number_of_insertion_points(); i++) { | |
1893 assert(prev_idx < index_at(i), "index must be ordered ascending"); | |
1894 sum += count_at(i); | |
1895 } | |
1896 assert(sum == number_of_ops(), "wrong total sum"); | |
1897 } | |
1898 #endif |