Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
2dot5
ClickHouse
提交
4c179e45
C
ClickHouse
项目概览
2dot5
/
ClickHouse
通知
3
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
ClickHouse
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
4c179e45
编写于
6月 08, 2020
作者:
N
Nikolai Kochetov
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add QueryPlan.
上级
108575c8
变更
4
隐藏空白更改
内联
并排
Showing
4 changed file
with
159 addition
and
0 deletion
+159
-0
src/Processors/QueryPlan/IQueryPlanStep.h
src/Processors/QueryPlan/IQueryPlanStep.h
+1
-0
src/Processors/QueryPlan/QueryPlan.cpp
src/Processors/QueryPlan/QueryPlan.cpp
+112
-0
src/Processors/QueryPlan/QueryPlan.h
src/Processors/QueryPlan/QueryPlan.h
+45
-0
src/Processors/ya.make
src/Processors/ya.make
+1
-0
未找到文件。
src/Processors/QueryPlan/IQueryPlanStep.h
浏览文件 @
4c179e45
...
...
@@ -51,4 +51,5 @@ protected:
std
::
optional
<
DataStream
>
output_stream
;
};
using
QueryPlanStepPtr
=
std
::
unique_ptr
<
IQueryPlanStep
>
;
}
src/Processors/QueryPlan/QueryPlan.cpp
0 → 100644
浏览文件 @
4c179e45
#include <Processors/QueryPlan/QueryPlan.h>
#include <Processors/QueryPlan/IQueryPlanStep.h>
#include <stack>
namespace
DB
{
namespace
ErrorCodes
{
extern
const
int
LOGICAL_ERROR
;
}
void
QueryPlan
::
checkInitialized
()
const
{
if
(
!
isInitialized
())
throw
Exception
(
"QueryPlan was not initialized"
,
ErrorCodes
::
LOGICAL_ERROR
);
}
void
QueryPlan
::
checkNotCompleted
()
const
{
if
(
isCompleted
())
throw
Exception
(
"QueryPlan was already completed"
,
ErrorCodes
::
LOGICAL_ERROR
);
}
bool
QueryPlan
::
isCompleted
()
const
{
return
isInitialized
()
&&
!
root
->
step
->
hasOutputStream
();
}
const
DataStream
&
QueryPlan
::
getCurrentDataStream
()
const
{
checkInitialized
();
checkNotCompleted
();
return
root
->
step
->
getOutputStream
();
}
void
QueryPlan
::
addStep
(
QueryPlanStepPtr
step
)
{
checkNotCompleted
();
size_t
num_input_streams
=
step
->
getInputStreams
().
size
();
if
(
num_input_streams
==
0
)
{
if
(
isInitialized
())
throw
Exception
(
"Cannot add step "
+
step
->
getName
()
+
" to QueryPlan because "
"step has no inputs, but QueryPlan is already initialised"
,
ErrorCodes
::
LOGICAL_ERROR
);
nodes
.
emplace_back
(
Node
{.
step
=
std
::
move
(
step
)});
return
;
}
if
(
num_input_streams
==
1
)
{
if
(
!
isInitialized
())
throw
Exception
(
"Cannot add step "
+
step
->
getName
()
+
" to QueryPlan because "
"step has input, but QueryPlan is not initialised"
,
ErrorCodes
::
LOGICAL_ERROR
);
const
auto
&
root_header
=
root
->
step
->
getOutputStream
().
header
;
const
auto
&
step_header
=
step
->
getInputStreams
().
front
().
header
;
if
(
!
blocksHaveEqualStructure
(
root_header
,
step_header
))
throw
Exception
(
"Cannot add step "
+
step
->
getName
()
+
" to QueryPlan because "
"it has incompatible header with root step "
+
root
->
step
->
getName
()
+
" "
"root header: "
+
root_header
.
dumpStructure
()
+
"step header: "
+
step_header
.
dumpStructure
(),
ErrorCodes
::
LOGICAL_ERROR
);
nodes
.
emplace_back
(
Node
{.
step
=
std
::
move
(
step
),
.
children
=
{
root
}});
root
=
&
nodes
.
back
();
return
;
}
throw
Exception
(
"Cannot add step "
+
step
->
getName
()
+
" to QueryPlan because it has "
+
std
::
to_string
(
num_input_streams
)
+
" inputs but "
+
std
::
to_string
(
isInitialized
()
?
1
:
0
)
+
" input expected"
,
ErrorCodes
::
LOGICAL_ERROR
);
}
QueryPipelinePtr
QueryPlan
::
buildQueryPipeline
()
{
checkInitialized
();
struct
Frame
{
Node
*
node
;
QueryPipelines
pipelines
;
};
QueryPipelinePtr
last_pipeline
;
std
::
stack
<
Frame
>
stack
;
stack
.
push
({.
node
=
root
});
while
(
!
stack
.
empty
())
{
auto
&
frame
=
stack
.
top
();
if
(
last_pipeline
)
frame
.
pipelines
.
emplace_back
(
std
::
move
(
last_pipeline
));
size_t
next_child
=
frame
.
pipelines
.
size
();
if
(
next_child
==
frame
.
node
->
children
.
size
())
{
last_pipeline
=
frame
.
node
->
step
->
updatePipeline
(
std
::
move
(
frame
.
pipelines
));
stack
.
pop
();
}
else
stack
.
push
({.
node
=
frame
.
node
->
children
[
next_child
]});
}
return
last_pipeline
;
}
}
src/Processors/QueryPlan/QueryPlan.h
0 → 100644
浏览文件 @
4c179e45
#pragma once
#include <memory>
#include <list>
#include <vector>
namespace
DB
{
class
DataStream
;
class
IQueryPlanStep
;
using
QueryPlanStepPtr
=
std
::
unique_ptr
<
IQueryPlanStep
>
;
class
QueryPipeline
;
using
QueryPipelinePtr
=
std
::
unique_ptr
<
QueryPipeline
>
;
/// A tree of query steps.
class
QueryPlan
{
public:
void
addStep
(
QueryPlanStepPtr
step
);
bool
isInitialized
()
const
{
return
root
!=
nullptr
;
}
/// Tree is not empty
bool
isCompleted
()
const
;
/// Tree is not empty and root hasOutputStream()
const
DataStream
&
getCurrentDataStream
()
const
;
/// Checks that (isInitialized() && !isCompleted())
QueryPipelinePtr
buildQueryPipeline
();
private:
struct
Node
{
QueryPlanStepPtr
step
;
std
::
vector
<
Node
*>
children
;
};
using
Nodes
=
std
::
list
<
Node
>
;
Nodes
nodes
;
Node
*
root
=
nullptr
;
void
checkInitialized
()
const
;
void
checkNotCompleted
()
const
;
};
}
src/Processors/ya.make
浏览文件 @
4c179e45
...
...
@@ -135,6 +135,7 @@ SRCS(
Transforms/SortingTransform.cpp
Transforms/TotalsHavingTransform.cpp
QueryPlan/IQueryPlanStep.cpp
QueryPlan/QueryPlan.cpp
)
END()
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录