mirror of https://github.com/grafana/loki
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
249 lines
6.1 KiB
249 lines
6.1 KiB
package syntax
|
|
|
|
import (
|
|
"errors"
|
|
"fmt"
|
|
"sort"
|
|
"strings"
|
|
"sync"
|
|
|
|
"github.com/prometheus/prometheus/model/labels"
|
|
promql_parser "github.com/prometheus/prometheus/promql/parser"
|
|
|
|
"github.com/grafana/loki/pkg/logqlmodel"
|
|
"github.com/grafana/loki/pkg/util"
|
|
)
|
|
|
|
const (
|
|
EmptyMatchers = "{}"
|
|
|
|
errAtleastOneEqualityMatcherRequired = "queries require at least one regexp or equality matcher that does not have an empty-compatible value. For instance, app=~\".*\" does not meet this requirement, but app=~\".+\" will"
|
|
)
|
|
|
|
var parserPool = sync.Pool{
|
|
New: func() interface{} {
|
|
p := &parser{
|
|
p: &exprParserImpl{},
|
|
Reader: strings.NewReader(""),
|
|
lexer: &lexer{},
|
|
}
|
|
return p
|
|
},
|
|
}
|
|
|
|
const maxInputSize = 5120
|
|
|
|
func init() {
|
|
// Improve the error messages coming out of yacc.
|
|
exprErrorVerbose = true
|
|
// uncomment when you need to understand yacc rule tree.
|
|
// exprDebug = 3
|
|
for str, tok := range tokens {
|
|
exprToknames[tok-exprPrivate+1] = str
|
|
}
|
|
}
|
|
|
|
type parser struct {
|
|
p *exprParserImpl
|
|
*lexer
|
|
expr Expr
|
|
*strings.Reader
|
|
}
|
|
|
|
func (p *parser) Parse() (Expr, error) {
|
|
p.lexer.errs = p.lexer.errs[:0]
|
|
p.lexer.Scanner.Error = func(_ *Scanner, msg string) {
|
|
p.lexer.Error(msg)
|
|
}
|
|
e := p.p.Parse(p)
|
|
if e != 0 || len(p.lexer.errs) > 0 {
|
|
return nil, p.lexer.errs[0]
|
|
}
|
|
return p.expr, nil
|
|
}
|
|
|
|
// ParseExpr parses a string and returns an Expr.
|
|
func ParseExpr(input string) (Expr, error) {
|
|
expr, err := ParseExprWithoutValidation(input)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if err := validateExpr(expr); err != nil {
|
|
return nil, err
|
|
}
|
|
return expr, nil
|
|
}
|
|
|
|
func ParseExprWithoutValidation(input string) (expr Expr, err error) {
|
|
if len(input) >= maxInputSize {
|
|
return nil, logqlmodel.NewParseError(fmt.Sprintf("input size too long (%d > %d)", len(input), maxInputSize), 0, 0)
|
|
}
|
|
|
|
defer func() {
|
|
if r := recover(); r != nil {
|
|
var ok bool
|
|
if err, ok = r.(error); ok {
|
|
if errors.Is(err, logqlmodel.ErrParse) {
|
|
return
|
|
}
|
|
err = logqlmodel.NewParseError(err.Error(), 0, 0)
|
|
}
|
|
}
|
|
}()
|
|
|
|
p := parserPool.Get().(*parser)
|
|
defer parserPool.Put(p)
|
|
|
|
p.Reader.Reset(input)
|
|
p.lexer.Init(p.Reader)
|
|
return p.Parse()
|
|
}
|
|
|
|
func validateExpr(expr Expr) error {
|
|
switch e := expr.(type) {
|
|
case SampleExpr:
|
|
return validateSampleExpr(e)
|
|
case LogSelectorExpr:
|
|
return validateLogSelectorExpression(e)
|
|
default:
|
|
return logqlmodel.NewParseError(fmt.Sprintf("unexpected expression type: %v", e), 0, 0)
|
|
}
|
|
}
|
|
|
|
// validateMatchers checks whether a query would touch all the streams in the query range or uses at least one matcher to select specific streams.
|
|
func validateMatchers(matchers []*labels.Matcher) error {
|
|
_, matchers = util.SplitFiltersAndMatchers(matchers)
|
|
if len(matchers) == 0 {
|
|
return logqlmodel.NewParseError(errAtleastOneEqualityMatcherRequired, 0, 0)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// ParseMatchers parses a string and returns labels matchers, if the expression contains
|
|
// anything else it will return an error.
|
|
func ParseMatchers(input string) ([]*labels.Matcher, error) {
|
|
expr, err := ParseExpr(input)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
matcherExpr, ok := expr.(*MatchersExpr)
|
|
if !ok {
|
|
return nil, errors.New("only label matchers is supported")
|
|
}
|
|
return matcherExpr.Mts, nil
|
|
}
|
|
|
|
func MatchersString(xs []*labels.Matcher) string {
|
|
return newMatcherExpr(xs).String()
|
|
}
|
|
|
|
// ParseSampleExpr parses a string and returns the sampleExpr
|
|
func ParseSampleExpr(input string) (SampleExpr, error) {
|
|
expr, err := ParseExpr(input)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
sampleExpr, ok := expr.(SampleExpr)
|
|
if !ok {
|
|
return nil, errors.New("only sample expression supported")
|
|
}
|
|
|
|
return sampleExpr, nil
|
|
}
|
|
|
|
func validateSampleExpr(expr SampleExpr) error {
|
|
switch e := expr.(type) {
|
|
case *BinOpExpr:
|
|
if e.err != nil {
|
|
return e.err
|
|
}
|
|
if err := validateSampleExpr(e.SampleExpr); err != nil {
|
|
return err
|
|
}
|
|
return validateSampleExpr(e.RHS)
|
|
case *LiteralExpr:
|
|
if e.err != nil {
|
|
return e.err
|
|
}
|
|
return nil
|
|
case *VectorExpr:
|
|
if e.err != nil {
|
|
return e.err
|
|
}
|
|
return nil
|
|
case *VectorAggregationExpr:
|
|
if e.err != nil {
|
|
return e.err
|
|
}
|
|
if e.Operation == OpTypeSort || e.Operation == OpTypeSortDesc {
|
|
if err := validateSortGrouping(e.Grouping); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
return validateSampleExpr(e.Left)
|
|
default:
|
|
selector, err := e.Selector()
|
|
if err != nil {
|
|
return err
|
|
}
|
|
return validateLogSelectorExpression(selector)
|
|
}
|
|
}
|
|
|
|
func validateLogSelectorExpression(expr LogSelectorExpr) error {
|
|
switch e := expr.(type) {
|
|
case *VectorExpr:
|
|
return nil
|
|
default:
|
|
return validateMatchers(e.Matchers())
|
|
}
|
|
}
|
|
|
|
// validateSortGrouping prevent by|without groupings on sort operations.
|
|
// This will keep compatibility with promql and allowing sort by (foo) doesn't make much sense anyway when sort orders by value instead of labels.
|
|
func validateSortGrouping(grouping *Grouping) error {
|
|
if grouping != nil && len(grouping.Groups) > 0 {
|
|
return logqlmodel.NewParseError("sort and sort_desc doesn't allow grouping by ", 0, 0)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// ParseLogSelector parses a log selector expression `{app="foo"} |= "filter"`
|
|
func ParseLogSelector(input string, validate bool) (LogSelectorExpr, error) {
|
|
expr, err := ParseExprWithoutValidation(input)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
logSelector, ok := expr.(LogSelectorExpr)
|
|
if !ok {
|
|
return nil, errors.New("only log selector is supported")
|
|
}
|
|
if validate {
|
|
if err := validateExpr(expr); err != nil {
|
|
return nil, err
|
|
}
|
|
}
|
|
return logSelector, nil
|
|
}
|
|
|
|
// ParseLabels parses labels from a string using logql parser.
|
|
func ParseLabels(lbs string) (labels.Labels, error) {
|
|
ls, err := promql_parser.ParseMetric(lbs)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
// Sort labels to ensure functionally equivalent
|
|
// inputs map to the same output
|
|
sort.Sort(ls)
|
|
|
|
// Use the label builder to trim empty label values.
|
|
// Empty label values are equivalent to absent labels
|
|
// in Prometheus, but they unfortunately alter the
|
|
// Hash values created. This can cause problems in Loki
|
|
// if we can't rely on a set of labels to have a deterministic
|
|
// hash value.
|
|
// Therefore we must normalize early in the write path.
|
|
// See https://github.com/grafana/loki/pull/7355
|
|
// for more information
|
|
return labels.NewBuilder(ls).Labels(), nil
|
|
}
|
|
|