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