Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
bdcec1ab
提交
bdcec1ab
authored
8月 18, 2012
作者:
Olivier Delalleau
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
PEP8
上级
31f6eb35
隐藏空白字符变更
内嵌
并排
正在显示
1 个修改的文件
包含
39 行增加
和
39 行删除
+39
-39
conv.py
theano/tensor/nnet/conv.py
+39
-39
没有找到文件。
theano/tensor/nnet/conv.py
浏览文件 @
bdcec1ab
...
@@ -1744,15 +1744,15 @@ if (%(z)s->strides[3] != (npy_intp)sizeof(%(type)s)) %(fail)s;
...
@@ -1744,15 +1744,15 @@ if (%(z)s->strides[3] != (npy_intp)sizeof(%(type)s)) %(fail)s;
for(int b=0;b<
%(self_bsize)
s ;b+=
%(unroll_bsize)
s){
for(int b=0;b<
%(self_bsize)
s ;b+=
%(unroll_bsize)
s){
for(int n_kern=0;n_kern<
%(self_nkern)
s;n_kern+=
%(unroll_ksize)
s){
for(int n_kern=0;n_kern<
%(self_nkern)
s;n_kern+=
%(unroll_ksize)
s){
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"
%(type)
s * __restrict__ out
%(unroll_iter)
s=(
%(type)
s *)(PyArray_GETPTR2(
%(z)
s,b+
%(unroll_biter)
s,n_kern+
%(unroll_kiter)
s));"
)
ret
+=
my_dup2
(
"
%(type)
s * __restrict__ out
%(unroll_iter)
s=(
%(type)
s *)(PyArray_GETPTR2(
%(z)
s,b+
%(unroll_biter)
s,n_kern+
%(unroll_kiter)
s));"
)
ret
+=
my_dup
(
"for (int i = 0; i < dim_zz[0]*dim_zz[1]; ++i) out
%(unroll_iter)
s[i] = 0;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
my_dup
(
"for (int i = 0; i < dim_zz[0]*dim_zz[1]; ++i) out
%(unroll_iter)
s[i] = 0;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
"""
ret
+=
"""
for(int stack_size=0;stack_size<
%(self_imshp0)
s;stack_size++){
for(int stack_size=0;stack_size<
%(self_imshp0)
s;stack_size++){
"""
%
d
"""
%
d
ret
+=
my_dup
(
"const
%(type)
s * __restrict__ in
%(unroll_iter)
d=(
%(type)
s *)(PyArray_GETPTR2(img2d,b+
%(unroll_iter)
s,stack_size));"
,
unroll_bsize
)
ret
+=
my_dup
(
"const
%(type)
s * __restrict__ in
%(unroll_iter)
d=(
%(type)
s *)(PyArray_GETPTR2(img2d,b+
%(unroll_iter)
s,stack_size));"
,
unroll_bsize
)
ret
+=
my_dup
(
"const
%(type)
s * __restrict__ hvals
%(unroll_iter)
s=(
%(type)
s *)(PyArray_GETPTR2(filtersflipped,n_kern+
%(unroll_iter)
s,stack_size));"
,
unroll_ksize
)
ret
+=
my_dup
(
"const
%(type)
s * __restrict__ hvals
%(unroll_iter)
s=(
%(type)
s *)(PyArray_GETPTR2(filtersflipped,n_kern+
%(unroll_iter)
s,stack_size));"
,
unroll_ksize
)
ret
+=
"""
ret
+=
"""
int new_m;
int new_m;
...
@@ -1764,9 +1764,9 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
...
@@ -1764,9 +1764,9 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
for (int iter_n=0; iter_n < Os[1]; iter_n++) { // loop over columns
for (int iter_n=0; iter_n < Os[1]; iter_n++) { // loop over columns
int pos_n=iter_n*
%(self_dy)
s;
int pos_n=iter_n*
%(self_dy)
s;
"""
%
d
"""
%
d
ret
+=
my_dup
(
"
%(type)
s sum
%(unroll_iter)
s=0;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
my_dup
(
"
%(type)
s sum
%(unroll_iter)
s=0;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
"""
ret
+=
"""
// Sum over kernel, if index into image is out of bounds
// Sum over kernel, if index into image is out of bounds
// fill with the value
// fill with the value
...
@@ -1774,15 +1774,15 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
...
@@ -1774,15 +1774,15 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
int ind0 = (new_m-j);
int ind0 = (new_m-j);
if(mode==FULL){
if(mode==FULL){
"""
%
d
"""
%
d
ret
+=
my_dup
(
"const
%(type)
s * idx_hvals
%(unroll_iter)
s=&hvals
%(unroll_iter)
s[j*dim_ker1];"
,
unroll_ksize
)
ret
+=
my_dup
(
"const
%(type)
s * idx_hvals
%(unroll_iter)
s=&hvals
%(unroll_iter)
s[j*dim_ker1];"
,
unroll_ksize
)
ret
+=
"""
ret
+=
"""
if(ind0 < 0 || ind0 >= dim_im[0]){
if(ind0 < 0 || ind0 >= dim_im[0]){
if(fill_value!=0)
if(fill_value!=0)
for (int k=0; k < dim_ker1; k++) {
for (int k=0; k < dim_ker1; k++) {
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
"""
ret
+=
"""
}
}
}else{
}else{
//do the part where kernel is to the right of the img
//do the part where kernel is to the right of the img
...
@@ -1791,49 +1791,49 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
...
@@ -1791,49 +1791,49 @@ for(int b=0;b< %(self_bsize)s ;b+=%(unroll_bsize)s){
if(fill_value!=0){
if(fill_value!=0){
for(k=0;k<max_k;k++){
for(k=0;k<max_k;k++){
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
"""
ret
+=
"""
}
}
}else {k=max_k;}
}else {k=max_k;}
//do the part where the kernel is on the img
//do the part where the kernel is on the img
max_k=min(pos_n+1,(int)dim_ker1);
max_k=min(pos_n+1,(int)dim_ker1);
"""
%
d
"""
%
d
ret
+=
my_dup
(
"const
%(type)
s * idx_in
%(unroll_iter)
s=&in
%(unroll_iter)
s[ind0*dim_im[1]];"
,
unroll_bsize
)
ret
+=
my_dup
(
"const
%(type)
s * idx_in
%(unroll_iter)
s=&in
%(unroll_iter)
s[ind0*dim_im[1]];"
,
unroll_bsize
)
ret
+=
"""
ret
+=
"""
for (int ind1=pos_n-k; k<max_k; k++,ind1--) {
for (int ind1=pos_n-k; k<max_k; k++,ind1--) {
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s+= idx_hvals
%(unroll_kiter)
s[k] * idx_in
%(unroll_biter)
s[ind1];"
)
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s+= idx_hvals
%(unroll_kiter)
s[k] * idx_in
%(unroll_biter)
s[ind1];"
)
ret
+=
"""
ret
+=
"""
}
}
//do the part to the left of the img
//do the part to the left of the img
if(fill_value!=0)
if(fill_value!=0)
for(;k<dim_ker1;k++){
for(;k<dim_ker1;k++){
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s += idx_hvals
%(unroll_kiter)
s[k] * fill_value;"
)
ret
+=
"""
ret
+=
"""
}
}
}
}
}else{//valid mode
}else{//valid mode
"""
%
d
"""
%
d
ret
+=
my_dup
(
"const
%(type)
s* idx_in
%(unroll_iter)
s=&in
%(unroll_iter)
s[ind0*dim_im[1]];"
,
unroll_bsize
)
ret
+=
my_dup
(
"const
%(type)
s* idx_in
%(unroll_iter)
s=&in
%(unroll_iter)
s[ind0*dim_im[1]];"
,
unroll_bsize
)
ret
+=
my_dup
(
"const
%(type)
s* idx_hvals
%(unroll_iter)
s=&hvals
%(unroll_iter)
s[j*dim_ker1];"
,
unroll_ksize
)
ret
+=
my_dup
(
"const
%(type)
s* idx_hvals
%(unroll_iter)
s=&hvals
%(unroll_iter)
s[j*dim_ker1];"
,
unroll_ksize
)
ret
+=
"""
ret
+=
"""
int new_n = (pos_n+dim_ker1-1);
int new_n = (pos_n+dim_ker1-1);
for (int k=0,last=new_n; k < dim_ker1; k++,last--) {
for (int k=0,last=new_n; k < dim_ker1; k++,last--) {
"""
%
d
"""
%
d
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s+=idx_hvals
%(unroll_kiter)
s[k]*idx_in
%(unroll_biter)
s[last];"
)
ret
+=
my_dup2
(
"sum
%(unroll_iter)
s+=idx_hvals
%(unroll_kiter)
s[k]*idx_in
%(unroll_biter)
s[last];"
)
ret
+=
"""
ret
+=
"""
}
}
}
}
}//for j
}//for j
"""
%
d
"""
%
d
ret
+=
my_dup
(
"out
%(unroll_iter)
s[iter_m*dim_zz[1]+iter_n]
%(affectation)
s sum
%(unroll_iter)
s;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
my_dup
(
"out
%(unroll_iter)
s[iter_m*dim_zz[1]+iter_n]
%(affectation)
s sum
%(unroll_iter)
s;"
,
unroll_bsize
*
unroll_ksize
)
ret
+=
"""
ret
+=
"""
}//for n
}//for n
}//for m
}//for m
}//for stack_size
}//for stack_size
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论