49 lines
932 B
Go
49 lines
932 B
Go
|
package nebula
|
||
|
|
||
|
import (
|
||
|
"fmt"
|
||
|
"regexp"
|
||
|
)
|
||
|
|
||
|
type AllowList struct {
|
||
|
// The values of this cidrTree are `bool`, signifying allow/deny
|
||
|
cidrTree *CIDRTree
|
||
|
|
||
|
// To avoid ambiguity, all rules must be true, or all rules must be false.
|
||
|
nameRules []AllowListNameRule
|
||
|
}
|
||
|
|
||
|
type AllowListNameRule struct {
|
||
|
Name *regexp.Regexp
|
||
|
Allow bool
|
||
|
}
|
||
|
|
||
|
func (al *AllowList) Allow(ip uint32) bool {
|
||
|
if al == nil {
|
||
|
return true
|
||
|
}
|
||
|
|
||
|
result := al.cidrTree.MostSpecificContains(ip)
|
||
|
switch v := result.(type) {
|
||
|
case bool:
|
||
|
return v
|
||
|
default:
|
||
|
panic(fmt.Errorf("invalid state, allowlist returned: %T %v", result, result))
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func (al *AllowList) AllowName(name string) bool {
|
||
|
if al == nil || len(al.nameRules) == 0 {
|
||
|
return true
|
||
|
}
|
||
|
|
||
|
for _, rule := range al.nameRules {
|
||
|
if rule.Name.MatchString(name) {
|
||
|
return rule.Allow
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// If no rules match, return the default, which is the inverse of the rules
|
||
|
return !al.nameRules[0].Allow
|
||
|
}
|