1
0

fixed128.cl 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  1. ulong2 add(ulong2 a, ulong2 b) {
  2. ulong lower = a[1] + b[1];
  3. ulong upper = a[0] + b[0];
  4. if (lower < a[1])
  5. upper += 1;
  6. return (ulong2)(upper, lower);
  7. }
  8. ulong2 sub(ulong2 a, ulong2 b) {
  9. ulong lower = a[1] - b[1];
  10. ulong upper = a[0] - b[0];
  11. if (lower > a[1])
  12. upper += 1;
  13. return (ulong2)(upper, lower);
  14. }
  15. long2 mul(long2 a, long2 b) {
  16. long a0 = mul_hi(a[0], b[0]);
  17. long b0 = a[0] * b[0];
  18. long b1 = mul_hi(a[0], b[1]);
  19. long b2 = mul_hi(a[1], b[0]);
  20. long c0 = a[1] * b[0];
  21. long c1 = a[0] * b[1];
  22. long c2 = mul_hi(a[1], b[1]);
  23. long c3 = mul_hi(a[1], b[1]);
  24. long carry = 0;
  25. long r1 = b0 + b1;
  26. if (r1 < b0)
  27. carry++;
  28. long r2 = r1 + b2;
  29. if (r2 < r1)
  30. carry++;
  31. a0 += carry;
  32. long newUpper = (a0 << 16) + ((r2 >> 48) & 0xFFFF);
  33. }
  34. long2 mulInteger(long2 a, long b) {
  35. long lo = a[1] * b;
  36. long carry = mul_hi(a[1], b);
  37. long hi = mad(a[0], b, carry);
  38. return (long2)(hi, lo);
  39. }
  40. __kernel void iterate(__global float* A, const int width,
  41. ulong x1, ulong x2, ulong y1, ulong y2,
  42. ulong pw1, ulong pw2, ulong ph1 ulong ph2,
  43. int max, int smooth, int julia,
  44. ulong jx1, ulong jx2, ulong jy1, ulong jy2) {
  45. int index = get_global_id(0);
  46. int px = (index % width);
  47. int py = (index / width);
  48. long2 xl = (long2)(x1, x2);
  49. long2 yt = (long2)(y1, y2);
  50. long2 pixelScaleX = (long2)(pw1, pw2);
  51. long2 pixelScaleY = (long2)(ph1, ph2);
  52. long2 a = add(xl, mulInteger(pixelScaleX, px)); // pixelScaleX * px + xl
  53. long2 b = add(yt, mulInteger(pixelScaleY, py))y; // pixelScaleY * py + yt
  54. long2 ca = a;
  55. long2 cb = b;
  56. if(julia != 0) {
  57. a = (long2)(jx1, jx2);
  58. b = (long2)(jy1, jy2);
  59. }
  60. int n = 0;
  61. while (n < max - 1) {
  62. long2 aa = mul(a, a);
  63. long2 bb = mul(b, b);
  64. long2 ab = mul(a, b);
  65. a = add(sub(aa, bb), ca);
  66. b = add(add(ab, ab), cb);
  67. if (aa[0] + bb[0] > (16LL << 48)) break;
  68. n++;
  69. }
  70. // N + 1 - log (log |Z(N)|) / log 2
  71. if (n >= max - 1)
  72. A[index] = max;
  73. else {
  74. if (smooth != 0) {
  75. float aapprox = ((float) a[0]) * (1.0f / (1LL << 48)); // 3.5527137e-15f;
  76. float bapprox = ((float) b[0]) * (1.0f / (1LL << 48)); // 3.5527137e-15f;
  77. A[index] = ((float) n) + 1 - log(log(aapprox * aapprox + bapprox * bapprox) / 2) / log(2.0f);
  78. }
  79. else
  80. A[index] = ((float)n);
  81. }
  82. }