mirror of
https://github.com/tailscale/tailscale.git
synced 2026-02-11 02:31:20 +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>
142 lines
3.2 KiB
Go
142 lines
3.2 KiB
Go
// Copyright (c) Tailscale Inc & contributors
|
|
// SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
package expvarx
|
|
|
|
import (
|
|
"expvar"
|
|
"fmt"
|
|
"sync"
|
|
"sync/atomic"
|
|
"testing"
|
|
"testing/synctest"
|
|
"time"
|
|
)
|
|
|
|
func ExampleNewSafeFunc() {
|
|
// An artificial blocker to emulate a slow operation.
|
|
blocker := make(chan struct{})
|
|
|
|
// limit is the amount of time a call can take before Value returns nil. No
|
|
// new calls to the unsafe func will be started until the slow call
|
|
// completes, at which point onSlow will be called.
|
|
limit := time.Millisecond
|
|
|
|
// onSlow is called with the final call duration and the final value in the
|
|
// event a slow call.
|
|
onSlow := func(d time.Duration, v any) {
|
|
_ = d // d contains the time the call took
|
|
_ = v // v contains the final value computed by the slow call
|
|
fmt.Println("slow call!")
|
|
}
|
|
|
|
// An unsafe expvar.Func that blocks on the blocker channel.
|
|
unsafeFunc := expvar.Func(func() any {
|
|
for range blocker {
|
|
}
|
|
return "hello world"
|
|
})
|
|
|
|
// f implements the same interface as expvar.Func, but returns nil values
|
|
// when the unsafe func is too slow.
|
|
f := NewSafeFunc(unsafeFunc, limit, onSlow)
|
|
|
|
fmt.Println(f.Value())
|
|
fmt.Println(f.Value())
|
|
close(blocker)
|
|
time.Sleep(time.Millisecond)
|
|
fmt.Println(f.Value())
|
|
// Output: <nil>
|
|
// <nil>
|
|
// slow call!
|
|
// hello world
|
|
}
|
|
|
|
func TestSafeFuncHappyPath(t *testing.T) {
|
|
synctest.Test(t, func(t *testing.T) {
|
|
var count int
|
|
f := NewSafeFunc(expvar.Func(func() any {
|
|
count++
|
|
return count
|
|
}), time.Second, nil)
|
|
|
|
if got, want := f.Value(), 1; got != want {
|
|
t.Errorf("got %v, want %v", got, want)
|
|
}
|
|
time.Sleep(5 * time.Second) // (fake time in synctest)
|
|
if got, want := f.Value(), 2; got != want {
|
|
t.Errorf("got %v, want %v", got, want)
|
|
}
|
|
})
|
|
}
|
|
|
|
func TestSafeFuncSlow(t *testing.T) {
|
|
var count int
|
|
blocker := make(chan struct{})
|
|
var wg sync.WaitGroup
|
|
wg.Add(1)
|
|
f := NewSafeFunc(expvar.Func(func() any {
|
|
defer wg.Done()
|
|
count++
|
|
<-blocker
|
|
return count
|
|
}), time.Millisecond, nil)
|
|
|
|
if got := f.Value(); got != nil {
|
|
t.Errorf("got %v; want nil", got)
|
|
}
|
|
if got := f.Value(); got != nil {
|
|
t.Errorf("got %v; want nil", got)
|
|
}
|
|
|
|
close(blocker)
|
|
wg.Wait()
|
|
|
|
if count != 1 {
|
|
t.Errorf("got count=%d; want 1", count)
|
|
}
|
|
}
|
|
|
|
func TestSafeFuncSlowOnSlow(t *testing.T) {
|
|
var count int
|
|
blocker := make(chan struct{})
|
|
var wg sync.WaitGroup
|
|
wg.Add(2)
|
|
var slowDuration atomic.Pointer[time.Duration]
|
|
var slowCallCount atomic.Int32
|
|
var slowValue atomic.Value
|
|
f := NewSafeFunc(expvar.Func(func() any {
|
|
defer wg.Done()
|
|
count++
|
|
<-blocker
|
|
return count
|
|
}), time.Millisecond, func(d time.Duration, v any) {
|
|
defer wg.Done()
|
|
slowDuration.Store(&d)
|
|
slowCallCount.Add(1)
|
|
slowValue.Store(v)
|
|
})
|
|
|
|
for range 10 {
|
|
if got := f.Value(); got != nil {
|
|
t.Fatalf("got value=%v; want nil", got)
|
|
}
|
|
}
|
|
|
|
close(blocker)
|
|
wg.Wait()
|
|
|
|
if count != 1 {
|
|
t.Errorf("got count=%d; want 1", count)
|
|
}
|
|
if got, want := *slowDuration.Load(), 1*time.Millisecond; got < want {
|
|
t.Errorf("got slowDuration=%v; want at least %d", got, want)
|
|
}
|
|
if got, want := slowCallCount.Load(), int32(1); got != want {
|
|
t.Errorf("got slowCallCount=%d; want %d", got, want)
|
|
}
|
|
if got, want := slowValue.Load().(int), 1; got != want {
|
|
t.Errorf("got slowValue=%d, want %d", got, want)
|
|
}
|
|
}
|