mirror of
https://github.com/tailscale/tailscale.git
synced 2026-02-10 10:12:27 +01:00
This file was never truly necessary and has never actually been used in the history of Tailscale's open source releases. A Brief History of AUTHORS files --- The AUTHORS file was a pattern developed at Google, originally for Chromium, then adopted by Go and a bunch of other projects. The problem was that Chromium originally had a copyright line only recognizing Google as the copyright holder. Because Google (and most open source projects) do not require copyright assignemnt for contributions, each contributor maintains their copyright. Some large corporate contributors then tried to add their own name to the copyright line in the LICENSE file or in file headers. This quickly becomes unwieldy, and puts a tremendous burden on anyone building on top of Chromium, since the license requires that they keep all copyright lines intact. The compromise was to create an AUTHORS file that would list all of the copyright holders. The LICENSE file and source file headers would then include that list by reference, listing the copyright holder as "The Chromium Authors". This also become cumbersome to simply keep the file up to date with a high rate of new contributors. Plus it's not always obvious who the copyright holder is. Sometimes it is the individual making the contribution, but many times it may be their employer. There is no way for the proejct maintainer to know. Eventually, Google changed their policy to no longer recommend trying to keep the AUTHORS file up to date proactively, and instead to only add to it when requested: https://opensource.google/docs/releasing/authors. They are also clear that: > Adding contributors to the AUTHORS file is entirely within the > project's discretion and has no implications for copyright ownership. It was primarily added to appease a small number of large contributors that insisted that they be recognized as copyright holders (which was entirely their right to do). But it's not truly necessary, and not even the most accurate way of identifying contributors and/or copyright holders. In practice, we've never added anyone to our AUTHORS file. It only lists Tailscale, so it's not really serving any purpose. It also causes confusion because Tailscalars put the "Tailscale Inc & AUTHORS" header in other open source repos which don't actually have an AUTHORS file, so it's ambiguous what that means. Instead, we just acknowledge that the contributors to Tailscale (whoever they are) are copyright holders for their individual contributions. We also have the benefit of using the DCO (developercertificate.org) which provides some additional certification of their right to make the contribution. The source file changes were purely mechanical with: git ls-files | xargs sed -i -e 's/\(Tailscale Inc &\) AUTHORS/\1 contributors/g' Updates #cleanup Change-Id: Ia101a4a3005adb9118051b3416f5a64a4a45987d Signed-off-by: Will Norris <will@tailscale.com>
359 lines
12 KiB
Go
359 lines
12 KiB
Go
// Copyright (c) Tailscale Inc & contributors
|
|
// SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
// Cloner is a tool to automate the creation of a Clone method.
|
|
//
|
|
// The result of the Clone method aliases no memory that can be edited
|
|
// with the original.
|
|
//
|
|
// This tool makes lots of implicit assumptions about the types you feed it.
|
|
// In particular, it can only write relatively "shallow" Clone methods.
|
|
// That is, if a type contains another named struct type, cloner assumes that
|
|
// named type will also have a Clone method.
|
|
package main
|
|
|
|
import (
|
|
"bytes"
|
|
"flag"
|
|
"fmt"
|
|
"go/types"
|
|
"log"
|
|
"os"
|
|
"strings"
|
|
|
|
"tailscale.com/util/codegen"
|
|
)
|
|
|
|
var (
|
|
flagTypes = flag.String("type", "", "comma-separated list of types; required")
|
|
flagBuildTags = flag.String("tags", "", "compiler build tags to apply")
|
|
flagCloneFunc = flag.Bool("clonefunc", false, "add a top-level Clone func")
|
|
)
|
|
|
|
func main() {
|
|
log.SetFlags(0)
|
|
log.SetPrefix("cloner: ")
|
|
flag.Parse()
|
|
if len(*flagTypes) == 0 {
|
|
flag.Usage()
|
|
os.Exit(2)
|
|
}
|
|
typeNames := strings.Split(*flagTypes, ",")
|
|
|
|
pkg, namedTypes, err := codegen.LoadTypes(*flagBuildTags, ".")
|
|
if err != nil {
|
|
log.Fatal(err)
|
|
}
|
|
it := codegen.NewImportTracker(pkg.Types)
|
|
buf := new(bytes.Buffer)
|
|
for _, typeName := range typeNames {
|
|
typ, ok := namedTypes[typeName].(*types.Named)
|
|
if !ok {
|
|
log.Fatalf("could not find type %s", typeName)
|
|
}
|
|
gen(buf, it, typ)
|
|
}
|
|
|
|
w := func(format string, args ...any) {
|
|
fmt.Fprintf(buf, format+"\n", args...)
|
|
}
|
|
if *flagCloneFunc {
|
|
w("// Clone duplicates src into dst and reports whether it succeeded.")
|
|
w("// To succeed, <src, dst> must be of types <*T, *T> or <*T, **T>,")
|
|
w("// where T is one of %s.", *flagTypes)
|
|
w("func Clone(dst, src any) bool {")
|
|
w(" switch src := src.(type) {")
|
|
for _, typeName := range typeNames {
|
|
w(" case *%s:", typeName)
|
|
w(" switch dst := dst.(type) {")
|
|
w(" case *%s:", typeName)
|
|
w(" *dst = *src.Clone()")
|
|
w(" return true")
|
|
w(" case **%s:", typeName)
|
|
w(" *dst = src.Clone()")
|
|
w(" return true")
|
|
w(" }")
|
|
}
|
|
w(" }")
|
|
w(" return false")
|
|
w("}")
|
|
}
|
|
cloneOutput := pkg.Name + "_clone"
|
|
if *flagBuildTags == "test" {
|
|
cloneOutput += "_test"
|
|
}
|
|
cloneOutput += ".go"
|
|
if err := codegen.WritePackageFile("tailscale.com/cmd/cloner", pkg, cloneOutput, it, buf); err != nil {
|
|
log.Fatal(err)
|
|
}
|
|
}
|
|
|
|
func gen(buf *bytes.Buffer, it *codegen.ImportTracker, typ *types.Named) {
|
|
t, ok := typ.Underlying().(*types.Struct)
|
|
if !ok {
|
|
return
|
|
}
|
|
|
|
name := typ.Obj().Name()
|
|
typeParams := typ.Origin().TypeParams()
|
|
_, typeParamNames := codegen.FormatTypeParams(typeParams, it)
|
|
nameWithParams := name + typeParamNames
|
|
fmt.Fprintf(buf, "// Clone makes a deep copy of %s.\n", name)
|
|
fmt.Fprintf(buf, "// The result aliases no memory with the original.\n")
|
|
fmt.Fprintf(buf, "func (src *%s) Clone() *%s {\n", nameWithParams, nameWithParams)
|
|
writef := func(format string, args ...any) {
|
|
fmt.Fprintf(buf, "\t"+format+"\n", args...)
|
|
}
|
|
writef("if src == nil {")
|
|
writef("\treturn nil")
|
|
writef("}")
|
|
writef("dst := new(%s)", nameWithParams)
|
|
writef("*dst = *src")
|
|
for i := range t.NumFields() {
|
|
fname := t.Field(i).Name()
|
|
ft := t.Field(i).Type()
|
|
if !codegen.ContainsPointers(ft) || codegen.HasNoClone(t.Tag(i)) {
|
|
continue
|
|
}
|
|
if named, _ := codegen.NamedTypeOf(ft); named != nil {
|
|
if codegen.IsViewType(ft) {
|
|
writef("dst.%s = src.%s", fname, fname)
|
|
continue
|
|
}
|
|
if !hasBasicUnderlying(ft) {
|
|
// don't dereference if the underlying type is an interface
|
|
if _, isInterface := ft.Underlying().(*types.Interface); isInterface {
|
|
writef("if src.%s != nil { dst.%s = src.%s.Clone() }", fname, fname, fname)
|
|
} else {
|
|
writef("dst.%s = *src.%s.Clone()", fname, fname)
|
|
}
|
|
continue
|
|
}
|
|
}
|
|
switch ft := ft.Underlying().(type) {
|
|
case *types.Slice:
|
|
if codegen.ContainsPointers(ft.Elem()) {
|
|
n := it.QualifiedName(ft.Elem())
|
|
writef("if src.%s != nil {", fname)
|
|
writef("dst.%s = make([]%s, len(src.%s))", fname, n, fname)
|
|
writef("for i := range dst.%s {", fname)
|
|
if ptr, isPtr := ft.Elem().(*types.Pointer); isPtr {
|
|
writef("if src.%s[i] == nil { dst.%s[i] = nil } else {", fname, fname)
|
|
if codegen.ContainsPointers(ptr.Elem()) {
|
|
if _, isIface := ptr.Elem().Underlying().(*types.Interface); isIface {
|
|
it.Import("", "tailscale.com/types/ptr")
|
|
writef("\tdst.%s[i] = ptr.To((*src.%s[i]).Clone())", fname, fname)
|
|
} else {
|
|
writef("\tdst.%s[i] = src.%s[i].Clone()", fname, fname)
|
|
}
|
|
} else {
|
|
it.Import("", "tailscale.com/types/ptr")
|
|
writef("\tdst.%s[i] = ptr.To(*src.%s[i])", fname, fname)
|
|
}
|
|
writef("}")
|
|
} else if ft.Elem().String() == "encoding/json.RawMessage" {
|
|
writef("\tdst.%s[i] = append(src.%s[i][:0:0], src.%s[i]...)", fname, fname, fname)
|
|
} else if _, isIface := ft.Elem().Underlying().(*types.Interface); isIface {
|
|
writef("\tdst.%s[i] = src.%s[i].Clone()", fname, fname)
|
|
} else {
|
|
writef("\tdst.%s[i] = *src.%s[i].Clone()", fname, fname)
|
|
}
|
|
writef("}")
|
|
writef("}")
|
|
} else {
|
|
writef("dst.%s = append(src.%s[:0:0], src.%s...)", fname, fname, fname)
|
|
}
|
|
case *types.Pointer:
|
|
base := ft.Elem()
|
|
hasPtrs := codegen.ContainsPointers(base)
|
|
if named, _ := codegen.NamedTypeOf(base); named != nil && hasPtrs {
|
|
writef("dst.%s = src.%s.Clone()", fname, fname)
|
|
continue
|
|
}
|
|
it.Import("", "tailscale.com/types/ptr")
|
|
writef("if dst.%s != nil {", fname)
|
|
if _, isIface := base.Underlying().(*types.Interface); isIface && hasPtrs {
|
|
writef("\tdst.%s = ptr.To((*src.%s).Clone())", fname, fname)
|
|
} else if !hasPtrs {
|
|
writef("\tdst.%s = ptr.To(*src.%s)", fname, fname)
|
|
} else {
|
|
writef("\t" + `panic("TODO pointers in pointers")`)
|
|
}
|
|
writef("}")
|
|
case *types.Map:
|
|
elem := ft.Elem()
|
|
if sliceType, isSlice := elem.(*types.Slice); isSlice {
|
|
n := it.QualifiedName(sliceType.Elem())
|
|
writef("if dst.%s != nil {", fname)
|
|
writef("\tdst.%s = map[%s]%s{}", fname, it.QualifiedName(ft.Key()), it.QualifiedName(elem))
|
|
writef("\tfor k := range src.%s {", fname)
|
|
// use zero-length slice instead of nil to ensure
|
|
// the key is always copied.
|
|
writef("\t\tdst.%s[k] = append([]%s{}, src.%s[k]...)", fname, n, fname)
|
|
writef("\t}")
|
|
writef("}")
|
|
} else if codegen.IsViewType(elem) || !codegen.ContainsPointers(elem) {
|
|
// If the map values are view types (which are
|
|
// immutable and don't need cloning) or don't
|
|
// themselves contain pointers, we can just
|
|
// clone the map itself.
|
|
it.Import("", "maps")
|
|
writef("\tdst.%s = maps.Clone(src.%s)", fname, fname)
|
|
} else {
|
|
// Otherwise we need to clone each element of
|
|
// the map using our recursive helper.
|
|
writef("if dst.%s != nil {", fname)
|
|
writef("\tdst.%s = map[%s]%s{}", fname, it.QualifiedName(ft.Key()), it.QualifiedName(elem))
|
|
writef("\tfor k, v := range src.%s {", fname)
|
|
|
|
// Use a recursive helper here; this handles
|
|
// arbitrarily nested maps in addition to
|
|
// simpler types.
|
|
writeMapValueClone(mapValueCloneParams{
|
|
Buf: buf,
|
|
It: it,
|
|
Elem: elem,
|
|
SrcExpr: "v",
|
|
DstExpr: fmt.Sprintf("dst.%s[k]", fname),
|
|
BaseIndent: "\t",
|
|
Depth: 1,
|
|
})
|
|
writef("\t}")
|
|
writef("}")
|
|
}
|
|
case *types.Interface:
|
|
// If ft is an interface with a "Clone() ft" method, it can be used to clone the field.
|
|
// This includes scenarios where ft is a constrained type parameter.
|
|
if cloneResultType := methodResultType(ft, "Clone"); cloneResultType.Underlying() == ft {
|
|
writef("dst.%s = src.%s.Clone()", fname, fname)
|
|
continue
|
|
}
|
|
writef(`panic("%s (%v) does not have a compatible Clone method")`, fname, ft)
|
|
default:
|
|
writef(`panic("TODO: %s (%T)")`, fname, ft)
|
|
}
|
|
}
|
|
writef("return dst")
|
|
fmt.Fprintf(buf, "}\n\n")
|
|
|
|
buf.Write(codegen.AssertStructUnchanged(t, name, typeParams, "Clone", it))
|
|
}
|
|
|
|
// hasBasicUnderlying reports true when typ.Underlying() is a slice or a map.
|
|
func hasBasicUnderlying(typ types.Type) bool {
|
|
switch typ.Underlying().(type) {
|
|
case *types.Slice, *types.Map:
|
|
return true
|
|
default:
|
|
return false
|
|
}
|
|
}
|
|
|
|
func methodResultType(typ types.Type, method string) types.Type {
|
|
viewMethod := codegen.LookupMethod(typ, method)
|
|
if viewMethod == nil {
|
|
return nil
|
|
}
|
|
sig, ok := viewMethod.Type().(*types.Signature)
|
|
if !ok || sig.Results().Len() != 1 {
|
|
return nil
|
|
}
|
|
return sig.Results().At(0).Type()
|
|
}
|
|
|
|
type mapValueCloneParams struct {
|
|
// Buf is the buffer to write generated code to
|
|
Buf *bytes.Buffer
|
|
// It is the import tracker for managing imports.
|
|
It *codegen.ImportTracker
|
|
// Elem is the type of the map value to clone
|
|
Elem types.Type
|
|
// SrcExpr is the expression for the source value (e.g., "v", "v2", "v3")
|
|
SrcExpr string
|
|
// DstExpr is the expression for the destination (e.g., "dst.Field[k]", "dst.Field[k][k2]")
|
|
DstExpr string
|
|
// BaseIndent is the "base" indentation string for the generated code
|
|
// (i.e. 1 or more tabs). Additional indentation will be added based on
|
|
// the Depth parameter.
|
|
BaseIndent string
|
|
// Depth is the current nesting depth (1 for first level, 2 for second, etc.)
|
|
Depth int
|
|
}
|
|
|
|
// writeMapValueClone generates code to clone a map value recursively.
|
|
// It handles arbitrary nesting of maps, pointers, and interfaces.
|
|
func writeMapValueClone(params mapValueCloneParams) {
|
|
indent := params.BaseIndent + strings.Repeat("\t", params.Depth)
|
|
writef := func(format string, args ...any) {
|
|
fmt.Fprintf(params.Buf, indent+format+"\n", args...)
|
|
}
|
|
|
|
switch elem := params.Elem.Underlying().(type) {
|
|
case *types.Pointer:
|
|
writef("if %s == nil { %s = nil } else {", params.SrcExpr, params.DstExpr)
|
|
if base := elem.Elem().Underlying(); codegen.ContainsPointers(base) {
|
|
if _, isIface := base.(*types.Interface); isIface {
|
|
params.It.Import("", "tailscale.com/types/ptr")
|
|
writef("\t%s = ptr.To((*%s).Clone())", params.DstExpr, params.SrcExpr)
|
|
} else {
|
|
writef("\t%s = %s.Clone()", params.DstExpr, params.SrcExpr)
|
|
}
|
|
} else {
|
|
params.It.Import("", "tailscale.com/types/ptr")
|
|
writef("\t%s = ptr.To(*%s)", params.DstExpr, params.SrcExpr)
|
|
}
|
|
writef("}")
|
|
|
|
case *types.Map:
|
|
// Recursively handle nested maps
|
|
innerElem := elem.Elem()
|
|
if codegen.IsViewType(innerElem) || !codegen.ContainsPointers(innerElem) {
|
|
// Inner map values don't need deep cloning
|
|
params.It.Import("", "maps")
|
|
writef("%s = maps.Clone(%s)", params.DstExpr, params.SrcExpr)
|
|
} else {
|
|
// Inner map values need cloning
|
|
keyType := params.It.QualifiedName(elem.Key())
|
|
valueType := params.It.QualifiedName(innerElem)
|
|
// Generate unique variable names for nested loops based on depth
|
|
keyVar := fmt.Sprintf("k%d", params.Depth+1)
|
|
valVar := fmt.Sprintf("v%d", params.Depth+1)
|
|
|
|
writef("if %s == nil {", params.SrcExpr)
|
|
writef("\t%s = nil", params.DstExpr)
|
|
writef("\tcontinue")
|
|
writef("}")
|
|
writef("%s = map[%s]%s{}", params.DstExpr, keyType, valueType)
|
|
writef("for %s, %s := range %s {", keyVar, valVar, params.SrcExpr)
|
|
|
|
// Recursively generate cloning code for the nested map value
|
|
nestedDstExpr := fmt.Sprintf("%s[%s]", params.DstExpr, keyVar)
|
|
writeMapValueClone(mapValueCloneParams{
|
|
Buf: params.Buf,
|
|
It: params.It,
|
|
Elem: innerElem,
|
|
SrcExpr: valVar,
|
|
DstExpr: nestedDstExpr,
|
|
BaseIndent: params.BaseIndent,
|
|
Depth: params.Depth + 1,
|
|
})
|
|
|
|
writef("}")
|
|
}
|
|
|
|
case *types.Interface:
|
|
if cloneResultType := methodResultType(elem, "Clone"); cloneResultType != nil {
|
|
if _, isPtr := cloneResultType.(*types.Pointer); isPtr {
|
|
writef("%s = *(%s.Clone())", params.DstExpr, params.SrcExpr)
|
|
} else {
|
|
writef("%s = %s.Clone()", params.DstExpr, params.SrcExpr)
|
|
}
|
|
} else {
|
|
writef(`panic("map value (%%v) does not have a Clone method")`, elem)
|
|
}
|
|
|
|
default:
|
|
writef("%s = *(%s.Clone())", params.DstExpr, params.SrcExpr)
|
|
}
|
|
}
|