mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-11-18 21:51:57 +00:00
284 lines
8.7 KiB
C++
284 lines
8.7 KiB
C++
#include <Poco/String.h>
|
|
#include <Core/Names.h>
|
|
#include <Interpreters/QueryNormalizer.h>
|
|
#include <Interpreters/IdentifierSemantic.h>
|
|
#include <Interpreters/Context.h>
|
|
#include <Interpreters/AnalyzedJoin.h>
|
|
#include <Parsers/ASTFunction.h>
|
|
#include <Parsers/ASTIdentifier.h>
|
|
#include <Parsers/ASTSelectQuery.h>
|
|
#include <Parsers/ASTQueryParameter.h>
|
|
#include <Parsers/ASTTablesInSelectQuery.h>
|
|
#include <Common/StringUtils/StringUtils.h>
|
|
#include <Common/typeid_cast.h>
|
|
#include <IO/WriteHelpers.h>
|
|
|
|
namespace DB
|
|
{
|
|
|
|
namespace ErrorCodes
|
|
{
|
|
extern const int TOO_DEEP_AST;
|
|
extern const int CYCLIC_ALIASES;
|
|
extern const int UNKNOWN_QUERY_PARAMETER;
|
|
}
|
|
|
|
|
|
class CheckASTDepth
|
|
{
|
|
public:
|
|
CheckASTDepth(QueryNormalizer::Data & data_)
|
|
: data(data_)
|
|
{
|
|
if (data.level > data.settings.max_ast_depth)
|
|
throw Exception("Normalized AST is too deep. Maximum: " + toString(data.settings.max_ast_depth), ErrorCodes::TOO_DEEP_AST);
|
|
++data.level;
|
|
}
|
|
|
|
~CheckASTDepth()
|
|
{
|
|
--data.level;
|
|
}
|
|
|
|
private:
|
|
QueryNormalizer::Data & data;
|
|
};
|
|
|
|
|
|
class RestoreAliasOnExitScope
|
|
{
|
|
public:
|
|
RestoreAliasOnExitScope(String & alias_)
|
|
: alias(alias_)
|
|
, copy(alias_)
|
|
{}
|
|
|
|
~RestoreAliasOnExitScope()
|
|
{
|
|
alias = copy;
|
|
}
|
|
|
|
private:
|
|
String & alias;
|
|
const String copy;
|
|
};
|
|
|
|
|
|
void QueryNormalizer::visit(ASTFunction & node, const ASTPtr &, Data & data)
|
|
{
|
|
auto & aliases = data.aliases;
|
|
String & func_name = node.name;
|
|
ASTPtr & func_arguments = node.arguments;
|
|
|
|
/// `IN t` can be specified, where t is a table, which is equivalent to `IN (SELECT * FROM t)`.
|
|
if (functionIsInOrGlobalInOperator(func_name))
|
|
{
|
|
auto & ast = func_arguments->children.at(1);
|
|
if (auto opt_name = tryGetIdentifierName(ast))
|
|
if (!aliases.count(*opt_name))
|
|
setIdentifierSpecial(ast);
|
|
}
|
|
|
|
/// Special cases for count function.
|
|
String func_name_lowercase = Poco::toLower(func_name);
|
|
if (startsWith(func_name_lowercase, "count"))
|
|
{
|
|
/// Select implementation of countDistinct based on settings.
|
|
/// Important that it is done as query rewrite. It means rewritten query
|
|
/// will be sent to remote servers during distributed query execution,
|
|
/// and on all remote servers, function implementation will be same.
|
|
if (endsWith(func_name, "Distinct") && func_name_lowercase == "countdistinct")
|
|
func_name = data.settings.count_distinct_implementation;
|
|
}
|
|
}
|
|
|
|
void QueryNormalizer::visit(ASTIdentifier & node, ASTPtr & ast, Data & data)
|
|
{
|
|
auto & current_asts = data.current_asts;
|
|
String & current_alias = data.current_alias;
|
|
|
|
if (!IdentifierSemantic::getColumnName(node))
|
|
return;
|
|
|
|
/// If it is an alias, but not a parent alias (for constructs like "SELECT column + 1 AS column").
|
|
auto it_alias = data.aliases.find(node.name);
|
|
if (it_alias != data.aliases.end() && current_alias != node.name)
|
|
{
|
|
if (!IdentifierSemantic::canBeAlias(node))
|
|
{
|
|
/// This means that column had qualified name, which was translated (so, canBeAlias() returns false).
|
|
/// But there is an alias with the same name. So, let's use original name for that column.
|
|
/// If alias wasn't set, use original column name as alias.
|
|
/// That helps to avoid result set with columns which have same names but different values.
|
|
if (node.alias.empty())
|
|
{
|
|
node.name.swap(node.alias);
|
|
node.restoreCompoundName();
|
|
node.name.swap(node.alias);
|
|
}
|
|
|
|
return;
|
|
}
|
|
|
|
auto & alias_node = it_alias->second;
|
|
|
|
/// Let's replace it with the corresponding tree node.
|
|
if (current_asts.count(alias_node.get()))
|
|
throw Exception("Cyclic aliases", ErrorCodes::CYCLIC_ALIASES);
|
|
|
|
String my_alias = ast->tryGetAlias();
|
|
if (!my_alias.empty() && my_alias != alias_node->getAliasOrColumnName())
|
|
{
|
|
/// Avoid infinite recursion here
|
|
auto opt_name = IdentifierSemantic::getColumnName(alias_node);
|
|
bool is_cycle = opt_name && *opt_name == node.name;
|
|
|
|
if (!is_cycle)
|
|
{
|
|
/// In a construct like "a AS b", where a is an alias, you must set alias b to the result of substituting alias a.
|
|
ast = alias_node->clone();
|
|
ast->setAlias(my_alias);
|
|
}
|
|
}
|
|
else
|
|
ast = alias_node;
|
|
}
|
|
}
|
|
|
|
/// mark table identifiers as 'not columns'
|
|
void QueryNormalizer::visit(ASTTablesInSelectQueryElement & node, const ASTPtr &, Data & data)
|
|
{
|
|
/// mark table Identifiers as 'not a column'
|
|
if (node.table_expression)
|
|
{
|
|
auto & expr = node.table_expression->as<ASTTableExpression &>();
|
|
setIdentifierSpecial(expr.database_and_table_name);
|
|
}
|
|
|
|
/// normalize JOIN ON section
|
|
if (node.table_join)
|
|
{
|
|
auto & join = node.table_join->as<ASTTableJoin &>();
|
|
if (join.on_expression)
|
|
visit(join.on_expression, data);
|
|
}
|
|
}
|
|
|
|
static bool needVisitChild(const ASTPtr & child)
|
|
{
|
|
if (child->as<ASTSelectQuery>() || child->as<ASTTableExpression>())
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
/// special visitChildren() for ASTSelectQuery
|
|
void QueryNormalizer::visit(ASTSelectQuery & select, const ASTPtr &, Data & data)
|
|
{
|
|
for (auto & child : select.children)
|
|
if (needVisitChild(child))
|
|
visit(child, data);
|
|
|
|
#if 1 /// TODO: legacy?
|
|
/// If the WHERE clause or HAVING consists of a single alias, the reference must be replaced not only in children,
|
|
/// but also in where_expression and having_expression.
|
|
if (select.prewhere())
|
|
visit(select.refPrewhere(), data);
|
|
if (select.where())
|
|
visit(select.refWhere(), data);
|
|
if (select.having())
|
|
visit(select.refHaving(), data);
|
|
#endif
|
|
}
|
|
|
|
/// Don't go into subqueries.
|
|
/// Don't go into select query. It processes children itself.
|
|
/// Do not go to the left argument of lambda expressions, so as not to replace the formal parameters
|
|
/// on aliases in expressions of the form 123 AS x, arrayMap(x -> 1, [2]).
|
|
void QueryNormalizer::visitChildren(const ASTPtr & node, Data & data)
|
|
{
|
|
if (const auto * func_node = node->as<ASTFunction>())
|
|
{
|
|
/// We skip the first argument. We also assume that the lambda function can not have parameters.
|
|
size_t first_pos = 0;
|
|
if (func_node->name == "lambda")
|
|
first_pos = 1;
|
|
|
|
auto & func_children = func_node->arguments->children;
|
|
|
|
for (size_t i = first_pos; i < func_children.size(); ++i)
|
|
{
|
|
auto & child = func_children[i];
|
|
|
|
if (needVisitChild(child))
|
|
visit(child, data);
|
|
}
|
|
}
|
|
else if (!node->as<ASTSelectQuery>())
|
|
{
|
|
for (auto & child : node->children)
|
|
if (needVisitChild(child))
|
|
visit(child, data);
|
|
}
|
|
}
|
|
|
|
void QueryNormalizer::visit(ASTPtr & ast, Data & data)
|
|
{
|
|
CheckASTDepth scope1(data);
|
|
RestoreAliasOnExitScope scope2(data.current_alias);
|
|
|
|
auto & finished_asts = data.finished_asts;
|
|
auto & current_asts = data.current_asts;
|
|
|
|
if (finished_asts.count(ast))
|
|
{
|
|
ast = finished_asts[ast];
|
|
return;
|
|
}
|
|
|
|
ASTPtr initial_ast = ast;
|
|
current_asts.insert(initial_ast.get());
|
|
|
|
{
|
|
String my_alias = ast->tryGetAlias();
|
|
if (!my_alias.empty())
|
|
data.current_alias = my_alias;
|
|
}
|
|
|
|
if (auto * node_func = ast->as<ASTFunction>())
|
|
visit(*node_func, ast, data);
|
|
else if (auto * node_id = ast->as<ASTIdentifier>())
|
|
visit(*node_id, ast, data);
|
|
else if (auto * node_tables = ast->as<ASTTablesInSelectQueryElement>())
|
|
visit(*node_tables, ast, data);
|
|
else if (auto * node_select = ast->as<ASTSelectQuery>())
|
|
visit(*node_select, ast, data);
|
|
else if (auto * node_param = ast->as<ASTQueryParameter>())
|
|
throw Exception("Query parameter " + backQuote(node_param->name) + " was not set", ErrorCodes::UNKNOWN_QUERY_PARAMETER);
|
|
|
|
/// If we replace the root of the subtree, we will be called again for the new root, in case the alias is replaced by an alias.
|
|
if (ast.get() != initial_ast.get())
|
|
visit(ast, data);
|
|
else
|
|
visitChildren(ast, data);
|
|
|
|
current_asts.erase(initial_ast.get());
|
|
current_asts.erase(ast.get());
|
|
finished_asts[initial_ast] = ast;
|
|
|
|
/// @note can not place it in CheckASTDepth dtor cause of exception.
|
|
if (data.level == 1)
|
|
{
|
|
try
|
|
{
|
|
ast->checkSize(data.settings.max_expanded_ast_elements);
|
|
}
|
|
catch (Exception & e)
|
|
{
|
|
e.addMessage("(after expansion of aliases)");
|
|
throw;
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|