package scala.tools.nsc
package typechecker
import scala.collection.mutable
import scala.collection.mutable.ListBuffer
import scala.util.control.ControlThrowable
import scala.util.control.Exception.ultimately
import symtab.Flags._
import PartialFunction._
trait TypeDiagnostics {
self: Analyzer =>
import global._
import definitions._
import global.typer.infer
private def currentUnit = currentRun.currentUnit
def inferError(pos: Position, msg: String) = infer.error(pos, msg)
def noErroneousTypes(tps: Type*) = tps forall (x => !x.isErroneous)
def noErroneousSyms(syms: Symbol*) = syms forall (x => !x.isErroneous)
def noErroneousTrees(trees: Tree*) = trees forall (x => !x.isErroneous)
def restrictionWarning(pos: Position, unit: CompilationUnit, msg: String): Unit =
unit.warning(pos, "Implementation restriction: " + msg)
def restrictionError(pos: Position, unit: CompilationUnit, msg: String): Unit =
unit.error(pos, "Implementation restriction: " + msg)
private var addendums = mutable.Map[Position, () => String]()
def setAddendum(pos: Position, msg: () => String) =
if (pos != NoPosition)
addendums(pos) = msg
def withAddendum(pos: Position) = (_: String) + addendums.getOrElse(pos, () => "")()
def decodeWithKind(name: Name, owner: Symbol): String = {
val prefix = (
if (name.isTypeName) "type "
else if (owner.isPackageClass) "object "
else "value "
)
prefix + name.decode
}
def linePrecedes(t1: Tree, t2: Tree) = t1.pos.isDefined && t1.pos.isDefined && t1.pos.line < t2.pos.line
def notAMember(sel: Tree, qual: Tree, name: Name) = {
val owner = qual.tpe.typeSymbol
val target = qual.tpe.widen
def targetKindString = if (owner.isTypeParameterOrSkolem) "type parameter " else ""
def nameString = decodeWithKind(name, owner)
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
""
)
companion + semicolon
}
inferError(
sel.pos,
withAddendum(qual.pos)(
if (name == nme.CONSTRUCTOR) target + " does not have a constructor"
else nameString + " is not a member of " + targetKindString + target + addendum
)
)
}
private def methodTypeErrorString(tp: Type) = tp match {
case mt @ MethodType(params, resultType) =>
def forString =
if (params exists (_.isSynthetic)) params map (_.tpe)
else params map (_.defString)
forString.mkString("(", ",", ")") + resultType
case x => x.toString
}
def alternatives(tree: Tree): List[Type] = tree.tpe match {
case OverloadedType(pre, alternatives) => alternatives map pre.memberType
case _ => Nil
}
def alternativesString(tree: Tree) =
alternatives(tree) map (x => " " + methodTypeErrorString(x)) mkString ("", " <and>\n", "\n")
def missingParameterTypeMsg(fun: Tree, vparam: ValDef, pt: Type) = {
def anonMessage = (
"\nThe argument types of an anonymous function must be fully known. (SLS 8.5)" +
"\nExpected type was: " + pt.toLongString
)
val suffix =
if (!vparam.mods.isSynthetic) ""
else " for expanded function" + (fun match {
case Function(_, Match(_, _)) => anonMessage
case _ => " " + fun
})
"missing parameter type" + suffix
}
def treeSymTypeMsg(tree: Tree): String = {
val sym = tree.symbol
def hasParams = tree.tpe.paramSectionCount > 0
def preResultString = if (hasParams) ": " else " of type "
def nullMessage = "expression of type " + tree.tpe
def overloadedMessage = "overloaded method " + sym + " with alternatives:\n" + alternativesString(tree)
def moduleMessage = "" + sym
def defaultMessage = moduleMessage + preResultString + tree.tpe
def applyMessage = defaultMessage + tree.symbol.locationString
if (sym == null) nullMessage
else if (sym.isOverloaded) overloadedMessage
else if (sym.isModule) moduleMessage
else if (sym.name == nme.apply) applyMessage
else defaultMessage
}
def notEnoughArgumentsMsg(fun: Tree, missing: List[Symbol]): String = {
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
}
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
}
}
def disambiguate(ss: List[String]) = ss match {
case Nil => Nil
case s :: ss => s :: (ss map { case `s` => "(some other)"+s ; case x => x })
}
def existentialContext(tp: Type) = tp.existentialSkolems match {
case Nil => ""
case xs => " where " + (disambiguate(xs map (_.existentialToString)) mkString ", ")
}
def varianceWord(sym: Symbol): String =
if (sym.variance == 1) "covariant"
else if (sym.variance == -1) "contravariant"
else "invariant"
def explainVariance(found: Type, req: Type): String = {
found.baseTypeSeq.toList foreach { tp =>
if (tp.typeSymbol isSubClass req.typeSymbol) {
val foundArgs = tp.typeArgs
val reqArgs = req.typeArgs
val params = req.typeConstructor.typeParams
if (foundArgs.nonEmpty && foundArgs.length == reqArgs.length) {
val relationships = (foundArgs, reqArgs, params).zipped map {
case (arg, reqArg, param) =>
def mkMsg(isSubtype: Boolean) = {
val op = if (isSubtype) "<:" else ">:"
val suggest = if (isSubtype) "+" else "-"
val reqsym = req.typeSymbol
def isJava = reqsym.isJavaDefined
def isScala = reqsym hasTransOwner ScalaPackageClass
val explainFound = "%s %s %s%s, but ".format(
arg, op, reqArg,
if (found.normalize.toString == tp.normalize.toString) ""
else " (and %s <: %s)".format(found, tp)
)
val explainDef = {
val prepend = if (isJava) "Java-defined " else ""
"%s%s is %s in %s.".format(prepend, reqsym, varianceWord(param), param)
}
val suggestChange = "\nYou may wish to " + (
if (isScala || isJava)
"investigate a wildcard type such as `_ %s %s`. (SLS 3.2.10)".format(op, reqArg)
else
"define %s as %s%s instead. (SLS 4.5)".format(param.name, suggest, param.name)
)
Some("Note: " + explainFound + explainDef + suggestChange)
}
val conforms = (
(arg =:= reqArg)
|| ((arg <:< reqArg) && param.isCovariant)
|| ((reqArg <:< arg) && param.isContravariant)
)
val invariant = param.variance == 0
if (conforms) Some("")
else if ((arg <:< reqArg) && invariant) mkMsg(true)
else if ((reqArg <:< arg) && invariant) mkMsg(false)
else None
}
val messages = relationships.flatten
if (messages.size == foundArgs.size)
return messages filterNot (_ == "") mkString ("\n", "\n", "")
}
}
}
""
}
def foundReqMsg(found: Type, req: Type): String = {
(withDisambiguation(List(), found, req) {
";\n found : " + found.toLongString + existentialContext(found) +
"\n required: " + req + existentialContext(req)
}) + explainVariance(found, req)
}
case class TypeDiag(tp: Type, sym: Symbol) extends Ordered[TypeDiag] {
private val savedName = sym.name
def restoreName() = sym.name = savedName
def isAltered = sym.name != savedName
def modifyName(f: String => String) =
sym.name = newTypeName(f(sym.name.toString))
def preQualify() = modifyName(trueOwner.fullName + "." + _)
def postQualify() = modifyName(_ + "(in " + trueOwner + ")")
def scalaQualify() = if (inPredefOrScala) preQualify()
def typeQualify() = if (sym.isTypeParameterOrSkolem) postQualify()
def nameQualify() = if (trueOwner.isPackageClass) preQualify() else postQualify()
def trueOwner = tp.typeSymbol.owner.skipPackageObject
def aliasOwner = tp.typeSymbolDirect.owner.skipPackageObject
def owners = List(trueOwner, aliasOwner)
private def scalaAndPredef = Set(ScalaPackageClass, PredefModuleClass)
def inPredefOrScala = owners exists scalaAndPredef
def sym_==(other: TypeDiag) = tp.typeSymbol == other.tp.typeSymbol
def owner_==(other: TypeDiag) = trueOwner == other.trueOwner
def string_==(other: TypeDiag) = tp.toString == other.tp.toString
def name_==(other: TypeDiag) = sym.name == other.sym.name
def compare(other: TypeDiag) =
if (this == other) 0
else if (sym isLess other.sym) -1
else 1
override def toString = {
"""
|tp = %s
|tp.typeSymbol = %s
|tp.typeSymbol.owner = %s
|tp.typeSymbolDirect = %s
|tp.typeSymbolDirect.owner = %s
|inPredefOrScala = %s
""".stripMargin.format(
tp, tp.typeSymbol, tp.typeSymbol.owner, tp.typeSymbolDirect, tp.typeSymbolDirect.owner, inPredefOrScala
)
}
}
private def typeDiags(locals: List[Symbol], types: Type*): List[TypeDiag] = {
object SymExtractor {
def unapply(x: Any) = x match {
case t @ ConstantType(_) => Some(t -> t.underlying.typeSymbol)
case t @ TypeRef(_, sym, _) => if (locals contains sym) None else Some(t -> sym)
case _ => None
}
}
for (tp <- types.toList; SymExtractor(t, sym) <- tp) yield TypeDiag(t, sym)
}
private def pairs[T <: Ordered[T]](xs: Seq[T]): Seq[(T, T)] = {
for (el1 <- xs ; el2 <- xs ; if el1 < el2) yield
((el1, el2))
}
def withDisambiguation[T](locals: List[Symbol], types: Type*)(op: => T): T = {
val typeRefs = typeDiags(locals, types: _*)
val toCheck = pairs(typeRefs) filterNot { case (td1, td2) => td1 sym_== td2 }
ultimately(typeRefs foreach (_.restoreName())) {
for ((td1, td2) <- toCheck) {
val tds = List(td1, td2)
if (td1 string_== td2)
tds foreach (_.nameQualify())
if (td1 name_== td2)
tds foreach (_.scalaQualify())
if (td1 string_== td2) {
if (td1 owner_== td2)
td2.modifyName("(some other)" + _)
else
tds foreach (_.typeQualify())
}
}
op
}
}
trait TyperDiagnostics {
self: Typer =>
private def contextError(pos: Position, msg: String) = context.error(pos, msg)
private def contextError(pos: Position, err: Throwable) = context.error(pos, err)
object checkDead {
private var expr: Symbol = NoSymbol
private def exprOK = expr != Object_synchronized
private def treeOK(tree: Tree) = tree.tpe != null && tree.tpe.typeSymbol == NothingClass
def updateExpr(fn: Tree) = {
if (fn.symbol != null && fn.symbol.isMethod && !fn.symbol.isConstructor)
checkDead.expr = fn.symbol
}
def apply(tree: Tree): Tree = {
if (settings.warnDeadCode.value && context.unit != null && treeOK(tree) && exprOK) {
val saved = context.reportGeneralErrors
try {
context.reportGeneralErrors = true
context.warning(tree.pos, "dead code following this construct")
}
finally context.reportGeneralErrors = saved
}
tree
}
def inMode(mode: Int, tree: Tree): Tree = {
val modeOK = (mode & (EXPRmode | BYVALmode | POLYmode)) == (EXPRmode | BYVALmode)
if (modeOK) apply(tree)
else tree
}
}
def symWasOverloaded(sym: Symbol) = sym.owner.isClass && sym.owner.info.member(sym.name).isOverloaded
def cyclicAdjective(sym: Symbol) = if (symWasOverloaded(sym)) "overloaded" else "recursive"
def cyclicReferenceMessage(sym: Symbol, tree: Tree) = condOpt(tree) {
case ValDef(_, _, tpt, _) if tpt.tpe == null => "recursive "+sym+" needs type"
case DefDef(_, _, _, _, tpt, _) if tpt.tpe == null => List(cyclicAdjective(sym), sym, "needs result type") mkString " "
}
def reportTypeError(pos: Position, ex: TypeError) {
if (ex.pos == NoPosition) ex.pos = pos
if (!context.reportGeneralErrors) throw ex
if (settings.debug.value) ex.printStackTrace()
ex match {
case CyclicReference(sym, info: TypeCompleter) =>
contextError(ex.pos, cyclicReferenceMessage(sym, info.tree) getOrElse ex.getMessage())
if (sym == ObjectClass)
throw new FatalError("cannot redefine root "+sym)
case _ =>
contextError(ex.pos, ex)
}
}
}
}