life_opencl.c 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2011, 2013 Université de Bordeaux 1
  4. *
  5. * StarPU is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU Lesser General Public License as published by
  7. * the Free Software Foundation; either version 2.1 of the License, or (at
  8. * your option) any later version.
  9. *
  10. * StarPU is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  13. *
  14. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  15. */
  16. /* Heart of the stencil computation: compute a new state from an old one. */
  17. /* #define _externC extern "C" */
  18. #include <stencil.h>
  19. #ifdef __APPLE__
  20. #include <OpenCL/cl.h>
  21. #else
  22. #include <CL/cl.h>
  23. #endif
  24. #include <starpu.h>
  25. #define str(x) #x
  26. #define clsrc(t,k) "__kernel void\n\
  27. #define TYPE " str(t) "\n\
  28. #define K " str(k) "\n\
  29. life_update(int bz, __global const TYPE *old, __global TYPE *newp, int nx, int ny, int nz, int ldy, int ldz, int iter)\n\
  30. {\n\
  31. unsigned idx = get_global_id(0);\n\
  32. unsigned idy = get_global_id(1);\n\
  33. //unsigned idz = threadIdx.z + blockIdx.z * blockDim.z;\n\
  34. unsigned idz = 0;\n\
  35. unsigned stepx = get_global_size(0);\n\
  36. unsigned stepy = get_global_size(1);\n\
  37. //unsigned stepz = blockDim.z * gridDim.z;\n\
  38. unsigned stepz = 1;\n\
  39. unsigned x, y, z;\n\
  40. unsigned num, alive;\n\
  41. \n\
  42. for (z = iter + idz; z < nz - iter; z += stepz)\n\
  43. for (y = K + idy; y < ny - K; y += stepy) \n\
  44. {\n \
  45. for (x = K + idx; x < nx - K; x += stepx) \
  46. {\n \
  47. unsigned index = x + y*ldy + z*ldz;\n\
  48. num = 0\n\
  49. + old[index+1*ldy+0*ldz]\n\
  50. + old[index+1*ldy+1*ldz]\n\
  51. + old[index+0*ldy+1*ldz]\n\
  52. + old[index-1*ldy+1*ldz]\n\
  53. + old[index-1*ldy+0*ldz]\n\
  54. + old[index-1*ldy-1*ldz]\n\
  55. + old[index+0*ldy-1*ldz]\n\
  56. + old[index+1*ldy-1*ldz]\n\
  57. ;\n\
  58. alive = old[index];\n\
  59. alive = (alive && num == 2) || num == 3;\n\
  60. newp[index] = alive;\n\
  61. }\n\
  62. }\n\
  63. }"
  64. static const char * src = clsrc(TYPE,K);
  65. static struct starpu_opencl_program program;
  66. void
  67. opencl_life_init(void)
  68. {
  69. starpu_opencl_load_opencl_from_string(src, &program, NULL);
  70. }
  71. void opencl_life_free(void)
  72. {
  73. starpu_opencl_unload_opencl(&program);
  74. }
  75. void
  76. opencl_life_update_host(int bz, const TYPE *old, TYPE *newp, int nx, int ny, int nz, int ldy, int ldz, int iter)
  77. {
  78. #if 0
  79. size_t dim[] = {nx, ny, nz};
  80. #else
  81. size_t dim[] = {nx, ny, 1};
  82. #endif
  83. int devid,id;
  84. id = starpu_worker_get_id();
  85. devid = starpu_worker_get_devid(id);
  86. cl_kernel kernel;
  87. cl_command_queue cq;
  88. starpu_opencl_load_kernel(&kernel, &cq, &program, "life_update", devid);
  89. clSetKernelArg(kernel, 0, sizeof(bz), &bz);
  90. clSetKernelArg(kernel, 1, sizeof(old), &old);
  91. clSetKernelArg(kernel, 2, sizeof(newp), &newp);
  92. clSetKernelArg(kernel, 3, sizeof(nx), &nx);
  93. clSetKernelArg(kernel, 4, sizeof(ny), &ny);
  94. clSetKernelArg(kernel, 5, sizeof(nz), &nz);
  95. clSetKernelArg(kernel, 6, sizeof(ldy), &ldy);
  96. clSetKernelArg(kernel, 7, sizeof(ldz), &ldz);
  97. clSetKernelArg(kernel, 8, sizeof(iter), &iter);
  98. cl_event ev;
  99. clEnqueueNDRangeKernel(cq, kernel, 3, NULL, dim, NULL, 0, NULL, &ev);
  100. clWaitForEvents(1, &ev);
  101. starpu_opencl_collect_stats(ev);
  102. clReleaseEvent(ev);
  103. }