diff --git a/.gitignore b/.gitignore index a43ba74e92..04a08a5de1 100644 --- a/.gitignore +++ b/.gitignore @@ -70,8 +70,15 @@ UnitTests/geo_suite arangod/Ahuacatl/ahuacatl-grammar.c arangod/Ahuacatl/ahuacatl-grammar.cpp arangod/Ahuacatl/ahuacatl-grammar.h +arangod/Ahuacatl/ahuacatl-grammar.hpp arangod/Ahuacatl/ahuacatl-grammar.output arangod/Ahuacatl/ahuacatl-tokens.cpp +arangod/Aql/grammar.c +arangod/Aql/grammar.cpp +arangod/Aql/grammar.h +arangod/Aql/grammar.hpp +arangod/Aql/grammar.output +arangod/Aql/tokens.cpp bin/ etc/arangodb/*.conf js/common/bootstrap/errors.js diff --git a/arangod/Aql/Parser.cpp b/arangod/Aql/Parser.cpp index d4c3a162be..e96a00e96e 100644 --- a/arangod/Aql/Parser.cpp +++ b/arangod/Aql/Parser.cpp @@ -39,7 +39,16 @@ using namespace triagens::aql; /// @brief create the parser //////////////////////////////////////////////////////////////////////////////// -Parser::Parser () { +Parser::Parser (Query* query) + : _query(query), + _scanner(nullptr), + _buffer(query->queryString()), + _remainingLength(query->queryLength()), + _offset(0), + _marker(nullptr) { + + //Aqlllex_init(&context->_parser->_scanner); + //Aqlset_extra(context, context->_parser->_scanner); } //////////////////////////////////////////////////////////////////////////////// @@ -47,6 +56,7 @@ Parser::Parser () { //////////////////////////////////////////////////////////////////////////////// Parser::~Parser () { +// Aqllex_destroy(parser->_scanner); } // ----------------------------------------------------------------------------- diff --git a/arangod/Aql/Parser.h b/arangod/Aql/Parser.h index c28aa4ebec..55c2cb582a 100644 --- a/arangod/Aql/Parser.h +++ b/arangod/Aql/Parser.h @@ -31,10 +31,13 @@ #define ARANGODB_AQL_PARSER_H 1 #include "Basics/Common.h" +#include "Aql/Query.h" namespace triagens { namespace aql { + class Query; + // ----------------------------------------------------------------------------- // --SECTION-- class Parser // ----------------------------------------------------------------------------- @@ -55,7 +58,7 @@ namespace triagens { /// @brief create the parser //////////////////////////////////////////////////////////////////////////////// - Parser (); + Parser (Query*); //////////////////////////////////////////////////////////////////////////////// /// @brief destroy the parser @@ -69,23 +72,105 @@ namespace triagens { public: +//////////////////////////////////////////////////////////////////////////////// +/// @brief return the scanner +//////////////////////////////////////////////////////////////////////////////// + + inline void* scanner () const { + return _scanner; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief a pointer to the start of the query string +//////////////////////////////////////////////////////////////////////////////// + + inline char const* queryString () const { + return _query->queryString(); + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief return the remaining length of the query string to process +//////////////////////////////////////////////////////////////////////////////// + + inline size_t remainingLength () const { + return _remainingLength; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief return the current marker position +//////////////////////////////////////////////////////////////////////////////// + + inline char const* marker () const { + return _marker; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief set the current marker position +//////////////////////////////////////////////////////////////////////////////// + + inline void marker (char const* marker) { + _marker = marker; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief return the current parse position +//////////////////////////////////////////////////////////////////////////////// + + inline size_t offset () const { + return _offset; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief adjust the current parse position +//////////////////////////////////////////////////////////////////////////////// + + inline void increaseOffset (int offset) { + _offset += (size_t) offset; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief fill the output buffer with a fragment of the query +//////////////////////////////////////////////////////////////////////////////// + + void fillBuffer (char* result, + size_t length) { + memcpy(result, _buffer, length); + _buffer += length; + _remainingLength -= length; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief register a string +//////////////////////////////////////////////////////////////////////////////// + + char* registerString (char const* p, + size_t length, + bool mustEscape) { + // TODO + return nullptr; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief set the query type +//////////////////////////////////////////////////////////////////////////////// + + void type (QueryType type) { + _query->type(type); + } + // ----------------------------------------------------------------------------- // --SECTION-- private variables // ----------------------------------------------------------------------------- private: - void* _scanner; // the lexer generated by flex - char* _buffer; // the currently procssed part of the query string - size_t _length; // remaining length of the query string, modified during parsing - size_t _queryLength; // overall length of the query string, not modified + Query* _query; // the query object - - // TODO: check if these are still required - // TRI_vector_pointer_t _scopes; - // TRI_vector_pointer_t _stack; - // char* _marker; // used temporarily during parsing - // size_t _offset; // current parse position + void* _scanner; // the lexer generated by flex + char const* _buffer; // the currently processed part of the query string + size_t _remainingLength; // remaining length of the query string, modified during parsing + size_t _offset; // current parse position + char const* _marker; // a position used temporarily during parsing }; } diff --git a/arangod/Aql/Query.cpp b/arangod/Aql/Query.cpp index 6b9ce6b0ea..143c970833 100644 --- a/arangod/Aql/Query.cpp +++ b/arangod/Aql/Query.cpp @@ -49,7 +49,7 @@ Query::Query (TRI_vocbase_t* vocbase, : _vocbase(vocbase), _queryString(queryString), _queryLength(queryLength), - _queryType(QUERY_READ), + _type(AQL_QUERY_READ), _bindParameters(bindParameters), _error() { } @@ -101,7 +101,7 @@ void Query::explain () { //////////////////////////////////////////////////////////////////////////////// void Query::parseQuery () { - Parser parser; + Parser parser(this); } /* diff --git a/arangod/Aql/Query.h b/arangod/Aql/Query.h index 2062d7a04c..13605b881e 100644 --- a/arangod/Aql/Query.h +++ b/arangod/Aql/Query.h @@ -48,11 +48,11 @@ namespace triagens { //////////////////////////////////////////////////////////////////////////////// enum QueryType { - QUERY_READ, - QUERY_REMOVE, - QUERY_INSERT, - QUERY_UPDATE, - QUERY_REPLACE + AQL_QUERY_READ, + AQL_QUERY_REMOVE, + AQL_QUERY_INSERT, + AQL_QUERY_UPDATE, + AQL_QUERY_REPLACE }; // ----------------------------------------------------------------------------- @@ -84,6 +84,38 @@ namespace triagens { public: +//////////////////////////////////////////////////////////////////////////////// +/// @brief get the query type +//////////////////////////////////////////////////////////////////////////////// + + inline QueryType type () const { + return _type; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief set the query type +//////////////////////////////////////////////////////////////////////////////// + + void type (QueryType type) { + _type = type; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief get the query string +//////////////////////////////////////////////////////////////////////////////// + + char const* queryString () const { + return _queryString; + } + +//////////////////////////////////////////////////////////////////////////////// +/// @brief get the length of the query string +//////////////////////////////////////////////////////////////////////////////// + + size_t queryLength () const { + return _queryLength; + } + //////////////////////////////////////////////////////////////////////////////// /// @brief execute an AQL query - TODO: implement and determine return type //////////////////////////////////////////////////////////////////////////////// @@ -124,7 +156,7 @@ namespace triagens { char const* _queryString; size_t const _queryLength; - QueryType _queryType; + QueryType _type; struct TRI_json_s* _bindParameters; diff --git a/arangod/Aql/grammar.y b/arangod/Aql/grammar.y new file mode 100644 index 0000000000..a7a5c597fc --- /dev/null +++ b/arangod/Aql/grammar.y @@ -0,0 +1,1382 @@ + +%define api.pure +%name-prefix "Aql" +%locations +%defines +%parse-param { triagens::aql::Parser* parser } +%lex-param { void* scanner } +%error-verbose + +%{ +#include +#include + +#include +#include +#include + +#include "Ahuacatl/ahuacatl-node.h" +#include "Ahuacatl/ahuacatl-ast-node.h" +#include "Ahuacatl/ahuacatl-context.h" +#include "Ahuacatl/ahuacatl-parser.h" +#include "Ahuacatl/ahuacatl-parser-functions.h" +#include "Ahuacatl/ahuacatl-scope.h" +#include "Aql/Parser.h" +%} + +%union { + struct TRI_aql_node_t* node; + char* strval; + bool boolval; + int64_t intval; +} + +%{ + +//////////////////////////////////////////////////////////////////////////////// +/// @brief forward for lexer function defined in Aql/tokens.l +//////////////////////////////////////////////////////////////////////////////// + +int Aqllex (YYSTYPE*, + YYLTYPE*, + void*); + +//////////////////////////////////////////////////////////////////////////////// +/// @brief register parse error +//////////////////////////////////////////////////////////////////////////////// + +void Aqlerror (YYLTYPE* locp, + triagens::aql::Parser* parser, + const char* err) { + // TODO: fix this TRI_SetErrorParseAql(context, err, locp->first_line, locp->first_column); +} + +//////////////////////////////////////////////////////////////////////////////// +/// @brief shortcut macro for signalling out of memory +//////////////////////////////////////////////////////////////////////////////// + +#define ABORT_OOM \ + /* TRI_SetErrorContextAql(__FILE__, __LINE__, context, TRI_ERROR_OUT_OF_MEMORY, NULL); */ \ + YYABORT; + +#define scanner parser->scanner() + +%} + +/* define tokens and "nice" token names */ +%token T_FOR "FOR declaration" +%token T_LET "LET declaration" +%token T_FILTER "FILTER declaration" +%token T_RETURN "RETURN declaration" +%token T_COLLECT "COLLECT declaration" +%token T_SORT "SORT declaration" +%token T_LIMIT "LIMIT declaration" + +%token T_ASC "ASC keyword" +%token T_DESC "DESC keyword" +%token T_IN "IN keyword" +%token T_WITH "WITH keyword" +%token T_INTO "INTO keyword" + +%token T_REMOVE "REMOVE command" +%token T_INSERT "INSERT command" +%token T_UPDATE "UPDATE command" +%token T_REPLACE "REPLACE command" + +%token T_NULL "null" +%token T_TRUE "true" +%token T_FALSE "false" +%token T_STRING "identifier" +%token T_QUOTED_STRING "quoted string" +%token T_INTEGER "integer number" +%token T_DOUBLE "number" +%token T_PARAMETER "bind parameter" + +%token T_ASSIGN "assignment" + +%token T_NOT "not operator" +%token T_AND "and operator" +%token T_OR "or operator" + +%token T_EQ "== operator" +%token T_NE "!= operator" +%token T_LT "< operator" +%token T_GT "> operator" +%token T_LE "<= operator" +%token T_GE ">= operator" + +%token T_PLUS "+ operator" +%token T_MINUS "- operator" +%token T_TIMES "* operator" +%token T_DIV "/ operator" +%token T_MOD "% operator" +%token T_EXPAND "[*] operator" + +%token T_QUESTION "?" +%token T_COLON ":" +%token T_SCOPE "::" +%token T_RANGE ".." + +%token T_COMMA "," +%token T_OPEN "(" +%token T_CLOSE ")" +%token T_DOC_OPEN "{" +%token T_DOC_CLOSE "}" +%token T_LIST_OPEN "[" +%token T_LIST_CLOSE "]" + +%token T_END 0 "end of query string" + + +/* define operator precedence */ +%left T_COMMA T_RANGE +%right T_QUESTION T_COLON +%right T_ASSIGN +%left T_OR +%left T_AND +%left T_EQ T_NE +%left T_IN +%left T_LT T_GT T_LE T_GE +%left T_PLUS T_MINUS +%left T_TIMES T_DIV T_MOD +%right UMINUS UPLUS T_NOT +%left T_EXPAND +%left FUNCCALL +%left REFERENCE +%left INDEXED +%left T_SCOPE + +/* define token return types */ +%type T_STRING +%type T_QUOTED_STRING +%type T_INTEGER +%type T_DOUBLE +%type T_PARAMETER; +%type sort_list; +%type sort_element; +%type sort_direction; +%type collect_list; +%type collect_element; +%type optional_into; +%type expression; +%type operator_unary; +%type operator_binary; +%type operator_ternary; +%type function_call; +%type function_name; +%type optional_function_call_arguments; +%type function_arguments_list; +%type compound_type; +%type list; +%type optional_list_elements; +%type list_elements_list; +%type array; +%type query_options; +%type optional_array_elements; +%type array_elements_list; +%type array_element; +%type array_element_name; +%type reference; +%type single_reference; +%type expansion; +%type atomic_value; +%type value_literal; +%type collection_name; +%type in_or_into_collection; +%type bind_parameter; +%type variable_name; +%type numeric_value; +%type integer_value; + + +/* define start token of language */ +%start query + +%% + +query: + optional_statement_block_statements return_statement { + parser->type(triagens::aql::AQL_QUERY_READ); + } + | optional_statement_block_statements remove_statement { + parser->type(triagens::aql::AQL_QUERY_REMOVE); + } + | optional_statement_block_statements insert_statement { + parser->type(triagens::aql::AQL_QUERY_INSERT); + } + | optional_statement_block_statements update_statement { + parser->type(triagens::aql::AQL_QUERY_UPDATE); + } + | optional_statement_block_statements replace_statement { + parser->type(triagens::aql::AQL_QUERY_REPLACE); + } + ; + +optional_statement_block_statements: + /* empty */ { + } + | optional_statement_block_statements statement_block_statement { + } + ; + +statement_block_statement: + for_statement { + } + | let_statement { + } + | filter_statement { + } + | collect_statement { + } + | sort_statement { + } + | limit_statement { + } + ; + +for_statement: + T_FOR variable_name T_IN expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_StartScopeAql(context, TRI_AQL_SCOPE_FOR)) { + ABORT_OOM + } + + TRI_aql_node_t* node = TRI_CreateNodeForAql(context, $2, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +filter_statement: + T_FILTER expression { + TRI_aql_context_t* context = nullptr; + + TRI_aql_node_t* node = TRI_CreateNodeFilterAql(context, $2); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +let_statement: + T_LET let_list { + } + ; + +let_list: + let_element { + } + | let_list T_COMMA let_element { + } + ; + +let_element: + variable_name T_ASSIGN expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeLetAql(context, $1, $3); + + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +collect_statement: + T_COLLECT { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeListAql(context); + + if (node == nullptr) { + ABORT_OOM + } + + TRI_PushStackParseAql(context, node); + } collect_list optional_into { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeCollectAql( + context, + static_cast + (TRI_PopStackParseAql(context)), + $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +collect_list: + collect_element { + } + | collect_list T_COMMA collect_element { + } + ; + +collect_element: + variable_name T_ASSIGN expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeAssignAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_PushListAql(context, node)) { + ABORT_OOM + } + } + ; + +optional_into: + /* empty */ { + $$ = nullptr; + } + | T_INTO variable_name { + $$ = $2; + } + ; + +sort_statement: + T_SORT { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeListAql(context); + + if (node == nullptr) { + ABORT_OOM + } + + TRI_PushStackParseAql(context, node); + } sort_list { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* list + = static_cast(TRI_PopStackParseAql(context)); + TRI_aql_node_t* node = TRI_CreateNodeSortAql(context, list); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +sort_list: + sort_element { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $1)) { + ABORT_OOM + } + } + | sort_list T_COMMA sort_element { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $3)) { + ABORT_OOM + } + } + ; + +sort_element: + expression sort_direction { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeSortElementAql(context, $1, $2); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +sort_direction: + /* empty */ { + $$ = true; + } + | T_ASC { + $$ = true; + } + | T_DESC { + $$ = false; + } + ; + +limit_statement: + T_LIMIT atomic_value { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeLimitAql(context, TRI_CreateNodeValueIntAql(context, 0), $2); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + } + | T_LIMIT atomic_value T_COMMA atomic_value { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeLimitAql(context, $2, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + } + ; + +return_statement: + T_RETURN expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeReturnAql(context, $2); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + ; + +in_or_into_collection: + T_IN collection_name { + $$ = $2; + } + | T_INTO collection_name { + $$ = $2; + } + ; + +remove_statement: + T_REMOVE expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeRemoveAql(context, $2, $3, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + ; + +insert_statement: + T_INSERT expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeInsertAql(context, $2, $3, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + ; + +update_statement: + T_UPDATE expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeUpdateAql(context, nullptr, $2, $3, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + | T_UPDATE expression T_WITH expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeUpdateAql(context, $2, $4, $5, $6); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + ; + +replace_statement: + T_REPLACE expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeReplaceAql(context, nullptr, $2, $3, $4); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + | T_REPLACE expression T_WITH expression in_or_into_collection query_options { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeReplaceAql(context, $2, $4, $5, $6); + if (node == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, node)) { + ABORT_OOM + } + + if (! TRI_EndScopeByReturnAql(context)) { + ABORT_OOM + } + } + ; + +expression: + T_OPEN expression T_CLOSE { + $$ = $2; + } + | T_OPEN { + TRI_aql_context_t* context = nullptr; + if (! TRI_StartScopeAql(context, TRI_AQL_SCOPE_SUBQUERY)) { + ABORT_OOM + } + + context->_subQueries++; + + } query T_CLOSE { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* result; + TRI_aql_node_t* subQuery; + TRI_aql_node_t* nameNode; + + context->_subQueries--; + + if (! TRI_EndScopeAql(context)) { + ABORT_OOM + } + + subQuery = TRI_CreateNodeSubqueryAql(context); + + if (subQuery == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, subQuery)) { + ABORT_OOM + } + + nameNode = TRI_AQL_NODE_MEMBER(subQuery, 0); + if (nameNode == nullptr) { + ABORT_OOM + } + + result = TRI_CreateNodeReferenceAql(context, TRI_AQL_NODE_STRING(nameNode)); + if (result == nullptr) { + ABORT_OOM + } + + // return the result + $$ = result; + } + | operator_unary { + $$ = $1; + } + | operator_binary { + $$ = $1; + } + | operator_ternary { + $$ = $1; + } + | compound_type { + $$ = $1; + } + | atomic_value { + $$ = $1; + } + | reference { + $$ = $1; + } + | expression T_RANGE expression { + TRI_aql_context_t* context = nullptr; + + if ($1 == nullptr || $3 == nullptr) { + ABORT_OOM + } + + TRI_aql_node_t* list = TRI_CreateNodeListAql(context); + if (list == nullptr) { + ABORT_OOM + } + + if (TRI_ERROR_NO_ERROR != TRI_PushBackVectorPointer(&list->_members, (void*) $1)) { + ABORT_OOM + } + if (TRI_ERROR_NO_ERROR != TRI_PushBackVectorPointer(&list->_members, (void*) $3)) { + ABORT_OOM + } + + TRI_aql_node_t* node = TRI_CreateNodeFcallAql(context, "RANGE", list); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +function_name: + T_STRING { + $$ = $1; + + if ($$ == nullptr) { + ABORT_OOM + } + } + | function_name T_SCOPE T_STRING { + TRI_aql_context_t* context = nullptr; + if ($1 == nullptr || $3 == nullptr) { + ABORT_OOM + } + + $$ = TRI_RegisterString3Aql(context, $1, "::", $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + ; + +function_call: + function_name { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushStackParseAql(context, $1)) { + ABORT_OOM + } + + TRI_aql_node_t* node = TRI_CreateNodeListAql(context); + if (node == nullptr) { + ABORT_OOM + } + + TRI_PushStackParseAql(context, node); + } T_OPEN optional_function_call_arguments T_CLOSE %prec FUNCCALL { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* list + = static_cast(TRI_PopStackParseAql(context)); + TRI_aql_node_t* node = TRI_CreateNodeFcallAql(context, + static_cast + (TRI_PopStackParseAql(context)), + list); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +operator_unary: + T_PLUS expression %prec UPLUS { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorUnaryPlusAql(context, $2); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_MINUS expression %prec UMINUS { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorUnaryMinusAql(context, $2); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_NOT expression %prec T_NOT { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorUnaryNotAql(context, $2); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +operator_binary: + expression T_OR expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryOrAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_AND expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryAndAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_PLUS expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryPlusAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_MINUS expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryMinusAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_TIMES expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryTimesAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_DIV expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryDivAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_MOD expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryModAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_EQ expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryEqAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_NE expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryNeAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_LT expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryLtAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_GT expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryGtAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_LE expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryLeAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_GE expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryGeAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | expression T_IN expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorBinaryInAql(context, $1, $3); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +operator_ternary: + expression T_QUESTION expression T_COLON expression { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeOperatorTernaryAql(context, $1, $3, $5); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +optional_function_call_arguments: + /* empty */ { + } + | function_arguments_list { + } + ; + +function_arguments_list: + expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $1)) { + ABORT_OOM + } + } + | function_arguments_list T_COMMA expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $3)) { + ABORT_OOM + } + } + ; + +compound_type: + list { + $$ = $1; + } + | array { + $$ = $1; + } + ; + +list: + T_LIST_OPEN { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeListAql(context); + if (node == nullptr) { + ABORT_OOM + } + + TRI_PushStackParseAql(context, node); + } optional_list_elements T_LIST_CLOSE { + TRI_aql_context_t* context = nullptr; + $$ = static_cast(TRI_PopStackParseAql(context)); + } + ; + +optional_list_elements: + /* empty */ { + } + | list_elements_list { + } + ; + +list_elements_list: + expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $1)) { + ABORT_OOM + } + } + | list_elements_list T_COMMA expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushListAql(context, $3)) { + ABORT_OOM + } + } + ; + +query_options: + /* empty */ { + $$ = nullptr; + } + | T_STRING array { + if ($1 == nullptr || $2 == nullptr) { + ABORT_OOM + } + + if (! TRI_CaseEqualString($1, "OPTIONS")) { +/* TODO TRI_SetErrorContextAql(__FILE__, __LINE__, context, TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE, nullptr); */ + YYABORT; + } + + $$ = $2; + } + ; + +array: + T_DOC_OPEN { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeArrayAql(context); + if (node == nullptr) { + ABORT_OOM + } + + TRI_PushStackParseAql(context, node); + } optional_array_elements T_DOC_CLOSE { + TRI_aql_context_t* context = nullptr; + $$ = static_cast(TRI_PopStackParseAql(context)); + } + ; + +optional_array_elements: + /* empty */ { + } + | array_elements_list { + } + ; + +array_elements_list: + array_element { + } + | array_elements_list T_COMMA array_element { + } + ; + +array_element: + array_element_name T_COLON expression { + TRI_aql_context_t* context = nullptr; + if (! TRI_PushArrayAql(context, $1, $3)) { + ABORT_OOM + } + } + ; + +reference: + single_reference { + // start of reference (collection or variable name) + $$ = $1; + } + | reference { + // expanded variable access, e.g. variable[*] + TRI_aql_context_t* context = nullptr; + char* varname = TRI_GetNameParseAql(context); + + if (varname == nullptr) { + ABORT_OOM + } + + // push the varname onto the stack + TRI_PushStackParseAql(context, varname); + + // push on the stack what's going to be expanded (will be popped when we come back) + TRI_PushStackParseAql(context, $1); + + // create a temporary variable for the row iterator (will be popped by "expansion" rule") + TRI_aql_node_t* node = TRI_CreateNodeReferenceAql(context, varname); + + if (node == nullptr) { + ABORT_OOM + } + + // push the variable + TRI_PushStackParseAql(context, node); + } T_EXPAND expansion { + // return from the "expansion" subrule + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* expanded = static_cast(TRI_PopStackParseAql(context)); + char* varname = static_cast(TRI_PopStackParseAql(context)); + + // push the actual expand node into the statement list + TRI_aql_node_t* expand = TRI_CreateNodeExpandAql(context, varname, expanded, $4); + + if (expand == nullptr) { + ABORT_OOM + } + + if (! TRI_AppendStatementListAql(context->_statements, expand)) { + ABORT_OOM + } + + TRI_aql_node_t* nameNode = TRI_AQL_NODE_MEMBER(expand, 1); + + if (nameNode == nullptr) { + ABORT_OOM + } + + // return a reference only + $$ = TRI_CreateNodeReferenceAql(context, TRI_AQL_NODE_STRING(nameNode)); + + if ($$ == nullptr) { + ABORT_OOM + } + } + ; + +single_reference: + T_STRING { + // variable or collection + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node; + + if (TRI_VariableExistsScopeAql(context, $1)) { + node = TRI_CreateNodeReferenceAql(context, $1); + } + else { + node = TRI_CreateNodeCollectionAql(context, $1); + } + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | function_call { + $$ = $1; + + if ($$ == nullptr) { + ABORT_OOM + } + } + | single_reference '.' T_STRING %prec REFERENCE { + // named variable access, e.g. variable.reference + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeAttributeAccessAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | single_reference '.' bind_parameter %prec REFERENCE { + // named variable access, e.g. variable.@reference + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeBoundAttributeAccessAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | single_reference T_LIST_OPEN expression T_LIST_CLOSE %prec INDEXED { + // indexed variable access, e.g. variable[index] + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeIndexedAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + ; + +expansion: + '.' T_STRING %prec REFERENCE { + // named variable access, continuation from * expansion, e.g. [*].variable.reference + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = static_cast(TRI_PopStackParseAql(context)); + + $$ = TRI_CreateNodeAttributeAccessAql(context, node, $2); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | '.' bind_parameter %prec REFERENCE { + // named variable access w/ bind parameter, continuation from * expansion, e.g. [*].variable.@reference + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = static_cast(TRI_PopStackParseAql(context)); + + $$ = TRI_CreateNodeBoundAttributeAccessAql(context, node, $2); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | T_LIST_OPEN expression T_LIST_CLOSE %prec INDEXED { + // indexed variable access, continuation from * expansion, e.g. [*].variable[index] + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = static_cast(TRI_PopStackParseAql(context)); + + $$ = TRI_CreateNodeIndexedAql(context, node, $2); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | expansion '.' T_STRING %prec REFERENCE { + // named variable access, continuation from * expansion, e.g. [*].variable.xx.reference + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeAttributeAccessAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | expansion '.' bind_parameter %prec REFERENCE { + // named variable access w/ bind parameter, continuation from * expansion, e.g. [*].variable.xx.@reference + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeBoundAttributeAccessAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + | expansion T_LIST_OPEN expression T_LIST_CLOSE %prec INDEXED { + // indexed variable access, continuation from * expansion, e.g. [*].variable.xx.[index] + TRI_aql_context_t* context = nullptr; + $$ = TRI_CreateNodeIndexedAql(context, $1, $3); + + if ($$ == nullptr) { + ABORT_OOM + } + } + ; + +atomic_value: + value_literal { + $$ = $1; + } + | bind_parameter { + $$ = $1; + } + ; + +numeric_value: + integer_value { + $$ = $1; + } + | T_DOUBLE { + TRI_aql_context_t* context = nullptr; + if ($1 == nullptr) { + ABORT_OOM + } + + double value = TRI_DoubleString($1); + + if (TRI_errno() != TRI_ERROR_NO_ERROR) { +/* TODO TRI_SetErrorContextAql(__FILE__, __LINE__, context, TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE, nullptr); */ + YYABORT; + } + + TRI_aql_node_t* node = TRI_CreateNodeValueDoubleAql(context, value); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + }; + +value_literal: + T_QUOTED_STRING { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeValueStringAql(context, $1); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | numeric_value { + $$ = $1; + } + | T_NULL { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeValueNullAql(context); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_TRUE { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeValueBoolAql(context, true); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_FALSE { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeValueBoolAql(context, false); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +collection_name: + T_STRING { + TRI_aql_context_t* context = nullptr; + + if ($1 == nullptr) { + ABORT_OOM + } + + TRI_aql_node_t* node = TRI_CreateNodeCollectionAql(context, $1); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_QUOTED_STRING { + TRI_aql_context_t* context = nullptr; + + if ($1 == nullptr) { + ABORT_OOM + } + + TRI_aql_node_t* node = TRI_CreateNodeCollectionAql(context, $1); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + | T_PARAMETER { + TRI_aql_context_t* context = nullptr; + + if ($1 == nullptr) { + ABORT_OOM + } + + if (strlen($1) < 2 || $1[0] != '@') { +/* TODO TRI_SetErrorContextAql(__FILE__, __LINE__, context, TRI_ERROR_QUERY_BIND_PARAMETER_TYPE, $1); */ + YYABORT; + } + + TRI_aql_node_t* node = TRI_CreateNodeParameterAql(context, $1); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +bind_parameter: + T_PARAMETER { + TRI_aql_context_t* context = nullptr; + TRI_aql_node_t* node = TRI_CreateNodeParameterAql(context, $1); + + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + +array_element_name: + T_STRING { + if ($1 == nullptr) { + ABORT_OOM + } + + $$ = $1; + } + | T_QUOTED_STRING { + if ($1 == nullptr) { + ABORT_OOM + } + + $$ = $1; + } + +variable_name: + T_STRING { + $$ = $1; + } + ; + +integer_value: + T_INTEGER { + TRI_aql_context_t* context = nullptr; + + if ($1 == nullptr) { + ABORT_OOM + } + + int64_t value = TRI_Int64String($1); + if (TRI_errno() != TRI_ERROR_NO_ERROR) { +/* TODO TRI_SetErrorContextAql(__FILE__, __LINE__, context, TRI_ERROR_QUERY_NUMBER_OUT_OF_RANGE, NULL); */ + YYABORT; + } + + TRI_aql_node_t* node = TRI_CreateNodeValueIntAql(context, value); + if (node == nullptr) { + ABORT_OOM + } + + $$ = node; + } + ; + diff --git a/arangod/Aql/tokens.cpp b/arangod/Aql/tokens.cpp new file mode 100644 index 0000000000..95e002dd91 --- /dev/null +++ b/arangod/Aql/tokens.cpp @@ -0,0 +1,2667 @@ + +#line 3 "arangod/Aql/tokens.cpp" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 5 +#define YY_FLEX_SUBMINOR_VERSION 37 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +#ifdef __cplusplus + +/* The "const" storage-class-modifier is valid. */ +#define YY_USE_CONST + +#else /* ! __cplusplus */ + +/* C99 requires __STDC__ to be defined as 1. */ +#if defined (__STDC__) + +#define YY_USE_CONST + +#endif /* defined (__STDC__) */ +#endif /* ! __cplusplus */ + +#ifdef YY_USE_CONST +#define yyconst const +#else +#define yyconst +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an unsigned + * integer for use as an array index. If the signed char is negative, + * we want to instead treat it as an 8-bit unsigned char, hence the + * double cast. + */ +#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) + +/* An opaque pointer. */ +#ifndef YY_TYPEDEF_YY_SCANNER_T +#define YY_TYPEDEF_YY_SCANNER_T +typedef void* yyscan_t; +#endif + +/* For convenience, these vars (plus the bison vars far below) + are macros in the reentrant scanner. */ +#define yyin yyg->yyin_r +#define yyout yyg->yyout_r +#define yyextra yyg->yyextra_r +#define yyleng yyg->yyleng_r +#define yytext yyg->yytext_r +#define yylineno (YY_CURRENT_BUFFER_LVALUE->yy_bs_lineno) +#define yycolumn (YY_CURRENT_BUFFER_LVALUE->yy_bs_column) +#define yy_flex_debug yyg->yy_flex_debug_r + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN yyg->yy_start = 1 + 2 * + +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START ((yyg->yy_start - 1) / 2) +#define YYSTATE YY_START + +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) + +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE Aqlrestart(yyin ,yyscanner ) + +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#define YY_BUF_SIZE 16384 +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires + * access to the local variable yy_act. Since yyless() is a macro, it would break + * existing scanners that call yyless() from OUTSIDE Aqllex. + * One obvious solution it to make yy_act a global. I tried that, and saw + * a 5% performance hit in a non-yylineno scanner, because yy_act is + * normally declared as a variable-- so it is not worth it. + */ + #define YY_LESS_LINENO(n) \ + do { \ + int yyl;\ + for ( yyl = n; yyl < yyleng; ++yyl )\ + if ( yytext[yyl] == '\n' )\ + --yylineno;\ + }while(0) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = yyg->yy_hold_char; \ + YY_RESTORE_YY_MORE_OFFSET \ + yyg->yy_c_buf_p = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) + +#define unput(c) yyunput( c, yyg->yytext_ptr , yyscanner ) + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + yy_size_t yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + yy_size_t yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via Aqlrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( yyg->yy_buffer_stack \ + ? yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] \ + : NULL) + +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE yyg->yy_buffer_stack[yyg->yy_buffer_stack_top] + +void Aqlrestart (FILE *input_file ,yyscan_t yyscanner ); +void Aql_switch_to_buffer (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +YY_BUFFER_STATE Aql_create_buffer (FILE *file,int size ,yyscan_t yyscanner ); +void Aql_delete_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void Aql_flush_buffer (YY_BUFFER_STATE b ,yyscan_t yyscanner ); +void Aqlpush_buffer_state (YY_BUFFER_STATE new_buffer ,yyscan_t yyscanner ); +void Aqlpop_buffer_state (yyscan_t yyscanner ); + +static void Aqlensure_buffer_stack (yyscan_t yyscanner ); +static void Aql_load_buffer_state (yyscan_t yyscanner ); +static void Aql_init_buffer (YY_BUFFER_STATE b,FILE *file ,yyscan_t yyscanner ); + +#define YY_FLUSH_BUFFER Aql_flush_buffer(YY_CURRENT_BUFFER ,yyscanner) + +YY_BUFFER_STATE Aql_scan_buffer (char *base,yy_size_t size ,yyscan_t yyscanner ); +YY_BUFFER_STATE Aql_scan_string (yyconst char *yy_str ,yyscan_t yyscanner ); +YY_BUFFER_STATE Aql_scan_bytes (yyconst char *bytes,yy_size_t len ,yyscan_t yyscanner ); + +void *Aqlalloc (yy_size_t ,yyscan_t yyscanner ); +void *Aqlrealloc (void *,yy_size_t ,yyscan_t yyscanner ); +void Aqlfree (void * ,yyscan_t yyscanner ); + +#define yy_new_buffer Aql_create_buffer + +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + Aqlensure_buffer_stack (yyscanner); \ + YY_CURRENT_BUFFER_LVALUE = \ + Aql_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } + +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + Aqlensure_buffer_stack (yyscanner); \ + YY_CURRENT_BUFFER_LVALUE = \ + Aql_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } + +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ + +#define Aqlwrap(yyscanner) 1 +#define YY_SKIP_YYWRAP + +typedef unsigned char YY_CHAR; + +typedef int yy_state_type; + +#define yytext_ptr yytext_r + +static yy_state_type yy_get_previous_state (yyscan_t yyscanner ); +static yy_state_type yy_try_NUL_trans (yy_state_type current_state ,yyscan_t yyscanner); +static int yy_get_next_buffer (yyscan_t yyscanner ); +static void yy_fatal_error (yyconst char msg[] ,yyscan_t yyscanner ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + yyg->yytext_ptr = yy_bp; \ + yyleng = (size_t) (yy_cp - yy_bp); \ + yyg->yy_hold_char = *yy_cp; \ + *yy_cp = '\0'; \ + yyg->yy_c_buf_p = yy_cp; + +#define YY_NUM_RULES 78 +#define YY_END_OF_BUFFER 79 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static yyconst flex_int16_t yy_accept[180] = + { 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 79, 77, 66, 66, 27, 53, 34, 77, + 58, 41, 42, 32, 30, 40, 31, 77, 33, 63, + 63, 37, 25, 26, 23, 35, 77, 47, 47, 47, + 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, + 45, 46, 77, 48, 43, 77, 44, 52, 51, 52, + 49, 62, 61, 59, 62, 57, 56, 54, 57, 70, + 68, 69, 78, 73, 75, 76, 74, 66, 21, 28, + 39, 71, 67, 0, 63, 36, 24, 20, 22, 65, + 0, 47, 47, 47, 47, 47, 47, 47, 10, 47, + + 47, 47, 47, 47, 47, 47, 47, 0, 47, 0, + 29, 50, 60, 55, 70, 68, 73, 75, 72, 64, + 65, 8, 47, 47, 47, 47, 1, 47, 47, 2, + 47, 47, 47, 47, 47, 47, 47, 47, 47, 38, + 47, 47, 0, 47, 9, 47, 47, 47, 11, 47, + 17, 47, 47, 47, 6, 18, 47, 12, 0, 64, + 47, 19, 47, 47, 7, 47, 47, 47, 47, 47, + 3, 14, 13, 47, 4, 15, 5, 16, 0 + } ; + +static yyconst flex_int32_t yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, + 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 2, 5, 6, 1, 1, 7, 8, 9, 10, + 11, 12, 13, 14, 15, 16, 17, 18, 19, 19, + 19, 19, 19, 19, 19, 19, 19, 20, 1, 21, + 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, + 27, 32, 33, 27, 27, 34, 35, 36, 37, 38, + 27, 39, 40, 41, 42, 43, 44, 27, 27, 27, + 45, 46, 47, 1, 48, 49, 50, 27, 51, 52, + + 53, 54, 27, 55, 56, 27, 27, 57, 58, 59, + 60, 61, 27, 62, 63, 64, 65, 66, 67, 27, + 27, 27, 68, 69, 70, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static yyconst flex_int32_t yy_meta[71] = + { 0, + 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, + 1, 3, 1, 1, 1, 1, 1, 4, 4, 1, + 1, 1, 1, 1, 5, 6, 6, 6, 6, 6, + 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, + 6, 6, 6, 6, 1, 1, 1, 7, 1, 6, + 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, + 6, 6, 6, 6, 6, 6, 6, 1, 1, 1 + } ; + +static yyconst flex_int16_t yy_base[196] = + { 0, + 0, 0, 68, 69, 70, 73, 74, 75, 71, 81, + 83, 85, 287, 381, 88, 96, 259, 381, 381, 270, + 381, 381, 381, 381, 381, 381, 381, 261, 84, 260, + 86, 255, 251, 250, 249, 381, 245, 63, 0, 69, + 77, 98, 73, 80, 69, 92, 86, 88, 90, 104, + 257, 381, 220, 381, 381, 198, 381, 381, 381, 0, + 381, 381, 381, 381, 0, 381, 381, 381, 0, 0, + 381, 214, 381, 0, 381, 210, 108, 136, 381, 381, + 381, 381, 381, 123, 137, 381, 381, 381, 381, 0, + 87, 0, 115, 110, 107, 115, 118, 118, 121, 118, + + 128, 130, 130, 130, 131, 145, 135, 61, 159, 46, + 381, 381, 381, 381, 0, 381, 0, 381, 381, 171, + 0, 0, 145, 153, 143, 152, 0, 165, 161, 0, + 167, 169, 168, 174, 167, 169, 181, 186, 182, 381, + 0, 201, 225, 192, 0, 195, 197, 190, 0, 189, + 0, 192, 189, 202, 0, 0, 201, 0, 228, 236, + 223, 0, 217, 216, 0, 229, 232, 225, 232, 222, + 0, 0, 0, 236, 0, 0, 0, 0, 381, 289, + 296, 303, 310, 317, 321, 324, 326, 333, 340, 347, + 354, 361, 365, 369, 373 + + } ; + +static yyconst flex_int16_t yy_def[196] = + { 0, + 179, 1, 180, 180, 181, 181, 182, 182, 183, 183, + 184, 184, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 185, 186, 186, 186, + 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, + 179, 179, 187, 179, 179, 179, 179, 179, 179, 188, + 179, 179, 179, 179, 189, 179, 179, 179, 190, 191, + 179, 179, 179, 192, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 193, + 185, 186, 186, 186, 186, 186, 186, 186, 186, 186, + + 186, 186, 186, 186, 186, 186, 186, 179, 194, 187, + 179, 179, 179, 179, 191, 179, 192, 179, 179, 179, + 193, 186, 186, 186, 186, 186, 186, 186, 186, 186, + 186, 186, 186, 186, 186, 186, 186, 186, 186, 179, + 195, 194, 179, 186, 186, 186, 186, 186, 186, 186, + 186, 186, 186, 186, 186, 186, 186, 186, 179, 179, + 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, + 186, 186, 186, 186, 186, 186, 186, 186, 0, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179 + + } ; + +static yyconst flex_int16_t yy_nxt[452] = + { 0, + 14, 15, 16, 15, 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, 39, + 42, 39, 43, 44, 39, 45, 39, 39, 46, 47, + 48, 49, 39, 50, 51, 14, 52, 53, 54, 38, + 40, 41, 39, 42, 39, 43, 44, 39, 45, 39, + 39, 46, 47, 48, 49, 39, 50, 55, 56, 57, + 59, 59, 63, 71, 72, 63, 67, 67, 64, 68, + 68, 64, 73, 71, 72, 75, 76, 75, 76, 78, + 78, 78, 73, 110, 77, 82, 77, 78, 78, 78, + + 83, 84, 93, 85, 85, 94, 95, 140, 99, 100, + 102, 179, 101, 60, 60, 65, 61, 61, 65, 69, + 69, 103, 104, 96, 119, 93, 105, 106, 94, 95, + 97, 99, 100, 102, 98, 101, 107, 78, 78, 78, + 120, 120, 122, 123, 103, 104, 124, 96, 125, 105, + 106, 126, 84, 97, 85, 85, 127, 98, 130, 107, + 128, 129, 131, 132, 133, 122, 123, 134, 136, 124, + 135, 125, 137, 138, 126, 139, 141, 141, 144, 127, + 145, 130, 146, 128, 129, 131, 132, 133, 120, 120, + 134, 136, 147, 135, 148, 137, 138, 149, 139, 150, + + 143, 144, 151, 145, 152, 146, 141, 153, 154, 155, + 156, 157, 118, 158, 167, 147, 116, 148, 141, 141, + 149, 161, 150, 143, 162, 151, 163, 152, 164, 165, + 153, 154, 155, 156, 166, 157, 158, 159, 167, 159, + 168, 169, 160, 160, 161, 160, 160, 162, 141, 163, + 170, 164, 165, 160, 160, 171, 172, 166, 173, 174, + 175, 176, 177, 168, 169, 178, 111, 110, 108, 91, + 89, 88, 87, 170, 86, 84, 81, 80, 171, 172, + 79, 173, 174, 175, 176, 177, 179, 179, 178, 58, + 58, 58, 58, 58, 58, 58, 62, 62, 62, 62, + + 62, 62, 62, 66, 66, 66, 66, 66, 66, 66, + 70, 70, 70, 70, 70, 70, 70, 74, 74, 74, + 74, 74, 74, 74, 90, 90, 90, 92, 179, 92, + 92, 109, 109, 112, 179, 112, 112, 112, 112, 112, + 113, 179, 113, 113, 113, 113, 113, 114, 179, 114, + 114, 114, 114, 114, 115, 179, 179, 115, 115, 115, + 115, 117, 179, 179, 117, 117, 117, 117, 121, 179, + 121, 121, 142, 179, 142, 142, 141, 179, 141, 141, + 13, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179 + } ; + +static yyconst flex_int16_t yy_chk[452] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 3, 4, 5, 9, 9, 6, 7, 8, 5, 7, + 8, 6, 9, 10, 10, 11, 11, 12, 12, 15, + 15, 15, 10, 110, 11, 29, 12, 16, 16, 16, + + 29, 31, 38, 31, 31, 40, 41, 108, 43, 44, + 45, 91, 44, 3, 4, 5, 3, 4, 6, 7, + 8, 46, 47, 42, 77, 38, 48, 49, 40, 41, + 42, 43, 44, 45, 42, 44, 50, 78, 78, 78, + 84, 84, 93, 94, 46, 47, 95, 42, 96, 48, + 49, 97, 85, 42, 85, 85, 98, 42, 100, 50, + 99, 99, 101, 102, 103, 93, 94, 103, 104, 95, + 103, 96, 105, 106, 97, 107, 109, 109, 123, 98, + 124, 100, 125, 99, 99, 101, 102, 103, 120, 120, + 103, 104, 126, 103, 128, 105, 106, 129, 107, 131, + + 120, 123, 132, 124, 133, 125, 109, 134, 135, 136, + 137, 138, 76, 139, 153, 126, 72, 128, 142, 142, + 129, 144, 131, 120, 146, 132, 147, 133, 148, 150, + 134, 135, 136, 137, 152, 138, 139, 143, 153, 143, + 154, 157, 143, 143, 144, 159, 159, 146, 142, 147, + 161, 148, 150, 160, 160, 163, 164, 152, 166, 167, + 168, 169, 170, 154, 157, 174, 56, 53, 51, 37, + 35, 34, 33, 161, 32, 30, 28, 20, 163, 164, + 17, 166, 167, 168, 169, 170, 13, 0, 174, 180, + 180, 180, 180, 180, 180, 180, 181, 181, 181, 181, + + 181, 181, 181, 182, 182, 182, 182, 182, 182, 182, + 183, 183, 183, 183, 183, 183, 183, 184, 184, 184, + 184, 184, 184, 184, 185, 185, 185, 186, 0, 186, + 186, 187, 187, 188, 0, 188, 188, 188, 188, 188, + 189, 0, 189, 189, 189, 189, 189, 190, 0, 190, + 190, 190, 190, 190, 191, 0, 0, 191, 191, 191, + 191, 192, 0, 0, 192, 192, 192, 192, 193, 0, + 193, 193, 194, 0, 194, 194, 195, 0, 195, 195, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, + 179 + } ; + +/* Table of booleans, true if rule could match eol. */ +static yyconst flex_int32_t yy_rule_can_match_eol[79] = + { 0, +0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, + 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, }; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET + +#include "Basics/Common.h" + +// introduce the namespace here, otherwise following references to +// the namespace in auto-generated headers might fail + +namespace triagens { + namespace aql { + class Query; + class Parser; + } +} + +#include "Aql/grammar.h" +#include "Aql/Parser.h" + +#define YY_EXTRA_TYPE triagens::aql::Parser* + +#define YY_USER_ACTION yylloc->first_line = yylineno; yylloc->first_column = yycolumn; yylloc->last_column = (int) (yycolumn + yyleng - 1); yycolumn += (int) yyleng; yyextra->increaseOffset(yyleng); + +#define YY_NO_INPUT 1 + +#define YY_INPUT(resultBuffer, resultState, maxBytesToRead) { \ + size_t length = yyextra->remainingLength(); \ + if (length > maxBytesToRead) { \ + length = maxBytesToRead; \ + } \ + if (length > 0) { \ + yyextra->fillBuffer(resultBuffer, length); \ + resultState = length; \ + } \ + else { \ + resultState = YY_NULL; \ + } \ +} + +#define INITIAL 0 +#define BACKTICK 1 +#define SINGLE_QUOTE 2 +#define DOUBLE_QUOTE 3 +#define COMMENT_SINGLE 4 +#define COMMENT_MULTI 5 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +/* Holds the entire state of the reentrant scanner. */ +struct yyguts_t + { + + /* User-defined. Not touched by flex. */ + YY_EXTRA_TYPE yyextra_r; + + /* The rest are the same as the globals declared in the non-reentrant scanner. */ + FILE *yyin_r, *yyout_r; + size_t yy_buffer_stack_top; /**< index of top of stack. */ + size_t yy_buffer_stack_max; /**< capacity of stack. */ + YY_BUFFER_STATE * yy_buffer_stack; /**< Stack as an array. */ + char yy_hold_char; + yy_size_t yy_n_chars; + yy_size_t yyleng_r; + char *yy_c_buf_p; + int yy_init; + int yy_start; + int yy_did_buffer_switch_on_eof; + int yy_start_stack_ptr; + int yy_start_stack_depth; + int *yy_start_stack; + yy_state_type yy_last_accepting_state; + char* yy_last_accepting_cpos; + + int yylineno_r; + int yy_flex_debug_r; + + char *yytext_r; + int yy_more_flag; + int yy_more_len; + + YYSTYPE * yylval_r; + + YYLTYPE * yylloc_r; + + }; /* end struct yyguts_t */ + +static int yy_init_globals (yyscan_t yyscanner ); + + /* This must go here because YYSTYPE and YYLTYPE are included + * from bison output in section 1.*/ + # define yylval yyg->yylval_r + + # define yylloc yyg->yylloc_r + +int Aqllex_init (yyscan_t* scanner); + +int Aqllex_init_extra (YY_EXTRA_TYPE user_defined,yyscan_t* scanner); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int Aqllex_destroy (yyscan_t yyscanner ); + +int Aqlget_debug (yyscan_t yyscanner ); + +void Aqlset_debug (int debug_flag ,yyscan_t yyscanner ); + +YY_EXTRA_TYPE Aqlget_extra (yyscan_t yyscanner ); + +void Aqlset_extra (YY_EXTRA_TYPE user_defined ,yyscan_t yyscanner ); + +FILE *Aqlget_in (yyscan_t yyscanner ); + +void Aqlset_in (FILE * in_str ,yyscan_t yyscanner ); + +FILE *Aqlget_out (yyscan_t yyscanner ); + +void Aqlset_out (FILE * out_str ,yyscan_t yyscanner ); + +yy_size_t Aqlget_leng (yyscan_t yyscanner ); + +char *Aqlget_text (yyscan_t yyscanner ); + +int Aqlget_lineno (yyscan_t yyscanner ); + +void Aqlset_lineno (int line_number ,yyscan_t yyscanner ); + +int Aqlget_column (yyscan_t yyscanner ); + +void Aqlset_column (int column_no ,yyscan_t yyscanner ); + +YYSTYPE * Aqlget_lval (yyscan_t yyscanner ); + +void Aqlset_lval (YYSTYPE * yylval_param ,yyscan_t yyscanner ); + + YYLTYPE *Aqlget_lloc (yyscan_t yyscanner ); + + void Aqlset_lloc (YYLTYPE * yylloc_param ,yyscan_t yyscanner ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int Aqlwrap (yyscan_t yyscanner ); +#else +extern int Aqlwrap (yyscan_t yyscanner ); +#endif +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy (char *,yyconst char *,int ,yyscan_t yyscanner); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * ,yyscan_t yyscanner); +#endif + +#ifndef YY_NO_INPUT + +#ifdef __cplusplus +static int yyinput (yyscan_t yyscanner ); +#else +static int input (yyscan_t yyscanner ); +#endif + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#define YY_READ_BUF_SIZE 8192 +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + size_t n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(yyin); \ + } \ + }\ +\ + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg , yyscanner) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int Aqllex \ + (YYSTYPE * yylval_param,YYLTYPE * yylloc_param ,yyscan_t yyscanner); + +#define YY_DECL int Aqllex \ + (YYSTYPE * yylval_param, YYLTYPE * yylloc_param , yyscan_t yyscanner) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + yy_state_type yy_current_state; + char *yy_cp, *yy_bp; + int yy_act; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* --------------------------------------------------------------------------- + * language keywords + * --------------------------------------------------------------------------- */ + + yylval = yylval_param; + + yylloc = yylloc_param; + + if ( !yyg->yy_init ) + { + yyg->yy_init = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! yyg->yy_start ) + yyg->yy_start = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + Aqlensure_buffer_stack (yyscanner); + YY_CURRENT_BUFFER_LVALUE = + Aql_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); + } + + Aql_load_buffer_state(yyscanner ); + } + + while ( 1 ) /* loops until end-of-file is reached */ + { + yy_cp = yyg->yy_c_buf_p; + + /* Support of yytext. */ + *yy_cp = yyg->yy_hold_char; + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = yyg->yy_start; +yy_match: + do + { + YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 180 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + ++yy_cp; + } + while ( yy_current_state != 179 ); + yy_cp = yyg->yy_last_accepting_cpos; + yy_current_state = yyg->yy_last_accepting_state; + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + + YY_DO_BEFORE_ACTION; + + if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] ) + { + int yyl; + for ( yyl = 0; yyl < yyleng; ++yyl ) + if ( yytext[yyl] == '\n' ) + + do{ yylineno++; + yycolumn=0; + }while(0) +; + } + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = yyg->yy_hold_char; + yy_cp = yyg->yy_last_accepting_cpos; + yy_current_state = yyg->yy_last_accepting_state; + goto yy_find_action; + +case 1: +YY_RULE_SETUP +{ + return T_FOR; +} + YY_BREAK +case 2: +YY_RULE_SETUP +{ + return T_LET; +} + YY_BREAK +case 3: +YY_RULE_SETUP +{ + return T_FILTER; +} + YY_BREAK +case 4: +YY_RULE_SETUP +{ + return T_RETURN; +} + YY_BREAK +case 5: +YY_RULE_SETUP +{ + return T_COLLECT; +} + YY_BREAK +case 6: +YY_RULE_SETUP +{ + return T_SORT; +} + YY_BREAK +case 7: +YY_RULE_SETUP +{ + return T_LIMIT; +} + YY_BREAK +case 8: +YY_RULE_SETUP +{ + return T_ASC; +} + YY_BREAK +case 9: +YY_RULE_SETUP +{ + return T_DESC; +} + YY_BREAK +case 10: +YY_RULE_SETUP +{ + return T_IN; +} + YY_BREAK +case 11: +YY_RULE_SETUP +{ + return T_INTO; +} + YY_BREAK +case 12: +YY_RULE_SETUP +{ + return T_WITH; +} + YY_BREAK +case 13: +YY_RULE_SETUP +{ + return T_REMOVE; +} + YY_BREAK +case 14: +YY_RULE_SETUP +{ + return T_INSERT; +} + YY_BREAK +case 15: +YY_RULE_SETUP +{ + return T_UPDATE; +} + YY_BREAK +case 16: +YY_RULE_SETUP +{ + return T_REPLACE; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * predefined type literals + * --------------------------------------------------------------------------- */ +case 17: +YY_RULE_SETUP +{ + return T_NULL; +} + YY_BREAK +case 18: +YY_RULE_SETUP +{ + return T_TRUE; +} + YY_BREAK +case 19: +YY_RULE_SETUP +{ + return T_FALSE; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * operators + * --------------------------------------------------------------------------- */ +case 20: +YY_RULE_SETUP +{ + return T_EQ; +} + YY_BREAK +case 21: +YY_RULE_SETUP +{ + return T_NE; +} + YY_BREAK +case 22: +YY_RULE_SETUP +{ + return T_GE; +} + YY_BREAK +case 23: +YY_RULE_SETUP +{ + return T_GT; +} + YY_BREAK +case 24: +YY_RULE_SETUP +{ + return T_LE; +} + YY_BREAK +case 25: +YY_RULE_SETUP +{ + return T_LT; +} + YY_BREAK +case 26: +YY_RULE_SETUP +{ + return T_ASSIGN; +} + YY_BREAK +case 27: +YY_RULE_SETUP +{ + return T_NOT; +} + YY_BREAK +case 28: +YY_RULE_SETUP +{ + return T_AND; +} + YY_BREAK +case 29: +YY_RULE_SETUP +{ + return T_OR; +} + YY_BREAK +case 30: +YY_RULE_SETUP +{ + return T_PLUS; +} + YY_BREAK +case 31: +YY_RULE_SETUP +{ + return T_MINUS; +} + YY_BREAK +case 32: +YY_RULE_SETUP +{ + return T_TIMES; +} + YY_BREAK +case 33: +YY_RULE_SETUP +{ + return T_DIV; +} + YY_BREAK +case 34: +YY_RULE_SETUP +{ + return T_MOD; +} + YY_BREAK +case 35: +YY_RULE_SETUP +{ + return T_QUESTION; +} + YY_BREAK +case 36: +YY_RULE_SETUP +{ + return T_SCOPE; +} + YY_BREAK +case 37: +YY_RULE_SETUP +{ + return T_COLON; +} + YY_BREAK +case 38: +YY_RULE_SETUP +{ + return T_EXPAND; +} + YY_BREAK +case 39: +YY_RULE_SETUP +{ + return T_RANGE; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * punctuation + * --------------------------------------------------------------------------- */ +case 40: +YY_RULE_SETUP +{ + return T_COMMA; +} + YY_BREAK +case 41: +YY_RULE_SETUP +{ + return T_OPEN; +} + YY_BREAK +case 42: +YY_RULE_SETUP +{ + return T_CLOSE; +} + YY_BREAK +case 43: +YY_RULE_SETUP +{ + return T_DOC_OPEN; +} + YY_BREAK +case 44: +YY_RULE_SETUP +{ + return T_DOC_CLOSE; +} + YY_BREAK +case 45: +YY_RULE_SETUP +{ + return T_LIST_OPEN; +} + YY_BREAK +case 46: +YY_RULE_SETUP +{ + return T_LIST_CLOSE; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * literals + * --------------------------------------------------------------------------- */ +case 47: +YY_RULE_SETUP +{ + /* unquoted string */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_STRING; +} + YY_BREAK +case 48: +YY_RULE_SETUP +{ + /* string enclosed in backticks */ + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(BACKTICK); +} + YY_BREAK +case 49: +YY_RULE_SETUP +{ + /* end of backtick-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_STRING; +} + YY_BREAK +case 50: +YY_RULE_SETUP +{ + /* character escaped by backslash */ + BEGIN(BACKTICK); +} + YY_BREAK +case 51: +/* rule 51 can match eol */ +YY_RULE_SETUP +{ + /* newline character inside backtick */ + BEGIN(BACKTICK); +} + YY_BREAK +case 52: +YY_RULE_SETUP +{ + /* any character (except newline) inside backtick */ + BEGIN(BACKTICK); +} + YY_BREAK +case 53: +YY_RULE_SETUP +{ + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(DOUBLE_QUOTE); +} + YY_BREAK +case 54: +YY_RULE_SETUP +{ + /* end of quote-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_QUOTED_STRING; +} + YY_BREAK +case 55: +YY_RULE_SETUP +{ + /* character escaped by backslash */ + BEGIN(DOUBLE_QUOTE); +} + YY_BREAK +case 56: +/* rule 56 can match eol */ +YY_RULE_SETUP +{ + /* newline character inside quote */ + BEGIN(DOUBLE_QUOTE); +} + YY_BREAK +case 57: +YY_RULE_SETUP +{ + /* any character (except newline) inside quote */ + BEGIN(DOUBLE_QUOTE); +} + YY_BREAK +case 58: +YY_RULE_SETUP +{ + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(SINGLE_QUOTE); +} + YY_BREAK +case 59: +YY_RULE_SETUP +{ + /* end of quote-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_QUOTED_STRING; +} + YY_BREAK +case 60: +YY_RULE_SETUP +{ + /* character escaped by backslash */ + BEGIN(SINGLE_QUOTE); +} + YY_BREAK +case 61: +/* rule 61 can match eol */ +YY_RULE_SETUP +{ + /* newline character inside quote */ + BEGIN(SINGLE_QUOTE); +} + YY_BREAK +case 62: +YY_RULE_SETUP +{ + /* any character (except newline) inside quote */ + BEGIN(SINGLE_QUOTE); +} + YY_BREAK +case 63: +YY_RULE_SETUP +{ + /* a numeric integer value */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_INTEGER; +} + YY_BREAK +case 64: +YY_RULE_SETUP +{ + /* a numeric double value */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_DOUBLE; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * bind parameters + * --------------------------------------------------------------------------- */ +case 65: +YY_RULE_SETUP +{ + /* bind parameters must start with a @ + if followed by another @, this is a collection name parameter */ + yylval->strval = yyextra->registerString(yytext + 1, yyleng - 1, false); + return T_PARAMETER; +} + YY_BREAK +/* --------------------------------------------------------------------------- + * whitespace etc. + * --------------------------------------------------------------------------- */ +case 66: +/* rule 66 can match eol */ +YY_RULE_SETUP +{ + /* whitespace is ignored */ +} + YY_BREAK +case 67: +YY_RULE_SETUP +{ + BEGIN(COMMENT_SINGLE); +} + YY_BREAK +case 68: +/* rule 68 can match eol */ +YY_RULE_SETUP +{ + yylineno++; + BEGIN(INITIAL); +} + YY_BREAK +case 69: +YY_RULE_SETUP +{ + yylineno++; + BEGIN(INITIAL); +} + YY_BREAK +case 70: +YY_RULE_SETUP +{ + // eat comment in chunks +} + YY_BREAK +case 71: +YY_RULE_SETUP +{ + BEGIN(COMMENT_MULTI); +} + YY_BREAK +case 72: +YY_RULE_SETUP +{ + BEGIN(INITIAL); +} + YY_BREAK +case 73: +YY_RULE_SETUP +{ + // eat comment in chunks +} + YY_BREAK +case 74: +YY_RULE_SETUP +{ + // eat the lone star +} + YY_BREAK +case 75: +/* rule 75 can match eol */ +YY_RULE_SETUP +{ + yylineno++; +} + YY_BREAK +case 76: +YY_RULE_SETUP +{ + yylineno++; +} + YY_BREAK +case 77: +YY_RULE_SETUP +{ + /* anything else is returned as it is */ + return (int) yytext[0]; +} + YY_BREAK +case 78: +YY_RULE_SETUP +ECHO; + YY_BREAK +case YY_STATE_EOF(INITIAL): +case YY_STATE_EOF(BACKTICK): +case YY_STATE_EOF(SINGLE_QUOTE): +case YY_STATE_EOF(DOUBLE_QUOTE): +case YY_STATE_EOF(COMMENT_SINGLE): +case YY_STATE_EOF(COMMENT_MULTI): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - yyg->yytext_ptr) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = yyg->yy_hold_char; + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * Aqllex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( yyg->yy_c_buf_p <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + yyg->yy_c_buf_p = yyg->yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( yyscanner ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state , yyscanner); + + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++yyg->yy_c_buf_p; + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = yyg->yy_last_accepting_cpos; + yy_current_state = yyg->yy_last_accepting_state; + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( yyscanner ) ) + { + case EOB_ACT_END_OF_FILE: + { + yyg->yy_did_buffer_switch_on_eof = 0; + + if ( Aqlwrap(yyscanner ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + yyg->yy_c_buf_p = yyg->yytext_ptr + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! yyg->yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + yyg->yy_c_buf_p = + yyg->yytext_ptr + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( yyscanner ); + + yy_cp = yyg->yy_c_buf_p; + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + yyg->yy_c_buf_p = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars]; + + yy_current_state = yy_get_previous_state( yyscanner ); + + yy_cp = yyg->yy_c_buf_p; + yy_bp = yyg->yytext_ptr + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ +} /* end of Aqllex */ + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +static int yy_get_next_buffer (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + char *source = yyg->yytext_ptr; + int number_to_move, i; + int ret_val; + + if ( yyg->yy_c_buf_p > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( yyg->yy_c_buf_p - yyg->yytext_ptr - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) (yyg->yy_c_buf_p - yyg->yytext_ptr) - 1; + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars = 0; + + else + { + yy_size_t num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE; + + int yy_c_buf_p_offset = + (int) (yyg->yy_c_buf_p - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + yy_size_t new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + Aqlrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ,yyscanner ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = 0; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + yyg->yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + yyg->yy_n_chars, num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + if ( yyg->yy_n_chars == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + Aqlrestart(yyin ,yyscanner); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if ((yy_size_t) (yyg->yy_n_chars + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + yy_size_t new_size = yyg->yy_n_chars + number_to_move + (yyg->yy_n_chars >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) Aqlrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ,yyscanner ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + } + + yyg->yy_n_chars += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; + + yyg->yytext_ptr = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + static yy_state_type yy_get_previous_state (yyscan_t yyscanner) +{ + yy_state_type yy_current_state; + char *yy_cp; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + yy_current_state = yyg->yy_start; + + for ( yy_cp = yyg->yytext_ptr + YY_MORE_ADJ; yy_cp < yyg->yy_c_buf_p; ++yy_cp ) + { + YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 180 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state , yyscan_t yyscanner) +{ + int yy_is_jam; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; /* This var may be unused depending upon options. */ + char *yy_cp = yyg->yy_c_buf_p; + + YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + yyg->yy_last_accepting_state = yy_current_state; + yyg->yy_last_accepting_cpos = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 180 ) + yy_c = yy_meta[(unsigned int) yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; + yy_is_jam = (yy_current_state == 179); + + (void)yyg; + return yy_is_jam ? 0 : yy_current_state; +} + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (yyscan_t yyscanner) +#else + static int input (yyscan_t yyscanner) +#endif + +{ + int c; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + *yyg->yy_c_buf_p = yyg->yy_hold_char; + + if ( *yyg->yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( yyg->yy_c_buf_p < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[yyg->yy_n_chars] ) + /* This was really a NUL. */ + *yyg->yy_c_buf_p = '\0'; + + else + { /* need more input */ + yy_size_t offset = yyg->yy_c_buf_p - yyg->yytext_ptr; + ++yyg->yy_c_buf_p; + + switch ( yy_get_next_buffer( yyscanner ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + Aqlrestart(yyin ,yyscanner); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( Aqlwrap(yyscanner ) ) + return EOF; + + if ( ! yyg->yy_did_buffer_switch_on_eof ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(yyscanner); +#else + return input(yyscanner); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + yyg->yy_c_buf_p = yyg->yytext_ptr + offset; + break; + } + } + } + + c = *(unsigned char *) yyg->yy_c_buf_p; /* cast for 8-bit char's */ + *yyg->yy_c_buf_p = '\0'; /* preserve yytext */ + yyg->yy_hold_char = *++yyg->yy_c_buf_p; + + if ( c == '\n' ) + + do{ yylineno++; + yycolumn=0; + }while(0) +; + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * @param yyscanner The scanner object. + * @note This function does not reset the start condition to @c INITIAL . + */ + void Aqlrestart (FILE * input_file , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if ( ! YY_CURRENT_BUFFER ){ + Aqlensure_buffer_stack (yyscanner); + YY_CURRENT_BUFFER_LVALUE = + Aql_create_buffer(yyin,YY_BUF_SIZE ,yyscanner); + } + + Aql_init_buffer(YY_CURRENT_BUFFER,input_file ,yyscanner); + Aql_load_buffer_state(yyscanner ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * @param yyscanner The scanner object. + */ + void Aql_switch_to_buffer (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* TODO. We should be able to replace this entire function body + * with + * Aqlpop_buffer_state(); + * Aqlpush_buffer_state(new_buffer); + */ + Aqlensure_buffer_stack (yyscanner); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *yyg->yy_c_buf_p = yyg->yy_hold_char; + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + Aql_load_buffer_state(yyscanner ); + + /* We don't actually know whether we did this switch during + * EOF (Aqlwrap()) processing, but the only time this flag + * is looked at is after Aqlwrap() is called, so it's safe + * to go ahead and always set it. + */ + yyg->yy_did_buffer_switch_on_eof = 1; +} + +static void Aql_load_buffer_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyg->yy_n_chars = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + yyg->yytext_ptr = yyg->yy_c_buf_p = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + yyg->yy_hold_char = *yyg->yy_c_buf_p; +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * @param yyscanner The scanner object. + * @return the allocated buffer state. + */ + YY_BUFFER_STATE Aql_create_buffer (FILE * file, int size , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) Aqlalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in Aql_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) Aqlalloc(b->yy_buf_size + 2 ,yyscanner ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in Aql_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + Aql_init_buffer(b,file ,yyscanner); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with Aql_create_buffer() + * @param yyscanner The scanner object. + */ + void Aql_delete_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + Aqlfree((void *) b->yy_ch_buf ,yyscanner ); + + Aqlfree((void *) b ,yyscanner ); +} + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a Aqlrestart() or at EOF. + */ + static void Aql_init_buffer (YY_BUFFER_STATE b, FILE * file , yyscan_t yyscanner) + +{ + int oerrno = errno; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + Aql_flush_buffer(b ,yyscanner); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then Aql_init_buffer was _probably_ + * called from Aqlrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * @param yyscanner The scanner object. + */ + void Aql_flush_buffer (YY_BUFFER_STATE b , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + Aql_load_buffer_state(yyscanner ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * @param yyscanner The scanner object. + */ +void Aqlpush_buffer_state (YY_BUFFER_STATE new_buffer , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if (new_buffer == NULL) + return; + + Aqlensure_buffer_stack(yyscanner); + + /* This block is copied from Aql_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *yyg->yy_c_buf_p = yyg->yy_hold_char; + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = yyg->yy_c_buf_p; + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = yyg->yy_n_chars; + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + yyg->yy_buffer_stack_top++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from Aql_switch_to_buffer. */ + Aql_load_buffer_state(yyscanner ); + yyg->yy_did_buffer_switch_on_eof = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * @param yyscanner The scanner object. + */ +void Aqlpop_buffer_state (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + if (!YY_CURRENT_BUFFER) + return; + + Aql_delete_buffer(YY_CURRENT_BUFFER ,yyscanner); + YY_CURRENT_BUFFER_LVALUE = NULL; + if (yyg->yy_buffer_stack_top > 0) + --yyg->yy_buffer_stack_top; + + if (YY_CURRENT_BUFFER) { + Aql_load_buffer_state(yyscanner ); + yyg->yy_did_buffer_switch_on_eof = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void Aqlensure_buffer_stack (yyscan_t yyscanner) +{ + yy_size_t num_to_alloc; + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (!yyg->yy_buffer_stack) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; + yyg->yy_buffer_stack = (struct yy_buffer_state**)Aqlalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + , yyscanner); + if ( ! yyg->yy_buffer_stack ) + YY_FATAL_ERROR( "out of dynamic memory in Aqlensure_buffer_stack()" ); + + memset(yyg->yy_buffer_stack, 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + yyg->yy_buffer_stack_max = num_to_alloc; + yyg->yy_buffer_stack_top = 0; + return; + } + + if (yyg->yy_buffer_stack_top >= (yyg->yy_buffer_stack_max) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + int grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = yyg->yy_buffer_stack_max + grow_size; + yyg->yy_buffer_stack = (struct yy_buffer_state**)Aqlrealloc + (yyg->yy_buffer_stack, + num_to_alloc * sizeof(struct yy_buffer_state*) + , yyscanner); + if ( ! yyg->yy_buffer_stack ) + YY_FATAL_ERROR( "out of dynamic memory in Aqlensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset(yyg->yy_buffer_stack + yyg->yy_buffer_stack_max, 0, grow_size * sizeof(struct yy_buffer_state*)); + yyg->yy_buffer_stack_max = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE Aql_scan_buffer (char * base, yy_size_t size , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return 0; + + b = (YY_BUFFER_STATE) Aqlalloc(sizeof( struct yy_buffer_state ) ,yyscanner ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in Aql_scan_buffer()" ); + + b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = 0; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + Aql_switch_to_buffer(b ,yyscanner ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to Aqllex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * Aql_scan_bytes() instead. + */ +YY_BUFFER_STATE Aql_scan_string (yyconst char * yystr , yyscan_t yyscanner) +{ + + return Aql_scan_bytes(yystr,strlen(yystr) ,yyscanner); +} + +/** Setup the input buffer state to scan the given bytes. The next call to Aqllex() will + * scan from a @e copy of @a bytes. + * @param yybytes the byte buffer to scan + * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. + * @param yyscanner The scanner object. + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE Aql_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len , yyscan_t yyscanner) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = _yybytes_len + 2; + buf = (char *) Aqlalloc(n ,yyscanner ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in Aql_scan_bytes()" ); + + for ( i = 0; i < (int) _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = Aql_scan_buffer(buf,n ,yyscanner); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in Aql_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yy_fatal_error (yyconst char* msg , yyscan_t yyscanner) +{ + (void) fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = yyg->yy_hold_char; \ + yyg->yy_c_buf_p = yytext + yyless_macro_arg; \ + yyg->yy_hold_char = *yyg->yy_c_buf_p; \ + *yyg->yy_c_buf_p = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the user-defined data for this scanner. + * @param yyscanner The scanner object. + */ +YY_EXTRA_TYPE Aqlget_extra (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyextra; +} + +/** Get the current line number. + * @param yyscanner The scanner object. + */ +int Aqlget_lineno (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (! YY_CURRENT_BUFFER) + return 0; + + return yylineno; +} + +/** Get the current column number. + * @param yyscanner The scanner object. + */ +int Aqlget_column (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + if (! YY_CURRENT_BUFFER) + return 0; + + return yycolumn; +} + +/** Get the input stream. + * @param yyscanner The scanner object. + */ +FILE *Aqlget_in (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyin; +} + +/** Get the output stream. + * @param yyscanner The scanner object. + */ +FILE *Aqlget_out (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyout; +} + +/** Get the length of the current token. + * @param yyscanner The scanner object. + */ +yy_size_t Aqlget_leng (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yyleng; +} + +/** Get the current token. + * @param yyscanner The scanner object. + */ + +char *Aqlget_text (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yytext; +} + +/** Set the user-defined data. This data is never touched by the scanner. + * @param user_defined The data to be associated with this scanner. + * @param yyscanner The scanner object. + */ +void Aqlset_extra (YY_EXTRA_TYPE user_defined , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyextra = user_defined ; +} + +/** Set the current line number. + * @param line_number + * @param yyscanner The scanner object. + */ +void Aqlset_lineno (int line_number , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* lineno is only valid if an input buffer exists. */ + if (! YY_CURRENT_BUFFER ) + YY_FATAL_ERROR( "Aqlset_lineno called with no buffer" ); + + yylineno = line_number; +} + +/** Set the current column. + * @param line_number + * @param yyscanner The scanner object. + */ +void Aqlset_column (int column_no , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* column is only valid if an input buffer exists. */ + if (! YY_CURRENT_BUFFER ) + YY_FATAL_ERROR( "Aqlset_column called with no buffer" ); + + yycolumn = column_no; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param in_str A readable stream. + * @param yyscanner The scanner object. + * @see Aql_switch_to_buffer + */ +void Aqlset_in (FILE * in_str , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyin = in_str ; +} + +void Aqlset_out (FILE * out_str , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yyout = out_str ; +} + +int Aqlget_debug (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yy_flex_debug; +} + +void Aqlset_debug (int bdebug , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yy_flex_debug = bdebug ; +} + +/* Accessor methods for yylval and yylloc */ + +YYSTYPE * Aqlget_lval (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yylval; +} + +void Aqlset_lval (YYSTYPE * yylval_param , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yylval = yylval_param; +} + +YYLTYPE *Aqlget_lloc (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + return yylloc; +} + +void Aqlset_lloc (YYLTYPE * yylloc_param , yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + yylloc = yylloc_param; +} + +/* User-visible API */ + +/* Aqllex_init is special because it creates the scanner itself, so it is + * the ONLY reentrant function that doesn't take the scanner as the last argument. + * That's why we explicitly handle the declaration, instead of using our macros. + */ + +int Aqllex_init(yyscan_t* ptr_yy_globals) + +{ + if (ptr_yy_globals == NULL){ + errno = EINVAL; + return 1; + } + + *ptr_yy_globals = (yyscan_t) Aqlalloc ( sizeof( struct yyguts_t ), NULL ); + + if (*ptr_yy_globals == NULL){ + errno = ENOMEM; + return 1; + } + + /* By setting to 0xAA, we expose bugs in yy_init_globals. Leave at 0x00 for releases. */ + memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); + + return yy_init_globals ( *ptr_yy_globals ); +} + +/* Aqllex_init_extra has the same functionality as Aqllex_init, but follows the + * convention of taking the scanner as the last argument. Note however, that + * this is a *pointer* to a scanner, as it will be allocated by this call (and + * is the reason, too, why this function also must handle its own declaration). + * The user defined value in the first argument will be available to Aqlalloc in + * the yyextra field. + */ + +int Aqllex_init_extra(YY_EXTRA_TYPE yy_user_defined,yyscan_t* ptr_yy_globals ) + +{ + struct yyguts_t dummy_yyguts; + + Aqlset_extra (yy_user_defined, &dummy_yyguts); + + if (ptr_yy_globals == NULL){ + errno = EINVAL; + return 1; + } + + *ptr_yy_globals = (yyscan_t) Aqlalloc ( sizeof( struct yyguts_t ), &dummy_yyguts ); + + if (*ptr_yy_globals == NULL){ + errno = ENOMEM; + return 1; + } + + /* By setting to 0xAA, we expose bugs in + yy_init_globals. Leave at 0x00 for releases. */ + memset(*ptr_yy_globals,0x00,sizeof(struct yyguts_t)); + + Aqlset_extra (yy_user_defined, *ptr_yy_globals); + + return yy_init_globals ( *ptr_yy_globals ); +} + +static int yy_init_globals (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from Aqllex_destroy(), so don't allocate here. + */ + + yyg->yy_buffer_stack = 0; + yyg->yy_buffer_stack_top = 0; + yyg->yy_buffer_stack_max = 0; + yyg->yy_c_buf_p = (char *) 0; + yyg->yy_init = 0; + yyg->yy_start = 0; + + yyg->yy_start_stack_ptr = 0; + yyg->yy_start_stack_depth = 0; + yyg->yy_start_stack = NULL; + +/* Defined in main.c */ +#ifdef YY_STDINIT + yyin = stdin; + yyout = stdout; +#else + yyin = (FILE *) 0; + yyout = (FILE *) 0; +#endif + + /* For future reference: Set errno on error, since we are called by + * Aqllex_init() + */ + return 0; +} + +/* Aqllex_destroy is for both reentrant and non-reentrant scanners. */ +int Aqllex_destroy (yyscan_t yyscanner) +{ + struct yyguts_t * yyg = (struct yyguts_t*)yyscanner; + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + Aql_delete_buffer(YY_CURRENT_BUFFER ,yyscanner ); + YY_CURRENT_BUFFER_LVALUE = NULL; + Aqlpop_buffer_state(yyscanner); + } + + /* Destroy the stack itself. */ + Aqlfree(yyg->yy_buffer_stack ,yyscanner); + yyg->yy_buffer_stack = NULL; + + /* Destroy the start condition stack. */ + Aqlfree(yyg->yy_start_stack ,yyscanner ); + yyg->yy_start_stack = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * Aqllex() is called, initialization will occur. */ + yy_init_globals( yyscanner); + + /* Destroy the main struct (reentrant only). */ + Aqlfree ( yyscanner , yyscanner ); + yyscanner = NULL; + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, yyconst char * s2, int n , yyscan_t yyscanner) +{ + int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (yyconst char * s , yyscan_t yyscanner) +{ + int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *Aqlalloc (yy_size_t size , yyscan_t yyscanner) +{ + return (void *) malloc( size ); +} + +void *Aqlrealloc (void * ptr, yy_size_t size , yyscan_t yyscanner) +{ + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return (void *) realloc( (char *) ptr, size ); +} + +void Aqlfree (void * ptr , yyscan_t yyscanner) +{ + free( (char *) ptr ); /* see Aqlrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + diff --git a/arangod/Aql/tokens.ll b/arangod/Aql/tokens.ll new file mode 100644 index 0000000000..59cd24194d --- /dev/null +++ b/arangod/Aql/tokens.ll @@ -0,0 +1,427 @@ + +%option reentrant +%option 8bit +%option prefix="Aql" +%option bison-locations +%option bison-bridge +%option yylineno +%option noyywrap nounput batch +%x BACKTICK +%x SINGLE_QUOTE +%x DOUBLE_QUOTE +%x COMMENT_SINGLE +%x COMMENT_MULTI + +%{ +#include "Basics/Common.h" + +// introduce the namespace here, otherwise following references to +// the namespace in auto-generated headers might fail + +namespace triagens { + namespace aql { + class Query; + class Parser; + } +} + + +#include "Aql/grammar.h" +#include "Aql/Parser.h" + +#define YY_EXTRA_TYPE triagens::aql::Parser* + +#define YY_USER_ACTION yylloc->first_line = yylineno; yylloc->first_column = yycolumn; yylloc->last_column = (int) (yycolumn + yyleng - 1); yycolumn += (int) yyleng; yyextra->increaseOffset(yyleng); + +#define YY_NO_INPUT 1 + +#define YY_INPUT(resultBuffer, resultState, maxBytesToRead) { \ + size_t length = yyextra->remainingLength(); \ + if (length > maxBytesToRead) { \ + length = maxBytesToRead; \ + } \ + if (length > 0) { \ + yyextra->fillBuffer(resultBuffer, length); \ + resultState = length; \ + } \ + else { \ + resultState = YY_NULL; \ + } \ +} +%} + +%% + + /* --------------------------------------------------------------------------- + * language keywords + * --------------------------------------------------------------------------- */ + +(?i:FOR) { + return T_FOR; +} + +(?i:LET) { + return T_LET; +} + +(?i:FILTER) { + return T_FILTER; +} + +(?i:RETURN) { + return T_RETURN; +} + +(?i:COLLECT) { + return T_COLLECT; +} + +(?i:SORT) { + return T_SORT; +} + +(?i:LIMIT) { + return T_LIMIT; +} + +(?i:ASC) { + return T_ASC; +} + +(?i:DESC) { + return T_DESC; +} + +(?i:IN) { + return T_IN; +} + +(?i:INTO) { + return T_INTO; +} + +(?i:WITH) { + return T_WITH; +} + +(?i:REMOVE) { + return T_REMOVE; +} + +(?i:INSERT) { + return T_INSERT; +} + +(?i:UPDATE) { + return T_UPDATE; +} + +(?i:REPLACE) { + return T_REPLACE; +} + + /* --------------------------------------------------------------------------- + * predefined type literals + * --------------------------------------------------------------------------- */ + +(?i:NULL) { + return T_NULL; +} + +(?i:TRUE) { + return T_TRUE; +} + +(?i:FALSE) { + return T_FALSE; +} + + /* --------------------------------------------------------------------------- + * operators + * --------------------------------------------------------------------------- */ + +"==" { + return T_EQ; +} + +"!=" { + return T_NE; +} + +">=" { + return T_GE; +} + +">" { + return T_GT; +} + +"<=" { + return T_LE; +} + +"<" { + return T_LT; +} + +"=" { + return T_ASSIGN; +} + +"!" { + return T_NOT; +} + +"&&" { + return T_AND; +} + +"||" { + return T_OR; +} + +"+" { + return T_PLUS; +} + +"-" { + return T_MINUS; +} + +"*" { + return T_TIMES; +} + +"/" { + return T_DIV; +} + +"%" { + return T_MOD; +} + +"?" { + return T_QUESTION; +} + +"::" { + return T_SCOPE; +} + +":" { + return T_COLON; +} + +"[*]" { + return T_EXPAND; +} + +".." { + return T_RANGE; +} + + /* --------------------------------------------------------------------------- + * punctuation + * --------------------------------------------------------------------------- */ + +"," { + return T_COMMA; +} + +"(" { + return T_OPEN; +} + +")" { + return T_CLOSE; +} + +"{" { + return T_DOC_OPEN; +} + +"}" { + return T_DOC_CLOSE; +} + +"[" { + return T_LIST_OPEN; +} + +"]" { + return T_LIST_CLOSE; +} + + /* --------------------------------------------------------------------------- + * literals + * --------------------------------------------------------------------------- */ + +([a-zA-Z][_a-zA-Z0-9]*|_+[a-zA-Z]+[_a-zA-Z0-9]*) { + /* unquoted string */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_STRING; +} + +` { + /* string enclosed in backticks */ + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(BACKTICK); +} + +` { + /* end of backtick-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_STRING; +} + +\\. { + /* character escaped by backslash */ + BEGIN(BACKTICK); +} + +\n { + /* newline character inside backtick */ + BEGIN(BACKTICK); +} + +. { + /* any character (except newline) inside backtick */ + BEGIN(BACKTICK); +} + +\" { + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(DOUBLE_QUOTE); +} + +\" { + /* end of quote-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_QUOTED_STRING; +} + +\\. { + /* character escaped by backslash */ + BEGIN(DOUBLE_QUOTE); +} + +\n { + /* newline character inside quote */ + BEGIN(DOUBLE_QUOTE); +} + +. { + /* any character (except newline) inside quote */ + BEGIN(DOUBLE_QUOTE); +} + +' { + yyextra->marker(yyextra->queryString() + yyextra->offset()); + BEGIN(SINGLE_QUOTE); +} + +' { + /* end of quote-enclosed string */ + BEGIN(INITIAL); + yylval->strval = yyextra->registerString(yyextra->marker(), yyextra->offset() - (yyextra->marker() - yyextra->queryString()) - 1, true); + return T_QUOTED_STRING; +} + +\\. { + /* character escaped by backslash */ + BEGIN(SINGLE_QUOTE); +} + +\n { + /* newline character inside quote */ + BEGIN(SINGLE_QUOTE); +} + +. { + /* any character (except newline) inside quote */ + BEGIN(SINGLE_QUOTE); +} + +(0|[1-9][0-9]*) { + /* a numeric integer value */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_INTEGER; +} + +(0|[1-9][0-9]*)(\.[0-9]+([eE]([\-\+])?[0-9]+)?) { + /* a numeric double value */ + yylval->strval = yyextra->registerString(yytext, yyleng, false); + return T_DOUBLE; +} + + /* --------------------------------------------------------------------------- + * bind parameters + * --------------------------------------------------------------------------- */ + +@@?[a-zA-Z0-9][a-zA-Z0-9_]* { + /* bind parameters must start with a @ + if followed by another @, this is a collection name parameter */ + yylval->strval = yyextra->registerString(yytext + 1, yyleng - 1, false); + return T_PARAMETER; +} + + /* --------------------------------------------------------------------------- + * whitespace etc. + * --------------------------------------------------------------------------- */ + +[ \t\r\n]+ { + /* whitespace is ignored */ +} + +"//" { + BEGIN(COMMENT_SINGLE); +} + +\r?\n { + yylineno++; + BEGIN(INITIAL); +} + +\r { + yylineno++; + BEGIN(INITIAL); +} + +[^*\r\n]+ { + // eat comment in chunks +} + +"/*" { + BEGIN(COMMENT_MULTI); +} + +"*/" { + BEGIN(INITIAL); +} + +[^*\r\n]+ { + // eat comment in chunks +} + +"*" { + // eat the lone star +} + +\r?\n { + yylineno++; +} + +\r { + yylineno++; +} + + +. { + /* anything else is returned as it is */ + return (int) yytext[0]; +} + +%% + diff --git a/arangod/CMakeLists.txt b/arangod/CMakeLists.txt index a072378c3b..8d9e2481ab 100644 --- a/arangod/CMakeLists.txt +++ b/arangod/CMakeLists.txt @@ -58,9 +58,11 @@ add_executable( Ahuacatl/ahuacatl-tokens.cpp Ahuacatl/ahuacatl-variable.cpp Aql/ExecutionPlan.cpp + Aql/grammar.cpp Aql/Parser.cpp Aql/Query.cpp Aql/QueryError.cpp + Aql/tokens.cpp BitIndexes/bitarray.cpp BitIndexes/bitarrayIndex.cpp CapConstraint/cap-constraint.cpp diff --git a/arangod/Makefile.files b/arangod/Makefile.files index 3b716106c8..4586b114b3 100644 --- a/arangod/Makefile.files +++ b/arangod/Makefile.files @@ -39,13 +39,15 @@ arangod_libarangod_a_SOURCES = \ arangod/Ahuacatl/ahuacatl-tokens.cpp \ arangod/Ahuacatl/ahuacatl-variable.cpp \ arangod/Aql/ExecutionPlan.cpp \ + arangod/Aql/grammar.cpp \ arangod/Aql/Parser.cpp \ arangod/Aql/Query.cpp \ arangod/Aql/QueryError.cpp \ + arangod/Aql/tokens.cpp \ arangod/BitIndexes/bitarray.cpp \ arangod/BitIndexes/bitarrayIndex.cpp \ arangod/CapConstraint/cap-constraint.cpp \ - arangod/Cluster/AgencyComm.cpp \ + arangod/Cluster/AgencyComm.cpp \ arangod/Cluster/ApplicationCluster.cpp \ arangod/Cluster/ClusterComm.cpp \ arangod/Cluster/ClusterInfo.cpp \ @@ -166,20 +168,25 @@ endif ################################################################################ FLEXXX_FILES += \ - arangod/Ahuacatl/ahuacatl-tokens.cpp + arangod/Ahuacatl/ahuacatl-tokens.cpp \ + arangod/Aql/tokens.cpp ################################################################################ ### @brief bison ################################################################################ BISON_FILES += \ - arangod/Ahuacatl/ahuacatl-grammar.cpp + arangod/Ahuacatl/ahuacatl-grammar.cpp \ + arangod/Aql/grammar.cpp if ENABLE_MAINTAINER_MODE CLEANUP += \ arangod/Ahuacatl/ahuacatl-grammar.h \ - arangod/Ahuacatl/ahuacatl-grammar.cpp + arangod/Ahuacatl/ahuacatl-grammar.cpp \ + arangod/Aql/grammar.h \ + arangod/Aql/grammar.cpp + endif ################################################################################