Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
magicwindyyd
mindspore
提交
a22a4a57
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看板
提交
a22a4a57
编写于
4月 29, 2020
作者:
Z
Zhang Qinghua
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Modify UT case after adjust the collectors of manager.
上级
d43ad79b
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
38 addition
and
11 deletion
+38
-11
tests/ut/cpp/ir/manager_test.cc
tests/ut/cpp/ir/manager_test.cc
+38
-11
未找到文件。
tests/ut/cpp/ir/manager_test.cc
浏览文件 @
a22a4a57
...
...
@@ -127,12 +127,18 @@ class NestingSpecs {
return
;
}
auto
counter_p
=
dynamic_pointer_cast
<
CounterAnfNodeCollector
>
(
results
);
auto
counter_p
=
dynamic_pointer_cast
<
CounterAnfNodeCollector
<
AnfNodePtr
>
>
(
results
);
if
(
counter_p
!=
nullptr
)
{
CheckAnfNodeCounter
(
counter_p
);
return
;
}
auto
counter_pair
=
dynamic_pointer_cast
<
CounterAnfNodeCollector
<
CNodeIndexPairPtr
>>
(
results
);
if
(
counter_pair
!=
nullptr
)
{
CheckCNodeIndexPairCounter
(
counter_pair
);
return
;
}
auto
nodes
=
dynamic_pointer_cast
<
NodesCollector
>
(
results
);
if
(
nodes
!=
nullptr
)
{
CheckNodes
(
nodes
);
...
...
@@ -226,7 +232,7 @@ class NestingSpecs {
// Add CheckNesting function
void
CheckAnfNodeCounter
(
std
::
shared_ptr
<
CounterAnfNodeCollector
>
results
)
{
void
CheckAnfNodeCounter
(
std
::
shared_ptr
<
CounterAnfNodeCollector
<
AnfNodePtr
>
>
results
)
{
std
::
map
<
std
::
string
,
std
::
set
<
std
::
string
>>
clean_results
;
for
(
auto
&
iter
:
results
->
count_nodes_map
())
{
auto
key
=
iter
.
first
;
...
...
@@ -252,6 +258,32 @@ class NestingSpecs {
ASSERT_EQ
(
clean_results
,
expected_
);
}
void
CheckCNodeIndexPairCounter
(
std
::
shared_ptr
<
CounterAnfNodeCollector
<
CNodeIndexPairPtr
>>
results
)
{
std
::
map
<
std
::
string
,
std
::
set
<
std
::
string
>>
clean_results
;
for
(
auto
&
iter
:
results
->
count_nodes_map
())
{
auto
key
=
iter
.
first
;
auto
value
=
iter
.
second
;
if
(
key
==
nullptr
)
{
continue
;
}
std
::
string
k
=
Name
(
key
);
std
::
set
<
std
::
string
>
v
;
for
(
auto
&
node
:
value
)
{
auto
fg
=
node
.
first
->
first
;
if
(
!
Name
(
fg
).
empty
())
{
v
.
insert
(
Name
(
fg
));
}
}
if
(
!
v
.
empty
())
{
clean_results
[
k
]
=
v
;
}
}
ASSERT_EQ
(
clean_results
,
expected_
);
}
void
CheckGraphCounter
(
std
::
shared_ptr
<
CounterFuncGraphCollector
>
results
)
{
std
::
map
<
std
::
string
,
std
::
set
<
std
::
string
>>
clean_results
;
for
(
auto
&
iter
:
results
->
count_func_graphs_map
())
{
...
...
@@ -447,9 +479,8 @@ void TestManager::CheckAnalysisSize(std::shared_ptr<FuncGraphManager> mng) {
ASSERT_EQ
(
size
,
mng
->
free_variables_total
().
size
());
ASSERT_EQ
(
size
,
mng
->
valuenodes
().
size
());
ASSERT_EQ
(
size
,
mng
->
free_variables_direct
().
size
());
ASSERT_EQ
(
size
,
mng
->
func_graph_
valuenodes
().
size
());
ASSERT_EQ
(
size
,
mng
->
func_graph_
cnodes_index
().
size
());
ASSERT_EQ
(
size
,
mng
->
func_graph_parents_direct
().
size
());
ASSERT_EQ
(
size
,
mng
->
func_graph_users
().
size
());
ASSERT_EQ
(
size
,
mng
->
func_graphs_used
().
size
());
}
...
...
@@ -508,10 +539,6 @@ TEST_F(TestManager, test_nested_manual) {
ASSERT_EQ
(
1
,
graphs_used
[
f
].
size
());
ASSERT_EQ
(
0
,
graphs_used
[
g
].
size
());
auto
graph_users
=
mng
->
func_graph_users
();
ASSERT_EQ
(
0
,
graph_users
[
f
].
size
());
ASSERT_EQ
(
1
,
graph_users
[
g
].
size
());
auto
fv_direct
=
mng
->
free_variables_direct
();
ASSERT_EQ
(
0
,
fv_direct
[
f
].
size
());
ASSERT_EQ
(
1
,
fv_direct
[
g
].
size
());
...
...
@@ -520,9 +547,9 @@ TEST_F(TestManager, test_nested_manual) {
ASSERT_EQ
(
0
,
fv_total
[
f
].
size
());
ASSERT_EQ
(
1
,
fv_total
[
g
].
size
());
auto
graph_valuenodes
=
mng
->
func_graph_valuenodes
();
ASSERT_EQ
(
0
,
graph_value
nodes
[
f
].
size
());
ASSERT_EQ
(
1
,
graph_value
nodes
[
g
].
size
());
auto
cnodes
=
mng
->
func_graph_cnodes_index
();
ASSERT_EQ
(
0
,
c
nodes
[
f
].
size
());
ASSERT_EQ
(
1
,
c
nodes
[
g
].
size
());
}
TEST_F
(
TestManager
,
test_deep_nested2_manual
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录