Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Gpdb
提交
a5537608
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,体验更适合开发者的 AI 搜索 >>
提交
a5537608
编写于
2月 06, 1999
作者:
B
Bruce Momjian
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Optimizer cleanup.
上级
ead64f31
变更
6
隐藏空白更改
内联
并排
Showing
6 changed file
with
22 addition
and
21 deletion
+22
-21
src/backend/nodes/equalfuncs.c
src/backend/nodes/equalfuncs.c
+1
-2
src/backend/optimizer/path/joinutils.c
src/backend/optimizer/path/joinutils.c
+3
-3
src/backend/optimizer/path/mergeutils.c
src/backend/optimizer/path/mergeutils.c
+2
-2
src/backend/optimizer/util/ordering.c
src/backend/optimizer/util/ordering.c
+10
-8
src/backend/optimizer/util/pathnode.c
src/backend/optimizer/util/pathnode.c
+3
-3
src/include/optimizer/ordering.h
src/include/optimizer/ordering.h
+3
-3
未找到文件。
src/backend/nodes/equalfuncs.c
浏览文件 @
a5537608
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.2
3 1999/02/04 01:46:54
momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/nodes/equalfuncs.c,v 1.2
4 1999/02/06 17:29:25
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -344,7 +344,6 @@ _equalPath(Path *a, Path *b)
if
(
a
->
p_ordering
.
ord
.
sortop
==
NULL
||
b
->
p_ordering
.
ord
.
sortop
==
NULL
)
{
if
(
a
->
p_ordering
.
ord
.
sortop
!=
b
->
p_ordering
.
ord
.
sortop
)
return
false
;
}
...
...
src/backend/optimizer/path/joinutils.c
浏览文件 @
a5537608
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/path/Attic/joinutils.c,v 1.
9 1999/02/03 21:16:27
momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/path/Attic/joinutils.c,v 1.
10 1999/02/06 17:29:26
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -218,8 +218,8 @@ match_paths_joinkeys(List *joinkeys,
key_match
=
every_func
(
joinkeys
,
path
->
keys
,
which_subkey
);
if
(
equal_path_
path_
ordering
(
ordering
,
&
path
->
p_ordering
)
&&
if
(
equal_path_ordering
(
ordering
,
&
path
->
p_ordering
)
&&
length
(
joinkeys
)
==
length
(
path
->
keys
)
&&
key_match
)
{
...
...
src/backend/optimizer/path/mergeutils.c
浏览文件 @
a5537608
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/path/Attic/mergeutils.c,v 1.1
2 1999/02/04 03:19:09
momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/path/Attic/mergeutils.c,v 1.1
3 1999/02/06 17:29:26
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -115,7 +115,7 @@ match_order_mergeinfo(PathOrder *ordering, List *mergeinfo_list)
xmergeorder
=
mergeinfo
->
m_ordering
;
if
((
ordering
->
ordtype
==
MERGE_ORDER
&&
equal_merge_
merge_
ordering
(
ordering
->
ord
.
merge
,
xmergeorder
))
||
equal_merge_ordering
(
ordering
->
ord
.
merge
,
xmergeorder
))
||
(
ordering
->
ordtype
==
SORTOP_ORDER
&&
equal_path_merge_ordering
(
ordering
->
ord
.
sortop
,
xmergeorder
)))
{
...
...
src/backend/optimizer/util/ordering.c
浏览文件 @
a5537608
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/ordering.c,v 1.1
0 1999/02/05 19:59:30
momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/Attic/ordering.c,v 1.1
1 1999/02/06 17:29:27
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -21,13 +21,13 @@
static
bool
equal_sortops_order
(
Oid
*
ordering1
,
Oid
*
ordering2
);
/*
* equal-path-
path-
ordering--
* equal-path-ordering--
* Returns t iff two path orderings are equal.
*
*/
bool
equal_path_
path_
ordering
(
PathOrder
*
path_ordering1
,
PathOrder
*
path_ordering2
)
equal_path_ordering
(
PathOrder
*
path_ordering1
,
PathOrder
*
path_ordering2
)
{
if
(
path_ordering1
==
path_ordering2
)
return
true
;
...
...
@@ -83,20 +83,22 @@ equal_path_merge_ordering(Oid *path_ordering,
}
/*
* equal-merge-
merge-
ordering--
* equal-merge-ordering--
* Returns t iff two merge orderings are equal.
*
*/
bool
equal_merge_
merge_
ordering
(
MergeOrder
*
merge_ordering1
,
equal_merge_ordering
(
MergeOrder
*
merge_ordering1
,
MergeOrder
*
merge_ordering2
)
{
return
equal
(
merge_ordering1
,
merge_ordering2
);
}
/*****************************************************************************
/*
* sortops
*
*
****************************************************************************
/
*/
/*
* equal_sort_ops_order -
...
...
src/backend/optimizer/util/pathnode.c
浏览文件 @
a5537608
...
...
@@ -7,7 +7,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.1
8 1999/02/04 19:20:12
momjian Exp $
* $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.1
9 1999/02/06 17:29:27
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -165,8 +165,8 @@ better_path(Path *new_path, List *unique_paths, bool *noOther)
path
=
(
Path
*
)
lfirst
(
temp
);
if
(
samekeys
(
path
->
keys
,
new_path
->
keys
)
&&
equal_path_
path_
ordering
(
&
path
->
p_ordering
,
&
new_path
->
p_ordering
))
equal_path_ordering
(
&
path
->
p_ordering
,
&
new_path
->
p_ordering
))
{
old_path
=
path
;
break
;
...
...
src/include/optimizer/ordering.h
浏览文件 @
a5537608
...
...
@@ -6,7 +6,7 @@
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: ordering.h,v 1.
9 1998/09/01 04:37:12
momjian Exp $
* $Id: ordering.h,v 1.
10 1999/02/06 17:29:30
momjian Exp $
*
*-------------------------------------------------------------------------
*/
...
...
@@ -15,11 +15,11 @@
#include <nodes/relation.h>
extern
bool
equal_path_
path_
ordering
(
PathOrder
*
path_ordering1
,
extern
bool
equal_path_ordering
(
PathOrder
*
path_ordering1
,
PathOrder
*
path_ordering2
);
extern
bool
equal_path_merge_ordering
(
Oid
*
path_ordering
,
MergeOrder
*
merge_ordering
);
extern
bool
equal_merge_
merge_
ordering
(
MergeOrder
*
merge_ordering1
,
extern
bool
equal_merge_ordering
(
MergeOrder
*
merge_ordering1
,
MergeOrder
*
merge_ordering2
);
#endif
/* ORDERING_H */
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录