Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/cpu/sparc/vm/interpreter_sparc.cpp
+++ new/src/cpu/sparc/vm/interpreter_sparc.cpp
1 1 /*
2 2 * Copyright 1997-2010 Sun Microsystems, Inc. All Rights Reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 21 * have any questions.
22 22 *
23 23 */
24 24
25 25 #include "incls/_precompiled.incl"
26 26 #include "incls/_interpreter_sparc.cpp.incl"
27 27
28 28
29 29
30 30 // Generation of Interpreter
31 31 //
32 32 // The InterpreterGenerator generates the interpreter into Interpreter::_code.
33 33
34 34
35 35 #define __ _masm->
36 36
37 37
38 38 //----------------------------------------------------------------------------------------------------
39 39
40 40
41 41
42 42
43 43 int AbstractInterpreter::BasicType_as_index(BasicType type) {
44 44 int i = 0;
45 45 switch (type) {
46 46 case T_BOOLEAN: i = 0; break;
47 47 case T_CHAR : i = 1; break;
48 48 case T_BYTE : i = 2; break;
49 49 case T_SHORT : i = 3; break;
50 50 case T_INT : i = 4; break;
51 51 case T_LONG : i = 5; break;
52 52 case T_VOID : i = 6; break;
53 53 case T_FLOAT : i = 7; break;
54 54 case T_DOUBLE : i = 8; break;
55 55 case T_OBJECT : i = 9; break;
56 56 case T_ARRAY : i = 9; break;
57 57 default : ShouldNotReachHere();
58 58 }
59 59 assert(0 <= i && i < AbstractInterpreter::number_of_result_handlers, "index out of bounds");
60 60 return i;
61 61 }
62 62
63 63
64 64 #ifndef _LP64
65 65 address AbstractInterpreterGenerator::generate_slow_signature_handler() {
66 66 address entry = __ pc();
67 67 Argument argv(0, true);
68 68
69 69 // We are in the jni transition frame. Save the last_java_frame corresponding to the
70 70 // outer interpreter frame
71 71 //
72 72 __ set_last_Java_frame(FP, noreg);
73 73 // make sure the interpreter frame we've pushed has a valid return pc
74 74 __ mov(O7, I7);
75 75 __ mov(Lmethod, G3_scratch);
76 76 __ mov(Llocals, G4_scratch);
77 77 __ save_frame(0);
78 78 __ mov(G2_thread, L7_thread_cache);
79 79 __ add(argv.address_in_frame(), O3);
80 80 __ mov(G2_thread, O0);
81 81 __ mov(G3_scratch, O1);
82 82 __ call(CAST_FROM_FN_PTR(address, InterpreterRuntime::slow_signature_handler), relocInfo::runtime_call_type);
83 83 __ delayed()->mov(G4_scratch, O2);
84 84 __ mov(L7_thread_cache, G2_thread);
85 85 __ reset_last_Java_frame();
86 86
87 87 // load the register arguments (the C code packed them as varargs)
88 88 for (Argument ldarg = argv.successor(); ldarg.is_register(); ldarg = ldarg.successor()) {
89 89 __ ld_ptr(ldarg.address_in_frame(), ldarg.as_register());
90 90 }
91 91 __ ret();
92 92 __ delayed()->
93 93 restore(O0, 0, Lscratch); // caller's Lscratch gets the result handler
94 94 return entry;
95 95 }
96 96
97 97
98 98 #else
99 99 // LP64 passes floating point arguments in F1, F3, F5, etc. instead of
100 100 // O0, O1, O2 etc..
101 101 // Doubles are passed in D0, D2, D4
102 102 // We store the signature of the first 16 arguments in the first argument
103 103 // slot because it will be overwritten prior to calling the native
104 104 // function, with the pointer to the JNIEnv.
105 105 // If LP64 there can be up to 16 floating point arguments in registers
106 106 // or 6 integer registers.
107 107 address AbstractInterpreterGenerator::generate_slow_signature_handler() {
108 108
109 109 enum {
110 110 non_float = 0,
111 111 float_sig = 1,
112 112 double_sig = 2,
113 113 sig_mask = 3
114 114 };
115 115
116 116 address entry = __ pc();
117 117 Argument argv(0, true);
118 118
119 119 // We are in the jni transition frame. Save the last_java_frame corresponding to the
120 120 // outer interpreter frame
121 121 //
122 122 __ set_last_Java_frame(FP, noreg);
123 123 // make sure the interpreter frame we've pushed has a valid return pc
124 124 __ mov(O7, I7);
125 125 __ mov(Lmethod, G3_scratch);
126 126 __ mov(Llocals, G4_scratch);
127 127 __ save_frame(0);
128 128 __ mov(G2_thread, L7_thread_cache);
129 129 __ add(argv.address_in_frame(), O3);
130 130 __ mov(G2_thread, O0);
131 131 __ mov(G3_scratch, O1);
132 132 __ call(CAST_FROM_FN_PTR(address, InterpreterRuntime::slow_signature_handler), relocInfo::runtime_call_type);
133 133 __ delayed()->mov(G4_scratch, O2);
134 134 __ mov(L7_thread_cache, G2_thread);
135 135 __ reset_last_Java_frame();
136 136
137 137
138 138 // load the register arguments (the C code packed them as varargs)
139 139 Address Sig = argv.address_in_frame(); // Argument 0 holds the signature
140 140 __ ld_ptr( Sig, G3_scratch ); // Get register argument signature word into G3_scratch
141 141 __ mov( G3_scratch, G4_scratch);
142 142 __ srl( G4_scratch, 2, G4_scratch); // Skip Arg 0
143 143 Label done;
144 144 for (Argument ldarg = argv.successor(); ldarg.is_float_register(); ldarg = ldarg.successor()) {
145 145 Label NonFloatArg;
146 146 Label LoadFloatArg;
147 147 Label LoadDoubleArg;
148 148 Label NextArg;
149 149 Address a = ldarg.address_in_frame();
150 150 __ andcc(G4_scratch, sig_mask, G3_scratch);
151 151 __ br(Assembler::zero, false, Assembler::pt, NonFloatArg);
152 152 __ delayed()->nop();
153 153
154 154 __ cmp(G3_scratch, float_sig );
155 155 __ br(Assembler::equal, false, Assembler::pt, LoadFloatArg);
156 156 __ delayed()->nop();
157 157
158 158 __ cmp(G3_scratch, double_sig );
159 159 __ br(Assembler::equal, false, Assembler::pt, LoadDoubleArg);
160 160 __ delayed()->nop();
161 161
162 162 __ bind(NonFloatArg);
163 163 // There are only 6 integer register arguments!
164 164 if ( ldarg.is_register() )
165 165 __ ld_ptr(ldarg.address_in_frame(), ldarg.as_register());
166 166 else {
167 167 // Optimization, see if there are any more args and get out prior to checking
168 168 // all 16 float registers. My guess is that this is rare.
169 169 // If is_register is false, then we are done the first six integer args.
170 170 __ tst(G4_scratch);
171 171 __ brx(Assembler::zero, false, Assembler::pt, done);
172 172 __ delayed()->nop();
173 173
174 174 }
175 175 __ ba(false, NextArg);
176 176 __ delayed()->srl( G4_scratch, 2, G4_scratch );
177 177
178 178 __ bind(LoadFloatArg);
179 179 __ ldf( FloatRegisterImpl::S, a, ldarg.as_float_register(), 4);
180 180 __ ba(false, NextArg);
181 181 __ delayed()->srl( G4_scratch, 2, G4_scratch );
182 182
183 183 __ bind(LoadDoubleArg);
184 184 __ ldf( FloatRegisterImpl::D, a, ldarg.as_double_register() );
185 185 __ ba(false, NextArg);
186 186 __ delayed()->srl( G4_scratch, 2, G4_scratch );
187 187
188 188 __ bind(NextArg);
189 189
190 190 }
191 191
192 192 __ bind(done);
193 193 __ ret();
194 194 __ delayed()->
195 195 restore(O0, 0, Lscratch); // caller's Lscratch gets the result handler
196 196 return entry;
197 197 }
198 198 #endif
199 199
200 200 void InterpreterGenerator::generate_counter_overflow(Label& Lcontinue) {
201 201
202 202 // Generate code to initiate compilation on the counter overflow.
203 203
204 204 // InterpreterRuntime::frequency_counter_overflow takes two arguments,
205 205 // the first indicates if the counter overflow occurs at a backwards branch (NULL bcp)
206 206 // and the second is only used when the first is true. We pass zero for both.
207 207 // The call returns the address of the verified entry point for the method or NULL
208 208 // if the compilation did not complete (either went background or bailed out).
209 209 __ set((int)false, O2);
210 210 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::frequency_counter_overflow), O2, O2, true);
211 211 // returns verified_entry_point or NULL
212 212 // we ignore it in any case
213 213 __ ba(false, Lcontinue);
214 214 __ delayed()->nop();
215 215
216 216 }
217 217
218 218
219 219 // End of helpers
220 220
221 221 // Various method entries
222 222
223 223 // Abstract method entry
224 224 // Attempt to execute abstract method. Throw exception
225 225 //
226 226 address InterpreterGenerator::generate_abstract_entry(void) {
227 227 address entry = __ pc();
|
↓ open down ↓ |
227 lines elided |
↑ open up ↑ |
228 228 // abstract method entry
229 229 // throw exception
230 230 __ call_VM(noreg, CAST_FROM_FN_PTR(address, InterpreterRuntime::throw_AbstractMethodError));
231 231 // the call_VM checks for exception, so we should never return here.
232 232 __ should_not_reach_here();
233 233 return entry;
234 234
235 235 }
236 236
237 237
238 -
239 238 // Method handle invoker
240 239 // Dispatch a method of the form java.dyn.MethodHandles::invoke(...)
241 240 address InterpreterGenerator::generate_method_handle_entry(void) {
242 241 if (!EnableMethodHandles) {
243 242 return generate_abstract_entry();
244 243 }
245 - return generate_abstract_entry(); //6815692//
246 -}
247 -
248 244
245 + return MethodHandles::generate_method_handle_interpreter_entry(_masm);
246 +}
249 247
250 248
251 249 //----------------------------------------------------------------------------------------------------
252 250 // Entry points & stack frame layout
253 251 //
254 252 // Here we generate the various kind of entries into the interpreter.
255 253 // The two main entry type are generic bytecode methods and native call method.
256 254 // These both come in synchronized and non-synchronized versions but the
257 255 // frame layout they create is very similar. The other method entry
258 256 // types are really just special purpose entries that are really entry
259 257 // and interpretation all in one. These are for trivial methods like
260 258 // accessor, empty, or special math methods.
261 259 //
262 260 // When control flow reaches any of the entry types for the interpreter
263 261 // the following holds ->
264 262 //
265 263 // C2 Calling Conventions:
266 264 //
267 265 // The entry code below assumes that the following registers are set
268 266 // when coming in:
269 267 // G5_method: holds the methodOop of the method to call
270 268 // Lesp: points to the TOS of the callers expression stack
271 269 // after having pushed all the parameters
272 270 //
273 271 // The entry code does the following to setup an interpreter frame
274 272 // pop parameters from the callers stack by adjusting Lesp
275 273 // set O0 to Lesp
276 274 // compute X = (max_locals - num_parameters)
277 275 // bump SP up by X to accomadate the extra locals
278 276 // compute X = max_expression_stack
279 277 // + vm_local_words
280 278 // + 16 words of register save area
281 279 // save frame doing a save sp, -X, sp growing towards lower addresses
282 280 // set Lbcp, Lmethod, LcpoolCache
283 281 // set Llocals to i0
284 282 // set Lmonitors to FP - rounded_vm_local_words
285 283 // set Lesp to Lmonitors - 4
286 284 //
287 285 // The frame has now been setup to do the rest of the entry code
288 286
289 287 // Try this optimization: Most method entries could live in a
290 288 // "one size fits all" stack frame without all the dynamic size
291 289 // calculations. It might be profitable to do all this calculation
292 290 // statically and approximately for "small enough" methods.
293 291
294 292 //-----------------------------------------------------------------------------------------------
295 293
296 294 // C1 Calling conventions
297 295 //
298 296 // Upon method entry, the following registers are setup:
299 297 //
300 298 // g2 G2_thread: current thread
301 299 // g5 G5_method: method to activate
302 300 // g4 Gargs : pointer to last argument
303 301 //
304 302 //
305 303 // Stack:
306 304 //
307 305 // +---------------+ <--- sp
308 306 // | |
309 307 // : reg save area :
310 308 // | |
311 309 // +---------------+ <--- sp + 0x40
312 310 // | |
313 311 // : extra 7 slots : note: these slots are not really needed for the interpreter (fix later)
314 312 // | |
315 313 // +---------------+ <--- sp + 0x5c
316 314 // | |
317 315 // : free :
318 316 // | |
319 317 // +---------------+ <--- Gargs
320 318 // | |
321 319 // : arguments :
322 320 // | |
323 321 // +---------------+
324 322 // | |
325 323 //
326 324 //
327 325 //
328 326 // AFTER FRAME HAS BEEN SETUP for method interpretation the stack looks like:
329 327 //
330 328 // +---------------+ <--- sp
331 329 // | |
332 330 // : reg save area :
333 331 // | |
334 332 // +---------------+ <--- sp + 0x40
335 333 // | |
336 334 // : extra 7 slots : note: these slots are not really needed for the interpreter (fix later)
337 335 // | |
338 336 // +---------------+ <--- sp + 0x5c
339 337 // | |
340 338 // : :
341 339 // | | <--- Lesp
342 340 // +---------------+ <--- Lmonitors (fp - 0x18)
343 341 // | VM locals |
344 342 // +---------------+ <--- fp
345 343 // | |
346 344 // : reg save area :
347 345 // | |
348 346 // +---------------+ <--- fp + 0x40
349 347 // | |
350 348 // : extra 7 slots : note: these slots are not really needed for the interpreter (fix later)
351 349 // | |
352 350 // +---------------+ <--- fp + 0x5c
353 351 // | |
354 352 // : free :
355 353 // | |
356 354 // +---------------+
357 355 // | |
358 356 // : nonarg locals :
359 357 // | |
360 358 // +---------------+
361 359 // | |
362 360 // : arguments :
363 361 // | | <--- Llocals
364 362 // +---------------+ <--- Gargs
365 363 // | |
366 364
367 365 address AbstractInterpreterGenerator::generate_method_entry(AbstractInterpreter::MethodKind kind) {
368 366 // determine code generation flags
369 367 bool synchronized = false;
370 368 address entry_point = NULL;
371 369
372 370 switch (kind) {
373 371 case Interpreter::zerolocals : break;
374 372 case Interpreter::zerolocals_synchronized: synchronized = true; break;
375 373 case Interpreter::native : entry_point = ((InterpreterGenerator*)this)->generate_native_entry(false); break;
376 374 case Interpreter::native_synchronized : entry_point = ((InterpreterGenerator*)this)->generate_native_entry(true); break;
377 375 case Interpreter::empty : entry_point = ((InterpreterGenerator*)this)->generate_empty_entry(); break;
378 376 case Interpreter::accessor : entry_point = ((InterpreterGenerator*)this)->generate_accessor_entry(); break;
379 377 case Interpreter::abstract : entry_point = ((InterpreterGenerator*)this)->generate_abstract_entry(); break;
380 378 case Interpreter::method_handle : entry_point = ((InterpreterGenerator*)this)->generate_method_handle_entry(); break;
381 379 case Interpreter::java_lang_math_sin : break;
382 380 case Interpreter::java_lang_math_cos : break;
383 381 case Interpreter::java_lang_math_tan : break;
384 382 case Interpreter::java_lang_math_sqrt : break;
385 383 case Interpreter::java_lang_math_abs : break;
386 384 case Interpreter::java_lang_math_log : break;
387 385 case Interpreter::java_lang_math_log10 : break;
388 386 default : ShouldNotReachHere(); break;
389 387 }
390 388
391 389 if (entry_point) return entry_point;
392 390
393 391 return ((InterpreterGenerator*)this)->generate_normal_entry(synchronized);
394 392 }
395 393
396 394
397 395 bool AbstractInterpreter::can_be_compiled(methodHandle m) {
398 396 // No special entry points that preclude compilation
399 397 return true;
400 398 }
401 399
402 400 // This method tells the deoptimizer how big an interpreted frame must be:
403 401 int AbstractInterpreter::size_activation(methodOop method,
404 402 int tempcount,
405 403 int popframe_extra_args,
406 404 int moncount,
407 405 int callee_param_count,
408 406 int callee_locals,
409 407 bool is_top_frame) {
410 408 return layout_activation(method,
411 409 tempcount,
412 410 popframe_extra_args,
413 411 moncount,
414 412 callee_param_count,
415 413 callee_locals,
416 414 (frame*)NULL,
417 415 (frame*)NULL,
418 416 is_top_frame);
419 417 }
420 418
421 419 void Deoptimization::unwind_callee_save_values(frame* f, vframeArray* vframe_array) {
422 420
423 421 // This code is sort of the equivalent of C2IAdapter::setup_stack_frame back in
424 422 // the days we had adapter frames. When we deoptimize a situation where a
425 423 // compiled caller calls a compiled caller will have registers it expects
426 424 // to survive the call to the callee. If we deoptimize the callee the only
427 425 // way we can restore these registers is to have the oldest interpreter
428 426 // frame that we create restore these values. That is what this routine
429 427 // will accomplish.
430 428
431 429 // At the moment we have modified c2 to not have any callee save registers
432 430 // so this problem does not exist and this routine is just a place holder.
433 431
434 432 assert(f->is_interpreted_frame(), "must be interpreted");
435 433 }
436 434
437 435
438 436 //----------------------------------------------------------------------------------------------------
439 437 // Exceptions
|
↓ open down ↓ |
181 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX