68 lines
1.3 KiB
Go
68 lines
1.3 KiB
Go
package logic
|
|
|
|
import (
|
|
"fmt"
|
|
C "github.com/Dreamacro/clash/constant"
|
|
"github.com/Dreamacro/clash/rules/common"
|
|
"strings"
|
|
)
|
|
|
|
type AND struct {
|
|
*common.Base
|
|
rules []C.Rule
|
|
payload string
|
|
adapter string
|
|
needIP bool
|
|
}
|
|
|
|
func (A *AND) ShouldFindProcess() bool {
|
|
return false
|
|
}
|
|
|
|
func NewAND(payload string, adapter string,
|
|
parse func(tp, payload, target string, params []string, subRules map[string][]C.Rule) (parsed C.Rule, parseErr error)) (*AND, error) {
|
|
and := &AND{Base: &common.Base{}, payload: payload, adapter: adapter}
|
|
rules, err := ParseRuleByPayload(payload, parse)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
and.rules = rules
|
|
payloads := make([]string, 0, len(rules))
|
|
for _, rule := range rules {
|
|
payloads = append(payloads, fmt.Sprintf("(%s,%s)", rule.RuleType().String(), rule.Payload()))
|
|
if rule.ShouldResolveIP() {
|
|
and.needIP = true
|
|
break
|
|
}
|
|
}
|
|
|
|
and.payload = fmt.Sprintf("(%s)", strings.Join(payloads, " && "))
|
|
return and, nil
|
|
}
|
|
|
|
func (A *AND) RuleType() C.RuleType {
|
|
return C.AND
|
|
}
|
|
|
|
func (A *AND) Match(metadata *C.Metadata) (bool, string) {
|
|
for _, rule := range A.rules {
|
|
if m, _ := rule.Match(metadata); !m {
|
|
return false, ""
|
|
}
|
|
}
|
|
|
|
return true, A.adapter
|
|
}
|
|
|
|
func (A *AND) Adapter() string {
|
|
return A.adapter
|
|
}
|
|
|
|
func (A *AND) Payload() string {
|
|
return A.payload
|
|
}
|
|
|
|
func (A *AND) ShouldResolveIP() bool {
|
|
return A.needIP
|
|
}
|