src/share/classes/com/sun/tools/javac/comp/Infer.java

Thu, 24 Jul 2008 11:12:41 +0100

author
mcimadamore
date
Thu, 24 Jul 2008 11:12:41 +0100
changeset 79
36df13bde238
parent 54
eaf608c64fec
child 89
b6d5f53b3b29
permissions
-rw-r--r--

6594284: NPE thrown when calling a method on an intersection type
Summary: javac should report an error when the capture of an actual type parameter does not exist
Reviewed-by: jjg

duke@1 1 /*
xdono@54 2 * Copyright 1999-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.comp;
duke@1 27
duke@1 28 import com.sun.tools.javac.util.*;
duke@1 29 import com.sun.tools.javac.util.List;
duke@1 30 import com.sun.tools.javac.code.*;
duke@1 31 import com.sun.tools.javac.code.Type.*;
duke@1 32
duke@1 33 import static com.sun.tools.javac.code.Flags.*;
duke@1 34 import static com.sun.tools.javac.code.Kinds.*;
duke@1 35 import static com.sun.tools.javac.code.TypeTags.*;
duke@1 36
duke@1 37 /** Helper class for type parameter inference, used by the attribution phase.
duke@1 38 *
duke@1 39 * <p><b>This is NOT part of any API supported by Sun Microsystems. If
duke@1 40 * you write code that depends on this, you do so at your own risk.
duke@1 41 * This code and its internal interfaces are subject to change or
duke@1 42 * deletion without notice.</b>
duke@1 43 */
duke@1 44 public class Infer {
duke@1 45 protected static final Context.Key<Infer> inferKey =
duke@1 46 new Context.Key<Infer>();
duke@1 47
duke@1 48 /** A value for prototypes that admit any type, including polymorphic ones. */
duke@1 49 public static final Type anyPoly = new Type(NONE, null);
duke@1 50
duke@1 51 Symtab syms;
duke@1 52 Types types;
duke@1 53
duke@1 54 public static Infer instance(Context context) {
duke@1 55 Infer instance = context.get(inferKey);
duke@1 56 if (instance == null)
duke@1 57 instance = new Infer(context);
duke@1 58 return instance;
duke@1 59 }
duke@1 60
duke@1 61 protected Infer(Context context) {
duke@1 62 context.put(inferKey, this);
duke@1 63 syms = Symtab.instance(context);
duke@1 64 types = Types.instance(context);
duke@1 65 }
duke@1 66
duke@1 67 public static class NoInstanceException extends RuntimeException {
duke@1 68 private static final long serialVersionUID = 0;
duke@1 69
duke@1 70 boolean isAmbiguous; // exist several incomparable best instances?
duke@1 71
duke@1 72 JCDiagnostic diagnostic;
duke@1 73
duke@1 74 NoInstanceException(boolean isAmbiguous) {
duke@1 75 this.diagnostic = null;
duke@1 76 this.isAmbiguous = isAmbiguous;
duke@1 77 }
duke@1 78 NoInstanceException setMessage(String key) {
duke@1 79 this.diagnostic = JCDiagnostic.fragment(key);
duke@1 80 return this;
duke@1 81 }
duke@1 82 NoInstanceException setMessage(String key, Object arg1) {
duke@1 83 this.diagnostic = JCDiagnostic.fragment(key, arg1);
duke@1 84 return this;
duke@1 85 }
duke@1 86 NoInstanceException setMessage(String key, Object arg1, Object arg2) {
duke@1 87 this.diagnostic = JCDiagnostic.fragment(key, arg1, arg2);
duke@1 88 return this;
duke@1 89 }
duke@1 90 NoInstanceException setMessage(String key, Object arg1, Object arg2, Object arg3) {
duke@1 91 this.diagnostic = JCDiagnostic.fragment(key, arg1, arg2, arg3);
duke@1 92 return this;
duke@1 93 }
duke@1 94 public JCDiagnostic getDiagnostic() {
duke@1 95 return diagnostic;
duke@1 96 }
duke@1 97 }
duke@1 98 private final NoInstanceException ambiguousNoInstanceException =
duke@1 99 new NoInstanceException(true);
duke@1 100 private final NoInstanceException unambiguousNoInstanceException =
duke@1 101 new NoInstanceException(false);
duke@1 102
duke@1 103 /***************************************************************************
duke@1 104 * Auxiliary type values and classes
duke@1 105 ***************************************************************************/
duke@1 106
duke@1 107 /** A mapping that turns type variables into undetermined type variables.
duke@1 108 */
duke@1 109 Mapping fromTypeVarFun = new Mapping("fromTypeVarFun") {
duke@1 110 public Type apply(Type t) {
duke@1 111 if (t.tag == TYPEVAR) return new UndetVar(t);
duke@1 112 else return t.map(this);
duke@1 113 }
duke@1 114 };
duke@1 115
duke@1 116 /** A mapping that returns its type argument with every UndetVar replaced
duke@1 117 * by its `inst' field. Throws a NoInstanceException
duke@1 118 * if this not possible because an `inst' field is null.
duke@1 119 */
duke@1 120 Mapping getInstFun = new Mapping("getInstFun") {
duke@1 121 public Type apply(Type t) {
duke@1 122 switch (t.tag) {
duke@1 123 case UNKNOWN:
duke@1 124 throw ambiguousNoInstanceException
duke@1 125 .setMessage("undetermined.type");
duke@1 126 case UNDETVAR:
duke@1 127 UndetVar that = (UndetVar) t;
duke@1 128 if (that.inst == null)
duke@1 129 throw ambiguousNoInstanceException
duke@1 130 .setMessage("type.variable.has.undetermined.type",
duke@1 131 that.qtype);
duke@1 132 return apply(that.inst);
duke@1 133 default:
duke@1 134 return t.map(this);
duke@1 135 }
duke@1 136 }
duke@1 137 };
duke@1 138
duke@1 139 /***************************************************************************
duke@1 140 * Mini/Maximization of UndetVars
duke@1 141 ***************************************************************************/
duke@1 142
duke@1 143 /** Instantiate undetermined type variable to its minimal upper bound.
duke@1 144 * Throw a NoInstanceException if this not possible.
duke@1 145 */
duke@1 146 void maximizeInst(UndetVar that, Warner warn) throws NoInstanceException {
duke@1 147 if (that.inst == null) {
duke@1 148 if (that.hibounds.isEmpty())
duke@1 149 that.inst = syms.objectType;
duke@1 150 else if (that.hibounds.tail.isEmpty())
duke@1 151 that.inst = that.hibounds.head;
duke@1 152 else {
duke@1 153 for (List<Type> bs = that.hibounds;
duke@1 154 bs.nonEmpty() && that.inst == null;
duke@1 155 bs = bs.tail) {
duke@1 156 // System.out.println("hibounds = " + that.hibounds);//DEBUG
duke@1 157 if (isSubClass(bs.head, that.hibounds))
duke@1 158 that.inst = types.fromUnknownFun.apply(bs.head);
duke@1 159 }
mcimadamore@17 160 if (that.inst == null) {
mcimadamore@17 161 int classCount = 0, interfaceCount = 0;
mcimadamore@17 162 for (Type t : that.hibounds) {
mcimadamore@17 163 if (t.tag == CLASS) {
mcimadamore@17 164 if (t.isInterface())
mcimadamore@17 165 interfaceCount++;
mcimadamore@17 166 else
mcimadamore@17 167 classCount++;
mcimadamore@17 168 }
mcimadamore@17 169 }
mcimadamore@17 170 if ((that.hibounds.size() == classCount + interfaceCount) && classCount == 1)
mcimadamore@17 171 that.inst = types.makeCompoundType(that.hibounds);
mcimadamore@17 172 }
duke@1 173 if (that.inst == null || !types.isSubtypeUnchecked(that.inst, that.hibounds, warn))
duke@1 174 throw ambiguousNoInstanceException
duke@1 175 .setMessage("no.unique.maximal.instance.exists",
duke@1 176 that.qtype, that.hibounds);
duke@1 177 }
duke@1 178 }
duke@1 179 }
duke@1 180 //where
duke@1 181 private boolean isSubClass(Type t, final List<Type> ts) {
duke@1 182 t = t.baseType();
duke@1 183 if (t.tag == TYPEVAR) {
duke@1 184 List<Type> bounds = types.getBounds((TypeVar)t);
duke@1 185 for (Type s : ts) {
duke@1 186 if (!types.isSameType(t, s.baseType())) {
duke@1 187 for (Type bound : bounds) {
duke@1 188 if (!isSubClass(bound, List.of(s.baseType())))
duke@1 189 return false;
duke@1 190 }
duke@1 191 }
duke@1 192 }
duke@1 193 } else {
duke@1 194 for (Type s : ts) {
duke@1 195 if (!t.tsym.isSubClass(s.baseType().tsym, types))
duke@1 196 return false;
duke@1 197 }
duke@1 198 }
duke@1 199 return true;
duke@1 200 }
duke@1 201
duke@1 202 /** Instaniate undetermined type variable to the lub of all its lower bounds.
duke@1 203 * Throw a NoInstanceException if this not possible.
duke@1 204 */
duke@1 205 void minimizeInst(UndetVar that, Warner warn) throws NoInstanceException {
duke@1 206 if (that.inst == null) {
duke@1 207 if (that.lobounds.isEmpty())
duke@1 208 that.inst = syms.botType;
duke@1 209 else if (that.lobounds.tail.isEmpty())
mcimadamore@5 210 that.inst = that.lobounds.head.isPrimitive() ? syms.errType : that.lobounds.head;
duke@1 211 else {
duke@1 212 that.inst = types.lub(that.lobounds);
mcimadamore@5 213 }
mcimadamore@5 214 if (that.inst == null || that.inst == syms.errType)
duke@1 215 throw ambiguousNoInstanceException
duke@1 216 .setMessage("no.unique.minimal.instance.exists",
duke@1 217 that.qtype, that.lobounds);
duke@1 218 // VGJ: sort of inlined maximizeInst() below. Adding
duke@1 219 // bounds can cause lobounds that are above hibounds.
duke@1 220 if (that.hibounds.isEmpty())
duke@1 221 return;
duke@1 222 Type hb = null;
duke@1 223 if (that.hibounds.tail.isEmpty())
duke@1 224 hb = that.hibounds.head;
duke@1 225 else for (List<Type> bs = that.hibounds;
duke@1 226 bs.nonEmpty() && hb == null;
duke@1 227 bs = bs.tail) {
duke@1 228 if (isSubClass(bs.head, that.hibounds))
duke@1 229 hb = types.fromUnknownFun.apply(bs.head);
duke@1 230 }
duke@1 231 if (hb == null ||
duke@1 232 !types.isSubtypeUnchecked(hb, that.hibounds, warn) ||
duke@1 233 !types.isSubtypeUnchecked(that.inst, hb, warn))
duke@1 234 throw ambiguousNoInstanceException;
duke@1 235 }
duke@1 236 }
duke@1 237
duke@1 238 /***************************************************************************
duke@1 239 * Exported Methods
duke@1 240 ***************************************************************************/
duke@1 241
duke@1 242 /** Try to instantiate expression type `that' to given type `to'.
duke@1 243 * If a maximal instantiation exists which makes this type
duke@1 244 * a subtype of type `to', return the instantiated type.
duke@1 245 * If no instantiation exists, or if several incomparable
duke@1 246 * best instantiations exist throw a NoInstanceException.
duke@1 247 */
duke@1 248 public Type instantiateExpr(ForAll that,
duke@1 249 Type to,
duke@1 250 Warner warn) throws NoInstanceException {
duke@1 251 List<Type> undetvars = Type.map(that.tvars, fromTypeVarFun);
duke@1 252 for (List<Type> l = undetvars; l.nonEmpty(); l = l.tail) {
duke@1 253 UndetVar v = (UndetVar) l.head;
duke@1 254 ListBuffer<Type> hibounds = new ListBuffer<Type>();
duke@1 255 for (List<Type> l1 = types.getBounds((TypeVar) v.qtype); l1.nonEmpty(); l1 = l1.tail) {
duke@1 256 if (!l1.head.containsSome(that.tvars)) {
duke@1 257 hibounds.append(l1.head);
duke@1 258 }
duke@1 259 }
duke@1 260 v.hibounds = hibounds.toList();
duke@1 261 }
duke@1 262 Type qtype1 = types.subst(that.qtype, that.tvars, undetvars);
duke@1 263 if (!types.isSubtype(qtype1, to)) {
duke@1 264 throw unambiguousNoInstanceException
duke@1 265 .setMessage("no.conforming.instance.exists",
duke@1 266 that.tvars, that.qtype, to);
duke@1 267 }
duke@1 268 for (List<Type> l = undetvars; l.nonEmpty(); l = l.tail)
duke@1 269 maximizeInst((UndetVar) l.head, warn);
duke@1 270 // System.out.println(" = " + qtype1.map(getInstFun));//DEBUG
duke@1 271
duke@1 272 // check bounds
duke@1 273 List<Type> targs = Type.map(undetvars, getInstFun);
duke@1 274 targs = types.subst(targs, that.tvars, targs);
duke@1 275 checkWithinBounds(that.tvars, targs, warn);
duke@1 276
duke@1 277 return getInstFun.apply(qtype1);
duke@1 278 }
duke@1 279
duke@1 280 /** Instantiate method type `mt' by finding instantiations of
duke@1 281 * `tvars' so that method can be applied to `argtypes'.
duke@1 282 */
duke@1 283 public Type instantiateMethod(List<Type> tvars,
duke@1 284 MethodType mt,
duke@1 285 List<Type> argtypes,
duke@1 286 boolean allowBoxing,
duke@1 287 boolean useVarargs,
duke@1 288 Warner warn) throws NoInstanceException {
duke@1 289 //-System.err.println("instantiateMethod(" + tvars + ", " + mt + ", " + argtypes + ")"); //DEBUG
duke@1 290 List<Type> undetvars = Type.map(tvars, fromTypeVarFun);
duke@1 291 List<Type> formals = mt.argtypes;
duke@1 292
duke@1 293 // instantiate all polymorphic argument types and
duke@1 294 // set up lower bounds constraints for undetvars
duke@1 295 Type varargsFormal = useVarargs ? formals.last() : null;
duke@1 296 while (argtypes.nonEmpty() && formals.head != varargsFormal) {
duke@1 297 Type ft = formals.head;
duke@1 298 Type at = argtypes.head.baseType();
duke@1 299 if (at.tag == FORALL)
duke@1 300 at = instantiateArg((ForAll) at, ft, tvars, warn);
duke@1 301 Type sft = types.subst(ft, tvars, undetvars);
duke@1 302 boolean works = allowBoxing
duke@1 303 ? types.isConvertible(at, sft, warn)
duke@1 304 : types.isSubtypeUnchecked(at, sft, warn);
duke@1 305 if (!works) {
duke@1 306 throw unambiguousNoInstanceException
duke@1 307 .setMessage("no.conforming.assignment.exists",
duke@1 308 tvars, at, ft);
duke@1 309 }
duke@1 310 formals = formals.tail;
duke@1 311 argtypes = argtypes.tail;
duke@1 312 }
duke@1 313 if (formals.head != varargsFormal || // not enough args
duke@1 314 !useVarargs && argtypes.nonEmpty()) { // too many args
duke@1 315 // argument lists differ in length
duke@1 316 throw unambiguousNoInstanceException
duke@1 317 .setMessage("arg.length.mismatch");
duke@1 318 }
duke@1 319
duke@1 320 // for varargs arguments as well
duke@1 321 if (useVarargs) {
duke@1 322 Type elt = types.elemtype(varargsFormal);
duke@1 323 Type sft = types.subst(elt, tvars, undetvars);
duke@1 324 while (argtypes.nonEmpty()) {
duke@1 325 Type ft = sft;
duke@1 326 Type at = argtypes.head.baseType();
duke@1 327 if (at.tag == FORALL)
duke@1 328 at = instantiateArg((ForAll) at, ft, tvars, warn);
duke@1 329 boolean works = types.isConvertible(at, sft, warn);
duke@1 330 if (!works) {
duke@1 331 throw unambiguousNoInstanceException
duke@1 332 .setMessage("no.conforming.assignment.exists",
duke@1 333 tvars, at, ft);
duke@1 334 }
duke@1 335 argtypes = argtypes.tail;
duke@1 336 }
duke@1 337 }
duke@1 338
duke@1 339 // minimize as yet undetermined type variables
duke@1 340 for (Type t : undetvars)
duke@1 341 minimizeInst((UndetVar) t, warn);
duke@1 342
duke@1 343 /** Type variables instantiated to bottom */
duke@1 344 ListBuffer<Type> restvars = new ListBuffer<Type>();
duke@1 345
duke@1 346 /** Instantiated types or TypeVars if under-constrained */
duke@1 347 ListBuffer<Type> insttypes = new ListBuffer<Type>();
duke@1 348
duke@1 349 /** Instantiated types or UndetVars if under-constrained */
duke@1 350 ListBuffer<Type> undettypes = new ListBuffer<Type>();
duke@1 351
duke@1 352 for (Type t : undetvars) {
duke@1 353 UndetVar uv = (UndetVar)t;
duke@1 354 if (uv.inst.tag == BOT) {
duke@1 355 restvars.append(uv.qtype);
duke@1 356 insttypes.append(uv.qtype);
duke@1 357 undettypes.append(uv);
duke@1 358 uv.inst = null;
duke@1 359 } else {
duke@1 360 insttypes.append(uv.inst);
duke@1 361 undettypes.append(uv.inst);
duke@1 362 }
duke@1 363 }
duke@1 364 checkWithinBounds(tvars, undettypes.toList(), warn);
duke@1 365
duke@1 366 if (!restvars.isEmpty()) {
duke@1 367 // if there are uninstantiated variables,
duke@1 368 // quantify result type with them
duke@1 369 mt = new MethodType(mt.argtypes,
duke@1 370 new ForAll(restvars.toList(), mt.restype),
duke@1 371 mt.thrown, syms.methodClass);
duke@1 372 }
duke@1 373
duke@1 374 // return instantiated version of method type
duke@1 375 return types.subst(mt, tvars, insttypes.toList());
duke@1 376 }
duke@1 377 //where
duke@1 378
duke@1 379 /** Try to instantiate argument type `that' to given type `to'.
duke@1 380 * If this fails, try to insantiate `that' to `to' where
duke@1 381 * every occurrence of a type variable in `tvars' is replaced
duke@1 382 * by an unknown type.
duke@1 383 */
duke@1 384 private Type instantiateArg(ForAll that,
duke@1 385 Type to,
duke@1 386 List<Type> tvars,
duke@1 387 Warner warn) throws NoInstanceException {
duke@1 388 List<Type> targs;
duke@1 389 try {
duke@1 390 return instantiateExpr(that, to, warn);
duke@1 391 } catch (NoInstanceException ex) {
duke@1 392 Type to1 = to;
duke@1 393 for (List<Type> l = tvars; l.nonEmpty(); l = l.tail)
duke@1 394 to1 = types.subst(to1, List.of(l.head), List.of(syms.unknownType));
duke@1 395 return instantiateExpr(that, to1, warn);
duke@1 396 }
duke@1 397 }
duke@1 398
duke@1 399 /** check that type parameters are within their bounds.
duke@1 400 */
duke@1 401 private void checkWithinBounds(List<Type> tvars,
duke@1 402 List<Type> arguments,
duke@1 403 Warner warn)
duke@1 404 throws NoInstanceException {
duke@1 405 for (List<Type> tvs = tvars, args = arguments;
duke@1 406 tvs.nonEmpty();
duke@1 407 tvs = tvs.tail, args = args.tail) {
duke@1 408 if (args.head instanceof UndetVar) continue;
duke@1 409 List<Type> bounds = types.subst(types.getBounds((TypeVar)tvs.head), tvars, arguments);
duke@1 410 if (!types.isSubtypeUnchecked(args.head, bounds, warn))
duke@1 411 throw unambiguousNoInstanceException
duke@1 412 .setMessage("inferred.do.not.conform.to.bounds",
duke@1 413 arguments, tvars);
duke@1 414 }
duke@1 415 }
duke@1 416 }

mercurial