Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
8ae84a3c
提交
8ae84a3c
authored
10月 05, 2015
作者:
carriepl
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Speed up ScanInplaceOptimizer
上级
1548d7e0
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
42 行增加
和
8 行删除
+42
-8
scan_opt.py
theano/scan_module/scan_opt.py
+42
-8
没有找到文件。
theano/scan_module/scan_opt.py
浏览文件 @
8ae84a3c
...
...
@@ -1081,29 +1081,63 @@ class ScanInplaceOptimizer(Optimizer):
def
apply
(
self
,
fgraph
):
nodes
=
fgraph
.
toposort
()
nodes
=
fgraph
.
toposort
()
[::
-
1
]
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
# First attempt to make the Scan compute inplace every recurrent
# output that seems like it could be computed 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'
])
# Generate a list of outputs on which the node could potentially
# operate inplace.
out_indices
=
[]
for
out_idx
in
range
(
n_outs
):
inp_idx
=
1
+
op
.
n_seqs
+
out_idx
input_used_inplace
=
False
for
c
in
original_node
.
inputs
[
inp_idx
]
.
clients
:
client
=
c
[
0
]
# Get the indices of this client's inputs on which it
# operates inplace
inplace_inp_indices
=
[]
if
hasattr
(
client
.
op
,
'view_map'
):
inplace_inp_indices
=
sum
(
client
.
op
.
view_map
.
values
(),
inplace_inp_indices
)
if
hasattr
(
client
.
op
,
'destroy_map'
):
inplace_inp_indices
=
sum
(
client
.
op
.
destroy_map
.
values
(),
inplace_inp_indices
)
for
inplace_inp_idx
in
inplace_inp_indices
:
inplace_inp
=
client
.
inputs
[
inplace_inp_idx
]
if
inplace_inp
is
original_node
.
inputs
[
inp_idx
]:
input_used_inplace
=
True
break
if
input_used_inplace
:
break
if
not
input_used_inplace
:
out_indices
.
append
(
out_idx
)
node
=
self
.
attempt_scan_inplace
(
fgraph
,
scan_nodes
[
scan_idx
],
range
(
n_outs
)
)
out_indices
)
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
):
# Making the scan compute all plausible recurrent outputs
# inplace has failed. Attempt all plausible recurrent output
# individually.
for
pos
in
out_indices
:
node
=
self
.
attempt_scan_inplace
(
fgraph
,
node
,
[
pos
])
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论