Like Prometheus, but for logs.
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.
loki/pkg/logql/expr.y.go

801 lines
18 KiB

// Code generated by goyacc -p expr -o pkg/logql/expr.y.go pkg/logql/expr.y. DO NOT EDIT.
package logql
import __yyfmt__ "fmt"
import (
"github.com/prometheus/prometheus/pkg/labels"
"time"
)
type exprSymType struct {
yys int
Expr Expr
Filter labels.MatchType
Grouping *grouping
Labels []string
LogExpr LogSelectorExpr
LogRangeExpr *logRange
Matcher *labels.Matcher
Matchers []*labels.Matcher
RangeAggregationExpr SampleExpr
RangeOp string
Selector []*labels.Matcher
VectorAggregationExpr SampleExpr
VectorOp string
str string
duration time.Duration
int int64
}
const IDENTIFIER = 57346
const STRING = 57347
const DURATION = 57348
const MATCHERS = 57349
const LABELS = 57350
const EQ = 57351
const NEQ = 57352
const RE = 57353
const NRE = 57354
const OPEN_BRACE = 57355
const CLOSE_BRACE = 57356
const OPEN_BRACKET = 57357
const CLOSE_BRACKET = 57358
const COMMA = 57359
const DOT = 57360
const PIPE_MATCH = 57361
const PIPE_EXACT = 57362
const OPEN_PARENTHESIS = 57363
const CLOSE_PARENTHESIS = 57364
const BY = 57365
const WITHOUT = 57366
const COUNT_OVER_TIME = 57367
const RATE = 57368
const SUM = 57369
const AVG = 57370
const MAX = 57371
const MIN = 57372
const COUNT = 57373
const STDDEV = 57374
const STDVAR = 57375
const BOTTOMK = 57376
const TOPK = 57377
var exprToknames = [...]string{
"$end",
"error",
"$unk",
"IDENTIFIER",
"STRING",
"DURATION",
"MATCHERS",
"LABELS",
"EQ",
"NEQ",
"RE",
"NRE",
"OPEN_BRACE",
"CLOSE_BRACE",
"OPEN_BRACKET",
"CLOSE_BRACKET",
"COMMA",
"DOT",
"PIPE_MATCH",
"PIPE_EXACT",
"OPEN_PARENTHESIS",
"CLOSE_PARENTHESIS",
"BY",
"WITHOUT",
"COUNT_OVER_TIME",
"RATE",
"SUM",
"AVG",
"MAX",
"MIN",
"COUNT",
"STDDEV",
"STDVAR",
"BOTTOMK",
"TOPK",
}
var exprStatenames = [...]string{}
const exprEofCode = 1
const exprErrCode = 2
const exprInitialStackSize = 16
var exprExca = [...]int{
-1, 1,
1, -1,
-2, 0,
-1, 3,
1, 2,
-2, 0,
}
const exprPrivate = 57344
const exprLast = 149
var exprAct = [...]int{
31, 5, 4, 22, 36, 69, 10, 41, 30, 49,
32, 33, 86, 46, 7, 32, 33, 88, 11, 12,
13, 14, 16, 17, 15, 18, 19, 20, 21, 90,
89, 48, 45, 44, 11, 12, 13, 14, 16, 17,
15, 18, 19, 20, 21, 58, 85, 86, 3, 68,
67, 63, 87, 84, 23, 71, 28, 72, 61, 65,
64, 47, 27, 29, 26, 80, 81, 58, 82, 83,
66, 24, 25, 53, 40, 76, 75, 74, 42, 11,
12, 13, 14, 16, 17, 15, 18, 19, 20, 21,
92, 93, 62, 59, 10, 78, 10, 59, 77, 73,
91, 27, 43, 26, 7, 27, 37, 26, 23, 51,
24, 25, 70, 79, 24, 25, 27, 60, 26, 23,
9, 50, 23, 61, 52, 24, 25, 27, 40, 26,
27, 39, 26, 35, 38, 37, 24, 25, 6, 24,
25, 54, 55, 56, 57, 8, 34, 2, 1,
}
var exprPact = [...]int{
-7, -1000, -1000, 120, -1000, -1000, -1000, 83, 42, -13,
131, -1000, -1000, -1000, -1000, -1000, -1000, -1000, -1000, -1000,
-1000, -1000, 129, -1000, -1000, -1000, -1000, -1000, 106, 81,
9, 40, 10, -12, 107, 59, -1000, 132, -1000, -1000,
-1000, 95, 117, 81, 38, 37, 53, 54, 108, 108,
-1000, -1000, 102, -1000, 94, 72, 71, 70, 93, -1000,
-1000, -1000, 52, 91, -8, -8, 54, 31, 24, 30,
-1000, -5, -1000, -1000, -1000, -1000, -1000, -1000, -1000, -1000,
-1000, -1000, 8, 7, -1000, -1000, 96, -1000, -1000, -8,
-8, -1000, -1000, -1000,
}
var exprPgo = [...]int{
0, 148, 147, 3, 0, 5, 48, 7, 4, 146,
2, 145, 138, 1, 120,
}
var exprR1 = [...]int{
0, 1, 2, 2, 2, 6, 6, 6, 6, 6,
7, 7, 7, 7, 7, 10, 13, 13, 13, 13,
13, 13, 13, 13, 13, 13, 3, 3, 3, 3,
12, 12, 12, 9, 9, 8, 8, 8, 8, 14,
14, 14, 14, 14, 14, 14, 14, 14, 11, 11,
5, 5, 4, 4,
}
var exprR2 = [...]int{
0, 1, 1, 1, 1, 1, 3, 3, 3, 2,
2, 3, 3, 3, 2, 4, 4, 4, 5, 5,
5, 5, 6, 7, 6, 7, 1, 1, 1, 1,
3, 3, 3, 1, 3, 3, 3, 3, 3, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 3, 4, 4,
}
var exprChk = [...]int{
-1000, -1, -2, -6, -10, -13, -12, 21, -11, -14,
13, 25, 26, 27, 28, 31, 29, 30, 32, 33,
34, 35, -3, 2, 19, 20, 12, 10, -6, 21,
21, -4, 23, 24, -9, 2, -8, 4, 5, 2,
22, -7, -6, 21, -10, -13, 4, 21, 21, 21,
14, 2, 17, 14, 9, 10, 11, 12, -3, 2,
22, 6, -6, -7, 22, 22, 17, -10, -13, -5,
4, -5, -8, 5, 5, 5, 5, 5, 2, 22,
-4, -4, -13, -10, 22, 22, 17, 22, 22, 22,
22, 4, -4, -4,
}
var exprDef = [...]int{
0, -2, 1, -2, 3, 4, 5, 0, 0, 0,
0, 48, 49, 39, 40, 41, 42, 43, 44, 45,
46, 47, 0, 9, 26, 27, 28, 29, 0, 0,
0, 0, 0, 0, 0, 0, 33, 0, 6, 8,
7, 0, 0, 0, 0, 0, 0, 0, 0, 0,
30, 31, 0, 32, 0, 0, 0, 0, 0, 14,
15, 10, 0, 0, 16, 17, 0, 0, 0, 0,
50, 0, 34, 35, 36, 37, 38, 11, 13, 12,
20, 21, 0, 0, 18, 19, 0, 52, 53, 22,
24, 51, 23, 25,
}
var exprTok1 = [...]int{
1,
}
var exprTok2 = [...]int{
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,
}
var exprTok3 = [...]int{
0,
}
var exprErrorMessages = [...]struct {
state int
token int
msg string
}{}
/* parser for yacc output */
var (
exprDebug = 0
exprErrorVerbose = false
)
type exprLexer interface {
Lex(lval *exprSymType) int
Error(s string)
}
type exprParser interface {
Parse(exprLexer) int
Lookahead() int
}
type exprParserImpl struct {
lval exprSymType
stack [exprInitialStackSize]exprSymType
char int
}
func (p *exprParserImpl) Lookahead() int {
return p.char
}
func exprNewParser() exprParser {
return &exprParserImpl{}
}
const exprFlag = -1000
func exprTokname(c int) string {
if c >= 1 && c-1 < len(exprToknames) {
if exprToknames[c-1] != "" {
return exprToknames[c-1]
}
}
return __yyfmt__.Sprintf("tok-%v", c)
}
func exprStatname(s int) string {
if s >= 0 && s < len(exprStatenames) {
if exprStatenames[s] != "" {
return exprStatenames[s]
}
}
return __yyfmt__.Sprintf("state-%v", s)
}
func exprErrorMessage(state, lookAhead int) string {
const TOKSTART = 4
if !exprErrorVerbose {
return "syntax error"
}
for _, e := range exprErrorMessages {
if e.state == state && e.token == lookAhead {
return "syntax error: " + e.msg
}
}
res := "syntax error: unexpected " + exprTokname(lookAhead)
// To match Bison, suggest at most four expected tokens.
expected := make([]int, 0, 4)
// Look for shiftable tokens.
base := exprPact[state]
for tok := TOKSTART; tok-1 < len(exprToknames); tok++ {
if n := base + tok; n >= 0 && n < exprLast && exprChk[exprAct[n]] == tok {
if len(expected) == cap(expected) {
return res
}
expected = append(expected, tok)
}
}
if exprDef[state] == -2 {
i := 0
for exprExca[i] != -1 || exprExca[i+1] != state {
i += 2
}
// Look for tokens that we accept or reduce.
for i += 2; exprExca[i] >= 0; i += 2 {
tok := exprExca[i]
if tok < TOKSTART || exprExca[i+1] == 0 {
continue
}
if len(expected) == cap(expected) {
return res
}
expected = append(expected, tok)
}
// If the default action is to accept or reduce, give up.
if exprExca[i+1] != 0 {
return res
}
}
for i, tok := range expected {
if i == 0 {
res += ", expecting "
} else {
res += " or "
}
res += exprTokname(tok)
}
return res
}
func exprlex1(lex exprLexer, lval *exprSymType) (char, token int) {
token = 0
char = lex.Lex(lval)
if char <= 0 {
token = exprTok1[0]
goto out
}
if char < len(exprTok1) {
token = exprTok1[char]
goto out
}
if char >= exprPrivate {
if char < exprPrivate+len(exprTok2) {
token = exprTok2[char-exprPrivate]
goto out
}
}
for i := 0; i < len(exprTok3); i += 2 {
token = exprTok3[i+0]
if token == char {
token = exprTok3[i+1]
goto out
}
}
out:
if token == 0 {
token = exprTok2[1] /* unknown char */
}
if exprDebug >= 3 {
__yyfmt__.Printf("lex %s(%d)\n", exprTokname(token), uint(char))
}
return char, token
}
func exprParse(exprlex exprLexer) int {
return exprNewParser().Parse(exprlex)
}
func (exprrcvr *exprParserImpl) Parse(exprlex exprLexer) int {
var exprn int
var exprVAL exprSymType
var exprDollar []exprSymType
_ = exprDollar // silence set and not used
exprS := exprrcvr.stack[:]
Nerrs := 0 /* number of errors */
Errflag := 0 /* error recovery flag */
exprstate := 0
exprrcvr.char = -1
exprtoken := -1 // exprrcvr.char translated into internal numbering
defer func() {
// Make sure we report no lookahead when not parsing.
exprstate = -1
exprrcvr.char = -1
exprtoken = -1
}()
exprp := -1
goto exprstack
ret0:
return 0
ret1:
return 1
exprstack:
/* put a state and value onto the stack */
if exprDebug >= 4 {
__yyfmt__.Printf("char %v in %v\n", exprTokname(exprtoken), exprStatname(exprstate))
}
exprp++
if exprp >= len(exprS) {
nyys := make([]exprSymType, len(exprS)*2)
copy(nyys, exprS)
exprS = nyys
}
exprS[exprp] = exprVAL
exprS[exprp].yys = exprstate
exprnewstate:
exprn = exprPact[exprstate]
if exprn <= exprFlag {
goto exprdefault /* simple state */
}
if exprrcvr.char < 0 {
exprrcvr.char, exprtoken = exprlex1(exprlex, &exprrcvr.lval)
}
exprn += exprtoken
if exprn < 0 || exprn >= exprLast {
goto exprdefault
}
exprn = exprAct[exprn]
if exprChk[exprn] == exprtoken { /* valid shift */
exprrcvr.char = -1
exprtoken = -1
exprVAL = exprrcvr.lval
exprstate = exprn
if Errflag > 0 {
Errflag--
}
goto exprstack
}
exprdefault:
/* default state action */
exprn = exprDef[exprstate]
if exprn == -2 {
if exprrcvr.char < 0 {
exprrcvr.char, exprtoken = exprlex1(exprlex, &exprrcvr.lval)
}
/* look through exception table */
xi := 0
for {
if exprExca[xi+0] == -1 && exprExca[xi+1] == exprstate {
break
}
xi += 2
}
for xi += 2; ; xi += 2 {
exprn = exprExca[xi+0]
if exprn < 0 || exprn == exprtoken {
break
}
}
exprn = exprExca[xi+1]
if exprn < 0 {
goto ret0
}
}
if exprn == 0 {
/* error ... attempt to resume parsing */
switch Errflag {
case 0: /* brand new error */
exprlex.Error(exprErrorMessage(exprstate, exprtoken))
Nerrs++
if exprDebug >= 1 {
__yyfmt__.Printf("%s", exprStatname(exprstate))
__yyfmt__.Printf(" saw %s\n", exprTokname(exprtoken))
}
fallthrough
case 1, 2: /* incompletely recovered error ... try again */
Errflag = 3
/* find a state where "error" is a legal shift action */
for exprp >= 0 {
exprn = exprPact[exprS[exprp].yys] + exprErrCode
if exprn >= 0 && exprn < exprLast {
exprstate = exprAct[exprn] /* simulate a shift of "error" */
if exprChk[exprstate] == exprErrCode {
goto exprstack
}
}
/* the current p has no shift on "error", pop stack */
if exprDebug >= 2 {
__yyfmt__.Printf("error recovery pops state %d\n", exprS[exprp].yys)
}
exprp--
}
/* there is no state on the stack with an error shift ... abort */
goto ret1
case 3: /* no shift yet; clobber input char */
if exprDebug >= 2 {
__yyfmt__.Printf("error recovery discards %s\n", exprTokname(exprtoken))
}
if exprtoken == exprEofCode {
goto ret1
}
exprrcvr.char = -1
exprtoken = -1
goto exprnewstate /* try again in the same state */
}
}
/* reduction by production exprn */
if exprDebug >= 2 {
__yyfmt__.Printf("reduce %v in:\n\t%v\n", exprn, exprStatname(exprstate))
}
exprnt := exprn
exprpt := exprp
_ = exprpt // guard against "declared and not used"
exprp -= exprR2[exprn]
// exprp is now the index of $0. Perform the default action. Iff the
// reduced production is ε, $1 is possibly out of range.
if exprp+1 >= len(exprS) {
nyys := make([]exprSymType, len(exprS)*2)
copy(nyys, exprS)
exprS = nyys
}
exprVAL = exprS[exprp+1]
/* consult goto table to find next state */
exprn = exprR1[exprn]
exprg := exprPgo[exprn]
exprj := exprg + exprS[exprp].yys + 1
if exprj >= exprLast {
exprstate = exprAct[exprg]
} else {
exprstate = exprAct[exprj]
if exprChk[exprstate] != -exprn {
exprstate = exprAct[exprg]
}
}
// dummy call; replaced with literal code
switch exprnt {
case 1:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprlex.(*lexer).expr = exprDollar[1].Expr
}
case 2:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Expr = exprDollar[1].LogExpr
}
case 3:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Expr = exprDollar[1].RangeAggregationExpr
}
case 4:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Expr = exprDollar[1].VectorAggregationExpr
}
case 5:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.LogExpr = newMatcherExpr(exprDollar[1].Selector)
}
case 6:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.LogExpr = NewFilterExpr(exprDollar[1].LogExpr, exprDollar[2].Filter, exprDollar[3].str)
}
case 7:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.LogExpr = exprDollar[2].LogExpr
}
case 10:
exprDollar = exprS[exprpt-2 : exprpt+1]
{
exprVAL.LogRangeExpr = newLogRange(exprDollar[1].LogExpr, exprDollar[2].duration)
}
case 11:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.LogRangeExpr = addFilterToLogRangeExpr(exprDollar[1].LogRangeExpr, exprDollar[2].Filter, exprDollar[3].str)
}
case 12:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.LogRangeExpr = exprDollar[2].LogRangeExpr
}
case 15:
exprDollar = exprS[exprpt-4 : exprpt+1]
{
exprVAL.RangeAggregationExpr = newRangeAggregationExpr(exprDollar[3].LogRangeExpr, exprDollar[1].RangeOp)
}
case 16:
exprDollar = exprS[exprpt-4 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[3].RangeAggregationExpr, exprDollar[1].VectorOp, nil, nil)
}
case 17:
exprDollar = exprS[exprpt-4 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[3].VectorAggregationExpr, exprDollar[1].VectorOp, nil, nil)
}
case 18:
exprDollar = exprS[exprpt-5 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[4].RangeAggregationExpr, exprDollar[1].VectorOp, exprDollar[2].Grouping, nil)
}
case 19:
exprDollar = exprS[exprpt-5 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[4].VectorAggregationExpr, exprDollar[1].VectorOp, exprDollar[2].Grouping, nil)
}
case 20:
exprDollar = exprS[exprpt-5 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[3].RangeAggregationExpr, exprDollar[1].VectorOp, exprDollar[5].Grouping, nil)
}
case 21:
exprDollar = exprS[exprpt-5 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[3].VectorAggregationExpr, exprDollar[1].VectorOp, exprDollar[5].Grouping, nil)
}
case 22:
exprDollar = exprS[exprpt-6 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[5].VectorAggregationExpr, exprDollar[1].VectorOp, nil, &exprDollar[3].str)
}
case 23:
exprDollar = exprS[exprpt-7 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[5].VectorAggregationExpr, exprDollar[1].VectorOp, exprDollar[7].Grouping, &exprDollar[3].str)
}
case 24:
exprDollar = exprS[exprpt-6 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[5].RangeAggregationExpr, exprDollar[1].VectorOp, nil, &exprDollar[3].str)
}
case 25:
exprDollar = exprS[exprpt-7 : exprpt+1]
{
exprVAL.VectorAggregationExpr = mustNewVectorAggregationExpr(exprDollar[5].RangeAggregationExpr, exprDollar[1].VectorOp, exprDollar[7].Grouping, &exprDollar[3].str)
}
case 26:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Filter = labels.MatchRegexp
}
case 27:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Filter = labels.MatchEqual
}
case 28:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Filter = labels.MatchNotRegexp
}
case 29:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Filter = labels.MatchNotEqual
}
case 30:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Selector = exprDollar[2].Matchers
}
case 31:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Selector = exprDollar[2].Matchers
}
case 32:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
}
case 33:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Matchers = []*labels.Matcher{exprDollar[1].Matcher}
}
case 34:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Matchers = append(exprDollar[1].Matchers, exprDollar[3].Matcher)
}
case 35:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Matcher = mustNewMatcher(labels.MatchEqual, exprDollar[1].str, exprDollar[3].str)
}
case 36:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Matcher = mustNewMatcher(labels.MatchNotEqual, exprDollar[1].str, exprDollar[3].str)
}
case 37:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Matcher = mustNewMatcher(labels.MatchRegexp, exprDollar[1].str, exprDollar[3].str)
}
case 38:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Matcher = mustNewMatcher(labels.MatchNotRegexp, exprDollar[1].str, exprDollar[3].str)
}
case 39:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeSum
}
case 40:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeAvg
}
case 41:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeCount
}
case 42:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeMax
}
case 43:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeMin
}
case 44:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeStddev
}
case 45:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeStdvar
}
case 46:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeBottomK
}
case 47:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.VectorOp = OpTypeTopK
}
case 48:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.RangeOp = OpTypeCountOverTime
}
case 49:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.RangeOp = OpTypeRate
}
case 50:
exprDollar = exprS[exprpt-1 : exprpt+1]
{
exprVAL.Labels = []string{exprDollar[1].str}
}
case 51:
exprDollar = exprS[exprpt-3 : exprpt+1]
{
exprVAL.Labels = append(exprDollar[1].Labels, exprDollar[3].str)
}
case 52:
exprDollar = exprS[exprpt-4 : exprpt+1]
{
exprVAL.Grouping = &grouping{without: false, groups: exprDollar[3].Labels}
}
case 53:
exprDollar = exprS[exprpt-4 : exprpt+1]
{
exprVAL.Grouping = &grouping{without: true, groups: exprDollar[3].Labels}
}
}
goto exprstack /* stack new state and value */
}