mirror of
https://github.com/MetaCubeX/mihomo.git
synced 2026-10-11 17:58:13 +08:00
172 lines
4.6 KiB
Go
172 lines
4.6 KiB
Go
package trie_test
|
|
|
|
import (
|
|
"net/netip"
|
|
"testing"
|
|
|
|
"github.com/metacubex/mihomo/component/trie"
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
var localIP = netip.AddrFrom4([4]byte{127, 0, 0, 1})
|
|
|
|
func TestTrie_Basic(t *testing.T) {
|
|
tree := trie.New[netip.Addr]()
|
|
domains := []string{
|
|
"example.com",
|
|
"google.com",
|
|
"localhost",
|
|
}
|
|
|
|
for _, domain := range domains {
|
|
assert.NoError(t, tree.Insert(domain, localIP))
|
|
}
|
|
|
|
node := tree.Search("example.com")
|
|
assert.NotNil(t, node)
|
|
assert.True(t, node.Data() == localIP)
|
|
assert.NotNil(t, tree.Insert("", localIP))
|
|
assert.Nil(t, tree.Search(""))
|
|
assert.NotNil(t, tree.Search("localhost"))
|
|
assert.Nil(t, tree.Search("www.google.com"))
|
|
}
|
|
|
|
func TestTrie_Wildcard(t *testing.T) {
|
|
tree := trie.New[netip.Addr]()
|
|
domains := []string{
|
|
"*.example.com",
|
|
"sub.*.example.com",
|
|
"*.dev",
|
|
".org",
|
|
".example.net",
|
|
".apple.*",
|
|
"+.foo.com",
|
|
"+.stun.*.*",
|
|
"+.stun.*.*.*",
|
|
"+.stun.*.*.*.*",
|
|
"stun.l.google.com",
|
|
}
|
|
|
|
for _, domain := range domains {
|
|
assert.NoError(t, tree.Insert(domain, localIP))
|
|
}
|
|
|
|
assert.NotNil(t, tree.Search("sub.example.com"))
|
|
assert.NotNil(t, tree.Search("sub.foo.example.com"))
|
|
assert.NotNil(t, tree.Search("test.org"))
|
|
assert.NotNil(t, tree.Search("test.example.net"))
|
|
assert.NotNil(t, tree.Search("test.apple.com"))
|
|
assert.NotNil(t, tree.Search("test.foo.com"))
|
|
assert.NotNil(t, tree.Search("foo.com"))
|
|
assert.NotNil(t, tree.Search("global.stun.website.com"))
|
|
assert.Nil(t, tree.Search("foo.sub.example.com"))
|
|
assert.Nil(t, tree.Search("foo.example.dev"))
|
|
assert.Nil(t, tree.Search("example.com"))
|
|
}
|
|
|
|
func TestTrie_Priority(t *testing.T) {
|
|
tree := trie.New[int]()
|
|
domains := []string{
|
|
".dev",
|
|
"example.dev",
|
|
"*.example.dev",
|
|
"test.example.dev",
|
|
}
|
|
|
|
assertFn := func(domain string, data int) {
|
|
node := tree.Search(domain)
|
|
assert.NotNil(t, node)
|
|
assert.Equal(t, data, node.Data())
|
|
}
|
|
|
|
for idx, domain := range domains {
|
|
assert.NoError(t, tree.Insert(domain, idx+1))
|
|
}
|
|
|
|
assertFn("test.dev", 1)
|
|
assertFn("foo.bar.dev", 1)
|
|
assertFn("example.dev", 2)
|
|
assertFn("foo.example.dev", 3)
|
|
assertFn("test.example.dev", 4)
|
|
}
|
|
|
|
func TestTrie_Boundary(t *testing.T) {
|
|
tree := trie.New[netip.Addr]()
|
|
assert.NoError(t, tree.Insert("*.dev", localIP))
|
|
|
|
assert.NotNil(t, tree.Insert(".", localIP))
|
|
assert.NotNil(t, tree.Insert("..dev", localIP))
|
|
assert.Nil(t, tree.Search("dev"))
|
|
}
|
|
|
|
func TestTrie_WildcardBoundary(t *testing.T) {
|
|
tree := trie.New[netip.Addr]()
|
|
assert.NoError(t, tree.Insert("+.*", localIP))
|
|
assert.NoError(t, tree.Insert("stun.*.*.*", localIP))
|
|
|
|
assert.NotNil(t, tree.Search("example.com"))
|
|
}
|
|
|
|
func TestTrie_InvalidWildcardPlacement(t *testing.T) {
|
|
// "+" is only valid as a whole first segment ("+.example.com"); "*" is only
|
|
// valid as a whole segment. Anything else must be rejected so that
|
|
// DomainTrie.Search (treats a stray wildcard as a literal label) and
|
|
// DomainSet.Has (treats the wildcard byte as a wildcard) can never disagree.
|
|
valid := []string{"+.example.com", "*.example.com", "+.*", "stun.*.*.*", "*", "a.*", "*.a"}
|
|
for _, d := range valid {
|
|
tree := trie.New[netip.Addr]()
|
|
assert.NoErrorf(t, tree.Insert(d, localIP), "should accept %q", d)
|
|
}
|
|
|
|
invalid := []string{"stun.+", "a.+.b", "a.+", "+", "+.+.com", "a*b.com", "*a.com", "a*.com"}
|
|
for _, d := range invalid {
|
|
tree := trie.New[netip.Addr]()
|
|
assert.ErrorIsf(t, tree.Insert(d, localIP), trie.ErrInvalidDomain, "should reject %q", d)
|
|
}
|
|
|
|
// Accepted patterns must stay consistent between Search and DomainSet.Has.
|
|
queries := []string{"example.com", "a.example.com", "com", "x.com", "za.com", "anything.at.all"}
|
|
for _, d := range valid {
|
|
tree := trie.New[netip.Addr]()
|
|
assert.NoError(t, tree.Insert(d, localIP))
|
|
set := tree.NewDomainSet()
|
|
for _, q := range queries {
|
|
searchHit := tree.Search(q) != nil
|
|
setHit := set != nil && set.Has(q)
|
|
assert.Equalf(t, searchHit, setHit, "pattern %q query %q: Search=%v Has=%v", d, q, searchHit, setHit)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestTrie_Foreach(t *testing.T) {
|
|
tree := trie.New[netip.Addr]()
|
|
domainList := []string{
|
|
"google.com",
|
|
"stun.*.*.*",
|
|
"test.*.google.com",
|
|
"+.baidu.com",
|
|
"*.baidu.com",
|
|
"*.*.baidu.com",
|
|
}
|
|
for _, domain := range domainList {
|
|
assert.NoError(t, tree.Insert(domain, localIP))
|
|
}
|
|
count := 0
|
|
tree.Foreach(func(domain string, data netip.Addr) bool {
|
|
count++
|
|
return true
|
|
})
|
|
assert.Equal(t, 7, count)
|
|
}
|
|
|
|
func TestTrie_Space(t *testing.T) {
|
|
validDomain := func(domain string) bool {
|
|
_, ok := trie.ValidAndSplitDomain(domain)
|
|
return ok
|
|
}
|
|
assert.True(t, validDomain("google.com"))
|
|
assert.False(t, validDomain(" google.com"))
|
|
assert.False(t, validDomain(" google.com "))
|
|
assert.True(t, validDomain("Mijia Cloud"))
|
|
}
|