Add some test cases with current limitations

Author: KacperFKorban

Diff for: compiler/src/dotty/tools/dotc/ast/Desugar.scala

@@ -978,8 +978,8 @@ object desugar {
         // we can reuse the constructor parameters; no derived params are needed.
         DefDef(
           className.toTermName, joinParams(constrTparams, defParamss), classTypeRef, creatorExpr
-        ) .withMods(companionMods | mods.flags.toTermFlags & (GivenOrImplicit | Inline) | finalFlag)
-          .withSpan(cdef.span) :: Nil
+        ).withMods(companionMods | mods.flags.toTermFlags & (GivenOrImplicit | Inline) | finalFlag)
+         .withSpan(cdef.span) :: Nil
       }
 
     val self1 = {

Diff for: compiler/src/dotty/tools/dotc/typer/Namer.scala

@@ -1935,10 +1935,10 @@ class Namer { typer: Typer =>
       for params <- ddef.termParamss; param <- params do
         val psym = symbolOfTree(param)
         if needsTracked(psym, param, owningSym) then
-          psym.setFlag(Tracked)
           for acc <- sym.maybeOwner.infoOrCompleter.decls.lookupAll(psym.name) if acc.is(ParamAccessor) do
             acc.resetFlag(PrivateLocal)
             acc.setFlag(Tracked)
+            psym.setFlag(Tracked)
 
     if Feature.enabled(modularity) then addTrackedIfNeeded(ddef, sym.maybeOwner)
 
@@ -2078,12 +2078,12 @@ class Namer { typer: Typer =>
       case _ =>
 
   def inferredResultType(
-      mdef: ValOrDefDef,
-      sym: Symbol,
-      paramss: List[List[Symbol]],
-      paramFn: Type => Type,
-      fallbackProto: Type
-    )(using Context): Type =
+    mdef: ValOrDefDef,
+    sym: Symbol,
+    paramss: List[List[Symbol]],
+    paramFn: Type => Type,
+    fallbackProto: Type
+  )(using Context): Type =
 
     /** A type for this definition that might be inherited from elsewhere:
      *  If this is a setter parameter, the corresponding getter type.

Diff for: compiler/test/dotc/pos-test-pickling.blacklist

@@ -135,7 +135,6 @@ parsercombinators-new-syntax.scala
 hylolib-deferred-given
 hylolib-cb
 hylolib
-infer-tracked-parsercombinators-givens.scala
 
 # typecheckErrors method unpickling
 i21415.scala

Diff for: tests/pos/infer-tracked-parsercombinators-givens.scala

@@ -25,6 +25,11 @@ case class K(c: C):
 case class L(c: C):
   type T = c.T
 
+class M
+
+given mInst: (c: C) => M:
+  def foo: c.T = c.foo
+
 def Test =
   val c = new C:
     type T = Int
@@ -33,8 +38,7 @@ def Test =
   val f = new F(c)
   val _: Int = f.result
 
-  // Not really possible to work with inference in Namer, should emit a lint
-  // val g = new G(c)
+  // val g = new G(c) // current limitation of infering in Namer, should emit a lint
   // val _: Int = g.result
 
   val h = new H(c)
@@ -51,3 +55,6 @@ def Test =
 
   val l = L(c)
   summon[l.T =:= Int]
+
+  // val m = mInst(using c) // current limitation, we infer tracked after this desugaring
+  // val _: Int = m.foo