Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/prims/methodHandleWalk.cpp@fa83ab460c54
src/share/vm/prims/methodHandleWalk.cpp
Fri, 22 Oct 2010 15:59:34 -0400
- author
- acorn
- date
- Fri, 22 Oct 2010 15:59:34 -0400
- changeset 2233
- fa83ab460c54
- parent 2148
- d257356e35f0
- child 2314
- f95d63e2154a
- permissions
- -rw-r--r--
6988353: refactor contended sync subsystem
Summary: reduce complexity by factoring synchronizer.cpp
Reviewed-by: dholmes, never, coleenp
1 /*
2 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 /*
26 * JSR 292 reference implementation: method handle structure analysis
27 */
29 #include "incls/_precompiled.incl"
30 #include "incls/_methodHandleWalk.cpp.incl"
33 // -----------------------------------------------------------------------------
34 // MethodHandleChain
36 void MethodHandleChain::set_method_handle(Handle mh, TRAPS) {
37 if (!java_dyn_MethodHandle::is_instance(mh())) lose("bad method handle", CHECK);
39 // set current method handle and unpack partially
40 _method_handle = mh;
41 _is_last = false;
42 _is_bound = false;
43 _arg_slot = -1;
44 _arg_type = T_VOID;
45 _conversion = -1;
46 _last_invoke = Bytecodes::_nop; //arbitrary non-garbage
48 if (sun_dyn_DirectMethodHandle::is_instance(mh())) {
49 set_last_method(mh(), THREAD);
50 return;
51 }
52 if (sun_dyn_AdapterMethodHandle::is_instance(mh())) {
53 _conversion = AdapterMethodHandle_conversion();
54 assert(_conversion != -1, "bad conv value");
55 assert(sun_dyn_BoundMethodHandle::is_instance(mh()), "also BMH");
56 }
57 if (sun_dyn_BoundMethodHandle::is_instance(mh())) {
58 if (!is_adapter()) // keep AMH and BMH separate in this model
59 _is_bound = true;
60 _arg_slot = BoundMethodHandle_vmargslot();
61 oop target = MethodHandle_vmtarget_oop();
62 if (!is_bound() || java_dyn_MethodHandle::is_instance(target)) {
63 _arg_type = compute_bound_arg_type(target, NULL, _arg_slot, CHECK);
64 } else if (target != NULL && target->is_method()) {
65 methodOop m = (methodOop) target;
66 _arg_type = compute_bound_arg_type(NULL, m, _arg_slot, CHECK);
67 set_last_method(mh(), CHECK);
68 } else {
69 _is_bound = false; // lose!
70 }
71 }
72 if (is_bound() && _arg_type == T_VOID) {
73 lose("bad vmargslot", CHECK);
74 }
75 if (!is_bound() && !is_adapter()) {
76 lose("unrecognized MH type", CHECK);
77 }
78 }
81 void MethodHandleChain::set_last_method(oop target, TRAPS) {
82 _is_last = true;
83 klassOop receiver_limit_oop = NULL;
84 int flags = 0;
85 methodOop m = MethodHandles::decode_method(target, receiver_limit_oop, flags);
86 _last_method = methodHandle(THREAD, m);
87 if ((flags & MethodHandles::_dmf_has_receiver) == 0)
88 _last_invoke = Bytecodes::_invokestatic;
89 else if ((flags & MethodHandles::_dmf_does_dispatch) == 0)
90 _last_invoke = Bytecodes::_invokespecial;
91 else if ((flags & MethodHandles::_dmf_from_interface) != 0)
92 _last_invoke = Bytecodes::_invokeinterface;
93 else
94 _last_invoke = Bytecodes::_invokevirtual;
95 }
98 BasicType MethodHandleChain::compute_bound_arg_type(oop target, methodOop m, int arg_slot, TRAPS) {
99 // There is no direct indication of whether the argument is primitive or not.
100 // It is implied by the _vmentry code, and by the MethodType of the target.
101 // FIXME: Make it explicit MethodHandleImpl refactors out from MethodHandle
102 BasicType arg_type = T_VOID;
103 if (target != NULL) {
104 oop mtype = java_dyn_MethodHandle::type(target);
105 int arg_num = MethodHandles::argument_slot_to_argnum(mtype, arg_slot);
106 if (arg_num >= 0) {
107 oop ptype = java_dyn_MethodType::ptype(mtype, arg_num);
108 arg_type = java_lang_Class::as_BasicType(ptype);
109 }
110 } else if (m != NULL) {
111 // figure out the argument type from the slot
112 // FIXME: make this explicit in the MH
113 int cur_slot = m->size_of_parameters();
114 if (arg_slot >= cur_slot)
115 return T_VOID;
116 if (!m->is_static()) {
117 cur_slot -= type2size[T_OBJECT];
118 if (cur_slot == arg_slot)
119 return T_OBJECT;
120 }
121 for (SignatureStream ss(m->signature()); !ss.is_done(); ss.next()) {
122 BasicType bt = ss.type();
123 cur_slot -= type2size[bt];
124 if (cur_slot <= arg_slot) {
125 if (cur_slot == arg_slot)
126 arg_type = bt;
127 break;
128 }
129 }
130 }
131 if (arg_type == T_ARRAY)
132 arg_type = T_OBJECT;
133 return arg_type;
134 }
137 void MethodHandleChain::lose(const char* msg, TRAPS) {
138 assert(false, "lose");
139 _lose_message = msg;
140 if (!THREAD->is_Java_thread() || ((JavaThread*)THREAD)->thread_state() != _thread_in_vm) {
141 // throw a preallocated exception
142 THROW_OOP(Universe::virtual_machine_error_instance());
143 }
144 THROW_MSG(vmSymbols::java_lang_InternalError(), msg);
145 }
148 // -----------------------------------------------------------------------------
149 // MethodHandleWalker
151 Bytecodes::Code MethodHandleWalker::conversion_code(BasicType src, BasicType dest) {
152 if (is_subword_type(src)) {
153 src = T_INT; // all subword src types act like int
154 }
155 if (src == dest) {
156 return Bytecodes::_nop;
157 }
159 #define SRC_DEST(s,d) (((int)(s) << 4) + (int)(d))
160 switch (SRC_DEST(src, dest)) {
161 case SRC_DEST(T_INT, T_LONG): return Bytecodes::_i2l;
162 case SRC_DEST(T_INT, T_FLOAT): return Bytecodes::_i2f;
163 case SRC_DEST(T_INT, T_DOUBLE): return Bytecodes::_i2d;
164 case SRC_DEST(T_INT, T_BYTE): return Bytecodes::_i2b;
165 case SRC_DEST(T_INT, T_CHAR): return Bytecodes::_i2c;
166 case SRC_DEST(T_INT, T_SHORT): return Bytecodes::_i2s;
168 case SRC_DEST(T_LONG, T_INT): return Bytecodes::_l2i;
169 case SRC_DEST(T_LONG, T_FLOAT): return Bytecodes::_l2f;
170 case SRC_DEST(T_LONG, T_DOUBLE): return Bytecodes::_l2d;
172 case SRC_DEST(T_FLOAT, T_INT): return Bytecodes::_f2i;
173 case SRC_DEST(T_FLOAT, T_LONG): return Bytecodes::_f2l;
174 case SRC_DEST(T_FLOAT, T_DOUBLE): return Bytecodes::_f2d;
176 case SRC_DEST(T_DOUBLE, T_INT): return Bytecodes::_d2i;
177 case SRC_DEST(T_DOUBLE, T_LONG): return Bytecodes::_d2l;
178 case SRC_DEST(T_DOUBLE, T_FLOAT): return Bytecodes::_d2f;
179 }
180 #undef SRC_DEST
182 // cannot do it in one step, or at all
183 return Bytecodes::_illegal;
184 }
187 // -----------------------------------------------------------------------------
188 // MethodHandleWalker::walk
189 //
190 MethodHandleWalker::ArgToken
191 MethodHandleWalker::walk(TRAPS) {
192 ArgToken empty = ArgToken(); // Empty return value.
194 walk_incoming_state(CHECK_(empty));
196 for (;;) {
197 set_method_handle(chain().method_handle_oop());
199 assert(_outgoing_argc == argument_count_slow(), "empty slots under control");
201 if (chain().is_adapter()) {
202 int conv_op = chain().adapter_conversion_op();
203 int arg_slot = chain().adapter_arg_slot();
204 SlotState* arg_state = slot_state(arg_slot);
205 if (arg_state == NULL
206 && conv_op > sun_dyn_AdapterMethodHandle::OP_RETYPE_RAW) {
207 lose("bad argument index", CHECK_(empty));
208 }
210 // perform the adapter action
211 switch (chain().adapter_conversion_op()) {
212 case sun_dyn_AdapterMethodHandle::OP_RETYPE_ONLY:
213 // No changes to arguments; pass the bits through.
214 break;
216 case sun_dyn_AdapterMethodHandle::OP_RETYPE_RAW: {
217 // To keep the verifier happy, emit bitwise ("raw") conversions as needed.
218 // See MethodHandles::same_basic_type_for_arguments for allowed conversions.
219 Handle incoming_mtype(THREAD, chain().method_type_oop());
220 oop outgoing_mh_oop = chain().vmtarget_oop();
221 if (!java_dyn_MethodHandle::is_instance(outgoing_mh_oop))
222 lose("outgoing target not a MethodHandle", CHECK_(empty));
223 Handle outgoing_mtype(THREAD, java_dyn_MethodHandle::type(outgoing_mh_oop));
224 outgoing_mh_oop = NULL; // GC safety
226 int nptypes = java_dyn_MethodType::ptype_count(outgoing_mtype());
227 if (nptypes != java_dyn_MethodType::ptype_count(incoming_mtype()))
228 lose("incoming and outgoing parameter count do not agree", CHECK_(empty));
230 for (int i = 0, slot = _outgoing.length() - 1; slot >= 0; slot--) {
231 SlotState* arg_state = slot_state(slot);
232 if (arg_state->_type == T_VOID) continue;
233 ArgToken arg = _outgoing.at(slot)._arg;
235 klassOop in_klass = NULL;
236 klassOop out_klass = NULL;
237 BasicType inpbt = java_lang_Class::as_BasicType(java_dyn_MethodType::ptype(incoming_mtype(), i), &in_klass);
238 BasicType outpbt = java_lang_Class::as_BasicType(java_dyn_MethodType::ptype(outgoing_mtype(), i), &out_klass);
239 assert(inpbt == arg.basic_type(), "sanity");
241 if (inpbt != outpbt) {
242 vmIntrinsics::ID iid = vmIntrinsics::for_raw_conversion(inpbt, outpbt);
243 if (iid == vmIntrinsics::_none) {
244 lose("no raw conversion method", CHECK_(empty));
245 }
246 ArgToken arglist[2];
247 arglist[0] = arg; // outgoing 'this'
248 arglist[1] = ArgToken(); // sentinel
249 arg = make_invoke(NULL, iid, Bytecodes::_invokestatic, false, 1, &arglist[0], CHECK_(empty));
250 change_argument(inpbt, slot, outpbt, arg);
251 }
253 i++; // We need to skip void slots at the top of the loop.
254 }
256 BasicType inrbt = java_lang_Class::as_BasicType(java_dyn_MethodType::rtype(incoming_mtype()));
257 BasicType outrbt = java_lang_Class::as_BasicType(java_dyn_MethodType::rtype(outgoing_mtype()));
258 if (inrbt != outrbt) {
259 if (inrbt == T_INT && outrbt == T_VOID) {
260 // See comments in MethodHandles::same_basic_type_for_arguments.
261 } else {
262 assert(false, "IMPLEMENT ME");
263 lose("no raw conversion method", CHECK_(empty));
264 }
265 }
266 break;
267 }
269 case sun_dyn_AdapterMethodHandle::OP_CHECK_CAST: {
270 // checkcast the Nth outgoing argument in place
271 klassOop dest_klass = NULL;
272 BasicType dest = java_lang_Class::as_BasicType(chain().adapter_arg_oop(), &dest_klass);
273 assert(dest == T_OBJECT, "");
274 assert(dest == arg_state->_type, "");
275 ArgToken arg = arg_state->_arg;
276 ArgToken new_arg = make_conversion(T_OBJECT, dest_klass, Bytecodes::_checkcast, arg, CHECK_(empty));
277 assert(arg.index() == new_arg.index(), "should be the same index");
278 debug_only(dest_klass = (klassOop)badOop);
279 break;
280 }
282 case sun_dyn_AdapterMethodHandle::OP_PRIM_TO_PRIM: {
283 // i2l, etc., on the Nth outgoing argument in place
284 BasicType src = chain().adapter_conversion_src_type(),
285 dest = chain().adapter_conversion_dest_type();
286 Bytecodes::Code bc = conversion_code(src, dest);
287 ArgToken arg = arg_state->_arg;
288 if (bc == Bytecodes::_nop) {
289 break;
290 } else if (bc != Bytecodes::_illegal) {
291 arg = make_conversion(dest, NULL, bc, arg, CHECK_(empty));
292 } else if (is_subword_type(dest)) {
293 bc = conversion_code(src, T_INT);
294 if (bc != Bytecodes::_illegal) {
295 arg = make_conversion(dest, NULL, bc, arg, CHECK_(empty));
296 bc = conversion_code(T_INT, dest);
297 arg = make_conversion(dest, NULL, bc, arg, CHECK_(empty));
298 }
299 }
300 if (bc == Bytecodes::_illegal) {
301 lose("bad primitive conversion", CHECK_(empty));
302 }
303 change_argument(src, arg_slot, dest, arg);
304 break;
305 }
307 case sun_dyn_AdapterMethodHandle::OP_REF_TO_PRIM: {
308 // checkcast to wrapper type & call intValue, etc.
309 BasicType dest = chain().adapter_conversion_dest_type();
310 ArgToken arg = arg_state->_arg;
311 arg = make_conversion(T_OBJECT, SystemDictionary::box_klass(dest),
312 Bytecodes::_checkcast, arg, CHECK_(empty));
313 vmIntrinsics::ID unboxer = vmIntrinsics::for_unboxing(dest);
314 if (unboxer == vmIntrinsics::_none) {
315 lose("no unboxing method", CHECK_(empty));
316 }
317 ArgToken arglist[2];
318 arglist[0] = arg; // outgoing 'this'
319 arglist[1] = ArgToken(); // sentinel
320 arg = make_invoke(NULL, unboxer, Bytecodes::_invokevirtual, false, 1, &arglist[0], CHECK_(empty));
321 change_argument(T_OBJECT, arg_slot, dest, arg);
322 break;
323 }
325 case sun_dyn_AdapterMethodHandle::OP_PRIM_TO_REF: {
326 // call wrapper type.valueOf
327 BasicType src = chain().adapter_conversion_src_type();
328 ArgToken arg = arg_state->_arg;
329 vmIntrinsics::ID boxer = vmIntrinsics::for_boxing(src);
330 if (boxer == vmIntrinsics::_none) {
331 lose("no boxing method", CHECK_(empty));
332 }
333 ArgToken arglist[2];
334 arglist[0] = arg; // outgoing value
335 arglist[1] = ArgToken(); // sentinel
336 arg = make_invoke(NULL, boxer, Bytecodes::_invokevirtual, false, 1, &arglist[0], CHECK_(empty));
337 change_argument(src, arg_slot, T_OBJECT, arg);
338 break;
339 }
341 case sun_dyn_AdapterMethodHandle::OP_SWAP_ARGS: {
342 int dest_arg_slot = chain().adapter_conversion_vminfo();
343 if (!slot_has_argument(dest_arg_slot)) {
344 lose("bad swap index", CHECK_(empty));
345 }
346 // a simple swap between two arguments
347 SlotState* dest_arg_state = slot_state(dest_arg_slot);
348 SlotState temp = (*dest_arg_state);
349 (*dest_arg_state) = (*arg_state);
350 (*arg_state) = temp;
351 break;
352 }
354 case sun_dyn_AdapterMethodHandle::OP_ROT_ARGS: {
355 int dest_arg_slot = chain().adapter_conversion_vminfo();
356 if (!slot_has_argument(dest_arg_slot) || arg_slot == dest_arg_slot) {
357 lose("bad rotate index", CHECK_(empty));
358 }
359 SlotState* dest_arg_state = slot_state(dest_arg_slot);
360 // Rotate the source argument (plus following N slots) into the
361 // position occupied by the dest argument (plus following N slots).
362 int rotate_count = type2size[dest_arg_state->_type];
363 // (no other rotate counts are currently supported)
364 if (arg_slot < dest_arg_slot) {
365 for (int i = 0; i < rotate_count; i++) {
366 SlotState temp = _outgoing.at(arg_slot);
367 _outgoing.remove_at(arg_slot);
368 _outgoing.insert_before(dest_arg_slot + rotate_count - 1, temp);
369 }
370 } else { // arg_slot > dest_arg_slot
371 for (int i = 0; i < rotate_count; i++) {
372 SlotState temp = _outgoing.at(arg_slot + rotate_count - 1);
373 _outgoing.remove_at(arg_slot + rotate_count - 1);
374 _outgoing.insert_before(dest_arg_slot, temp);
375 }
376 }
377 break;
378 }
380 case sun_dyn_AdapterMethodHandle::OP_DUP_ARGS: {
381 int dup_slots = chain().adapter_conversion_stack_pushes();
382 if (dup_slots <= 0) {
383 lose("bad dup count", CHECK_(empty));
384 }
385 for (int i = 0; i < dup_slots; i++) {
386 SlotState* dup = slot_state(arg_slot + 2*i);
387 if (dup == NULL) break; // safety net
388 if (dup->_type != T_VOID) _outgoing_argc += 1;
389 _outgoing.insert_before(i, (*dup));
390 }
391 break;
392 }
394 case sun_dyn_AdapterMethodHandle::OP_DROP_ARGS: {
395 int drop_slots = -chain().adapter_conversion_stack_pushes();
396 if (drop_slots <= 0) {
397 lose("bad drop count", CHECK_(empty));
398 }
399 for (int i = 0; i < drop_slots; i++) {
400 SlotState* drop = slot_state(arg_slot);
401 if (drop == NULL) break; // safety net
402 if (drop->_type != T_VOID) _outgoing_argc -= 1;
403 _outgoing.remove_at(arg_slot);
404 }
405 break;
406 }
408 case sun_dyn_AdapterMethodHandle::OP_COLLECT_ARGS: { //NYI, may GC
409 lose("unimplemented", CHECK_(empty));
410 break;
411 }
413 case sun_dyn_AdapterMethodHandle::OP_SPREAD_ARGS: {
414 klassOop array_klass_oop = NULL;
415 BasicType array_type = java_lang_Class::as_BasicType(chain().adapter_arg_oop(),
416 &array_klass_oop);
417 assert(array_type == T_OBJECT, "");
418 assert(Klass::cast(array_klass_oop)->oop_is_array(), "");
419 arrayKlassHandle array_klass(THREAD, array_klass_oop);
420 debug_only(array_klass_oop = (klassOop)badOop);
422 klassOop element_klass_oop = NULL;
423 BasicType element_type = java_lang_Class::as_BasicType(array_klass->component_mirror(),
424 &element_klass_oop);
425 KlassHandle element_klass(THREAD, element_klass_oop);
426 debug_only(element_klass_oop = (klassOop)badOop);
428 // Fetch the argument, which we will cast to the required array type.
429 assert(arg_state->_type == T_OBJECT, "");
430 ArgToken array_arg = arg_state->_arg;
431 array_arg = make_conversion(T_OBJECT, array_klass(), Bytecodes::_checkcast, array_arg, CHECK_(empty));
432 change_argument(T_OBJECT, arg_slot, T_VOID, ArgToken(tt_void));
434 // Check the required length.
435 int spread_slots = 1 + chain().adapter_conversion_stack_pushes();
436 int spread_length = spread_slots;
437 if (type2size[element_type] == 2) {
438 if (spread_slots % 2 != 0) spread_slots = -1; // force error
439 spread_length = spread_slots / 2;
440 }
441 if (spread_slots < 0) {
442 lose("bad spread length", CHECK_(empty));
443 }
445 jvalue length_jvalue; length_jvalue.i = spread_length;
446 ArgToken length_arg = make_prim_constant(T_INT, &length_jvalue, CHECK_(empty));
447 // Call a built-in method known to the JVM to validate the length.
448 ArgToken arglist[3];
449 arglist[0] = array_arg; // value to check
450 arglist[1] = length_arg; // length to check
451 arglist[2] = ArgToken(); // sentinel
452 make_invoke(NULL, vmIntrinsics::_checkSpreadArgument,
453 Bytecodes::_invokestatic, false, 3, &arglist[0], CHECK_(empty));
455 // Spread out the array elements.
456 Bytecodes::Code aload_op = Bytecodes::_aaload;
457 if (element_type != T_OBJECT) {
458 lose("primitive array NYI", CHECK_(empty));
459 }
460 int ap = arg_slot;
461 for (int i = 0; i < spread_length; i++) {
462 jvalue offset_jvalue; offset_jvalue.i = i;
463 ArgToken offset_arg = make_prim_constant(T_INT, &offset_jvalue, CHECK_(empty));
464 ArgToken element_arg = make_fetch(element_type, element_klass(), aload_op, array_arg, offset_arg, CHECK_(empty));
465 change_argument(T_VOID, ap, element_type, element_arg);
466 ap += type2size[element_type];
467 }
468 break;
469 }
471 case sun_dyn_AdapterMethodHandle::OP_FLYBY: //NYI, runs Java code
472 case sun_dyn_AdapterMethodHandle::OP_RICOCHET: //NYI, runs Java code
473 lose("unimplemented", CHECK_(empty));
474 break;
476 default:
477 lose("bad adapter conversion", CHECK_(empty));
478 break;
479 }
480 }
482 if (chain().is_bound()) {
483 // push a new argument
484 BasicType arg_type = chain().bound_arg_type();
485 jint arg_slot = chain().bound_arg_slot();
486 oop arg_oop = chain().bound_arg_oop();
487 ArgToken arg;
488 if (arg_type == T_OBJECT) {
489 arg = make_oop_constant(arg_oop, CHECK_(empty));
490 } else {
491 jvalue arg_value;
492 BasicType bt = java_lang_boxing_object::get_value(arg_oop, &arg_value);
493 if (bt == arg_type) {
494 arg = make_prim_constant(arg_type, &arg_value, CHECK_(empty));
495 } else {
496 lose("bad bound value", CHECK_(empty));
497 }
498 }
499 debug_only(arg_oop = badOop);
500 change_argument(T_VOID, arg_slot, arg_type, arg);
501 }
503 // this test must come after the body of the loop
504 if (!chain().is_last()) {
505 chain().next(CHECK_(empty));
506 } else {
507 break;
508 }
509 }
511 // finish the sequence with a tail-call to the ultimate target
512 // parameters are passed in logical order (recv 1st), not slot order
513 ArgToken* arglist = NEW_RESOURCE_ARRAY(ArgToken, _outgoing.length() + 1);
514 int ap = 0;
515 for (int i = _outgoing.length() - 1; i >= 0; i--) {
516 SlotState* arg_state = slot_state(i);
517 if (arg_state->_type == T_VOID) continue;
518 arglist[ap++] = _outgoing.at(i)._arg;
519 }
520 assert(ap == _outgoing_argc, "");
521 arglist[ap] = ArgToken(); // add a sentinel, for the sake of asserts
522 return make_invoke(chain().last_method_oop(),
523 vmIntrinsics::_none,
524 chain().last_invoke_code(), true,
525 ap, arglist, THREAD);
526 }
529 // -----------------------------------------------------------------------------
530 // MethodHandleWalker::walk_incoming_state
531 //
532 void MethodHandleWalker::walk_incoming_state(TRAPS) {
533 Handle mtype(THREAD, chain().method_type_oop());
534 int nptypes = java_dyn_MethodType::ptype_count(mtype());
535 _outgoing_argc = nptypes;
536 int argp = nptypes - 1;
537 if (argp >= 0) {
538 _outgoing.at_grow(argp, make_state(T_VOID, ArgToken(tt_void))); // presize
539 }
540 for (int i = 0; i < nptypes; i++) {
541 klassOop arg_type_klass = NULL;
542 BasicType arg_type = java_lang_Class::as_BasicType(
543 java_dyn_MethodType::ptype(mtype(), i), &arg_type_klass);
544 int index = new_local_index(arg_type);
545 ArgToken arg = make_parameter(arg_type, arg_type_klass, index, CHECK);
546 debug_only(arg_type_klass = (klassOop) NULL);
547 _outgoing.at_put(argp, make_state(arg_type, arg));
548 if (type2size[arg_type] == 2) {
549 // add the extra slot, so we can model the JVM stack
550 _outgoing.insert_before(argp+1, make_state(T_VOID, ArgToken(tt_void)));
551 }
552 --argp;
553 }
554 // call make_parameter at the end of the list for the return type
555 klassOop ret_type_klass = NULL;
556 BasicType ret_type = java_lang_Class::as_BasicType(
557 java_dyn_MethodType::rtype(mtype()), &ret_type_klass);
558 ArgToken ret = make_parameter(ret_type, ret_type_klass, -1, CHECK);
559 // ignore ret; client can catch it if needed
560 }
563 // -----------------------------------------------------------------------------
564 // MethodHandleWalker::change_argument
565 //
566 // This is messy because some kinds of arguments are paired with
567 // companion slots containing an empty value.
568 void MethodHandleWalker::change_argument(BasicType old_type, int slot, BasicType new_type,
569 const ArgToken& new_arg) {
570 int old_size = type2size[old_type];
571 int new_size = type2size[new_type];
572 if (old_size == new_size) {
573 // simple case first
574 _outgoing.at_put(slot, make_state(new_type, new_arg));
575 } else if (old_size > new_size) {
576 for (int i = old_size - 1; i >= new_size; i--) {
577 assert((i != 0) == (_outgoing.at(slot + i)._type == T_VOID), "");
578 _outgoing.remove_at(slot + i);
579 }
580 if (new_size > 0)
581 _outgoing.at_put(slot, make_state(new_type, new_arg));
582 else
583 _outgoing_argc -= 1; // deleted a real argument
584 } else {
585 for (int i = old_size; i < new_size; i++) {
586 _outgoing.insert_before(slot + i, make_state(T_VOID, ArgToken(tt_void)));
587 }
588 _outgoing.at_put(slot, make_state(new_type, new_arg));
589 if (old_size == 0)
590 _outgoing_argc += 1; // inserted a real argument
591 }
592 }
595 #ifdef ASSERT
596 int MethodHandleWalker::argument_count_slow() {
597 int args_seen = 0;
598 for (int i = _outgoing.length() - 1; i >= 0; i--) {
599 if (_outgoing.at(i)._type != T_VOID) {
600 ++args_seen;
601 }
602 }
603 return args_seen;
604 }
605 #endif
608 // -----------------------------------------------------------------------------
609 // MethodHandleCompiler
611 MethodHandleCompiler::MethodHandleCompiler(Handle root, methodHandle callee, bool is_invokedynamic, TRAPS)
612 : MethodHandleWalker(root, is_invokedynamic, THREAD),
613 _callee(callee),
614 _thread(THREAD),
615 _bytecode(THREAD, 50),
616 _constants(THREAD, 10),
617 _cur_stack(0),
618 _max_stack(0),
619 _rtype(T_ILLEGAL)
620 {
622 // Element zero is always the null constant.
623 (void) _constants.append(NULL);
625 // Set name and signature index.
626 _name_index = cpool_symbol_put(_callee->name());
627 _signature_index = cpool_symbol_put(_callee->signature());
629 // Get return type klass.
630 Handle first_mtype(THREAD, chain().method_type_oop());
631 // _rklass is NULL for primitives.
632 _rtype = java_lang_Class::as_BasicType(java_dyn_MethodType::rtype(first_mtype()), &_rklass);
633 if (_rtype == T_ARRAY) _rtype = T_OBJECT;
635 int params = _callee->size_of_parameters(); // Incoming arguments plus receiver.
636 _num_params = for_invokedynamic() ? params - 1 : params; // XXX Check if callee is static?
637 }
640 // -----------------------------------------------------------------------------
641 // MethodHandleCompiler::compile
642 //
643 // Compile this MethodHandle into a bytecode adapter and return a
644 // methodOop.
645 methodHandle MethodHandleCompiler::compile(TRAPS) {
646 assert(_thread == THREAD, "must be same thread");
647 methodHandle nullHandle;
648 (void) walk(CHECK_(nullHandle));
649 return get_method_oop(CHECK_(nullHandle));
650 }
653 void MethodHandleCompiler::emit_bc(Bytecodes::Code op, int index) {
654 Bytecodes::check(op); // Are we legal?
656 switch (op) {
657 // b
658 case Bytecodes::_aconst_null:
659 case Bytecodes::_iconst_m1:
660 case Bytecodes::_iconst_0:
661 case Bytecodes::_iconst_1:
662 case Bytecodes::_iconst_2:
663 case Bytecodes::_iconst_3:
664 case Bytecodes::_iconst_4:
665 case Bytecodes::_iconst_5:
666 case Bytecodes::_lconst_0:
667 case Bytecodes::_lconst_1:
668 case Bytecodes::_fconst_0:
669 case Bytecodes::_fconst_1:
670 case Bytecodes::_fconst_2:
671 case Bytecodes::_dconst_0:
672 case Bytecodes::_dconst_1:
673 case Bytecodes::_iload_0:
674 case Bytecodes::_iload_1:
675 case Bytecodes::_iload_2:
676 case Bytecodes::_iload_3:
677 case Bytecodes::_lload_0:
678 case Bytecodes::_lload_1:
679 case Bytecodes::_lload_2:
680 case Bytecodes::_lload_3:
681 case Bytecodes::_fload_0:
682 case Bytecodes::_fload_1:
683 case Bytecodes::_fload_2:
684 case Bytecodes::_fload_3:
685 case Bytecodes::_dload_0:
686 case Bytecodes::_dload_1:
687 case Bytecodes::_dload_2:
688 case Bytecodes::_dload_3:
689 case Bytecodes::_aload_0:
690 case Bytecodes::_aload_1:
691 case Bytecodes::_aload_2:
692 case Bytecodes::_aload_3:
693 case Bytecodes::_istore_0:
694 case Bytecodes::_istore_1:
695 case Bytecodes::_istore_2:
696 case Bytecodes::_istore_3:
697 case Bytecodes::_lstore_0:
698 case Bytecodes::_lstore_1:
699 case Bytecodes::_lstore_2:
700 case Bytecodes::_lstore_3:
701 case Bytecodes::_fstore_0:
702 case Bytecodes::_fstore_1:
703 case Bytecodes::_fstore_2:
704 case Bytecodes::_fstore_3:
705 case Bytecodes::_dstore_0:
706 case Bytecodes::_dstore_1:
707 case Bytecodes::_dstore_2:
708 case Bytecodes::_dstore_3:
709 case Bytecodes::_astore_0:
710 case Bytecodes::_astore_1:
711 case Bytecodes::_astore_2:
712 case Bytecodes::_astore_3:
713 case Bytecodes::_i2l:
714 case Bytecodes::_i2f:
715 case Bytecodes::_i2d:
716 case Bytecodes::_i2b:
717 case Bytecodes::_i2c:
718 case Bytecodes::_i2s:
719 case Bytecodes::_l2i:
720 case Bytecodes::_l2f:
721 case Bytecodes::_l2d:
722 case Bytecodes::_f2i:
723 case Bytecodes::_f2l:
724 case Bytecodes::_f2d:
725 case Bytecodes::_d2i:
726 case Bytecodes::_d2l:
727 case Bytecodes::_d2f:
728 case Bytecodes::_ireturn:
729 case Bytecodes::_lreturn:
730 case Bytecodes::_freturn:
731 case Bytecodes::_dreturn:
732 case Bytecodes::_areturn:
733 case Bytecodes::_return:
734 assert(Bytecodes::format_bits(op, false) == Bytecodes::_fmt_b, "wrong bytecode format");
735 _bytecode.push(op);
736 break;
738 // bi
739 case Bytecodes::_ldc:
740 assert(Bytecodes::format_bits(op, false) == (Bytecodes::_fmt_b|Bytecodes::_fmt_has_k), "wrong bytecode format");
741 assert((char) index == index, "index does not fit in 8-bit");
742 _bytecode.push(op);
743 _bytecode.push(index);
744 break;
746 case Bytecodes::_iload:
747 case Bytecodes::_lload:
748 case Bytecodes::_fload:
749 case Bytecodes::_dload:
750 case Bytecodes::_aload:
751 case Bytecodes::_istore:
752 case Bytecodes::_lstore:
753 case Bytecodes::_fstore:
754 case Bytecodes::_dstore:
755 case Bytecodes::_astore:
756 assert(Bytecodes::format_bits(op, false) == Bytecodes::_fmt_bi, "wrong bytecode format");
757 assert((char) index == index, "index does not fit in 8-bit");
758 _bytecode.push(op);
759 _bytecode.push(index);
760 break;
762 // bkk
763 case Bytecodes::_ldc_w:
764 case Bytecodes::_ldc2_w:
765 case Bytecodes::_checkcast:
766 assert(Bytecodes::format_bits(op, false) == Bytecodes::_fmt_bkk, "wrong bytecode format");
767 assert((short) index == index, "index does not fit in 16-bit");
768 _bytecode.push(op);
769 _bytecode.push(index >> 8);
770 _bytecode.push(index);
771 break;
773 // bJJ
774 case Bytecodes::_invokestatic:
775 case Bytecodes::_invokespecial:
776 case Bytecodes::_invokevirtual:
777 assert(Bytecodes::format_bits(op, false) == Bytecodes::_fmt_bJJ, "wrong bytecode format");
778 assert((short) index == index, "index does not fit in 16-bit");
779 _bytecode.push(op);
780 _bytecode.push(index >> 8);
781 _bytecode.push(index);
782 break;
784 default:
785 ShouldNotReachHere();
786 }
787 }
790 void MethodHandleCompiler::emit_load(BasicType bt, int index) {
791 if (index <= 3) {
792 switch (bt) {
793 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
794 case T_INT: emit_bc(Bytecodes::cast(Bytecodes::_iload_0 + index)); break;
795 case T_LONG: emit_bc(Bytecodes::cast(Bytecodes::_lload_0 + index)); break;
796 case T_FLOAT: emit_bc(Bytecodes::cast(Bytecodes::_fload_0 + index)); break;
797 case T_DOUBLE: emit_bc(Bytecodes::cast(Bytecodes::_dload_0 + index)); break;
798 case T_OBJECT: emit_bc(Bytecodes::cast(Bytecodes::_aload_0 + index)); break;
799 default:
800 ShouldNotReachHere();
801 }
802 }
803 else {
804 switch (bt) {
805 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
806 case T_INT: emit_bc(Bytecodes::_iload, index); break;
807 case T_LONG: emit_bc(Bytecodes::_lload, index); break;
808 case T_FLOAT: emit_bc(Bytecodes::_fload, index); break;
809 case T_DOUBLE: emit_bc(Bytecodes::_dload, index); break;
810 case T_OBJECT: emit_bc(Bytecodes::_aload, index); break;
811 default:
812 ShouldNotReachHere();
813 }
814 }
815 stack_push(bt);
816 }
818 void MethodHandleCompiler::emit_store(BasicType bt, int index) {
819 if (index <= 3) {
820 switch (bt) {
821 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
822 case T_INT: emit_bc(Bytecodes::cast(Bytecodes::_istore_0 + index)); break;
823 case T_LONG: emit_bc(Bytecodes::cast(Bytecodes::_lstore_0 + index)); break;
824 case T_FLOAT: emit_bc(Bytecodes::cast(Bytecodes::_fstore_0 + index)); break;
825 case T_DOUBLE: emit_bc(Bytecodes::cast(Bytecodes::_dstore_0 + index)); break;
826 case T_OBJECT: emit_bc(Bytecodes::cast(Bytecodes::_astore_0 + index)); break;
827 default:
828 ShouldNotReachHere();
829 }
830 }
831 else {
832 switch (bt) {
833 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
834 case T_INT: emit_bc(Bytecodes::_istore, index); break;
835 case T_LONG: emit_bc(Bytecodes::_lstore, index); break;
836 case T_FLOAT: emit_bc(Bytecodes::_fstore, index); break;
837 case T_DOUBLE: emit_bc(Bytecodes::_dstore, index); break;
838 case T_OBJECT: emit_bc(Bytecodes::_astore, index); break;
839 default:
840 ShouldNotReachHere();
841 }
842 }
843 stack_pop(bt);
844 }
847 void MethodHandleCompiler::emit_load_constant(ArgToken arg) {
848 BasicType bt = arg.basic_type();
849 switch (bt) {
850 case T_INT: {
851 jint value = arg.get_jint();
852 if (-1 <= value && value <= 5)
853 emit_bc(Bytecodes::cast(Bytecodes::_iconst_0 + value));
854 else
855 emit_bc(Bytecodes::_ldc, cpool_int_put(value));
856 break;
857 }
858 case T_LONG: {
859 jlong value = arg.get_jlong();
860 if (0 <= value && value <= 1)
861 emit_bc(Bytecodes::cast(Bytecodes::_lconst_0 + (int) value));
862 else
863 emit_bc(Bytecodes::_ldc2_w, cpool_long_put(value));
864 break;
865 }
866 case T_FLOAT: {
867 jfloat value = arg.get_jfloat();
868 if (value == 0.0 || value == 1.0 || value == 2.0)
869 emit_bc(Bytecodes::cast(Bytecodes::_fconst_0 + (int) value));
870 else
871 emit_bc(Bytecodes::_ldc, cpool_float_put(value));
872 break;
873 }
874 case T_DOUBLE: {
875 jdouble value = arg.get_jdouble();
876 if (value == 0.0 || value == 1.0)
877 emit_bc(Bytecodes::cast(Bytecodes::_dconst_0 + (int) value));
878 else
879 emit_bc(Bytecodes::_ldc2_w, cpool_double_put(value));
880 break;
881 }
882 case T_OBJECT: {
883 Handle value = arg.object();
884 if (value.is_null())
885 emit_bc(Bytecodes::_aconst_null);
886 else
887 emit_bc(Bytecodes::_ldc, cpool_object_put(value));
888 break;
889 }
890 default:
891 ShouldNotReachHere();
892 }
893 stack_push(bt);
894 }
897 MethodHandleWalker::ArgToken
898 MethodHandleCompiler::make_conversion(BasicType type, klassOop tk, Bytecodes::Code op,
899 const ArgToken& src, TRAPS) {
901 BasicType srctype = src.basic_type();
902 int index = src.index();
904 switch (op) {
905 case Bytecodes::_i2l:
906 case Bytecodes::_i2f:
907 case Bytecodes::_i2d:
908 case Bytecodes::_i2b:
909 case Bytecodes::_i2c:
910 case Bytecodes::_i2s:
912 case Bytecodes::_l2i:
913 case Bytecodes::_l2f:
914 case Bytecodes::_l2d:
916 case Bytecodes::_f2i:
917 case Bytecodes::_f2l:
918 case Bytecodes::_f2d:
920 case Bytecodes::_d2i:
921 case Bytecodes::_d2l:
922 case Bytecodes::_d2f:
923 emit_load(srctype, index);
924 stack_pop(srctype); // pop the src type
925 emit_bc(op);
926 stack_push(type); // push the dest value
927 if (srctype != type)
928 index = new_local_index(type);
929 emit_store(type, index);
930 break;
932 case Bytecodes::_checkcast:
933 emit_load(srctype, index);
934 emit_bc(op, cpool_klass_put(tk));
935 emit_store(srctype, index);
936 break;
938 default:
939 ShouldNotReachHere();
940 }
942 return make_parameter(type, tk, index, THREAD);
943 }
946 // -----------------------------------------------------------------------------
947 // MethodHandleCompiler
948 //
950 static jvalue zero_jvalue;
952 // Emit bytecodes for the given invoke instruction.
953 MethodHandleWalker::ArgToken
954 MethodHandleCompiler::make_invoke(methodOop m, vmIntrinsics::ID iid,
955 Bytecodes::Code op, bool tailcall,
956 int argc, MethodHandleWalker::ArgToken* argv,
957 TRAPS) {
958 if (m == NULL) {
959 // Get the intrinsic methodOop.
960 m = vmIntrinsics::method_for(iid);
961 }
963 klassOop klass = m->method_holder();
964 symbolOop name = m->name();
965 symbolOop signature = m->signature();
967 if (tailcall) {
968 // Actually, in order to make these methods more recognizable,
969 // let's put them in holder classes MethodHandle and InvokeDynamic.
970 // That way stack walkers and compiler heuristics can recognize them.
971 _target_klass = (for_invokedynamic()
972 ? SystemDictionary::InvokeDynamic_klass()
973 : SystemDictionary::MethodHandle_klass());
974 }
976 // instanceKlass* ik = instanceKlass::cast(klass);
977 // tty->print_cr("MethodHandleCompiler::make_invoke: %s %s.%s%s", Bytecodes::name(op), ik->external_name(), name->as_C_string(), signature->as_C_string());
979 // Inline the method.
980 InvocationCounter* ic = m->invocation_counter();
981 ic->set_carry_flag();
983 for (int i = 0; i < argc; i++) {
984 ArgToken arg = argv[i];
985 TokenType tt = arg.token_type();
986 BasicType bt = arg.basic_type();
988 switch (tt) {
989 case tt_parameter:
990 case tt_temporary:
991 emit_load(bt, arg.index());
992 break;
993 case tt_constant:
994 emit_load_constant(arg);
995 break;
996 case tt_illegal:
997 // Sentinel.
998 assert(i == (argc - 1), "sentinel must be last entry");
999 break;
1000 case tt_void:
1001 default:
1002 ShouldNotReachHere();
1003 }
1004 }
1006 // Populate constant pool.
1007 int name_index = cpool_symbol_put(name);
1008 int signature_index = cpool_symbol_put(signature);
1009 int name_and_type_index = cpool_name_and_type_put(name_index, signature_index);
1010 int klass_index = cpool_klass_put(klass);
1011 int methodref_index = cpool_methodref_put(klass_index, name_and_type_index);
1013 // Generate invoke.
1014 switch (op) {
1015 case Bytecodes::_invokestatic:
1016 case Bytecodes::_invokespecial:
1017 case Bytecodes::_invokevirtual:
1018 emit_bc(op, methodref_index);
1019 break;
1020 case Bytecodes::_invokeinterface:
1021 Unimplemented();
1022 break;
1023 default:
1024 ShouldNotReachHere();
1025 }
1027 // If tailcall, we have walked all the way to a direct method handle.
1028 // Otherwise, make a recursive call to some helper routine.
1029 BasicType rbt = m->result_type();
1030 if (rbt == T_ARRAY) rbt = T_OBJECT;
1031 ArgToken ret;
1032 if (tailcall) {
1033 if (rbt != _rtype) {
1034 if (rbt == T_VOID) {
1035 // push a zero of the right sort
1036 ArgToken zero;
1037 if (_rtype == T_OBJECT) {
1038 zero = make_oop_constant(NULL, CHECK_(zero));
1039 } else {
1040 zero = make_prim_constant(_rtype, &zero_jvalue, CHECK_(zero));
1041 }
1042 emit_load_constant(zero);
1043 } else if (_rtype == T_VOID) {
1044 // We'll emit a _return with something on the stack.
1045 // It's OK to ignore what's on the stack.
1046 } else {
1047 tty->print_cr("*** rbt=%d != rtype=%d", rbt, _rtype);
1048 assert(false, "IMPLEMENT ME");
1049 }
1050 }
1051 switch (_rtype) {
1052 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
1053 case T_INT: emit_bc(Bytecodes::_ireturn); break;
1054 case T_LONG: emit_bc(Bytecodes::_lreturn); break;
1055 case T_FLOAT: emit_bc(Bytecodes::_freturn); break;
1056 case T_DOUBLE: emit_bc(Bytecodes::_dreturn); break;
1057 case T_VOID: emit_bc(Bytecodes::_return); break;
1058 case T_OBJECT:
1059 if (_rklass.not_null() && _rklass() != SystemDictionary::Object_klass())
1060 emit_bc(Bytecodes::_checkcast, cpool_klass_put(_rklass()));
1061 emit_bc(Bytecodes::_areturn);
1062 break;
1063 default: ShouldNotReachHere();
1064 }
1065 ret = ArgToken(); // Dummy return value.
1066 }
1067 else {
1068 stack_push(rbt); // The return value is already pushed onto the stack.
1069 int index = new_local_index(rbt);
1070 switch (rbt) {
1071 case T_BOOLEAN: case T_BYTE: case T_CHAR: case T_SHORT:
1072 case T_INT: case T_LONG: case T_FLOAT: case T_DOUBLE:
1073 case T_OBJECT:
1074 emit_store(rbt, index);
1075 ret = ArgToken(tt_temporary, rbt, index);
1076 break;
1077 case T_VOID:
1078 ret = ArgToken(tt_void);
1079 break;
1080 default:
1081 ShouldNotReachHere();
1082 }
1083 }
1085 return ret;
1086 }
1088 MethodHandleWalker::ArgToken
1089 MethodHandleCompiler::make_fetch(BasicType type, klassOop tk, Bytecodes::Code op,
1090 const MethodHandleWalker::ArgToken& base,
1091 const MethodHandleWalker::ArgToken& offset,
1092 TRAPS) {
1093 Unimplemented();
1094 return ArgToken();
1095 }
1098 int MethodHandleCompiler::cpool_primitive_put(BasicType bt, jvalue* con) {
1099 jvalue con_copy;
1100 assert(bt < T_OBJECT, "");
1101 if (type2aelembytes(bt) < jintSize) {
1102 // widen to int
1103 con_copy = (*con);
1104 con = &con_copy;
1105 switch (bt) {
1106 case T_BOOLEAN: con->i = (con->z ? 1 : 0); break;
1107 case T_BYTE: con->i = con->b; break;
1108 case T_CHAR: con->i = con->c; break;
1109 case T_SHORT: con->i = con->s; break;
1110 default: ShouldNotReachHere();
1111 }
1112 bt = T_INT;
1113 }
1115 // for (int i = 1, imax = _constants.length(); i < imax; i++) {
1116 // ConstantValue* con = _constants.at(i);
1117 // if (con != NULL && con->is_primitive() && con->_type == bt) {
1118 // bool match = false;
1119 // switch (type2size[bt]) {
1120 // case 1: if (pcon->_value.i == con->i) match = true; break;
1121 // case 2: if (pcon->_value.j == con->j) match = true; break;
1122 // }
1123 // if (match)
1124 // return i;
1125 // }
1126 // }
1127 ConstantValue* cv = new ConstantValue(bt, *con);
1128 int index = _constants.append(cv);
1130 // long and double entries take 2 slots, we add another empty entry.
1131 if (type2size[bt] == 2)
1132 (void) _constants.append(NULL);
1134 return index;
1135 }
1138 constantPoolHandle MethodHandleCompiler::get_constant_pool(TRAPS) const {
1139 constantPoolHandle nullHandle;
1140 bool is_conc_safe = true;
1141 constantPoolOop cpool_oop = oopFactory::new_constantPool(_constants.length(), is_conc_safe, CHECK_(nullHandle));
1142 constantPoolHandle cpool(THREAD, cpool_oop);
1144 // Fill the real constant pool skipping the zero element.
1145 for (int i = 1; i < _constants.length(); i++) {
1146 ConstantValue* cv = _constants.at(i);
1147 switch (cv->tag()) {
1148 case JVM_CONSTANT_Utf8: cpool->symbol_at_put( i, cv->symbol_oop() ); break;
1149 case JVM_CONSTANT_Integer: cpool->int_at_put( i, cv->get_jint() ); break;
1150 case JVM_CONSTANT_Float: cpool->float_at_put( i, cv->get_jfloat() ); break;
1151 case JVM_CONSTANT_Long: cpool->long_at_put( i, cv->get_jlong() ); break;
1152 case JVM_CONSTANT_Double: cpool->double_at_put( i, cv->get_jdouble() ); break;
1153 case JVM_CONSTANT_Class: cpool->klass_at_put( i, cv->klass_oop() ); break;
1154 case JVM_CONSTANT_Methodref: cpool->method_at_put( i, cv->first_index(), cv->second_index()); break;
1155 case JVM_CONSTANT_NameAndType: cpool->name_and_type_at_put(i, cv->first_index(), cv->second_index()); break;
1156 case JVM_CONSTANT_Object: cpool->object_at_put( i, cv->object_oop() ); break;
1157 default: ShouldNotReachHere();
1158 }
1160 switch (cv->tag()) {
1161 case JVM_CONSTANT_Long:
1162 case JVM_CONSTANT_Double:
1163 i++; // Skip empty entry.
1164 assert(_constants.at(i) == NULL, "empty entry");
1165 break;
1166 }
1167 }
1169 // Set the constant pool holder to the target method's class.
1170 cpool->set_pool_holder(_target_klass());
1172 return cpool;
1173 }
1176 methodHandle MethodHandleCompiler::get_method_oop(TRAPS) const {
1177 methodHandle nullHandle;
1178 // Create a method that holds the generated bytecode. invokedynamic
1179 // has no receiver, normal MH calls do.
1180 int flags_bits;
1181 if (for_invokedynamic())
1182 flags_bits = (/*JVM_MH_INVOKE_BITS |*/ JVM_ACC_PUBLIC | JVM_ACC_FINAL | JVM_ACC_SYNTHETIC | JVM_ACC_STATIC);
1183 else
1184 flags_bits = (/*JVM_MH_INVOKE_BITS |*/ JVM_ACC_PUBLIC | JVM_ACC_FINAL | JVM_ACC_SYNTHETIC);
1186 bool is_conc_safe = true;
1187 methodOop m_oop = oopFactory::new_method(bytecode_length(),
1188 accessFlags_from(flags_bits),
1189 0, 0, 0, is_conc_safe, CHECK_(nullHandle));
1190 methodHandle m(THREAD, m_oop);
1191 m_oop = NULL; // oop not GC safe
1193 constantPoolHandle cpool = get_constant_pool(CHECK_(nullHandle));
1194 m->set_constants(cpool());
1196 m->set_name_index(_name_index);
1197 m->set_signature_index(_signature_index);
1199 m->set_code((address) bytecode());
1201 m->set_max_stack(_max_stack);
1202 m->set_max_locals(max_locals());
1203 m->set_size_of_parameters(_num_params);
1205 typeArrayHandle exception_handlers(THREAD, Universe::the_empty_int_array());
1206 m->set_exception_table(exception_handlers());
1208 // Set the carry bit of the invocation counter to force inlining of
1209 // the adapter.
1210 InvocationCounter* ic = m->invocation_counter();
1211 ic->set_carry_flag();
1213 // Rewrite the method and set up the constant pool cache.
1214 objArrayOop m_array = oopFactory::new_system_objArray(1, CHECK_(nullHandle));
1215 objArrayHandle methods(THREAD, m_array);
1216 methods->obj_at_put(0, m());
1217 Rewriter::rewrite(_target_klass(), cpool, methods, CHECK_(nullHandle)); // Use fake class.
1219 #ifndef PRODUCT
1220 if (TraceMethodHandles) {
1221 m->print();
1222 m->print_codes();
1223 }
1224 #endif //PRODUCT
1226 assert(m->is_method_handle_adapter(), "must be recognized as an adapter");
1227 return m;
1228 }
1231 #ifndef PRODUCT
1233 #if 0
1234 // MH printer for debugging.
1236 class MethodHandlePrinter : public MethodHandleWalker {
1237 private:
1238 outputStream* _out;
1239 bool _verbose;
1240 int _temp_num;
1241 stringStream _strbuf;
1242 const char* strbuf() {
1243 const char* s = _strbuf.as_string();
1244 _strbuf.reset();
1245 return s;
1246 }
1247 ArgToken token(const char* str) {
1248 return (ArgToken) str;
1249 }
1250 void start_params() {
1251 _out->print("(");
1252 }
1253 void end_params() {
1254 if (_verbose) _out->print("\n");
1255 _out->print(") => {");
1256 }
1257 void put_type_name(BasicType type, klassOop tk, outputStream* s) {
1258 const char* kname = NULL;
1259 if (tk != NULL)
1260 kname = Klass::cast(tk)->external_name();
1261 s->print("%s", (kname != NULL) ? kname : type2name(type));
1262 }
1263 ArgToken maybe_make_temp(const char* statement_op, BasicType type, const char* temp_name) {
1264 const char* value = strbuf();
1265 if (!_verbose) return token(value);
1266 // make an explicit binding for each separate value
1267 _strbuf.print("%s%d", temp_name, ++_temp_num);
1268 const char* temp = strbuf();
1269 _out->print("\n %s %s %s = %s;", statement_op, type2name(type), temp, value);
1270 return token(temp);
1271 }
1273 public:
1274 MethodHandlePrinter(Handle root, bool verbose, outputStream* out, TRAPS)
1275 : MethodHandleWalker(root, THREAD),
1276 _out(out),
1277 _verbose(verbose),
1278 _temp_num(0)
1279 {
1280 start_params();
1281 }
1282 virtual ArgToken make_parameter(BasicType type, klassOop tk, int argnum, TRAPS) {
1283 if (argnum < 0) {
1284 end_params();
1285 return NULL;
1286 }
1287 if (argnum == 0) {
1288 _out->print(_verbose ? "\n " : "");
1289 } else {
1290 _out->print(_verbose ? ",\n " : ", ");
1291 }
1292 if (argnum >= _temp_num)
1293 _temp_num = argnum;
1294 // generate an argument name
1295 _strbuf.print("a%d", argnum);
1296 const char* arg = strbuf();
1297 put_type_name(type, tk, _out);
1298 _out->print(" %s", arg);
1299 return token(arg);
1300 }
1301 virtual ArgToken make_oop_constant(oop con, TRAPS) {
1302 if (con == NULL)
1303 _strbuf.print("null");
1304 else
1305 con->print_value_on(&_strbuf);
1306 if (_strbuf.size() == 0) { // yuck
1307 _strbuf.print("(a ");
1308 put_type_name(T_OBJECT, con->klass(), &_strbuf);
1309 _strbuf.print(")");
1310 }
1311 return maybe_make_temp("constant", T_OBJECT, "k");
1312 }
1313 virtual ArgToken make_prim_constant(BasicType type, jvalue* con, TRAPS) {
1314 java_lang_boxing_object::print(type, con, &_strbuf);
1315 return maybe_make_temp("constant", type, "k");
1316 }
1317 virtual ArgToken make_conversion(BasicType type, klassOop tk, Bytecodes::Code op, ArgToken src, TRAPS) {
1318 _strbuf.print("%s(%s", Bytecodes::name(op), (const char*)src);
1319 if (tk != NULL) {
1320 _strbuf.print(", ");
1321 put_type_name(type, tk, &_strbuf);
1322 }
1323 _strbuf.print(")");
1324 return maybe_make_temp("convert", type, "v");
1325 }
1326 virtual ArgToken make_fetch(BasicType type, klassOop tk, Bytecodes::Code op, ArgToken base, ArgToken offset, TRAPS) {
1327 _strbuf.print("%s(%s, %s", Bytecodes::name(op), (const char*)base, (const char*)offset);
1328 if (tk != NULL) {
1329 _strbuf.print(", ");
1330 put_type_name(type, tk, &_strbuf);
1331 }
1332 _strbuf.print(")");
1333 return maybe_make_temp("fetch", type, "x");
1334 }
1335 virtual ArgToken make_invoke(methodOop m, vmIntrinsics::ID iid,
1336 Bytecodes::Code op, bool tailcall,
1337 int argc, ArgToken* argv, TRAPS) {
1338 symbolOop name, sig;
1339 if (m != NULL) {
1340 name = m->name();
1341 sig = m->signature();
1342 } else {
1343 name = vmSymbols::symbol_at(vmIntrinsics::name_for(iid));
1344 sig = vmSymbols::symbol_at(vmIntrinsics::signature_for(iid));
1345 }
1346 _strbuf.print("%s %s%s(", Bytecodes::name(op), name->as_C_string(), sig->as_C_string());
1347 for (int i = 0; i < argc; i++) {
1348 _strbuf.print("%s%s", (i > 0 ? ", " : ""), (const char*)argv[i]);
1349 }
1350 _strbuf.print(")");
1351 if (!tailcall) {
1352 BasicType rt = char2type(sig->byte_at(sig->utf8_length()-1));
1353 if (rt == T_ILLEGAL) rt = T_OBJECT; // ';' at the end of '(...)L...;'
1354 return maybe_make_temp("invoke", rt, "x");
1355 } else {
1356 const char* ret = strbuf();
1357 _out->print(_verbose ? "\n return " : " ");
1358 _out->print("%s", ret);
1359 _out->print(_verbose ? "\n}\n" : " }");
1360 }
1361 return ArgToken();
1362 }
1364 virtual void set_method_handle(oop mh) {
1365 if (WizardMode && Verbose) {
1366 tty->print("\n--- next target: ");
1367 mh->print();
1368 }
1369 }
1371 static void print(Handle root, bool verbose, outputStream* out, TRAPS) {
1372 ResourceMark rm;
1373 MethodHandlePrinter printer(root, verbose, out, CHECK);
1374 printer.walk(CHECK);
1375 out->print("\n");
1376 }
1377 static void print(Handle root, bool verbose = Verbose, outputStream* out = tty) {
1378 EXCEPTION_MARK;
1379 ResourceMark rm;
1380 MethodHandlePrinter printer(root, verbose, out, THREAD);
1381 if (!HAS_PENDING_EXCEPTION)
1382 printer.walk(THREAD);
1383 if (HAS_PENDING_EXCEPTION) {
1384 oop ex = PENDING_EXCEPTION;
1385 CLEAR_PENDING_EXCEPTION;
1386 out->print("\n*** ");
1387 if (ex != Universe::virtual_machine_error_instance())
1388 ex->print_on(out);
1389 else
1390 out->print("lose: %s", printer.lose_message());
1391 out->print("\n}\n");
1392 }
1393 out->print("\n");
1394 }
1395 };
1396 #endif // 0
1398 extern "C"
1399 void print_method_handle(oop mh) {
1400 if (!mh->is_oop()) {
1401 tty->print_cr("*** not a method handle: "INTPTR_FORMAT, (intptr_t)mh);
1402 } else if (java_dyn_MethodHandle::is_instance(mh)) {
1403 //MethodHandlePrinter::print(mh);
1404 } else {
1405 tty->print("*** not a method handle: ");
1406 mh->print();
1407 }
1408 }
1410 #endif // PRODUCT
