/
utils.go
132 lines (116 loc) · 3 KB
/
utils.go
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
/*
* Copyright (C) 2020-2022, IrineSistiana
*
* This file is part of mosdns.
*
* mosdns is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* mosdns is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
package executable_seq
import (
"context"
"errors"
"github.com/IrineSistiana/mosdns/v4/pkg/query_context"
"github.com/miekg/dns"
"go.uber.org/zap"
"sync"
"time"
)
func asyncWait(ctx context.Context, qCtx *query_context.Context, logger *zap.Logger, c chan *parallelECSResult, total int) error {
for i := 0; i < total; i++ {
select {
case res := <-c:
if res.err != nil {
logger.Warn("sequence failed", qCtx.InfoField(), zap.Int("sequence", res.from), zap.Error(res.err))
continue
}
if r := res.qCtx.R(); r != nil {
logger.Debug("sequence returned a response", qCtx.InfoField(), zap.Int("sequence", res.from))
qCtx.SetResponse(r)
return nil
}
logger.Debug("sequence returned with an empty response", qCtx.InfoField(), zap.Int("sequence", res.from))
continue
case <-ctx.Done():
return ctx.Err()
}
}
// No response
return errors.New("no response")
}
// LastNode returns the Latest node of chain of n.
func LastNode(n ExecutableChainNode) ExecutableChainNode {
p := n
for {
if nn := p.Next(); nn == nil {
return p
} else {
p = nn
}
}
}
func ExecChainNode(ctx context.Context, qCtx *query_context.Context, n ExecutableChainNode) error {
if n == nil {
return nil
}
// TODO: Error logging
return n.Exec(ctx, qCtx, n.Next())
}
type DummyMatcher struct {
Matched bool
WantErr error
}
func (d *DummyMatcher) Match(_ context.Context, _ *query_context.Context) (matched bool, err error) {
return d.Matched, d.WantErr
}
type DummyExecutable struct {
sync.Mutex
WantSkip bool
WantSleep time.Duration
WantR *dns.Msg
WantErr error
}
func (d *DummyExecutable) Exec(ctx context.Context, qCtx *query_context.Context, next ExecutableChainNode) error {
if d.WantSleep != 0 {
time.Sleep(d.WantSleep)
}
d.Lock()
if d.WantSkip {
d.Unlock()
return nil
}
if err := d.WantErr; err != nil {
d.Unlock()
return err
}
if d.WantR != nil {
qCtx.SetResponse(d.WantR)
}
d.Unlock()
return ExecChainNode(ctx, qCtx, next)
}
func LogicalAndMatcherGroup(ctx context.Context, qCtx *query_context.Context, mg []Matcher) (matched bool, err error) {
if len(mg) == 0 {
return false, nil
}
for _, matcher := range mg {
ok, err := matcher.Match(ctx, qCtx)
if err != nil {
return false, err
}
if !ok {
return false, nil
}
}
return true, nil
}