Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
736f6591
提交
736f6591
authored
10月 31, 2011
作者:
James Bergstra
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
bugfixes and refactoring in Composite - hashing and using c_support_code_apply
上级
188b2809
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
127 行增加
和
97 行删除
+127
-97
basic.py
theano/scalar/basic.py
+127
-97
没有找到文件。
theano/scalar/basic.py
浏览文件 @
736f6591
...
...
@@ -1924,9 +1924,10 @@ complex_from_polar = ComplexFromPolar(name='complex_from_polar')
class
Composite
(
ScalarOp
):
"""
Composite is an Op that takes a graph of scalar operations and
produces c code for the whole graph. Its biggest use would be to
implement the loop fusion optimizer (which I have yet to do
someday...)
produces c code for the whole graph. Its purpose is to implement loop
fusion.
Composite depends on all the Ops in its graph having C code.
"""
def
__str__
(
self
):
return
self
.
name
...
...
@@ -1945,53 +1946,114 @@ class Composite(ScalarOp):
super
(
Composite
,
out
)
.
__init__
(
output_types_preference
,
name
)
return
out
def
__init__
(
self
,
inputs
,
outputs
):
self
.
inputs
=
copy
(
inputs
)
self
.
outputs
=
copy
(
outputs
)
def
init_c_code
(
self
):
"""Return the C code for this Composite Op. """
subd
=
dict
(
zip
(
self
.
env
.
inputs
,
[
"
%%
(i
%
i)s"
%
i
for
i
in
xrange
(
len
(
self
.
env
.
inputs
))])
+
zip
(
self
.
env
.
outputs
,
[
"
%%
(o
%
i)s"
%
i
for
i
in
xrange
(
len
(
self
.
env
.
outputs
))]))
env
=
Env
(
*
gof
.
graph
.
clone
(
inputs
,
outputs
))
gof
.
MergeOptimizer
()
.
optimize
(
env
)
inputs
,
outputs
=
env
.
inputs
,
env
.
outputs
for
orphan
in
self
.
env
.
variables
:
#env.orphans:
if
orphan
.
owner
is
None
and
orphan
not
in
self
.
env
.
inputs
:
if
isinstance
(
orphan
,
Constant
):
subd
[
orphan
]
=
orphan
.
type
.
c_literal
(
orphan
.
data
)
else
:
raise
ValueError
(
"All orphans in the env to Composite must"
" be Constant instances."
)
for
node
in
env
.
nodes
:
if
not
isinstance
(
node
.
op
,
ScalarOp
):
raise
ValueError
(
"The env to Composite must be exclusively composed of ScalarOp instances."
)
_c_code
=
"{
\n
"
i
=
0
j
=
0
self
.
nodenames
=
[
"
%(name)
s_"
+
(
'subnode
%
i'
%
j
)
for
j
,
n
in
enumerate
(
self
.
env
.
toposort
())]
if
not
hasattr
(
self
,
"name"
):
l
=
[]
for
n
in
env
.
toposort
():
if
hasattr
(
n
.
op
,
"name"
)
and
n
.
op
.
name
is
not
None
:
v
=
n
.
op
.
name
if
v
.
startswith
(
"Composite"
):
v
=
v
[
len
(
"Composite"
):]
else
:
v
=
n
.
op
.
__class__
.
__name__
l
.
append
(
v
)
self
.
name
=
"Composite{"
+
","
.
join
(
l
)
+
"}"
for
j
,
node
in
enumerate
(
self
.
env
.
toposort
()):
for
output
in
node
.
outputs
:
if
output
not
in
subd
:
i
+=
1
name
=
"V
%%(id)
s_tmp
%
i"
%
i
subd
[
output
]
=
name
_c_code
+=
"
%
s
%
s;
\n
"
%
(
output
.
type
.
dtype_specs
()[
1
],
name
)
s
=
node
.
op
.
c_code
(
node
,
self
.
nodenames
[
j
],
[
subd
[
input
]
for
input
in
node
.
inputs
],
[
subd
[
output
]
for
output
in
node
.
outputs
],
dict
(
fail
=
"
%(fail)
s"
,
id
=
"
%%(id)
s_
%
i"
%
j
))
_c_code
+=
s
_c_code
+=
"
\n
"
_c_code
+=
"}
\n
"
self
.
_c_code
=
_c_code
def
init_py_impls
(
self
):
"""Return a list of functions that compute each output of self
"""
def
compose_impl
(
r
):
# this is not optimal at all eg in add(*1 -> mul(x, y), *1)
# it will calculate *1 twice
# it also doesn't follow env.toposort but that's (presumably)
# still correct since we only have scalar ops
if
r
in
env
.
inputs
:
idx
=
env
.
inputs
.
index
(
r
)
if
r
in
self
.
env
.
inputs
:
idx
=
self
.
env
.
inputs
.
index
(
r
)
return
lambda
inputs
:
inputs
[
idx
]
elif
r
.
owner
is
None
:
# in env.orphans:
return
lambda
inputs
:
r
.
data
node
=
r
.
owner
producers
=
[
compose_impl
(
input
)
for
input
in
node
.
inputs
]
return
lambda
inputs
:
node
.
op
.
impl
(
*
[
p
(
inputs
)
for
p
in
producers
])
self
.
_impls
=
[
compose_impl
(
r
)
for
r
in
self
.
env
.
outputs
]
_impls
=
[
compose_impl
(
r
)
for
r
in
env
.
outputs
]
def
init_name
(
self
):
"""Return a readable string representation of self.env
"""
try
:
rval
=
self
.
name
except
AttributeError
:
if
0
:
l
=
[]
for
n
in
env
.
toposort
():
if
hasattr
(
n
.
op
,
"name"
)
and
n
.
op
.
name
is
not
None
:
v
=
n
.
op
.
name
if
v
.
startswith
(
"Composite"
):
v
=
v
[
len
(
"Composite"
):]
else
:
v
=
n
.
op
.
__class__
.
__name__
l
.
append
(
v
)
rval
=
"Composite{"
+
","
.
join
(
l
)
+
"}"
else
:
for
i
,
r
in
enumerate
(
self
.
env
.
inputs
):
r
.
name
=
'i
%
i'
%
i
for
i
,
r
in
enumerate
(
self
.
env
.
outputs
):
r
.
name
=
'o
%
i'
%
i
io
=
set
(
self
.
env
.
inputs
+
self
.
env
.
outputs
)
for
i
,
r
in
enumerate
(
self
.
env
.
variables
):
if
r
not
in
io
and
len
(
r
.
clients
)
>
1
:
r
.
name
=
't
%
i'
%
i
rval
=
"Composite{
%
s}"
%
str
(
self
.
env
)
self
.
name
=
rval
def
init_env
(
self
):
env
=
Env
(
*
gof
.
graph
.
clone
(
self
.
inputs
,
self
.
outputs
))
gof
.
MergeOptimizer
()
.
optimize
(
env
)
for
node
in
env
.
nodes
:
if
not
isinstance
(
node
.
op
,
ScalarOp
):
raise
ValueError
(
"The env to Composite must be exclusively composed of ScalarOp instances."
)
self
.
env
=
env
self
.
_impls
=
_impls
def
__init__
(
self
,
inputs
,
outputs
):
self
.
inputs
=
copy
(
inputs
)
self
.
outputs
=
copy
(
outputs
)
self
.
inputs_type
=
tuple
([
input
.
type
for
input
in
inputs
])
self
.
outputs_type
=
tuple
([
output
.
type
for
output
in
outputs
])
self
.
nin
=
len
(
inputs
)
self
.
nout
=
len
(
outputs
)
self
.
env
=
env
self
.
in
puts_type
=
tuple
([
input
.
type
for
input
in
self
.
env
.
inputs
])
self
.
outputs_type
=
tuple
([
output
.
type
for
output
in
self
.
env
.
outputs
])
self
.
_rehash
()
self
.
init_env
()
# self.
env
self
.
in
it_name
()
# self.name
self
.
init_c_code
()
# self._c_code and self.nodenames
self
.
init_py_impls
()
# self._impls
def
output_types
(
self
,
input_types
):
if
tuple
(
input_types
)
!=
self
.
inputs_type
:
...
...
@@ -2023,49 +2085,10 @@ class Composite(ScalarOp):
#It won't generate conflicting variable name.
d
[
'id'
]
=
'_DUMMY_ID_'
subd
=
dict
(
zip
(
self
.
env
.
inputs
,
[
"
%%
(i
%
i)s"
%
i
for
i
in
xrange
(
len
(
self
.
env
.
inputs
))])
+
zip
(
self
.
env
.
outputs
,
[
"
%%
(o
%
i)s"
%
i
for
i
in
xrange
(
len
(
self
.
env
.
outputs
))]))
for
orphan
in
self
.
env
.
variables
:
#env.orphans:
if
orphan
.
owner
is
None
and
orphan
not
in
self
.
env
.
inputs
:
if
isinstance
(
orphan
,
Constant
):
subd
[
orphan
]
=
orphan
.
type
.
c_literal
(
orphan
.
data
)
else
:
raise
ValueError
(
"All orphans in the env to Composite must"
" be Constant instances."
)
_c_code
=
"{
\n
"
i
=
0
j
=
0
for
node
in
self
.
env
.
toposort
():
j
+=
1
for
output
in
node
.
outputs
:
if
output
not
in
subd
:
i
+=
1
name
=
"V
%%(id)
s_tmp
%
i"
%
i
subd
[
output
]
=
name
_c_code
+=
"
%
s
%
s;
\n
"
%
(
output
.
type
.
dtype_specs
()[
1
],
name
)
s
=
node
.
op
.
c_code
(
node
,
"
%(name)
s"
,
[
subd
[
input
]
for
input
in
node
.
inputs
],
[
subd
[
output
]
for
output
in
node
.
outputs
],
dict
(
fail
=
"
%(fail)
s"
,
id
=
"
%%(id)
s_
%
i"
%
j
))
_c_code
+=
s
_c_code
+=
"
\n
"
_c_code
+=
"}
\n
"
return
_c_code
%
d
return
self
.
_c_code
%
d
def
c_code_cache_version
(
self
):
rval
=
[
1
]
rval
=
[
2
]
for
x
in
self
.
env
.
toposort
():
xv
=
x
.
op
.
c_code_cache_version
()
if
xv
:
...
...
@@ -2074,14 +2097,17 @@ class Composite(ScalarOp):
return
()
return
tuple
(
rval
)
def
c_support_code
(
self
):
str
=
""
for
node
in
self
.
env
.
toposort
(
):
def
c_support_code
_apply
(
self
,
node
,
nodename
):
rval
=
[]
for
subnode
,
subnodename
in
zip
(
self
.
env
.
toposort
(),
self
.
nodenames
):
try
:
str
+=
node
.
op
.
c_support_code
()
+
"
\n
"
rval
.
append
(
subnode
.
op
.
c_support_code_apply
(
subnode
,
subnodename
%
dict
(
name
=
nodename
)))
except
gof
.
utils
.
MethodNotDefined
:
pass
return
str
return
"
\n
"
.
join
(
rval
)
def
__eq__
(
self
,
other
):
if
self
is
other
:
...
...
@@ -2090,31 +2116,35 @@ class Composite(ScalarOp):
or
self
.
nin
!=
other
.
nin
or
self
.
nout
!=
other
.
nout
):
return
False
rval
=
(
self
.
_cmodule_key
==
other
.
_cmodule_key
)
if
rval
:
assert
hash
(
self
)
==
hash
(
other
)
return
rval
def
_rehash
(
self
):
# delete the configparser md5 part out of the module key
# because for the purpose of identifying same/different
# Composite Ops, the flags governing C code generation are
# irrelevant.
self
.
_cmodule_key
=
gof
.
CLinker
.
cmodule_key_
(
self
.
env
,
no_recycling
=
[],
# irrelevant for comparing graphs
insert_config_md5
=
False
)
self
.
_hashval
=
hash
(
self
.
_cmodule_key
)
# see __hash__ for comment on why there is no mention of env
# or module cache key here.
return
(
self
.
_c_code
==
other
.
_c_code
)
def
__hash__
(
self
):
return
self
.
_hashval
rval
=
hash
((
type
(
self
),
self
.
nin
,
self
.
nout
,
self
.
_c_code
))
# Note that in general, the configparser settings at the time
# of code generation (__init__) affect the semantics of this Op.
# This function assumes that all relevant info about the configparser
# is embodied in _c_code. So the _c_code, rather than self.env,
# is the signature of the semantics of this Op.
# _c_code is preserved through unpickling, so the Op will not change
# semantics when it is reloaded with different configparser
# settings.
return
rval
def
__getstate__
(
self
):
return
dict
(
inputs
=
self
.
inputs
,
outputs
=
self
.
outputs
)
rval
=
dict
(
self
.
__dict__
)
del
rval
[
'_impls'
]
del
rval
[
'env'
]
return
rval
def
__setstate__
(
self
,
d
):
##
self.__dict__.update(d)
self
.
__dict__
.
update
(
d
)
# We must call init to set env and _impls again, as otherwise
# self.perform will not work.
self
.
__init__
(
d
[
'inputs'
],
d
[
'outputs'
])
self
.
init_env
()
self
.
init_py_impls
()
assert
self
.
_c_code
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论