Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
bae54705
提交
bae54705
authored
9月 15, 2015
作者:
abergeron
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #3382 from carriepl/scan_inplace_opt
Scan inplace opt
上级
9bdef90d
151eb6b3
显示空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
50 行增加
和
19 行删除
+50
-19
scan_opt.py
theano/scan_module/scan_opt.py
+50
-19
没有找到文件。
theano/scan_module/scan_opt.py
浏览文件 @
bae54705
...
@@ -1010,25 +1010,29 @@ class ScanInplaceOptimizer(Optimizer):
...
@@ -1010,25 +1010,29 @@ class ScanInplaceOptimizer(Optimizer):
fgraph
.
attach_feature
(
toolbox
.
ReplaceValidate
())
fgraph
.
attach_feature
(
toolbox
.
ReplaceValidate
())
fgraph
.
attach_feature
(
DestroyHandler
())
fgraph
.
attach_feature
(
DestroyHandler
())
def
apply
(
self
,
fgraph
):
def
attempt_scan_inplace
(
self
,
fgraph
,
node
,
output_indices
):
"""Attempts to replace a Scan node by one which computes the specified
outputs inplace.
Parameters
----------
fgraph : FunctionGraph
Function graph in which to attempt the replacement
node : Apply node
Scan node to replace by an inplace version
output_indices : list of integers
Indices of the outputs to attempt to compute inplace
"""
nodes
=
fgraph
.
toposort
()
scan_nodes
=
[
x
for
x
in
nodes
if
(
isinstance
(
x
.
op
,
scan_op
.
Scan
)
and
x
.
op
.
info
[
'gpu'
]
==
self
.
gpu_flag
and
x
.
op
.
info
[
'gpua'
]
==
self
.
gpua_flag
)]
for
scan_idx
in
xrange
(
len
(
scan_nodes
)):
node
=
scan_nodes
[
scan_idx
]
op
=
node
.
op
op
=
node
.
op
n_outs
=
(
op
.
info
[
'n_mit_mot'
]
+
op
.
info
[
'n_mit_sot'
]
+
op
.
info
[
'n_sit_sot'
])
for
pos
in
xrange
(
n_outs
):
info
=
copy
.
deepcopy
(
op
.
info
)
info
=
copy
.
deepcopy
(
op
.
info
)
if
not
'destroy_map'
in
info
:
if
'destroy_map'
not
in
info
:
info
[
'destroy_map'
]
=
OrderedDict
()
info
[
'destroy_map'
]
=
OrderedDict
()
info
[
'destroy_map'
][
pos
]
=
[
pos
+
1
+
op
.
info
[
'n_seqs'
]]
for
out_idx
in
output_indices
:
info
[
'destroy_map'
][
out_idx
]
=
[
out_idx
+
1
+
op
.
info
[
'n_seqs'
]]
# inputs corresponding to sequences and n_steps
# inputs corresponding to sequences and n_steps
ls_begin
=
node
.
inputs
[:
1
+
op
.
n_seqs
]
ls_begin
=
node
.
inputs
[:
1
+
op
.
n_seqs
]
ls
=
op
.
outer_mitmot
(
node
.
inputs
)
ls
=
op
.
outer_mitmot
(
node
.
inputs
)
...
@@ -1037,6 +1041,7 @@ class ScanInplaceOptimizer(Optimizer):
...
@@ -1037,6 +1041,7 @@ class ScanInplaceOptimizer(Optimizer):
ls_end
=
op
.
outer_shared
(
node
.
inputs
)
ls_end
=
op
.
outer_shared
(
node
.
inputs
)
ls_end
+=
op
.
outer_nitsot
(
node
.
inputs
)
ls_end
+=
op
.
outer_nitsot
(
node
.
inputs
)
ls_end
+=
op
.
outer_non_seqs
(
node
.
inputs
)
ls_end
+=
op
.
outer_non_seqs
(
node
.
inputs
)
n_outs
=
len
(
ls
)
n_outs
=
len
(
ls
)
for
idx
in
xrange
(
n_outs
):
for
idx
in
xrange
(
n_outs
):
if
ls
[
idx
]
in
ls
[:
idx
]:
if
ls
[
idx
]
in
ls
[:
idx
]:
...
@@ -1055,11 +1060,37 @@ class ScanInplaceOptimizer(Optimizer):
...
@@ -1055,11 +1060,37 @@ class ScanInplaceOptimizer(Optimizer):
list
(
zip
(
node
.
outputs
,
new_outs
)),
list
(
zip
(
node
.
outputs
,
new_outs
)),
remove
=
[
node
],
remove
=
[
node
],
reason
=
'scanOp_make_inplace'
)
reason
=
'scanOp_make_inplace'
)
op
=
new_op
return
new_outs
[
0
]
.
owner
node
=
new_outs
[
0
]
.
owner
except
InconsistencyError
:
except
InconsistencyError
as
e
:
# Failed moving output to be computed inplace
# Failed moving output to be comptued inplace
return
node
pass
def
apply
(
self
,
fgraph
):
nodes
=
fgraph
.
toposort
()
scan_nodes
=
[
x
for
x
in
nodes
if
(
isinstance
(
x
.
op
,
scan_op
.
Scan
)
and
x
.
op
.
info
[
'gpu'
]
==
self
.
gpu_flag
and
x
.
op
.
info
[
'gpua'
]
==
self
.
gpua_flag
)]
for
scan_idx
in
xrange
(
len
(
scan_nodes
)):
# First attempt to make the Scan compute every recurrent output
# inplace. If that fails, go through these outputs individually,
# trying each of them
original_node
=
scan_nodes
[
scan_idx
]
op
=
original_node
.
op
n_outs
=
(
op
.
info
[
'n_mit_mot'
]
+
op
.
info
[
'n_mit_sot'
]
+
op
.
info
[
'n_sit_sot'
])
node
=
self
.
attempt_scan_inplace
(
fgraph
,
scan_nodes
[
scan_idx
],
range
(
n_outs
))
if
node
is
original_node
:
# Making the scan compute all recurrent outputs inplace has
# failed. Attempt all recurrent outputs individually.
for
pos
in
xrange
(
n_outs
):
node
=
self
.
attempt_scan_inplace
(
fgraph
,
node
,
[
pos
])
class
ScanSaveMem
(
gof
.
Optimizer
):
class
ScanSaveMem
(
gof
.
Optimizer
):
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论