src/jdk/internal/dynalink/beans/MaximallySpecific.java

changeset 90
5a820fb11814
child 101
f8221ce53c2e
equal deleted inserted replaced
89:43e32b36153c 90:5a820fb11814
1 /*
2 * Copyright (c) 2010, 2013, 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. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 */
25
26 /*
27 * This file is available under and governed by the GNU General Public
28 * License version 2 only, as published by the Free Software Foundation.
29 * However, the following notice accompanied the original version of this
30 * file, and Oracle licenses the original version of this file under the BSD
31 * license:
32 */
33 /*
34 Copyright 2009-2013 Attila Szegedi
35
36 Licensed under both the Apache License, Version 2.0 (the "Apache License")
37 and the BSD License (the "BSD License"), with licensee being free to
38 choose either of the two at their discretion.
39
40 You may not use this file except in compliance with either the Apache
41 License or the BSD License.
42
43 If you choose to use this file in compliance with the Apache License, the
44 following notice applies to you:
45
46 You may obtain a copy of the Apache License at
47
48 http://www.apache.org/licenses/LICENSE-2.0
49
50 Unless required by applicable law or agreed to in writing, software
51 distributed under the License is distributed on an "AS IS" BASIS,
52 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
53 implied. See the License for the specific language governing
54 permissions and limitations under the License.
55
56 If you choose to use this file in compliance with the BSD License, the
57 following notice applies to you:
58
59 Redistribution and use in source and binary forms, with or without
60 modification, are permitted provided that the following conditions are
61 met:
62 * Redistributions of source code must retain the above copyright
63 notice, this list of conditions and the following disclaimer.
64 * Redistributions in binary form must reproduce the above copyright
65 notice, this list of conditions and the following disclaimer in the
66 documentation and/or other materials provided with the distribution.
67 * Neither the name of the copyright holder nor the names of
68 contributors may be used to endorse or promote products derived from
69 this software without specific prior written permission.
70
71 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
72 IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
73 TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
74 PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL COPYRIGHT HOLDER
75 BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
76 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
77 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
78 BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
79 WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
80 OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
81 ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
82 */
83
84 package jdk.internal.dynalink.beans;
85
86 import java.lang.invoke.MethodHandle;
87 import java.lang.invoke.MethodType;
88 import java.util.Iterator;
89 import java.util.LinkedList;
90 import java.util.List;
91 import jdk.internal.dynalink.linker.ConversionComparator.Comparison;
92 import jdk.internal.dynalink.linker.LinkerServices;
93 import jdk.internal.dynalink.support.TypeUtilities;
94
95
96 /**
97 * Utility class that encapsulates the algorithm for choosing the maximally specific methods.
98 *
99 * @author Attila Szegedi
100 */
101 class MaximallySpecific {
102 /**
103 * Given a list of methods, returns a list of maximally specific methods.
104 *
105 * @param methods the list of methods
106 * @param varArgs whether to assume the methods are varargs
107 * @return the list of maximally specific methods.
108 */
109 static List<MethodHandle> getMaximallySpecificMethods(List<MethodHandle> methods, boolean varArgs) {
110 return getMaximallySpecificMethods(methods, varArgs, null, null);
111 }
112
113 /**
114 * Given a list of methods, returns a list of maximally specific methods, applying language-runtime specific
115 * conversion preferences.
116 *
117 * @param methods the list of methods
118 * @param varArgs whether to assume the methods are varargs
119 * @param argTypes concrete argument types for the invocation
120 * @return the list of maximally specific methods.
121 */
122 static List<MethodHandle> getMaximallySpecificMethods(List<MethodHandle> methods, boolean varArgs,
123 Class<?>[] argTypes, LinkerServices ls) {
124 if(methods.size() < 2) {
125 return methods;
126 }
127 final LinkedList<MethodHandle> maximals = new LinkedList<>();
128 for(MethodHandle m: methods) {
129 final MethodType methodType = m.type();
130 boolean lessSpecific = false;
131 for(Iterator<MethodHandle> maximal = maximals.iterator(); maximal.hasNext();) {
132 final MethodHandle max = maximal.next();
133 switch(isMoreSpecific(methodType, max.type(), varArgs, argTypes, ls)) {
134 case TYPE_1_BETTER: {
135 maximal.remove();
136 break;
137 }
138 case TYPE_2_BETTER: {
139 lessSpecific = true;
140 break;
141 }
142 case INDETERMINATE: {
143 // do nothing
144 }
145 }
146 }
147 if(!lessSpecific) {
148 maximals.addLast(m);
149 }
150 }
151 return maximals;
152 }
153
154 private static Comparison isMoreSpecific(MethodType t1, MethodType t2, boolean varArgs, Class<?>[] argTypes,
155 LinkerServices ls) {
156 final int pc1 = t1.parameterCount();
157 final int pc2 = t2.parameterCount();
158 assert varArgs || (pc1 == pc2) && (argTypes == null || argTypes.length == pc1);
159 assert (argTypes == null) == (ls == null);
160 final int maxPc = Math.max(Math.max(pc1, pc2), argTypes == null ? 0 : argTypes.length);
161 boolean t1MoreSpecific = false;
162 boolean t2MoreSpecific = false;
163 // NOTE: Starting from 1 as overloaded method resolution doesn't depend on 0th element, which is the type of
164 // 'this'. We're only dealing with instance methods here, not static methods. Actually, static methods will have
165 // a fake 'this' of type StaticClass.
166 for(int i = 1; i < maxPc; ++i) {
167 final Class<?> c1 = getParameterClass(t1, pc1, i, varArgs);
168 final Class<?> c2 = getParameterClass(t2, pc2, i, varArgs);
169 if(c1 != c2) {
170 final Comparison cmp = compare(c1, c2, argTypes, i, ls);
171 if(cmp == Comparison.TYPE_1_BETTER && !t1MoreSpecific) {
172 t1MoreSpecific = true;
173 if(t2MoreSpecific) {
174 return Comparison.INDETERMINATE;
175 }
176 }
177 if(cmp == Comparison.TYPE_2_BETTER && !t2MoreSpecific) {
178 t2MoreSpecific = true;
179 if(t1MoreSpecific) {
180 return Comparison.INDETERMINATE;
181 }
182 }
183 }
184 }
185 if(t1MoreSpecific) {
186 return Comparison.TYPE_1_BETTER;
187 } else if(t2MoreSpecific) {
188 return Comparison.TYPE_2_BETTER;
189 }
190 return Comparison.INDETERMINATE;
191 }
192
193 private static Comparison compare(Class<?> c1, Class<?> c2, Class<?>[] argTypes, int i, LinkerServices cmp) {
194 if(cmp != null) {
195 final Comparison c = cmp.compareConversion(argTypes[i], c1, c2);
196 if(c != Comparison.INDETERMINATE) {
197 return c;
198 }
199 }
200 if(TypeUtilities.isSubtype(c1, c2)) {
201 return Comparison.TYPE_1_BETTER;
202 } if(TypeUtilities.isSubtype(c2, c1)) {
203 return Comparison.TYPE_2_BETTER;
204 }
205 return Comparison.INDETERMINATE;
206 }
207
208 private static Class<?> getParameterClass(MethodType t, int l, int i, boolean varArgs) {
209 return varArgs && i >= l - 1 ? t.parameterType(l - 1).getComponentType() : t.parameterType(i);
210 }
211 }

mercurial