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