-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutil.go
More file actions
276 lines (239 loc) · 5.12 KB
/
util.go
File metadata and controls
276 lines (239 loc) · 5.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
package main
import (
"fmt"
"iter"
"math/rand"
"net/netip"
"reflect"
"regexp"
"slices"
"strings"
"sync"
"github.com/monoidic/dns"
)
func chanWorkers[T any](ch chan T, n int, f func()) {
var wg sync.WaitGroup
for range n {
wg.Go(f)
}
go func() {
wg.Wait()
close(ch)
}()
}
type Set[T comparable] map[T]empty
func (s Set[T]) Contains(key T) bool {
_, ret := s[key]
return ret
}
func (s Set[T]) Add(key T) {
s[key] = empty{}
}
func (s Set[T]) Delete(key T) {
delete(s, key)
}
func (s Set[T]) String() string {
var b strings.Builder
check1(b.WriteString(reflect.TypeFor[Set[T]]().Name())) // e.g "Set[string]"
check(b.WriteByte('{'))
var addComma bool
for e := range s {
if addComma {
b.WriteByte(',')
} else {
addComma = true
}
check1(fmt.Fprintf(&b, "%#v", e))
}
b.WriteByte('}')
return b.String()
}
// select random nameserver from config
func randomNS() string {
return usedNs[rand.Intn(usedNsLen)]
}
// given a CNAME chain, returns the final entry, and detect loops
func cnameChainFinalEntry(arr []dns.CNAME) (dns.Name, bool) {
m := make(map[dns.Name]dns.Name, len(arr))
for _, entry := range arr {
m[entry.Hdr.Name.Canonical()] = m[entry.Target.Canonical()]
}
finalFrom := arr[len(arr)-1].Hdr.Name
cnameLoop := true
for range len(arr) {
target, ok := m[finalFrom]
if !ok {
cnameLoop = false
break
}
finalFrom = target
}
return finalFrom, cnameLoop
}
// reverse an ASCII string
func reverseASCII(s string) string {
b := []byte(s)
slices.Reverse(b)
return string(b)
}
const labelChars = "-0123456789_abcdefghijklmnopqrstuvwxyz"
type retryWrap[inType, tmpType any] struct {
// wrapped value
val inType
// in case state should be held inbetween stages
tmp tmpType
// decrement and reinsert if greater than zero,
// otherwise use last returned value
retriesLeft int
// stage of the task
stage int
}
type empty struct{}
func chanToSeq[T any](ch <-chan T) iter.Seq[T] {
return func(yield func(T) bool) {
for e := range ch {
if !yield(e) {
break
}
}
// always exhaust chan
for range ch {
}
}
}
func seqToChan[T any](seq iter.Seq[T], bufsize int) <-chan T {
ch := make(chan T, bufsize)
go func() {
for e := range seq {
ch <- e
}
close(ch)
}()
return ch
}
func bufferedSeq[T any](seq iter.Seq[T], bufsize int) iter.Seq[T] {
ch := make(chan T, bufsize)
var done bool
go func() {
for e := range seq {
if done {
break
}
ch <- e
}
close(ch)
}()
return func(yield func(T) bool) {
defer func() {
done = true
}()
for e := range ch {
if !yield(e) {
return
}
}
}
}
func priorityChanGen[T any]() (inLow, inHigh, out chan T, stop func()) {
inLow = make(chan T, MIDBUFLEN)
inHigh = make(chan T, MIDBUFLEN)
out = make(chan T, MIDBUFLEN)
doneCh := make(chan empty)
stop = func() {
doneCh <- empty{}
}
go func() {
for {
var val T
select {
case <-doneCh:
close(out)
close(inHigh)
close(inLow)
return
default:
select {
case val = <-inHigh:
default:
select {
case val = <-inHigh:
case val = <-inLow:
case <-doneCh:
close(out)
close(inHigh)
close(inLow)
return
}
}
}
out <- val
}
}()
return inLow, inHigh, out, stop
}
var ptrV6Pattern = regexp.MustCompile("....")
// convert full-length PTR name (v4 or v6), e.g 4.3.2.1.in-addr.arpa, to the netip.Addr for the corresponding IP address (1.2.3.4 for the given example)
func ptrToIP(d dns.Name) (netip.Addr, error) {
s := d.String()
if strings.HasSuffix(s, ".ip6.arpa.") {
s = s[:len(s)-len(".ip6.arpa.")]
s = strings.ReplaceAll(s, ".", "")
s = reverseASCII(s)
s = strings.Join(ptrV6Pattern.FindAllString(s, -1), ":")
} else if strings.HasSuffix(s, ".in-addr.arpa.") {
s = s[:len(s)-len(".in-addr.arpa.")]
l := strings.Split(s, ".")
slices.Reverse(l)
s = strings.Join(l, ".")
} else {
return netip.Addr{}, Error{s: fmt.Sprintf("invalid addr: %q", s)}
}
return netip.ParseAddr(s)
}
func filteredNsecs(zone dns.Name, msg *dns.Msg) ([]*dns.NSEC, []*dns.NSEC3) {
var signatures []*dns.RRSIG
var nsecSigs []*dns.NSEC
var nsec3Sigs []*dns.NSEC3
for _, rr := range msg.Ns { // authority section
switch rrT := rr.(type) {
case *dns.RRSIG:
switch rrT.TypeCovered {
case dns.TypeNSEC, dns.TypeNSEC3:
dns.Canonicalize(rrT)
if rrT.SignerName == zone {
signatures = append(signatures, rrT)
}
}
case *dns.NSEC:
dns.Canonicalize(rrT)
nsecSigs = append(nsecSigs, rrT)
case *dns.NSEC3:
dns.Canonicalize(rrT)
nsec3Sigs = append(nsec3Sigs, rrT)
}
}
nsecLoop:
for i, rrT := range nsecSigs {
for _, sig := range signatures {
if sig.Hdr.Name == rrT.Hdr.Name {
continue nsecLoop
}
}
// no match
nsecSigs[i] = nil
}
nsec3Loop:
for i, rrT := range nsec3Sigs {
for _, sig := range signatures {
if sig.Hdr.Name == rrT.Hdr.Name {
continue nsec3Loop
}
}
// no match
nsec3Sigs[i] = nil
}
// remove non-matches
nsecSigs = slices.DeleteFunc(nsecSigs, func(rrT *dns.NSEC) bool { return rrT == nil })
nsec3Sigs = slices.DeleteFunc(nsec3Sigs, func(rrT *dns.NSEC3) bool { return rrT == nil })
return nsecSigs, nsec3Sigs
}