mitchellhansen/conways-game-of-life-gpu
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

I thiiiiink that the gpu is computing things correctly now, but I'm having trouble getting data back out of the gpu. More tomorrow

Browse Source
This commit is contained in:
MitchellHansen
2015-12-23 00:22:02 -08:00
parent 5c593695e8
commit 7d1cc67143
2 changed files with 127 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
Conway_OpenCL/HelloWorld_Kernel.cl
View File

@@ -1,11 +1,11 @@
__kernel void helloworld(__global char* in, __global int num_workers, __global int grid_width, __global int grid_height)
__kernel void helloworld(__global char* in, __global int* num_workers, __global int* grid_width, __global int* grid_height)
{
// Caclulate the start and end range that this worker will be calculating
int data_length = grid_width * grid_height;
int data_length = *grid_width * *grid_height;
int start_range = (data_length / num_workers) * get_global_id(0) * 2; // * 2 = padding
int end_range = (data_length / num_workers) * (get_global_id(0) + 1) * 2;
int start_range = (data_length / *num_workers) * get_global_id(0) * 2; // * 2 = padding
int end_range = (data_length / *num_workers) * (get_global_id(0) + 1) * 2;
// x, y + 1
@@ -14,30 +14,30 @@ __kernel void helloworld(__global char* in, __global int num_workers, __global i
for (int i = start_range; i < end_range; i += 2){
// add all 8 blocks to neghbors
neighbors = 0;
// Top
neighbors += in[i - grid_width * 2];
neighbors += in[i - *grid_width * 2];
// Top right
neightbors += in[i - grid_width * 2 + 2];
neighbors += in[i - *grid_width * 2 + 2];
// Right
neighbors += in[i + 2];
// Bottom Right
neighbors += in[i + grid_width * 2 + 2];
neighbors += in[i + *grid_width * 2 + 2];
// Bottom
neighbors += in[i + grid_width * 2];
neighbors += in[i + *grid_width * 2];
// Bottom Left
neighbors += in[i + grid_width * 2 - 2];
neighbors += in[i + *grid_width * 2 - 2];
// Left
neighbors += in[i - 2];
// Top left
neighbors += in[i - grid_width * 2 - 2];
neighbors += in[i - *grid_width * 2 - 2];
// push living status to the padded second char