Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
9d63ced8
提交
9d63ced8
authored
9月 14, 2014
作者:
Roy Xue
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Change the reset method of viewed_by
上级
dce5f32b
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
24 行增加
和
9 行删除
+24
-9
profiling.py
theano/compile/profiling.py
+24
-9
没有找到文件。
theano/compile/profiling.py
浏览文件 @
9d63ced8
...
...
@@ -819,9 +819,13 @@ class ProfileStats(object):
# We don't want a shallow copy, but we don't want
# a deep copy. So this do a "middle" copy, where
# we copy the dict and the list, but not the var
viewed_by_temp
=
{}
for
k
,
v
in
viewed_by
.
iteritems
():
viewed_by_temp
[
k
]
=
list
(
v
)
# viewed_by_temp = {}
# for k, v in viewed_by.iteritems():
# viewed_by_temp[k] = list(v)
change_track_add
=
defaultdict
(
lambda
:
[])
change_track_remove
=
defaultdict
(
lambda
:
[])
# use to track viewed_by changes
for
var
in
node
.
outputs
:
compute_map
[
var
][
0
]
=
1
...
...
@@ -856,7 +860,8 @@ class ProfileStats(object):
# We keep trac of view only again the original
origin
=
view_of_temp
.
get
(
ins
,
ins
)
view_of_temp
[
out
]
=
origin
viewed_by_temp
[
origin
]
.
append
(
out
)
viewed_by
[
origin
]
.
append
(
out
)
change_track_add
[
origin
]
.
append
(
out
)
else
:
mem_created
+=
var_mem
[
out
]
idx
+=
1
...
...
@@ -867,18 +872,19 @@ class ProfileStats(object):
# Mimic the combination of Theano and Python gc.
for
ins
in
node
.
inputs
:
assert
not
(
ins
in
view_of_temp
and
viewed_by
_temp
[
ins
])
viewed_by
[
ins
])
# We track of the original var, so this shouldn't happen
if
(
dependencies
[
ins
]
and
ins
not
in
fgraph
.
outputs
and
ins
.
owner
and
all
([
compute_map
[
v
][
0
]
for
v
in
dependencies
[
ins
]])):
if
ins
not
in
view_of_temp
and
not
viewed_by
_temp
.
get
(
ins
,
[]):
if
ins
not
in
view_of_temp
and
not
viewed_by
.
get
(
ins
,
[]):
mem_freed
+=
var_mem
[
ins
]
elif
ins
in
view_of_temp
:
origin
=
view_of_temp
[
ins
]
viewed_by_temp
[
origin
]
.
remove
(
ins
)
if
(
not
viewed_by_temp
[
origin
]
and
viewed_by
[
origin
]
.
remove
(
ins
)
change_track_remove
[
origin
]
.
append
(
ins
)
if
(
not
viewed_by
[
origin
]
and
origin
not
in
fgraph
.
inputs
and
not
isinstance
(
origin
,
theano
.
Constant
)):
mem_freed
+=
var_mem
[
origin
]
...
...
@@ -899,7 +905,7 @@ class ProfileStats(object):
if
max_mem_count
<
mem_bound
:
mem_bound
=
max_mem_count
else
:
min_memory_generator
(
new_exec_nodes
,
viewed_by
_temp
,
view_of_temp
)
min_memory_generator
(
new_exec_nodes
,
viewed_by
,
view_of_temp
)
# Reset track variables
mem_count
-=
mem_created
...
...
@@ -908,6 +914,15 @@ class ProfileStats(object):
for
var
in
node
.
outputs
:
compute_map
[
var
][
0
]
=
0
for
k_remove
,
v_remove
in
change_track_remove
.
iteritems
():
for
i
in
v_remove
:
viewed_by
[
k_remove
]
.
append
(
i
)
for
k_add
,
v_add
in
change_track_add
.
iteritems
():
for
i
in
v_add
:
viewed_by
[
k_add
]
.
remove
(
i
)
# two data structure used to mimic Python gc
viewed_by
=
{}
# {var1: [vars that view var1]}
# The len of the list is the value of python ref count. But we use a list, not just the ref count value.
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论