Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
9d9d9020
提交
9d9d9020
authored
12月 14, 2011
作者:
nouiz
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #298 from pascanur/scan_check
Scan check
上级
5c0887dd
da5ea343
全部展开
隐藏空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
35 行增加
和
33 行删除
+35
-33
basic.py
theano/scalar/basic.py
+4
-0
scan_op.py
theano/scan_module/scan_op.py
+0
-0
scan_opt.py
theano/scan_module/scan_opt.py
+31
-33
没有找到文件。
theano/scalar/basic.py
浏览文件 @
9d9d9020
...
@@ -119,6 +119,7 @@ class Scalar(Type):
...
@@ -119,6 +119,7 @@ class Scalar(Type):
TODO: refactor to be named ScalarType for consistency with TensorType
TODO: refactor to be named ScalarType for consistency with TensorType
"""
"""
ndim
=
0
def
__init__
(
self
,
dtype
):
def
__init__
(
self
,
dtype
):
if
dtype
==
'floatX'
:
if
dtype
==
'floatX'
:
...
@@ -441,6 +442,9 @@ all_types = discrete_types + continuous_types
...
@@ -441,6 +442,9 @@ all_types = discrete_types + continuous_types
class
_scalar_py_operators
:
class
_scalar_py_operators
:
# So that we can simplify checking code when we have a mixture of Scalar
# variables and Tensor variables
ndim
=
0
#UNARY
#UNARY
def
__abs__
(
self
):
return
abs_
(
self
)
def
__abs__
(
self
):
return
abs_
(
self
)
...
...
theano/scan_module/scan_op.py
浏览文件 @
9d9d9020
差异被折叠。
点击展开。
theano/scan_module/scan_opt.py
浏览文件 @
9d9d9020
...
@@ -200,8 +200,7 @@ class PushOutNonSeqScan(gof.Optimizer):
...
@@ -200,8 +200,7 @@ class PushOutNonSeqScan(gof.Optimizer):
not
isinstance
(
nd
.
op
,
theano
.
compile
.
ViewOp
)
and
not
isinstance
(
nd
.
op
,
theano
.
compile
.
ViewOp
)
and
not
isinstance
(
nd
.
op
,
theano
.
compile
.
DeepCopyOp
)
and
not
isinstance
(
nd
.
op
,
theano
.
compile
.
DeepCopyOp
)
and
# and we didn't already looked at this node
# and we didn't already looked at this node
not
nd
in
to_remove
not
nd
in
to_remove
):
):
# We have a candidate node to removable
# We have a candidate node to removable
# Step 1. Reconstruct it on outside
# Step 1. Reconstruct it on outside
...
@@ -317,12 +316,12 @@ def scan_make_inplace(node):
...
@@ -317,12 +316,12 @@ def scan_make_inplace(node):
info
[
'inplace'
]
=
True
info
[
'inplace'
]
=
True
# 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
)
ls
=
op
.
outer_mitmot
(
node
.
inputs
)
ls
+=
op
.
outer_mitsot
(
node
)
ls
+=
op
.
outer_mitsot
(
node
.
inputs
)
ls
+=
op
.
outer_sitsot
(
node
)
ls
+=
op
.
outer_sitsot
(
node
.
inputs
)
ls_end
=
op
.
outer_shared
(
node
)
ls_end
=
op
.
outer_shared
(
node
.
inputs
)
ls_end
+=
op
.
outer_nitsot
(
node
)
ls_end
+=
op
.
outer_nitsot
(
node
.
inputs
)
ls_end
+=
op
.
outer_non_seqs
(
node
)
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
]:
...
@@ -717,8 +716,7 @@ class ScanSaveMem(gof.Optimizer):
...
@@ -717,8 +716,7 @@ class ScanSaveMem(gof.Optimizer):
fslice
=
slice
(
fslice
=
slice
(
sanitize
(
cnf_slice
[
0
]
.
start
),
sanitize
(
cnf_slice
[
0
]
.
start
),
sanitize
(
cnf_slice
[
0
]
.
stop
),
sanitize
(
cnf_slice
[
0
]
.
stop
),
sanitize
(
cnf_slice
[
0
]
.
step
)
sanitize
(
cnf_slice
[
0
]
.
step
))
)
else
:
else
:
fslice
=
sanitize
(
cnf_slice
[
0
])
fslice
=
sanitize
(
cnf_slice
[
0
])
...
@@ -850,54 +848,54 @@ class ScanMerge(gof.Optimizer):
...
@@ -850,54 +848,54 @@ class ScanMerge(gof.Optimizer):
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# Seq
# Seq
inner_ins
+=
rename
(
nd
.
op
.
inner_seqs
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_seqs
(
nd
.
op
.
inputs
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_seqs
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_seqs
(
nd
.
inputs
),
idx
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# MitMot
# MitMot
inner_ins
+=
rename
(
nd
.
op
.
inner_mitmot
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_mitmot
(
nd
.
op
.
inputs
),
idx
)
inner_outs
+=
nd
.
op
.
inner_mitmot_outs
()
inner_outs
+=
nd
.
op
.
inner_mitmot_outs
(
nd
.
op
.
outputs
)
info
[
'tap_array'
]
+=
nd
.
op
.
mitmot_taps
()
info
[
'tap_array'
]
+=
nd
.
op
.
mitmot_taps
()
info
[
'mit_mot_out_slices'
]
+=
nd
.
op
.
mitmot_out_taps
()
info
[
'mit_mot_out_slices'
]
+=
nd
.
op
.
mitmot_out_taps
()
outer_ins
+=
rename
(
nd
.
op
.
outer_mitmot
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_mitmot
(
nd
.
inputs
),
idx
)
outer_outs
+=
nd
.
op
.
outer_mitmot_outs
(
nd
)
outer_outs
+=
nd
.
op
.
outer_mitmot_outs
(
nd
.
outputs
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# MitSot
# MitSot
inner_ins
+=
rename
(
nd
.
op
.
inner_mitsot
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_mitsot
(
nd
.
op
.
inputs
),
idx
)
inner_outs
+=
nd
.
op
.
inner_mitsot_outs
()
inner_outs
+=
nd
.
op
.
inner_mitsot_outs
(
nd
.
op
.
outputs
)
info
[
'tap_array'
]
+=
nd
.
op
.
mitsot_taps
()
info
[
'tap_array'
]
+=
nd
.
op
.
mitsot_taps
()
outer_ins
+=
rename
(
nd
.
op
.
outer_mitsot
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_mitsot
(
nd
.
inputs
),
idx
)
outer_outs
+=
nd
.
op
.
outer_mitsot_outs
(
nd
)
outer_outs
+=
nd
.
op
.
outer_mitsot_outs
(
nd
.
outputs
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# SitSot
# SitSot
inner_ins
+=
rename
(
nd
.
op
.
inner_sitsot
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_sitsot
(
nd
.
op
.
inputs
),
idx
)
info
[
'tap_array'
]
+=
[[
-
1
]
for
x
in
xrange
(
nd
.
op
.
n_sit_sot
)]
info
[
'tap_array'
]
+=
[[
-
1
]
for
x
in
xrange
(
nd
.
op
.
n_sit_sot
)]
inner_outs
+=
nd
.
op
.
inner_sitsot_outs
()
inner_outs
+=
nd
.
op
.
inner_sitsot_outs
(
nd
.
op
.
outputs
)
outer_ins
+=
rename
(
nd
.
op
.
outer_sitsot
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_sitsot
(
nd
.
inputs
),
idx
)
outer_outs
+=
nd
.
op
.
outer_sitsot_outs
(
nd
)
outer_outs
+=
nd
.
op
.
outer_sitsot_outs
(
nd
.
outputs
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# Shared
# Shared
inner_ins
+=
rename
(
nd
.
op
.
inner_shared
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_shared
(
nd
.
op
.
inputs
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_shared
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_shared
(
nd
.
inputs
),
idx
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# NitSot
# NitSot
inner_outs
+=
nd
.
op
.
inner_nitsot_outs
()
inner_outs
+=
nd
.
op
.
inner_nitsot_outs
(
nd
.
op
.
outputs
)
outer_ins
+=
rename
(
nd
.
op
.
outer_nitsot
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_nitsot
(
nd
.
inputs
),
idx
)
outer_outs
+=
nd
.
op
.
outer_nitsot_outs
(
nd
)
outer_outs
+=
nd
.
op
.
outer_nitsot_outs
(
nd
.
outputs
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# Shared
# Shared
outer_outs
+=
nd
.
op
.
outer_shared_outs
(
nd
)
outer_outs
+=
nd
.
op
.
outer_shared_outs
(
nd
.
outputs
)
inner_outs
+=
nd
.
op
.
inner_shared_outs
()
inner_outs
+=
nd
.
op
.
inner_shared_outs
(
nd
.
op
.
outputs
)
for
idx
,
nd
in
enumerate
(
nodes
):
for
idx
,
nd
in
enumerate
(
nodes
):
# Non Seqs
# Non Seqs
inner_ins
+=
rename
(
nd
.
op
.
inner_non_seqs
(),
idx
)
inner_ins
+=
rename
(
nd
.
op
.
inner_non_seqs
(
nd
.
op
.
inputs
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_non_seqs
(
nd
),
idx
)
outer_ins
+=
rename
(
nd
.
op
.
outer_non_seqs
(
nd
.
inputs
),
idx
)
# Add back the number of steps
# Add back the number of steps
outer_ins
=
[
nodes
[
0
]
.
inputs
[
0
]]
+
outer_ins
outer_ins
=
[
nodes
[
0
]
.
inputs
[
0
]]
+
outer_ins
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论