Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
23b7a597
提交
23b7a597
authored
5月 15, 2013
作者:
lamblin
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #1373 from nouiz/make_vector
Add MakeVector.c_code
上级
dc5617c1
a74a472c
隐藏空白字符变更
内嵌
并排
正在显示
3 个修改的文件
包含
84 行增加
和
5 行删除
+84
-5
basic.txt
doc/library/tensor/basic.txt
+5
-5
test_cmodule.py
theano/gof/tests/test_cmodule.py
+53
-0
opt.py
theano/tensor/opt.py
+26
-0
没有找到文件。
doc/library/tensor/basic.txt
浏览文件 @
23b7a597
...
...
@@ -683,7 +683,7 @@ Reductions
.. function:: max(x, axis=None, keepdims=False)
:Parameter: *x* - symbolic Tensor (or compatible)
:Parameter: *axis* - axis or axes along which to compute the
s
um
:Parameter: *axis* - axis or axes along which to compute the
maxim
um
:Parameter: *keepdims* - (boolean) If this is set to True, the axes which are reduced are
left in the result as dimensions with size one. With this option, the result
will broadcast correctly against the original tensor.
...
...
@@ -697,7 +697,7 @@ Reductions
.. function:: argmax(x, axis=None, keepdims=False)
:Parameter: *x* - symbolic Tensor (or compatible)
:Parameter: *axis* - axis along which to compute the maximum
:Parameter: *axis* - axis along which to compute the
index of the
maximum
:Parameter: *keepdims* - (boolean) If this is set to True, the axis which is reduced is
left in the result as a dimension with size one. With this option, the result
will broadcast correctly against the original tensor.
...
...
@@ -709,7 +709,7 @@ Reductions
.. function:: max_and_argmax(x, axis=None, keepdims=False)
:Parameter: *x* - symbolic Tensor (or compatible)
:Parameter: *axis* - axis along which to compute the maximum
:Parameter: *axis* - axis along which to compute the maximum
and its index
:Parameter: *keepdims* - (boolean) If this is set to True, the axis which is reduced is
left in the result as a dimension with size one. With this option, the result
will broadcast correctly against the original tensor.
...
...
@@ -721,7 +721,7 @@ Reductions
.. function:: min(x, axis=None, keepdims=False)
:Parameter: *x* - symbolic Tensor (or compatible)
:Parameter: *axis* - axis or axes along which to compute the
s
um
:Parameter: *axis* - axis or axes along which to compute the
minim
um
:Parameter: *keepdims* - (boolean) If this is set to True, the axes which are reduced are
left in the result as dimensions with size one. With this option, the result
will broadcast correctly against the original tensor.
...
...
@@ -735,7 +735,7 @@ Reductions
.. function:: argmin(x, axis=None, keepdims=False)
:Parameter: *x* - symbolic Tensor (or compatible)
:Parameter: *axis* - axis along which to compute the minimum
:Parameter: *axis* - axis along which to compute the
index of the
minimum
:Parameter: *keepdims* - (boolean) If this is set to True, the axes which are reduced are
left in the result as dimensions with size one. With this option, the result
will broadcast correctly against the original tensor.
...
...
theano/gof/tests/test_cmodule.py
0 → 100644
浏览文件 @
23b7a597
"""We don't have real test for the cache, but it would be great to make them!
But this one test a current behavior that isn't good: the c_code isn't
deterministic based on the input type and the op.
"""
import
numpy
import
theano
class
MyOp
(
theano
.
compile
.
ops
.
DeepCopyOp
):
nb_called
=
0
def
c_code_cache_version
(
self
):
return
()
def
c_code
(
self
,
node
,
name
,
inames
,
onames
,
sub
):
MyOp
.
nb_called
+=
1
iname
,
=
inames
oname
,
=
onames
fail
=
sub
[
'fail'
]
itype
=
node
.
inputs
[
0
]
.
type
.
__class__
if
itype
in
self
.
c_code_and_version
:
code
,
version
=
self
.
c_code_and_version
[
itype
]
rand
=
numpy
.
random
.
rand
()
return
(
"""printf("
%(rand)
s
\\
n");"""
+
code
)
%
locals
()
# Else, no C code
return
super
(
DeepCopyOp
,
self
)
.
c_code
(
node
,
name
,
inames
,
onames
,
sub
)
def
test_inter_process_cache
():
"""When an op with c_code, but no version. If we have 2 apply node
in the graph with different inputs variable(so they don't get
merged) but the inputs variable have the same type, do we reuse
the same module? Even if they would generate different c_code?
Currently this test show that we generate the c_code only once.
This is to know if the c_code can add information specific to the
node.inputs[*].owner like the name of the variable.
"""
x
,
y
=
theano
.
tensor
.
vectors
(
'xy'
)
f
=
theano
.
function
([
x
,
y
],
[
MyOp
()(
x
),
MyOp
()(
y
)])
f
(
numpy
.
arange
(
60
),
numpy
.
arange
(
60
))
assert
MyOp
.
nb_called
==
1
# What if we compile a new function with new variables?
x
,
y
=
theano
.
tensor
.
vectors
(
'xy'
)
f
=
theano
.
function
([
x
,
y
],
[
MyOp
()(
x
),
MyOp
()(
y
)])
f
(
numpy
.
arange
(
60
),
numpy
.
arange
(
60
))
assert
MyOp
.
nb_called
==
1
theano/tensor/opt.py
浏览文件 @
23b7a597
...
...
@@ -544,6 +544,32 @@ class MakeVector(T.Op):
# assume that out has correct dtype. there is no cheap way to check
out
[
0
][
...
]
=
inputs
def
c_code_cache_version
(
self
):
return
(
1
,)
def
c_code
(
self
,
node
,
name
,
inp
,
out_
,
sub
):
out
,
=
out_
# Shouldn't use PyArray_TYPE(inp[0]) for the dtype
# when len(inp) == 0 (we need to support this case.
# So there will be (1 * nb_dtype) + ((nb len(inp) - 1 ))
# different c code with the following algo
out_shape
=
len
(
inp
)
out_dtype
=
numpy
.
dtype
(
node
.
outputs
[
0
]
.
dtype
)
.
num
if
len
(
inp
)
>
0
:
assert
self
.
dtype
==
node
.
inputs
[
0
]
.
dtype
out_dtype
=
'PyArray_TYPE(
%
s)'
%
inp
[
0
]
ret
=
"""
npy_intp dims[1];
dims[0] =
%(out_shape)
s;
%(out)
s = (PyArrayObject*)PyArray_EMPTY(1, dims,
%(out_dtype)
s, 0);
"""
%
locals
()
for
idx
,
i
in
enumerate
(
inp
):
ret
+=
"""
*((dtype_
%(out)
s *)PyArray_GETPTR1(
%(out)
s,
%(idx)
s)) = *((dtype_
%(out)
s *) PyArray_DATA(
%(i)
s));
"""
%
locals
()
return
ret
def
infer_shape
(
self
,
node
,
ishapes
):
return
[(
len
(
ishapes
),)]
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论