Wed, 13 Mar 2013 09:44:45 +0100
8009761: Deoptimization on sparc doesn't set Llast_SP correctly in the interpreter frames it creates
Summary: deoptimization doesn't set up callee frames so that they restore caller frames correctly.
Reviewed-by: kvn
1 /*
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "interpreter/interpreter.hpp"
27 #include "interpreter/interpreterRuntime.hpp"
28 #include "interpreter/templateTable.hpp"
29 #include "memory/universe.inline.hpp"
30 #include "oops/methodData.hpp"
31 #include "oops/objArrayKlass.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "prims/methodHandles.hpp"
34 #include "runtime/sharedRuntime.hpp"
35 #include "runtime/stubRoutines.hpp"
36 #include "runtime/synchronizer.hpp"
37 #include "utilities/macros.hpp"
39 #ifndef CC_INTERP
40 #define __ _masm->
42 // Misc helpers
44 // Do an oop store like *(base + index + offset) = val
45 // index can be noreg,
46 static void do_oop_store(InterpreterMacroAssembler* _masm,
47 Register base,
48 Register index,
49 int offset,
50 Register val,
51 Register tmp,
52 BarrierSet::Name barrier,
53 bool precise) {
54 assert(tmp != val && tmp != base && tmp != index, "register collision");
55 assert(index == noreg || offset == 0, "only one offset");
56 switch (barrier) {
57 #if INCLUDE_ALL_GCS
58 case BarrierSet::G1SATBCT:
59 case BarrierSet::G1SATBCTLogging:
60 {
61 // Load and record the previous value.
62 __ g1_write_barrier_pre(base, index, offset,
63 noreg /* pre_val */,
64 tmp, true /*preserve_o_regs*/);
66 if (index == noreg ) {
67 assert(Assembler::is_simm13(offset), "fix this code");
68 __ store_heap_oop(val, base, offset);
69 } else {
70 __ store_heap_oop(val, base, index);
71 }
73 // No need for post barrier if storing NULL
74 if (val != G0) {
75 if (precise) {
76 if (index == noreg) {
77 __ add(base, offset, base);
78 } else {
79 __ add(base, index, base);
80 }
81 }
82 __ g1_write_barrier_post(base, val, tmp);
83 }
84 }
85 break;
86 #endif // INCLUDE_ALL_GCS
87 case BarrierSet::CardTableModRef:
88 case BarrierSet::CardTableExtension:
89 {
90 if (index == noreg ) {
91 assert(Assembler::is_simm13(offset), "fix this code");
92 __ store_heap_oop(val, base, offset);
93 } else {
94 __ store_heap_oop(val, base, index);
95 }
96 // No need for post barrier if storing NULL
97 if (val != G0) {
98 if (precise) {
99 if (index == noreg) {
100 __ add(base, offset, base);
101 } else {
102 __ add(base, index, base);
103 }
104 }
105 __ card_write_barrier_post(base, val, tmp);
106 }
107 }
108 break;
109 case BarrierSet::ModRef:
110 case BarrierSet::Other:
111 ShouldNotReachHere();
112 break;
113 default :
114 ShouldNotReachHere();
116 }
117 }
120 //----------------------------------------------------------------------------------------------------
121 // Platform-dependent initialization
123 void TemplateTable::pd_initialize() {
124 // (none)
125 }
128 //----------------------------------------------------------------------------------------------------
129 // Condition conversion
130 Assembler::Condition ccNot(TemplateTable::Condition cc) {
131 switch (cc) {
132 case TemplateTable::equal : return Assembler::notEqual;
133 case TemplateTable::not_equal : return Assembler::equal;
134 case TemplateTable::less : return Assembler::greaterEqual;
135 case TemplateTable::less_equal : return Assembler::greater;
136 case TemplateTable::greater : return Assembler::lessEqual;
137 case TemplateTable::greater_equal: return Assembler::less;
138 }
139 ShouldNotReachHere();
140 return Assembler::zero;
141 }
143 //----------------------------------------------------------------------------------------------------
144 // Miscelaneous helper routines
147 Address TemplateTable::at_bcp(int offset) {
148 assert(_desc->uses_bcp(), "inconsistent uses_bcp information");
149 return Address(Lbcp, offset);
150 }
153 void TemplateTable::patch_bytecode(Bytecodes::Code bc, Register bc_reg,
154 Register temp_reg, bool load_bc_into_bc_reg/*=true*/,
155 int byte_no) {
156 // With sharing on, may need to test Method* flag.
157 if (!RewriteBytecodes) return;
158 Label L_patch_done;
160 switch (bc) {
161 case Bytecodes::_fast_aputfield:
162 case Bytecodes::_fast_bputfield:
163 case Bytecodes::_fast_cputfield:
164 case Bytecodes::_fast_dputfield:
165 case Bytecodes::_fast_fputfield:
166 case Bytecodes::_fast_iputfield:
167 case Bytecodes::_fast_lputfield:
168 case Bytecodes::_fast_sputfield:
169 {
170 // We skip bytecode quickening for putfield instructions when
171 // the put_code written to the constant pool cache is zero.
172 // This is required so that every execution of this instruction
173 // calls out to InterpreterRuntime::resolve_get_put to do
174 // additional, required work.
175 assert(byte_no == f1_byte || byte_no == f2_byte, "byte_no out of range");
176 assert(load_bc_into_bc_reg, "we use bc_reg as temp");
177 __ get_cache_and_index_and_bytecode_at_bcp(bc_reg, temp_reg, temp_reg, byte_no, 1);
178 __ set(bc, bc_reg);
179 __ cmp_and_br_short(temp_reg, 0, Assembler::equal, Assembler::pn, L_patch_done); // don't patch
180 }
181 break;
182 default:
183 assert(byte_no == -1, "sanity");
184 if (load_bc_into_bc_reg) {
185 __ set(bc, bc_reg);
186 }
187 }
189 if (JvmtiExport::can_post_breakpoint()) {
190 Label L_fast_patch;
191 __ ldub(at_bcp(0), temp_reg);
192 __ cmp_and_br_short(temp_reg, Bytecodes::_breakpoint, Assembler::notEqual, Assembler::pt, L_fast_patch);
193 // perform the quickening, slowly, in the bowels of the breakpoint table
194 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::set_original_bytecode_at), Lmethod, Lbcp, bc_reg);
195 __ ba_short(L_patch_done);
196 __ bind(L_fast_patch);
197 }
199 #ifdef ASSERT
200 Bytecodes::Code orig_bytecode = Bytecodes::java_code(bc);
201 Label L_okay;
202 __ ldub(at_bcp(0), temp_reg);
203 __ cmp(temp_reg, orig_bytecode);
204 __ br(Assembler::equal, false, Assembler::pt, L_okay);
205 __ delayed()->cmp(temp_reg, bc_reg);
206 __ br(Assembler::equal, false, Assembler::pt, L_okay);
207 __ delayed()->nop();
208 __ stop("patching the wrong bytecode");
209 __ bind(L_okay);
210 #endif
212 // patch bytecode
213 __ stb(bc_reg, at_bcp(0));
214 __ bind(L_patch_done);
215 }
217 //----------------------------------------------------------------------------------------------------
218 // Individual instructions
220 void TemplateTable::nop() {
221 transition(vtos, vtos);
222 // nothing to do
223 }
225 void TemplateTable::shouldnotreachhere() {
226 transition(vtos, vtos);
227 __ stop("shouldnotreachhere bytecode");
228 }
230 void TemplateTable::aconst_null() {
231 transition(vtos, atos);
232 __ clr(Otos_i);
233 }
236 void TemplateTable::iconst(int value) {
237 transition(vtos, itos);
238 __ set(value, Otos_i);
239 }
242 void TemplateTable::lconst(int value) {
243 transition(vtos, ltos);
244 assert(value >= 0, "check this code");
245 #ifdef _LP64
246 __ set(value, Otos_l);
247 #else
248 __ set(value, Otos_l2);
249 __ clr( Otos_l1);
250 #endif
251 }
254 void TemplateTable::fconst(int value) {
255 transition(vtos, ftos);
256 static float zero = 0.0, one = 1.0, two = 2.0;
257 float* p;
258 switch( value ) {
259 default: ShouldNotReachHere();
260 case 0: p = &zero; break;
261 case 1: p = &one; break;
262 case 2: p = &two; break;
263 }
264 AddressLiteral a(p);
265 __ sethi(a, G3_scratch);
266 __ ldf(FloatRegisterImpl::S, G3_scratch, a.low10(), Ftos_f);
267 }
270 void TemplateTable::dconst(int value) {
271 transition(vtos, dtos);
272 static double zero = 0.0, one = 1.0;
273 double* p;
274 switch( value ) {
275 default: ShouldNotReachHere();
276 case 0: p = &zero; break;
277 case 1: p = &one; break;
278 }
279 AddressLiteral a(p);
280 __ sethi(a, G3_scratch);
281 __ ldf(FloatRegisterImpl::D, G3_scratch, a.low10(), Ftos_d);
282 }
285 // %%%%% Should factore most snippet templates across platforms
287 void TemplateTable::bipush() {
288 transition(vtos, itos);
289 __ ldsb( at_bcp(1), Otos_i );
290 }
292 void TemplateTable::sipush() {
293 transition(vtos, itos);
294 __ get_2_byte_integer_at_bcp(1, G3_scratch, Otos_i, InterpreterMacroAssembler::Signed);
295 }
297 void TemplateTable::ldc(bool wide) {
298 transition(vtos, vtos);
299 Label call_ldc, notInt, isString, notString, notClass, exit;
301 if (wide) {
302 __ get_2_byte_integer_at_bcp(1, G3_scratch, O1, InterpreterMacroAssembler::Unsigned);
303 } else {
304 __ ldub(Lbcp, 1, O1);
305 }
306 __ get_cpool_and_tags(O0, O2);
308 const int base_offset = ConstantPool::header_size() * wordSize;
309 const int tags_offset = Array<u1>::base_offset_in_bytes();
311 // get type from tags
312 __ add(O2, tags_offset, O2);
313 __ ldub(O2, O1, O2);
315 // unresolved class? If so, must resolve
316 __ cmp_and_brx_short(O2, JVM_CONSTANT_UnresolvedClass, Assembler::equal, Assembler::pt, call_ldc);
318 // unresolved class in error state
319 __ cmp_and_brx_short(O2, JVM_CONSTANT_UnresolvedClassInError, Assembler::equal, Assembler::pn, call_ldc);
321 __ cmp(O2, JVM_CONSTANT_Class); // need to call vm to get java mirror of the class
322 __ brx(Assembler::notEqual, true, Assembler::pt, notClass);
323 __ delayed()->add(O0, base_offset, O0);
325 __ bind(call_ldc);
326 __ set(wide, O1);
327 call_VM(Otos_i, CAST_FROM_FN_PTR(address, InterpreterRuntime::ldc), O1);
328 __ push(atos);
329 __ ba_short(exit);
331 __ bind(notClass);
332 // __ add(O0, base_offset, O0);
333 __ sll(O1, LogBytesPerWord, O1);
334 __ cmp(O2, JVM_CONSTANT_Integer);
335 __ brx(Assembler::notEqual, true, Assembler::pt, notInt);
336 __ delayed()->cmp(O2, JVM_CONSTANT_String);
337 __ ld(O0, O1, Otos_i);
338 __ push(itos);
339 __ ba_short(exit);
341 __ bind(notInt);
342 // __ cmp(O2, JVM_CONSTANT_String);
343 __ brx(Assembler::notEqual, true, Assembler::pt, notString);
344 __ delayed()->ldf(FloatRegisterImpl::S, O0, O1, Ftos_f);
345 __ bind(isString);
346 __ stop("string should be rewritten to fast_aldc");
347 __ ba_short(exit);
349 __ bind(notString);
350 // __ ldf(FloatRegisterImpl::S, O0, O1, Ftos_f);
351 __ push(ftos);
353 __ bind(exit);
354 }
356 // Fast path for caching oop constants.
357 // %%% We should use this to handle Class and String constants also.
358 // %%% It will simplify the ldc/primitive path considerably.
359 void TemplateTable::fast_aldc(bool wide) {
360 transition(vtos, atos);
362 int index_size = wide ? sizeof(u2) : sizeof(u1);
363 Label resolved;
365 // We are resolved if the resolved reference cache entry contains a
366 // non-null object (CallSite, etc.)
367 assert_different_registers(Otos_i, G3_scratch);
368 __ get_cache_index_at_bcp(Otos_i, G3_scratch, 1, index_size); // load index => G3_scratch
369 __ load_resolved_reference_at_index(Otos_i, G3_scratch);
370 __ tst(Otos_i);
371 __ br(Assembler::notEqual, false, Assembler::pt, resolved);
372 __ delayed()->set((int)bytecode(), O1);
374 address entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_ldc);
376 // first time invocation - must resolve first
377 __ call_VM(Otos_i, entry, O1);
378 __ bind(resolved);
379 __ verify_oop(Otos_i);
380 }
383 void TemplateTable::ldc2_w() {
384 transition(vtos, vtos);
385 Label Long, exit;
387 __ get_2_byte_integer_at_bcp(1, G3_scratch, O1, InterpreterMacroAssembler::Unsigned);
388 __ get_cpool_and_tags(O0, O2);
390 const int base_offset = ConstantPool::header_size() * wordSize;
391 const int tags_offset = Array<u1>::base_offset_in_bytes();
392 // get type from tags
393 __ add(O2, tags_offset, O2);
394 __ ldub(O2, O1, O2);
396 __ sll(O1, LogBytesPerWord, O1);
397 __ add(O0, O1, G3_scratch);
399 __ cmp_and_brx_short(O2, JVM_CONSTANT_Double, Assembler::notEqual, Assembler::pt, Long);
400 // A double can be placed at word-aligned locations in the constant pool.
401 // Check out Conversions.java for an example.
402 // Also ConstantPool::header_size() is 20, which makes it very difficult
403 // to double-align double on the constant pool. SG, 11/7/97
404 #ifdef _LP64
405 __ ldf(FloatRegisterImpl::D, G3_scratch, base_offset, Ftos_d);
406 #else
407 FloatRegister f = Ftos_d;
408 __ ldf(FloatRegisterImpl::S, G3_scratch, base_offset, f);
409 __ ldf(FloatRegisterImpl::S, G3_scratch, base_offset + sizeof(jdouble)/2,
410 f->successor());
411 #endif
412 __ push(dtos);
413 __ ba_short(exit);
415 __ bind(Long);
416 #ifdef _LP64
417 __ ldx(G3_scratch, base_offset, Otos_l);
418 #else
419 __ ld(G3_scratch, base_offset, Otos_l);
420 __ ld(G3_scratch, base_offset + sizeof(jlong)/2, Otos_l->successor());
421 #endif
422 __ push(ltos);
424 __ bind(exit);
425 }
428 void TemplateTable::locals_index(Register reg, int offset) {
429 __ ldub( at_bcp(offset), reg );
430 }
433 void TemplateTable::locals_index_wide(Register reg) {
434 // offset is 2, not 1, because Lbcp points to wide prefix code
435 __ get_2_byte_integer_at_bcp(2, G4_scratch, reg, InterpreterMacroAssembler::Unsigned);
436 }
438 void TemplateTable::iload() {
439 transition(vtos, itos);
440 // Rewrite iload,iload pair into fast_iload2
441 // iload,caload pair into fast_icaload
442 if (RewriteFrequentPairs) {
443 Label rewrite, done;
445 // get next byte
446 __ ldub(at_bcp(Bytecodes::length_for(Bytecodes::_iload)), G3_scratch);
448 // if _iload, wait to rewrite to iload2. We only want to rewrite the
449 // last two iloads in a pair. Comparing against fast_iload means that
450 // the next bytecode is neither an iload or a caload, and therefore
451 // an iload pair.
452 __ cmp_and_br_short(G3_scratch, (int)Bytecodes::_iload, Assembler::equal, Assembler::pn, done);
454 __ cmp(G3_scratch, (int)Bytecodes::_fast_iload);
455 __ br(Assembler::equal, false, Assembler::pn, rewrite);
456 __ delayed()->set(Bytecodes::_fast_iload2, G4_scratch);
458 __ cmp(G3_scratch, (int)Bytecodes::_caload);
459 __ br(Assembler::equal, false, Assembler::pn, rewrite);
460 __ delayed()->set(Bytecodes::_fast_icaload, G4_scratch);
462 __ set(Bytecodes::_fast_iload, G4_scratch); // don't check again
463 // rewrite
464 // G4_scratch: fast bytecode
465 __ bind(rewrite);
466 patch_bytecode(Bytecodes::_iload, G4_scratch, G3_scratch, false);
467 __ bind(done);
468 }
470 // Get the local value into tos
471 locals_index(G3_scratch);
472 __ access_local_int( G3_scratch, Otos_i );
473 }
475 void TemplateTable::fast_iload2() {
476 transition(vtos, itos);
477 locals_index(G3_scratch);
478 __ access_local_int( G3_scratch, Otos_i );
479 __ push_i();
480 locals_index(G3_scratch, 3); // get next bytecode's local index.
481 __ access_local_int( G3_scratch, Otos_i );
482 }
484 void TemplateTable::fast_iload() {
485 transition(vtos, itos);
486 locals_index(G3_scratch);
487 __ access_local_int( G3_scratch, Otos_i );
488 }
490 void TemplateTable::lload() {
491 transition(vtos, ltos);
492 locals_index(G3_scratch);
493 __ access_local_long( G3_scratch, Otos_l );
494 }
497 void TemplateTable::fload() {
498 transition(vtos, ftos);
499 locals_index(G3_scratch);
500 __ access_local_float( G3_scratch, Ftos_f );
501 }
504 void TemplateTable::dload() {
505 transition(vtos, dtos);
506 locals_index(G3_scratch);
507 __ access_local_double( G3_scratch, Ftos_d );
508 }
511 void TemplateTable::aload() {
512 transition(vtos, atos);
513 locals_index(G3_scratch);
514 __ access_local_ptr( G3_scratch, Otos_i);
515 }
518 void TemplateTable::wide_iload() {
519 transition(vtos, itos);
520 locals_index_wide(G3_scratch);
521 __ access_local_int( G3_scratch, Otos_i );
522 }
525 void TemplateTable::wide_lload() {
526 transition(vtos, ltos);
527 locals_index_wide(G3_scratch);
528 __ access_local_long( G3_scratch, Otos_l );
529 }
532 void TemplateTable::wide_fload() {
533 transition(vtos, ftos);
534 locals_index_wide(G3_scratch);
535 __ access_local_float( G3_scratch, Ftos_f );
536 }
539 void TemplateTable::wide_dload() {
540 transition(vtos, dtos);
541 locals_index_wide(G3_scratch);
542 __ access_local_double( G3_scratch, Ftos_d );
543 }
546 void TemplateTable::wide_aload() {
547 transition(vtos, atos);
548 locals_index_wide(G3_scratch);
549 __ access_local_ptr( G3_scratch, Otos_i );
550 __ verify_oop(Otos_i);
551 }
554 void TemplateTable::iaload() {
555 transition(itos, itos);
556 // Otos_i: index
557 // tos: array
558 __ index_check(O2, Otos_i, LogBytesPerInt, G3_scratch, O3);
559 __ ld(O3, arrayOopDesc::base_offset_in_bytes(T_INT), Otos_i);
560 }
563 void TemplateTable::laload() {
564 transition(itos, ltos);
565 // Otos_i: index
566 // O2: array
567 __ index_check(O2, Otos_i, LogBytesPerLong, G3_scratch, O3);
568 __ ld_long(O3, arrayOopDesc::base_offset_in_bytes(T_LONG), Otos_l);
569 }
572 void TemplateTable::faload() {
573 transition(itos, ftos);
574 // Otos_i: index
575 // O2: array
576 __ index_check(O2, Otos_i, LogBytesPerInt, G3_scratch, O3);
577 __ ldf(FloatRegisterImpl::S, O3, arrayOopDesc::base_offset_in_bytes(T_FLOAT), Ftos_f);
578 }
581 void TemplateTable::daload() {
582 transition(itos, dtos);
583 // Otos_i: index
584 // O2: array
585 __ index_check(O2, Otos_i, LogBytesPerLong, G3_scratch, O3);
586 __ ldf(FloatRegisterImpl::D, O3, arrayOopDesc::base_offset_in_bytes(T_DOUBLE), Ftos_d);
587 }
590 void TemplateTable::aaload() {
591 transition(itos, atos);
592 // Otos_i: index
593 // tos: array
594 __ index_check(O2, Otos_i, UseCompressedOops ? 2 : LogBytesPerWord, G3_scratch, O3);
595 __ load_heap_oop(O3, arrayOopDesc::base_offset_in_bytes(T_OBJECT), Otos_i);
596 __ verify_oop(Otos_i);
597 }
600 void TemplateTable::baload() {
601 transition(itos, itos);
602 // Otos_i: index
603 // tos: array
604 __ index_check(O2, Otos_i, 0, G3_scratch, O3);
605 __ ldsb(O3, arrayOopDesc::base_offset_in_bytes(T_BYTE), Otos_i);
606 }
609 void TemplateTable::caload() {
610 transition(itos, itos);
611 // Otos_i: index
612 // tos: array
613 __ index_check(O2, Otos_i, LogBytesPerShort, G3_scratch, O3);
614 __ lduh(O3, arrayOopDesc::base_offset_in_bytes(T_CHAR), Otos_i);
615 }
617 void TemplateTable::fast_icaload() {
618 transition(vtos, itos);
619 // Otos_i: index
620 // tos: array
621 locals_index(G3_scratch);
622 __ access_local_int( G3_scratch, Otos_i );
623 __ index_check(O2, Otos_i, LogBytesPerShort, G3_scratch, O3);
624 __ lduh(O3, arrayOopDesc::base_offset_in_bytes(T_CHAR), Otos_i);
625 }
628 void TemplateTable::saload() {
629 transition(itos, itos);
630 // Otos_i: index
631 // tos: array
632 __ index_check(O2, Otos_i, LogBytesPerShort, G3_scratch, O3);
633 __ ldsh(O3, arrayOopDesc::base_offset_in_bytes(T_SHORT), Otos_i);
634 }
637 void TemplateTable::iload(int n) {
638 transition(vtos, itos);
639 __ ld( Llocals, Interpreter::local_offset_in_bytes(n), Otos_i );
640 }
643 void TemplateTable::lload(int n) {
644 transition(vtos, ltos);
645 assert(n+1 < Argument::n_register_parameters, "would need more code");
646 __ load_unaligned_long(Llocals, Interpreter::local_offset_in_bytes(n+1), Otos_l);
647 }
650 void TemplateTable::fload(int n) {
651 transition(vtos, ftos);
652 assert(n < Argument::n_register_parameters, "would need more code");
653 __ ldf( FloatRegisterImpl::S, Llocals, Interpreter::local_offset_in_bytes(n), Ftos_f );
654 }
657 void TemplateTable::dload(int n) {
658 transition(vtos, dtos);
659 FloatRegister dst = Ftos_d;
660 __ load_unaligned_double(Llocals, Interpreter::local_offset_in_bytes(n+1), dst);
661 }
664 void TemplateTable::aload(int n) {
665 transition(vtos, atos);
666 __ ld_ptr( Llocals, Interpreter::local_offset_in_bytes(n), Otos_i );
667 }
670 void TemplateTable::aload_0() {
671 transition(vtos, atos);
673 // According to bytecode histograms, the pairs:
674 //
675 // _aload_0, _fast_igetfield (itos)
676 // _aload_0, _fast_agetfield (atos)
677 // _aload_0, _fast_fgetfield (ftos)
678 //
679 // occur frequently. If RewriteFrequentPairs is set, the (slow) _aload_0
680 // bytecode checks the next bytecode and then rewrites the current
681 // bytecode into a pair bytecode; otherwise it rewrites the current
682 // bytecode into _fast_aload_0 that doesn't do the pair check anymore.
683 //
684 if (RewriteFrequentPairs) {
685 Label rewrite, done;
687 // get next byte
688 __ ldub(at_bcp(Bytecodes::length_for(Bytecodes::_aload_0)), G3_scratch);
690 // do actual aload_0
691 aload(0);
693 // if _getfield then wait with rewrite
694 __ cmp_and_br_short(G3_scratch, (int)Bytecodes::_getfield, Assembler::equal, Assembler::pn, done);
696 // if _igetfield then rewrite to _fast_iaccess_0
697 assert(Bytecodes::java_code(Bytecodes::_fast_iaccess_0) == Bytecodes::_aload_0, "adjust fast bytecode def");
698 __ cmp(G3_scratch, (int)Bytecodes::_fast_igetfield);
699 __ br(Assembler::equal, false, Assembler::pn, rewrite);
700 __ delayed()->set(Bytecodes::_fast_iaccess_0, G4_scratch);
702 // if _agetfield then rewrite to _fast_aaccess_0
703 assert(Bytecodes::java_code(Bytecodes::_fast_aaccess_0) == Bytecodes::_aload_0, "adjust fast bytecode def");
704 __ cmp(G3_scratch, (int)Bytecodes::_fast_agetfield);
705 __ br(Assembler::equal, false, Assembler::pn, rewrite);
706 __ delayed()->set(Bytecodes::_fast_aaccess_0, G4_scratch);
708 // if _fgetfield then rewrite to _fast_faccess_0
709 assert(Bytecodes::java_code(Bytecodes::_fast_faccess_0) == Bytecodes::_aload_0, "adjust fast bytecode def");
710 __ cmp(G3_scratch, (int)Bytecodes::_fast_fgetfield);
711 __ br(Assembler::equal, false, Assembler::pn, rewrite);
712 __ delayed()->set(Bytecodes::_fast_faccess_0, G4_scratch);
714 // else rewrite to _fast_aload0
715 assert(Bytecodes::java_code(Bytecodes::_fast_aload_0) == Bytecodes::_aload_0, "adjust fast bytecode def");
716 __ set(Bytecodes::_fast_aload_0, G4_scratch);
718 // rewrite
719 // G4_scratch: fast bytecode
720 __ bind(rewrite);
721 patch_bytecode(Bytecodes::_aload_0, G4_scratch, G3_scratch, false);
722 __ bind(done);
723 } else {
724 aload(0);
725 }
726 }
729 void TemplateTable::istore() {
730 transition(itos, vtos);
731 locals_index(G3_scratch);
732 __ store_local_int( G3_scratch, Otos_i );
733 }
736 void TemplateTable::lstore() {
737 transition(ltos, vtos);
738 locals_index(G3_scratch);
739 __ store_local_long( G3_scratch, Otos_l );
740 }
743 void TemplateTable::fstore() {
744 transition(ftos, vtos);
745 locals_index(G3_scratch);
746 __ store_local_float( G3_scratch, Ftos_f );
747 }
750 void TemplateTable::dstore() {
751 transition(dtos, vtos);
752 locals_index(G3_scratch);
753 __ store_local_double( G3_scratch, Ftos_d );
754 }
757 void TemplateTable::astore() {
758 transition(vtos, vtos);
759 __ load_ptr(0, Otos_i);
760 __ inc(Lesp, Interpreter::stackElementSize);
761 __ verify_oop_or_return_address(Otos_i, G3_scratch);
762 locals_index(G3_scratch);
763 __ store_local_ptr(G3_scratch, Otos_i);
764 }
767 void TemplateTable::wide_istore() {
768 transition(vtos, vtos);
769 __ pop_i();
770 locals_index_wide(G3_scratch);
771 __ store_local_int( G3_scratch, Otos_i );
772 }
775 void TemplateTable::wide_lstore() {
776 transition(vtos, vtos);
777 __ pop_l();
778 locals_index_wide(G3_scratch);
779 __ store_local_long( G3_scratch, Otos_l );
780 }
783 void TemplateTable::wide_fstore() {
784 transition(vtos, vtos);
785 __ pop_f();
786 locals_index_wide(G3_scratch);
787 __ store_local_float( G3_scratch, Ftos_f );
788 }
791 void TemplateTable::wide_dstore() {
792 transition(vtos, vtos);
793 __ pop_d();
794 locals_index_wide(G3_scratch);
795 __ store_local_double( G3_scratch, Ftos_d );
796 }
799 void TemplateTable::wide_astore() {
800 transition(vtos, vtos);
801 __ load_ptr(0, Otos_i);
802 __ inc(Lesp, Interpreter::stackElementSize);
803 __ verify_oop_or_return_address(Otos_i, G3_scratch);
804 locals_index_wide(G3_scratch);
805 __ store_local_ptr(G3_scratch, Otos_i);
806 }
809 void TemplateTable::iastore() {
810 transition(itos, vtos);
811 __ pop_i(O2); // index
812 // Otos_i: val
813 // O3: array
814 __ index_check(O3, O2, LogBytesPerInt, G3_scratch, O2);
815 __ st(Otos_i, O2, arrayOopDesc::base_offset_in_bytes(T_INT));
816 }
819 void TemplateTable::lastore() {
820 transition(ltos, vtos);
821 __ pop_i(O2); // index
822 // Otos_l: val
823 // O3: array
824 __ index_check(O3, O2, LogBytesPerLong, G3_scratch, O2);
825 __ st_long(Otos_l, O2, arrayOopDesc::base_offset_in_bytes(T_LONG));
826 }
829 void TemplateTable::fastore() {
830 transition(ftos, vtos);
831 __ pop_i(O2); // index
832 // Ftos_f: val
833 // O3: array
834 __ index_check(O3, O2, LogBytesPerInt, G3_scratch, O2);
835 __ stf(FloatRegisterImpl::S, Ftos_f, O2, arrayOopDesc::base_offset_in_bytes(T_FLOAT));
836 }
839 void TemplateTable::dastore() {
840 transition(dtos, vtos);
841 __ pop_i(O2); // index
842 // Fos_d: val
843 // O3: array
844 __ index_check(O3, O2, LogBytesPerLong, G3_scratch, O2);
845 __ stf(FloatRegisterImpl::D, Ftos_d, O2, arrayOopDesc::base_offset_in_bytes(T_DOUBLE));
846 }
849 void TemplateTable::aastore() {
850 Label store_ok, is_null, done;
851 transition(vtos, vtos);
852 __ ld_ptr(Lesp, Interpreter::expr_offset_in_bytes(0), Otos_i);
853 __ ld(Lesp, Interpreter::expr_offset_in_bytes(1), O2); // get index
854 __ ld_ptr(Lesp, Interpreter::expr_offset_in_bytes(2), O3); // get array
855 // Otos_i: val
856 // O2: index
857 // O3: array
858 __ verify_oop(Otos_i);
859 __ index_check_without_pop(O3, O2, UseCompressedOops ? 2 : LogBytesPerWord, G3_scratch, O1);
861 // do array store check - check for NULL value first
862 __ br_null_short( Otos_i, Assembler::pn, is_null );
864 __ load_klass(O3, O4); // get array klass
865 __ load_klass(Otos_i, O5); // get value klass
867 // do fast instanceof cache test
869 __ ld_ptr(O4, in_bytes(ObjArrayKlass::element_klass_offset()), O4);
871 assert(Otos_i == O0, "just checking");
873 // Otos_i: value
874 // O1: addr - offset
875 // O2: index
876 // O3: array
877 // O4: array element klass
878 // O5: value klass
880 // Address element(O1, 0, arrayOopDesc::base_offset_in_bytes(T_OBJECT));
882 // Generate a fast subtype check. Branch to store_ok if no
883 // failure. Throw if failure.
884 __ gen_subtype_check( O5, O4, G3_scratch, G4_scratch, G1_scratch, store_ok );
886 // Not a subtype; so must throw exception
887 __ throw_if_not_x( Assembler::never, Interpreter::_throw_ArrayStoreException_entry, G3_scratch );
889 // Store is OK.
890 __ bind(store_ok);
891 do_oop_store(_masm, O1, noreg, arrayOopDesc::base_offset_in_bytes(T_OBJECT), Otos_i, G3_scratch, _bs->kind(), true);
893 __ ba(done);
894 __ delayed()->inc(Lesp, 3* Interpreter::stackElementSize); // adj sp (pops array, index and value)
896 __ bind(is_null);
897 do_oop_store(_masm, O1, noreg, arrayOopDesc::base_offset_in_bytes(T_OBJECT), G0, G4_scratch, _bs->kind(), true);
899 __ profile_null_seen(G3_scratch);
900 __ inc(Lesp, 3* Interpreter::stackElementSize); // adj sp (pops array, index and value)
901 __ bind(done);
902 }
905 void TemplateTable::bastore() {
906 transition(itos, vtos);
907 __ pop_i(O2); // index
908 // Otos_i: val
909 // O3: array
910 __ index_check(O3, O2, 0, G3_scratch, O2);
911 __ stb(Otos_i, O2, arrayOopDesc::base_offset_in_bytes(T_BYTE));
912 }
915 void TemplateTable::castore() {
916 transition(itos, vtos);
917 __ pop_i(O2); // index
918 // Otos_i: val
919 // O3: array
920 __ index_check(O3, O2, LogBytesPerShort, G3_scratch, O2);
921 __ sth(Otos_i, O2, arrayOopDesc::base_offset_in_bytes(T_CHAR));
922 }
925 void TemplateTable::sastore() {
926 // %%%%% Factor across platform
927 castore();
928 }
931 void TemplateTable::istore(int n) {
932 transition(itos, vtos);
933 __ st(Otos_i, Llocals, Interpreter::local_offset_in_bytes(n));
934 }
937 void TemplateTable::lstore(int n) {
938 transition(ltos, vtos);
939 assert(n+1 < Argument::n_register_parameters, "only handle register cases");
940 __ store_unaligned_long(Otos_l, Llocals, Interpreter::local_offset_in_bytes(n+1));
942 }
945 void TemplateTable::fstore(int n) {
946 transition(ftos, vtos);
947 assert(n < Argument::n_register_parameters, "only handle register cases");
948 __ stf(FloatRegisterImpl::S, Ftos_f, Llocals, Interpreter::local_offset_in_bytes(n));
949 }
952 void TemplateTable::dstore(int n) {
953 transition(dtos, vtos);
954 FloatRegister src = Ftos_d;
955 __ store_unaligned_double(src, Llocals, Interpreter::local_offset_in_bytes(n+1));
956 }
959 void TemplateTable::astore(int n) {
960 transition(vtos, vtos);
961 __ load_ptr(0, Otos_i);
962 __ inc(Lesp, Interpreter::stackElementSize);
963 __ verify_oop_or_return_address(Otos_i, G3_scratch);
964 __ store_local_ptr(n, Otos_i);
965 }
968 void TemplateTable::pop() {
969 transition(vtos, vtos);
970 __ inc(Lesp, Interpreter::stackElementSize);
971 }
974 void TemplateTable::pop2() {
975 transition(vtos, vtos);
976 __ inc(Lesp, 2 * Interpreter::stackElementSize);
977 }
980 void TemplateTable::dup() {
981 transition(vtos, vtos);
982 // stack: ..., a
983 // load a and tag
984 __ load_ptr(0, Otos_i);
985 __ push_ptr(Otos_i);
986 // stack: ..., a, a
987 }
990 void TemplateTable::dup_x1() {
991 transition(vtos, vtos);
992 // stack: ..., a, b
993 __ load_ptr( 1, G3_scratch); // get a
994 __ load_ptr( 0, Otos_l1); // get b
995 __ store_ptr(1, Otos_l1); // put b
996 __ store_ptr(0, G3_scratch); // put a - like swap
997 __ push_ptr(Otos_l1); // push b
998 // stack: ..., b, a, b
999 }
1002 void TemplateTable::dup_x2() {
1003 transition(vtos, vtos);
1004 // stack: ..., a, b, c
1005 // get c and push on stack, reuse registers
1006 __ load_ptr( 0, G3_scratch); // get c
1007 __ push_ptr(G3_scratch); // push c with tag
1008 // stack: ..., a, b, c, c (c in reg) (Lesp - 4)
1009 // (stack offsets n+1 now)
1010 __ load_ptr( 3, Otos_l1); // get a
1011 __ store_ptr(3, G3_scratch); // put c at 3
1012 // stack: ..., c, b, c, c (a in reg)
1013 __ load_ptr( 2, G3_scratch); // get b
1014 __ store_ptr(2, Otos_l1); // put a at 2
1015 // stack: ..., c, a, c, c (b in reg)
1016 __ store_ptr(1, G3_scratch); // put b at 1
1017 // stack: ..., c, a, b, c
1018 }
1021 void TemplateTable::dup2() {
1022 transition(vtos, vtos);
1023 __ load_ptr(1, G3_scratch); // get a
1024 __ load_ptr(0, Otos_l1); // get b
1025 __ push_ptr(G3_scratch); // push a
1026 __ push_ptr(Otos_l1); // push b
1027 // stack: ..., a, b, a, b
1028 }
1031 void TemplateTable::dup2_x1() {
1032 transition(vtos, vtos);
1033 // stack: ..., a, b, c
1034 __ load_ptr( 1, Lscratch); // get b
1035 __ load_ptr( 2, Otos_l1); // get a
1036 __ store_ptr(2, Lscratch); // put b at a
1037 // stack: ..., b, b, c
1038 __ load_ptr( 0, G3_scratch); // get c
1039 __ store_ptr(1, G3_scratch); // put c at b
1040 // stack: ..., b, c, c
1041 __ store_ptr(0, Otos_l1); // put a at c
1042 // stack: ..., b, c, a
1043 __ push_ptr(Lscratch); // push b
1044 __ push_ptr(G3_scratch); // push c
1045 // stack: ..., b, c, a, b, c
1046 }
1049 // The spec says that these types can be a mixture of category 1 (1 word)
1050 // types and/or category 2 types (long and doubles)
1051 void TemplateTable::dup2_x2() {
1052 transition(vtos, vtos);
1053 // stack: ..., a, b, c, d
1054 __ load_ptr( 1, Lscratch); // get c
1055 __ load_ptr( 3, Otos_l1); // get a
1056 __ store_ptr(3, Lscratch); // put c at 3
1057 __ store_ptr(1, Otos_l1); // put a at 1
1058 // stack: ..., c, b, a, d
1059 __ load_ptr( 2, G3_scratch); // get b
1060 __ load_ptr( 0, Otos_l1); // get d
1061 __ store_ptr(0, G3_scratch); // put b at 0
1062 __ store_ptr(2, Otos_l1); // put d at 2
1063 // stack: ..., c, d, a, b
1064 __ push_ptr(Lscratch); // push c
1065 __ push_ptr(Otos_l1); // push d
1066 // stack: ..., c, d, a, b, c, d
1067 }
1070 void TemplateTable::swap() {
1071 transition(vtos, vtos);
1072 // stack: ..., a, b
1073 __ load_ptr( 1, G3_scratch); // get a
1074 __ load_ptr( 0, Otos_l1); // get b
1075 __ store_ptr(0, G3_scratch); // put b
1076 __ store_ptr(1, Otos_l1); // put a
1077 // stack: ..., b, a
1078 }
1081 void TemplateTable::iop2(Operation op) {
1082 transition(itos, itos);
1083 __ pop_i(O1);
1084 switch (op) {
1085 case add: __ add(O1, Otos_i, Otos_i); break;
1086 case sub: __ sub(O1, Otos_i, Otos_i); break;
1087 // %%%%% Mul may not exist: better to call .mul?
1088 case mul: __ smul(O1, Otos_i, Otos_i); break;
1089 case _and: __ and3(O1, Otos_i, Otos_i); break;
1090 case _or: __ or3(O1, Otos_i, Otos_i); break;
1091 case _xor: __ xor3(O1, Otos_i, Otos_i); break;
1092 case shl: __ sll(O1, Otos_i, Otos_i); break;
1093 case shr: __ sra(O1, Otos_i, Otos_i); break;
1094 case ushr: __ srl(O1, Otos_i, Otos_i); break;
1095 default: ShouldNotReachHere();
1096 }
1097 }
1100 void TemplateTable::lop2(Operation op) {
1101 transition(ltos, ltos);
1102 __ pop_l(O2);
1103 switch (op) {
1104 #ifdef _LP64
1105 case add: __ add(O2, Otos_l, Otos_l); break;
1106 case sub: __ sub(O2, Otos_l, Otos_l); break;
1107 case _and: __ and3(O2, Otos_l, Otos_l); break;
1108 case _or: __ or3(O2, Otos_l, Otos_l); break;
1109 case _xor: __ xor3(O2, Otos_l, Otos_l); break;
1110 #else
1111 case add: __ addcc(O3, Otos_l2, Otos_l2); __ addc(O2, Otos_l1, Otos_l1); break;
1112 case sub: __ subcc(O3, Otos_l2, Otos_l2); __ subc(O2, Otos_l1, Otos_l1); break;
1113 case _and: __ and3(O3, Otos_l2, Otos_l2); __ and3(O2, Otos_l1, Otos_l1); break;
1114 case _or: __ or3(O3, Otos_l2, Otos_l2); __ or3(O2, Otos_l1, Otos_l1); break;
1115 case _xor: __ xor3(O3, Otos_l2, Otos_l2); __ xor3(O2, Otos_l1, Otos_l1); break;
1116 #endif
1117 default: ShouldNotReachHere();
1118 }
1119 }
1122 void TemplateTable::idiv() {
1123 // %%%%% Later: ForSPARC/V7 call .sdiv library routine,
1124 // %%%%% Use ldsw...sdivx on pure V9 ABI. 64 bit safe.
1126 transition(itos, itos);
1127 __ pop_i(O1); // get 1st op
1129 // Y contains upper 32 bits of result, set it to 0 or all ones
1130 __ wry(G0);
1131 __ mov(~0, G3_scratch);
1133 __ tst(O1);
1134 Label neg;
1135 __ br(Assembler::negative, true, Assembler::pn, neg);
1136 __ delayed()->wry(G3_scratch);
1137 __ bind(neg);
1139 Label ok;
1140 __ tst(Otos_i);
1141 __ throw_if_not_icc( Assembler::notZero, Interpreter::_throw_ArithmeticException_entry, G3_scratch );
1143 const int min_int = 0x80000000;
1144 Label regular;
1145 __ cmp(Otos_i, -1);
1146 __ br(Assembler::notEqual, false, Assembler::pt, regular);
1147 #ifdef _LP64
1148 // Don't put set in delay slot
1149 // Set will turn into multiple instructions in 64 bit mode
1150 __ delayed()->nop();
1151 __ set(min_int, G4_scratch);
1152 #else
1153 __ delayed()->set(min_int, G4_scratch);
1154 #endif
1155 Label done;
1156 __ cmp(O1, G4_scratch);
1157 __ br(Assembler::equal, true, Assembler::pt, done);
1158 __ delayed()->mov(O1, Otos_i); // (mov only executed if branch taken)
1160 __ bind(regular);
1161 __ sdiv(O1, Otos_i, Otos_i); // note: irem uses O1 after this instruction!
1162 __ bind(done);
1163 }
1166 void TemplateTable::irem() {
1167 transition(itos, itos);
1168 __ mov(Otos_i, O2); // save divisor
1169 idiv(); // %%%% Hack: exploits fact that idiv leaves dividend in O1
1170 __ smul(Otos_i, O2, Otos_i);
1171 __ sub(O1, Otos_i, Otos_i);
1172 }
1175 void TemplateTable::lmul() {
1176 transition(ltos, ltos);
1177 __ pop_l(O2);
1178 #ifdef _LP64
1179 __ mulx(Otos_l, O2, Otos_l);
1180 #else
1181 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::lmul));
1182 #endif
1184 }
1187 void TemplateTable::ldiv() {
1188 transition(ltos, ltos);
1190 // check for zero
1191 __ pop_l(O2);
1192 #ifdef _LP64
1193 __ tst(Otos_l);
1194 __ throw_if_not_xcc( Assembler::notZero, Interpreter::_throw_ArithmeticException_entry, G3_scratch);
1195 __ sdivx(O2, Otos_l, Otos_l);
1196 #else
1197 __ orcc(Otos_l1, Otos_l2, G0);
1198 __ throw_if_not_icc( Assembler::notZero, Interpreter::_throw_ArithmeticException_entry, G3_scratch);
1199 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::ldiv));
1200 #endif
1201 }
1204 void TemplateTable::lrem() {
1205 transition(ltos, ltos);
1207 // check for zero
1208 __ pop_l(O2);
1209 #ifdef _LP64
1210 __ tst(Otos_l);
1211 __ throw_if_not_xcc( Assembler::notZero, Interpreter::_throw_ArithmeticException_entry, G3_scratch);
1212 __ sdivx(O2, Otos_l, Otos_l2);
1213 __ mulx (Otos_l2, Otos_l, Otos_l2);
1214 __ sub (O2, Otos_l2, Otos_l);
1215 #else
1216 __ orcc(Otos_l1, Otos_l2, G0);
1217 __ throw_if_not_icc(Assembler::notZero, Interpreter::_throw_ArithmeticException_entry, G3_scratch);
1218 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::lrem));
1219 #endif
1220 }
1223 void TemplateTable::lshl() {
1224 transition(itos, ltos); // %%%% could optimize, fill delay slot or opt for ultra
1226 __ pop_l(O2); // shift value in O2, O3
1227 #ifdef _LP64
1228 __ sllx(O2, Otos_i, Otos_l);
1229 #else
1230 __ lshl(O2, O3, Otos_i, Otos_l1, Otos_l2, O4);
1231 #endif
1232 }
1235 void TemplateTable::lshr() {
1236 transition(itos, ltos); // %%%% see lshl comment
1238 __ pop_l(O2); // shift value in O2, O3
1239 #ifdef _LP64
1240 __ srax(O2, Otos_i, Otos_l);
1241 #else
1242 __ lshr(O2, O3, Otos_i, Otos_l1, Otos_l2, O4);
1243 #endif
1244 }
1248 void TemplateTable::lushr() {
1249 transition(itos, ltos); // %%%% see lshl comment
1251 __ pop_l(O2); // shift value in O2, O3
1252 #ifdef _LP64
1253 __ srlx(O2, Otos_i, Otos_l);
1254 #else
1255 __ lushr(O2, O3, Otos_i, Otos_l1, Otos_l2, O4);
1256 #endif
1257 }
1260 void TemplateTable::fop2(Operation op) {
1261 transition(ftos, ftos);
1262 switch (op) {
1263 case add: __ pop_f(F4); __ fadd(FloatRegisterImpl::S, F4, Ftos_f, Ftos_f); break;
1264 case sub: __ pop_f(F4); __ fsub(FloatRegisterImpl::S, F4, Ftos_f, Ftos_f); break;
1265 case mul: __ pop_f(F4); __ fmul(FloatRegisterImpl::S, F4, Ftos_f, Ftos_f); break;
1266 case div: __ pop_f(F4); __ fdiv(FloatRegisterImpl::S, F4, Ftos_f, Ftos_f); break;
1267 case rem:
1268 assert(Ftos_f == F0, "just checking");
1269 #ifdef _LP64
1270 // LP64 calling conventions use F1, F3 for passing 2 floats
1271 __ pop_f(F1);
1272 __ fmov(FloatRegisterImpl::S, Ftos_f, F3);
1273 #else
1274 __ pop_i(O0);
1275 __ stf(FloatRegisterImpl::S, Ftos_f, __ d_tmp);
1276 __ ld( __ d_tmp, O1 );
1277 #endif
1278 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::frem));
1279 assert( Ftos_f == F0, "fix this code" );
1280 break;
1282 default: ShouldNotReachHere();
1283 }
1284 }
1287 void TemplateTable::dop2(Operation op) {
1288 transition(dtos, dtos);
1289 switch (op) {
1290 case add: __ pop_d(F4); __ fadd(FloatRegisterImpl::D, F4, Ftos_d, Ftos_d); break;
1291 case sub: __ pop_d(F4); __ fsub(FloatRegisterImpl::D, F4, Ftos_d, Ftos_d); break;
1292 case mul: __ pop_d(F4); __ fmul(FloatRegisterImpl::D, F4, Ftos_d, Ftos_d); break;
1293 case div: __ pop_d(F4); __ fdiv(FloatRegisterImpl::D, F4, Ftos_d, Ftos_d); break;
1294 case rem:
1295 #ifdef _LP64
1296 // Pass arguments in D0, D2
1297 __ fmov(FloatRegisterImpl::D, Ftos_f, F2 );
1298 __ pop_d( F0 );
1299 #else
1300 // Pass arguments in O0O1, O2O3
1301 __ stf(FloatRegisterImpl::D, Ftos_f, __ d_tmp);
1302 __ ldd( __ d_tmp, O2 );
1303 __ pop_d(Ftos_f);
1304 __ stf(FloatRegisterImpl::D, Ftos_f, __ d_tmp);
1305 __ ldd( __ d_tmp, O0 );
1306 #endif
1307 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::drem));
1308 assert( Ftos_d == F0, "fix this code" );
1309 break;
1311 default: ShouldNotReachHere();
1312 }
1313 }
1316 void TemplateTable::ineg() {
1317 transition(itos, itos);
1318 __ neg(Otos_i);
1319 }
1322 void TemplateTable::lneg() {
1323 transition(ltos, ltos);
1324 #ifdef _LP64
1325 __ sub(G0, Otos_l, Otos_l);
1326 #else
1327 __ lneg(Otos_l1, Otos_l2);
1328 #endif
1329 }
1332 void TemplateTable::fneg() {
1333 transition(ftos, ftos);
1334 __ fneg(FloatRegisterImpl::S, Ftos_f);
1335 }
1338 void TemplateTable::dneg() {
1339 transition(dtos, dtos);
1340 // v8 has fnegd if source and dest are the same
1341 __ fneg(FloatRegisterImpl::D, Ftos_f);
1342 }
1345 void TemplateTable::iinc() {
1346 transition(vtos, vtos);
1347 locals_index(G3_scratch);
1348 __ ldsb(Lbcp, 2, O2); // load constant
1349 __ access_local_int(G3_scratch, Otos_i);
1350 __ add(Otos_i, O2, Otos_i);
1351 __ st(Otos_i, G3_scratch, 0); // access_local_int puts E.A. in G3_scratch
1352 }
1355 void TemplateTable::wide_iinc() {
1356 transition(vtos, vtos);
1357 locals_index_wide(G3_scratch);
1358 __ get_2_byte_integer_at_bcp( 4, O2, O3, InterpreterMacroAssembler::Signed);
1359 __ access_local_int(G3_scratch, Otos_i);
1360 __ add(Otos_i, O3, Otos_i);
1361 __ st(Otos_i, G3_scratch, 0); // access_local_int puts E.A. in G3_scratch
1362 }
1365 void TemplateTable::convert() {
1366 // %%%%% Factor this first part accross platforms
1367 #ifdef ASSERT
1368 TosState tos_in = ilgl;
1369 TosState tos_out = ilgl;
1370 switch (bytecode()) {
1371 case Bytecodes::_i2l: // fall through
1372 case Bytecodes::_i2f: // fall through
1373 case Bytecodes::_i2d: // fall through
1374 case Bytecodes::_i2b: // fall through
1375 case Bytecodes::_i2c: // fall through
1376 case Bytecodes::_i2s: tos_in = itos; break;
1377 case Bytecodes::_l2i: // fall through
1378 case Bytecodes::_l2f: // fall through
1379 case Bytecodes::_l2d: tos_in = ltos; break;
1380 case Bytecodes::_f2i: // fall through
1381 case Bytecodes::_f2l: // fall through
1382 case Bytecodes::_f2d: tos_in = ftos; break;
1383 case Bytecodes::_d2i: // fall through
1384 case Bytecodes::_d2l: // fall through
1385 case Bytecodes::_d2f: tos_in = dtos; break;
1386 default : ShouldNotReachHere();
1387 }
1388 switch (bytecode()) {
1389 case Bytecodes::_l2i: // fall through
1390 case Bytecodes::_f2i: // fall through
1391 case Bytecodes::_d2i: // fall through
1392 case Bytecodes::_i2b: // fall through
1393 case Bytecodes::_i2c: // fall through
1394 case Bytecodes::_i2s: tos_out = itos; break;
1395 case Bytecodes::_i2l: // fall through
1396 case Bytecodes::_f2l: // fall through
1397 case Bytecodes::_d2l: tos_out = ltos; break;
1398 case Bytecodes::_i2f: // fall through
1399 case Bytecodes::_l2f: // fall through
1400 case Bytecodes::_d2f: tos_out = ftos; break;
1401 case Bytecodes::_i2d: // fall through
1402 case Bytecodes::_l2d: // fall through
1403 case Bytecodes::_f2d: tos_out = dtos; break;
1404 default : ShouldNotReachHere();
1405 }
1406 transition(tos_in, tos_out);
1407 #endif
1410 // Conversion
1411 Label done;
1412 switch (bytecode()) {
1413 case Bytecodes::_i2l:
1414 #ifdef _LP64
1415 // Sign extend the 32 bits
1416 __ sra ( Otos_i, 0, Otos_l );
1417 #else
1418 __ addcc(Otos_i, 0, Otos_l2);
1419 __ br(Assembler::greaterEqual, true, Assembler::pt, done);
1420 __ delayed()->clr(Otos_l1);
1421 __ set(~0, Otos_l1);
1422 #endif
1423 break;
1425 case Bytecodes::_i2f:
1426 __ st(Otos_i, __ d_tmp );
1427 __ ldf(FloatRegisterImpl::S, __ d_tmp, F0);
1428 __ fitof(FloatRegisterImpl::S, F0, Ftos_f);
1429 break;
1431 case Bytecodes::_i2d:
1432 __ st(Otos_i, __ d_tmp);
1433 __ ldf(FloatRegisterImpl::S, __ d_tmp, F0);
1434 __ fitof(FloatRegisterImpl::D, F0, Ftos_f);
1435 break;
1437 case Bytecodes::_i2b:
1438 __ sll(Otos_i, 24, Otos_i);
1439 __ sra(Otos_i, 24, Otos_i);
1440 break;
1442 case Bytecodes::_i2c:
1443 __ sll(Otos_i, 16, Otos_i);
1444 __ srl(Otos_i, 16, Otos_i);
1445 break;
1447 case Bytecodes::_i2s:
1448 __ sll(Otos_i, 16, Otos_i);
1449 __ sra(Otos_i, 16, Otos_i);
1450 break;
1452 case Bytecodes::_l2i:
1453 #ifndef _LP64
1454 __ mov(Otos_l2, Otos_i);
1455 #else
1456 // Sign-extend into the high 32 bits
1457 __ sra(Otos_l, 0, Otos_i);
1458 #endif
1459 break;
1461 case Bytecodes::_l2f:
1462 case Bytecodes::_l2d:
1463 __ st_long(Otos_l, __ d_tmp);
1464 __ ldf(FloatRegisterImpl::D, __ d_tmp, Ftos_d);
1466 if (VM_Version::v9_instructions_work()) {
1467 if (bytecode() == Bytecodes::_l2f) {
1468 __ fxtof(FloatRegisterImpl::S, Ftos_d, Ftos_f);
1469 } else {
1470 __ fxtof(FloatRegisterImpl::D, Ftos_d, Ftos_d);
1471 }
1472 } else {
1473 __ call_VM_leaf(
1474 Lscratch,
1475 bytecode() == Bytecodes::_l2f
1476 ? CAST_FROM_FN_PTR(address, SharedRuntime::l2f)
1477 : CAST_FROM_FN_PTR(address, SharedRuntime::l2d)
1478 );
1479 }
1480 break;
1482 case Bytecodes::_f2i: {
1483 Label isNaN;
1484 // result must be 0 if value is NaN; test by comparing value to itself
1485 __ fcmp(FloatRegisterImpl::S, Assembler::fcc0, Ftos_f, Ftos_f);
1486 // According to the v8 manual, you have to have a non-fp instruction
1487 // between fcmp and fb.
1488 if (!VM_Version::v9_instructions_work()) {
1489 __ nop();
1490 }
1491 __ fb(Assembler::f_unordered, true, Assembler::pn, isNaN);
1492 __ delayed()->clr(Otos_i); // NaN
1493 __ ftoi(FloatRegisterImpl::S, Ftos_f, F30);
1494 __ stf(FloatRegisterImpl::S, F30, __ d_tmp);
1495 __ ld(__ d_tmp, Otos_i);
1496 __ bind(isNaN);
1497 }
1498 break;
1500 case Bytecodes::_f2l:
1501 // must uncache tos
1502 __ push_f();
1503 #ifdef _LP64
1504 __ pop_f(F1);
1505 #else
1506 __ pop_i(O0);
1507 #endif
1508 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::f2l));
1509 break;
1511 case Bytecodes::_f2d:
1512 __ ftof( FloatRegisterImpl::S, FloatRegisterImpl::D, Ftos_f, Ftos_f);
1513 break;
1515 case Bytecodes::_d2i:
1516 case Bytecodes::_d2l:
1517 // must uncache tos
1518 __ push_d();
1519 #ifdef _LP64
1520 // LP64 calling conventions pass first double arg in D0
1521 __ pop_d( Ftos_d );
1522 #else
1523 __ pop_i( O0 );
1524 __ pop_i( O1 );
1525 #endif
1526 __ call_VM_leaf(Lscratch,
1527 bytecode() == Bytecodes::_d2i
1528 ? CAST_FROM_FN_PTR(address, SharedRuntime::d2i)
1529 : CAST_FROM_FN_PTR(address, SharedRuntime::d2l));
1530 break;
1532 case Bytecodes::_d2f:
1533 if (VM_Version::v9_instructions_work()) {
1534 __ ftof( FloatRegisterImpl::D, FloatRegisterImpl::S, Ftos_d, Ftos_f);
1535 }
1536 else {
1537 // must uncache tos
1538 __ push_d();
1539 __ pop_i(O0);
1540 __ pop_i(O1);
1541 __ call_VM_leaf(Lscratch, CAST_FROM_FN_PTR(address, SharedRuntime::d2f));
1542 }
1543 break;
1545 default: ShouldNotReachHere();
1546 }
1547 __ bind(done);
1548 }
1551 void TemplateTable::lcmp() {
1552 transition(ltos, itos);
1554 #ifdef _LP64
1555 __ pop_l(O1); // pop off value 1, value 2 is in O0
1556 __ lcmp( O1, Otos_l, Otos_i );
1557 #else
1558 __ pop_l(O2); // cmp O2,3 to O0,1
1559 __ lcmp( O2, O3, Otos_l1, Otos_l2, Otos_i );
1560 #endif
1561 }
1564 void TemplateTable::float_cmp(bool is_float, int unordered_result) {
1566 if (is_float) __ pop_f(F2);
1567 else __ pop_d(F2);
1569 assert(Ftos_f == F0 && Ftos_d == F0, "alias checking:");
1571 __ float_cmp( is_float, unordered_result, F2, F0, Otos_i );
1572 }
1574 void TemplateTable::branch(bool is_jsr, bool is_wide) {
1575 // Note: on SPARC, we use InterpreterMacroAssembler::if_cmp also.
1576 __ verify_thread();
1578 const Register O2_bumped_count = O2;
1579 __ profile_taken_branch(G3_scratch, O2_bumped_count);
1581 // get (wide) offset to O1_disp
1582 const Register O1_disp = O1;
1583 if (is_wide) __ get_4_byte_integer_at_bcp( 1, G4_scratch, O1_disp, InterpreterMacroAssembler::set_CC);
1584 else __ get_2_byte_integer_at_bcp( 1, G4_scratch, O1_disp, InterpreterMacroAssembler::Signed, InterpreterMacroAssembler::set_CC);
1586 // Handle all the JSR stuff here, then exit.
1587 // It's much shorter and cleaner than intermingling with the
1588 // non-JSR normal-branch stuff occurring below.
1589 if( is_jsr ) {
1590 // compute return address as bci in Otos_i
1591 __ ld_ptr(Lmethod, Method::const_offset(), G3_scratch);
1592 __ sub(Lbcp, G3_scratch, G3_scratch);
1593 __ sub(G3_scratch, in_bytes(ConstMethod::codes_offset()) - (is_wide ? 5 : 3), Otos_i);
1595 // Bump Lbcp to target of JSR
1596 __ add(Lbcp, O1_disp, Lbcp);
1597 // Push returnAddress for "ret" on stack
1598 __ push_ptr(Otos_i);
1599 // And away we go!
1600 __ dispatch_next(vtos);
1601 return;
1602 }
1604 // Normal (non-jsr) branch handling
1606 // Save the current Lbcp
1607 const Register O0_cur_bcp = O0;
1608 __ mov( Lbcp, O0_cur_bcp );
1611 bool increment_invocation_counter_for_backward_branches = UseCompiler && UseLoopCounter;
1612 if ( increment_invocation_counter_for_backward_branches ) {
1613 Label Lforward;
1614 // check branch direction
1615 __ br( Assembler::positive, false, Assembler::pn, Lforward );
1616 // Bump bytecode pointer by displacement (take the branch)
1617 __ delayed()->add( O1_disp, Lbcp, Lbcp ); // add to bc addr
1619 if (TieredCompilation) {
1620 Label Lno_mdo, Loverflow;
1621 int increment = InvocationCounter::count_increment;
1622 int mask = ((1 << Tier0BackedgeNotifyFreqLog) - 1) << InvocationCounter::count_shift;
1623 if (ProfileInterpreter) {
1624 // If no method data exists, go to profile_continue.
1625 __ ld_ptr(Lmethod, Method::method_data_offset(), G4_scratch);
1626 __ br_null_short(G4_scratch, Assembler::pn, Lno_mdo);
1628 // Increment backedge counter in the MDO
1629 Address mdo_backedge_counter(G4_scratch, in_bytes(MethodData::backedge_counter_offset()) +
1630 in_bytes(InvocationCounter::counter_offset()));
1631 __ increment_mask_and_jump(mdo_backedge_counter, increment, mask, G3_scratch, Lscratch,
1632 Assembler::notZero, &Lforward);
1633 __ ba_short(Loverflow);
1634 }
1636 // If there's no MDO, increment counter in Method*
1637 __ bind(Lno_mdo);
1638 Address backedge_counter(Lmethod, in_bytes(Method::backedge_counter_offset()) +
1639 in_bytes(InvocationCounter::counter_offset()));
1640 __ increment_mask_and_jump(backedge_counter, increment, mask, G3_scratch, Lscratch,
1641 Assembler::notZero, &Lforward);
1642 __ bind(Loverflow);
1644 // notify point for loop, pass branch bytecode
1645 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), O0_cur_bcp);
1647 // Was an OSR adapter generated?
1648 // O0 = osr nmethod
1649 __ br_null_short(O0, Assembler::pn, Lforward);
1651 // Has the nmethod been invalidated already?
1652 __ ld(O0, nmethod::entry_bci_offset(), O2);
1653 __ cmp_and_br_short(O2, InvalidOSREntryBci, Assembler::equal, Assembler::pn, Lforward);
1655 // migrate the interpreter frame off of the stack
1657 __ mov(G2_thread, L7);
1658 // save nmethod
1659 __ mov(O0, L6);
1660 __ set_last_Java_frame(SP, noreg);
1661 __ call_VM_leaf(noreg, CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_begin), L7);
1662 __ reset_last_Java_frame();
1663 __ mov(L7, G2_thread);
1665 // move OSR nmethod to I1
1666 __ mov(L6, I1);
1668 // OSR buffer to I0
1669 __ mov(O0, I0);
1671 // remove the interpreter frame
1672 __ restore(I5_savedSP, 0, SP);
1674 // Jump to the osr code.
1675 __ ld_ptr(O1, nmethod::osr_entry_point_offset(), O2);
1676 __ jmp(O2, G0);
1677 __ delayed()->nop();
1679 } else {
1680 // Update Backedge branch separately from invocations
1681 const Register G4_invoke_ctr = G4;
1682 __ increment_backedge_counter(G4_invoke_ctr, G1_scratch);
1683 if (ProfileInterpreter) {
1684 __ test_invocation_counter_for_mdp(G4_invoke_ctr, G3_scratch, Lforward);
1685 if (UseOnStackReplacement) {
1686 __ test_backedge_count_for_osr(O2_bumped_count, O0_cur_bcp, G3_scratch);
1687 }
1688 } else {
1689 if (UseOnStackReplacement) {
1690 __ test_backedge_count_for_osr(G4_invoke_ctr, O0_cur_bcp, G3_scratch);
1691 }
1692 }
1693 }
1695 __ bind(Lforward);
1696 } else
1697 // Bump bytecode pointer by displacement (take the branch)
1698 __ add( O1_disp, Lbcp, Lbcp );// add to bc addr
1700 // continue with bytecode @ target
1701 // %%%%% Like Intel, could speed things up by moving bytecode fetch to code above,
1702 // %%%%% and changing dispatch_next to dispatch_only
1703 __ dispatch_next(vtos);
1704 }
1707 // Note Condition in argument is TemplateTable::Condition
1708 // arg scope is within class scope
1710 void TemplateTable::if_0cmp(Condition cc) {
1711 // no pointers, integer only!
1712 transition(itos, vtos);
1713 // assume branch is more often taken than not (loops use backward branches)
1714 __ cmp( Otos_i, 0);
1715 __ if_cmp(ccNot(cc), false);
1716 }
1719 void TemplateTable::if_icmp(Condition cc) {
1720 transition(itos, vtos);
1721 __ pop_i(O1);
1722 __ cmp(O1, Otos_i);
1723 __ if_cmp(ccNot(cc), false);
1724 }
1727 void TemplateTable::if_nullcmp(Condition cc) {
1728 transition(atos, vtos);
1729 __ tst(Otos_i);
1730 __ if_cmp(ccNot(cc), true);
1731 }
1734 void TemplateTable::if_acmp(Condition cc) {
1735 transition(atos, vtos);
1736 __ pop_ptr(O1);
1737 __ verify_oop(O1);
1738 __ verify_oop(Otos_i);
1739 __ cmp(O1, Otos_i);
1740 __ if_cmp(ccNot(cc), true);
1741 }
1745 void TemplateTable::ret() {
1746 transition(vtos, vtos);
1747 locals_index(G3_scratch);
1748 __ access_local_returnAddress(G3_scratch, Otos_i);
1749 // Otos_i contains the bci, compute the bcp from that
1751 #ifdef _LP64
1752 #ifdef ASSERT
1753 // jsr result was labeled as an 'itos' not an 'atos' because we cannot GC
1754 // the result. The return address (really a BCI) was stored with an
1755 // 'astore' because JVM specs claim it's a pointer-sized thing. Hence in
1756 // the 64-bit build the 32-bit BCI is actually in the low bits of a 64-bit
1757 // loaded value.
1758 { Label zzz ;
1759 __ set (65536, G3_scratch) ;
1760 __ cmp (Otos_i, G3_scratch) ;
1761 __ bp( Assembler::lessEqualUnsigned, false, Assembler::xcc, Assembler::pn, zzz);
1762 __ delayed()->nop();
1763 __ stop("BCI is in the wrong register half?");
1764 __ bind (zzz) ;
1765 }
1766 #endif
1767 #endif
1769 __ profile_ret(vtos, Otos_i, G4_scratch);
1771 __ ld_ptr(Lmethod, Method::const_offset(), G3_scratch);
1772 __ add(G3_scratch, Otos_i, G3_scratch);
1773 __ add(G3_scratch, in_bytes(ConstMethod::codes_offset()), Lbcp);
1774 __ dispatch_next(vtos);
1775 }
1778 void TemplateTable::wide_ret() {
1779 transition(vtos, vtos);
1780 locals_index_wide(G3_scratch);
1781 __ access_local_returnAddress(G3_scratch, Otos_i);
1782 // Otos_i contains the bci, compute the bcp from that
1784 __ profile_ret(vtos, Otos_i, G4_scratch);
1786 __ ld_ptr(Lmethod, Method::const_offset(), G3_scratch);
1787 __ add(G3_scratch, Otos_i, G3_scratch);
1788 __ add(G3_scratch, in_bytes(ConstMethod::codes_offset()), Lbcp);
1789 __ dispatch_next(vtos);
1790 }
1793 void TemplateTable::tableswitch() {
1794 transition(itos, vtos);
1795 Label default_case, continue_execution;
1797 // align bcp
1798 __ add(Lbcp, BytesPerInt, O1);
1799 __ and3(O1, -BytesPerInt, O1);
1800 // load lo, hi
1801 __ ld(O1, 1 * BytesPerInt, O2); // Low Byte
1802 __ ld(O1, 2 * BytesPerInt, O3); // High Byte
1803 #ifdef _LP64
1804 // Sign extend the 32 bits
1805 __ sra ( Otos_i, 0, Otos_i );
1806 #endif /* _LP64 */
1808 // check against lo & hi
1809 __ cmp( Otos_i, O2);
1810 __ br( Assembler::less, false, Assembler::pn, default_case);
1811 __ delayed()->cmp( Otos_i, O3 );
1812 __ br( Assembler::greater, false, Assembler::pn, default_case);
1813 // lookup dispatch offset
1814 __ delayed()->sub(Otos_i, O2, O2);
1815 __ profile_switch_case(O2, O3, G3_scratch, G4_scratch);
1816 __ sll(O2, LogBytesPerInt, O2);
1817 __ add(O2, 3 * BytesPerInt, O2);
1818 __ ba(continue_execution);
1819 __ delayed()->ld(O1, O2, O2);
1820 // handle default
1821 __ bind(default_case);
1822 __ profile_switch_default(O3);
1823 __ ld(O1, 0, O2); // get default offset
1824 // continue execution
1825 __ bind(continue_execution);
1826 __ add(Lbcp, O2, Lbcp);
1827 __ dispatch_next(vtos);
1828 }
1831 void TemplateTable::lookupswitch() {
1832 transition(itos, itos);
1833 __ stop("lookupswitch bytecode should have been rewritten");
1834 }
1836 void TemplateTable::fast_linearswitch() {
1837 transition(itos, vtos);
1838 Label loop_entry, loop, found, continue_execution;
1839 // align bcp
1840 __ add(Lbcp, BytesPerInt, O1);
1841 __ and3(O1, -BytesPerInt, O1);
1842 // set counter
1843 __ ld(O1, BytesPerInt, O2);
1844 __ sll(O2, LogBytesPerInt + 1, O2); // in word-pairs
1845 __ add(O1, 2 * BytesPerInt, O3); // set first pair addr
1846 __ ba(loop_entry);
1847 __ delayed()->add(O3, O2, O2); // counter now points past last pair
1849 // table search
1850 __ bind(loop);
1851 __ cmp(O4, Otos_i);
1852 __ br(Assembler::equal, true, Assembler::pn, found);
1853 __ delayed()->ld(O3, BytesPerInt, O4); // offset -> O4
1854 __ inc(O3, 2 * BytesPerInt);
1856 __ bind(loop_entry);
1857 __ cmp(O2, O3);
1858 __ brx(Assembler::greaterUnsigned, true, Assembler::pt, loop);
1859 __ delayed()->ld(O3, 0, O4);
1861 // default case
1862 __ ld(O1, 0, O4); // get default offset
1863 if (ProfileInterpreter) {
1864 __ profile_switch_default(O3);
1865 __ ba_short(continue_execution);
1866 }
1868 // entry found -> get offset
1869 __ bind(found);
1870 if (ProfileInterpreter) {
1871 __ sub(O3, O1, O3);
1872 __ sub(O3, 2*BytesPerInt, O3);
1873 __ srl(O3, LogBytesPerInt + 1, O3); // in word-pairs
1874 __ profile_switch_case(O3, O1, O2, G3_scratch);
1876 __ bind(continue_execution);
1877 }
1878 __ add(Lbcp, O4, Lbcp);
1879 __ dispatch_next(vtos);
1880 }
1883 void TemplateTable::fast_binaryswitch() {
1884 transition(itos, vtos);
1885 // Implementation using the following core algorithm: (copied from Intel)
1886 //
1887 // int binary_search(int key, LookupswitchPair* array, int n) {
1888 // // Binary search according to "Methodik des Programmierens" by
1889 // // Edsger W. Dijkstra and W.H.J. Feijen, Addison Wesley Germany 1985.
1890 // int i = 0;
1891 // int j = n;
1892 // while (i+1 < j) {
1893 // // invariant P: 0 <= i < j <= n and (a[i] <= key < a[j] or Q)
1894 // // with Q: for all i: 0 <= i < n: key < a[i]
1895 // // where a stands for the array and assuming that the (inexisting)
1896 // // element a[n] is infinitely big.
1897 // int h = (i + j) >> 1;
1898 // // i < h < j
1899 // if (key < array[h].fast_match()) {
1900 // j = h;
1901 // } else {
1902 // i = h;
1903 // }
1904 // }
1905 // // R: a[i] <= key < a[i+1] or Q
1906 // // (i.e., if key is within array, i is the correct index)
1907 // return i;
1908 // }
1910 // register allocation
1911 assert(Otos_i == O0, "alias checking");
1912 const Register Rkey = Otos_i; // already set (tosca)
1913 const Register Rarray = O1;
1914 const Register Ri = O2;
1915 const Register Rj = O3;
1916 const Register Rh = O4;
1917 const Register Rscratch = O5;
1919 const int log_entry_size = 3;
1920 const int entry_size = 1 << log_entry_size;
1922 Label found;
1923 // Find Array start
1924 __ add(Lbcp, 3 * BytesPerInt, Rarray);
1925 __ and3(Rarray, -BytesPerInt, Rarray);
1926 // initialize i & j (in delay slot)
1927 __ clr( Ri );
1929 // and start
1930 Label entry;
1931 __ ba(entry);
1932 __ delayed()->ld( Rarray, -BytesPerInt, Rj);
1933 // (Rj is already in the native byte-ordering.)
1935 // binary search loop
1936 { Label loop;
1937 __ bind( loop );
1938 // int h = (i + j) >> 1;
1939 __ sra( Rh, 1, Rh );
1940 // if (key < array[h].fast_match()) {
1941 // j = h;
1942 // } else {
1943 // i = h;
1944 // }
1945 __ sll( Rh, log_entry_size, Rscratch );
1946 __ ld( Rarray, Rscratch, Rscratch );
1947 // (Rscratch is already in the native byte-ordering.)
1948 __ cmp( Rkey, Rscratch );
1949 if ( VM_Version::v9_instructions_work() ) {
1950 __ movcc( Assembler::less, false, Assembler::icc, Rh, Rj ); // j = h if (key < array[h].fast_match())
1951 __ movcc( Assembler::greaterEqual, false, Assembler::icc, Rh, Ri ); // i = h if (key >= array[h].fast_match())
1952 }
1953 else {
1954 Label end_of_if;
1955 __ br( Assembler::less, true, Assembler::pt, end_of_if );
1956 __ delayed()->mov( Rh, Rj ); // if (<) Rj = Rh
1957 __ mov( Rh, Ri ); // else i = h
1958 __ bind(end_of_if); // }
1959 }
1961 // while (i+1 < j)
1962 __ bind( entry );
1963 __ add( Ri, 1, Rscratch );
1964 __ cmp(Rscratch, Rj);
1965 __ br( Assembler::less, true, Assembler::pt, loop );
1966 __ delayed()->add( Ri, Rj, Rh ); // start h = i + j >> 1;
1967 }
1969 // end of binary search, result index is i (must check again!)
1970 Label default_case;
1971 Label continue_execution;
1972 if (ProfileInterpreter) {
1973 __ mov( Ri, Rh ); // Save index in i for profiling
1974 }
1975 __ sll( Ri, log_entry_size, Ri );
1976 __ ld( Rarray, Ri, Rscratch );
1977 // (Rscratch is already in the native byte-ordering.)
1978 __ cmp( Rkey, Rscratch );
1979 __ br( Assembler::notEqual, true, Assembler::pn, default_case );
1980 __ delayed()->ld( Rarray, -2 * BytesPerInt, Rj ); // load default offset -> j
1982 // entry found -> j = offset
1983 __ inc( Ri, BytesPerInt );
1984 __ profile_switch_case(Rh, Rj, Rscratch, Rkey);
1985 __ ld( Rarray, Ri, Rj );
1986 // (Rj is already in the native byte-ordering.)
1988 if (ProfileInterpreter) {
1989 __ ba_short(continue_execution);
1990 }
1992 __ bind(default_case); // fall through (if not profiling)
1993 __ profile_switch_default(Ri);
1995 __ bind(continue_execution);
1996 __ add( Lbcp, Rj, Lbcp );
1997 __ dispatch_next( vtos );
1998 }
2001 void TemplateTable::_return(TosState state) {
2002 transition(state, state);
2003 assert(_desc->calls_vm(), "inconsistent calls_vm information");
2005 if (_desc->bytecode() == Bytecodes::_return_register_finalizer) {
2006 assert(state == vtos, "only valid state");
2007 __ mov(G0, G3_scratch);
2008 __ access_local_ptr(G3_scratch, Otos_i);
2009 __ load_klass(Otos_i, O2);
2010 __ set(JVM_ACC_HAS_FINALIZER, G3);
2011 __ ld(O2, in_bytes(Klass::access_flags_offset()), O2);
2012 __ andcc(G3, O2, G0);
2013 Label skip_register_finalizer;
2014 __ br(Assembler::zero, false, Assembler::pn, skip_register_finalizer);
2015 __ delayed()->nop();
2017 // Call out to do finalizer registration
2018 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::register_finalizer), Otos_i);
2020 __ bind(skip_register_finalizer);
2021 }
2023 __ remove_activation(state, /* throw_monitor_exception */ true);
2025 // The caller's SP was adjusted upon method entry to accomodate
2026 // the callee's non-argument locals. Undo that adjustment.
2027 __ ret(); // return to caller
2028 __ delayed()->restore(I5_savedSP, G0, SP);
2029 }
2032 // ----------------------------------------------------------------------------
2033 // Volatile variables demand their effects be made known to all CPU's in
2034 // order. Store buffers on most chips allow reads & writes to reorder; the
2035 // JMM's ReadAfterWrite.java test fails in -Xint mode without some kind of
2036 // memory barrier (i.e., it's not sufficient that the interpreter does not
2037 // reorder volatile references, the hardware also must not reorder them).
2038 //
2039 // According to the new Java Memory Model (JMM):
2040 // (1) All volatiles are serialized wrt to each other.
2041 // ALSO reads & writes act as aquire & release, so:
2042 // (2) A read cannot let unrelated NON-volatile memory refs that happen after
2043 // the read float up to before the read. It's OK for non-volatile memory refs
2044 // that happen before the volatile read to float down below it.
2045 // (3) Similar a volatile write cannot let unrelated NON-volatile memory refs
2046 // that happen BEFORE the write float down to after the write. It's OK for
2047 // non-volatile memory refs that happen after the volatile write to float up
2048 // before it.
2049 //
2050 // We only put in barriers around volatile refs (they are expensive), not
2051 // _between_ memory refs (that would require us to track the flavor of the
2052 // previous memory refs). Requirements (2) and (3) require some barriers
2053 // before volatile stores and after volatile loads. These nearly cover
2054 // requirement (1) but miss the volatile-store-volatile-load case. This final
2055 // case is placed after volatile-stores although it could just as well go
2056 // before volatile-loads.
2057 void TemplateTable::volatile_barrier(Assembler::Membar_mask_bits order_constraint) {
2058 // Helper function to insert a is-volatile test and memory barrier
2059 // All current sparc implementations run in TSO, needing only StoreLoad
2060 if ((order_constraint & Assembler::StoreLoad) == 0) return;
2061 __ membar( order_constraint );
2062 }
2064 // ----------------------------------------------------------------------------
2065 void TemplateTable::resolve_cache_and_index(int byte_no,
2066 Register Rcache,
2067 Register index,
2068 size_t index_size) {
2069 // Depends on cpCacheOop layout!
2070 Label resolved;
2072 assert(byte_no == f1_byte || byte_no == f2_byte, "byte_no out of range");
2073 __ get_cache_and_index_and_bytecode_at_bcp(Rcache, index, Lbyte_code, byte_no, 1, index_size);
2074 __ cmp(Lbyte_code, (int) bytecode()); // have we resolved this bytecode?
2075 __ br(Assembler::equal, false, Assembler::pt, resolved);
2076 __ delayed()->set((int)bytecode(), O1);
2078 address entry;
2079 switch (bytecode()) {
2080 case Bytecodes::_getstatic : // fall through
2081 case Bytecodes::_putstatic : // fall through
2082 case Bytecodes::_getfield : // fall through
2083 case Bytecodes::_putfield : entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put); break;
2084 case Bytecodes::_invokevirtual : // fall through
2085 case Bytecodes::_invokespecial : // fall through
2086 case Bytecodes::_invokestatic : // fall through
2087 case Bytecodes::_invokeinterface: entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invoke); break;
2088 case Bytecodes::_invokehandle : entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invokehandle); break;
2089 case Bytecodes::_invokedynamic : entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_invokedynamic); break;
2090 default:
2091 fatal(err_msg("unexpected bytecode: %s", Bytecodes::name(bytecode())));
2092 break;
2093 }
2094 // first time invocation - must resolve first
2095 __ call_VM(noreg, entry, O1);
2096 // Update registers with resolved info
2097 __ get_cache_and_index_at_bcp(Rcache, index, 1, index_size);
2098 __ bind(resolved);
2099 }
2101 void TemplateTable::load_invoke_cp_cache_entry(int byte_no,
2102 Register method,
2103 Register itable_index,
2104 Register flags,
2105 bool is_invokevirtual,
2106 bool is_invokevfinal,
2107 bool is_invokedynamic) {
2108 // Uses both G3_scratch and G4_scratch
2109 Register cache = G3_scratch;
2110 Register index = G4_scratch;
2111 assert_different_registers(cache, method, itable_index);
2113 // determine constant pool cache field offsets
2114 assert(is_invokevirtual == (byte_no == f2_byte), "is_invokevirtual flag redundant");
2115 const int method_offset = in_bytes(
2116 ConstantPoolCache::base_offset() +
2117 ((byte_no == f2_byte)
2118 ? ConstantPoolCacheEntry::f2_offset()
2119 : ConstantPoolCacheEntry::f1_offset()
2120 )
2121 );
2122 const int flags_offset = in_bytes(ConstantPoolCache::base_offset() +
2123 ConstantPoolCacheEntry::flags_offset());
2124 // access constant pool cache fields
2125 const int index_offset = in_bytes(ConstantPoolCache::base_offset() +
2126 ConstantPoolCacheEntry::f2_offset());
2128 if (is_invokevfinal) {
2129 __ get_cache_and_index_at_bcp(cache, index, 1);
2130 __ ld_ptr(Address(cache, method_offset), method);
2131 } else {
2132 size_t index_size = (is_invokedynamic ? sizeof(u4) : sizeof(u2));
2133 resolve_cache_and_index(byte_no, cache, index, index_size);
2134 __ ld_ptr(Address(cache, method_offset), method);
2135 }
2137 if (itable_index != noreg) {
2138 // pick up itable or appendix index from f2 also:
2139 __ ld_ptr(Address(cache, index_offset), itable_index);
2140 }
2141 __ ld_ptr(Address(cache, flags_offset), flags);
2142 }
2144 // The Rcache register must be set before call
2145 void TemplateTable::load_field_cp_cache_entry(Register Robj,
2146 Register Rcache,
2147 Register index,
2148 Register Roffset,
2149 Register Rflags,
2150 bool is_static) {
2151 assert_different_registers(Rcache, Rflags, Roffset);
2153 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2155 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::flags_offset(), Rflags);
2156 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::f2_offset(), Roffset);
2157 if (is_static) {
2158 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::f1_offset(), Robj);
2159 const int mirror_offset = in_bytes(Klass::java_mirror_offset());
2160 __ ld_ptr( Robj, mirror_offset, Robj);
2161 }
2162 }
2164 // The registers Rcache and index expected to be set before call.
2165 // Correct values of the Rcache and index registers are preserved.
2166 void TemplateTable::jvmti_post_field_access(Register Rcache,
2167 Register index,
2168 bool is_static,
2169 bool has_tos) {
2170 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2172 if (JvmtiExport::can_post_field_access()) {
2173 // Check to see if a field access watch has been set before we take
2174 // the time to call into the VM.
2175 Label Label1;
2176 assert_different_registers(Rcache, index, G1_scratch);
2177 AddressLiteral get_field_access_count_addr(JvmtiExport::get_field_access_count_addr());
2178 __ load_contents(get_field_access_count_addr, G1_scratch);
2179 __ cmp_and_br_short(G1_scratch, 0, Assembler::equal, Assembler::pt, Label1);
2181 __ add(Rcache, in_bytes(cp_base_offset), Rcache);
2183 if (is_static) {
2184 __ clr(Otos_i);
2185 } else {
2186 if (has_tos) {
2187 // save object pointer before call_VM() clobbers it
2188 __ push_ptr(Otos_i); // put object on tos where GC wants it.
2189 } else {
2190 // Load top of stack (do not pop the value off the stack);
2191 __ ld_ptr(Lesp, Interpreter::expr_offset_in_bytes(0), Otos_i);
2192 }
2193 __ verify_oop(Otos_i);
2194 }
2195 // Otos_i: object pointer or NULL if static
2196 // Rcache: cache entry pointer
2197 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_access),
2198 Otos_i, Rcache);
2199 if (!is_static && has_tos) {
2200 __ pop_ptr(Otos_i); // restore object pointer
2201 __ verify_oop(Otos_i);
2202 }
2203 __ get_cache_and_index_at_bcp(Rcache, index, 1);
2204 __ bind(Label1);
2205 }
2206 }
2208 void TemplateTable::getfield_or_static(int byte_no, bool is_static) {
2209 transition(vtos, vtos);
2211 Register Rcache = G3_scratch;
2212 Register index = G4_scratch;
2213 Register Rclass = Rcache;
2214 Register Roffset= G4_scratch;
2215 Register Rflags = G1_scratch;
2216 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2218 resolve_cache_and_index(byte_no, Rcache, index, sizeof(u2));
2219 jvmti_post_field_access(Rcache, index, is_static, false);
2220 load_field_cp_cache_entry(Rclass, Rcache, index, Roffset, Rflags, is_static);
2222 if (!is_static) {
2223 pop_and_check_object(Rclass);
2224 } else {
2225 __ verify_oop(Rclass);
2226 }
2228 Label exit;
2230 Assembler::Membar_mask_bits membar_bits =
2231 Assembler::Membar_mask_bits(Assembler::LoadLoad | Assembler::LoadStore);
2233 if (__ membar_has_effect(membar_bits)) {
2234 // Get volatile flag
2235 __ set((1 << ConstantPoolCacheEntry::is_volatile_shift), Lscratch);
2236 __ and3(Rflags, Lscratch, Lscratch);
2237 }
2239 Label checkVolatile;
2241 // compute field type
2242 Label notByte, notInt, notShort, notChar, notLong, notFloat, notObj;
2243 __ srl(Rflags, ConstantPoolCacheEntry::tos_state_shift, Rflags);
2244 // Make sure we don't need to mask Rflags after the above shift
2245 ConstantPoolCacheEntry::verify_tos_state_shift();
2247 // Check atos before itos for getstatic, more likely (in Queens at least)
2248 __ cmp(Rflags, atos);
2249 __ br(Assembler::notEqual, false, Assembler::pt, notObj);
2250 __ delayed() ->cmp(Rflags, itos);
2252 // atos
2253 __ load_heap_oop(Rclass, Roffset, Otos_i);
2254 __ verify_oop(Otos_i);
2255 __ push(atos);
2256 if (!is_static) {
2257 patch_bytecode(Bytecodes::_fast_agetfield, G3_scratch, G4_scratch);
2258 }
2259 __ ba(checkVolatile);
2260 __ delayed()->tst(Lscratch);
2262 __ bind(notObj);
2264 // cmp(Rflags, itos);
2265 __ br(Assembler::notEqual, false, Assembler::pt, notInt);
2266 __ delayed() ->cmp(Rflags, ltos);
2268 // itos
2269 __ ld(Rclass, Roffset, Otos_i);
2270 __ push(itos);
2271 if (!is_static) {
2272 patch_bytecode(Bytecodes::_fast_igetfield, G3_scratch, G4_scratch);
2273 }
2274 __ ba(checkVolatile);
2275 __ delayed()->tst(Lscratch);
2277 __ bind(notInt);
2279 // cmp(Rflags, ltos);
2280 __ br(Assembler::notEqual, false, Assembler::pt, notLong);
2281 __ delayed() ->cmp(Rflags, btos);
2283 // ltos
2284 // load must be atomic
2285 __ ld_long(Rclass, Roffset, Otos_l);
2286 __ push(ltos);
2287 if (!is_static) {
2288 patch_bytecode(Bytecodes::_fast_lgetfield, G3_scratch, G4_scratch);
2289 }
2290 __ ba(checkVolatile);
2291 __ delayed()->tst(Lscratch);
2293 __ bind(notLong);
2295 // cmp(Rflags, btos);
2296 __ br(Assembler::notEqual, false, Assembler::pt, notByte);
2297 __ delayed() ->cmp(Rflags, ctos);
2299 // btos
2300 __ ldsb(Rclass, Roffset, Otos_i);
2301 __ push(itos);
2302 if (!is_static) {
2303 patch_bytecode(Bytecodes::_fast_bgetfield, G3_scratch, G4_scratch);
2304 }
2305 __ ba(checkVolatile);
2306 __ delayed()->tst(Lscratch);
2308 __ bind(notByte);
2310 // cmp(Rflags, ctos);
2311 __ br(Assembler::notEqual, false, Assembler::pt, notChar);
2312 __ delayed() ->cmp(Rflags, stos);
2314 // ctos
2315 __ lduh(Rclass, Roffset, Otos_i);
2316 __ push(itos);
2317 if (!is_static) {
2318 patch_bytecode(Bytecodes::_fast_cgetfield, G3_scratch, G4_scratch);
2319 }
2320 __ ba(checkVolatile);
2321 __ delayed()->tst(Lscratch);
2323 __ bind(notChar);
2325 // cmp(Rflags, stos);
2326 __ br(Assembler::notEqual, false, Assembler::pt, notShort);
2327 __ delayed() ->cmp(Rflags, ftos);
2329 // stos
2330 __ ldsh(Rclass, Roffset, Otos_i);
2331 __ push(itos);
2332 if (!is_static) {
2333 patch_bytecode(Bytecodes::_fast_sgetfield, G3_scratch, G4_scratch);
2334 }
2335 __ ba(checkVolatile);
2336 __ delayed()->tst(Lscratch);
2338 __ bind(notShort);
2341 // cmp(Rflags, ftos);
2342 __ br(Assembler::notEqual, false, Assembler::pt, notFloat);
2343 __ delayed() ->tst(Lscratch);
2345 // ftos
2346 __ ldf(FloatRegisterImpl::S, Rclass, Roffset, Ftos_f);
2347 __ push(ftos);
2348 if (!is_static) {
2349 patch_bytecode(Bytecodes::_fast_fgetfield, G3_scratch, G4_scratch);
2350 }
2351 __ ba(checkVolatile);
2352 __ delayed()->tst(Lscratch);
2354 __ bind(notFloat);
2357 // dtos
2358 __ ldf(FloatRegisterImpl::D, Rclass, Roffset, Ftos_d);
2359 __ push(dtos);
2360 if (!is_static) {
2361 patch_bytecode(Bytecodes::_fast_dgetfield, G3_scratch, G4_scratch);
2362 }
2364 __ bind(checkVolatile);
2365 if (__ membar_has_effect(membar_bits)) {
2366 // __ tst(Lscratch); executed in delay slot
2367 __ br(Assembler::zero, false, Assembler::pt, exit);
2368 __ delayed()->nop();
2369 volatile_barrier(membar_bits);
2370 }
2372 __ bind(exit);
2373 }
2376 void TemplateTable::getfield(int byte_no) {
2377 getfield_or_static(byte_no, false);
2378 }
2380 void TemplateTable::getstatic(int byte_no) {
2381 getfield_or_static(byte_no, true);
2382 }
2385 void TemplateTable::fast_accessfield(TosState state) {
2386 transition(atos, state);
2387 Register Rcache = G3_scratch;
2388 Register index = G4_scratch;
2389 Register Roffset = G4_scratch;
2390 Register Rflags = Rcache;
2391 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2393 __ get_cache_and_index_at_bcp(Rcache, index, 1);
2394 jvmti_post_field_access(Rcache, index, /*is_static*/false, /*has_tos*/true);
2396 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::f2_offset(), Roffset);
2398 __ null_check(Otos_i);
2399 __ verify_oop(Otos_i);
2401 Label exit;
2403 Assembler::Membar_mask_bits membar_bits =
2404 Assembler::Membar_mask_bits(Assembler::LoadLoad | Assembler::LoadStore);
2405 if (__ membar_has_effect(membar_bits)) {
2406 // Get volatile flag
2407 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::f2_offset(), Rflags);
2408 __ set((1 << ConstantPoolCacheEntry::is_volatile_shift), Lscratch);
2409 }
2411 switch (bytecode()) {
2412 case Bytecodes::_fast_bgetfield:
2413 __ ldsb(Otos_i, Roffset, Otos_i);
2414 break;
2415 case Bytecodes::_fast_cgetfield:
2416 __ lduh(Otos_i, Roffset, Otos_i);
2417 break;
2418 case Bytecodes::_fast_sgetfield:
2419 __ ldsh(Otos_i, Roffset, Otos_i);
2420 break;
2421 case Bytecodes::_fast_igetfield:
2422 __ ld(Otos_i, Roffset, Otos_i);
2423 break;
2424 case Bytecodes::_fast_lgetfield:
2425 __ ld_long(Otos_i, Roffset, Otos_l);
2426 break;
2427 case Bytecodes::_fast_fgetfield:
2428 __ ldf(FloatRegisterImpl::S, Otos_i, Roffset, Ftos_f);
2429 break;
2430 case Bytecodes::_fast_dgetfield:
2431 __ ldf(FloatRegisterImpl::D, Otos_i, Roffset, Ftos_d);
2432 break;
2433 case Bytecodes::_fast_agetfield:
2434 __ load_heap_oop(Otos_i, Roffset, Otos_i);
2435 break;
2436 default:
2437 ShouldNotReachHere();
2438 }
2440 if (__ membar_has_effect(membar_bits)) {
2441 __ btst(Lscratch, Rflags);
2442 __ br(Assembler::zero, false, Assembler::pt, exit);
2443 __ delayed()->nop();
2444 volatile_barrier(membar_bits);
2445 __ bind(exit);
2446 }
2448 if (state == atos) {
2449 __ verify_oop(Otos_i); // does not blow flags!
2450 }
2451 }
2453 void TemplateTable::jvmti_post_fast_field_mod() {
2454 if (JvmtiExport::can_post_field_modification()) {
2455 // Check to see if a field modification watch has been set before we take
2456 // the time to call into the VM.
2457 Label done;
2458 AddressLiteral get_field_modification_count_addr(JvmtiExport::get_field_modification_count_addr());
2459 __ load_contents(get_field_modification_count_addr, G4_scratch);
2460 __ cmp_and_br_short(G4_scratch, 0, Assembler::equal, Assembler::pt, done);
2461 __ pop_ptr(G4_scratch); // copy the object pointer from tos
2462 __ verify_oop(G4_scratch);
2463 __ push_ptr(G4_scratch); // put the object pointer back on tos
2464 __ get_cache_entry_pointer_at_bcp(G1_scratch, G3_scratch, 1);
2465 // Save tos values before call_VM() clobbers them. Since we have
2466 // to do it for every data type, we use the saved values as the
2467 // jvalue object.
2468 switch (bytecode()) { // save tos values before call_VM() clobbers them
2469 case Bytecodes::_fast_aputfield: __ push_ptr(Otos_i); break;
2470 case Bytecodes::_fast_bputfield: // fall through
2471 case Bytecodes::_fast_sputfield: // fall through
2472 case Bytecodes::_fast_cputfield: // fall through
2473 case Bytecodes::_fast_iputfield: __ push_i(Otos_i); break;
2474 case Bytecodes::_fast_dputfield: __ push_d(Ftos_d); break;
2475 case Bytecodes::_fast_fputfield: __ push_f(Ftos_f); break;
2476 // get words in right order for use as jvalue object
2477 case Bytecodes::_fast_lputfield: __ push_l(Otos_l); break;
2478 }
2479 // setup pointer to jvalue object
2480 __ mov(Lesp, G3_scratch); __ inc(G3_scratch, wordSize);
2481 // G4_scratch: object pointer
2482 // G1_scratch: cache entry pointer
2483 // G3_scratch: jvalue object on the stack
2484 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification), G4_scratch, G1_scratch, G3_scratch);
2485 switch (bytecode()) { // restore tos values
2486 case Bytecodes::_fast_aputfield: __ pop_ptr(Otos_i); break;
2487 case Bytecodes::_fast_bputfield: // fall through
2488 case Bytecodes::_fast_sputfield: // fall through
2489 case Bytecodes::_fast_cputfield: // fall through
2490 case Bytecodes::_fast_iputfield: __ pop_i(Otos_i); break;
2491 case Bytecodes::_fast_dputfield: __ pop_d(Ftos_d); break;
2492 case Bytecodes::_fast_fputfield: __ pop_f(Ftos_f); break;
2493 case Bytecodes::_fast_lputfield: __ pop_l(Otos_l); break;
2494 }
2495 __ bind(done);
2496 }
2497 }
2499 // The registers Rcache and index expected to be set before call.
2500 // The function may destroy various registers, just not the Rcache and index registers.
2501 void TemplateTable::jvmti_post_field_mod(Register Rcache, Register index, bool is_static) {
2502 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2504 if (JvmtiExport::can_post_field_modification()) {
2505 // Check to see if a field modification watch has been set before we take
2506 // the time to call into the VM.
2507 Label Label1;
2508 assert_different_registers(Rcache, index, G1_scratch);
2509 AddressLiteral get_field_modification_count_addr(JvmtiExport::get_field_modification_count_addr());
2510 __ load_contents(get_field_modification_count_addr, G1_scratch);
2511 __ cmp_and_br_short(G1_scratch, 0, Assembler::zero, Assembler::pt, Label1);
2513 // The Rcache and index registers have been already set.
2514 // This allows to eliminate this call but the Rcache and index
2515 // registers must be correspondingly used after this line.
2516 __ get_cache_and_index_at_bcp(G1_scratch, G4_scratch, 1);
2518 __ add(G1_scratch, in_bytes(cp_base_offset), G3_scratch);
2519 if (is_static) {
2520 // Life is simple. Null out the object pointer.
2521 __ clr(G4_scratch);
2522 } else {
2523 Register Rflags = G1_scratch;
2524 // Life is harder. The stack holds the value on top, followed by the
2525 // object. We don't know the size of the value, though; it could be
2526 // one or two words depending on its type. As a result, we must find
2527 // the type to determine where the object is.
2529 Label two_word, valsizeknown;
2530 __ ld_ptr(G1_scratch, cp_base_offset + ConstantPoolCacheEntry::flags_offset(), Rflags);
2531 __ mov(Lesp, G4_scratch);
2532 __ srl(Rflags, ConstantPoolCacheEntry::tos_state_shift, Rflags);
2533 // Make sure we don't need to mask Rflags after the above shift
2534 ConstantPoolCacheEntry::verify_tos_state_shift();
2535 __ cmp(Rflags, ltos);
2536 __ br(Assembler::equal, false, Assembler::pt, two_word);
2537 __ delayed()->cmp(Rflags, dtos);
2538 __ br(Assembler::equal, false, Assembler::pt, two_word);
2539 __ delayed()->nop();
2540 __ inc(G4_scratch, Interpreter::expr_offset_in_bytes(1));
2541 __ ba_short(valsizeknown);
2542 __ bind(two_word);
2544 __ inc(G4_scratch, Interpreter::expr_offset_in_bytes(2));
2546 __ bind(valsizeknown);
2547 // setup object pointer
2548 __ ld_ptr(G4_scratch, 0, G4_scratch);
2549 __ verify_oop(G4_scratch);
2550 }
2551 // setup pointer to jvalue object
2552 __ mov(Lesp, G1_scratch); __ inc(G1_scratch, wordSize);
2553 // G4_scratch: object pointer or NULL if static
2554 // G3_scratch: cache entry pointer
2555 // G1_scratch: jvalue object on the stack
2556 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::post_field_modification),
2557 G4_scratch, G3_scratch, G1_scratch);
2558 __ get_cache_and_index_at_bcp(Rcache, index, 1);
2559 __ bind(Label1);
2560 }
2561 }
2563 void TemplateTable::pop_and_check_object(Register r) {
2564 __ pop_ptr(r);
2565 __ null_check(r); // for field access must check obj.
2566 __ verify_oop(r);
2567 }
2569 void TemplateTable::putfield_or_static(int byte_no, bool is_static) {
2570 transition(vtos, vtos);
2571 Register Rcache = G3_scratch;
2572 Register index = G4_scratch;
2573 Register Rclass = Rcache;
2574 Register Roffset= G4_scratch;
2575 Register Rflags = G1_scratch;
2576 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2578 resolve_cache_and_index(byte_no, Rcache, index, sizeof(u2));
2579 jvmti_post_field_mod(Rcache, index, is_static);
2580 load_field_cp_cache_entry(Rclass, Rcache, index, Roffset, Rflags, is_static);
2582 Assembler::Membar_mask_bits read_bits =
2583 Assembler::Membar_mask_bits(Assembler::LoadStore | Assembler::StoreStore);
2584 Assembler::Membar_mask_bits write_bits = Assembler::StoreLoad;
2586 Label notVolatile, checkVolatile, exit;
2587 if (__ membar_has_effect(read_bits) || __ membar_has_effect(write_bits)) {
2588 __ set((1 << ConstantPoolCacheEntry::is_volatile_shift), Lscratch);
2589 __ and3(Rflags, Lscratch, Lscratch);
2591 if (__ membar_has_effect(read_bits)) {
2592 __ cmp_and_br_short(Lscratch, 0, Assembler::equal, Assembler::pt, notVolatile);
2593 volatile_barrier(read_bits);
2594 __ bind(notVolatile);
2595 }
2596 }
2598 __ srl(Rflags, ConstantPoolCacheEntry::tos_state_shift, Rflags);
2599 // Make sure we don't need to mask Rflags after the above shift
2600 ConstantPoolCacheEntry::verify_tos_state_shift();
2602 // compute field type
2603 Label notInt, notShort, notChar, notObj, notByte, notLong, notFloat;
2605 if (is_static) {
2606 // putstatic with object type most likely, check that first
2607 __ cmp(Rflags, atos);
2608 __ br(Assembler::notEqual, false, Assembler::pt, notObj);
2609 __ delayed()->cmp(Rflags, itos);
2611 // atos
2612 {
2613 __ pop_ptr();
2614 __ verify_oop(Otos_i);
2615 do_oop_store(_masm, Rclass, Roffset, 0, Otos_i, G1_scratch, _bs->kind(), false);
2616 __ ba(checkVolatile);
2617 __ delayed()->tst(Lscratch);
2618 }
2620 __ bind(notObj);
2621 // cmp(Rflags, itos);
2622 __ br(Assembler::notEqual, false, Assembler::pt, notInt);
2623 __ delayed()->cmp(Rflags, btos);
2625 // itos
2626 {
2627 __ pop_i();
2628 __ st(Otos_i, Rclass, Roffset);
2629 __ ba(checkVolatile);
2630 __ delayed()->tst(Lscratch);
2631 }
2633 __ bind(notInt);
2634 } else {
2635 // putfield with int type most likely, check that first
2636 __ cmp(Rflags, itos);
2637 __ br(Assembler::notEqual, false, Assembler::pt, notInt);
2638 __ delayed()->cmp(Rflags, atos);
2640 // itos
2641 {
2642 __ pop_i();
2643 pop_and_check_object(Rclass);
2644 __ st(Otos_i, Rclass, Roffset);
2645 patch_bytecode(Bytecodes::_fast_iputfield, G3_scratch, G4_scratch, true, byte_no);
2646 __ ba(checkVolatile);
2647 __ delayed()->tst(Lscratch);
2648 }
2650 __ bind(notInt);
2651 // cmp(Rflags, atos);
2652 __ br(Assembler::notEqual, false, Assembler::pt, notObj);
2653 __ delayed()->cmp(Rflags, btos);
2655 // atos
2656 {
2657 __ pop_ptr();
2658 pop_and_check_object(Rclass);
2659 __ verify_oop(Otos_i);
2660 do_oop_store(_masm, Rclass, Roffset, 0, Otos_i, G1_scratch, _bs->kind(), false);
2661 patch_bytecode(Bytecodes::_fast_aputfield, G3_scratch, G4_scratch, true, byte_no);
2662 __ ba(checkVolatile);
2663 __ delayed()->tst(Lscratch);
2664 }
2666 __ bind(notObj);
2667 }
2669 // cmp(Rflags, btos);
2670 __ br(Assembler::notEqual, false, Assembler::pt, notByte);
2671 __ delayed()->cmp(Rflags, ltos);
2673 // btos
2674 {
2675 __ pop_i();
2676 if (!is_static) pop_and_check_object(Rclass);
2677 __ stb(Otos_i, Rclass, Roffset);
2678 if (!is_static) {
2679 patch_bytecode(Bytecodes::_fast_bputfield, G3_scratch, G4_scratch, true, byte_no);
2680 }
2681 __ ba(checkVolatile);
2682 __ delayed()->tst(Lscratch);
2683 }
2685 __ bind(notByte);
2686 // cmp(Rflags, ltos);
2687 __ br(Assembler::notEqual, false, Assembler::pt, notLong);
2688 __ delayed()->cmp(Rflags, ctos);
2690 // ltos
2691 {
2692 __ pop_l();
2693 if (!is_static) pop_and_check_object(Rclass);
2694 __ st_long(Otos_l, Rclass, Roffset);
2695 if (!is_static) {
2696 patch_bytecode(Bytecodes::_fast_lputfield, G3_scratch, G4_scratch, true, byte_no);
2697 }
2698 __ ba(checkVolatile);
2699 __ delayed()->tst(Lscratch);
2700 }
2702 __ bind(notLong);
2703 // cmp(Rflags, ctos);
2704 __ br(Assembler::notEqual, false, Assembler::pt, notChar);
2705 __ delayed()->cmp(Rflags, stos);
2707 // ctos (char)
2708 {
2709 __ pop_i();
2710 if (!is_static) pop_and_check_object(Rclass);
2711 __ sth(Otos_i, Rclass, Roffset);
2712 if (!is_static) {
2713 patch_bytecode(Bytecodes::_fast_cputfield, G3_scratch, G4_scratch, true, byte_no);
2714 }
2715 __ ba(checkVolatile);
2716 __ delayed()->tst(Lscratch);
2717 }
2719 __ bind(notChar);
2720 // cmp(Rflags, stos);
2721 __ br(Assembler::notEqual, false, Assembler::pt, notShort);
2722 __ delayed()->cmp(Rflags, ftos);
2724 // stos (short)
2725 {
2726 __ pop_i();
2727 if (!is_static) pop_and_check_object(Rclass);
2728 __ sth(Otos_i, Rclass, Roffset);
2729 if (!is_static) {
2730 patch_bytecode(Bytecodes::_fast_sputfield, G3_scratch, G4_scratch, true, byte_no);
2731 }
2732 __ ba(checkVolatile);
2733 __ delayed()->tst(Lscratch);
2734 }
2736 __ bind(notShort);
2737 // cmp(Rflags, ftos);
2738 __ br(Assembler::notZero, false, Assembler::pt, notFloat);
2739 __ delayed()->nop();
2741 // ftos
2742 {
2743 __ pop_f();
2744 if (!is_static) pop_and_check_object(Rclass);
2745 __ stf(FloatRegisterImpl::S, Ftos_f, Rclass, Roffset);
2746 if (!is_static) {
2747 patch_bytecode(Bytecodes::_fast_fputfield, G3_scratch, G4_scratch, true, byte_no);
2748 }
2749 __ ba(checkVolatile);
2750 __ delayed()->tst(Lscratch);
2751 }
2753 __ bind(notFloat);
2755 // dtos
2756 {
2757 __ pop_d();
2758 if (!is_static) pop_and_check_object(Rclass);
2759 __ stf(FloatRegisterImpl::D, Ftos_d, Rclass, Roffset);
2760 if (!is_static) {
2761 patch_bytecode(Bytecodes::_fast_dputfield, G3_scratch, G4_scratch, true, byte_no);
2762 }
2763 }
2765 __ bind(checkVolatile);
2766 __ tst(Lscratch);
2768 if (__ membar_has_effect(write_bits)) {
2769 // __ tst(Lscratch); in delay slot
2770 __ br(Assembler::zero, false, Assembler::pt, exit);
2771 __ delayed()->nop();
2772 volatile_barrier(Assembler::StoreLoad);
2773 __ bind(exit);
2774 }
2775 }
2777 void TemplateTable::fast_storefield(TosState state) {
2778 transition(state, vtos);
2779 Register Rcache = G3_scratch;
2780 Register Rclass = Rcache;
2781 Register Roffset= G4_scratch;
2782 Register Rflags = G1_scratch;
2783 ByteSize cp_base_offset = ConstantPoolCache::base_offset();
2785 jvmti_post_fast_field_mod();
2787 __ get_cache_and_index_at_bcp(Rcache, G4_scratch, 1);
2789 Assembler::Membar_mask_bits read_bits =
2790 Assembler::Membar_mask_bits(Assembler::LoadStore | Assembler::StoreStore);
2791 Assembler::Membar_mask_bits write_bits = Assembler::StoreLoad;
2793 Label notVolatile, checkVolatile, exit;
2794 if (__ membar_has_effect(read_bits) || __ membar_has_effect(write_bits)) {
2795 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::flags_offset(), Rflags);
2796 __ set((1 << ConstantPoolCacheEntry::is_volatile_shift), Lscratch);
2797 __ and3(Rflags, Lscratch, Lscratch);
2798 if (__ membar_has_effect(read_bits)) {
2799 __ cmp_and_br_short(Lscratch, 0, Assembler::equal, Assembler::pt, notVolatile);
2800 volatile_barrier(read_bits);
2801 __ bind(notVolatile);
2802 }
2803 }
2805 __ ld_ptr(Rcache, cp_base_offset + ConstantPoolCacheEntry::f2_offset(), Roffset);
2806 pop_and_check_object(Rclass);
2808 switch (bytecode()) {
2809 case Bytecodes::_fast_bputfield: __ stb(Otos_i, Rclass, Roffset); break;
2810 case Bytecodes::_fast_cputfield: /* fall through */
2811 case Bytecodes::_fast_sputfield: __ sth(Otos_i, Rclass, Roffset); break;
2812 case Bytecodes::_fast_iputfield: __ st(Otos_i, Rclass, Roffset); break;
2813 case Bytecodes::_fast_lputfield: __ st_long(Otos_l, Rclass, Roffset); break;
2814 case Bytecodes::_fast_fputfield:
2815 __ stf(FloatRegisterImpl::S, Ftos_f, Rclass, Roffset);
2816 break;
2817 case Bytecodes::_fast_dputfield:
2818 __ stf(FloatRegisterImpl::D, Ftos_d, Rclass, Roffset);
2819 break;
2820 case Bytecodes::_fast_aputfield:
2821 do_oop_store(_masm, Rclass, Roffset, 0, Otos_i, G1_scratch, _bs->kind(), false);
2822 break;
2823 default:
2824 ShouldNotReachHere();
2825 }
2827 if (__ membar_has_effect(write_bits)) {
2828 __ cmp_and_br_short(Lscratch, 0, Assembler::equal, Assembler::pt, exit);
2829 volatile_barrier(Assembler::StoreLoad);
2830 __ bind(exit);
2831 }
2832 }
2835 void TemplateTable::putfield(int byte_no) {
2836 putfield_or_static(byte_no, false);
2837 }
2839 void TemplateTable::putstatic(int byte_no) {
2840 putfield_or_static(byte_no, true);
2841 }
2844 void TemplateTable::fast_xaccess(TosState state) {
2845 transition(vtos, state);
2846 Register Rcache = G3_scratch;
2847 Register Roffset = G4_scratch;
2848 Register Rflags = G4_scratch;
2849 Register Rreceiver = Lscratch;
2851 __ ld_ptr(Llocals, 0, Rreceiver);
2853 // access constant pool cache (is resolved)
2854 __ get_cache_and_index_at_bcp(Rcache, G4_scratch, 2);
2855 __ ld_ptr(Rcache, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::f2_offset(), Roffset);
2856 __ add(Lbcp, 1, Lbcp); // needed to report exception at the correct bcp
2858 __ verify_oop(Rreceiver);
2859 __ null_check(Rreceiver);
2860 if (state == atos) {
2861 __ load_heap_oop(Rreceiver, Roffset, Otos_i);
2862 } else if (state == itos) {
2863 __ ld (Rreceiver, Roffset, Otos_i) ;
2864 } else if (state == ftos) {
2865 __ ldf(FloatRegisterImpl::S, Rreceiver, Roffset, Ftos_f);
2866 } else {
2867 ShouldNotReachHere();
2868 }
2870 Assembler::Membar_mask_bits membar_bits =
2871 Assembler::Membar_mask_bits(Assembler::LoadLoad | Assembler::LoadStore);
2872 if (__ membar_has_effect(membar_bits)) {
2874 // Get is_volatile value in Rflags and check if membar is needed
2875 __ ld_ptr(Rcache, ConstantPoolCache::base_offset() + ConstantPoolCacheEntry::flags_offset(), Rflags);
2877 // Test volatile
2878 Label notVolatile;
2879 __ set((1 << ConstantPoolCacheEntry::is_volatile_shift), Lscratch);
2880 __ btst(Rflags, Lscratch);
2881 __ br(Assembler::zero, false, Assembler::pt, notVolatile);
2882 __ delayed()->nop();
2883 volatile_barrier(membar_bits);
2884 __ bind(notVolatile);
2885 }
2887 __ interp_verify_oop(Otos_i, state, __FILE__, __LINE__);
2888 __ sub(Lbcp, 1, Lbcp);
2889 }
2891 //----------------------------------------------------------------------------------------------------
2892 // Calls
2894 void TemplateTable::count_calls(Register method, Register temp) {
2895 // implemented elsewhere
2896 ShouldNotReachHere();
2897 }
2899 void TemplateTable::prepare_invoke(int byte_no,
2900 Register method, // linked method (or i-klass)
2901 Register ra, // return address
2902 Register index, // itable index, MethodType, etc.
2903 Register recv, // if caller wants to see it
2904 Register flags // if caller wants to test it
2905 ) {
2906 // determine flags
2907 const Bytecodes::Code code = bytecode();
2908 const bool is_invokeinterface = code == Bytecodes::_invokeinterface;
2909 const bool is_invokedynamic = code == Bytecodes::_invokedynamic;
2910 const bool is_invokehandle = code == Bytecodes::_invokehandle;
2911 const bool is_invokevirtual = code == Bytecodes::_invokevirtual;
2912 const bool is_invokespecial = code == Bytecodes::_invokespecial;
2913 const bool load_receiver = (recv != noreg);
2914 assert(load_receiver == (code != Bytecodes::_invokestatic && code != Bytecodes::_invokedynamic), "");
2915 assert(recv == noreg || recv == O0, "");
2916 assert(flags == noreg || flags == O1, "");
2918 // setup registers & access constant pool cache
2919 if (recv == noreg) recv = O0;
2920 if (flags == noreg) flags = O1;
2921 const Register temp = O2;
2922 assert_different_registers(method, ra, index, recv, flags, temp);
2924 load_invoke_cp_cache_entry(byte_no, method, index, flags, is_invokevirtual, false, is_invokedynamic);
2926 __ mov(SP, O5_savedSP); // record SP that we wanted the callee to restore
2928 // maybe push appendix to arguments
2929 if (is_invokedynamic || is_invokehandle) {
2930 Label L_no_push;
2931 __ set((1 << ConstantPoolCacheEntry::has_appendix_shift), temp);
2932 __ btst(flags, temp);
2933 __ br(Assembler::zero, false, Assembler::pt, L_no_push);
2934 __ delayed()->nop();
2935 // Push the appendix as a trailing parameter.
2936 // This must be done before we get the receiver,
2937 // since the parameter_size includes it.
2938 assert(ConstantPoolCacheEntry::_indy_resolved_references_appendix_offset == 0, "appendix expected at index+0");
2939 __ load_resolved_reference_at_index(temp, index);
2940 __ verify_oop(temp);
2941 __ push_ptr(temp); // push appendix (MethodType, CallSite, etc.)
2942 __ bind(L_no_push);
2943 }
2945 // load receiver if needed (after appendix is pushed so parameter size is correct)
2946 if (load_receiver) {
2947 __ and3(flags, ConstantPoolCacheEntry::parameter_size_mask, temp); // get parameter size
2948 __ load_receiver(temp, recv); // __ argument_address uses Gargs but we need Lesp
2949 __ verify_oop(recv);
2950 }
2952 // compute return type
2953 __ srl(flags, ConstantPoolCacheEntry::tos_state_shift, ra);
2954 // Make sure we don't need to mask flags after the above shift
2955 ConstantPoolCacheEntry::verify_tos_state_shift();
2956 // load return address
2957 {
2958 const address table_addr = (is_invokeinterface || is_invokedynamic) ?
2959 (address)Interpreter::return_5_addrs_by_index_table() :
2960 (address)Interpreter::return_3_addrs_by_index_table();
2961 AddressLiteral table(table_addr);
2962 __ set(table, temp);
2963 __ sll(ra, LogBytesPerWord, ra);
2964 __ ld_ptr(Address(temp, ra), ra);
2965 }
2966 }
2969 void TemplateTable::generate_vtable_call(Register Rrecv, Register Rindex, Register Rret) {
2970 Register Rtemp = G4_scratch;
2971 Register Rcall = Rindex;
2972 assert_different_registers(Rcall, G5_method, Gargs, Rret);
2974 // get target Method* & entry point
2975 __ lookup_virtual_method(Rrecv, Rindex, G5_method);
2976 __ call_from_interpreter(Rcall, Gargs, Rret);
2977 }
2979 void TemplateTable::invokevirtual(int byte_no) {
2980 transition(vtos, vtos);
2981 assert(byte_no == f2_byte, "use this argument");
2983 Register Rscratch = G3_scratch;
2984 Register Rtemp = G4_scratch;
2985 Register Rret = Lscratch;
2986 Register O0_recv = O0;
2987 Label notFinal;
2989 load_invoke_cp_cache_entry(byte_no, G5_method, noreg, Rret, true, false, false);
2990 __ mov(SP, O5_savedSP); // record SP that we wanted the callee to restore
2992 // Check for vfinal
2993 __ set((1 << ConstantPoolCacheEntry::is_vfinal_shift), G4_scratch);
2994 __ btst(Rret, G4_scratch);
2995 __ br(Assembler::zero, false, Assembler::pt, notFinal);
2996 __ delayed()->and3(Rret, 0xFF, G4_scratch); // gets number of parameters
2998 patch_bytecode(Bytecodes::_fast_invokevfinal, Rscratch, Rtemp);
3000 invokevfinal_helper(Rscratch, Rret);
3002 __ bind(notFinal);
3004 __ mov(G5_method, Rscratch); // better scratch register
3005 __ load_receiver(G4_scratch, O0_recv); // gets receiverOop
3006 // receiver is in O0_recv
3007 __ verify_oop(O0_recv);
3009 // get return address
3010 AddressLiteral table(Interpreter::return_3_addrs_by_index_table());
3011 __ set(table, Rtemp);
3012 __ srl(Rret, ConstantPoolCacheEntry::tos_state_shift, Rret); // get return type
3013 // Make sure we don't need to mask Rret after the above shift
3014 ConstantPoolCacheEntry::verify_tos_state_shift();
3015 __ sll(Rret, LogBytesPerWord, Rret);
3016 __ ld_ptr(Rtemp, Rret, Rret); // get return address
3018 // get receiver klass
3019 __ null_check(O0_recv, oopDesc::klass_offset_in_bytes());
3020 __ load_klass(O0_recv, O0_recv);
3021 __ verify_klass_ptr(O0_recv);
3023 __ profile_virtual_call(O0_recv, O4);
3025 generate_vtable_call(O0_recv, Rscratch, Rret);
3026 }
3028 void TemplateTable::fast_invokevfinal(int byte_no) {
3029 transition(vtos, vtos);
3030 assert(byte_no == f2_byte, "use this argument");
3032 load_invoke_cp_cache_entry(byte_no, G5_method, noreg, Lscratch, true,
3033 /*is_invokevfinal*/true, false);
3034 __ mov(SP, O5_savedSP); // record SP that we wanted the callee to restore
3035 invokevfinal_helper(G3_scratch, Lscratch);
3036 }
3038 void TemplateTable::invokevfinal_helper(Register Rscratch, Register Rret) {
3039 Register Rtemp = G4_scratch;
3041 // Load receiver from stack slot
3042 __ ld_ptr(G5_method, in_bytes(Method::const_offset()), G4_scratch);
3043 __ lduh(G4_scratch, in_bytes(ConstMethod::size_of_parameters_offset()), G4_scratch);
3044 __ load_receiver(G4_scratch, O0);
3046 // receiver NULL check
3047 __ null_check(O0);
3049 __ profile_final_call(O4);
3051 // get return address
3052 AddressLiteral table(Interpreter::return_3_addrs_by_index_table());
3053 __ set(table, Rtemp);
3054 __ srl(Rret, ConstantPoolCacheEntry::tos_state_shift, Rret); // get return type
3055 // Make sure we don't need to mask Rret after the above shift
3056 ConstantPoolCacheEntry::verify_tos_state_shift();
3057 __ sll(Rret, LogBytesPerWord, Rret);
3058 __ ld_ptr(Rtemp, Rret, Rret); // get return address
3061 // do the call
3062 __ call_from_interpreter(Rscratch, Gargs, Rret);
3063 }
3066 void TemplateTable::invokespecial(int byte_no) {
3067 transition(vtos, vtos);
3068 assert(byte_no == f1_byte, "use this argument");
3070 const Register Rret = Lscratch;
3071 const Register O0_recv = O0;
3072 const Register Rscratch = G3_scratch;
3074 prepare_invoke(byte_no, G5_method, Rret, noreg, O0_recv); // get receiver also for null check
3075 __ null_check(O0_recv);
3077 // do the call
3078 __ profile_call(O4);
3079 __ call_from_interpreter(Rscratch, Gargs, Rret);
3080 }
3083 void TemplateTable::invokestatic(int byte_no) {
3084 transition(vtos, vtos);
3085 assert(byte_no == f1_byte, "use this argument");
3087 const Register Rret = Lscratch;
3088 const Register Rscratch = G3_scratch;
3090 prepare_invoke(byte_no, G5_method, Rret); // get f1 Method*
3092 // do the call
3093 __ profile_call(O4);
3094 __ call_from_interpreter(Rscratch, Gargs, Rret);
3095 }
3097 void TemplateTable::invokeinterface_object_method(Register RKlass,
3098 Register Rcall,
3099 Register Rret,
3100 Register Rflags) {
3101 Register Rscratch = G4_scratch;
3102 Register Rindex = Lscratch;
3104 assert_different_registers(Rscratch, Rindex, Rret);
3106 Label notFinal;
3108 // Check for vfinal
3109 __ set((1 << ConstantPoolCacheEntry::is_vfinal_shift), Rscratch);
3110 __ btst(Rflags, Rscratch);
3111 __ br(Assembler::zero, false, Assembler::pt, notFinal);
3112 __ delayed()->nop();
3114 __ profile_final_call(O4);
3116 // do the call - the index (f2) contains the Method*
3117 assert_different_registers(G5_method, Gargs, Rcall);
3118 __ mov(Rindex, G5_method);
3119 __ call_from_interpreter(Rcall, Gargs, Rret);
3120 __ bind(notFinal);
3122 __ profile_virtual_call(RKlass, O4);
3123 generate_vtable_call(RKlass, Rindex, Rret);
3124 }
3127 void TemplateTable::invokeinterface(int byte_no) {
3128 transition(vtos, vtos);
3129 assert(byte_no == f1_byte, "use this argument");
3131 const Register Rinterface = G1_scratch;
3132 const Register Rret = G3_scratch;
3133 const Register Rindex = Lscratch;
3134 const Register O0_recv = O0;
3135 const Register O1_flags = O1;
3136 const Register O2_Klass = O2;
3137 const Register Rscratch = G4_scratch;
3138 assert_different_registers(Rscratch, G5_method);
3140 prepare_invoke(byte_no, Rinterface, Rret, Rindex, O0_recv, O1_flags);
3142 // get receiver klass
3143 __ null_check(O0_recv, oopDesc::klass_offset_in_bytes());
3144 __ load_klass(O0_recv, O2_Klass);
3146 // Special case of invokeinterface called for virtual method of
3147 // java.lang.Object. See cpCacheOop.cpp for details.
3148 // This code isn't produced by javac, but could be produced by
3149 // another compliant java compiler.
3150 Label notMethod;
3151 __ set((1 << ConstantPoolCacheEntry::is_forced_virtual_shift), Rscratch);
3152 __ btst(O1_flags, Rscratch);
3153 __ br(Assembler::zero, false, Assembler::pt, notMethod);
3154 __ delayed()->nop();
3156 invokeinterface_object_method(O2_Klass, Rinterface, Rret, O1_flags);
3158 __ bind(notMethod);
3160 __ profile_virtual_call(O2_Klass, O4);
3162 //
3163 // find entry point to call
3164 //
3166 // compute start of first itableOffsetEntry (which is at end of vtable)
3167 const int base = InstanceKlass::vtable_start_offset() * wordSize;
3168 Label search;
3169 Register Rtemp = O1_flags;
3171 __ ld(O2_Klass, InstanceKlass::vtable_length_offset() * wordSize, Rtemp);
3172 if (align_object_offset(1) > 1) {
3173 __ round_to(Rtemp, align_object_offset(1));
3174 }
3175 __ sll(Rtemp, LogBytesPerWord, Rtemp); // Rscratch *= 4;
3176 if (Assembler::is_simm13(base)) {
3177 __ add(Rtemp, base, Rtemp);
3178 } else {
3179 __ set(base, Rscratch);
3180 __ add(Rscratch, Rtemp, Rtemp);
3181 }
3182 __ add(O2_Klass, Rtemp, Rscratch);
3184 __ bind(search);
3186 __ ld_ptr(Rscratch, itableOffsetEntry::interface_offset_in_bytes(), Rtemp);
3187 {
3188 Label ok;
3190 // Check that entry is non-null. Null entries are probably a bytecode
3191 // problem. If the interface isn't implemented by the receiver class,
3192 // the VM should throw IncompatibleClassChangeError. linkResolver checks
3193 // this too but that's only if the entry isn't already resolved, so we
3194 // need to check again.
3195 __ br_notnull_short( Rtemp, Assembler::pt, ok);
3196 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_IncompatibleClassChangeError));
3197 __ should_not_reach_here();
3198 __ bind(ok);
3199 }
3201 __ cmp(Rinterface, Rtemp);
3202 __ brx(Assembler::notEqual, true, Assembler::pn, search);
3203 __ delayed()->add(Rscratch, itableOffsetEntry::size() * wordSize, Rscratch);
3205 // entry found and Rscratch points to it
3206 __ ld(Rscratch, itableOffsetEntry::offset_offset_in_bytes(), Rscratch);
3208 assert(itableMethodEntry::method_offset_in_bytes() == 0, "adjust instruction below");
3209 __ sll(Rindex, exact_log2(itableMethodEntry::size() * wordSize), Rindex); // Rindex *= 8;
3210 __ add(Rscratch, Rindex, Rscratch);
3211 __ ld_ptr(O2_Klass, Rscratch, G5_method);
3213 // Check for abstract method error.
3214 {
3215 Label ok;
3216 __ br_notnull_short(G5_method, Assembler::pt, ok);
3217 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodError));
3218 __ should_not_reach_here();
3219 __ bind(ok);
3220 }
3222 Register Rcall = Rinterface;
3223 assert_different_registers(Rcall, G5_method, Gargs, Rret);
3225 __ call_from_interpreter(Rcall, Gargs, Rret);
3226 }
3228 void TemplateTable::invokehandle(int byte_no) {
3229 transition(vtos, vtos);
3230 assert(byte_no == f1_byte, "use this argument");
3232 if (!EnableInvokeDynamic) {
3233 // rewriter does not generate this bytecode
3234 __ should_not_reach_here();
3235 return;
3236 }
3238 const Register Rret = Lscratch;
3239 const Register G4_mtype = G4_scratch;
3240 const Register O0_recv = O0;
3241 const Register Rscratch = G3_scratch;
3243 prepare_invoke(byte_no, G5_method, Rret, G4_mtype, O0_recv);
3244 __ null_check(O0_recv);
3246 // G4: MethodType object (from cpool->resolved_references[f1], if necessary)
3247 // G5: MH.invokeExact_MT method (from f2)
3249 // Note: G4_mtype is already pushed (if necessary) by prepare_invoke
3251 // do the call
3252 __ verify_oop(G4_mtype);
3253 __ profile_final_call(O4); // FIXME: profile the LambdaForm also
3254 __ call_from_interpreter(Rscratch, Gargs, Rret);
3255 }
3258 void TemplateTable::invokedynamic(int byte_no) {
3259 transition(vtos, vtos);
3260 assert(byte_no == f1_byte, "use this argument");
3262 if (!EnableInvokeDynamic) {
3263 // We should not encounter this bytecode if !EnableInvokeDynamic.
3264 // The verifier will stop it. However, if we get past the verifier,
3265 // this will stop the thread in a reasonable way, without crashing the JVM.
3266 __ call_VM(noreg, CAST_FROM_FN_PTR(address,
3267 InterpreterRuntime::throw_IncompatibleClassChangeError));
3268 // the call_VM checks for exception, so we should never return here.
3269 __ should_not_reach_here();
3270 return;
3271 }
3273 const Register Rret = Lscratch;
3274 const Register G4_callsite = G4_scratch;
3275 const Register Rscratch = G3_scratch;
3277 prepare_invoke(byte_no, G5_method, Rret, G4_callsite);
3279 // G4: CallSite object (from cpool->resolved_references[f1])
3280 // G5: MH.linkToCallSite method (from f2)
3282 // Note: G4_callsite is already pushed by prepare_invoke
3284 // %%% should make a type profile for any invokedynamic that takes a ref argument
3285 // profile this call
3286 __ profile_call(O4);
3288 // do the call
3289 __ verify_oop(G4_callsite);
3290 __ call_from_interpreter(Rscratch, Gargs, Rret);
3291 }
3294 //----------------------------------------------------------------------------------------------------
3295 // Allocation
3297 void TemplateTable::_new() {
3298 transition(vtos, atos);
3300 Label slow_case;
3301 Label done;
3302 Label initialize_header;
3303 Label initialize_object; // including clearing the fields
3305 Register RallocatedObject = Otos_i;
3306 Register RinstanceKlass = O1;
3307 Register Roffset = O3;
3308 Register Rscratch = O4;
3310 __ get_2_byte_integer_at_bcp(1, Rscratch, Roffset, InterpreterMacroAssembler::Unsigned);
3311 __ get_cpool_and_tags(Rscratch, G3_scratch);
3312 // make sure the class we're about to instantiate has been resolved
3313 // This is done before loading InstanceKlass to be consistent with the order
3314 // how Constant Pool is updated (see ConstantPool::klass_at_put)
3315 __ add(G3_scratch, Array<u1>::base_offset_in_bytes(), G3_scratch);
3316 __ ldub(G3_scratch, Roffset, G3_scratch);
3317 __ cmp(G3_scratch, JVM_CONSTANT_Class);
3318 __ br(Assembler::notEqual, false, Assembler::pn, slow_case);
3319 __ delayed()->sll(Roffset, LogBytesPerWord, Roffset);
3320 // get InstanceKlass
3321 //__ sll(Roffset, LogBytesPerWord, Roffset); // executed in delay slot
3322 __ add(Roffset, sizeof(ConstantPool), Roffset);
3323 __ ld_ptr(Rscratch, Roffset, RinstanceKlass);
3325 // make sure klass is fully initialized:
3326 __ ldub(RinstanceKlass, in_bytes(InstanceKlass::init_state_offset()), G3_scratch);
3327 __ cmp(G3_scratch, InstanceKlass::fully_initialized);
3328 __ br(Assembler::notEqual, false, Assembler::pn, slow_case);
3329 __ delayed()->ld(RinstanceKlass, in_bytes(Klass::layout_helper_offset()), Roffset);
3331 // get instance_size in InstanceKlass (already aligned)
3332 //__ ld(RinstanceKlass, in_bytes(Klass::layout_helper_offset()), Roffset);
3334 // make sure klass does not have has_finalizer, or is abstract, or interface or java/lang/Class
3335 __ btst(Klass::_lh_instance_slow_path_bit, Roffset);
3336 __ br(Assembler::notZero, false, Assembler::pn, slow_case);
3337 __ delayed()->nop();
3339 // allocate the instance
3340 // 1) Try to allocate in the TLAB
3341 // 2) if fail, and the TLAB is not full enough to discard, allocate in the shared Eden
3342 // 3) if the above fails (or is not applicable), go to a slow case
3343 // (creates a new TLAB, etc.)
3345 const bool allow_shared_alloc =
3346 Universe::heap()->supports_inline_contig_alloc() && !CMSIncrementalMode;
3348 if(UseTLAB) {
3349 Register RoldTopValue = RallocatedObject;
3350 Register RtlabWasteLimitValue = G3_scratch;
3351 Register RnewTopValue = G1_scratch;
3352 Register RendValue = Rscratch;
3353 Register RfreeValue = RnewTopValue;
3355 // check if we can allocate in the TLAB
3356 __ ld_ptr(G2_thread, in_bytes(JavaThread::tlab_top_offset()), RoldTopValue); // sets up RalocatedObject
3357 __ ld_ptr(G2_thread, in_bytes(JavaThread::tlab_end_offset()), RendValue);
3358 __ add(RoldTopValue, Roffset, RnewTopValue);
3360 // if there is enough space, we do not CAS and do not clear
3361 __ cmp(RnewTopValue, RendValue);
3362 if(ZeroTLAB) {
3363 // the fields have already been cleared
3364 __ brx(Assembler::lessEqualUnsigned, true, Assembler::pt, initialize_header);
3365 } else {
3366 // initialize both the header and fields
3367 __ brx(Assembler::lessEqualUnsigned, true, Assembler::pt, initialize_object);
3368 }
3369 __ delayed()->st_ptr(RnewTopValue, G2_thread, in_bytes(JavaThread::tlab_top_offset()));
3371 if (allow_shared_alloc) {
3372 // Check if tlab should be discarded (refill_waste_limit >= free)
3373 __ ld_ptr(G2_thread, in_bytes(JavaThread::tlab_refill_waste_limit_offset()), RtlabWasteLimitValue);
3374 __ sub(RendValue, RoldTopValue, RfreeValue);
3375 #ifdef _LP64
3376 __ srlx(RfreeValue, LogHeapWordSize, RfreeValue);
3377 #else
3378 __ srl(RfreeValue, LogHeapWordSize, RfreeValue);
3379 #endif
3380 __ cmp_and_brx_short(RtlabWasteLimitValue, RfreeValue, Assembler::greaterEqualUnsigned, Assembler::pt, slow_case); // tlab waste is small
3382 // increment waste limit to prevent getting stuck on this slow path
3383 __ add(RtlabWasteLimitValue, ThreadLocalAllocBuffer::refill_waste_limit_increment(), RtlabWasteLimitValue);
3384 __ st_ptr(RtlabWasteLimitValue, G2_thread, in_bytes(JavaThread::tlab_refill_waste_limit_offset()));
3385 } else {
3386 // No allocation in the shared eden.
3387 __ ba_short(slow_case);
3388 }
3389 }
3391 // Allocation in the shared Eden
3392 if (allow_shared_alloc) {
3393 Register RoldTopValue = G1_scratch;
3394 Register RtopAddr = G3_scratch;
3395 Register RnewTopValue = RallocatedObject;
3396 Register RendValue = Rscratch;
3398 __ set((intptr_t)Universe::heap()->top_addr(), RtopAddr);
3400 Label retry;
3401 __ bind(retry);
3402 __ set((intptr_t)Universe::heap()->end_addr(), RendValue);
3403 __ ld_ptr(RendValue, 0, RendValue);
3404 __ ld_ptr(RtopAddr, 0, RoldTopValue);
3405 __ add(RoldTopValue, Roffset, RnewTopValue);
3407 // RnewTopValue contains the top address after the new object
3408 // has been allocated.
3409 __ cmp_and_brx_short(RnewTopValue, RendValue, Assembler::greaterUnsigned, Assembler::pn, slow_case);
3411 __ casx_under_lock(RtopAddr, RoldTopValue, RnewTopValue,
3412 VM_Version::v9_instructions_work() ? NULL :
3413 (address)StubRoutines::Sparc::atomic_memory_operation_lock_addr());
3415 // if someone beat us on the allocation, try again, otherwise continue
3416 __ cmp_and_brx_short(RoldTopValue, RnewTopValue, Assembler::notEqual, Assembler::pn, retry);
3418 // bump total bytes allocated by this thread
3419 // RoldTopValue and RtopAddr are dead, so can use G1 and G3
3420 __ incr_allocated_bytes(Roffset, G1_scratch, G3_scratch);
3421 }
3423 if (UseTLAB || Universe::heap()->supports_inline_contig_alloc()) {
3424 // clear object fields
3425 __ bind(initialize_object);
3426 __ deccc(Roffset, sizeof(oopDesc));
3427 __ br(Assembler::zero, false, Assembler::pt, initialize_header);
3428 __ delayed()->add(RallocatedObject, sizeof(oopDesc), G3_scratch);
3430 // initialize remaining object fields
3431 if (UseBlockZeroing) {
3432 // Use BIS for zeroing
3433 __ bis_zeroing(G3_scratch, Roffset, G1_scratch, initialize_header);
3434 } else {
3435 Label loop;
3436 __ subcc(Roffset, wordSize, Roffset);
3437 __ bind(loop);
3438 //__ subcc(Roffset, wordSize, Roffset); // executed above loop or in delay slot
3439 __ st_ptr(G0, G3_scratch, Roffset);
3440 __ br(Assembler::notEqual, false, Assembler::pt, loop);
3441 __ delayed()->subcc(Roffset, wordSize, Roffset);
3442 }
3443 __ ba_short(initialize_header);
3444 }
3446 // slow case
3447 __ bind(slow_case);
3448 __ get_2_byte_integer_at_bcp(1, G3_scratch, O2, InterpreterMacroAssembler::Unsigned);
3449 __ get_constant_pool(O1);
3451 call_VM(Otos_i, CAST_FROM_FN_PTR(address, InterpreterRuntime::_new), O1, O2);
3453 __ ba_short(done);
3455 // Initialize the header: mark, klass
3456 __ bind(initialize_header);
3458 if (UseBiasedLocking) {
3459 __ ld_ptr(RinstanceKlass, in_bytes(Klass::prototype_header_offset()), G4_scratch);
3460 } else {
3461 __ set((intptr_t)markOopDesc::prototype(), G4_scratch);
3462 }
3463 __ st_ptr(G4_scratch, RallocatedObject, oopDesc::mark_offset_in_bytes()); // mark
3464 __ store_klass_gap(G0, RallocatedObject); // klass gap if compressed
3465 __ store_klass(RinstanceKlass, RallocatedObject); // klass (last for cms)
3467 {
3468 SkipIfEqual skip_if(
3469 _masm, G4_scratch, &DTraceAllocProbes, Assembler::zero);
3470 // Trigger dtrace event
3471 __ push(atos);
3472 __ call_VM_leaf(noreg,
3473 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc), O0);
3474 __ pop(atos);
3475 }
3477 // continue
3478 __ bind(done);
3479 }
3483 void TemplateTable::newarray() {
3484 transition(itos, atos);
3485 __ ldub(Lbcp, 1, O1);
3486 call_VM(Otos_i, CAST_FROM_FN_PTR(address, InterpreterRuntime::newarray), O1, Otos_i);
3487 }
3490 void TemplateTable::anewarray() {
3491 transition(itos, atos);
3492 __ get_constant_pool(O1);
3493 __ get_2_byte_integer_at_bcp(1, G4_scratch, O2, InterpreterMacroAssembler::Unsigned);
3494 call_VM(Otos_i, CAST_FROM_FN_PTR(address, InterpreterRuntime::anewarray), O1, O2, Otos_i);
3495 }
3498 void TemplateTable::arraylength() {
3499 transition(atos, itos);
3500 Label ok;
3501 __ verify_oop(Otos_i);
3502 __ tst(Otos_i);
3503 __ throw_if_not_1_x( Assembler::notZero, ok );
3504 __ delayed()->ld(Otos_i, arrayOopDesc::length_offset_in_bytes(), Otos_i);
3505 __ throw_if_not_2( Interpreter::_throw_NullPointerException_entry, G3_scratch, ok);
3506 }
3509 void TemplateTable::checkcast() {
3510 transition(atos, atos);
3511 Label done, is_null, quicked, cast_ok, resolved;
3512 Register Roffset = G1_scratch;
3513 Register RobjKlass = O5;
3514 Register RspecifiedKlass = O4;
3516 // Check for casting a NULL
3517 __ br_null_short(Otos_i, Assembler::pn, is_null);
3519 // Get value klass in RobjKlass
3520 __ load_klass(Otos_i, RobjKlass); // get value klass
3522 // Get constant pool tag
3523 __ get_2_byte_integer_at_bcp(1, Lscratch, Roffset, InterpreterMacroAssembler::Unsigned);
3525 // See if the checkcast has been quickened
3526 __ get_cpool_and_tags(Lscratch, G3_scratch);
3527 __ add(G3_scratch, Array<u1>::base_offset_in_bytes(), G3_scratch);
3528 __ ldub(G3_scratch, Roffset, G3_scratch);
3529 __ cmp(G3_scratch, JVM_CONSTANT_Class);
3530 __ br(Assembler::equal, true, Assembler::pt, quicked);
3531 __ delayed()->sll(Roffset, LogBytesPerWord, Roffset);
3533 __ push_ptr(); // save receiver for result, and for GC
3534 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc) );
3535 __ get_vm_result_2(RspecifiedKlass);
3536 __ pop_ptr(Otos_i, G3_scratch); // restore receiver
3538 __ ba_short(resolved);
3540 // Extract target class from constant pool
3541 __ bind(quicked);
3542 __ add(Roffset, sizeof(ConstantPool), Roffset);
3543 __ ld_ptr(Lscratch, Roffset, RspecifiedKlass);
3544 __ bind(resolved);
3545 __ load_klass(Otos_i, RobjKlass); // get value klass
3547 // Generate a fast subtype check. Branch to cast_ok if no
3548 // failure. Throw exception if failure.
3549 __ gen_subtype_check( RobjKlass, RspecifiedKlass, G3_scratch, G4_scratch, G1_scratch, cast_ok );
3551 // Not a subtype; so must throw exception
3552 __ throw_if_not_x( Assembler::never, Interpreter::_throw_ClassCastException_entry, G3_scratch );
3554 __ bind(cast_ok);
3556 if (ProfileInterpreter) {
3557 __ ba_short(done);
3558 }
3559 __ bind(is_null);
3560 __ profile_null_seen(G3_scratch);
3561 __ bind(done);
3562 }
3565 void TemplateTable::instanceof() {
3566 Label done, is_null, quicked, resolved;
3567 transition(atos, itos);
3568 Register Roffset = G1_scratch;
3569 Register RobjKlass = O5;
3570 Register RspecifiedKlass = O4;
3572 // Check for casting a NULL
3573 __ br_null_short(Otos_i, Assembler::pt, is_null);
3575 // Get value klass in RobjKlass
3576 __ load_klass(Otos_i, RobjKlass); // get value klass
3578 // Get constant pool tag
3579 __ get_2_byte_integer_at_bcp(1, Lscratch, Roffset, InterpreterMacroAssembler::Unsigned);
3581 // See if the checkcast has been quickened
3582 __ get_cpool_and_tags(Lscratch, G3_scratch);
3583 __ add(G3_scratch, Array<u1>::base_offset_in_bytes(), G3_scratch);
3584 __ ldub(G3_scratch, Roffset, G3_scratch);
3585 __ cmp(G3_scratch, JVM_CONSTANT_Class);
3586 __ br(Assembler::equal, true, Assembler::pt, quicked);
3587 __ delayed()->sll(Roffset, LogBytesPerWord, Roffset);
3589 __ push_ptr(); // save receiver for result, and for GC
3590 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::quicken_io_cc) );
3591 __ get_vm_result_2(RspecifiedKlass);
3592 __ pop_ptr(Otos_i, G3_scratch); // restore receiver
3594 __ ba_short(resolved);
3596 // Extract target class from constant pool
3597 __ bind(quicked);
3598 __ add(Roffset, sizeof(ConstantPool), Roffset);
3599 __ get_constant_pool(Lscratch);
3600 __ ld_ptr(Lscratch, Roffset, RspecifiedKlass);
3601 __ bind(resolved);
3602 __ load_klass(Otos_i, RobjKlass); // get value klass
3604 // Generate a fast subtype check. Branch to cast_ok if no
3605 // failure. Return 0 if failure.
3606 __ or3(G0, 1, Otos_i); // set result assuming quick tests succeed
3607 __ gen_subtype_check( RobjKlass, RspecifiedKlass, G3_scratch, G4_scratch, G1_scratch, done );
3608 // Not a subtype; return 0;
3609 __ clr( Otos_i );
3611 if (ProfileInterpreter) {
3612 __ ba_short(done);
3613 }
3614 __ bind(is_null);
3615 __ profile_null_seen(G3_scratch);
3616 __ bind(done);
3617 }
3619 void TemplateTable::_breakpoint() {
3621 // Note: We get here even if we are single stepping..
3622 // jbug inists on setting breakpoints at every bytecode
3623 // even if we are in single step mode.
3625 transition(vtos, vtos);
3626 // get the unpatched byte code
3627 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::get_original_bytecode_at), Lmethod, Lbcp);
3628 __ mov(O0, Lbyte_code);
3630 // post the breakpoint event
3631 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::_breakpoint), Lmethod, Lbcp);
3633 // complete the execution of original bytecode
3634 __ dispatch_normal(vtos);
3635 }
3638 //----------------------------------------------------------------------------------------------------
3639 // Exceptions
3641 void TemplateTable::athrow() {
3642 transition(atos, vtos);
3644 // This works because exception is cached in Otos_i which is same as O0,
3645 // which is same as what throw_exception_entry_expects
3646 assert(Otos_i == Oexception, "see explanation above");
3648 __ verify_oop(Otos_i);
3649 __ null_check(Otos_i);
3650 __ throw_if_not_x(Assembler::never, Interpreter::throw_exception_entry(), G3_scratch);
3651 }
3654 //----------------------------------------------------------------------------------------------------
3655 // Synchronization
3658 // See frame_sparc.hpp for monitor block layout.
3659 // Monitor elements are dynamically allocated by growing stack as needed.
3661 void TemplateTable::monitorenter() {
3662 transition(atos, vtos);
3663 __ verify_oop(Otos_i);
3664 // Try to acquire a lock on the object
3665 // Repeat until succeeded (i.e., until
3666 // monitorenter returns true).
3668 { Label ok;
3669 __ tst(Otos_i);
3670 __ throw_if_not_1_x( Assembler::notZero, ok);
3671 __ delayed()->mov(Otos_i, Lscratch); // save obj
3672 __ throw_if_not_2( Interpreter::_throw_NullPointerException_entry, G3_scratch, ok);
3673 }
3675 assert(O0 == Otos_i, "Be sure where the object to lock is");
3677 // find a free slot in the monitor block
3680 // initialize entry pointer
3681 __ clr(O1); // points to free slot or NULL
3683 {
3684 Label entry, loop, exit;
3685 __ add( __ top_most_monitor(), O2 ); // last one to check
3686 __ ba( entry );
3687 __ delayed()->mov( Lmonitors, O3 ); // first one to check
3690 __ bind( loop );
3692 __ verify_oop(O4); // verify each monitor's oop
3693 __ tst(O4); // is this entry unused?
3694 if (VM_Version::v9_instructions_work())
3695 __ movcc( Assembler::zero, false, Assembler::ptr_cc, O3, O1);
3696 else {
3697 Label L;
3698 __ br( Assembler::zero, true, Assembler::pn, L );
3699 __ delayed()->mov(O3, O1); // rememeber this one if match
3700 __ bind(L);
3701 }
3703 __ cmp(O4, O0); // check if current entry is for same object
3704 __ brx( Assembler::equal, false, Assembler::pn, exit );
3705 __ delayed()->inc( O3, frame::interpreter_frame_monitor_size() * wordSize ); // check next one
3707 __ bind( entry );
3709 __ cmp( O3, O2 );
3710 __ brx( Assembler::lessEqualUnsigned, true, Assembler::pt, loop );
3711 __ delayed()->ld_ptr(O3, BasicObjectLock::obj_offset_in_bytes(), O4);
3713 __ bind( exit );
3714 }
3716 { Label allocated;
3718 // found free slot?
3719 __ br_notnull_short(O1, Assembler::pn, allocated);
3721 __ add_monitor_to_stack( false, O2, O3 );
3722 __ mov(Lmonitors, O1);
3724 __ bind(allocated);
3725 }
3727 // Increment bcp to point to the next bytecode, so exception handling for async. exceptions work correctly.
3728 // The object has already been poped from the stack, so the expression stack looks correct.
3729 __ inc(Lbcp);
3731 __ st_ptr(O0, O1, BasicObjectLock::obj_offset_in_bytes()); // store object
3732 __ lock_object(O1, O0);
3734 // check if there's enough space on the stack for the monitors after locking
3735 __ generate_stack_overflow_check(0);
3737 // The bcp has already been incremented. Just need to dispatch to next instruction.
3738 __ dispatch_next(vtos);
3739 }
3742 void TemplateTable::monitorexit() {
3743 transition(atos, vtos);
3744 __ verify_oop(Otos_i);
3745 __ tst(Otos_i);
3746 __ throw_if_not_x( Assembler::notZero, Interpreter::_throw_NullPointerException_entry, G3_scratch );
3748 assert(O0 == Otos_i, "just checking");
3750 { Label entry, loop, found;
3751 __ add( __ top_most_monitor(), O2 ); // last one to check
3752 __ ba(entry);
3753 // use Lscratch to hold monitor elem to check, start with most recent monitor,
3754 // By using a local it survives the call to the C routine.
3755 __ delayed()->mov( Lmonitors, Lscratch );
3757 __ bind( loop );
3759 __ verify_oop(O4); // verify each monitor's oop
3760 __ cmp(O4, O0); // check if current entry is for desired object
3761 __ brx( Assembler::equal, true, Assembler::pt, found );
3762 __ delayed()->mov(Lscratch, O1); // pass found entry as argument to monitorexit
3764 __ inc( Lscratch, frame::interpreter_frame_monitor_size() * wordSize ); // advance to next
3766 __ bind( entry );
3768 __ cmp( Lscratch, O2 );
3769 __ brx( Assembler::lessEqualUnsigned, true, Assembler::pt, loop );
3770 __ delayed()->ld_ptr(Lscratch, BasicObjectLock::obj_offset_in_bytes(), O4);
3772 call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_illegal_monitor_state_exception));
3773 __ should_not_reach_here();
3775 __ bind(found);
3776 }
3777 __ unlock_object(O1);
3778 }
3781 //----------------------------------------------------------------------------------------------------
3782 // Wide instructions
3784 void TemplateTable::wide() {
3785 transition(vtos, vtos);
3786 __ ldub(Lbcp, 1, G3_scratch);// get next bc
3787 __ sll(G3_scratch, LogBytesPerWord, G3_scratch);
3788 AddressLiteral ep(Interpreter::_wentry_point);
3789 __ set(ep, G4_scratch);
3790 __ ld_ptr(G4_scratch, G3_scratch, G3_scratch);
3791 __ jmp(G3_scratch, G0);
3792 __ delayed()->nop();
3793 // Note: the Lbcp increment step is part of the individual wide bytecode implementations
3794 }
3797 //----------------------------------------------------------------------------------------------------
3798 // Multi arrays
3800 void TemplateTable::multianewarray() {
3801 transition(vtos, atos);
3802 // put ndims * wordSize into Lscratch
3803 __ ldub( Lbcp, 3, Lscratch);
3804 __ sll( Lscratch, Interpreter::logStackElementSize, Lscratch);
3805 // Lesp points past last_dim, so set to O1 to first_dim address
3806 __ add( Lesp, Lscratch, O1);
3807 call_VM(Otos_i, CAST_FROM_FN_PTR(address, InterpreterRuntime::multianewarray), O1);
3808 __ add( Lesp, Lscratch, Lesp); // pop all dimensions off the stack
3809 }
3810 #endif /* !CC_INTERP */