Thu, 05 Mar 2009 17:24:08 +0000
6467183: javac fails to raise unchecked warning on cast of parameterized generic subclass
Summary: cleanup code for generating unchecked cast warnings
Reviewed-by: jjg
duke@1 | 1 | /* |
xdono@54 | 2 | * Copyright 2003-2008 Sun Microsystems, Inc. All Rights Reserved. |
duke@1 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@1 | 4 | * |
duke@1 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@1 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@1 | 7 | * published by the Free Software Foundation. Sun designates this |
duke@1 | 8 | * particular file as subject to the "Classpath" exception as provided |
duke@1 | 9 | * by Sun in the LICENSE file that accompanied this code. |
duke@1 | 10 | * |
duke@1 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@1 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@1 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@1 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@1 | 15 | * accompanied this code). |
duke@1 | 16 | * |
duke@1 | 17 | * You should have received a copy of the GNU General Public License version |
duke@1 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@1 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@1 | 20 | * |
duke@1 | 21 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@1 | 22 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@1 | 23 | * have any questions. |
duke@1 | 24 | */ |
duke@1 | 25 | |
duke@1 | 26 | package com.sun.tools.javac.code; |
duke@1 | 27 | |
duke@1 | 28 | import java.util.*; |
duke@1 | 29 | |
duke@1 | 30 | import com.sun.tools.javac.util.*; |
duke@1 | 31 | import com.sun.tools.javac.util.List; |
duke@1 | 32 | |
duke@1 | 33 | import com.sun.tools.javac.jvm.ClassReader; |
duke@1 | 34 | import com.sun.tools.javac.comp.Check; |
duke@1 | 35 | |
duke@1 | 36 | import static com.sun.tools.javac.code.Type.*; |
duke@1 | 37 | import static com.sun.tools.javac.code.TypeTags.*; |
duke@1 | 38 | import static com.sun.tools.javac.code.Symbol.*; |
duke@1 | 39 | import static com.sun.tools.javac.code.Flags.*; |
duke@1 | 40 | import static com.sun.tools.javac.code.BoundKind.*; |
duke@1 | 41 | import static com.sun.tools.javac.util.ListBuffer.lb; |
duke@1 | 42 | |
duke@1 | 43 | /** |
duke@1 | 44 | * Utility class containing various operations on types. |
duke@1 | 45 | * |
duke@1 | 46 | * <p>Unless other names are more illustrative, the following naming |
duke@1 | 47 | * conventions should be observed in this file: |
duke@1 | 48 | * |
duke@1 | 49 | * <dl> |
duke@1 | 50 | * <dt>t</dt> |
duke@1 | 51 | * <dd>If the first argument to an operation is a type, it should be named t.</dd> |
duke@1 | 52 | * <dt>s</dt> |
duke@1 | 53 | * <dd>Similarly, if the second argument to an operation is a type, it should be named s.</dd> |
duke@1 | 54 | * <dt>ts</dt> |
duke@1 | 55 | * <dd>If an operations takes a list of types, the first should be named ts.</dd> |
duke@1 | 56 | * <dt>ss</dt> |
duke@1 | 57 | * <dd>A second list of types should be named ss.</dd> |
duke@1 | 58 | * </dl> |
duke@1 | 59 | * |
duke@1 | 60 | * <p><b>This is NOT part of any API supported by Sun Microsystems. |
duke@1 | 61 | * If you write code that depends on this, you do so at your own risk. |
duke@1 | 62 | * This code and its internal interfaces are subject to change or |
duke@1 | 63 | * deletion without notice.</b> |
duke@1 | 64 | */ |
duke@1 | 65 | public class Types { |
duke@1 | 66 | protected static final Context.Key<Types> typesKey = |
duke@1 | 67 | new Context.Key<Types>(); |
duke@1 | 68 | |
duke@1 | 69 | final Symtab syms; |
mcimadamore@136 | 70 | final JavacMessages messages; |
jjg@113 | 71 | final Names names; |
duke@1 | 72 | final boolean allowBoxing; |
duke@1 | 73 | final ClassReader reader; |
duke@1 | 74 | final Source source; |
duke@1 | 75 | final Check chk; |
duke@1 | 76 | List<Warner> warnStack = List.nil(); |
duke@1 | 77 | final Name capturedName; |
duke@1 | 78 | |
duke@1 | 79 | // <editor-fold defaultstate="collapsed" desc="Instantiating"> |
duke@1 | 80 | public static Types instance(Context context) { |
duke@1 | 81 | Types instance = context.get(typesKey); |
duke@1 | 82 | if (instance == null) |
duke@1 | 83 | instance = new Types(context); |
duke@1 | 84 | return instance; |
duke@1 | 85 | } |
duke@1 | 86 | |
duke@1 | 87 | protected Types(Context context) { |
duke@1 | 88 | context.put(typesKey, this); |
duke@1 | 89 | syms = Symtab.instance(context); |
jjg@113 | 90 | names = Names.instance(context); |
duke@1 | 91 | allowBoxing = Source.instance(context).allowBoxing(); |
duke@1 | 92 | reader = ClassReader.instance(context); |
duke@1 | 93 | source = Source.instance(context); |
duke@1 | 94 | chk = Check.instance(context); |
duke@1 | 95 | capturedName = names.fromString("<captured wildcard>"); |
mcimadamore@136 | 96 | messages = JavacMessages.instance(context); |
duke@1 | 97 | } |
duke@1 | 98 | // </editor-fold> |
duke@1 | 99 | |
duke@1 | 100 | // <editor-fold defaultstate="collapsed" desc="upperBound"> |
duke@1 | 101 | /** |
duke@1 | 102 | * The "rvalue conversion".<br> |
duke@1 | 103 | * The upper bound of most types is the type |
duke@1 | 104 | * itself. Wildcards, on the other hand have upper |
duke@1 | 105 | * and lower bounds. |
duke@1 | 106 | * @param t a type |
duke@1 | 107 | * @return the upper bound of the given type |
duke@1 | 108 | */ |
duke@1 | 109 | public Type upperBound(Type t) { |
duke@1 | 110 | return upperBound.visit(t); |
duke@1 | 111 | } |
duke@1 | 112 | // where |
duke@1 | 113 | private final MapVisitor<Void> upperBound = new MapVisitor<Void>() { |
duke@1 | 114 | |
duke@1 | 115 | @Override |
duke@1 | 116 | public Type visitWildcardType(WildcardType t, Void ignored) { |
duke@1 | 117 | if (t.isSuperBound()) |
duke@1 | 118 | return t.bound == null ? syms.objectType : t.bound.bound; |
duke@1 | 119 | else |
duke@1 | 120 | return visit(t.type); |
duke@1 | 121 | } |
duke@1 | 122 | |
duke@1 | 123 | @Override |
duke@1 | 124 | public Type visitCapturedType(CapturedType t, Void ignored) { |
duke@1 | 125 | return visit(t.bound); |
duke@1 | 126 | } |
duke@1 | 127 | }; |
duke@1 | 128 | // </editor-fold> |
duke@1 | 129 | |
duke@1 | 130 | // <editor-fold defaultstate="collapsed" desc="lowerBound"> |
duke@1 | 131 | /** |
duke@1 | 132 | * The "lvalue conversion".<br> |
duke@1 | 133 | * The lower bound of most types is the type |
duke@1 | 134 | * itself. Wildcards, on the other hand have upper |
duke@1 | 135 | * and lower bounds. |
duke@1 | 136 | * @param t a type |
duke@1 | 137 | * @return the lower bound of the given type |
duke@1 | 138 | */ |
duke@1 | 139 | public Type lowerBound(Type t) { |
duke@1 | 140 | return lowerBound.visit(t); |
duke@1 | 141 | } |
duke@1 | 142 | // where |
duke@1 | 143 | private final MapVisitor<Void> lowerBound = new MapVisitor<Void>() { |
duke@1 | 144 | |
duke@1 | 145 | @Override |
duke@1 | 146 | public Type visitWildcardType(WildcardType t, Void ignored) { |
duke@1 | 147 | return t.isExtendsBound() ? syms.botType : visit(t.type); |
duke@1 | 148 | } |
duke@1 | 149 | |
duke@1 | 150 | @Override |
duke@1 | 151 | public Type visitCapturedType(CapturedType t, Void ignored) { |
duke@1 | 152 | return visit(t.getLowerBound()); |
duke@1 | 153 | } |
duke@1 | 154 | }; |
duke@1 | 155 | // </editor-fold> |
duke@1 | 156 | |
duke@1 | 157 | // <editor-fold defaultstate="collapsed" desc="isUnbounded"> |
duke@1 | 158 | /** |
duke@1 | 159 | * Checks that all the arguments to a class are unbounded |
duke@1 | 160 | * wildcards or something else that doesn't make any restrictions |
duke@1 | 161 | * on the arguments. If a class isUnbounded, a raw super- or |
duke@1 | 162 | * subclass can be cast to it without a warning. |
duke@1 | 163 | * @param t a type |
duke@1 | 164 | * @return true iff the given type is unbounded or raw |
duke@1 | 165 | */ |
duke@1 | 166 | public boolean isUnbounded(Type t) { |
duke@1 | 167 | return isUnbounded.visit(t); |
duke@1 | 168 | } |
duke@1 | 169 | // where |
duke@1 | 170 | private final UnaryVisitor<Boolean> isUnbounded = new UnaryVisitor<Boolean>() { |
duke@1 | 171 | |
duke@1 | 172 | public Boolean visitType(Type t, Void ignored) { |
duke@1 | 173 | return true; |
duke@1 | 174 | } |
duke@1 | 175 | |
duke@1 | 176 | @Override |
duke@1 | 177 | public Boolean visitClassType(ClassType t, Void ignored) { |
duke@1 | 178 | List<Type> parms = t.tsym.type.allparams(); |
duke@1 | 179 | List<Type> args = t.allparams(); |
duke@1 | 180 | while (parms.nonEmpty()) { |
duke@1 | 181 | WildcardType unb = new WildcardType(syms.objectType, |
duke@1 | 182 | BoundKind.UNBOUND, |
duke@1 | 183 | syms.boundClass, |
duke@1 | 184 | (TypeVar)parms.head); |
duke@1 | 185 | if (!containsType(args.head, unb)) |
duke@1 | 186 | return false; |
duke@1 | 187 | parms = parms.tail; |
duke@1 | 188 | args = args.tail; |
duke@1 | 189 | } |
duke@1 | 190 | return true; |
duke@1 | 191 | } |
duke@1 | 192 | }; |
duke@1 | 193 | // </editor-fold> |
duke@1 | 194 | |
duke@1 | 195 | // <editor-fold defaultstate="collapsed" desc="asSub"> |
duke@1 | 196 | /** |
duke@1 | 197 | * Return the least specific subtype of t that starts with symbol |
duke@1 | 198 | * sym. If none exists, return null. The least specific subtype |
duke@1 | 199 | * is determined as follows: |
duke@1 | 200 | * |
duke@1 | 201 | * <p>If there is exactly one parameterized instance of sym that is a |
duke@1 | 202 | * subtype of t, that parameterized instance is returned.<br> |
duke@1 | 203 | * Otherwise, if the plain type or raw type `sym' is a subtype of |
duke@1 | 204 | * type t, the type `sym' itself is returned. Otherwise, null is |
duke@1 | 205 | * returned. |
duke@1 | 206 | */ |
duke@1 | 207 | public Type asSub(Type t, Symbol sym) { |
duke@1 | 208 | return asSub.visit(t, sym); |
duke@1 | 209 | } |
duke@1 | 210 | // where |
duke@1 | 211 | private final SimpleVisitor<Type,Symbol> asSub = new SimpleVisitor<Type,Symbol>() { |
duke@1 | 212 | |
duke@1 | 213 | public Type visitType(Type t, Symbol sym) { |
duke@1 | 214 | return null; |
duke@1 | 215 | } |
duke@1 | 216 | |
duke@1 | 217 | @Override |
duke@1 | 218 | public Type visitClassType(ClassType t, Symbol sym) { |
duke@1 | 219 | if (t.tsym == sym) |
duke@1 | 220 | return t; |
duke@1 | 221 | Type base = asSuper(sym.type, t.tsym); |
duke@1 | 222 | if (base == null) |
duke@1 | 223 | return null; |
duke@1 | 224 | ListBuffer<Type> from = new ListBuffer<Type>(); |
duke@1 | 225 | ListBuffer<Type> to = new ListBuffer<Type>(); |
duke@1 | 226 | try { |
duke@1 | 227 | adapt(base, t, from, to); |
duke@1 | 228 | } catch (AdaptFailure ex) { |
duke@1 | 229 | return null; |
duke@1 | 230 | } |
duke@1 | 231 | Type res = subst(sym.type, from.toList(), to.toList()); |
duke@1 | 232 | if (!isSubtype(res, t)) |
duke@1 | 233 | return null; |
duke@1 | 234 | ListBuffer<Type> openVars = new ListBuffer<Type>(); |
duke@1 | 235 | for (List<Type> l = sym.type.allparams(); |
duke@1 | 236 | l.nonEmpty(); l = l.tail) |
duke@1 | 237 | if (res.contains(l.head) && !t.contains(l.head)) |
duke@1 | 238 | openVars.append(l.head); |
duke@1 | 239 | if (openVars.nonEmpty()) { |
duke@1 | 240 | if (t.isRaw()) { |
duke@1 | 241 | // The subtype of a raw type is raw |
duke@1 | 242 | res = erasure(res); |
duke@1 | 243 | } else { |
duke@1 | 244 | // Unbound type arguments default to ? |
duke@1 | 245 | List<Type> opens = openVars.toList(); |
duke@1 | 246 | ListBuffer<Type> qs = new ListBuffer<Type>(); |
duke@1 | 247 | for (List<Type> iter = opens; iter.nonEmpty(); iter = iter.tail) { |
duke@1 | 248 | qs.append(new WildcardType(syms.objectType, BoundKind.UNBOUND, syms.boundClass, (TypeVar) iter.head)); |
duke@1 | 249 | } |
duke@1 | 250 | res = subst(res, opens, qs.toList()); |
duke@1 | 251 | } |
duke@1 | 252 | } |
duke@1 | 253 | return res; |
duke@1 | 254 | } |
duke@1 | 255 | |
duke@1 | 256 | @Override |
duke@1 | 257 | public Type visitErrorType(ErrorType t, Symbol sym) { |
duke@1 | 258 | return t; |
duke@1 | 259 | } |
duke@1 | 260 | }; |
duke@1 | 261 | // </editor-fold> |
duke@1 | 262 | |
duke@1 | 263 | // <editor-fold defaultstate="collapsed" desc="isConvertible"> |
duke@1 | 264 | /** |
duke@1 | 265 | * Is t a subtype of or convertiable via boxing/unboxing |
duke@1 | 266 | * convertions to s? |
duke@1 | 267 | */ |
duke@1 | 268 | public boolean isConvertible(Type t, Type s, Warner warn) { |
duke@1 | 269 | boolean tPrimitive = t.isPrimitive(); |
duke@1 | 270 | boolean sPrimitive = s.isPrimitive(); |
duke@1 | 271 | if (tPrimitive == sPrimitive) |
duke@1 | 272 | return isSubtypeUnchecked(t, s, warn); |
duke@1 | 273 | if (!allowBoxing) return false; |
duke@1 | 274 | return tPrimitive |
duke@1 | 275 | ? isSubtype(boxedClass(t).type, s) |
duke@1 | 276 | : isSubtype(unboxedType(t), s); |
duke@1 | 277 | } |
duke@1 | 278 | |
duke@1 | 279 | /** |
duke@1 | 280 | * Is t a subtype of or convertiable via boxing/unboxing |
duke@1 | 281 | * convertions to s? |
duke@1 | 282 | */ |
duke@1 | 283 | public boolean isConvertible(Type t, Type s) { |
duke@1 | 284 | return isConvertible(t, s, Warner.noWarnings); |
duke@1 | 285 | } |
duke@1 | 286 | // </editor-fold> |
duke@1 | 287 | |
duke@1 | 288 | // <editor-fold defaultstate="collapsed" desc="isSubtype"> |
duke@1 | 289 | /** |
duke@1 | 290 | * Is t an unchecked subtype of s? |
duke@1 | 291 | */ |
duke@1 | 292 | public boolean isSubtypeUnchecked(Type t, Type s) { |
duke@1 | 293 | return isSubtypeUnchecked(t, s, Warner.noWarnings); |
duke@1 | 294 | } |
duke@1 | 295 | /** |
duke@1 | 296 | * Is t an unchecked subtype of s? |
duke@1 | 297 | */ |
duke@1 | 298 | public boolean isSubtypeUnchecked(Type t, Type s, Warner warn) { |
duke@1 | 299 | if (t.tag == ARRAY && s.tag == ARRAY) { |
duke@1 | 300 | return (((ArrayType)t).elemtype.tag <= lastBaseTag) |
duke@1 | 301 | ? isSameType(elemtype(t), elemtype(s)) |
duke@1 | 302 | : isSubtypeUnchecked(elemtype(t), elemtype(s), warn); |
duke@1 | 303 | } else if (isSubtype(t, s)) { |
duke@1 | 304 | return true; |
mcimadamore@41 | 305 | } |
mcimadamore@41 | 306 | else if (t.tag == TYPEVAR) { |
mcimadamore@41 | 307 | return isSubtypeUnchecked(t.getUpperBound(), s, warn); |
mcimadamore@41 | 308 | } |
mcimadamore@93 | 309 | else if (s.tag == UNDETVAR) { |
mcimadamore@93 | 310 | UndetVar uv = (UndetVar)s; |
mcimadamore@93 | 311 | if (uv.inst != null) |
mcimadamore@93 | 312 | return isSubtypeUnchecked(t, uv.inst, warn); |
mcimadamore@93 | 313 | } |
mcimadamore@41 | 314 | else if (!s.isRaw()) { |
duke@1 | 315 | Type t2 = asSuper(t, s.tsym); |
duke@1 | 316 | if (t2 != null && t2.isRaw()) { |
duke@1 | 317 | if (isReifiable(s)) |
duke@1 | 318 | warn.silentUnchecked(); |
duke@1 | 319 | else |
duke@1 | 320 | warn.warnUnchecked(); |
duke@1 | 321 | return true; |
duke@1 | 322 | } |
duke@1 | 323 | } |
duke@1 | 324 | return false; |
duke@1 | 325 | } |
duke@1 | 326 | |
duke@1 | 327 | /** |
duke@1 | 328 | * Is t a subtype of s?<br> |
duke@1 | 329 | * (not defined for Method and ForAll types) |
duke@1 | 330 | */ |
duke@1 | 331 | final public boolean isSubtype(Type t, Type s) { |
duke@1 | 332 | return isSubtype(t, s, true); |
duke@1 | 333 | } |
duke@1 | 334 | final public boolean isSubtypeNoCapture(Type t, Type s) { |
duke@1 | 335 | return isSubtype(t, s, false); |
duke@1 | 336 | } |
duke@1 | 337 | public boolean isSubtype(Type t, Type s, boolean capture) { |
duke@1 | 338 | if (t == s) |
duke@1 | 339 | return true; |
duke@1 | 340 | |
duke@1 | 341 | if (s.tag >= firstPartialTag) |
duke@1 | 342 | return isSuperType(s, t); |
duke@1 | 343 | |
duke@1 | 344 | Type lower = lowerBound(s); |
duke@1 | 345 | if (s != lower) |
duke@1 | 346 | return isSubtype(capture ? capture(t) : t, lower, false); |
duke@1 | 347 | |
duke@1 | 348 | return isSubtype.visit(capture ? capture(t) : t, s); |
duke@1 | 349 | } |
duke@1 | 350 | // where |
duke@1 | 351 | private TypeRelation isSubtype = new TypeRelation() |
duke@1 | 352 | { |
duke@1 | 353 | public Boolean visitType(Type t, Type s) { |
duke@1 | 354 | switch (t.tag) { |
duke@1 | 355 | case BYTE: case CHAR: |
duke@1 | 356 | return (t.tag == s.tag || |
duke@1 | 357 | t.tag + 2 <= s.tag && s.tag <= DOUBLE); |
duke@1 | 358 | case SHORT: case INT: case LONG: case FLOAT: case DOUBLE: |
duke@1 | 359 | return t.tag <= s.tag && s.tag <= DOUBLE; |
duke@1 | 360 | case BOOLEAN: case VOID: |
duke@1 | 361 | return t.tag == s.tag; |
duke@1 | 362 | case TYPEVAR: |
duke@1 | 363 | return isSubtypeNoCapture(t.getUpperBound(), s); |
duke@1 | 364 | case BOT: |
duke@1 | 365 | return |
duke@1 | 366 | s.tag == BOT || s.tag == CLASS || |
duke@1 | 367 | s.tag == ARRAY || s.tag == TYPEVAR; |
duke@1 | 368 | case NONE: |
duke@1 | 369 | return false; |
duke@1 | 370 | default: |
duke@1 | 371 | throw new AssertionError("isSubtype " + t.tag); |
duke@1 | 372 | } |
duke@1 | 373 | } |
duke@1 | 374 | |
duke@1 | 375 | private Set<TypePair> cache = new HashSet<TypePair>(); |
duke@1 | 376 | |
duke@1 | 377 | private boolean containsTypeRecursive(Type t, Type s) { |
duke@1 | 378 | TypePair pair = new TypePair(t, s); |
duke@1 | 379 | if (cache.add(pair)) { |
duke@1 | 380 | try { |
duke@1 | 381 | return containsType(t.getTypeArguments(), |
duke@1 | 382 | s.getTypeArguments()); |
duke@1 | 383 | } finally { |
duke@1 | 384 | cache.remove(pair); |
duke@1 | 385 | } |
duke@1 | 386 | } else { |
duke@1 | 387 | return containsType(t.getTypeArguments(), |
duke@1 | 388 | rewriteSupers(s).getTypeArguments()); |
duke@1 | 389 | } |
duke@1 | 390 | } |
duke@1 | 391 | |
duke@1 | 392 | private Type rewriteSupers(Type t) { |
duke@1 | 393 | if (!t.isParameterized()) |
duke@1 | 394 | return t; |
duke@1 | 395 | ListBuffer<Type> from = lb(); |
duke@1 | 396 | ListBuffer<Type> to = lb(); |
duke@1 | 397 | adaptSelf(t, from, to); |
duke@1 | 398 | if (from.isEmpty()) |
duke@1 | 399 | return t; |
duke@1 | 400 | ListBuffer<Type> rewrite = lb(); |
duke@1 | 401 | boolean changed = false; |
duke@1 | 402 | for (Type orig : to.toList()) { |
duke@1 | 403 | Type s = rewriteSupers(orig); |
duke@1 | 404 | if (s.isSuperBound() && !s.isExtendsBound()) { |
duke@1 | 405 | s = new WildcardType(syms.objectType, |
duke@1 | 406 | BoundKind.UNBOUND, |
duke@1 | 407 | syms.boundClass); |
duke@1 | 408 | changed = true; |
duke@1 | 409 | } else if (s != orig) { |
duke@1 | 410 | s = new WildcardType(upperBound(s), |
duke@1 | 411 | BoundKind.EXTENDS, |
duke@1 | 412 | syms.boundClass); |
duke@1 | 413 | changed = true; |
duke@1 | 414 | } |
duke@1 | 415 | rewrite.append(s); |
duke@1 | 416 | } |
duke@1 | 417 | if (changed) |
duke@1 | 418 | return subst(t.tsym.type, from.toList(), rewrite.toList()); |
duke@1 | 419 | else |
duke@1 | 420 | return t; |
duke@1 | 421 | } |
duke@1 | 422 | |
duke@1 | 423 | @Override |
duke@1 | 424 | public Boolean visitClassType(ClassType t, Type s) { |
duke@1 | 425 | Type sup = asSuper(t, s.tsym); |
duke@1 | 426 | return sup != null |
duke@1 | 427 | && sup.tsym == s.tsym |
duke@1 | 428 | // You're not allowed to write |
duke@1 | 429 | // Vector<Object> vec = new Vector<String>(); |
duke@1 | 430 | // But with wildcards you can write |
duke@1 | 431 | // Vector<? extends Object> vec = new Vector<String>(); |
duke@1 | 432 | // which means that subtype checking must be done |
duke@1 | 433 | // here instead of same-type checking (via containsType). |
duke@1 | 434 | && (!s.isParameterized() || containsTypeRecursive(s, sup)) |
duke@1 | 435 | && isSubtypeNoCapture(sup.getEnclosingType(), |
duke@1 | 436 | s.getEnclosingType()); |
duke@1 | 437 | } |
duke@1 | 438 | |
duke@1 | 439 | @Override |
duke@1 | 440 | public Boolean visitArrayType(ArrayType t, Type s) { |
duke@1 | 441 | if (s.tag == ARRAY) { |
duke@1 | 442 | if (t.elemtype.tag <= lastBaseTag) |
duke@1 | 443 | return isSameType(t.elemtype, elemtype(s)); |
duke@1 | 444 | else |
duke@1 | 445 | return isSubtypeNoCapture(t.elemtype, elemtype(s)); |
duke@1 | 446 | } |
duke@1 | 447 | |
duke@1 | 448 | if (s.tag == CLASS) { |
duke@1 | 449 | Name sname = s.tsym.getQualifiedName(); |
duke@1 | 450 | return sname == names.java_lang_Object |
duke@1 | 451 | || sname == names.java_lang_Cloneable |
duke@1 | 452 | || sname == names.java_io_Serializable; |
duke@1 | 453 | } |
duke@1 | 454 | |
duke@1 | 455 | return false; |
duke@1 | 456 | } |
duke@1 | 457 | |
duke@1 | 458 | @Override |
duke@1 | 459 | public Boolean visitUndetVar(UndetVar t, Type s) { |
duke@1 | 460 | //todo: test against origin needed? or replace with substitution? |
duke@1 | 461 | if (t == s || t.qtype == s || s.tag == ERROR || s.tag == UNKNOWN) |
duke@1 | 462 | return true; |
duke@1 | 463 | |
duke@1 | 464 | if (t.inst != null) |
duke@1 | 465 | return isSubtypeNoCapture(t.inst, s); // TODO: ", warn"? |
duke@1 | 466 | |
duke@1 | 467 | t.hibounds = t.hibounds.prepend(s); |
duke@1 | 468 | return true; |
duke@1 | 469 | } |
duke@1 | 470 | |
duke@1 | 471 | @Override |
duke@1 | 472 | public Boolean visitErrorType(ErrorType t, Type s) { |
duke@1 | 473 | return true; |
duke@1 | 474 | } |
duke@1 | 475 | }; |
duke@1 | 476 | |
duke@1 | 477 | /** |
duke@1 | 478 | * Is t a subtype of every type in given list `ts'?<br> |
duke@1 | 479 | * (not defined for Method and ForAll types)<br> |
duke@1 | 480 | * Allows unchecked conversions. |
duke@1 | 481 | */ |
duke@1 | 482 | public boolean isSubtypeUnchecked(Type t, List<Type> ts, Warner warn) { |
duke@1 | 483 | for (List<Type> l = ts; l.nonEmpty(); l = l.tail) |
duke@1 | 484 | if (!isSubtypeUnchecked(t, l.head, warn)) |
duke@1 | 485 | return false; |
duke@1 | 486 | return true; |
duke@1 | 487 | } |
duke@1 | 488 | |
duke@1 | 489 | /** |
duke@1 | 490 | * Are corresponding elements of ts subtypes of ss? If lists are |
duke@1 | 491 | * of different length, return false. |
duke@1 | 492 | */ |
duke@1 | 493 | public boolean isSubtypes(List<Type> ts, List<Type> ss) { |
duke@1 | 494 | while (ts.tail != null && ss.tail != null |
duke@1 | 495 | /*inlined: ts.nonEmpty() && ss.nonEmpty()*/ && |
duke@1 | 496 | isSubtype(ts.head, ss.head)) { |
duke@1 | 497 | ts = ts.tail; |
duke@1 | 498 | ss = ss.tail; |
duke@1 | 499 | } |
duke@1 | 500 | return ts.tail == null && ss.tail == null; |
duke@1 | 501 | /*inlined: ts.isEmpty() && ss.isEmpty();*/ |
duke@1 | 502 | } |
duke@1 | 503 | |
duke@1 | 504 | /** |
duke@1 | 505 | * Are corresponding elements of ts subtypes of ss, allowing |
duke@1 | 506 | * unchecked conversions? If lists are of different length, |
duke@1 | 507 | * return false. |
duke@1 | 508 | **/ |
duke@1 | 509 | public boolean isSubtypesUnchecked(List<Type> ts, List<Type> ss, Warner warn) { |
duke@1 | 510 | while (ts.tail != null && ss.tail != null |
duke@1 | 511 | /*inlined: ts.nonEmpty() && ss.nonEmpty()*/ && |
duke@1 | 512 | isSubtypeUnchecked(ts.head, ss.head, warn)) { |
duke@1 | 513 | ts = ts.tail; |
duke@1 | 514 | ss = ss.tail; |
duke@1 | 515 | } |
duke@1 | 516 | return ts.tail == null && ss.tail == null; |
duke@1 | 517 | /*inlined: ts.isEmpty() && ss.isEmpty();*/ |
duke@1 | 518 | } |
duke@1 | 519 | // </editor-fold> |
duke@1 | 520 | |
duke@1 | 521 | // <editor-fold defaultstate="collapsed" desc="isSuperType"> |
duke@1 | 522 | /** |
duke@1 | 523 | * Is t a supertype of s? |
duke@1 | 524 | */ |
duke@1 | 525 | public boolean isSuperType(Type t, Type s) { |
duke@1 | 526 | switch (t.tag) { |
duke@1 | 527 | case ERROR: |
duke@1 | 528 | return true; |
duke@1 | 529 | case UNDETVAR: { |
duke@1 | 530 | UndetVar undet = (UndetVar)t; |
duke@1 | 531 | if (t == s || |
duke@1 | 532 | undet.qtype == s || |
duke@1 | 533 | s.tag == ERROR || |
duke@1 | 534 | s.tag == BOT) return true; |
duke@1 | 535 | if (undet.inst != null) |
duke@1 | 536 | return isSubtype(s, undet.inst); |
duke@1 | 537 | undet.lobounds = undet.lobounds.prepend(s); |
duke@1 | 538 | return true; |
duke@1 | 539 | } |
duke@1 | 540 | default: |
duke@1 | 541 | return isSubtype(s, t); |
duke@1 | 542 | } |
duke@1 | 543 | } |
duke@1 | 544 | // </editor-fold> |
duke@1 | 545 | |
duke@1 | 546 | // <editor-fold defaultstate="collapsed" desc="isSameType"> |
duke@1 | 547 | /** |
duke@1 | 548 | * Are corresponding elements of the lists the same type? If |
duke@1 | 549 | * lists are of different length, return false. |
duke@1 | 550 | */ |
duke@1 | 551 | public boolean isSameTypes(List<Type> ts, List<Type> ss) { |
duke@1 | 552 | while (ts.tail != null && ss.tail != null |
duke@1 | 553 | /*inlined: ts.nonEmpty() && ss.nonEmpty()*/ && |
duke@1 | 554 | isSameType(ts.head, ss.head)) { |
duke@1 | 555 | ts = ts.tail; |
duke@1 | 556 | ss = ss.tail; |
duke@1 | 557 | } |
duke@1 | 558 | return ts.tail == null && ss.tail == null; |
duke@1 | 559 | /*inlined: ts.isEmpty() && ss.isEmpty();*/ |
duke@1 | 560 | } |
duke@1 | 561 | |
duke@1 | 562 | /** |
duke@1 | 563 | * Is t the same type as s? |
duke@1 | 564 | */ |
duke@1 | 565 | public boolean isSameType(Type t, Type s) { |
duke@1 | 566 | return isSameType.visit(t, s); |
duke@1 | 567 | } |
duke@1 | 568 | // where |
duke@1 | 569 | private TypeRelation isSameType = new TypeRelation() { |
duke@1 | 570 | |
duke@1 | 571 | public Boolean visitType(Type t, Type s) { |
duke@1 | 572 | if (t == s) |
duke@1 | 573 | return true; |
duke@1 | 574 | |
duke@1 | 575 | if (s.tag >= firstPartialTag) |
duke@1 | 576 | return visit(s, t); |
duke@1 | 577 | |
duke@1 | 578 | switch (t.tag) { |
duke@1 | 579 | case BYTE: case CHAR: case SHORT: case INT: case LONG: case FLOAT: |
duke@1 | 580 | case DOUBLE: case BOOLEAN: case VOID: case BOT: case NONE: |
duke@1 | 581 | return t.tag == s.tag; |
duke@1 | 582 | case TYPEVAR: |
duke@1 | 583 | return s.isSuperBound() |
duke@1 | 584 | && !s.isExtendsBound() |
duke@1 | 585 | && visit(t, upperBound(s)); |
duke@1 | 586 | default: |
duke@1 | 587 | throw new AssertionError("isSameType " + t.tag); |
duke@1 | 588 | } |
duke@1 | 589 | } |
duke@1 | 590 | |
duke@1 | 591 | @Override |
duke@1 | 592 | public Boolean visitWildcardType(WildcardType t, Type s) { |
duke@1 | 593 | if (s.tag >= firstPartialTag) |
duke@1 | 594 | return visit(s, t); |
duke@1 | 595 | else |
duke@1 | 596 | return false; |
duke@1 | 597 | } |
duke@1 | 598 | |
duke@1 | 599 | @Override |
duke@1 | 600 | public Boolean visitClassType(ClassType t, Type s) { |
duke@1 | 601 | if (t == s) |
duke@1 | 602 | return true; |
duke@1 | 603 | |
duke@1 | 604 | if (s.tag >= firstPartialTag) |
duke@1 | 605 | return visit(s, t); |
duke@1 | 606 | |
duke@1 | 607 | if (s.isSuperBound() && !s.isExtendsBound()) |
duke@1 | 608 | return visit(t, upperBound(s)) && visit(t, lowerBound(s)); |
duke@1 | 609 | |
duke@1 | 610 | if (t.isCompound() && s.isCompound()) { |
duke@1 | 611 | if (!visit(supertype(t), supertype(s))) |
duke@1 | 612 | return false; |
duke@1 | 613 | |
duke@1 | 614 | HashSet<SingletonType> set = new HashSet<SingletonType>(); |
duke@1 | 615 | for (Type x : interfaces(t)) |
duke@1 | 616 | set.add(new SingletonType(x)); |
duke@1 | 617 | for (Type x : interfaces(s)) { |
duke@1 | 618 | if (!set.remove(new SingletonType(x))) |
duke@1 | 619 | return false; |
duke@1 | 620 | } |
duke@1 | 621 | return (set.size() == 0); |
duke@1 | 622 | } |
duke@1 | 623 | return t.tsym == s.tsym |
duke@1 | 624 | && visit(t.getEnclosingType(), s.getEnclosingType()) |
duke@1 | 625 | && containsTypeEquivalent(t.getTypeArguments(), s.getTypeArguments()); |
duke@1 | 626 | } |
duke@1 | 627 | |
duke@1 | 628 | @Override |
duke@1 | 629 | public Boolean visitArrayType(ArrayType t, Type s) { |
duke@1 | 630 | if (t == s) |
duke@1 | 631 | return true; |
duke@1 | 632 | |
duke@1 | 633 | if (s.tag >= firstPartialTag) |
duke@1 | 634 | return visit(s, t); |
duke@1 | 635 | |
duke@1 | 636 | return s.tag == ARRAY |
duke@1 | 637 | && containsTypeEquivalent(t.elemtype, elemtype(s)); |
duke@1 | 638 | } |
duke@1 | 639 | |
duke@1 | 640 | @Override |
duke@1 | 641 | public Boolean visitMethodType(MethodType t, Type s) { |
duke@1 | 642 | // isSameType for methods does not take thrown |
duke@1 | 643 | // exceptions into account! |
duke@1 | 644 | return hasSameArgs(t, s) && visit(t.getReturnType(), s.getReturnType()); |
duke@1 | 645 | } |
duke@1 | 646 | |
duke@1 | 647 | @Override |
duke@1 | 648 | public Boolean visitPackageType(PackageType t, Type s) { |
duke@1 | 649 | return t == s; |
duke@1 | 650 | } |
duke@1 | 651 | |
duke@1 | 652 | @Override |
duke@1 | 653 | public Boolean visitForAll(ForAll t, Type s) { |
duke@1 | 654 | if (s.tag != FORALL) |
duke@1 | 655 | return false; |
duke@1 | 656 | |
duke@1 | 657 | ForAll forAll = (ForAll)s; |
duke@1 | 658 | return hasSameBounds(t, forAll) |
duke@1 | 659 | && visit(t.qtype, subst(forAll.qtype, forAll.tvars, t.tvars)); |
duke@1 | 660 | } |
duke@1 | 661 | |
duke@1 | 662 | @Override |
duke@1 | 663 | public Boolean visitUndetVar(UndetVar t, Type s) { |
duke@1 | 664 | if (s.tag == WILDCARD) |
duke@1 | 665 | // FIXME, this might be leftovers from before capture conversion |
duke@1 | 666 | return false; |
duke@1 | 667 | |
duke@1 | 668 | if (t == s || t.qtype == s || s.tag == ERROR || s.tag == UNKNOWN) |
duke@1 | 669 | return true; |
duke@1 | 670 | |
duke@1 | 671 | if (t.inst != null) |
duke@1 | 672 | return visit(t.inst, s); |
duke@1 | 673 | |
duke@1 | 674 | t.inst = fromUnknownFun.apply(s); |
duke@1 | 675 | for (List<Type> l = t.lobounds; l.nonEmpty(); l = l.tail) { |
duke@1 | 676 | if (!isSubtype(l.head, t.inst)) |
duke@1 | 677 | return false; |
duke@1 | 678 | } |
duke@1 | 679 | for (List<Type> l = t.hibounds; l.nonEmpty(); l = l.tail) { |
duke@1 | 680 | if (!isSubtype(t.inst, l.head)) |
duke@1 | 681 | return false; |
duke@1 | 682 | } |
duke@1 | 683 | return true; |
duke@1 | 684 | } |
duke@1 | 685 | |
duke@1 | 686 | @Override |
duke@1 | 687 | public Boolean visitErrorType(ErrorType t, Type s) { |
duke@1 | 688 | return true; |
duke@1 | 689 | } |
duke@1 | 690 | }; |
duke@1 | 691 | // </editor-fold> |
duke@1 | 692 | |
duke@1 | 693 | // <editor-fold defaultstate="collapsed" desc="fromUnknownFun"> |
duke@1 | 694 | /** |
duke@1 | 695 | * A mapping that turns all unknown types in this type to fresh |
duke@1 | 696 | * unknown variables. |
duke@1 | 697 | */ |
duke@1 | 698 | public Mapping fromUnknownFun = new Mapping("fromUnknownFun") { |
duke@1 | 699 | public Type apply(Type t) { |
duke@1 | 700 | if (t.tag == UNKNOWN) return new UndetVar(t); |
duke@1 | 701 | else return t.map(this); |
duke@1 | 702 | } |
duke@1 | 703 | }; |
duke@1 | 704 | // </editor-fold> |
duke@1 | 705 | |
duke@1 | 706 | // <editor-fold defaultstate="collapsed" desc="Contains Type"> |
duke@1 | 707 | public boolean containedBy(Type t, Type s) { |
duke@1 | 708 | switch (t.tag) { |
duke@1 | 709 | case UNDETVAR: |
duke@1 | 710 | if (s.tag == WILDCARD) { |
duke@1 | 711 | UndetVar undetvar = (UndetVar)t; |
mcimadamore@210 | 712 | WildcardType wt = (WildcardType)s; |
mcimadamore@210 | 713 | switch(wt.kind) { |
mcimadamore@210 | 714 | case UNBOUND: //similar to ? extends Object |
mcimadamore@210 | 715 | case EXTENDS: { |
mcimadamore@210 | 716 | Type bound = upperBound(s); |
mcimadamore@210 | 717 | // We should check the new upper bound against any of the |
mcimadamore@210 | 718 | // undetvar's lower bounds. |
mcimadamore@210 | 719 | for (Type t2 : undetvar.lobounds) { |
mcimadamore@210 | 720 | if (!isSubtype(t2, bound)) |
mcimadamore@210 | 721 | return false; |
mcimadamore@210 | 722 | } |
mcimadamore@210 | 723 | undetvar.hibounds = undetvar.hibounds.prepend(bound); |
mcimadamore@210 | 724 | break; |
mcimadamore@210 | 725 | } |
mcimadamore@210 | 726 | case SUPER: { |
mcimadamore@210 | 727 | Type bound = lowerBound(s); |
mcimadamore@210 | 728 | // We should check the new lower bound against any of the |
mcimadamore@210 | 729 | // undetvar's lower bounds. |
mcimadamore@210 | 730 | for (Type t2 : undetvar.hibounds) { |
mcimadamore@210 | 731 | if (!isSubtype(bound, t2)) |
mcimadamore@210 | 732 | return false; |
mcimadamore@210 | 733 | } |
mcimadamore@210 | 734 | undetvar.lobounds = undetvar.lobounds.prepend(bound); |
mcimadamore@210 | 735 | break; |
mcimadamore@210 | 736 | } |
mcimadamore@162 | 737 | } |
duke@1 | 738 | return true; |
duke@1 | 739 | } else { |
duke@1 | 740 | return isSameType(t, s); |
duke@1 | 741 | } |
duke@1 | 742 | case ERROR: |
duke@1 | 743 | return true; |
duke@1 | 744 | default: |
duke@1 | 745 | return containsType(s, t); |
duke@1 | 746 | } |
duke@1 | 747 | } |
duke@1 | 748 | |
duke@1 | 749 | boolean containsType(List<Type> ts, List<Type> ss) { |
duke@1 | 750 | while (ts.nonEmpty() && ss.nonEmpty() |
duke@1 | 751 | && containsType(ts.head, ss.head)) { |
duke@1 | 752 | ts = ts.tail; |
duke@1 | 753 | ss = ss.tail; |
duke@1 | 754 | } |
duke@1 | 755 | return ts.isEmpty() && ss.isEmpty(); |
duke@1 | 756 | } |
duke@1 | 757 | |
duke@1 | 758 | /** |
duke@1 | 759 | * Check if t contains s. |
duke@1 | 760 | * |
duke@1 | 761 | * <p>T contains S if: |
duke@1 | 762 | * |
duke@1 | 763 | * <p>{@code L(T) <: L(S) && U(S) <: U(T)} |
duke@1 | 764 | * |
duke@1 | 765 | * <p>This relation is only used by ClassType.isSubtype(), that |
duke@1 | 766 | * is, |
duke@1 | 767 | * |
duke@1 | 768 | * <p>{@code C<S> <: C<T> if T contains S.} |
duke@1 | 769 | * |
duke@1 | 770 | * <p>Because of F-bounds, this relation can lead to infinite |
duke@1 | 771 | * recursion. Thus we must somehow break that recursion. Notice |
duke@1 | 772 | * that containsType() is only called from ClassType.isSubtype(). |
duke@1 | 773 | * Since the arguments have already been checked against their |
duke@1 | 774 | * bounds, we know: |
duke@1 | 775 | * |
duke@1 | 776 | * <p>{@code U(S) <: U(T) if T is "super" bound (U(T) *is* the bound)} |
duke@1 | 777 | * |
duke@1 | 778 | * <p>{@code L(T) <: L(S) if T is "extends" bound (L(T) is bottom)} |
duke@1 | 779 | * |
duke@1 | 780 | * @param t a type |
duke@1 | 781 | * @param s a type |
duke@1 | 782 | */ |
duke@1 | 783 | public boolean containsType(Type t, Type s) { |
duke@1 | 784 | return containsType.visit(t, s); |
duke@1 | 785 | } |
duke@1 | 786 | // where |
duke@1 | 787 | private TypeRelation containsType = new TypeRelation() { |
duke@1 | 788 | |
duke@1 | 789 | private Type U(Type t) { |
duke@1 | 790 | while (t.tag == WILDCARD) { |
duke@1 | 791 | WildcardType w = (WildcardType)t; |
duke@1 | 792 | if (w.isSuperBound()) |
duke@1 | 793 | return w.bound == null ? syms.objectType : w.bound.bound; |
duke@1 | 794 | else |
duke@1 | 795 | t = w.type; |
duke@1 | 796 | } |
duke@1 | 797 | return t; |
duke@1 | 798 | } |
duke@1 | 799 | |
duke@1 | 800 | private Type L(Type t) { |
duke@1 | 801 | while (t.tag == WILDCARD) { |
duke@1 | 802 | WildcardType w = (WildcardType)t; |
duke@1 | 803 | if (w.isExtendsBound()) |
duke@1 | 804 | return syms.botType; |
duke@1 | 805 | else |
duke@1 | 806 | t = w.type; |
duke@1 | 807 | } |
duke@1 | 808 | return t; |
duke@1 | 809 | } |
duke@1 | 810 | |
duke@1 | 811 | public Boolean visitType(Type t, Type s) { |
duke@1 | 812 | if (s.tag >= firstPartialTag) |
duke@1 | 813 | return containedBy(s, t); |
duke@1 | 814 | else |
duke@1 | 815 | return isSameType(t, s); |
duke@1 | 816 | } |
duke@1 | 817 | |
duke@1 | 818 | void debugContainsType(WildcardType t, Type s) { |
duke@1 | 819 | System.err.println(); |
duke@1 | 820 | System.err.format(" does %s contain %s?%n", t, s); |
duke@1 | 821 | System.err.format(" %s U(%s) <: U(%s) %s = %s%n", |
duke@1 | 822 | upperBound(s), s, t, U(t), |
duke@1 | 823 | t.isSuperBound() |
duke@1 | 824 | || isSubtypeNoCapture(upperBound(s), U(t))); |
duke@1 | 825 | System.err.format(" %s L(%s) <: L(%s) %s = %s%n", |
duke@1 | 826 | L(t), t, s, lowerBound(s), |
duke@1 | 827 | t.isExtendsBound() |
duke@1 | 828 | || isSubtypeNoCapture(L(t), lowerBound(s))); |
duke@1 | 829 | System.err.println(); |
duke@1 | 830 | } |
duke@1 | 831 | |
duke@1 | 832 | @Override |
duke@1 | 833 | public Boolean visitWildcardType(WildcardType t, Type s) { |
duke@1 | 834 | if (s.tag >= firstPartialTag) |
duke@1 | 835 | return containedBy(s, t); |
duke@1 | 836 | else { |
duke@1 | 837 | // debugContainsType(t, s); |
duke@1 | 838 | return isSameWildcard(t, s) |
duke@1 | 839 | || isCaptureOf(s, t) |
duke@1 | 840 | || ((t.isExtendsBound() || isSubtypeNoCapture(L(t), lowerBound(s))) && |
duke@1 | 841 | (t.isSuperBound() || isSubtypeNoCapture(upperBound(s), U(t)))); |
duke@1 | 842 | } |
duke@1 | 843 | } |
duke@1 | 844 | |
duke@1 | 845 | @Override |
duke@1 | 846 | public Boolean visitUndetVar(UndetVar t, Type s) { |
duke@1 | 847 | if (s.tag != WILDCARD) |
duke@1 | 848 | return isSameType(t, s); |
duke@1 | 849 | else |
duke@1 | 850 | return false; |
duke@1 | 851 | } |
duke@1 | 852 | |
duke@1 | 853 | @Override |
duke@1 | 854 | public Boolean visitErrorType(ErrorType t, Type s) { |
duke@1 | 855 | return true; |
duke@1 | 856 | } |
duke@1 | 857 | }; |
duke@1 | 858 | |
duke@1 | 859 | public boolean isCaptureOf(Type s, WildcardType t) { |
mcimadamore@79 | 860 | if (s.tag != TYPEVAR || !((TypeVar)s).isCaptured()) |
duke@1 | 861 | return false; |
duke@1 | 862 | return isSameWildcard(t, ((CapturedType)s).wildcard); |
duke@1 | 863 | } |
duke@1 | 864 | |
duke@1 | 865 | public boolean isSameWildcard(WildcardType t, Type s) { |
duke@1 | 866 | if (s.tag != WILDCARD) |
duke@1 | 867 | return false; |
duke@1 | 868 | WildcardType w = (WildcardType)s; |
duke@1 | 869 | return w.kind == t.kind && w.type == t.type; |
duke@1 | 870 | } |
duke@1 | 871 | |
duke@1 | 872 | public boolean containsTypeEquivalent(List<Type> ts, List<Type> ss) { |
duke@1 | 873 | while (ts.nonEmpty() && ss.nonEmpty() |
duke@1 | 874 | && containsTypeEquivalent(ts.head, ss.head)) { |
duke@1 | 875 | ts = ts.tail; |
duke@1 | 876 | ss = ss.tail; |
duke@1 | 877 | } |
duke@1 | 878 | return ts.isEmpty() && ss.isEmpty(); |
duke@1 | 879 | } |
duke@1 | 880 | // </editor-fold> |
duke@1 | 881 | |
duke@1 | 882 | // <editor-fold defaultstate="collapsed" desc="isCastable"> |
duke@1 | 883 | public boolean isCastable(Type t, Type s) { |
duke@1 | 884 | return isCastable(t, s, Warner.noWarnings); |
duke@1 | 885 | } |
duke@1 | 886 | |
duke@1 | 887 | /** |
duke@1 | 888 | * Is t is castable to s?<br> |
duke@1 | 889 | * s is assumed to be an erased type.<br> |
duke@1 | 890 | * (not defined for Method and ForAll types). |
duke@1 | 891 | */ |
duke@1 | 892 | public boolean isCastable(Type t, Type s, Warner warn) { |
duke@1 | 893 | if (t == s) |
duke@1 | 894 | return true; |
duke@1 | 895 | |
duke@1 | 896 | if (t.isPrimitive() != s.isPrimitive()) |
duke@1 | 897 | return allowBoxing && isConvertible(t, s, warn); |
duke@1 | 898 | |
duke@1 | 899 | if (warn != warnStack.head) { |
duke@1 | 900 | try { |
duke@1 | 901 | warnStack = warnStack.prepend(warn); |
mcimadamore@185 | 902 | return isCastable.visit(t,s); |
duke@1 | 903 | } finally { |
duke@1 | 904 | warnStack = warnStack.tail; |
duke@1 | 905 | } |
duke@1 | 906 | } else { |
mcimadamore@185 | 907 | return isCastable.visit(t,s); |
duke@1 | 908 | } |
duke@1 | 909 | } |
duke@1 | 910 | // where |
duke@1 | 911 | private TypeRelation isCastable = new TypeRelation() { |
duke@1 | 912 | |
duke@1 | 913 | public Boolean visitType(Type t, Type s) { |
duke@1 | 914 | if (s.tag == ERROR) |
duke@1 | 915 | return true; |
duke@1 | 916 | |
duke@1 | 917 | switch (t.tag) { |
duke@1 | 918 | case BYTE: case CHAR: case SHORT: case INT: case LONG: case FLOAT: |
duke@1 | 919 | case DOUBLE: |
duke@1 | 920 | return s.tag <= DOUBLE; |
duke@1 | 921 | case BOOLEAN: |
duke@1 | 922 | return s.tag == BOOLEAN; |
duke@1 | 923 | case VOID: |
duke@1 | 924 | return false; |
duke@1 | 925 | case BOT: |
duke@1 | 926 | return isSubtype(t, s); |
duke@1 | 927 | default: |
duke@1 | 928 | throw new AssertionError(); |
duke@1 | 929 | } |
duke@1 | 930 | } |
duke@1 | 931 | |
duke@1 | 932 | @Override |
duke@1 | 933 | public Boolean visitWildcardType(WildcardType t, Type s) { |
duke@1 | 934 | return isCastable(upperBound(t), s, warnStack.head); |
duke@1 | 935 | } |
duke@1 | 936 | |
duke@1 | 937 | @Override |
duke@1 | 938 | public Boolean visitClassType(ClassType t, Type s) { |
duke@1 | 939 | if (s.tag == ERROR || s.tag == BOT) |
duke@1 | 940 | return true; |
duke@1 | 941 | |
duke@1 | 942 | if (s.tag == TYPEVAR) { |
duke@1 | 943 | if (isCastable(s.getUpperBound(), t, Warner.noWarnings)) { |
duke@1 | 944 | warnStack.head.warnUnchecked(); |
duke@1 | 945 | return true; |
duke@1 | 946 | } else { |
duke@1 | 947 | return false; |
duke@1 | 948 | } |
duke@1 | 949 | } |
duke@1 | 950 | |
duke@1 | 951 | if (t.isCompound()) { |
mcimadamore@211 | 952 | Warner oldWarner = warnStack.head; |
mcimadamore@211 | 953 | warnStack.head = Warner.noWarnings; |
duke@1 | 954 | if (!visit(supertype(t), s)) |
duke@1 | 955 | return false; |
duke@1 | 956 | for (Type intf : interfaces(t)) { |
duke@1 | 957 | if (!visit(intf, s)) |
duke@1 | 958 | return false; |
duke@1 | 959 | } |
mcimadamore@211 | 960 | if (warnStack.head.unchecked == true) |
mcimadamore@211 | 961 | oldWarner.warnUnchecked(); |
duke@1 | 962 | return true; |
duke@1 | 963 | } |
duke@1 | 964 | |
duke@1 | 965 | if (s.isCompound()) { |
duke@1 | 966 | // call recursively to reuse the above code |
duke@1 | 967 | return visitClassType((ClassType)s, t); |
duke@1 | 968 | } |
duke@1 | 969 | |
duke@1 | 970 | if (s.tag == CLASS || s.tag == ARRAY) { |
duke@1 | 971 | boolean upcast; |
duke@1 | 972 | if ((upcast = isSubtype(erasure(t), erasure(s))) |
duke@1 | 973 | || isSubtype(erasure(s), erasure(t))) { |
duke@1 | 974 | if (!upcast && s.tag == ARRAY) { |
duke@1 | 975 | if (!isReifiable(s)) |
duke@1 | 976 | warnStack.head.warnUnchecked(); |
duke@1 | 977 | return true; |
duke@1 | 978 | } else if (s.isRaw()) { |
duke@1 | 979 | return true; |
duke@1 | 980 | } else if (t.isRaw()) { |
duke@1 | 981 | if (!isUnbounded(s)) |
duke@1 | 982 | warnStack.head.warnUnchecked(); |
duke@1 | 983 | return true; |
duke@1 | 984 | } |
duke@1 | 985 | // Assume |a| <: |b| |
duke@1 | 986 | final Type a = upcast ? t : s; |
duke@1 | 987 | final Type b = upcast ? s : t; |
duke@1 | 988 | final boolean HIGH = true; |
duke@1 | 989 | final boolean LOW = false; |
duke@1 | 990 | final boolean DONT_REWRITE_TYPEVARS = false; |
duke@1 | 991 | Type aHigh = rewriteQuantifiers(a, HIGH, DONT_REWRITE_TYPEVARS); |
duke@1 | 992 | Type aLow = rewriteQuantifiers(a, LOW, DONT_REWRITE_TYPEVARS); |
duke@1 | 993 | Type bHigh = rewriteQuantifiers(b, HIGH, DONT_REWRITE_TYPEVARS); |
duke@1 | 994 | Type bLow = rewriteQuantifiers(b, LOW, DONT_REWRITE_TYPEVARS); |
duke@1 | 995 | Type lowSub = asSub(bLow, aLow.tsym); |
duke@1 | 996 | Type highSub = (lowSub == null) ? null : asSub(bHigh, aHigh.tsym); |
duke@1 | 997 | if (highSub == null) { |
duke@1 | 998 | final boolean REWRITE_TYPEVARS = true; |
duke@1 | 999 | aHigh = rewriteQuantifiers(a, HIGH, REWRITE_TYPEVARS); |
duke@1 | 1000 | aLow = rewriteQuantifiers(a, LOW, REWRITE_TYPEVARS); |
duke@1 | 1001 | bHigh = rewriteQuantifiers(b, HIGH, REWRITE_TYPEVARS); |
duke@1 | 1002 | bLow = rewriteQuantifiers(b, LOW, REWRITE_TYPEVARS); |
duke@1 | 1003 | lowSub = asSub(bLow, aLow.tsym); |
duke@1 | 1004 | highSub = (lowSub == null) ? null : asSub(bHigh, aHigh.tsym); |
duke@1 | 1005 | } |
duke@1 | 1006 | if (highSub != null) { |
duke@1 | 1007 | assert a.tsym == highSub.tsym && a.tsym == lowSub.tsym |
duke@1 | 1008 | : a.tsym + " != " + highSub.tsym + " != " + lowSub.tsym; |
mcimadamore@185 | 1009 | if (!disjointTypes(aHigh.allparams(), highSub.allparams()) |
mcimadamore@185 | 1010 | && !disjointTypes(aHigh.allparams(), lowSub.allparams()) |
mcimadamore@185 | 1011 | && !disjointTypes(aLow.allparams(), highSub.allparams()) |
mcimadamore@185 | 1012 | && !disjointTypes(aLow.allparams(), lowSub.allparams())) { |
mcimadamore@235 | 1013 | if (upcast ? giveWarning(a, b) : |
mcimadamore@235 | 1014 | giveWarning(b, a)) |
duke@1 | 1015 | warnStack.head.warnUnchecked(); |
duke@1 | 1016 | return true; |
duke@1 | 1017 | } |
duke@1 | 1018 | } |
duke@1 | 1019 | if (isReifiable(s)) |
duke@1 | 1020 | return isSubtypeUnchecked(a, b); |
duke@1 | 1021 | else |
duke@1 | 1022 | return isSubtypeUnchecked(a, b, warnStack.head); |
duke@1 | 1023 | } |
duke@1 | 1024 | |
duke@1 | 1025 | // Sidecast |
duke@1 | 1026 | if (s.tag == CLASS) { |
duke@1 | 1027 | if ((s.tsym.flags() & INTERFACE) != 0) { |
duke@1 | 1028 | return ((t.tsym.flags() & FINAL) == 0) |
duke@1 | 1029 | ? sideCast(t, s, warnStack.head) |
duke@1 | 1030 | : sideCastFinal(t, s, warnStack.head); |
duke@1 | 1031 | } else if ((t.tsym.flags() & INTERFACE) != 0) { |
duke@1 | 1032 | return ((s.tsym.flags() & FINAL) == 0) |
duke@1 | 1033 | ? sideCast(t, s, warnStack.head) |
duke@1 | 1034 | : sideCastFinal(t, s, warnStack.head); |
duke@1 | 1035 | } else { |
duke@1 | 1036 | // unrelated class types |
duke@1 | 1037 | return false; |
duke@1 | 1038 | } |
duke@1 | 1039 | } |
duke@1 | 1040 | } |
duke@1 | 1041 | return false; |
duke@1 | 1042 | } |
duke@1 | 1043 | |
duke@1 | 1044 | @Override |
duke@1 | 1045 | public Boolean visitArrayType(ArrayType t, Type s) { |
duke@1 | 1046 | switch (s.tag) { |
duke@1 | 1047 | case ERROR: |
duke@1 | 1048 | case BOT: |
duke@1 | 1049 | return true; |
duke@1 | 1050 | case TYPEVAR: |
duke@1 | 1051 | if (isCastable(s, t, Warner.noWarnings)) { |
duke@1 | 1052 | warnStack.head.warnUnchecked(); |
duke@1 | 1053 | return true; |
duke@1 | 1054 | } else { |
duke@1 | 1055 | return false; |
duke@1 | 1056 | } |
duke@1 | 1057 | case CLASS: |
duke@1 | 1058 | return isSubtype(t, s); |
duke@1 | 1059 | case ARRAY: |
duke@1 | 1060 | if (elemtype(t).tag <= lastBaseTag) { |
duke@1 | 1061 | return elemtype(t).tag == elemtype(s).tag; |
duke@1 | 1062 | } else { |
duke@1 | 1063 | return visit(elemtype(t), elemtype(s)); |
duke@1 | 1064 | } |
duke@1 | 1065 | default: |
duke@1 | 1066 | return false; |
duke@1 | 1067 | } |
duke@1 | 1068 | } |
duke@1 | 1069 | |
duke@1 | 1070 | @Override |
duke@1 | 1071 | public Boolean visitTypeVar(TypeVar t, Type s) { |
duke@1 | 1072 | switch (s.tag) { |
duke@1 | 1073 | case ERROR: |
duke@1 | 1074 | case BOT: |
duke@1 | 1075 | return true; |
duke@1 | 1076 | case TYPEVAR: |
duke@1 | 1077 | if (isSubtype(t, s)) { |
duke@1 | 1078 | return true; |
duke@1 | 1079 | } else if (isCastable(t.bound, s, Warner.noWarnings)) { |
duke@1 | 1080 | warnStack.head.warnUnchecked(); |
duke@1 | 1081 | return true; |
duke@1 | 1082 | } else { |
duke@1 | 1083 | return false; |
duke@1 | 1084 | } |
duke@1 | 1085 | default: |
duke@1 | 1086 | return isCastable(t.bound, s, warnStack.head); |
duke@1 | 1087 | } |
duke@1 | 1088 | } |
duke@1 | 1089 | |
duke@1 | 1090 | @Override |
duke@1 | 1091 | public Boolean visitErrorType(ErrorType t, Type s) { |
duke@1 | 1092 | return true; |
duke@1 | 1093 | } |
duke@1 | 1094 | }; |
duke@1 | 1095 | // </editor-fold> |
duke@1 | 1096 | |
duke@1 | 1097 | // <editor-fold defaultstate="collapsed" desc="disjointTypes"> |
duke@1 | 1098 | public boolean disjointTypes(List<Type> ts, List<Type> ss) { |
duke@1 | 1099 | while (ts.tail != null && ss.tail != null) { |
duke@1 | 1100 | if (disjointType(ts.head, ss.head)) return true; |
duke@1 | 1101 | ts = ts.tail; |
duke@1 | 1102 | ss = ss.tail; |
duke@1 | 1103 | } |
duke@1 | 1104 | return false; |
duke@1 | 1105 | } |
duke@1 | 1106 | |
duke@1 | 1107 | /** |
duke@1 | 1108 | * Two types or wildcards are considered disjoint if it can be |
duke@1 | 1109 | * proven that no type can be contained in both. It is |
duke@1 | 1110 | * conservative in that it is allowed to say that two types are |
duke@1 | 1111 | * not disjoint, even though they actually are. |
duke@1 | 1112 | * |
duke@1 | 1113 | * The type C<X> is castable to C<Y> exactly if X and Y are not |
duke@1 | 1114 | * disjoint. |
duke@1 | 1115 | */ |
duke@1 | 1116 | public boolean disjointType(Type t, Type s) { |
duke@1 | 1117 | return disjointType.visit(t, s); |
duke@1 | 1118 | } |
duke@1 | 1119 | // where |
duke@1 | 1120 | private TypeRelation disjointType = new TypeRelation() { |
duke@1 | 1121 | |
duke@1 | 1122 | private Set<TypePair> cache = new HashSet<TypePair>(); |
duke@1 | 1123 | |
duke@1 | 1124 | public Boolean visitType(Type t, Type s) { |
duke@1 | 1125 | if (s.tag == WILDCARD) |
duke@1 | 1126 | return visit(s, t); |
duke@1 | 1127 | else |
duke@1 | 1128 | return notSoftSubtypeRecursive(t, s) || notSoftSubtypeRecursive(s, t); |
duke@1 | 1129 | } |
duke@1 | 1130 | |
duke@1 | 1131 | private boolean isCastableRecursive(Type t, Type s) { |
duke@1 | 1132 | TypePair pair = new TypePair(t, s); |
duke@1 | 1133 | if (cache.add(pair)) { |
duke@1 | 1134 | try { |
duke@1 | 1135 | return Types.this.isCastable(t, s); |
duke@1 | 1136 | } finally { |
duke@1 | 1137 | cache.remove(pair); |
duke@1 | 1138 | } |
duke@1 | 1139 | } else { |
duke@1 | 1140 | return true; |
duke@1 | 1141 | } |
duke@1 | 1142 | } |
duke@1 | 1143 | |
duke@1 | 1144 | private boolean notSoftSubtypeRecursive(Type t, Type s) { |
duke@1 | 1145 | TypePair pair = new TypePair(t, s); |
duke@1 | 1146 | if (cache.add(pair)) { |
duke@1 | 1147 | try { |
duke@1 | 1148 | return Types.this.notSoftSubtype(t, s); |
duke@1 | 1149 | } finally { |
duke@1 | 1150 | cache.remove(pair); |
duke@1 | 1151 | } |
duke@1 | 1152 | } else { |
duke@1 | 1153 | return false; |
duke@1 | 1154 | } |
duke@1 | 1155 | } |
duke@1 | 1156 | |
duke@1 | 1157 | @Override |
duke@1 | 1158 | public Boolean visitWildcardType(WildcardType t, Type s) { |
duke@1 | 1159 | if (t.isUnbound()) |
duke@1 | 1160 | return false; |
duke@1 | 1161 | |
duke@1 | 1162 | if (s.tag != WILDCARD) { |
duke@1 | 1163 | if (t.isExtendsBound()) |
duke@1 | 1164 | return notSoftSubtypeRecursive(s, t.type); |
duke@1 | 1165 | else // isSuperBound() |
duke@1 | 1166 | return notSoftSubtypeRecursive(t.type, s); |
duke@1 | 1167 | } |
duke@1 | 1168 | |
duke@1 | 1169 | if (s.isUnbound()) |
duke@1 | 1170 | return false; |
duke@1 | 1171 | |
duke@1 | 1172 | if (t.isExtendsBound()) { |
duke@1 | 1173 | if (s.isExtendsBound()) |
duke@1 | 1174 | return !isCastableRecursive(t.type, upperBound(s)); |
duke@1 | 1175 | else if (s.isSuperBound()) |
duke@1 | 1176 | return notSoftSubtypeRecursive(lowerBound(s), t.type); |
duke@1 | 1177 | } else if (t.isSuperBound()) { |
duke@1 | 1178 | if (s.isExtendsBound()) |
duke@1 | 1179 | return notSoftSubtypeRecursive(t.type, upperBound(s)); |
duke@1 | 1180 | } |
duke@1 | 1181 | return false; |
duke@1 | 1182 | } |
duke@1 | 1183 | }; |
duke@1 | 1184 | // </editor-fold> |
duke@1 | 1185 | |
duke@1 | 1186 | // <editor-fold defaultstate="collapsed" desc="lowerBoundArgtypes"> |
duke@1 | 1187 | /** |
duke@1 | 1188 | * Returns the lower bounds of the formals of a method. |
duke@1 | 1189 | */ |
duke@1 | 1190 | public List<Type> lowerBoundArgtypes(Type t) { |
duke@1 | 1191 | return map(t.getParameterTypes(), lowerBoundMapping); |
duke@1 | 1192 | } |
duke@1 | 1193 | private final Mapping lowerBoundMapping = new Mapping("lowerBound") { |
duke@1 | 1194 | public Type apply(Type t) { |
duke@1 | 1195 | return lowerBound(t); |
duke@1 | 1196 | } |
duke@1 | 1197 | }; |
duke@1 | 1198 | // </editor-fold> |
duke@1 | 1199 | |
duke@1 | 1200 | // <editor-fold defaultstate="collapsed" desc="notSoftSubtype"> |
duke@1 | 1201 | /** |
duke@1 | 1202 | * This relation answers the question: is impossible that |
duke@1 | 1203 | * something of type `t' can be a subtype of `s'? This is |
duke@1 | 1204 | * different from the question "is `t' not a subtype of `s'?" |
duke@1 | 1205 | * when type variables are involved: Integer is not a subtype of T |
duke@1 | 1206 | * where <T extends Number> but it is not true that Integer cannot |
duke@1 | 1207 | * possibly be a subtype of T. |
duke@1 | 1208 | */ |
duke@1 | 1209 | public boolean notSoftSubtype(Type t, Type s) { |
duke@1 | 1210 | if (t == s) return false; |
duke@1 | 1211 | if (t.tag == TYPEVAR) { |
duke@1 | 1212 | TypeVar tv = (TypeVar) t; |
duke@1 | 1213 | if (s.tag == TYPEVAR) |
duke@1 | 1214 | s = s.getUpperBound(); |
duke@1 | 1215 | return !isCastable(tv.bound, |
duke@1 | 1216 | s, |
duke@1 | 1217 | Warner.noWarnings); |
duke@1 | 1218 | } |
duke@1 | 1219 | if (s.tag != WILDCARD) |
duke@1 | 1220 | s = upperBound(s); |
duke@1 | 1221 | if (s.tag == TYPEVAR) |
duke@1 | 1222 | s = s.getUpperBound(); |
mcimadamore@185 | 1223 | |
duke@1 | 1224 | return !isSubtype(t, s); |
duke@1 | 1225 | } |
duke@1 | 1226 | // </editor-fold> |
duke@1 | 1227 | |
duke@1 | 1228 | // <editor-fold defaultstate="collapsed" desc="isReifiable"> |
duke@1 | 1229 | public boolean isReifiable(Type t) { |
duke@1 | 1230 | return isReifiable.visit(t); |
duke@1 | 1231 | } |
duke@1 | 1232 | // where |
duke@1 | 1233 | private UnaryVisitor<Boolean> isReifiable = new UnaryVisitor<Boolean>() { |
duke@1 | 1234 | |
duke@1 | 1235 | public Boolean visitType(Type t, Void ignored) { |
duke@1 | 1236 | return true; |
duke@1 | 1237 | } |
duke@1 | 1238 | |
duke@1 | 1239 | @Override |
duke@1 | 1240 | public Boolean visitClassType(ClassType t, Void ignored) { |
duke@1 | 1241 | if (!t.isParameterized()) |
duke@1 | 1242 | return true; |
duke@1 | 1243 | |
duke@1 | 1244 | for (Type param : t.allparams()) { |
duke@1 | 1245 | if (!param.isUnbound()) |
duke@1 | 1246 | return false; |
duke@1 | 1247 | } |
duke@1 | 1248 | return true; |
duke@1 | 1249 | } |
duke@1 | 1250 | |
duke@1 | 1251 | @Override |
duke@1 | 1252 | public Boolean visitArrayType(ArrayType t, Void ignored) { |
duke@1 | 1253 | return visit(t.elemtype); |
duke@1 | 1254 | } |
duke@1 | 1255 | |
duke@1 | 1256 | @Override |
duke@1 | 1257 | public Boolean visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 1258 | return false; |
duke@1 | 1259 | } |
duke@1 | 1260 | }; |
duke@1 | 1261 | // </editor-fold> |
duke@1 | 1262 | |
duke@1 | 1263 | // <editor-fold defaultstate="collapsed" desc="Array Utils"> |
duke@1 | 1264 | public boolean isArray(Type t) { |
duke@1 | 1265 | while (t.tag == WILDCARD) |
duke@1 | 1266 | t = upperBound(t); |
duke@1 | 1267 | return t.tag == ARRAY; |
duke@1 | 1268 | } |
duke@1 | 1269 | |
duke@1 | 1270 | /** |
duke@1 | 1271 | * The element type of an array. |
duke@1 | 1272 | */ |
duke@1 | 1273 | public Type elemtype(Type t) { |
duke@1 | 1274 | switch (t.tag) { |
duke@1 | 1275 | case WILDCARD: |
duke@1 | 1276 | return elemtype(upperBound(t)); |
duke@1 | 1277 | case ARRAY: |
duke@1 | 1278 | return ((ArrayType)t).elemtype; |
duke@1 | 1279 | case FORALL: |
duke@1 | 1280 | return elemtype(((ForAll)t).qtype); |
duke@1 | 1281 | case ERROR: |
duke@1 | 1282 | return t; |
duke@1 | 1283 | default: |
duke@1 | 1284 | return null; |
duke@1 | 1285 | } |
duke@1 | 1286 | } |
duke@1 | 1287 | |
duke@1 | 1288 | /** |
duke@1 | 1289 | * Mapping to take element type of an arraytype |
duke@1 | 1290 | */ |
duke@1 | 1291 | private Mapping elemTypeFun = new Mapping ("elemTypeFun") { |
duke@1 | 1292 | public Type apply(Type t) { return elemtype(t); } |
duke@1 | 1293 | }; |
duke@1 | 1294 | |
duke@1 | 1295 | /** |
duke@1 | 1296 | * The number of dimensions of an array type. |
duke@1 | 1297 | */ |
duke@1 | 1298 | public int dimensions(Type t) { |
duke@1 | 1299 | int result = 0; |
duke@1 | 1300 | while (t.tag == ARRAY) { |
duke@1 | 1301 | result++; |
duke@1 | 1302 | t = elemtype(t); |
duke@1 | 1303 | } |
duke@1 | 1304 | return result; |
duke@1 | 1305 | } |
duke@1 | 1306 | // </editor-fold> |
duke@1 | 1307 | |
duke@1 | 1308 | // <editor-fold defaultstate="collapsed" desc="asSuper"> |
duke@1 | 1309 | /** |
duke@1 | 1310 | * Return the (most specific) base type of t that starts with the |
duke@1 | 1311 | * given symbol. If none exists, return null. |
duke@1 | 1312 | * |
duke@1 | 1313 | * @param t a type |
duke@1 | 1314 | * @param sym a symbol |
duke@1 | 1315 | */ |
duke@1 | 1316 | public Type asSuper(Type t, Symbol sym) { |
duke@1 | 1317 | return asSuper.visit(t, sym); |
duke@1 | 1318 | } |
duke@1 | 1319 | // where |
duke@1 | 1320 | private SimpleVisitor<Type,Symbol> asSuper = new SimpleVisitor<Type,Symbol>() { |
duke@1 | 1321 | |
duke@1 | 1322 | public Type visitType(Type t, Symbol sym) { |
duke@1 | 1323 | return null; |
duke@1 | 1324 | } |
duke@1 | 1325 | |
duke@1 | 1326 | @Override |
duke@1 | 1327 | public Type visitClassType(ClassType t, Symbol sym) { |
duke@1 | 1328 | if (t.tsym == sym) |
duke@1 | 1329 | return t; |
duke@1 | 1330 | |
duke@1 | 1331 | Type st = supertype(t); |
mcimadamore@19 | 1332 | if (st.tag == CLASS || st.tag == TYPEVAR || st.tag == ERROR) { |
duke@1 | 1333 | Type x = asSuper(st, sym); |
duke@1 | 1334 | if (x != null) |
duke@1 | 1335 | return x; |
duke@1 | 1336 | } |
duke@1 | 1337 | if ((sym.flags() & INTERFACE) != 0) { |
duke@1 | 1338 | for (List<Type> l = interfaces(t); l.nonEmpty(); l = l.tail) { |
duke@1 | 1339 | Type x = asSuper(l.head, sym); |
duke@1 | 1340 | if (x != null) |
duke@1 | 1341 | return x; |
duke@1 | 1342 | } |
duke@1 | 1343 | } |
duke@1 | 1344 | return null; |
duke@1 | 1345 | } |
duke@1 | 1346 | |
duke@1 | 1347 | @Override |
duke@1 | 1348 | public Type visitArrayType(ArrayType t, Symbol sym) { |
duke@1 | 1349 | return isSubtype(t, sym.type) ? sym.type : null; |
duke@1 | 1350 | } |
duke@1 | 1351 | |
duke@1 | 1352 | @Override |
duke@1 | 1353 | public Type visitTypeVar(TypeVar t, Symbol sym) { |
mcimadamore@19 | 1354 | if (t.tsym == sym) |
mcimadamore@19 | 1355 | return t; |
mcimadamore@19 | 1356 | else |
mcimadamore@19 | 1357 | return asSuper(t.bound, sym); |
duke@1 | 1358 | } |
duke@1 | 1359 | |
duke@1 | 1360 | @Override |
duke@1 | 1361 | public Type visitErrorType(ErrorType t, Symbol sym) { |
duke@1 | 1362 | return t; |
duke@1 | 1363 | } |
duke@1 | 1364 | }; |
duke@1 | 1365 | |
duke@1 | 1366 | /** |
duke@1 | 1367 | * Return the base type of t or any of its outer types that starts |
duke@1 | 1368 | * with the given symbol. If none exists, return null. |
duke@1 | 1369 | * |
duke@1 | 1370 | * @param t a type |
duke@1 | 1371 | * @param sym a symbol |
duke@1 | 1372 | */ |
duke@1 | 1373 | public Type asOuterSuper(Type t, Symbol sym) { |
duke@1 | 1374 | switch (t.tag) { |
duke@1 | 1375 | case CLASS: |
duke@1 | 1376 | do { |
duke@1 | 1377 | Type s = asSuper(t, sym); |
duke@1 | 1378 | if (s != null) return s; |
duke@1 | 1379 | t = t.getEnclosingType(); |
duke@1 | 1380 | } while (t.tag == CLASS); |
duke@1 | 1381 | return null; |
duke@1 | 1382 | case ARRAY: |
duke@1 | 1383 | return isSubtype(t, sym.type) ? sym.type : null; |
duke@1 | 1384 | case TYPEVAR: |
duke@1 | 1385 | return asSuper(t, sym); |
duke@1 | 1386 | case ERROR: |
duke@1 | 1387 | return t; |
duke@1 | 1388 | default: |
duke@1 | 1389 | return null; |
duke@1 | 1390 | } |
duke@1 | 1391 | } |
duke@1 | 1392 | |
duke@1 | 1393 | /** |
duke@1 | 1394 | * Return the base type of t or any of its enclosing types that |
duke@1 | 1395 | * starts with the given symbol. If none exists, return null. |
duke@1 | 1396 | * |
duke@1 | 1397 | * @param t a type |
duke@1 | 1398 | * @param sym a symbol |
duke@1 | 1399 | */ |
duke@1 | 1400 | public Type asEnclosingSuper(Type t, Symbol sym) { |
duke@1 | 1401 | switch (t.tag) { |
duke@1 | 1402 | case CLASS: |
duke@1 | 1403 | do { |
duke@1 | 1404 | Type s = asSuper(t, sym); |
duke@1 | 1405 | if (s != null) return s; |
duke@1 | 1406 | Type outer = t.getEnclosingType(); |
duke@1 | 1407 | t = (outer.tag == CLASS) ? outer : |
duke@1 | 1408 | (t.tsym.owner.enclClass() != null) ? t.tsym.owner.enclClass().type : |
duke@1 | 1409 | Type.noType; |
duke@1 | 1410 | } while (t.tag == CLASS); |
duke@1 | 1411 | return null; |
duke@1 | 1412 | case ARRAY: |
duke@1 | 1413 | return isSubtype(t, sym.type) ? sym.type : null; |
duke@1 | 1414 | case TYPEVAR: |
duke@1 | 1415 | return asSuper(t, sym); |
duke@1 | 1416 | case ERROR: |
duke@1 | 1417 | return t; |
duke@1 | 1418 | default: |
duke@1 | 1419 | return null; |
duke@1 | 1420 | } |
duke@1 | 1421 | } |
duke@1 | 1422 | // </editor-fold> |
duke@1 | 1423 | |
duke@1 | 1424 | // <editor-fold defaultstate="collapsed" desc="memberType"> |
duke@1 | 1425 | /** |
duke@1 | 1426 | * The type of given symbol, seen as a member of t. |
duke@1 | 1427 | * |
duke@1 | 1428 | * @param t a type |
duke@1 | 1429 | * @param sym a symbol |
duke@1 | 1430 | */ |
duke@1 | 1431 | public Type memberType(Type t, Symbol sym) { |
duke@1 | 1432 | return (sym.flags() & STATIC) != 0 |
duke@1 | 1433 | ? sym.type |
duke@1 | 1434 | : memberType.visit(t, sym); |
duke@1 | 1435 | } |
duke@1 | 1436 | // where |
duke@1 | 1437 | private SimpleVisitor<Type,Symbol> memberType = new SimpleVisitor<Type,Symbol>() { |
duke@1 | 1438 | |
duke@1 | 1439 | public Type visitType(Type t, Symbol sym) { |
duke@1 | 1440 | return sym.type; |
duke@1 | 1441 | } |
duke@1 | 1442 | |
duke@1 | 1443 | @Override |
duke@1 | 1444 | public Type visitWildcardType(WildcardType t, Symbol sym) { |
duke@1 | 1445 | return memberType(upperBound(t), sym); |
duke@1 | 1446 | } |
duke@1 | 1447 | |
duke@1 | 1448 | @Override |
duke@1 | 1449 | public Type visitClassType(ClassType t, Symbol sym) { |
duke@1 | 1450 | Symbol owner = sym.owner; |
duke@1 | 1451 | long flags = sym.flags(); |
duke@1 | 1452 | if (((flags & STATIC) == 0) && owner.type.isParameterized()) { |
duke@1 | 1453 | Type base = asOuterSuper(t, owner); |
mcimadamore@134 | 1454 | //if t is an intersection type T = CT & I1 & I2 ... & In |
mcimadamore@134 | 1455 | //its supertypes CT, I1, ... In might contain wildcards |
mcimadamore@134 | 1456 | //so we need to go through capture conversion |
mcimadamore@134 | 1457 | base = t.isCompound() ? capture(base) : base; |
duke@1 | 1458 | if (base != null) { |
duke@1 | 1459 | List<Type> ownerParams = owner.type.allparams(); |
duke@1 | 1460 | List<Type> baseParams = base.allparams(); |
duke@1 | 1461 | if (ownerParams.nonEmpty()) { |
duke@1 | 1462 | if (baseParams.isEmpty()) { |
duke@1 | 1463 | // then base is a raw type |
duke@1 | 1464 | return erasure(sym.type); |
duke@1 | 1465 | } else { |
duke@1 | 1466 | return subst(sym.type, ownerParams, baseParams); |
duke@1 | 1467 | } |
duke@1 | 1468 | } |
duke@1 | 1469 | } |
duke@1 | 1470 | } |
duke@1 | 1471 | return sym.type; |
duke@1 | 1472 | } |
duke@1 | 1473 | |
duke@1 | 1474 | @Override |
duke@1 | 1475 | public Type visitTypeVar(TypeVar t, Symbol sym) { |
duke@1 | 1476 | return memberType(t.bound, sym); |
duke@1 | 1477 | } |
duke@1 | 1478 | |
duke@1 | 1479 | @Override |
duke@1 | 1480 | public Type visitErrorType(ErrorType t, Symbol sym) { |
duke@1 | 1481 | return t; |
duke@1 | 1482 | } |
duke@1 | 1483 | }; |
duke@1 | 1484 | // </editor-fold> |
duke@1 | 1485 | |
duke@1 | 1486 | // <editor-fold defaultstate="collapsed" desc="isAssignable"> |
duke@1 | 1487 | public boolean isAssignable(Type t, Type s) { |
duke@1 | 1488 | return isAssignable(t, s, Warner.noWarnings); |
duke@1 | 1489 | } |
duke@1 | 1490 | |
duke@1 | 1491 | /** |
duke@1 | 1492 | * Is t assignable to s?<br> |
duke@1 | 1493 | * Equivalent to subtype except for constant values and raw |
duke@1 | 1494 | * types.<br> |
duke@1 | 1495 | * (not defined for Method and ForAll types) |
duke@1 | 1496 | */ |
duke@1 | 1497 | public boolean isAssignable(Type t, Type s, Warner warn) { |
duke@1 | 1498 | if (t.tag == ERROR) |
duke@1 | 1499 | return true; |
duke@1 | 1500 | if (t.tag <= INT && t.constValue() != null) { |
duke@1 | 1501 | int value = ((Number)t.constValue()).intValue(); |
duke@1 | 1502 | switch (s.tag) { |
duke@1 | 1503 | case BYTE: |
duke@1 | 1504 | if (Byte.MIN_VALUE <= value && value <= Byte.MAX_VALUE) |
duke@1 | 1505 | return true; |
duke@1 | 1506 | break; |
duke@1 | 1507 | case CHAR: |
duke@1 | 1508 | if (Character.MIN_VALUE <= value && value <= Character.MAX_VALUE) |
duke@1 | 1509 | return true; |
duke@1 | 1510 | break; |
duke@1 | 1511 | case SHORT: |
duke@1 | 1512 | if (Short.MIN_VALUE <= value && value <= Short.MAX_VALUE) |
duke@1 | 1513 | return true; |
duke@1 | 1514 | break; |
duke@1 | 1515 | case INT: |
duke@1 | 1516 | return true; |
duke@1 | 1517 | case CLASS: |
duke@1 | 1518 | switch (unboxedType(s).tag) { |
duke@1 | 1519 | case BYTE: |
duke@1 | 1520 | case CHAR: |
duke@1 | 1521 | case SHORT: |
duke@1 | 1522 | return isAssignable(t, unboxedType(s), warn); |
duke@1 | 1523 | } |
duke@1 | 1524 | break; |
duke@1 | 1525 | } |
duke@1 | 1526 | } |
duke@1 | 1527 | return isConvertible(t, s, warn); |
duke@1 | 1528 | } |
duke@1 | 1529 | // </editor-fold> |
duke@1 | 1530 | |
duke@1 | 1531 | // <editor-fold defaultstate="collapsed" desc="erasure"> |
duke@1 | 1532 | /** |
duke@1 | 1533 | * The erasure of t {@code |t|} -- the type that results when all |
duke@1 | 1534 | * type parameters in t are deleted. |
duke@1 | 1535 | */ |
duke@1 | 1536 | public Type erasure(Type t) { |
mcimadamore@30 | 1537 | return erasure(t, false); |
mcimadamore@30 | 1538 | } |
mcimadamore@30 | 1539 | //where |
mcimadamore@30 | 1540 | private Type erasure(Type t, boolean recurse) { |
duke@1 | 1541 | if (t.tag <= lastBaseTag) |
duke@1 | 1542 | return t; /* fast special case */ |
duke@1 | 1543 | else |
mcimadamore@30 | 1544 | return erasure.visit(t, recurse); |
duke@1 | 1545 | } |
duke@1 | 1546 | // where |
mcimadamore@30 | 1547 | private SimpleVisitor<Type, Boolean> erasure = new SimpleVisitor<Type, Boolean>() { |
mcimadamore@30 | 1548 | public Type visitType(Type t, Boolean recurse) { |
duke@1 | 1549 | if (t.tag <= lastBaseTag) |
duke@1 | 1550 | return t; /*fast special case*/ |
duke@1 | 1551 | else |
mcimadamore@30 | 1552 | return t.map(recurse ? erasureRecFun : erasureFun); |
duke@1 | 1553 | } |
duke@1 | 1554 | |
duke@1 | 1555 | @Override |
mcimadamore@30 | 1556 | public Type visitWildcardType(WildcardType t, Boolean recurse) { |
mcimadamore@30 | 1557 | return erasure(upperBound(t), recurse); |
duke@1 | 1558 | } |
duke@1 | 1559 | |
duke@1 | 1560 | @Override |
mcimadamore@30 | 1561 | public Type visitClassType(ClassType t, Boolean recurse) { |
mcimadamore@30 | 1562 | Type erased = t.tsym.erasure(Types.this); |
mcimadamore@30 | 1563 | if (recurse) { |
mcimadamore@30 | 1564 | erased = new ErasedClassType(erased.getEnclosingType(),erased.tsym); |
mcimadamore@30 | 1565 | } |
mcimadamore@30 | 1566 | return erased; |
duke@1 | 1567 | } |
duke@1 | 1568 | |
duke@1 | 1569 | @Override |
mcimadamore@30 | 1570 | public Type visitTypeVar(TypeVar t, Boolean recurse) { |
mcimadamore@30 | 1571 | return erasure(t.bound, recurse); |
duke@1 | 1572 | } |
duke@1 | 1573 | |
duke@1 | 1574 | @Override |
mcimadamore@30 | 1575 | public Type visitErrorType(ErrorType t, Boolean recurse) { |
duke@1 | 1576 | return t; |
duke@1 | 1577 | } |
duke@1 | 1578 | }; |
mcimadamore@30 | 1579 | |
duke@1 | 1580 | private Mapping erasureFun = new Mapping ("erasure") { |
duke@1 | 1581 | public Type apply(Type t) { return erasure(t); } |
duke@1 | 1582 | }; |
duke@1 | 1583 | |
mcimadamore@30 | 1584 | private Mapping erasureRecFun = new Mapping ("erasureRecursive") { |
mcimadamore@30 | 1585 | public Type apply(Type t) { return erasureRecursive(t); } |
mcimadamore@30 | 1586 | }; |
mcimadamore@30 | 1587 | |
duke@1 | 1588 | public List<Type> erasure(List<Type> ts) { |
duke@1 | 1589 | return Type.map(ts, erasureFun); |
duke@1 | 1590 | } |
mcimadamore@30 | 1591 | |
mcimadamore@30 | 1592 | public Type erasureRecursive(Type t) { |
mcimadamore@30 | 1593 | return erasure(t, true); |
mcimadamore@30 | 1594 | } |
mcimadamore@30 | 1595 | |
mcimadamore@30 | 1596 | public List<Type> erasureRecursive(List<Type> ts) { |
mcimadamore@30 | 1597 | return Type.map(ts, erasureRecFun); |
mcimadamore@30 | 1598 | } |
duke@1 | 1599 | // </editor-fold> |
duke@1 | 1600 | |
duke@1 | 1601 | // <editor-fold defaultstate="collapsed" desc="makeCompoundType"> |
duke@1 | 1602 | /** |
duke@1 | 1603 | * Make a compound type from non-empty list of types |
duke@1 | 1604 | * |
duke@1 | 1605 | * @param bounds the types from which the compound type is formed |
duke@1 | 1606 | * @param supertype is objectType if all bounds are interfaces, |
duke@1 | 1607 | * null otherwise. |
duke@1 | 1608 | */ |
duke@1 | 1609 | public Type makeCompoundType(List<Type> bounds, |
duke@1 | 1610 | Type supertype) { |
duke@1 | 1611 | ClassSymbol bc = |
duke@1 | 1612 | new ClassSymbol(ABSTRACT|PUBLIC|SYNTHETIC|COMPOUND|ACYCLIC, |
duke@1 | 1613 | Type.moreInfo |
duke@1 | 1614 | ? names.fromString(bounds.toString()) |
duke@1 | 1615 | : names.empty, |
duke@1 | 1616 | syms.noSymbol); |
duke@1 | 1617 | if (bounds.head.tag == TYPEVAR) |
duke@1 | 1618 | // error condition, recover |
mcimadamore@121 | 1619 | bc.erasure_field = syms.objectType; |
mcimadamore@121 | 1620 | else |
mcimadamore@121 | 1621 | bc.erasure_field = erasure(bounds.head); |
mcimadamore@121 | 1622 | bc.members_field = new Scope(bc); |
duke@1 | 1623 | ClassType bt = (ClassType)bc.type; |
duke@1 | 1624 | bt.allparams_field = List.nil(); |
duke@1 | 1625 | if (supertype != null) { |
duke@1 | 1626 | bt.supertype_field = supertype; |
duke@1 | 1627 | bt.interfaces_field = bounds; |
duke@1 | 1628 | } else { |
duke@1 | 1629 | bt.supertype_field = bounds.head; |
duke@1 | 1630 | bt.interfaces_field = bounds.tail; |
duke@1 | 1631 | } |
duke@1 | 1632 | assert bt.supertype_field.tsym.completer != null |
duke@1 | 1633 | || !bt.supertype_field.isInterface() |
duke@1 | 1634 | : bt.supertype_field; |
duke@1 | 1635 | return bt; |
duke@1 | 1636 | } |
duke@1 | 1637 | |
duke@1 | 1638 | /** |
duke@1 | 1639 | * Same as {@link #makeCompoundType(List,Type)}, except that the |
duke@1 | 1640 | * second parameter is computed directly. Note that this might |
duke@1 | 1641 | * cause a symbol completion. Hence, this version of |
duke@1 | 1642 | * makeCompoundType may not be called during a classfile read. |
duke@1 | 1643 | */ |
duke@1 | 1644 | public Type makeCompoundType(List<Type> bounds) { |
duke@1 | 1645 | Type supertype = (bounds.head.tsym.flags() & INTERFACE) != 0 ? |
duke@1 | 1646 | supertype(bounds.head) : null; |
duke@1 | 1647 | return makeCompoundType(bounds, supertype); |
duke@1 | 1648 | } |
duke@1 | 1649 | |
duke@1 | 1650 | /** |
duke@1 | 1651 | * A convenience wrapper for {@link #makeCompoundType(List)}; the |
duke@1 | 1652 | * arguments are converted to a list and passed to the other |
duke@1 | 1653 | * method. Note that this might cause a symbol completion. |
duke@1 | 1654 | * Hence, this version of makeCompoundType may not be called |
duke@1 | 1655 | * during a classfile read. |
duke@1 | 1656 | */ |
duke@1 | 1657 | public Type makeCompoundType(Type bound1, Type bound2) { |
duke@1 | 1658 | return makeCompoundType(List.of(bound1, bound2)); |
duke@1 | 1659 | } |
duke@1 | 1660 | // </editor-fold> |
duke@1 | 1661 | |
duke@1 | 1662 | // <editor-fold defaultstate="collapsed" desc="supertype"> |
duke@1 | 1663 | public Type supertype(Type t) { |
duke@1 | 1664 | return supertype.visit(t); |
duke@1 | 1665 | } |
duke@1 | 1666 | // where |
duke@1 | 1667 | private UnaryVisitor<Type> supertype = new UnaryVisitor<Type>() { |
duke@1 | 1668 | |
duke@1 | 1669 | public Type visitType(Type t, Void ignored) { |
duke@1 | 1670 | // A note on wildcards: there is no good way to |
duke@1 | 1671 | // determine a supertype for a super bounded wildcard. |
duke@1 | 1672 | return null; |
duke@1 | 1673 | } |
duke@1 | 1674 | |
duke@1 | 1675 | @Override |
duke@1 | 1676 | public Type visitClassType(ClassType t, Void ignored) { |
duke@1 | 1677 | if (t.supertype_field == null) { |
duke@1 | 1678 | Type supertype = ((ClassSymbol)t.tsym).getSuperclass(); |
duke@1 | 1679 | // An interface has no superclass; its supertype is Object. |
duke@1 | 1680 | if (t.isInterface()) |
duke@1 | 1681 | supertype = ((ClassType)t.tsym.type).supertype_field; |
duke@1 | 1682 | if (t.supertype_field == null) { |
duke@1 | 1683 | List<Type> actuals = classBound(t).allparams(); |
duke@1 | 1684 | List<Type> formals = t.tsym.type.allparams(); |
mcimadamore@30 | 1685 | if (t.hasErasedSupertypes()) { |
mcimadamore@30 | 1686 | t.supertype_field = erasureRecursive(supertype); |
mcimadamore@30 | 1687 | } else if (formals.nonEmpty()) { |
duke@1 | 1688 | t.supertype_field = subst(supertype, formals, actuals); |
duke@1 | 1689 | } |
mcimadamore@30 | 1690 | else { |
mcimadamore@30 | 1691 | t.supertype_field = supertype; |
mcimadamore@30 | 1692 | } |
duke@1 | 1693 | } |
duke@1 | 1694 | } |
duke@1 | 1695 | return t.supertype_field; |
duke@1 | 1696 | } |
duke@1 | 1697 | |
duke@1 | 1698 | /** |
duke@1 | 1699 | * The supertype is always a class type. If the type |
duke@1 | 1700 | * variable's bounds start with a class type, this is also |
duke@1 | 1701 | * the supertype. Otherwise, the supertype is |
duke@1 | 1702 | * java.lang.Object. |
duke@1 | 1703 | */ |
duke@1 | 1704 | @Override |
duke@1 | 1705 | public Type visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 1706 | if (t.bound.tag == TYPEVAR || |
duke@1 | 1707 | (!t.bound.isCompound() && !t.bound.isInterface())) { |
duke@1 | 1708 | return t.bound; |
duke@1 | 1709 | } else { |
duke@1 | 1710 | return supertype(t.bound); |
duke@1 | 1711 | } |
duke@1 | 1712 | } |
duke@1 | 1713 | |
duke@1 | 1714 | @Override |
duke@1 | 1715 | public Type visitArrayType(ArrayType t, Void ignored) { |
duke@1 | 1716 | if (t.elemtype.isPrimitive() || isSameType(t.elemtype, syms.objectType)) |
duke@1 | 1717 | return arraySuperType(); |
duke@1 | 1718 | else |
duke@1 | 1719 | return new ArrayType(supertype(t.elemtype), t.tsym); |
duke@1 | 1720 | } |
duke@1 | 1721 | |
duke@1 | 1722 | @Override |
duke@1 | 1723 | public Type visitErrorType(ErrorType t, Void ignored) { |
duke@1 | 1724 | return t; |
duke@1 | 1725 | } |
duke@1 | 1726 | }; |
duke@1 | 1727 | // </editor-fold> |
duke@1 | 1728 | |
duke@1 | 1729 | // <editor-fold defaultstate="collapsed" desc="interfaces"> |
duke@1 | 1730 | /** |
duke@1 | 1731 | * Return the interfaces implemented by this class. |
duke@1 | 1732 | */ |
duke@1 | 1733 | public List<Type> interfaces(Type t) { |
duke@1 | 1734 | return interfaces.visit(t); |
duke@1 | 1735 | } |
duke@1 | 1736 | // where |
duke@1 | 1737 | private UnaryVisitor<List<Type>> interfaces = new UnaryVisitor<List<Type>>() { |
duke@1 | 1738 | |
duke@1 | 1739 | public List<Type> visitType(Type t, Void ignored) { |
duke@1 | 1740 | return List.nil(); |
duke@1 | 1741 | } |
duke@1 | 1742 | |
duke@1 | 1743 | @Override |
duke@1 | 1744 | public List<Type> visitClassType(ClassType t, Void ignored) { |
duke@1 | 1745 | if (t.interfaces_field == null) { |
duke@1 | 1746 | List<Type> interfaces = ((ClassSymbol)t.tsym).getInterfaces(); |
duke@1 | 1747 | if (t.interfaces_field == null) { |
duke@1 | 1748 | // If t.interfaces_field is null, then t must |
duke@1 | 1749 | // be a parameterized type (not to be confused |
duke@1 | 1750 | // with a generic type declaration). |
duke@1 | 1751 | // Terminology: |
duke@1 | 1752 | // Parameterized type: List<String> |
duke@1 | 1753 | // Generic type declaration: class List<E> { ... } |
duke@1 | 1754 | // So t corresponds to List<String> and |
duke@1 | 1755 | // t.tsym.type corresponds to List<E>. |
duke@1 | 1756 | // The reason t must be parameterized type is |
duke@1 | 1757 | // that completion will happen as a side |
duke@1 | 1758 | // effect of calling |
duke@1 | 1759 | // ClassSymbol.getInterfaces. Since |
duke@1 | 1760 | // t.interfaces_field is null after |
duke@1 | 1761 | // completion, we can assume that t is not the |
duke@1 | 1762 | // type of a class/interface declaration. |
duke@1 | 1763 | assert t != t.tsym.type : t.toString(); |
duke@1 | 1764 | List<Type> actuals = t.allparams(); |
duke@1 | 1765 | List<Type> formals = t.tsym.type.allparams(); |
mcimadamore@30 | 1766 | if (t.hasErasedSupertypes()) { |
mcimadamore@30 | 1767 | t.interfaces_field = erasureRecursive(interfaces); |
mcimadamore@30 | 1768 | } else if (formals.nonEmpty()) { |
duke@1 | 1769 | t.interfaces_field = |
duke@1 | 1770 | upperBounds(subst(interfaces, formals, actuals)); |
duke@1 | 1771 | } |
mcimadamore@30 | 1772 | else { |
mcimadamore@30 | 1773 | t.interfaces_field = interfaces; |
mcimadamore@30 | 1774 | } |
duke@1 | 1775 | } |
duke@1 | 1776 | } |
duke@1 | 1777 | return t.interfaces_field; |
duke@1 | 1778 | } |
duke@1 | 1779 | |
duke@1 | 1780 | @Override |
duke@1 | 1781 | public List<Type> visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 1782 | if (t.bound.isCompound()) |
duke@1 | 1783 | return interfaces(t.bound); |
duke@1 | 1784 | |
duke@1 | 1785 | if (t.bound.isInterface()) |
duke@1 | 1786 | return List.of(t.bound); |
duke@1 | 1787 | |
duke@1 | 1788 | return List.nil(); |
duke@1 | 1789 | } |
duke@1 | 1790 | }; |
duke@1 | 1791 | // </editor-fold> |
duke@1 | 1792 | |
duke@1 | 1793 | // <editor-fold defaultstate="collapsed" desc="isDerivedRaw"> |
duke@1 | 1794 | Map<Type,Boolean> isDerivedRawCache = new HashMap<Type,Boolean>(); |
duke@1 | 1795 | |
duke@1 | 1796 | public boolean isDerivedRaw(Type t) { |
duke@1 | 1797 | Boolean result = isDerivedRawCache.get(t); |
duke@1 | 1798 | if (result == null) { |
duke@1 | 1799 | result = isDerivedRawInternal(t); |
duke@1 | 1800 | isDerivedRawCache.put(t, result); |
duke@1 | 1801 | } |
duke@1 | 1802 | return result; |
duke@1 | 1803 | } |
duke@1 | 1804 | |
duke@1 | 1805 | public boolean isDerivedRawInternal(Type t) { |
duke@1 | 1806 | if (t.isErroneous()) |
duke@1 | 1807 | return false; |
duke@1 | 1808 | return |
duke@1 | 1809 | t.isRaw() || |
duke@1 | 1810 | supertype(t) != null && isDerivedRaw(supertype(t)) || |
duke@1 | 1811 | isDerivedRaw(interfaces(t)); |
duke@1 | 1812 | } |
duke@1 | 1813 | |
duke@1 | 1814 | public boolean isDerivedRaw(List<Type> ts) { |
duke@1 | 1815 | List<Type> l = ts; |
duke@1 | 1816 | while (l.nonEmpty() && !isDerivedRaw(l.head)) l = l.tail; |
duke@1 | 1817 | return l.nonEmpty(); |
duke@1 | 1818 | } |
duke@1 | 1819 | // </editor-fold> |
duke@1 | 1820 | |
duke@1 | 1821 | // <editor-fold defaultstate="collapsed" desc="setBounds"> |
duke@1 | 1822 | /** |
duke@1 | 1823 | * Set the bounds field of the given type variable to reflect a |
duke@1 | 1824 | * (possibly multiple) list of bounds. |
duke@1 | 1825 | * @param t a type variable |
duke@1 | 1826 | * @param bounds the bounds, must be nonempty |
duke@1 | 1827 | * @param supertype is objectType if all bounds are interfaces, |
duke@1 | 1828 | * null otherwise. |
duke@1 | 1829 | */ |
duke@1 | 1830 | public void setBounds(TypeVar t, List<Type> bounds, Type supertype) { |
duke@1 | 1831 | if (bounds.tail.isEmpty()) |
duke@1 | 1832 | t.bound = bounds.head; |
duke@1 | 1833 | else |
duke@1 | 1834 | t.bound = makeCompoundType(bounds, supertype); |
duke@1 | 1835 | t.rank_field = -1; |
duke@1 | 1836 | } |
duke@1 | 1837 | |
duke@1 | 1838 | /** |
duke@1 | 1839 | * Same as {@link #setBounds(Type.TypeVar,List,Type)}, except that |
duke@1 | 1840 | * third parameter is computed directly. Note that this test |
duke@1 | 1841 | * might cause a symbol completion. Hence, this version of |
duke@1 | 1842 | * setBounds may not be called during a classfile read. |
duke@1 | 1843 | */ |
duke@1 | 1844 | public void setBounds(TypeVar t, List<Type> bounds) { |
duke@1 | 1845 | Type supertype = (bounds.head.tsym.flags() & INTERFACE) != 0 ? |
duke@1 | 1846 | supertype(bounds.head) : null; |
duke@1 | 1847 | setBounds(t, bounds, supertype); |
duke@1 | 1848 | t.rank_field = -1; |
duke@1 | 1849 | } |
duke@1 | 1850 | // </editor-fold> |
duke@1 | 1851 | |
duke@1 | 1852 | // <editor-fold defaultstate="collapsed" desc="getBounds"> |
duke@1 | 1853 | /** |
duke@1 | 1854 | * Return list of bounds of the given type variable. |
duke@1 | 1855 | */ |
duke@1 | 1856 | public List<Type> getBounds(TypeVar t) { |
duke@1 | 1857 | if (t.bound.isErroneous() || !t.bound.isCompound()) |
duke@1 | 1858 | return List.of(t.bound); |
duke@1 | 1859 | else if ((erasure(t).tsym.flags() & INTERFACE) == 0) |
duke@1 | 1860 | return interfaces(t).prepend(supertype(t)); |
duke@1 | 1861 | else |
duke@1 | 1862 | // No superclass was given in bounds. |
duke@1 | 1863 | // In this case, supertype is Object, erasure is first interface. |
duke@1 | 1864 | return interfaces(t); |
duke@1 | 1865 | } |
duke@1 | 1866 | // </editor-fold> |
duke@1 | 1867 | |
duke@1 | 1868 | // <editor-fold defaultstate="collapsed" desc="classBound"> |
duke@1 | 1869 | /** |
duke@1 | 1870 | * If the given type is a (possibly selected) type variable, |
duke@1 | 1871 | * return the bounding class of this type, otherwise return the |
duke@1 | 1872 | * type itself. |
duke@1 | 1873 | */ |
duke@1 | 1874 | public Type classBound(Type t) { |
duke@1 | 1875 | return classBound.visit(t); |
duke@1 | 1876 | } |
duke@1 | 1877 | // where |
duke@1 | 1878 | private UnaryVisitor<Type> classBound = new UnaryVisitor<Type>() { |
duke@1 | 1879 | |
duke@1 | 1880 | public Type visitType(Type t, Void ignored) { |
duke@1 | 1881 | return t; |
duke@1 | 1882 | } |
duke@1 | 1883 | |
duke@1 | 1884 | @Override |
duke@1 | 1885 | public Type visitClassType(ClassType t, Void ignored) { |
duke@1 | 1886 | Type outer1 = classBound(t.getEnclosingType()); |
duke@1 | 1887 | if (outer1 != t.getEnclosingType()) |
duke@1 | 1888 | return new ClassType(outer1, t.getTypeArguments(), t.tsym); |
duke@1 | 1889 | else |
duke@1 | 1890 | return t; |
duke@1 | 1891 | } |
duke@1 | 1892 | |
duke@1 | 1893 | @Override |
duke@1 | 1894 | public Type visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 1895 | return classBound(supertype(t)); |
duke@1 | 1896 | } |
duke@1 | 1897 | |
duke@1 | 1898 | @Override |
duke@1 | 1899 | public Type visitErrorType(ErrorType t, Void ignored) { |
duke@1 | 1900 | return t; |
duke@1 | 1901 | } |
duke@1 | 1902 | }; |
duke@1 | 1903 | // </editor-fold> |
duke@1 | 1904 | |
duke@1 | 1905 | // <editor-fold defaultstate="collapsed" desc="sub signature / override equivalence"> |
duke@1 | 1906 | /** |
duke@1 | 1907 | * Returns true iff the first signature is a <em>sub |
duke@1 | 1908 | * signature</em> of the other. This is <b>not</b> an equivalence |
duke@1 | 1909 | * relation. |
duke@1 | 1910 | * |
duke@1 | 1911 | * @see "The Java Language Specification, Third Ed. (8.4.2)." |
duke@1 | 1912 | * @see #overrideEquivalent(Type t, Type s) |
duke@1 | 1913 | * @param t first signature (possibly raw). |
duke@1 | 1914 | * @param s second signature (could be subjected to erasure). |
duke@1 | 1915 | * @return true if t is a sub signature of s. |
duke@1 | 1916 | */ |
duke@1 | 1917 | public boolean isSubSignature(Type t, Type s) { |
duke@1 | 1918 | return hasSameArgs(t, s) || hasSameArgs(t, erasure(s)); |
duke@1 | 1919 | } |
duke@1 | 1920 | |
duke@1 | 1921 | /** |
duke@1 | 1922 | * Returns true iff these signatures are related by <em>override |
duke@1 | 1923 | * equivalence</em>. This is the natural extension of |
duke@1 | 1924 | * isSubSignature to an equivalence relation. |
duke@1 | 1925 | * |
duke@1 | 1926 | * @see "The Java Language Specification, Third Ed. (8.4.2)." |
duke@1 | 1927 | * @see #isSubSignature(Type t, Type s) |
duke@1 | 1928 | * @param t a signature (possible raw, could be subjected to |
duke@1 | 1929 | * erasure). |
duke@1 | 1930 | * @param s a signature (possible raw, could be subjected to |
duke@1 | 1931 | * erasure). |
duke@1 | 1932 | * @return true if either argument is a sub signature of the other. |
duke@1 | 1933 | */ |
duke@1 | 1934 | public boolean overrideEquivalent(Type t, Type s) { |
duke@1 | 1935 | return hasSameArgs(t, s) || |
duke@1 | 1936 | hasSameArgs(t, erasure(s)) || hasSameArgs(erasure(t), s); |
duke@1 | 1937 | } |
duke@1 | 1938 | |
duke@1 | 1939 | /** |
duke@1 | 1940 | * Does t have the same arguments as s? It is assumed that both |
duke@1 | 1941 | * types are (possibly polymorphic) method types. Monomorphic |
duke@1 | 1942 | * method types "have the same arguments", if their argument lists |
duke@1 | 1943 | * are equal. Polymorphic method types "have the same arguments", |
duke@1 | 1944 | * if they have the same arguments after renaming all type |
duke@1 | 1945 | * variables of one to corresponding type variables in the other, |
duke@1 | 1946 | * where correspondence is by position in the type parameter list. |
duke@1 | 1947 | */ |
duke@1 | 1948 | public boolean hasSameArgs(Type t, Type s) { |
duke@1 | 1949 | return hasSameArgs.visit(t, s); |
duke@1 | 1950 | } |
duke@1 | 1951 | // where |
duke@1 | 1952 | private TypeRelation hasSameArgs = new TypeRelation() { |
duke@1 | 1953 | |
duke@1 | 1954 | public Boolean visitType(Type t, Type s) { |
duke@1 | 1955 | throw new AssertionError(); |
duke@1 | 1956 | } |
duke@1 | 1957 | |
duke@1 | 1958 | @Override |
duke@1 | 1959 | public Boolean visitMethodType(MethodType t, Type s) { |
duke@1 | 1960 | return s.tag == METHOD |
duke@1 | 1961 | && containsTypeEquivalent(t.argtypes, s.getParameterTypes()); |
duke@1 | 1962 | } |
duke@1 | 1963 | |
duke@1 | 1964 | @Override |
duke@1 | 1965 | public Boolean visitForAll(ForAll t, Type s) { |
duke@1 | 1966 | if (s.tag != FORALL) |
duke@1 | 1967 | return false; |
duke@1 | 1968 | |
duke@1 | 1969 | ForAll forAll = (ForAll)s; |
duke@1 | 1970 | return hasSameBounds(t, forAll) |
duke@1 | 1971 | && visit(t.qtype, subst(forAll.qtype, forAll.tvars, t.tvars)); |
duke@1 | 1972 | } |
duke@1 | 1973 | |
duke@1 | 1974 | @Override |
duke@1 | 1975 | public Boolean visitErrorType(ErrorType t, Type s) { |
duke@1 | 1976 | return false; |
duke@1 | 1977 | } |
duke@1 | 1978 | }; |
duke@1 | 1979 | // </editor-fold> |
duke@1 | 1980 | |
duke@1 | 1981 | // <editor-fold defaultstate="collapsed" desc="subst"> |
duke@1 | 1982 | public List<Type> subst(List<Type> ts, |
duke@1 | 1983 | List<Type> from, |
duke@1 | 1984 | List<Type> to) { |
duke@1 | 1985 | return new Subst(from, to).subst(ts); |
duke@1 | 1986 | } |
duke@1 | 1987 | |
duke@1 | 1988 | /** |
duke@1 | 1989 | * Substitute all occurrences of a type in `from' with the |
duke@1 | 1990 | * corresponding type in `to' in 't'. Match lists `from' and `to' |
duke@1 | 1991 | * from the right: If lists have different length, discard leading |
duke@1 | 1992 | * elements of the longer list. |
duke@1 | 1993 | */ |
duke@1 | 1994 | public Type subst(Type t, List<Type> from, List<Type> to) { |
duke@1 | 1995 | return new Subst(from, to).subst(t); |
duke@1 | 1996 | } |
duke@1 | 1997 | |
duke@1 | 1998 | private class Subst extends UnaryVisitor<Type> { |
duke@1 | 1999 | List<Type> from; |
duke@1 | 2000 | List<Type> to; |
duke@1 | 2001 | |
duke@1 | 2002 | public Subst(List<Type> from, List<Type> to) { |
duke@1 | 2003 | int fromLength = from.length(); |
duke@1 | 2004 | int toLength = to.length(); |
duke@1 | 2005 | while (fromLength > toLength) { |
duke@1 | 2006 | fromLength--; |
duke@1 | 2007 | from = from.tail; |
duke@1 | 2008 | } |
duke@1 | 2009 | while (fromLength < toLength) { |
duke@1 | 2010 | toLength--; |
duke@1 | 2011 | to = to.tail; |
duke@1 | 2012 | } |
duke@1 | 2013 | this.from = from; |
duke@1 | 2014 | this.to = to; |
duke@1 | 2015 | } |
duke@1 | 2016 | |
duke@1 | 2017 | Type subst(Type t) { |
duke@1 | 2018 | if (from.tail == null) |
duke@1 | 2019 | return t; |
duke@1 | 2020 | else |
duke@1 | 2021 | return visit(t); |
duke@1 | 2022 | } |
duke@1 | 2023 | |
duke@1 | 2024 | List<Type> subst(List<Type> ts) { |
duke@1 | 2025 | if (from.tail == null) |
duke@1 | 2026 | return ts; |
duke@1 | 2027 | boolean wild = false; |
duke@1 | 2028 | if (ts.nonEmpty() && from.nonEmpty()) { |
duke@1 | 2029 | Type head1 = subst(ts.head); |
duke@1 | 2030 | List<Type> tail1 = subst(ts.tail); |
duke@1 | 2031 | if (head1 != ts.head || tail1 != ts.tail) |
duke@1 | 2032 | return tail1.prepend(head1); |
duke@1 | 2033 | } |
duke@1 | 2034 | return ts; |
duke@1 | 2035 | } |
duke@1 | 2036 | |
duke@1 | 2037 | public Type visitType(Type t, Void ignored) { |
duke@1 | 2038 | return t; |
duke@1 | 2039 | } |
duke@1 | 2040 | |
duke@1 | 2041 | @Override |
duke@1 | 2042 | public Type visitMethodType(MethodType t, Void ignored) { |
duke@1 | 2043 | List<Type> argtypes = subst(t.argtypes); |
duke@1 | 2044 | Type restype = subst(t.restype); |
duke@1 | 2045 | List<Type> thrown = subst(t.thrown); |
duke@1 | 2046 | if (argtypes == t.argtypes && |
duke@1 | 2047 | restype == t.restype && |
duke@1 | 2048 | thrown == t.thrown) |
duke@1 | 2049 | return t; |
duke@1 | 2050 | else |
duke@1 | 2051 | return new MethodType(argtypes, restype, thrown, t.tsym); |
duke@1 | 2052 | } |
duke@1 | 2053 | |
duke@1 | 2054 | @Override |
duke@1 | 2055 | public Type visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 2056 | for (List<Type> from = this.from, to = this.to; |
duke@1 | 2057 | from.nonEmpty(); |
duke@1 | 2058 | from = from.tail, to = to.tail) { |
duke@1 | 2059 | if (t == from.head) { |
duke@1 | 2060 | return to.head.withTypeVar(t); |
duke@1 | 2061 | } |
duke@1 | 2062 | } |
duke@1 | 2063 | return t; |
duke@1 | 2064 | } |
duke@1 | 2065 | |
duke@1 | 2066 | @Override |
duke@1 | 2067 | public Type visitClassType(ClassType t, Void ignored) { |
duke@1 | 2068 | if (!t.isCompound()) { |
duke@1 | 2069 | List<Type> typarams = t.getTypeArguments(); |
duke@1 | 2070 | List<Type> typarams1 = subst(typarams); |
duke@1 | 2071 | Type outer = t.getEnclosingType(); |
duke@1 | 2072 | Type outer1 = subst(outer); |
duke@1 | 2073 | if (typarams1 == typarams && outer1 == outer) |
duke@1 | 2074 | return t; |
duke@1 | 2075 | else |
duke@1 | 2076 | return new ClassType(outer1, typarams1, t.tsym); |
duke@1 | 2077 | } else { |
duke@1 | 2078 | Type st = subst(supertype(t)); |
duke@1 | 2079 | List<Type> is = upperBounds(subst(interfaces(t))); |
duke@1 | 2080 | if (st == supertype(t) && is == interfaces(t)) |
duke@1 | 2081 | return t; |
duke@1 | 2082 | else |
duke@1 | 2083 | return makeCompoundType(is.prepend(st)); |
duke@1 | 2084 | } |
duke@1 | 2085 | } |
duke@1 | 2086 | |
duke@1 | 2087 | @Override |
duke@1 | 2088 | public Type visitWildcardType(WildcardType t, Void ignored) { |
duke@1 | 2089 | Type bound = t.type; |
duke@1 | 2090 | if (t.kind != BoundKind.UNBOUND) |
duke@1 | 2091 | bound = subst(bound); |
duke@1 | 2092 | if (bound == t.type) { |
duke@1 | 2093 | return t; |
duke@1 | 2094 | } else { |
duke@1 | 2095 | if (t.isExtendsBound() && bound.isExtendsBound()) |
duke@1 | 2096 | bound = upperBound(bound); |
duke@1 | 2097 | return new WildcardType(bound, t.kind, syms.boundClass, t.bound); |
duke@1 | 2098 | } |
duke@1 | 2099 | } |
duke@1 | 2100 | |
duke@1 | 2101 | @Override |
duke@1 | 2102 | public Type visitArrayType(ArrayType t, Void ignored) { |
duke@1 | 2103 | Type elemtype = subst(t.elemtype); |
duke@1 | 2104 | if (elemtype == t.elemtype) |
duke@1 | 2105 | return t; |
duke@1 | 2106 | else |
duke@1 | 2107 | return new ArrayType(upperBound(elemtype), t.tsym); |
duke@1 | 2108 | } |
duke@1 | 2109 | |
duke@1 | 2110 | @Override |
duke@1 | 2111 | public Type visitForAll(ForAll t, Void ignored) { |
duke@1 | 2112 | List<Type> tvars1 = substBounds(t.tvars, from, to); |
duke@1 | 2113 | Type qtype1 = subst(t.qtype); |
duke@1 | 2114 | if (tvars1 == t.tvars && qtype1 == t.qtype) { |
duke@1 | 2115 | return t; |
duke@1 | 2116 | } else if (tvars1 == t.tvars) { |
duke@1 | 2117 | return new ForAll(tvars1, qtype1); |
duke@1 | 2118 | } else { |
duke@1 | 2119 | return new ForAll(tvars1, Types.this.subst(qtype1, t.tvars, tvars1)); |
duke@1 | 2120 | } |
duke@1 | 2121 | } |
duke@1 | 2122 | |
duke@1 | 2123 | @Override |
duke@1 | 2124 | public Type visitErrorType(ErrorType t, Void ignored) { |
duke@1 | 2125 | return t; |
duke@1 | 2126 | } |
duke@1 | 2127 | } |
duke@1 | 2128 | |
duke@1 | 2129 | public List<Type> substBounds(List<Type> tvars, |
duke@1 | 2130 | List<Type> from, |
duke@1 | 2131 | List<Type> to) { |
duke@1 | 2132 | if (tvars.isEmpty()) |
duke@1 | 2133 | return tvars; |
duke@1 | 2134 | ListBuffer<Type> newBoundsBuf = lb(); |
duke@1 | 2135 | boolean changed = false; |
duke@1 | 2136 | // calculate new bounds |
duke@1 | 2137 | for (Type t : tvars) { |
duke@1 | 2138 | TypeVar tv = (TypeVar) t; |
duke@1 | 2139 | Type bound = subst(tv.bound, from, to); |
duke@1 | 2140 | if (bound != tv.bound) |
duke@1 | 2141 | changed = true; |
duke@1 | 2142 | newBoundsBuf.append(bound); |
duke@1 | 2143 | } |
duke@1 | 2144 | if (!changed) |
duke@1 | 2145 | return tvars; |
duke@1 | 2146 | ListBuffer<Type> newTvars = lb(); |
duke@1 | 2147 | // create new type variables without bounds |
duke@1 | 2148 | for (Type t : tvars) { |
duke@1 | 2149 | newTvars.append(new TypeVar(t.tsym, null, syms.botType)); |
duke@1 | 2150 | } |
duke@1 | 2151 | // the new bounds should use the new type variables in place |
duke@1 | 2152 | // of the old |
duke@1 | 2153 | List<Type> newBounds = newBoundsBuf.toList(); |
duke@1 | 2154 | from = tvars; |
duke@1 | 2155 | to = newTvars.toList(); |
duke@1 | 2156 | for (; !newBounds.isEmpty(); newBounds = newBounds.tail) { |
duke@1 | 2157 | newBounds.head = subst(newBounds.head, from, to); |
duke@1 | 2158 | } |
duke@1 | 2159 | newBounds = newBoundsBuf.toList(); |
duke@1 | 2160 | // set the bounds of new type variables to the new bounds |
duke@1 | 2161 | for (Type t : newTvars.toList()) { |
duke@1 | 2162 | TypeVar tv = (TypeVar) t; |
duke@1 | 2163 | tv.bound = newBounds.head; |
duke@1 | 2164 | newBounds = newBounds.tail; |
duke@1 | 2165 | } |
duke@1 | 2166 | return newTvars.toList(); |
duke@1 | 2167 | } |
duke@1 | 2168 | |
duke@1 | 2169 | public TypeVar substBound(TypeVar t, List<Type> from, List<Type> to) { |
duke@1 | 2170 | Type bound1 = subst(t.bound, from, to); |
duke@1 | 2171 | if (bound1 == t.bound) |
duke@1 | 2172 | return t; |
mcimadamore@212 | 2173 | else { |
mcimadamore@212 | 2174 | // create new type variable without bounds |
mcimadamore@212 | 2175 | TypeVar tv = new TypeVar(t.tsym, null, syms.botType); |
mcimadamore@212 | 2176 | // the new bound should use the new type variable in place |
mcimadamore@212 | 2177 | // of the old |
mcimadamore@212 | 2178 | tv.bound = subst(bound1, List.<Type>of(t), List.<Type>of(tv)); |
mcimadamore@212 | 2179 | return tv; |
mcimadamore@212 | 2180 | } |
duke@1 | 2181 | } |
duke@1 | 2182 | // </editor-fold> |
duke@1 | 2183 | |
duke@1 | 2184 | // <editor-fold defaultstate="collapsed" desc="hasSameBounds"> |
duke@1 | 2185 | /** |
duke@1 | 2186 | * Does t have the same bounds for quantified variables as s? |
duke@1 | 2187 | */ |
duke@1 | 2188 | boolean hasSameBounds(ForAll t, ForAll s) { |
duke@1 | 2189 | List<Type> l1 = t.tvars; |
duke@1 | 2190 | List<Type> l2 = s.tvars; |
duke@1 | 2191 | while (l1.nonEmpty() && l2.nonEmpty() && |
duke@1 | 2192 | isSameType(l1.head.getUpperBound(), |
duke@1 | 2193 | subst(l2.head.getUpperBound(), |
duke@1 | 2194 | s.tvars, |
duke@1 | 2195 | t.tvars))) { |
duke@1 | 2196 | l1 = l1.tail; |
duke@1 | 2197 | l2 = l2.tail; |
duke@1 | 2198 | } |
duke@1 | 2199 | return l1.isEmpty() && l2.isEmpty(); |
duke@1 | 2200 | } |
duke@1 | 2201 | // </editor-fold> |
duke@1 | 2202 | |
duke@1 | 2203 | // <editor-fold defaultstate="collapsed" desc="newInstances"> |
duke@1 | 2204 | /** Create new vector of type variables from list of variables |
duke@1 | 2205 | * changing all recursive bounds from old to new list. |
duke@1 | 2206 | */ |
duke@1 | 2207 | public List<Type> newInstances(List<Type> tvars) { |
duke@1 | 2208 | List<Type> tvars1 = Type.map(tvars, newInstanceFun); |
duke@1 | 2209 | for (List<Type> l = tvars1; l.nonEmpty(); l = l.tail) { |
duke@1 | 2210 | TypeVar tv = (TypeVar) l.head; |
duke@1 | 2211 | tv.bound = subst(tv.bound, tvars, tvars1); |
duke@1 | 2212 | } |
duke@1 | 2213 | return tvars1; |
duke@1 | 2214 | } |
duke@1 | 2215 | static private Mapping newInstanceFun = new Mapping("newInstanceFun") { |
duke@1 | 2216 | public Type apply(Type t) { return new TypeVar(t.tsym, t.getUpperBound(), t.getLowerBound()); } |
duke@1 | 2217 | }; |
duke@1 | 2218 | // </editor-fold> |
duke@1 | 2219 | |
jjg@110 | 2220 | // <editor-fold defaultstate="collapsed" desc="createErrorType"> |
jjg@110 | 2221 | public Type createErrorType(Type originalType) { |
jjg@110 | 2222 | return new ErrorType(originalType, syms.errSymbol); |
jjg@110 | 2223 | } |
jjg@110 | 2224 | |
jjg@110 | 2225 | public Type createErrorType(ClassSymbol c, Type originalType) { |
jjg@110 | 2226 | return new ErrorType(c, originalType); |
jjg@110 | 2227 | } |
jjg@110 | 2228 | |
jjg@110 | 2229 | public Type createErrorType(Name name, TypeSymbol container, Type originalType) { |
jjg@110 | 2230 | return new ErrorType(name, container, originalType); |
jjg@110 | 2231 | } |
jjg@110 | 2232 | // </editor-fold> |
jjg@110 | 2233 | |
duke@1 | 2234 | // <editor-fold defaultstate="collapsed" desc="rank"> |
duke@1 | 2235 | /** |
duke@1 | 2236 | * The rank of a class is the length of the longest path between |
duke@1 | 2237 | * the class and java.lang.Object in the class inheritance |
duke@1 | 2238 | * graph. Undefined for all but reference types. |
duke@1 | 2239 | */ |
duke@1 | 2240 | public int rank(Type t) { |
duke@1 | 2241 | switch(t.tag) { |
duke@1 | 2242 | case CLASS: { |
duke@1 | 2243 | ClassType cls = (ClassType)t; |
duke@1 | 2244 | if (cls.rank_field < 0) { |
duke@1 | 2245 | Name fullname = cls.tsym.getQualifiedName(); |
jjg@113 | 2246 | if (fullname == names.java_lang_Object) |
duke@1 | 2247 | cls.rank_field = 0; |
duke@1 | 2248 | else { |
duke@1 | 2249 | int r = rank(supertype(cls)); |
duke@1 | 2250 | for (List<Type> l = interfaces(cls); |
duke@1 | 2251 | l.nonEmpty(); |
duke@1 | 2252 | l = l.tail) { |
duke@1 | 2253 | if (rank(l.head) > r) |
duke@1 | 2254 | r = rank(l.head); |
duke@1 | 2255 | } |
duke@1 | 2256 | cls.rank_field = r + 1; |
duke@1 | 2257 | } |
duke@1 | 2258 | } |
duke@1 | 2259 | return cls.rank_field; |
duke@1 | 2260 | } |
duke@1 | 2261 | case TYPEVAR: { |
duke@1 | 2262 | TypeVar tvar = (TypeVar)t; |
duke@1 | 2263 | if (tvar.rank_field < 0) { |
duke@1 | 2264 | int r = rank(supertype(tvar)); |
duke@1 | 2265 | for (List<Type> l = interfaces(tvar); |
duke@1 | 2266 | l.nonEmpty(); |
duke@1 | 2267 | l = l.tail) { |
duke@1 | 2268 | if (rank(l.head) > r) r = rank(l.head); |
duke@1 | 2269 | } |
duke@1 | 2270 | tvar.rank_field = r + 1; |
duke@1 | 2271 | } |
duke@1 | 2272 | return tvar.rank_field; |
duke@1 | 2273 | } |
duke@1 | 2274 | case ERROR: |
duke@1 | 2275 | return 0; |
duke@1 | 2276 | default: |
duke@1 | 2277 | throw new AssertionError(); |
duke@1 | 2278 | } |
duke@1 | 2279 | } |
duke@1 | 2280 | // </editor-fold> |
duke@1 | 2281 | |
mcimadamore@121 | 2282 | // <editor-fold defaultstate="collapsed" desc="printType"> |
mcimadamore@121 | 2283 | /** |
mcimadamore@121 | 2284 | * Visitor for generating a string representation of a given type |
mcimadamore@121 | 2285 | * accordingly to a given locale |
mcimadamore@121 | 2286 | */ |
mcimadamore@121 | 2287 | public String toString(Type t, Locale locale) { |
mcimadamore@121 | 2288 | return typePrinter.visit(t, locale); |
mcimadamore@121 | 2289 | } |
mcimadamore@121 | 2290 | // where |
mcimadamore@121 | 2291 | private TypePrinter typePrinter = new TypePrinter(); |
mcimadamore@121 | 2292 | |
mcimadamore@121 | 2293 | public class TypePrinter extends DefaultTypeVisitor<String, Locale> { |
mcimadamore@121 | 2294 | |
mcimadamore@121 | 2295 | public String visit(List<Type> ts, Locale locale) { |
mcimadamore@121 | 2296 | ListBuffer<String> sbuf = lb(); |
mcimadamore@121 | 2297 | for (Type t : ts) { |
mcimadamore@121 | 2298 | sbuf.append(visit(t, locale)); |
mcimadamore@121 | 2299 | } |
mcimadamore@121 | 2300 | return sbuf.toList().toString(); |
mcimadamore@121 | 2301 | } |
mcimadamore@121 | 2302 | |
mcimadamore@121 | 2303 | @Override |
mcimadamore@121 | 2304 | public String visitCapturedType(CapturedType t, Locale locale) { |
mcimadamore@121 | 2305 | return messages.getLocalizedString("compiler.misc.type.captureof", |
mcimadamore@121 | 2306 | (t.hashCode() & 0xFFFFFFFFL) % Type.CapturedType.PRIME, |
mcimadamore@121 | 2307 | visit(t.wildcard, locale)); |
mcimadamore@121 | 2308 | } |
mcimadamore@121 | 2309 | |
mcimadamore@121 | 2310 | @Override |
mcimadamore@121 | 2311 | public String visitForAll(ForAll t, Locale locale) { |
mcimadamore@121 | 2312 | return "<" + visit(t.tvars, locale) + ">" + visit(t.qtype, locale); |
mcimadamore@121 | 2313 | } |
mcimadamore@121 | 2314 | |
mcimadamore@121 | 2315 | @Override |
mcimadamore@121 | 2316 | public String visitUndetVar(UndetVar t, Locale locale) { |
mcimadamore@121 | 2317 | if (t.inst != null) { |
mcimadamore@121 | 2318 | return visit(t.inst, locale); |
mcimadamore@121 | 2319 | } else { |
mcimadamore@121 | 2320 | return visit(t.qtype, locale) + "?"; |
mcimadamore@121 | 2321 | } |
mcimadamore@121 | 2322 | } |
mcimadamore@121 | 2323 | |
mcimadamore@121 | 2324 | @Override |
mcimadamore@121 | 2325 | public String visitArrayType(ArrayType t, Locale locale) { |
mcimadamore@121 | 2326 | return visit(t.elemtype, locale) + "[]"; |
mcimadamore@121 | 2327 | } |
mcimadamore@121 | 2328 | |
mcimadamore@121 | 2329 | @Override |
mcimadamore@121 | 2330 | public String visitClassType(ClassType t, Locale locale) { |
mcimadamore@121 | 2331 | StringBuffer buf = new StringBuffer(); |
mcimadamore@121 | 2332 | if (t.getEnclosingType().tag == CLASS && t.tsym.owner.kind == Kinds.TYP) { |
mcimadamore@121 | 2333 | buf.append(visit(t.getEnclosingType(), locale)); |
mcimadamore@121 | 2334 | buf.append("."); |
mcimadamore@121 | 2335 | buf.append(className(t, false, locale)); |
mcimadamore@121 | 2336 | } else { |
mcimadamore@121 | 2337 | buf.append(className(t, true, locale)); |
mcimadamore@121 | 2338 | } |
mcimadamore@121 | 2339 | if (t.getTypeArguments().nonEmpty()) { |
mcimadamore@121 | 2340 | buf.append('<'); |
mcimadamore@121 | 2341 | buf.append(visit(t.getTypeArguments(), locale)); |
mcimadamore@121 | 2342 | buf.append(">"); |
mcimadamore@121 | 2343 | } |
mcimadamore@121 | 2344 | return buf.toString(); |
mcimadamore@121 | 2345 | } |
mcimadamore@121 | 2346 | |
mcimadamore@121 | 2347 | @Override |
mcimadamore@121 | 2348 | public String visitMethodType(MethodType t, Locale locale) { |
mcimadamore@121 | 2349 | return "(" + printMethodArgs(t.argtypes, false, locale) + ")" + visit(t.restype, locale); |
mcimadamore@121 | 2350 | } |
mcimadamore@121 | 2351 | |
mcimadamore@121 | 2352 | @Override |
mcimadamore@121 | 2353 | public String visitPackageType(PackageType t, Locale locale) { |
mcimadamore@121 | 2354 | return t.tsym.getQualifiedName().toString(); |
mcimadamore@121 | 2355 | } |
mcimadamore@121 | 2356 | |
mcimadamore@121 | 2357 | @Override |
mcimadamore@121 | 2358 | public String visitWildcardType(WildcardType t, Locale locale) { |
mcimadamore@121 | 2359 | StringBuffer s = new StringBuffer(); |
mcimadamore@121 | 2360 | s.append(t.kind); |
mcimadamore@121 | 2361 | if (t.kind != UNBOUND) { |
mcimadamore@121 | 2362 | s.append(visit(t.type, locale)); |
mcimadamore@121 | 2363 | } |
mcimadamore@121 | 2364 | return s.toString(); |
mcimadamore@121 | 2365 | } |
mcimadamore@121 | 2366 | |
mcimadamore@121 | 2367 | |
mcimadamore@121 | 2368 | public String visitType(Type t, Locale locale) { |
mcimadamore@121 | 2369 | String s = (t.tsym == null || t.tsym.name == null) |
mcimadamore@121 | 2370 | ? messages.getLocalizedString("compiler.misc.type.none") |
mcimadamore@121 | 2371 | : t.tsym.name.toString(); |
mcimadamore@121 | 2372 | return s; |
mcimadamore@121 | 2373 | } |
mcimadamore@121 | 2374 | |
mcimadamore@121 | 2375 | protected String className(ClassType t, boolean longform, Locale locale) { |
mcimadamore@121 | 2376 | Symbol sym = t.tsym; |
mcimadamore@121 | 2377 | if (sym.name.length() == 0 && (sym.flags() & COMPOUND) != 0) { |
mcimadamore@121 | 2378 | StringBuffer s = new StringBuffer(visit(supertype(t), locale)); |
mcimadamore@121 | 2379 | for (List<Type> is = interfaces(t); is.nonEmpty(); is = is.tail) { |
mcimadamore@121 | 2380 | s.append("&"); |
mcimadamore@121 | 2381 | s.append(visit(is.head, locale)); |
mcimadamore@121 | 2382 | } |
mcimadamore@121 | 2383 | return s.toString(); |
mcimadamore@121 | 2384 | } else if (sym.name.length() == 0) { |
mcimadamore@121 | 2385 | String s; |
mcimadamore@121 | 2386 | ClassType norm = (ClassType) t.tsym.type; |
mcimadamore@121 | 2387 | if (norm == null) { |
mcimadamore@121 | 2388 | s = getLocalizedString(locale, "compiler.misc.anonymous.class", (Object) null); |
mcimadamore@121 | 2389 | } else if (interfaces(norm).nonEmpty()) { |
mcimadamore@121 | 2390 | s = getLocalizedString(locale, "compiler.misc.anonymous.class", |
mcimadamore@121 | 2391 | visit(interfaces(norm).head, locale)); |
mcimadamore@121 | 2392 | } else { |
mcimadamore@121 | 2393 | s = getLocalizedString(locale, "compiler.misc.anonymous.class", |
mcimadamore@121 | 2394 | visit(supertype(norm), locale)); |
mcimadamore@121 | 2395 | } |
mcimadamore@121 | 2396 | return s; |
mcimadamore@121 | 2397 | } else if (longform) { |
mcimadamore@121 | 2398 | return sym.getQualifiedName().toString(); |
mcimadamore@121 | 2399 | } else { |
mcimadamore@121 | 2400 | return sym.name.toString(); |
mcimadamore@121 | 2401 | } |
mcimadamore@121 | 2402 | } |
mcimadamore@121 | 2403 | |
mcimadamore@121 | 2404 | protected String printMethodArgs(List<Type> args, boolean varArgs, Locale locale) { |
mcimadamore@121 | 2405 | if (!varArgs) { |
mcimadamore@121 | 2406 | return visit(args, locale); |
mcimadamore@121 | 2407 | } else { |
mcimadamore@121 | 2408 | StringBuffer buf = new StringBuffer(); |
mcimadamore@121 | 2409 | while (args.tail.nonEmpty()) { |
mcimadamore@121 | 2410 | buf.append(visit(args.head, locale)); |
mcimadamore@121 | 2411 | args = args.tail; |
mcimadamore@121 | 2412 | buf.append(','); |
mcimadamore@121 | 2413 | } |
mcimadamore@121 | 2414 | if (args.head.tag == ARRAY) { |
mcimadamore@121 | 2415 | buf.append(visit(((ArrayType) args.head).elemtype, locale)); |
mcimadamore@121 | 2416 | buf.append("..."); |
mcimadamore@121 | 2417 | } else { |
mcimadamore@121 | 2418 | buf.append(visit(args.head, locale)); |
mcimadamore@121 | 2419 | } |
mcimadamore@121 | 2420 | return buf.toString(); |
mcimadamore@121 | 2421 | } |
mcimadamore@121 | 2422 | } |
mcimadamore@121 | 2423 | |
mcimadamore@121 | 2424 | protected String getLocalizedString(Locale locale, String key, Object... args) { |
mcimadamore@121 | 2425 | return messages.getLocalizedString(key, args); |
mcimadamore@121 | 2426 | } |
mcimadamore@121 | 2427 | }; |
mcimadamore@121 | 2428 | // </editor-fold> |
mcimadamore@121 | 2429 | |
mcimadamore@121 | 2430 | // <editor-fold defaultstate="collapsed" desc="printSymbol"> |
mcimadamore@121 | 2431 | /** |
mcimadamore@121 | 2432 | * Visitor for generating a string representation of a given symbol |
mcimadamore@121 | 2433 | * accordingly to a given locale |
mcimadamore@121 | 2434 | */ |
mcimadamore@121 | 2435 | public String toString(Symbol t, Locale locale) { |
mcimadamore@121 | 2436 | return symbolPrinter.visit(t, locale); |
mcimadamore@121 | 2437 | } |
mcimadamore@121 | 2438 | // where |
mcimadamore@121 | 2439 | private SymbolPrinter symbolPrinter = new SymbolPrinter(); |
mcimadamore@121 | 2440 | |
mcimadamore@121 | 2441 | public class SymbolPrinter extends DefaultSymbolVisitor<String, Locale> { |
mcimadamore@121 | 2442 | |
mcimadamore@121 | 2443 | @Override |
mcimadamore@121 | 2444 | public String visitClassSymbol(ClassSymbol sym, Locale locale) { |
mcimadamore@121 | 2445 | return sym.name.isEmpty() |
mcimadamore@121 | 2446 | ? getLocalizedString(locale, "compiler.misc.anonymous.class", sym.flatname) |
mcimadamore@121 | 2447 | : sym.fullname.toString(); |
mcimadamore@121 | 2448 | } |
mcimadamore@121 | 2449 | |
mcimadamore@121 | 2450 | @Override |
mcimadamore@121 | 2451 | public String visitMethodSymbol(MethodSymbol s, Locale locale) { |
mcimadamore@121 | 2452 | if ((s.flags() & BLOCK) != 0) { |
mcimadamore@121 | 2453 | return s.owner.name.toString(); |
mcimadamore@121 | 2454 | } else { |
mcimadamore@121 | 2455 | String ms = (s.name == names.init) |
mcimadamore@121 | 2456 | ? s.owner.name.toString() |
mcimadamore@121 | 2457 | : s.name.toString(); |
mcimadamore@121 | 2458 | if (s.type != null) { |
mcimadamore@121 | 2459 | if (s.type.tag == FORALL) { |
mcimadamore@121 | 2460 | ms = "<" + typePrinter.visit(s.type.getTypeArguments(), locale) + ">" + ms; |
mcimadamore@121 | 2461 | } |
mcimadamore@121 | 2462 | ms += "(" + typePrinter.printMethodArgs( |
mcimadamore@121 | 2463 | s.type.getParameterTypes(), |
mcimadamore@121 | 2464 | (s.flags() & VARARGS) != 0, |
mcimadamore@121 | 2465 | locale) + ")"; |
mcimadamore@121 | 2466 | } |
mcimadamore@121 | 2467 | return ms; |
mcimadamore@121 | 2468 | } |
mcimadamore@121 | 2469 | } |
mcimadamore@121 | 2470 | |
mcimadamore@121 | 2471 | @Override |
mcimadamore@121 | 2472 | public String visitOperatorSymbol(OperatorSymbol s, Locale locale) { |
mcimadamore@121 | 2473 | return visitMethodSymbol(s, locale); |
mcimadamore@121 | 2474 | } |
mcimadamore@121 | 2475 | |
mcimadamore@121 | 2476 | @Override |
mcimadamore@121 | 2477 | public String visitPackageSymbol(PackageSymbol s, Locale locale) { |
mcimadamore@121 | 2478 | return s.name.isEmpty() |
mcimadamore@121 | 2479 | ? getLocalizedString(locale, "compiler.misc.unnamed.package") |
mcimadamore@121 | 2480 | : s.fullname.toString(); |
mcimadamore@121 | 2481 | } |
mcimadamore@121 | 2482 | |
mcimadamore@121 | 2483 | @Override |
mcimadamore@121 | 2484 | public String visitSymbol(Symbol s, Locale locale) { |
mcimadamore@121 | 2485 | return s.name.toString(); |
mcimadamore@121 | 2486 | } |
mcimadamore@121 | 2487 | |
mcimadamore@121 | 2488 | public String visit(List<Symbol> ts, Locale locale) { |
mcimadamore@121 | 2489 | ListBuffer<String> sbuf = lb(); |
mcimadamore@121 | 2490 | for (Symbol t : ts) { |
mcimadamore@121 | 2491 | sbuf.append(visit(t, locale)); |
mcimadamore@121 | 2492 | } |
mcimadamore@121 | 2493 | return sbuf.toList().toString(); |
mcimadamore@121 | 2494 | } |
mcimadamore@121 | 2495 | |
mcimadamore@121 | 2496 | protected String getLocalizedString(Locale locale, String key, Object... args) { |
mcimadamore@121 | 2497 | return messages.getLocalizedString(key, args); |
mcimadamore@121 | 2498 | } |
mcimadamore@121 | 2499 | }; |
mcimadamore@121 | 2500 | // </editor-fold> |
mcimadamore@121 | 2501 | |
duke@1 | 2502 | // <editor-fold defaultstate="collapsed" desc="toString"> |
duke@1 | 2503 | /** |
duke@1 | 2504 | * This toString is slightly more descriptive than the one on Type. |
mcimadamore@121 | 2505 | * |
mcimadamore@121 | 2506 | * @deprecated Types.toString(Type t, Locale l) provides better support |
mcimadamore@121 | 2507 | * for localization |
duke@1 | 2508 | */ |
mcimadamore@121 | 2509 | @Deprecated |
duke@1 | 2510 | public String toString(Type t) { |
duke@1 | 2511 | if (t.tag == FORALL) { |
duke@1 | 2512 | ForAll forAll = (ForAll)t; |
duke@1 | 2513 | return typaramsString(forAll.tvars) + forAll.qtype; |
duke@1 | 2514 | } |
duke@1 | 2515 | return "" + t; |
duke@1 | 2516 | } |
duke@1 | 2517 | // where |
duke@1 | 2518 | private String typaramsString(List<Type> tvars) { |
duke@1 | 2519 | StringBuffer s = new StringBuffer(); |
duke@1 | 2520 | s.append('<'); |
duke@1 | 2521 | boolean first = true; |
duke@1 | 2522 | for (Type t : tvars) { |
duke@1 | 2523 | if (!first) s.append(", "); |
duke@1 | 2524 | first = false; |
duke@1 | 2525 | appendTyparamString(((TypeVar)t), s); |
duke@1 | 2526 | } |
duke@1 | 2527 | s.append('>'); |
duke@1 | 2528 | return s.toString(); |
duke@1 | 2529 | } |
duke@1 | 2530 | private void appendTyparamString(TypeVar t, StringBuffer buf) { |
duke@1 | 2531 | buf.append(t); |
duke@1 | 2532 | if (t.bound == null || |
duke@1 | 2533 | t.bound.tsym.getQualifiedName() == names.java_lang_Object) |
duke@1 | 2534 | return; |
duke@1 | 2535 | buf.append(" extends "); // Java syntax; no need for i18n |
duke@1 | 2536 | Type bound = t.bound; |
duke@1 | 2537 | if (!bound.isCompound()) { |
duke@1 | 2538 | buf.append(bound); |
duke@1 | 2539 | } else if ((erasure(t).tsym.flags() & INTERFACE) == 0) { |
duke@1 | 2540 | buf.append(supertype(t)); |
duke@1 | 2541 | for (Type intf : interfaces(t)) { |
duke@1 | 2542 | buf.append('&'); |
duke@1 | 2543 | buf.append(intf); |
duke@1 | 2544 | } |
duke@1 | 2545 | } else { |
duke@1 | 2546 | // No superclass was given in bounds. |
duke@1 | 2547 | // In this case, supertype is Object, erasure is first interface. |
duke@1 | 2548 | boolean first = true; |
duke@1 | 2549 | for (Type intf : interfaces(t)) { |
duke@1 | 2550 | if (!first) buf.append('&'); |
duke@1 | 2551 | first = false; |
duke@1 | 2552 | buf.append(intf); |
duke@1 | 2553 | } |
duke@1 | 2554 | } |
duke@1 | 2555 | } |
duke@1 | 2556 | // </editor-fold> |
duke@1 | 2557 | |
duke@1 | 2558 | // <editor-fold defaultstate="collapsed" desc="Determining least upper bounds of types"> |
duke@1 | 2559 | /** |
duke@1 | 2560 | * A cache for closures. |
duke@1 | 2561 | * |
duke@1 | 2562 | * <p>A closure is a list of all the supertypes and interfaces of |
duke@1 | 2563 | * a class or interface type, ordered by ClassSymbol.precedes |
duke@1 | 2564 | * (that is, subclasses come first, arbitrary but fixed |
duke@1 | 2565 | * otherwise). |
duke@1 | 2566 | */ |
duke@1 | 2567 | private Map<Type,List<Type>> closureCache = new HashMap<Type,List<Type>>(); |
duke@1 | 2568 | |
duke@1 | 2569 | /** |
duke@1 | 2570 | * Returns the closure of a class or interface type. |
duke@1 | 2571 | */ |
duke@1 | 2572 | public List<Type> closure(Type t) { |
duke@1 | 2573 | List<Type> cl = closureCache.get(t); |
duke@1 | 2574 | if (cl == null) { |
duke@1 | 2575 | Type st = supertype(t); |
duke@1 | 2576 | if (!t.isCompound()) { |
duke@1 | 2577 | if (st.tag == CLASS) { |
duke@1 | 2578 | cl = insert(closure(st), t); |
duke@1 | 2579 | } else if (st.tag == TYPEVAR) { |
duke@1 | 2580 | cl = closure(st).prepend(t); |
duke@1 | 2581 | } else { |
duke@1 | 2582 | cl = List.of(t); |
duke@1 | 2583 | } |
duke@1 | 2584 | } else { |
duke@1 | 2585 | cl = closure(supertype(t)); |
duke@1 | 2586 | } |
duke@1 | 2587 | for (List<Type> l = interfaces(t); l.nonEmpty(); l = l.tail) |
duke@1 | 2588 | cl = union(cl, closure(l.head)); |
duke@1 | 2589 | closureCache.put(t, cl); |
duke@1 | 2590 | } |
duke@1 | 2591 | return cl; |
duke@1 | 2592 | } |
duke@1 | 2593 | |
duke@1 | 2594 | /** |
duke@1 | 2595 | * Insert a type in a closure |
duke@1 | 2596 | */ |
duke@1 | 2597 | public List<Type> insert(List<Type> cl, Type t) { |
duke@1 | 2598 | if (cl.isEmpty() || t.tsym.precedes(cl.head.tsym, this)) { |
duke@1 | 2599 | return cl.prepend(t); |
duke@1 | 2600 | } else if (cl.head.tsym.precedes(t.tsym, this)) { |
duke@1 | 2601 | return insert(cl.tail, t).prepend(cl.head); |
duke@1 | 2602 | } else { |
duke@1 | 2603 | return cl; |
duke@1 | 2604 | } |
duke@1 | 2605 | } |
duke@1 | 2606 | |
duke@1 | 2607 | /** |
duke@1 | 2608 | * Form the union of two closures |
duke@1 | 2609 | */ |
duke@1 | 2610 | public List<Type> union(List<Type> cl1, List<Type> cl2) { |
duke@1 | 2611 | if (cl1.isEmpty()) { |
duke@1 | 2612 | return cl2; |
duke@1 | 2613 | } else if (cl2.isEmpty()) { |
duke@1 | 2614 | return cl1; |
duke@1 | 2615 | } else if (cl1.head.tsym.precedes(cl2.head.tsym, this)) { |
duke@1 | 2616 | return union(cl1.tail, cl2).prepend(cl1.head); |
duke@1 | 2617 | } else if (cl2.head.tsym.precedes(cl1.head.tsym, this)) { |
duke@1 | 2618 | return union(cl1, cl2.tail).prepend(cl2.head); |
duke@1 | 2619 | } else { |
duke@1 | 2620 | return union(cl1.tail, cl2.tail).prepend(cl1.head); |
duke@1 | 2621 | } |
duke@1 | 2622 | } |
duke@1 | 2623 | |
duke@1 | 2624 | /** |
duke@1 | 2625 | * Intersect two closures |
duke@1 | 2626 | */ |
duke@1 | 2627 | public List<Type> intersect(List<Type> cl1, List<Type> cl2) { |
duke@1 | 2628 | if (cl1 == cl2) |
duke@1 | 2629 | return cl1; |
duke@1 | 2630 | if (cl1.isEmpty() || cl2.isEmpty()) |
duke@1 | 2631 | return List.nil(); |
duke@1 | 2632 | if (cl1.head.tsym.precedes(cl2.head.tsym, this)) |
duke@1 | 2633 | return intersect(cl1.tail, cl2); |
duke@1 | 2634 | if (cl2.head.tsym.precedes(cl1.head.tsym, this)) |
duke@1 | 2635 | return intersect(cl1, cl2.tail); |
duke@1 | 2636 | if (isSameType(cl1.head, cl2.head)) |
duke@1 | 2637 | return intersect(cl1.tail, cl2.tail).prepend(cl1.head); |
duke@1 | 2638 | if (cl1.head.tsym == cl2.head.tsym && |
duke@1 | 2639 | cl1.head.tag == CLASS && cl2.head.tag == CLASS) { |
duke@1 | 2640 | if (cl1.head.isParameterized() && cl2.head.isParameterized()) { |
duke@1 | 2641 | Type merge = merge(cl1.head,cl2.head); |
duke@1 | 2642 | return intersect(cl1.tail, cl2.tail).prepend(merge); |
duke@1 | 2643 | } |
duke@1 | 2644 | if (cl1.head.isRaw() || cl2.head.isRaw()) |
duke@1 | 2645 | return intersect(cl1.tail, cl2.tail).prepend(erasure(cl1.head)); |
duke@1 | 2646 | } |
duke@1 | 2647 | return intersect(cl1.tail, cl2.tail); |
duke@1 | 2648 | } |
duke@1 | 2649 | // where |
duke@1 | 2650 | class TypePair { |
duke@1 | 2651 | final Type t1; |
duke@1 | 2652 | final Type t2; |
duke@1 | 2653 | TypePair(Type t1, Type t2) { |
duke@1 | 2654 | this.t1 = t1; |
duke@1 | 2655 | this.t2 = t2; |
duke@1 | 2656 | } |
duke@1 | 2657 | @Override |
duke@1 | 2658 | public int hashCode() { |
duke@1 | 2659 | return 127 * Types.this.hashCode(t1) + Types.this.hashCode(t2); |
duke@1 | 2660 | } |
duke@1 | 2661 | @Override |
duke@1 | 2662 | public boolean equals(Object obj) { |
duke@1 | 2663 | if (!(obj instanceof TypePair)) |
duke@1 | 2664 | return false; |
duke@1 | 2665 | TypePair typePair = (TypePair)obj; |
duke@1 | 2666 | return isSameType(t1, typePair.t1) |
duke@1 | 2667 | && isSameType(t2, typePair.t2); |
duke@1 | 2668 | } |
duke@1 | 2669 | } |
duke@1 | 2670 | Set<TypePair> mergeCache = new HashSet<TypePair>(); |
duke@1 | 2671 | private Type merge(Type c1, Type c2) { |
duke@1 | 2672 | ClassType class1 = (ClassType) c1; |
duke@1 | 2673 | List<Type> act1 = class1.getTypeArguments(); |
duke@1 | 2674 | ClassType class2 = (ClassType) c2; |
duke@1 | 2675 | List<Type> act2 = class2.getTypeArguments(); |
duke@1 | 2676 | ListBuffer<Type> merged = new ListBuffer<Type>(); |
duke@1 | 2677 | List<Type> typarams = class1.tsym.type.getTypeArguments(); |
duke@1 | 2678 | |
duke@1 | 2679 | while (act1.nonEmpty() && act2.nonEmpty() && typarams.nonEmpty()) { |
duke@1 | 2680 | if (containsType(act1.head, act2.head)) { |
duke@1 | 2681 | merged.append(act1.head); |
duke@1 | 2682 | } else if (containsType(act2.head, act1.head)) { |
duke@1 | 2683 | merged.append(act2.head); |
duke@1 | 2684 | } else { |
duke@1 | 2685 | TypePair pair = new TypePair(c1, c2); |
duke@1 | 2686 | Type m; |
duke@1 | 2687 | if (mergeCache.add(pair)) { |
duke@1 | 2688 | m = new WildcardType(lub(upperBound(act1.head), |
duke@1 | 2689 | upperBound(act2.head)), |
duke@1 | 2690 | BoundKind.EXTENDS, |
duke@1 | 2691 | syms.boundClass); |
duke@1 | 2692 | mergeCache.remove(pair); |
duke@1 | 2693 | } else { |
duke@1 | 2694 | m = new WildcardType(syms.objectType, |
duke@1 | 2695 | BoundKind.UNBOUND, |
duke@1 | 2696 | syms.boundClass); |
duke@1 | 2697 | } |
duke@1 | 2698 | merged.append(m.withTypeVar(typarams.head)); |
duke@1 | 2699 | } |
duke@1 | 2700 | act1 = act1.tail; |
duke@1 | 2701 | act2 = act2.tail; |
duke@1 | 2702 | typarams = typarams.tail; |
duke@1 | 2703 | } |
duke@1 | 2704 | assert(act1.isEmpty() && act2.isEmpty() && typarams.isEmpty()); |
duke@1 | 2705 | return new ClassType(class1.getEnclosingType(), merged.toList(), class1.tsym); |
duke@1 | 2706 | } |
duke@1 | 2707 | |
duke@1 | 2708 | /** |
duke@1 | 2709 | * Return the minimum type of a closure, a compound type if no |
duke@1 | 2710 | * unique minimum exists. |
duke@1 | 2711 | */ |
duke@1 | 2712 | private Type compoundMin(List<Type> cl) { |
duke@1 | 2713 | if (cl.isEmpty()) return syms.objectType; |
duke@1 | 2714 | List<Type> compound = closureMin(cl); |
duke@1 | 2715 | if (compound.isEmpty()) |
duke@1 | 2716 | return null; |
duke@1 | 2717 | else if (compound.tail.isEmpty()) |
duke@1 | 2718 | return compound.head; |
duke@1 | 2719 | else |
duke@1 | 2720 | return makeCompoundType(compound); |
duke@1 | 2721 | } |
duke@1 | 2722 | |
duke@1 | 2723 | /** |
duke@1 | 2724 | * Return the minimum types of a closure, suitable for computing |
duke@1 | 2725 | * compoundMin or glb. |
duke@1 | 2726 | */ |
duke@1 | 2727 | private List<Type> closureMin(List<Type> cl) { |
duke@1 | 2728 | ListBuffer<Type> classes = lb(); |
duke@1 | 2729 | ListBuffer<Type> interfaces = lb(); |
duke@1 | 2730 | while (!cl.isEmpty()) { |
duke@1 | 2731 | Type current = cl.head; |
duke@1 | 2732 | if (current.isInterface()) |
duke@1 | 2733 | interfaces.append(current); |
duke@1 | 2734 | else |
duke@1 | 2735 | classes.append(current); |
duke@1 | 2736 | ListBuffer<Type> candidates = lb(); |
duke@1 | 2737 | for (Type t : cl.tail) { |
duke@1 | 2738 | if (!isSubtypeNoCapture(current, t)) |
duke@1 | 2739 | candidates.append(t); |
duke@1 | 2740 | } |
duke@1 | 2741 | cl = candidates.toList(); |
duke@1 | 2742 | } |
duke@1 | 2743 | return classes.appendList(interfaces).toList(); |
duke@1 | 2744 | } |
duke@1 | 2745 | |
duke@1 | 2746 | /** |
duke@1 | 2747 | * Return the least upper bound of pair of types. if the lub does |
duke@1 | 2748 | * not exist return null. |
duke@1 | 2749 | */ |
duke@1 | 2750 | public Type lub(Type t1, Type t2) { |
duke@1 | 2751 | return lub(List.of(t1, t2)); |
duke@1 | 2752 | } |
duke@1 | 2753 | |
duke@1 | 2754 | /** |
duke@1 | 2755 | * Return the least upper bound (lub) of set of types. If the lub |
duke@1 | 2756 | * does not exist return the type of null (bottom). |
duke@1 | 2757 | */ |
duke@1 | 2758 | public Type lub(List<Type> ts) { |
duke@1 | 2759 | final int ARRAY_BOUND = 1; |
duke@1 | 2760 | final int CLASS_BOUND = 2; |
duke@1 | 2761 | int boundkind = 0; |
duke@1 | 2762 | for (Type t : ts) { |
duke@1 | 2763 | switch (t.tag) { |
duke@1 | 2764 | case CLASS: |
duke@1 | 2765 | boundkind |= CLASS_BOUND; |
duke@1 | 2766 | break; |
duke@1 | 2767 | case ARRAY: |
duke@1 | 2768 | boundkind |= ARRAY_BOUND; |
duke@1 | 2769 | break; |
duke@1 | 2770 | case TYPEVAR: |
duke@1 | 2771 | do { |
duke@1 | 2772 | t = t.getUpperBound(); |
duke@1 | 2773 | } while (t.tag == TYPEVAR); |
duke@1 | 2774 | if (t.tag == ARRAY) { |
duke@1 | 2775 | boundkind |= ARRAY_BOUND; |
duke@1 | 2776 | } else { |
duke@1 | 2777 | boundkind |= CLASS_BOUND; |
duke@1 | 2778 | } |
duke@1 | 2779 | break; |
duke@1 | 2780 | default: |
duke@1 | 2781 | if (t.isPrimitive()) |
mcimadamore@5 | 2782 | return syms.errType; |
duke@1 | 2783 | } |
duke@1 | 2784 | } |
duke@1 | 2785 | switch (boundkind) { |
duke@1 | 2786 | case 0: |
duke@1 | 2787 | return syms.botType; |
duke@1 | 2788 | |
duke@1 | 2789 | case ARRAY_BOUND: |
duke@1 | 2790 | // calculate lub(A[], B[]) |
duke@1 | 2791 | List<Type> elements = Type.map(ts, elemTypeFun); |
duke@1 | 2792 | for (Type t : elements) { |
duke@1 | 2793 | if (t.isPrimitive()) { |
duke@1 | 2794 | // if a primitive type is found, then return |
duke@1 | 2795 | // arraySuperType unless all the types are the |
duke@1 | 2796 | // same |
duke@1 | 2797 | Type first = ts.head; |
duke@1 | 2798 | for (Type s : ts.tail) { |
duke@1 | 2799 | if (!isSameType(first, s)) { |
duke@1 | 2800 | // lub(int[], B[]) is Cloneable & Serializable |
duke@1 | 2801 | return arraySuperType(); |
duke@1 | 2802 | } |
duke@1 | 2803 | } |
duke@1 | 2804 | // all the array types are the same, return one |
duke@1 | 2805 | // lub(int[], int[]) is int[] |
duke@1 | 2806 | return first; |
duke@1 | 2807 | } |
duke@1 | 2808 | } |
duke@1 | 2809 | // lub(A[], B[]) is lub(A, B)[] |
duke@1 | 2810 | return new ArrayType(lub(elements), syms.arrayClass); |
duke@1 | 2811 | |
duke@1 | 2812 | case CLASS_BOUND: |
duke@1 | 2813 | // calculate lub(A, B) |
duke@1 | 2814 | while (ts.head.tag != CLASS && ts.head.tag != TYPEVAR) |
duke@1 | 2815 | ts = ts.tail; |
duke@1 | 2816 | assert !ts.isEmpty(); |
duke@1 | 2817 | List<Type> cl = closure(ts.head); |
duke@1 | 2818 | for (Type t : ts.tail) { |
duke@1 | 2819 | if (t.tag == CLASS || t.tag == TYPEVAR) |
duke@1 | 2820 | cl = intersect(cl, closure(t)); |
duke@1 | 2821 | } |
duke@1 | 2822 | return compoundMin(cl); |
duke@1 | 2823 | |
duke@1 | 2824 | default: |
duke@1 | 2825 | // calculate lub(A, B[]) |
duke@1 | 2826 | List<Type> classes = List.of(arraySuperType()); |
duke@1 | 2827 | for (Type t : ts) { |
duke@1 | 2828 | if (t.tag != ARRAY) // Filter out any arrays |
duke@1 | 2829 | classes = classes.prepend(t); |
duke@1 | 2830 | } |
duke@1 | 2831 | // lub(A, B[]) is lub(A, arraySuperType) |
duke@1 | 2832 | return lub(classes); |
duke@1 | 2833 | } |
duke@1 | 2834 | } |
duke@1 | 2835 | // where |
duke@1 | 2836 | private Type arraySuperType = null; |
duke@1 | 2837 | private Type arraySuperType() { |
duke@1 | 2838 | // initialized lazily to avoid problems during compiler startup |
duke@1 | 2839 | if (arraySuperType == null) { |
duke@1 | 2840 | synchronized (this) { |
duke@1 | 2841 | if (arraySuperType == null) { |
duke@1 | 2842 | // JLS 10.8: all arrays implement Cloneable and Serializable. |
duke@1 | 2843 | arraySuperType = makeCompoundType(List.of(syms.serializableType, |
duke@1 | 2844 | syms.cloneableType), |
duke@1 | 2845 | syms.objectType); |
duke@1 | 2846 | } |
duke@1 | 2847 | } |
duke@1 | 2848 | } |
duke@1 | 2849 | return arraySuperType; |
duke@1 | 2850 | } |
duke@1 | 2851 | // </editor-fold> |
duke@1 | 2852 | |
duke@1 | 2853 | // <editor-fold defaultstate="collapsed" desc="Greatest lower bound"> |
mcimadamore@210 | 2854 | public Type glb(List<Type> ts) { |
mcimadamore@210 | 2855 | Type t1 = ts.head; |
mcimadamore@210 | 2856 | for (Type t2 : ts.tail) { |
mcimadamore@210 | 2857 | if (t1.isErroneous()) |
mcimadamore@210 | 2858 | return t1; |
mcimadamore@210 | 2859 | t1 = glb(t1, t2); |
mcimadamore@210 | 2860 | } |
mcimadamore@210 | 2861 | return t1; |
mcimadamore@210 | 2862 | } |
mcimadamore@210 | 2863 | //where |
duke@1 | 2864 | public Type glb(Type t, Type s) { |
duke@1 | 2865 | if (s == null) |
duke@1 | 2866 | return t; |
duke@1 | 2867 | else if (isSubtypeNoCapture(t, s)) |
duke@1 | 2868 | return t; |
duke@1 | 2869 | else if (isSubtypeNoCapture(s, t)) |
duke@1 | 2870 | return s; |
duke@1 | 2871 | |
duke@1 | 2872 | List<Type> closure = union(closure(t), closure(s)); |
duke@1 | 2873 | List<Type> bounds = closureMin(closure); |
duke@1 | 2874 | |
duke@1 | 2875 | if (bounds.isEmpty()) { // length == 0 |
duke@1 | 2876 | return syms.objectType; |
duke@1 | 2877 | } else if (bounds.tail.isEmpty()) { // length == 1 |
duke@1 | 2878 | return bounds.head; |
duke@1 | 2879 | } else { // length > 1 |
duke@1 | 2880 | int classCount = 0; |
duke@1 | 2881 | for (Type bound : bounds) |
duke@1 | 2882 | if (!bound.isInterface()) |
duke@1 | 2883 | classCount++; |
duke@1 | 2884 | if (classCount > 1) |
jjg@110 | 2885 | return createErrorType(t); |
duke@1 | 2886 | } |
duke@1 | 2887 | return makeCompoundType(bounds); |
duke@1 | 2888 | } |
duke@1 | 2889 | // </editor-fold> |
duke@1 | 2890 | |
duke@1 | 2891 | // <editor-fold defaultstate="collapsed" desc="hashCode"> |
duke@1 | 2892 | /** |
duke@1 | 2893 | * Compute a hash code on a type. |
duke@1 | 2894 | */ |
duke@1 | 2895 | public static int hashCode(Type t) { |
duke@1 | 2896 | return hashCode.visit(t); |
duke@1 | 2897 | } |
duke@1 | 2898 | // where |
duke@1 | 2899 | private static final UnaryVisitor<Integer> hashCode = new UnaryVisitor<Integer>() { |
duke@1 | 2900 | |
duke@1 | 2901 | public Integer visitType(Type t, Void ignored) { |
duke@1 | 2902 | return t.tag; |
duke@1 | 2903 | } |
duke@1 | 2904 | |
duke@1 | 2905 | @Override |
duke@1 | 2906 | public Integer visitClassType(ClassType t, Void ignored) { |
duke@1 | 2907 | int result = visit(t.getEnclosingType()); |
duke@1 | 2908 | result *= 127; |
duke@1 | 2909 | result += t.tsym.flatName().hashCode(); |
duke@1 | 2910 | for (Type s : t.getTypeArguments()) { |
duke@1 | 2911 | result *= 127; |
duke@1 | 2912 | result += visit(s); |
duke@1 | 2913 | } |
duke@1 | 2914 | return result; |
duke@1 | 2915 | } |
duke@1 | 2916 | |
duke@1 | 2917 | @Override |
duke@1 | 2918 | public Integer visitWildcardType(WildcardType t, Void ignored) { |
duke@1 | 2919 | int result = t.kind.hashCode(); |
duke@1 | 2920 | if (t.type != null) { |
duke@1 | 2921 | result *= 127; |
duke@1 | 2922 | result += visit(t.type); |
duke@1 | 2923 | } |
duke@1 | 2924 | return result; |
duke@1 | 2925 | } |
duke@1 | 2926 | |
duke@1 | 2927 | @Override |
duke@1 | 2928 | public Integer visitArrayType(ArrayType t, Void ignored) { |
duke@1 | 2929 | return visit(t.elemtype) + 12; |
duke@1 | 2930 | } |
duke@1 | 2931 | |
duke@1 | 2932 | @Override |
duke@1 | 2933 | public Integer visitTypeVar(TypeVar t, Void ignored) { |
duke@1 | 2934 | return System.identityHashCode(t.tsym); |
duke@1 | 2935 | } |
duke@1 | 2936 | |
duke@1 | 2937 | @Override |
duke@1 | 2938 | public Integer visitUndetVar(UndetVar t, Void ignored) { |
duke@1 | 2939 | return System.identityHashCode(t); |
duke@1 | 2940 | } |
duke@1 | 2941 | |
duke@1 | 2942 | @Override |
duke@1 | 2943 | public Integer visitErrorType(ErrorType t, Void ignored) { |
duke@1 | 2944 | return 0; |
duke@1 | 2945 | } |
duke@1 | 2946 | }; |
duke@1 | 2947 | // </editor-fold> |
duke@1 | 2948 | |
duke@1 | 2949 | // <editor-fold defaultstate="collapsed" desc="Return-Type-Substitutable"> |
duke@1 | 2950 | /** |
duke@1 | 2951 | * Does t have a result that is a subtype of the result type of s, |
duke@1 | 2952 | * suitable for covariant returns? It is assumed that both types |
duke@1 | 2953 | * are (possibly polymorphic) method types. Monomorphic method |
duke@1 | 2954 | * types are handled in the obvious way. Polymorphic method types |
duke@1 | 2955 | * require renaming all type variables of one to corresponding |
duke@1 | 2956 | * type variables in the other, where correspondence is by |
duke@1 | 2957 | * position in the type parameter list. */ |
duke@1 | 2958 | public boolean resultSubtype(Type t, Type s, Warner warner) { |
duke@1 | 2959 | List<Type> tvars = t.getTypeArguments(); |
duke@1 | 2960 | List<Type> svars = s.getTypeArguments(); |
duke@1 | 2961 | Type tres = t.getReturnType(); |
duke@1 | 2962 | Type sres = subst(s.getReturnType(), svars, tvars); |
duke@1 | 2963 | return covariantReturnType(tres, sres, warner); |
duke@1 | 2964 | } |
duke@1 | 2965 | |
duke@1 | 2966 | /** |
duke@1 | 2967 | * Return-Type-Substitutable. |
duke@1 | 2968 | * @see <a href="http://java.sun.com/docs/books/jls/">The Java |
duke@1 | 2969 | * Language Specification, Third Ed. (8.4.5)</a> |
duke@1 | 2970 | */ |
duke@1 | 2971 | public boolean returnTypeSubstitutable(Type r1, Type r2) { |
duke@1 | 2972 | if (hasSameArgs(r1, r2)) |
tbell@202 | 2973 | return resultSubtype(r1, r2, Warner.noWarnings); |
duke@1 | 2974 | else |
duke@1 | 2975 | return covariantReturnType(r1.getReturnType(), |
tbell@202 | 2976 | erasure(r2.getReturnType()), |
tbell@202 | 2977 | Warner.noWarnings); |
tbell@202 | 2978 | } |
tbell@202 | 2979 | |
tbell@202 | 2980 | public boolean returnTypeSubstitutable(Type r1, |
tbell@202 | 2981 | Type r2, Type r2res, |
tbell@202 | 2982 | Warner warner) { |
tbell@202 | 2983 | if (isSameType(r1.getReturnType(), r2res)) |
tbell@202 | 2984 | return true; |
tbell@202 | 2985 | if (r1.getReturnType().isPrimitive() || r2res.isPrimitive()) |
tbell@202 | 2986 | return false; |
tbell@202 | 2987 | |
tbell@202 | 2988 | if (hasSameArgs(r1, r2)) |
tbell@202 | 2989 | return covariantReturnType(r1.getReturnType(), r2res, warner); |
tbell@202 | 2990 | if (!source.allowCovariantReturns()) |
tbell@202 | 2991 | return false; |
tbell@202 | 2992 | if (isSubtypeUnchecked(r1.getReturnType(), r2res, warner)) |
tbell@202 | 2993 | return true; |
tbell@202 | 2994 | if (!isSubtype(r1.getReturnType(), erasure(r2res))) |
tbell@202 | 2995 | return false; |
tbell@202 | 2996 | warner.warnUnchecked(); |
tbell@202 | 2997 | return true; |
duke@1 | 2998 | } |
duke@1 | 2999 | |
duke@1 | 3000 | /** |
duke@1 | 3001 | * Is t an appropriate return type in an overrider for a |
duke@1 | 3002 | * method that returns s? |
duke@1 | 3003 | */ |
duke@1 | 3004 | public boolean covariantReturnType(Type t, Type s, Warner warner) { |
tbell@202 | 3005 | return |
tbell@202 | 3006 | isSameType(t, s) || |
tbell@202 | 3007 | source.allowCovariantReturns() && |
duke@1 | 3008 | !t.isPrimitive() && |
tbell@202 | 3009 | !s.isPrimitive() && |
tbell@202 | 3010 | isAssignable(t, s, warner); |
duke@1 | 3011 | } |
duke@1 | 3012 | // </editor-fold> |
duke@1 | 3013 | |
duke@1 | 3014 | // <editor-fold defaultstate="collapsed" desc="Box/unbox support"> |
duke@1 | 3015 | /** |
duke@1 | 3016 | * Return the class that boxes the given primitive. |
duke@1 | 3017 | */ |
duke@1 | 3018 | public ClassSymbol boxedClass(Type t) { |
duke@1 | 3019 | return reader.enterClass(syms.boxedName[t.tag]); |
duke@1 | 3020 | } |
duke@1 | 3021 | |
duke@1 | 3022 | /** |
duke@1 | 3023 | * Return the primitive type corresponding to a boxed type. |
duke@1 | 3024 | */ |
duke@1 | 3025 | public Type unboxedType(Type t) { |
duke@1 | 3026 | if (allowBoxing) { |
duke@1 | 3027 | for (int i=0; i<syms.boxedName.length; i++) { |
duke@1 | 3028 | Name box = syms.boxedName[i]; |
duke@1 | 3029 | if (box != null && |
duke@1 | 3030 | asSuper(t, reader.enterClass(box)) != null) |
duke@1 | 3031 | return syms.typeOfTag[i]; |
duke@1 | 3032 | } |
duke@1 | 3033 | } |
duke@1 | 3034 | return Type.noType; |
duke@1 | 3035 | } |
duke@1 | 3036 | // </editor-fold> |
duke@1 | 3037 | |
duke@1 | 3038 | // <editor-fold defaultstate="collapsed" desc="Capture conversion"> |
duke@1 | 3039 | /* |
duke@1 | 3040 | * JLS 3rd Ed. 5.1.10 Capture Conversion: |
duke@1 | 3041 | * |
duke@1 | 3042 | * Let G name a generic type declaration with n formal type |
duke@1 | 3043 | * parameters A1 ... An with corresponding bounds U1 ... Un. There |
duke@1 | 3044 | * exists a capture conversion from G<T1 ... Tn> to G<S1 ... Sn>, |
duke@1 | 3045 | * where, for 1 <= i <= n: |
duke@1 | 3046 | * |
duke@1 | 3047 | * + If Ti is a wildcard type argument (4.5.1) of the form ? then |
duke@1 | 3048 | * Si is a fresh type variable whose upper bound is |
duke@1 | 3049 | * Ui[A1 := S1, ..., An := Sn] and whose lower bound is the null |
duke@1 | 3050 | * type. |
duke@1 | 3051 | * |
duke@1 | 3052 | * + If Ti is a wildcard type argument of the form ? extends Bi, |
duke@1 | 3053 | * then Si is a fresh type variable whose upper bound is |
duke@1 | 3054 | * glb(Bi, Ui[A1 := S1, ..., An := Sn]) and whose lower bound is |
duke@1 | 3055 | * the null type, where glb(V1,... ,Vm) is V1 & ... & Vm. It is |
duke@1 | 3056 | * a compile-time error if for any two classes (not interfaces) |
duke@1 | 3057 | * Vi and Vj,Vi is not a subclass of Vj or vice versa. |
duke@1 | 3058 | * |
duke@1 | 3059 | * + If Ti is a wildcard type argument of the form ? super Bi, |
duke@1 | 3060 | * then Si is a fresh type variable whose upper bound is |
duke@1 | 3061 | * Ui[A1 := S1, ..., An := Sn] and whose lower bound is Bi. |
duke@1 | 3062 | * |
duke@1 | 3063 | * + Otherwise, Si = Ti. |
duke@1 | 3064 | * |
duke@1 | 3065 | * Capture conversion on any type other than a parameterized type |
duke@1 | 3066 | * (4.5) acts as an identity conversion (5.1.1). Capture |
duke@1 | 3067 | * conversions never require a special action at run time and |
duke@1 | 3068 | * therefore never throw an exception at run time. |
duke@1 | 3069 | * |
duke@1 | 3070 | * Capture conversion is not applied recursively. |
duke@1 | 3071 | */ |
duke@1 | 3072 | /** |
duke@1 | 3073 | * Capture conversion as specified by JLS 3rd Ed. |
duke@1 | 3074 | */ |
duke@1 | 3075 | public Type capture(Type t) { |
duke@1 | 3076 | if (t.tag != CLASS) |
duke@1 | 3077 | return t; |
duke@1 | 3078 | ClassType cls = (ClassType)t; |
duke@1 | 3079 | if (cls.isRaw() || !cls.isParameterized()) |
duke@1 | 3080 | return cls; |
duke@1 | 3081 | |
duke@1 | 3082 | ClassType G = (ClassType)cls.asElement().asType(); |
duke@1 | 3083 | List<Type> A = G.getTypeArguments(); |
duke@1 | 3084 | List<Type> T = cls.getTypeArguments(); |
duke@1 | 3085 | List<Type> S = freshTypeVariables(T); |
duke@1 | 3086 | |
duke@1 | 3087 | List<Type> currentA = A; |
duke@1 | 3088 | List<Type> currentT = T; |
duke@1 | 3089 | List<Type> currentS = S; |
duke@1 | 3090 | boolean captured = false; |
duke@1 | 3091 | while (!currentA.isEmpty() && |
duke@1 | 3092 | !currentT.isEmpty() && |
duke@1 | 3093 | !currentS.isEmpty()) { |
duke@1 | 3094 | if (currentS.head != currentT.head) { |
duke@1 | 3095 | captured = true; |
duke@1 | 3096 | WildcardType Ti = (WildcardType)currentT.head; |
duke@1 | 3097 | Type Ui = currentA.head.getUpperBound(); |
duke@1 | 3098 | CapturedType Si = (CapturedType)currentS.head; |
duke@1 | 3099 | if (Ui == null) |
duke@1 | 3100 | Ui = syms.objectType; |
duke@1 | 3101 | switch (Ti.kind) { |
duke@1 | 3102 | case UNBOUND: |
duke@1 | 3103 | Si.bound = subst(Ui, A, S); |
duke@1 | 3104 | Si.lower = syms.botType; |
duke@1 | 3105 | break; |
duke@1 | 3106 | case EXTENDS: |
duke@1 | 3107 | Si.bound = glb(Ti.getExtendsBound(), subst(Ui, A, S)); |
duke@1 | 3108 | Si.lower = syms.botType; |
duke@1 | 3109 | break; |
duke@1 | 3110 | case SUPER: |
duke@1 | 3111 | Si.bound = subst(Ui, A, S); |
duke@1 | 3112 | Si.lower = Ti.getSuperBound(); |
duke@1 | 3113 | break; |
duke@1 | 3114 | } |
duke@1 | 3115 | if (Si.bound == Si.lower) |
duke@1 | 3116 | currentS.head = Si.bound; |
duke@1 | 3117 | } |
duke@1 | 3118 | currentA = currentA.tail; |
duke@1 | 3119 | currentT = currentT.tail; |
duke@1 | 3120 | currentS = currentS.tail; |
duke@1 | 3121 | } |
duke@1 | 3122 | if (!currentA.isEmpty() || !currentT.isEmpty() || !currentS.isEmpty()) |
duke@1 | 3123 | return erasure(t); // some "rare" type involved |
duke@1 | 3124 | |
duke@1 | 3125 | if (captured) |
duke@1 | 3126 | return new ClassType(cls.getEnclosingType(), S, cls.tsym); |
duke@1 | 3127 | else |
duke@1 | 3128 | return t; |
duke@1 | 3129 | } |
duke@1 | 3130 | // where |
duke@1 | 3131 | private List<Type> freshTypeVariables(List<Type> types) { |
duke@1 | 3132 | ListBuffer<Type> result = lb(); |
duke@1 | 3133 | for (Type t : types) { |
duke@1 | 3134 | if (t.tag == WILDCARD) { |
duke@1 | 3135 | Type bound = ((WildcardType)t).getExtendsBound(); |
duke@1 | 3136 | if (bound == null) |
duke@1 | 3137 | bound = syms.objectType; |
duke@1 | 3138 | result.append(new CapturedType(capturedName, |
duke@1 | 3139 | syms.noSymbol, |
duke@1 | 3140 | bound, |
duke@1 | 3141 | syms.botType, |
duke@1 | 3142 | (WildcardType)t)); |
duke@1 | 3143 | } else { |
duke@1 | 3144 | result.append(t); |
duke@1 | 3145 | } |
duke@1 | 3146 | } |
duke@1 | 3147 | return result.toList(); |
duke@1 | 3148 | } |
duke@1 | 3149 | // </editor-fold> |
duke@1 | 3150 | |
duke@1 | 3151 | // <editor-fold defaultstate="collapsed" desc="Internal utility methods"> |
duke@1 | 3152 | private List<Type> upperBounds(List<Type> ss) { |
duke@1 | 3153 | if (ss.isEmpty()) return ss; |
duke@1 | 3154 | Type head = upperBound(ss.head); |
duke@1 | 3155 | List<Type> tail = upperBounds(ss.tail); |
duke@1 | 3156 | if (head != ss.head || tail != ss.tail) |
duke@1 | 3157 | return tail.prepend(head); |
duke@1 | 3158 | else |
duke@1 | 3159 | return ss; |
duke@1 | 3160 | } |
duke@1 | 3161 | |
duke@1 | 3162 | private boolean sideCast(Type from, Type to, Warner warn) { |
duke@1 | 3163 | // We are casting from type $from$ to type $to$, which are |
duke@1 | 3164 | // non-final unrelated types. This method |
duke@1 | 3165 | // tries to reject a cast by transferring type parameters |
duke@1 | 3166 | // from $to$ to $from$ by common superinterfaces. |
duke@1 | 3167 | boolean reverse = false; |
duke@1 | 3168 | Type target = to; |
duke@1 | 3169 | if ((to.tsym.flags() & INTERFACE) == 0) { |
duke@1 | 3170 | assert (from.tsym.flags() & INTERFACE) != 0; |
duke@1 | 3171 | reverse = true; |
duke@1 | 3172 | to = from; |
duke@1 | 3173 | from = target; |
duke@1 | 3174 | } |
duke@1 | 3175 | List<Type> commonSupers = superClosure(to, erasure(from)); |
duke@1 | 3176 | boolean giveWarning = commonSupers.isEmpty(); |
duke@1 | 3177 | // The arguments to the supers could be unified here to |
duke@1 | 3178 | // get a more accurate analysis |
duke@1 | 3179 | while (commonSupers.nonEmpty()) { |
duke@1 | 3180 | Type t1 = asSuper(from, commonSupers.head.tsym); |
duke@1 | 3181 | Type t2 = commonSupers.head; // same as asSuper(to, commonSupers.head.tsym); |
duke@1 | 3182 | if (disjointTypes(t1.getTypeArguments(), t2.getTypeArguments())) |
duke@1 | 3183 | return false; |
duke@1 | 3184 | giveWarning = giveWarning || (reverse ? giveWarning(t2, t1) : giveWarning(t1, t2)); |
duke@1 | 3185 | commonSupers = commonSupers.tail; |
duke@1 | 3186 | } |
mcimadamore@187 | 3187 | if (giveWarning && !isReifiable(reverse ? from : to)) |
duke@1 | 3188 | warn.warnUnchecked(); |
duke@1 | 3189 | if (!source.allowCovariantReturns()) |
duke@1 | 3190 | // reject if there is a common method signature with |
duke@1 | 3191 | // incompatible return types. |
duke@1 | 3192 | chk.checkCompatibleAbstracts(warn.pos(), from, to); |
duke@1 | 3193 | return true; |
duke@1 | 3194 | } |
duke@1 | 3195 | |
duke@1 | 3196 | private boolean sideCastFinal(Type from, Type to, Warner warn) { |
duke@1 | 3197 | // We are casting from type $from$ to type $to$, which are |
duke@1 | 3198 | // unrelated types one of which is final and the other of |
duke@1 | 3199 | // which is an interface. This method |
duke@1 | 3200 | // tries to reject a cast by transferring type parameters |
duke@1 | 3201 | // from the final class to the interface. |
duke@1 | 3202 | boolean reverse = false; |
duke@1 | 3203 | Type target = to; |
duke@1 | 3204 | if ((to.tsym.flags() & INTERFACE) == 0) { |
duke@1 | 3205 | assert (from.tsym.flags() & INTERFACE) != 0; |
duke@1 | 3206 | reverse = true; |
duke@1 | 3207 | to = from; |
duke@1 | 3208 | from = target; |
duke@1 | 3209 | } |
duke@1 | 3210 | assert (from.tsym.flags() & FINAL) != 0; |
duke@1 | 3211 | Type t1 = asSuper(from, to.tsym); |
duke@1 | 3212 | if (t1 == null) return false; |
duke@1 | 3213 | Type t2 = to; |
duke@1 | 3214 | if (disjointTypes(t1.getTypeArguments(), t2.getTypeArguments())) |
duke@1 | 3215 | return false; |
duke@1 | 3216 | if (!source.allowCovariantReturns()) |
duke@1 | 3217 | // reject if there is a common method signature with |
duke@1 | 3218 | // incompatible return types. |
duke@1 | 3219 | chk.checkCompatibleAbstracts(warn.pos(), from, to); |
duke@1 | 3220 | if (!isReifiable(target) && |
duke@1 | 3221 | (reverse ? giveWarning(t2, t1) : giveWarning(t1, t2))) |
duke@1 | 3222 | warn.warnUnchecked(); |
duke@1 | 3223 | return true; |
duke@1 | 3224 | } |
duke@1 | 3225 | |
duke@1 | 3226 | private boolean giveWarning(Type from, Type to) { |
mcimadamore@235 | 3227 | Type subFrom = asSub(from, to.tsym); |
mcimadamore@235 | 3228 | return to.isParameterized() && |
mcimadamore@235 | 3229 | (!(isUnbounded(to) || |
mcimadamore@235 | 3230 | isSubtype(from, to) || |
mcimadamore@235 | 3231 | ((subFrom != null) && isSameType(subFrom, to)))); |
duke@1 | 3232 | } |
duke@1 | 3233 | |
duke@1 | 3234 | private List<Type> superClosure(Type t, Type s) { |
duke@1 | 3235 | List<Type> cl = List.nil(); |
duke@1 | 3236 | for (List<Type> l = interfaces(t); l.nonEmpty(); l = l.tail) { |
duke@1 | 3237 | if (isSubtype(s, erasure(l.head))) { |
duke@1 | 3238 | cl = insert(cl, l.head); |
duke@1 | 3239 | } else { |
duke@1 | 3240 | cl = union(cl, superClosure(l.head, s)); |
duke@1 | 3241 | } |
duke@1 | 3242 | } |
duke@1 | 3243 | return cl; |
duke@1 | 3244 | } |
duke@1 | 3245 | |
duke@1 | 3246 | private boolean containsTypeEquivalent(Type t, Type s) { |
duke@1 | 3247 | return |
duke@1 | 3248 | isSameType(t, s) || // shortcut |
duke@1 | 3249 | containsType(t, s) && containsType(s, t); |
duke@1 | 3250 | } |
duke@1 | 3251 | |
mcimadamore@138 | 3252 | // <editor-fold defaultstate="collapsed" desc="adapt"> |
duke@1 | 3253 | /** |
duke@1 | 3254 | * Adapt a type by computing a substitution which maps a source |
duke@1 | 3255 | * type to a target type. |
duke@1 | 3256 | * |
duke@1 | 3257 | * @param source the source type |
duke@1 | 3258 | * @param target the target type |
duke@1 | 3259 | * @param from the type variables of the computed substitution |
duke@1 | 3260 | * @param to the types of the computed substitution. |
duke@1 | 3261 | */ |
duke@1 | 3262 | public void adapt(Type source, |
duke@1 | 3263 | Type target, |
duke@1 | 3264 | ListBuffer<Type> from, |
duke@1 | 3265 | ListBuffer<Type> to) throws AdaptFailure { |
mcimadamore@138 | 3266 | new Adapter(from, to).adapt(source, target); |
mcimadamore@138 | 3267 | } |
mcimadamore@138 | 3268 | |
mcimadamore@138 | 3269 | class Adapter extends SimpleVisitor<Void, Type> { |
mcimadamore@138 | 3270 | |
mcimadamore@138 | 3271 | ListBuffer<Type> from; |
mcimadamore@138 | 3272 | ListBuffer<Type> to; |
mcimadamore@138 | 3273 | Map<Symbol,Type> mapping; |
mcimadamore@138 | 3274 | |
mcimadamore@138 | 3275 | Adapter(ListBuffer<Type> from, ListBuffer<Type> to) { |
mcimadamore@138 | 3276 | this.from = from; |
mcimadamore@138 | 3277 | this.to = to; |
mcimadamore@138 | 3278 | mapping = new HashMap<Symbol,Type>(); |
duke@1 | 3279 | } |
mcimadamore@138 | 3280 | |
mcimadamore@138 | 3281 | public void adapt(Type source, Type target) throws AdaptFailure { |
mcimadamore@138 | 3282 | visit(source, target); |
mcimadamore@138 | 3283 | List<Type> fromList = from.toList(); |
mcimadamore@138 | 3284 | List<Type> toList = to.toList(); |
mcimadamore@138 | 3285 | while (!fromList.isEmpty()) { |
mcimadamore@138 | 3286 | Type val = mapping.get(fromList.head.tsym); |
mcimadamore@138 | 3287 | if (toList.head != val) |
mcimadamore@138 | 3288 | toList.head = val; |
mcimadamore@138 | 3289 | fromList = fromList.tail; |
mcimadamore@138 | 3290 | toList = toList.tail; |
mcimadamore@138 | 3291 | } |
mcimadamore@138 | 3292 | } |
mcimadamore@138 | 3293 | |
mcimadamore@138 | 3294 | @Override |
mcimadamore@138 | 3295 | public Void visitClassType(ClassType source, Type target) throws AdaptFailure { |
mcimadamore@138 | 3296 | if (target.tag == CLASS) |
mcimadamore@138 | 3297 | adaptRecursive(source.allparams(), target.allparams()); |
mcimadamore@138 | 3298 | return null; |
mcimadamore@138 | 3299 | } |
mcimadamore@138 | 3300 | |
mcimadamore@138 | 3301 | @Override |
mcimadamore@138 | 3302 | public Void visitArrayType(ArrayType source, Type target) throws AdaptFailure { |
mcimadamore@138 | 3303 | if (target.tag == ARRAY) |
mcimadamore@138 | 3304 | adaptRecursive(elemtype(source), elemtype(target)); |
mcimadamore@138 | 3305 | return null; |
mcimadamore@138 | 3306 | } |
mcimadamore@138 | 3307 | |
mcimadamore@138 | 3308 | @Override |
mcimadamore@138 | 3309 | public Void visitWildcardType(WildcardType source, Type target) throws AdaptFailure { |
mcimadamore@138 | 3310 | if (source.isExtendsBound()) |
mcimadamore@138 | 3311 | adaptRecursive(upperBound(source), upperBound(target)); |
mcimadamore@138 | 3312 | else if (source.isSuperBound()) |
mcimadamore@138 | 3313 | adaptRecursive(lowerBound(source), lowerBound(target)); |
mcimadamore@138 | 3314 | return null; |
mcimadamore@138 | 3315 | } |
mcimadamore@138 | 3316 | |
mcimadamore@138 | 3317 | @Override |
mcimadamore@138 | 3318 | public Void visitTypeVar(TypeVar source, Type target) throws AdaptFailure { |
mcimadamore@138 | 3319 | // Check to see if there is |
mcimadamore@138 | 3320 | // already a mapping for $source$, in which case |
mcimadamore@138 | 3321 | // the old mapping will be merged with the new |
mcimadamore@138 | 3322 | Type val = mapping.get(source.tsym); |
mcimadamore@138 | 3323 | if (val != null) { |
mcimadamore@138 | 3324 | if (val.isSuperBound() && target.isSuperBound()) { |
mcimadamore@138 | 3325 | val = isSubtype(lowerBound(val), lowerBound(target)) |
mcimadamore@138 | 3326 | ? target : val; |
mcimadamore@138 | 3327 | } else if (val.isExtendsBound() && target.isExtendsBound()) { |
mcimadamore@138 | 3328 | val = isSubtype(upperBound(val), upperBound(target)) |
mcimadamore@138 | 3329 | ? val : target; |
mcimadamore@138 | 3330 | } else if (!isSameType(val, target)) { |
mcimadamore@138 | 3331 | throw new AdaptFailure(); |
duke@1 | 3332 | } |
mcimadamore@138 | 3333 | } else { |
mcimadamore@138 | 3334 | val = target; |
mcimadamore@138 | 3335 | from.append(source); |
mcimadamore@138 | 3336 | to.append(target); |
mcimadamore@138 | 3337 | } |
mcimadamore@138 | 3338 | mapping.put(source.tsym, val); |
mcimadamore@138 | 3339 | return null; |
mcimadamore@138 | 3340 | } |
mcimadamore@138 | 3341 | |
mcimadamore@138 | 3342 | @Override |
mcimadamore@138 | 3343 | public Void visitType(Type source, Type target) { |
mcimadamore@138 | 3344 | return null; |
mcimadamore@138 | 3345 | } |
mcimadamore@138 | 3346 | |
mcimadamore@138 | 3347 | private Set<TypePair> cache = new HashSet<TypePair>(); |
mcimadamore@138 | 3348 | |
mcimadamore@138 | 3349 | private void adaptRecursive(Type source, Type target) { |
mcimadamore@138 | 3350 | TypePair pair = new TypePair(source, target); |
mcimadamore@138 | 3351 | if (cache.add(pair)) { |
mcimadamore@138 | 3352 | try { |
mcimadamore@138 | 3353 | visit(source, target); |
mcimadamore@138 | 3354 | } finally { |
mcimadamore@138 | 3355 | cache.remove(pair); |
duke@1 | 3356 | } |
duke@1 | 3357 | } |
duke@1 | 3358 | } |
mcimadamore@138 | 3359 | |
mcimadamore@138 | 3360 | private void adaptRecursive(List<Type> source, List<Type> target) { |
mcimadamore@138 | 3361 | if (source.length() == target.length()) { |
mcimadamore@138 | 3362 | while (source.nonEmpty()) { |
mcimadamore@138 | 3363 | adaptRecursive(source.head, target.head); |
mcimadamore@138 | 3364 | source = source.tail; |
mcimadamore@138 | 3365 | target = target.tail; |
mcimadamore@138 | 3366 | } |
duke@1 | 3367 | } |
duke@1 | 3368 | } |
duke@1 | 3369 | } |
duke@1 | 3370 | |
mcimadamore@138 | 3371 | public static class AdaptFailure extends RuntimeException { |
mcimadamore@138 | 3372 | static final long serialVersionUID = -7490231548272701566L; |
mcimadamore@138 | 3373 | } |
mcimadamore@138 | 3374 | |
duke@1 | 3375 | private void adaptSelf(Type t, |
duke@1 | 3376 | ListBuffer<Type> from, |
duke@1 | 3377 | ListBuffer<Type> to) { |
duke@1 | 3378 | try { |
duke@1 | 3379 | //if (t.tsym.type != t) |
duke@1 | 3380 | adapt(t.tsym.type, t, from, to); |
duke@1 | 3381 | } catch (AdaptFailure ex) { |
duke@1 | 3382 | // Adapt should never fail calculating a mapping from |
duke@1 | 3383 | // t.tsym.type to t as there can be no merge problem. |
duke@1 | 3384 | throw new AssertionError(ex); |
duke@1 | 3385 | } |
duke@1 | 3386 | } |
mcimadamore@138 | 3387 | // </editor-fold> |
duke@1 | 3388 | |
duke@1 | 3389 | /** |
duke@1 | 3390 | * Rewrite all type variables (universal quantifiers) in the given |
duke@1 | 3391 | * type to wildcards (existential quantifiers). This is used to |
duke@1 | 3392 | * determine if a cast is allowed. For example, if high is true |
duke@1 | 3393 | * and {@code T <: Number}, then {@code List<T>} is rewritten to |
duke@1 | 3394 | * {@code List<? extends Number>}. Since {@code List<Integer> <: |
duke@1 | 3395 | * List<? extends Number>} a {@code List<T>} can be cast to {@code |
duke@1 | 3396 | * List<Integer>} with a warning. |
duke@1 | 3397 | * @param t a type |
duke@1 | 3398 | * @param high if true return an upper bound; otherwise a lower |
duke@1 | 3399 | * bound |
duke@1 | 3400 | * @param rewriteTypeVars only rewrite captured wildcards if false; |
duke@1 | 3401 | * otherwise rewrite all type variables |
duke@1 | 3402 | * @return the type rewritten with wildcards (existential |
duke@1 | 3403 | * quantifiers) only |
duke@1 | 3404 | */ |
duke@1 | 3405 | private Type rewriteQuantifiers(Type t, boolean high, boolean rewriteTypeVars) { |
mcimadamore@157 | 3406 | return new Rewriter(high, rewriteTypeVars).rewrite(t); |
mcimadamore@157 | 3407 | } |
mcimadamore@157 | 3408 | |
mcimadamore@157 | 3409 | class Rewriter extends UnaryVisitor<Type> { |
mcimadamore@157 | 3410 | |
mcimadamore@157 | 3411 | boolean high; |
mcimadamore@157 | 3412 | boolean rewriteTypeVars; |
mcimadamore@157 | 3413 | |
mcimadamore@157 | 3414 | Rewriter(boolean high, boolean rewriteTypeVars) { |
mcimadamore@157 | 3415 | this.high = high; |
mcimadamore@157 | 3416 | this.rewriteTypeVars = rewriteTypeVars; |
mcimadamore@157 | 3417 | } |
mcimadamore@157 | 3418 | |
mcimadamore@157 | 3419 | Type rewrite(Type t) { |
mcimadamore@157 | 3420 | ListBuffer<Type> from = new ListBuffer<Type>(); |
mcimadamore@157 | 3421 | ListBuffer<Type> to = new ListBuffer<Type>(); |
mcimadamore@157 | 3422 | adaptSelf(t, from, to); |
mcimadamore@157 | 3423 | ListBuffer<Type> rewritten = new ListBuffer<Type>(); |
mcimadamore@157 | 3424 | List<Type> formals = from.toList(); |
mcimadamore@157 | 3425 | boolean changed = false; |
mcimadamore@157 | 3426 | for (Type arg : to.toList()) { |
mcimadamore@157 | 3427 | Type bound = visit(arg); |
mcimadamore@157 | 3428 | if (arg != bound) { |
mcimadamore@157 | 3429 | changed = true; |
mcimadamore@157 | 3430 | bound = high ? makeExtendsWildcard(bound, (TypeVar)formals.head) |
mcimadamore@157 | 3431 | : makeSuperWildcard(bound, (TypeVar)formals.head); |
mcimadamore@157 | 3432 | } |
mcimadamore@157 | 3433 | rewritten.append(bound); |
mcimadamore@157 | 3434 | formals = formals.tail; |
duke@1 | 3435 | } |
mcimadamore@157 | 3436 | if (changed) |
mcimadamore@157 | 3437 | return subst(t.tsym.type, from.toList(), rewritten.toList()); |
mcimadamore@157 | 3438 | else |
mcimadamore@157 | 3439 | return t; |
duke@1 | 3440 | } |
mcimadamore@157 | 3441 | |
mcimadamore@157 | 3442 | public Type visitType(Type t, Void s) { |
mcimadamore@157 | 3443 | return high ? upperBound(t) : lowerBound(t); |
mcimadamore@157 | 3444 | } |
mcimadamore@157 | 3445 | |
mcimadamore@157 | 3446 | @Override |
mcimadamore@157 | 3447 | public Type visitCapturedType(CapturedType t, Void s) { |
mcimadamore@157 | 3448 | return visitWildcardType(t.wildcard, null); |
mcimadamore@157 | 3449 | } |
mcimadamore@157 | 3450 | |
mcimadamore@157 | 3451 | @Override |
mcimadamore@157 | 3452 | public Type visitTypeVar(TypeVar t, Void s) { |
mcimadamore@157 | 3453 | if (rewriteTypeVars) |
mcimadamore@157 | 3454 | return high ? t.bound : syms.botType; |
mcimadamore@157 | 3455 | else |
mcimadamore@157 | 3456 | return t; |
mcimadamore@157 | 3457 | } |
mcimadamore@157 | 3458 | |
mcimadamore@157 | 3459 | @Override |
mcimadamore@157 | 3460 | public Type visitWildcardType(WildcardType t, Void s) { |
mcimadamore@157 | 3461 | Type bound = high ? t.getExtendsBound() : |
mcimadamore@157 | 3462 | t.getSuperBound(); |
mcimadamore@157 | 3463 | if (bound == null) |
mcimadamore@157 | 3464 | bound = high ? syms.objectType : syms.botType; |
mcimadamore@157 | 3465 | return bound; |
mcimadamore@157 | 3466 | } |
duke@1 | 3467 | } |
duke@1 | 3468 | |
duke@1 | 3469 | /** |
duke@1 | 3470 | * Create a wildcard with the given upper (extends) bound; create |
duke@1 | 3471 | * an unbounded wildcard if bound is Object. |
duke@1 | 3472 | * |
duke@1 | 3473 | * @param bound the upper bound |
duke@1 | 3474 | * @param formal the formal type parameter that will be |
duke@1 | 3475 | * substituted by the wildcard |
duke@1 | 3476 | */ |
duke@1 | 3477 | private WildcardType makeExtendsWildcard(Type bound, TypeVar formal) { |
duke@1 | 3478 | if (bound == syms.objectType) { |
duke@1 | 3479 | return new WildcardType(syms.objectType, |
duke@1 | 3480 | BoundKind.UNBOUND, |
duke@1 | 3481 | syms.boundClass, |
duke@1 | 3482 | formal); |
duke@1 | 3483 | } else { |
duke@1 | 3484 | return new WildcardType(bound, |
duke@1 | 3485 | BoundKind.EXTENDS, |
duke@1 | 3486 | syms.boundClass, |
duke@1 | 3487 | formal); |
duke@1 | 3488 | } |
duke@1 | 3489 | } |
duke@1 | 3490 | |
duke@1 | 3491 | /** |
duke@1 | 3492 | * Create a wildcard with the given lower (super) bound; create an |
duke@1 | 3493 | * unbounded wildcard if bound is bottom (type of {@code null}). |
duke@1 | 3494 | * |
duke@1 | 3495 | * @param bound the lower bound |
duke@1 | 3496 | * @param formal the formal type parameter that will be |
duke@1 | 3497 | * substituted by the wildcard |
duke@1 | 3498 | */ |
duke@1 | 3499 | private WildcardType makeSuperWildcard(Type bound, TypeVar formal) { |
duke@1 | 3500 | if (bound.tag == BOT) { |
duke@1 | 3501 | return new WildcardType(syms.objectType, |
duke@1 | 3502 | BoundKind.UNBOUND, |
duke@1 | 3503 | syms.boundClass, |
duke@1 | 3504 | formal); |
duke@1 | 3505 | } else { |
duke@1 | 3506 | return new WildcardType(bound, |
duke@1 | 3507 | BoundKind.SUPER, |
duke@1 | 3508 | syms.boundClass, |
duke@1 | 3509 | formal); |
duke@1 | 3510 | } |
duke@1 | 3511 | } |
duke@1 | 3512 | |
duke@1 | 3513 | /** |
duke@1 | 3514 | * A wrapper for a type that allows use in sets. |
duke@1 | 3515 | */ |
duke@1 | 3516 | class SingletonType { |
duke@1 | 3517 | final Type t; |
duke@1 | 3518 | SingletonType(Type t) { |
duke@1 | 3519 | this.t = t; |
duke@1 | 3520 | } |
duke@1 | 3521 | public int hashCode() { |
duke@1 | 3522 | return Types.this.hashCode(t); |
duke@1 | 3523 | } |
duke@1 | 3524 | public boolean equals(Object obj) { |
duke@1 | 3525 | return (obj instanceof SingletonType) && |
duke@1 | 3526 | isSameType(t, ((SingletonType)obj).t); |
duke@1 | 3527 | } |
duke@1 | 3528 | public String toString() { |
duke@1 | 3529 | return t.toString(); |
duke@1 | 3530 | } |
duke@1 | 3531 | } |
duke@1 | 3532 | // </editor-fold> |
duke@1 | 3533 | |
duke@1 | 3534 | // <editor-fold defaultstate="collapsed" desc="Visitors"> |
duke@1 | 3535 | /** |
duke@1 | 3536 | * A default visitor for types. All visitor methods except |
duke@1 | 3537 | * visitType are implemented by delegating to visitType. Concrete |
duke@1 | 3538 | * subclasses must provide an implementation of visitType and can |
duke@1 | 3539 | * override other methods as needed. |
duke@1 | 3540 | * |
duke@1 | 3541 | * @param <R> the return type of the operation implemented by this |
duke@1 | 3542 | * visitor; use Void if no return type is needed. |
duke@1 | 3543 | * @param <S> the type of the second argument (the first being the |
duke@1 | 3544 | * type itself) of the operation implemented by this visitor; use |
duke@1 | 3545 | * Void if a second argument is not needed. |
duke@1 | 3546 | */ |
duke@1 | 3547 | public static abstract class DefaultTypeVisitor<R,S> implements Type.Visitor<R,S> { |
duke@1 | 3548 | final public R visit(Type t, S s) { return t.accept(this, s); } |
duke@1 | 3549 | public R visitClassType(ClassType t, S s) { return visitType(t, s); } |
duke@1 | 3550 | public R visitWildcardType(WildcardType t, S s) { return visitType(t, s); } |
duke@1 | 3551 | public R visitArrayType(ArrayType t, S s) { return visitType(t, s); } |
duke@1 | 3552 | public R visitMethodType(MethodType t, S s) { return visitType(t, s); } |
duke@1 | 3553 | public R visitPackageType(PackageType t, S s) { return visitType(t, s); } |
duke@1 | 3554 | public R visitTypeVar(TypeVar t, S s) { return visitType(t, s); } |
duke@1 | 3555 | public R visitCapturedType(CapturedType t, S s) { return visitType(t, s); } |
duke@1 | 3556 | public R visitForAll(ForAll t, S s) { return visitType(t, s); } |
duke@1 | 3557 | public R visitUndetVar(UndetVar t, S s) { return visitType(t, s); } |
duke@1 | 3558 | public R visitErrorType(ErrorType t, S s) { return visitType(t, s); } |
duke@1 | 3559 | } |
duke@1 | 3560 | |
duke@1 | 3561 | /** |
mcimadamore@121 | 3562 | * A default visitor for symbols. All visitor methods except |
mcimadamore@121 | 3563 | * visitSymbol are implemented by delegating to visitSymbol. Concrete |
mcimadamore@121 | 3564 | * subclasses must provide an implementation of visitSymbol and can |
mcimadamore@121 | 3565 | * override other methods as needed. |
mcimadamore@121 | 3566 | * |
mcimadamore@121 | 3567 | * @param <R> the return type of the operation implemented by this |
mcimadamore@121 | 3568 | * visitor; use Void if no return type is needed. |
mcimadamore@121 | 3569 | * @param <S> the type of the second argument (the first being the |
mcimadamore@121 | 3570 | * symbol itself) of the operation implemented by this visitor; use |
mcimadamore@121 | 3571 | * Void if a second argument is not needed. |
mcimadamore@121 | 3572 | */ |
mcimadamore@121 | 3573 | public static abstract class DefaultSymbolVisitor<R,S> implements Symbol.Visitor<R,S> { |
mcimadamore@121 | 3574 | final public R visit(Symbol s, S arg) { return s.accept(this, arg); } |
mcimadamore@121 | 3575 | public R visitClassSymbol(ClassSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3576 | public R visitMethodSymbol(MethodSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3577 | public R visitOperatorSymbol(OperatorSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3578 | public R visitPackageSymbol(PackageSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3579 | public R visitTypeSymbol(TypeSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3580 | public R visitVarSymbol(VarSymbol s, S arg) { return visitSymbol(s, arg); } |
mcimadamore@121 | 3581 | } |
mcimadamore@121 | 3582 | |
mcimadamore@121 | 3583 | /** |
duke@1 | 3584 | * A <em>simple</em> visitor for types. This visitor is simple as |
duke@1 | 3585 | * captured wildcards, for-all types (generic methods), and |
duke@1 | 3586 | * undetermined type variables (part of inference) are hidden. |
duke@1 | 3587 | * Captured wildcards are hidden by treating them as type |
duke@1 | 3588 | * variables and the rest are hidden by visiting their qtypes. |
duke@1 | 3589 | * |
duke@1 | 3590 | * @param <R> the return type of the operation implemented by this |
duke@1 | 3591 | * visitor; use Void if no return type is needed. |
duke@1 | 3592 | * @param <S> the type of the second argument (the first being the |
duke@1 | 3593 | * type itself) of the operation implemented by this visitor; use |
duke@1 | 3594 | * Void if a second argument is not needed. |
duke@1 | 3595 | */ |
duke@1 | 3596 | public static abstract class SimpleVisitor<R,S> extends DefaultTypeVisitor<R,S> { |
duke@1 | 3597 | @Override |
duke@1 | 3598 | public R visitCapturedType(CapturedType t, S s) { |
duke@1 | 3599 | return visitTypeVar(t, s); |
duke@1 | 3600 | } |
duke@1 | 3601 | @Override |
duke@1 | 3602 | public R visitForAll(ForAll t, S s) { |
duke@1 | 3603 | return visit(t.qtype, s); |
duke@1 | 3604 | } |
duke@1 | 3605 | @Override |
duke@1 | 3606 | public R visitUndetVar(UndetVar t, S s) { |
duke@1 | 3607 | return visit(t.qtype, s); |
duke@1 | 3608 | } |
duke@1 | 3609 | } |
duke@1 | 3610 | |
duke@1 | 3611 | /** |
duke@1 | 3612 | * A plain relation on types. That is a 2-ary function on the |
duke@1 | 3613 | * form Type × Type → Boolean. |
duke@1 | 3614 | * <!-- In plain text: Type x Type -> Boolean --> |
duke@1 | 3615 | */ |
duke@1 | 3616 | public static abstract class TypeRelation extends SimpleVisitor<Boolean,Type> {} |
duke@1 | 3617 | |
duke@1 | 3618 | /** |
duke@1 | 3619 | * A convenience visitor for implementing operations that only |
duke@1 | 3620 | * require one argument (the type itself), that is, unary |
duke@1 | 3621 | * operations. |
duke@1 | 3622 | * |
duke@1 | 3623 | * @param <R> the return type of the operation implemented by this |
duke@1 | 3624 | * visitor; use Void if no return type is needed. |
duke@1 | 3625 | */ |
duke@1 | 3626 | public static abstract class UnaryVisitor<R> extends SimpleVisitor<R,Void> { |
duke@1 | 3627 | final public R visit(Type t) { return t.accept(this, null); } |
duke@1 | 3628 | } |
duke@1 | 3629 | |
duke@1 | 3630 | /** |
duke@1 | 3631 | * A visitor for implementing a mapping from types to types. The |
duke@1 | 3632 | * default behavior of this class is to implement the identity |
duke@1 | 3633 | * mapping (mapping a type to itself). This can be overridden in |
duke@1 | 3634 | * subclasses. |
duke@1 | 3635 | * |
duke@1 | 3636 | * @param <S> the type of the second argument (the first being the |
duke@1 | 3637 | * type itself) of this mapping; use Void if a second argument is |
duke@1 | 3638 | * not needed. |
duke@1 | 3639 | */ |
duke@1 | 3640 | public static class MapVisitor<S> extends DefaultTypeVisitor<Type,S> { |
duke@1 | 3641 | final public Type visit(Type t) { return t.accept(this, null); } |
duke@1 | 3642 | public Type visitType(Type t, S s) { return t; } |
duke@1 | 3643 | } |
duke@1 | 3644 | // </editor-fold> |
duke@1 | 3645 | } |