summaryrefslogtreecommitdiffstats
path: root/fluent-bit/src/stream_processor/parser/sql.l
blob: 91e5398e1d73376d93c7e0100ae23f345525ac26 (plain)
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
%option prefix="flb_sp_"
%option caseless
%option 8bit reentrant bison-bridge
%option warn noyywrap nodefault
%option nounput
%option noinput


%{
#include <stdio.h>
#include <stdbool.h>
#include <ctype.h>
#include <fluent-bit/flb_str.h>
#include <fluent-bit/flb_log.h>
#include "sql_parser.h"
#include <fluent-bit/stream_processor/flb_sp_parser.h>

static inline char *remove_dup_qoutes(const char *s, size_t n)
{
    char *str;
    int dups;
    int i, j;

    dups = 0;
    for (i = 0; i < n; i++) {
        if (s[i] == '\'') {
            dups++;
            i++;
        }
    }

    str = (char *) flb_malloc(n - dups + 1);
    if (!str) {
        return NULL;
    }

    j = 0;
    for (i = 0; i < n; i++, j++) {
        if (s[i] == '\'') {
            str[j] = '\'';
            i++;
        } else {
            str[j] = s[i];
        }
    }
    str[j] = '\0';

    return str;
}

char* to_upper(char* token, size_t len)
{
    int i;
    char* token_;

    token_ = flb_malloc(len * sizeof(char) + 1);

    for (i = 0; i < len; i++) {
        token_[i] = toupper(token[i]);
    }

    token_[len] = '\0';
    return token_;
}

int func_to_code(char* name, size_t len)
{
    int code;
    char* name_;

    name_ = to_upper(name, len);
    code = -1;

    if (!strcmp(name_, "AVG")) {
        code = FLB_SP_AVG;
    } else if (!strcmp(name_, "SUM")) {
        code = FLB_SP_SUM;
    } else if (!strcmp(name_, "COUNT")) {
        code = FLB_SP_COUNT;
    } else if (!strcmp(name_, "MIN")) {
        code = FLB_SP_MIN;
    } else if (!strcmp(name_, "MAX")) {
        code = FLB_SP_MAX;
    } else if (!strcmp(name_, "TIMESERIES_FORECAST")) {
        code = FLB_SP_FORECAST;
    } else if (!strcmp(name_, "NOW")) {
        code = FLB_SP_NOW;
    } else if (!strcmp(name_, "UNIX_TIMESTAMP")) {
        code = FLB_SP_UNIX_TIMESTAMP;
    } else if (!strcmp(name_, "RECORD_TAG")) {
        code = FLB_SP_RECORD_TAG;
    } else if (!strcmp(name_, "RECORD_TIME")) {
        code = FLB_SP_RECORD_TIME;
    }

    flb_free(name_);
    return code;
}

%}

%%

 /* SQL */
CREATE                  return CREATE;
FLUSH                   return FLUSH;
STREAM                  return STREAM;
SNAPSHOT                return SNAPSHOT;
WITH                    return WITH;
SELECT                  return SELECT;
AS                      return AS;
FROM                    return FROM;
STREAM:                 return FROM_STREAM;
TAG:                    return FROM_TAG;
WHERE                   return WHERE;
AND                     return AND;
OR                      return OR;
NOT                     return NOT;
WINDOW                  return WINDOW;
"GROUP BY"              return GROUP_BY;
LIMIT                   return LIMIT;

IS                      return IS;
NULL                    return NUL;

 /* Aggregation Functions */
SUM                     {yylval->integer = func_to_code(yytext, yyleng); return SUM;}
AVG                     {yylval->integer = func_to_code(yytext, yyleng); return AVG;}
COUNT                   {yylval->integer = func_to_code(yytext, yyleng); return COUNT;}
MIN                     {yylval->integer = func_to_code(yytext, yyleng); return MIN;}
MAX                     {yylval->integer = func_to_code(yytext, yyleng); return MAX;}
TIMESERIES_FORECAST     {yylval->integer = func_to_code(yytext, yyleng); return TIMESERIES_FORECAST;};

 /* Record Functions */
@RECORD                 return RECORD;
CONTAINS                return CONTAINS;
TIME                    return TIME;


 /* Window Types */
TUMBLING                return TUMBLING;
HOPPING                 return HOPPING;
"ADVANCE BY"            return ADVANCE_BY;

 /* Time */
HOUR                    return HOUR;
MINUTE                  return MINUTE;
SECOND                  return SECOND;

 /* Date / Time Functions */
NOW                     {yylval->integer = func_to_code(yytext, yyleng); return NOW;}
UNIX_TIMESTAMP          {yylval->integer = func_to_code(yytext, yyleng); return UNIX_TIMESTAMP;}

 /* Record information */
RECORD_TAG              {yylval->integer = func_to_code(yytext, yyleng); return RECORD_TAG;}
RECORD_TIME             {yylval->integer = func_to_code(yytext, yyleng); return RECORD_TIME;}

"true"                     { yylval->boolean = true;  return BOOLTYPE; };
"false"                    { yylval->boolean = false;  return BOOLTYPE; };

-?[1-9][0-9]*|0            { yylval->integer = atoi(yytext);  return INTEGER; }
(-?[1-9][0-9]*|0)\.[0-9]+  { yylval->fval = atof(yytext); return FLOATING; }
\'([^']|'{2})*\'           { yylval->string = remove_dup_qoutes(yytext + 1, yyleng - 2); return STRING; }

[_A-Za-z][A-Za-z0-9_.]*	   { yylval->string = flb_strdup(yytext); return IDENTIFIER; }

"*"                     |
","                     |
"="                     |
"("                     |
")"                     |
"["                     |
"]"                     |
"."                     |
";"                     { return yytext[0]; }

"!="                    return NEQ;
"<>"                    return NEQ;
"<"                     return LT;
"<="                    return LTE;
">"                     return GT;
">="                    return GTE;

\'                      return QUOTE;
\n
[ \t]+			/* ignore whitespace */;

.	flb_error("[sp] bad input character '%s' at line %d", yytext, yylineno);

%%