clash/rules/logic/and.go

69 lines
1.3 KiB
Go
Raw Normal View History

package logic
2022-03-17 15:24:07 +00:00
import (
"fmt"
2022-03-17 15:24:07 +00:00
C "github.com/Dreamacro/clash/constant"
2022-06-03 19:25:33 +00:00
"github.com/Dreamacro/clash/rules/common"
"strings"
2022-03-17 15:24:07 +00:00
)
type AND struct {
*common.Base
rules []C.Rule
payload string
adapter string
needIP bool
}
2022-03-15 16:43:08 +00:00
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 {
2022-05-30 05:58:37 +00:00
payloads = append(payloads, fmt.Sprintf("(%s,%s)", rule.RuleType().String(), rule.Payload()))
if rule.ShouldResolveIP() {
and.needIP = true
break
}
}
2022-05-30 05:58:37 +00:00
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
}