Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Fetching contributors…

Cannot retrieve contributors at this time

1360 lines (1105 sloc) 60.845 kB
/* NSC -- new Scala compiler
* Copyright 2005-2013 LAMP/EPFL
* @author Martin Odersky
*/
package scala.tools.nsc
package typechecker
import scala.collection.{ mutable, immutable }
import scala.reflect.internal.util.StringOps.{ countElementsAsString, countAsString }
import symtab.Flags.{ PRIVATE, PROTECTED, IS_ERROR }
import scala.compat.Platform.EOL
import scala.reflect.runtime.ReflectionUtils
import scala.reflect.macros.runtime.AbortMacroException
import scala.util.control.NonFatal
import scala.tools.nsc.util.stackTraceString
trait ContextErrors {
self: Analyzer =>
import global._
import definitions._
import treeInfo._
object ErrorKinds extends Enumeration {
type ErrorKind = Value
val Normal, Access, Ambiguous, Divergent = Value
}
import ErrorKinds.ErrorKind
trait AbsTypeError extends Throwable {
def errPos: Position
def errMsg: String
def kind: ErrorKind
}
case class NormalTypeError(underlyingTree: Tree, errMsg: String, kind: ErrorKind = ErrorKinds.Normal)
extends AbsTypeError {
def errPos:Position = underlyingTree.pos
override def toString() = "[Type error at:" + underlyingTree.pos + "] " + errMsg
}
case class SymbolTypeError(underlyingSym: Symbol, errMsg: String, kind: ErrorKind = ErrorKinds.Normal)
extends AbsTypeError {
def errPos = underlyingSym.pos
}
case class TypeErrorWrapper(ex: TypeError, kind: ErrorKind = ErrorKinds.Normal)
extends AbsTypeError {
def errMsg = ex.msg
def errPos = ex.pos
}
case class TypeErrorWithUnderlyingTree(tree: Tree, ex: TypeError, kind: ErrorKind = ErrorKinds.Normal)
extends AbsTypeError {
def errMsg = ex.msg
def errPos = tree.pos
}
case class AmbiguousTypeError(underlyingTree: Tree, errPos: Position, errMsg: String, kind: ErrorKind = ErrorKinds.Ambiguous) extends AbsTypeError
case class PosAndMsgTypeError(errPos: Position, errMsg: String, kind: ErrorKind = ErrorKinds.Normal) extends AbsTypeError
object ErrorUtils {
def issueNormalTypeError(tree: Tree, msg: String)(implicit context: Context) {
issueTypeError(NormalTypeError(tree, msg))
}
def issueSymbolTypeError(sym: Symbol, msg: String)(implicit context: Context) {
issueTypeError(SymbolTypeError(sym, msg))
}
def issueDivergentImplicitsError(tree: Tree, msg: String)(implicit context: Context) {
issueTypeError(NormalTypeError(tree, msg, ErrorKinds.Divergent))
}
def issueAmbiguousTypeError(pre: Type, sym1: Symbol, sym2: Symbol, err: AmbiguousTypeError)(implicit context: Context) {
context.issueAmbiguousError(pre, sym1, sym2, err)
}
def issueTypeError(err: AbsTypeError)(implicit context: Context) { context.issue(err) }
def typeErrorMsg(found: Type, req: Type, possiblyMissingArgs: Boolean) = {
def missingArgsMsg = if (possiblyMissingArgs) "\n possible cause: missing arguments for method or constructor" else ""
"type mismatch" + foundReqMsg(found, req) + missingArgsMsg
}
}
def notAnyRefMessage(found: Type): String = {
val tp = found.widen
def name = tp.typeSymbol.nameString
def parents = tp.parents filterNot isTrivialTopType
def onlyAny = tp.parents forall (_.typeSymbol == AnyClass)
def parents_s = ( if (parents.isEmpty) tp.parents else parents ) mkString ", "
def what = (
if (tp.typeSymbol.isAbstractType) {
val descr = if (onlyAny) "unbounded" else "bounded only by " + parents_s
s"$name is $descr, which means AnyRef is not a known parent"
}
else if (tp.typeSymbol.isAnonOrRefinementClass)
s"the parents of this type ($parents_s) extend Any, not AnyRef"
else
s"$name extends Any, not AnyRef"
)
if (isPrimitiveValueType(found) || isTrivialTopType(tp)) "" else "\n" +
sm"""|Note that $what.
|Such types can participate in value classes, but instances
|cannot appear in singleton types or in reference comparisons."""
}
import ErrorUtils._
trait TyperContextErrors {
self: Typer =>
import infer.setError
object TyperErrorGen {
implicit val contextTyperErrorGen: Context = infer.getContext
def UnstableTreeError(tree: Tree) = {
def addendum = {
"\n Note that "+tree.symbol+" is not stable because its type, "+tree.tpe+", is volatile."
}
issueNormalTypeError(tree,
"stable identifier required, but "+tree+" found." + (
if (isStableExceptVolatile(tree)) addendum else ""))
setError(tree)
}
def NoImplicitFoundError(tree: Tree, param: Symbol) = {
def errMsg = {
val paramName = param.name
val paramTp = param.tpe
paramTp.typeSymbolDirect match {
case ImplicitNotFoundMsg(msg) => msg.format(paramName, paramTp)
case _ =>
"could not find implicit value for "+
(if (paramName startsWith nme.EVIDENCE_PARAM_PREFIX) "evidence parameter of type "
else "parameter "+paramName+": ")+paramTp
}
}
issueNormalTypeError(tree, errMsg)
}
def AdaptTypeError(tree: Tree, found: Type, req: Type) = {
// If the expected type is a refinement type, and the found type is a refinement or an anon
// class, we can greatly improve the error message by retyping the tree to recover the actual
// members present, then display along with the expected members. This is done here because
// this is the last point where we still have access to the original tree, rather than just
// the found/req types.
val foundType: Type = req.normalize match {
case RefinedType(parents, decls) if !decls.isEmpty && found.typeSymbol.isAnonOrRefinementClass =>
val retyped = typed (tree.duplicate setType null)
val foundDecls = retyped.tpe.decls filter (sym => !sym.isConstructor && !sym.isSynthetic)
if (foundDecls.isEmpty || (found.typeSymbol eq NoSymbol)) found
else {
// The members arrive marked private, presumably because there was no
// expected type and so they're considered members of an anon class.
foundDecls foreach (_.makePublic)
// TODO: if any of the found parents match up with required parents after normalization,
// print the error so that they match. The major beneficiary there would be
// java.lang.Object vs. AnyRef.
refinedType(found.parents, found.typeSymbol.owner, foundDecls, tree.pos)
}
case _ =>
found
}
assert(!found.isErroneous && !req.isErroneous, (found, req))
issueNormalTypeError(tree, withAddendum(tree.pos)(typeErrorMsg(found, req, infer.isPossiblyMissingArgs(found, req))) )
if (settings.explaintypes.value)
explainTypes(found, req)
}
def WithFilterError(tree: Tree, ex: AbsTypeError) = {
issueTypeError(ex)
setError(tree)
}
def ParentTypesError(templ: Template, ex: TypeError) = {
templ.tpe = null
issueNormalTypeError(templ, ex.getMessage())
}
// additional parentTypes errors
def ConstrArgsInTraitParentTpeError(arg: Tree, parent: Symbol) =
issueNormalTypeError(arg, parent + " is a trait; does not take constructor arguments")
def MissingTypeArgumentsParentTpeError(supertpt: Tree) =
issueNormalTypeError(supertpt, "missing type arguments")
// typedIdent
def AmbiguousIdentError(tree: Tree, name: Name, msg: String) =
NormalTypeError(tree, "reference to " + name + " is ambiguous;\n" + msg)
def SymbolNotFoundError(tree: Tree, name: Name, owner: Symbol, startingIdentCx: Context) = {
NormalTypeError(tree, "not found: "+decodeWithKind(name, owner))
}
// typedAppliedTypeTree
def AppliedTypeNoParametersError(tree: Tree, errTpe: Type) = {
issueNormalTypeError(tree, errTpe + " does not take type parameters")
setError(tree)
}
def AppliedTypeWrongNumberOfArgsError(tree: Tree, tpt: Tree, tparams: List[Symbol]) = {
val tptSafeString: String = try {
tpt.tpe.toString()
} catch {
case _: CyclicReference =>
tpt.toString()
}
val msg = "wrong number of type arguments for "+tptSafeString+", should be "+tparams.length
issueNormalTypeError(tree, msg)
setError(tree)
}
// typedTypeDef
def LowerBoundError(tree: TypeDef, lowB: Type, highB: Type) =
issueNormalTypeError(tree, "lower bound "+lowB+" does not conform to upper bound "+highB)
def HiddenSymbolWithError[T <: Tree](tree: T): T =
setError(tree)
def SymbolEscapesScopeError[T <: Tree](tree: T, badSymbol: Symbol): T = {
val modifierString = if (badSymbol.isPrivate) "private " else ""
issueNormalTypeError(tree, modifierString + badSymbol + " escapes its defining scope as part of type "+tree.tpe)
setError(tree)
}
// typedDefDef
def StarParamNotLastError(param: Tree) =
issueNormalTypeError(param, "*-parameter must come last")
def StarWithDefaultError(meth: Symbol) =
issueSymbolTypeError(meth, "a parameter section with a `*'-parameter is not allowed to have default arguments")
def InvalidConstructorDefError(ddef: Tree) =
issueNormalTypeError(ddef, "constructor definition not allowed here")
def DeprecatedParamNameError(param: Symbol, name: Name) =
issueSymbolTypeError(param, "deprecated parameter name "+ name +" has to be distinct from any other parameter name (deprecated or not).")
// computeParamAliases
def SuperConstrReferenceError(tree: Tree) =
NormalTypeError(tree, "super constructor cannot be passed a self reference unless parameter is declared by-name")
def SuperConstrArgsThisReferenceError(tree: Tree) =
ConstrArgsThisReferenceError("super", tree)
def SelfConstrArgsThisReferenceError(tree: Tree) =
ConstrArgsThisReferenceError("self", tree)
private def ConstrArgsThisReferenceError(prefix: String, tree: Tree) =
NormalTypeError(tree, s"$prefix constructor arguments cannot reference unconstructed `this`")
def TooManyArgumentListsForConstructor(tree: Tree) = {
issueNormalTypeError(tree, "too many argument lists for constructor invocation")
setError(tree)
}
// typedValDef
def VolatileValueError(vdef: Tree) =
issueNormalTypeError(vdef, "values cannot be volatile")
def LocalVarUninitializedError(vdef: Tree) =
issueNormalTypeError(vdef, "local variables must be initialized")
//typedAssign
def AssignmentError(tree: Tree, varSym: Symbol) = {
issueNormalTypeError(tree,
if (varSym != null && varSym.isValue) "reassignment to val"
else "assignment to non variable")
setError(tree)
}
def UnexpectedTreeAssignmentConversionError(tree: Tree) = {
issueNormalTypeError(tree, "Unexpected tree during assignment conversion.")
setError(tree)
}
//typedSuper
def MixinMissingParentClassNameError(tree: Tree, mix: Name, clazz: Symbol) =
issueNormalTypeError(tree, mix+" does not name a parent class of "+clazz)
def AmbiguousParentClassError(tree: Tree) =
issueNormalTypeError(tree, "ambiguous parent class qualifier")
//typedSelect
def NotAMemberError(sel: Tree, qual: Tree, name: Name) = {
def errMsg = {
val owner = qual.tpe.typeSymbol
val target = qual.tpe.widen
def targetKindString = if (owner.isTypeParameterOrSkolem) "type parameter " else ""
def nameString = decodeWithKind(name, owner)
/** Illuminating some common situations and errors a bit further. */
def addendum = {
val companion = {
if (name.isTermName && owner.isPackageClass) {
target.member(name.toTypeName) match {
case NoSymbol => ""
case sym => "\nNote: %s exists, but it has no companion object.".format(sym)
}
}
else ""
}
val semicolon = (
if (linePrecedes(qual, sel))
"\npossible cause: maybe a semicolon is missing before `"+nameString+"'?"
else
""
)
val notAnyRef = (
if (ObjectClass.info.member(name).exists) notAnyRefMessage(target)
else ""
)
companion + notAnyRef + semicolon
}
def targetStr = targetKindString + target.directObjectString
withAddendum(qual.pos)(
if (name == nme.CONSTRUCTOR) s"$target does not have a constructor"
else s"$nameString is not a member of $targetStr$addendum"
)
}
issueNormalTypeError(sel, errMsg)
// the error has to be set for the copied tree, otherwise
// the error remains persistent acros multiple compilations
// and causes problems
//setError(sel)
}
//typedNew
def IsAbstractError(tree: Tree, sym: Symbol) = {
issueNormalTypeError(tree, sym + " is abstract; cannot be instantiated")
setError(tree)
}
def DoesNotConformToSelfTypeError(tree: Tree, sym: Symbol, tpe0: Type) = {
issueNormalTypeError(tree, sym + " cannot be instantiated because it does not conform to its self-type " + tpe0)
setError(tree)
}
//typedEta
def UnderscoreEtaError(tree: Tree) = {
issueNormalTypeError(tree, "_ must follow method; cannot follow " + tree.tpe)
setError(tree)
}
//typedReturn
def ReturnOutsideOfDefError(tree: Tree) = {
issueNormalTypeError(tree, "return outside method definition")
setError(tree)
}
def ReturnWithoutTypeError(tree: Tree, owner: Symbol) = {
issueNormalTypeError(tree, owner + " has return statement; needs result type")
setError(tree)
}
//typedBind
def VariableInPatternAlternativeError(tree: Tree) = {
issueNormalTypeError(tree, "illegal variable in pattern alternative")
//setError(tree)
}
//typedCase
def StarPositionInPatternError(tree: Tree) =
issueNormalTypeError(tree, "_* may only come last")
//typedFunction
def MaxFunctionArityError(fun: Tree) = {
issueNormalTypeError(fun, "implementation restricts functions to " + definitions.MaxFunctionArity + " parameters")
setError(fun)
}
def WrongNumberOfParametersError(tree: Tree, argpts: List[Type]) = {
issueNormalTypeError(tree, "wrong number of parameters; expected = " + argpts.length)
setError(tree)
}
def MissingParameterTypeError(fun: Tree, vparam: ValDef, pt: Type) =
if (vparam.mods.isSynthetic) fun match {
case Function(_, Match(_, _)) => MissingParameterTypeAnonMatchError(vparam, pt)
case _ => issueNormalTypeError(vparam, "missing parameter type for expanded function " + fun)
} else issueNormalTypeError(vparam, "missing parameter type")
def MissingParameterTypeAnonMatchError(vparam: Tree, pt: Type) =
issueNormalTypeError(vparam, "missing parameter type for expanded function\n"+
"The argument types of an anonymous function must be fully known. (SLS 8.5)\n"+
"Expected type was: " + pt.toLongString)
def ConstructorsOrderError(tree: Tree) = {
issueNormalTypeError(tree, "called constructor's definition must precede calling constructor's definition")
setError(tree)
}
def OnlyDeclarationsError(tree: Tree) = {
issueNormalTypeError(tree, "only declarations allowed here")
setError(tree)
}
// typedAnnotation
def AnnotationNotAConstantError(tree: Tree) =
NormalTypeError(tree, "annotation argument needs to be a constant; found: " + tree)
def AnnotationArgNullError(tree: Tree) =
NormalTypeError(tree, "annotation argument cannot be null")
def ArrayConstantsError(tree: Tree) =
NormalTypeError(tree, "Array constants have to be specified using the `Array(...)' factory method")
def ArrayConstantsTypeMismatchError(tree: Tree, pt: Type) =
NormalTypeError(tree, "found array constant, expected argument of type " + pt)
def UnexpectedTreeAnnotation(tree: Tree) =
NormalTypeError(tree, "unexpected tree in annotation: "+ tree)
def AnnotationTypeMismatchError(tree: Tree, expected: Type, found: Type) =
NormalTypeError(tree, "expected annotation of type " + expected + ", found " + found)
def MultipleArgumentListForAnnotationError(tree: Tree) =
NormalTypeError(tree, "multiple argument lists on classfile annotation")
def UnknownAnnotationNameError(tree: Tree, name: Name) =
NormalTypeError(tree, "unknown annotation argument name: " + name)
def DuplicateValueAnnotationError(tree: Tree, name: Name) =
NormalTypeError(tree, "duplicate value for annotation argument " + name)
def ClassfileAnnotationsAsNamedArgsError(tree: Tree) =
NormalTypeError(tree, "classfile annotation arguments have to be supplied as named arguments")
def AnnotationMissingArgError(tree: Tree, annType: Type, sym: Symbol) =
NormalTypeError(tree, "annotation " + annType.typeSymbol.fullName + " is missing argument " + sym.name)
def NestedAnnotationError(tree: Tree, annType: Type) =
NormalTypeError(tree, "nested classfile annotations must be defined in java; found: "+ annType)
def UnexpectedTreeAnnotationError(tree: Tree, unexpected: Tree) =
NormalTypeError(tree, "unexpected tree after typing annotation: "+ unexpected)
//typedExistentialTypeTree
def AbstractionFromVolatileTypeError(vd: ValDef) =
issueNormalTypeError(vd, "illegal abstraction from value with volatile type "+vd.symbol.tpe)
private[ContextErrors] def TypedApplyWrongNumberOfTpeParametersErrorMessage(fun: Tree) =
"wrong number of type parameters for "+treeSymTypeMsg(fun)
def TypedApplyWrongNumberOfTpeParametersError(tree: Tree, fun: Tree) = {
issueNormalTypeError(tree, TypedApplyWrongNumberOfTpeParametersErrorMessage(fun))
setError(tree)
}
def TypedApplyDoesNotTakeTpeParametersError(tree: Tree, fun: Tree) = {
issueNormalTypeError(tree, treeSymTypeMsg(fun)+" does not take type parameters.")
setError(tree)
}
// doTypeApply
//tryNamesDefaults
def NamedAndDefaultArgumentsNotSupportedForMacros(tree: Tree, fun: Tree) =
NormalTypeError(tree, "macros application do not support named and/or default arguments")
def TooManyArgsNamesDefaultsError(tree: Tree, fun: Tree) =
NormalTypeError(tree, "too many arguments for "+treeSymTypeMsg(fun))
// can it still happen? see test case neg/overloaded-unapply.scala
def OverloadedUnapplyError(tree: Tree) =
issueNormalTypeError(tree, "cannot resolve overloaded unapply")
def UnapplyWithSingleArgError(tree: Tree) =
issueNormalTypeError(tree, "an unapply method must accept a single argument.")
def MultipleVarargError(tree: Tree) =
NormalTypeError(tree, "when using named arguments, the vararg parameter has to be specified exactly once")
def ModuleUsingCompanionClassDefaultArgsErrror(tree: Tree) =
NormalTypeError(tree, "module extending its companion class cannot use default constructor arguments")
def NotEnoughArgsError(tree: Tree, fun0: Tree, missing0: List[Symbol]) = {
def notEnoughArgumentsMsg(fun: Tree, missing: List[Symbol]) = {
val suffix = {
if (missing.isEmpty) ""
else {
val keep = missing take 3 map (_.name)
".\nUnspecified value parameter%s %s".format(
if (missing.tail.isEmpty) "" else "s",
if ((missing drop 3).nonEmpty) (keep :+ "...").mkString(", ")
else keep.mkString("", ", ", ".")
)
}
}
"not enough arguments for " + treeSymTypeMsg(fun) + suffix
}
NormalTypeError(tree, notEnoughArgumentsMsg(fun0, missing0))
}
//doTypedApply - patternMode
def TooManyArgsPatternError(fun: Tree) =
NormalTypeError(fun, "too many arguments for unapply pattern, maximum = "+definitions.MaxTupleArity)
def WrongNumberOfArgsError(tree: Tree, fun: Tree) =
NormalTypeError(tree, "wrong number of arguments for "+ treeSymTypeMsg(fun))
def ApplyWithoutArgsError(tree: Tree, fun: Tree) =
NormalTypeError(tree, fun.tpe+" does not take parameters")
// Dynamic
def DynamicVarArgUnsupported(tree: Tree, name: String) =
issueNormalTypeError(tree, name+ " does not support passing a vararg parameter")
def DynamicRewriteError(tree: Tree, err: AbsTypeError) = {
issueTypeError(PosAndMsgTypeError(err.errPos, err.errMsg +
s"\nerror after rewriting to $tree\npossible cause: maybe a wrong Dynamic method signature?"))
setError(tree)
}
//checkClassType
def TypeNotAStablePrefixError(tpt: Tree, pre: Type) = {
issueNormalTypeError(tpt, "type "+pre+" is not a stable prefix")
setError(tpt)
}
def ClassTypeRequiredError(tree: Tree, found: AnyRef) = {
issueNormalTypeError(tree, "class type required but "+found+" found")
setError(tree)
}
// validateParentClasses
def ParentSuperSubclassError(parent: Tree, superclazz: Symbol,
parentSym: Symbol, mixin: Symbol) =
NormalTypeError(parent, "illegal inheritance; super"+superclazz+
"\n is not a subclass of the super"+parentSym+
"\n of the mixin " + mixin)
def ParentNotATraitMixinError(parent: Tree, mixin: Symbol) =
NormalTypeError(parent, mixin+" needs to be a trait to be mixed in")
def ParentFinalInheritanceError(parent: Tree, mixin: Symbol) =
NormalTypeError(parent, "illegal inheritance from final "+mixin)
def ParentSealedInheritanceError(parent: Tree, psym: Symbol) =
NormalTypeError(parent, "illegal inheritance from sealed " + psym )
def ParentSelfTypeConformanceError(parent: Tree, selfType: Type) =
NormalTypeError(parent,
"illegal inheritance;\n self-type "+selfType+" does not conform to "+
parent +"'s selftype "+parent.tpe.typeOfThis)
def ParentInheritedTwiceError(parent: Tree, parentSym: Symbol) =
NormalTypeError(parent, parentSym+" is inherited twice")
//adapt
def MissingArgsForMethodTpeError(tree: Tree, meth: Symbol) = {
issueNormalTypeError(tree,
"missing arguments for " + meth.fullLocationString + (
if (meth.isConstructor) ""
else ";\nfollow this method with `_' if you want to treat it as a partially applied function"
))
setError(tree)
}
def MissingTypeParametersError(tree: Tree) = {
issueNormalTypeError(tree, tree.symbol+" takes type parameters")
setError(tree)
}
def KindArityMismatchError(tree: Tree, pt: Type) = {
issueNormalTypeError(tree,
tree.tpe+" takes "+countElementsAsString(tree.tpe.typeParams.length, "type parameter")+
", expected: "+countAsString(pt.typeParams.length))
setError(tree)
}
def CaseClassConstructorError(tree: Tree) = {
issueNormalTypeError(tree, tree.symbol + " is not a case class constructor, nor does it have an unapply/unapplySeq method")
setError(tree)
}
def ConstructorPrefixError(tree: Tree, restpe: Type) = {
issueNormalTypeError(tree, restpe.prefix+" is not a legal prefix for a constructor")
setError(tree)
}
// SelectFromTypeTree
def TypeSelectionFromVolatileTypeError(tree: Tree, qual: Tree) = {
val hiBound = qual.tpe.bounds.hi
val addendum = if (hiBound =:= qual.tpe) "" else s" (with upper bound ${hiBound})"
issueNormalTypeError(tree, s"illegal type selection from volatile type ${qual.tpe}${addendum}")
setError(tree)
}
// packedType
def InferTypeWithVolatileTypeSelectionError(tree: Tree, pre: Type) =
issueNormalTypeError(tree, "Inferred type "+tree.tpe+" contains type selection from volatile type "+pre)
def AbstractExistentiallyOverParamerizedTpeError(tree: Tree, tp: Type) =
issueNormalTypeError(tree, "can't existentially abstract over parameterized type " + tp)
// resolveClassTag
def MissingClassTagError(tree: Tree, tp: Type) = {
issueNormalTypeError(tree, "cannot find class tag for element type "+tp)
setError(tree)
}
// cases where we do not necessarily return trees
def DependentMethodTpeConversionToFunctionError(tree: Tree, tp: Type) =
issueNormalTypeError(tree, "method with dependent type "+tp+" cannot be converted to function value")
//checkStarPatOK
def StarPatternWithVarargParametersError(tree: Tree) =
issueNormalTypeError(tree, "star patterns must correspond with varargs parameters")
def FinitaryError(tparam: Symbol) =
issueSymbolTypeError(tparam, "class graph is not finitary because type parameter "+tparam.name+" is expansively recursive")
def QualifyingClassError(tree: Tree, qual: Name) = {
issueNormalTypeError(tree,
if (qual.isEmpty) tree + " can be used only in a class, object, or template"
else qual + " is not an enclosing class")
setError(tree)
}
// def stabilize
def NotAValueError(tree: Tree, sym: Symbol) = {
issueNormalTypeError(tree, sym.kindString + " " + sym.fullName + " is not a value")
setError(tree)
}
def DefDefinedTwiceError(sym0: Symbol, sym1: Symbol) = {
// Most of this hard work is associated with SI-4893.
val isBug = sym0.isAbstractType && sym1.isAbstractType && (sym0.name startsWith "_$")
val addendums = List(
if (sym0.associatedFile eq sym1.associatedFile)
Some("conflicting symbols both originated in file '%s'".format(sym0.associatedFile.canonicalPath))
else if ((sym0.associatedFile ne null) && (sym1.associatedFile ne null))
Some("conflicting symbols originated in files '%s' and '%s'".format(sym0.associatedFile.canonicalPath, sym1.associatedFile.canonicalPath))
else None ,
if (isBug) Some("Note: this may be due to a bug in the compiler involving wildcards in package objects") else None
)
val addendum = addendums.flatten match {
case Nil => ""
case xs => xs.mkString("\n ", "\n ", "")
}
issueSymbolTypeError(sym0, sym1+" is defined twice" + addendum)
}
// cyclic errors
def CyclicAliasingOrSubtypingError(errPos: Position, sym0: Symbol) =
issueTypeError(PosAndMsgTypeError(errPos, "cyclic aliasing or subtyping involving "+sym0))
def CyclicReferenceError(errPos: Position, lockedSym: Symbol) =
issueTypeError(PosAndMsgTypeError(errPos, "illegal cyclic reference involving " + lockedSym))
// macro-related errors (also see MacroErrors below)
def MacroEtaError(tree: Tree) = {
issueNormalTypeError(tree, "macros cannot be eta-expanded")
setError(tree)
}
// same reason as for MacroBodyTypecheckException
case object MacroExpansionException extends Exception with scala.util.control.ControlThrowable
private def macroExpansionError(expandee: Tree, msg: String = null, pos: Position = NoPosition) = {
def msgForLog = if (msg != null && (msg contains "exception during macro expansion")) msg.split(EOL).drop(1).headOption.getOrElse("?") else msg
macroLogLite("macro expansion has failed: %s".format(msgForLog))
val errorPos = if (pos != NoPosition) pos else (if (expandee.pos != NoPosition) expandee.pos else enclosingMacroPosition)
if (msg != null) context.error(pos, msg) // issueTypeError(PosAndMsgTypeError(..)) won't work => swallows positions
setError(expandee)
throw MacroExpansionException
}
def MacroPartialApplicationError(expandee: Tree) = {
// macroExpansionError won't work => swallows positions, hence needed to do issueTypeError
// kinda contradictory to the comment in `macroExpansionError`, but this is how it works
issueNormalTypeError(expandee, "macros cannot be partially applied")
setError(expandee)
throw MacroExpansionException
}
def MacroGeneratedAbort(expandee: Tree, ex: AbortMacroException) = {
// errors have been reported by the macro itself, so we do nothing here
macroLogVerbose("macro expansion has been aborted")
macroExpansionError(expandee, ex.msg, ex.pos)
}
def MacroGeneratedTypeError(expandee: Tree, err: TypeError = null) =
if (err == null) {
// errors have been reported by the macro itself, so we do nothing here
macroExpansionError(expandee, null)
} else {
macroLogLite("macro expansion has failed: %s at %s".format(err.msg, err.pos))
throw err // this error must be propagated, don't report
}
def MacroGeneratedException(expandee: Tree, ex: Throwable) = {
val realex = ReflectionUtils.unwrapThrowable(ex)
val message = {
try {
// [Eugene] is there a better way?
// [Paul] See Exceptional.scala and Origins.scala.
val relevancyThreshold = realex.getStackTrace().indexWhere(_.getMethodName endsWith "macroExpand1")
if (relevancyThreshold == -1) None
else {
var relevantElements = realex.getStackTrace().take(relevancyThreshold + 1)
def isMacroInvoker(este: StackTraceElement) = este.isNativeMethod || (este.getClassName != null && (este.getClassName contains "fastTrack"))
var threshold = relevantElements.reverse.indexWhere(isMacroInvoker) + 1
while (threshold != relevantElements.length && isMacroInvoker(relevantElements(relevantElements.length - threshold - 1))) threshold += 1
relevantElements = relevantElements dropRight threshold
realex.setStackTrace(relevantElements)
Some(EOL + stackTraceString(realex))
}
} catch {
// the code above tries various tricks to detect the relevant portion of the stack trace
// if these tricks fail, just fall back to uninformative, but better than nothing, getMessage
case NonFatal(ex) => // currently giving a spurious warning, see SI-6994
macroLogVerbose("got an exception when processing a macro generated exception\n" +
"offender = " + stackTraceString(realex) + "\n" +
"error = " + stackTraceString(ex))
None
}
} getOrElse {
val msg = realex.getMessage
if (msg != null) msg else realex.getClass.getName
}
macroExpansionError(expandee, "exception during macro expansion: " + message)
}
def MacroFreeSymbolError(expandee: Tree, sym: FreeSymbol) = {
def template(kind: String) = (
s"Macro expansion contains free $kind variable %s. Have you forgotten to use %s? "
+ s"If you have troubles tracking free $kind variables, consider using -Xlog-free-${kind}s"
)
val forgotten = (
if (sym.isTerm) "splice when splicing this variable into a reifee"
else "c.WeakTypeTag annotation for this type parameter"
)
macroExpansionError(expandee, template(sym.name.nameKind).format(sym.name + " " + sym.origin, forgotten))
}
def MacroExpansionIsNotExprError(expandee: Tree, expanded: Any) =
macroExpansionError(expandee,
"macro must return a compiler-specific expr; returned value is " + (
if (expanded == null) "null"
else if (expanded.isInstanceOf[Expr[_]]) " Expr, but it doesn't belong to this compiler's universe"
else " of " + expanded.getClass
))
def MacroImplementationNotFoundError(expandee: Tree) = {
val message =
"macro implementation not found: " + expandee.symbol.name + " " +
"(the most common reason for that is that you cannot use macro implementations in the same compilation run that defines them)" +
(if (forScaladoc) ". When generating scaladocs for multiple projects at once, consider using -Ymacro-no-expand to disable macro expansions altogether."
else "")
macroExpansionError(expandee, message)
}
}
}
trait InferencerContextErrors {
self: Inferencer =>
private def applyErrorMsg(tree: Tree, msg: String, argtpes: List[Type], pt: Type) = {
def asParams(xs: List[Any]) = xs.mkString("(", ", ", ")")
def resType = if (pt.isWildcard) "" else " with expected result type " + pt
def allTypes = (alternatives(tree) flatMap (_.paramTypes)) ++ argtpes :+ pt
def locals = alternatives(tree) flatMap (_.typeParams)
withDisambiguation(locals, allTypes: _*) {
treeSymTypeMsg(tree) + msg + asParams(argtpes) + resType
}
}
object InferErrorGen {
implicit val contextInferErrorGen = getContext
object PolyAlternativeErrorKind extends Enumeration {
type ErrorType = Value
val WrongNumber, NoParams, ArgsDoNotConform = Value
}
private def ambiguousErrorMsgPos(pos: Position, pre: Type, sym1: Symbol, sym2: Symbol, rest: String) =
if (sym1.hasDefault && sym2.hasDefault && sym1.enclClass == sym2.enclClass) {
val methodName = nme.defaultGetterToMethod(sym1.name)
(sym1.enclClass.pos,
"in "+ sym1.enclClass +", multiple overloaded alternatives of " + methodName +
" define default arguments")
} else {
(pos,
("ambiguous reference to overloaded definition,\n" +
"both " + sym1 + sym1.locationString + " of type " + pre.memberType(sym1) +
"\nand " + sym2 + sym2.locationString + " of type " + pre.memberType(sym2) +
"\nmatch " + rest)
)
}
def AccessError(tree: Tree, sym: Symbol, pre: Type, owner0: Symbol, explanation: String) = {
def errMsg = {
val location = if (sym.isClassConstructor) owner0 else pre.widen.directObjectString
underlyingSymbol(sym).fullLocationString + " cannot be accessed in " +
location + explanation
}
NormalTypeError(tree, errMsg, ErrorKinds.Access)
}
def NoMethodInstanceError(fn: Tree, args: List[Tree], msg: String) =
issueNormalTypeError(fn,
"no type parameters for " +
applyErrorMsg(fn, " exist so that it can be applied to arguments ", args map (_.tpe.widen), WildcardType) +
"\n --- because ---\n" + msg)
// TODO: no test case
def NoConstructorInstanceError(tree: Tree, restpe: Type, pt: Type, msg: String) = {
issueNormalTypeError(tree,
"constructor of type " + restpe +
" cannot be uniquely instantiated to expected type " + pt +
"\n --- because ---\n" + msg)
setError(tree)
}
def ConstrInstantiationError(tree: Tree, restpe: Type, pt: Type) = {
issueNormalTypeError(tree,
"constructor cannot be instantiated to expected type" + foundReqMsg(restpe, pt))
setError(tree)
}
// side-effect on the tree, break the overloaded type cycle in infer
private def setErrorOnLastTry(lastTry: Boolean, tree: Tree) = if (lastTry) setError(tree)
def NoBestMethodAlternativeError(tree: Tree, argtpes: List[Type], pt: Type, lastTry: Boolean) = {
issueNormalTypeError(tree,
applyErrorMsg(tree, " cannot be applied to ", argtpes, pt))
// since inferMethodAlternative modifies the state of the tree
// we have to set the type of tree to ErrorType only in the very last
// fallback action that is done in the inference.
// This avoids entering infinite loop in doTypeApply.
setErrorOnLastTry(lastTry, tree)
}
def AmbiguousMethodAlternativeError(tree: Tree, pre: Type, best: Symbol,
firstCompeting: Symbol, argtpes: List[Type], pt: Type, lastTry: Boolean) = {
if (!(argtpes exists (_.isErroneous)) && !pt.isErroneous) {
val msg0 =
"argument types " + argtpes.mkString("(", ",", ")") +
(if (pt == WildcardType) "" else " and expected result type " + pt)
val (pos, msg) = ambiguousErrorMsgPos(tree.pos, pre, best, firstCompeting, msg0)
issueAmbiguousTypeError(pre, best, firstCompeting, AmbiguousTypeError(tree, pos, msg))
setErrorOnLastTry(lastTry, tree)
} else setError(tree) // do not even try further attempts because they should all fail
// even if this is not the last attempt (because of the SO's possibility on the horizon)
}
def NoBestExprAlternativeError(tree: Tree, pt: Type, lastTry: Boolean) = {
issueNormalTypeError(tree, withAddendum(tree.pos)(typeErrorMsg(tree.symbol.tpe, pt, isPossiblyMissingArgs(tree.symbol.tpe, pt))))
setErrorOnLastTry(lastTry, tree)
}
def AmbiguousExprAlternativeError(tree: Tree, pre: Type, best: Symbol, firstCompeting: Symbol, pt: Type, lastTry: Boolean) = {
val (pos, msg) = ambiguousErrorMsgPos(tree.pos, pre, best, firstCompeting, "expected type " + pt)
issueAmbiguousTypeError(pre, best, firstCompeting, AmbiguousTypeError(tree, pos, msg))
setErrorOnLastTry(lastTry, tree)
}
// checkBounds
def KindBoundErrors(tree: Tree, prefix: String, targs: List[Type],
tparams: List[Symbol], kindErrors: List[String]) = {
issueNormalTypeError(tree,
prefix + "kinds of the type arguments " + targs.mkString("(", ",", ")") +
" do not conform to the expected kinds of the type parameters "+
tparams.mkString("(", ",", ")") + tparams.head.locationString+ "." +
kindErrors.toList.mkString("\n", ", ", ""))
}
private[ContextErrors] def NotWithinBoundsErrorMessage(prefix: String, targs: List[Type], tparams: List[Symbol], explaintypes: Boolean) = {
if (explaintypes) {
val bounds = tparams map (tp => tp.info.instantiateTypeParams(tparams, targs).bounds)
(targs, bounds).zipped foreach ((targ, bound) => explainTypes(bound.lo, targ))
(targs, bounds).zipped foreach ((targ, bound) => explainTypes(targ, bound.hi))
()
}
prefix + "type arguments " + targs.mkString("[", ",", "]") +
" do not conform to " + tparams.head.owner + "'s type parameter bounds " +
(tparams map (_.defString)).mkString("[", ",", "]")
}
def NotWithinBounds(tree: Tree, prefix: String, targs: List[Type],
tparams: List[Symbol], kindErrors: List[String]) =
issueNormalTypeError(tree,
NotWithinBoundsErrorMessage(prefix, targs, tparams, settings.explaintypes.value))
//substExpr
def PolymorphicExpressionInstantiationError(tree: Tree, undetparams: List[Symbol], pt: Type) =
issueNormalTypeError(tree,
"polymorphic expression cannot be instantiated to expected type" +
foundReqMsg(GenPolyType(undetparams, skipImplicit(tree.tpe)), pt))
//checkCheckable
def TypePatternOrIsInstanceTestError(tree: Tree, tp: Type) =
issueNormalTypeError(tree, "type "+tp+" cannot be used in a type pattern or isInstanceOf test")
def PatternTypeIncompatibleWithPtError1(tree: Tree, pattp: Type, pt: Type) =
issueNormalTypeError(tree, "pattern type is incompatible with expected type" + foundReqMsg(pattp, pt))
def IncompatibleScrutineeTypeError(tree: Tree, pattp: Type, pt: Type) =
issueNormalTypeError(tree, "scrutinee is incompatible with pattern type" + foundReqMsg(pattp, pt))
def PatternTypeIncompatibleWithPtError2(pat: Tree, pt1: Type, pt: Type) = {
def errMsg = {
val sym = pat.tpe.typeSymbol
val clazz = sym.companionClass
val addendum = (
if (sym.isModuleClass && clazz.isCaseClass && (clazz isSubClass pt1.typeSymbol)) {
// TODO: move these somewhere reusable.
val typeString = clazz.typeParams match {
case Nil => "" + clazz.name
case xs => xs map (_ => "_") mkString (clazz.name + "[", ",", "]")
}
val caseString = (
clazz.caseFieldAccessors
map (_ => "_") // could use the actual param names here
mkString (clazz.name + "(", ",", ")")
)
(
"\nNote: if you intended to match against the class, try `case _: " +
typeString + "` or `case " + caseString + "`"
)
}
else ""
)
"pattern type is incompatible with expected type"+foundReqMsg(pat.tpe, pt) + addendum
}
issueNormalTypeError(pat, errMsg)
}
def PolyAlternativeError(tree: Tree, argtypes: List[Type], sym: Symbol, err: PolyAlternativeErrorKind.ErrorType) = {
import PolyAlternativeErrorKind._
val msg =
err match {
case WrongNumber =>
"wrong number of type parameters for " + treeSymTypeMsg(tree)
case NoParams =>
treeSymTypeMsg(tree) + " does not take type parameters"
case ArgsDoNotConform =>
"type arguments " + argtypes.mkString("[", ",", "]") +
" conform to the bounds of none of the overloaded alternatives of\n "+sym+
": "+sym.info
}
issueNormalTypeError(tree, msg)
()
}
}
}
trait NamerContextErrors {
self: Namer =>
object NamerErrorGen {
implicit val contextNamerErrorGen = context
object SymValidateErrors extends Enumeration {
val ImplicitConstr, ImplicitNotTermOrClass, ImplicitAtToplevel,
OverrideClass, SealedNonClass, AbstractNonClass,
OverrideConstr, AbstractOverride, AbstractOverrideOnTypeMember, LazyAndEarlyInit,
ByNameParameter, AbstractVar = Value
}
object DuplicatesErrorKinds extends Enumeration {
val RenamedTwice, AppearsTwice = Value
}
import SymValidateErrors._
import DuplicatesErrorKinds._
import symtab.Flags
def TypeSigError(tree: Tree, ex: TypeError) = {
ex match {
case CyclicReference(_, _) if tree.symbol.isTermMacro =>
// say, we have a macro def `foo` and its macro impl `impl`
// if impl: 1) omits return type, 2) has anything implicit in its body, 3) sees foo
//
// then implicit search will trigger an error
// (note that this is not a compilation error, it's an artifact of implicit search algorithm)
// normally, such "errors" are discarded by `isCyclicOrErroneous` in Implicits.scala
// but in our case this won't work, because isCyclicOrErroneous catches CyclicReference exceptions
// while our error will present itself as a "recursive method needs a return type"
//
// hence we (together with reportTypeError in TypeDiagnostics) make sure that this CyclicReference
// evades all the handlers on its way and successfully reaches `isCyclicOrErroneous` in Implicits
throw ex
case CyclicReference(sym, info: TypeCompleter) =>
issueNormalTypeError(tree, typer.cyclicReferenceMessage(sym, info.tree) getOrElse ex.getMessage())
case _ =>
contextNamerErrorGen.issue(TypeErrorWithUnderlyingTree(tree, ex))
}
}
def GetterDefinedTwiceError(getter: Symbol) =
issueSymbolTypeError(getter, getter+" is defined twice")
def ValOrValWithSetterSuffixError(tree: Tree) =
issueNormalTypeError(tree, "Names of vals or vars may not end in `_='")
def PrivateThisCaseClassParameterError(tree: Tree) =
issueNormalTypeError(tree, "private[this] not allowed for case class parameters")
def BeanPropertyAnnotationLimitationError(tree: Tree) =
issueNormalTypeError(tree, "implementation limitation: the BeanProperty annotation cannot be used in a type alias or renamed import")
def BeanPropertyAnnotationFieldWithoutLetterError(tree: Tree) =
issueNormalTypeError(tree, "`BeanProperty' annotation can be applied only to fields that start with a letter")
def BeanPropertyAnnotationPrivateFieldError(tree: Tree) =
issueNormalTypeError(tree, "`BeanProperty' annotation can be applied only to non-private fields")
def DoubleDefError(currentSym: Symbol, prevSym: Symbol) = {
val s1 = if (prevSym.isModule) "case class companion " else ""
val s2 = if (prevSym.isSynthetic) "(compiler-generated) " + s1 else ""
val s3 = if (prevSym.isCase) "case class " + prevSym.name else "" + prevSym
val where = if (currentSym.owner.isPackageClass != prevSym.owner.isPackageClass) {
val inOrOut = if (prevSym.owner.isPackageClass) "outside of" else "in"
" %s package object %s".format(inOrOut, ""+prevSym.effectiveOwner.name)
} else ""
issueSymbolTypeError(currentSym, prevSym.name + " is already defined as " + s2 + s3 + where)
}
def MaxParametersCaseClassError(tree: Tree) =
issueNormalTypeError(tree, "Implementation restriction: case classes cannot have more than " + definitions.MaxFunctionArity + " parameters.")
def InheritsItselfError(tree: Tree) =
issueNormalTypeError(tree, tree.tpe.typeSymbol+" inherits itself")
def MissingParameterOrValTypeError(vparam: Tree) =
issueNormalTypeError(vparam, "missing parameter type")
def RootImportError(tree: Tree) =
issueNormalTypeError(tree, "_root_ cannot be imported")
def SymbolValidationError(sym: Symbol, errKind: SymValidateErrors.Value) {
val msg = errKind match {
case ImplicitConstr =>
"`implicit' modifier not allowed for constructors"
case ImplicitNotTermOrClass =>
"`implicit' modifier can be used only for values, variables, methods and classes"
case ImplicitAtToplevel =>
"`implicit' modifier cannot be used for top-level objects"
case OverrideClass =>
"`override' modifier not allowed for classes"
case SealedNonClass =>
"`sealed' modifier can be used only for classes"
case AbstractNonClass =>
"`abstract' modifier can be used only for classes; it should be omitted for abstract members"
case OverrideConstr =>
"`override' modifier not allowed for constructors"
case AbstractOverride =>
"`abstract override' modifier only allowed for members of traits"
case AbstractOverrideOnTypeMember =>
"`abstract override' modifier not allowed for type members"
case LazyAndEarlyInit =>
"`lazy' definitions may not be initialized early"
case ByNameParameter =>
"pass-by-name arguments not allowed for case class parameters"
case AbstractVar =>
"only classes can have declared but undefined members" + abstractVarMessage(sym)
}
issueSymbolTypeError(sym, msg)
}
def AbstractMemberWithModiferError(sym: Symbol, flag: Int) =
issueSymbolTypeError(sym, "abstract member may not have " + Flags.flagsToString(flag) + " modifier")
def IllegalModifierCombination(sym: Symbol, flag1: Int, flag2: Int) =
issueSymbolTypeError(sym, "illegal combination of modifiers: %s and %s for: %s".format(
Flags.flagsToString(flag1), Flags.flagsToString(flag2), sym))
def IllegalDependentMethTpeError(sym: Symbol)(context: Context) = {
val errorAddendum =
": parameter appears in the type of another parameter in the same section or an earlier one"
issueSymbolTypeError(sym, "illegal dependent method type" + errorAddendum)(context)
}
def DuplicatesError(tree: Tree, name: Name, kind: DuplicatesErrorKinds.Value) = {
val msg = kind match {
case RenamedTwice =>
"is renamed twice"
case AppearsTwice =>
"appears twice as a target of a renaming"
}
issueNormalTypeError(tree, name.decode + " " + msg)
}
}
}
trait ImplicitsContextErrors {
self: ImplicitSearch =>
import definitions._
def AmbiguousImplicitError(info1: ImplicitInfo, info2: ImplicitInfo,
pre1: String, pre2: String, trailer: String)
(isView: Boolean, pt: Type, tree: Tree)(implicit context0: Context) = {
if (!info1.tpe.isErroneous && !info2.tpe.isErroneous) {
def coreMsg =
sm"""| $pre1 ${info1.sym.fullLocationString} of type ${info1.tpe}
| $pre2 ${info2.sym.fullLocationString} of type ${info2.tpe}
| $trailer"""
def viewMsg = {
val found :: req :: _ = pt.typeArgs
def explanation = {
val sym = found.typeSymbol
// Explain some common situations a bit more clearly. Some other
// failures which have nothing to do with implicit conversions
// per se, but which manifest as implicit conversion conflicts
// involving Any, are further explained from foundReqMsg.
if (AnyRefClass.tpe <:< req) (
if (sym == AnyClass || sym == UnitClass) (
sm"""|Note: ${sym.name} is not implicitly converted to AnyRef. You can safely
|pattern match `x: AnyRef` or cast `x.asInstanceOf[AnyRef]` to do so."""
)
else boxedClass get sym map (boxed =>
sm"""|Note: an implicit exists from ${sym.fullName} => ${boxed.fullName}, but
|methods inherited from Object are rendered ambiguous. This is to avoid
|a blanket implicit which would convert any ${sym.fullName} to any AnyRef.
|You may wish to use a type ascription: `x: ${boxed.fullName}`."""
) getOrElse ""
)
else
sm"""|Note that implicit conversions are not applicable because they are ambiguous:
|${coreMsg}are possible conversion functions from $found to $req"""
}
typeErrorMsg(found, req, infer.isPossiblyMissingArgs(found, req)) + (
if (explanation == "") "" else "\n" + explanation
)
}
context.issueAmbiguousError(AmbiguousTypeError(tree, tree.pos,
if (isView) viewMsg
else s"ambiguous implicit values:\n${coreMsg}match expected type $pt")
)
}
}
def DivergingImplicitExpansionError(tree: Tree, pt: Type, sym: Symbol)(implicit context0: Context) =
issueDivergentImplicitsError(tree,
"diverging implicit expansion for type "+pt+"\nstarting with "+
sym.fullLocationString)
}
object NamesDefaultsErrorsGen {
import typer.infer.setError
def NameClashError(sym: Symbol, arg: Tree)(implicit context: Context) = {
setError(arg) // to distinguish it from ambiguous reference error
def errMsg =
"%s definition needs %s because '%s' is used as a named argument in its body.".format(
"variable", // "method"
"type", // "result type"
sym.name)
issueSymbolTypeError(sym, errMsg)
}
def AmbiguousReferenceInNamesDefaultError(arg: Tree, name: Name)(implicit context: Context) = {
if (!arg.isErroneous) { // check if name clash wasn't reported already
issueNormalTypeError(arg,
"reference to "+ name +" is ambiguous; it is both a method parameter "+
"and a variable in scope.")
setError(arg)
} else arg
}
def WarnAfterNonSilentRecursiveInference(param: Symbol, arg: Tree)(implicit context: Context) = {
val note = "type-checking the invocation of "+ param.owner +" checks if the named argument expression '"+ param.name + " = ...' is a valid assignment\n"+
"in the current scope. The resulting type inference error (see above) can be fixed by providing an explicit type in the local definition for "+ param.name +"."
context.warning(arg.pos, note)
}
def UnknownParameterNameNamesDefaultError(arg: Tree, name: Name)(implicit context: Context) = {
issueNormalTypeError(arg, "unknown parameter name: " + name)
setError(arg)
}
def DoubleParamNamesDefaultError(arg: Tree, name: Name, pos: Int, otherName: Option[Name])(implicit context: Context) = {
val annex = otherName match {
case Some(oName) => "\nNote that that '"+ oName +"' is not a parameter name of the invoked method."
case None => ""
}
issueNormalTypeError(arg, "parameter '"+ name +"' is already specified at parameter position "+ pos + annex)
setError(arg)
}
def PositionalAfterNamedNamesDefaultError(arg: Tree)(implicit context: Context) = {
issueNormalTypeError(arg, "positional after named argument.")
setError(arg)
}
}
// using an exception here is actually a good idea
// because the lifespan of this exception is extremely small and controlled
// moreover exceptions let us avoid an avalanche of "if (!hasError) do stuff" checks
case object MacroBodyTypecheckException extends Exception with scala.util.control.ControlThrowable
trait MacroErrors {
self: MacroTyper =>
private implicit val context0 = typer.context
val context = typer.context
// helpers
private def lengthMsg(flavor: String, violation: String, extra: Symbol) = {
val noun = if (flavor == "value") "parameter" else "type parameter"
val message = noun + " lists have different length, " + violation + " extra " + noun
val suffix = if (extra ne NoSymbol) " " + extra.defString else ""
message + suffix
}
private def abbreviateCoreAliases(s: String): String = List("WeakTypeTag", "Expr").foldLeft(s)((res, x) => res.replace("c.universe." + x, "c." + x))
private def showMeth(pss: List[List[Symbol]], restpe: Type, abbreviate: Boolean) = {
var argsPart = (pss map (ps => ps map (_.defString) mkString ("(", ", ", ")"))).mkString
if (abbreviate) argsPart = abbreviateCoreAliases(argsPart)
var retPart = restpe.toString
if (abbreviate || macroDdef.tpt.tpe == null) retPart = abbreviateCoreAliases(retPart)
argsPart + ": " + retPart
}
// not exactly an error generator, but very related
// and I dearly wanted to push it away from Macros.scala
private def checkSubType(slot: String, rtpe: Type, atpe: Type) = {
val ok = if (macroDebugVerbose || settings.explaintypes.value) {
if (rtpe eq atpe) println(rtpe + " <: " + atpe + "?" + EOL + "true")
withTypesExplained(rtpe <:< atpe)
} else rtpe <:< atpe
if (!ok) {
compatibilityError("type mismatch for %s: %s does not conform to %s".format(slot, abbreviateCoreAliases(rtpe.toString), abbreviateCoreAliases(atpe.toString)))
}
}
// errors
private def fail() = {
// need to set the IS_ERROR flag to prohibit spurious expansions
if (macroDef != null) macroDef setFlag IS_ERROR
// not setting ErrorSymbol as in `infer.setError`, because we still need to know that it's a macro
// otherwise assignTypeToTree in Namers might fail if macroDdef.tpt == EmptyTree
macroDdef setType ErrorType
throw MacroBodyTypecheckException
}
private def genericError(tree: Tree, message: String) = {
issueNormalTypeError(tree, message)
fail()
}
private def implRefError(message: String) = {
val treeInfo.Applied(implRef, _, _) = macroDdef.rhs
genericError(implRef, message)
}
private def compatibilityError(message: String) =
implRefError(
"macro implementation has wrong shape:"+
"\n required: " + showMeth(rparamss, rret, abbreviate = true) +
"\n found : " + showMeth(aparamss, aret, abbreviate = false) +
"\n" + message)
// Phase I: sanity checks
def MacroDefIsFastTrack() = {
macroLogVerbose("typecheck terminated unexpectedly: macro is fast track")
assert(!macroDdef.tpt.isEmpty, "fast track macros must provide result type")
throw MacroBodyTypecheckException // don't call fail, because we don't need IS_ERROR
}
def MacroFeatureNotEnabled() = {
macroLogVerbose("typecheck terminated unexpectedly: language.experimental.macros feature is not enabled")
fail()
}
// Phase II: typecheck the right-hand side of the macro def
// do nothing, just fail. relevant typecheck errors have already been reported
def MacroDefUntypeableBodyError() = fail()
def MacroDefInvalidBodyError() = genericError(macroDdef, "macro body has wrong shape:\n required: macro [<implementation object>].<method name>[[<type args>]]")
def MacroImplNotPublicError() = implRefError("macro implementation must be public")
def MacroImplOverloadedError() = implRefError("macro implementation cannot be overloaded")
def MacroImplWrongNumberOfTypeArgumentsError(macroImplRef: Tree) = implRefError(typer.TyperErrorGen.TypedApplyWrongNumberOfTpeParametersErrorMessage(macroImplRef))
def MacroImplNotStaticError() = implRefError("macro implementation must be in statically accessible object")
// Phase III: check compatibility between the macro def and its macro impl
// aXXX (e.g. aparams) => characteristics of the macro impl ("a" stands for "actual")
// rXXX (e.g. rparams) => characteristics of a reference macro impl signature synthesized from the macro def ("r" stands for "reference")
def MacroImplNonTagImplicitParameters(params: List[Symbol]) = compatibilityError("macro implementations cannot have implicit parameters other than WeakTypeTag evidences")
def MacroImplParamssMismatchError() = compatibilityError("number of parameter sections differ")
def MacroImplExtraParamsError(aparams: List[Symbol], rparams: List[Symbol]) = compatibilityError(lengthMsg("value", "found", aparams(rparams.length)))
def MacroImplMissingParamsError(aparams: List[Symbol], rparams: List[Symbol]) = compatibilityError(abbreviateCoreAliases(lengthMsg("value", "required", rparams(aparams.length))))
def checkMacroImplParamTypeMismatch(atpe: Type, rparam: Symbol) = checkSubType("parameter " + rparam.name, rparam.tpe, atpe)
def checkMacroImplResultTypeMismatch(atpe: Type, rret: Type) = checkSubType("return type", atpe, rret)
def MacroImplParamNameMismatchError(aparam: Symbol, rparam: Symbol) = compatibilityError("parameter names differ: " + rparam.name + " != " + aparam.name)
def MacroImplVarargMismatchError(aparam: Symbol, rparam: Symbol) = {
if (isRepeated(rparam) && !isRepeated(aparam))
compatibilityError("types incompatible for parameter " + rparam.name + ": corresponding is not a vararg parameter")
if (!isRepeated(rparam) && isRepeated(aparam))
compatibilityError("types incompatible for parameter " + aparam.name + ": corresponding is not a vararg parameter")
}
def MacroImplTargMismatchError(atargs: List[Type], atparams: List[Symbol]) =
compatibilityError(typer.infer.InferErrorGen.NotWithinBoundsErrorMessage("", atargs, atparams, macroDebugVerbose || settings.explaintypes.value))
def MacroImplTparamInstantiationError(atparams: List[Symbol], ex: NoInstance) =
compatibilityError(
"type parameters "+(atparams map (_.defString) mkString ", ")+" cannot be instantiated\n"+
ex.getMessage)
}
}
Jump to Line
Something went wrong with that request. Please try again.