/
patterns.go
146 lines (136 loc) · 4.38 KB
/
patterns.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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
// Copyright 2020 Authors of Hubble
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package filters
import (
"errors"
"fmt"
"regexp"
"strings"
)
var (
// fqdnRegexpStr matches an FQDN, inluding underscores.
// FIXME this should not match components that begin or end with hyphens, e.g. -foo-
fqdnRegexpStr = `(?:[-0-9_a-z]+(?:\.[-0-9_a-z]+)*)`
_ = regexp.MustCompile(fqdnRegexpStr) // compile regexp to ensure that it is valid
errEmptyPattern = errors.New("empty pattern")
errMultipleTrailingDotsInPattern = errors.New("multiple trailing dots in pattern")
errTooManySlashesInPattern = errors.New("too many slashes in pattern")
)
// canonicalizeFQDNPattern canonicalizes fqdnPattern by trimming space, trimming
// up to one trailing dot, and converting it to lowercase.
func canonicalizeFQDNPattern(fqdnPattern string) string {
fqdnPattern = strings.TrimSpace(fqdnPattern)
fqdnPattern = strings.TrimSuffix(fqdnPattern, ".")
fqdnPattern = strings.ToLower(fqdnPattern)
return fqdnPattern
}
// appendFQDNPatternRegexp appends the regular expression equivalent to
// fqdnPattern to sb.
func appendFQDNPatternRegexp(sb *strings.Builder, fqdnPattern string) error {
fqdnPattern = canonicalizeFQDNPattern(fqdnPattern)
switch {
case fqdnPattern == "":
return errEmptyPattern
case strings.HasSuffix(fqdnPattern, "."):
return errMultipleTrailingDotsInPattern
}
for _, r := range fqdnPattern {
switch {
case r == '.':
sb.WriteString(`\.`)
case r == '*':
sb.WriteString(`[-.0-9a-z]*`)
case r == '-':
fallthrough
case '0' <= r && r <= '9':
fallthrough
case r == '_':
fallthrough
case 'a' <= r && r <= 'z':
sb.WriteRune(r)
default:
return fmt.Errorf("%q: invalid rune in pattern", r)
}
}
return nil
}
// appendNodeNamePatternRegexp appends the regular expression equivalent to
// nodeNamePattern to sb. The returned regular expression matches node names
// that include a cluster name.
//
// Node name patterns consist of a cluster pattern element and a node pattern
// element separated by a forward slash. Each element is an FQDN pattern, with
// an empty pattern matching everything. If there is no forward slash then the
// pattern is treated as a node pattern and matches all clusters.
func appendNodeNamePatternRegexp(sb *strings.Builder, nodeNamePattern string) error {
if nodeNamePattern == "" {
return errEmptyPattern
}
clusterPattern := ""
nodePattern := ""
elems := strings.Split(nodeNamePattern, "/")
switch len(elems) {
case 1:
nodePattern = elems[0]
case 2:
clusterPattern = elems[0]
nodePattern = elems[1]
default:
return errTooManySlashesInPattern
}
if clusterPattern == "" {
sb.WriteString(fqdnRegexpStr)
} else if err := appendFQDNPatternRegexp(sb, clusterPattern); err != nil {
return err
}
sb.WriteByte('/')
if nodePattern == "" {
sb.WriteString(fqdnRegexpStr)
} else if err := appendFQDNPatternRegexp(sb, nodePattern); err != nil {
return err
}
return nil
}
// compileFQDNPattern returns a regular expression equivalent to the FQDN
// patterns in fqdnPatterns.
func compileFQDNPattern(fqdnPatterns []string) (*regexp.Regexp, error) {
var sb strings.Builder
sb.WriteString(`\A(?:`)
for i, fqdnPattern := range fqdnPatterns {
if i > 0 {
sb.WriteByte('|')
}
if err := appendFQDNPatternRegexp(&sb, fqdnPattern); err != nil {
return nil, err
}
}
sb.WriteString(`)\z`)
return regexp.Compile(sb.String())
}
// compileNodeNamePattern returns a regular expression equivalent to the node
// name patterns in nodeNamePatterns.
func compileNodeNamePattern(nodeNamePatterns []string) (*regexp.Regexp, error) {
sb := strings.Builder{}
sb.WriteString(`\A(?:`)
for i, nodeNamePattern := range nodeNamePatterns {
if i > 0 {
sb.WriteByte('|')
}
if err := appendNodeNamePatternRegexp(&sb, nodeNamePattern); err != nil {
return nil, err
}
}
sb.WriteString(`)\z`)
return regexp.Compile(sb.String())
}