mirror of
https://github.com/golang/go.git
synced 2025-12-08 06:10:04 +00:00
[dev.typeparams] cmd/compile: get export/import of generic types & functions working
The general idea is that we now export/import typeparams, typeparam lists for generic types and functions, and instantiated types (instantiations of generic types with either new typeparams or concrete types). This changes the export format -- the next CL in the stack adds the export versions and checks for it in the appropriate places. We always export/import generic function bodies, using the same code that we use for exporting/importing the bodies of inlineable functions. To avoid complicated scoping, we consider all type params as unique and give them unique names for types1. We therefore include the types2 ids (subscripts) in the export format and re-create on import. We always access the same unique types1 typeParam type for the same typeparam name. We create fully-instantiated generic types and functions in the original source package. We do an extra NeedRuntimeType() call to make sure that the correct DWARF information is written out. We call SetDupOK(true) for the functions/methods to have the linker automatically drop duplicate instantiations. Other miscellaneous details: - Export/import of typeparam bounds works for methods (but not typelists) for now, but will change with the typeset changes. - Added a new types.Instantiate function roughly analogous to the types2.Instantiate function recently added. - Always access methods info from the original/base generic type, since the methods of an instantiated type are not filled in (in types2 or types1). - New field OrigSym in types.Type to keep track of base generic type that instantiated type was based on. We use the generic type's symbol (OrigSym) as the link, rather than a Type pointer, since we haven't always created the base type yet when we want to set the link (during types2 to types1 conversion). - Added types2.AsTypeParam(), (*types2.TypeParam).SetId() - New test minimp.dir, which tests use of generic function Min across packages. Another test stringimp.dir, which also exports a generic function Stringify across packages, where the type param has a bound (Stringer) as well. New test pairimp.dir, which tests use of generic type Pair (with no methods) across packages. - New test valimp.dir, which tests use of generic type (with methods and related functions) across packages. - Modified several other tests (adder.go, settable.go, smallest.go, stringable.go, struct.go, sum.go) to export their generic functions/types to show that generic functions/types can be exported successfully (but this doesn't test import). Change-Id: Ie61ce9d54a46d368ddc7a76c41399378963bb57f Reviewed-on: https://go-review.googlesource.com/c/go/+/319930 Trust: Dan Scales <danscales@google.com> Trust: Robert Griesemer <gri@golang.org> Run-TryBot: Dan Scales <danscales@google.com> TryBot-Result: Go Bot <gobot@golang.org> Reviewed-by: Robert Griesemer <gri@golang.org>
This commit is contained in:
parent
468efd5e2f
commit
15ad61aff5
39 changed files with 816 additions and 158 deletions
|
|
@ -8,12 +8,10 @@
|
|||
package noder
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"cmd/compile/internal/base"
|
||||
"cmd/compile/internal/ir"
|
||||
"cmd/compile/internal/typecheck"
|
||||
"cmd/compile/internal/types"
|
||||
"cmd/internal/src"
|
||||
"fmt"
|
||||
"strings"
|
||||
)
|
||||
|
|
@ -160,9 +158,14 @@ func (g *irgen) stencil() {
|
|||
func (g *irgen) instantiateMethods() {
|
||||
for i := 0; i < len(g.instTypeList); i++ {
|
||||
typ := g.instTypeList[i]
|
||||
// Get the base generic type by looking up the symbol of the
|
||||
// generic (uninstantiated) name.
|
||||
baseSym := typ.Sym().Pkg.Lookup(genericTypeName(typ.Sym()))
|
||||
// Mark runtime type as needed, since this ensures that the
|
||||
// compiler puts out the needed DWARF symbols, when this
|
||||
// instantiated type has a different package from the local
|
||||
// package.
|
||||
typecheck.NeedRuntimeType(typ)
|
||||
// Lookup the method on the base generic type, since methods may
|
||||
// not be set on imported instantiated types.
|
||||
baseSym := typ.OrigSym
|
||||
baseType := baseSym.Def.(*ir.Name).Type()
|
||||
for j, m := range typ.Methods().Slice() {
|
||||
name := m.Nname.(*ir.Name)
|
||||
|
|
@ -199,12 +202,24 @@ func (g *irgen) getInstantiationForNode(inst *ir.InstExpr) *ir.Func {
|
|||
// with the type arguments targs. If the instantiated function is not already
|
||||
// cached, then it calls genericSubst to create the new instantiation.
|
||||
func (g *irgen) getInstantiation(nameNode *ir.Name, targs []*types.Type, isMeth bool) *ir.Func {
|
||||
if nameNode.Func.Body == nil && nameNode.Func.Inl != nil {
|
||||
// If there is no body yet but Func.Inl exists, then we can can
|
||||
// import the whole generic body.
|
||||
assert(nameNode.Func.Inl.Cost == 1 && nameNode.Sym().Pkg != types.LocalPkg)
|
||||
typecheck.ImportBody(nameNode.Func)
|
||||
assert(nameNode.Func.Inl.Body != nil)
|
||||
nameNode.Func.Body = nameNode.Func.Inl.Body
|
||||
nameNode.Func.Dcl = nameNode.Func.Inl.Dcl
|
||||
}
|
||||
sym := typecheck.MakeInstName(nameNode.Sym(), targs, isMeth)
|
||||
st := g.target.Stencils[sym]
|
||||
if st == nil {
|
||||
// If instantiation doesn't exist yet, create it and add
|
||||
// to the list of decls.
|
||||
st = g.genericSubst(sym, nameNode, targs, isMeth)
|
||||
// This ensures that the linker drops duplicates of this instantiation.
|
||||
// All just works!
|
||||
st.SetDupok(true)
|
||||
g.target.Stencils[sym] = st
|
||||
g.target.Decls = append(g.target.Decls, st)
|
||||
if base.Flag.W > 1 {
|
||||
|
|
@ -626,21 +641,6 @@ func (subst *subster) tinter(t *types.Type) *types.Type {
|
|||
return t
|
||||
}
|
||||
|
||||
// instTypeName creates a name for an instantiated type, based on the name of the
|
||||
// generic type and the type args
|
||||
func instTypeName(name string, targs []*types.Type) string {
|
||||
b := bytes.NewBufferString(name)
|
||||
b.WriteByte('[')
|
||||
for i, targ := range targs {
|
||||
if i > 0 {
|
||||
b.WriteByte(',')
|
||||
}
|
||||
b.WriteString(targ.String())
|
||||
}
|
||||
b.WriteByte(']')
|
||||
return b.String()
|
||||
}
|
||||
|
||||
// typ computes the type obtained by substituting any type parameter in t with the
|
||||
// corresponding type argument in subst. If t contains no type parameters, the
|
||||
// result is t; otherwise the result is a new type. It deals with recursive types
|
||||
|
|
@ -696,7 +696,7 @@ func (subst *subster) typ(t *types.Type) *types.Type {
|
|||
// already seen this type during this substitution or other
|
||||
// definitions/substitutions.
|
||||
genName := genericTypeName(t.Sym())
|
||||
newsym = t.Sym().Pkg.Lookup(instTypeName(genName, neededTargs))
|
||||
newsym = t.Sym().Pkg.Lookup(typecheck.InstTypeName(genName, neededTargs))
|
||||
if newsym.Def != nil {
|
||||
// We've already created this instantiated defined type.
|
||||
return newsym.Def.Type()
|
||||
|
|
@ -705,9 +705,13 @@ func (subst *subster) typ(t *types.Type) *types.Type {
|
|||
// In order to deal with recursive generic types, create a TFORW
|
||||
// type initially and set the Def field of its sym, so it can be
|
||||
// found if this type appears recursively within the type.
|
||||
forw = newIncompleteNamedType(t.Pos(), newsym)
|
||||
forw = typecheck.NewIncompleteNamedType(t.Pos(), newsym)
|
||||
//println("Creating new type by sub", newsym.Name, forw.HasTParam())
|
||||
forw.SetRParams(neededTargs)
|
||||
// Copy the OrigSym from the re-instantiated type (which is the sym of
|
||||
// the base generic type).
|
||||
assert(t.OrigSym != nil)
|
||||
forw.OrigSym = t.OrigSym
|
||||
}
|
||||
|
||||
var newt *types.Type
|
||||
|
|
@ -865,11 +869,14 @@ func (subst *subster) fields(class ir.Class, oldfields []*types.Field, dcl []*ir
|
|||
for j := range oldfields {
|
||||
newfields[j] = oldfields[j].Copy()
|
||||
newfields[j].Type = subst.typ(oldfields[j].Type)
|
||||
// A param field will be missing from dcl if its name is
|
||||
// A PPARAM field will be missing from dcl if its name is
|
||||
// unspecified or specified as "_". So, we compare the dcl sym
|
||||
// with the field sym. If they don't match, this dcl (if there is
|
||||
// one left) must apply to a later field.
|
||||
if i < len(dcl) && dcl[i].Sym() == oldfields[j].Sym {
|
||||
// with the field sym (or sym of the field's Nname node). (Unnamed
|
||||
// results still have a name like ~r2 in their Nname node.) If
|
||||
// they don't match, this dcl (if there is one left) must apply to
|
||||
// a later field.
|
||||
if i < len(dcl) && (dcl[i].Sym() == oldfields[j].Sym ||
|
||||
(oldfields[j].Nname != nil && dcl[i].Sym() == oldfields[j].Nname.Sym())) {
|
||||
newfields[j].Nname = dcl[i]
|
||||
i++
|
||||
}
|
||||
|
|
@ -884,13 +891,3 @@ func deref(t *types.Type) *types.Type {
|
|||
}
|
||||
return t
|
||||
}
|
||||
|
||||
// newIncompleteNamedType returns a TFORW type t with name specified by sym, such
|
||||
// that t.nod and sym.Def are set correctly.
|
||||
func newIncompleteNamedType(pos src.XPos, sym *types.Sym) *types.Type {
|
||||
name := ir.NewDeclNameAt(pos, ir.OTYPE, sym)
|
||||
forw := types.NewNamed(name)
|
||||
name.SetType(forw)
|
||||
sym.Def = name
|
||||
return forw
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue