mirror of
https://github.com/ClickHouse/ClickHouse.git
synced 2024-09-24 18:50:49 +00:00
108 lines
3.4 KiB
C++
108 lines
3.4 KiB
C++
#pragma once
|
|
|
|
#include <Interpreters/PreparedSets.h>
|
|
#include <Core/SortDescription.h>
|
|
#include <memory>
|
|
|
|
namespace DB
|
|
{
|
|
|
|
class ExpressionActions;
|
|
using ExpressionActionsPtr = std::shared_ptr<ExpressionActions>;
|
|
|
|
struct PrewhereInfo
|
|
{
|
|
/// Actions which are executed in order to alias columns are used for prewhere actions.
|
|
ExpressionActionsPtr alias_actions;
|
|
/// Actions which are executed on block in order to get filter column for prewhere step.
|
|
ExpressionActionsPtr prewhere_actions;
|
|
/// Actions which are executed after reading from storage in order to remove unused columns.
|
|
ExpressionActionsPtr remove_columns_actions;
|
|
String prewhere_column_name;
|
|
bool remove_prewhere_column = false;
|
|
bool need_filter = false;
|
|
|
|
PrewhereInfo() = default;
|
|
explicit PrewhereInfo(ExpressionActionsPtr prewhere_actions_, String prewhere_column_name_)
|
|
: prewhere_actions(std::move(prewhere_actions_)), prewhere_column_name(std::move(prewhere_column_name_)) {}
|
|
};
|
|
|
|
/// Helper struct to store all the information about the filter expression.
|
|
struct FilterInfo
|
|
{
|
|
ExpressionActionsPtr actions;
|
|
String column_name;
|
|
bool do_remove_column = false;
|
|
};
|
|
|
|
struct InputSortingInfo
|
|
{
|
|
SortDescription order_key_prefix_descr;
|
|
int direction;
|
|
|
|
InputSortingInfo(const SortDescription & order_key_prefix_descr_, int direction_)
|
|
: order_key_prefix_descr(order_key_prefix_descr_), direction(direction_) {}
|
|
|
|
bool operator ==(const InputSortingInfo & other) const
|
|
{
|
|
return order_key_prefix_descr == other.order_key_prefix_descr && direction == other.direction;
|
|
}
|
|
|
|
bool operator !=(const InputSortingInfo & other) const { return !(*this == other); }
|
|
};
|
|
|
|
using PrewhereInfoPtr = std::shared_ptr<PrewhereInfo>;
|
|
using FilterInfoPtr = std::shared_ptr<FilterInfo>;
|
|
using InputSortingInfoPtr = std::shared_ptr<const InputSortingInfo>;
|
|
|
|
struct SyntaxAnalyzerResult;
|
|
using SyntaxAnalyzerResultPtr = std::shared_ptr<const SyntaxAnalyzerResult>;
|
|
|
|
class ReadInOrderOptimizer;
|
|
using ReadInOrderOptimizerPtr = std::shared_ptr<const ReadInOrderOptimizer>;
|
|
|
|
/** Query along with some additional data,
|
|
* that can be used during query processing
|
|
* inside storage engines.
|
|
*/
|
|
struct SelectQueryInfo
|
|
{
|
|
ASTPtr query;
|
|
|
|
SyntaxAnalyzerResultPtr syntax_analyzer_result;
|
|
|
|
PrewhereInfoPtr prewhere_info;
|
|
|
|
ReadInOrderOptimizerPtr order_by_optimizer;
|
|
/// We can modify it while reading from storage
|
|
mutable InputSortingInfoPtr input_sorting_info;
|
|
|
|
/// Prepared sets are used for indices by storage engine.
|
|
/// Example: x IN (1, 2, 3)
|
|
PreparedSets sets;
|
|
|
|
/// Temporary flag is needed to support old pipeline with input streams.
|
|
/// If enabled, then pipeline returned by storage must be a tree.
|
|
/// Processors from the tree can't return ExpandPipeline status.
|
|
mutable bool force_tree_shaped_pipeline = false;
|
|
};
|
|
|
|
/// RAII class to enable force_tree_shaped_pipeline for SelectQueryInfo.
|
|
/// Looks awful, but I hope it's temporary.
|
|
struct ForceTreeShapedPipeline
|
|
{
|
|
explicit ForceTreeShapedPipeline(const SelectQueryInfo & info_) : info(info_)
|
|
{
|
|
force_tree_shaped_pipeline = info.force_tree_shaped_pipeline;
|
|
info.force_tree_shaped_pipeline = true;
|
|
}
|
|
|
|
~ForceTreeShapedPipeline() { info.force_tree_shaped_pipeline = force_tree_shaped_pipeline; }
|
|
|
|
private:
|
|
bool force_tree_shaped_pipeline;
|
|
const SelectQueryInfo & info;
|
|
};
|
|
|
|
}
|