Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
34680930
G
Gpdb
项目概览
Greenplum
/
Gpdb
通知
7
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
G
Gpdb
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
34680930
编写于
11月 22, 1998
作者:
V
Vadim B. Mikheev
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix using indices in OR.
EXPLAIN all indices used.
上级
1f00f0dc
变更
7
隐藏空白更改
内联
并排
Showing
7 changed file
with
27 addition
and
12 deletion
+27
-12
src/backend/commands/explain.c
src/backend/commands/explain.c
+9
-4
src/backend/executor/nodeIndexscan.c
src/backend/executor/nodeIndexscan.c
+2
-2
src/backend/nodes/copyfuncs.c
src/backend/nodes/copyfuncs.c
+2
-1
src/backend/nodes/outfuncs.c
src/backend/nodes/outfuncs.c
+4
-1
src/backend/nodes/readfuncs.c
src/backend/nodes/readfuncs.c
+4
-1
src/backend/optimizer/plan/createplan.c
src/backend/optimizer/plan/createplan.c
+5
-2
src/backend/parser/gram.c
src/backend/parser/gram.c
+1
-1
未找到文件。
src/backend/commands/explain.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/commands/explain.c,v 1.2
6 1998/11/08 19:38:34 tgl
Exp $
* $Header: /cvsroot/pgsql/src/backend/commands/explain.c,v 1.2
7 1998/11/22 10:48:34 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -217,9 +217,14 @@ explain_outNode(StringInfo str, Plan *plan, int indent, ExplainState *es)
{
case
T_IndexScan
:
appendStringInfo
(
str
,
" using "
);
l
=
((
IndexScan
*
)
plan
)
->
indxid
;
relation
=
RelationIdCacheGetRelation
((
int
)
lfirst
(
l
));
appendStringInfo
(
str
,
(
RelationGetRelationName
(
relation
))
->
data
);
i
=
0
;
foreach
(
l
,
((
IndexScan
*
)
plan
)
->
indxid
)
{
relation
=
RelationIdCacheGetRelation
((
int
)
lfirst
(
l
));
if
(
++
i
>
1
)
appendStringInfo
(
str
,
", "
);
appendStringInfo
(
str
,
(
RelationGetRelationName
(
relation
))
->
data
);
}
case
T_SeqScan
:
if
(((
Scan
*
)
plan
)
->
scanrelid
>
0
)
{
...
...
src/backend/executor/nodeIndexscan.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/executor/nodeIndexscan.c,v 1.2
7 1998/09/01 04:28:32 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/executor/nodeIndexscan.c,v 1.2
8 1998/11/22 10:48:36 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -154,7 +154,7 @@ IndexNext(IndexScan *node)
prev_index
++
)
{
scanstate
->
cstate
.
cs_ExprContext
->
ecxt_scantuple
=
slot
;
if
(
ExecQual
(
nth
(
prev_index
,
node
->
indxqual
),
if
(
ExecQual
(
nth
(
prev_index
,
node
->
indxqual
orig
),
scanstate
->
cstate
.
cs_ExprContext
))
{
prev_matches
=
true
;
...
...
src/backend/nodes/copyfuncs.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.
49 1998/10/22 13:52:20 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.
50 1998/11/22 10:48:38 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -247,6 +247,7 @@ _copyIndexScan(IndexScan *from)
*/
newnode
->
indxid
=
listCopy
(
from
->
indxid
);
Node_Copy
(
from
,
newnode
,
indxqual
);
Node_Copy
(
from
,
newnode
,
indxqualorig
);
Node_Copy
(
from
,
newnode
,
indxstate
);
return
newnode
;
...
...
src/backend/nodes/outfuncs.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.4
7 1998/10/22 13:52:21 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/outfuncs.c,v 1.4
8 1998/11/22 10:48:39 vadim
Exp $
*
* NOTES
* Every (plan) node in POSTGRES has an associated "out" routine which
...
...
@@ -517,6 +517,9 @@ _outIndexScan(StringInfo str, IndexScan *node)
appendStringInfo
(
str
,
" :indxqual "
);
_outNode
(
str
,
node
->
indxqual
);
appendStringInfo
(
str
,
" :indxqualorig "
);
_outNode
(
str
,
node
->
indxqualorig
);
}
/*
...
...
src/backend/nodes/readfuncs.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.3
8 1998/10/22 13:52:22 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/readfuncs.c,v 1.3
9 1998/11/22 10:48:40 vadim
Exp $
*
* NOTES
* Most of the read functions for plan nodes are tested. (In fact, they
...
...
@@ -546,6 +546,9 @@ _readIndexScan()
token
=
lsptok
(
NULL
,
&
length
);
/* eat :indxqual */
local_node
->
indxqual
=
nodeRead
(
true
);
/* now read it */
token
=
lsptok
(
NULL
,
&
length
);
/* eat :indxqualorig */
local_node
->
indxqualorig
=
nodeRead
(
true
);
/* now read it */
return
local_node
;
}
...
...
src/backend/optimizer/plan/createplan.c
浏览文件 @
34680930
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/plan/createplan.c,v 1.3
2 1998/09/01 04:29:47 momjian
Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/plan/createplan.c,v 1.3
3 1998/11/22 10:48:43 vadim
Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -63,7 +63,7 @@ static Node *fix_indxqual_references(Node *clause, Path *index_path);
static
Temp
*
make_temp
(
List
*
tlist
,
List
*
keys
,
Oid
*
operators
,
Plan
*
plan_node
,
int
temptype
);
static
IndexScan
*
make_indexscan
(
List
*
qptlist
,
List
*
qpqual
,
Index
scanrelid
,
List
*
indxid
,
List
*
indxqual
,
Cost
cost
);
List
*
indxid
,
List
*
indxqual
,
List
*
indxqualorig
,
Cost
cost
);
static
NestLoop
*
make_nestloop
(
List
*
qptlist
,
List
*
qpqual
,
Plan
*
lefttree
,
Plan
*
righttree
);
static
HashJoin
*
make_hashjoin
(
List
*
tlist
,
List
*
qpqual
,
...
...
@@ -405,6 +405,7 @@ create_indexscan_node(IndexPath *best_path,
lfirsti
(
best_path
->
path
.
parent
->
relids
),
best_path
->
indexid
,
fixed_indxqual
,
indxqual
,
best_path
->
path
.
path_cost
);
return
scan_node
;
...
...
@@ -937,6 +938,7 @@ make_indexscan(List *qptlist,
Index
scanrelid
,
List
*
indxid
,
List
*
indxqual
,
List
*
indxqualorig
,
Cost
cost
)
{
IndexScan
*
node
=
makeNode
(
IndexScan
);
...
...
@@ -951,6 +953,7 @@ make_indexscan(List *qptlist,
node
->
scan
.
scanrelid
=
scanrelid
;
node
->
indxid
=
indxid
;
node
->
indxqual
=
indxqual
;
node
->
indxqualorig
=
indxqualorig
;
node
->
scan
.
scanstate
=
(
CommonScanState
*
)
NULL
;
return
node
;
...
...
src/backend/parser/gram.c
浏览文件 @
34680930
...
...
@@ -229,7 +229,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/parser/Attic/gram.c,v 2.4
8 1998/10/30 04:54:01 scrappy
Exp $
* $Header: /cvsroot/pgsql/src/backend/parser/Attic/gram.c,v 2.4
9 1998/11/22 10:48:45 vadim
Exp $
*
* HISTORY
* AUTHOR DATE MAJOR EVENT
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录