2020-06-30 02:36:45 +00:00
|
|
|
// Copyright (c) 2020 Tailscale Inc & AUTHORS All rights reserved.
|
|
|
|
// Use of this source code is governed by a BSD-style
|
|
|
|
// license that can be found in the LICENSE file.
|
|
|
|
|
2021-05-11 19:09:25 +00:00
|
|
|
package deephash
|
2020-06-28 17:58:21 +00:00
|
|
|
|
|
|
|
import (
|
2021-05-11 20:17:12 +00:00
|
|
|
"bufio"
|
|
|
|
"bytes"
|
|
|
|
"fmt"
|
|
|
|
"reflect"
|
2020-06-28 17:58:21 +00:00
|
|
|
"testing"
|
|
|
|
|
|
|
|
"inet.af/netaddr"
|
2021-05-11 16:45:12 +00:00
|
|
|
"tailscale.com/tailcfg"
|
2021-07-07 18:58:02 +00:00
|
|
|
"tailscale.com/types/ipproto"
|
2021-05-11 16:45:12 +00:00
|
|
|
"tailscale.com/util/dnsname"
|
2021-07-07 18:40:28 +00:00
|
|
|
"tailscale.com/version"
|
2021-07-07 18:58:02 +00:00
|
|
|
"tailscale.com/wgengine/filter"
|
2021-03-26 00:41:51 +00:00
|
|
|
"tailscale.com/wgengine/router"
|
2021-01-29 20:16:36 +00:00
|
|
|
"tailscale.com/wgengine/wgcfg"
|
2020-06-28 17:58:21 +00:00
|
|
|
)
|
|
|
|
|
2021-05-18 20:16:37 +00:00
|
|
|
func TestDeepHash(t *testing.T) {
|
2020-06-28 17:58:21 +00:00
|
|
|
// v contains the types of values we care about for our current callers.
|
|
|
|
// Mostly we're just testing that we don't panic on handled types.
|
|
|
|
v := getVal()
|
|
|
|
|
2021-07-05 04:25:15 +00:00
|
|
|
hash1 := Hash(v)
|
2020-06-28 17:58:21 +00:00
|
|
|
t.Logf("hash: %v", hash1)
|
|
|
|
for i := 0; i < 20; i++ {
|
2021-07-05 04:25:15 +00:00
|
|
|
hash2 := Hash(getVal())
|
2020-06-28 17:58:21 +00:00
|
|
|
if hash1 != hash2 {
|
|
|
|
t.Error("second hash didn't match")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func getVal() []interface{} {
|
|
|
|
return []interface{}{
|
|
|
|
&wgcfg.Config{
|
2021-04-03 01:04:39 +00:00
|
|
|
Name: "foo",
|
2021-05-15 01:07:28 +00:00
|
|
|
Addresses: []netaddr.IPPrefix{netaddr.IPPrefixFrom(netaddr.IPFrom16([16]byte{3: 3}), 5)},
|
2020-06-28 17:58:21 +00:00
|
|
|
Peers: []wgcfg.Peer{
|
|
|
|
{
|
2021-04-30 23:45:36 +00:00
|
|
|
Endpoints: wgcfg.Endpoints{
|
|
|
|
IPPorts: wgcfg.NewIPPortSet(netaddr.MustParseIPPort("42.42.42.42:5")),
|
|
|
|
},
|
2020-06-28 17:58:21 +00:00
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
&router.Config{
|
2021-04-03 02:24:02 +00:00
|
|
|
Routes: []netaddr.IPPrefix{
|
|
|
|
netaddr.MustParseIPPrefix("1.2.3.0/24"),
|
|
|
|
netaddr.MustParseIPPrefix("1234::/64"),
|
2020-07-14 13:12:00 +00:00
|
|
|
},
|
2020-06-28 17:58:21 +00:00
|
|
|
},
|
2021-05-11 16:45:12 +00:00
|
|
|
map[dnsname.FQDN][]netaddr.IP{
|
|
|
|
dnsname.FQDN("a."): {netaddr.MustParseIP("1.2.3.4"), netaddr.MustParseIP("4.3.2.1")},
|
|
|
|
dnsname.FQDN("b."): {netaddr.MustParseIP("8.8.8.8"), netaddr.MustParseIP("9.9.9.9")},
|
2021-05-18 15:51:46 +00:00
|
|
|
dnsname.FQDN("c."): {netaddr.MustParseIP("6.6.6.6"), netaddr.MustParseIP("7.7.7.7")},
|
|
|
|
dnsname.FQDN("d."): {netaddr.MustParseIP("6.7.6.6"), netaddr.MustParseIP("7.7.7.8")},
|
|
|
|
dnsname.FQDN("e."): {netaddr.MustParseIP("6.8.6.6"), netaddr.MustParseIP("7.7.7.9")},
|
|
|
|
dnsname.FQDN("f."): {netaddr.MustParseIP("6.9.6.6"), netaddr.MustParseIP("7.7.7.0")},
|
2021-05-11 16:45:12 +00:00
|
|
|
},
|
|
|
|
map[dnsname.FQDN][]netaddr.IPPort{
|
|
|
|
dnsname.FQDN("a."): {netaddr.MustParseIPPort("1.2.3.4:11"), netaddr.MustParseIPPort("4.3.2.1:22")},
|
|
|
|
dnsname.FQDN("b."): {netaddr.MustParseIPPort("8.8.8.8:11"), netaddr.MustParseIPPort("9.9.9.9:22")},
|
2021-05-18 15:51:46 +00:00
|
|
|
dnsname.FQDN("c."): {netaddr.MustParseIPPort("8.8.8.8:12"), netaddr.MustParseIPPort("9.9.9.9:23")},
|
|
|
|
dnsname.FQDN("d."): {netaddr.MustParseIPPort("8.8.8.8:13"), netaddr.MustParseIPPort("9.9.9.9:24")},
|
|
|
|
dnsname.FQDN("e."): {netaddr.MustParseIPPort("8.8.8.8:14"), netaddr.MustParseIPPort("9.9.9.9:25")},
|
2021-05-11 16:45:12 +00:00
|
|
|
},
|
|
|
|
map[tailcfg.DiscoKey]bool{
|
|
|
|
{1: 1}: true,
|
|
|
|
{1: 2}: false,
|
2021-05-18 15:51:46 +00:00
|
|
|
{2: 3}: true,
|
|
|
|
{3: 4}: false,
|
2020-06-28 17:58:21 +00:00
|
|
|
},
|
2021-07-06 04:21:52 +00:00
|
|
|
&tailcfg.MapResponse{
|
|
|
|
DERPMap: &tailcfg.DERPMap{
|
|
|
|
Regions: map[int]*tailcfg.DERPRegion{
|
|
|
|
1: &tailcfg.DERPRegion{
|
|
|
|
RegionID: 1,
|
|
|
|
RegionCode: "foo",
|
|
|
|
Nodes: []*tailcfg.DERPNode{
|
|
|
|
{
|
|
|
|
Name: "n1",
|
|
|
|
RegionID: 1,
|
|
|
|
HostName: "foo.com",
|
|
|
|
},
|
|
|
|
{
|
|
|
|
Name: "n2",
|
|
|
|
RegionID: 1,
|
|
|
|
HostName: "bar.com",
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
DNSConfig: &tailcfg.DNSConfig{
|
|
|
|
Resolvers: []tailcfg.DNSResolver{
|
|
|
|
{Addr: "10.0.0.1"},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
PacketFilter: []tailcfg.FilterRule{
|
|
|
|
{
|
|
|
|
SrcIPs: []string{"1.2.3.4"},
|
|
|
|
DstPorts: []tailcfg.NetPortRange{
|
|
|
|
{
|
|
|
|
IP: "1.2.3.4/32",
|
2021-07-06 04:31:30 +00:00
|
|
|
Ports: tailcfg.PortRange{First: 1, Last: 2},
|
2021-07-06 04:21:52 +00:00
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
Peers: []*tailcfg.Node{
|
|
|
|
{
|
|
|
|
ID: 1,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
ID: 2,
|
|
|
|
},
|
|
|
|
},
|
|
|
|
UserProfiles: []tailcfg.UserProfile{
|
|
|
|
{ID: 1, LoginName: "foo@bar.com"},
|
|
|
|
{ID: 2, LoginName: "bar@foo.com"},
|
|
|
|
},
|
|
|
|
},
|
2021-07-07 18:58:02 +00:00
|
|
|
filter.Match{
|
|
|
|
IPProto: []ipproto.Proto{1, 2, 3},
|
|
|
|
},
|
2020-06-28 17:58:21 +00:00
|
|
|
}
|
|
|
|
}
|
2021-05-08 01:05:04 +00:00
|
|
|
|
2021-07-05 04:25:15 +00:00
|
|
|
var sink = Hash("foo")
|
|
|
|
|
2021-05-08 01:05:04 +00:00
|
|
|
func BenchmarkHash(b *testing.B) {
|
|
|
|
b.ReportAllocs()
|
|
|
|
v := getVal()
|
|
|
|
for i := 0; i < b.N; i++ {
|
2021-07-05 04:25:15 +00:00
|
|
|
sink = Hash(v)
|
2021-05-08 01:05:04 +00:00
|
|
|
}
|
|
|
|
}
|
2021-05-11 20:17:12 +00:00
|
|
|
|
|
|
|
func TestHashMapAcyclic(t *testing.T) {
|
|
|
|
m := map[int]string{}
|
|
|
|
for i := 0; i < 100; i++ {
|
|
|
|
m[i] = fmt.Sprint(i)
|
|
|
|
}
|
|
|
|
got := map[string]bool{}
|
|
|
|
|
|
|
|
var buf bytes.Buffer
|
|
|
|
bw := bufio.NewWriter(&buf)
|
|
|
|
|
|
|
|
for i := 0; i < 20; i++ {
|
|
|
|
v := reflect.ValueOf(m)
|
|
|
|
buf.Reset()
|
|
|
|
bw.Reset(&buf)
|
2021-07-07 05:37:32 +00:00
|
|
|
h := &hasher{
|
|
|
|
bw: bw,
|
|
|
|
visited: map[uintptr]bool{},
|
|
|
|
}
|
|
|
|
if !h.hashMapAcyclic(v) {
|
2021-05-11 20:17:12 +00:00
|
|
|
t.Fatal("returned false")
|
|
|
|
}
|
|
|
|
if got[string(buf.Bytes())] {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
got[string(buf.Bytes())] = true
|
|
|
|
}
|
|
|
|
if len(got) != 1 {
|
|
|
|
t.Errorf("got %d results; want 1", len(got))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-07-06 05:13:33 +00:00
|
|
|
func TestPrintArray(t *testing.T) {
|
|
|
|
type T struct {
|
|
|
|
X [32]byte
|
|
|
|
}
|
|
|
|
x := &T{X: [32]byte{1: 1, 31: 31}}
|
|
|
|
var got bytes.Buffer
|
|
|
|
bw := bufio.NewWriter(&got)
|
|
|
|
h := &hasher{
|
|
|
|
bw: bw,
|
|
|
|
visited: map[uintptr]bool{},
|
|
|
|
}
|
|
|
|
h.print(reflect.ValueOf(x))
|
|
|
|
bw.Flush()
|
|
|
|
const want = "struct" +
|
|
|
|
"\x00\x00\x00\x00\x00\x00\x00\x01" + // 1 field
|
|
|
|
"\x00\x00\x00\x00\x00\x00\x00\x00" + // 0th field
|
|
|
|
// the 32 bytes:
|
|
|
|
"\x00\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f"
|
|
|
|
if got := got.Bytes(); string(got) != want {
|
|
|
|
t.Errorf("wrong:\n got: %q\nwant: %q\n", got, want)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-05-11 20:17:12 +00:00
|
|
|
func BenchmarkHashMapAcyclic(b *testing.B) {
|
|
|
|
b.ReportAllocs()
|
|
|
|
m := map[int]string{}
|
|
|
|
for i := 0; i < 100; i++ {
|
|
|
|
m[i] = fmt.Sprint(i)
|
|
|
|
}
|
|
|
|
|
|
|
|
var buf bytes.Buffer
|
|
|
|
bw := bufio.NewWriter(&buf)
|
|
|
|
v := reflect.ValueOf(m)
|
|
|
|
|
2021-07-07 05:37:32 +00:00
|
|
|
h := &hasher{
|
|
|
|
bw: bw,
|
|
|
|
visited: map[uintptr]bool{},
|
|
|
|
}
|
|
|
|
|
2021-05-11 20:17:12 +00:00
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
buf.Reset()
|
|
|
|
bw.Reset(&buf)
|
2021-07-07 05:37:32 +00:00
|
|
|
if !h.hashMapAcyclic(v) {
|
2021-05-11 20:17:12 +00:00
|
|
|
b.Fatal("returned false")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2021-07-02 20:45:23 +00:00
|
|
|
|
2021-07-06 04:21:52 +00:00
|
|
|
func BenchmarkTailcfgNode(b *testing.B) {
|
|
|
|
b.ReportAllocs()
|
|
|
|
|
|
|
|
node := new(tailcfg.Node)
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
sink = Hash(node)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-07-02 20:45:23 +00:00
|
|
|
func TestExhaustive(t *testing.T) {
|
2021-07-20 05:49:51 +00:00
|
|
|
seen := make(map[Sum]bool)
|
2021-07-02 20:45:23 +00:00
|
|
|
for i := 0; i < 100000; i++ {
|
2021-07-05 04:25:15 +00:00
|
|
|
s := Hash(i)
|
2021-07-02 20:45:23 +00:00
|
|
|
if seen[s] {
|
|
|
|
t.Fatalf("hash collision %v", i)
|
|
|
|
}
|
|
|
|
seen[s] = true
|
|
|
|
}
|
|
|
|
}
|
2021-07-05 04:25:15 +00:00
|
|
|
|
2021-07-07 04:41:18 +00:00
|
|
|
// verify this doesn't loop forever, as it used to (Issue 2340)
|
|
|
|
func TestMapCyclicFallback(t *testing.T) {
|
|
|
|
type T struct {
|
|
|
|
M map[string]interface{}
|
|
|
|
}
|
|
|
|
v := &T{
|
|
|
|
M: map[string]interface{}{},
|
|
|
|
}
|
|
|
|
v.M["m"] = v.M
|
|
|
|
Hash(v)
|
|
|
|
}
|
2021-07-06 05:13:33 +00:00
|
|
|
|
|
|
|
func TestArrayAllocs(t *testing.T) {
|
2021-07-07 18:40:28 +00:00
|
|
|
if version.IsRace() {
|
|
|
|
t.Skip("skipping test under race detector")
|
|
|
|
}
|
2021-07-06 05:13:33 +00:00
|
|
|
type T struct {
|
|
|
|
X [32]byte
|
|
|
|
}
|
|
|
|
x := &T{X: [32]byte{1: 1, 2: 2, 3: 3, 4: 4}}
|
|
|
|
n := int(testing.AllocsPerRun(1000, func() {
|
|
|
|
sink = Hash(x)
|
|
|
|
}))
|
|
|
|
if n > 0 {
|
|
|
|
t.Errorf("allocs = %v; want 0", n)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func BenchmarkHashArray(b *testing.B) {
|
|
|
|
b.ReportAllocs()
|
|
|
|
type T struct {
|
|
|
|
X [32]byte
|
|
|
|
}
|
|
|
|
x := &T{X: [32]byte{1: 1, 2: 2, 3: 3, 4: 4}}
|
|
|
|
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
|
|
sink = Hash(x)
|
|
|
|
}
|
|
|
|
}
|