mono.go

     1  // Copyright 2021 The Go Authors. All rights reserved.
     2  // Use of this source code is governed by a BSD-style
     3  // license that can be found in the LICENSE file.
     4  
     5  package types2
     6  
     7  import (
     8  	"cmd/compile/internal/syntax"
     9  	. "internal/types/errors"
    10  )
    11  
    12  // This file implements a check to validate that a Go package doesn't
    13  // have unbounded recursive instantiation, which is not compatible
    14  // with compilers using static instantiation (such as
    15  // monomorphization).
    16  //
    17  // It implements a sort of "type flow" analysis by detecting which
    18  // type parameters are instantiated with other type parameters (or
    19  // types derived thereof). A package cannot be statically instantiated
    20  // if the graph has any cycles involving at least one derived type.
    21  //
    22  // Concretely, we construct a directed, weighted graph. Vertices are
    23  // used to represent type parameters as well as some defined
    24  // types. Edges are used to represent how types depend on each other:
    25  //
    26  // * Everywhere a type-parameterized function or type is instantiated,
    27  //   we add edges to each type parameter from the vertices (if any)
    28  //   representing each type parameter or defined type referenced by
    29  //   the type argument. If the type argument is just the referenced
    30  //   type itself, then the edge has weight 0, otherwise 1.
    31  //
    32  // * For every defined type declared within a type-parameterized
    33  //   function or method, we add an edge of weight 1 to the defined
    34  //   type from each ambient type parameter.
    35  //
    36  // For example, given:
    37  //
    38  //	func f[A, B any]() {
    39  //		type T int
    40  //		f[T, map[A]B]()
    41  //	}
    42  //
    43  // we construct vertices representing types A, B, and T. Because of
    44  // declaration "type T int", we construct edges T<-A and T<-B with
    45  // weight 1; and because of instantiation "f[T, map[A]B]" we construct
    46  // edges A<-T with weight 0, and B<-A and B<-B with weight 1.
    47  //
    48  // Finally, we look for any positive-weight cycles. Zero-weight cycles
    49  // are allowed because static instantiation will reach a fixed point.
    50  
    51  type monoGraph struct {
    52  	vertices []monoVertex
    53  	edges    []monoEdge
    54  
    55  	// canon maps method receiver type parameters to their respective
    56  	// receiver type's type parameters.
    57  	canon map[*TypeParam]*TypeParam
    58  
    59  	// nameIdx maps a defined type or (canonical) type parameter to its
    60  	// vertex index.
    61  	nameIdx map[*TypeName]int
    62  }
    63  
    64  type monoVertex struct {
    65  	weight int // weight of heaviest known path to this vertex
    66  	pre    int // previous edge (if any) in the above path
    67  	len    int // length of the above path
    68  
    69  	// obj is the defined type or type parameter represented by this
    70  	// vertex.
    71  	obj *TypeName
    72  }
    73  
    74  type monoEdge struct {
    75  	dst, src int
    76  	weight   int
    77  
    78  	pos syntax.Pos
    79  	typ Type
    80  }
    81  
    82  func (check *Checker) monomorph() {
    83  	// We detect unbounded instantiation cycles using a variant of
    84  	// Bellman-Ford's algorithm. Namely, instead of always running |V|
    85  	// iterations, we run until we either reach a fixed point or we've
    86  	// found a path of length |V|. This allows us to terminate earlier
    87  	// when there are no cycles, which should be the common case.
    88  
    89  	again := true
    90  	for again {
    91  		again = false
    92  
    93  		for i, edge := range check.mono.edges {
    94  			src := &check.mono.vertices[edge.src]
    95  			dst := &check.mono.vertices[edge.dst]
    96  
    97  			// N.B., we're looking for the greatest weight paths, unlike
    98  			// typical Bellman-Ford.
    99  			w := src.weight + edge.weight
   100  			if w <= dst.weight {
   101  				continue
   102  			}
   103  
   104  			dst.pre = i
   105  			dst.len = src.len + 1
   106  			if dst.len == len(check.mono.vertices) {
   107  				check.reportInstanceLoop(edge.dst)
   108  				return
   109  			}
   110  
   111  			dst.weight = w
   112  			again = true
   113  		}
   114  	}
   115  }
   116  
   117  func (check *Checker) reportInstanceLoop(v int) {
   118  	var stack []int
   119  	seen := make([]bool, len(check.mono.vertices))
   120  
   121  	// We have a path that contains a cycle and ends at v, but v may
   122  	// only be reachable from the cycle, not on the cycle itself. We
   123  	// start by walking backwards along the path until we find a vertex
   124  	// that appears twice.
   125  	for !seen[v] {
   126  		stack = append(stack, v)
   127  		seen[v] = true
   128  		v = check.mono.edges[check.mono.vertices[v].pre].src
   129  	}
   130  
   131  	// Trim any vertices we visited before visiting v the first
   132  	// time. Since v is the first vertex we found within the cycle, any
   133  	// vertices we visited earlier cannot be part of the cycle.
   134  	for stack[0] != v {
   135  		stack = stack[1:]
   136  	}
   137  
   138  	// TODO(mdempsky): Pivot stack so we report the cycle from the top?
   139  
   140  	err := check.newError(InvalidInstanceCycle)
   141  	obj0 := check.mono.vertices[v].obj
   142  	err.addf(obj0, "instantiation cycle:")
   143  
   144  	qf := RelativeTo(check.pkg)
   145  	for _, v := range stack {
   146  		edge := check.mono.edges[check.mono.vertices[v].pre]
   147  		obj := check.mono.vertices[edge.dst].obj
   148  
   149  		switch obj.Type().(type) {
   150  		default:
   151  			panic("unexpected type")
   152  		case *Named:
   153  			err.addf(atPos(edge.pos), "%s implicitly parameterized by %s", obj.Name(), TypeString(edge.typ, qf)) // secondary error, \t indented
   154  		case *TypeParam:
   155  			err.addf(atPos(edge.pos), "%s instantiated as %s", obj.Name(), TypeString(edge.typ, qf)) // secondary error, \t indented
   156  		}
   157  	}
   158  	err.report()
   159  }
   160  
   161  // recordCanon records that tpar is the canonical type parameter
   162  // corresponding to method type parameter mpar.
   163  func (w *monoGraph) recordCanon(mpar, tpar *TypeParam) {
   164  	if w.canon == nil {
   165  		w.canon = make(map[*TypeParam]*TypeParam)
   166  	}
   167  	w.canon[mpar] = tpar
   168  }
   169  
   170  // recordInstance records that the given type parameters were
   171  // instantiated with the corresponding type arguments.
   172  func (w *monoGraph) recordInstance(pkg *Package, pos syntax.Pos, tparams []*TypeParam, targs []Type, xlist []syntax.Expr) {
   173  	for i, tpar := range tparams {
   174  		pos := pos
   175  		if i < len(xlist) {
   176  			pos = startPos(xlist[i])
   177  		}
   178  		w.assign(pkg, pos, tpar, targs[i])
   179  	}
   180  }
   181  
   182  // assign records that tpar was instantiated as targ at pos.
   183  func (w *monoGraph) assign(pkg *Package, pos syntax.Pos, tpar *TypeParam, targ Type) {
   184  	// Go generics do not have an analog to C++`s template-templates,
   185  	// where a template parameter can itself be an instantiable
   186  	// template. So any instantiation cycles must occur within a single
   187  	// package. Accordingly, we can ignore instantiations of imported
   188  	// type parameters.
   189  	//
   190  	// TODO(mdempsky): Push this check up into recordInstance? All type
   191  	// parameters in a list will appear in the same package.
   192  	if tpar.Obj().Pkg() != pkg {
   193  		return
   194  	}
   195  
   196  	// flow adds an edge from vertex src representing that typ flows to tpar.
   197  	flow := func(src int, typ Type) {
   198  		weight := 1
   199  		if typ == targ {
   200  			weight = 0
   201  		}
   202  
   203  		w.addEdge(w.typeParamVertex(tpar), src, weight, pos, targ)
   204  	}
   205  
   206  	// Recursively walk the type argument to find any defined types or
   207  	// type parameters.
   208  	var do func(typ Type)
   209  	do = func(typ Type) {
   210  		switch typ := Unalias(typ).(type) {
   211  		default:
   212  			panic("unexpected type")
   213  
   214  		case *TypeParam:
   215  			assert(typ.Obj().Pkg() == pkg)
   216  			flow(w.typeParamVertex(typ), typ)
   217  
   218  		case *Named:
   219  			if src := w.localNamedVertex(pkg, typ.Origin()); src >= 0 {
   220  				flow(src, typ)
   221  			}
   222  
   223  			targs := typ.TypeArgs()
   224  			for i := 0; i < targs.Len(); i++ {
   225  				do(targs.At(i))
   226  			}
   227  
   228  		case *Array:
   229  			do(typ.Elem())
   230  		case *Basic:
   231  			// ok
   232  		case *Chan:
   233  			do(typ.Elem())
   234  		case *Map:
   235  			do(typ.Key())
   236  			do(typ.Elem())
   237  		case *Pointer:
   238  			do(typ.Elem())
   239  		case *Slice:
   240  			do(typ.Elem())
   241  
   242  		case *Interface:
   243  			for i := 0; i < typ.NumMethods(); i++ {
   244  				do(typ.Method(i).Type())
   245  			}
   246  		case *Signature:
   247  			tuple := func(tup *Tuple) {
   248  				for i := 0; i < tup.Len(); i++ {
   249  					do(tup.At(i).Type())
   250  				}
   251  			}
   252  			tuple(typ.Params())
   253  			tuple(typ.Results())
   254  		case *Struct:
   255  			for i := 0; i < typ.NumFields(); i++ {
   256  				do(typ.Field(i).Type())
   257  			}
   258  		}
   259  	}
   260  	do(targ)
   261  }
   262  
   263  // localNamedVertex returns the index of the vertex representing
   264  // named, or -1 if named doesn't need representation.
   265  func (w *monoGraph) localNamedVertex(pkg *Package, named *Named) int {
   266  	obj := named.Obj()
   267  	if obj.Pkg() != pkg {
   268  		return -1 // imported type
   269  	}
   270  
   271  	root := pkg.Scope()
   272  	if obj.Parent() == root {
   273  		return -1 // package scope, no ambient type parameters
   274  	}
   275  
   276  	if idx, ok := w.nameIdx[obj]; ok {
   277  		return idx
   278  	}
   279  
   280  	idx := -1
   281  
   282  	// Walk the type definition's scope to find any ambient type
   283  	// parameters that it's implicitly parameterized by.
   284  	for scope := obj.Parent(); scope != root; scope = scope.Parent() {
   285  		for _, elem := range scope.elems {
   286  			if elem, ok := elem.(*TypeName); ok && !elem.IsAlias() && cmpPos(elem.Pos(), obj.Pos()) < 0 {
   287  				if tpar, ok := elem.Type().(*TypeParam); ok {
   288  					if idx < 0 {
   289  						idx = len(w.vertices)
   290  						w.vertices = append(w.vertices, monoVertex{obj: obj})
   291  					}
   292  
   293  					w.addEdge(idx, w.typeParamVertex(tpar), 1, obj.Pos(), tpar)
   294  				}
   295  			}
   296  		}
   297  	}
   298  
   299  	if w.nameIdx == nil {
   300  		w.nameIdx = make(map[*TypeName]int)
   301  	}
   302  	w.nameIdx[obj] = idx
   303  	return idx
   304  }
   305  
   306  // typeParamVertex returns the index of the vertex representing tpar.
   307  func (w *monoGraph) typeParamVertex(tpar *TypeParam) int {
   308  	if x, ok := w.canon[tpar]; ok {
   309  		tpar = x
   310  	}
   311  
   312  	obj := tpar.Obj()
   313  
   314  	if idx, ok := w.nameIdx[obj]; ok {
   315  		return idx
   316  	}
   317  
   318  	if w.nameIdx == nil {
   319  		w.nameIdx = make(map[*TypeName]int)
   320  	}
   321  
   322  	idx := len(w.vertices)
   323  	w.vertices = append(w.vertices, monoVertex{obj: obj})
   324  	w.nameIdx[obj] = idx
   325  	return idx
   326  }
   327  
   328  func (w *monoGraph) addEdge(dst, src, weight int, pos syntax.Pos, typ Type) {
   329  	// TODO(mdempsky): Deduplicate redundant edges?
   330  	w.edges = append(w.edges, monoEdge{
   331  		dst:    dst,
   332  		src:    src,
   333  		weight: weight,
   334  
   335  		pos: pos,
   336  		typ: typ,
   337  	})
   338  }
   339
View as plain text