Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
magicwindyyd
mindspore
提交
8cea8816
M
mindspore
项目概览
magicwindyyd
/
mindspore
与 Fork 源项目一致
Fork自
MindSpore / mindspore
通知
1
Star
1
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
M
mindspore
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
8cea8816
编写于
8月 29, 2020
作者:
M
mindspore-ci-bot
提交者:
Gitee
8月 29, 2020
浏览文件
操作
浏览文件
下载
差异文件
!5374 clean code for graph kernel module.
Merge pull request !5374 from chenlei_autodiff/clean_code_graph_kernel
上级
fb2c389d
660cefb6
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
44 addition
and
35 deletion
+44
-35
mindspore/ccsrc/backend/optimizer/pass/fuse_basic.cc
mindspore/ccsrc/backend/optimizer/pass/fuse_basic.cc
+44
-35
未找到文件。
mindspore/ccsrc/backend/optimizer/pass/fuse_basic.cc
浏览文件 @
8cea8816
...
...
@@ -73,54 +73,44 @@ std::vector<AnfNodePtr> FindFuseCNodes(const CNodePtr &cnode, bool is_before_ker
return
used_nodes
;
}
void
RemoveControlDependOut
(
const
FuncGraphPtr
&
fg
,
AnfNodePtrList
*
outputs
,
const
FuncGraphManagerPtr
&
mng
)
{
AnfNodeSet
outputs_set
;
for
(
auto
out
:
*
outputs
)
{
outputs_set
.
insert
(
out
);
}
AnfNodePtrList
vir_outputs
;
std
::
unordered_map
<
AnfNodePtr
,
AnfNodePtr
>
eqv
;
auto
fg_outputs
=
fg
->
output
();
if
(
IsPrimitiveCNode
(
fg_outputs
,
prim
::
kPrimMakeTuple
))
{
auto
cnode
=
fg_outputs
->
cast
<
CNodePtr
>
();
for
(
size_t
i
=
1
;
i
<
cnode
->
size
();
++
i
)
{
vir_outputs
.
push_back
(
cnode
->
input
(
i
));
void
SearchForDependNode
(
const
AnfNodeSet
&
outputs_set
,
const
AnfNodeIndexSet
&
users
,
std
::
vector
<
CNodePtr
>
*
control_depend_nodes
,
std
::
vector
<
size_t
>
*
control_depend_use_index
,
bool
*
is_only_control_depend_use
,
AnfNodePtr
*
use_out
)
{
for
(
auto
&
user
:
users
)
{
auto
use_node
=
user
.
first
;
if
(
outputs_set
.
count
(
use_node
)
==
0
&&
!
(
IsPrimitiveCNode
(
use_node
,
prim
::
kPrimControlDepend
)))
{
*
is_only_control_depend_use
=
false
;
continue
;
}
if
(
outputs_set
.
count
(
use_node
)
!=
0
)
{
*
use_out
=
use_node
;
}
if
(
IsPrimitiveCNode
(
use_node
,
prim
::
kPrimControlDepend
))
{
control_depend_nodes
->
push_back
(
use_node
->
cast
<
CNodePtr
>
());
control_depend_use_index
->
push_back
(
user
.
second
);
}
}
else
{
vir_outputs
.
push_back
(
fg_outputs
);
}
}
if
(
vir_outputs
.
size
()
!=
outputs
->
size
())
{
MS_LOG
(
EXCEPTION
)
<<
"The size of virtual output of the fg is not the same with the real output"
;
bool
FindControlDependOut
(
AnfNodePtrList
*
outputs
,
const
AnfNodePtrList
&
vir_outputs
,
const
FuncGraphManagerPtr
&
mng
,
std
::
unordered_map
<
AnfNodePtr
,
AnfNodePtr
>
*
eqv
)
{
AnfNodeSet
outputs_set
;
for
(
auto
out
:
*
outputs
)
{
outputs_set
.
insert
(
out
);
}
bool
has_erase_outs
=
false
;
size_t
index
=
-
1
;
for
(
auto
it
=
outputs
->
begin
();
it
!=
outputs
->
end
();)
{
index
++
;
auto
out
=
*
it
;
eqv
[
out
]
=
vir_outputs
[
index
];
(
*
eqv
)
[
out
]
=
vir_outputs
[
index
];
auto
users
=
mng
->
node_users
()[
out
];
bool
is_only_control_depend_use
=
true
;
std
::
vector
<
size_t
>
control_depend_use_index
;
std
::
vector
<
CNodePtr
>
control_depend_nodes
;
AnfNodePtr
use_out
=
nullptr
;
for
(
auto
&
user
:
users
)
{
auto
use_node
=
user
.
first
;
if
(
outputs_set
.
count
(
use_node
)
==
0
&&
!
(
IsPrimitiveCNode
(
use_node
,
prim
::
kPrimControlDepend
)))
{
is_only_control_depend_use
=
false
;
continue
;
}
if
(
outputs_set
.
count
(
use_node
)
!=
0
)
{
use_out
=
use_node
;
}
if
(
IsPrimitiveCNode
(
use_node
,
prim
::
kPrimControlDepend
))
{
control_depend_nodes
.
push_back
(
use_node
->
cast
<
CNodePtr
>
());
control_depend_use_index
.
push_back
(
user
.
second
);
}
}
SearchForDependNode
(
outputs_set
,
users
,
&
control_depend_nodes
,
&
control_depend_use_index
,
&
is_only_control_depend_use
,
&
use_out
);
if
(
is_only_control_depend_use
&&
!
control_depend_nodes
.
empty
())
{
MS_EXCEPTION_IF_NULL
(
use_out
);
it
=
outputs
->
erase
(
it
);
...
...
@@ -142,8 +132,27 @@ void RemoveControlDependOut(const FuncGraphPtr &fg, AnfNodePtrList *outputs, con
it
++
;
}
}
return
has_erase_outs
;
}
void
RemoveControlDependOut
(
const
FuncGraphPtr
&
fg
,
AnfNodePtrList
*
outputs
,
const
FuncGraphManagerPtr
&
mng
)
{
AnfNodePtrList
vir_outputs
;
std
::
unordered_map
<
AnfNodePtr
,
AnfNodePtr
>
eqv
;
auto
fg_outputs
=
fg
->
output
();
if
(
IsPrimitiveCNode
(
fg_outputs
,
prim
::
kPrimMakeTuple
))
{
auto
cnode
=
fg_outputs
->
cast
<
CNodePtr
>
();
for
(
size_t
i
=
1
;
i
<
cnode
->
size
();
++
i
)
{
vir_outputs
.
push_back
(
cnode
->
input
(
i
));
}
}
else
{
vir_outputs
.
push_back
(
fg_outputs
);
}
if
(
vir_outputs
.
size
()
!=
outputs
->
size
())
{
MS_LOG
(
EXCEPTION
)
<<
"The size of virtual output of the fg is not the same with the real output"
;
}
if
(
!
has_erase_outs
)
{
if
(
!
FindControlDependOut
(
outputs
,
vir_outputs
,
mng
,
&
eqv
)
)
{
return
;
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录