Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
3f2c9223
提交
3f2c9223
authored
12月 20, 2014
作者:
Roy Xue
提交者:
Lijun Xue
3月 30, 2015
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
add basic logic.
上级
ae450fb0
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
51 行增加
和
9 行删除
+51
-9
vm.py
theano/gof/vm.py
+51
-9
没有找到文件。
theano/gof/vm.py
浏览文件 @
3f2c9223
...
@@ -892,18 +892,60 @@ class VM_Linker(link.LocalLinker):
...
@@ -892,18 +892,60 @@ class VM_Linker(link.LocalLinker):
thunks
=
[]
thunks
=
[]
if
self
.
allow_gc
:
if
self
.
allow_gc
:
viewed_by
=
{}
for
var
in
fgraph
.
variables
:
viewed_by
[
var
]
=
[]
view_of
=
{}
dependencies
=
fgraph
.
profile
.
dependencies
for
idx
in
range
(
len
(
order
)):
for
idx
in
range
(
len
(
order
)):
node
=
order
[
idx
]
node
=
order
[
idx
]
dmap
=
getattr
(
node
.
op
,
'destroy_map'
,
None
)
vmap
=
getattr
(
node
.
op
,
'view_map'
,
None
)
reallocated_ins
=
set
([])
idx_o
=
0
for
out
in
node
.
output
:
if
dmap
and
idx_o
in
dmap
:
idx_v
=
dmap
[
idx_o
]
assert
len
(
idx_v
)
==
1
,
"Here we only support the possibility to destroy one input"
ins
=
node
.
inputs
[
idx_v
[
0
]]
if
vmap
and
idx_o
in
vmap
:
assert
ins
is
None
idx_v
=
vmap
[
idx_o
]
assert
len
(
idx_v
)
==
1
,
"Here we only support the possibility to view one input"
ins
=
node
.
inputs
[
idx_v
[
0
]]
if
ins
:
assert
isinstance
(
ins
,
theano
.
Variable
)
origin
=
view_of
.
get
(
ins
,
ins
)
view_of
[
out
]
=
origin
viewed_by
[
origin
]
.
append
(
out
)
idx_o
+=
1
for
ins
in
node
.
inputs
:
for
ins
in
node
.
inputs
:
if
ins
.
ndim
==
0
and
storage_map
[
ins
][
0
]:
assert
not
(
ins
in
view_of
and
viewed_by
[
ins
])
# check if input variable ndim = 0
if
(
ins
.
ndim
==
0
and
storage_map
[
ins
][
0
]
and
ins
not
in
fgraph
.
outputs
and
ins
.
owner
and
dependencies
[
ins
]):
for
i
in
range
(
idx
+
1
,
len
(
order
)):
reuse_outs
=
[]
for
outs
in
order
[
i
]
.
outputs
:
if
ins
not
in
view_of
and
not
viewed_by
.
get
(
ins
,
[]):
if
outs
.
ndim
==
0
:
# where gc
storage_map
[
outs
]
=
storage_map
[
ins
]
for
i
in
range
(
idx
+
1
,
len
(
order
)):
break
for
outs
in
order
[
i
]
.
outputs
:
else
:
continue
if
outs
.
ndim
==
0
:
break
reuse_list
.
append
(
outs
)
reallocated_ins
.
add
(
ins
)
elif
ins
in
view_of
:
origin
=
view_of
[
ins
]
viewed_by
[
origin
]
.
remove
(
ins
)
if
(
not
viewed_by
[
origin
]
and
origin
not
in
fgraph
.
inputs
and
not
isinstance
(
origin
,
theano
.
Constant
)):
#where gc
for
i
in
range
(
idx
+
1
,
len
(
order
)):
for
outs
in
order
[
i
]
.
outputs
:
if
outs
.
ndim
==
0
:
reuse_list
.
append
(
outs
)
reallocated_ins
.
add
(
ins
)
for
node
in
order
:
for
node
in
order
:
try
:
try
:
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论