Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
4edd0f15
提交
4edd0f15
authored
8月 24, 2016
作者:
Frederic Bastien
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix EQ final opt as clean up sub prof merge
上级
c4e0ce98
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
37 行增加
和
15 行删除
+37
-15
opt.py
theano/gof/opt.py
+37
-15
没有找到文件。
theano/gof/opt.py
浏览文件 @
4edd0f15
...
@@ -1941,10 +1941,15 @@ class TopoOptimizer(NavigatorOptimizer):
...
@@ -1941,10 +1941,15 @@ class TopoOptimizer(NavigatorOptimizer):
@staticmethod
@staticmethod
def
print_profile
(
stream
,
prof
,
level
=
0
):
def
print_profile
(
stream
,
prof
,
level
=
0
):
blanc
=
(
' '
*
level
)
if
prof
is
None
:
# Happen as merge_profile() isn't implemented
print
(
blanc
,
"TopoOptimizer merge_profile not implemented"
,
file
=
stream
)
return
(
opt
,
nb
,
nb_nodes_start
,
nb_nodes_end
,
(
opt
,
nb
,
nb_nodes_start
,
nb_nodes_end
,
io_t
,
loop_t
,
callback_time
)
=
prof
io_t
,
loop_t
,
callback_time
)
=
prof
blanc
=
(
' '
*
level
)
print
(
blanc
,
"TopoOptimizer "
,
print
(
blanc
,
"TopoOptimizer "
,
getattr
(
opt
,
"name"
,
getattr
(
opt
,
"__name__"
,
""
)),
file
=
stream
)
getattr
(
opt
,
"name"
,
getattr
(
opt
,
"__name__"
,
""
)),
file
=
stream
)
...
@@ -2455,11 +2460,8 @@ class EquilibriumOptimizer(NavigatorOptimizer):
...
@@ -2455,11 +2460,8 @@ class EquilibriumOptimizer(NavigatorOptimizer):
prof2
[
0
]
.
get_local_optimizers
())
prof2
[
0
]
.
get_local_optimizers
())
global_optimizers
=
OrderedSet
(
prof1
[
0
]
.
global_optimizers
)
.
union
(
global_optimizers
=
OrderedSet
(
prof1
[
0
]
.
global_optimizers
)
.
union
(
prof2
[
0
]
.
global_optimizers
)
prof2
[
0
]
.
global_optimizers
)
if
len
(
prof1
[
0
]
.
final_optimizers
)
>
0
or
len
(
prof2
[
0
]
.
final_optimizers
)
>
0
:
final_optimizers
=
list
(
OrderedSet
(
prof1
[
0
]
.
final_optimizers
)
.
union
(
final_optimizers
=
OrderedSet
(
prof1
[
0
]
.
final_optimizers
)
.
union
(
prof2
[
0
]
.
final_optimizers
))
prof2
[
0
]
.
final_optimizers
)
else
:
final_optimizers
=
None
cleanup_optimizers
=
list
(
OrderedSet
(
prof1
[
0
]
.
cleanup_optimizers
)
.
union
(
cleanup_optimizers
=
list
(
OrderedSet
(
prof1
[
0
]
.
cleanup_optimizers
)
.
union
(
prof2
[
0
]
.
cleanup_optimizers
))
prof2
[
0
]
.
cleanup_optimizers
))
new_opt
=
EquilibriumOptimizer
(
new_opt
=
EquilibriumOptimizer
(
...
@@ -2480,6 +2482,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
...
@@ -2480,6 +2482,7 @@ class EquilibriumOptimizer(NavigatorOptimizer):
loop_timing
=
merge_list
(
prof1
[
1
],
prof2
[
1
])
loop_timing
=
merge_list
(
prof1
[
1
],
prof2
[
1
])
loop_process_count
=
list
(
prof1
[
2
])
loop_process_count
=
list
(
prof1
[
2
])
final_sub_profs
=
[]
cleanup_sub_profs
=
[]
cleanup_sub_profs
=
[]
for
i
in
range
(
min
(
len
(
loop_process_count
),
len
(
prof2
[
2
]))):
for
i
in
range
(
min
(
len
(
loop_process_count
),
len
(
prof2
[
2
]))):
process_count
=
loop_process_count
[
i
]
process_count
=
loop_process_count
[
i
]
...
@@ -2488,21 +2491,41 @@ class EquilibriumOptimizer(NavigatorOptimizer):
...
@@ -2488,21 +2491,41 @@ class EquilibriumOptimizer(NavigatorOptimizer):
process_count
[
process
]
+=
count
process_count
[
process
]
+=
count
else
:
else
:
process_count
[
process
]
=
count
process_count
[
process
]
=
count
iter_final_sub_profs
=
[]
iter_cleanup_sub_profs
=
[]
iter_cleanup_sub_profs
=
[]
for
cleanup_opt
in
cleanup_optimizers
:
for
opt
in
final_optimizers
:
o1
=
prof1
[
0
]
.
final_optimizers
o2
=
prof2
[
0
]
.
final_optimizers
if
opt
in
o1
and
opt
in
o2
:
p1
=
prof1
[
10
][
i
][
o1
.
index
(
opt
)]
p2
=
prof2
[
10
][
i
][
o2
.
index
(
opt
)]
if
hasattr
(
opt
,
'merge_profile'
):
m
=
opt
.
merge_profile
(
p1
,
p2
)
else
:
m
=
None
iter_final_sub_profs
.
append
(
m
)
elif
opt
in
o1
:
p1
=
prof1
[
10
][
o1
.
index
(
opt
)]
iter_final_sub_profs
.
append
(
p1
)
else
:
p2
=
prof2
[
10
][
o2
.
index
(
opt
)]
iter_final_sub_profs
.
append
(
p2
)
for
opt
in
cleanup_optimizers
:
o1
=
prof1
[
0
]
.
cleanup_optimizers
o1
=
prof1
[
0
]
.
cleanup_optimizers
o2
=
prof2
[
0
]
.
cleanup_optimizers
o2
=
prof2
[
0
]
.
cleanup_optimizers
if
cleanup_opt
in
o1
and
cleanup_
opt
in
o2
:
if
opt
in
o1
and
opt
in
o2
:
p1
=
prof1
[
11
][
i
][
o1
.
index
(
cleanup_
opt
)]
p1
=
prof1
[
11
][
i
][
o1
.
index
(
opt
)]
p2
=
prof2
[
11
][
i
][
o2
.
index
(
cleanup_
opt
)]
p2
=
prof2
[
11
][
i
][
o2
.
index
(
opt
)]
iter_cleanup_sub_profs
.
append
(
iter_cleanup_sub_profs
.
append
(
cleanup_
opt
.
merge_profile
(
p1
,
p2
))
opt
.
merge_profile
(
p1
,
p2
))
elif
cleanup_
opt
in
o1
:
elif
opt
in
o1
:
p1
=
prof1
[
11
][
o1
.
index
(
cleanup_
opt
)]
p1
=
prof1
[
11
][
o1
.
index
(
opt
)]
iter_cleanup_sub_profs
.
append
(
p1
)
iter_cleanup_sub_profs
.
append
(
p1
)
else
:
else
:
p2
=
prof2
[
11
][
o2
.
index
(
cleanup_
opt
)]
p2
=
prof2
[
11
][
o2
.
index
(
opt
)]
iter_cleanup_sub_profs
.
append
(
p2
)
iter_cleanup_sub_profs
.
append
(
p2
)
final_sub_profs
.
append
(
iter_final_sub_profs
)
cleanup_sub_profs
.
append
(
iter_cleanup_sub_profs
)
cleanup_sub_profs
.
append
(
iter_cleanup_sub_profs
)
loop_process_count
.
extend
(
prof2
[
2
][
len
(
loop_process_count
):])
loop_process_count
.
extend
(
prof2
[
2
][
len
(
loop_process_count
):])
...
@@ -2522,7 +2545,6 @@ class EquilibriumOptimizer(NavigatorOptimizer):
...
@@ -2522,7 +2545,6 @@ class EquilibriumOptimizer(NavigatorOptimizer):
node_created
=
merge_dict
(
prof1
[
8
],
prof2
[
8
])
node_created
=
merge_dict
(
prof1
[
8
],
prof2
[
8
])
global_sub_profs
=
merge_list
(
prof1
[
9
],
prof2
[
9
])
global_sub_profs
=
merge_list
(
prof1
[
9
],
prof2
[
9
])
final_sub_profs
=
merge_list
(
prof1
[
10
],
prof2
[
10
])
return
(
new_opt
,
return
(
new_opt
,
loop_timing
,
loop_timing
,
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论