simd-7.c 1.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
  1. /* { dg-do run } */
  2. /* { dg-additional-options "-msse2" { target sse2_runtime } } */
  3. /* { dg-additional-options "-mavx" { target avx_runtime } } */
  4. extern void abort ();
  5. int a[1024] __attribute__((aligned (32))) = { 1 };
  6. int b[1024] __attribute__((aligned (32))) = { 1 };
  7. int k, m;
  8. struct U { int u; };
  9. struct V { int v; };
  10. __attribute__((noinline, noclone)) int
  11. foo (int *p)
  12. {
  13. int i, s = 0;
  14. struct U u;
  15. struct V v;
  16. #pragma omp simd aligned(a, p : 32) linear(k: m + 1) \
  17. linear(i) reduction(+:s) lastprivate(u, v)
  18. for (i = 0; i < 1024; i++)
  19. {
  20. int *q = &i;
  21. a[i] *= p[i];
  22. u.u = p[i] + k;
  23. k += m + 1;
  24. v.v = p[i] + k;
  25. s += p[i] + k;
  26. }
  27. if (u.u != 36 + 4 + 3 * 1023 || v.v != 36 + 4 + 3 * 1024 || i != 1024)
  28. abort ();
  29. return s;
  30. }
  31. __attribute__((noinline, noclone)) int
  32. bar (int *p)
  33. {
  34. int i, s = 0;
  35. struct U u;
  36. struct V v;
  37. #pragma omp simd aligned(a, p : 32) linear(k: m + 1) \
  38. reduction(+:s) lastprivate(u, v)
  39. for (i = 0; i < 1024; i++)
  40. {
  41. int *q = &i;
  42. a[i] *= p[i];
  43. u.u = p[i] + k;
  44. k += m + 1;
  45. v.v = p[i] + k;
  46. s += p[i] + k;
  47. }
  48. if (u.u != 36 + 4 + 3 * 1023 || v.v != 36 + 4 + 3 * 1024 || i != 1024)
  49. abort ();
  50. return s;
  51. }
  52. int
  53. main ()
  54. {
  55. #if __SIZEOF_INT__ >= 4
  56. int i;
  57. k = 4;
  58. m = 2;
  59. for (i = 0; i < 1024; i++)
  60. {
  61. a[i] = i - 512;
  62. b[i] = (i - 51) % 39;
  63. }
  64. int s = foo (b);
  65. for (i = 0; i < 1024; i++)
  66. {
  67. if (b[i] != (i - 51) % 39
  68. || a[i] != (i - 512) * b[i])
  69. abort ();
  70. }
  71. if (k != 4 + 3 * 1024 || s != 1596127)
  72. abort ();
  73. k = 4;
  74. m = 2;
  75. for (i = 0; i < 1024; i++)
  76. {
  77. a[i] = i - 512;
  78. b[i] = (i - 51) % 39;
  79. }
  80. s = bar (b);
  81. for (i = 0; i < 1024; i++)
  82. {
  83. if (b[i] != (i - 51) % 39
  84. || a[i] != (i - 512) * b[i])
  85. abort ();
  86. }
  87. if (k != 4 + 3 * 1024 || s != 1596127)
  88. abort ();
  89. #endif
  90. return 0;
  91. }