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