Wed, 14 Apr 2010 12:31:55 +0100
6939620: Switch to 'complex' diamond inference scheme
Summary: Implement new inference scheme for diamond operator that takes into account type of actual arguments supplied to constructor
Reviewed-by: jjg, darcy
duke@1 | 1 | /* |
xdono@229 | 2 | * Copyright 1999-2009 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 java.util.*; |
duke@1 | 29 | import java.util.Set; |
duke@1 | 30 | |
duke@1 | 31 | import com.sun.tools.javac.code.*; |
duke@1 | 32 | import com.sun.tools.javac.jvm.*; |
duke@1 | 33 | import com.sun.tools.javac.tree.*; |
duke@1 | 34 | import com.sun.tools.javac.util.*; |
duke@1 | 35 | import com.sun.tools.javac.util.JCDiagnostic.DiagnosticPosition; |
duke@1 | 36 | import com.sun.tools.javac.util.List; |
duke@1 | 37 | |
duke@1 | 38 | import com.sun.tools.javac.tree.JCTree.*; |
duke@1 | 39 | import com.sun.tools.javac.code.Lint; |
duke@1 | 40 | import com.sun.tools.javac.code.Lint.LintCategory; |
duke@1 | 41 | import com.sun.tools.javac.code.Type.*; |
duke@1 | 42 | import com.sun.tools.javac.code.Symbol.*; |
duke@1 | 43 | |
duke@1 | 44 | import static com.sun.tools.javac.code.Flags.*; |
duke@1 | 45 | import static com.sun.tools.javac.code.Kinds.*; |
duke@1 | 46 | import static com.sun.tools.javac.code.TypeTags.*; |
duke@1 | 47 | |
duke@1 | 48 | /** Type checking helper class for the attribution phase. |
duke@1 | 49 | * |
duke@1 | 50 | * <p><b>This is NOT part of any API supported by Sun Microsystems. If |
duke@1 | 51 | * you write code that depends on this, you do so at your own risk. |
duke@1 | 52 | * This code and its internal interfaces are subject to change or |
duke@1 | 53 | * deletion without notice.</b> |
duke@1 | 54 | */ |
duke@1 | 55 | public class Check { |
duke@1 | 56 | protected static final Context.Key<Check> checkKey = |
duke@1 | 57 | new Context.Key<Check>(); |
duke@1 | 58 | |
jjg@113 | 59 | private final Names names; |
duke@1 | 60 | private final Log log; |
duke@1 | 61 | private final Symtab syms; |
duke@1 | 62 | private final Infer infer; |
duke@1 | 63 | private final Types types; |
mcimadamore@89 | 64 | private final JCDiagnostic.Factory diags; |
duke@1 | 65 | private final boolean skipAnnotations; |
mcimadamore@359 | 66 | private boolean warnOnSyntheticConflicts; |
duke@1 | 67 | private final TreeInfo treeinfo; |
duke@1 | 68 | |
duke@1 | 69 | // The set of lint options currently in effect. It is initialized |
duke@1 | 70 | // from the context, and then is set/reset as needed by Attr as it |
duke@1 | 71 | // visits all the various parts of the trees during attribution. |
duke@1 | 72 | private Lint lint; |
duke@1 | 73 | |
duke@1 | 74 | public static Check instance(Context context) { |
duke@1 | 75 | Check instance = context.get(checkKey); |
duke@1 | 76 | if (instance == null) |
duke@1 | 77 | instance = new Check(context); |
duke@1 | 78 | return instance; |
duke@1 | 79 | } |
duke@1 | 80 | |
duke@1 | 81 | protected Check(Context context) { |
duke@1 | 82 | context.put(checkKey, this); |
duke@1 | 83 | |
jjg@113 | 84 | names = Names.instance(context); |
duke@1 | 85 | log = Log.instance(context); |
duke@1 | 86 | syms = Symtab.instance(context); |
duke@1 | 87 | infer = Infer.instance(context); |
duke@1 | 88 | this.types = Types.instance(context); |
mcimadamore@89 | 89 | diags = JCDiagnostic.Factory.instance(context); |
duke@1 | 90 | Options options = Options.instance(context); |
duke@1 | 91 | lint = Lint.instance(context); |
duke@1 | 92 | treeinfo = TreeInfo.instance(context); |
duke@1 | 93 | |
duke@1 | 94 | Source source = Source.instance(context); |
duke@1 | 95 | allowGenerics = source.allowGenerics(); |
duke@1 | 96 | allowAnnotations = source.allowAnnotations(); |
jjg@398 | 97 | allowCovariantReturns = source.allowCovariantReturns(); |
duke@1 | 98 | complexInference = options.get("-complexinference") != null; |
duke@1 | 99 | skipAnnotations = options.get("skipAnnotations") != null; |
mcimadamore@359 | 100 | warnOnSyntheticConflicts = options.get("warnOnSyntheticConflicts") != null; |
duke@1 | 101 | |
jjg@398 | 102 | Target target = Target.instance(context); |
jjg@398 | 103 | syntheticNameChar = target.syntheticNameChar(); |
jjg@398 | 104 | |
duke@1 | 105 | boolean verboseDeprecated = lint.isEnabled(LintCategory.DEPRECATION); |
duke@1 | 106 | boolean verboseUnchecked = lint.isEnabled(LintCategory.UNCHECKED); |
jjg@377 | 107 | boolean verboseSunApi = lint.isEnabled(LintCategory.SUNAPI); |
jjg@60 | 108 | boolean enforceMandatoryWarnings = source.enforceMandatoryWarnings(); |
duke@1 | 109 | |
jjg@60 | 110 | deprecationHandler = new MandatoryWarningHandler(log, verboseDeprecated, |
jjg@60 | 111 | enforceMandatoryWarnings, "deprecated"); |
jjg@60 | 112 | uncheckedHandler = new MandatoryWarningHandler(log, verboseUnchecked, |
jjg@60 | 113 | enforceMandatoryWarnings, "unchecked"); |
jjg@377 | 114 | sunApiHandler = new MandatoryWarningHandler(log, verboseSunApi, |
jjg@377 | 115 | enforceMandatoryWarnings, "sunapi"); |
duke@1 | 116 | } |
duke@1 | 117 | |
duke@1 | 118 | /** Switch: generics enabled? |
duke@1 | 119 | */ |
duke@1 | 120 | boolean allowGenerics; |
duke@1 | 121 | |
duke@1 | 122 | /** Switch: annotations enabled? |
duke@1 | 123 | */ |
duke@1 | 124 | boolean allowAnnotations; |
duke@1 | 125 | |
jjg@398 | 126 | /** Switch: covariant returns enabled? |
jjg@398 | 127 | */ |
jjg@398 | 128 | boolean allowCovariantReturns; |
jjg@398 | 129 | |
duke@1 | 130 | /** Switch: -complexinference option set? |
duke@1 | 131 | */ |
duke@1 | 132 | boolean complexInference; |
duke@1 | 133 | |
jjg@398 | 134 | /** Character for synthetic names |
jjg@398 | 135 | */ |
jjg@398 | 136 | char syntheticNameChar; |
jjg@398 | 137 | |
duke@1 | 138 | /** A table mapping flat names of all compiled classes in this run to their |
duke@1 | 139 | * symbols; maintained from outside. |
duke@1 | 140 | */ |
duke@1 | 141 | public Map<Name,ClassSymbol> compiled = new HashMap<Name, ClassSymbol>(); |
duke@1 | 142 | |
duke@1 | 143 | /** A handler for messages about deprecated usage. |
duke@1 | 144 | */ |
duke@1 | 145 | private MandatoryWarningHandler deprecationHandler; |
duke@1 | 146 | |
duke@1 | 147 | /** A handler for messages about unchecked or unsafe usage. |
duke@1 | 148 | */ |
duke@1 | 149 | private MandatoryWarningHandler uncheckedHandler; |
duke@1 | 150 | |
jjg@377 | 151 | /** A handler for messages about using Sun proprietary API. |
jjg@377 | 152 | */ |
jjg@377 | 153 | private MandatoryWarningHandler sunApiHandler; |
duke@1 | 154 | |
duke@1 | 155 | /* ************************************************************************* |
duke@1 | 156 | * Errors and Warnings |
duke@1 | 157 | **************************************************************************/ |
duke@1 | 158 | |
duke@1 | 159 | Lint setLint(Lint newLint) { |
duke@1 | 160 | Lint prev = lint; |
duke@1 | 161 | lint = newLint; |
duke@1 | 162 | return prev; |
duke@1 | 163 | } |
duke@1 | 164 | |
duke@1 | 165 | /** Warn about deprecated symbol. |
duke@1 | 166 | * @param pos Position to be used for error reporting. |
duke@1 | 167 | * @param sym The deprecated symbol. |
duke@1 | 168 | */ |
duke@1 | 169 | void warnDeprecated(DiagnosticPosition pos, Symbol sym) { |
duke@1 | 170 | if (!lint.isSuppressed(LintCategory.DEPRECATION)) |
duke@1 | 171 | deprecationHandler.report(pos, "has.been.deprecated", sym, sym.location()); |
duke@1 | 172 | } |
duke@1 | 173 | |
duke@1 | 174 | /** Warn about unchecked operation. |
duke@1 | 175 | * @param pos Position to be used for error reporting. |
duke@1 | 176 | * @param msg A string describing the problem. |
duke@1 | 177 | */ |
duke@1 | 178 | public void warnUnchecked(DiagnosticPosition pos, String msg, Object... args) { |
duke@1 | 179 | if (!lint.isSuppressed(LintCategory.UNCHECKED)) |
duke@1 | 180 | uncheckedHandler.report(pos, msg, args); |
duke@1 | 181 | } |
duke@1 | 182 | |
jjg@377 | 183 | /** Warn about using Sun proprietary API. |
jjg@377 | 184 | * @param pos Position to be used for error reporting. |
jjg@377 | 185 | * @param msg A string describing the problem. |
jjg@377 | 186 | */ |
jjg@377 | 187 | public void warnSunApi(DiagnosticPosition pos, String msg, Object... args) { |
jjg@377 | 188 | if (!lint.isSuppressed(LintCategory.SUNAPI)) |
jjg@377 | 189 | sunApiHandler.report(pos, msg, args); |
jjg@377 | 190 | } |
jjg@377 | 191 | |
jjg@505 | 192 | public void warnStatic(DiagnosticPosition pos, String msg, Object... args) { |
jjg@505 | 193 | if (lint.isEnabled(LintCategory.STATIC)) |
jjg@505 | 194 | log.warning(pos, msg, args); |
jjg@505 | 195 | } |
jjg@505 | 196 | |
duke@1 | 197 | /** |
duke@1 | 198 | * Report any deferred diagnostics. |
duke@1 | 199 | */ |
duke@1 | 200 | public void reportDeferredDiagnostics() { |
duke@1 | 201 | deprecationHandler.reportDeferredDiagnostic(); |
duke@1 | 202 | uncheckedHandler.reportDeferredDiagnostic(); |
jjg@377 | 203 | sunApiHandler.reportDeferredDiagnostic(); |
duke@1 | 204 | } |
duke@1 | 205 | |
duke@1 | 206 | |
duke@1 | 207 | /** Report a failure to complete a class. |
duke@1 | 208 | * @param pos Position to be used for error reporting. |
duke@1 | 209 | * @param ex The failure to report. |
duke@1 | 210 | */ |
duke@1 | 211 | public Type completionError(DiagnosticPosition pos, CompletionFailure ex) { |
jjg@12 | 212 | log.error(pos, "cant.access", ex.sym, ex.getDetailValue()); |
duke@1 | 213 | if (ex instanceof ClassReader.BadClassFile) throw new Abort(); |
duke@1 | 214 | else return syms.errType; |
duke@1 | 215 | } |
duke@1 | 216 | |
duke@1 | 217 | /** Report a type error. |
duke@1 | 218 | * @param pos Position to be used for error reporting. |
duke@1 | 219 | * @param problem A string describing the error. |
duke@1 | 220 | * @param found The type that was found. |
duke@1 | 221 | * @param req The type that was required. |
duke@1 | 222 | */ |
duke@1 | 223 | Type typeError(DiagnosticPosition pos, Object problem, Type found, Type req) { |
duke@1 | 224 | log.error(pos, "prob.found.req", |
duke@1 | 225 | problem, found, req); |
jjg@110 | 226 | return types.createErrorType(found); |
duke@1 | 227 | } |
duke@1 | 228 | |
duke@1 | 229 | Type typeError(DiagnosticPosition pos, String problem, Type found, Type req, Object explanation) { |
duke@1 | 230 | log.error(pos, "prob.found.req.1", problem, found, req, explanation); |
jjg@110 | 231 | return types.createErrorType(found); |
duke@1 | 232 | } |
duke@1 | 233 | |
duke@1 | 234 | /** Report an error that wrong type tag was found. |
duke@1 | 235 | * @param pos Position to be used for error reporting. |
duke@1 | 236 | * @param required An internationalized string describing the type tag |
duke@1 | 237 | * required. |
duke@1 | 238 | * @param found The type that was found. |
duke@1 | 239 | */ |
duke@1 | 240 | Type typeTagError(DiagnosticPosition pos, Object required, Object found) { |
jrose@267 | 241 | // this error used to be raised by the parser, |
jrose@267 | 242 | // but has been delayed to this point: |
jrose@267 | 243 | if (found instanceof Type && ((Type)found).tag == VOID) { |
jrose@267 | 244 | log.error(pos, "illegal.start.of.type"); |
jrose@267 | 245 | return syms.errType; |
jrose@267 | 246 | } |
duke@1 | 247 | log.error(pos, "type.found.req", found, required); |
jjg@110 | 248 | return types.createErrorType(found instanceof Type ? (Type)found : syms.errType); |
duke@1 | 249 | } |
duke@1 | 250 | |
duke@1 | 251 | /** Report an error that symbol cannot be referenced before super |
duke@1 | 252 | * has been called. |
duke@1 | 253 | * @param pos Position to be used for error reporting. |
duke@1 | 254 | * @param sym The referenced symbol. |
duke@1 | 255 | */ |
duke@1 | 256 | void earlyRefError(DiagnosticPosition pos, Symbol sym) { |
duke@1 | 257 | log.error(pos, "cant.ref.before.ctor.called", sym); |
duke@1 | 258 | } |
duke@1 | 259 | |
duke@1 | 260 | /** Report duplicate declaration error. |
duke@1 | 261 | */ |
duke@1 | 262 | void duplicateError(DiagnosticPosition pos, Symbol sym) { |
duke@1 | 263 | if (!sym.type.isErroneous()) { |
duke@1 | 264 | log.error(pos, "already.defined", sym, sym.location()); |
duke@1 | 265 | } |
duke@1 | 266 | } |
duke@1 | 267 | |
duke@1 | 268 | /** Report array/varargs duplicate declaration |
duke@1 | 269 | */ |
duke@1 | 270 | void varargsDuplicateError(DiagnosticPosition pos, Symbol sym1, Symbol sym2) { |
duke@1 | 271 | if (!sym1.type.isErroneous() && !sym2.type.isErroneous()) { |
duke@1 | 272 | log.error(pos, "array.and.varargs", sym1, sym2, sym2.location()); |
duke@1 | 273 | } |
duke@1 | 274 | } |
duke@1 | 275 | |
duke@1 | 276 | /* ************************************************************************ |
duke@1 | 277 | * duplicate declaration checking |
duke@1 | 278 | *************************************************************************/ |
duke@1 | 279 | |
duke@1 | 280 | /** Check that variable does not hide variable with same name in |
duke@1 | 281 | * immediately enclosing local scope. |
duke@1 | 282 | * @param pos Position for error reporting. |
duke@1 | 283 | * @param v The symbol. |
duke@1 | 284 | * @param s The scope. |
duke@1 | 285 | */ |
duke@1 | 286 | void checkTransparentVar(DiagnosticPosition pos, VarSymbol v, Scope s) { |
duke@1 | 287 | if (s.next != null) { |
duke@1 | 288 | for (Scope.Entry e = s.next.lookup(v.name); |
duke@1 | 289 | e.scope != null && e.sym.owner == v.owner; |
duke@1 | 290 | e = e.next()) { |
duke@1 | 291 | if (e.sym.kind == VAR && |
duke@1 | 292 | (e.sym.owner.kind & (VAR | MTH)) != 0 && |
duke@1 | 293 | v.name != names.error) { |
duke@1 | 294 | duplicateError(pos, e.sym); |
duke@1 | 295 | return; |
duke@1 | 296 | } |
duke@1 | 297 | } |
duke@1 | 298 | } |
duke@1 | 299 | } |
duke@1 | 300 | |
duke@1 | 301 | /** Check that a class or interface does not hide a class or |
duke@1 | 302 | * interface with same name in immediately enclosing local scope. |
duke@1 | 303 | * @param pos Position for error reporting. |
duke@1 | 304 | * @param c The symbol. |
duke@1 | 305 | * @param s The scope. |
duke@1 | 306 | */ |
duke@1 | 307 | void checkTransparentClass(DiagnosticPosition pos, ClassSymbol c, Scope s) { |
duke@1 | 308 | if (s.next != null) { |
duke@1 | 309 | for (Scope.Entry e = s.next.lookup(c.name); |
duke@1 | 310 | e.scope != null && e.sym.owner == c.owner; |
duke@1 | 311 | e = e.next()) { |
duke@1 | 312 | if (e.sym.kind == TYP && |
duke@1 | 313 | (e.sym.owner.kind & (VAR | MTH)) != 0 && |
duke@1 | 314 | c.name != names.error) { |
duke@1 | 315 | duplicateError(pos, e.sym); |
duke@1 | 316 | return; |
duke@1 | 317 | } |
duke@1 | 318 | } |
duke@1 | 319 | } |
duke@1 | 320 | } |
duke@1 | 321 | |
duke@1 | 322 | /** Check that class does not have the same name as one of |
duke@1 | 323 | * its enclosing classes, or as a class defined in its enclosing scope. |
duke@1 | 324 | * return true if class is unique in its enclosing scope. |
duke@1 | 325 | * @param pos Position for error reporting. |
duke@1 | 326 | * @param name The class name. |
duke@1 | 327 | * @param s The enclosing scope. |
duke@1 | 328 | */ |
duke@1 | 329 | boolean checkUniqueClassName(DiagnosticPosition pos, Name name, Scope s) { |
duke@1 | 330 | for (Scope.Entry e = s.lookup(name); e.scope == s; e = e.next()) { |
duke@1 | 331 | if (e.sym.kind == TYP && e.sym.name != names.error) { |
duke@1 | 332 | duplicateError(pos, e.sym); |
duke@1 | 333 | return false; |
duke@1 | 334 | } |
duke@1 | 335 | } |
duke@1 | 336 | for (Symbol sym = s.owner; sym != null; sym = sym.owner) { |
duke@1 | 337 | if (sym.kind == TYP && sym.name == name && sym.name != names.error) { |
duke@1 | 338 | duplicateError(pos, sym); |
duke@1 | 339 | return true; |
duke@1 | 340 | } |
duke@1 | 341 | } |
duke@1 | 342 | return true; |
duke@1 | 343 | } |
duke@1 | 344 | |
duke@1 | 345 | /* ************************************************************************* |
duke@1 | 346 | * Class name generation |
duke@1 | 347 | **************************************************************************/ |
duke@1 | 348 | |
duke@1 | 349 | /** Return name of local class. |
duke@1 | 350 | * This is of the form <enclClass> $ n <classname> |
duke@1 | 351 | * where |
duke@1 | 352 | * enclClass is the flat name of the enclosing class, |
duke@1 | 353 | * classname is the simple name of the local class |
duke@1 | 354 | */ |
duke@1 | 355 | Name localClassName(ClassSymbol c) { |
duke@1 | 356 | for (int i=1; ; i++) { |
duke@1 | 357 | Name flatname = names. |
duke@1 | 358 | fromString("" + c.owner.enclClass().flatname + |
jjg@398 | 359 | syntheticNameChar + i + |
duke@1 | 360 | c.name); |
duke@1 | 361 | if (compiled.get(flatname) == null) return flatname; |
duke@1 | 362 | } |
duke@1 | 363 | } |
duke@1 | 364 | |
duke@1 | 365 | /* ************************************************************************* |
duke@1 | 366 | * Type Checking |
duke@1 | 367 | **************************************************************************/ |
duke@1 | 368 | |
duke@1 | 369 | /** Check that a given type is assignable to a given proto-type. |
duke@1 | 370 | * If it is, return the type, otherwise return errType. |
duke@1 | 371 | * @param pos Position to be used for error reporting. |
duke@1 | 372 | * @param found The type that was found. |
duke@1 | 373 | * @param req The type that was required. |
duke@1 | 374 | */ |
duke@1 | 375 | Type checkType(DiagnosticPosition pos, Type found, Type req) { |
duke@1 | 376 | if (req.tag == ERROR) |
duke@1 | 377 | return req; |
mcimadamore@536 | 378 | if (found.tag == FORALL) |
mcimadamore@536 | 379 | return instantiatePoly(pos, (ForAll)found, req, convertWarner(pos, found, req)); |
duke@1 | 380 | if (req.tag == NONE) |
duke@1 | 381 | return found; |
duke@1 | 382 | if (types.isAssignable(found, req, convertWarner(pos, found, req))) |
duke@1 | 383 | return found; |
duke@1 | 384 | if (found.tag <= DOUBLE && req.tag <= DOUBLE) |
mcimadamore@89 | 385 | return typeError(pos, diags.fragment("possible.loss.of.precision"), found, req); |
duke@1 | 386 | if (found.isSuperBound()) { |
duke@1 | 387 | log.error(pos, "assignment.from.super-bound", found); |
jjg@110 | 388 | return types.createErrorType(found); |
duke@1 | 389 | } |
duke@1 | 390 | if (req.isExtendsBound()) { |
duke@1 | 391 | log.error(pos, "assignment.to.extends-bound", req); |
jjg@110 | 392 | return types.createErrorType(found); |
duke@1 | 393 | } |
mcimadamore@89 | 394 | return typeError(pos, diags.fragment("incompatible.types"), found, req); |
duke@1 | 395 | } |
duke@1 | 396 | |
duke@1 | 397 | /** Instantiate polymorphic type to some prototype, unless |
duke@1 | 398 | * prototype is `anyPoly' in which case polymorphic type |
duke@1 | 399 | * is returned unchanged. |
duke@1 | 400 | */ |
mcimadamore@383 | 401 | Type instantiatePoly(DiagnosticPosition pos, ForAll t, Type pt, Warner warn) throws Infer.NoInstanceException { |
duke@1 | 402 | if (pt == Infer.anyPoly && complexInference) { |
duke@1 | 403 | return t; |
duke@1 | 404 | } else if (pt == Infer.anyPoly || pt.tag == NONE) { |
duke@1 | 405 | Type newpt = t.qtype.tag <= VOID ? t.qtype : syms.objectType; |
duke@1 | 406 | return instantiatePoly(pos, t, newpt, warn); |
duke@1 | 407 | } else if (pt.tag == ERROR) { |
duke@1 | 408 | return pt; |
duke@1 | 409 | } else { |
mcimadamore@536 | 410 | try { |
mcimadamore@536 | 411 | return infer.instantiateExpr(t, pt, warn); |
mcimadamore@536 | 412 | } catch (Infer.NoInstanceException ex) { |
mcimadamore@536 | 413 | if (ex.isAmbiguous) { |
mcimadamore@536 | 414 | JCDiagnostic d = ex.getDiagnostic(); |
mcimadamore@536 | 415 | log.error(pos, |
mcimadamore@536 | 416 | "undetermined.type" + (d!=null ? ".1" : ""), |
mcimadamore@536 | 417 | t, d); |
mcimadamore@536 | 418 | return types.createErrorType(pt); |
mcimadamore@536 | 419 | } else { |
mcimadamore@536 | 420 | JCDiagnostic d = ex.getDiagnostic(); |
mcimadamore@536 | 421 | return typeError(pos, |
mcimadamore@536 | 422 | diags.fragment("incompatible.types" + (d!=null ? ".1" : ""), d), |
mcimadamore@536 | 423 | t, pt); |
mcimadamore@536 | 424 | } |
mcimadamore@536 | 425 | } catch (Infer.InvalidInstanceException ex) { |
mcimadamore@536 | 426 | JCDiagnostic d = ex.getDiagnostic(); |
mcimadamore@536 | 427 | log.error(pos, "invalid.inferred.types", t.tvars, d); |
mcimadamore@536 | 428 | return types.createErrorType(pt); |
mcimadamore@536 | 429 | } |
duke@1 | 430 | } |
mcimadamore@536 | 431 | } |
duke@1 | 432 | |
duke@1 | 433 | /** Check that a given type can be cast to a given target type. |
duke@1 | 434 | * Return the result of the cast. |
duke@1 | 435 | * @param pos Position to be used for error reporting. |
duke@1 | 436 | * @param found The type that is being cast. |
duke@1 | 437 | * @param req The target type of the cast. |
duke@1 | 438 | */ |
duke@1 | 439 | Type checkCastable(DiagnosticPosition pos, Type found, Type req) { |
duke@1 | 440 | if (found.tag == FORALL) { |
duke@1 | 441 | instantiatePoly(pos, (ForAll) found, req, castWarner(pos, found, req)); |
duke@1 | 442 | return req; |
duke@1 | 443 | } else if (types.isCastable(found, req, castWarner(pos, found, req))) { |
duke@1 | 444 | return req; |
duke@1 | 445 | } else { |
duke@1 | 446 | return typeError(pos, |
mcimadamore@89 | 447 | diags.fragment("inconvertible.types"), |
duke@1 | 448 | found, req); |
duke@1 | 449 | } |
duke@1 | 450 | } |
duke@1 | 451 | //where |
duke@1 | 452 | /** Is type a type variable, or a (possibly multi-dimensional) array of |
duke@1 | 453 | * type variables? |
duke@1 | 454 | */ |
duke@1 | 455 | boolean isTypeVar(Type t) { |
duke@1 | 456 | return t.tag == TYPEVAR || t.tag == ARRAY && isTypeVar(types.elemtype(t)); |
duke@1 | 457 | } |
duke@1 | 458 | |
duke@1 | 459 | /** Check that a type is within some bounds. |
duke@1 | 460 | * |
duke@1 | 461 | * Used in TypeApply to verify that, e.g., X in V<X> is a valid |
duke@1 | 462 | * type argument. |
duke@1 | 463 | * @param pos Position to be used for error reporting. |
duke@1 | 464 | * @param a The type that should be bounded by bs. |
duke@1 | 465 | * @param bs The bound. |
duke@1 | 466 | */ |
duke@1 | 467 | private void checkExtends(DiagnosticPosition pos, Type a, TypeVar bs) { |
mcimadamore@154 | 468 | if (a.isUnbound()) { |
mcimadamore@154 | 469 | return; |
mcimadamore@154 | 470 | } else if (a.tag != WILDCARD) { |
mcimadamore@154 | 471 | a = types.upperBound(a); |
mcimadamore@154 | 472 | for (List<Type> l = types.getBounds(bs); l.nonEmpty(); l = l.tail) { |
mcimadamore@154 | 473 | if (!types.isSubtype(a, l.head)) { |
mcimadamore@154 | 474 | log.error(pos, "not.within.bounds", a); |
mcimadamore@154 | 475 | return; |
mcimadamore@154 | 476 | } |
mcimadamore@154 | 477 | } |
mcimadamore@154 | 478 | } else if (a.isExtendsBound()) { |
mcimadamore@154 | 479 | if (!types.isCastable(bs.getUpperBound(), types.upperBound(a), Warner.noWarnings)) |
mcimadamore@154 | 480 | log.error(pos, "not.within.bounds", a); |
mcimadamore@154 | 481 | } else if (a.isSuperBound()) { |
mcimadamore@154 | 482 | if (types.notSoftSubtype(types.lowerBound(a), bs.getUpperBound())) |
mcimadamore@154 | 483 | log.error(pos, "not.within.bounds", a); |
mcimadamore@154 | 484 | } |
mcimadamore@154 | 485 | } |
mcimadamore@154 | 486 | |
mcimadamore@154 | 487 | /** Check that a type is within some bounds. |
mcimadamore@154 | 488 | * |
mcimadamore@154 | 489 | * Used in TypeApply to verify that, e.g., X in V<X> is a valid |
mcimadamore@154 | 490 | * type argument. |
mcimadamore@154 | 491 | * @param pos Position to be used for error reporting. |
mcimadamore@154 | 492 | * @param a The type that should be bounded by bs. |
mcimadamore@154 | 493 | * @param bs The bound. |
mcimadamore@154 | 494 | */ |
mcimadamore@154 | 495 | private void checkCapture(JCTypeApply tree) { |
mcimadamore@154 | 496 | List<JCExpression> args = tree.getTypeArguments(); |
mcimadamore@154 | 497 | for (Type arg : types.capture(tree.type).getTypeArguments()) { |
mcimadamore@154 | 498 | if (arg.tag == TYPEVAR && arg.getUpperBound().isErroneous()) { |
mcimadamore@154 | 499 | log.error(args.head.pos, "not.within.bounds", args.head.type); |
mcimadamore@154 | 500 | break; |
mcimadamore@79 | 501 | } |
mcimadamore@154 | 502 | args = args.tail; |
mcimadamore@79 | 503 | } |
mcimadamore@154 | 504 | } |
duke@1 | 505 | |
duke@1 | 506 | /** Check that type is different from 'void'. |
duke@1 | 507 | * @param pos Position to be used for error reporting. |
duke@1 | 508 | * @param t The type to be checked. |
duke@1 | 509 | */ |
duke@1 | 510 | Type checkNonVoid(DiagnosticPosition pos, Type t) { |
duke@1 | 511 | if (t.tag == VOID) { |
duke@1 | 512 | log.error(pos, "void.not.allowed.here"); |
jjg@110 | 513 | return types.createErrorType(t); |
duke@1 | 514 | } else { |
duke@1 | 515 | return t; |
duke@1 | 516 | } |
duke@1 | 517 | } |
duke@1 | 518 | |
duke@1 | 519 | /** Check that type is a class or interface type. |
duke@1 | 520 | * @param pos Position to be used for error reporting. |
duke@1 | 521 | * @param t The type to be checked. |
duke@1 | 522 | */ |
duke@1 | 523 | Type checkClassType(DiagnosticPosition pos, Type t) { |
duke@1 | 524 | if (t.tag != CLASS && t.tag != ERROR) |
duke@1 | 525 | return typeTagError(pos, |
mcimadamore@89 | 526 | diags.fragment("type.req.class"), |
duke@1 | 527 | (t.tag == TYPEVAR) |
mcimadamore@89 | 528 | ? diags.fragment("type.parameter", t) |
duke@1 | 529 | : t); |
duke@1 | 530 | else |
duke@1 | 531 | return t; |
duke@1 | 532 | } |
duke@1 | 533 | |
duke@1 | 534 | /** Check that type is a class or interface type. |
duke@1 | 535 | * @param pos Position to be used for error reporting. |
duke@1 | 536 | * @param t The type to be checked. |
duke@1 | 537 | * @param noBounds True if type bounds are illegal here. |
duke@1 | 538 | */ |
duke@1 | 539 | Type checkClassType(DiagnosticPosition pos, Type t, boolean noBounds) { |
duke@1 | 540 | t = checkClassType(pos, t); |
duke@1 | 541 | if (noBounds && t.isParameterized()) { |
duke@1 | 542 | List<Type> args = t.getTypeArguments(); |
duke@1 | 543 | while (args.nonEmpty()) { |
duke@1 | 544 | if (args.head.tag == WILDCARD) |
duke@1 | 545 | return typeTagError(pos, |
jjg@398 | 546 | Log.getLocalizedString("type.req.exact"), |
duke@1 | 547 | args.head); |
duke@1 | 548 | args = args.tail; |
duke@1 | 549 | } |
duke@1 | 550 | } |
duke@1 | 551 | return t; |
duke@1 | 552 | } |
duke@1 | 553 | |
duke@1 | 554 | /** Check that type is a reifiable class, interface or array type. |
duke@1 | 555 | * @param pos Position to be used for error reporting. |
duke@1 | 556 | * @param t The type to be checked. |
duke@1 | 557 | */ |
duke@1 | 558 | Type checkReifiableReferenceType(DiagnosticPosition pos, Type t) { |
duke@1 | 559 | if (t.tag != CLASS && t.tag != ARRAY && t.tag != ERROR) { |
duke@1 | 560 | return typeTagError(pos, |
mcimadamore@89 | 561 | diags.fragment("type.req.class.array"), |
duke@1 | 562 | t); |
duke@1 | 563 | } else if (!types.isReifiable(t)) { |
duke@1 | 564 | log.error(pos, "illegal.generic.type.for.instof"); |
jjg@110 | 565 | return types.createErrorType(t); |
duke@1 | 566 | } else { |
duke@1 | 567 | return t; |
duke@1 | 568 | } |
duke@1 | 569 | } |
duke@1 | 570 | |
duke@1 | 571 | /** Check that type is a reference type, i.e. a class, interface or array type |
duke@1 | 572 | * or a type variable. |
duke@1 | 573 | * @param pos Position to be used for error reporting. |
duke@1 | 574 | * @param t The type to be checked. |
duke@1 | 575 | */ |
duke@1 | 576 | Type checkRefType(DiagnosticPosition pos, Type t) { |
duke@1 | 577 | switch (t.tag) { |
duke@1 | 578 | case CLASS: |
duke@1 | 579 | case ARRAY: |
duke@1 | 580 | case TYPEVAR: |
duke@1 | 581 | case WILDCARD: |
duke@1 | 582 | case ERROR: |
duke@1 | 583 | return t; |
duke@1 | 584 | default: |
duke@1 | 585 | return typeTagError(pos, |
mcimadamore@89 | 586 | diags.fragment("type.req.ref"), |
duke@1 | 587 | t); |
duke@1 | 588 | } |
duke@1 | 589 | } |
duke@1 | 590 | |
jrose@267 | 591 | /** Check that each type is a reference type, i.e. a class, interface or array type |
jrose@267 | 592 | * or a type variable. |
jrose@267 | 593 | * @param trees Original trees, used for error reporting. |
jrose@267 | 594 | * @param types The types to be checked. |
jrose@267 | 595 | */ |
jrose@267 | 596 | List<Type> checkRefTypes(List<JCExpression> trees, List<Type> types) { |
jrose@267 | 597 | List<JCExpression> tl = trees; |
jrose@267 | 598 | for (List<Type> l = types; l.nonEmpty(); l = l.tail) { |
jrose@267 | 599 | l.head = checkRefType(tl.head.pos(), l.head); |
jrose@267 | 600 | tl = tl.tail; |
jrose@267 | 601 | } |
jrose@267 | 602 | return types; |
jrose@267 | 603 | } |
jrose@267 | 604 | |
duke@1 | 605 | /** Check that type is a null or reference type. |
duke@1 | 606 | * @param pos Position to be used for error reporting. |
duke@1 | 607 | * @param t The type to be checked. |
duke@1 | 608 | */ |
duke@1 | 609 | Type checkNullOrRefType(DiagnosticPosition pos, Type t) { |
duke@1 | 610 | switch (t.tag) { |
duke@1 | 611 | case CLASS: |
duke@1 | 612 | case ARRAY: |
duke@1 | 613 | case TYPEVAR: |
duke@1 | 614 | case WILDCARD: |
duke@1 | 615 | case BOT: |
duke@1 | 616 | case ERROR: |
duke@1 | 617 | return t; |
duke@1 | 618 | default: |
duke@1 | 619 | return typeTagError(pos, |
mcimadamore@89 | 620 | diags.fragment("type.req.ref"), |
duke@1 | 621 | t); |
duke@1 | 622 | } |
duke@1 | 623 | } |
duke@1 | 624 | |
duke@1 | 625 | /** Check that flag set does not contain elements of two conflicting sets. s |
duke@1 | 626 | * Return true if it doesn't. |
duke@1 | 627 | * @param pos Position to be used for error reporting. |
duke@1 | 628 | * @param flags The set of flags to be checked. |
duke@1 | 629 | * @param set1 Conflicting flags set #1. |
duke@1 | 630 | * @param set2 Conflicting flags set #2. |
duke@1 | 631 | */ |
duke@1 | 632 | boolean checkDisjoint(DiagnosticPosition pos, long flags, long set1, long set2) { |
duke@1 | 633 | if ((flags & set1) != 0 && (flags & set2) != 0) { |
duke@1 | 634 | log.error(pos, |
duke@1 | 635 | "illegal.combination.of.modifiers", |
mcimadamore@80 | 636 | asFlagSet(TreeInfo.firstFlag(flags & set1)), |
mcimadamore@80 | 637 | asFlagSet(TreeInfo.firstFlag(flags & set2))); |
duke@1 | 638 | return false; |
duke@1 | 639 | } else |
duke@1 | 640 | return true; |
duke@1 | 641 | } |
duke@1 | 642 | |
mcimadamore@537 | 643 | /** Check that the type inferred using the diamond operator does not contain |
mcimadamore@537 | 644 | * non-denotable types such as captured types or intersection types. |
mcimadamore@537 | 645 | * @param t the type inferred using the diamond operator |
mcimadamore@537 | 646 | */ |
mcimadamore@537 | 647 | List<Type> checkDiamond(ClassType t) { |
mcimadamore@537 | 648 | DiamondTypeChecker dtc = new DiamondTypeChecker(); |
mcimadamore@537 | 649 | ListBuffer<Type> buf = ListBuffer.lb(); |
mcimadamore@537 | 650 | for (Type arg : t.getTypeArguments()) { |
mcimadamore@537 | 651 | if (!dtc.visit(arg, null)) { |
mcimadamore@537 | 652 | buf.append(arg); |
mcimadamore@537 | 653 | } |
mcimadamore@537 | 654 | } |
mcimadamore@537 | 655 | return buf.toList(); |
mcimadamore@537 | 656 | } |
mcimadamore@537 | 657 | |
mcimadamore@537 | 658 | static class DiamondTypeChecker extends Types.SimpleVisitor<Boolean, Void> { |
mcimadamore@537 | 659 | public Boolean visitType(Type t, Void s) { |
mcimadamore@537 | 660 | return true; |
mcimadamore@537 | 661 | } |
mcimadamore@537 | 662 | @Override |
mcimadamore@537 | 663 | public Boolean visitClassType(ClassType t, Void s) { |
mcimadamore@537 | 664 | if (t.isCompound()) { |
mcimadamore@537 | 665 | return false; |
mcimadamore@537 | 666 | } |
mcimadamore@537 | 667 | for (Type targ : t.getTypeArguments()) { |
mcimadamore@537 | 668 | if (!visit(targ, s)) { |
mcimadamore@537 | 669 | return false; |
mcimadamore@537 | 670 | } |
mcimadamore@537 | 671 | } |
mcimadamore@537 | 672 | return true; |
mcimadamore@537 | 673 | } |
mcimadamore@537 | 674 | @Override |
mcimadamore@537 | 675 | public Boolean visitCapturedType(CapturedType t, Void s) { |
mcimadamore@537 | 676 | return false; |
mcimadamore@537 | 677 | } |
mcimadamore@537 | 678 | } |
mcimadamore@537 | 679 | |
duke@1 | 680 | /** Check that given modifiers are legal for given symbol and |
duke@1 | 681 | * return modifiers together with any implicit modififiers for that symbol. |
duke@1 | 682 | * Warning: we can't use flags() here since this method |
duke@1 | 683 | * is called during class enter, when flags() would cause a premature |
duke@1 | 684 | * completion. |
duke@1 | 685 | * @param pos Position to be used for error reporting. |
duke@1 | 686 | * @param flags The set of modifiers given in a definition. |
duke@1 | 687 | * @param sym The defined symbol. |
duke@1 | 688 | */ |
duke@1 | 689 | long checkFlags(DiagnosticPosition pos, long flags, Symbol sym, JCTree tree) { |
duke@1 | 690 | long mask; |
duke@1 | 691 | long implicit = 0; |
duke@1 | 692 | switch (sym.kind) { |
duke@1 | 693 | case VAR: |
duke@1 | 694 | if (sym.owner.kind != TYP) |
duke@1 | 695 | mask = LocalVarFlags; |
duke@1 | 696 | else if ((sym.owner.flags_field & INTERFACE) != 0) |
duke@1 | 697 | mask = implicit = InterfaceVarFlags; |
duke@1 | 698 | else |
duke@1 | 699 | mask = VarFlags; |
duke@1 | 700 | break; |
duke@1 | 701 | case MTH: |
duke@1 | 702 | if (sym.name == names.init) { |
duke@1 | 703 | if ((sym.owner.flags_field & ENUM) != 0) { |
duke@1 | 704 | // enum constructors cannot be declared public or |
duke@1 | 705 | // protected and must be implicitly or explicitly |
duke@1 | 706 | // private |
duke@1 | 707 | implicit = PRIVATE; |
duke@1 | 708 | mask = PRIVATE; |
duke@1 | 709 | } else |
duke@1 | 710 | mask = ConstructorFlags; |
duke@1 | 711 | } else if ((sym.owner.flags_field & INTERFACE) != 0) |
duke@1 | 712 | mask = implicit = InterfaceMethodFlags; |
duke@1 | 713 | else { |
duke@1 | 714 | mask = MethodFlags; |
duke@1 | 715 | } |
duke@1 | 716 | // Imply STRICTFP if owner has STRICTFP set. |
duke@1 | 717 | if (((flags|implicit) & Flags.ABSTRACT) == 0) |
duke@1 | 718 | implicit |= sym.owner.flags_field & STRICTFP; |
duke@1 | 719 | break; |
duke@1 | 720 | case TYP: |
duke@1 | 721 | if (sym.isLocal()) { |
duke@1 | 722 | mask = LocalClassFlags; |
jjg@113 | 723 | if (sym.name.isEmpty()) { // Anonymous class |
duke@1 | 724 | // Anonymous classes in static methods are themselves static; |
duke@1 | 725 | // that's why we admit STATIC here. |
duke@1 | 726 | mask |= STATIC; |
duke@1 | 727 | // JLS: Anonymous classes are final. |
duke@1 | 728 | implicit |= FINAL; |
duke@1 | 729 | } |
duke@1 | 730 | if ((sym.owner.flags_field & STATIC) == 0 && |
duke@1 | 731 | (flags & ENUM) != 0) |
duke@1 | 732 | log.error(pos, "enums.must.be.static"); |
duke@1 | 733 | } else if (sym.owner.kind == TYP) { |
duke@1 | 734 | mask = MemberClassFlags; |
duke@1 | 735 | if (sym.owner.owner.kind == PCK || |
duke@1 | 736 | (sym.owner.flags_field & STATIC) != 0) |
duke@1 | 737 | mask |= STATIC; |
duke@1 | 738 | else if ((flags & ENUM) != 0) |
duke@1 | 739 | log.error(pos, "enums.must.be.static"); |
duke@1 | 740 | // Nested interfaces and enums are always STATIC (Spec ???) |
duke@1 | 741 | if ((flags & (INTERFACE | ENUM)) != 0 ) implicit = STATIC; |
duke@1 | 742 | } else { |
duke@1 | 743 | mask = ClassFlags; |
duke@1 | 744 | } |
duke@1 | 745 | // Interfaces are always ABSTRACT |
duke@1 | 746 | if ((flags & INTERFACE) != 0) implicit |= ABSTRACT; |
duke@1 | 747 | |
duke@1 | 748 | if ((flags & ENUM) != 0) { |
duke@1 | 749 | // enums can't be declared abstract or final |
duke@1 | 750 | mask &= ~(ABSTRACT | FINAL); |
duke@1 | 751 | implicit |= implicitEnumFinalFlag(tree); |
duke@1 | 752 | } |
duke@1 | 753 | // Imply STRICTFP if owner has STRICTFP set. |
duke@1 | 754 | implicit |= sym.owner.flags_field & STRICTFP; |
duke@1 | 755 | break; |
duke@1 | 756 | default: |
duke@1 | 757 | throw new AssertionError(); |
duke@1 | 758 | } |
duke@1 | 759 | long illegal = flags & StandardFlags & ~mask; |
duke@1 | 760 | if (illegal != 0) { |
duke@1 | 761 | if ((illegal & INTERFACE) != 0) { |
duke@1 | 762 | log.error(pos, "intf.not.allowed.here"); |
duke@1 | 763 | mask |= INTERFACE; |
duke@1 | 764 | } |
duke@1 | 765 | else { |
duke@1 | 766 | log.error(pos, |
mcimadamore@80 | 767 | "mod.not.allowed.here", asFlagSet(illegal)); |
duke@1 | 768 | } |
duke@1 | 769 | } |
duke@1 | 770 | else if ((sym.kind == TYP || |
duke@1 | 771 | // ISSUE: Disallowing abstract&private is no longer appropriate |
duke@1 | 772 | // in the presence of inner classes. Should it be deleted here? |
duke@1 | 773 | checkDisjoint(pos, flags, |
duke@1 | 774 | ABSTRACT, |
duke@1 | 775 | PRIVATE | STATIC)) |
duke@1 | 776 | && |
duke@1 | 777 | checkDisjoint(pos, flags, |
duke@1 | 778 | ABSTRACT | INTERFACE, |
duke@1 | 779 | FINAL | NATIVE | SYNCHRONIZED) |
duke@1 | 780 | && |
duke@1 | 781 | checkDisjoint(pos, flags, |
duke@1 | 782 | PUBLIC, |
duke@1 | 783 | PRIVATE | PROTECTED) |
duke@1 | 784 | && |
duke@1 | 785 | checkDisjoint(pos, flags, |
duke@1 | 786 | PRIVATE, |
duke@1 | 787 | PUBLIC | PROTECTED) |
duke@1 | 788 | && |
duke@1 | 789 | checkDisjoint(pos, flags, |
duke@1 | 790 | FINAL, |
duke@1 | 791 | VOLATILE) |
duke@1 | 792 | && |
duke@1 | 793 | (sym.kind == TYP || |
duke@1 | 794 | checkDisjoint(pos, flags, |
duke@1 | 795 | ABSTRACT | NATIVE, |
duke@1 | 796 | STRICTFP))) { |
duke@1 | 797 | // skip |
duke@1 | 798 | } |
duke@1 | 799 | return flags & (mask | ~StandardFlags) | implicit; |
duke@1 | 800 | } |
duke@1 | 801 | |
duke@1 | 802 | |
duke@1 | 803 | /** Determine if this enum should be implicitly final. |
duke@1 | 804 | * |
duke@1 | 805 | * If the enum has no specialized enum contants, it is final. |
duke@1 | 806 | * |
duke@1 | 807 | * If the enum does have specialized enum contants, it is |
duke@1 | 808 | * <i>not</i> final. |
duke@1 | 809 | */ |
duke@1 | 810 | private long implicitEnumFinalFlag(JCTree tree) { |
duke@1 | 811 | if (tree.getTag() != JCTree.CLASSDEF) return 0; |
duke@1 | 812 | class SpecialTreeVisitor extends JCTree.Visitor { |
duke@1 | 813 | boolean specialized; |
duke@1 | 814 | SpecialTreeVisitor() { |
duke@1 | 815 | this.specialized = false; |
duke@1 | 816 | }; |
duke@1 | 817 | |
jjg@398 | 818 | @Override |
duke@1 | 819 | public void visitTree(JCTree tree) { /* no-op */ } |
duke@1 | 820 | |
jjg@398 | 821 | @Override |
duke@1 | 822 | public void visitVarDef(JCVariableDecl tree) { |
duke@1 | 823 | if ((tree.mods.flags & ENUM) != 0) { |
duke@1 | 824 | if (tree.init instanceof JCNewClass && |
duke@1 | 825 | ((JCNewClass) tree.init).def != null) { |
duke@1 | 826 | specialized = true; |
duke@1 | 827 | } |
duke@1 | 828 | } |
duke@1 | 829 | } |
duke@1 | 830 | } |
duke@1 | 831 | |
duke@1 | 832 | SpecialTreeVisitor sts = new SpecialTreeVisitor(); |
duke@1 | 833 | JCClassDecl cdef = (JCClassDecl) tree; |
duke@1 | 834 | for (JCTree defs: cdef.defs) { |
duke@1 | 835 | defs.accept(sts); |
duke@1 | 836 | if (sts.specialized) return 0; |
duke@1 | 837 | } |
duke@1 | 838 | return FINAL; |
duke@1 | 839 | } |
duke@1 | 840 | |
duke@1 | 841 | /* ************************************************************************* |
duke@1 | 842 | * Type Validation |
duke@1 | 843 | **************************************************************************/ |
duke@1 | 844 | |
duke@1 | 845 | /** Validate a type expression. That is, |
duke@1 | 846 | * check that all type arguments of a parametric type are within |
duke@1 | 847 | * their bounds. This must be done in a second phase after type attributon |
duke@1 | 848 | * since a class might have a subclass as type parameter bound. E.g: |
duke@1 | 849 | * |
duke@1 | 850 | * class B<A extends C> { ... } |
duke@1 | 851 | * class C extends B<C> { ... } |
duke@1 | 852 | * |
duke@1 | 853 | * and we can't make sure that the bound is already attributed because |
duke@1 | 854 | * of possible cycles. |
duke@1 | 855 | */ |
duke@1 | 856 | private Validator validator = new Validator(); |
duke@1 | 857 | |
duke@1 | 858 | /** Visitor method: Validate a type expression, if it is not null, catching |
duke@1 | 859 | * and reporting any completion failures. |
duke@1 | 860 | */ |
mcimadamore@122 | 861 | void validate(JCTree tree, Env<AttrContext> env) { |
duke@1 | 862 | try { |
mcimadamore@122 | 863 | if (tree != null) { |
mcimadamore@122 | 864 | validator.env = env; |
mcimadamore@122 | 865 | tree.accept(validator); |
mcimadamore@122 | 866 | checkRaw(tree, env); |
mcimadamore@122 | 867 | } |
duke@1 | 868 | } catch (CompletionFailure ex) { |
duke@1 | 869 | completionError(tree.pos(), ex); |
duke@1 | 870 | } |
duke@1 | 871 | } |
mcimadamore@122 | 872 | //where |
mcimadamore@122 | 873 | void checkRaw(JCTree tree, Env<AttrContext> env) { |
mcimadamore@122 | 874 | if (lint.isEnabled(Lint.LintCategory.RAW) && |
mcimadamore@122 | 875 | tree.type.tag == CLASS && |
mcimadamore@122 | 876 | !env.enclClass.name.isEmpty() && //anonymous or intersection |
mcimadamore@122 | 877 | tree.type.isRaw()) { |
mcimadamore@122 | 878 | log.warning(tree.pos(), "raw.class.use", tree.type, tree.type.tsym.type); |
mcimadamore@122 | 879 | } |
mcimadamore@122 | 880 | } |
duke@1 | 881 | |
duke@1 | 882 | /** Visitor method: Validate a list of type expressions. |
duke@1 | 883 | */ |
mcimadamore@122 | 884 | void validate(List<? extends JCTree> trees, Env<AttrContext> env) { |
duke@1 | 885 | for (List<? extends JCTree> l = trees; l.nonEmpty(); l = l.tail) |
mcimadamore@122 | 886 | validate(l.head, env); |
duke@1 | 887 | } |
duke@1 | 888 | |
duke@1 | 889 | /** A visitor class for type validation. |
duke@1 | 890 | */ |
duke@1 | 891 | class Validator extends JCTree.Visitor { |
duke@1 | 892 | |
jjg@398 | 893 | @Override |
duke@1 | 894 | public void visitTypeArray(JCArrayTypeTree tree) { |
mcimadamore@122 | 895 | validate(tree.elemtype, env); |
duke@1 | 896 | } |
duke@1 | 897 | |
jjg@398 | 898 | @Override |
duke@1 | 899 | public void visitTypeApply(JCTypeApply tree) { |
duke@1 | 900 | if (tree.type.tag == CLASS) { |
mcimadamore@158 | 901 | List<Type> formals = tree.type.tsym.type.allparams(); |
mcimadamore@158 | 902 | List<Type> actuals = tree.type.allparams(); |
duke@1 | 903 | List<JCExpression> args = tree.arguments; |
mcimadamore@158 | 904 | List<Type> forms = tree.type.tsym.type.getTypeArguments(); |
duke@1 | 905 | ListBuffer<TypeVar> tvars_buf = new ListBuffer<TypeVar>(); |
duke@1 | 906 | |
duke@1 | 907 | // For matching pairs of actual argument types `a' and |
duke@1 | 908 | // formal type parameters with declared bound `b' ... |
duke@1 | 909 | while (args.nonEmpty() && forms.nonEmpty()) { |
mcimadamore@122 | 910 | validate(args.head, env); |
duke@1 | 911 | |
duke@1 | 912 | // exact type arguments needs to know their |
duke@1 | 913 | // bounds (for upper and lower bound |
duke@1 | 914 | // calculations). So we create new TypeVars with |
duke@1 | 915 | // bounds substed with actuals. |
duke@1 | 916 | tvars_buf.append(types.substBound(((TypeVar)forms.head), |
duke@1 | 917 | formals, |
mcimadamore@78 | 918 | actuals)); |
duke@1 | 919 | |
duke@1 | 920 | args = args.tail; |
duke@1 | 921 | forms = forms.tail; |
duke@1 | 922 | } |
duke@1 | 923 | |
duke@1 | 924 | args = tree.arguments; |
mcimadamore@154 | 925 | List<Type> tvars_cap = types.substBounds(formals, |
mcimadamore@154 | 926 | formals, |
mcimadamore@158 | 927 | types.capture(tree.type).allparams()); |
mcimadamore@154 | 928 | while (args.nonEmpty() && tvars_cap.nonEmpty()) { |
mcimadamore@154 | 929 | // Let the actual arguments know their bound |
mcimadamore@154 | 930 | args.head.type.withTypeVar((TypeVar)tvars_cap.head); |
mcimadamore@154 | 931 | args = args.tail; |
mcimadamore@154 | 932 | tvars_cap = tvars_cap.tail; |
mcimadamore@154 | 933 | } |
mcimadamore@154 | 934 | |
mcimadamore@154 | 935 | args = tree.arguments; |
duke@1 | 936 | List<TypeVar> tvars = tvars_buf.toList(); |
mcimadamore@154 | 937 | |
duke@1 | 938 | while (args.nonEmpty() && tvars.nonEmpty()) { |
mcimadamore@154 | 939 | checkExtends(args.head.pos(), |
mcimadamore@154 | 940 | args.head.type, |
mcimadamore@154 | 941 | tvars.head); |
duke@1 | 942 | args = args.tail; |
duke@1 | 943 | tvars = tvars.tail; |
duke@1 | 944 | } |
duke@1 | 945 | |
mcimadamore@154 | 946 | checkCapture(tree); |
mcimadamore@536 | 947 | |
duke@1 | 948 | // Check that this type is either fully parameterized, or |
duke@1 | 949 | // not parameterized at all. |
duke@1 | 950 | if (tree.type.getEnclosingType().isRaw()) |
duke@1 | 951 | log.error(tree.pos(), "improperly.formed.type.inner.raw.param"); |
duke@1 | 952 | if (tree.clazz.getTag() == JCTree.SELECT) |
duke@1 | 953 | visitSelectInternal((JCFieldAccess)tree.clazz); |
duke@1 | 954 | } |
duke@1 | 955 | } |
duke@1 | 956 | |
jjg@398 | 957 | @Override |
duke@1 | 958 | public void visitTypeParameter(JCTypeParameter tree) { |
mcimadamore@122 | 959 | validate(tree.bounds, env); |
duke@1 | 960 | checkClassBounds(tree.pos(), tree.type); |
duke@1 | 961 | } |
duke@1 | 962 | |
duke@1 | 963 | @Override |
duke@1 | 964 | public void visitWildcard(JCWildcard tree) { |
duke@1 | 965 | if (tree.inner != null) |
mcimadamore@122 | 966 | validate(tree.inner, env); |
duke@1 | 967 | } |
duke@1 | 968 | |
jjg@398 | 969 | @Override |
duke@1 | 970 | public void visitSelect(JCFieldAccess tree) { |
duke@1 | 971 | if (tree.type.tag == CLASS) { |
duke@1 | 972 | visitSelectInternal(tree); |
duke@1 | 973 | |
duke@1 | 974 | // Check that this type is either fully parameterized, or |
duke@1 | 975 | // not parameterized at all. |
duke@1 | 976 | if (tree.selected.type.isParameterized() && tree.type.tsym.type.getTypeArguments().nonEmpty()) |
duke@1 | 977 | log.error(tree.pos(), "improperly.formed.type.param.missing"); |
duke@1 | 978 | } |
duke@1 | 979 | } |
duke@1 | 980 | public void visitSelectInternal(JCFieldAccess tree) { |
mcimadamore@122 | 981 | if (tree.type.tsym.isStatic() && |
duke@1 | 982 | tree.selected.type.isParameterized()) { |
duke@1 | 983 | // The enclosing type is not a class, so we are |
duke@1 | 984 | // looking at a static member type. However, the |
duke@1 | 985 | // qualifying expression is parameterized. |
duke@1 | 986 | log.error(tree.pos(), "cant.select.static.class.from.param.type"); |
duke@1 | 987 | } else { |
duke@1 | 988 | // otherwise validate the rest of the expression |
mcimadamore@122 | 989 | tree.selected.accept(this); |
duke@1 | 990 | } |
duke@1 | 991 | } |
duke@1 | 992 | |
jjg@398 | 993 | @Override |
jjg@308 | 994 | public void visitAnnotatedType(JCAnnotatedType tree) { |
jjg@308 | 995 | tree.underlyingType.accept(this); |
jjg@308 | 996 | } |
jjg@308 | 997 | |
duke@1 | 998 | /** Default visitor method: do nothing. |
duke@1 | 999 | */ |
jjg@398 | 1000 | @Override |
duke@1 | 1001 | public void visitTree(JCTree tree) { |
duke@1 | 1002 | } |
mcimadamore@122 | 1003 | |
mcimadamore@122 | 1004 | Env<AttrContext> env; |
duke@1 | 1005 | } |
duke@1 | 1006 | |
duke@1 | 1007 | /* ************************************************************************* |
duke@1 | 1008 | * Exception checking |
duke@1 | 1009 | **************************************************************************/ |
duke@1 | 1010 | |
duke@1 | 1011 | /* The following methods treat classes as sets that contain |
duke@1 | 1012 | * the class itself and all their subclasses |
duke@1 | 1013 | */ |
duke@1 | 1014 | |
duke@1 | 1015 | /** Is given type a subtype of some of the types in given list? |
duke@1 | 1016 | */ |
duke@1 | 1017 | boolean subset(Type t, List<Type> ts) { |
duke@1 | 1018 | for (List<Type> l = ts; l.nonEmpty(); l = l.tail) |
duke@1 | 1019 | if (types.isSubtype(t, l.head)) return true; |
duke@1 | 1020 | return false; |
duke@1 | 1021 | } |
duke@1 | 1022 | |
duke@1 | 1023 | /** Is given type a subtype or supertype of |
duke@1 | 1024 | * some of the types in given list? |
duke@1 | 1025 | */ |
duke@1 | 1026 | boolean intersects(Type t, List<Type> ts) { |
duke@1 | 1027 | for (List<Type> l = ts; l.nonEmpty(); l = l.tail) |
duke@1 | 1028 | if (types.isSubtype(t, l.head) || types.isSubtype(l.head, t)) return true; |
duke@1 | 1029 | return false; |
duke@1 | 1030 | } |
duke@1 | 1031 | |
duke@1 | 1032 | /** Add type set to given type list, unless it is a subclass of some class |
duke@1 | 1033 | * in the list. |
duke@1 | 1034 | */ |
duke@1 | 1035 | List<Type> incl(Type t, List<Type> ts) { |
duke@1 | 1036 | return subset(t, ts) ? ts : excl(t, ts).prepend(t); |
duke@1 | 1037 | } |
duke@1 | 1038 | |
duke@1 | 1039 | /** Remove type set from type set list. |
duke@1 | 1040 | */ |
duke@1 | 1041 | List<Type> excl(Type t, List<Type> ts) { |
duke@1 | 1042 | if (ts.isEmpty()) { |
duke@1 | 1043 | return ts; |
duke@1 | 1044 | } else { |
duke@1 | 1045 | List<Type> ts1 = excl(t, ts.tail); |
duke@1 | 1046 | if (types.isSubtype(ts.head, t)) return ts1; |
duke@1 | 1047 | else if (ts1 == ts.tail) return ts; |
duke@1 | 1048 | else return ts1.prepend(ts.head); |
duke@1 | 1049 | } |
duke@1 | 1050 | } |
duke@1 | 1051 | |
duke@1 | 1052 | /** Form the union of two type set lists. |
duke@1 | 1053 | */ |
duke@1 | 1054 | List<Type> union(List<Type> ts1, List<Type> ts2) { |
duke@1 | 1055 | List<Type> ts = ts1; |
duke@1 | 1056 | for (List<Type> l = ts2; l.nonEmpty(); l = l.tail) |
duke@1 | 1057 | ts = incl(l.head, ts); |
duke@1 | 1058 | return ts; |
duke@1 | 1059 | } |
duke@1 | 1060 | |
duke@1 | 1061 | /** Form the difference of two type lists. |
duke@1 | 1062 | */ |
duke@1 | 1063 | List<Type> diff(List<Type> ts1, List<Type> ts2) { |
duke@1 | 1064 | List<Type> ts = ts1; |
duke@1 | 1065 | for (List<Type> l = ts2; l.nonEmpty(); l = l.tail) |
duke@1 | 1066 | ts = excl(l.head, ts); |
duke@1 | 1067 | return ts; |
duke@1 | 1068 | } |
duke@1 | 1069 | |
duke@1 | 1070 | /** Form the intersection of two type lists. |
duke@1 | 1071 | */ |
duke@1 | 1072 | public List<Type> intersect(List<Type> ts1, List<Type> ts2) { |
duke@1 | 1073 | List<Type> ts = List.nil(); |
duke@1 | 1074 | for (List<Type> l = ts1; l.nonEmpty(); l = l.tail) |
duke@1 | 1075 | if (subset(l.head, ts2)) ts = incl(l.head, ts); |
duke@1 | 1076 | for (List<Type> l = ts2; l.nonEmpty(); l = l.tail) |
duke@1 | 1077 | if (subset(l.head, ts1)) ts = incl(l.head, ts); |
duke@1 | 1078 | return ts; |
duke@1 | 1079 | } |
duke@1 | 1080 | |
duke@1 | 1081 | /** Is exc an exception symbol that need not be declared? |
duke@1 | 1082 | */ |
duke@1 | 1083 | boolean isUnchecked(ClassSymbol exc) { |
duke@1 | 1084 | return |
duke@1 | 1085 | exc.kind == ERR || |
duke@1 | 1086 | exc.isSubClass(syms.errorType.tsym, types) || |
duke@1 | 1087 | exc.isSubClass(syms.runtimeExceptionType.tsym, types); |
duke@1 | 1088 | } |
duke@1 | 1089 | |
duke@1 | 1090 | /** Is exc an exception type that need not be declared? |
duke@1 | 1091 | */ |
duke@1 | 1092 | boolean isUnchecked(Type exc) { |
duke@1 | 1093 | return |
duke@1 | 1094 | (exc.tag == TYPEVAR) ? isUnchecked(types.supertype(exc)) : |
duke@1 | 1095 | (exc.tag == CLASS) ? isUnchecked((ClassSymbol)exc.tsym) : |
duke@1 | 1096 | exc.tag == BOT; |
duke@1 | 1097 | } |
duke@1 | 1098 | |
duke@1 | 1099 | /** Same, but handling completion failures. |
duke@1 | 1100 | */ |
duke@1 | 1101 | boolean isUnchecked(DiagnosticPosition pos, Type exc) { |
duke@1 | 1102 | try { |
duke@1 | 1103 | return isUnchecked(exc); |
duke@1 | 1104 | } catch (CompletionFailure ex) { |
duke@1 | 1105 | completionError(pos, ex); |
duke@1 | 1106 | return true; |
duke@1 | 1107 | } |
duke@1 | 1108 | } |
duke@1 | 1109 | |
duke@1 | 1110 | /** Is exc handled by given exception list? |
duke@1 | 1111 | */ |
duke@1 | 1112 | boolean isHandled(Type exc, List<Type> handled) { |
duke@1 | 1113 | return isUnchecked(exc) || subset(exc, handled); |
duke@1 | 1114 | } |
duke@1 | 1115 | |
duke@1 | 1116 | /** Return all exceptions in thrown list that are not in handled list. |
duke@1 | 1117 | * @param thrown The list of thrown exceptions. |
duke@1 | 1118 | * @param handled The list of handled exceptions. |
duke@1 | 1119 | */ |
mcimadamore@362 | 1120 | List<Type> unhandled(List<Type> thrown, List<Type> handled) { |
duke@1 | 1121 | List<Type> unhandled = List.nil(); |
duke@1 | 1122 | for (List<Type> l = thrown; l.nonEmpty(); l = l.tail) |
duke@1 | 1123 | if (!isHandled(l.head, handled)) unhandled = unhandled.prepend(l.head); |
duke@1 | 1124 | return unhandled; |
duke@1 | 1125 | } |
duke@1 | 1126 | |
duke@1 | 1127 | /* ************************************************************************* |
duke@1 | 1128 | * Overriding/Implementation checking |
duke@1 | 1129 | **************************************************************************/ |
duke@1 | 1130 | |
duke@1 | 1131 | /** The level of access protection given by a flag set, |
duke@1 | 1132 | * where PRIVATE is highest and PUBLIC is lowest. |
duke@1 | 1133 | */ |
duke@1 | 1134 | static int protection(long flags) { |
duke@1 | 1135 | switch ((short)(flags & AccessFlags)) { |
duke@1 | 1136 | case PRIVATE: return 3; |
duke@1 | 1137 | case PROTECTED: return 1; |
duke@1 | 1138 | default: |
duke@1 | 1139 | case PUBLIC: return 0; |
duke@1 | 1140 | case 0: return 2; |
duke@1 | 1141 | } |
duke@1 | 1142 | } |
duke@1 | 1143 | |
duke@1 | 1144 | /** A customized "cannot override" error message. |
duke@1 | 1145 | * @param m The overriding method. |
duke@1 | 1146 | * @param other The overridden method. |
duke@1 | 1147 | * @return An internationalized string. |
duke@1 | 1148 | */ |
mcimadamore@89 | 1149 | Object cannotOverride(MethodSymbol m, MethodSymbol other) { |
duke@1 | 1150 | String key; |
duke@1 | 1151 | if ((other.owner.flags() & INTERFACE) == 0) |
duke@1 | 1152 | key = "cant.override"; |
duke@1 | 1153 | else if ((m.owner.flags() & INTERFACE) == 0) |
duke@1 | 1154 | key = "cant.implement"; |
duke@1 | 1155 | else |
duke@1 | 1156 | key = "clashes.with"; |
mcimadamore@89 | 1157 | return diags.fragment(key, m, m.location(), other, other.location()); |
duke@1 | 1158 | } |
duke@1 | 1159 | |
duke@1 | 1160 | /** A customized "override" warning message. |
duke@1 | 1161 | * @param m The overriding method. |
duke@1 | 1162 | * @param other The overridden method. |
duke@1 | 1163 | * @return An internationalized string. |
duke@1 | 1164 | */ |
mcimadamore@89 | 1165 | Object uncheckedOverrides(MethodSymbol m, MethodSymbol other) { |
duke@1 | 1166 | String key; |
duke@1 | 1167 | if ((other.owner.flags() & INTERFACE) == 0) |
duke@1 | 1168 | key = "unchecked.override"; |
duke@1 | 1169 | else if ((m.owner.flags() & INTERFACE) == 0) |
duke@1 | 1170 | key = "unchecked.implement"; |
duke@1 | 1171 | else |
duke@1 | 1172 | key = "unchecked.clash.with"; |
mcimadamore@89 | 1173 | return diags.fragment(key, m, m.location(), other, other.location()); |
duke@1 | 1174 | } |
duke@1 | 1175 | |
duke@1 | 1176 | /** A customized "override" warning message. |
duke@1 | 1177 | * @param m The overriding method. |
duke@1 | 1178 | * @param other The overridden method. |
duke@1 | 1179 | * @return An internationalized string. |
duke@1 | 1180 | */ |
mcimadamore@89 | 1181 | Object varargsOverrides(MethodSymbol m, MethodSymbol other) { |
duke@1 | 1182 | String key; |
duke@1 | 1183 | if ((other.owner.flags() & INTERFACE) == 0) |
duke@1 | 1184 | key = "varargs.override"; |
duke@1 | 1185 | else if ((m.owner.flags() & INTERFACE) == 0) |
duke@1 | 1186 | key = "varargs.implement"; |
duke@1 | 1187 | else |
duke@1 | 1188 | key = "varargs.clash.with"; |
mcimadamore@89 | 1189 | return diags.fragment(key, m, m.location(), other, other.location()); |
duke@1 | 1190 | } |
duke@1 | 1191 | |
duke@1 | 1192 | /** Check that this method conforms with overridden method 'other'. |
duke@1 | 1193 | * where `origin' is the class where checking started. |
duke@1 | 1194 | * Complications: |
duke@1 | 1195 | * (1) Do not check overriding of synthetic methods |
duke@1 | 1196 | * (reason: they might be final). |
duke@1 | 1197 | * todo: check whether this is still necessary. |
duke@1 | 1198 | * (2) Admit the case where an interface proxy throws fewer exceptions |
duke@1 | 1199 | * than the method it implements. Augment the proxy methods with the |
duke@1 | 1200 | * undeclared exceptions in this case. |
duke@1 | 1201 | * (3) When generics are enabled, admit the case where an interface proxy |
duke@1 | 1202 | * has a result type |
duke@1 | 1203 | * extended by the result type of the method it implements. |
duke@1 | 1204 | * Change the proxies result type to the smaller type in this case. |
duke@1 | 1205 | * |
duke@1 | 1206 | * @param tree The tree from which positions |
duke@1 | 1207 | * are extracted for errors. |
duke@1 | 1208 | * @param m The overriding method. |
duke@1 | 1209 | * @param other The overridden method. |
duke@1 | 1210 | * @param origin The class of which the overriding method |
duke@1 | 1211 | * is a member. |
duke@1 | 1212 | */ |
duke@1 | 1213 | void checkOverride(JCTree tree, |
duke@1 | 1214 | MethodSymbol m, |
duke@1 | 1215 | MethodSymbol other, |
duke@1 | 1216 | ClassSymbol origin) { |
duke@1 | 1217 | // Don't check overriding of synthetic methods or by bridge methods. |
duke@1 | 1218 | if ((m.flags() & (SYNTHETIC|BRIDGE)) != 0 || (other.flags() & SYNTHETIC) != 0) { |
duke@1 | 1219 | return; |
duke@1 | 1220 | } |
duke@1 | 1221 | |
duke@1 | 1222 | // Error if static method overrides instance method (JLS 8.4.6.2). |
duke@1 | 1223 | if ((m.flags() & STATIC) != 0 && |
duke@1 | 1224 | (other.flags() & STATIC) == 0) { |
duke@1 | 1225 | log.error(TreeInfo.diagnosticPositionFor(m, tree), "override.static", |
duke@1 | 1226 | cannotOverride(m, other)); |
duke@1 | 1227 | return; |
duke@1 | 1228 | } |
duke@1 | 1229 | |
duke@1 | 1230 | // Error if instance method overrides static or final |
duke@1 | 1231 | // method (JLS 8.4.6.1). |
duke@1 | 1232 | if ((other.flags() & FINAL) != 0 || |
duke@1 | 1233 | (m.flags() & STATIC) == 0 && |
duke@1 | 1234 | (other.flags() & STATIC) != 0) { |
duke@1 | 1235 | log.error(TreeInfo.diagnosticPositionFor(m, tree), "override.meth", |
duke@1 | 1236 | cannotOverride(m, other), |
mcimadamore@80 | 1237 | asFlagSet(other.flags() & (FINAL | STATIC))); |
duke@1 | 1238 | return; |
duke@1 | 1239 | } |
duke@1 | 1240 | |
duke@1 | 1241 | if ((m.owner.flags() & ANNOTATION) != 0) { |
duke@1 | 1242 | // handled in validateAnnotationMethod |
duke@1 | 1243 | return; |
duke@1 | 1244 | } |
duke@1 | 1245 | |
duke@1 | 1246 | // Error if overriding method has weaker access (JLS 8.4.6.3). |
duke@1 | 1247 | if ((origin.flags() & INTERFACE) == 0 && |
duke@1 | 1248 | protection(m.flags()) > protection(other.flags())) { |
duke@1 | 1249 | log.error(TreeInfo.diagnosticPositionFor(m, tree), "override.weaker.access", |
duke@1 | 1250 | cannotOverride(m, other), |
mcimadamore@80 | 1251 | other.flags() == 0 ? |
mcimadamore@80 | 1252 | Flag.PACKAGE : |
mcimadamore@80 | 1253 | asFlagSet(other.flags() & AccessFlags)); |
duke@1 | 1254 | return; |
duke@1 | 1255 | } |
duke@1 | 1256 | |
duke@1 | 1257 | Type mt = types.memberType(origin.type, m); |
duke@1 | 1258 | Type ot = types.memberType(origin.type, other); |
duke@1 | 1259 | // Error if overriding result type is different |
duke@1 | 1260 | // (or, in the case of generics mode, not a subtype) of |
duke@1 | 1261 | // overridden result type. We have to rename any type parameters |
duke@1 | 1262 | // before comparing types. |
duke@1 | 1263 | List<Type> mtvars = mt.getTypeArguments(); |
duke@1 | 1264 | List<Type> otvars = ot.getTypeArguments(); |
duke@1 | 1265 | Type mtres = mt.getReturnType(); |
duke@1 | 1266 | Type otres = types.subst(ot.getReturnType(), otvars, mtvars); |
duke@1 | 1267 | |
duke@1 | 1268 | overrideWarner.warned = false; |
duke@1 | 1269 | boolean resultTypesOK = |
tbell@202 | 1270 | types.returnTypeSubstitutable(mt, ot, otres, overrideWarner); |
duke@1 | 1271 | if (!resultTypesOK) { |
jjg@398 | 1272 | if (!allowCovariantReturns && |
duke@1 | 1273 | m.owner != origin && |
duke@1 | 1274 | m.owner.isSubClass(other.owner, types)) { |
duke@1 | 1275 | // allow limited interoperability with covariant returns |
duke@1 | 1276 | } else { |
mcimadamore@362 | 1277 | log.error(TreeInfo.diagnosticPositionFor(m, tree), |
mcimadamore@362 | 1278 | "override.incompatible.ret", |
mcimadamore@362 | 1279 | cannotOverride(m, other), |
duke@1 | 1280 | mtres, otres); |
duke@1 | 1281 | return; |
duke@1 | 1282 | } |
duke@1 | 1283 | } else if (overrideWarner.warned) { |
duke@1 | 1284 | warnUnchecked(TreeInfo.diagnosticPositionFor(m, tree), |
mcimadamore@362 | 1285 | "override.unchecked.ret", |
mcimadamore@362 | 1286 | uncheckedOverrides(m, other), |
mcimadamore@362 | 1287 | mtres, otres); |
duke@1 | 1288 | } |
duke@1 | 1289 | |
duke@1 | 1290 | // Error if overriding method throws an exception not reported |
duke@1 | 1291 | // by overridden method. |
duke@1 | 1292 | List<Type> otthrown = types.subst(ot.getThrownTypes(), otvars, mtvars); |
mcimadamore@362 | 1293 | List<Type> unhandledErased = unhandled(mt.getThrownTypes(), types.erasure(otthrown)); |
mcimadamore@362 | 1294 | List<Type> unhandledUnerased = unhandled(mt.getThrownTypes(), otthrown); |
mcimadamore@362 | 1295 | if (unhandledErased.nonEmpty()) { |
duke@1 | 1296 | log.error(TreeInfo.diagnosticPositionFor(m, tree), |
duke@1 | 1297 | "override.meth.doesnt.throw", |
duke@1 | 1298 | cannotOverride(m, other), |
mcimadamore@362 | 1299 | unhandledUnerased.head); |
mcimadamore@362 | 1300 | return; |
mcimadamore@362 | 1301 | } |
mcimadamore@362 | 1302 | else if (unhandledUnerased.nonEmpty()) { |
mcimadamore@362 | 1303 | warnUnchecked(TreeInfo.diagnosticPositionFor(m, tree), |
mcimadamore@362 | 1304 | "override.unchecked.thrown", |
mcimadamore@362 | 1305 | cannotOverride(m, other), |
mcimadamore@362 | 1306 | unhandledUnerased.head); |
duke@1 | 1307 | return; |
duke@1 | 1308 | } |
duke@1 | 1309 | |
duke@1 | 1310 | // Optional warning if varargs don't agree |
duke@1 | 1311 | if ((((m.flags() ^ other.flags()) & Flags.VARARGS) != 0) |
duke@1 | 1312 | && lint.isEnabled(Lint.LintCategory.OVERRIDES)) { |
duke@1 | 1313 | log.warning(TreeInfo.diagnosticPositionFor(m, tree), |
duke@1 | 1314 | ((m.flags() & Flags.VARARGS) != 0) |
duke@1 | 1315 | ? "override.varargs.missing" |
duke@1 | 1316 | : "override.varargs.extra", |
duke@1 | 1317 | varargsOverrides(m, other)); |
duke@1 | 1318 | } |
duke@1 | 1319 | |
duke@1 | 1320 | // Warn if instance method overrides bridge method (compiler spec ??) |
duke@1 | 1321 | if ((other.flags() & BRIDGE) != 0) { |
duke@1 | 1322 | log.warning(TreeInfo.diagnosticPositionFor(m, tree), "override.bridge", |
duke@1 | 1323 | uncheckedOverrides(m, other)); |
duke@1 | 1324 | } |
duke@1 | 1325 | |
duke@1 | 1326 | // Warn if a deprecated method overridden by a non-deprecated one. |
duke@1 | 1327 | if ((other.flags() & DEPRECATED) != 0 |
duke@1 | 1328 | && (m.flags() & DEPRECATED) == 0 |
duke@1 | 1329 | && m.outermostClass() != other.outermostClass() |
duke@1 | 1330 | && !isDeprecatedOverrideIgnorable(other, origin)) { |
duke@1 | 1331 | warnDeprecated(TreeInfo.diagnosticPositionFor(m, tree), other); |
duke@1 | 1332 | } |
duke@1 | 1333 | } |
duke@1 | 1334 | // where |
duke@1 | 1335 | private boolean isDeprecatedOverrideIgnorable(MethodSymbol m, ClassSymbol origin) { |
duke@1 | 1336 | // If the method, m, is defined in an interface, then ignore the issue if the method |
duke@1 | 1337 | // is only inherited via a supertype and also implemented in the supertype, |
duke@1 | 1338 | // because in that case, we will rediscover the issue when examining the method |
duke@1 | 1339 | // in the supertype. |
duke@1 | 1340 | // If the method, m, is not defined in an interface, then the only time we need to |
duke@1 | 1341 | // address the issue is when the method is the supertype implemementation: any other |
duke@1 | 1342 | // case, we will have dealt with when examining the supertype classes |
duke@1 | 1343 | ClassSymbol mc = m.enclClass(); |
duke@1 | 1344 | Type st = types.supertype(origin.type); |
duke@1 | 1345 | if (st.tag != CLASS) |
duke@1 | 1346 | return true; |
duke@1 | 1347 | MethodSymbol stimpl = m.implementation((ClassSymbol)st.tsym, types, false); |
duke@1 | 1348 | |
duke@1 | 1349 | if (mc != null && ((mc.flags() & INTERFACE) != 0)) { |
duke@1 | 1350 | List<Type> intfs = types.interfaces(origin.type); |
duke@1 | 1351 | return (intfs.contains(mc.type) ? false : (stimpl != null)); |
duke@1 | 1352 | } |
duke@1 | 1353 | else |
duke@1 | 1354 | return (stimpl != m); |
duke@1 | 1355 | } |
duke@1 | 1356 | |
duke@1 | 1357 | |
duke@1 | 1358 | // used to check if there were any unchecked conversions |
duke@1 | 1359 | Warner overrideWarner = new Warner(); |
duke@1 | 1360 | |
duke@1 | 1361 | /** Check that a class does not inherit two concrete methods |
duke@1 | 1362 | * with the same signature. |
duke@1 | 1363 | * @param pos Position to be used for error reporting. |
duke@1 | 1364 | * @param site The class type to be checked. |
duke@1 | 1365 | */ |
duke@1 | 1366 | public void checkCompatibleConcretes(DiagnosticPosition pos, Type site) { |
duke@1 | 1367 | Type sup = types.supertype(site); |
duke@1 | 1368 | if (sup.tag != CLASS) return; |
duke@1 | 1369 | |
duke@1 | 1370 | for (Type t1 = sup; |
duke@1 | 1371 | t1.tsym.type.isParameterized(); |
duke@1 | 1372 | t1 = types.supertype(t1)) { |
duke@1 | 1373 | for (Scope.Entry e1 = t1.tsym.members().elems; |
duke@1 | 1374 | e1 != null; |
duke@1 | 1375 | e1 = e1.sibling) { |
duke@1 | 1376 | Symbol s1 = e1.sym; |
duke@1 | 1377 | if (s1.kind != MTH || |
duke@1 | 1378 | (s1.flags() & (STATIC|SYNTHETIC|BRIDGE)) != 0 || |
duke@1 | 1379 | !s1.isInheritedIn(site.tsym, types) || |
duke@1 | 1380 | ((MethodSymbol)s1).implementation(site.tsym, |
duke@1 | 1381 | types, |
duke@1 | 1382 | true) != s1) |
duke@1 | 1383 | continue; |
duke@1 | 1384 | Type st1 = types.memberType(t1, s1); |
duke@1 | 1385 | int s1ArgsLength = st1.getParameterTypes().length(); |
duke@1 | 1386 | if (st1 == s1.type) continue; |
duke@1 | 1387 | |
duke@1 | 1388 | for (Type t2 = sup; |
duke@1 | 1389 | t2.tag == CLASS; |
duke@1 | 1390 | t2 = types.supertype(t2)) { |
mcimadamore@24 | 1391 | for (Scope.Entry e2 = t2.tsym.members().lookup(s1.name); |
duke@1 | 1392 | e2.scope != null; |
duke@1 | 1393 | e2 = e2.next()) { |
duke@1 | 1394 | Symbol s2 = e2.sym; |
duke@1 | 1395 | if (s2 == s1 || |
duke@1 | 1396 | s2.kind != MTH || |
duke@1 | 1397 | (s2.flags() & (STATIC|SYNTHETIC|BRIDGE)) != 0 || |
duke@1 | 1398 | s2.type.getParameterTypes().length() != s1ArgsLength || |
duke@1 | 1399 | !s2.isInheritedIn(site.tsym, types) || |
duke@1 | 1400 | ((MethodSymbol)s2).implementation(site.tsym, |
duke@1 | 1401 | types, |
duke@1 | 1402 | true) != s2) |
duke@1 | 1403 | continue; |
duke@1 | 1404 | Type st2 = types.memberType(t2, s2); |
duke@1 | 1405 | if (types.overrideEquivalent(st1, st2)) |
duke@1 | 1406 | log.error(pos, "concrete.inheritance.conflict", |
duke@1 | 1407 | s1, t1, s2, t2, sup); |
duke@1 | 1408 | } |
duke@1 | 1409 | } |
duke@1 | 1410 | } |
duke@1 | 1411 | } |
duke@1 | 1412 | } |
duke@1 | 1413 | |
duke@1 | 1414 | /** Check that classes (or interfaces) do not each define an abstract |
duke@1 | 1415 | * method with same name and arguments but incompatible return types. |
duke@1 | 1416 | * @param pos Position to be used for error reporting. |
duke@1 | 1417 | * @param t1 The first argument type. |
duke@1 | 1418 | * @param t2 The second argument type. |
duke@1 | 1419 | */ |
duke@1 | 1420 | public boolean checkCompatibleAbstracts(DiagnosticPosition pos, |
duke@1 | 1421 | Type t1, |
duke@1 | 1422 | Type t2) { |
duke@1 | 1423 | return checkCompatibleAbstracts(pos, t1, t2, |
duke@1 | 1424 | types.makeCompoundType(t1, t2)); |
duke@1 | 1425 | } |
duke@1 | 1426 | |
duke@1 | 1427 | public boolean checkCompatibleAbstracts(DiagnosticPosition pos, |
duke@1 | 1428 | Type t1, |
duke@1 | 1429 | Type t2, |
duke@1 | 1430 | Type site) { |
duke@1 | 1431 | Symbol sym = firstIncompatibility(t1, t2, site); |
duke@1 | 1432 | if (sym != null) { |
duke@1 | 1433 | log.error(pos, "types.incompatible.diff.ret", |
duke@1 | 1434 | t1, t2, sym.name + |
duke@1 | 1435 | "(" + types.memberType(t2, sym).getParameterTypes() + ")"); |
duke@1 | 1436 | return false; |
duke@1 | 1437 | } |
duke@1 | 1438 | return true; |
duke@1 | 1439 | } |
duke@1 | 1440 | |
duke@1 | 1441 | /** Return the first method which is defined with same args |
duke@1 | 1442 | * but different return types in two given interfaces, or null if none |
duke@1 | 1443 | * exists. |
duke@1 | 1444 | * @param t1 The first type. |
duke@1 | 1445 | * @param t2 The second type. |
duke@1 | 1446 | * @param site The most derived type. |
duke@1 | 1447 | * @returns symbol from t2 that conflicts with one in t1. |
duke@1 | 1448 | */ |
duke@1 | 1449 | private Symbol firstIncompatibility(Type t1, Type t2, Type site) { |
duke@1 | 1450 | Map<TypeSymbol,Type> interfaces1 = new HashMap<TypeSymbol,Type>(); |
duke@1 | 1451 | closure(t1, interfaces1); |
duke@1 | 1452 | Map<TypeSymbol,Type> interfaces2; |
duke@1 | 1453 | if (t1 == t2) |
duke@1 | 1454 | interfaces2 = interfaces1; |
duke@1 | 1455 | else |
duke@1 | 1456 | closure(t2, interfaces1, interfaces2 = new HashMap<TypeSymbol,Type>()); |
duke@1 | 1457 | |
duke@1 | 1458 | for (Type t3 : interfaces1.values()) { |
duke@1 | 1459 | for (Type t4 : interfaces2.values()) { |
duke@1 | 1460 | Symbol s = firstDirectIncompatibility(t3, t4, site); |
duke@1 | 1461 | if (s != null) return s; |
duke@1 | 1462 | } |
duke@1 | 1463 | } |
duke@1 | 1464 | return null; |
duke@1 | 1465 | } |
duke@1 | 1466 | |
duke@1 | 1467 | /** Compute all the supertypes of t, indexed by type symbol. */ |
duke@1 | 1468 | private void closure(Type t, Map<TypeSymbol,Type> typeMap) { |
duke@1 | 1469 | if (t.tag != CLASS) return; |
duke@1 | 1470 | if (typeMap.put(t.tsym, t) == null) { |
duke@1 | 1471 | closure(types.supertype(t), typeMap); |
duke@1 | 1472 | for (Type i : types.interfaces(t)) |
duke@1 | 1473 | closure(i, typeMap); |
duke@1 | 1474 | } |
duke@1 | 1475 | } |
duke@1 | 1476 | |
duke@1 | 1477 | /** Compute all the supertypes of t, indexed by type symbol (except thise in typesSkip). */ |
duke@1 | 1478 | private void closure(Type t, Map<TypeSymbol,Type> typesSkip, Map<TypeSymbol,Type> typeMap) { |
duke@1 | 1479 | if (t.tag != CLASS) return; |
duke@1 | 1480 | if (typesSkip.get(t.tsym) != null) return; |
duke@1 | 1481 | if (typeMap.put(t.tsym, t) == null) { |
duke@1 | 1482 | closure(types.supertype(t), typesSkip, typeMap); |
duke@1 | 1483 | for (Type i : types.interfaces(t)) |
duke@1 | 1484 | closure(i, typesSkip, typeMap); |
duke@1 | 1485 | } |
duke@1 | 1486 | } |
duke@1 | 1487 | |
duke@1 | 1488 | /** Return the first method in t2 that conflicts with a method from t1. */ |
duke@1 | 1489 | private Symbol firstDirectIncompatibility(Type t1, Type t2, Type site) { |
duke@1 | 1490 | for (Scope.Entry e1 = t1.tsym.members().elems; e1 != null; e1 = e1.sibling) { |
duke@1 | 1491 | Symbol s1 = e1.sym; |
duke@1 | 1492 | Type st1 = null; |
duke@1 | 1493 | if (s1.kind != MTH || !s1.isInheritedIn(site.tsym, types)) continue; |
duke@1 | 1494 | Symbol impl = ((MethodSymbol)s1).implementation(site.tsym, types, false); |
duke@1 | 1495 | if (impl != null && (impl.flags() & ABSTRACT) == 0) continue; |
duke@1 | 1496 | for (Scope.Entry e2 = t2.tsym.members().lookup(s1.name); e2.scope != null; e2 = e2.next()) { |
duke@1 | 1497 | Symbol s2 = e2.sym; |
duke@1 | 1498 | if (s1 == s2) continue; |
duke@1 | 1499 | if (s2.kind != MTH || !s2.isInheritedIn(site.tsym, types)) continue; |
duke@1 | 1500 | if (st1 == null) st1 = types.memberType(t1, s1); |
duke@1 | 1501 | Type st2 = types.memberType(t2, s2); |
duke@1 | 1502 | if (types.overrideEquivalent(st1, st2)) { |
duke@1 | 1503 | List<Type> tvars1 = st1.getTypeArguments(); |
duke@1 | 1504 | List<Type> tvars2 = st2.getTypeArguments(); |
duke@1 | 1505 | Type rt1 = st1.getReturnType(); |
duke@1 | 1506 | Type rt2 = types.subst(st2.getReturnType(), tvars2, tvars1); |
duke@1 | 1507 | boolean compat = |
duke@1 | 1508 | types.isSameType(rt1, rt2) || |
duke@1 | 1509 | rt1.tag >= CLASS && rt2.tag >= CLASS && |
duke@1 | 1510 | (types.covariantReturnType(rt1, rt2, Warner.noWarnings) || |
mcimadamore@59 | 1511 | types.covariantReturnType(rt2, rt1, Warner.noWarnings)) || |
mcimadamore@59 | 1512 | checkCommonOverriderIn(s1,s2,site); |
duke@1 | 1513 | if (!compat) return s2; |
duke@1 | 1514 | } |
duke@1 | 1515 | } |
duke@1 | 1516 | } |
duke@1 | 1517 | return null; |
duke@1 | 1518 | } |
mcimadamore@59 | 1519 | //WHERE |
mcimadamore@59 | 1520 | boolean checkCommonOverriderIn(Symbol s1, Symbol s2, Type site) { |
mcimadamore@59 | 1521 | Map<TypeSymbol,Type> supertypes = new HashMap<TypeSymbol,Type>(); |
mcimadamore@59 | 1522 | Type st1 = types.memberType(site, s1); |
mcimadamore@59 | 1523 | Type st2 = types.memberType(site, s2); |
mcimadamore@59 | 1524 | closure(site, supertypes); |
mcimadamore@59 | 1525 | for (Type t : supertypes.values()) { |
mcimadamore@59 | 1526 | for (Scope.Entry e = t.tsym.members().lookup(s1.name); e.scope != null; e = e.next()) { |
mcimadamore@59 | 1527 | Symbol s3 = e.sym; |
mcimadamore@59 | 1528 | if (s3 == s1 || s3 == s2 || s3.kind != MTH || (s3.flags() & (BRIDGE|SYNTHETIC)) != 0) continue; |
mcimadamore@59 | 1529 | Type st3 = types.memberType(site,s3); |
mcimadamore@59 | 1530 | if (types.overrideEquivalent(st3, st1) && types.overrideEquivalent(st3, st2)) { |
mcimadamore@59 | 1531 | if (s3.owner == site.tsym) { |
mcimadamore@59 | 1532 | return true; |
mcimadamore@59 | 1533 | } |
mcimadamore@59 | 1534 | List<Type> tvars1 = st1.getTypeArguments(); |
mcimadamore@59 | 1535 | List<Type> tvars2 = st2.getTypeArguments(); |
mcimadamore@59 | 1536 | List<Type> tvars3 = st3.getTypeArguments(); |
mcimadamore@59 | 1537 | Type rt1 = st1.getReturnType(); |
mcimadamore@59 | 1538 | Type rt2 = st2.getReturnType(); |
mcimadamore@59 | 1539 | Type rt13 = types.subst(st3.getReturnType(), tvars3, tvars1); |
mcimadamore@59 | 1540 | Type rt23 = types.subst(st3.getReturnType(), tvars3, tvars2); |
mcimadamore@59 | 1541 | boolean compat = |
mcimadamore@59 | 1542 | rt13.tag >= CLASS && rt23.tag >= CLASS && |
mcimadamore@59 | 1543 | (types.covariantReturnType(rt13, rt1, Warner.noWarnings) && |
mcimadamore@59 | 1544 | types.covariantReturnType(rt23, rt2, Warner.noWarnings)); |
mcimadamore@59 | 1545 | if (compat) |
mcimadamore@59 | 1546 | return true; |
mcimadamore@59 | 1547 | } |
mcimadamore@59 | 1548 | } |
mcimadamore@59 | 1549 | } |
mcimadamore@59 | 1550 | return false; |
mcimadamore@59 | 1551 | } |
duke@1 | 1552 | |
duke@1 | 1553 | /** Check that a given method conforms with any method it overrides. |
duke@1 | 1554 | * @param tree The tree from which positions are extracted |
duke@1 | 1555 | * for errors. |
duke@1 | 1556 | * @param m The overriding method. |
duke@1 | 1557 | */ |
duke@1 | 1558 | void checkOverride(JCTree tree, MethodSymbol m) { |
duke@1 | 1559 | ClassSymbol origin = (ClassSymbol)m.owner; |
duke@1 | 1560 | if ((origin.flags() & ENUM) != 0 && names.finalize.equals(m.name)) |
duke@1 | 1561 | if (m.overrides(syms.enumFinalFinalize, origin, types, false)) { |
duke@1 | 1562 | log.error(tree.pos(), "enum.no.finalize"); |
duke@1 | 1563 | return; |
duke@1 | 1564 | } |
duke@1 | 1565 | for (Type t = types.supertype(origin.type); t.tag == CLASS; |
duke@1 | 1566 | t = types.supertype(t)) { |
duke@1 | 1567 | TypeSymbol c = t.tsym; |
duke@1 | 1568 | Scope.Entry e = c.members().lookup(m.name); |
duke@1 | 1569 | while (e.scope != null) { |
duke@1 | 1570 | if (m.overrides(e.sym, origin, types, false)) |
duke@1 | 1571 | checkOverride(tree, m, (MethodSymbol)e.sym, origin); |
mcimadamore@252 | 1572 | else if (e.sym.kind == MTH && |
mcimadamore@252 | 1573 | e.sym.isInheritedIn(origin, types) && |
mcimadamore@252 | 1574 | (e.sym.flags() & SYNTHETIC) == 0 && |
mcimadamore@252 | 1575 | !m.isConstructor()) { |
mcimadamore@24 | 1576 | Type er1 = m.erasure(types); |
mcimadamore@24 | 1577 | Type er2 = e.sym.erasure(types); |
mcimadamore@252 | 1578 | if (types.isSameTypes(er1.getParameterTypes(), |
mcimadamore@252 | 1579 | er2.getParameterTypes())) { |
mcimadamore@24 | 1580 | log.error(TreeInfo.diagnosticPositionFor(m, tree), |
mcimadamore@24 | 1581 | "name.clash.same.erasure.no.override", |
mcimadamore@24 | 1582 | m, m.location(), |
mcimadamore@24 | 1583 | e.sym, e.sym.location()); |
mcimadamore@24 | 1584 | } |
mcimadamore@24 | 1585 | } |
duke@1 | 1586 | e = e.next(); |
duke@1 | 1587 | } |
duke@1 | 1588 | } |
duke@1 | 1589 | } |
duke@1 | 1590 | |
duke@1 | 1591 | /** Check that all abstract members of given class have definitions. |
duke@1 | 1592 | * @param pos Position to be used for error reporting. |
duke@1 | 1593 | * @param c The class. |
duke@1 | 1594 | */ |
duke@1 | 1595 | void checkAllDefined(DiagnosticPosition pos, ClassSymbol c) { |
duke@1 | 1596 | try { |
duke@1 | 1597 | MethodSymbol undef = firstUndef(c, c); |
duke@1 | 1598 | if (undef != null) { |
duke@1 | 1599 | if ((c.flags() & ENUM) != 0 && |
duke@1 | 1600 | types.supertype(c.type).tsym == syms.enumSym && |
duke@1 | 1601 | (c.flags() & FINAL) == 0) { |
duke@1 | 1602 | // add the ABSTRACT flag to an enum |
duke@1 | 1603 | c.flags_field |= ABSTRACT; |
duke@1 | 1604 | } else { |
duke@1 | 1605 | MethodSymbol undef1 = |
duke@1 | 1606 | new MethodSymbol(undef.flags(), undef.name, |
duke@1 | 1607 | types.memberType(c.type, undef), undef.owner); |
duke@1 | 1608 | log.error(pos, "does.not.override.abstract", |
duke@1 | 1609 | c, undef1, undef1.location()); |
duke@1 | 1610 | } |
duke@1 | 1611 | } |
duke@1 | 1612 | } catch (CompletionFailure ex) { |
duke@1 | 1613 | completionError(pos, ex); |
duke@1 | 1614 | } |
duke@1 | 1615 | } |
duke@1 | 1616 | //where |
duke@1 | 1617 | /** Return first abstract member of class `c' that is not defined |
duke@1 | 1618 | * in `impl', null if there is none. |
duke@1 | 1619 | */ |
duke@1 | 1620 | private MethodSymbol firstUndef(ClassSymbol impl, ClassSymbol c) { |
duke@1 | 1621 | MethodSymbol undef = null; |
duke@1 | 1622 | // Do not bother to search in classes that are not abstract, |
duke@1 | 1623 | // since they cannot have abstract members. |
duke@1 | 1624 | if (c == impl || (c.flags() & (ABSTRACT | INTERFACE)) != 0) { |
duke@1 | 1625 | Scope s = c.members(); |
duke@1 | 1626 | for (Scope.Entry e = s.elems; |
duke@1 | 1627 | undef == null && e != null; |
duke@1 | 1628 | e = e.sibling) { |
duke@1 | 1629 | if (e.sym.kind == MTH && |
duke@1 | 1630 | (e.sym.flags() & (ABSTRACT|IPROXY)) == ABSTRACT) { |
duke@1 | 1631 | MethodSymbol absmeth = (MethodSymbol)e.sym; |
duke@1 | 1632 | MethodSymbol implmeth = absmeth.implementation(impl, types, true); |
duke@1 | 1633 | if (implmeth == null || implmeth == absmeth) |
duke@1 | 1634 | undef = absmeth; |
duke@1 | 1635 | } |
duke@1 | 1636 | } |
duke@1 | 1637 | if (undef == null) { |
duke@1 | 1638 | Type st = types.supertype(c.type); |
duke@1 | 1639 | if (st.tag == CLASS) |
duke@1 | 1640 | undef = firstUndef(impl, (ClassSymbol)st.tsym); |
duke@1 | 1641 | } |
duke@1 | 1642 | for (List<Type> l = types.interfaces(c.type); |
duke@1 | 1643 | undef == null && l.nonEmpty(); |
duke@1 | 1644 | l = l.tail) { |
duke@1 | 1645 | undef = firstUndef(impl, (ClassSymbol)l.head.tsym); |
duke@1 | 1646 | } |
duke@1 | 1647 | } |
duke@1 | 1648 | return undef; |
duke@1 | 1649 | } |
duke@1 | 1650 | |
duke@1 | 1651 | /** Check for cyclic references. Issue an error if the |
duke@1 | 1652 | * symbol of the type referred to has a LOCKED flag set. |
duke@1 | 1653 | * |
duke@1 | 1654 | * @param pos Position to be used for error reporting. |
duke@1 | 1655 | * @param t The type referred to. |
duke@1 | 1656 | */ |
duke@1 | 1657 | void checkNonCyclic(DiagnosticPosition pos, Type t) { |
duke@1 | 1658 | checkNonCyclicInternal(pos, t); |
duke@1 | 1659 | } |
duke@1 | 1660 | |
duke@1 | 1661 | |
duke@1 | 1662 | void checkNonCyclic(DiagnosticPosition pos, TypeVar t) { |
mcimadamore@236 | 1663 | checkNonCyclic1(pos, t, List.<TypeVar>nil()); |
duke@1 | 1664 | } |
duke@1 | 1665 | |
mcimadamore@236 | 1666 | private void checkNonCyclic1(DiagnosticPosition pos, Type t, List<TypeVar> seen) { |
duke@1 | 1667 | final TypeVar tv; |
mcimadamore@42 | 1668 | if (t.tag == TYPEVAR && (t.tsym.flags() & UNATTRIBUTED) != 0) |
mcimadamore@42 | 1669 | return; |
duke@1 | 1670 | if (seen.contains(t)) { |
duke@1 | 1671 | tv = (TypeVar)t; |
jjg@110 | 1672 | tv.bound = types.createErrorType(t); |
duke@1 | 1673 | log.error(pos, "cyclic.inheritance", t); |
duke@1 | 1674 | } else if (t.tag == TYPEVAR) { |
duke@1 | 1675 | tv = (TypeVar)t; |
mcimadamore@236 | 1676 | seen = seen.prepend(tv); |
duke@1 | 1677 | for (Type b : types.getBounds(tv)) |
duke@1 | 1678 | checkNonCyclic1(pos, b, seen); |
duke@1 | 1679 | } |
duke@1 | 1680 | } |
duke@1 | 1681 | |
duke@1 | 1682 | /** Check for cyclic references. Issue an error if the |
duke@1 | 1683 | * symbol of the type referred to has a LOCKED flag set. |
duke@1 | 1684 | * |
duke@1 | 1685 | * @param pos Position to be used for error reporting. |
duke@1 | 1686 | * @param t The type referred to. |
duke@1 | 1687 | * @returns True if the check completed on all attributed classes |
duke@1 | 1688 | */ |
duke@1 | 1689 | private boolean checkNonCyclicInternal(DiagnosticPosition pos, Type t) { |
duke@1 | 1690 | boolean complete = true; // was the check complete? |
duke@1 | 1691 | //- System.err.println("checkNonCyclicInternal("+t+");");//DEBUG |
duke@1 | 1692 | Symbol c = t.tsym; |
duke@1 | 1693 | if ((c.flags_field & ACYCLIC) != 0) return true; |
duke@1 | 1694 | |
duke@1 | 1695 | if ((c.flags_field & LOCKED) != 0) { |
duke@1 | 1696 | noteCyclic(pos, (ClassSymbol)c); |
duke@1 | 1697 | } else if (!c.type.isErroneous()) { |
duke@1 | 1698 | try { |
duke@1 | 1699 | c.flags_field |= LOCKED; |
duke@1 | 1700 | if (c.type.tag == CLASS) { |
duke@1 | 1701 | ClassType clazz = (ClassType)c.type; |
duke@1 | 1702 | if (clazz.interfaces_field != null) |
duke@1 | 1703 | for (List<Type> l=clazz.interfaces_field; l.nonEmpty(); l=l.tail) |
duke@1 | 1704 | complete &= checkNonCyclicInternal(pos, l.head); |
duke@1 | 1705 | if (clazz.supertype_field != null) { |
duke@1 | 1706 | Type st = clazz.supertype_field; |
duke@1 | 1707 | if (st != null && st.tag == CLASS) |
duke@1 | 1708 | complete &= checkNonCyclicInternal(pos, st); |
duke@1 | 1709 | } |
duke@1 | 1710 | if (c.owner.kind == TYP) |
duke@1 | 1711 | complete &= checkNonCyclicInternal(pos, c.owner.type); |
duke@1 | 1712 | } |
duke@1 | 1713 | } finally { |
duke@1 | 1714 | c.flags_field &= ~LOCKED; |
duke@1 | 1715 | } |
duke@1 | 1716 | } |
duke@1 | 1717 | if (complete) |
duke@1 | 1718 | complete = ((c.flags_field & UNATTRIBUTED) == 0) && c.completer == null; |
duke@1 | 1719 | if (complete) c.flags_field |= ACYCLIC; |
duke@1 | 1720 | return complete; |
duke@1 | 1721 | } |
duke@1 | 1722 | |
duke@1 | 1723 | /** Note that we found an inheritance cycle. */ |
duke@1 | 1724 | private void noteCyclic(DiagnosticPosition pos, ClassSymbol c) { |
duke@1 | 1725 | log.error(pos, "cyclic.inheritance", c); |
duke@1 | 1726 | for (List<Type> l=types.interfaces(c.type); l.nonEmpty(); l=l.tail) |
jjg@110 | 1727 | l.head = types.createErrorType((ClassSymbol)l.head.tsym, Type.noType); |
duke@1 | 1728 | Type st = types.supertype(c.type); |
duke@1 | 1729 | if (st.tag == CLASS) |
jjg@110 | 1730 | ((ClassType)c.type).supertype_field = types.createErrorType((ClassSymbol)st.tsym, Type.noType); |
jjg@110 | 1731 | c.type = types.createErrorType(c, c.type); |
duke@1 | 1732 | c.flags_field |= ACYCLIC; |
duke@1 | 1733 | } |
duke@1 | 1734 | |
duke@1 | 1735 | /** Check that all methods which implement some |
duke@1 | 1736 | * method conform to the method they implement. |
duke@1 | 1737 | * @param tree The class definition whose members are checked. |
duke@1 | 1738 | */ |
duke@1 | 1739 | void checkImplementations(JCClassDecl tree) { |
duke@1 | 1740 | checkImplementations(tree, tree.sym); |
duke@1 | 1741 | } |
duke@1 | 1742 | //where |
duke@1 | 1743 | /** Check that all methods which implement some |
duke@1 | 1744 | * method in `ic' conform to the method they implement. |
duke@1 | 1745 | */ |
duke@1 | 1746 | void checkImplementations(JCClassDecl tree, ClassSymbol ic) { |
duke@1 | 1747 | ClassSymbol origin = tree.sym; |
duke@1 | 1748 | for (List<Type> l = types.closure(ic.type); l.nonEmpty(); l = l.tail) { |
duke@1 | 1749 | ClassSymbol lc = (ClassSymbol)l.head.tsym; |
duke@1 | 1750 | if ((allowGenerics || origin != lc) && (lc.flags() & ABSTRACT) != 0) { |
duke@1 | 1751 | for (Scope.Entry e=lc.members().elems; e != null; e=e.sibling) { |
duke@1 | 1752 | if (e.sym.kind == MTH && |
duke@1 | 1753 | (e.sym.flags() & (STATIC|ABSTRACT)) == ABSTRACT) { |
duke@1 | 1754 | MethodSymbol absmeth = (MethodSymbol)e.sym; |
duke@1 | 1755 | MethodSymbol implmeth = absmeth.implementation(origin, types, false); |
duke@1 | 1756 | if (implmeth != null && implmeth != absmeth && |
duke@1 | 1757 | (implmeth.owner.flags() & INTERFACE) == |
duke@1 | 1758 | (origin.flags() & INTERFACE)) { |
duke@1 | 1759 | // don't check if implmeth is in a class, yet |
duke@1 | 1760 | // origin is an interface. This case arises only |
duke@1 | 1761 | // if implmeth is declared in Object. The reason is |
duke@1 | 1762 | // that interfaces really don't inherit from |
duke@1 | 1763 | // Object it's just that the compiler represents |
duke@1 | 1764 | // things that way. |
duke@1 | 1765 | checkOverride(tree, implmeth, absmeth, origin); |
duke@1 | 1766 | } |
duke@1 | 1767 | } |
duke@1 | 1768 | } |
duke@1 | 1769 | } |
duke@1 | 1770 | } |
duke@1 | 1771 | } |
duke@1 | 1772 | |
duke@1 | 1773 | /** Check that all abstract methods implemented by a class are |
duke@1 | 1774 | * mutually compatible. |
duke@1 | 1775 | * @param pos Position to be used for error reporting. |
duke@1 | 1776 | * @param c The class whose interfaces are checked. |
duke@1 | 1777 | */ |
duke@1 | 1778 | void checkCompatibleSupertypes(DiagnosticPosition pos, Type c) { |
duke@1 | 1779 | List<Type> supertypes = types.interfaces(c); |
duke@1 | 1780 | Type supertype = types.supertype(c); |
duke@1 | 1781 | if (supertype.tag == CLASS && |
duke@1 | 1782 | (supertype.tsym.flags() & ABSTRACT) != 0) |
duke@1 | 1783 | supertypes = supertypes.prepend(supertype); |
duke@1 | 1784 | for (List<Type> l = supertypes; l.nonEmpty(); l = l.tail) { |
duke@1 | 1785 | if (allowGenerics && !l.head.getTypeArguments().isEmpty() && |
duke@1 | 1786 | !checkCompatibleAbstracts(pos, l.head, l.head, c)) |
duke@1 | 1787 | return; |
duke@1 | 1788 | for (List<Type> m = supertypes; m != l; m = m.tail) |
duke@1 | 1789 | if (!checkCompatibleAbstracts(pos, l.head, m.head, c)) |
duke@1 | 1790 | return; |
duke@1 | 1791 | } |
duke@1 | 1792 | checkCompatibleConcretes(pos, c); |
duke@1 | 1793 | } |
duke@1 | 1794 | |
mcimadamore@359 | 1795 | void checkConflicts(DiagnosticPosition pos, Symbol sym, TypeSymbol c) { |
mcimadamore@359 | 1796 | for (Type ct = c.type; ct != Type.noType ; ct = types.supertype(ct)) { |
mcimadamore@359 | 1797 | for (Scope.Entry e = ct.tsym.members().lookup(sym.name); e.scope == ct.tsym.members(); e = e.next()) { |
mcimadamore@359 | 1798 | // VM allows methods and variables with differing types |
mcimadamore@359 | 1799 | if (sym.kind == e.sym.kind && |
mcimadamore@359 | 1800 | types.isSameType(types.erasure(sym.type), types.erasure(e.sym.type)) && |
mcimadamore@359 | 1801 | sym != e.sym && |
mcimadamore@359 | 1802 | (sym.flags() & Flags.SYNTHETIC) != (e.sym.flags() & Flags.SYNTHETIC) && |
mcimadamore@359 | 1803 | (sym.flags() & BRIDGE) == 0 && (e.sym.flags() & BRIDGE) == 0) { |
mcimadamore@359 | 1804 | syntheticError(pos, (e.sym.flags() & SYNTHETIC) == 0 ? e.sym : sym); |
mcimadamore@359 | 1805 | return; |
mcimadamore@359 | 1806 | } |
mcimadamore@359 | 1807 | } |
mcimadamore@359 | 1808 | } |
mcimadamore@359 | 1809 | } |
mcimadamore@359 | 1810 | |
mcimadamore@359 | 1811 | /** Report a conflict between a user symbol and a synthetic symbol. |
mcimadamore@359 | 1812 | */ |
mcimadamore@359 | 1813 | private void syntheticError(DiagnosticPosition pos, Symbol sym) { |
mcimadamore@359 | 1814 | if (!sym.type.isErroneous()) { |
mcimadamore@359 | 1815 | if (warnOnSyntheticConflicts) { |
mcimadamore@359 | 1816 | log.warning(pos, "synthetic.name.conflict", sym, sym.location()); |
mcimadamore@359 | 1817 | } |
mcimadamore@359 | 1818 | else { |
mcimadamore@359 | 1819 | log.error(pos, "synthetic.name.conflict", sym, sym.location()); |
mcimadamore@359 | 1820 | } |
mcimadamore@359 | 1821 | } |
mcimadamore@359 | 1822 | } |
mcimadamore@359 | 1823 | |
duke@1 | 1824 | /** Check that class c does not implement directly or indirectly |
duke@1 | 1825 | * the same parameterized interface with two different argument lists. |
duke@1 | 1826 | * @param pos Position to be used for error reporting. |
duke@1 | 1827 | * @param type The type whose interfaces are checked. |
duke@1 | 1828 | */ |
duke@1 | 1829 | void checkClassBounds(DiagnosticPosition pos, Type type) { |
duke@1 | 1830 | checkClassBounds(pos, new HashMap<TypeSymbol,Type>(), type); |
duke@1 | 1831 | } |
duke@1 | 1832 | //where |
duke@1 | 1833 | /** Enter all interfaces of type `type' into the hash table `seensofar' |
duke@1 | 1834 | * with their class symbol as key and their type as value. Make |
duke@1 | 1835 | * sure no class is entered with two different types. |
duke@1 | 1836 | */ |
duke@1 | 1837 | void checkClassBounds(DiagnosticPosition pos, |
duke@1 | 1838 | Map<TypeSymbol,Type> seensofar, |
duke@1 | 1839 | Type type) { |
duke@1 | 1840 | if (type.isErroneous()) return; |
duke@1 | 1841 | for (List<Type> l = types.interfaces(type); l.nonEmpty(); l = l.tail) { |
duke@1 | 1842 | Type it = l.head; |
duke@1 | 1843 | Type oldit = seensofar.put(it.tsym, it); |
duke@1 | 1844 | if (oldit != null) { |
duke@1 | 1845 | List<Type> oldparams = oldit.allparams(); |
duke@1 | 1846 | List<Type> newparams = it.allparams(); |
duke@1 | 1847 | if (!types.containsTypeEquivalent(oldparams, newparams)) |
duke@1 | 1848 | log.error(pos, "cant.inherit.diff.arg", |
duke@1 | 1849 | it.tsym, Type.toString(oldparams), |
duke@1 | 1850 | Type.toString(newparams)); |
duke@1 | 1851 | } |
duke@1 | 1852 | checkClassBounds(pos, seensofar, it); |
duke@1 | 1853 | } |
duke@1 | 1854 | Type st = types.supertype(type); |
duke@1 | 1855 | if (st != null) checkClassBounds(pos, seensofar, st); |
duke@1 | 1856 | } |
duke@1 | 1857 | |
duke@1 | 1858 | /** Enter interface into into set. |
duke@1 | 1859 | * If it existed already, issue a "repeated interface" error. |
duke@1 | 1860 | */ |
duke@1 | 1861 | void checkNotRepeated(DiagnosticPosition pos, Type it, Set<Type> its) { |
duke@1 | 1862 | if (its.contains(it)) |
duke@1 | 1863 | log.error(pos, "repeated.interface"); |
duke@1 | 1864 | else { |
duke@1 | 1865 | its.add(it); |
duke@1 | 1866 | } |
duke@1 | 1867 | } |
duke@1 | 1868 | |
duke@1 | 1869 | /* ************************************************************************* |
duke@1 | 1870 | * Check annotations |
duke@1 | 1871 | **************************************************************************/ |
duke@1 | 1872 | |
duke@1 | 1873 | /** Annotation types are restricted to primitives, String, an |
duke@1 | 1874 | * enum, an annotation, Class, Class<?>, Class<? extends |
duke@1 | 1875 | * Anything>, arrays of the preceding. |
duke@1 | 1876 | */ |
duke@1 | 1877 | void validateAnnotationType(JCTree restype) { |
duke@1 | 1878 | // restype may be null if an error occurred, so don't bother validating it |
duke@1 | 1879 | if (restype != null) { |
duke@1 | 1880 | validateAnnotationType(restype.pos(), restype.type); |
duke@1 | 1881 | } |
duke@1 | 1882 | } |
duke@1 | 1883 | |
duke@1 | 1884 | void validateAnnotationType(DiagnosticPosition pos, Type type) { |
duke@1 | 1885 | if (type.isPrimitive()) return; |
duke@1 | 1886 | if (types.isSameType(type, syms.stringType)) return; |
duke@1 | 1887 | if ((type.tsym.flags() & Flags.ENUM) != 0) return; |
duke@1 | 1888 | if ((type.tsym.flags() & Flags.ANNOTATION) != 0) return; |
duke@1 | 1889 | if (types.lowerBound(type).tsym == syms.classType.tsym) return; |
duke@1 | 1890 | if (types.isArray(type) && !types.isArray(types.elemtype(type))) { |
duke@1 | 1891 | validateAnnotationType(pos, types.elemtype(type)); |
duke@1 | 1892 | return; |
duke@1 | 1893 | } |
duke@1 | 1894 | log.error(pos, "invalid.annotation.member.type"); |
duke@1 | 1895 | } |
duke@1 | 1896 | |
duke@1 | 1897 | /** |
duke@1 | 1898 | * "It is also a compile-time error if any method declared in an |
duke@1 | 1899 | * annotation type has a signature that is override-equivalent to |
duke@1 | 1900 | * that of any public or protected method declared in class Object |
duke@1 | 1901 | * or in the interface annotation.Annotation." |
duke@1 | 1902 | * |
duke@1 | 1903 | * @jls3 9.6 Annotation Types |
duke@1 | 1904 | */ |
duke@1 | 1905 | void validateAnnotationMethod(DiagnosticPosition pos, MethodSymbol m) { |
duke@1 | 1906 | for (Type sup = syms.annotationType; sup.tag == CLASS; sup = types.supertype(sup)) { |
duke@1 | 1907 | Scope s = sup.tsym.members(); |
duke@1 | 1908 | for (Scope.Entry e = s.lookup(m.name); e.scope != null; e = e.next()) { |
duke@1 | 1909 | if (e.sym.kind == MTH && |
duke@1 | 1910 | (e.sym.flags() & (PUBLIC | PROTECTED)) != 0 && |
duke@1 | 1911 | types.overrideEquivalent(m.type, e.sym.type)) |
duke@1 | 1912 | log.error(pos, "intf.annotation.member.clash", e.sym, sup); |
duke@1 | 1913 | } |
duke@1 | 1914 | } |
duke@1 | 1915 | } |
duke@1 | 1916 | |
duke@1 | 1917 | /** Check the annotations of a symbol. |
duke@1 | 1918 | */ |
duke@1 | 1919 | public void validateAnnotations(List<JCAnnotation> annotations, Symbol s) { |
duke@1 | 1920 | if (skipAnnotations) return; |
duke@1 | 1921 | for (JCAnnotation a : annotations) |
duke@1 | 1922 | validateAnnotation(a, s); |
duke@1 | 1923 | } |
duke@1 | 1924 | |
jjg@308 | 1925 | /** Check the type annotations |
jjg@308 | 1926 | */ |
jjg@308 | 1927 | public void validateTypeAnnotations(List<JCTypeAnnotation> annotations, boolean isTypeParameter) { |
jjg@308 | 1928 | if (skipAnnotations) return; |
jjg@308 | 1929 | for (JCTypeAnnotation a : annotations) |
jjg@308 | 1930 | validateTypeAnnotation(a, isTypeParameter); |
jjg@308 | 1931 | } |
jjg@308 | 1932 | |
duke@1 | 1933 | /** Check an annotation of a symbol. |
duke@1 | 1934 | */ |
duke@1 | 1935 | public void validateAnnotation(JCAnnotation a, Symbol s) { |
duke@1 | 1936 | validateAnnotation(a); |
duke@1 | 1937 | |
duke@1 | 1938 | if (!annotationApplicable(a, s)) |
duke@1 | 1939 | log.error(a.pos(), "annotation.type.not.applicable"); |
duke@1 | 1940 | |
duke@1 | 1941 | if (a.annotationType.type.tsym == syms.overrideType.tsym) { |
duke@1 | 1942 | if (!isOverrider(s)) |
duke@1 | 1943 | log.error(a.pos(), "method.does.not.override.superclass"); |
duke@1 | 1944 | } |
duke@1 | 1945 | } |
duke@1 | 1946 | |
jjg@308 | 1947 | public void validateTypeAnnotation(JCTypeAnnotation a, boolean isTypeParameter) { |
jjg@308 | 1948 | if (a.type == null) |
jjg@308 | 1949 | throw new AssertionError("annotation tree hasn't been attributed yet: " + a); |
jjg@308 | 1950 | validateAnnotation(a); |
jjg@308 | 1951 | |
jjg@308 | 1952 | if (!isTypeAnnotation(a, isTypeParameter)) |
jjg@308 | 1953 | log.error(a.pos(), "annotation.type.not.applicable"); |
jjg@308 | 1954 | } |
jjg@308 | 1955 | |
duke@1 | 1956 | /** Is s a method symbol that overrides a method in a superclass? */ |
duke@1 | 1957 | boolean isOverrider(Symbol s) { |
duke@1 | 1958 | if (s.kind != MTH || s.isStatic()) |
duke@1 | 1959 | return false; |
duke@1 | 1960 | MethodSymbol m = (MethodSymbol)s; |
duke@1 | 1961 | TypeSymbol owner = (TypeSymbol)m.owner; |
duke@1 | 1962 | for (Type sup : types.closure(owner.type)) { |
duke@1 | 1963 | if (sup == owner.type) |
duke@1 | 1964 | continue; // skip "this" |
duke@1 | 1965 | Scope scope = sup.tsym.members(); |
duke@1 | 1966 | for (Scope.Entry e = scope.lookup(m.name); e.scope != null; e = e.next()) { |
duke@1 | 1967 | if (!e.sym.isStatic() && m.overrides(e.sym, owner, types, true)) |
duke@1 | 1968 | return true; |
duke@1 | 1969 | } |
duke@1 | 1970 | } |
duke@1 | 1971 | return false; |
duke@1 | 1972 | } |
duke@1 | 1973 | |
jjg@308 | 1974 | /** Is the annotation applicable to type annotations */ |
jjg@308 | 1975 | boolean isTypeAnnotation(JCTypeAnnotation a, boolean isTypeParameter) { |
jjg@308 | 1976 | Attribute.Compound atTarget = |
jjg@308 | 1977 | a.annotationType.type.tsym.attribute(syms.annotationTargetType.tsym); |
jjg@308 | 1978 | if (atTarget == null) return true; |
jjg@308 | 1979 | Attribute atValue = atTarget.member(names.value); |
jjg@308 | 1980 | if (!(atValue instanceof Attribute.Array)) return true; // error recovery |
jjg@308 | 1981 | Attribute.Array arr = (Attribute.Array) atValue; |
jjg@308 | 1982 | for (Attribute app : arr.values) { |
jjg@308 | 1983 | if (!(app instanceof Attribute.Enum)) return true; // recovery |
jjg@308 | 1984 | Attribute.Enum e = (Attribute.Enum) app; |
jjg@308 | 1985 | if (!isTypeParameter && e.value.name == names.TYPE_USE) |
jjg@308 | 1986 | return true; |
jjg@308 | 1987 | else if (isTypeParameter && e.value.name == names.TYPE_PARAMETER) |
jjg@308 | 1988 | return true; |
jjg@308 | 1989 | } |
jjg@308 | 1990 | return false; |
jjg@308 | 1991 | } |
jjg@308 | 1992 | |
duke@1 | 1993 | /** Is the annotation applicable to the symbol? */ |
duke@1 | 1994 | boolean annotationApplicable(JCAnnotation a, Symbol s) { |
duke@1 | 1995 | Attribute.Compound atTarget = |
duke@1 | 1996 | a.annotationType.type.tsym.attribute(syms.annotationTargetType.tsym); |
duke@1 | 1997 | if (atTarget == null) return true; |
duke@1 | 1998 | Attribute atValue = atTarget.member(names.value); |
duke@1 | 1999 | if (!(atValue instanceof Attribute.Array)) return true; // error recovery |
duke@1 | 2000 | Attribute.Array arr = (Attribute.Array) atValue; |
duke@1 | 2001 | for (Attribute app : arr.values) { |
duke@1 | 2002 | if (!(app instanceof Attribute.Enum)) return true; // recovery |
duke@1 | 2003 | Attribute.Enum e = (Attribute.Enum) app; |
duke@1 | 2004 | if (e.value.name == names.TYPE) |
duke@1 | 2005 | { if (s.kind == TYP) return true; } |
duke@1 | 2006 | else if (e.value.name == names.FIELD) |
duke@1 | 2007 | { if (s.kind == VAR && s.owner.kind != MTH) return true; } |
duke@1 | 2008 | else if (e.value.name == names.METHOD) |
duke@1 | 2009 | { if (s.kind == MTH && !s.isConstructor()) return true; } |
duke@1 | 2010 | else if (e.value.name == names.PARAMETER) |
duke@1 | 2011 | { if (s.kind == VAR && |
duke@1 | 2012 | s.owner.kind == MTH && |
duke@1 | 2013 | (s.flags() & PARAMETER) != 0) |
duke@1 | 2014 | return true; |
duke@1 | 2015 | } |
duke@1 | 2016 | else if (e.value.name == names.CONSTRUCTOR) |
duke@1 | 2017 | { if (s.kind == MTH && s.isConstructor()) return true; } |
duke@1 | 2018 | else if (e.value.name == names.LOCAL_VARIABLE) |
duke@1 | 2019 | { if (s.kind == VAR && s.owner.kind == MTH && |
duke@1 | 2020 | (s.flags() & PARAMETER) == 0) |
duke@1 | 2021 | return true; |
duke@1 | 2022 | } |
duke@1 | 2023 | else if (e.value.name == names.ANNOTATION_TYPE) |
duke@1 | 2024 | { if (s.kind == TYP && (s.flags() & ANNOTATION) != 0) |
duke@1 | 2025 | return true; |
duke@1 | 2026 | } |
duke@1 | 2027 | else if (e.value.name == names.PACKAGE) |
duke@1 | 2028 | { if (s.kind == PCK) return true; } |
jjg@308 | 2029 | else if (e.value.name == names.TYPE_USE) |
jjg@308 | 2030 | { if (s.kind == TYP || |
jjg@308 | 2031 | s.kind == VAR || |
jjg@308 | 2032 | (s.kind == MTH && !s.isConstructor() && |
jjg@308 | 2033 | s.type.getReturnType().tag != VOID)) |
jjg@308 | 2034 | return true; |
jjg@308 | 2035 | } |
duke@1 | 2036 | else |
duke@1 | 2037 | return true; // recovery |
duke@1 | 2038 | } |
duke@1 | 2039 | return false; |
duke@1 | 2040 | } |
duke@1 | 2041 | |
duke@1 | 2042 | /** Check an annotation value. |
duke@1 | 2043 | */ |
duke@1 | 2044 | public void validateAnnotation(JCAnnotation a) { |
duke@1 | 2045 | if (a.type.isErroneous()) return; |
duke@1 | 2046 | |
duke@1 | 2047 | // collect an inventory of the members |
duke@1 | 2048 | Set<MethodSymbol> members = new HashSet<MethodSymbol>(); |
duke@1 | 2049 | for (Scope.Entry e = a.annotationType.type.tsym.members().elems; |
duke@1 | 2050 | e != null; |
duke@1 | 2051 | e = e.sibling) |
duke@1 | 2052 | if (e.sym.kind == MTH) |
duke@1 | 2053 | members.add((MethodSymbol) e.sym); |
duke@1 | 2054 | |
duke@1 | 2055 | // count them off as they're annotated |
duke@1 | 2056 | for (JCTree arg : a.args) { |
duke@1 | 2057 | if (arg.getTag() != JCTree.ASSIGN) continue; // recovery |
duke@1 | 2058 | JCAssign assign = (JCAssign) arg; |
duke@1 | 2059 | Symbol m = TreeInfo.symbol(assign.lhs); |
duke@1 | 2060 | if (m == null || m.type.isErroneous()) continue; |
duke@1 | 2061 | if (!members.remove(m)) |
jjg@479 | 2062 | log.error(assign.lhs.pos(), "duplicate.annotation.member.value", |
duke@1 | 2063 | m.name, a.type); |
duke@1 | 2064 | if (assign.rhs.getTag() == ANNOTATION) |
duke@1 | 2065 | validateAnnotation((JCAnnotation)assign.rhs); |
duke@1 | 2066 | } |
duke@1 | 2067 | |
duke@1 | 2068 | // all the remaining ones better have default values |
duke@1 | 2069 | for (MethodSymbol m : members) |
duke@1 | 2070 | if (m.defaultValue == null && !m.type.isErroneous()) |
duke@1 | 2071 | log.error(a.pos(), "annotation.missing.default.value", |
duke@1 | 2072 | a.type, m.name); |
duke@1 | 2073 | |
duke@1 | 2074 | // special case: java.lang.annotation.Target must not have |
duke@1 | 2075 | // repeated values in its value member |
duke@1 | 2076 | if (a.annotationType.type.tsym != syms.annotationTargetType.tsym || |
duke@1 | 2077 | a.args.tail == null) |
duke@1 | 2078 | return; |
duke@1 | 2079 | |
duke@1 | 2080 | if (a.args.head.getTag() != JCTree.ASSIGN) return; // error recovery |
duke@1 | 2081 | JCAssign assign = (JCAssign) a.args.head; |
duke@1 | 2082 | Symbol m = TreeInfo.symbol(assign.lhs); |
duke@1 | 2083 | if (m.name != names.value) return; |
duke@1 | 2084 | JCTree rhs = assign.rhs; |
duke@1 | 2085 | if (rhs.getTag() != JCTree.NEWARRAY) return; |
duke@1 | 2086 | JCNewArray na = (JCNewArray) rhs; |
duke@1 | 2087 | Set<Symbol> targets = new HashSet<Symbol>(); |
duke@1 | 2088 | for (JCTree elem : na.elems) { |
duke@1 | 2089 | if (!targets.add(TreeInfo.symbol(elem))) { |
duke@1 | 2090 | log.error(elem.pos(), "repeated.annotation.target"); |
duke@1 | 2091 | } |
duke@1 | 2092 | } |
duke@1 | 2093 | } |
duke@1 | 2094 | |
duke@1 | 2095 | void checkDeprecatedAnnotation(DiagnosticPosition pos, Symbol s) { |
duke@1 | 2096 | if (allowAnnotations && |
duke@1 | 2097 | lint.isEnabled(Lint.LintCategory.DEP_ANN) && |
duke@1 | 2098 | (s.flags() & DEPRECATED) != 0 && |
duke@1 | 2099 | !syms.deprecatedType.isErroneous() && |
duke@1 | 2100 | s.attribute(syms.deprecatedType.tsym) == null) { |
duke@1 | 2101 | log.warning(pos, "missing.deprecated.annotation"); |
duke@1 | 2102 | } |
duke@1 | 2103 | } |
duke@1 | 2104 | |
duke@1 | 2105 | /* ************************************************************************* |
duke@1 | 2106 | * Check for recursive annotation elements. |
duke@1 | 2107 | **************************************************************************/ |
duke@1 | 2108 | |
duke@1 | 2109 | /** Check for cycles in the graph of annotation elements. |
duke@1 | 2110 | */ |
duke@1 | 2111 | void checkNonCyclicElements(JCClassDecl tree) { |
duke@1 | 2112 | if ((tree.sym.flags_field & ANNOTATION) == 0) return; |
duke@1 | 2113 | assert (tree.sym.flags_field & LOCKED) == 0; |
duke@1 | 2114 | try { |
duke@1 | 2115 | tree.sym.flags_field |= LOCKED; |
duke@1 | 2116 | for (JCTree def : tree.defs) { |
duke@1 | 2117 | if (def.getTag() != JCTree.METHODDEF) continue; |
duke@1 | 2118 | JCMethodDecl meth = (JCMethodDecl)def; |
duke@1 | 2119 | checkAnnotationResType(meth.pos(), meth.restype.type); |
duke@1 | 2120 | } |
duke@1 | 2121 | } finally { |
duke@1 | 2122 | tree.sym.flags_field &= ~LOCKED; |
duke@1 | 2123 | tree.sym.flags_field |= ACYCLIC_ANN; |
duke@1 | 2124 | } |
duke@1 | 2125 | } |
duke@1 | 2126 | |
duke@1 | 2127 | void checkNonCyclicElementsInternal(DiagnosticPosition pos, TypeSymbol tsym) { |
duke@1 | 2128 | if ((tsym.flags_field & ACYCLIC_ANN) != 0) |
duke@1 | 2129 | return; |
duke@1 | 2130 | if ((tsym.flags_field & LOCKED) != 0) { |
duke@1 | 2131 | log.error(pos, "cyclic.annotation.element"); |
duke@1 | 2132 | return; |
duke@1 | 2133 | } |
duke@1 | 2134 | try { |
duke@1 | 2135 | tsym.flags_field |= LOCKED; |
duke@1 | 2136 | for (Scope.Entry e = tsym.members().elems; e != null; e = e.sibling) { |
duke@1 | 2137 | Symbol s = e.sym; |
duke@1 | 2138 | if (s.kind != Kinds.MTH) |
duke@1 | 2139 | continue; |
duke@1 | 2140 | checkAnnotationResType(pos, ((MethodSymbol)s).type.getReturnType()); |
duke@1 | 2141 | } |
duke@1 | 2142 | } finally { |
duke@1 | 2143 | tsym.flags_field &= ~LOCKED; |
duke@1 | 2144 | tsym.flags_field |= ACYCLIC_ANN; |
duke@1 | 2145 | } |
duke@1 | 2146 | } |
duke@1 | 2147 | |
duke@1 | 2148 | void checkAnnotationResType(DiagnosticPosition pos, Type type) { |
duke@1 | 2149 | switch (type.tag) { |
duke@1 | 2150 | case TypeTags.CLASS: |
duke@1 | 2151 | if ((type.tsym.flags() & ANNOTATION) != 0) |
duke@1 | 2152 | checkNonCyclicElementsInternal(pos, type.tsym); |
duke@1 | 2153 | break; |
duke@1 | 2154 | case TypeTags.ARRAY: |
duke@1 | 2155 | checkAnnotationResType(pos, types.elemtype(type)); |
duke@1 | 2156 | break; |
duke@1 | 2157 | default: |
duke@1 | 2158 | break; // int etc |
duke@1 | 2159 | } |
duke@1 | 2160 | } |
duke@1 | 2161 | |
duke@1 | 2162 | /* ************************************************************************* |
duke@1 | 2163 | * Check for cycles in the constructor call graph. |
duke@1 | 2164 | **************************************************************************/ |
duke@1 | 2165 | |
duke@1 | 2166 | /** Check for cycles in the graph of constructors calling other |
duke@1 | 2167 | * constructors. |
duke@1 | 2168 | */ |
duke@1 | 2169 | void checkCyclicConstructors(JCClassDecl tree) { |
duke@1 | 2170 | Map<Symbol,Symbol> callMap = new HashMap<Symbol, Symbol>(); |
duke@1 | 2171 | |
duke@1 | 2172 | // enter each constructor this-call into the map |
duke@1 | 2173 | for (List<JCTree> l = tree.defs; l.nonEmpty(); l = l.tail) { |
duke@1 | 2174 | JCMethodInvocation app = TreeInfo.firstConstructorCall(l.head); |
duke@1 | 2175 | if (app == null) continue; |
duke@1 | 2176 | JCMethodDecl meth = (JCMethodDecl) l.head; |
duke@1 | 2177 | if (TreeInfo.name(app.meth) == names._this) { |
duke@1 | 2178 | callMap.put(meth.sym, TreeInfo.symbol(app.meth)); |
duke@1 | 2179 | } else { |
duke@1 | 2180 | meth.sym.flags_field |= ACYCLIC; |
duke@1 | 2181 | } |
duke@1 | 2182 | } |
duke@1 | 2183 | |
duke@1 | 2184 | // Check for cycles in the map |
duke@1 | 2185 | Symbol[] ctors = new Symbol[0]; |
duke@1 | 2186 | ctors = callMap.keySet().toArray(ctors); |
duke@1 | 2187 | for (Symbol caller : ctors) { |
duke@1 | 2188 | checkCyclicConstructor(tree, caller, callMap); |
duke@1 | 2189 | } |
duke@1 | 2190 | } |
duke@1 | 2191 | |
duke@1 | 2192 | /** Look in the map to see if the given constructor is part of a |
duke@1 | 2193 | * call cycle. |
duke@1 | 2194 | */ |
duke@1 | 2195 | private void checkCyclicConstructor(JCClassDecl tree, Symbol ctor, |
duke@1 | 2196 | Map<Symbol,Symbol> callMap) { |
duke@1 | 2197 | if (ctor != null && (ctor.flags_field & ACYCLIC) == 0) { |
duke@1 | 2198 | if ((ctor.flags_field & LOCKED) != 0) { |
duke@1 | 2199 | log.error(TreeInfo.diagnosticPositionFor(ctor, tree), |
duke@1 | 2200 | "recursive.ctor.invocation"); |
duke@1 | 2201 | } else { |
duke@1 | 2202 | ctor.flags_field |= LOCKED; |
duke@1 | 2203 | checkCyclicConstructor(tree, callMap.remove(ctor), callMap); |
duke@1 | 2204 | ctor.flags_field &= ~LOCKED; |
duke@1 | 2205 | } |
duke@1 | 2206 | ctor.flags_field |= ACYCLIC; |
duke@1 | 2207 | } |
duke@1 | 2208 | } |
duke@1 | 2209 | |
duke@1 | 2210 | /* ************************************************************************* |
duke@1 | 2211 | * Miscellaneous |
duke@1 | 2212 | **************************************************************************/ |
duke@1 | 2213 | |
duke@1 | 2214 | /** |
duke@1 | 2215 | * Return the opcode of the operator but emit an error if it is an |
duke@1 | 2216 | * error. |
duke@1 | 2217 | * @param pos position for error reporting. |
duke@1 | 2218 | * @param operator an operator |
duke@1 | 2219 | * @param tag a tree tag |
duke@1 | 2220 | * @param left type of left hand side |
duke@1 | 2221 | * @param right type of right hand side |
duke@1 | 2222 | */ |
duke@1 | 2223 | int checkOperator(DiagnosticPosition pos, |
duke@1 | 2224 | OperatorSymbol operator, |
duke@1 | 2225 | int tag, |
duke@1 | 2226 | Type left, |
duke@1 | 2227 | Type right) { |
duke@1 | 2228 | if (operator.opcode == ByteCodes.error) { |
duke@1 | 2229 | log.error(pos, |
duke@1 | 2230 | "operator.cant.be.applied", |
duke@1 | 2231 | treeinfo.operatorName(tag), |
mcimadamore@80 | 2232 | List.of(left, right)); |
duke@1 | 2233 | } |
duke@1 | 2234 | return operator.opcode; |
duke@1 | 2235 | } |
duke@1 | 2236 | |
duke@1 | 2237 | |
duke@1 | 2238 | /** |
duke@1 | 2239 | * Check for division by integer constant zero |
duke@1 | 2240 | * @param pos Position for error reporting. |
duke@1 | 2241 | * @param operator The operator for the expression |
duke@1 | 2242 | * @param operand The right hand operand for the expression |
duke@1 | 2243 | */ |
duke@1 | 2244 | void checkDivZero(DiagnosticPosition pos, Symbol operator, Type operand) { |
duke@1 | 2245 | if (operand.constValue() != null |
duke@1 | 2246 | && lint.isEnabled(Lint.LintCategory.DIVZERO) |
duke@1 | 2247 | && operand.tag <= LONG |
duke@1 | 2248 | && ((Number) (operand.constValue())).longValue() == 0) { |
duke@1 | 2249 | int opc = ((OperatorSymbol)operator).opcode; |
duke@1 | 2250 | if (opc == ByteCodes.idiv || opc == ByteCodes.imod |
duke@1 | 2251 | || opc == ByteCodes.ldiv || opc == ByteCodes.lmod) { |
duke@1 | 2252 | log.warning(pos, "div.zero"); |
duke@1 | 2253 | } |
duke@1 | 2254 | } |
duke@1 | 2255 | } |
duke@1 | 2256 | |
duke@1 | 2257 | /** |
duke@1 | 2258 | * Check for empty statements after if |
duke@1 | 2259 | */ |
duke@1 | 2260 | void checkEmptyIf(JCIf tree) { |
duke@1 | 2261 | if (tree.thenpart.getTag() == JCTree.SKIP && tree.elsepart == null && lint.isEnabled(Lint.LintCategory.EMPTY)) |
duke@1 | 2262 | log.warning(tree.thenpart.pos(), "empty.if"); |
duke@1 | 2263 | } |
duke@1 | 2264 | |
duke@1 | 2265 | /** Check that symbol is unique in given scope. |
duke@1 | 2266 | * @param pos Position for error reporting. |
duke@1 | 2267 | * @param sym The symbol. |
duke@1 | 2268 | * @param s The scope. |
duke@1 | 2269 | */ |
duke@1 | 2270 | boolean checkUnique(DiagnosticPosition pos, Symbol sym, Scope s) { |
duke@1 | 2271 | if (sym.type.isErroneous()) |
duke@1 | 2272 | return true; |
duke@1 | 2273 | if (sym.owner.name == names.any) return false; |
duke@1 | 2274 | for (Scope.Entry e = s.lookup(sym.name); e.scope == s; e = e.next()) { |
duke@1 | 2275 | if (sym != e.sym && |
duke@1 | 2276 | sym.kind == e.sym.kind && |
duke@1 | 2277 | sym.name != names.error && |
mcimadamore@252 | 2278 | (sym.kind != MTH || types.hasSameArgs(types.erasure(sym.type), types.erasure(e.sym.type)))) { |
duke@1 | 2279 | if ((sym.flags() & VARARGS) != (e.sym.flags() & VARARGS)) |
duke@1 | 2280 | varargsDuplicateError(pos, sym, e.sym); |
mcimadamore@252 | 2281 | else if (sym.kind == MTH && !types.overrideEquivalent(sym.type, e.sym.type)) |
mcimadamore@252 | 2282 | duplicateErasureError(pos, sym, e.sym); |
duke@1 | 2283 | else |
duke@1 | 2284 | duplicateError(pos, e.sym); |
duke@1 | 2285 | return false; |
duke@1 | 2286 | } |
duke@1 | 2287 | } |
duke@1 | 2288 | return true; |
duke@1 | 2289 | } |
mcimadamore@252 | 2290 | //where |
mcimadamore@252 | 2291 | /** Report duplicate declaration error. |
mcimadamore@252 | 2292 | */ |
mcimadamore@252 | 2293 | void duplicateErasureError(DiagnosticPosition pos, Symbol sym1, Symbol sym2) { |
mcimadamore@252 | 2294 | if (!sym1.type.isErroneous() && !sym2.type.isErroneous()) { |
mcimadamore@252 | 2295 | log.error(pos, "name.clash.same.erasure", sym1, sym2); |
mcimadamore@252 | 2296 | } |
mcimadamore@252 | 2297 | } |
duke@1 | 2298 | |
duke@1 | 2299 | /** Check that single-type import is not already imported or top-level defined, |
duke@1 | 2300 | * but make an exception for two single-type imports which denote the same type. |
duke@1 | 2301 | * @param pos Position for error reporting. |
duke@1 | 2302 | * @param sym The symbol. |
duke@1 | 2303 | * @param s The scope |
duke@1 | 2304 | */ |
duke@1 | 2305 | boolean checkUniqueImport(DiagnosticPosition pos, Symbol sym, Scope s) { |
duke@1 | 2306 | return checkUniqueImport(pos, sym, s, false); |
duke@1 | 2307 | } |
duke@1 | 2308 | |
duke@1 | 2309 | /** Check that static single-type import is not already imported or top-level defined, |
duke@1 | 2310 | * but make an exception for two single-type imports which denote the same type. |
duke@1 | 2311 | * @param pos Position for error reporting. |
duke@1 | 2312 | * @param sym The symbol. |
duke@1 | 2313 | * @param s The scope |
duke@1 | 2314 | * @param staticImport Whether or not this was a static import |
duke@1 | 2315 | */ |
duke@1 | 2316 | boolean checkUniqueStaticImport(DiagnosticPosition pos, Symbol sym, Scope s) { |
duke@1 | 2317 | return checkUniqueImport(pos, sym, s, true); |
duke@1 | 2318 | } |
duke@1 | 2319 | |
duke@1 | 2320 | /** Check that single-type import is not already imported or top-level defined, |
duke@1 | 2321 | * but make an exception for two single-type imports which denote the same type. |
duke@1 | 2322 | * @param pos Position for error reporting. |
duke@1 | 2323 | * @param sym The symbol. |
duke@1 | 2324 | * @param s The scope. |
duke@1 | 2325 | * @param staticImport Whether or not this was a static import |
duke@1 | 2326 | */ |
duke@1 | 2327 | private boolean checkUniqueImport(DiagnosticPosition pos, Symbol sym, Scope s, boolean staticImport) { |
duke@1 | 2328 | for (Scope.Entry e = s.lookup(sym.name); e.scope != null; e = e.next()) { |
duke@1 | 2329 | // is encountered class entered via a class declaration? |
duke@1 | 2330 | boolean isClassDecl = e.scope == s; |
duke@1 | 2331 | if ((isClassDecl || sym != e.sym) && |
duke@1 | 2332 | sym.kind == e.sym.kind && |
duke@1 | 2333 | sym.name != names.error) { |
duke@1 | 2334 | if (!e.sym.type.isErroneous()) { |
duke@1 | 2335 | String what = e.sym.toString(); |
duke@1 | 2336 | if (!isClassDecl) { |
duke@1 | 2337 | if (staticImport) |
duke@1 | 2338 | log.error(pos, "already.defined.static.single.import", what); |
duke@1 | 2339 | else |
duke@1 | 2340 | log.error(pos, "already.defined.single.import", what); |
duke@1 | 2341 | } |
duke@1 | 2342 | else if (sym != e.sym) |
duke@1 | 2343 | log.error(pos, "already.defined.this.unit", what); |
duke@1 | 2344 | } |
duke@1 | 2345 | return false; |
duke@1 | 2346 | } |
duke@1 | 2347 | } |
duke@1 | 2348 | return true; |
duke@1 | 2349 | } |
duke@1 | 2350 | |
duke@1 | 2351 | /** Check that a qualified name is in canonical form (for import decls). |
duke@1 | 2352 | */ |
duke@1 | 2353 | public void checkCanonical(JCTree tree) { |
duke@1 | 2354 | if (!isCanonical(tree)) |
duke@1 | 2355 | log.error(tree.pos(), "import.requires.canonical", |
duke@1 | 2356 | TreeInfo.symbol(tree)); |
duke@1 | 2357 | } |
duke@1 | 2358 | // where |
duke@1 | 2359 | private boolean isCanonical(JCTree tree) { |
duke@1 | 2360 | while (tree.getTag() == JCTree.SELECT) { |
duke@1 | 2361 | JCFieldAccess s = (JCFieldAccess) tree; |
duke@1 | 2362 | if (s.sym.owner != TreeInfo.symbol(s.selected)) |
duke@1 | 2363 | return false; |
duke@1 | 2364 | tree = s.selected; |
duke@1 | 2365 | } |
duke@1 | 2366 | return true; |
duke@1 | 2367 | } |
duke@1 | 2368 | |
duke@1 | 2369 | private class ConversionWarner extends Warner { |
duke@1 | 2370 | final String key; |
duke@1 | 2371 | final Type found; |
duke@1 | 2372 | final Type expected; |
duke@1 | 2373 | public ConversionWarner(DiagnosticPosition pos, String key, Type found, Type expected) { |
duke@1 | 2374 | super(pos); |
duke@1 | 2375 | this.key = key; |
duke@1 | 2376 | this.found = found; |
duke@1 | 2377 | this.expected = expected; |
duke@1 | 2378 | } |
duke@1 | 2379 | |
jjg@398 | 2380 | @Override |
duke@1 | 2381 | public void warnUnchecked() { |
duke@1 | 2382 | boolean warned = this.warned; |
duke@1 | 2383 | super.warnUnchecked(); |
duke@1 | 2384 | if (warned) return; // suppress redundant diagnostics |
mcimadamore@89 | 2385 | Object problem = diags.fragment(key); |
duke@1 | 2386 | Check.this.warnUnchecked(pos(), "prob.found.req", problem, found, expected); |
duke@1 | 2387 | } |
duke@1 | 2388 | } |
duke@1 | 2389 | |
duke@1 | 2390 | public Warner castWarner(DiagnosticPosition pos, Type found, Type expected) { |
duke@1 | 2391 | return new ConversionWarner(pos, "unchecked.cast.to.type", found, expected); |
duke@1 | 2392 | } |
duke@1 | 2393 | |
duke@1 | 2394 | public Warner convertWarner(DiagnosticPosition pos, Type found, Type expected) { |
duke@1 | 2395 | return new ConversionWarner(pos, "unchecked.assign", found, expected); |
duke@1 | 2396 | } |
duke@1 | 2397 | } |