-
Notifications
You must be signed in to change notification settings - Fork 70
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
7893a74
commit a2f9fef
Showing
5 changed files
with
325 additions
and
94 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,67 @@ | ||
| package domain_test | ||
|
|
||
| import ( | ||
| "sort" | ||
| "testing" | ||
|
|
||
| "github.com/sagernet/sing/common/domain" | ||
|
|
||
| "github.com/stretchr/testify/require" | ||
| ) | ||
|
|
||
| func TestAdGuardMatcher(t *testing.T) { | ||
| t.Parallel() | ||
| ruleLines := []string{ | ||
| "||example.org^", | ||
| "|example.com^", | ||
| "example.net^", | ||
| "||example.edu", | ||
| "||example.edu.tw^", | ||
| "|example.gov", | ||
| "example.arpa", | ||
| } | ||
| matcher := domain.NewAdGuardMatcher(ruleLines) | ||
| require.NotNil(t, matcher) | ||
| matchDomain := []string{ | ||
| "example.org", | ||
| "www.example.org", | ||
| "example.com", | ||
| "example.net", | ||
| "isexample.net", | ||
| "www.example.net", | ||
| "example.edu", | ||
| "example.edu.cn", | ||
| "example.edu.tw", | ||
| "www.example.edu", | ||
| "www.example.edu.cn", | ||
| "example.gov", | ||
| "example.gov.cn", | ||
| "example.arpa", | ||
| "www.example.arpa", | ||
| "isexample.arpa", | ||
| "example.arpa.cn", | ||
| "www.example.arpa.cn", | ||
| "isexample.arpa.cn", | ||
| } | ||
| notMatchDomain := []string{ | ||
| "example.org.cn", | ||
| "notexample.org", | ||
| "example.com.cn", | ||
| "www.example.com.cn", | ||
| "example.net.cn", | ||
| "notexample.edu", | ||
| "notexample.edu.cn", | ||
| "www.example.gov", | ||
| "notexample.gov", | ||
| } | ||
| for _, domain := range matchDomain { | ||
| require.True(t, matcher.Match(domain), domain) | ||
| } | ||
| for _, domain := range notMatchDomain { | ||
| require.False(t, matcher.Match(domain), domain) | ||
| } | ||
| dLines := matcher.Dump() | ||
| sort.Strings(ruleLines) | ||
| sort.Strings(dLines) | ||
| require.Equal(t, ruleLines, dLines) | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,172 @@ | ||
| package domain | ||
|
|
||
| import ( | ||
| "bytes" | ||
| "sort" | ||
| "strings" | ||
|
|
||
| "github.com/sagernet/sing/common" | ||
| "github.com/sagernet/sing/common/varbin" | ||
| ) | ||
|
|
||
| const ( | ||
| anyLabel = '*' | ||
| suffixLabel = '\b' | ||
| ) | ||
|
|
||
| type AdGuardMatcher struct { | ||
| set *succinctSet | ||
| } | ||
|
|
||
| func NewAdGuardMatcher(ruleLines []string) *AdGuardMatcher { | ||
| ruleList := make([]string, 0, len(ruleLines)) | ||
| for _, ruleLine := range ruleLines { | ||
| var ( | ||
| isSuffix bool // || | ||
| hasStart bool // | | ||
| hasEnd bool // ^ | ||
| ) | ||
| if strings.HasPrefix(ruleLine, "||") { | ||
| ruleLine = ruleLine[2:] | ||
| isSuffix = true | ||
| } else if strings.HasPrefix(ruleLine, "|") { | ||
| ruleLine = ruleLine[1:] | ||
| hasStart = true | ||
| } | ||
| if strings.HasSuffix(ruleLine, "^") { | ||
| ruleLine = ruleLine[:len(ruleLine)-1] | ||
| hasEnd = true | ||
| } | ||
| if isSuffix { | ||
| ruleLine = string(rootLabel) + ruleLine | ||
| } else if !hasStart { | ||
| ruleLine = string(prefixLabel) + ruleLine | ||
| } | ||
| if !hasEnd { | ||
| if strings.HasSuffix(ruleLine, ".") { | ||
| ruleLine = ruleLine[:len(ruleLine)-1] | ||
| } | ||
| ruleLine += string(suffixLabel) | ||
| } | ||
| ruleList = append(ruleList, reverseDomain(ruleLine)) | ||
| } | ||
| ruleList = common.Uniq(ruleList) | ||
| sort.Strings(ruleList) | ||
| return &AdGuardMatcher{newSuccinctSet(ruleList)} | ||
| } | ||
|
|
||
| func ReadAdGuardMatcher(reader varbin.Reader) (*AdGuardMatcher, error) { | ||
| set, err := readSuccinctSet(reader) | ||
| if err != nil { | ||
| return nil, err | ||
| } | ||
| return &AdGuardMatcher{set}, nil | ||
| } | ||
|
|
||
| func (m *AdGuardMatcher) Write(writer varbin.Writer) error { | ||
| return m.set.Write(writer) | ||
| } | ||
|
|
||
| func (m *AdGuardMatcher) Match(domain string) bool { | ||
| key := reverseDomain(domain) | ||
| if m.has([]byte(key), 0, 0) { | ||
| return true | ||
| } | ||
| for { | ||
| if m.has([]byte(string(suffixLabel)+key), 0, 0) { | ||
| return true | ||
| } | ||
| idx := strings.IndexByte(key, '.') | ||
| if idx == -1 { | ||
| return false | ||
| } | ||
| key = key[idx+1:] | ||
| } | ||
| } | ||
|
|
||
| func (m *AdGuardMatcher) has(key []byte, nodeId, bmIdx int) bool { | ||
| for i := 0; i < len(key); i++ { | ||
| currentChar := key[i] | ||
| for ; ; bmIdx++ { | ||
| if getBit(m.set.labelBitmap, bmIdx) != 0 { | ||
| return false | ||
| } | ||
| nextLabel := m.set.labels[bmIdx-nodeId] | ||
| if nextLabel == prefixLabel { | ||
| return true | ||
| } | ||
| if nextLabel == rootLabel { | ||
| nextNodeId := countZeros(m.set.labelBitmap, m.set.ranks, bmIdx+1) | ||
| hasNext := getBit(m.set.leaves, nextNodeId) != 0 | ||
| if currentChar == '.' && hasNext { | ||
| return true | ||
| } | ||
| } | ||
| if nextLabel == currentChar { | ||
| break | ||
| } | ||
| if nextLabel == anyLabel { | ||
| idx := bytes.IndexRune(key[i:], '.') | ||
| nextNodeId := countZeros(m.set.labelBitmap, m.set.ranks, bmIdx+1) | ||
| if idx == -1 { | ||
| if getBit(m.set.leaves, nextNodeId) != 0 { | ||
| return true | ||
| } | ||
| idx = 0 | ||
| } | ||
| nextBmIdx := selectIthOne(m.set.labelBitmap, m.set.ranks, m.set.selects, nextNodeId-1) + 1 | ||
| if m.has(key[i+idx:], nextNodeId, nextBmIdx) { | ||
| return true | ||
| } | ||
| } | ||
| } | ||
| nodeId = countZeros(m.set.labelBitmap, m.set.ranks, bmIdx+1) | ||
| bmIdx = selectIthOne(m.set.labelBitmap, m.set.ranks, m.set.selects, nodeId-1) + 1 | ||
| } | ||
| if getBit(m.set.leaves, nodeId) != 0 { | ||
| return true | ||
| } | ||
| for ; ; bmIdx++ { | ||
| if getBit(m.set.labelBitmap, bmIdx) != 0 { | ||
| return false | ||
| } | ||
| nextLabel := m.set.labels[bmIdx-nodeId] | ||
| if nextLabel == prefixLabel || nextLabel == rootLabel { | ||
| return true | ||
| } | ||
| } | ||
| } | ||
|
|
||
| func (m *AdGuardMatcher) Dump() (ruleLines []string) { | ||
| for _, key := range m.set.keys() { | ||
| key = reverseDomain(key) | ||
| var ( | ||
| isSuffix bool | ||
| hasStart bool | ||
| hasEnd bool | ||
| ) | ||
| if key[0] == prefixLabel { | ||
| key = key[1:] | ||
| } else if key[0] == rootLabel { | ||
| key = key[1:] | ||
| isSuffix = true | ||
| } else { | ||
| hasStart = true | ||
| } | ||
| if key[len(key)-1] == suffixLabel { | ||
| key = key[:len(key)-1] | ||
| } else { | ||
| hasEnd = true | ||
| } | ||
| if isSuffix { | ||
| key = "||" + key | ||
| } else if hasStart { | ||
| key = "|" + key | ||
| } | ||
| if hasEnd { | ||
| key += "^" | ||
| } | ||
| ruleLines = append(ruleLines, key) | ||
| } | ||
| return | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.