IterationGenerator.cpp 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. #include "IterationGenerator.h"
  2. #include "Mandel.h"
  3. #include "OpenClInternal.h"
  4. #include <omp.h>
  5. using mnd::IterationGenerator;
  6. using mnd::NaiveGenerator;
  7. using mnd::IterationFormula;
  8. IterationGenerator::IterationGenerator(IterationFormula z0, IterationFormula zi,
  9. mnd::Precision prec, mnd::CpuExtension ex) :
  10. mnd::MandelGenerator{ prec, ex },
  11. z0{ std::move(z0) },
  12. zi{ std::move(zi) }
  13. {
  14. }
  15. NaiveGenerator::NaiveGenerator(IterationFormula z0, IterationFormula zi,
  16. mnd::Precision prec, mnd::CpuExtension ex) :
  17. IterationGenerator{ std::move(z0), std::move(zi), prec, ex }
  18. {
  19. this->z0.optimize();
  20. this->zi.optimize();
  21. }
  22. void NaiveGenerator::generate(const mnd::MandelInfo& info, float* data)
  23. {
  24. const MandelViewport& view = info.view;
  25. const bool parallel = true;
  26. using T = double;
  27. T viewx = mnd::convert<T>(view.x);
  28. T viewy = mnd::convert<T>(view.y);
  29. T wpp = mnd::convert<T>(view.width / info.bWidth);
  30. T hpp = mnd::convert<T>(view.height / info.bHeight);
  31. #if defined(_OPENMP)
  32. if constexpr (parallel)
  33. omp_set_num_threads(omp_get_num_procs());
  34. # pragma omp parallel for schedule(static, 1) if (parallel)
  35. #endif
  36. for (long j = 0; j < info.bHeight; j++) {
  37. T y = viewy + T(double(j)) * hpp;
  38. long i = 0;
  39. for (i; i < info.bWidth; i++) {
  40. T x = viewx + T(double(i)) * wpp;
  41. T cx = x;
  42. T cy = y;
  43. std::complex<double> z = calc(*z0.expr, { 0, 0 }, { x, y });
  44. std::complex<double> c{ cx, cy };
  45. int k = 0;
  46. for (k = 0; k < info.maxIter; k++) {
  47. z = this->iterate(z, c);
  48. if (std::abs(z) >= 4)
  49. break;
  50. }
  51. data[i + j * info.bWidth] = float(k);
  52. /*if (info.smooth) {
  53. if (k >= info.maxIter)
  54. data[i + j * info.bWidth] = float(info.maxIter);
  55. else {
  56. float aapp = mnd::convert<float>(a);
  57. float bapp = mnd::convert<float>(b);
  58. data[i + j * info.bWidth] = ((float) k) + 1 - ::logf(::logf(aapp * aapp + bapp * bapp) / 2) / ::logf(2.0f);
  59. }
  60. }
  61. else
  62. data[i + j * info.bWidth] = k;*/
  63. }
  64. }
  65. }
  66. std::complex<double> NaiveGenerator::iterate(std::complex<double> z, std::complex<double> c)
  67. {
  68. auto& expr = *zi.expr;
  69. return calc(expr, z, c);
  70. }
  71. std::complex<double> NaiveGenerator::calc(mnd::Expression& expr, std::complex<double> z, std::complex<double> c)
  72. {
  73. std::complex<double> result = 0;
  74. std::visit([this, &result, z, c] (auto&& ex) {
  75. using T = std::decay_t<decltype(ex)>;
  76. if constexpr (std::is_same<T, mnd::Constant>::value) {
  77. result = std::complex{ mnd::convert<double>(ex.re), mnd::convert<double>(ex.im) };
  78. }
  79. else if constexpr (std::is_same<T, mnd::Variable>::value) {
  80. if (ex.name == "z")
  81. result = z;
  82. else if (ex.name == "c")
  83. result = c;
  84. else if (ex.name == "i")
  85. result = std::complex{ 0.0, 1.0 };
  86. }
  87. else if constexpr (std::is_same<T, mnd::Negation>::value) {
  88. result = -calc(*ex.operand, z, c);
  89. }
  90. else if constexpr (std::is_same<T, mnd::Addition>::value) {
  91. if (ex.subtraction)
  92. result = calc(*ex.left, z, c) - calc(*ex.right, z, c);
  93. else
  94. result = calc(*ex.left, z, c) + calc(*ex.right, z, c);
  95. }
  96. else if constexpr (std::is_same<T, mnd::Multiplication>::value) {
  97. result = calc(*ex.left, z, c) * calc(*ex.right, z, c);
  98. }
  99. else if constexpr (std::is_same<T, mnd::Division>::value) {
  100. result = calc(*ex.left, z, c) / calc(*ex.right, z, c);
  101. }
  102. else if constexpr (std::is_same<T, mnd::Pow>::value) {
  103. result = std::pow(calc(*ex.left, z, c), calc(*ex.right, z, c));
  104. }
  105. }, expr);
  106. return result;
  107. }
  108. #ifdef WITH_ASMJIT
  109. #include "ExecData.h"
  110. using mnd::CompiledGenerator;
  111. using mnd::CompiledGeneratorVec;
  112. CompiledGenerator::CompiledGenerator(std::unique_ptr<mnd::ExecData> execData,
  113. mnd::Precision prec, mnd::CpuExtension ex) :
  114. MandelGenerator{ prec, ex },
  115. execData{ std::move(execData) }
  116. {
  117. }
  118. CompiledGenerator::CompiledGenerator(CompiledGenerator&&) = default;
  119. CompiledGenerator::~CompiledGenerator(void)
  120. {
  121. }
  122. /*__declspec(noinline)
  123. int iter(double x, double y, int maxIter)
  124. {
  125. int k = 0;
  126. double a = x;
  127. double b = y;
  128. for (k = 0; k < maxIter; k++) {
  129. double aa = a * a;
  130. double bb = b * b;
  131. double abab = a * b + a * b;
  132. a = aa - bb + x;
  133. b = abab + y;
  134. if (aa + bb >= 16)
  135. break;
  136. }
  137. return k;
  138. }*/
  139. void CompiledGenerator::generate(const mnd::MandelInfo& info, float* data)
  140. {
  141. using IterFunc = int (*)(double, double, int);
  142. #if defined(_OPENMP)
  143. omp_set_num_threads(omp_get_num_procs());
  144. # pragma omp parallel for schedule(static, 1)
  145. #endif
  146. for (int i = 0; i < info.bHeight; i++) {
  147. double y = mnd::convert<double>(info.view.y + info.view.height * i / info.bHeight);
  148. for (int j = 0; j < info.bWidth; j++) {
  149. double x = mnd::convert<double>(info.view.x + info.view.width * j / info.bWidth);
  150. IterFunc iterFunc = asmjit::ptr_as_func<IterFunc>(this->execData->iterationFunc);
  151. int k = iterFunc(x, y, info.maxIter);
  152. data[i * info.bWidth + j] = float(k);
  153. }
  154. }
  155. }
  156. std::string CompiledGenerator::dump(void) const
  157. {
  158. asmjit::String d;
  159. execData->compiler->dump(d);
  160. return d.data();
  161. }
  162. CompiledGeneratorVec::CompiledGeneratorVec(std::unique_ptr<mnd::ExecData> execData) :
  163. CompiledGenerator{ std::move(execData), mnd::Precision::FLOAT, mnd::CpuExtension::X86_AVX }
  164. {
  165. }
  166. CompiledGeneratorVec::CompiledGeneratorVec(CompiledGeneratorVec&&) = default;
  167. CompiledGeneratorVec::~CompiledGeneratorVec(void)
  168. {
  169. }
  170. void CompiledGeneratorVec::generate(const mnd::MandelInfo& info, float* data)
  171. {
  172. using IterFunc = int (*)(float, float, float, int, float*);
  173. double dx = mnd::convert<double>(info.view.width / info.bWidth);
  174. #if defined(_OPENMP)
  175. omp_set_num_threads(omp_get_num_procs());
  176. # pragma omp parallel for schedule(static, 1)
  177. #endif
  178. for (int i = 0; i < info.bHeight; i++) {
  179. double y = mnd::convert<double>(info.view.y + info.view.height * i / info.bHeight);
  180. for (int j = 0; j < info.bWidth; j += 8) {
  181. double x = mnd::convert<double>(info.view.x + info.view.width * j / info.bWidth);
  182. float result[8];
  183. IterFunc iterFunc = asmjit::ptr_as_func<IterFunc>(this->execData->iterationFunc);
  184. int k = iterFunc(x, y, dx, info.maxIter-1, result);
  185. for (int k = 0; k < 8 && j + k < info.bWidth; k++)
  186. data[i * info.bWidth + j + k] = result[k];
  187. }
  188. }
  189. }
  190. #endif // WITH_ASMJIT
  191. #ifdef WITH_OPENCL
  192. using mnd::CompiledClGenerator;
  193. using mnd::CompiledClGeneratorDouble;
  194. CompiledClGenerator::CompiledClGenerator(mnd::MandelDevice& device, const std::string& code) :
  195. ClGeneratorFloat{ device, code }
  196. {
  197. kernel = cl::Kernel(program, "iterate");
  198. }
  199. void CompiledClGenerator::generate(const mnd::MandelInfo& info, float* data)
  200. {
  201. ::size_t bufferSize = info.bWidth * info.bHeight * sizeof(float);
  202. cl::Buffer buffer_A(context, CL_MEM_WRITE_ONLY, bufferSize);
  203. float pixelScaleX = float(info.view.width / info.bWidth);
  204. float pixelScaleY = float(info.view.height / info.bHeight);
  205. //static cl::Kernel iterate = cl::Kernel(program, "iterate");
  206. kernel.setArg(0, buffer_A);
  207. kernel.setArg(1, int(info.bWidth));
  208. kernel.setArg(2, float(info.view.x));
  209. kernel.setArg(3, float(info.view.y));
  210. kernel.setArg(4, float(pixelScaleX));
  211. kernel.setArg(5, float(pixelScaleY));
  212. kernel.setArg(6, int(info.maxIter));
  213. kernel.setArg(7, int(info.smooth ? 1 : 0));
  214. kernel.setArg(8, int(info.julia ? 1 : 0));
  215. kernel.setArg(9, float(info.juliaX));
  216. kernel.setArg(10, float(info.juliaY));
  217. queue.enqueueNDRangeKernel(kernel, 0, cl::NDRange(info.bWidth * info.bHeight));
  218. queue.enqueueReadBuffer(buffer_A, CL_TRUE, 0, bufferSize, data);
  219. }
  220. CompiledClGeneratorDouble::CompiledClGeneratorDouble(mnd::MandelDevice& device, const std::string& code) :
  221. ClGeneratorDouble{ device, code }
  222. {
  223. }
  224. #endif // WITH_OPENCL