Thu, 14 Feb 2013 13:22:26 +0100
8008085: Integrate Dynalink source code into Nashorn codebase
Reviewed-by: jlaskey, lagergren, 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.support; |
attila@90 | 85 | |
attila@90 | 86 | import java.io.Serializable; |
attila@90 | 87 | import java.util.Collections; |
attila@90 | 88 | import java.util.LinkedList; |
attila@90 | 89 | import java.util.List; |
attila@90 | 90 | import jdk.internal.dynalink.linker.GuardedInvocation; |
attila@90 | 91 | import jdk.internal.dynalink.linker.GuardingDynamicLinker; |
attila@90 | 92 | import jdk.internal.dynalink.linker.LinkRequest; |
attila@90 | 93 | import jdk.internal.dynalink.linker.LinkerServices; |
attila@90 | 94 | import jdk.internal.dynalink.linker.TypeBasedGuardingDynamicLinker; |
attila@90 | 95 | |
attila@90 | 96 | |
attila@90 | 97 | /** |
attila@90 | 98 | * A composite type-based guarding dynamic linker. When a receiver of a not yet seen class is encountered, all linkers |
attila@90 | 99 | * are queried sequentially on their {@link TypeBasedGuardingDynamicLinker#canLinkType(Class)} method. The linkers |
attila@90 | 100 | * returning true are then bound to the class, and next time a receiver of same type is encountered, the linking is |
attila@90 | 101 | * delegated to those linkers only, speeding up dispatch. |
attila@90 | 102 | * |
attila@90 | 103 | * @author Attila Szegedi |
attila@90 | 104 | */ |
attila@90 | 105 | public class CompositeTypeBasedGuardingDynamicLinker implements TypeBasedGuardingDynamicLinker, Serializable { |
attila@90 | 106 | private static final long serialVersionUID = 1L; |
attila@90 | 107 | |
attila@90 | 108 | // Using a separate static class instance so there's no strong reference from the class value back to the composite |
attila@90 | 109 | // linker. |
attila@90 | 110 | private static class ClassToLinker extends ClassValue<List<TypeBasedGuardingDynamicLinker>> { |
attila@90 | 111 | private static final List<TypeBasedGuardingDynamicLinker> NO_LINKER = Collections.emptyList(); |
attila@90 | 112 | private final TypeBasedGuardingDynamicLinker[] linkers; |
attila@90 | 113 | private final List<TypeBasedGuardingDynamicLinker>[] singletonLinkers; |
attila@90 | 114 | |
attila@90 | 115 | @SuppressWarnings("unchecked") |
attila@90 | 116 | ClassToLinker(TypeBasedGuardingDynamicLinker[] linkers) { |
attila@90 | 117 | this.linkers = linkers; |
attila@90 | 118 | singletonLinkers = new List[linkers.length]; |
attila@90 | 119 | for(int i = 0; i < linkers.length; ++i) { |
attila@90 | 120 | singletonLinkers[i] = Collections.singletonList(linkers[i]); |
attila@90 | 121 | } |
attila@90 | 122 | } |
attila@90 | 123 | |
attila@90 | 124 | @Override |
attila@90 | 125 | protected List<TypeBasedGuardingDynamicLinker> computeValue(Class<?> clazz) { |
attila@90 | 126 | List<TypeBasedGuardingDynamicLinker> list = NO_LINKER; |
attila@90 | 127 | for(int i = 0; i < linkers.length; ++i) { |
attila@90 | 128 | final TypeBasedGuardingDynamicLinker linker = linkers[i]; |
attila@90 | 129 | if(linker.canLinkType(clazz)) { |
attila@90 | 130 | switch(list.size()) { |
attila@90 | 131 | case 0: { |
attila@90 | 132 | list = singletonLinkers[i]; |
attila@90 | 133 | break; |
attila@90 | 134 | } |
attila@90 | 135 | case 1: { |
attila@90 | 136 | list = new LinkedList<>(list); |
attila@90 | 137 | } |
attila@90 | 138 | //$FALL-THROUGH$ |
attila@90 | 139 | default: { |
attila@90 | 140 | list.add(linker); |
attila@90 | 141 | } |
attila@90 | 142 | } |
attila@90 | 143 | } |
attila@90 | 144 | } |
attila@90 | 145 | return list; |
attila@90 | 146 | } |
attila@90 | 147 | } |
attila@90 | 148 | |
attila@90 | 149 | private final ClassValue<List<TypeBasedGuardingDynamicLinker>> classToLinker; |
attila@90 | 150 | |
attila@90 | 151 | /** |
attila@90 | 152 | * Creates a new composite type-based linker. |
attila@90 | 153 | * |
attila@90 | 154 | * @param linkers the component linkers |
attila@90 | 155 | */ |
attila@90 | 156 | public CompositeTypeBasedGuardingDynamicLinker(Iterable<? extends TypeBasedGuardingDynamicLinker> linkers) { |
attila@90 | 157 | final List<TypeBasedGuardingDynamicLinker> l = new LinkedList<>(); |
attila@90 | 158 | for(TypeBasedGuardingDynamicLinker linker: linkers) { |
attila@90 | 159 | l.add(linker); |
attila@90 | 160 | } |
attila@90 | 161 | this.classToLinker = new ClassToLinker(l.toArray(new TypeBasedGuardingDynamicLinker[l.size()])); |
attila@90 | 162 | } |
attila@90 | 163 | |
attila@90 | 164 | @Override |
attila@90 | 165 | public boolean canLinkType(Class<?> type) { |
attila@90 | 166 | return !classToLinker.get(type).isEmpty(); |
attila@90 | 167 | } |
attila@90 | 168 | |
attila@90 | 169 | @Override |
attila@90 | 170 | public GuardedInvocation getGuardedInvocation(LinkRequest linkRequest, final LinkerServices linkerServices) |
attila@90 | 171 | throws Exception { |
attila@90 | 172 | final Object obj = linkRequest.getReceiver(); |
attila@90 | 173 | if(obj == null) { |
attila@90 | 174 | return null; |
attila@90 | 175 | } |
attila@90 | 176 | for(TypeBasedGuardingDynamicLinker linker: classToLinker.get(obj.getClass())) { |
attila@90 | 177 | final GuardedInvocation invocation = linker.getGuardedInvocation(linkRequest, linkerServices); |
attila@90 | 178 | if(invocation != null) { |
attila@90 | 179 | return invocation; |
attila@90 | 180 | } |
attila@90 | 181 | } |
attila@90 | 182 | return null; |
attila@90 | 183 | } |
attila@90 | 184 | |
attila@90 | 185 | /** |
attila@90 | 186 | * Optimizes a list of type-based linkers. If a group of adjacent linkers in the list all implement |
attila@90 | 187 | * {@link TypeBasedGuardingDynamicLinker}, they will be replaced with a single instance of |
attila@90 | 188 | * {@link CompositeTypeBasedGuardingDynamicLinker} that contains them. |
attila@90 | 189 | * |
attila@90 | 190 | * @param linkers the list of linkers to optimize |
attila@90 | 191 | * @return the optimized list |
attila@90 | 192 | */ |
attila@90 | 193 | public static List<GuardingDynamicLinker> optimize(Iterable<? extends GuardingDynamicLinker> linkers) { |
attila@90 | 194 | final List<GuardingDynamicLinker> llinkers = new LinkedList<>(); |
attila@90 | 195 | final List<TypeBasedGuardingDynamicLinker> tblinkers = new LinkedList<>(); |
attila@90 | 196 | for(GuardingDynamicLinker linker: linkers) { |
attila@90 | 197 | if(linker instanceof TypeBasedGuardingDynamicLinker) { |
attila@90 | 198 | tblinkers.add((TypeBasedGuardingDynamicLinker)linker); |
attila@90 | 199 | } else { |
attila@90 | 200 | addTypeBased(llinkers, tblinkers); |
attila@90 | 201 | llinkers.add(linker); |
attila@90 | 202 | } |
attila@90 | 203 | } |
attila@90 | 204 | addTypeBased(llinkers, tblinkers); |
attila@90 | 205 | return llinkers; |
attila@90 | 206 | } |
attila@90 | 207 | |
attila@90 | 208 | private static void addTypeBased(List<GuardingDynamicLinker> llinkers, |
attila@90 | 209 | List<TypeBasedGuardingDynamicLinker> tblinkers) { |
attila@90 | 210 | switch(tblinkers.size()) { |
attila@90 | 211 | case 0: { |
attila@90 | 212 | break; |
attila@90 | 213 | } |
attila@90 | 214 | case 1: { |
attila@90 | 215 | llinkers.addAll(tblinkers); |
attila@90 | 216 | tblinkers.clear(); |
attila@90 | 217 | break; |
attila@90 | 218 | } |
attila@90 | 219 | default: { |
attila@90 | 220 | llinkers.add(new CompositeTypeBasedGuardingDynamicLinker(tblinkers)); |
attila@90 | 221 | tblinkers.clear(); |
attila@90 | 222 | break; |
attila@90 | 223 | } |
attila@90 | 224 | } |
attila@90 | 225 | } |
attila@90 | 226 | } |