Fri, 14 Jan 2011 09:45:04 +0000
6992698: JSR 292: remove support for transient syntax in polymorphic signature calls
Summary: special syntax to denote indy return type through type parameters should be removed (and cast shall be used instead)
Reviewed-by: jjg, jrose
duke@1 | 1 | /* |
ohair@798 | 2 | * Copyright (c) 1999, 2010, Oracle and/or its affiliates. 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 |
ohair@554 | 7 | * published by the Free Software Foundation. Oracle designates this |
duke@1 | 8 | * particular file as subject to the "Classpath" exception as provided |
ohair@554 | 9 | * by Oracle 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 | * |
ohair@554 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
ohair@554 | 22 | * or visit www.oracle.com if you need additional information or have any |
ohair@554 | 23 | * questions. |
duke@1 | 24 | */ |
duke@1 | 25 | |
duke@1 | 26 | package com.sun.tools.javac.comp; |
duke@1 | 27 | |
mcimadamore@674 | 28 | import com.sun.tools.javac.tree.JCTree; |
mcimadamore@674 | 29 | import com.sun.tools.javac.tree.JCTree.JCTypeCast; |
mcimadamore@820 | 30 | import com.sun.tools.javac.tree.TreeInfo; |
duke@1 | 31 | import com.sun.tools.javac.util.*; |
duke@1 | 32 | import com.sun.tools.javac.util.List; |
duke@1 | 33 | import com.sun.tools.javac.code.*; |
duke@1 | 34 | import com.sun.tools.javac.code.Type.*; |
mcimadamore@396 | 35 | import com.sun.tools.javac.code.Type.ForAll.ConstraintKind; |
mcimadamore@299 | 36 | import com.sun.tools.javac.code.Symbol.*; |
mcimadamore@89 | 37 | import com.sun.tools.javac.util.JCDiagnostic; |
duke@1 | 38 | |
duke@1 | 39 | import static com.sun.tools.javac.code.TypeTags.*; |
duke@1 | 40 | |
duke@1 | 41 | /** Helper class for type parameter inference, used by the attribution phase. |
duke@1 | 42 | * |
jjg@581 | 43 | * <p><b>This is NOT part of any supported API. |
jjg@581 | 44 | * If you write code that depends on this, you do so at your own risk. |
duke@1 | 45 | * This code and its internal interfaces are subject to change or |
duke@1 | 46 | * deletion without notice.</b> |
duke@1 | 47 | */ |
duke@1 | 48 | public class Infer { |
duke@1 | 49 | protected static final Context.Key<Infer> inferKey = |
duke@1 | 50 | new Context.Key<Infer>(); |
duke@1 | 51 | |
duke@1 | 52 | /** A value for prototypes that admit any type, including polymorphic ones. */ |
duke@1 | 53 | public static final Type anyPoly = new Type(NONE, null); |
duke@1 | 54 | |
duke@1 | 55 | Symtab syms; |
duke@1 | 56 | Types types; |
mcimadamore@396 | 57 | Check chk; |
mcimadamore@299 | 58 | Resolve rs; |
mcimadamore@89 | 59 | JCDiagnostic.Factory diags; |
duke@1 | 60 | |
duke@1 | 61 | public static Infer instance(Context context) { |
duke@1 | 62 | Infer instance = context.get(inferKey); |
duke@1 | 63 | if (instance == null) |
duke@1 | 64 | instance = new Infer(context); |
duke@1 | 65 | return instance; |
duke@1 | 66 | } |
duke@1 | 67 | |
duke@1 | 68 | protected Infer(Context context) { |
duke@1 | 69 | context.put(inferKey, this); |
duke@1 | 70 | syms = Symtab.instance(context); |
duke@1 | 71 | types = Types.instance(context); |
mcimadamore@299 | 72 | rs = Resolve.instance(context); |
mcimadamore@396 | 73 | chk = Check.instance(context); |
mcimadamore@89 | 74 | diags = JCDiagnostic.Factory.instance(context); |
mcimadamore@89 | 75 | ambiguousNoInstanceException = |
mcimadamore@89 | 76 | new NoInstanceException(true, diags); |
mcimadamore@89 | 77 | unambiguousNoInstanceException = |
mcimadamore@89 | 78 | new NoInstanceException(false, diags); |
mcimadamore@299 | 79 | invalidInstanceException = |
mcimadamore@299 | 80 | new InvalidInstanceException(diags); |
mcimadamore@299 | 81 | |
duke@1 | 82 | } |
duke@1 | 83 | |
mcimadamore@689 | 84 | public static class InferenceException extends Resolve.InapplicableMethodException { |
duke@1 | 85 | private static final long serialVersionUID = 0; |
duke@1 | 86 | |
mcimadamore@299 | 87 | InferenceException(JCDiagnostic.Factory diags) { |
mcimadamore@689 | 88 | super(diags); |
duke@1 | 89 | } |
mcimadamore@299 | 90 | } |
mcimadamore@299 | 91 | |
mcimadamore@299 | 92 | public static class NoInstanceException extends InferenceException { |
mcimadamore@299 | 93 | private static final long serialVersionUID = 1; |
mcimadamore@299 | 94 | |
mcimadamore@299 | 95 | boolean isAmbiguous; // exist several incomparable best instances? |
mcimadamore@299 | 96 | |
mcimadamore@299 | 97 | NoInstanceException(boolean isAmbiguous, JCDiagnostic.Factory diags) { |
mcimadamore@299 | 98 | super(diags); |
mcimadamore@299 | 99 | this.isAmbiguous = isAmbiguous; |
duke@1 | 100 | } |
duke@1 | 101 | } |
mcimadamore@299 | 102 | |
mcimadamore@299 | 103 | public static class InvalidInstanceException extends InferenceException { |
mcimadamore@299 | 104 | private static final long serialVersionUID = 2; |
mcimadamore@299 | 105 | |
mcimadamore@299 | 106 | InvalidInstanceException(JCDiagnostic.Factory diags) { |
mcimadamore@299 | 107 | super(diags); |
mcimadamore@299 | 108 | } |
mcimadamore@299 | 109 | } |
mcimadamore@299 | 110 | |
mcimadamore@89 | 111 | private final NoInstanceException ambiguousNoInstanceException; |
mcimadamore@89 | 112 | private final NoInstanceException unambiguousNoInstanceException; |
mcimadamore@299 | 113 | private final InvalidInstanceException invalidInstanceException; |
duke@1 | 114 | |
duke@1 | 115 | /*************************************************************************** |
duke@1 | 116 | * Auxiliary type values and classes |
duke@1 | 117 | ***************************************************************************/ |
duke@1 | 118 | |
duke@1 | 119 | /** A mapping that turns type variables into undetermined type variables. |
duke@1 | 120 | */ |
duke@1 | 121 | Mapping fromTypeVarFun = new Mapping("fromTypeVarFun") { |
duke@1 | 122 | public Type apply(Type t) { |
duke@1 | 123 | if (t.tag == TYPEVAR) return new UndetVar(t); |
duke@1 | 124 | else return t.map(this); |
duke@1 | 125 | } |
duke@1 | 126 | }; |
duke@1 | 127 | |
duke@1 | 128 | /** A mapping that returns its type argument with every UndetVar replaced |
duke@1 | 129 | * by its `inst' field. Throws a NoInstanceException |
duke@1 | 130 | * if this not possible because an `inst' field is null. |
mcimadamore@635 | 131 | * Note: mutually referring undertvars will be left uninstantiated |
mcimadamore@635 | 132 | * (that is, they will be replaced by the underlying type-variable). |
duke@1 | 133 | */ |
mcimadamore@635 | 134 | |
duke@1 | 135 | Mapping getInstFun = new Mapping("getInstFun") { |
duke@1 | 136 | public Type apply(Type t) { |
duke@1 | 137 | switch (t.tag) { |
mcimadamore@635 | 138 | case UNKNOWN: |
duke@1 | 139 | throw ambiguousNoInstanceException |
mcimadamore@635 | 140 | .setMessage("undetermined.type"); |
mcimadamore@635 | 141 | case UNDETVAR: |
mcimadamore@635 | 142 | UndetVar that = (UndetVar) t; |
mcimadamore@635 | 143 | if (that.inst == null) |
mcimadamore@635 | 144 | throw ambiguousNoInstanceException |
mcimadamore@635 | 145 | .setMessage("type.variable.has.undetermined.type", |
mcimadamore@635 | 146 | that.qtype); |
mcimadamore@635 | 147 | return isConstraintCyclic(that) ? |
mcimadamore@635 | 148 | that.qtype : |
mcimadamore@635 | 149 | apply(that.inst); |
mcimadamore@635 | 150 | default: |
mcimadamore@635 | 151 | return t.map(this); |
duke@1 | 152 | } |
duke@1 | 153 | } |
mcimadamore@635 | 154 | |
mcimadamore@635 | 155 | private boolean isConstraintCyclic(UndetVar uv) { |
mcimadamore@635 | 156 | Types.UnaryVisitor<Boolean> constraintScanner = |
mcimadamore@635 | 157 | new Types.UnaryVisitor<Boolean>() { |
mcimadamore@635 | 158 | |
mcimadamore@635 | 159 | List<Type> seen = List.nil(); |
mcimadamore@635 | 160 | |
mcimadamore@635 | 161 | Boolean visit(List<Type> ts) { |
mcimadamore@635 | 162 | for (Type t : ts) { |
mcimadamore@635 | 163 | if (visit(t)) return true; |
mcimadamore@635 | 164 | } |
mcimadamore@635 | 165 | return false; |
mcimadamore@635 | 166 | } |
mcimadamore@635 | 167 | |
mcimadamore@635 | 168 | public Boolean visitType(Type t, Void ignored) { |
mcimadamore@635 | 169 | return false; |
mcimadamore@635 | 170 | } |
mcimadamore@635 | 171 | |
mcimadamore@635 | 172 | @Override |
mcimadamore@635 | 173 | public Boolean visitClassType(ClassType t, Void ignored) { |
mcimadamore@635 | 174 | if (t.isCompound()) { |
mcimadamore@635 | 175 | return visit(types.supertype(t)) || |
mcimadamore@635 | 176 | visit(types.interfaces(t)); |
mcimadamore@635 | 177 | } else { |
mcimadamore@635 | 178 | return visit(t.getTypeArguments()); |
mcimadamore@635 | 179 | } |
mcimadamore@635 | 180 | } |
mcimadamore@635 | 181 | @Override |
mcimadamore@635 | 182 | public Boolean visitWildcardType(WildcardType t, Void ignored) { |
mcimadamore@635 | 183 | return visit(t.type); |
mcimadamore@635 | 184 | } |
mcimadamore@635 | 185 | |
mcimadamore@635 | 186 | @Override |
mcimadamore@635 | 187 | public Boolean visitUndetVar(UndetVar t, Void ignored) { |
mcimadamore@635 | 188 | if (seen.contains(t)) { |
mcimadamore@635 | 189 | return true; |
mcimadamore@635 | 190 | } else { |
mcimadamore@635 | 191 | seen = seen.prepend(t); |
mcimadamore@635 | 192 | return visit(t.inst); |
mcimadamore@635 | 193 | } |
mcimadamore@635 | 194 | } |
mcimadamore@635 | 195 | }; |
mcimadamore@635 | 196 | return constraintScanner.visit(uv); |
mcimadamore@635 | 197 | } |
duke@1 | 198 | }; |
duke@1 | 199 | |
duke@1 | 200 | /*************************************************************************** |
duke@1 | 201 | * Mini/Maximization of UndetVars |
duke@1 | 202 | ***************************************************************************/ |
duke@1 | 203 | |
duke@1 | 204 | /** Instantiate undetermined type variable to its minimal upper bound. |
duke@1 | 205 | * Throw a NoInstanceException if this not possible. |
duke@1 | 206 | */ |
duke@1 | 207 | void maximizeInst(UndetVar that, Warner warn) throws NoInstanceException { |
duke@1 | 208 | if (that.inst == null) { |
duke@1 | 209 | if (that.hibounds.isEmpty()) |
duke@1 | 210 | that.inst = syms.objectType; |
duke@1 | 211 | else if (that.hibounds.tail.isEmpty()) |
duke@1 | 212 | that.inst = that.hibounds.head; |
mcimadamore@210 | 213 | else |
mcimadamore@210 | 214 | that.inst = types.glb(that.hibounds); |
duke@1 | 215 | } |
mcimadamore@210 | 216 | if (that.inst == null || |
mcimadamore@298 | 217 | that.inst.isErroneous()) |
mcimadamore@210 | 218 | throw ambiguousNoInstanceException |
mcimadamore@210 | 219 | .setMessage("no.unique.maximal.instance.exists", |
mcimadamore@210 | 220 | that.qtype, that.hibounds); |
duke@1 | 221 | } |
duke@1 | 222 | //where |
duke@1 | 223 | private boolean isSubClass(Type t, final List<Type> ts) { |
duke@1 | 224 | t = t.baseType(); |
duke@1 | 225 | if (t.tag == TYPEVAR) { |
duke@1 | 226 | List<Type> bounds = types.getBounds((TypeVar)t); |
duke@1 | 227 | for (Type s : ts) { |
duke@1 | 228 | if (!types.isSameType(t, s.baseType())) { |
duke@1 | 229 | for (Type bound : bounds) { |
duke@1 | 230 | if (!isSubClass(bound, List.of(s.baseType()))) |
duke@1 | 231 | return false; |
duke@1 | 232 | } |
duke@1 | 233 | } |
duke@1 | 234 | } |
duke@1 | 235 | } else { |
duke@1 | 236 | for (Type s : ts) { |
duke@1 | 237 | if (!t.tsym.isSubClass(s.baseType().tsym, types)) |
duke@1 | 238 | return false; |
duke@1 | 239 | } |
duke@1 | 240 | } |
duke@1 | 241 | return true; |
duke@1 | 242 | } |
duke@1 | 243 | |
jjg@110 | 244 | /** Instantiate undetermined type variable to the lub of all its lower bounds. |
duke@1 | 245 | * Throw a NoInstanceException if this not possible. |
duke@1 | 246 | */ |
duke@1 | 247 | void minimizeInst(UndetVar that, Warner warn) throws NoInstanceException { |
duke@1 | 248 | if (that.inst == null) { |
duke@1 | 249 | if (that.lobounds.isEmpty()) |
duke@1 | 250 | that.inst = syms.botType; |
duke@1 | 251 | else if (that.lobounds.tail.isEmpty()) |
mcimadamore@5 | 252 | that.inst = that.lobounds.head.isPrimitive() ? syms.errType : that.lobounds.head; |
duke@1 | 253 | else { |
duke@1 | 254 | that.inst = types.lub(that.lobounds); |
mcimadamore@5 | 255 | } |
jjg@110 | 256 | if (that.inst == null || that.inst.tag == ERROR) |
duke@1 | 257 | throw ambiguousNoInstanceException |
duke@1 | 258 | .setMessage("no.unique.minimal.instance.exists", |
duke@1 | 259 | that.qtype, that.lobounds); |
duke@1 | 260 | // VGJ: sort of inlined maximizeInst() below. Adding |
duke@1 | 261 | // bounds can cause lobounds that are above hibounds. |
duke@1 | 262 | if (that.hibounds.isEmpty()) |
duke@1 | 263 | return; |
duke@1 | 264 | Type hb = null; |
duke@1 | 265 | if (that.hibounds.tail.isEmpty()) |
duke@1 | 266 | hb = that.hibounds.head; |
duke@1 | 267 | else for (List<Type> bs = that.hibounds; |
duke@1 | 268 | bs.nonEmpty() && hb == null; |
duke@1 | 269 | bs = bs.tail) { |
duke@1 | 270 | if (isSubClass(bs.head, that.hibounds)) |
duke@1 | 271 | hb = types.fromUnknownFun.apply(bs.head); |
duke@1 | 272 | } |
duke@1 | 273 | if (hb == null || |
duke@1 | 274 | !types.isSubtypeUnchecked(hb, that.hibounds, warn) || |
duke@1 | 275 | !types.isSubtypeUnchecked(that.inst, hb, warn)) |
duke@1 | 276 | throw ambiguousNoInstanceException; |
duke@1 | 277 | } |
duke@1 | 278 | } |
duke@1 | 279 | |
duke@1 | 280 | /*************************************************************************** |
duke@1 | 281 | * Exported Methods |
duke@1 | 282 | ***************************************************************************/ |
duke@1 | 283 | |
duke@1 | 284 | /** Try to instantiate expression type `that' to given type `to'. |
duke@1 | 285 | * If a maximal instantiation exists which makes this type |
duke@1 | 286 | * a subtype of type `to', return the instantiated type. |
duke@1 | 287 | * If no instantiation exists, or if several incomparable |
duke@1 | 288 | * best instantiations exist throw a NoInstanceException. |
duke@1 | 289 | */ |
duke@1 | 290 | public Type instantiateExpr(ForAll that, |
duke@1 | 291 | Type to, |
mcimadamore@299 | 292 | Warner warn) throws InferenceException { |
duke@1 | 293 | List<Type> undetvars = Type.map(that.tvars, fromTypeVarFun); |
duke@1 | 294 | for (List<Type> l = undetvars; l.nonEmpty(); l = l.tail) { |
mcimadamore@396 | 295 | UndetVar uv = (UndetVar) l.head; |
mcimadamore@396 | 296 | TypeVar tv = (TypeVar)uv.qtype; |
duke@1 | 297 | ListBuffer<Type> hibounds = new ListBuffer<Type>(); |
mcimadamore@615 | 298 | for (Type t : that.getConstraints(tv, ConstraintKind.EXTENDS)) { |
mcimadamore@635 | 299 | hibounds.append(types.subst(t, that.tvars, undetvars)); |
duke@1 | 300 | } |
mcimadamore@635 | 301 | |
mcimadamore@396 | 302 | List<Type> inst = that.getConstraints(tv, ConstraintKind.EQUAL); |
mcimadamore@396 | 303 | if (inst.nonEmpty() && inst.head.tag != BOT) { |
mcimadamore@396 | 304 | uv.inst = inst.head; |
mcimadamore@396 | 305 | } |
mcimadamore@396 | 306 | uv.hibounds = hibounds.toList(); |
duke@1 | 307 | } |
duke@1 | 308 | Type qtype1 = types.subst(that.qtype, that.tvars, undetvars); |
mcimadamore@753 | 309 | if (!types.isSubtype(qtype1, |
mcimadamore@753 | 310 | qtype1.tag == UNDETVAR ? types.boxedTypeOrType(to) : to)) { |
duke@1 | 311 | throw unambiguousNoInstanceException |
mcimadamore@689 | 312 | .setMessage("infer.no.conforming.instance.exists", |
duke@1 | 313 | that.tvars, that.qtype, to); |
duke@1 | 314 | } |
duke@1 | 315 | for (List<Type> l = undetvars; l.nonEmpty(); l = l.tail) |
duke@1 | 316 | maximizeInst((UndetVar) l.head, warn); |
duke@1 | 317 | // System.out.println(" = " + qtype1.map(getInstFun));//DEBUG |
duke@1 | 318 | |
duke@1 | 319 | // check bounds |
duke@1 | 320 | List<Type> targs = Type.map(undetvars, getInstFun); |
mcimadamore@635 | 321 | if (Type.containsAny(targs, that.tvars)) { |
mcimadamore@635 | 322 | //replace uninferred type-vars |
mcimadamore@635 | 323 | targs = types.subst(targs, |
mcimadamore@635 | 324 | that.tvars, |
mcimadamore@635 | 325 | instaniateAsUninferredVars(undetvars, that.tvars)); |
mcimadamore@635 | 326 | } |
mcimadamore@396 | 327 | return chk.checkType(warn.pos(), that.inst(targs, types), to); |
duke@1 | 328 | } |
mcimadamore@635 | 329 | //where |
mcimadamore@635 | 330 | private List<Type> instaniateAsUninferredVars(List<Type> undetvars, List<Type> tvars) { |
mcimadamore@635 | 331 | ListBuffer<Type> new_targs = ListBuffer.lb(); |
mcimadamore@635 | 332 | //step 1 - create syntethic captured vars |
mcimadamore@635 | 333 | for (Type t : undetvars) { |
mcimadamore@635 | 334 | UndetVar uv = (UndetVar)t; |
mcimadamore@635 | 335 | Type newArg = new CapturedType(t.tsym.name, t.tsym, uv.inst, syms.botType, null); |
mcimadamore@635 | 336 | new_targs = new_targs.append(newArg); |
mcimadamore@635 | 337 | } |
mcimadamore@635 | 338 | //step 2 - replace synthetic vars in their bounds |
mcimadamore@635 | 339 | for (Type t : new_targs.toList()) { |
mcimadamore@635 | 340 | CapturedType ct = (CapturedType)t; |
mcimadamore@635 | 341 | ct.bound = types.subst(ct.bound, tvars, new_targs.toList()); |
mcimadamore@635 | 342 | WildcardType wt = new WildcardType(ct.bound, BoundKind.EXTENDS, syms.boundClass); |
mcimadamore@635 | 343 | ct.wildcard = wt; |
mcimadamore@635 | 344 | } |
mcimadamore@635 | 345 | return new_targs.toList(); |
mcimadamore@635 | 346 | } |
duke@1 | 347 | |
duke@1 | 348 | /** Instantiate method type `mt' by finding instantiations of |
duke@1 | 349 | * `tvars' so that method can be applied to `argtypes'. |
duke@1 | 350 | */ |
mcimadamore@547 | 351 | public Type instantiateMethod(final Env<AttrContext> env, |
mcimadamore@547 | 352 | List<Type> tvars, |
duke@1 | 353 | MethodType mt, |
mcimadamore@580 | 354 | final Symbol msym, |
mcimadamore@299 | 355 | final List<Type> argtypes, |
mcimadamore@299 | 356 | final boolean allowBoxing, |
mcimadamore@299 | 357 | final boolean useVarargs, |
mcimadamore@299 | 358 | final Warner warn) throws InferenceException { |
duke@1 | 359 | //-System.err.println("instantiateMethod(" + tvars + ", " + mt + ", " + argtypes + ")"); //DEBUG |
duke@1 | 360 | List<Type> undetvars = Type.map(tvars, fromTypeVarFun); |
duke@1 | 361 | List<Type> formals = mt.argtypes; |
mcimadamore@299 | 362 | //need to capture exactly once - otherwise subsequent |
mcimadamore@299 | 363 | //applicability checks might fail |
mcimadamore@299 | 364 | final List<Type> capturedArgs = types.capture(argtypes); |
mcimadamore@299 | 365 | List<Type> actuals = capturedArgs; |
mcimadamore@299 | 366 | List<Type> actualsNoCapture = argtypes; |
duke@1 | 367 | // instantiate all polymorphic argument types and |
duke@1 | 368 | // set up lower bounds constraints for undetvars |
duke@1 | 369 | Type varargsFormal = useVarargs ? formals.last() : null; |
mcimadamore@689 | 370 | if (varargsFormal == null && |
mcimadamore@689 | 371 | actuals.size() != formals.size()) { |
mcimadamore@689 | 372 | throw unambiguousNoInstanceException |
mcimadamore@689 | 373 | .setMessage("infer.arg.length.mismatch"); |
mcimadamore@689 | 374 | } |
mcimadamore@299 | 375 | while (actuals.nonEmpty() && formals.head != varargsFormal) { |
mcimadamore@299 | 376 | Type formal = formals.head; |
mcimadamore@299 | 377 | Type actual = actuals.head.baseType(); |
mcimadamore@299 | 378 | Type actualNoCapture = actualsNoCapture.head.baseType(); |
mcimadamore@299 | 379 | if (actual.tag == FORALL) |
mcimadamore@299 | 380 | actual = instantiateArg((ForAll)actual, formal, tvars, warn); |
mcimadamore@299 | 381 | Type undetFormal = types.subst(formal, tvars, undetvars); |
duke@1 | 382 | boolean works = allowBoxing |
mcimadamore@299 | 383 | ? types.isConvertible(actual, undetFormal, warn) |
mcimadamore@299 | 384 | : types.isSubtypeUnchecked(actual, undetFormal, warn); |
duke@1 | 385 | if (!works) { |
duke@1 | 386 | throw unambiguousNoInstanceException |
mcimadamore@689 | 387 | .setMessage("infer.no.conforming.assignment.exists", |
mcimadamore@299 | 388 | tvars, actualNoCapture, formal); |
duke@1 | 389 | } |
duke@1 | 390 | formals = formals.tail; |
mcimadamore@299 | 391 | actuals = actuals.tail; |
mcimadamore@299 | 392 | actualsNoCapture = actualsNoCapture.tail; |
duke@1 | 393 | } |
mcimadamore@689 | 394 | |
mcimadamore@689 | 395 | if (formals.head != varargsFormal) // not enough args |
mcimadamore@689 | 396 | throw unambiguousNoInstanceException.setMessage("infer.arg.length.mismatch"); |
duke@1 | 397 | |
duke@1 | 398 | // for varargs arguments as well |
duke@1 | 399 | if (useVarargs) { |
mcimadamore@299 | 400 | Type elemType = types.elemtype(varargsFormal); |
mcimadamore@299 | 401 | Type elemUndet = types.subst(elemType, tvars, undetvars); |
mcimadamore@299 | 402 | while (actuals.nonEmpty()) { |
mcimadamore@299 | 403 | Type actual = actuals.head.baseType(); |
mcimadamore@299 | 404 | Type actualNoCapture = actualsNoCapture.head.baseType(); |
mcimadamore@299 | 405 | if (actual.tag == FORALL) |
mcimadamore@299 | 406 | actual = instantiateArg((ForAll)actual, elemType, tvars, warn); |
mcimadamore@299 | 407 | boolean works = types.isConvertible(actual, elemUndet, warn); |
duke@1 | 408 | if (!works) { |
duke@1 | 409 | throw unambiguousNoInstanceException |
mcimadamore@689 | 410 | .setMessage("infer.no.conforming.assignment.exists", |
mcimadamore@299 | 411 | tvars, actualNoCapture, elemType); |
duke@1 | 412 | } |
mcimadamore@299 | 413 | actuals = actuals.tail; |
mcimadamore@299 | 414 | actualsNoCapture = actualsNoCapture.tail; |
duke@1 | 415 | } |
duke@1 | 416 | } |
duke@1 | 417 | |
duke@1 | 418 | // minimize as yet undetermined type variables |
duke@1 | 419 | for (Type t : undetvars) |
duke@1 | 420 | minimizeInst((UndetVar) t, warn); |
duke@1 | 421 | |
duke@1 | 422 | /** Type variables instantiated to bottom */ |
duke@1 | 423 | ListBuffer<Type> restvars = new ListBuffer<Type>(); |
duke@1 | 424 | |
mcimadamore@396 | 425 | /** Undet vars instantiated to bottom */ |
mcimadamore@396 | 426 | final ListBuffer<Type> restundet = new ListBuffer<Type>(); |
mcimadamore@396 | 427 | |
duke@1 | 428 | /** Instantiated types or TypeVars if under-constrained */ |
duke@1 | 429 | ListBuffer<Type> insttypes = new ListBuffer<Type>(); |
duke@1 | 430 | |
duke@1 | 431 | /** Instantiated types or UndetVars if under-constrained */ |
duke@1 | 432 | ListBuffer<Type> undettypes = new ListBuffer<Type>(); |
duke@1 | 433 | |
duke@1 | 434 | for (Type t : undetvars) { |
duke@1 | 435 | UndetVar uv = (UndetVar)t; |
duke@1 | 436 | if (uv.inst.tag == BOT) { |
duke@1 | 437 | restvars.append(uv.qtype); |
mcimadamore@396 | 438 | restundet.append(uv); |
duke@1 | 439 | insttypes.append(uv.qtype); |
duke@1 | 440 | undettypes.append(uv); |
duke@1 | 441 | uv.inst = null; |
duke@1 | 442 | } else { |
duke@1 | 443 | insttypes.append(uv.inst); |
duke@1 | 444 | undettypes.append(uv.inst); |
duke@1 | 445 | } |
duke@1 | 446 | } |
duke@1 | 447 | checkWithinBounds(tvars, undettypes.toList(), warn); |
duke@1 | 448 | |
mcimadamore@299 | 449 | mt = (MethodType)types.subst(mt, tvars, insttypes.toList()); |
mcimadamore@299 | 450 | |
duke@1 | 451 | if (!restvars.isEmpty()) { |
duke@1 | 452 | // if there are uninstantiated variables, |
duke@1 | 453 | // quantify result type with them |
mcimadamore@299 | 454 | final List<Type> inferredTypes = insttypes.toList(); |
mcimadamore@299 | 455 | final List<Type> all_tvars = tvars; //this is the wrong tvars |
mcimadamore@299 | 456 | final MethodType mt2 = new MethodType(mt.argtypes, null, mt.thrown, syms.methodClass); |
mcimadamore@299 | 457 | mt2.restype = new ForAll(restvars.toList(), mt.restype) { |
mcimadamore@299 | 458 | @Override |
mcimadamore@396 | 459 | public List<Type> getConstraints(TypeVar tv, ConstraintKind ck) { |
mcimadamore@396 | 460 | for (Type t : restundet.toList()) { |
mcimadamore@396 | 461 | UndetVar uv = (UndetVar)t; |
mcimadamore@396 | 462 | if (uv.qtype == tv) { |
mcimadamore@396 | 463 | switch (ck) { |
mcimadamore@615 | 464 | case EXTENDS: return uv.hibounds.appendList(types.subst(types.getBounds(tv), all_tvars, inferredTypes)); |
mcimadamore@396 | 465 | case SUPER: return uv.lobounds; |
mcimadamore@396 | 466 | case EQUAL: return uv.inst != null ? List.of(uv.inst) : List.<Type>nil(); |
mcimadamore@396 | 467 | } |
mcimadamore@396 | 468 | } |
mcimadamore@396 | 469 | } |
mcimadamore@396 | 470 | return List.nil(); |
mcimadamore@396 | 471 | } |
mcimadamore@396 | 472 | |
mcimadamore@396 | 473 | @Override |
mcimadamore@299 | 474 | public Type inst(List<Type> inferred, Types types) throws NoInstanceException { |
mcimadamore@299 | 475 | List<Type> formals = types.subst(mt2.argtypes, tvars, inferred); |
mcimadamore@396 | 476 | if (!rs.argumentsAcceptable(capturedArgs, formals, |
mcimadamore@299 | 477 | allowBoxing, useVarargs, warn)) { |
mcimadamore@299 | 478 | // inferred method is not applicable |
mcimadamore@299 | 479 | throw invalidInstanceException.setMessage("inferred.do.not.conform.to.params", formals, argtypes); |
mcimadamore@396 | 480 | } |
mcimadamore@396 | 481 | // check that inferred bounds conform to their bounds |
mcimadamore@396 | 482 | checkWithinBounds(all_tvars, |
mcimadamore@299 | 483 | types.subst(inferredTypes, tvars, inferred), warn); |
mcimadamore@547 | 484 | if (useVarargs) { |
mcimadamore@795 | 485 | chk.checkVararg(env.tree.pos(), formals, msym); |
mcimadamore@547 | 486 | } |
mcimadamore@396 | 487 | return super.inst(inferred, types); |
mcimadamore@299 | 488 | }}; |
mcimadamore@299 | 489 | return mt2; |
duke@1 | 490 | } |
mcimadamore@299 | 491 | else if (!rs.argumentsAcceptable(capturedArgs, mt.getParameterTypes(), allowBoxing, useVarargs, warn)) { |
mcimadamore@299 | 492 | // inferred method is not applicable |
mcimadamore@299 | 493 | throw invalidInstanceException.setMessage("inferred.do.not.conform.to.params", mt.getParameterTypes(), argtypes); |
mcimadamore@299 | 494 | } |
mcimadamore@299 | 495 | else { |
mcimadamore@299 | 496 | // return instantiated version of method type |
mcimadamore@299 | 497 | return mt; |
mcimadamore@299 | 498 | } |
duke@1 | 499 | } |
duke@1 | 500 | //where |
duke@1 | 501 | |
duke@1 | 502 | /** Try to instantiate argument type `that' to given type `to'. |
duke@1 | 503 | * If this fails, try to insantiate `that' to `to' where |
duke@1 | 504 | * every occurrence of a type variable in `tvars' is replaced |
duke@1 | 505 | * by an unknown type. |
duke@1 | 506 | */ |
duke@1 | 507 | private Type instantiateArg(ForAll that, |
duke@1 | 508 | Type to, |
duke@1 | 509 | List<Type> tvars, |
mcimadamore@299 | 510 | Warner warn) throws InferenceException { |
duke@1 | 511 | List<Type> targs; |
duke@1 | 512 | try { |
duke@1 | 513 | return instantiateExpr(that, to, warn); |
duke@1 | 514 | } catch (NoInstanceException ex) { |
duke@1 | 515 | Type to1 = to; |
duke@1 | 516 | for (List<Type> l = tvars; l.nonEmpty(); l = l.tail) |
duke@1 | 517 | to1 = types.subst(to1, List.of(l.head), List.of(syms.unknownType)); |
duke@1 | 518 | return instantiateExpr(that, to1, warn); |
duke@1 | 519 | } |
duke@1 | 520 | } |
duke@1 | 521 | |
duke@1 | 522 | /** check that type parameters are within their bounds. |
duke@1 | 523 | */ |
mcimadamore@615 | 524 | void checkWithinBounds(List<Type> tvars, |
duke@1 | 525 | List<Type> arguments, |
duke@1 | 526 | Warner warn) |
mcimadamore@299 | 527 | throws InvalidInstanceException { |
duke@1 | 528 | for (List<Type> tvs = tvars, args = arguments; |
duke@1 | 529 | tvs.nonEmpty(); |
duke@1 | 530 | tvs = tvs.tail, args = args.tail) { |
duke@1 | 531 | if (args.head instanceof UndetVar) continue; |
duke@1 | 532 | List<Type> bounds = types.subst(types.getBounds((TypeVar)tvs.head), tvars, arguments); |
duke@1 | 533 | if (!types.isSubtypeUnchecked(args.head, bounds, warn)) |
mcimadamore@299 | 534 | throw invalidInstanceException |
duke@1 | 535 | .setMessage("inferred.do.not.conform.to.bounds", |
mcimadamore@299 | 536 | args.head, bounds); |
duke@1 | 537 | } |
duke@1 | 538 | } |
mcimadamore@674 | 539 | |
mcimadamore@674 | 540 | /** |
mcimadamore@674 | 541 | * Compute a synthetic method type corresponding to the requested polymorphic |
mcimadamore@820 | 542 | * method signature. The target return type is computed from the immediately |
mcimadamore@820 | 543 | * enclosing scope surrounding the polymorphic-signature call. |
mcimadamore@674 | 544 | */ |
mcimadamore@674 | 545 | Type instantiatePolymorphicSignatureInstance(Env<AttrContext> env, Type site, |
mcimadamore@674 | 546 | Name name, |
mcimadamore@674 | 547 | MethodSymbol spMethod, // sig. poly. method or null if none |
mcimadamore@820 | 548 | List<Type> argtypes) { |
mcimadamore@674 | 549 | final Type restype; |
mcimadamore@716 | 550 | |
mcimadamore@820 | 551 | //The return type for a polymorphic signature call is computed from |
mcimadamore@820 | 552 | //the enclosing tree E, as follows: if E is a cast, then use the |
mcimadamore@820 | 553 | //target type of the cast expression as a return type; if E is an |
mcimadamore@820 | 554 | //expression statement, the return type is 'void' - otherwise the |
mcimadamore@820 | 555 | //return type is simply 'Object'. A correctness check ensures that |
mcimadamore@820 | 556 | //env.next refers to the lexically enclosing environment in which |
mcimadamore@820 | 557 | //the polymorphic signature call environment is nested. |
mcimadamore@820 | 558 | |
mcimadamore@820 | 559 | switch (env.next.tree.getTag()) { |
mcimadamore@820 | 560 | case JCTree.TYPECAST: |
mcimadamore@820 | 561 | JCTypeCast castTree = (JCTypeCast)env.next.tree; |
mcimadamore@820 | 562 | restype = (TreeInfo.skipParens(castTree.expr) == env.tree) ? |
mcimadamore@820 | 563 | castTree.clazz.type : |
mcimadamore@820 | 564 | syms.objectType; |
mcimadamore@820 | 565 | break; |
mcimadamore@820 | 566 | case JCTree.EXEC: |
mcimadamore@820 | 567 | JCTree.JCExpressionStatement execTree = |
mcimadamore@820 | 568 | (JCTree.JCExpressionStatement)env.next.tree; |
mcimadamore@820 | 569 | restype = (TreeInfo.skipParens(execTree.expr) == env.tree) ? |
mcimadamore@820 | 570 | syms.voidType : |
mcimadamore@820 | 571 | syms.objectType; |
mcimadamore@820 | 572 | break; |
mcimadamore@820 | 573 | default: |
mcimadamore@820 | 574 | restype = syms.objectType; |
mcimadamore@674 | 575 | } |
mcimadamore@674 | 576 | |
mcimadamore@674 | 577 | List<Type> paramtypes = Type.map(argtypes, implicitArgType); |
mcimadamore@674 | 578 | List<Type> exType = spMethod != null ? |
mcimadamore@674 | 579 | spMethod.getThrownTypes() : |
mcimadamore@674 | 580 | List.of(syms.throwableType); // make it throw all exceptions |
mcimadamore@674 | 581 | |
mcimadamore@674 | 582 | MethodType mtype = new MethodType(paramtypes, |
mcimadamore@674 | 583 | restype, |
mcimadamore@674 | 584 | exType, |
mcimadamore@674 | 585 | syms.methodClass); |
mcimadamore@674 | 586 | return mtype; |
mcimadamore@674 | 587 | } |
mcimadamore@674 | 588 | //where |
mcimadamore@674 | 589 | Mapping implicitArgType = new Mapping ("implicitArgType") { |
mcimadamore@674 | 590 | public Type apply(Type t) { |
mcimadamore@674 | 591 | t = types.erasure(t); |
mcimadamore@674 | 592 | if (t.tag == BOT) |
mcimadamore@674 | 593 | // nulls type as the marker type Null (which has no instances) |
mcimadamore@674 | 594 | // infer as java.lang.Void for now |
mcimadamore@674 | 595 | t = types.boxedClass(syms.voidType).type; |
mcimadamore@674 | 596 | return t; |
mcimadamore@674 | 597 | } |
mcimadamore@674 | 598 | }; |
duke@1 | 599 | } |