mirror of
https://github.com/VictoriaMetrics/VictoriaMetrics.git
synced 2024-11-23 12:31:07 +01:00
352 lines
8.6 KiB
Go
352 lines
8.6 KiB
Go
package regexutil
|
|
|
|
import (
|
|
"fmt"
|
|
"regexp/syntax"
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
// RemoveStartEndAnchors removes '^' at the start of expr and '$' at the end of the expr.
|
|
func RemoveStartEndAnchors(expr string) string {
|
|
for strings.HasPrefix(expr, "^") {
|
|
expr = expr[1:]
|
|
}
|
|
for strings.HasSuffix(expr, "$") && !strings.HasSuffix(expr, "\\$") {
|
|
expr = expr[:len(expr)-1]
|
|
}
|
|
return expr
|
|
}
|
|
|
|
// GetOrValuesRegex returns "or" values from the given regexp expr.
|
|
//
|
|
// It returns ["foo", "bar"] for "foo|bar" regexp.
|
|
// It returns ["foo"] for "foo" regexp.
|
|
// It returns [""] for "" regexp.
|
|
// It returns an empty list if it is impossible to extract "or" values from the regexp.
|
|
func GetOrValuesRegex(expr string) []string {
|
|
return getOrValuesRegex(expr, true)
|
|
}
|
|
|
|
// GetOrValuesPromRegex returns "or" values from the given Prometheus-like regexp expr.
|
|
//
|
|
// It ignores start and end anchors ('^') and ('$') at the start and the end of expr.
|
|
// It returns ["foo", "bar"] for "foo|bar" regexp.
|
|
// It returns ["foo"] for "foo" regexp.
|
|
// It returns [""] for "" regexp.
|
|
// It returns an empty list if it is impossible to extract "or" values from the regexp.
|
|
func GetOrValuesPromRegex(expr string) []string {
|
|
expr = RemoveStartEndAnchors(expr)
|
|
return getOrValuesRegex(expr, false)
|
|
}
|
|
|
|
func getOrValuesRegex(expr string, keepAnchors bool) []string {
|
|
prefix, tailExpr := simplifyRegex(expr, keepAnchors)
|
|
if tailExpr == "" {
|
|
return []string{prefix}
|
|
}
|
|
sre, err := parseRegexp(tailExpr)
|
|
if err != nil {
|
|
return nil
|
|
}
|
|
orValues := getOrValues(sre)
|
|
|
|
// Sort orValues for faster index seek later
|
|
sort.Strings(orValues)
|
|
|
|
if len(prefix) > 0 {
|
|
// Add prefix to orValues
|
|
for i, orValue := range orValues {
|
|
orValues[i] = prefix + orValue
|
|
}
|
|
}
|
|
|
|
return orValues
|
|
}
|
|
|
|
func getOrValues(sre *syntax.Regexp) []string {
|
|
switch sre.Op {
|
|
case syntax.OpCapture:
|
|
return getOrValues(sre.Sub[0])
|
|
case syntax.OpLiteral:
|
|
v, ok := getLiteral(sre)
|
|
if !ok {
|
|
return nil
|
|
}
|
|
return []string{v}
|
|
case syntax.OpEmptyMatch:
|
|
return []string{""}
|
|
case syntax.OpAlternate:
|
|
a := make([]string, 0, len(sre.Sub))
|
|
for _, reSub := range sre.Sub {
|
|
ca := getOrValues(reSub)
|
|
if len(ca) == 0 {
|
|
return nil
|
|
}
|
|
a = append(a, ca...)
|
|
if len(a) > maxOrValues {
|
|
// It is cheaper to use regexp here.
|
|
return nil
|
|
}
|
|
}
|
|
return a
|
|
case syntax.OpCharClass:
|
|
a := make([]string, 0, len(sre.Rune)/2)
|
|
for i := 0; i < len(sre.Rune); i += 2 {
|
|
start := sre.Rune[i]
|
|
end := sre.Rune[i+1]
|
|
for start <= end {
|
|
a = append(a, string(start))
|
|
start++
|
|
if len(a) > maxOrValues {
|
|
// It is cheaper to use regexp here.
|
|
return nil
|
|
}
|
|
}
|
|
}
|
|
return a
|
|
case syntax.OpConcat:
|
|
if len(sre.Sub) < 1 {
|
|
return []string{""}
|
|
}
|
|
prefixes := getOrValues(sre.Sub[0])
|
|
if len(prefixes) == 0 {
|
|
return nil
|
|
}
|
|
if len(sre.Sub) == 1 {
|
|
return prefixes
|
|
}
|
|
sre.Sub = sre.Sub[1:]
|
|
suffixes := getOrValues(sre)
|
|
if len(suffixes) == 0 {
|
|
return nil
|
|
}
|
|
if len(prefixes)*len(suffixes) > maxOrValues {
|
|
// It is cheaper to use regexp here.
|
|
return nil
|
|
}
|
|
a := make([]string, 0, len(prefixes)*len(suffixes))
|
|
for _, prefix := range prefixes {
|
|
for _, suffix := range suffixes {
|
|
s := prefix + suffix
|
|
a = append(a, s)
|
|
}
|
|
}
|
|
return a
|
|
default:
|
|
return nil
|
|
}
|
|
}
|
|
|
|
func getLiteral(sre *syntax.Regexp) (string, bool) {
|
|
if sre.Op == syntax.OpCapture {
|
|
return getLiteral(sre.Sub[0])
|
|
}
|
|
if sre.Op == syntax.OpLiteral && sre.Flags&syntax.FoldCase == 0 {
|
|
return string(sre.Rune), true
|
|
}
|
|
return "", false
|
|
}
|
|
|
|
const maxOrValues = 100
|
|
|
|
// SimplifyRegex simplifies the given regexp expr.
|
|
//
|
|
// It returns plaintext pefix and the remaining regular expression
|
|
// without capturing parens.
|
|
func SimplifyRegex(expr string) (string, string) {
|
|
prefix, suffix := simplifyRegex(expr, true)
|
|
sre := mustParseRegexp(suffix)
|
|
|
|
if isDotOp(sre, syntax.OpStar) {
|
|
return prefix, ""
|
|
}
|
|
if sre.Op == syntax.OpConcat {
|
|
subs := sre.Sub
|
|
if prefix == "" {
|
|
// Drop .* at the start
|
|
for len(subs) > 0 && isDotOp(subs[0], syntax.OpStar) {
|
|
subs = subs[1:]
|
|
}
|
|
}
|
|
|
|
// Drop .* at the end.
|
|
for len(subs) > 0 && isDotOp(subs[len(subs)-1], syntax.OpStar) {
|
|
subs = subs[:len(subs)-1]
|
|
}
|
|
|
|
sre.Sub = subs
|
|
if len(subs) == 0 {
|
|
return prefix, ""
|
|
}
|
|
suffix = sre.String()
|
|
}
|
|
return prefix, suffix
|
|
}
|
|
|
|
// SimplifyPromRegex simplifies the given Prometheus-like expr.
|
|
//
|
|
// It returns plaintext prefix and the remaining regular expression
|
|
// with dropped '^' and '$' anchors at the beginning and at the end
|
|
// of the regular expression.
|
|
//
|
|
// The function removes capturing parens from the expr,
|
|
// so it cannot be used when capturing parens are necessary.
|
|
func SimplifyPromRegex(expr string) (string, string) {
|
|
return simplifyRegex(expr, false)
|
|
}
|
|
|
|
func simplifyRegex(expr string, keepAnchors bool) (string, string) {
|
|
sre, err := parseRegexp(expr)
|
|
if err != nil {
|
|
// Cannot parse the regexp. Return it all as prefix.
|
|
return expr, ""
|
|
}
|
|
sre = simplifyRegexp(sre, keepAnchors, keepAnchors)
|
|
if sre == emptyRegexp {
|
|
return "", ""
|
|
}
|
|
v, ok := getLiteral(sre)
|
|
if ok {
|
|
return v, ""
|
|
}
|
|
var prefix string
|
|
if sre.Op == syntax.OpConcat {
|
|
prefix, ok = getLiteral(sre.Sub[0])
|
|
if ok {
|
|
sre.Sub = sre.Sub[1:]
|
|
if len(sre.Sub) == 0 {
|
|
return prefix, ""
|
|
}
|
|
sre = simplifyRegexp(sre, true, keepAnchors)
|
|
}
|
|
}
|
|
if _, err := syntax.Compile(sre); err != nil {
|
|
// Cannot compile the regexp. Return it all as prefix.
|
|
return expr, ""
|
|
}
|
|
s := sre.String()
|
|
s = strings.ReplaceAll(s, "(?:)", "")
|
|
s = strings.ReplaceAll(s, "(?s:.)", ".")
|
|
s = strings.ReplaceAll(s, "(?m:$)", "$")
|
|
return prefix, s
|
|
}
|
|
|
|
func simplifyRegexp(sre *syntax.Regexp, keepBeginOp, keepEndOp bool) *syntax.Regexp {
|
|
s := sre.String()
|
|
for {
|
|
sre = simplifyRegexpExt(sre, keepBeginOp, keepEndOp)
|
|
sre = sre.Simplify()
|
|
if !keepBeginOp && sre.Op == syntax.OpBeginText {
|
|
sre = emptyRegexp
|
|
} else if !keepEndOp && sre.Op == syntax.OpEndText {
|
|
sre = emptyRegexp
|
|
}
|
|
sNew := sre.String()
|
|
if sNew == s {
|
|
return sre
|
|
}
|
|
sre = mustParseRegexp(sNew)
|
|
s = sNew
|
|
}
|
|
}
|
|
|
|
func simplifyRegexpExt(sre *syntax.Regexp, keepBeginOp, keepEndOp bool) *syntax.Regexp {
|
|
switch sre.Op {
|
|
case syntax.OpCapture:
|
|
// Substitute all the capture regexps with non-capture regexps.
|
|
sre.Op = syntax.OpAlternate
|
|
sre.Sub[0] = simplifyRegexpExt(sre.Sub[0], keepBeginOp, keepEndOp)
|
|
if sre.Sub[0] == emptyRegexp {
|
|
return emptyRegexp
|
|
}
|
|
return sre
|
|
case syntax.OpStar, syntax.OpPlus, syntax.OpQuest, syntax.OpRepeat:
|
|
sre.Sub[0] = simplifyRegexpExt(sre.Sub[0], keepBeginOp, keepEndOp)
|
|
if sre.Sub[0] == emptyRegexp {
|
|
return emptyRegexp
|
|
}
|
|
return sre
|
|
case syntax.OpAlternate:
|
|
// Do not remove empty captures from OpAlternate, since this may break regexp.
|
|
for i, sub := range sre.Sub {
|
|
sre.Sub[i] = simplifyRegexpExt(sub, keepBeginOp, keepEndOp)
|
|
}
|
|
return sre
|
|
case syntax.OpConcat:
|
|
subs := sre.Sub[:0]
|
|
for i, sub := range sre.Sub {
|
|
sub = simplifyRegexpExt(sub, keepBeginOp || len(subs) > 0, keepEndOp || i+1 < len(sre.Sub))
|
|
if sub != emptyRegexp {
|
|
subs = append(subs, sub)
|
|
}
|
|
}
|
|
sre.Sub = subs
|
|
// Remove anchros from the beginning and the end of regexp, since they
|
|
// will be added later.
|
|
if !keepBeginOp {
|
|
for len(sre.Sub) > 0 && sre.Sub[0].Op == syntax.OpBeginText {
|
|
sre.Sub = sre.Sub[1:]
|
|
}
|
|
}
|
|
if !keepEndOp {
|
|
for len(sre.Sub) > 0 && sre.Sub[len(sre.Sub)-1].Op == syntax.OpEndText {
|
|
sre.Sub = sre.Sub[:len(sre.Sub)-1]
|
|
}
|
|
}
|
|
if len(sre.Sub) == 0 {
|
|
return emptyRegexp
|
|
}
|
|
if len(sre.Sub) == 1 {
|
|
return sre.Sub[0]
|
|
}
|
|
return sre
|
|
case syntax.OpEmptyMatch:
|
|
return emptyRegexp
|
|
default:
|
|
return sre
|
|
}
|
|
}
|
|
|
|
// getSubstringLiteral returns regex part from sre surrounded by .+ or .* depending on the prefixSuffixOp.
|
|
//
|
|
// For example, if sre=".+foo.+" and prefixSuffix=syntax.OpPlus, then the function returns "foo".
|
|
//
|
|
// An empty string is returned if sre doesn't contain the given prefixSuffixOp prefix and suffix.
|
|
func getSubstringLiteral(sre *syntax.Regexp, prefixSuffixOp syntax.Op) string {
|
|
if sre.Op != syntax.OpConcat || len(sre.Sub) != 3 {
|
|
return ""
|
|
}
|
|
if !isDotOp(sre.Sub[0], prefixSuffixOp) || !isDotOp(sre.Sub[2], prefixSuffixOp) {
|
|
return ""
|
|
}
|
|
v, ok := getLiteral(sre.Sub[1])
|
|
if !ok {
|
|
return ""
|
|
}
|
|
return v
|
|
}
|
|
|
|
func isDotOp(sre *syntax.Regexp, op syntax.Op) bool {
|
|
if sre.Op != op {
|
|
return false
|
|
}
|
|
return sre.Sub[0].Op == syntax.OpAnyChar
|
|
}
|
|
|
|
var emptyRegexp = &syntax.Regexp{
|
|
Op: syntax.OpEmptyMatch,
|
|
}
|
|
|
|
func parseRegexp(expr string) (*syntax.Regexp, error) {
|
|
return syntax.Parse(expr, syntax.Perl|syntax.DotNL)
|
|
}
|
|
|
|
func mustParseRegexp(expr string) *syntax.Regexp {
|
|
sre, err := parseRegexp(expr)
|
|
if err != nil {
|
|
panic(fmt.Errorf("BUG: cannot parse already verified regexp %q: %w", expr, err))
|
|
}
|
|
return sre
|
|
}
|