diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt index d9ef0526..1b43329c 100644 --- a/src/CMakeLists.txt +++ b/src/CMakeLists.txt @@ -1,467 +1,473 @@ # Private options (visible only within KDb) simple_option(KDB_EXPRESSION_DEBUG "Debugging of Expression classes" OFF) simple_option(KDB_DRIVERMANAGER_DEBUG "Debugging of the Driver Manager class" OFF) simple_option(KDB_TRANSACTIONS_DEBUG "Debugging of the Transaction class" OFF) simple_option(KDB_TABLESCHEMACHANGELISTENER_DEBUG "Debugging of the KDbTableSchemaChangeListener class" OFF) +simple_option(KDB_QUERYSCHEMA_DEBUG "Debugging of the QuerySchema class" OFF) +simple_option(KDB_SQLPARSER_DEBUG "Debugging of the SQL parser" OFF) # Public options (affecting public behavior or contents of KDb) simple_option(KDB_DEBUG_GUI "GUI for debugging" OFF) # NOTE: always add public options to KDbConfig.cmake.in as well include(CheckIncludeFile) check_include_file(unistd.h HAVE_UNISTD_H) #add_definitions( # TODO -DKDE_DEFAULT_DEBUG_AREA=44000 #) ########### generate parser/lexer files ############### # as described at https://public.kitware.com/pipermail/cmake/2002-September/003028.html # Create target for the parser add_custom_target(parser echo "Creating parser/lexer files") set(PARSER_SOURCE_DIR ${CMAKE_CURRENT_SOURCE_DIR}/parser) # Create custom command for flex/lex (note the outputs) # TODO(GEN) uncomment GENERATED if we ever use this patch: https://phabricator.kde.org/D357 "No more generated parser/scanner files in the source dir" add_custom_command( TARGET parser COMMAND ${PARSER_SOURCE_DIR}/generate_parser_code.sh DEPENDS ${PARSER_SOURCE_DIR}/KDbSqlParser.y ${PARSER_SOURCE_DIR}/KDbSqlScanner.l ${PARSER_SOURCE_DIR}/generate_parser_code.sh OUTPUT #TODO(GEN) ${PARSER_SOURCE_DIR}/generated/sqlparser.h #TODO(GEN) ${PARSER_SOURCE_DIR}/generated/sqlparser.cpp #TODO(GEN) ${PARSER_SOURCE_DIR}/generated/sqlscanner.cpp #TODO(GEN) ${PARSER_SOURCE_DIR}/generated/KDbToken.h #TODO(GEN) ${PARSER_SOURCE_DIR}/generated/KDbToken.cpp ) string(TOLOWER "${CMAKE_BUILD_TYPE}" CMAKE_BUILD_TYPE_LOWER) if("${CMAKE_BUILD_TYPE_LOWER}" MATCHES "debug") add_definitions(-DYYDEBUG=1) # needed where sqlparser.h is used endif() if(NOT HAVE_UNISTD_H) set(EXTRA_SCANNER_COMPILE_FLAGS "-DYY_NO_UNISTD_H=1") endif() if(CMAKE_COMPILER_IS_GNUCC OR CMAKE_COMPILER_IS_CLANG) set(EXTRA_SCANNER_COMPILE_FLAGS "${EXTRA_SCANNER_COMPILE_FLAGS} -Wno-sign-compare -Wno-unused-function -Wno-deprecated-register -Wno-zero-as-null-pointer-constant") elseif(MSVC) set(EXTRA_SCANNER_COMPILE_FLAGS "${EXTRA_SCANNER_COMPILE_FLAGS} /wd4018") # disable warning C4018: '<' : signed/unsigned mismatch endif() # Mark files as generated, set compile flags set_source_files_properties(${PARSER_SOURCE_DIR}/generated/sqlparser.cpp PROPERTIES #TODO(GEN) GENERATED TRUE SKIP_AUTOMOC ON # YYERROR_VERBOSE=1 needed to get a token table for tokenName() even for release builds COMPILE_FLAGS "-DYYERROR_VERBOSE=1 ${EXTRA_PARSER_COMPILE_FLAGS} " ) # TODO(GEN) set_source_files_properties(${PARSER_SOURCE_DIR}/generated/sqlparser.h PROPERTIES GENERATED TRUE) # TODO(GEN) set_source_files_properties(${PARSER_SOURCE_DIR}/generated/KDbToken.h PROPERTIES GENERATED TRUE) set_source_files_properties(${CMAKE_CURRENT_BINARY_DIR}/KDbConnectionData_sdc.cpp PROPERTIES GENERATED TRUE SKIP_AUTOMOC ON ) set_source_files_properties( ${PARSER_SOURCE_DIR}/generated/sqlscanner.cpp PROPERTIES #TODO(GEN) GENERATED TRUE SKIP_AUTOMOC ON COMPILE_FLAGS "${EXTRA_SCANNER_COMPILE_FLAGS} " ) set(kdb_LIB_SRCS parser/generated/sqlscanner.cpp parser/generated/sqlparser.cpp parser/generated/KDbToken.cpp parser/KDbParser.cpp parser/KDbParser_p.cpp parser/KDbSqlParser.y parser/KDbSqlScanner.l parser/generate_parser_code.sh parser/extract_tokens.sh parser/TODO tools/KDbJsonTrader_p.cpp # mostly copied from KReport's KReportJsonTrader_p.cpp tools/KDbValidator.cpp tools/KDbFieldValidator.cpp tools/KDbLongLongValidator.cpp tools/KDbObjectNameValidator.cpp tools/KDbIdentifierValidator.cpp tools/KDbUtils.cpp #TODO tools/debuggui.cpp #TODO tools/KDbSimpleCommandLineApp.cpp tools/transliteration/transliteration_table.cpp tools/transliteration/generate_transliteration_table.sh tools/transliteration/transliteration_table.readme KDbEscapedString.cpp KDbResult.cpp KDbQueryAsterisk.cpp KDbConnectionData.cpp KDbVersionInfo.cpp ${CMAKE_CURRENT_BINARY_DIR}/KDbConnectionData_sdc.cpp KDbField.cpp KDbQuerySchemaParameter.cpp expression/KDbExpression.cpp expression/KDbNArgExpression.cpp expression/KDbUnaryExpression.cpp expression/KDbBinaryExpression.cpp expression/KDbConstExpression.cpp expression/KDbQueryParameterExpression.cpp expression/KDbVariableExpression.cpp expression/KDbFunctionExpression.cpp KDbFieldList.cpp KDbTableSchema.cpp KDbTableSchemaChangeListener.cpp KDbIndexSchema.cpp KDbOrderByColumn.cpp KDbQuerySchema.cpp KDbQuerySchema_p.cpp KDbQueryColumnInfo.cpp KDbTableOrQuerySchema.cpp KDbDriverManager.cpp KDbDriver.cpp KDbDriver_p.cpp KDbDriverMetaData.cpp KDbConnection.cpp KDbConnectionProxy.cpp generated/sqlkeywords.cpp KDbObject.cpp KDb.cpp KDbRecordData.cpp KDbCursor.cpp KDbTransaction.cpp KDbGlobal.cpp KDbRelationship.cpp KDbRecordEditBuffer.cpp KDbMessageHandler.cpp KDbPreparedStatement.cpp KDbProperties.cpp KDbAdmin.cpp KDbLookupFieldSchema.cpp KDbAlter.cpp KDbNativeStatementBuilder.cpp kdb_debug.cpp views/KDbTableViewData.cpp views/KDbTableViewColumn.cpp views/chartable.txt sql/KDbSqlField.cpp sql/KDbSqlRecord.cpp sql/KDbSqlResult.cpp # private: tools/KDbUtils_p.h # non-source: Mainpage.dox Messages.sh ) ecm_create_qm_loader(kdb_LIB_SRCS kdb_qt) add_library(KDb SHARED ${kdb_LIB_SRCS}) set_coinstallable_lib_version(KDb) kdb_create_shared_data_classes( kdb_GENERATED_SHARED_DATA_CLASS_HEADERS # output variable with list of headers NO_PREFIX # subdirectory in which the headers should be generated KDbConnectionData.shared.h KDbObject.shared.h KDbQuerySchemaParameter.shared.h KDbResult.shared.h KDbSelectStatementOptions.shared.h KDbVersionInfo.shared.h ) kdb_remove_extensions( kdb_GENERATED_SHARED_DATA_CLASS_BASENAMES ${kdb_GENERATED_SHARED_DATA_CLASS_HEADERS} ) #message(STATUS "kdb_GENERATED_SHARED_DATA_CLASS_HEADERS: ${kdb_GENERATED_SHARED_DATA_CLASS_HEADERS}") #add_dependencies(KDb _shared_classes) # generate shared classes before they can be used in KDb generate_export_header(KDb) set(kdb_INCLUDE_DIRS ${CMAKE_CURRENT_SOURCE_DIR} ${CMAKE_CURRENT_SOURCE_DIR}/expression ${CMAKE_CURRENT_SOURCE_DIR}/interfaces ${CMAKE_CURRENT_SOURCE_DIR}/parser ${CMAKE_CURRENT_SOURCE_DIR}/parser/generated ${CMAKE_CURRENT_SOURCE_DIR}/sql ${CMAKE_CURRENT_SOURCE_DIR}/tools ${CMAKE_CURRENT_SOURCE_DIR}/views ) target_include_directories(KDb PUBLIC "$" INTERFACE "$" PRIVATE ${ICU_INCLUDE_DIRS} ) target_link_libraries(KDb PUBLIC Qt5::Core Qt5::Gui Qt5::Widgets KF5::CoreAddons PRIVATE Qt5::Xml ${ICU_I18N_LIBRARY} ) if(BUILD_TEST_COVERAGE) target_link_libraries(KDb PRIVATE gcov ) endif() # Create a Config.cmake and a ConfigVersion.cmake file and install them set(CMAKECONFIG_INSTALL_DIR "${CMAKECONFIG_INSTALL_PREFIX}/${KDB_BASE_NAME}") ecm_setup_version(${PROJECT_VERSION} VARIABLE_PREFIX KDB SOVERSION ${PROJECT_VERSION_MAJOR}.${PROJECT_VERSION_MINOR} VERSION_HEADER "${CMAKE_CURRENT_BINARY_DIR}/kdb_version.h" PACKAGE_VERSION_FILE "${CMAKE_CURRENT_BINARY_DIR}/KDbConfigVersion.cmake" ) install(TARGETS KDb EXPORT KDbTargets ${KDE_INSTALL_TARGETS_DEFAULT_ARGS}) configure_package_config_file( "${CMAKE_CURRENT_SOURCE_DIR}/KDbConfig.cmake.in" "${CMAKE_CURRENT_BINARY_DIR}/KDbConfig.cmake" INSTALL_DESTINATION "${CMAKECONFIG_INSTALL_DIR}" ) install(FILES "${CMAKE_CURRENT_BINARY_DIR}/KDbConfig.cmake" "${CMAKE_CURRENT_BINARY_DIR}/KDbConfigVersion.cmake" DESTINATION "${CMAKECONFIG_INSTALL_DIR}" COMPONENT Devel) install(EXPORT KDbTargets DESTINATION "${CMAKECONFIG_INSTALL_DIR}" FILE KDbTargets.cmake) ecm_generate_pri_file( BASE_NAME ${KDB_BASE_NAME} LIB_NAME ${KDB_BASE_NAME} DEPS "widgets xml" FILENAME_VAR PRI_FILENAME INCLUDE_INSTALL_DIR ${KDB_INCLUDE_INSTALL_DIR} ) install(FILES ${PRI_FILENAME} DESTINATION ${ECM_MKSPECS_INSTALL_DIR}) install(FILES "${CMAKE_CURRENT_BINARY_DIR}/kdb_version.h" DESTINATION "${KDB_INCLUDE_INSTALL_DIR}" COMPONENT Devel) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE HEADER_NAMES KDb KDbAdmin KDbAlter KDbQueryAsterisk KDbConnection KDbConnectionOptions KDbConnectionProxy KDbCursor KDbDriver KDbDriverBehavior KDbDriverManager KDbDriverMetaData KDbError KDbEscapedString KDbField KDbFieldList KDbGlobal KDbIndexSchema KDbLookupFieldSchema KDbMessageHandler KDbNativeStatementBuilder KDbPreparedStatement KDbProperties KDbQueryColumnInfo KDbOrderByColumn KDbQuerySchema KDbRecordData KDbRecordEditBuffer KDbRelationship KDbTableOrQuerySchema KDbTableSchema KDbTableSchemaChangeListener KDbTransaction KDbTransactionData KDbTransactionGuard ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE expression HEADER_NAMES KDbExpression KDbExpressionData ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE interfaces HEADER_NAMES KDbPreparedStatementInterface ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE parser HEADER_NAMES KDbParser ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE parser/generated HEADER_NAMES KDbToken ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE sql HEADER_NAMES KDbSqlField KDbSqlRecord KDbSqlResult KDbSqlString ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE views HEADER_NAMES KDbTableViewData KDbTableViewColumn ) ecm_generate_headers(kdb_FORWARDING_HEADERS REQUIRED_HEADERS kdb_HEADERS ORIGINAL CAMELCASE RELATIVE tools HEADER_NAMES KDbValidator KDbUtils KDbTristate #todo KDbSimpleCommandLineApp KDbLongLongValidator KDbIdentifierValidator KDbFieldValidator KDbObjectNameValidator ) #message(STATUS "%% ${kdb_GENERATED_SHARED_DATA_CLASS_BASENAMES}") ecm_generate_headers(kdb_FORWARDING_HEADERS_FROM_BUILDDIR REQUIRED_HEADERS kdb_HEADERS_FROM_BUILDDIR ORIGINAL CAMELCASE SOURCE_DIR ${PROJECT_BINARY_DIR}/src HEADER_NAMES ${kdb_GENERATED_SHARED_DATA_CLASS_BASENAMES} ) #message(STATUS "%%kdb_HEADERS_FROM_BUILDDIR ${kdb_HEADERS_FROM_BUILDDIR}") install( FILES ${kdb_HEADERS} ${kdb_HEADERS_FROM_BUILDDIR} DESTINATION ${KDB_INCLUDE_INSTALL_DIR} COMPONENT Devel ) install( FILES ${kdb_FORWARDING_HEADERS} ${kdb_FORWARDING_HEADERS_FROM_BUILDDIR} ${PROJECT_BINARY_DIR}/src/kdb_export.h ${PROJECT_BINARY_DIR}/src/config-kdb.h DESTINATION ${KDB_INCLUDE_INSTALL_DIR} COMPONENT Devel ) # KDb/Private includes # install( FILES # Connection_p.h # Driver_p.h # DESTINATION ${KDB_INCLUDE_INSTALL_DIR}/Private COMPONENT Devel # ) # KDb/Interfaces includes # install( FILES # Interfaces/KDbPreparedStatementInterface.h includes/KDb/Interfaces/KDbPreparedStatementInterface # DESTINATION ${KDB_INCLUDE_INSTALL_DIR}/Interfaces COMPONENT Devel # ) if(BUILD_QCH) kdb_add_qch( KDb_QCH NAME KDb BASE_NAME ${KDB_BASE_NAME} VERSION ${PROJECT_VERSION} NAMESPACE org.kde.${KDB_BASE_NAME} SOURCES Mainpage.dox ${kdb_HEADERS} ${kdb_HEADERS_FROM_BUILDDIR} LINK_QCHS Qt5Core_QCH Qt5Gui_QCH Qt5Widgets_QCH KF5CoreAddons_QCH BLANK_MACROS KDB_EXPORT KDB_DEPRECATED TAGFILE_INSTALL_DESTINATION ${KDB_QTQCH_FULL_INSTALL_DIR} QCH_INSTALL_DESTINATION ${KDB_QTQCH_FULL_INSTALL_DIR} ) set(kdb_qch_targets KDb_QCH) endif() kdb_install_qch_export( TARGETS ${kdb_qch_targets} FILE KDbQCHTargets.cmake ​ DESTINATION "${CMAKECONFIG_INSTALL_DIR}" ​ COMPONENT Devel ​) add_subdirectory(drivers) enable_testing() configure_file(config-kdb.h.cmake ${CMAKE_CURRENT_BINARY_DIR}/config-kdb.h) +configure_file(config-kdb-private.h.cmake ${CMAKE_CURRENT_BINARY_DIR}/config-kdb-private.h) +target_sources(KDb + PRIVATE ${PROJECT_BINARY_DIR}/src/config-kdb-private.h +) diff --git a/src/KDbQuerySchema.cpp b/src/KDbQuerySchema.cpp index 2a262cb7..8976994b 100644 --- a/src/KDbQuerySchema.cpp +++ b/src/KDbQuerySchema.cpp @@ -1,1388 +1,1395 @@ /* This file is part of the KDE project Copyright (C) 2003-2017 Jarosław Staniek This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, * Boston, MA 02110-1301, USA. */ #include "KDbQuerySchema.h" #include "KDbQuerySchema_p.h" #include "KDbQueryAsterisk.h" #include "KDbConnection.h" #include "KDbConnection_p.h" #include "kdb_debug.h" #include "KDbLookupFieldSchema.h" #include "KDbOrderByColumn.h" #include "KDbParser_p.h" #include "KDbQuerySchemaParameter.h" #include "KDbRelationship.h" QString escapeIdentifier(const QString& name, KDbConnection *conn, KDb::IdentifierEscapingType escapingType) { switch (escapingType) { case KDb::DriverEscaping: if (conn) return conn->escapeIdentifier(name); break; case KDb::KDbEscaping: return KDb::escapeIdentifier(name); } return QLatin1Char('"') + name + QLatin1Char('"'); } KDbQuerySchema::KDbQuerySchema() : KDbFieldList(false)//fields are not owned by KDbQuerySchema object , KDbObject(KDb::QueryObjectType) , d(new KDbQuerySchemaPrivate(this)) { } KDbQuerySchema::KDbQuerySchema(KDbTableSchema *tableSchema) : KDbFieldList(false)//fields are not owned by KDbQuerySchema object , KDbObject(KDb::QueryObjectType) , d(new KDbQuerySchemaPrivate(this)) { if (tableSchema) { d->masterTable = tableSchema; /*if (!d->masterTable) { kdbWarning() << "!d->masterTable"; m_name.clear(); return; }*/ addTable(d->masterTable); //defaults: //inherit name from a table setName(d->masterTable->name()); //inherit caption from a table setCaption(d->masterTable->caption()); // add explicit field list to avoid problems (e.g. with fields added outside of the app): foreach(KDbField* f, *d->masterTable->fields()) { addField(f); } } } KDbQuerySchema::KDbQuerySchema(const KDbQuerySchema& querySchema, KDbConnection *conn) : KDbFieldList(querySchema, false /* !deepCopyFields */) , KDbObject(querySchema) , d(new KDbQuerySchemaPrivate(this, querySchema.d)) { //only deep copy query asterisks foreach(KDbField* f, *querySchema.fields()) { KDbField *copiedField; if (dynamic_cast(f)) { copiedField = f->copy(); if (static_cast(f->parent()) == &querySchema) { copiedField->setParent(this); } } else { copiedField = f; } addField(copiedField); } // this deep copy must be after the 'd' initialization because fieldsExpanded() is used there d->orderByColumnList = new KDbOrderByColumnList(*querySchema.d->orderByColumnList, conn, const_cast(&querySchema), this); } KDbQuerySchema::~KDbQuerySchema() { delete d; } void KDbQuerySchema::clear() { KDbFieldList::clear(); KDbObject::clear(); d->clear(); } /*virtual*/ bool KDbQuerySchema::insertField(int position, KDbField *field) { return insertFieldInternal(position, field, -1/*don't bind*/, true); } bool KDbQuerySchema::insertInvisibleField(int position, KDbField *field) { return insertFieldInternal(position, field, -1/*don't bind*/, false); } bool KDbQuerySchema::insertField(int position, KDbField *field, int bindToTable) { return insertFieldInternal(position, field, bindToTable, true); } bool KDbQuerySchema::insertInvisibleField(int position, KDbField *field, int bindToTable) { return insertFieldInternal(position, field, bindToTable, false); } bool KDbQuerySchema::insertFieldInternal(int position, KDbField *field, int bindToTable, bool visible) { if (!field) { kdbWarning() << "!field"; return false; } if (position > fieldCount()) { kdbWarning() << "position" << position << "out of range"; return false; } if (!field->isQueryAsterisk() && !field->isExpression() && !field->table()) { kdbWarning() << "field" << field->name() << "must contain table information!"; return false; } if (fieldCount() >= d->visibility.size()) { d->visibility.resize(d->visibility.size()*2); d->tablesBoundToColumns.resize(d->tablesBoundToColumns.size()*2); } d->clearCachedData(); if (!KDbFieldList::insertField(position, field)) { return false; } if (field->isQueryAsterisk()) { d->asterisks.append(field); //if this is single-table asterisk, //add a table to list if doesn't exist there: if (field->table() && !d->tables.contains(field->table())) d->tables.append(field->table()); } else if (field->table()) { //add a table to list if doesn't exist there: if (!d->tables.contains(field->table())) d->tables.append(field->table()); } //update visibility //--move bits to make a place for a new one for (int i = fieldCount() - 1; i > position; i--) d->visibility.setBit(i, d->visibility.testBit(i - 1)); d->visibility.setBit(position, visible); //bind to table if (bindToTable < -1 || bindToTable > d->tables.count()) { kdbWarning() << "bindToTable" << bindToTable << "out of range"; bindToTable = -1; } //--move items to make a place for a new one for (int i = fieldCount() - 1; i > position; i--) d->tablesBoundToColumns[i] = d->tablesBoundToColumns[i-1]; d->tablesBoundToColumns[position] = bindToTable; - kdbDebug() << "bound to table" << bindToTable; +#ifdef KDB_QUERYSCHEMA_DEBUG + querySchemaDebug() << "bound to table" << bindToTable; if (bindToTable == -1) - kdbDebug() << " "; + querySchemaDebug() << " "; else - kdbDebug() << " name=" << d->tables.at(bindToTable)->name() - << " alias=" << tableAlias(bindToTable); + querySchemaDebug() << " name=" << d->tables.at(bindToTable)->name() + << " alias=" << tableAlias(bindToTable); QString s; for (int i = 0; i < fieldCount();i++) s += (QString::number(d->tablesBoundToColumns[i]) + QLatin1Char(' ')); - kdbDebug() << "tablesBoundToColumns == [" << s << "]"; + querySchemaDebug() << "tablesBoundToColumns == [" << s << "]"; +#endif if (field->isExpression()) d->regenerateExprAliases = true; return true; } int KDbQuerySchema::tableBoundToColumn(int columnPosition) const { int res = d->tablesBoundToColumns.value(columnPosition, -99); if (res == -99) { kdbWarning() << "columnPosition" << columnPosition << "out of range"; return -1; } return res; } bool KDbQuerySchema::addField(KDbField* field) { return insertField(fieldCount(), field); } bool KDbQuerySchema::addField(KDbField* field, int bindToTable) { return insertField(fieldCount(), field, bindToTable); } bool KDbQuerySchema::addInvisibleField(KDbField* field) { return insertInvisibleField(fieldCount(), field); } bool KDbQuerySchema::addInvisibleField(KDbField* field, int bindToTable) { return insertInvisibleField(fieldCount(), field, bindToTable); } bool KDbQuerySchema::removeField(KDbField *field) { int indexOfAsterisk = -1; if (field->isQueryAsterisk()) { indexOfAsterisk = d->asterisks.indexOf(field); } if (!KDbFieldList::removeField(field)) { return false; } d->clearCachedData(); if (indexOfAsterisk >= 0) { - //kdbDebug() << "d->asterisks.removeAt:" << field; + //querySchemaDebug() << "d->asterisks.removeAt:" << field; //field->debug(); d->asterisks.removeAt(indexOfAsterisk); //this will destroy this asterisk } //! @todo should we also remove table for this field or asterisk? return true; } bool KDbQuerySchema::addExpressionInternal(const KDbExpression& expr, bool visible) { KDbField *field = new KDbField(this, expr); bool ok; if (visible) { ok = addField(field); } else { ok = addInvisibleField(field); } if (!ok) { delete field; } d->ownedExpressionFields.append(field); return ok; } bool KDbQuerySchema::addExpression(const KDbExpression& expr) { return addExpressionInternal(expr, true); } bool KDbQuerySchema::addInvisibleExpression(const KDbExpression& expr) { return addExpressionInternal(expr, false); } bool KDbQuerySchema::isColumnVisible(int position) const { return (position < fieldCount()) ? d->visibility.testBit(position) : false; } void KDbQuerySchema::setColumnVisible(int position, bool visible) { if (position < fieldCount()) d->visibility.setBit(position, visible); } bool KDbQuerySchema::addAsteriskInternal(KDbQueryAsterisk *asterisk, bool visible) { if (!asterisk) { return false; } //make unique name asterisk->setName((asterisk->table() ? (asterisk->table()->name() + QLatin1String(".*")) : QString(QLatin1Char('*'))) + QString::number(asterisks()->count())); return visible ? addField(asterisk) : addInvisibleField(asterisk); } bool KDbQuerySchema::addAsterisk(KDbQueryAsterisk *asterisk) { return addAsteriskInternal(asterisk, true); } bool KDbQuerySchema::addInvisibleAsterisk(KDbQueryAsterisk *asterisk) { return addAsteriskInternal(asterisk, false); } QDebug operator<<(QDebug dbg, const KDbConnectionAndQuerySchema &connectionAndSchema) { KDbConnection* conn = std::get<0>(connectionAndSchema); const KDbQuerySchema& query = std::get<1>(connectionAndSchema); //fields KDbTableSchema *mt = query.masterTable(); dbg.nospace() << "QUERY"; dbg.space() << static_cast(query) << '\n'; dbg.nospace() << " - MASTERTABLE=" << (mt ? mt->name() : QLatin1String("")) << "\n - COLUMNS:\n"; if (query.fieldCount() > 0) dbg.nospace() << static_cast(query) << '\n'; else dbg.nospace() << "\n"; if (query.fieldCount() == 0) dbg.nospace() << " - NO FIELDS\n"; else dbg.nospace() << " - FIELDS EXPANDED ("; int fieldsExpandedCount = 0; bool first; if (query.fieldCount() > 0) { const KDbQueryColumnInfo::Vector fe(query.fieldsExpanded(conn)); fieldsExpandedCount = fe.size(); dbg.nospace() << fieldsExpandedCount << "):\n"; first = true; for (int i = 0; i < fieldsExpandedCount; i++) { KDbQueryColumnInfo *ci = fe[i]; if (first) first = false; else dbg.nospace() << ",\n"; dbg.nospace() << *ci; } dbg.nospace() << '\n'; } //it's safer to delete fieldsExpanded for now // (debugString() could be called before all fields are added) //bindings dbg.nospace() << " - BINDINGS:\n"; bool bindingsExist = false; for (int i = 0; i < query.fieldCount(); i++) { const int tablePos = query.tableBoundToColumn(i); if (tablePos >= 0) { const QString tAlias(query.tableAlias(tablePos)); if (!tAlias.isEmpty()) { bindingsExist = true; dbg.space() << "FIELD"; dbg.space() << static_cast(query).field(i)->name(); dbg.space() << "USES ALIAS"; dbg.space() << tAlias; dbg.space() << "OF TABLE"; dbg.space() << query.tables()->at(tablePos)->name() << '\n'; } } } if (!bindingsExist) { dbg.nospace() << "\n"; } //tables dbg.nospace() << " - TABLES:\n"; first = true; foreach(KDbTableSchema *table, *query.tables()) { if (first) first = false; else dbg.nospace() << ","; dbg.space() << table->name(); } if (query.tables()->isEmpty()) dbg.nospace() << ""; //aliases dbg.nospace() << "\n - COLUMN ALIASES:\n"; if (query.columnAliasesCount() == 0) { dbg.nospace() << "\n"; } else { int i = -1; foreach(KDbField *f, *query.fields()) { i++; const QString alias(query.columnAlias(i)); if (!alias.isEmpty()) { dbg.nospace() << QString::fromLatin1("FIELD #%1:").arg(i); dbg.space() << (f->name().isEmpty() ? QLatin1String("") : f->name()) << " -> " << alias << '\n'; } } } dbg.nospace() << "- TABLE ALIASES:\n"; if (query.tableAliasesCount() == 0) { dbg.nospace() << "\n"; } else { int i = -1; foreach(KDbTableSchema* table, *query.tables()) { i++; const QString alias(query.tableAlias(i)); if (!alias.isEmpty()) { dbg.nospace() << QString::fromLatin1("table #%1:").arg(i); dbg.space() << (table->name().isEmpty() ? QLatin1String("") : table->name()) << " -> " << alias << '\n'; } } } if (!query.whereExpression().isNull()) { dbg.nospace() << " - WHERE EXPRESSION:\n" << query.whereExpression() << '\n'; } dbg.nospace() << qPrintable(QString::fromLatin1(" - ORDER BY (%1):\n").arg(query.orderByColumnList()->count())); if (query.orderByColumnList()->isEmpty()) { dbg.nospace() << "\n"; } else { dbg.nospace() << *query.orderByColumnList(); } return dbg.nospace(); } KDbTableSchema* KDbQuerySchema::masterTable() const { if (d->masterTable) return d->masterTable; if (d->tables.isEmpty()) return nullptr; //try to find master table if there's only one table (with possible aliasses) QString tableNameLower; int num = -1; foreach(KDbTableSchema *table, d->tables) { num++; if (!tableNameLower.isEmpty() && table->name().toLower() != tableNameLower) { //two or more different tables return nullptr; } tableNameLower = tableAlias(num); } return d->tables.first(); } void KDbQuerySchema::setMasterTable(KDbTableSchema *table) { if (table) d->masterTable = table; } QList* KDbQuerySchema::tables() const { return &d->tables; } void KDbQuerySchema::addTable(KDbTableSchema *table, const QString& alias) { - kdbDebug() << (void *)table << "alias=" << alias; + querySchemaDebug() << (void *)table << "alias=" << alias; if (!table) return; // only append table if: it has alias or it has no alias but there is no such table on the list if (alias.isEmpty() && d->tables.contains(table)) { int num = -1; foreach(KDbTableSchema *t, d->tables) { num++; if (0 == t->name().compare(table->name(), Qt::CaseInsensitive)) { if (tableAlias(num).isEmpty()) { - kdbDebug() << "table" << table->name() << "without alias already added"; + querySchemaDebug() << "table" << table->name() << "without alias already added"; return; } } } } d->tables.append(table); if (!alias.isEmpty()) setTableAlias(d->tables.count() - 1, alias); } void KDbQuerySchema::removeTable(KDbTableSchema *table) { if (!table) return; if (d->masterTable == table) d->masterTable = nullptr; d->tables.removeAt(d->tables.indexOf(table)); //! @todo remove fields! } KDbTableSchema* KDbQuerySchema::table(const QString& tableName) const { //! @todo maybe use tables_byname? foreach(KDbTableSchema *table, d->tables) { if (0 == table->name().compare(tableName, Qt::CaseInsensitive)) { return table; } } return nullptr; } bool KDbQuerySchema::contains(KDbTableSchema *table) const { return d->tables.contains(table); } KDbField* KDbQuerySchema::findTableField(const QString &fieldOrTableAndFieldName) const { QString tableName, fieldName; if (!KDb::splitToTableAndFieldParts(fieldOrTableAndFieldName, &tableName, &fieldName, KDb::SetFieldNameIfNoTableName)) { return nullptr; } if (tableName.isEmpty()) { foreach(KDbTableSchema *table, d->tables) { if (table->field(fieldName)) return table->field(fieldName); } return nullptr; } KDbTableSchema *tableSchema = table(tableName); if (!tableSchema) return nullptr; return tableSchema->field(fieldName); } int KDbQuerySchema::columnAliasesCount() const { return d->columnAliasesCount(); } QString KDbQuerySchema::columnAlias(int position) const { return d->columnAlias(position); } bool KDbQuerySchema::hasColumnAlias(int position) const { return d->hasColumnAlias(position); } bool KDbQuerySchema::setColumnAlias(int position, const QString& alias) { if (position >= fieldCount()) { kdbWarning() << "position" << position << "out of range!"; return false; } const QString fixedAlias(alias.trimmed()); KDbField *f = KDbFieldList::field(position); if (f->captionOrName().isEmpty() && fixedAlias.isEmpty()) { kdbWarning() << "position" << position << "could not remove alias when no name is specified for expression column!"; return false; } return d->setColumnAlias(position, fixedAlias); } int KDbQuerySchema::tableAliasesCount() const { return d->tableAliases.count(); } QString KDbQuerySchema::tableAlias(int position) const { return d->tableAliases.value(position); } QString KDbQuerySchema::tableAlias(const QString& tableName) const { const int pos = tablePosition(tableName); if (pos == -1) { return QString(); } return d->tableAliases.value(pos); } QString KDbQuerySchema::tableAliasOrName(const QString& tableName) const { const int pos = tablePosition(tableName); if (pos == -1) { return QString(); } return KDb::iifNotEmpty(d->tableAliases.value(pos), tableName); } int KDbQuerySchema::tablePositionForAlias(const QString& name) const { return d->tablePositionForAlias(name); } int KDbQuerySchema::tablePosition(const QString& tableName) const { int num = -1; foreach(KDbTableSchema* table, d->tables) { num++; if (0 == table->name().compare(tableName, Qt::CaseInsensitive)) { return num; } } return -1; } QList KDbQuerySchema::tablePositions(const QString& tableName) const { QList result; int num = -1; foreach(KDbTableSchema* table, d->tables) { num++; if (0 == table->name().compare(tableName, Qt::CaseInsensitive)) { result += num; } } return result; } bool KDbQuerySchema::hasTableAlias(int position) const { return d->tableAliases.contains(position); } bool KDbQuerySchema::hasTableAlias(const QString &name) const { return d->tablePositionForAlias(name) != -1; } int KDbQuerySchema::columnPositionForAlias(const QString& name) const { return d->columnPositionForAlias(name); } bool KDbQuerySchema::hasColumnAlias(const QString &name) const { return d->columnPositionForAlias(name) != -1; } bool KDbQuerySchema::setTableAlias(int position, const QString& alias) { if (position >= d->tables.count()) { kdbWarning() << "position" << position << "out of range!"; return false; } const QString fixedAlias(alias.trimmed()); if (fixedAlias.isEmpty()) { const QString oldAlias(d->tableAliases.take(position)); if (!oldAlias.isEmpty()) { d->removeTablePositionForAlias(oldAlias); } return true; } return d->setTableAlias(position, fixedAlias); } QList* KDbQuerySchema::relationships() const { return &d->relations; } KDbField::List* KDbQuerySchema::asterisks() const { return &d->asterisks; } KDbEscapedString KDbQuerySchema::statement() const { return d->sql; } void KDbQuerySchema::setStatement(const KDbEscapedString& sql) { d->sql = sql; } const KDbField* KDbQuerySchema::field(KDbConnection *conn, const QString& identifier, ExpandMode mode) const { KDbQueryColumnInfo *ci = columnInfo(conn, identifier, mode); return ci ? ci->field() : nullptr; } KDbField* KDbQuerySchema::field(KDbConnection *conn, const QString& identifier, ExpandMode mode) { return const_cast( static_cast(this)->field(conn, identifier, mode)); } KDbField* KDbQuerySchema::field(int id) { return KDbFieldList::field(id); } const KDbField* KDbQuerySchema::field(int id) const { return KDbFieldList::field(id); } KDbQueryColumnInfo *KDbQuerySchema::columnInfo(KDbConnection *conn, const QString &identifier, ExpandMode mode) const { const KDbQuerySchemaFieldsExpanded *cache = computeFieldsExpanded(conn); return mode == ExpandMode::Expanded ? cache->columnInfosByNameExpanded.value(identifier) : cache->columnInfosByName.value(identifier); } KDbQueryColumnInfo::Vector KDbQuerySchema::fieldsExpandedInternal( KDbConnection *conn, FieldsExpandedMode mode, bool onlyVisible) const { if (!conn) { kdbWarning() << "Connection required"; return KDbQueryColumnInfo::Vector(); } KDbQuerySchemaFieldsExpanded *cache = computeFieldsExpanded(conn); const KDbQueryColumnInfo::Vector *realFieldsExpanded = onlyVisible ? &cache->visibleFieldsExpanded : &cache->fieldsExpanded; if (mode == FieldsExpandedMode::WithInternalFields || mode == FieldsExpandedMode::WithInternalFieldsAndRecordId) { //a ref to a proper pointer (as we cache the vector for two cases) KDbQueryColumnInfo::Vector& tmpFieldsExpandedWithInternal = (mode == FieldsExpandedMode::WithInternalFields) ? (onlyVisible ? cache->visibleFieldsExpandedWithInternal : cache->fieldsExpandedWithInternal) : (onlyVisible ? cache->visibleFieldsExpandedWithInternalAndRecordId : cache->fieldsExpandedWithInternalAndRecordId); //special case if (tmpFieldsExpandedWithInternal.isEmpty()) { //glue expanded and internal fields and cache it const int internalFieldCount = cache->internalFields.size(); const int fieldsExpandedVectorSize = realFieldsExpanded->size(); const int size = fieldsExpandedVectorSize + internalFieldCount + ((mode == FieldsExpandedMode::WithInternalFieldsAndRecordId) ? 1 : 0) /*ROWID*/; tmpFieldsExpandedWithInternal.resize(size); for (int i = 0; i < fieldsExpandedVectorSize; ++i) { tmpFieldsExpandedWithInternal[i] = realFieldsExpanded->at(i); } if (internalFieldCount > 0) { for (int i = 0; i < internalFieldCount; ++i) { KDbQueryColumnInfo *info = cache->internalFields[i]; tmpFieldsExpandedWithInternal[fieldsExpandedVectorSize + i] = info; } } if (mode == FieldsExpandedMode::WithInternalFieldsAndRecordId) { if (!d->fakeRecordIdField) { d->fakeRecordIdField = new KDbField(QLatin1String("rowID"), KDbField::BigInteger); d->fakeRecordIdCol = new KDbQueryColumnInfo(d->fakeRecordIdField, QString(), true); } tmpFieldsExpandedWithInternal[fieldsExpandedVectorSize + internalFieldCount] = d->fakeRecordIdCol; } } return tmpFieldsExpandedWithInternal; } if (mode == FieldsExpandedMode::Default) { return *realFieldsExpanded; } //mode == Unique: QSet columnsAlreadyFound; const int fieldsExpandedCount(realFieldsExpanded->count()); KDbQueryColumnInfo::Vector result(fieldsExpandedCount); //initial size is set //compute unique list int uniqueListCount = 0; for (int i = 0; i < fieldsExpandedCount; i++) { KDbQueryColumnInfo *ci = realFieldsExpanded->at(i); if (!columnsAlreadyFound.contains(ci->aliasOrName())) { columnsAlreadyFound.insert(ci->aliasOrName()); result[uniqueListCount++] = ci; } } result.resize(uniqueListCount); //update result size return result; } KDbQueryColumnInfo::Vector KDbQuerySchema::internalFields(KDbConnection *conn) const { KDbQuerySchemaFieldsExpanded *cache = computeFieldsExpanded(conn); return cache->internalFields; } KDbQueryColumnInfo* KDbQuerySchema::expandedOrInternalField(KDbConnection *conn, int index) const { return fieldsExpanded(conn, FieldsExpandedMode::WithInternalFields).value(index); } inline static QString lookupColumnKey(KDbField *foreignField, KDbField* field) { QString res; if (field->table()) // can be 0 for anonymous fields built as joined multiple visible columns res = field->table()->name() + QLatin1Char('.'); return res + field->name() + QLatin1Char('_') + foreignField->table()->name() + QLatin1Char('.') + foreignField->name(); } KDbQuerySchemaFieldsExpanded *KDbQuerySchema::computeFieldsExpanded(KDbConnection *conn) const { KDbQuerySchemaFieldsExpanded *cache = conn->d->fieldsExpanded(this); if (cache) { return cache; } cache = new KDbQuerySchemaFieldsExpanded; QScopedPointer guard(cache); //collect all fields in a list (not a vector yet, because we do not know its size) KDbQueryColumnInfo::List list; //temporary KDbQueryColumnInfo::List lookup_list; //temporary, for collecting additional fields related to lookup fields QHash columnInfosOutsideAsterisks; //helper for filling d->columnInfosByName int i = 0; int numberOfColumnsWithMultipleVisibleFields = 0; //used to find an unique name for anonymous field int fieldPosition = -1; for (KDbField *f : *fields()) { fieldPosition++; if (f->isQueryAsterisk()) { if (static_cast(f)->isSingleTableAsterisk()) { const KDbField::List *ast_fields = static_cast(f)->table()->fields(); foreach(KDbField *ast_f, *ast_fields) { KDbQueryColumnInfo *ci = new KDbQueryColumnInfo(ast_f, QString()/*no field for asterisk!*/, isColumnVisible(fieldPosition)); list.append(ci); - kdbDebug() << "caching (unexpanded) columns order:" << *ci << "at position" << fieldPosition; + querySchemaDebug() << "caching (unexpanded) columns order:" << *ci + << "at position" << fieldPosition; cache->columnsOrder.insert(ci, fieldPosition); } } else {//all-tables asterisk: iterate through table list foreach(KDbTableSchema *table, d->tables) { //add all fields from this table const KDbField::List *tab_fields = table->fields(); foreach(KDbField *tab_f, *tab_fields) { //! @todo (js): perhaps not all fields should be appended here // d->detailedVisibility += isFieldVisible(fieldPosition); // list.append(tab_f); KDbQueryColumnInfo *ci = new KDbQueryColumnInfo(tab_f, QString()/*no field for asterisk!*/, isColumnVisible(fieldPosition)); list.append(ci); - kdbDebug() << "caching (unexpanded) columns order:" << *ci << "at position" << fieldPosition; + querySchemaDebug() << "caching (unexpanded) columns order:" << *ci + << "at position" << fieldPosition; cache->columnsOrder.insert(ci, fieldPosition); } } } } else { //a single field KDbQueryColumnInfo *ci = new KDbQueryColumnInfo(f, columnAlias(fieldPosition), isColumnVisible(fieldPosition)); list.append(ci); columnInfosOutsideAsterisks.insert(ci, true); - kdbDebug() << "caching (unexpanded) column's order:" << *ci << "at position" << fieldPosition; + querySchemaDebug() << "caching (unexpanded) column's order:" << *ci << "at position" + << fieldPosition; cache->columnsOrder.insert(ci, fieldPosition); cache->columnsOrderWithoutAsterisks.insert(ci, fieldPosition); //handle lookup field schema KDbLookupFieldSchema *lookupFieldSchema = f->table() ? f->table()->lookupFieldSchema(*f) : nullptr; if (!lookupFieldSchema || lookupFieldSchema->boundColumn() < 0) continue; // Lookup field schema found: // Now we also need to fetch "visible" value from the lookup table, not only the value of binding. // -> build LEFT OUTER JOIN clause for this purpose (LEFT, not INNER because the binding can be broken) // "LEFT OUTER JOIN lookupTable ON thisTable.thisField=lookupTable.boundField" KDbLookupFieldSchemaRecordSource recordSource = lookupFieldSchema->recordSource(); if (recordSource.type() == KDbLookupFieldSchemaRecordSource::Type::Table) { KDbTableSchema *lookupTable = conn->tableSchema(recordSource.name()); KDbFieldList* visibleColumns = nullptr; KDbField *boundField = nullptr; if (lookupTable && lookupFieldSchema->boundColumn() < lookupTable->fieldCount() && (visibleColumns = lookupTable->subList(lookupFieldSchema->visibleColumns())) && (boundField = lookupTable->field(lookupFieldSchema->boundColumn()))) { KDbField *visibleColumn = nullptr; // for single visible column, just add it as-is if (visibleColumns->fieldCount() == 1) { visibleColumn = visibleColumns->fields()->first(); } else { // for multiple visible columns, build an expression column // (the expression object will be owned by column info) visibleColumn = new KDbField(); visibleColumn->setName( QString::fromLatin1("[multiple_visible_fields_%1]") .arg(++numberOfColumnsWithMultipleVisibleFields)); visibleColumn->setExpression( KDbConstExpression(KDbToken::CHARACTER_STRING_LITERAL, QVariant()/*not important*/)); cache->ownedVisibleFields.append(visibleColumn); // remember to delete later } lookup_list.append( new KDbQueryColumnInfo(visibleColumn, QString(), true/*visible*/, ci/*foreign*/)); /* //add visibleField to the list of SELECTed fields if it is not yes present there if (!findTableField( visibleField->table()->name()+"."+visibleField->name() )) { if (!table( visibleField->table()->name() )) { } if (!sql.isEmpty()) sql += QString::fromLatin1(", "); sql += (escapeIdentifier(visibleField->table()->name(), drvEscaping) + "." + escapeIdentifier(visibleField->name(), drvEscaping)); }*/ } delete visibleColumns; } else if (recordSource.type() == KDbLookupFieldSchemaRecordSource::Type::Query) { KDbQuerySchema *lookupQuery = conn->querySchema(recordSource.name()); if (!lookupQuery) continue; const KDbQueryColumnInfo::Vector lookupQueryFieldsExpanded( lookupQuery->fieldsExpanded(conn)); if (lookupFieldSchema->boundColumn() >= lookupQueryFieldsExpanded.count()) continue; KDbQueryColumnInfo *boundColumnInfo = nullptr; if (!(boundColumnInfo = lookupQueryFieldsExpanded.value(lookupFieldSchema->boundColumn()))) continue; KDbField *boundField = boundColumnInfo->field(); if (!boundField) continue; const QList visibleColumns(lookupFieldSchema->visibleColumns()); bool ok = true; // all indices in visibleColumns should be in [0..lookupQueryFieldsExpanded.size()-1] foreach(int visibleColumn, visibleColumns) { if (visibleColumn >= lookupQueryFieldsExpanded.count()) { ok = false; break; } } if (!ok) continue; KDbField *visibleColumn = nullptr; // for single visible column, just add it as-is if (visibleColumns.count() == 1) { visibleColumn = lookupQueryFieldsExpanded.value(visibleColumns.first())->field(); } else { // for multiple visible columns, build an expression column // (the expression object will be owned by column info) visibleColumn = new KDbField(); visibleColumn->setName( QString::fromLatin1("[multiple_visible_fields_%1]") .arg(++numberOfColumnsWithMultipleVisibleFields)); visibleColumn->setExpression( KDbConstExpression(KDbToken::CHARACTER_STRING_LITERAL, QVariant()/*not important*/)); cache->ownedVisibleFields.append(visibleColumn); // remember to delete later } lookup_list.append( new KDbQueryColumnInfo(visibleColumn, QString(), true/*visible*/, ci/*foreign*/)); /* //add visibleField to the list of SELECTed fields if it is not yes present there if (!findTableField( visibleField->table()->name()+"."+visibleField->name() )) { if (!table( visibleField->table()->name() )) { } if (!sql.isEmpty()) sql += QString::fromLatin1(", "); sql += (escapeIdentifier(visibleField->table()->name(), drvEscaping) + "." + escapeIdentifier(visibleField->name(), drvEscaping)); }*/ } } } //prepare clean vector for expanded list, and a map for order information cache->fieldsExpanded.resize(list.count()); cache->visibleFieldsExpanded.resize(list.count()); /*fill (based on prepared 'list' and 'lookup_list'): -the vector -the map -"fields by name" dictionary */ i = -1; int visibleIndex = -1; foreach(KDbQueryColumnInfo* ci, list) { i++; cache->fieldsExpanded[i] = ci; if (ci->isVisible()) { ++visibleIndex; cache->visibleFieldsExpanded[visibleIndex] = ci; } cache->columnsOrderExpanded.insert(ci, i); //remember field by name/alias/table.name if there's no such string yet in d->columnInfosByNameExpanded if (!ci->alias().isEmpty()) { //store alias and table.alias if (!cache->columnInfosByNameExpanded.contains(ci->alias())) { cache->columnInfosByNameExpanded.insert(ci->alias(), ci); } QString tableAndAlias(ci->alias()); if (ci->field()->table()) tableAndAlias.prepend(ci->field()->table()->name() + QLatin1Char('.')); if (!cache->columnInfosByNameExpanded.contains(tableAndAlias)) { cache->columnInfosByNameExpanded.insert(tableAndAlias, ci); } //the same for "unexpanded" list if (columnInfosOutsideAsterisks.contains(ci)) { if (!cache->columnInfosByName.contains(ci->alias())) { cache->columnInfosByName.insert(ci->alias(), ci); } if (!cache->columnInfosByName.contains(tableAndAlias)) { cache->columnInfosByName.insert(tableAndAlias, ci); } } } else { //no alias: store name and table.name if (!cache->columnInfosByNameExpanded.contains(ci->field()->name())) { cache->columnInfosByNameExpanded.insert(ci->field()->name(), ci); } QString tableAndName(ci->field()->name()); if (ci->field()->table()) tableAndName.prepend(ci->field()->table()->name() + QLatin1Char('.')); if (!cache->columnInfosByNameExpanded.contains(tableAndName)) { cache->columnInfosByNameExpanded.insert(tableAndName, ci); } //the same for "unexpanded" list if (columnInfosOutsideAsterisks.contains(ci)) { if (!cache->columnInfosByName.contains(ci->field()->name())) { cache->columnInfosByName.insert(ci->field()->name(), ci); } if (!cache->columnInfosByName.contains(tableAndName)) { cache->columnInfosByName.insert(tableAndName, ci); } } } } cache->visibleFieldsExpanded.resize(visibleIndex + 1); //remove duplicates for lookup fields QHash lookup_dict; //used to fight duplicates and to update KDbQueryColumnInfo::indexForVisibleLookupValue() // (a mapping from table.name string to int* lookupFieldIndex i = 0; for (QMutableListIterator it(lookup_list); it.hasNext();) { KDbQueryColumnInfo* ci = it.next(); const QString key(lookupColumnKey(ci->foreignColumn()->field(), ci->field())); if (lookup_dict.contains(key)) { // this table.field is already fetched by this query it.remove(); delete ci; } else { lookup_dict.insert(key, i); i++; } } //create internal expanded list with lookup fields cache->internalFields.resize(lookup_list.count()); i = -1; foreach(KDbQueryColumnInfo *ci, lookup_list) { i++; //add it to the internal list cache->internalFields[i] = ci; cache->columnsOrderExpanded.insert(ci, list.count() + i); } //update KDbQueryColumnInfo::indexForVisibleLookupValue() cache for columns numberOfColumnsWithMultipleVisibleFields = 0; for (i = 0; i < cache->fieldsExpanded.size(); i++) { KDbQueryColumnInfo* ci = cache->fieldsExpanded[i]; //! @todo KDbQuerySchema itself will also support lookup fields... KDbLookupFieldSchema *lookupFieldSchema = ci->field()->table() ? ci->field()->table()->lookupFieldSchema(*ci->field()) : nullptr; if (!lookupFieldSchema || lookupFieldSchema->boundColumn() < 0) continue; const KDbLookupFieldSchemaRecordSource recordSource = lookupFieldSchema->recordSource(); if (recordSource.type() == KDbLookupFieldSchemaRecordSource::Type::Table) { KDbTableSchema *lookupTable = conn->tableSchema(recordSource.name()); KDbFieldList* visibleColumns = nullptr; if (lookupTable && lookupFieldSchema->boundColumn() < lookupTable->fieldCount() && (visibleColumns = lookupTable->subList(lookupFieldSchema->visibleColumns()))) { // for single visible column, just add it as-is if (visibleColumns->fieldCount() == 1) { KDbField *visibleColumn = visibleColumns->fields()->first(); const QString key(lookupColumnKey(ci->field(), visibleColumn)); int index = lookup_dict.value(key, -99); if (index != -99) ci->setIndexForVisibleLookupValue(cache->fieldsExpanded.size() + index); } else { const QString key(QString::fromLatin1("[multiple_visible_fields_%1]_%2.%3") .arg(++numberOfColumnsWithMultipleVisibleFields) .arg(ci->field()->table()->name(), ci->field()->name())); int index = lookup_dict.value(key, -99); if (index != -99) ci->setIndexForVisibleLookupValue(cache->fieldsExpanded.size() + index); } } delete visibleColumns; } else if (recordSource.type() == KDbLookupFieldSchemaRecordSource::Type::Query) { KDbQuerySchema *lookupQuery = conn->querySchema(recordSource.name()); if (!lookupQuery) continue; const KDbQueryColumnInfo::Vector lookupQueryFieldsExpanded( lookupQuery->fieldsExpanded(conn)); if (lookupFieldSchema->boundColumn() >= lookupQueryFieldsExpanded.count()) continue; KDbQueryColumnInfo *boundColumnInfo = nullptr; if (!(boundColumnInfo = lookupQueryFieldsExpanded.value(lookupFieldSchema->boundColumn()))) continue; KDbField *boundField = boundColumnInfo->field(); if (!boundField) continue; const QList visibleColumns(lookupFieldSchema->visibleColumns()); // for single visible column, just add it as-is if (visibleColumns.count() == 1) { if (lookupQueryFieldsExpanded.count() > visibleColumns.first()) { // sanity check KDbField *visibleColumn = lookupQueryFieldsExpanded.at(visibleColumns.first())->field(); const QString key(lookupColumnKey(ci->field(), visibleColumn)); int index = lookup_dict.value(key, -99); if (index != -99) ci->setIndexForVisibleLookupValue(cache->fieldsExpanded.size() + index); } } else { const QString key(QString::fromLatin1("[multiple_visible_fields_%1]_%2.%3") .arg(++numberOfColumnsWithMultipleVisibleFields) .arg(ci->field()->table()->name(), ci->field()->name())); int index = lookup_dict.value(key, -99); if (index != -99) ci->setIndexForVisibleLookupValue(cache->fieldsExpanded.size() + index); } } else { kdbWarning() << "unsupported record source type" << recordSource.typeName(); } } if (d->recentConnection != conn) { if (d->recentConnection) { // connection changed: remove old cache d->recentConnection->d->removeFieldsExpanded(this); } d->recentConnection = conn; } conn->d->insertFieldsExpanded(this, guard.take()); return cache; } QHash KDbQuerySchema::columnsOrder(KDbConnection *conn, ColumnsOrderMode mode) const { KDbQuerySchemaFieldsExpanded *cache = computeFieldsExpanded(conn); if (mode == ColumnsOrderMode::UnexpandedList) { return cache->columnsOrder; } else if (mode == ColumnsOrderMode::UnexpandedListWithoutAsterisks) { return cache->columnsOrderWithoutAsterisks; } return cache->columnsOrderExpanded; } QVector KDbQuerySchema::pkeyFieldsOrder(KDbConnection *conn) const { if (d->pkeyFieldsOrder) return *d->pkeyFieldsOrder; KDbTableSchema *tbl = masterTable(); if (!tbl || !tbl->primaryKey()) return QVector(); //get order of PKEY fields (e.g. for records updating or inserting ) KDbIndexSchema *pkey = tbl->primaryKey(); - kdbDebug() << *pkey; + querySchemaDebug() << *pkey; d->pkeyFieldsOrder = new QVector(pkey->fieldCount(), -1); d->pkeyFieldCount = 0; const KDbQueryColumnInfo::Vector fieldsExpanded(this->fieldsExpanded(conn)); const int fCount = fieldsExpanded.count(); for (int i = 0; i < fCount; i++) { const KDbQueryColumnInfo *fi = fieldsExpanded[i]; const int fieldIndex = fi->field()->table() == tbl ? pkey->indexOf(*fi->field()) : -1; - if (fieldIndex != -1/* field found in PK */ - && d->pkeyFieldsOrder->at(fieldIndex) == -1 /* first time */) { - kdbDebug() << "FIELD" << fi->field()->name() << "IS IN PKEY AT POSITION #" << fieldIndex; + if (fieldIndex != -1 /* field found in PK */ + && d->pkeyFieldsOrder->at(fieldIndex) == -1 /* first time */) + { + querySchemaDebug() << "FIELD" << fi->field()->name() << "IS IN PKEY AT POSITION #" + << fieldIndex; (*d->pkeyFieldsOrder)[fieldIndex] = i; d->pkeyFieldCount++; } } - kdbDebug() << d->pkeyFieldCount - << " OUT OF " << pkey->fieldCount() << " PKEY'S FIELDS FOUND IN QUERY " << name(); + querySchemaDebug() << d->pkeyFieldCount << " OUT OF " << pkey->fieldCount() + << " PKEY'S FIELDS FOUND IN QUERY " << name(); return *d->pkeyFieldsOrder; } int KDbQuerySchema::pkeyFieldCount(KDbConnection *conn) { (void)pkeyFieldsOrder(conn); /* rebuild information */ return d->pkeyFieldCount; } KDbRelationship* KDbQuerySchema::addRelationship(KDbField *field1, KDbField *field2) { //@todo: find existing global db relationships KDbRelationship *r = new KDbRelationship(this, field1, field2); if (r->isEmpty()) { delete r; return nullptr; } d->relations.append(r); return r; } KDbQueryColumnInfo::List* KDbQuerySchema::autoIncrementFields(KDbConnection *conn) const { if (!d->autoincFields) { d->autoincFields = new KDbQueryColumnInfo::List(); } KDbTableSchema *mt = masterTable(); if (!mt) { kdbWarning() << "no master table!"; return d->autoincFields; } if (d->autoincFields->isEmpty()) {//no cache const KDbQueryColumnInfo::Vector fieldsExpanded(this->fieldsExpanded(conn)); for (int i = 0; i < fieldsExpanded.count(); i++) { KDbQueryColumnInfo *ci = fieldsExpanded[i]; if (ci->field()->table() == mt && ci->field()->isAutoIncrement()) { d->autoincFields->append(ci); } } } return d->autoincFields; } // static KDbEscapedString KDbQuerySchema::sqlColumnsList(const KDbQueryColumnInfo::List &infolist, KDbConnection *conn, KDb::IdentifierEscapingType escapingType) { KDbEscapedString result; result.reserve(256); bool start = true; foreach(KDbQueryColumnInfo* ci, infolist) { if (!start) result += ","; else start = false; result += escapeIdentifier(ci->field()->name(), conn, escapingType); } return result; } KDbEscapedString KDbQuerySchema::autoIncrementSqlFieldsList(KDbConnection *conn) const { // QWeakPointer driverWeakPointer // = DriverManagerInternal::self()->driverWeakPointer(*conn->driver()); if ( /*d->lastUsedDriverForAutoIncrementSQLFieldsList != driverWeakPointer ||*/ d->autoIncrementSqlFieldsList.isEmpty()) { d->autoIncrementSqlFieldsList = KDbQuerySchema::sqlColumnsList(*autoIncrementFields(conn), conn); //d->lastUsedDriverForAutoIncrementSQLFieldsList = driverWeakPointer; } return d->autoIncrementSqlFieldsList; } static void setResult(const KDbParseInfoInternal &parseInfo, QString *errorMessage, QString *errorDescription) { if (errorMessage) { *errorMessage = parseInfo.errorMessage(); } if (errorDescription) { *errorDescription = parseInfo.errorDescription(); } } bool KDbQuerySchema::setWhereExpression(const KDbExpression &expr, QString *errorMessage, QString *errorDescription) { KDbExpression newWhereExpr = expr.clone(); KDbParseInfoInternal parseInfo(this); QString tempErrorMessage; QString tempErrorDescription; QString *errorMessagePointer = errorMessage ? errorMessage : &tempErrorMessage; QString *errorDescriptionPointer = errorDescription ? errorDescription : &tempErrorDescription; if (!newWhereExpr.validate(&parseInfo)) { setResult(parseInfo, errorMessagePointer, errorDescription); kdbWarning() << "message=" << *errorMessagePointer << "description=" << *errorDescriptionPointer; kdbWarning() << newWhereExpr; d->whereExpr = KDbExpression(); return false; } errorMessagePointer->clear(); errorDescriptionPointer->clear(); KDbQuerySchemaPrivate::setWhereExpressionInternal(this, newWhereExpr); return true; } bool KDbQuerySchema::addToWhereExpression(KDbField *field, const QVariant &value, KDbToken relation, QString *errorMessage, QString *errorDescription) { KDbToken token; if (value.isNull()) { token = KDbToken::SQL_NULL; } else { const KDbField::Type type = field->type(); // cache: evaluating type of expressions can be expensive if (KDbField::isIntegerType(type)) { token = KDbToken::INTEGER_CONST; } else if (KDbField::isFPNumericType(type)) { token = KDbToken::REAL_CONST; } else { token = KDbToken::CHARACTER_STRING_LITERAL; } //! @todo date, time } KDbBinaryExpression newExpr( KDbConstExpression(token, value), relation, KDbVariableExpression((field->table() ? (field->table()->name() + QLatin1Char('.')) : QString()) + field->name()) ); const KDbExpression origWhereExpr = d->whereExpr; if (!d->whereExpr.isNull()) { newExpr = KDbBinaryExpression( d->whereExpr, KDbToken::AND, newExpr ); } const bool result = setWhereExpression(newExpr, errorMessage, errorDescription); if (!result) { // revert, setWhereExpression() cleared it d->whereExpr = origWhereExpr; } return result; } /* void KDbQuerySchema::addToWhereExpression(KDbField *field, const QVariant& value) switch (value.type()) { case Int: case UInt: case Bool: case LongLong: case ULongLong: token = INTEGER_CONST; break; case Double: token = REAL_CONST; break; default: token = CHARACTER_STRING_LITERAL; } //! @todo date, time */ KDbExpression KDbQuerySchema::whereExpression() const { return d->whereExpr; } void KDbQuerySchema::setOrderByColumnList(const KDbOrderByColumnList& list) { delete d->orderByColumnList; d->orderByColumnList = new KDbOrderByColumnList(list, nullptr, nullptr, nullptr); // all field names should be found, exit otherwise ..........? } KDbOrderByColumnList* KDbQuerySchema::orderByColumnList() { return d->orderByColumnList; } const KDbOrderByColumnList* KDbQuerySchema::orderByColumnList() const { return d->orderByColumnList; } QList KDbQuerySchema::parameters(KDbConnection *conn) const { QList params; const KDbQueryColumnInfo::Vector fieldsExpanded(this->fieldsExpanded(conn)); for (int i = 0; i < fieldsExpanded.count(); ++i) { KDbQueryColumnInfo *ci = fieldsExpanded[i]; if (!ci->field()->expression().isNull()) { ci->field()->expression().getQueryParameters(¶ms); } } KDbExpression where = whereExpression(); if (!where.isNull()) { where.getQueryParameters(¶ms); } return params; } bool KDbQuerySchema::validate(QString *errorMessage, QString *errorDescription) { KDbParseInfoInternal parseInfo(this); foreach(KDbField* f, *fields()) { if (f->isExpression()) { if (!f->expression().validate(&parseInfo)) { setResult(parseInfo, errorMessage, errorDescription); return false; } } } if (!whereExpression().validate(&parseInfo)) { setResult(parseInfo, errorMessage, errorDescription); return false; } return true; } diff --git a/src/config-kdb-private.h.cmake b/src/config-kdb-private.h.cmake new file mode 100644 index 00000000..d9d2f5d2 --- /dev/null +++ b/src/config-kdb-private.h.cmake @@ -0,0 +1,38 @@ +#ifndef KDB_CONFIG_P_H +#define KDB_CONFIG_P_H + +/* config-kdb-private.h. Generated by cmake from config-kdb-private.h.cmake */ + +/*! @file config-kdb-private.h + Private KDb configuration (build time) +*/ + +//! @def KDB_EXPRESSION_DEBUG +//! @brief Defined if debugging for expressions is enabled +#cmakedefine KDB_EXPRESSION_DEBUG + +//! @def KDB_DRIVERMANAGER_DEBUG +//! @brief Defined if debugging for the driver manager is enabled +#cmakedefine KDB_DRIVERMANAGER_DEBUG + +//! @def KDB_TRANSACTIONS_DEBUG +//! @brief Defined if debugging for database transactions is enabled +//! @since 3.1 +#cmakedefine KDB_TRANSACTIONS_DEBUG + +//! @def KDB_TABLESCHEMACHANGELISTENER_DEBUG +//! @brief Defined if debugging of the KDbTableSchemaChangeListener class is enabled +//! @since 3.1 +#cmakedefine KDB_TABLESCHEMACHANGELISTENER_DEBUG + +//! @def KDB_QUERYSCHEMA_DEBUG +//! @brief Defined if debugging of the Debugging of the QuerySchema class is enabled +//! @since 3.1.1 +#cmakedefine KDB_QUERYSCHEMA_DEBUG + +//! @def KDB_SQLPARSER_DEBUG +//! @brief Defined if debugging of the SQL parser is enabled +//! @since 3.1.1 +#cmakedefine KDB_SQLPARSER_DEBUG + +#endif diff --git a/src/kdb_debug.h b/src/kdb_debug.h index 87f9a7e5..618f1402 100644 --- a/src/kdb_debug.h +++ b/src/kdb_debug.h @@ -1,55 +1,68 @@ /* This file is part of the KDE project Copyright (C) 2015 Laurent Montel This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, * Boston, MA 02110-1301, USA. */ #ifndef KDB_DEBUG_H #define KDB_DEBUG_H #include "config-kdb.h" +#include "config-kdb-private.h" #include Q_DECLARE_LOGGING_CATEGORY(KDB_LOG) //! Debug command for the core KDb code #define kdbDebug(...) qCDebug(KDB_LOG, __VA_ARGS__) //! Warning command for the core KDb code #define kdbWarning(...) qCWarning(KDB_LOG, __VA_ARGS__) //! Critical command for the core KDb code #define kdbCritical(...) qCCritical(KDB_LOG, __VA_ARGS__) #ifdef KDB_EXPRESSION_DEBUG # define ExpressionDebug kdbDebug() #else # define ExpressionDebug if (1) {} else kdbDebug() #endif #ifdef KDB_DRIVERMANAGER_DEBUG # define drivermanagerDebug(...) kdbDebug(__VA_ARGS__) #else # define drivermanagerDebug(...) if (1) {} else kdbDebug(__VA_ARGS__) #endif #ifdef KDB_TRANSACTIONS_DEBUG # define transactionsDebug(...) kdbDebug(__VA_ARGS__) #else # define transactionsDebug(...) if (1) {} else kdbDebug(__VA_ARGS__) #endif +#ifdef KDB_QUERYSCHEMA_DEBUG +# define querySchemaDebug(...) kdbDebug(__VA_ARGS__) +#else +# define querySchemaDebug(...) if (1) {} else kdbDebug(__VA_ARGS__) +#endif + +#ifdef KDB_SQLPARSER_DEBUG +# define sqlParserDebug(...) kdbDebug(__VA_ARGS__) +#else +# define sqlParserDebug(...) if (1) {} else kdbDebug(__VA_ARGS__) +#endif + #endif diff --git a/src/parser/KDbSqlParser.y b/src/parser/KDbSqlParser.y index 3bc8acad..c959754f 100644 --- a/src/parser/KDbSqlParser.y +++ b/src/parser/KDbSqlParser.y @@ -1,1449 +1,1449 @@ /* This file is part of the KDE project Copyright (C) 2004 Lucijan Busch Copyright (C) 2004-2016 Jarosław Staniek This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ // To keep binary compatibility, do not reorder tokens! Add new only at the end. %token SQL_TYPE %token AS %token AS_EMPTY /* used for aliases with skipped AS keyword */ %token ASC %token AUTO_INCREMENT %token BIT %token BITWISE_SHIFT_LEFT %token BITWISE_SHIFT_RIGHT %token BY %token CHARACTER_STRING_LITERAL %token CONCATENATION /* || */ %token CREATE %token DESC %token DISTINCT %token DOUBLE_QUOTED_STRING %token FROM %token JOIN %token KEY %token LEFT %token LESS_OR_EQUAL %token GREATER_OR_EQUAL %token SQL_NULL %token SQL_IS %token SQL_IS_NULL /*helper */ %token SQL_IS_NOT_NULL /*helper */ %token ORDER %token PRIMARY %token SELECT %token INTEGER_CONST %token REAL_CONST %token RIGHT %token SQL_ON %token DATE_CONST %token DATETIME_CONST %token TIME_CONST %token TABLE %token IDENTIFIER %token IDENTIFIER_DOT_ASTERISK %token QUERY_PARAMETER %token VARCHAR %token WHERE %token SQL %token SQL_TRUE %token SQL_FALSE %token UNION %token SCAN_ERROR //%token SQL_ABS //%token ACOS //%token AMPERSAND //%token SQL_ABSOLUTE //%token ADA //%token ADD //%token ADD_DAYS //%token ADD_HOURS //%token ADD_MINUTES //%token ADD_MONTHS //%token ADD_SECONDS //%token ADD_YEARS //%token ALL //%token ALLOCATE //%token ALTER %token AND //%token ANY //%token ARE //%token ASIN //%token ASCII //%token ASSERTION //%token ATAN //%token ATAN2 //%token AUTHORIZATION //%token AVG //%token BEFORE %token BETWEEN %token NOT_BETWEEN //%token SQL_BEGIN //%token BIGINT //%token BINARY //%token BIT_LENGTH //%token BREAK //%token CASCADE //%token CASCADED //%token CASE //%token CAST //%token CATALOG //%token CEILING //%token CENTER //%token SQL_CHAR //%token CHAR_LENGTH //%token CHECK //%token CLOSE //%token COALESCE //%token COBOL //%token COLLATE //%token COLLATION //%token COLUMN //%token COMMIT //%token COMPUTE //%token CONCAT //%token CONNECT //%token CONNECTION //%token CONSTRAINT //%token CONSTRAINTS //%token CONTINUE //%token CONVERT //%token CORRESPONDING //%token COS //%token COT //%token COUNT //%token CURDATE //%token CURRENT //%token CURRENT_DATE //%token CURRENT_TIME //%token CURRENT_TIMESTAMP //%token CURTIME //%token CURSOR //%token DATABASE //%token SQL_DATE //%token DATE_FORMAT //%token DATE_REMAINDER //%token DATE_VALUE //%token DAY //%token DAYOFMONTH //%token DAYOFWEEK //%token DAYOFYEAR //%token DAYS_BETWEEN //%token DEALLOCATE //%token DEC //%token DECLARE //%token DEFAULT //%token DEFERRABLE //%token DEFERRED //%token SQL_DELETE //%token DESCRIBE //%token DESCRIPTOR //%token DIAGNOSTICS //%token DICTIONARY //%token DIRECTORY //%token DISCONNECT //%token DISPLACEMENT //%token DOMAIN_TOKEN //%token SQL_DOUBLE //%token DROP //%token ELSE //%token END //%token END_EXEC //%token ESCAPE %token EXCEPT //%token SQL_EXCEPTION //%token EXEC //%token EXECUTE //%token EXISTS //%token EXP //%token EXPONENT //%token EXTERNAL //%token EXTRACT //%token FETCH //%token FIRST //%token SQL_FLOAT //%token FLOOR //%token FN //%token FOR //%token FOREIGN //%token FORTRAN //%token FOUND //%token FOUR_DIGITS //%token FULL //%token GET //%token GLOBAL //%token GO //%token GOTO //%token GRANT //conflict %token GROUP //%token HAVING //%token HOUR //%token HOURS_BETWEEN //%token IDENTITY //%token IFNULL //%token SQL_IGNORE //%token IMMEDIATE //%token INCLUDE //%token INDEX //%token INDICATOR //%token INITIALLY //%token INNER //%token SQL_INPUT %token SQL_IN //%token INSENSITIVE //%token INSERT //%token INTEGER %token INTERSECT //%token INTERVAL //%token INTO //%token IS //%token ISOLATION //%token JUSTIFY //%token LANGUAGE //%token LAST //%token LCASE //%token LENGTH //%token LEVEL %token LIKE %token ILIKE %token NOT_LIKE //%token LINE_WIDTH //%token LOCAL //%token LOCATE //%token LOG //%token SQL_LONG //%token LOWER //%token LTRIM //%token LTRIP //%token MATCH //%token SQL_MAX //%token MICROSOFT //%token SQL_MIN //%token MINUTE //%token MINUTES_BETWEEN //%token MOD //%token MODIFY //%token MODULE //%token MONTH //%token MONTHS_BETWEEN //%token MUMPS //%token NAMES //%token NATIONAL //%token NCHAR //%token NEXT //%token NODUP //%token NONE %token NOT %token NOT_EQUAL %token NOT_EQUAL2 //%token NOW //%token NULLIF //%token NUMERIC //%token OCTET_LENGTH //%token ODBC //%token OF //%token SQL_OFF //%token ONLY //%token OPEN //%token OPTION //%token OUTER //%token OUTPUT //%token OVERLAPS //%token PAGE //%token PARTIAL //%token SQL_PASCAL //%token PERSISTENT //%token CQL_PI %token OR //%token PLI //%token POSITION //%token PRECISION //%token PREPARE //%token PRESERVE //%token PRIOR //%token PRIVILEGES //%token PROCEDURE //%token PRODUCT //%token PUBLIC //%token QUARTER //%token QUIT //%token RAND //%token READ_ONLY //%token REAL //%token REFERENCES //%token REPEAT //%token REPLACE //%token RESTRICT //%token REVOKE //%token ROLLBACK //%token ROWS //%token RPAD //%token RTRIM //%token SCHEMA //%token SCREEN_WIDTH //%token SCROLL //%token SECOND //%token SECONDS_BETWEEN //%token SEQUENCE //%token SETOPT //%token SET //%token SHOWOPT //%token SIGN %token SIMILAR_TO %token NOT_SIMILAR_TO //%token SIN //%token SQL_SIZE //%token SMALLINT //%token SOME //%token SPACE //%token SQLCA //%token SQLCODE //%token SQLERROR //%token SQLSTATE //%token SQLWARNING //%token SQRT //%token STDEV //%token SUBSTRING //%token SUM //%token SYSDATE //%token SYSDATE_FORMAT //%token SYSTEM //%token TAN //%token TEMPORARY //%token THEN //%token THREE_DIGITS //%token TIME //%token TIMESTAMP //%token TIMEZONE_HOUR //%token TIMEZONE_MINUTE //%token TINYINT //%token TO //%token TO_CHAR //%token TO_DATE //%token TRANSACTION //%token TRANSLATE //%token TRANSLATION //%token TRUNCATE //%token GENERAL_TITLE //%token TWO_DIGITS //%token UCASE //%token UNIQUE //%token SQL_UNKNOWN //%token UNSIGNED_INTEGER //%token UPDATE //%token UPPER //%token USAGE //%token USER //%token ERROR_DIGIT_BEFORE_IDENTIFIER //%token USING //%token VALUE //%token VALUES //%token VARBINARY //%token VARYING //%token VENDOR //%token VIEW //%token WEEK //%token WHEN //%token WHENEVER //%token WHERE_CURRENT_OF //%token WITH //%token WORD_WRAPPED //%token WORK //%token WRAPPED %token XOR //%token YEAR //%token YEARS_BETWEEN %type IDENTIFIER %type IDENTIFIER_DOT_ASTERISK %type QUERY_PARAMETER %type CHARACTER_STRING_LITERAL %type DOUBLE_QUOTED_STRING /* %type ColExpression %type ColView */ %type ColExpression %type ColWildCard //%type ColView %type ColItem %type ColViews %type aExpr %type aExpr2 %type aExpr3 %type aExpr4 %type aExpr5 %type aExpr6 %type aExpr7 %type aExpr8 %type aExpr9 %type aExpr10 %type aExprList %type aExprList2 %type WhereClause %type OrderByClause %type OrderByOption %type OrderByColumnId %type SelectOptions %type FlatTable %type Tables %type FlatTableList %type SelectStatement %type Select /*todo : list*/ %type StatementList -/*todo: not onlu select*/ +/*todo: not only select*/ %type Statement %type SQL_TYPE %type INTEGER_CONST %type REAL_CONST /*%type SIGNED_INTEGER */ %{ #include #include #include #include #include //! @todo OK? #ifdef Q_OS_WIN //workaround for bug on msvc # undef LLONG_MIN #endif #ifndef LLONG_MAX # define LLONG_MAX 0x7fffffffffffffffLL #endif #ifndef LLONG_MIN # define LLONG_MIN 0x8000000000000000LL #endif #ifndef LLONG_MAX # define ULLONG_MAX 0xffffffffffffffffLL #endif #ifdef _WIN32 # include #endif #include #include #include #include "KDbConnection.h" #include "KDbExpression.h" #include "KDbField.h" #include "KDbOrderByColumn.h" #include "KDbParser.h" #include "KDbParser_p.h" #include "KDbQuerySchema.h" #include "KDbQuerySchema_p.h" #include "KDbSqlTypes.h" #include "KDbTableSchema.h" #include "kdb_debug.h" struct OrderByColumnInternal; #ifdef Q_OS_SOLARIS #include #endif QDebug operator<<(QDebug dbg, const KDbExpressionPtr& expr) { dbg.nospace() << expr.e; return dbg.space(); } int yylex(); #define YY_NO_UNPUT #define YYSTACK_USE_ALLOCA 1 #define YYMAXDEPTH 255 extern "C" { int yywrap() { return 1; } } %} %union { QString* stringValue; QByteArray* binaryValue; qint64 integerValue; bool booleanValue; KDbOrderByColumn::SortOrder sortOrderValue; KDbField::Type colType; KDbField *field; KDbExpression *expr; KDbNArgExpression *exprList; KDbConstExpression *constExpression; KDbQuerySchema *querySchema; SelectOptionsInternal *selectOptions; QList *orderByColumns; QVariant *variantValue; } /* precedence: lowest to highest */ //%nonassoc SIMILAR //%nonassoc ESCAPE //%nonassoc OVERLAPS //%nonassoc IN_P //%left POSTFIXOP // dummy for postfix Op rules //%left Op OPERATOR // multi-character ops and user-defined operators //%nonassoc NOTNULL //%nonassoc ISNULL //%nonassoc IS // sets precedence for IS NULL, etc //%nonassoc NULL_P //%nonassoc TRUE_P //%nonassoc FALSE_P %token UMINUS // <-- To keep binary compatibility insert new tokens here. /* * These might seem to be low-precedence, but actually they are not part * of the arithmetic hierarchy at all in their use as JOIN operators. * We make them high-precedence to support their use as function names. * They wouldn't be given a precedence at all, were it not that we need * left-associativity among the JOIN rules themselves. */ /* %left JOIN %left UNIONJOIN %left CROSS %left LEFT %left FULL %left RIGHT %left INNER_P %left NATURAL */ %% TopLevelStatement : StatementList { //todo: multiple statements //todo: not only "select" statements KDbParserPrivate::get(globalParser)->setStatementType(KDbParser::Select); KDbParserPrivate::get(globalParser)->setQuerySchema($1); } ; StatementList: Statement ';' StatementList { //todo: multiple statements } | Statement | Statement ';' { $$ = $1; } ; /* Statement CreateTableStatement { YYACCEPT; } | Statement SelectStatement { } */ Statement : /*CreateTableStatement { YYACCEPT; } | */ SelectStatement { $$ = $1; } ; /*CreateTableStatement : CREATE TABLE IDENTIFIER { globalParser->setStatementType(KDbParser::CreateTable); globalParser->createTable($3->toLatin1()); delete $3; } '(' ColDefs ')' ; ColDefs: ColDefs ',' ColDef|ColDef { } ; ColDef: IDENTIFIER ColType { - kdbDebug() << "adding field " << *$1; + sqlParserDebug() << "adding field " << *$1; globalField->setName(*$1); globalParser->table()->addField(globalField); globalField = nullptr; delete $1; } | IDENTIFIER ColType ColKeys { - kdbDebug() << "adding field " << *$1; + sqlParserDebug() << "adding field " << *$1; globalField->setName(*$1); delete $1; globalParser->table()->addField(globalField); // if(globalField->isPrimaryKey()) // globalParser->table()->addPrimaryKey(globalField->name()); // delete globalField; // globalField = nullptr; } ; ColKeys: ColKeys ColKey|ColKey { } ; ColKey: PRIMARY KEY { globalField->setPrimaryKey(true); - kdbDebug() << "primary"; + sqlParserDebug() << "primary"; } | NOT SQL_NULL { globalField->setNotNull(true); - kdbDebug() << "not_null"; + sqlParserDebug() << "not_null"; } | AUTO_INCREMENT { globalField->setAutoIncrement(true); - kdbDebug() << "ainc"; + sqlParserDebug() << "ainc"; } ; ColType: SQL_TYPE { globalField = new KDbField(); globalField->setType($1); } | SQL_TYPE '(' INTEGER_CONST ')' { - kdbDebug() << "sql + length"; + sqlParserDebug() << "sql + length"; globalField = new KDbField(); globalField->setPrecision($3); globalField->setType($1); } | VARCHAR '(' INTEGER_CONST ')' { globalField = new KDbField(); globalField->setPrecision($3); globalField->setType(KDbField::Text); } | %empty { // SQLITE compatibillity globalField = new KDbField(); globalField->setType(KDbField::InvalidType); } ;*/ SelectStatement: Select { - kdbDebug() << "Select"; + sqlParserDebug() << "Select"; if (!($$ = buildSelectQuery( $1, nullptr ))) YYABORT; } | Select ColViews { - kdbDebug() << "Select ColViews=" << *$2; + sqlParserDebug() << "Select ColViews=" << *$2; if (!($$ = buildSelectQuery( $1, $2 ))) YYABORT; } | Select ColViews Tables { if (!($$ = buildSelectQuery( $1, $2, $3 ))) YYABORT; } | Select Tables { - kdbDebug() << "Select ColViews Tables"; + sqlParserDebug() << "Select ColViews Tables"; if (!($$ = buildSelectQuery( $1, nullptr, $2 ))) YYABORT; } | Select ColViews SelectOptions { - kdbDebug() << "Select ColViews Conditions"; + sqlParserDebug() << "Select ColViews Conditions"; if (!($$ = buildSelectQuery( $1, $2, nullptr, $3 ))) YYABORT; } | Select Tables SelectOptions { - kdbDebug() << "Select Tables SelectOptions"; + sqlParserDebug() << "Select Tables SelectOptions"; if (!($$ = buildSelectQuery( $1, nullptr, $2, $3 ))) YYABORT; } | Select ColViews Tables SelectOptions { - kdbDebug() << "Select ColViews Tables SelectOptions"; + sqlParserDebug() << "Select ColViews Tables SelectOptions"; if (!($$ = buildSelectQuery( $1, $2, $3, $4 ))) YYABORT; } ; Select: SELECT { - kdbDebug() << "SELECT"; + sqlParserDebug() << "SELECT"; $$ = KDbParserPrivate::get(globalParser)->createQuery(); } ; SelectOptions: /* todo: more options (having, group by, limit...) */ WhereClause { - kdbDebug() << "WhereClause"; + sqlParserDebug() << "WhereClause"; $$ = new SelectOptionsInternal; $$->whereExpr = *$1; delete $1; } | ORDER BY OrderByClause { - kdbDebug() << "OrderByClause"; + sqlParserDebug() << "OrderByClause"; $$ = new SelectOptionsInternal; $$->orderByColumns = $3; } | WhereClause ORDER BY OrderByClause { - kdbDebug() << "WhereClause ORDER BY OrderByClause"; + sqlParserDebug() << "WhereClause ORDER BY OrderByClause"; $$ = new SelectOptionsInternal; $$->whereExpr = *$1; delete $1; $$->orderByColumns = $4; } | ORDER BY OrderByClause WhereClause { - kdbDebug() << "OrderByClause WhereClause"; + sqlParserDebug() << "OrderByClause WhereClause"; $$ = new SelectOptionsInternal; $$->whereExpr = *$4; delete $4; $$->orderByColumns = $3; } ; WhereClause: WHERE aExpr { $$ = $2; } ; /* todo: support "ORDER BY NULL" as described here https://dev.mysql.com/doc/refman/5.1/en/select.html */ /* todo: accept expr and position as well */ OrderByClause: OrderByColumnId { - kdbDebug() << "ORDER BY IDENTIFIER"; + sqlParserDebug() << "ORDER BY IDENTIFIER"; $$ = new QList; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *$1 ); $$->append( orderByColumn ); delete $1; } | OrderByColumnId OrderByOption { - kdbDebug() << "ORDER BY IDENTIFIER OrderByOption"; + sqlParserDebug() << "ORDER BY IDENTIFIER OrderByOption"; $$ = new QList; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *$1 ); orderByColumn.order = $2; $$->append( orderByColumn ); delete $1; } | OrderByColumnId ',' OrderByClause { $$ = $3; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *$1 ); $$->append( orderByColumn ); delete $1; } | OrderByColumnId OrderByOption ',' OrderByClause { $$ = $4; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *$1 ); orderByColumn.order = $2; $$->append( orderByColumn ); delete $1; } ; OrderByColumnId: IDENTIFIER { $$ = new QVariant( *$1 ); - kdbDebug() << "OrderByColumnId: " << *$$; + sqlParserDebug() << "OrderByColumnId: " << *$$; delete $1; } | IDENTIFIER '.' IDENTIFIER { $$ = new QVariant( *$1 + QLatin1Char('.') + *$3 ); - kdbDebug() << "OrderByColumnId: " << *$$; + sqlParserDebug() << "OrderByColumnId: " << *$$; delete $1; delete $3; } | INTEGER_CONST { $$ = new QVariant($1); - kdbDebug() << "OrderByColumnId: " << *$$; + sqlParserDebug() << "OrderByColumnId: " << *$$; } OrderByOption: ASC { $$ = KDbOrderByColumn::SortOrder::Ascending; } | DESC { $$ = KDbOrderByColumn::SortOrder::Descending; } ; aExpr: aExpr2 ; /* --- binary logical --- */ aExpr2: aExpr3 AND aExpr2 { -// kdbDebug() << "AND " << $3.debugString(); +// sqlParserDebug() << "AND " << $3.debugString(); $$ = new KDbBinaryExpression(*$1, KDbToken::AND, *$3); delete $1; delete $3; } | aExpr3 OR aExpr2 { $$ = new KDbBinaryExpression(*$1, KDbToken::OR, *$3); delete $1; delete $3; } | aExpr3 XOR aExpr2 { $$ = new KDbBinaryExpression(*$1, KDbToken::XOR, *$3); delete $1; delete $3; } | aExpr3 ; /* relational op precedence */ aExpr3: aExpr4 '>' %prec GREATER_OR_EQUAL aExpr3 { $$ = new KDbBinaryExpression(*$1, '>', *$3); delete $1; delete $3; } | aExpr4 GREATER_OR_EQUAL aExpr3 { $$ = new KDbBinaryExpression(*$1, KDbToken::GREATER_OR_EQUAL, *$3); delete $1; delete $3; } | aExpr4 '<' %prec LESS_OR_EQUAL aExpr3 { $$ = new KDbBinaryExpression(*$1, '<', *$3); delete $1; delete $3; } | aExpr4 LESS_OR_EQUAL aExpr3 { $$ = new KDbBinaryExpression(*$1, KDbToken::LESS_OR_EQUAL, *$3); delete $1; delete $3; } | aExpr4 '=' aExpr3 { $$ = new KDbBinaryExpression(*$1, '=', *$3); delete $1; delete $3; } | aExpr4 ; /* relational (equality) op precedence */ aExpr4: aExpr5 NOT_EQUAL aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::NOT_EQUAL, *$3); delete $1; delete $3; } | aExpr5 NOT_EQUAL2 aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::NOT_EQUAL2, *$3); delete $1; delete $3; } | aExpr5 LIKE aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::LIKE, *$3); delete $1; delete $3; } | aExpr5 NOT_LIKE aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::NOT_LIKE, *$3); delete $1; delete $3; } | aExpr5 SQL_IN aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::SQL_IN, *$3); delete $1; delete $3; } | aExpr5 SIMILAR_TO aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::SIMILAR_TO, *$3); delete $1; delete $3; } | aExpr5 NOT_SIMILAR_TO aExpr4 { $$ = new KDbBinaryExpression(*$1, KDbToken::NOT_SIMILAR_TO, *$3); delete $1; delete $3; } | aExpr5 BETWEEN aExpr4 AND aExpr4 { $$ = new KDbNArgExpression(KDb::RelationalExpression, KDbToken::BETWEEN_AND); $$->toNArg().append( *$1 ); $$->toNArg().append( *$3 ); $$->toNArg().append( *$5 ); delete $1; delete $3; delete $5; } | aExpr5 NOT_BETWEEN aExpr4 AND aExpr4 { $$ = new KDbNArgExpression(KDb::RelationalExpression, KDbToken::NOT_BETWEEN_AND); $$->toNArg().append( *$1 ); $$->toNArg().append( *$3 ); $$->toNArg().append( *$5 ); delete $1; delete $3; delete $5; } | aExpr5 ; /* --- unary logical right --- */ aExpr5: aExpr5 SQL_IS_NULL { $$ = new KDbUnaryExpression( KDbToken::SQL_IS_NULL, *$1 ); delete $1; } | aExpr5 SQL_IS_NOT_NULL { $$ = new KDbUnaryExpression( KDbToken::SQL_IS_NOT_NULL, *$1 ); delete $1; } | aExpr6 ; /* arithm. lowest precedence */ aExpr6: aExpr7 BITWISE_SHIFT_LEFT aExpr6 { $$ = new KDbBinaryExpression(*$1, KDbToken::BITWISE_SHIFT_LEFT, *$3); delete $1; delete $3; } | aExpr7 BITWISE_SHIFT_RIGHT aExpr6 { $$ = new KDbBinaryExpression(*$1, KDbToken::BITWISE_SHIFT_RIGHT, *$3); delete $1; delete $3; } | aExpr7 ; /* arithm. lower precedence */ aExpr7: aExpr8 '+' aExpr7 { $$ = new KDbBinaryExpression(*$1, '+', *$3); delete $1; delete $3; } | aExpr8 CONCATENATION aExpr7 { $$ = new KDbBinaryExpression(*$1, KDbToken::CONCATENATION, *$3); delete $1; delete $3; } | aExpr8 '-' %prec UMINUS aExpr7 { $$ = new KDbBinaryExpression(*$1, '-', *$3); delete $1; delete $3; } | aExpr8 '&' aExpr7 { $$ = new KDbBinaryExpression(*$1, '&', *$3); delete $1; delete $3; } | aExpr8 '|' aExpr7 { $$ = new KDbBinaryExpression(*$1, '|', *$3); delete $1; delete $3; } | aExpr8 ; /* arithm. higher precedence */ aExpr8: aExpr9 '/' aExpr8 { $$ = new KDbBinaryExpression(*$1, '/', *$3); delete $1; delete $3; } | aExpr9 '*' aExpr8 { $$ = new KDbBinaryExpression(*$1, '*', *$3); delete $1; delete $3; } | aExpr9 '%' aExpr8 { $$ = new KDbBinaryExpression(*$1, '%', *$3); delete $1; delete $3; } | aExpr9 ; /* parenthesis, unary operators, and terminals precedence */ aExpr9: /* --- unary logical left --- */ '-' aExpr9 { $$ = new KDbUnaryExpression( '-', *$2 ); delete $2; } | '+' aExpr9 { $$ = new KDbUnaryExpression( '+', *$2 ); delete $2; } | '~' aExpr9 { $$ = new KDbUnaryExpression( '~', *$2 ); delete $2; } | NOT aExpr9 { $$ = new KDbUnaryExpression( KDbToken::NOT, *$2 ); delete $2; } | IDENTIFIER { $$ = new KDbVariableExpression( *$1 ); //! @todo simplify this later if that's 'only one field name' expression - kdbDebug() << " + identifier: " << *$1; + sqlParserDebug() << " + identifier: " << *$1; delete $1; } | QUERY_PARAMETER { $$ = new KDbQueryParameterExpression( *$1 ); - kdbDebug() << " + query parameter:" << *$$; + sqlParserDebug() << " + query parameter:" << *$$; delete $1; } | IDENTIFIER aExprList { - kdbDebug() << " + function:" << *$1 << "(" << *$2 << ")"; + sqlParserDebug() << " + function:" << *$1 << "(" << *$2 << ")"; $$ = new KDbFunctionExpression(*$1, *$2); delete $1; delete $2; } /*! @todo shall we also support db name? */ | IDENTIFIER '.' IDENTIFIER { $$ = new KDbVariableExpression( *$1 + QLatin1Char('.') + *$3 ); - kdbDebug() << " + identifier.identifier:" << *$1 << "." << *$3; + sqlParserDebug() << " + identifier.identifier:" << *$1 << "." << *$3; delete $1; delete $3; } | SQL_NULL { $$ = new KDbConstExpression( KDbToken::SQL_NULL, QVariant() ); - kdbDebug() << " + NULL"; + sqlParserDebug() << " + NULL"; // $$ = new KDbField(); //$$->setName(QString::null); } | SQL_TRUE { $$ = new KDbConstExpression( KDbToken::SQL_TRUE, true ); } | SQL_FALSE { $$ = new KDbConstExpression( KDbToken::SQL_FALSE, false ); } | CHARACTER_STRING_LITERAL { $$ = new KDbConstExpression( KDbToken::CHARACTER_STRING_LITERAL, *$1 ); - kdbDebug() << " + constant " << $1; + sqlParserDebug() << " + constant " << $1; delete $1; } | INTEGER_CONST { QVariant val; if ($1 <= INT_MAX && $1 >= INT_MIN) val = (int)$1; else if ($1 <= UINT_MAX && $1 >= 0) val = (uint)$1; else if ($1 <= LLONG_MAX && $1 >= LLONG_MIN) val = (qint64)$1; // if ($1 < ULLONG_MAX) // val = (quint64)$1; //! @todo ok? $$ = new KDbConstExpression( KDbToken::INTEGER_CONST, val ); - kdbDebug() << " + int constant: " << val.toString(); + sqlParserDebug() << " + int constant: " << val.toString(); } | REAL_CONST { $$ = new KDbConstExpression( KDbToken::REAL_CONST, *$1 ); - kdbDebug() << " + real constant: " << *$1; + sqlParserDebug() << " + real constant: " << *$1; delete $1; } | aExpr10 ; aExpr10: '(' aExpr ')' { - kdbDebug() << "(expr)"; + sqlParserDebug() << "(expr)"; $$ = new KDbUnaryExpression('(', *$2); delete $2; } ; aExprList: '(' aExprList2 ')' { $$ = $2; } | '(' ')' { $$ = new KDbNArgExpression(KDb::ArgumentListExpression, ','); } ; aExprList2: aExpr ',' aExprList2 { $$ = $3; $$->prepend( *$1 ); delete $1; } | aExpr { $$ = new KDbNArgExpression(KDb::ArgumentListExpression, ','); $$->append( *$1 ); delete $1; } ; Tables: FROM FlatTableList { $$ = $2; } /* | Tables LEFT JOIN IDENTIFIER SQL_ON ColExpression { - kdbDebug() << "LEFT JOIN: '" << *$4 << "' ON " << $6; + sqlParserDebug() << "LEFT JOIN: '" << *$4 << "' ON " << $6; addTable($4->toQString()); delete $4; } | Tables LEFT OUTER JOIN IDENTIFIER SQL_ON ColExpression { - kdbDebug() << "LEFT OUTER JOIN: '" << $5 << "' ON " << $7; + sqlParserDebug() << "LEFT OUTER JOIN: '" << $5 << "' ON " << $7; addTable($5); } | Tables INNER JOIN IDENTIFIER SQL_ON ColExpression { - kdbDebug() << "INNER JOIN: '" << *$4 << "' ON " << $6; + sqlParserDebug() << "INNER JOIN: '" << *$4 << "' ON " << $6; addTable($4->toQString()); delete $4; } | Tables RIGHT JOIN IDENTIFIER SQL_ON ColExpression { - kdbDebug() << "RIGHT JOIN: '" << *$4 << "' ON " << $6; + sqlParserDebug() << "RIGHT JOIN: '" << *$4 << "' ON " << $6; addTable(*$4); delete $4; } | Tables RIGHT OUTER JOIN IDENTIFIER SQL_ON ColExpression { - kdbDebug() << "RIGHT OUTER JOIN: '" << *$5 << "' ON " << $7; + sqlParserDebug() << "RIGHT OUTER JOIN: '" << *$5 << "' ON " << $7; addTable($5->toQString()); delete $5; }*/ ; /* FlatTableList: aFlatTableList { $$ } ;*/ FlatTableList: FlatTableList ',' FlatTable { $$ = $1; $$->append(*$3); delete $3; } |FlatTable { $$ = new KDbNArgExpression(KDb::TableListExpression, KDbToken::IDENTIFIER); //ok? $$->append(*$1); delete $1; } ; FlatTable: IDENTIFIER { - kdbDebug() << "FROM: '" << *$1 << "'"; + sqlParserDebug() << "FROM: '" << *$1 << "'"; $$ = new KDbVariableExpression(*$1); //! @todo this isn't ok for more tables: /* KDbField::ListIterator it = globalParser->query()->fieldsIterator(); for(KDbField *item; (item = it.current()); ++it) { if(item->table() == dummy) { item->setTable(schema); } if(item->table() && !item->isQueryAsterisk()) { KDbField *f = item->table()->field(item->name()); if(!f) { KDbParserError err(KDbParser::tr("Field List Error"), KDbParser::tr("Unknown column '%1' in table '%2'",item->name(),schema->name()), ctoken, current); globalParser->setError(err); yyerror("fieldlisterror"); } } }*/ delete $1; } | IDENTIFIER IDENTIFIER { //table + alias $$ = new KDbBinaryExpression( KDbVariableExpression(*$1), KDbToken::AS_EMPTY, KDbVariableExpression(*$2) ); delete $1; delete $2; } | IDENTIFIER AS IDENTIFIER { //table + alias $$ = new KDbBinaryExpression( KDbVariableExpression(*$1), KDbToken::AS, KDbVariableExpression(*$3) ); delete $1; delete $3; } ; ColViews: ColViews ',' ColItem { $$ = $1; $$->append(*$3); delete $3; - kdbDebug() << "ColViews: ColViews , ColItem"; + sqlParserDebug() << "ColViews: ColViews , ColItem"; } |ColItem { $$ = new KDbNArgExpression(KDb::FieldListExpression, KDbToken()); $$->append(*$1); delete $1; - kdbDebug() << "ColViews: ColItem"; + sqlParserDebug() << "ColViews: ColItem"; } ; ColItem: ColExpression { // $$ = new KDbField(); // dummy->addField($$); // $$->setExpression( $1 ); // globalParser->query()->addField($$); $$ = $1; - kdbDebug() << " added column expr:" << *$1; + sqlParserDebug() << " added column expr:" << *$1; } | ColWildCard { $$ = $1; - kdbDebug() << " added column wildcard:" << *$1; + sqlParserDebug() << " added column wildcard:" << *$1; } | ColExpression AS IDENTIFIER { $$ = new KDbBinaryExpression( *$1, KDbToken::AS, KDbVariableExpression(*$3) ); - kdbDebug() << " added column expr:" << *$$; + sqlParserDebug() << " added column expr:" << *$$; delete $1; delete $3; } | ColExpression IDENTIFIER { $$ = new KDbBinaryExpression( *$1, KDbToken::AS_EMPTY, KDbVariableExpression(*$2) ); - kdbDebug() << " added column expr:" << *$$; + sqlParserDebug() << " added column expr:" << *$$; delete $1; delete $2; } ; ColExpression: aExpr { $$ = $1; } /* HANDLED BY 'IDENTIFIER aExprList' | IDENTIFIER '(' ColViews ')' { $$ = new KDbFunctionExpression( $1, $3 ); }*/ //! @todo /* | SUM '(' ColExpression ')' { KDbFunctionExpression( // $$ = new AggregationExpression( SUM, ); // $$->setName("SUM(" + $3->name() + ")"); //wait $$->containsGroupingAggregate(true); //wait globalParser->query()->grouped(true); }*/ //! @todo /* | SQL_MIN '(' ColExpression ')' { $$ = $3; // $$->setName("MIN(" + $3->name() + ")"); //wait $$->containsGroupingAggregate(true); //wait globalParser->query()->grouped(true); }*/ //! @todo /* | SQL_MAX '(' ColExpression ')' { $$ = $3; // $$->setName("MAX(" + $3->name() + ")"); //wait $$->containsGroupingAggregate(true); //wait globalParser->query()->grouped(true); }*/ //! @todo /* | AVG '(' ColExpression ')' { $$ = $3; // $$->setName("AVG(" + $3->name() + ")"); //wait $$->containsGroupingAggregate(true); //wait globalParser->query()->grouped(true); }*/ | DISTINCT '(' ColExpression ')' { $$ = $3; //! @todo DISTINCT '(' ColExpression ')' // $$->setName("DISTINCT(" + $3->name() + ")"); } ; ColWildCard: '*' { $$ = new KDbVariableExpression(QLatin1String("*")); - kdbDebug() << "all columns"; + sqlParserDebug() << "all columns"; // KDbQueryAsterisk *ast = new KDbQueryAsterisk(globalParser->query(), dummy); // globalParser->query()->addAsterisk(ast); // requiresTable = true; } | IDENTIFIER '.' '*' { QString s( *$1 ); s += QLatin1String(".*"); $$ = new KDbVariableExpression(s); - kdbDebug() << " + all columns from " << s; + sqlParserDebug() << " + all columns from " << s; delete $1; } /*| ERROR_DIGIT_BEFORE_IDENTIFIER { $$ = new KDbVariableExpression($1); - kdbDebug() << " Invalid identifier! " << $1; + sqlParserDebug() << " Invalid identifier! " << $1; setError(KDbParser::tr("Invalid identifier \"%1\"",$1)); }*/ ; %% diff --git a/src/parser/KDbSqlScanner.l b/src/parser/KDbSqlScanner.l index 786d42e7..944ea04f 100644 --- a/src/parser/KDbSqlScanner.l +++ b/src/parser/KDbSqlScanner.l @@ -1,336 +1,336 @@ /* This file is part of the KDE project Copyright (C) 2004 Lucijan Busch Copyright (C) 2004-2015 Jarosław Staniek This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ %{ #include "sqlparser.h" #include "KDb.h" #include "KDbExpression.h" #include "KDbParser.h" #include "KDbSqlTypes.h" #include "kdb_debug.h" extern int globalCurrentPos; extern QByteArray globalToken; #define YY_NO_UNPUT #define ECOUNT globalCurrentPos += yyleng; globalToken = yytext extern void setError(const QString& errDesc); extern void setError(const QString& errName, const QString& errDesc); %} /* *** Please reflect changes to this file in ../driver_p.cpp *** */ %option case-insensitive %option noyywrap %option never-interactive whitespace [ \t\n] digit [0-9] e_str1 (\\\'|\'\'|[^']) e_str2 (\\\"|\"\"|[^"]) string (\'{e_str1}*\'|\"{e_str2}*\") /*identifier [a-zA-Z_][a-zA-Z_0-9]* */ identifier [a-zA-Z_0-9]+ /* quoted_identifier (\"[a-zA-Z_0-9]+\") */ query_parameter \[[^\[\]]+\] integer {digit}+ decimal (({digit}*\.{digit}+)|({digit}+\.{digit}*)) real ((({digit}*\.{digit}+)|({digit}+\.{digit}*)|({digit}+))([Ee][-+]?{digit}+)) %% "<>" { ECOUNT; return NOT_EQUAL; } "!=" { ECOUNT; return NOT_EQUAL2; } "==" { ECOUNT; return '='; } "<=" { ECOUNT; return LESS_OR_EQUAL; } ">=" { ECOUNT; return GREATER_OR_EQUAL; } "IN" { ECOUNT; return SQL_IN; } {integer} { //! @todo what about hex or octal values? //we're using QString:toLongLong() here because atoll() is not so portable: ECOUNT; bool ok; yylval.integerValue = QByteArray(yytext).toLongLong(&ok); if (!ok) { setError(KDbParser::tr("Invalid integer number"), KDbParser::tr("This integer number may be too large.")); return SCAN_ERROR; } return INTEGER_CONST; } {decimal} { ECOUNT; yylval.binaryValue = new QByteArray(yytext, yyleng); return REAL_CONST; } ("AND"|"&&") { ECOUNT; return AND; } "AS" { ECOUNT; return AS; } "CREATE" { ECOUNT; return CREATE; } "FROM" { ECOUNT; return FROM; } "INTEGER" { ECOUNT; return SQL_TYPE; } "JOIN" { ECOUNT; return JOIN; } "LEFT" { ECOUNT; return LEFT; } "LIKE" { ECOUNT; return LIKE; } "NOT"{whitespace}+"LIKE" { ECOUNT; return NOT_LIKE; } "BETWEEN" { ECOUNT; return BETWEEN; } "NOT"{whitespace}+"BETWEEN" { ECOUNT; return NOT_BETWEEN; } "NOT"{whitespace}+"SIMILAR"{whitespace}+"TO" { ECOUNT; return NOT_SIMILAR_TO; } "SIMILAR"{whitespace}+"TO" { ECOUNT; return SIMILAR_TO; } "IS"{whitespace}+"NOT"{whitespace}+"NULL" { ECOUNT; return SQL_IS_NOT_NULL; } "IS"{whitespace}+"NULL" { ECOUNT; return SQL_IS_NULL; } "NOT" { ECOUNT; return NOT; } "IS" { ECOUNT; return SQL_IS; } "NULL" { ECOUNT; return SQL_NULL; } "TRUE" { ECOUNT; return SQL_TRUE; } "FALSE" { ECOUNT; return SQL_FALSE; } "ON" { ECOUNT; return SQL_ON; } "OR" { ECOUNT; return OR; } "||" { /* also means OR for numbers (mysql) */ ECOUNT; return CONCATENATION; } "<<" { ECOUNT; return BITWISE_SHIFT_LEFT; } ">>" { ECOUNT; return BITWISE_SHIFT_RIGHT; } "XOR" { ECOUNT; return XOR; } "RIGHT" { ECOUNT; return RIGHT; } "SELECT" { ECOUNT; return SELECT; } "TABLE" { ECOUNT; return TABLE; } "WHERE" { ECOUNT; return WHERE; } "ORDER" { ECOUNT; return ORDER; } "BY" { ECOUNT; return BY; } "ASC" { ECOUNT; return ASC; } "DESC" { ECOUNT; return DESC; } {string} { ECOUNT; - //kdbDebug() << "{string} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{string} yytext: '" << yytext << "' (" << yyleng << ")"; int errorPosition; const QString unescaped( KDb::unescapeString(QString::fromUtf8(yytext+1, yyleng-2), yytext[0], &errorPosition)); if (errorPosition >= 0) { // sanity check setError(KDbParser::tr("Invalid string"), KDbParser::tr("Invalid character in string")); return SCAN_ERROR; } yylval.stringValue = new QString(unescaped); return CHARACTER_STRING_LITERAL; /* "ZZZ" sentinel for script */ } {identifier} { - kdbDebug() << "{identifier} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{identifier} yytext: '" << yytext << "' (" << yyleng << ")"; ECOUNT; if (yytext[0]>='0' && yytext[0]<='9') { setError(KDbParser::tr("Invalid identifier"), KDbParser::tr("Identifiers should start with a letter or '_' character")); return SCAN_ERROR; } yylval.stringValue = new QString(QString::fromUtf8(yytext, yyleng)); return IDENTIFIER; } {query_parameter} { - kdbDebug() << "{query_parameter} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{query_parameter} yytext: '" << yytext << "' (" << yyleng << ")"; ECOUNT; yylval.stringValue = new QString(QString::fromUtf8(yytext+1, yyleng-2)); return QUERY_PARAMETER; } {whitespace}+ { ECOUNT; } [\~\!\@\#\^\&\|\`\?,()\[\]\.;\:\+\-\*\/\%\^\<\>\=] { - kdbDebug() << "char: '" << yytext[0] << "'"; + sqlParserDebug() << "char: '" << yytext[0] << "'"; ECOUNT; return yytext[0]; } %% void tokenize(const char *data) { yy_switch_to_buffer(yy_scan_string(data)); globalToken.clear(); globalCurrentPos = 0; } diff --git a/src/parser/generated/sqlparser.cpp b/src/parser/generated/sqlparser.cpp index ba039607..905c9ad2 100644 --- a/src/parser/generated/sqlparser.cpp +++ b/src/parser/generated/sqlparser.cpp @@ -1,2698 +1,2698 @@ /* A Bison parser, made by GNU Bison 3.0.4. */ /* Bison implementation for Yacc-like parsers in C Copyright (C) 1984, 1989-1990, 2000-2015 Free Software Foundation, Inc. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . */ /* As a special exception, you may create a larger work that contains part or all of the Bison parser skeleton and distribute that work under terms of your choice, so long as that work isn't itself a parser generator using the skeleton or a modified version thereof as a parser skeleton. Alternatively, if you modify or redistribute the parser skeleton itself, you may (at your option) remove this special exception, which will cause the skeleton and the resulting Bison output files to be licensed under the GNU General Public License without this special exception. This special exception was added by the Free Software Foundation in version 2.2 of Bison. */ /* C LALR(1) parser skeleton written by Richard Stallman, by simplifying the original so-called "semantic" parser. */ /* All symbols defined below should begin with yy or YY, to avoid infringing on user name space. This should be done even for local variables, as they might otherwise be expanded by user macros. There are some unavoidable exceptions within include files to define necessary library symbols; they are noted "INFRINGES ON USER NAME SPACE" below. */ /* Identify Bison output. */ #define YYBISON 1 /* Bison version. */ #define YYBISON_VERSION "3.0.4" /* Skeleton name. */ #define YYSKELETON_NAME "yacc.c" /* Pure parsers. */ #define YYPURE 0 /* Push parsers. */ #define YYPUSH 0 /* Pull parsers. */ #define YYPULL 1 /* Copy the first part of user declarations. */ #line 421 "KDbSqlParser.y" /* yacc.c:339 */ #include #include #include #include #include //! @todo OK? #ifdef Q_OS_WIN //workaround for bug on msvc # undef LLONG_MIN #endif #ifndef LLONG_MAX # define LLONG_MAX 0x7fffffffffffffffLL #endif #ifndef LLONG_MIN # define LLONG_MIN 0x8000000000000000LL #endif #ifndef LLONG_MAX # define ULLONG_MAX 0xffffffffffffffffLL #endif #ifdef _WIN32 # include #endif #include #include #include #include "KDbConnection.h" #include "KDbExpression.h" #include "KDbField.h" #include "KDbOrderByColumn.h" #include "KDbParser.h" #include "KDbParser_p.h" #include "KDbQuerySchema.h" #include "KDbQuerySchema_p.h" #include "KDbSqlTypes.h" #include "KDbTableSchema.h" #include "kdb_debug.h" struct OrderByColumnInternal; #ifdef Q_OS_SOLARIS #include #endif QDebug operator<<(QDebug dbg, const KDbExpressionPtr& expr) { dbg.nospace() << expr.e; return dbg.space(); } int yylex(); #define YY_NO_UNPUT #define YYSTACK_USE_ALLOCA 1 #define YYMAXDEPTH 255 extern "C" { int yywrap() { return 1; } } #line 135 "sqlparser.cpp" /* yacc.c:339 */ # ifndef YY_NULLPTR # if defined __cplusplus && 201103L <= __cplusplus # define YY_NULLPTR nullptr # else # define YY_NULLPTR 0 # endif # endif /* Enabling verbose error messages. */ #ifdef YYERROR_VERBOSE # undef YYERROR_VERBOSE # define YYERROR_VERBOSE 1 #else # define YYERROR_VERBOSE 0 #endif /* In a future release of Bison, this section will be replaced by #include "KDbSqlParser.tab.h". */ #ifndef YY_YY_KDBSQLPARSER_TAB_H_INCLUDED # define YY_YY_KDBSQLPARSER_TAB_H_INCLUDED /* Debug traces. */ #ifndef YYDEBUG # define YYDEBUG 0 #endif #if YYDEBUG extern int yydebug; #endif /* Token type. */ #ifndef YYTOKENTYPE # define YYTOKENTYPE enum yytokentype { SQL_TYPE = 258, AS = 259, AS_EMPTY = 260, ASC = 261, AUTO_INCREMENT = 262, BIT = 263, BITWISE_SHIFT_LEFT = 264, BITWISE_SHIFT_RIGHT = 265, BY = 266, CHARACTER_STRING_LITERAL = 267, CONCATENATION = 268, CREATE = 269, DESC = 270, DISTINCT = 271, DOUBLE_QUOTED_STRING = 272, FROM = 273, JOIN = 274, KEY = 275, LEFT = 276, LESS_OR_EQUAL = 277, GREATER_OR_EQUAL = 278, SQL_NULL = 279, SQL_IS = 280, SQL_IS_NULL = 281, SQL_IS_NOT_NULL = 282, ORDER = 283, PRIMARY = 284, SELECT = 285, INTEGER_CONST = 286, REAL_CONST = 287, RIGHT = 288, SQL_ON = 289, DATE_CONST = 290, DATETIME_CONST = 291, TIME_CONST = 292, TABLE = 293, IDENTIFIER = 294, IDENTIFIER_DOT_ASTERISK = 295, QUERY_PARAMETER = 296, VARCHAR = 297, WHERE = 298, SQL = 299, SQL_TRUE = 300, SQL_FALSE = 301, UNION = 302, SCAN_ERROR = 303, AND = 304, BETWEEN = 305, NOT_BETWEEN = 306, EXCEPT = 307, SQL_IN = 308, INTERSECT = 309, LIKE = 310, ILIKE = 311, NOT_LIKE = 312, NOT = 313, NOT_EQUAL = 314, NOT_EQUAL2 = 315, OR = 316, SIMILAR_TO = 317, NOT_SIMILAR_TO = 318, XOR = 319, UMINUS = 320 }; #endif /* Value type. */ #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED union YYSTYPE { #line 490 "KDbSqlParser.y" /* yacc.c:355 */ QString* stringValue; QByteArray* binaryValue; qint64 integerValue; bool booleanValue; KDbOrderByColumn::SortOrder sortOrderValue; KDbField::Type colType; KDbField *field; KDbExpression *expr; KDbNArgExpression *exprList; KDbConstExpression *constExpression; KDbQuerySchema *querySchema; SelectOptionsInternal *selectOptions; QList *orderByColumns; QVariant *variantValue; #line 258 "sqlparser.cpp" /* yacc.c:355 */ }; typedef union YYSTYPE YYSTYPE; # define YYSTYPE_IS_TRIVIAL 1 # define YYSTYPE_IS_DECLARED 1 #endif extern YYSTYPE yylval; int yyparse (void); #endif /* !YY_YY_KDBSQLPARSER_TAB_H_INCLUDED */ /* Copy the second part of user declarations. */ #line 275 "sqlparser.cpp" /* yacc.c:358 */ #ifdef short # undef short #endif #ifdef YYTYPE_UINT8 typedef YYTYPE_UINT8 yytype_uint8; #else typedef unsigned char yytype_uint8; #endif #ifdef YYTYPE_INT8 typedef YYTYPE_INT8 yytype_int8; #else typedef signed char yytype_int8; #endif #ifdef YYTYPE_UINT16 typedef YYTYPE_UINT16 yytype_uint16; #else typedef unsigned short int yytype_uint16; #endif #ifdef YYTYPE_INT16 typedef YYTYPE_INT16 yytype_int16; #else typedef short int yytype_int16; #endif #ifndef YYSIZE_T # ifdef __SIZE_TYPE__ # define YYSIZE_T __SIZE_TYPE__ # elif defined size_t # define YYSIZE_T size_t # elif ! defined YYSIZE_T # include /* INFRINGES ON USER NAME SPACE */ # define YYSIZE_T size_t # else # define YYSIZE_T unsigned int # endif #endif #define YYSIZE_MAXIMUM ((YYSIZE_T) -1) #ifndef YY_ # if defined YYENABLE_NLS && YYENABLE_NLS # if ENABLE_NLS # include /* INFRINGES ON USER NAME SPACE */ # define YY_(Msgid) dgettext ("bison-runtime", Msgid) # endif # endif # ifndef YY_ # define YY_(Msgid) Msgid # endif #endif #ifndef YY_ATTRIBUTE # if (defined __GNUC__ \ && (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \ || defined __SUNPRO_C && 0x5110 <= __SUNPRO_C # define YY_ATTRIBUTE(Spec) __attribute__(Spec) # else # define YY_ATTRIBUTE(Spec) /* empty */ # endif #endif #ifndef YY_ATTRIBUTE_PURE # define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__)) #endif #ifndef YY_ATTRIBUTE_UNUSED # define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__)) #endif #if !defined _Noreturn \ && (!defined __STDC_VERSION__ || __STDC_VERSION__ < 201112) # if defined _MSC_VER && 1200 <= _MSC_VER # define _Noreturn __declspec (noreturn) # else # define _Noreturn YY_ATTRIBUTE ((__noreturn__)) # endif #endif /* Suppress unused-variable warnings by "using" E. */ #if ! defined lint || defined __GNUC__ # define YYUSE(E) ((void) (E)) #else # define YYUSE(E) /* empty */ #endif #if defined __GNUC__ && 407 <= __GNUC__ * 100 + __GNUC_MINOR__ /* Suppress an incorrect diagnostic about yylval being uninitialized. */ # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \ _Pragma ("GCC diagnostic push") \ _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\ _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"") # define YY_IGNORE_MAYBE_UNINITIALIZED_END \ _Pragma ("GCC diagnostic pop") #else # define YY_INITIAL_VALUE(Value) Value #endif #ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN # define YY_IGNORE_MAYBE_UNINITIALIZED_END #endif #ifndef YY_INITIAL_VALUE # define YY_INITIAL_VALUE(Value) /* Nothing. */ #endif #if ! defined yyoverflow || YYERROR_VERBOSE /* The parser invokes alloca or malloc; define the necessary symbols. */ # ifdef YYSTACK_USE_ALLOCA # if YYSTACK_USE_ALLOCA # ifdef __GNUC__ # define YYSTACK_ALLOC __builtin_alloca # elif defined __BUILTIN_VA_ARG_INCR # include /* INFRINGES ON USER NAME SPACE */ # elif defined _AIX # define YYSTACK_ALLOC __alloca # elif defined _MSC_VER # include /* INFRINGES ON USER NAME SPACE */ # define alloca _alloca # else # define YYSTACK_ALLOC alloca # if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS # include /* INFRINGES ON USER NAME SPACE */ /* Use EXIT_SUCCESS as a witness for stdlib.h. */ # ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 # endif # endif # endif # endif # endif # ifdef YYSTACK_ALLOC /* Pacify GCC's 'empty if-body' warning. */ # define YYSTACK_FREE(Ptr) do { /* empty */; } while (0) # ifndef YYSTACK_ALLOC_MAXIMUM /* The OS might guarantee only one guard page at the bottom of the stack, and a page size can be as small as 4096 bytes. So we cannot safely invoke alloca (N) if N exceeds 4096. Use a slightly smaller number to allow for a few compiler-allocated temporary stack slots. */ # define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ # endif # else # define YYSTACK_ALLOC YYMALLOC # define YYSTACK_FREE YYFREE # ifndef YYSTACK_ALLOC_MAXIMUM # define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM # endif # if (defined __cplusplus && ! defined EXIT_SUCCESS \ && ! ((defined YYMALLOC || defined malloc) \ && (defined YYFREE || defined free))) # include /* INFRINGES ON USER NAME SPACE */ # ifndef EXIT_SUCCESS # define EXIT_SUCCESS 0 # endif # endif # ifndef YYMALLOC # define YYMALLOC malloc # if ! defined malloc && ! defined EXIT_SUCCESS void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ # endif # endif # ifndef YYFREE # define YYFREE free # if ! defined free && ! defined EXIT_SUCCESS void free (void *); /* INFRINGES ON USER NAME SPACE */ # endif # endif # endif #endif /* ! defined yyoverflow || YYERROR_VERBOSE */ #if (! defined yyoverflow \ && (! defined __cplusplus \ || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) /* A type that is properly aligned for any stack member. */ union yyalloc { yytype_int16 yyss_alloc; YYSTYPE yyvs_alloc; }; /* The size of the maximum gap between one aligned stack and the next. */ # define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) /* The size of an array large to enough to hold all stacks, each with N elements. */ # define YYSTACK_BYTES(N) \ ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ + YYSTACK_GAP_MAXIMUM) # define YYCOPY_NEEDED 1 /* Relocate STACK from its old location to the new one. The local variables YYSIZE and YYSTACKSIZE give the old and new number of elements in the stack, and YYPTR gives the new location of the stack. Advance YYPTR to a properly aligned location for the next stack. */ # define YYSTACK_RELOCATE(Stack_alloc, Stack) \ do \ { \ YYSIZE_T yynewbytes; \ YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ Stack = &yyptr->Stack_alloc; \ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ yyptr += yynewbytes / sizeof (*yyptr); \ } \ while (0) #endif #if defined YYCOPY_NEEDED && YYCOPY_NEEDED /* Copy COUNT objects from SRC to DST. The source and destination do not overlap. */ # ifndef YYCOPY # if defined __GNUC__ && 1 < __GNUC__ # define YYCOPY(Dst, Src, Count) \ __builtin_memcpy (Dst, Src, (Count) * sizeof (*(Src))) # else # define YYCOPY(Dst, Src, Count) \ do \ { \ YYSIZE_T yyi; \ for (yyi = 0; yyi < (Count); yyi++) \ (Dst)[yyi] = (Src)[yyi]; \ } \ while (0) # endif # endif #endif /* !YYCOPY_NEEDED */ /* YYFINAL -- State number of the termination state. */ #define YYFINAL 7 /* YYLAST -- Last index in YYTABLE. */ #define YYLAST 221 /* YYNTOKENS -- Number of terminals. */ #define YYNTOKENS 82 /* YYNNTS -- Number of nonterminals. */ #define YYNNTS 30 /* YYNRULES -- Number of rules. */ #define YYNRULES 101 /* YYNSTATES -- Number of states. */ #define YYNSTATES 162 /* YYTRANSLATE[YYX] -- Symbol number corresponding to YYX as returned by yylex, with out-of-bounds checking. */ #define YYUNDEFTOK 2 #define YYMAXUTOK 320 #define YYTRANSLATE(YYX) \ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) /* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM as returned by yylex, without out-of-bounds checking. */ static const yytype_uint8 yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 78, 74, 2, 80, 81, 77, 72, 67, 73, 68, 76, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 66, 70, 71, 69, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 75, 2, 79, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65 }; #if YYDEBUG /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */ static const yytype_uint16 yyrline[] = { 0, 545, 545, 555, 559, 560, 575, 674, 680, 687, 692, 698, 704, 710, 719, 727, 734, 740, 748, 759, 768, 777, 787, 795, 807, 813, 820, 827, 831, 838, 843, 850, 856, 863, 868, 874, 880, 886, 892, 899, 904, 910, 916, 922, 928, 934, 940, 946, 956, 967, 972, 977, 983, 988, 994, 1001, 1006, 1012, 1018, 1024, 1030, 1037, 1042, 1048, 1054, 1061, 1067, 1072, 1077, 1082, 1087, 1095, 1101, 1109, 1116, 1123, 1127, 1131, 1137, 1154, 1161, 1166, 1175, 1179, 1186, 1192, 1201, 1246, 1252, 1261, 1289, 1299, 1314, 1321, 1331, 1340, 1345, 1355, 1368, 1414, 1423, 1432 }; #endif #if YYDEBUG || YYERROR_VERBOSE || 0 /* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. First, the terminals, then, starting at YYNTOKENS, nonterminals. */ static const char *const yytname[] = { "$end", "error", "$undefined", "SQL_TYPE", "AS", "AS_EMPTY", "ASC", "AUTO_INCREMENT", "BIT", "BITWISE_SHIFT_LEFT", "BITWISE_SHIFT_RIGHT", "BY", "CHARACTER_STRING_LITERAL", "CONCATENATION", "CREATE", "DESC", "DISTINCT", "DOUBLE_QUOTED_STRING", "FROM", "JOIN", "KEY", "LEFT", "LESS_OR_EQUAL", "GREATER_OR_EQUAL", "SQL_NULL", "SQL_IS", "SQL_IS_NULL", "SQL_IS_NOT_NULL", "ORDER", "PRIMARY", "SELECT", "INTEGER_CONST", "REAL_CONST", "RIGHT", "SQL_ON", "DATE_CONST", "DATETIME_CONST", "TIME_CONST", "TABLE", "IDENTIFIER", "IDENTIFIER_DOT_ASTERISK", "QUERY_PARAMETER", "VARCHAR", "WHERE", "SQL", "SQL_TRUE", "SQL_FALSE", "UNION", "SCAN_ERROR", "AND", "BETWEEN", "NOT_BETWEEN", "EXCEPT", "SQL_IN", "INTERSECT", "LIKE", "ILIKE", "NOT_LIKE", "NOT", "NOT_EQUAL", "NOT_EQUAL2", "OR", "SIMILAR_TO", "NOT_SIMILAR_TO", "XOR", "UMINUS", "';'", "','", "'.'", "'>'", "'<'", "'='", "'+'", "'-'", "'&'", "'|'", "'/'", "'*'", "'%'", "'~'", "'('", "')'", "$accept", "TopLevelStatement", "StatementList", "Statement", "SelectStatement", "Select", "SelectOptions", "WhereClause", "OrderByClause", "OrderByColumnId", "OrderByOption", "aExpr", "aExpr2", "aExpr3", "aExpr4", "aExpr5", "aExpr6", "aExpr7", "aExpr8", "aExpr9", "aExpr10", "aExprList", "aExprList2", "Tables", "FlatTableList", "FlatTable", "ColViews", "ColItem", "ColExpression", "ColWildCard", YY_NULLPTR }; #endif # ifdef YYPRINT /* YYTOKNUM[NUM] -- (External) token number corresponding to the (internal) symbol number NUM (which must be that of a token). */ static const yytype_uint16 yytoknum[] = { 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 59, 44, 46, 62, 60, 61, 43, 45, 38, 124, 47, 42, 37, 126, 40, 41 }; # endif #define YYPACT_NINF -127 #define yypact_value_is_default(Yystate) \ (!!((Yystate) == (-127))) #define YYTABLE_NINF -1 #define yytable_value_is_error(Yytable_value) \ 0 /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing STATE-NUM. */ static const yytype_int16 yypact[] = { -15, -127, 39, -127, -21, -127, 12, -127, -15, -127, -11, 29, -127, -127, -127, -45, -127, -127, -127, 125, 125, 125, -127, 125, 125, -127, -127, -23, -5, 158, -127, 52, 58, 23, -127, -12, 9, -127, 10, -127, -127, 82, 15, 8, -127, -27, 1, -127, -13, -127, -127, -127, -127, -4, 125, 125, 125, 125, 125, 125, 125, 125, -127, -127, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 75, 125, -127, 60, 71, -127, -12, 51, -127, 16, 54, -127, 29, -127, -127, -127, 55, 53, 57, -127, -127, -127, -127, -127, -127, -127, -127, -127, 86, 87, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, -127, 17, -127, 127, -127, -127, -127, -127, -127, -127, 125, -127, 125, 125, -127, 73, 96, 5, 17, -127, -127, -127, 103, -127, -127, -127, 17, 78, -127, -127, -127, 17, -127 }; /* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM. Performed when YYTABLE does not specify something else to do. Zero means the default is an error. */ static const yytype_uint8 yydefact[] = { 0, 14, 0, 2, 4, 6, 7, 1, 5, 77, 0, 0, 74, 78, 79, 70, 71, 75, 76, 0, 0, 0, 100, 0, 0, 98, 29, 33, 39, 49, 52, 55, 61, 65, 80, 10, 8, 93, 94, 95, 3, 0, 89, 86, 88, 0, 0, 72, 70, 69, 67, 66, 68, 0, 0, 0, 0, 0, 0, 0, 0, 0, 50, 51, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 15, 0, 11, 9, 0, 97, 0, 0, 90, 0, 73, 101, 83, 85, 0, 0, 81, 30, 31, 32, 37, 35, 34, 36, 38, 0, 0, 44, 42, 43, 40, 41, 45, 46, 53, 54, 57, 56, 58, 59, 60, 62, 63, 64, 0, 19, 0, 92, 13, 96, 99, 91, 87, 0, 82, 0, 0, 26, 24, 16, 20, 0, 84, 47, 48, 0, 18, 27, 28, 0, 21, 17, 25, 22, 0, 23 }; /* YYPGOTO[NTERM-NUM]. */ static const yytype_int16 yypgoto[] = { -127, -127, 138, -127, -127, -127, -26, 2, -126, -127, -127, -24, 64, 115, -63, -127, 31, 102, 44, 88, -127, -127, 13, 117, -127, 63, -127, 72, 119, -127 }; /* YYDEFGOTO[NTERM-NUM]. */ static const yytype_int16 yydefgoto[] = { -1, 2, 3, 4, 5, 6, 85, 86, 145, 146, 156, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 47, 100, 35, 43, 44, 36, 37, 38, 39 }; /* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If positive, shift that token. If negative, reduce the rule whose number is the opposite. If YYTABLE_NINF, syntax error. */ static const yytype_uint8 yytable[] = { 53, 111, 112, 113, 114, 115, 116, 117, 118, 119, 88, 153, 96, 9, 90, 1, 83, 57, 58, 93, 154, 157, 99, 45, 9, 12, 54, 11, 10, 159, 11, 84, 13, 14, 161, 46, 12, 83, 55, 7, 48, 56, 16, 13, 14, 8, 17, 18, 143, 91, 97, 15, 84, 16, 94, 101, 144, 17, 18, 19, 131, 73, 74, 134, 59, 60, 61, 46, 42, 41, 19, 75, 155, 20, 21, 95, 87, 102, 149, 150, 23, 24, 98, 9, 20, 21, 130, 10, 132, 22, 135, 23, 24, 137, 9, 12, 96, 136, 10, 80, 81, 82, 13, 14, 120, 121, 12, 49, 50, 51, 15, 52, 16, 13, 14, 99, 17, 18, 103, 104, 105, 48, 139, 16, 127, 128, 129, 17, 18, 19, 76, 77, 78, 79, 140, 141, 142, 9, 147, 84, 19, 151, 158, 20, 21, 160, 40, 152, 22, 12, 23, 24, 148, 89, 20, 21, 13, 14, 138, 133, 92, 23, 24, 0, 48, 0, 16, 0, 0, 0, 17, 18, 106, 107, 108, 109, 110, 122, 123, 124, 125, 126, 0, 19, 62, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 21, 0, 0, 0, 0, 0, 23, 24, 0, 0, 64, 65, 0, 66, 0, 67, 0, 68, 0, 69, 70, 0, 71, 72 }; static const yytype_int16 yycheck[] = { 24, 64, 65, 66, 67, 68, 69, 70, 71, 72, 36, 6, 39, 12, 4, 30, 28, 22, 23, 4, 15, 147, 46, 68, 12, 24, 49, 18, 16, 155, 18, 43, 31, 32, 160, 80, 24, 28, 61, 0, 39, 64, 41, 31, 32, 66, 45, 46, 31, 39, 77, 39, 43, 41, 39, 68, 39, 45, 46, 58, 84, 9, 10, 89, 69, 70, 71, 80, 39, 80, 58, 13, 67, 72, 73, 67, 67, 81, 141, 142, 79, 80, 81, 12, 72, 73, 11, 16, 28, 77, 39, 79, 80, 39, 12, 24, 39, 81, 16, 76, 77, 78, 31, 32, 73, 74, 24, 19, 20, 21, 39, 23, 41, 31, 32, 139, 45, 46, 54, 55, 56, 39, 67, 41, 80, 81, 82, 45, 46, 58, 72, 73, 74, 75, 81, 49, 49, 12, 11, 43, 58, 68, 39, 72, 73, 67, 8, 145, 77, 24, 79, 80, 139, 36, 72, 73, 31, 32, 95, 87, 41, 79, 80, -1, 39, -1, 41, -1, -1, -1, 45, 46, 57, 58, 59, 60, 61, 75, 76, 77, 78, 79, -1, 58, 26, 27, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 72, 73, -1, -1, -1, -1, -1, 79, 80, -1, -1, 50, 51, -1, 53, -1, 55, -1, 57, -1, 59, 60, -1, 62, 63 }; /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing symbol of state STATE-NUM. */ static const yytype_uint8 yystos[] = { 0, 30, 83, 84, 85, 86, 87, 0, 66, 12, 16, 18, 24, 31, 32, 39, 41, 45, 46, 58, 72, 73, 77, 79, 80, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 105, 108, 109, 110, 111, 84, 80, 39, 106, 107, 68, 80, 103, 39, 101, 101, 101, 101, 93, 49, 61, 64, 22, 23, 69, 70, 71, 26, 27, 50, 51, 53, 55, 57, 59, 60, 62, 63, 9, 10, 13, 72, 73, 74, 75, 76, 77, 78, 28, 43, 88, 89, 67, 88, 105, 4, 39, 110, 4, 39, 67, 39, 77, 81, 93, 104, 68, 81, 94, 94, 94, 95, 95, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 98, 98, 99, 99, 99, 99, 99, 100, 100, 100, 11, 93, 28, 109, 88, 39, 81, 39, 107, 67, 81, 49, 49, 31, 39, 90, 91, 11, 104, 96, 96, 68, 89, 6, 15, 67, 92, 90, 39, 90, 67, 90 }; /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ static const yytype_uint8 yyr1[] = { 0, 82, 83, 84, 84, 84, 85, 86, 86, 86, 86, 86, 86, 86, 87, 88, 88, 88, 88, 89, 90, 90, 90, 90, 91, 91, 91, 92, 92, 93, 94, 94, 94, 94, 95, 95, 95, 95, 95, 95, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 97, 97, 97, 98, 98, 98, 99, 99, 99, 99, 99, 99, 100, 100, 100, 100, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 103, 103, 104, 104, 105, 106, 106, 107, 107, 107, 108, 108, 109, 109, 109, 109, 110, 110, 111, 111 }; /* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */ static const yytype_uint8 yyr2[] = { 0, 2, 1, 3, 1, 2, 1, 1, 2, 3, 2, 3, 3, 4, 1, 1, 3, 4, 4, 2, 1, 2, 3, 4, 1, 3, 1, 1, 1, 1, 3, 3, 3, 1, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 5, 5, 1, 2, 2, 1, 3, 3, 1, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1, 2, 2, 2, 2, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 3, 3, 2, 3, 1, 2, 3, 1, 1, 2, 3, 3, 1, 1, 1, 3, 2, 1, 4, 1, 3 }; #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY (-2) #define YYEOF 0 #define YYACCEPT goto yyacceptlab #define YYABORT goto yyabortlab #define YYERROR goto yyerrorlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(Token, Value) \ do \ if (yychar == YYEMPTY) \ { \ yychar = (Token); \ yylval = (Value); \ YYPOPSTACK (yylen); \ yystate = *yyssp; \ goto yybackup; \ } \ else \ { \ yyerror (YY_("syntax error: cannot back up")); \ YYERROR; \ } \ while (0) /* Error token number */ #define YYTERROR 1 #define YYERRCODE 256 /* Enable debugging if requested. */ #if YYDEBUG # ifndef YYFPRINTF # include /* INFRINGES ON USER NAME SPACE */ # define YYFPRINTF fprintf # endif # define YYDPRINTF(Args) \ do { \ if (yydebug) \ YYFPRINTF Args; \ } while (0) /* This macro is provided for backward compatibility. */ #ifndef YY_LOCATION_PRINT # define YY_LOCATION_PRINT(File, Loc) ((void) 0) #endif # define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ do { \ if (yydebug) \ { \ YYFPRINTF (stderr, "%s ", Title); \ yy_symbol_print (stderr, \ Type, Value); \ YYFPRINTF (stderr, "\n"); \ } \ } while (0) /*----------------------------------------. | Print this symbol's value on YYOUTPUT. | `----------------------------------------*/ static void yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) { FILE *yyo = yyoutput; YYUSE (yyo); if (!yyvaluep) return; # ifdef YYPRINT if (yytype < YYNTOKENS) YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); # endif YYUSE (yytype); } /*--------------------------------. | Print this symbol on YYOUTPUT. | `--------------------------------*/ static void yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) { YYFPRINTF (yyoutput, "%s %s (", yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]); yy_symbol_value_print (yyoutput, yytype, yyvaluep); YYFPRINTF (yyoutput, ")"); } /*------------------------------------------------------------------. | yy_stack_print -- Print the state stack from its BOTTOM up to its | | TOP (included). | `------------------------------------------------------------------*/ static void yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) { YYFPRINTF (stderr, "Stack now"); for (; yybottom <= yytop; yybottom++) { int yybot = *yybottom; YYFPRINTF (stderr, " %d", yybot); } YYFPRINTF (stderr, "\n"); } # define YY_STACK_PRINT(Bottom, Top) \ do { \ if (yydebug) \ yy_stack_print ((Bottom), (Top)); \ } while (0) /*------------------------------------------------. | Report that the YYRULE is going to be reduced. | `------------------------------------------------*/ static void yy_reduce_print (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule) { unsigned long int yylno = yyrline[yyrule]; int yynrhs = yyr2[yyrule]; int yyi; YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", yyrule - 1, yylno); /* The symbols being reduced. */ for (yyi = 0; yyi < yynrhs; yyi++) { YYFPRINTF (stderr, " $%d = ", yyi + 1); yy_symbol_print (stderr, yystos[yyssp[yyi + 1 - yynrhs]], &(yyvsp[(yyi + 1) - (yynrhs)]) ); YYFPRINTF (stderr, "\n"); } } # define YY_REDUCE_PRINT(Rule) \ do { \ if (yydebug) \ yy_reduce_print (yyssp, yyvsp, Rule); \ } while (0) /* Nonzero means print parse trace. It is left uninitialized so that multiple parsers can coexist. */ int yydebug; #else /* !YYDEBUG */ # define YYDPRINTF(Args) # define YY_SYMBOL_PRINT(Title, Type, Value, Location) # define YY_STACK_PRINT(Bottom, Top) # define YY_REDUCE_PRINT(Rule) #endif /* !YYDEBUG */ /* YYINITDEPTH -- initial size of the parser's stacks. */ #ifndef YYINITDEPTH # define YYINITDEPTH 200 #endif /* YYMAXDEPTH -- maximum size the stacks can grow to (effective only if the built-in stack extension method is used). Do not make this value too large; the results are undefined if YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) evaluated with infinite-precision integer arithmetic. */ #ifndef YYMAXDEPTH # define YYMAXDEPTH 10000 #endif #if YYERROR_VERBOSE # ifndef yystrlen # if defined __GLIBC__ && defined _STRING_H # define yystrlen strlen # else /* Return the length of YYSTR. */ static YYSIZE_T yystrlen (const char *yystr) { YYSIZE_T yylen; for (yylen = 0; yystr[yylen]; yylen++) continue; return yylen; } # endif # endif # ifndef yystpcpy # if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE # define yystpcpy stpcpy # else /* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in YYDEST. */ static char * yystpcpy (char *yydest, const char *yysrc) { char *yyd = yydest; const char *yys = yysrc; while ((*yyd++ = *yys++) != '\0') continue; return yyd - 1; } # endif # endif # ifndef yytnamerr /* Copy to YYRES the contents of YYSTR after stripping away unnecessary quotes and backslashes, so that it's suitable for yyerror. The heuristic is that double-quoting is unnecessary unless the string contains an apostrophe, a comma, or backslash (other than backslash-backslash). YYSTR is taken from yytname. If YYRES is null, do not copy; instead, return the length of what the result would have been. */ static YYSIZE_T yytnamerr (char *yyres, const char *yystr) { if (*yystr == '"') { YYSIZE_T yyn = 0; char const *yyp = yystr; for (;;) switch (*++yyp) { case '\'': case ',': goto do_not_strip_quotes; case '\\': if (*++yyp != '\\') goto do_not_strip_quotes; /* Fall through. */ default: if (yyres) yyres[yyn] = *yyp; yyn++; break; case '"': if (yyres) yyres[yyn] = '\0'; return yyn; } do_not_strip_quotes: ; } if (! yyres) return yystrlen (yystr); return yystpcpy (yyres, yystr) - yyres; } # endif /* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message about the unexpected token YYTOKEN for the state stack whose top is YYSSP. Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is not large enough to hold the message. In that case, also set *YYMSG_ALLOC to the required number of bytes. Return 2 if the required number of bytes is too large to store. */ static int yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg, yytype_int16 *yyssp, int yytoken) { YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]); YYSIZE_T yysize = yysize0; enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; /* Internationalized format string. */ const char *yyformat = YY_NULLPTR; /* Arguments of yyformat. */ char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; /* Number of reported tokens (one for the "unexpected", one per "expected"). */ int yycount = 0; /* There are many possibilities here to consider: - If this state is a consistent state with a default action, then the only way this function was invoked is if the default action is an error action. In that case, don't check for expected tokens because there are none. - The only way there can be no lookahead present (in yychar) is if this state is a consistent state with a default action. Thus, detecting the absence of a lookahead is sufficient to determine that there is no unexpected or expected token to report. In that case, just report a simple "syntax error". - Don't assume there isn't a lookahead just because this state is a consistent state with a default action. There might have been a previous inconsistent state, consistent state with a non-default action, or user semantic action that manipulated yychar. - Of course, the expected token list depends on states to have correct lookahead information, and it depends on the parser not to perform extra reductions after fetching a lookahead from the scanner and before detecting a syntax error. Thus, state merging (from LALR or IELR) and default reductions corrupt the expected token list. However, the list is correct for canonical LR with one exception: it will still contain any token that will not be accepted due to an error action in a later state. */ if (yytoken != YYEMPTY) { int yyn = yypact[*yyssp]; yyarg[yycount++] = yytname[yytoken]; if (!yypact_value_is_default (yyn)) { /* Start YYX at -YYN if negative to avoid negative indexes in YYCHECK. In other words, skip the first -YYN actions for this state because they are default actions. */ int yyxbegin = yyn < 0 ? -yyn : 0; /* Stay within bounds of both yycheck and yytname. */ int yychecklim = YYLAST - yyn + 1; int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; int yyx; for (yyx = yyxbegin; yyx < yyxend; ++yyx) if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR && !yytable_value_is_error (yytable[yyx + yyn])) { if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) { yycount = 1; yysize = yysize0; break; } yyarg[yycount++] = yytname[yyx]; { YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]); if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) return 2; yysize = yysize1; } } } } switch (yycount) { # define YYCASE_(N, S) \ case N: \ yyformat = S; \ break YYCASE_(0, YY_("syntax error")); YYCASE_(1, YY_("syntax error, unexpected %s")); YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s")); YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s")); YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s")); YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s")); # undef YYCASE_ } { YYSIZE_T yysize1 = yysize + yystrlen (yyformat); if (! (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) return 2; yysize = yysize1; } if (*yymsg_alloc < yysize) { *yymsg_alloc = 2 * yysize; if (! (yysize <= *yymsg_alloc && *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM)) *yymsg_alloc = YYSTACK_ALLOC_MAXIMUM; return 1; } /* Avoid sprintf, as that infringes on the user's name space. Don't have undefined behavior even if the translation produced a string with the wrong number of "%s"s. */ { char *yyp = *yymsg; int yyi = 0; while ((*yyp = *yyformat) != '\0') if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount) { yyp += yytnamerr (yyp, yyarg[yyi++]); yyformat += 2; } else { yyp++; yyformat++; } } return 0; } #endif /* YYERROR_VERBOSE */ /*-----------------------------------------------. | Release the memory associated to this symbol. | `-----------------------------------------------*/ static void yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) { YYUSE (yyvaluep); if (!yymsg) yymsg = "Deleting"; YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN YYUSE (yytype); YY_IGNORE_MAYBE_UNINITIALIZED_END } /* The lookahead symbol. */ int yychar; /* The semantic value of the lookahead symbol. */ YYSTYPE yylval; /* Number of syntax errors so far. */ int yynerrs; /*----------. | yyparse. | `----------*/ int yyparse (void) { int yystate; /* Number of tokens to shift before error messages enabled. */ int yyerrstatus; /* The stacks and their tools: 'yyss': related to states. 'yyvs': related to semantic values. Refer to the stacks through separate pointers, to allow yyoverflow to reallocate them elsewhere. */ /* The state stack. */ yytype_int16 yyssa[YYINITDEPTH]; yytype_int16 *yyss; yytype_int16 *yyssp; /* The semantic value stack. */ YYSTYPE yyvsa[YYINITDEPTH]; YYSTYPE *yyvs; YYSTYPE *yyvsp; YYSIZE_T yystacksize; int yyn; int yyresult; /* Lookahead token as an internal (translated) token number. */ int yytoken = 0; /* The variables used to return semantic value and location from the action routines. */ YYSTYPE yyval; #if YYERROR_VERBOSE /* Buffer for error messages, and its allocated size. */ char yymsgbuf[128]; char *yymsg = yymsgbuf; YYSIZE_T yymsg_alloc = sizeof yymsgbuf; #endif #define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) /* The number of symbols on the RHS of the reduced rule. Keep to zero when no symbol should be popped. */ int yylen = 0; yyssp = yyss = yyssa; yyvsp = yyvs = yyvsa; yystacksize = YYINITDEPTH; YYDPRINTF ((stderr, "Starting parse\n")); yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ goto yysetstate; /*------------------------------------------------------------. | yynewstate -- Push a new state, which is found in yystate. | `------------------------------------------------------------*/ yynewstate: /* In all cases, when you get here, the value and location stacks have just been pushed. So pushing a state here evens the stacks. */ yyssp++; yysetstate: *yyssp = yystate; if (yyss + yystacksize - 1 <= yyssp) { /* Get the current used size of the three stacks, in elements. */ YYSIZE_T yysize = yyssp - yyss + 1; #ifdef yyoverflow { /* Give user a chance to reallocate the stack. Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; yytype_int16 *yyss1 = yyss; /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow (YY_("memory exhausted"), &yyss1, yysize * sizeof (*yyssp), &yyvs1, yysize * sizeof (*yyvsp), &yystacksize); yyss = yyss1; yyvs = yyvs1; } #else /* no yyoverflow */ # ifndef YYSTACK_RELOCATE goto yyexhaustedlab; # else /* Extend the stack our own way. */ if (YYMAXDEPTH <= yystacksize) goto yyexhaustedlab; yystacksize *= 2; if (YYMAXDEPTH < yystacksize) yystacksize = YYMAXDEPTH; { yytype_int16 *yyss1 = yyss; union yyalloc *yyptr = (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); if (! yyptr) goto yyexhaustedlab; YYSTACK_RELOCATE (yyss_alloc, yyss); YYSTACK_RELOCATE (yyvs_alloc, yyvs); # undef YYSTACK_RELOCATE if (yyss1 != yyssa) YYSTACK_FREE (yyss1); } # endif #endif /* no yyoverflow */ yyssp = yyss + yysize - 1; yyvsp = yyvs + yysize - 1; YYDPRINTF ((stderr, "Stack size increased to %lu\n", (unsigned long int) yystacksize)); if (yyss + yystacksize - 1 <= yyssp) YYABORT; } YYDPRINTF ((stderr, "Entering state %d\n", yystate)); if (yystate == YYFINAL) YYACCEPT; goto yybackup; /*-----------. | yybackup. | `-----------*/ yybackup: /* Do appropriate processing given the current state. Read a lookahead token if we need one and don't already have one. */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yypact_value_is_default (yyn)) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ if (yychar == YYEMPTY) { YYDPRINTF ((stderr, "Reading a token: ")); yychar = yylex (); } if (yychar <= YYEOF) { yychar = yytoken = YYEOF; YYDPRINTF ((stderr, "Now at end of input.\n")); } else { yytoken = YYTRANSLATE (yychar); YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); } /* If the proper action on seeing token YYTOKEN is to reduce or to detect an error, take that action. */ yyn += yytoken; if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) goto yydefault; yyn = yytable[yyn]; if (yyn <= 0) { if (yytable_value_is_error (yyn)) goto yyerrlab; yyn = -yyn; goto yyreduce; } /* Count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; /* Shift the lookahead token. */ YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); /* Discard the shifted token. */ yychar = YYEMPTY; yystate = yyn; YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END goto yynewstate; /*-----------------------------------------------------------. | yydefault -- do the default action for the current state. | `-----------------------------------------------------------*/ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; goto yyreduce; /*-----------------------------. | yyreduce -- Do a reduction. | `-----------------------------*/ yyreduce: /* yyn is the number of a rule to reduce with. */ yylen = yyr2[yyn]; /* If YYLEN is nonzero, implement the default value of the action: '$$ = $1'. Otherwise, the following line sets YYVAL to garbage. This behavior is undocumented and Bison users should not rely upon it. Assigning to YYVAL unconditionally makes the parser a bit smaller, and it avoids a GCC warning that YYVAL may be used uninitialized. */ yyval = yyvsp[1-yylen]; YY_REDUCE_PRINT (yyn); switch (yyn) { case 2: #line 546 "KDbSqlParser.y" /* yacc.c:1646 */ { //todo: multiple statements //todo: not only "select" statements KDbParserPrivate::get(globalParser)->setStatementType(KDbParser::Select); KDbParserPrivate::get(globalParser)->setQuerySchema((yyvsp[0].querySchema)); } #line 1504 "sqlparser.cpp" /* yacc.c:1646 */ break; case 3: #line 556 "KDbSqlParser.y" /* yacc.c:1646 */ { //todo: multiple statements } #line 1512 "sqlparser.cpp" /* yacc.c:1646 */ break; case 5: #line 561 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.querySchema) = (yyvsp[-1].querySchema); } #line 1520 "sqlparser.cpp" /* yacc.c:1646 */ break; case 6: #line 576 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.querySchema) = (yyvsp[0].querySchema); } #line 1528 "sqlparser.cpp" /* yacc.c:1646 */ break; case 7: #line 675 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select"; + sqlParserDebug() << "Select"; if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[0].querySchema), nullptr ))) YYABORT; } #line 1538 "sqlparser.cpp" /* yacc.c:1646 */ break; case 8: #line 681 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select ColViews=" << *(yyvsp[0].exprList); + sqlParserDebug() << "Select ColViews=" << *(yyvsp[0].exprList); if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-1].querySchema), (yyvsp[0].exprList) ))) YYABORT; } #line 1549 "sqlparser.cpp" /* yacc.c:1646 */ break; case 9: #line 688 "KDbSqlParser.y" /* yacc.c:1646 */ { if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-2].querySchema), (yyvsp[-1].exprList), (yyvsp[0].exprList) ))) YYABORT; } #line 1558 "sqlparser.cpp" /* yacc.c:1646 */ break; case 10: #line 693 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select ColViews Tables"; + sqlParserDebug() << "Select ColViews Tables"; if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-1].querySchema), nullptr, (yyvsp[0].exprList) ))) YYABORT; } #line 1568 "sqlparser.cpp" /* yacc.c:1646 */ break; case 11: #line 699 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select ColViews Conditions"; + sqlParserDebug() << "Select ColViews Conditions"; if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-2].querySchema), (yyvsp[-1].exprList), nullptr, (yyvsp[0].selectOptions) ))) YYABORT; } #line 1578 "sqlparser.cpp" /* yacc.c:1646 */ break; case 12: #line 705 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select Tables SelectOptions"; + sqlParserDebug() << "Select Tables SelectOptions"; if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-2].querySchema), nullptr, (yyvsp[-1].exprList), (yyvsp[0].selectOptions) ))) YYABORT; } #line 1588 "sqlparser.cpp" /* yacc.c:1646 */ break; case 13: #line 711 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "Select ColViews Tables SelectOptions"; + sqlParserDebug() << "Select ColViews Tables SelectOptions"; if (!((yyval.querySchema) = buildSelectQuery( (yyvsp[-3].querySchema), (yyvsp[-2].exprList), (yyvsp[-1].exprList), (yyvsp[0].selectOptions) ))) YYABORT; } #line 1598 "sqlparser.cpp" /* yacc.c:1646 */ break; case 14: #line 720 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "SELECT"; + sqlParserDebug() << "SELECT"; (yyval.querySchema) = KDbParserPrivate::get(globalParser)->createQuery(); } #line 1607 "sqlparser.cpp" /* yacc.c:1646 */ break; case 15: #line 728 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "WhereClause"; + sqlParserDebug() << "WhereClause"; (yyval.selectOptions) = new SelectOptionsInternal; (yyval.selectOptions)->whereExpr = *(yyvsp[0].expr); delete (yyvsp[0].expr); } #line 1618 "sqlparser.cpp" /* yacc.c:1646 */ break; case 16: #line 735 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "OrderByClause"; + sqlParserDebug() << "OrderByClause"; (yyval.selectOptions) = new SelectOptionsInternal; (yyval.selectOptions)->orderByColumns = (yyvsp[0].orderByColumns); } #line 1628 "sqlparser.cpp" /* yacc.c:1646 */ break; case 17: #line 741 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "WhereClause ORDER BY OrderByClause"; + sqlParserDebug() << "WhereClause ORDER BY OrderByClause"; (yyval.selectOptions) = new SelectOptionsInternal; (yyval.selectOptions)->whereExpr = *(yyvsp[-3].expr); delete (yyvsp[-3].expr); (yyval.selectOptions)->orderByColumns = (yyvsp[0].orderByColumns); } #line 1640 "sqlparser.cpp" /* yacc.c:1646 */ break; case 18: #line 749 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "OrderByClause WhereClause"; + sqlParserDebug() << "OrderByClause WhereClause"; (yyval.selectOptions) = new SelectOptionsInternal; (yyval.selectOptions)->whereExpr = *(yyvsp[0].expr); delete (yyvsp[0].expr); (yyval.selectOptions)->orderByColumns = (yyvsp[-1].orderByColumns); } #line 1652 "sqlparser.cpp" /* yacc.c:1646 */ break; case 19: #line 760 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = (yyvsp[0].expr); } #line 1660 "sqlparser.cpp" /* yacc.c:1646 */ break; case 20: #line 769 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "ORDER BY IDENTIFIER"; + sqlParserDebug() << "ORDER BY IDENTIFIER"; (yyval.orderByColumns) = new QList; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *(yyvsp[0].variantValue) ); (yyval.orderByColumns)->append( orderByColumn ); delete (yyvsp[0].variantValue); } #line 1673 "sqlparser.cpp" /* yacc.c:1646 */ break; case 21: #line 778 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "ORDER BY IDENTIFIER OrderByOption"; + sqlParserDebug() << "ORDER BY IDENTIFIER OrderByOption"; (yyval.orderByColumns) = new QList; OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *(yyvsp[-1].variantValue) ); orderByColumn.order = (yyvsp[0].sortOrderValue); (yyval.orderByColumns)->append( orderByColumn ); delete (yyvsp[-1].variantValue); } #line 1687 "sqlparser.cpp" /* yacc.c:1646 */ break; case 22: #line 788 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.orderByColumns) = (yyvsp[0].orderByColumns); OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *(yyvsp[-2].variantValue) ); (yyval.orderByColumns)->append( orderByColumn ); delete (yyvsp[-2].variantValue); } #line 1699 "sqlparser.cpp" /* yacc.c:1646 */ break; case 23: #line 796 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.orderByColumns) = (yyvsp[0].orderByColumns); OrderByColumnInternal orderByColumn; orderByColumn.setColumnByNameOrNumber( *(yyvsp[-3].variantValue) ); orderByColumn.order = (yyvsp[-2].sortOrderValue); (yyval.orderByColumns)->append( orderByColumn ); delete (yyvsp[-3].variantValue); } #line 1712 "sqlparser.cpp" /* yacc.c:1646 */ break; case 24: #line 808 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.variantValue) = new QVariant( *(yyvsp[0].stringValue) ); - kdbDebug() << "OrderByColumnId: " << *(yyval.variantValue); + sqlParserDebug() << "OrderByColumnId: " << *(yyval.variantValue); delete (yyvsp[0].stringValue); } #line 1722 "sqlparser.cpp" /* yacc.c:1646 */ break; case 25: #line 814 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.variantValue) = new QVariant( *(yyvsp[-2].stringValue) + QLatin1Char('.') + *(yyvsp[0].stringValue) ); - kdbDebug() << "OrderByColumnId: " << *(yyval.variantValue); + sqlParserDebug() << "OrderByColumnId: " << *(yyval.variantValue); delete (yyvsp[-2].stringValue); delete (yyvsp[0].stringValue); } #line 1733 "sqlparser.cpp" /* yacc.c:1646 */ break; case 26: #line 821 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.variantValue) = new QVariant((yyvsp[0].integerValue)); - kdbDebug() << "OrderByColumnId: " << *(yyval.variantValue); + sqlParserDebug() << "OrderByColumnId: " << *(yyval.variantValue); } #line 1742 "sqlparser.cpp" /* yacc.c:1646 */ break; case 27: #line 828 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.sortOrderValue) = KDbOrderByColumn::SortOrder::Ascending; } #line 1750 "sqlparser.cpp" /* yacc.c:1646 */ break; case 28: #line 832 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.sortOrderValue) = KDbOrderByColumn::SortOrder::Descending; } #line 1758 "sqlparser.cpp" /* yacc.c:1646 */ break; case 30: #line 844 "KDbSqlParser.y" /* yacc.c:1646 */ { -// kdbDebug() << "AND " << $3.debugString(); +// sqlParserDebug() << "AND " << $3.debugString(); (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::AND, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1769 "sqlparser.cpp" /* yacc.c:1646 */ break; case 31: #line 851 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::OR, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1779 "sqlparser.cpp" /* yacc.c:1646 */ break; case 32: #line 857 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::XOR, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1789 "sqlparser.cpp" /* yacc.c:1646 */ break; case 34: #line 869 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '>', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1799 "sqlparser.cpp" /* yacc.c:1646 */ break; case 35: #line 875 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::GREATER_OR_EQUAL, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1809 "sqlparser.cpp" /* yacc.c:1646 */ break; case 36: #line 881 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '<', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1819 "sqlparser.cpp" /* yacc.c:1646 */ break; case 37: #line 887 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::LESS_OR_EQUAL, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1829 "sqlparser.cpp" /* yacc.c:1646 */ break; case 38: #line 893 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '=', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1839 "sqlparser.cpp" /* yacc.c:1646 */ break; case 40: #line 905 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::NOT_EQUAL, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1849 "sqlparser.cpp" /* yacc.c:1646 */ break; case 41: #line 911 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::NOT_EQUAL2, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1859 "sqlparser.cpp" /* yacc.c:1646 */ break; case 42: #line 917 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::LIKE, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1869 "sqlparser.cpp" /* yacc.c:1646 */ break; case 43: #line 923 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::NOT_LIKE, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1879 "sqlparser.cpp" /* yacc.c:1646 */ break; case 44: #line 929 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::SQL_IN, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1889 "sqlparser.cpp" /* yacc.c:1646 */ break; case 45: #line 935 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::SIMILAR_TO, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1899 "sqlparser.cpp" /* yacc.c:1646 */ break; case 46: #line 941 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::NOT_SIMILAR_TO, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1909 "sqlparser.cpp" /* yacc.c:1646 */ break; case 47: #line 947 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbNArgExpression(KDb::RelationalExpression, KDbToken::BETWEEN_AND); (yyval.expr)->toNArg().append( *(yyvsp[-4].expr) ); (yyval.expr)->toNArg().append( *(yyvsp[-2].expr) ); (yyval.expr)->toNArg().append( *(yyvsp[0].expr) ); delete (yyvsp[-4].expr); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1923 "sqlparser.cpp" /* yacc.c:1646 */ break; case 48: #line 957 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbNArgExpression(KDb::RelationalExpression, KDbToken::NOT_BETWEEN_AND); (yyval.expr)->toNArg().append( *(yyvsp[-4].expr) ); (yyval.expr)->toNArg().append( *(yyvsp[-2].expr) ); (yyval.expr)->toNArg().append( *(yyvsp[0].expr) ); delete (yyvsp[-4].expr); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1937 "sqlparser.cpp" /* yacc.c:1646 */ break; case 50: #line 973 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( KDbToken::SQL_IS_NULL, *(yyvsp[-1].expr) ); delete (yyvsp[-1].expr); } #line 1946 "sqlparser.cpp" /* yacc.c:1646 */ break; case 51: #line 978 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( KDbToken::SQL_IS_NOT_NULL, *(yyvsp[-1].expr) ); delete (yyvsp[-1].expr); } #line 1955 "sqlparser.cpp" /* yacc.c:1646 */ break; case 53: #line 989 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::BITWISE_SHIFT_LEFT, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1965 "sqlparser.cpp" /* yacc.c:1646 */ break; case 54: #line 995 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::BITWISE_SHIFT_RIGHT, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1975 "sqlparser.cpp" /* yacc.c:1646 */ break; case 56: #line 1007 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '+', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1985 "sqlparser.cpp" /* yacc.c:1646 */ break; case 57: #line 1013 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), KDbToken::CONCATENATION, *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 1995 "sqlparser.cpp" /* yacc.c:1646 */ break; case 58: #line 1019 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '-', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2005 "sqlparser.cpp" /* yacc.c:1646 */ break; case 59: #line 1025 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '&', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2015 "sqlparser.cpp" /* yacc.c:1646 */ break; case 60: #line 1031 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '|', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2025 "sqlparser.cpp" /* yacc.c:1646 */ break; case 62: #line 1043 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '/', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2035 "sqlparser.cpp" /* yacc.c:1646 */ break; case 63: #line 1049 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '*', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2045 "sqlparser.cpp" /* yacc.c:1646 */ break; case 64: #line 1055 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression(*(yyvsp[-2].expr), '%', *(yyvsp[0].expr)); delete (yyvsp[-2].expr); delete (yyvsp[0].expr); } #line 2055 "sqlparser.cpp" /* yacc.c:1646 */ break; case 66: #line 1068 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( '-', *(yyvsp[0].expr) ); delete (yyvsp[0].expr); } #line 2064 "sqlparser.cpp" /* yacc.c:1646 */ break; case 67: #line 1073 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( '+', *(yyvsp[0].expr) ); delete (yyvsp[0].expr); } #line 2073 "sqlparser.cpp" /* yacc.c:1646 */ break; case 68: #line 1078 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( '~', *(yyvsp[0].expr) ); delete (yyvsp[0].expr); } #line 2082 "sqlparser.cpp" /* yacc.c:1646 */ break; case 69: #line 1083 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbUnaryExpression( KDbToken::NOT, *(yyvsp[0].expr) ); delete (yyvsp[0].expr); } #line 2091 "sqlparser.cpp" /* yacc.c:1646 */ break; case 70: #line 1088 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbVariableExpression( *(yyvsp[0].stringValue) ); //! @todo simplify this later if that's 'only one field name' expression - kdbDebug() << " + identifier: " << *(yyvsp[0].stringValue); + sqlParserDebug() << " + identifier: " << *(yyvsp[0].stringValue); delete (yyvsp[0].stringValue); } #line 2103 "sqlparser.cpp" /* yacc.c:1646 */ break; case 71: #line 1096 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbQueryParameterExpression( *(yyvsp[0].stringValue) ); - kdbDebug() << " + query parameter:" << *(yyval.expr); + sqlParserDebug() << " + query parameter:" << *(yyval.expr); delete (yyvsp[0].stringValue); } #line 2113 "sqlparser.cpp" /* yacc.c:1646 */ break; case 72: #line 1102 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << " + function:" << *(yyvsp[-1].stringValue) << "(" << *(yyvsp[0].exprList) << ")"; + sqlParserDebug() << " + function:" << *(yyvsp[-1].stringValue) << "(" << *(yyvsp[0].exprList) << ")"; (yyval.expr) = new KDbFunctionExpression(*(yyvsp[-1].stringValue), *(yyvsp[0].exprList)); delete (yyvsp[-1].stringValue); delete (yyvsp[0].exprList); } #line 2124 "sqlparser.cpp" /* yacc.c:1646 */ break; case 73: #line 1110 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbVariableExpression( *(yyvsp[-2].stringValue) + QLatin1Char('.') + *(yyvsp[0].stringValue) ); - kdbDebug() << " + identifier.identifier:" << *(yyvsp[-2].stringValue) << "." << *(yyvsp[0].stringValue); + sqlParserDebug() << " + identifier.identifier:" << *(yyvsp[-2].stringValue) << "." << *(yyvsp[0].stringValue); delete (yyvsp[-2].stringValue); delete (yyvsp[0].stringValue); } #line 2135 "sqlparser.cpp" /* yacc.c:1646 */ break; case 74: #line 1117 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbConstExpression( KDbToken::SQL_NULL, QVariant() ); - kdbDebug() << " + NULL"; + sqlParserDebug() << " + NULL"; // $$ = new KDbField(); //$$->setName(QString::null); } #line 2146 "sqlparser.cpp" /* yacc.c:1646 */ break; case 75: #line 1124 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbConstExpression( KDbToken::SQL_TRUE, true ); } #line 2154 "sqlparser.cpp" /* yacc.c:1646 */ break; case 76: #line 1128 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbConstExpression( KDbToken::SQL_FALSE, false ); } #line 2162 "sqlparser.cpp" /* yacc.c:1646 */ break; case 77: #line 1132 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbConstExpression( KDbToken::CHARACTER_STRING_LITERAL, *(yyvsp[0].stringValue) ); - kdbDebug() << " + constant " << (yyvsp[0].stringValue); + sqlParserDebug() << " + constant " << (yyvsp[0].stringValue); delete (yyvsp[0].stringValue); } #line 2172 "sqlparser.cpp" /* yacc.c:1646 */ break; case 78: #line 1138 "KDbSqlParser.y" /* yacc.c:1646 */ { QVariant val; if ((yyvsp[0].integerValue) <= INT_MAX && (yyvsp[0].integerValue) >= INT_MIN) val = (int)(yyvsp[0].integerValue); else if ((yyvsp[0].integerValue) <= UINT_MAX && (yyvsp[0].integerValue) >= 0) val = (uint)(yyvsp[0].integerValue); else if ((yyvsp[0].integerValue) <= LLONG_MAX && (yyvsp[0].integerValue) >= LLONG_MIN) val = (qint64)(yyvsp[0].integerValue); // if ($1 < ULLONG_MAX) // val = (quint64)$1; //! @todo ok? (yyval.expr) = new KDbConstExpression( KDbToken::INTEGER_CONST, val ); - kdbDebug() << " + int constant: " << val.toString(); + sqlParserDebug() << " + int constant: " << val.toString(); } #line 2193 "sqlparser.cpp" /* yacc.c:1646 */ break; case 79: #line 1155 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbConstExpression( KDbToken::REAL_CONST, *(yyvsp[0].binaryValue) ); - kdbDebug() << " + real constant: " << *(yyvsp[0].binaryValue); + sqlParserDebug() << " + real constant: " << *(yyvsp[0].binaryValue); delete (yyvsp[0].binaryValue); } #line 2203 "sqlparser.cpp" /* yacc.c:1646 */ break; case 81: #line 1167 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "(expr)"; + sqlParserDebug() << "(expr)"; (yyval.expr) = new KDbUnaryExpression('(', *(yyvsp[-1].expr)); delete (yyvsp[-1].expr); } #line 2213 "sqlparser.cpp" /* yacc.c:1646 */ break; case 82: #line 1176 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = (yyvsp[-1].exprList); } #line 2221 "sqlparser.cpp" /* yacc.c:1646 */ break; case 83: #line 1180 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = new KDbNArgExpression(KDb::ArgumentListExpression, ','); } #line 2229 "sqlparser.cpp" /* yacc.c:1646 */ break; case 84: #line 1187 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = (yyvsp[0].exprList); (yyval.exprList)->prepend( *(yyvsp[-2].expr) ); delete (yyvsp[-2].expr); } #line 2239 "sqlparser.cpp" /* yacc.c:1646 */ break; case 85: #line 1193 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = new KDbNArgExpression(KDb::ArgumentListExpression, ','); (yyval.exprList)->append( *(yyvsp[0].expr) ); delete (yyvsp[0].expr); } #line 2249 "sqlparser.cpp" /* yacc.c:1646 */ break; case 86: #line 1202 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = (yyvsp[0].exprList); } #line 2257 "sqlparser.cpp" /* yacc.c:1646 */ break; case 87: #line 1247 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = (yyvsp[-2].exprList); (yyval.exprList)->append(*(yyvsp[0].expr)); delete (yyvsp[0].expr); } #line 2267 "sqlparser.cpp" /* yacc.c:1646 */ break; case 88: #line 1253 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = new KDbNArgExpression(KDb::TableListExpression, KDbToken::IDENTIFIER); //ok? (yyval.exprList)->append(*(yyvsp[0].expr)); delete (yyvsp[0].expr); } #line 2277 "sqlparser.cpp" /* yacc.c:1646 */ break; case 89: #line 1262 "KDbSqlParser.y" /* yacc.c:1646 */ { - kdbDebug() << "FROM: '" << *(yyvsp[0].stringValue) << "'"; + sqlParserDebug() << "FROM: '" << *(yyvsp[0].stringValue) << "'"; (yyval.expr) = new KDbVariableExpression(*(yyvsp[0].stringValue)); //! @todo this isn't ok for more tables: /* KDbField::ListIterator it = globalParser->query()->fieldsIterator(); for(KDbField *item; (item = it.current()); ++it) { if(item->table() == dummy) { item->setTable(schema); } if(item->table() && !item->isQueryAsterisk()) { KDbField *f = item->table()->field(item->name()); if(!f) { KDbParserError err(KDbParser::tr("Field List Error"), KDbParser::tr("Unknown column '%1' in table '%2'",item->name(),schema->name()), ctoken, current); globalParser->setError(err); yyerror("fieldlisterror"); } } }*/ delete (yyvsp[0].stringValue); } #line 2309 "sqlparser.cpp" /* yacc.c:1646 */ break; case 90: #line 1290 "KDbSqlParser.y" /* yacc.c:1646 */ { //table + alias (yyval.expr) = new KDbBinaryExpression( KDbVariableExpression(*(yyvsp[-1].stringValue)), KDbToken::AS_EMPTY, KDbVariableExpression(*(yyvsp[0].stringValue)) ); delete (yyvsp[-1].stringValue); delete (yyvsp[0].stringValue); } #line 2323 "sqlparser.cpp" /* yacc.c:1646 */ break; case 91: #line 1300 "KDbSqlParser.y" /* yacc.c:1646 */ { //table + alias (yyval.expr) = new KDbBinaryExpression( KDbVariableExpression(*(yyvsp[-2].stringValue)), KDbToken::AS, KDbVariableExpression(*(yyvsp[0].stringValue)) ); delete (yyvsp[-2].stringValue); delete (yyvsp[0].stringValue); } #line 2337 "sqlparser.cpp" /* yacc.c:1646 */ break; case 92: #line 1315 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = (yyvsp[-2].exprList); (yyval.exprList)->append(*(yyvsp[0].expr)); delete (yyvsp[0].expr); - kdbDebug() << "ColViews: ColViews , ColItem"; + sqlParserDebug() << "ColViews: ColViews , ColItem"; } #line 2348 "sqlparser.cpp" /* yacc.c:1646 */ break; case 93: #line 1322 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.exprList) = new KDbNArgExpression(KDb::FieldListExpression, KDbToken()); (yyval.exprList)->append(*(yyvsp[0].expr)); delete (yyvsp[0].expr); - kdbDebug() << "ColViews: ColItem"; + sqlParserDebug() << "ColViews: ColItem"; } #line 2359 "sqlparser.cpp" /* yacc.c:1646 */ break; case 94: #line 1332 "KDbSqlParser.y" /* yacc.c:1646 */ { // $$ = new KDbField(); // dummy->addField($$); // $$->setExpression( $1 ); // globalParser->query()->addField($$); (yyval.expr) = (yyvsp[0].expr); - kdbDebug() << " added column expr:" << *(yyvsp[0].expr); + sqlParserDebug() << " added column expr:" << *(yyvsp[0].expr); } #line 2372 "sqlparser.cpp" /* yacc.c:1646 */ break; case 95: #line 1341 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = (yyvsp[0].expr); - kdbDebug() << " added column wildcard:" << *(yyvsp[0].expr); + sqlParserDebug() << " added column wildcard:" << *(yyvsp[0].expr); } #line 2381 "sqlparser.cpp" /* yacc.c:1646 */ break; case 96: #line 1346 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression( *(yyvsp[-2].expr), KDbToken::AS, KDbVariableExpression(*(yyvsp[0].stringValue)) ); - kdbDebug() << " added column expr:" << *(yyval.expr); + sqlParserDebug() << " added column expr:" << *(yyval.expr); delete (yyvsp[-2].expr); delete (yyvsp[0].stringValue); } #line 2395 "sqlparser.cpp" /* yacc.c:1646 */ break; case 97: #line 1356 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbBinaryExpression( *(yyvsp[-1].expr), KDbToken::AS_EMPTY, KDbVariableExpression(*(yyvsp[0].stringValue)) ); - kdbDebug() << " added column expr:" << *(yyval.expr); + sqlParserDebug() << " added column expr:" << *(yyval.expr); delete (yyvsp[-1].expr); delete (yyvsp[0].stringValue); } #line 2409 "sqlparser.cpp" /* yacc.c:1646 */ break; case 98: #line 1369 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = (yyvsp[0].expr); } #line 2417 "sqlparser.cpp" /* yacc.c:1646 */ break; case 99: #line 1415 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = (yyvsp[-1].expr); //! @todo DISTINCT '(' ColExpression ')' // $$->setName("DISTINCT(" + $3->name() + ")"); } #line 2427 "sqlparser.cpp" /* yacc.c:1646 */ break; case 100: #line 1424 "KDbSqlParser.y" /* yacc.c:1646 */ { (yyval.expr) = new KDbVariableExpression(QLatin1String("*")); - kdbDebug() << "all columns"; + sqlParserDebug() << "all columns"; // KDbQueryAsterisk *ast = new KDbQueryAsterisk(globalParser->query(), dummy); // globalParser->query()->addAsterisk(ast); // requiresTable = true; } #line 2440 "sqlparser.cpp" /* yacc.c:1646 */ break; case 101: #line 1433 "KDbSqlParser.y" /* yacc.c:1646 */ { QString s( *(yyvsp[-2].stringValue) ); s += QLatin1String(".*"); (yyval.expr) = new KDbVariableExpression(s); - kdbDebug() << " + all columns from " << s; + sqlParserDebug() << " + all columns from " << s; delete (yyvsp[-2].stringValue); } #line 2452 "sqlparser.cpp" /* yacc.c:1646 */ break; #line 2456 "sqlparser.cpp" /* yacc.c:1646 */ default: break; } /* User semantic actions sometimes alter yychar, and that requires that yytoken be updated with the new translation. We take the approach of translating immediately before every use of yytoken. One alternative is translating here after every semantic action, but that translation would be missed if the semantic action invokes YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an incorrect destructor might then be invoked immediately. In the case of YYERROR or YYBACKUP, subsequent parser actions might lead to an incorrect destructor call or verbose syntax error message before the lookahead is translated. */ YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); *++yyvsp = yyval; /* Now 'shift' the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTOKENS]; goto yynewstate; /*--------------------------------------. | yyerrlab -- here on detecting error. | `--------------------------------------*/ yyerrlab: /* Make sure we have latest lookahead translation. See comments at user semantic actions for why this is necessary. */ yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar); /* If not already recovering from an error, report this error. */ if (!yyerrstatus) { ++yynerrs; #if ! YYERROR_VERBOSE yyerror (YY_("syntax error")); #else # define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \ yyssp, yytoken) { char const *yymsgp = YY_("syntax error"); int yysyntax_error_status; yysyntax_error_status = YYSYNTAX_ERROR; if (yysyntax_error_status == 0) yymsgp = yymsg; else if (yysyntax_error_status == 1) { if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc); if (!yymsg) { yymsg = yymsgbuf; yymsg_alloc = sizeof yymsgbuf; yysyntax_error_status = 2; } else { yysyntax_error_status = YYSYNTAX_ERROR; yymsgp = yymsg; } } yyerror (yymsgp); if (yysyntax_error_status == 2) goto yyexhaustedlab; } # undef YYSYNTAX_ERROR #endif } if (yyerrstatus == 3) { /* If just tried and failed to reuse lookahead token after an error, discard it. */ if (yychar <= YYEOF) { /* Return failure if at end of input. */ if (yychar == YYEOF) YYABORT; } else { yydestruct ("Error: discarding", yytoken, &yylval); yychar = YYEMPTY; } } /* Else will try to reuse lookahead token after shifting the error token. */ goto yyerrlab1; /*---------------------------------------------------. | yyerrorlab -- error raised explicitly by YYERROR. | `---------------------------------------------------*/ yyerrorlab: /* Pacify compilers like GCC when the user code never invokes YYERROR and the label yyerrorlab therefore never appears in user code. */ if (/*CONSTCOND*/ 0) goto yyerrorlab; /* Do not reclaim the symbols of the rule whose action triggered this YYERROR. */ YYPOPSTACK (yylen); yylen = 0; YY_STACK_PRINT (yyss, yyssp); yystate = *yyssp; goto yyerrlab1; /*-------------------------------------------------------------. | yyerrlab1 -- common code for both syntax error and YYERROR. | `-------------------------------------------------------------*/ yyerrlab1: yyerrstatus = 3; /* Each real token shifted decrements this. */ for (;;) { yyn = yypact[yystate]; if (!yypact_value_is_default (yyn)) { yyn += YYTERROR; if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) { yyn = yytable[yyn]; if (0 < yyn) break; } } /* Pop the current state because it cannot handle the error token. */ if (yyssp == yyss) YYABORT; yydestruct ("Error: popping", yystos[yystate], yyvsp); YYPOPSTACK (1); yystate = *yyssp; YY_STACK_PRINT (yyss, yyssp); } YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN *++yyvsp = yylval; YY_IGNORE_MAYBE_UNINITIALIZED_END /* Shift the error token. */ YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); yystate = yyn; goto yynewstate; /*-------------------------------------. | yyacceptlab -- YYACCEPT comes here. | `-------------------------------------*/ yyacceptlab: yyresult = 0; goto yyreturn; /*-----------------------------------. | yyabortlab -- YYABORT comes here. | `-----------------------------------*/ yyabortlab: yyresult = 1; goto yyreturn; #if !defined yyoverflow || YYERROR_VERBOSE /*-------------------------------------------------. | yyexhaustedlab -- memory exhaustion comes here. | `-------------------------------------------------*/ yyexhaustedlab: yyerror (YY_("memory exhausted")); yyresult = 2; /* Fall through. */ #endif yyreturn: if (yychar != YYEMPTY) { /* Make sure we have latest lookahead translation. See comments at user semantic actions for why this is necessary. */ yytoken = YYTRANSLATE (yychar); yydestruct ("Cleanup: discarding lookahead", yytoken, &yylval); } /* Do not reclaim the symbols of the rule whose action triggered this YYABORT or YYACCEPT. */ YYPOPSTACK (yylen); YY_STACK_PRINT (yyss, yyssp); while (yyssp != yyss) { yydestruct ("Cleanup: popping", yystos[*yyssp], yyvsp); YYPOPSTACK (1); } #ifndef yyoverflow if (yyss != yyssa) YYSTACK_FREE (yyss); #endif #if YYERROR_VERBOSE if (yymsg != yymsgbuf) YYSTACK_FREE (yymsg); #endif return yyresult; } #line 1448 "KDbSqlParser.y" /* yacc.c:1906 */ KDB_TESTING_EXPORT const char* g_tokenName(unsigned int offset) { const int t = YYTRANSLATE(offset); if (t >= YYTRANSLATE(::SQL_TYPE)) { return yytname[t]; } return nullptr; } //static const int KDbToken::maxCharTokenValue = 253; //static const int KDbToken::maxTokenValue = YYMAXUTOK; diff --git a/src/parser/generated/sqlscanner.cpp b/src/parser/generated/sqlscanner.cpp index 31b9e7e1..f5f7f7ce 100644 --- a/src/parser/generated/sqlscanner.cpp +++ b/src/parser/generated/sqlscanner.cpp @@ -1,2353 +1,2353 @@ #line 2 "generated/sqlscanner.cpp" #line 4 "generated/sqlscanner.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) /* 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 (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 (((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 yyrestart(yyin ) #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 extern yy_size_t yyleng; extern FILE *yyin, *yyout; #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 #define YY_LESS_LINENO(n) /* 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 = (yy_hold_char); \ YY_RESTORE_YY_MORE_OFFSET \ (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, (yytext_ptr) ) #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. */ int yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int 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 yyrestart()), 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 */ /* Stack of input buffers. */ static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ /* 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 ( (yy_buffer_stack) \ ? (yy_buffer_stack)[(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 (yy_buffer_stack)[(yy_buffer_stack_top)] /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ yy_size_t yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 0; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; void yyrestart (FILE *input_file ); void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); void yy_delete_buffer (YY_BUFFER_STATE b ); void yy_flush_buffer (YY_BUFFER_STATE b ); void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); void yypop_buffer_state (void ); static void yyensure_buffer_stack (void ); static void yy_load_buffer_state (void ); static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); #define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len ); void *yyalloc (yy_size_t ); void *yyrealloc (void *,yy_size_t ); void yyfree (void * ); #define yy_new_buffer yy_create_buffer #define yy_set_interactive(is_interactive) \ { \ if ( ! YY_CURRENT_BUFFER ){ \ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ } #define yy_set_bol(at_bol) \ { \ if ( ! YY_CURRENT_BUFFER ){\ yyensure_buffer_stack (); \ YY_CURRENT_BUFFER_LVALUE = \ yy_create_buffer(yyin,YY_BUF_SIZE ); \ } \ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ } #define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) /* Begin user sect3 */ #define yywrap() 1 #define YY_SKIP_YYWRAP typedef unsigned char YY_CHAR; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; typedef int yy_state_type; extern int yylineno; int yylineno = 1; extern char *yytext; #define yytext_ptr yytext static yy_state_type yy_get_previous_state (void ); static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); static int yy_get_next_buffer (void ); static void yy_fatal_error (yyconst char msg[] ); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ (yytext_ptr) = yy_bp; \ yyleng = (size_t) (yy_cp - yy_bp); \ (yy_hold_char) = *yy_cp; \ *yy_cp = '\0'; \ (yy_c_buf_p) = yy_cp; #define YY_NUM_RULES 48 #define YY_END_OF_BUFFER 49 /* 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[177] = { 0, 0, 0, 49, 48, 46, 47, 48, 47, 47, 48, 47, 7, 47, 47, 47, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 47, 47, 46, 2, 0, 43, 0, 9, 0, 43, 0, 8, 8, 7, 44, 32, 4, 1, 3, 5, 33, 44, 10, 44, 40, 44, 44, 44, 44, 6, 25, 44, 44, 44, 44, 44, 29, 30, 44, 44, 44, 44, 44, 44, 44, 0, 31, 43, 43, 8, 9, 41, 44, 44, 44, 44, 44, 44, 0, 44, 44, 44, 24, 44, 44, 44, 44, 44, 44, 44, 44, 34, 45, 44, 44, 42, 44, 12, 44, 0, 14, 15, 16, 0, 26, 44, 44, 44, 44, 44, 27, 44, 44, 44, 28, 44, 0, 0, 0, 0, 0, 39, 35, 44, 44, 37, 38, 44, 11, 44, 0, 0, 0, 0, 0, 36, 44, 18, 13, 0, 23, 0, 0, 0, 44, 0, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 22, 19, 0, 0, 0, 20, 0 } ; static yyconst flex_int32_t yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 1, 5, 6, 7, 5, 5, 5, 5, 5, 5, 8, 5, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 10, 11, 12, 5, 5, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 28, 29, 30, 31, 32, 28, 33, 34, 35, 28, 36, 37, 38, 5, 28, 5, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 28, 28, 54, 55, 56, 57, 28, 58, 59, 60, 28, 1, 61, 1, 5, 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[62] = { 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1 } ; static yyconst flex_int16_t yy_base[181] = { 0, 0, 0, 431, 441, 428, 418, 58, 441, 422, 56, 418, 56, 56, 415, 58, 64, 63, 67, 65, 417, 68, 75, 76, 70, 101, 110, 78, 94, 118, 92, 116, 0, 363, 421, 441, 73, 418, 116, 441, 67, 414, 107, 411, 410, 80, 410, 441, 441, 441, 441, 441, 441, 124, 127, 140, 409, 138, 137, 126, 148, 143, 77, 144, 141, 155, 152, 153, 408, 171, 165, 162, 172, 174, 185, 181, 182, 377, 441, 190, 188, 405, 404, 403, 197, 194, 207, 198, 201, 221, 214, 192, 212, 224, 229, 211, 237, 226, 239, 241, 249, 242, 250, 402, 441, 243, 261, 401, 257, 400, 262, 244, 397, 396, 393, 281, 391, 255, 267, 279, 269, 295, 389, 298, 305, 308, 388, 310, 258, 278, 291, 303, 305, 386, 384, 302, 322, 382, 378, 321, 376, 331, 381, 313, 301, 317, 317, 283, 335, 270, 231, 343, 441, 313, 327, 328, 288, 322, 338, 441, 332, 357, 341, 350, 359, 347, 352, 351, 333, 441, 441, 441, 219, 376, 353, 441, 441, 432, 435, 90, 438 } ; static yyconst flex_int16_t yy_def[181] = { 0, 176, 1, 176, 176, 176, 176, 177, 176, 176, 178, 176, 179, 176, 176, 176, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 180, 176, 176, 176, 177, 176, 177, 176, 178, 176, 178, 176, 176, 179, 179, 176, 176, 176, 176, 176, 176, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 180, 176, 177, 178, 176, 179, 179, 179, 179, 179, 179, 179, 179, 176, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 176, 179, 179, 179, 179, 179, 179, 176, 179, 179, 179, 176, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 179, 176, 176, 176, 176, 176, 179, 179, 179, 179, 179, 179, 179, 179, 179, 176, 176, 176, 176, 176, 179, 179, 179, 179, 176, 176, 176, 176, 176, 179, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 0, 176, 176, 176, 176 } ; static yyconst flex_int16_t yy_nxt[503] = { 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 20, 20, 22, 23, 20, 24, 20, 25, 26, 20, 27, 28, 29, 20, 30, 31, 20, 32, 4, 8, 16, 17, 18, 19, 20, 21, 20, 20, 22, 23, 20, 24, 20, 25, 26, 27, 28, 29, 20, 30, 31, 20, 33, 37, 41, 44, 45, 47, 48, 49, 51, 52, 176, 176, 176, 41, 176, 176, 37, 176, 90, 55, 59, 58, 176, 176, 176, 176, 64, 44, 45, 53, 65, 46, 42, 54, 38, 57, 60, 56, 70, 176, 61, 176, 63, 42, 62, 55, 59, 58, 176, 38, 71, 75, 64, 80, 72, 53, 65, 176, 54, 79, 57, 60, 56, 176, 70, 176, 61, 66, 63, 62, 73, 176, 67, 176, 176, 68, 71, 75, 69, 82, 72, 83, 76, 42, 176, 176, 74, 176, 176, 87, 176, 176, 38, 66, 85, 176, 73, 67, 92, 176, 176, 68, 176, 69, 91, 82, 86, 83, 76, 176, 84, 74, 176, 89, 88, 87, 95, 93, 176, 176, 85, 176, 94, 97, 92, 98, 96, 100, 176, 176, 91, 86, 176, 79, 80, 84, 99, 102, 89, 176, 88, 176, 95, 93, 176, 176, 106, 94, 176, 97, 103, 98, 96, 100, 176, 90, 101, 112, 176, 176, 173, 107, 99, 102, 42, 109, 38, 108, 176, 105, 115, 176, 106, 176, 116, 103, 176, 110, 176, 111, 114, 101, 113, 112, 176, 118, 176, 107, 176, 176, 176, 109, 108, 117, 105, 119, 176, 176, 122, 124, 116, 120, 176, 110, 176, 111, 114, 113, 176, 176, 128, 118, 121, 126, 176, 129, 176, 176, 123, 117, 127, 119, 115, 133, 122, 124, 176, 120, 142, 161, 176, 125, 136, 135, 130, 176, 128, 134, 121, 126, 129, 143, 176, 123, 131, 176, 127, 144, 133, 176, 132, 137, 176, 142, 138, 176, 125, 176, 136, 135, 130, 139, 134, 145, 140, 146, 141, 143, 176, 176, 131, 153, 147, 144, 148, 132, 152, 137, 176, 154, 138, 155, 176, 159, 151, 158, 149, 139, 160, 145, 140, 146, 141, 162, 163, 164, 153, 147, 161, 150, 148, 172, 152, 156, 166, 154, 167, 155, 157, 159, 158, 168, 149, 169, 160, 170, 171, 173, 162, 175, 163, 164, 151, 176, 150, 176, 172, 165, 156, 176, 166, 176, 167, 176, 157, 176, 176, 168, 176, 169, 176, 170, 171, 176, 176, 175, 174, 176, 176, 176, 176, 176, 165, 81, 104, 176, 176, 176, 81, 43, 40, 36, 34, 78, 176, 50, 43, 39, 35, 34, 176, 174, 36, 36, 36, 40, 40, 40, 77, 77, 3, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176 } ; static yyconst flex_int16_t yy_chk[503] = { 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, 7, 10, 12, 12, 13, 13, 13, 15, 15, 17, 16, 19, 40, 18, 21, 36, 24, 62, 17, 21, 19, 22, 23, 62, 27, 24, 45, 45, 16, 24, 179, 10, 16, 7, 18, 21, 17, 27, 30, 22, 28, 23, 40, 22, 17, 21, 19, 25, 36, 28, 30, 24, 42, 28, 16, 24, 26, 16, 38, 18, 21, 17, 31, 27, 29, 22, 25, 23, 22, 29, 53, 25, 59, 54, 26, 28, 30, 26, 53, 28, 54, 31, 42, 58, 57, 29, 55, 64, 59, 61, 63, 38, 25, 57, 60, 29, 25, 64, 66, 67, 26, 65, 26, 63, 53, 58, 54, 31, 71, 55, 29, 70, 61, 60, 59, 67, 65, 69, 72, 57, 73, 66, 70, 64, 71, 69, 73, 75, 76, 63, 58, 74, 79, 80, 55, 72, 75, 61, 91, 60, 85, 67, 65, 84, 87, 85, 66, 88, 70, 76, 71, 69, 73, 86, 90, 74, 91, 95, 92, 172, 86, 72, 75, 80, 88, 79, 87, 89, 84, 94, 93, 85, 97, 95, 76, 94, 89, 150, 90, 93, 74, 92, 91, 96, 97, 98, 86, 99, 101, 105, 88, 87, 96, 84, 98, 100, 102, 101, 105, 95, 99, 117, 89, 108, 90, 93, 92, 106, 110, 111, 97, 100, 108, 118, 111, 120, 149, 102, 96, 110, 98, 115, 117, 101, 105, 119, 99, 128, 156, 147, 106, 120, 119, 115, 156, 111, 118, 100, 108, 111, 129, 121, 102, 115, 123, 110, 130, 117, 135, 115, 121, 124, 128, 123, 125, 106, 127, 120, 119, 115, 124, 118, 131, 125, 132, 127, 129, 139, 136, 115, 144, 135, 130, 136, 115, 143, 121, 141, 145, 123, 146, 148, 154, 151, 153, 139, 124, 155, 131, 125, 132, 127, 157, 158, 160, 144, 135, 161, 141, 136, 168, 143, 148, 162, 145, 163, 146, 151, 154, 153, 164, 139, 165, 155, 166, 167, 173, 157, 174, 158, 160, 142, 140, 141, 138, 168, 161, 148, 137, 162, 134, 163, 133, 151, 126, 122, 164, 116, 165, 114, 166, 167, 113, 112, 174, 173, 109, 107, 103, 83, 82, 161, 81, 77, 68, 56, 46, 44, 43, 41, 37, 34, 33, 20, 14, 11, 9, 6, 5, 3, 173, 177, 177, 177, 178, 178, 178, 180, 180, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176, 176 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; extern int yy_flex_debug; int yy_flex_debug = 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 char *yytext; #line 1 "KDbSqlScanner.l" /* This file is part of the KDE project Copyright (C) 2004 Lucijan Busch Copyright (C) 2004-2015 Jarosław Staniek This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #line 22 "KDbSqlScanner.l" #include "sqlparser.h" #include "KDb.h" #include "KDbExpression.h" #include "KDbParser.h" #include "KDbSqlTypes.h" #include "kdb_debug.h" extern int globalCurrentPos; extern QByteArray globalToken; #define YY_NO_UNPUT #define ECOUNT globalCurrentPos += yyleng; globalToken = yytext extern void setError(const QString& errDesc); extern void setError(const QString& errName, const QString& errDesc); /* *** Please reflect changes to this file in ../driver_p.cpp *** */ /*identifier [a-zA-Z_][a-zA-Z_0-9]* */ /* quoted_identifier (\"[a-zA-Z_0-9]+\") */ #line 663 "generated/sqlscanner.cpp" #define INITIAL 0 #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 static int yy_init_globals (void ); /* Accessor methods to globals. These are made visible to non-reentrant scanners for convenience. */ int yylex_destroy (void ); int yyget_debug (void ); void yyset_debug (int debug_flag ); YY_EXTRA_TYPE yyget_extra (void ); void yyset_extra (YY_EXTRA_TYPE user_defined ); FILE *yyget_in (void ); void yyset_in (FILE * in_str ); FILE *yyget_out (void ); void yyset_out (FILE * out_str ); yy_size_t yyget_leng (void ); char *yyget_text (void ); int yyget_lineno (void ); void yyset_lineno (int line_number ); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifndef YY_SKIP_YYWRAP #ifdef __cplusplus extern "C" int yywrap (void ); #else extern int yywrap (void ); #endif #endif static void yyunput (int c,char *buf_ptr ); #ifndef yytext_ptr static void yy_flex_strncpy (char *,yyconst char *,int ); #endif #ifdef YY_NEED_STRLEN static int yy_flex_strlen (yyconst char * ); #endif #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (void ); #else static int input (void ); #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 = (int) 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 ) #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 yylex (void); #define YY_DECL int yylex (void) #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 { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; #line 60 "KDbSqlScanner.l" #line 849 "generated/sqlscanner.cpp" if ( !(yy_init) ) { (yy_init) = 1; #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! (yy_start) ) (yy_start) = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( ! YY_CURRENT_BUFFER ) { yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_load_buffer_state( ); } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = (yy_c_buf_p); /* Support of yytext. */ *yy_cp = (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 = (yy_start); yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 177 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) yy_c]; ++yy_cp; } while ( yy_current_state != 176 ); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); yy_find_action: yy_act = yy_accept[yy_current_state]; YY_DO_BEFORE_ACTION; 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 = (yy_hold_char); yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; case 1: YY_RULE_SETUP #line 63 "KDbSqlScanner.l" { ECOUNT; return NOT_EQUAL; } YY_BREAK case 2: YY_RULE_SETUP #line 68 "KDbSqlScanner.l" { ECOUNT; return NOT_EQUAL2; } YY_BREAK case 3: YY_RULE_SETUP #line 73 "KDbSqlScanner.l" { ECOUNT; return '='; } YY_BREAK case 4: YY_RULE_SETUP #line 78 "KDbSqlScanner.l" { ECOUNT; return LESS_OR_EQUAL; } YY_BREAK case 5: YY_RULE_SETUP #line 83 "KDbSqlScanner.l" { ECOUNT; return GREATER_OR_EQUAL; } YY_BREAK case 6: YY_RULE_SETUP #line 88 "KDbSqlScanner.l" { ECOUNT; return SQL_IN; } YY_BREAK case 7: YY_RULE_SETUP #line 93 "KDbSqlScanner.l" { //! @todo what about hex or octal values? //we're using QString:toLongLong() here because atoll() is not so portable: ECOUNT; bool ok; yylval.integerValue = QByteArray(yytext).toLongLong(&ok); if (!ok) { setError(KDbParser::tr("Invalid integer number"), KDbParser::tr("This integer number may be too large.")); return SCAN_ERROR; } return INTEGER_CONST; } YY_BREAK case 8: YY_RULE_SETUP #line 106 "KDbSqlScanner.l" { ECOUNT; yylval.binaryValue = new QByteArray(yytext, yyleng); return REAL_CONST; } YY_BREAK case 9: YY_RULE_SETUP #line 112 "KDbSqlScanner.l" { ECOUNT; return AND; } YY_BREAK case 10: YY_RULE_SETUP #line 117 "KDbSqlScanner.l" { ECOUNT; return AS; } YY_BREAK case 11: YY_RULE_SETUP #line 122 "KDbSqlScanner.l" { ECOUNT; return CREATE; } YY_BREAK case 12: YY_RULE_SETUP #line 127 "KDbSqlScanner.l" { ECOUNT; return FROM; } YY_BREAK case 13: YY_RULE_SETUP #line 132 "KDbSqlScanner.l" { ECOUNT; return SQL_TYPE; } YY_BREAK case 14: YY_RULE_SETUP #line 137 "KDbSqlScanner.l" { ECOUNT; return JOIN; } YY_BREAK case 15: YY_RULE_SETUP #line 142 "KDbSqlScanner.l" { ECOUNT; return LEFT; } YY_BREAK case 16: YY_RULE_SETUP #line 147 "KDbSqlScanner.l" { ECOUNT; return LIKE; } YY_BREAK case 17: /* rule 17 can match eol */ YY_RULE_SETUP #line 152 "KDbSqlScanner.l" { ECOUNT; return NOT_LIKE; } YY_BREAK case 18: YY_RULE_SETUP #line 157 "KDbSqlScanner.l" { ECOUNT; return BETWEEN; } YY_BREAK case 19: /* rule 19 can match eol */ YY_RULE_SETUP #line 162 "KDbSqlScanner.l" { ECOUNT; return NOT_BETWEEN; } YY_BREAK case 20: /* rule 20 can match eol */ YY_RULE_SETUP #line 167 "KDbSqlScanner.l" { ECOUNT; return NOT_SIMILAR_TO; } YY_BREAK case 21: /* rule 21 can match eol */ YY_RULE_SETUP #line 172 "KDbSqlScanner.l" { ECOUNT; return SIMILAR_TO; } YY_BREAK case 22: /* rule 22 can match eol */ YY_RULE_SETUP #line 177 "KDbSqlScanner.l" { ECOUNT; return SQL_IS_NOT_NULL; } YY_BREAK case 23: /* rule 23 can match eol */ YY_RULE_SETUP #line 182 "KDbSqlScanner.l" { ECOUNT; return SQL_IS_NULL; } YY_BREAK case 24: YY_RULE_SETUP #line 187 "KDbSqlScanner.l" { ECOUNT; return NOT; } YY_BREAK case 25: YY_RULE_SETUP #line 192 "KDbSqlScanner.l" { ECOUNT; return SQL_IS; } YY_BREAK case 26: YY_RULE_SETUP #line 197 "KDbSqlScanner.l" { ECOUNT; return SQL_NULL; } YY_BREAK case 27: YY_RULE_SETUP #line 202 "KDbSqlScanner.l" { ECOUNT; return SQL_TRUE; } YY_BREAK case 28: YY_RULE_SETUP #line 207 "KDbSqlScanner.l" { ECOUNT; return SQL_FALSE; } YY_BREAK case 29: YY_RULE_SETUP #line 212 "KDbSqlScanner.l" { ECOUNT; return SQL_ON; } YY_BREAK case 30: YY_RULE_SETUP #line 217 "KDbSqlScanner.l" { ECOUNT; return OR; } YY_BREAK case 31: YY_RULE_SETUP #line 222 "KDbSqlScanner.l" { /* also means OR for numbers (mysql) */ ECOUNT; return CONCATENATION; } YY_BREAK case 32: YY_RULE_SETUP #line 227 "KDbSqlScanner.l" { ECOUNT; return BITWISE_SHIFT_LEFT; } YY_BREAK case 33: YY_RULE_SETUP #line 232 "KDbSqlScanner.l" { ECOUNT; return BITWISE_SHIFT_RIGHT; } YY_BREAK case 34: YY_RULE_SETUP #line 237 "KDbSqlScanner.l" { ECOUNT; return XOR; } YY_BREAK case 35: YY_RULE_SETUP #line 242 "KDbSqlScanner.l" { ECOUNT; return RIGHT; } YY_BREAK case 36: YY_RULE_SETUP #line 247 "KDbSqlScanner.l" { ECOUNT; return SELECT; } YY_BREAK case 37: YY_RULE_SETUP #line 252 "KDbSqlScanner.l" { ECOUNT; return TABLE; } YY_BREAK case 38: YY_RULE_SETUP #line 257 "KDbSqlScanner.l" { ECOUNT; return WHERE; } YY_BREAK case 39: YY_RULE_SETUP #line 262 "KDbSqlScanner.l" { ECOUNT; return ORDER; } YY_BREAK case 40: YY_RULE_SETUP #line 267 "KDbSqlScanner.l" { ECOUNT; return BY; } YY_BREAK case 41: YY_RULE_SETUP #line 272 "KDbSqlScanner.l" { ECOUNT; return ASC; } YY_BREAK case 42: YY_RULE_SETUP #line 277 "KDbSqlScanner.l" { ECOUNT; return DESC; } YY_BREAK case 43: /* rule 43 can match eol */ YY_RULE_SETUP #line 282 "KDbSqlScanner.l" { ECOUNT; - //kdbDebug() << "{string} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{string} yytext: '" << yytext << "' (" << yyleng << ")"; int errorPosition; const QString unescaped( KDb::unescapeString(QString::fromUtf8(yytext+1, yyleng-2), yytext[0], &errorPosition)); if (errorPosition >= 0) { // sanity check setError(KDbParser::tr("Invalid string"), KDbParser::tr("Invalid character in string")); return SCAN_ERROR; } yylval.stringValue = new QString(unescaped); return CHARACTER_STRING_LITERAL; /* "ZZZ" sentinel for script */ } YY_BREAK case 44: YY_RULE_SETUP #line 299 "KDbSqlScanner.l" { - kdbDebug() << "{identifier} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{identifier} yytext: '" << yytext << "' (" << yyleng << ")"; ECOUNT; if (yytext[0]>='0' && yytext[0]<='9') { setError(KDbParser::tr("Invalid identifier"), KDbParser::tr("Identifiers should start with a letter or '_' character")); return SCAN_ERROR; } yylval.stringValue = new QString(QString::fromUtf8(yytext, yyleng)); return IDENTIFIER; } YY_BREAK case 45: /* rule 45 can match eol */ YY_RULE_SETUP #line 311 "KDbSqlScanner.l" { - kdbDebug() << "{query_parameter} yytext: '" << yytext << "' (" << yyleng << ")"; + sqlParserDebug() << "{query_parameter} yytext: '" << yytext << "' (" << yyleng << ")"; ECOUNT; yylval.stringValue = new QString(QString::fromUtf8(yytext+1, yyleng-2)); return QUERY_PARAMETER; } YY_BREAK case 46: /* rule 46 can match eol */ YY_RULE_SETUP #line 318 "KDbSqlScanner.l" { ECOUNT; } YY_BREAK case 47: YY_RULE_SETUP #line 322 "KDbSqlScanner.l" { - kdbDebug() << "char: '" << yytext[0] << "'"; + sqlParserDebug() << "char: '" << yytext[0] << "'"; ECOUNT; return yytext[0]; } YY_BREAK case 48: YY_RULE_SETUP #line 328 "KDbSqlScanner.l" ECHO; YY_BREAK #line 1348 "generated/sqlscanner.cpp" case YY_STATE_EOF(INITIAL): yyterminate(); case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = (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 * yylex(). 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. */ (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 ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) { /* This was really a NUL. */ yy_state_type yy_next_state; (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); /* 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 ); yy_bp = (yytext_ptr) + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++(yy_c_buf_p); yy_current_state = yy_next_state; goto yy_match; } else { yy_cp = (yy_last_accepting_cpos); yy_current_state = (yy_last_accepting_state); goto yy_find_action; } } else switch ( yy_get_next_buffer( ) ) { case EOB_ACT_END_OF_FILE: { (yy_did_buffer_switch_on_eof) = 0; if ( yywrap( ) ) { /* 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. */ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (yytext_ptr) + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: (yy_c_buf_p) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; yy_current_state = yy_get_previous_state( ); yy_cp = (yy_c_buf_p); yy_bp = (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 yylex */ /* 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 (void) { register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; register char *source = (yytext_ptr); register int number_to_move, i; int ret_val; if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(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 ( (yy_c_buf_p) - (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) ((yy_c_buf_p) - (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 = (yy_n_chars) = 0; else { int 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) ((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. */ yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); } 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" ); (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = (int) 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]), (yy_n_chars), num_to_read ); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } if ( (yy_n_chars) == 0 ) { if ( number_to_move == YY_MORE_ADJ ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart(yyin ); } 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 ((int) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { /* Extend the array by 50%, plus the number we really need. */ int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); } (yy_n_chars) += number_to_move; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; (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 (void) { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = (yy_start); for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 177 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) 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 ) { register int yy_is_jam; register char *yy_cp = (yy_c_buf_p); register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { (yy_last_accepting_state) = yy_current_state; (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 >= 177 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (flex_int16_t) yy_c]; yy_is_jam = (yy_current_state == 176); return yy_is_jam ? 0 : yy_current_state; } static void yyunput (int c, register char * yy_bp ) { register char *yy_cp; yy_cp = (yy_c_buf_p); /* undo effects of setting up yytext */ *yy_cp = (yy_hold_char); if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = (yy_n_chars) + 2; register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; register char *source = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) *--dest = *--source; yy_cp += (int) (dest - source); yy_bp += (int) (dest - source); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = (int) YY_CURRENT_BUFFER_LVALUE->yy_buf_size; if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } *--yy_cp = (char) c; (yytext_ptr) = yy_bp; (yy_hold_char) = *yy_cp; (yy_c_buf_p) = yy_cp; } #ifndef YY_NO_INPUT #ifdef __cplusplus static int yyinput (void) #else static int input (void) #endif { int c; *(yy_c_buf_p) = (yy_hold_char); if ( *(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 ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) /* This was really a NUL. */ *(yy_c_buf_p) = '\0'; else { /* need more input */ yy_size_t offset = (yy_c_buf_p) - (yytext_ptr); ++(yy_c_buf_p); switch ( yy_get_next_buffer( ) ) { 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. */ yyrestart(yyin ); /*FALLTHROUGH*/ case EOB_ACT_END_OF_FILE: { if ( yywrap( ) ) return EOF; if ( ! (yy_did_buffer_switch_on_eof) ) YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: (yy_c_buf_p) = (yytext_ptr) + offset; break; } } } c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ *(yy_c_buf_p) = '\0'; /* preserve yytext */ (yy_hold_char) = *++(yy_c_buf_p); return c; } #endif /* ifndef YY_NO_INPUT */ /** Immediately switch to a different input stream. * @param input_file A readable stream. * * @note This function does not reset the start condition to @c INITIAL . */ void yyrestart (FILE * input_file ) { if ( ! YY_CURRENT_BUFFER ){ yyensure_buffer_stack (); YY_CURRENT_BUFFER_LVALUE = yy_create_buffer(yyin,YY_BUF_SIZE ); } yy_init_buffer(YY_CURRENT_BUFFER,input_file ); yy_load_buffer_state( ); } /** Switch to a different input buffer. * @param new_buffer The new input buffer. * */ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) { /* TODO. We should be able to replace this entire function body * with * yypop_buffer_state(); * yypush_buffer_state(new_buffer); */ yyensure_buffer_stack (); if ( YY_CURRENT_BUFFER == new_buffer ) return; if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } YY_CURRENT_BUFFER_LVALUE = new_buffer; yy_load_buffer_state( ); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ (yy_did_buffer_switch_on_eof) = 1; } static void yy_load_buffer_state (void) { (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; (yy_hold_char) = *(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. * * @return the allocated buffer state. */ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_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 *) yyalloc(b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_is_our_buffer = 1; yy_init_buffer(b,file ); return b; } /** Destroy the buffer. * @param b a buffer created with yy_create_buffer() * */ void yy_delete_buffer (YY_BUFFER_STATE b ) { 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 ) yyfree((void *) b->yy_ch_buf ); yyfree((void *) b ); } /* Initializes or reinitializes a buffer. * This function is sometimes called more than once on the same buffer, * such as during a yyrestart() or at EOF. */ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) { int oerrno = errno; yy_flush_buffer(b ); b->yy_input_file = file; b->yy_fill_buffer = 1; /* If b is the current buffer, then yy_init_buffer was _probably_ * called from yyrestart() 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 = 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. * */ void yy_flush_buffer (YY_BUFFER_STATE b ) { 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 ) yy_load_buffer_state( ); } /** 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. * */ void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) { if (new_buffer == NULL) return; yyensure_buffer_stack(); /* This block is copied from yy_switch_to_buffer. */ if ( YY_CURRENT_BUFFER ) { /* Flush out information for old buffer. */ *(yy_c_buf_p) = (yy_hold_char); YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); } /* Only push if top exists. Otherwise, replace top. */ if (YY_CURRENT_BUFFER) (yy_buffer_stack_top)++; YY_CURRENT_BUFFER_LVALUE = new_buffer; /* copied from yy_switch_to_buffer. */ yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } /** Removes and deletes the top of the stack, if present. * The next element becomes the new top. * */ void yypop_buffer_state (void) { if (!YY_CURRENT_BUFFER) return; yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; if ((yy_buffer_stack_top) > 0) --(yy_buffer_stack_top); if (YY_CURRENT_BUFFER) { yy_load_buffer_state( ); (yy_did_buffer_switch_on_eof) = 1; } } /* Allocates the stack if it does not exist. * Guarantees space for at least one push. */ static void yyensure_buffer_stack (void) { yy_size_t num_to_alloc; if (!(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; (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc (num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); (yy_buffer_stack_max) = num_to_alloc; (yy_buffer_stack_top) = 0; return; } if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ /* Increase the buffer to prepare for a possible push. */ int grow_size = 8 /* arbitrary grow size */; num_to_alloc = (yy_buffer_stack_max) + grow_size; (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc ((yy_buffer_stack), num_to_alloc * sizeof(struct yy_buffer_state*) ); if ( ! (yy_buffer_stack) ) YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); /* zero only the new slots.*/ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); (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 * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) { 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) yyalloc(sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_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; yy_switch_to_buffer(b ); return b; } /** Setup the input buffer state to scan a string. The next call to yylex() will * scan from a @e copy of @a str. * @param yystr a NUL-terminated string to scan * * @return the newly allocated buffer state object. * @note If you want to scan bytes that may contain NUL values, then use * yy_scan_bytes() instead. */ YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) { return yy_scan_bytes(yystr,(int) strlen(yystr) ); } /** Setup the input buffer state to scan the given bytes. The next call to yylex() 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. * * @return the newly allocated buffer state object. */ YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len ) { YY_BUFFER_STATE b; char *buf; yy_size_t n; int i; /* Get memory for full buffer, including space for trailing EOB's. */ n = (yy_size_t) _yybytes_len + 2; buf = (char *) yyalloc(n ); if ( ! buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); for ( i = 0; i < _yybytes_len; ++i ) buf[i] = yybytes[i]; buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; b = yy_scan_buffer(buf,n ); if ( ! b ) YY_FATAL_ERROR( "bad buffer in yy_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 ) { (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] = (yy_hold_char); \ (yy_c_buf_p) = yytext + yyless_macro_arg; \ (yy_hold_char) = *(yy_c_buf_p); \ *(yy_c_buf_p) = '\0'; \ yyleng = yyless_macro_arg; \ } \ while ( 0 ) /* Accessor methods (get/set functions) to struct members. */ /** Get the current line number. * */ int yyget_lineno (void) { return yylineno; } /** Get the input stream. * */ FILE *yyget_in (void) { return yyin; } /** Get the output stream. * */ FILE *yyget_out (void) { return yyout; } /** Get the length of the current token. * */ yy_size_t yyget_leng (void) { return yyleng; } /** Get the current token. * */ char *yyget_text (void) { return yytext; } /** Set the current line number. * @param line_number * */ void yyset_lineno (int line_number ) { yylineno = line_number; } /** Set the input stream. This does not discard the current * input buffer. * @param in_str A readable stream. * * @see yy_switch_to_buffer */ void yyset_in (FILE * in_str ) { yyin = in_str ; } void yyset_out (FILE * out_str ) { yyout = out_str ; } int yyget_debug (void) { return yy_flex_debug; } void yyset_debug (int bdebug ) { yy_flex_debug = bdebug ; } static int yy_init_globals (void) { /* Initialization is the same as for the non-reentrant scanner. * This function is called from yylex_destroy(), so don't allocate here. */ (yy_buffer_stack) = 0; (yy_buffer_stack_top) = 0; (yy_buffer_stack_max) = 0; (yy_c_buf_p) = (char *) 0; (yy_init) = 0; (yy_start) = 0; /* 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 * yylex_init() */ return 0; } /* yylex_destroy is for both reentrant and non-reentrant scanners. */ int yylex_destroy (void) { /* Pop the buffer stack, destroying each element. */ while(YY_CURRENT_BUFFER){ yy_delete_buffer(YY_CURRENT_BUFFER ); YY_CURRENT_BUFFER_LVALUE = NULL; yypop_buffer_state(); } /* Destroy the stack itself. */ yyfree((yy_buffer_stack) ); (yy_buffer_stack) = NULL; /* Reset the globals. This is important in a non-reentrant scanner so the next time * yylex() is called, initialization will occur. */ yy_init_globals( ); return 0; } /* * Internal utility routines. */ #ifndef yytext_ptr static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) { register 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 ) { register int n; for ( n = 0; s[n]; ++n ) ; return n; } #endif void *yyalloc (yy_size_t size ) { return (void *) malloc( size ); } void *yyrealloc (void * ptr, yy_size_t size ) { /* 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 yyfree (void * ptr ) { free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ } #define YYTABLES_NAME "yytables" #line 328 "KDbSqlScanner.l" void tokenize(const char *data) { yy_switch_to_buffer(yy_scan_string(data)); globalToken.clear(); globalCurrentPos = 0; }