Rewrote the entire thing using my new OpenCL template. Makes small one offs like these reallly simple

2017-04-04 05:33:38 -07:00
parent 08fd8b2398
commit 7743321465
27 changed files with 2314 additions and 1375 deletions
--- a/kernels/conways.cl
+++ b/kernels/conways.cl
@@ -0,0 +1,141 @@
+int pixel_to_index(int2 dimensions, int2 pixel) {
+
+	if (pixel.x >= 0 && pixel.x <= dimensions.x &&
+		pixel.y >= 0 && pixel.x <= dimensions.y ){
+
+		return pixel.y * dimensions.x + pixel.x;
+	}
+
+	return -1;
+}
+
+
+__kernel void conways (
+		global int2* image_res,
+		__write_only image2d_t image,
+		global char* first_node_buffer,
+        global char* second_node_buffer,
+        global char* buffer_flip
+	){
+
+	size_t x_pixel = get_global_id(0);
+	size_t y_pixel = get_global_id(1);
+
+
+	//printf(": %i", y_pixel);
+
+	int2 pixel = (int2)(x_pixel, y_pixel);
+
+	//if (pixel.x > 1800)
+	//	printf("%i, %i", pixel.x, pixel.y);
+
+	float4 dead = (float4)(.49, .68, .81, 1);
+	float4 alive = (float4)(.49, .68, .71, .3);
+
+	// add all 8 blocks to neghbors
+	int neighbors = 0;
+	int val = 0;
+
+	if (*buffer_flip == 0){
+
+		// Top
+		val = pixel_to_index(*image_res, (int2)(pixel.x, pixel.y+1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Top Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y+1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Bottom Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y-1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Bottom
+		val = pixel_to_index(*image_res, (int2)(pixel.x, pixel.y-1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Bottom Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y-1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		// Top Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y+1));
+		if (val >= 0)
+			neighbors += first_node_buffer[val];
+
+		int base = pixel_to_index(*image_res, pixel);
+		if (neighbors == 3 || (neighbors == 2 && first_node_buffer[base])){
+		   write_imagef(image, pixel, alive);
+		   second_node_buffer[base] = 1;
+		} else {
+		   write_imagef(image, pixel, dead);
+		   second_node_buffer[base] = 0;
+		}
+
+	} else {
+
+		// Top
+		val = pixel_to_index(*image_res, (int2)(pixel.x, pixel.y+1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Top Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y+1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Bottom Right
+		val = pixel_to_index(*image_res, (int2)(pixel.x+1, pixel.y-1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Bottom
+		val = pixel_to_index(*image_res, (int2)(pixel.x, pixel.y-1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Bottom Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y-1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		// Top Left
+		val = pixel_to_index(*image_res, (int2)(pixel.x-1, pixel.y+1));
+		if (val >= 0)
+			neighbors += second_node_buffer[val];
+
+		int base = pixel_to_index(*image_res, pixel);
+		if (neighbors == 3 || (neighbors == 2 && second_node_buffer[base])){
+		   write_imagef(image, pixel, alive);
+		   first_node_buffer[base] = 1;
+		} else {
+		   write_imagef(image, pixel, dead);
+		   first_node_buffer[base] = 0;
+		}
+	}
+}