Change dependency tracking to relation on TypeParams

odersky · odersky · commit e97ebe09560f · 2022-09-20T09:48:06.000+02:00
diff --git a/compiler/src/dotty/tools/dotc/core/Constraint.scala b/compiler/src/dotty/tools/dotc/core/Constraint.scala
@@ -4,7 +4,7 @@ package core
 
 import Types._, Contexts._
 import printing.Showable
-import util.SimpleIdentityMap
+import util.{SimpleIdentitySet, SimpleIdentityMap}
 
 /** Constraint over undetermined type parameters. Constraints are built
  *  over values of the following types:
@@ -170,13 +170,13 @@ abstract class Constraint extends Showable {
    *  refer to them in their bounds covariantly, such that, if the type variable
    *  is isntantiated to a larger type, the constraint would be narrowed.
    */
-  def coDeps: Constraint.TypeVarDeps
+  def coDeps: Constraint.ReverseDeps
 
   /** A map that associates type variables with all other type variables that
    *  refer to them in their bounds covariantly, such that, if the type variable
    *  is isntantiated to a smaller type, the constraint would be narrowed.
    */
-  def contraDeps: Constraint.TypeVarDeps
+  def contraDeps: Constraint.ReverseDeps
 
   /** A string showing the `coDeps` and `contraDeps` maps */
   def depsToString(using Context): String
@@ -207,7 +207,7 @@ abstract class Constraint extends Showable {
 }
 
 object Constraint:
-  type TypeVarDeps = SimpleIdentityMap[TypeVar, TypeVars]
+  type ReverseDeps = SimpleIdentityMap[TypeParamRef, SimpleIdentitySet[TypeParamRef]]
 
 
 /** When calling `Constraint#addLess(p1, p2, ...)`, the caller might end up
diff --git a/compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala b/compiler/src/dotty/tools/dotc/core/OrderingConstraint.scala
@@ -10,7 +10,7 @@ import printing.Texts._
 import config.Config
 import config.Printers.constr
 import reflect.ClassTag
-import Constraint.TypeVarDeps
+import Constraint.ReverseDeps
 import NameKinds.DepParamName
 import annotation.tailrec
 import annotation.internal.sharable
@@ -225,122 +225,117 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
 
 // ------------- TypeVar dependencies -----------------------------------
 
-  var coDeps, contraDeps: TypeVarDeps = SimpleIdentityMap.empty
+  var coDeps, contraDeps: ReverseDeps = SimpleIdentityMap.empty
 
   def dependsOn(tv: TypeVar, except: TypeVars, co: Boolean)(using Context): Boolean =
-    def test(deps: TypeVarDeps, lens: ConstraintLens[List[TypeParamRef]]) =
-      val tvdeps = deps(tv)
-      null != tvdeps && tvdeps.exists(!except.contains(_))
-      || lens(this, tv.origin.binder, tv.origin.paramNum).exists(
-            p => !except.contains(typeVarOfParam(p)))
+    def origin(tv: TypeVar) =
+      assert(!tv.isInstantiated)
+      tv.origin
+    val param = origin(tv)
+    val excluded = except.map(origin)
+    def test(deps: ReverseDeps, lens: ConstraintLens[List[TypeParamRef]]) =
+      val depending = deps(param)
+      null != depending && depending.exists(!excluded.contains(_))
+      || lens(this, tv.origin.binder, tv.origin.paramNum).exists(!excluded.contains(_))
         //.showing(i"outer depends on $tv with ${tvdeps.toList}%, % = $result")
     if co then test(coDeps, upperLens) else test(contraDeps, lowerLens)
 
-  private class Adjuster(tvar: TypeVar)(using Context) extends TypeTraverser:
+  private class Adjuster(srcParam: TypeParamRef)(using Context) extends TypeTraverser:
     var add: Boolean = compiletime.uninitialized
 
-    def update(deps: TypeVarDeps, referenced: TypeVar): TypeVarDeps =
+    def update(deps: ReverseDeps, referenced: TypeParamRef): ReverseDeps =
       val entry = deps(referenced)
       val prev = if null == entry then SimpleIdentitySet.empty else entry
-      val now = if add then prev + tvar else prev - tvar
+      val now = if add then prev + srcParam else prev - srcParam
       deps.updated(referenced, now)
 
     def traverse(t: Type) = t match
-      case tv: TypeVar =>
-        val inst = tv.instanceOpt
-        if inst.exists then traverse(inst)
-        else
-          if variance >= 0 then coDeps = update(coDeps, tv)
-          if variance <= 0 then contraDeps = update(contraDeps, tv)
       case param: TypeParamRef =>
-        traverse(typeVarOfParam(param))
+        if contains(param) then
+          if variance >= 0 then coDeps = update(coDeps, param)
+          if variance <= 0 then contraDeps = update(contraDeps, param)
       case tp: LazyRef if !tp.completed =>
-      case _ =>
-        traverseChildren(t)
+      case _ => traverseChildren(t)
+  end Adjuster
 
   /** Adjust dependencies to account for the delta of previous entry `prevEntry`
    *  and new bound `entry` for the type variable `tvar`.
    */
-  def adjustDeps(entry: Type | Null, prevEntry: Type | Null, tvar: Type | Null)(using Context): this.type =
-    tvar match
-      case tvar: TypeVar =>
-        val adjuster = new Adjuster(tvar)
-
-        /** Adjust reverse depemdencies of all type variables referenced by `bound`
-         *  @param  isLower `bound` is a lower bound
-         *  @param  add     if true, add referenced variables to dependencoes, otherwise drop them.
-         */
-        def adjustReferenced(bound: Type, isLower: Boolean, add: Boolean) =
-          adjuster.variance = if isLower then 1 else -1
-          adjuster.add = add
-          adjuster.traverse(bound)
-
-        /** Use an optimized strategy to adjust dependencies to account for the delta
-         *  of previous bound `prevBound` and new bound `bound`: If `prevBound` is some
-         *  and/or prefix of `bound`, just add the new parts of `bound`.
-         *  @param  isLower `bound` and `prevBound` are lower bounds
-         */
-        def adjustDelta(bound: Type, prevBound: Type, isLower: Boolean): Boolean =
-          if bound eq prevBound then true
-          else bound match
-            case bound: AndOrType =>
-              adjustDelta(bound.tp1, prevBound, isLower) && {
-                adjustReferenced(bound.tp2, isLower, add = true)
-                true
-              }
-            case _ => false
-
-        /** Adjust dependencies to account for the delta of previous bound `prevBound`
-         *  and new bound `bound`.
-         *  @param  isLower `bound` and `prevBound` are lower bounds
-         */
-        def adjustBounds(bound: Type, prevBound: Type, isLower: Boolean) =
-          if !adjustDelta(bound, prevBound, isLower) then
-            adjustReferenced(prevBound, isLower, add = false)
-            adjustReferenced(bound, isLower, add = true)
-
-        entry match
-          case TypeBounds(lo, hi) =>
-            prevEntry match
-              case TypeBounds(plo, phi) =>
-                adjustBounds(lo, plo, isLower = true)
-                adjustBounds(hi, phi, isLower = false)
-              case _ =>
-                adjustReferenced(lo, isLower = true, add = true)
-                adjustReferenced(hi, isLower = false, add = true)
+  def adjustDeps(entry: Type | Null, prevEntry: Type | Null, srcParam: TypeParamRef)(using Context): this.type =
+    val adjuster = new Adjuster(srcParam)
+
+    /** Adjust reverse depemdencies of all type parameters referenced by `bound`
+     *  @param  isLower `bound` is a lower bound
+     *  @param  add     if true, add referenced variables to dependencoes, otherwise drop them.
+     */
+    def adjustReferenced(bound: Type, isLower: Boolean, add: Boolean) =
+      adjuster.variance = if isLower then 1 else -1
+      adjuster.add = add
+      adjuster.traverse(bound)
+
+    /** Use an optimized strategy to adjust dependencies to account for the delta
+     *  of previous bound `prevBound` and new bound `bound`: If `prevBound` is some
+     *  and/or prefix of `bound`, just add the new parts of `bound`.
+     *  @param  isLower `bound` and `prevBound` are lower bounds
+     */
+    def adjustDelta(bound: Type, prevBound: Type, isLower: Boolean): Boolean =
+      if bound eq prevBound then true
+      else bound match
+        case bound: AndOrType =>
+          adjustDelta(bound.tp1, prevBound, isLower) && {
+            adjustReferenced(bound.tp2, isLower, add = true)
+            true
+          }
+        case _ => false
+
+    /** Adjust dependencies to account for the delta of previous bound `prevBound`
+     *  and new bound `bound`.
+     *  @param  isLower `bound` and `prevBound` are lower bounds
+     */
+    def adjustBounds(bound: Type, prevBound: Type, isLower: Boolean) =
+      if !adjustDelta(bound, prevBound, isLower) then
+        adjustReferenced(prevBound, isLower, add = false)
+        adjustReferenced(bound, isLower, add = true)
+
+    entry match
+      case TypeBounds(lo, hi) =>
+        prevEntry match
+          case TypeBounds(plo, phi) =>
+            adjustBounds(lo, plo, isLower = true)
+            adjustBounds(hi, phi, isLower = false)
           case _ =>
-            prevEntry match
-              case TypeBounds(plo, phi) =>
-                adjustReferenced(plo, isLower = true, add = false)
-                adjustReferenced(phi, isLower = false, add = false)
-              case _ =>
-            dropDeps(tvar)
+            adjustReferenced(lo, isLower = true, add = true)
+            adjustReferenced(hi, isLower = false, add = true)
       case _ =>
+        prevEntry match
+          case TypeBounds(plo, phi) =>
+            adjustReferenced(plo, isLower = true, add = false)
+            adjustReferenced(phi, isLower = false, add = false)
+          case _ =>
+        dropDeps(srcParam)
     this
   end adjustDeps
 
   /** Adjust dependencies to account for adding or dropping `entries` to the
    *  constraint.
    *  @param add   if true, entries is added, otherwise it is dropped
    */
-  def adjustDeps(entries: Array[Type], add: Boolean)(using Context): this.type =
+  def adjustDeps(poly: TypeLambda, entries: Array[Type], add: Boolean)(using Context): this.type =
     for n <- 0 until paramCount(entries) do
       if add
-      then adjustDeps(entries(n), NoType, typeVar(entries, n))
-      else adjustDeps(NoType, entries(n), typeVar(entries, n))
+      then adjustDeps(entries(n), NoType, poly.paramRefs(n))
+      else adjustDeps(NoType, entries(n), poly.paramRefs(n))
     this
 
   /** If `tp` is a type variable, remove all its reverse dependencies */
-  def dropDeps(tp: Type)(using Context): Unit = tp match
-    case tv: TypeVar =>
-      coDeps = coDeps.remove(tv)
-      contraDeps = contraDeps.remove(tv)
-    case _ =>
+  def dropDeps(param: TypeParamRef)(using Context): Unit =
+    coDeps = coDeps.remove(param)
+    contraDeps = contraDeps.remove(param)
 
   /** A string representing the two depenecy maps */
   def depsToString(using Context): String =
-    def depsStr(deps: SimpleIdentityMap[TypeVar, TypeVars]): String =
-      def depStr(tv: TypeVar) = i"$tv --> ${deps(tv).nn.toList}%, %"
+    def depsStr(deps: ReverseDeps): String =
+      def depStr(param: TypeParamRef) = i"$param --> ${deps(param).nn.toList}%, %"
       if deps.isEmpty then "" else i"\n  ${deps.toList.map((k, v) => depStr(k))}%\n  %"
     i"co-deps:${depsStr(coDeps)}\ncontra-deps:${depsStr(contraDeps)}\n"
 
@@ -411,7 +406,7 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
     tvars.copyToArray(entries1, nparams)
     newConstraint(boundsMap = this.boundsMap.updated(poly, entries1))
       .init(poly)
-      .adjustDeps(entries1, add = true)
+      .adjustDeps(poly, entries1, add = true)
   }
 
   /** Split dependent parameters off the bounds for parameters in `poly`.
@@ -558,7 +553,7 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
   private def updateEntry(current: This, param: TypeParamRef, tp: Type)(using Context): This = {
     if Config.checkNoWildcardsInConstraint then assert(!tp.containsWildcardTypes)
     var current1 = boundsLens.update(this, current, param, tp)
-    current1.adjustDeps(tp, current.entry(param), typeVarOfParam(param))
+    current1.adjustDeps(tp, current.entry(param), param)
     tp match {
       case TypeBounds(lo, hi) =>
         for p <- dependentParams(lo, isUpper = false) do
@@ -601,12 +596,12 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
         current = boundsLens.map(this, current, p, i,
           entry =>
             val newEntry = replaceParam(entry, p, i)
-            adjustDeps(newEntry, entry, typeVar(this.boundsMap(p).nn, i))
+            adjustDeps(newEntry, entry, p.paramRefs(i))
             newEntry)
         current = lowerLens.map(this, current, p, i, removeParam)
         current = upperLens.map(this, current, p, i, removeParam)
       }
-      current.dropDeps(typeVarOfParam(param))
+      current.dropDeps(param)
       current.checkWellFormed()
   end replace
 
@@ -620,7 +615,7 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
     }
     val hardVars1 = pt.paramRefs.foldLeft(hardVars)((hvs, param) => hvs - typeVarOfParam(param))
     newConstraint(boundsMap.remove(pt), removeFromOrdering(lowerMap), removeFromOrdering(upperMap), hardVars1)
-      .adjustDeps(boundsMap(pt).nn, add = false)
+      .adjustDeps(pt, boundsMap(pt).nn, add = false)
       .checkWellFormed()
   }
 
@@ -749,11 +744,11 @@ class OrderingConstraint(private val boundsMap: ParamBounds,
           s"cyclic bound for $param: ${inst.show} in ${this.show}")
       }
     if Config.checkConstraintDeps then
-      def checkDeps(deps: TypeVarDeps) =
+      def checkDeps(deps: ReverseDeps) = ()/*
         deps.foreachBinding { (tv, tvs) =>
           for tv1 <- tvs do
             assert(!tv1.instanceOpt.exists, i"$this")
-        }
+        }*/
       checkDeps(coDeps)
       checkDeps(contraDeps)
     this
diff --git a/compiler/src/dotty/tools/dotc/typer/Inferencing.scala b/compiler/src/dotty/tools/dotc/typer/Inferencing.scala
@@ -623,24 +623,25 @@ trait Inferencing { this: Typer =>
         for tvar <- qualifying do
           if !tvar.isInstantiated && constraint.contains(tvar) && tvar.nestingLevel >= ctx.nestingLevel then
             constrainIfDependentParamRef(tvar, tree)
-            // Needs to be checked again, since previous interpolations could already have
-            // instantiated `tvar` through unification.
-            val v = vs(tvar)
-            if v == null then
-              toInstantiate += ((tvar, 0))
-            else if v.intValue != 0 then
-              toInstantiate += ((tvar, v.intValue))
-            else comparing(cmp =>
-              if !cmp.levelOK(tvar.nestingLevel, ctx.nestingLevel) then
-                // Invariant: The type of a tree whose enclosing scope is level
-                // N only contains type variables of level <= N.
-                typr.println(i"instantiate nonvariant $tvar of level ${tvar.nestingLevel} to a type variable of level <= ${ctx.nestingLevel}, $constraint")
-                cmp.atLevel(ctx.nestingLevel, tvar.origin)
-              else
-                typr.println(i"no interpolation for nonvariant $tvar in $state")
-            )
+            if !tvar.isInstantiated then
+              // Needs to be checked again, since previous interpolations could already have
+              // instantiated `tvar` through unification.
+              val v = vs(tvar)
+              if v == null then
+                toInstantiate += ((tvar, 0))
+              else if v.intValue != 0 then
+                toInstantiate += ((tvar, v.intValue))
+              else comparing(cmp =>
+                if !cmp.levelOK(tvar.nestingLevel, ctx.nestingLevel) then
+                  // Invariant: The type of a tree whose enclosing scope is level
+                  // N only contains type variables of level <= N.
+                  typr.println(i"instantiate nonvariant $tvar of level ${tvar.nestingLevel} to a type variable of level <= ${ctx.nestingLevel}, $constraint")
+                  cmp.atLevel(ctx.nestingLevel, tvar.origin)
+                else
+                  typr.println(i"no interpolation for nonvariant $tvar in $state")
+              )
 
-        def typeVarsIn(xs: collection.Seq[(TypeVar, Int)]): TypeVars =
+        def typeVarsIn(xs: List[(TypeVar, Int)]): TypeVars =
           xs.foldLeft(SimpleIdentitySet.empty: TypeVars)((tvs, tvi) => tvs + tvi._1)
 
         def filterByDeps(tvs0: List[(TypeVar, Int)]): List[(TypeVar, Int)] = {
@@ -654,7 +655,7 @@ trait Inferencing { this: Typer =>
               else if v == 0 && !belowOK then
                 step((tvar, -1) :: tvs1)
               else if v == -1 && !aboveOK || v == 1 && !belowOK then
-                println(i"drop $tvar, $v in $tp, $pt, qualifying = ${qualifying.toList}, tvs0 = ${tvs0.toList}%, %, excluded = ${excluded.toList}, $constraint")
+                typr.println(i"drop $tvar, $v in $tp, $pt, qualifying = ${qualifying.toList}, tvs0 = ${tvs0.toList}%, %, excluded = ${excluded.toList}, $constraint")
                 step(tvs1)
               else
                 tvs.derivedCons(hd, step(tvs1))
