- Loading...
Patch name: inti.patch
Description: inti.txt
See InterfaceCalls for a discussion of how interface call sites work.
...
Each itable is an array of the form methodOop target[N], where N is the number of methods in the interface.
...
In order to pack these dynamic itables, MethodHandles must be lowered to methodOops. For the special case of direct method handles, the original methodOop can be reused. For other (adapted or bound) method handles, a new methodOop must be created to wrap the method handle. This is a dark and dirty secret that nobody but the JVM will know about. (See the auto-generation of invoke methods in methodOop.cpp of meth.patch.)
A wrapper methodOop for a method handle mh of type R(A...) could look like bytecodes for this pseudocode:
| No Format | ||
|---|---|---|
| ||
static final MethodHandle MH = mh; // stored directly in m's constant pool
static R m(A... a...) {
// ldc #MH
// push l0; push l1; ... for all A
// invokevirtual MethodHandle.invoke(A...)R
return MH.<R>invoke(a);
// return
}
|
The meth.patch code already uses the oop-in-a-constant-pool technique for autogenerated MethodHandle.invoke methods (of which there is an infinite variety).
<clinit> of an interface is less than minimal. It should be safe to reuse the _bootstrap_method oop in instanceKlass for storing the injector for injectable interfaces.<clinit> method on the injectable interface. This is done by invoking InterfaceInjector.setInjector(InterfaceInjector) from <clinit>.0x0040 - JVM_ACC_VOLATILE for fields, JVM_ACC_BRIDGE for methods0x0080 - JVM_ACC_TRANSIENT for fields, JVM_ACC_VARARGS for methods0x0100 - JVM_ACC_NATIVE for methodssetInjector-method.invokeinterface...
This needs a linked list search and a whole new negative logic side. As with invokeinterface, if the initial searches fail, there needs to be a backoff and upcall to the JVM, to possibly inject the interface. Since negative interface checks are too common to handle this way (via an upcall) some negative filtering needs to be put in. We could do it in a couple of ways:
Klass::secondary_super_cache}} just for injectable interfaces; then the secondary_super_offset for an interface will take one of two distinct values (instead of the single value it takes today), depending on which secondary_super_cache it uses. This simultaneously makes it easy to detect injectables (by {{secondary_super_offset == offsetof(&secondary_super_cache\[1]))}} and also allocates a word in every {{klass}} to optimize the lookup of injected interfaces.Klass::secondary_non_super_cache. Use it as a first resort, to avoid upcalls on negative type tests of injectables....
Somehow we must record on each klass which interfaces have refused to inject. (They are the guys that show up in secondary_non_super_cache.) Probably a chunky linked list: A linked list of arrays, like the extension records above. (Or something else; I don't know. ?) The important thing is not to ask the same injection question twice; record yesses as extension records and noes as entries on the negative injection list.
...
(Can delay this a while; we'll get a GC guy to help fix it.) References to interface {{klass}}es klasses on both positive and negative sides should be weak, so that the GC can delete entries for unreachable interfaces.
...
Requires great precision to say exactly when injection requests happen, how they are resolved, and how the resolutions affect subsequent execution. The basic idea (as I see it) is to have each exact, concrete type get injected at most once, and exactly once if an (exact) instance of that type (exactly) gets an invokeinterface, checkcast, or instanceof. (Or reflective or optimized versions thereof!)
If two types are related by inheritance, I suppose it would may be best to query supertypes before subtypes. (But never Object.)
If interfaces are marked as being injectable or not, then the JIT would not have to emit the code for looking up the interface in the extension list if it's not injectable. To do this
the method that emits the instructions needs to have access to the klass representing the interface; this needs to be done through the ciKlass API.
Customizing code like that is usually only done by the JIT's optimizer. (Esp. the server JIT.) The interpreter can usually afford (until proven otherwise!) to use the most generic code sequences.
There are five places where interface types must be checked by the JIT:
1. invokeinterface
2. instanceof
3. checkcast
4. checkcast implicit in aastore checks
5. reflective versions of 1, 2, or 3.
In cases 1, 3, and 4, there is no strong need to customize for non-injectable interfaces, because the cost of failure is always an expensive exception, so it doesn't matter if you did a useless check of the extension records.
In case 2, there is definitely a need for a negative supertype cache in class Klass.
In case 5, if there is a JIT intrinsic which folds the reflective idiom to a non-reflective one, then it can be reduced to one of the previous cases (1,2,3). Otherwise, it is probably slow, and can be treated in full generality all the time. A possible exception is that the negative supertype cache should be consulted for reflective instanceof.
Cases 4 and 5 are interesting in that the interface type being tested against is non-constant (aastore checks against a varying array element type). In those cases, you either use full generality all the time, or use both code sequences, selected by a dynamic test for injectability.
Bottom line, per case:
1. always check for extension records
2. always use the negative cache (after fast positive tests), and customize the code in the JIT (GraphKit::gen_subtype_check)
3. customize in the JIT; negative cache buys nothing
4. customize in the JIT if possible; negative cache buys nothing
5. let the JIT do its thing for intrinsics; use the negative cache for Class.isInstance and Class.isAssignableFrom