2022-10-26 10:43:29 +00:00
|
|
|
#include <Storages/MergeTree/RPNBuilder.h>
|
|
|
|
|
|
|
|
#include <Common/FieldVisitorToString.h>
|
|
|
|
|
|
|
|
#include <Parsers/ASTLiteral.h>
|
|
|
|
#include <Parsers/ASTIdentifier.h>
|
|
|
|
#include <Parsers/ASTFunction.h>
|
|
|
|
#include <Parsers/ASTSubquery.h>
|
|
|
|
|
|
|
|
#include <DataTypes/FieldToDataType.h>
|
|
|
|
#include <DataTypes/DataTypeNullable.h>
|
|
|
|
|
|
|
|
#include <Columns/ColumnConst.h>
|
|
|
|
#include <Columns/ColumnSet.h>
|
|
|
|
|
|
|
|
#include <Functions/IFunction.h>
|
|
|
|
|
|
|
|
#include <Storages/KeyDescription.h>
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
2022-10-26 11:27:14 +00:00
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
|
|
|
extern const int LOGICAL_ERROR;
|
|
|
|
}
|
|
|
|
|
2022-10-26 10:43:29 +00:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
|
|
|
void appendColumnNameWithoutAlias(const ActionsDAG::Node & node, WriteBuffer & out, bool legacy = false)
|
|
|
|
{
|
|
|
|
switch (node.type)
|
|
|
|
{
|
2022-10-26 13:54:37 +00:00
|
|
|
case ActionsDAG::ActionType::INPUT:
|
2022-10-26 10:43:29 +00:00
|
|
|
writeString(node.result_name, out);
|
|
|
|
break;
|
2022-10-26 13:54:37 +00:00
|
|
|
case ActionsDAG::ActionType::COLUMN:
|
2022-10-26 10:43:29 +00:00
|
|
|
{
|
|
|
|
/// If it was created from ASTLiteral, then result_name can be an alias.
|
|
|
|
/// We need to convert value back to string here.
|
|
|
|
if (const auto * column_const = typeid_cast<const ColumnConst *>(node.column.get()))
|
|
|
|
writeString(applyVisitor(FieldVisitorToString(), column_const->getField()), out);
|
|
|
|
/// It may be possible that column is ColumnSet
|
|
|
|
else
|
|
|
|
writeString(node.result_name, out);
|
|
|
|
break;
|
|
|
|
}
|
2022-10-26 13:54:37 +00:00
|
|
|
case ActionsDAG::ActionType::ALIAS:
|
2022-10-26 10:43:29 +00:00
|
|
|
appendColumnNameWithoutAlias(*node.children.front(), out, legacy);
|
|
|
|
break;
|
2022-10-26 13:54:37 +00:00
|
|
|
case ActionsDAG::ActionType::ARRAY_JOIN:
|
2022-10-26 10:43:29 +00:00
|
|
|
writeCString("arrayJoin(", out);
|
|
|
|
appendColumnNameWithoutAlias(*node.children.front(), out, legacy);
|
|
|
|
writeChar(')', out);
|
|
|
|
break;
|
2022-10-26 13:54:37 +00:00
|
|
|
case ActionsDAG::ActionType::FUNCTION:
|
2022-10-26 10:43:29 +00:00
|
|
|
{
|
|
|
|
auto name = node.function_base->getName();
|
|
|
|
if (legacy && name == "modulo")
|
|
|
|
writeCString("moduleLegacy", out);
|
|
|
|
else
|
|
|
|
writeString(name, out);
|
|
|
|
|
|
|
|
writeChar('(', out);
|
|
|
|
bool first = true;
|
|
|
|
for (const auto * arg : node.children)
|
|
|
|
{
|
|
|
|
if (!first)
|
|
|
|
writeCString(", ", out);
|
|
|
|
first = false;
|
|
|
|
|
|
|
|
appendColumnNameWithoutAlias(*arg, out, legacy);
|
|
|
|
}
|
|
|
|
writeChar(')', out);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
String getColumnNameWithoutAlias(const ActionsDAG::Node & node, bool legacy = false)
|
|
|
|
{
|
|
|
|
WriteBufferFromOwnString out;
|
|
|
|
appendColumnNameWithoutAlias(node, out, legacy);
|
|
|
|
return std::move(out.str());
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
RPNBuilderTreeContext::RPNBuilderTreeContext(ContextPtr query_context_)
|
|
|
|
: query_context(std::move(query_context_))
|
|
|
|
{}
|
|
|
|
|
|
|
|
RPNBuilderTreeContext::RPNBuilderTreeContext(ContextPtr query_context_, Block block_with_constants_, PreparedSetsPtr prepared_sets_)
|
|
|
|
: query_context(std::move(query_context_))
|
|
|
|
, block_with_constants(std::move(block_with_constants_))
|
|
|
|
, prepared_sets(std::move(prepared_sets_))
|
|
|
|
{}
|
|
|
|
|
|
|
|
RPNBuilderTreeNode::RPNBuilderTreeNode(const ActionsDAG::Node * dag_node_, RPNBuilderTreeContext & tree_context_)
|
|
|
|
: dag_node(dag_node_)
|
|
|
|
, tree_context(tree_context_)
|
|
|
|
{
|
|
|
|
assert(dag_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
RPNBuilderTreeNode::RPNBuilderTreeNode(const IAST * ast_node_, RPNBuilderTreeContext & tree_context_)
|
|
|
|
: ast_node(ast_node_)
|
|
|
|
, tree_context(tree_context_)
|
|
|
|
{
|
|
|
|
assert(ast_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string RPNBuilderTreeNode::getColumnName() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
return ast_node->getColumnNameWithoutAlias();
|
|
|
|
else
|
|
|
|
return getColumnNameWithoutAlias(*dag_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string RPNBuilderTreeNode::getColumnNameWithModuloLegacy() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
{
|
|
|
|
auto adjusted_ast = ast_node->clone();
|
|
|
|
KeyDescription::moduloToModuloLegacyRecursive(adjusted_ast);
|
|
|
|
return adjusted_ast->getColumnNameWithoutAlias();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return getColumnNameWithoutAlias(*dag_node, true);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool RPNBuilderTreeNode::isFunction() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
return typeid_cast<const ASTFunction *>(ast_node);
|
|
|
|
else
|
|
|
|
return dag_node->type == ActionsDAG::ActionType::FUNCTION;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool RPNBuilderTreeNode::isConstant() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
2022-10-26 13:54:37 +00:00
|
|
|
{
|
|
|
|
bool is_literal = typeid_cast<const ASTLiteral *>(ast_node);
|
|
|
|
if (is_literal)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
String column_name = ast_node->getColumnName();
|
|
|
|
const auto & block_with_constants = tree_context.getBlockWithConstants();
|
|
|
|
|
|
|
|
if (block_with_constants.has(column_name) && isColumnConst(*block_with_constants.getByName(column_name).column))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2022-10-26 10:43:29 +00:00
|
|
|
else
|
2022-10-26 13:54:37 +00:00
|
|
|
{
|
2022-10-26 10:43:29 +00:00
|
|
|
return dag_node->column && isColumnConst(*dag_node->column);
|
2022-10-26 13:54:37 +00:00
|
|
|
}
|
2022-10-26 10:43:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ColumnWithTypeAndName RPNBuilderTreeNode::getConstantColumn() const
|
|
|
|
{
|
|
|
|
if (!isConstant())
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "RPNBuilderTree node is not a constant");
|
|
|
|
|
2022-10-26 13:54:37 +00:00
|
|
|
ColumnWithTypeAndName result;
|
2022-10-26 10:43:29 +00:00
|
|
|
|
|
|
|
if (ast_node)
|
|
|
|
{
|
|
|
|
const auto * literal = assert_cast<const ASTLiteral *>(ast_node);
|
2022-10-26 13:54:37 +00:00
|
|
|
if (literal)
|
|
|
|
{
|
|
|
|
result.type = applyVisitor(FieldToDataType(), literal->value);
|
|
|
|
result.column = result.type->createColumnConst(0, literal->value);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
String column_name = ast_node->getColumnName();
|
|
|
|
const auto & block_with_constants = tree_context.getBlockWithConstants();
|
|
|
|
|
|
|
|
return block_with_constants.getByName(column_name);
|
2022-10-26 10:43:29 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2022-10-26 13:54:37 +00:00
|
|
|
result.type = dag_node->result_type;
|
|
|
|
result.column = dag_node->column;
|
2022-10-26 10:43:29 +00:00
|
|
|
}
|
|
|
|
|
2022-10-26 13:54:37 +00:00
|
|
|
return result;
|
2022-10-26 10:43:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool RPNBuilderTreeNode::tryGetConstant(Field & output_value, DataTypePtr & output_type) const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
{
|
|
|
|
// Constant expr should use alias names if any
|
|
|
|
String column_name = ast_node->getColumnName();
|
|
|
|
const auto & block_with_constants = tree_context.getBlockWithConstants();
|
|
|
|
|
|
|
|
if (const auto * lit = ast_node->as<ASTLiteral>())
|
|
|
|
{
|
|
|
|
/// By default block_with_constants has only one column named "_dummy".
|
|
|
|
/// If block contains only constants it's may not be preprocessed by
|
|
|
|
// ExpressionAnalyzer, so try to look up in the default column.
|
|
|
|
if (!block_with_constants.has(column_name))
|
|
|
|
column_name = "_dummy";
|
|
|
|
|
|
|
|
/// Simple literal
|
|
|
|
output_value = lit->value;
|
|
|
|
output_type = block_with_constants.getByName(column_name).type;
|
|
|
|
|
|
|
|
/// If constant is not Null, we can assume it's type is not Nullable as well.
|
|
|
|
if (!output_value.isNull())
|
|
|
|
output_type = removeNullable(output_type);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
else if (block_with_constants.has(column_name) &&
|
|
|
|
isColumnConst(*block_with_constants.getByName(column_name).column))
|
|
|
|
{
|
|
|
|
/// An expression which is dependent on constants only
|
|
|
|
const auto & expr_info = block_with_constants.getByName(column_name);
|
|
|
|
output_value = (*expr_info.column)[0];
|
|
|
|
output_type = expr_info.type;
|
|
|
|
|
|
|
|
if (!output_value.isNull())
|
|
|
|
output_type = removeNullable(output_type);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (dag_node->column && isColumnConst(*dag_node->column))
|
|
|
|
{
|
|
|
|
output_value = (*dag_node->column)[0];
|
|
|
|
output_type = dag_node->result_type;
|
|
|
|
|
|
|
|
if (!output_value.isNull())
|
|
|
|
output_type = removeNullable(output_type);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
|
|
|
ConstSetPtr tryGetSetFromDAGNode(const ActionsDAG::Node * dag_node)
|
|
|
|
{
|
|
|
|
if (!dag_node->column)
|
|
|
|
return {};
|
|
|
|
|
|
|
|
const IColumn * col = dag_node->column.get();
|
|
|
|
if (const auto * col_const = typeid_cast<const ColumnConst *>(col))
|
|
|
|
col = &col_const->getDataColumn();
|
|
|
|
|
|
|
|
if (const auto * col_set = typeid_cast<const ColumnSet *>(col))
|
|
|
|
{
|
|
|
|
auto set = col_set->getData();
|
|
|
|
|
|
|
|
if (set->isCreated())
|
|
|
|
return set;
|
|
|
|
}
|
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstSetPtr RPNBuilderTreeNode::tryGetPreparedSet() const
|
|
|
|
{
|
|
|
|
const auto & prepared_sets = getTreeContext().getPreparedSets();
|
|
|
|
|
|
|
|
if (ast_node && prepared_sets)
|
|
|
|
{
|
|
|
|
auto prepared_sets_with_same_hash = prepared_sets->getByTreeHash(ast_node->getTreeHash());
|
|
|
|
for (auto & set : prepared_sets_with_same_hash)
|
|
|
|
if (set->isCreated())
|
|
|
|
return set;
|
|
|
|
}
|
|
|
|
else if (dag_node)
|
|
|
|
{
|
|
|
|
return tryGetSetFromDAGNode(dag_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstSetPtr RPNBuilderTreeNode::tryGetPreparedSet(const DataTypes & data_types) const
|
|
|
|
{
|
|
|
|
const auto & prepared_sets = getTreeContext().getPreparedSets();
|
|
|
|
|
|
|
|
if (prepared_sets && ast_node)
|
|
|
|
{
|
|
|
|
if (ast_node->as<ASTSubquery>() || ast_node->as<ASTTableIdentifier>())
|
|
|
|
return prepared_sets->get(PreparedSetKey::forSubquery(*ast_node));
|
|
|
|
|
|
|
|
return prepared_sets->get(PreparedSetKey::forLiteral(*ast_node, data_types));
|
|
|
|
}
|
|
|
|
else if (dag_node)
|
|
|
|
{
|
|
|
|
return tryGetSetFromDAGNode(dag_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
ConstSetPtr RPNBuilderTreeNode::tryGetPreparedSet(
|
|
|
|
const std::vector<MergeTreeSetIndex::KeyTuplePositionMapping> & indexes_mapping,
|
|
|
|
const DataTypes & data_types) const
|
|
|
|
{
|
|
|
|
const auto & prepared_sets = getTreeContext().getPreparedSets();
|
|
|
|
|
|
|
|
if (prepared_sets && ast_node)
|
|
|
|
{
|
|
|
|
if (ast_node->as<ASTSubquery>() || ast_node->as<ASTTableIdentifier>())
|
|
|
|
return prepared_sets->get(PreparedSetKey::forSubquery(*ast_node));
|
|
|
|
|
|
|
|
/// We have `PreparedSetKey::forLiteral` but it is useless here as we don't have enough information
|
|
|
|
/// about types in left argument of the IN operator. Instead, we manually iterate through all the sets
|
|
|
|
/// and find the one for the right arg based on the AST structure (getTreeHash), after that we check
|
|
|
|
/// that the types it was prepared with are compatible with the types of the primary key.
|
|
|
|
auto types_match = [&indexes_mapping, &data_types](const SetPtr & candidate_set)
|
|
|
|
{
|
|
|
|
assert(indexes_mapping.size() == data_types.size());
|
|
|
|
|
|
|
|
for (size_t i = 0; i < indexes_mapping.size(); ++i)
|
|
|
|
{
|
|
|
|
if (!candidate_set->areTypesEqual(indexes_mapping[i].tuple_index, data_types[i]))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
};
|
|
|
|
|
|
|
|
auto tree_hash = ast_node->getTreeHash();
|
|
|
|
for (const auto & set : prepared_sets->getByTreeHash(tree_hash))
|
|
|
|
{
|
|
|
|
if (types_match(set))
|
|
|
|
return set;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (dag_node->column)
|
|
|
|
{
|
|
|
|
return tryGetSetFromDAGNode(dag_node);
|
|
|
|
}
|
|
|
|
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
RPNBuilderFunctionTreeNode RPNBuilderTreeNode::toFunctionNode() const
|
|
|
|
{
|
|
|
|
if (!isFunction())
|
|
|
|
throw Exception(ErrorCodes::LOGICAL_ERROR, "RPNBuilderTree node is not a constant");
|
|
|
|
|
|
|
|
if (this->ast_node)
|
|
|
|
return RPNBuilderFunctionTreeNode(this->ast_node, tree_context);
|
|
|
|
else
|
|
|
|
return RPNBuilderFunctionTreeNode(this->dag_node, tree_context);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::string RPNBuilderFunctionTreeNode::getFunctionName() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
return assert_cast<const ASTFunction *>(ast_node)->name;
|
|
|
|
else
|
|
|
|
return dag_node->function_base->getName();
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t RPNBuilderFunctionTreeNode::getArgumentsSize() const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
{
|
|
|
|
const auto * ast_function = assert_cast<const ASTFunction *>(ast_node);
|
|
|
|
return ast_function->arguments ? ast_function->arguments->children.size() : 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return dag_node->children.size();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
RPNBuilderTreeNode RPNBuilderFunctionTreeNode::getArgumentAt(size_t index) const
|
|
|
|
{
|
|
|
|
if (ast_node)
|
|
|
|
{
|
|
|
|
const auto * ast_function = assert_cast<const ASTFunction *>(ast_node);
|
|
|
|
return RPNBuilderTreeNode(ast_function->arguments->children[index].get(), tree_context);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return RPNBuilderTreeNode(dag_node->children[index], tree_context);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|