-
Notifications
You must be signed in to change notification settings - Fork 1
/
matcher_regexp.go
100 lines (84 loc) · 2.44 KB
/
matcher_regexp.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
/*
* Copyright © 2016-2018 Aeneas Rekkas <[email protected]>
*
* 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.
*
* @author Aeneas Rekkas <[email protected]>
* @copyright 2015-2018 Aeneas Rekkas <[email protected]>
* @license Apache-2.0
*/
package ladon
import (
"regexp"
"strings"
"github.com/hashicorp/golang-lru"
"github.com/pkg/errors"
"github.com/ory/ladon/compiler"
)
func NewRegexpMatcher(size int) *RegexpMatcher {
if size <= 0 {
size = 512
}
// golang-lru only returns an error if the cache's size is 0. This, we can safely ignore this error.
cache, _ := lru.New(size)
return &RegexpMatcher{
Cache: cache,
}
}
type RegexpMatcher struct {
*lru.Cache
C map[string]*regexp.Regexp
}
func (m *RegexpMatcher) get(pattern string) *regexp.Regexp {
if val, ok := m.Cache.Get(pattern); !ok {
return nil
} else if reg, ok := val.(*regexp.Regexp); !ok {
return nil
} else {
return reg
}
}
func (m *RegexpMatcher) set(pattern string, reg *regexp.Regexp) {
m.Cache.Add(pattern, reg)
}
// Matches a needle with an array of regular expressions and returns true if a match was found.
func (m *RegexpMatcher) Matches(p Policy, haystack []string, needle string) (bool, error) {
var reg *regexp.Regexp
var err error
for _, h := range haystack {
// This means that the current haystack item does not contain a regular expression
if strings.Count(h, string(p.GetStartDelimiter())) == 0 {
// If we have a simple string match, we've got a match!
if h == needle {
return true, nil
}
// Not string match, but also no regexp, continue with next haystack item
continue
}
if reg = m.get(h); reg != nil {
if reg.MatchString(needle) {
return true, nil
}
continue
}
reg, err = compiler.CompileRegex(h, p.GetStartDelimiter(), p.GetEndDelimiter())
if err != nil {
return false, errors.WithStack(err)
}
m.set(h, reg)
if reg.MatchString(needle) {
return true, nil
}
}
return false, nil
}