mirror of
https://github.com/tailscale/tailscale.git
synced 2026-02-12 17:02:05 -05: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>
384 lines
10 KiB
Go
384 lines
10 KiB
Go
// Copyright (c) Tailscale Inc & contributors
|
|
// SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
package ippool
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/json"
|
|
"fmt"
|
|
"io"
|
|
"net/netip"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/hashicorp/raft"
|
|
"go4.org/netipx"
|
|
"tailscale.com/tailcfg"
|
|
"tailscale.com/tsconsensus"
|
|
"tailscale.com/util/must"
|
|
)
|
|
|
|
func makeSetFromPrefix(pfx netip.Prefix) *netipx.IPSet {
|
|
var ipsb netipx.IPSetBuilder
|
|
ipsb.AddPrefix(pfx)
|
|
return must.Get(ipsb.IPSet())
|
|
}
|
|
|
|
type FakeConsensus struct {
|
|
ipp *ConsensusIPPool
|
|
}
|
|
|
|
func (c *FakeConsensus) ExecuteCommand(cmd tsconsensus.Command) (tsconsensus.CommandResult, error) {
|
|
b, err := json.Marshal(cmd)
|
|
if err != nil {
|
|
return tsconsensus.CommandResult{}, err
|
|
}
|
|
result := c.ipp.Apply(&raft.Log{Data: b})
|
|
return result.(tsconsensus.CommandResult), nil
|
|
}
|
|
|
|
func makePool(pfx netip.Prefix) *ConsensusIPPool {
|
|
ipp := NewConsensusIPPool(makeSetFromPrefix(pfx))
|
|
ipp.consensus = &FakeConsensus{ipp: ipp}
|
|
return ipp
|
|
}
|
|
|
|
func TestConsensusIPForDomain(t *testing.T) {
|
|
pfx := netip.MustParsePrefix("100.64.0.0/16")
|
|
ipp := makePool(pfx)
|
|
from := tailcfg.NodeID(1)
|
|
|
|
a, err := ipp.IPForDomain(from, "example.com")
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !pfx.Contains(a) {
|
|
t.Fatalf("expected %v to be in the prefix %v", a, pfx)
|
|
}
|
|
|
|
b, err := ipp.IPForDomain(from, "a.example.com")
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !pfx.Contains(b) {
|
|
t.Fatalf("expected %v to be in the prefix %v", b, pfx)
|
|
}
|
|
if b == a {
|
|
t.Fatalf("same address issued twice %v, %v", a, b)
|
|
}
|
|
|
|
c, err := ipp.IPForDomain(from, "example.com")
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if c != a {
|
|
t.Fatalf("expected %v to be remembered as the addr for example.com, but got %v", a, c)
|
|
}
|
|
}
|
|
|
|
func TestConsensusPoolExhaustion(t *testing.T) {
|
|
ipp := makePool(netip.MustParsePrefix("100.64.0.0/31"))
|
|
from := tailcfg.NodeID(1)
|
|
|
|
subdomains := []string{"a", "b", "c"}
|
|
for i, sd := range subdomains {
|
|
_, err := ipp.IPForDomain(from, fmt.Sprintf("%s.example.com", sd))
|
|
if i < 2 && err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
expected := "ip pool exhausted"
|
|
if i == 2 && err.Error() != expected {
|
|
t.Fatalf("expected error to be '%s', got '%s'", expected, err.Error())
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestConsensusPoolExpiry(t *testing.T) {
|
|
ipp := makePool(netip.MustParsePrefix("100.64.0.0/31"))
|
|
firstIP := netip.MustParseAddr("100.64.0.0")
|
|
secondIP := netip.MustParseAddr("100.64.0.1")
|
|
timeOfUse := time.Now()
|
|
beforeTimeOfUse := timeOfUse.Add(-1 * time.Hour)
|
|
afterTimeOfUse := timeOfUse.Add(1 * time.Hour)
|
|
from := tailcfg.NodeID(1)
|
|
|
|
// the pool is unused, we get an address, and it's marked as being used at timeOfUse
|
|
aAddr, err := ipp.applyCheckoutAddr(from, "a.example.com", time.Time{}, timeOfUse)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if aAddr.Compare(firstIP) != 0 {
|
|
t.Fatalf("expected %s, got %s", firstIP, aAddr)
|
|
}
|
|
ww, ok := ipp.domainLookup(from, firstIP)
|
|
if !ok {
|
|
t.Fatal("expected wherewhen to be found")
|
|
}
|
|
if ww.Domain != "a.example.com" {
|
|
t.Fatalf("expected aAddr to look up to a.example.com, got: %s", ww.Domain)
|
|
}
|
|
|
|
// the time before which we will reuse addresses is prior to timeOfUse, so no reuse
|
|
bAddr, err := ipp.applyCheckoutAddr(from, "b.example.com", beforeTimeOfUse, timeOfUse)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if bAddr.Compare(secondIP) != 0 {
|
|
t.Fatalf("expected %s, got %s", secondIP, bAddr)
|
|
}
|
|
|
|
// the time before which we will reuse addresses is after timeOfUse, so reuse addresses that were marked as used at timeOfUse.
|
|
cAddr, err := ipp.applyCheckoutAddr(from, "c.example.com", afterTimeOfUse, timeOfUse)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if cAddr.Compare(firstIP) != 0 {
|
|
t.Fatalf("expected %s, got %s", firstIP, cAddr)
|
|
}
|
|
ww, ok = ipp.domainLookup(from, firstIP)
|
|
if !ok {
|
|
t.Fatal("expected wherewhen to be found")
|
|
}
|
|
if ww.Domain != "c.example.com" {
|
|
t.Fatalf("expected firstIP to look up to c.example.com, got: %s", ww.Domain)
|
|
}
|
|
|
|
// the addr remains associated with c.example.com
|
|
cAddrAgain, err := ipp.applyCheckoutAddr(from, "c.example.com", afterTimeOfUse, timeOfUse)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if cAddrAgain.Compare(cAddr) != 0 {
|
|
t.Fatalf("expected cAddrAgain to be cAddr, but they are different. cAddrAgain=%s cAddr=%s", cAddrAgain, cAddr)
|
|
}
|
|
ww, ok = ipp.domainLookup(from, firstIP)
|
|
if !ok {
|
|
t.Fatal("expected wherewhen to be found")
|
|
}
|
|
if ww.Domain != "c.example.com" {
|
|
t.Fatalf("expected firstIP to look up to c.example.com, got: %s", ww.Domain)
|
|
}
|
|
}
|
|
|
|
func TestConsensusPoolApplyMarkLastUsed(t *testing.T) {
|
|
ipp := makePool(netip.MustParsePrefix("100.64.0.0/31"))
|
|
firstIP := netip.MustParseAddr("100.64.0.0")
|
|
time1 := time.Now()
|
|
time2 := time1.Add(1 * time.Hour)
|
|
from := tailcfg.NodeID(1)
|
|
domain := "example.com"
|
|
|
|
aAddr, err := ipp.applyCheckoutAddr(from, domain, time.Time{}, time1)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if aAddr.Compare(firstIP) != 0 {
|
|
t.Fatalf("expected %s, got %s", firstIP, aAddr)
|
|
}
|
|
// example.com LastUsed is now time1
|
|
ww, ok := ipp.domainLookup(from, firstIP)
|
|
if !ok {
|
|
t.Fatal("expected wherewhen to be found")
|
|
}
|
|
if ww.LastUsed != time1 {
|
|
t.Fatalf("expected %s, got %s", time1, ww.LastUsed)
|
|
}
|
|
if ww.Domain != domain {
|
|
t.Fatalf("expected %s, got %s", domain, ww.Domain)
|
|
}
|
|
|
|
err = ipp.applyMarkLastUsed(from, firstIP, domain, time2)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
// example.com LastUsed is now time2
|
|
ww, ok = ipp.domainLookup(from, firstIP)
|
|
if !ok {
|
|
t.Fatal("expected wherewhen to be found")
|
|
}
|
|
if ww.LastUsed != time2 {
|
|
t.Fatalf("expected %s, got %s", time2, ww.LastUsed)
|
|
}
|
|
if ww.Domain != domain {
|
|
t.Fatalf("expected %s, got %s", domain, ww.Domain)
|
|
}
|
|
}
|
|
|
|
func TestConsensusDomainForIP(t *testing.T) {
|
|
ipp := makePool(netip.MustParsePrefix("100.64.0.0/16"))
|
|
from := tailcfg.NodeID(1)
|
|
domain := "example.com"
|
|
now := time.Now()
|
|
|
|
d, ok := ipp.DomainForIP(from, netip.MustParseAddr("100.64.0.1"), now)
|
|
if d != "" {
|
|
t.Fatalf("expected an empty string if the addr is not found but got %s", d)
|
|
}
|
|
if ok {
|
|
t.Fatalf("expected domain to not be found for IP, as it has never been looked up")
|
|
}
|
|
a, err := ipp.IPForDomain(from, domain)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
d2, ok := ipp.DomainForIP(from, a, now)
|
|
if d2 != domain {
|
|
t.Fatalf("expected %s but got %s", domain, d2)
|
|
}
|
|
if !ok {
|
|
t.Fatalf("expected domain to be found for IP that was handed out for it")
|
|
}
|
|
}
|
|
|
|
func TestConsensusReadDomainForIP(t *testing.T) {
|
|
ipp := makePool(netip.MustParsePrefix("100.64.0.0/16"))
|
|
from := tailcfg.NodeID(1)
|
|
domain := "example.com"
|
|
|
|
d, err := ipp.readDomainForIP(from, netip.MustParseAddr("100.64.0.1"))
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if d != "" {
|
|
t.Fatalf("expected an empty string if the addr is not found but got %s", d)
|
|
}
|
|
a, err := ipp.IPForDomain(from, domain)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
d2, err := ipp.readDomainForIP(from, a)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if d2 != domain {
|
|
t.Fatalf("expected %s but got %s", domain, d2)
|
|
}
|
|
}
|
|
|
|
func TestConsensusSnapshot(t *testing.T) {
|
|
pfx := netip.MustParsePrefix("100.64.0.0/16")
|
|
ipp := makePool(pfx)
|
|
domain := "example.com"
|
|
expectedAddr := netip.MustParseAddr("100.64.0.0")
|
|
expectedFrom := expectedAddr
|
|
expectedTo := netip.MustParseAddr("100.64.255.255")
|
|
from := tailcfg.NodeID(1)
|
|
|
|
// pool allocates first addr for from
|
|
if _, err := ipp.IPForDomain(from, domain); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// take a snapshot
|
|
fsmSnap, err := ipp.Snapshot()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
snap := fsmSnap.(fsmSnapshot)
|
|
|
|
// verify snapshot state matches the state we know ipp will have
|
|
// ipset matches ipp.IPSet
|
|
if len(snap.IPSet.Ranges) != 1 {
|
|
t.Fatalf("expected 1, got %d", len(snap.IPSet.Ranges))
|
|
}
|
|
if snap.IPSet.Ranges[0].From != expectedFrom {
|
|
t.Fatalf("want %s, got %s", expectedFrom, snap.IPSet.Ranges[0].From)
|
|
}
|
|
if snap.IPSet.Ranges[0].To != expectedTo {
|
|
t.Fatalf("want %s, got %s", expectedTo, snap.IPSet.Ranges[0].To)
|
|
}
|
|
|
|
// perPeerMap has one entry, for from
|
|
if len(snap.PerPeerMap) != 1 {
|
|
t.Fatalf("expected 1, got %d", len(snap.PerPeerMap))
|
|
}
|
|
ps := snap.PerPeerMap[from]
|
|
|
|
// the one peer state has allocated one address, the first in the prefix
|
|
if len(ps.DomainToAddr) != 1 {
|
|
t.Fatalf("expected 1, got %d", len(ps.DomainToAddr))
|
|
}
|
|
addr := ps.DomainToAddr[domain]
|
|
if addr != expectedAddr {
|
|
t.Fatalf("want %s, got %s", expectedAddr.String(), addr.String())
|
|
}
|
|
if len(ps.AddrToDomain) != 1 {
|
|
t.Fatalf("expected 1, got %d", len(ps.AddrToDomain))
|
|
}
|
|
ww := ps.AddrToDomain[addr]
|
|
if ww.Domain != domain {
|
|
t.Fatalf("want %s, got %s", domain, ww.Domain)
|
|
}
|
|
}
|
|
|
|
func TestConsensusRestore(t *testing.T) {
|
|
pfx := netip.MustParsePrefix("100.64.0.0/16")
|
|
ipp := makePool(pfx)
|
|
domain := "example.com"
|
|
expectedAddr := netip.MustParseAddr("100.64.0.0")
|
|
from := tailcfg.NodeID(1)
|
|
|
|
if _, err := ipp.IPForDomain(from, domain); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// take the snapshot after only 1 addr allocated
|
|
fsmSnap, err := ipp.Snapshot()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
snap := fsmSnap.(fsmSnapshot)
|
|
|
|
if _, err := ipp.IPForDomain(from, "b.example.com"); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if _, err := ipp.IPForDomain(from, "c.example.com"); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if _, err := ipp.IPForDomain(from, "d.example.com"); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// ipp now has 4 entries in domainToAddr
|
|
ps, _ := ipp.perPeerMap.Load(from)
|
|
if len(ps.domainToAddr) != 4 {
|
|
t.Fatalf("want 4, got %d", len(ps.domainToAddr))
|
|
}
|
|
|
|
// restore the snapshot
|
|
bs, err := json.Marshal(snap)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
err = ipp.Restore(io.NopCloser(bytes.NewBuffer(bs)))
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
// everything should be as it was when the snapshot was taken
|
|
if ipp.perPeerMap.Len() != 1 {
|
|
t.Fatalf("want 1, got %d", ipp.perPeerMap.Len())
|
|
}
|
|
psAfter, _ := ipp.perPeerMap.Load(from)
|
|
if len(psAfter.domainToAddr) != 1 {
|
|
t.Fatalf("want 1, got %d", len(psAfter.domainToAddr))
|
|
}
|
|
if psAfter.domainToAddr[domain] != expectedAddr {
|
|
t.Fatalf("want %s, got %s", expectedAddr, psAfter.domainToAddr[domain])
|
|
}
|
|
ww, _ := psAfter.addrToDomain.Load(expectedAddr)
|
|
if ww.Domain != domain {
|
|
t.Fatalf("want %s, got %s", domain, ww.Domain)
|
|
}
|
|
}
|
|
|
|
func TestConsensusIsCloseToExpiry(t *testing.T) {
|
|
a := time.Now()
|
|
b := a.Add(5 * time.Second)
|
|
if !isCloseToExpiry(a, b, 8*time.Second) {
|
|
t.Fatal("times are not within half the lifetime, expected true")
|
|
}
|
|
if isCloseToExpiry(a, b, 12*time.Second) {
|
|
t.Fatal("times are within half the lifetime, expected false")
|
|
}
|
|
}
|