Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
89178cd5
提交
89178cd5
authored
3月 26, 2014
作者:
Pierre Luc Carrier
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Copy files from the cuda to the gpuarray folder
上级
e93c61d1
隐藏空白字符变更
内嵌
并排
正在显示
2 个修改的文件
包含
442 行增加
和
0 行删除
+442
-0
neighbours.py
theano/sandbox/gpuarray/neighbours.py
+419
-0
test_neighbours.py
theano/sandbox/gpuarray/tests/test_neighbours.py
+23
-0
没有找到文件。
theano/sandbox/gpuarray/neighbours.py
0 → 100644
浏览文件 @
89178cd5
# This is work in progress
from
theano
import
Op
,
Apply
from
theano.gof
import
local_optimizer
from
theano.sandbox.cuda
import
cuda_available
,
GpuOp
from
theano.sandbox.neighbours
import
Images2Neibs
if
cuda_available
:
from
theano.sandbox.cuda
import
CudaNdarrayType
from
theano.sandbox.cuda.basic_ops
import
host_from_gpu
,
gpu_from_host
from
theano.sandbox.cuda.opt
import
register_opt
as
register_gpu_opt
class
GpuImages2Neibs
(
Images2Neibs
,
GpuOp
):
def
__init__
(
self
,
mode
=
'valid'
):
if
mode
not
in
[
'valid'
,
'ignore_borders'
,
'wrap_centered'
]:
raise
NotImplementedError
(
"Only the mode valid, ignore_borders"
" and wrap_centered"
" have been implemented for the op"
" GpuImages2Neibs"
)
self
.
mode
=
mode
def
make_node
(
self
,
ten4
,
neib_shape
,
neib_step
):
assert
ten4
.
dtype
==
'float32'
if
not
isinstance
(
ten4
.
type
,
CudaNdarrayType
):
raise
TypeError
(
'ten4 must be cudandarray'
,
ten4
)
assert
ten4
.
ndim
==
4
assert
neib_shape
.
ndim
==
1
assert
neib_step
.
ndim
==
1
return
Apply
(
self
,
[
ten4
,
neib_shape
,
neib_step
],
[
CudaNdarrayType
(
broadcastable
=
(
False
,
False
),
dtype
=
ten4
.
type
.
dtype
)()])
def
c_code_cache_version
(
self
):
return
(
8
,)
def
c_support_code_apply
(
self
,
node
,
nodename
):
mode
=
self
.
mode
return
"""
//a version that use less register but don't work in all case.
static __global__ void k_multi_warp_less_
%(nodename)
s(
const int nb_batch,
const int nb_stack,
const int height,
const int width,
const int c,
const int d,
const int step_x,
const int step_y,
const int grid_c,
const int grid_d,
const int stride0, const int stride1,
const int stride2, const int stride3,
float * global_ten4,
const int out_s0, const int out_s1,
float * global_out
)
{
const int wrap_centered_idx_shift_x = c/2;
const int wrap_centered_idx_shift_y = d/2;
for(int tblock = blockIdx.x*blockDim.z+threadIdx.z;
tblock<nb_batch*nb_stack*grid_c*grid_d;
tblock+=gridDim.x*blockDim.z){
const int b = tblock
%%
grid_d;
int left = tblock/grid_d;
const int a = left
%%
grid_c;
left = left/grid_c;
const int s = left
%%
nb_stack;
left = left/nb_stack;
const int n = left;
if(n>nb_batch)continue;
if(s>nb_stack)continue;
if(a>grid_c)continue;
if(b>grid_d)continue;
int z_row = b + grid_d*(a + grid_c*
(s + nb_stack*n));
int i = threadIdx.y; // loop over c
{
int ten4_2 = i + a * step_x;
if("
%(mode)
s"=="wrap_centered"){
ten4_2 -= wrap_centered_idx_shift_x;
if ( ten4_2 < 0 )
ten4_2 += height;
else if (ten4_2 >= height)
ten4_2 -= height;
}
int j = threadIdx.x; // loop over d
{
int ten4_3 = j + b * step_y;
if("
%(mode)
s"=="wrap_centered"){
ten4_3 -= wrap_centered_idx_shift_y;
if ( ten4_3 < 0 )
ten4_3 += width;
else if (ten4_3 >= width)
ten4_3 -= width;
}
int ten4_idx = stride3*ten4_3 +
stride2*ten4_2 +
stride1*s + stride0*n;
int z_col = j + d * i;
int z_idx = z_col * out_s1 +
z_row * out_s0;
global_out[z_idx] = global_ten4[ten4_idx];
}
}
}
}
static __global__ void k_multi_warp_
%(nodename)
s(
const int nb_batch,
const int nb_stack,
const int height,
const int width,
const int c,
const int d,
const int step_x,
const int step_y,
const int grid_c,
const int grid_d,
const int stride0, const int stride1,
const int stride2, const int stride3,
float * global_ten4,
const int out_s0, const int out_s1,
float * global_out
)
{
const int wrap_centered_idx_shift_x = c/2;
const int wrap_centered_idx_shift_y = d/2;
for(int tblock = blockIdx.x*blockDim.z+threadIdx.z;
tblock<nb_batch*nb_stack*grid_c*grid_d;
tblock+=gridDim.x*blockDim.z){
const int b = tblock
%%
grid_d;
int left = tblock/grid_d;
const int a = left
%%
grid_c;
left = left/grid_c;
const int s = left
%%
nb_stack;
left = left/nb_stack;
const int n = left;
if(n>nb_batch)continue;
if(s>nb_stack)continue;
if(a>grid_c)continue;
if(b>grid_d)continue;
int z_row = b + grid_d*(a + grid_c*
(s + nb_stack*n));
// loop over c
for (int i = threadIdx.y; i < c; i+=blockDim.y)
{
int ten4_2 = i + a * step_x;
if("
%(mode)
s"=="wrap_centered"){
ten4_2 -= wrap_centered_idx_shift_x;
if ( ten4_2 < 0 )
ten4_2 += height;
else if (ten4_2 >= height)
ten4_2 -= height;
}
// loop over d
for (int j = threadIdx.x; j < d; j+=blockDim.x)
{
int ten4_3 = j + b * step_y;
if("
%(mode)
s"=="wrap_centered"){
ten4_3 -= wrap_centered_idx_shift_y;
if ( ten4_3 < 0 )
ten4_3 += width;
else if (ten4_3 >= width)
ten4_3 -= width;
}
int ten4_idx = stride3*ten4_3 +
stride2*ten4_2 +
stride1*s + stride0*n;
int z_col = j + d * i;
int z_idx = z_col * out_s1 +
z_row * out_s0;
global_out[z_idx] = global_ten4[ten4_idx];
}
}
}
}
"""
%
locals
()
def
c_code
(
self
,
node
,
name
,
inp
,
out
,
sub
):
ten4
,
neib_shape
,
neib_step
=
inp
z
,
=
out
fail
=
sub
[
'fail'
]
mode
=
self
.
mode
return
"""
#ifndef CEIL_INTDIV
#define CEIL_INTDIV(a, b) ((a/b) + ((a
%%
b) ? 1: 0))
#endif
int grid_c = -1;
int grid_d = -1;
{
if (
%(ten4)
s->nd != 4)
{
PyErr_Format(PyExc_TypeError, "pvals wrong rank");
%(fail)
s;
}
if (
%(neib_shape)
s->nd != 1)
{
PyErr_Format(PyExc_TypeError, "unis wrong rank");
%(fail)
s;
}
if (PyArray_DIMS(
%(neib_shape)
s)[0] != 2)
{
PyErr_Format(PyExc_ValueError,
"neib_shape has to contain two elements");
%(fail)
s;
}
const int c = *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const int d = *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*)
PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*)
PyArray_GETPTR1(
%(neib_step)
s, 1);
if ( "
%(mode)
s" == "wrap_centered") {
if (c
%%2
!=1 || d
%%2
!=1){
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in mode wrap_centered need patch with odd shapes");
%(fail)
s;
}
if ( CudaNdarray_HOST_DIMS(
%(ten4)
s)[2] < c ||
CudaNdarray_HOST_DIMS(
%(ten4)
s)[3] < d)
{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in wrap_centered mode, don't"
" support image shapes smaller then the patch"
" shapes: neib_shape=(
%%
d,
%%
d),"
" ten4[2:]=[
%%
d,
%%
d]",
c, d, CudaNdarray_HOST_DIMS(
%(ten4)
s)[2],
CudaNdarray_HOST_DIMS(
%(ten4)
s)[3]);
%(fail)
s;
}
grid_c = CEIL_INTDIV(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[2]),
step_x);
grid_d = CEIL_INTDIV(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[3]),
step_y);
}else if ( "
%(mode)
s" == "valid") {
if ( ((CudaNdarray_HOST_DIMS(
%(ten4)
s))[2] < c) ||
((((CudaNdarray_HOST_DIMS(
%(ten4)
s))[2]-c)
%%
step_x)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[0]=
%%
d, neib_step[0]=
%%
d and"
" ten4.shape[2]=
%%
d not consistent",
c, step_x,
CudaNdarray_HOST_DIMS(
%(ten4)
s)[2]);
%(fail)
s;
}
if ( ((CudaNdarray_HOST_DIMS(
%(ten4)
s))[3] < d) ||
((((CudaNdarray_HOST_DIMS(
%(ten4)
s))[3]-d)
%%
step_y)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[1]=
%%
d, neib_step[1]=
%%
d and"
" ten4.shape[3]=
%%
d not consistent",
d, step_y,
CudaNdarray_HOST_DIMS(
%(ten4)
s)[3]);
%(fail)
s;
}
//number of patch in height
grid_c = 1+(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else if ( "
%(mode)
s" == "ignore_borders") {
//number of patch in height
grid_c = 1+(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((CudaNdarray_HOST_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: unknow mode '
%(mode)
s'");
%(fail)
s;
}
// new dimensions for z
const int z_dim1 = c * d;
const int z_dim0 = grid_c
* grid_d
* CudaNdarray_HOST_DIMS(
%(ten4)
s)[1]
* CudaNdarray_HOST_DIMS(
%(ten4)
s)[0];
if ((NULL ==
%(z)
s)
|| (CudaNdarray_HOST_DIMS(
%(z)
s)[0] != z_dim0)
|| (CudaNdarray_HOST_DIMS(
%(z)
s)[1] != z_dim1))
{
Py_XDECREF(
%(z)
s);
npy_intp dims[2];
dims[0] = z_dim0;
dims[1] = z_dim1;
%(z)
s = (CudaNdarray*)CudaNdarray_NewDims(2, dims);
if (!
%(z)
s)
{
PyErr_SetString(PyExc_MemoryError,
"failed to alloc z output");
%(fail)
s;
}
}
}
{ // NESTED SCOPE
const int nb_batch = CudaNdarray_HOST_DIMS(
%(ten4)
s)[0];
const int nb_stack = CudaNdarray_HOST_DIMS(
%(ten4)
s)[1];
const int height = CudaNdarray_HOST_DIMS(
%(ten4)
s)[2];
const int width = CudaNdarray_HOST_DIMS(
%(ten4)
s)[3];
const int c = *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const int d = *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*)
PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*)
PyArray_GETPTR1(
%(neib_step)
s, 1);
dim3 n_threads(d,c,1);
//Their is a max of 512 threads per blocks
while(n_threads.x*n_threads.y>512 && n_threads.y>1)n_threads.y--;
while(n_threads.x*n_threads.y>512 && n_threads.x>1)n_threads.x--;
//Make bigger block to have better memory access pattern and
//a higher core utilisation. for smaller patch size
while(c*d*(n_threads.z+1) < 128 && n_threads.z<64 &&
n_threads.z<CudaNdarray_HOST_DIMS(
%(z)
s)[0]){
n_threads.z++;
}
int nb_block;
if (CudaNdarray_HOST_DIMS(
%(z)
s)[0]
%%
n_threads.z == 0)
nb_block = CudaNdarray_HOST_DIMS(
%(z)
s)[0] / n_threads.z;
else
nb_block = (CudaNdarray_HOST_DIMS(
%(z)
s)[0] / n_threads.z) + 1;
dim3 n_blocks(std::min(32*1024,nb_block));
int n_shared = 0;
void (*f)(int, int, int ,int,
int, int, int ,int,
int, int,
int, int, int, int,
float*,
int, int,
float*);
if(n_threads.x==d && n_threads.y==c){
f = k_multi_warp_less_
%(name)
s;
}else{
f = k_multi_warp_
%(name)
s;
}
f<<<n_blocks, n_threads, n_shared>>>(
nb_batch,
nb_stack,
height, width,
c, d, step_x, step_y,
grid_c, grid_d,
CudaNdarray_HOST_STRIDES(
%(ten4)
s)[0],
CudaNdarray_HOST_STRIDES(
%(ten4)
s)[1],
CudaNdarray_HOST_STRIDES(
%(ten4)
s)[2],
CudaNdarray_HOST_STRIDES(
%(ten4)
s)[3],
CudaNdarray_DEV_DATA(
%(ten4)
s),
CudaNdarray_HOST_STRIDES(
%(z)
s)[0],
CudaNdarray_HOST_STRIDES(
%(z)
s)[1],
CudaNdarray_DEV_DATA(
%(z)
s)
);
CNDA_THREAD_SYNC;
cudaError_t sts = cudaGetLastError();
if (cudaSuccess != sts)
{
PyErr_Format(PyExc_RuntimeError,
"Cuda error:
%%
s:
%%
s. (grid:
%%
i x
%%
i;"
" block:
%%
i x
%%
i x
%%
i; shared:
%%
i)
\\
n",
"k_multi_warp_
%(name)
s",
cudaGetErrorString(sts),
n_blocks.x,
n_blocks.y,
n_threads.x,
n_threads.y,
n_threads.z,
n_shared);
%(fail)
s;
}
} // END NESTED SCOPE
"""
%
locals
()
def
gpu_images2neibs
(
ten4
,
neib_shape
,
neib_step
=
None
,
mode
=
'valid'
):
return
GpuImages2Neibs
(
mode
)(
ten4
,
neib_shape
,
neib_step
)
@local_optimizer
([
Images2Neibs
])
def
use_gpu_images2neibs
(
node
):
if
(
type
(
node
.
op
)
is
Images2Neibs
and
node
.
inputs
[
0
]
.
dtype
==
'float32'
and
node
.
op
.
mode
in
[
'valid'
,
'ignore_borders'
,
'wrap_centered'
]):
return
[
host_from_gpu
(
gpu_images2neibs
(
gpu_from_host
(
node
.
inputs
[
0
]),
node
.
inputs
[
1
],
node
.
inputs
[
2
],
mode
=
node
.
op
.
mode
))]
if
cuda_available
:
register_gpu_opt
()(
use_gpu_images2neibs
)
theano/sandbox/gpuarray/tests/test_neighbours.py
0 → 100644
浏览文件 @
89178cd5
# Skip test if cuda_ndarray is not available.
from
nose.plugins.skip
import
SkipTest
import
theano.sandbox.cuda
as
cuda_ndarray
if
cuda_ndarray
.
cuda_available
==
False
:
raise
SkipTest
(
'Optional package cuda disabled'
)
import
theano.sandbox.test_neighbours
from
theano.sandbox.cuda.neighbours
import
GpuImages2Neibs
if
theano
.
config
.
mode
==
'FAST_COMPILE'
:
mode_with_gpu
=
theano
.
compile
.
mode
.
get_mode
(
'FAST_RUN'
)
.
including
(
'gpu'
)
else
:
mode_with_gpu
=
theano
.
compile
.
mode
.
get_default_mode
()
.
including
(
'gpu'
)
class
T_GpuImages2Neibs
(
theano
.
sandbox
.
test_neighbours
.
T_Images2Neibs
):
mode
=
mode_with_gpu
op
=
GpuImages2Neibs
dtypes
=
[
'float32'
]
if
__name__
==
'__main__'
:
unittest
.
main
()
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论