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