1
0
mirror of https://github.com/golang/go synced 2024-11-16 22:54:47 -07:00

go/types, types2: consider generic functions in inference simplify step

After type arguments for all type parameters have been determined,
the type arguments are "simplified" by substituting any type parameters
that might occur in them with their corresponding type arguments until
all type parameters have been removed.

If in this process a (formerly) generic function signature becomes
non-generic, make sure to nil out its (declared) type parameters.

Fixes #59953.
For #59338.

Change-Id: Ie16bffd7b0a8baed18e76e5532cdfaecd26e4278
Reviewed-on: https://go-review.googlesource.com/c/go/+/491797
Reviewed-by: Robert Findley <rfindley@google.com>
TryBot-Result: Gopher Robot <gobot@golang.org>
Reviewed-by: Robert Griesemer <gri@google.com>
Run-TryBot: Robert Griesemer <gri@google.com>
Auto-Submit: Robert Griesemer <gri@google.com>
This commit is contained in:
Robert Griesemer 2023-05-03 21:34:25 -07:00 committed by Gopher Robot
parent 60c724c55a
commit 13201d5728
3 changed files with 51 additions and 0 deletions

View File

@ -349,6 +349,9 @@ func (check *Checker) infer(pos syntax.Pos, tparams []*TypeParam, targs []Type,
} }
for len(dirty) > 0 { for len(dirty) > 0 {
if traceInference {
u.tracef("-- simplify %s ➞ %s", tparams, inferred)
}
// TODO(gri) Instead of creating a new substMap for each iteration, // TODO(gri) Instead of creating a new substMap for each iteration,
// provide an update operation for substMaps and only change when // provide an update operation for substMaps and only change when
// needed. Optimization. // needed. Optimization.
@ -357,6 +360,21 @@ func (check *Checker) infer(pos syntax.Pos, tparams []*TypeParam, targs []Type,
for _, index := range dirty { for _, index := range dirty {
t0 := inferred[index] t0 := inferred[index]
if t1 := check.subst(nopos, t0, smap, nil, check.context()); t1 != t0 { if t1 := check.subst(nopos, t0, smap, nil, check.context()); t1 != t0 {
// t0 was simplified to t1.
// If t0 was a generic function, but the simplifed signature t1 does
// not contain any type parameters anymore, the function is not generic
// anymore. Remove it's type parameters. (go.dev/issue/59953)
// Note that if t0 was a signature, t1 must be a signature, and t1
// can only be a generic signature if it originated from a generic
// function argument. Those signatures are never defined types and
// thus there is no need to call under below.
// TODO(gri) Consider doing this in Checker.subst.
// Then this would fall out automatically here and also
// in instantiation (where we also explicitly nil out
// type parameters). See the *Signature TODO in subst.
if sig, _ := t1.(*Signature); sig != nil && sig.TypeParams().Len() > 0 && !isParameterized(tparams, sig) {
sig.tparams = nil
}
inferred[index] = t1 inferred[index] = t1
dirty[n] = index dirty[n] = index
n++ n++
@ -462,6 +480,8 @@ func typeParamsString(list []*TypeParam) string {
} }
// isParameterized reports whether typ contains any of the type parameters of tparams. // isParameterized reports whether typ contains any of the type parameters of tparams.
// If typ is a generic function, isParameterized ignores the type parameter declarations;
// it only considers the signature proper (incoming and result parameters).
func isParameterized(tparams []*TypeParam, typ Type) bool { func isParameterized(tparams []*TypeParam, typ Type) bool {
w := tpWalker{ w := tpWalker{
tparams: tparams, tparams: tparams,

View File

@ -351,6 +351,9 @@ func (check *Checker) infer(posn positioner, tparams []*TypeParam, targs []Type,
} }
for len(dirty) > 0 { for len(dirty) > 0 {
if traceInference {
u.tracef("-- simplify %s ➞ %s", tparams, inferred)
}
// TODO(gri) Instead of creating a new substMap for each iteration, // TODO(gri) Instead of creating a new substMap for each iteration,
// provide an update operation for substMaps and only change when // provide an update operation for substMaps and only change when
// needed. Optimization. // needed. Optimization.
@ -359,6 +362,21 @@ func (check *Checker) infer(posn positioner, tparams []*TypeParam, targs []Type,
for _, index := range dirty { for _, index := range dirty {
t0 := inferred[index] t0 := inferred[index]
if t1 := check.subst(nopos, t0, smap, nil, check.context()); t1 != t0 { if t1 := check.subst(nopos, t0, smap, nil, check.context()); t1 != t0 {
// t0 was simplified to t1.
// If t0 was a generic function, but the simplifed signature t1 does
// not contain any type parameters anymore, the function is not generic
// anymore. Remove it's type parameters. (go.dev/issue/59953)
// Note that if t0 was a signature, t1 must be a signature, and t1
// can only be a generic signature if it originated from a generic
// function argument. Those signatures are never defined types and
// thus there is no need to call under below.
// TODO(gri) Consider doing this in Checker.subst.
// Then this would fall out automatically here and also
// in instantiation (where we also explicitly nil out
// type parameters). See the *Signature TODO in subst.
if sig, _ := t1.(*Signature); sig != nil && sig.TypeParams().Len() > 0 && !isParameterized(tparams, sig) {
sig.tparams = nil
}
inferred[index] = t1 inferred[index] = t1
dirty[n] = index dirty[n] = index
n++ n++
@ -464,6 +482,8 @@ func typeParamsString(list []*TypeParam) string {
} }
// isParameterized reports whether typ contains any of the type parameters of tparams. // isParameterized reports whether typ contains any of the type parameters of tparams.
// If typ is a generic function, isParameterized ignores the type parameter declarations;
// it only considers the signature proper (incoming and result parameters).
func isParameterized(tparams []*TypeParam, typ Type) bool { func isParameterized(tparams []*TypeParam, typ Type) bool {
w := tpWalker{ w := tpWalker{
tparams: tparams, tparams: tparams,

View File

@ -0,0 +1,11 @@
// -reverseTypeInference
// Copyright 2023 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package p
func _() { f(g) }
func f[P any](P) {}
func g[Q int](Q) {}