aboutsummaryrefslogtreecommitdiff
path: root/test/typeparam/dictionaryCapture.go
diff options
context:
space:
mode:
authorDan Scales <danscales@google.com>2021-06-07 18:13:15 -0700
committerDan Scales <danscales@google.com>2021-06-24 20:11:51 +0000
commitddb09af1b85ee9ae278ef338df56c4d91c1acd0d (patch)
treebfcd2590114f576b13e4b15cddb54c34422d9a95 /test/typeparam/dictionaryCapture.go
parentdf00abc61b415eb05d4df9fd2bf3fdda1aaaaba3 (diff)
downloadgo-ddb09af1b85ee9ae278ef338df56c4d91c1acd0d.tar.gz
go-ddb09af1b85ee9ae278ef338df56c4d91c1acd0d.zip
[dev.typeparams] cmd/compile: add derived types and subdictionaries to dictionaries
This is code in progress to generate the two main other types of entries in dictionaries: - all types in the instantiated function derived from the type arguments (which are currently concrete, but will eventually be gcshapes) - pointers (i.e. mainly the unique name) to all needed sub-dictionaries In order to generate these entries, we now generate cached information gfInfo about generic functions/methods that can be used for creating the instantiated dictionaries. We use the type substituter to compute the right type args for instantiated sub-dictionaries. If infoPrintMode is changed to true, the code prints out all the information gathered about generic functions, and also the entries in all the dictionaries that are instantiated. The debug mode also prints out the locations where we need main dictionaries in non-instantiated functions. Other changes: - Moved the dictionary generation back to stencil.go from reflect.go, since we need to do extra analysis for the new dictionary entries. In the process, made getInstantiation generate both the function instantiation and the associated dictionary. - Put in small change for now in reflect.go, so that we don't try generate separate dictionaries for Value[T].get and the auto-generated (*Value[T]).get. The auto-generated wrapper shouldn't really need a dictionary. - Detected, but not handling yet, a new case which needs dictionaries - closures that have function params or captured variables whose types are derived from type arguments. - Added new tests in dictionaryCapture for use of method value/expressions in generic functions and for mutually recursive generic functions. Change-Id: If0cbde8805a9f673a23f5ec798769c85c9c5359b Reviewed-on: https://go-review.googlesource.com/c/go/+/327311 Trust: Dan Scales <danscales@google.com> Run-TryBot: Dan Scales <danscales@google.com> TryBot-Result: Go Bot <gobot@golang.org> Reviewed-by: Keith Randall <khr@golang.org>
Diffstat (limited to 'test/typeparam/dictionaryCapture.go')
-rw-r--r--test/typeparam/dictionaryCapture.go66
1 files changed, 66 insertions, 0 deletions
diff --git a/test/typeparam/dictionaryCapture.go b/test/typeparam/dictionaryCapture.go
index 1b2ee1de91..af508859e1 100644
--- a/test/typeparam/dictionaryCapture.go
+++ b/test/typeparam/dictionaryCapture.go
@@ -10,12 +10,19 @@
package main
+import (
+ "fmt"
+)
+
func main() {
functions()
methodExpressions()
+ genMethodExpressions[int](7)
methodValues()
+ genMethodValues[int](7)
interfaceMethods()
globals()
+ recursive()
}
func g0[T any](x T) {
@@ -72,6 +79,20 @@ func methodExpressions() {
is77(f2(x))
}
+func genMethodExpressions[T comparable](want T) {
+ x := s[T]{a: want}
+ f0 := s[T].g0
+ f0(x)
+ f1 := s[T].g1
+ if got := f1(x); got != want {
+ panic(fmt.Sprintf("f1(x) == %d, want %d", got, want))
+ }
+ f2 := s[T].g2
+ if got1, got2 := f2(x); got1 != want || got2 != want {
+ panic(fmt.Sprintf("f2(x) == %d, %d, want %d, %d", got1, got2, want, want))
+ }
+}
+
func methodValues() {
x := s[int]{a:7}
f0 := x.g0
@@ -82,6 +103,20 @@ func methodValues() {
is77(f2())
}
+func genMethodValues[T comparable](want T) {
+ x := s[T]{a: want}
+ f0 := x.g0
+ f0()
+ f1 := x.g1
+ if got := f1(); got != want {
+ panic(fmt.Sprintf("f1() == %d, want %d", got, want))
+ }
+ f2 := x.g2
+ if got1, got2 := f2(); got1 != want || got2 != want {
+ panic(fmt.Sprintf("f2() == %d, %d, want %d, %d", got1, got2, want, want))
+ }
+}
+
var x interface{
g0()
g1()int
@@ -124,3 +159,34 @@ func globals() {
is7(ii1())
is77(ii2())
}
+
+
+func recursive() {
+ if got, want := recur1[int](5), 110; got != want {
+ panic(fmt.Sprintf("recur1[int](5) = %d, want = %d", got, want))
+ }
+}
+
+type Integer interface {
+ int | int32 | int64
+}
+
+func recur1[T Integer](n T) T {
+ if n == 0 || n == 1 {
+ return T(1)
+ } else {
+ return n * recur2(n - 1)
+ }
+}
+
+func recur2[T Integer](n T) T {
+ list := make([]T, n)
+ for i, _ := range list {
+ list[i] = T(i+1)
+ }
+ var sum T
+ for _, elt := range list {
+ sum += elt
+ }
+ return sum + recur1(n-1)
+}