scan-6.C 1.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. // { dg-require-effective-target size32plus }
  2. extern "C" void abort ();
  3. int r, a[1024], b[1024], q;
  4. template <typename T, typename U>
  5. __attribute__((noipa)) void
  6. foo (T a, T b, U r)
  7. {
  8. #pragma omp for reduction (inscan, +:r)
  9. for (int i = 0; i < 1024; i++)
  10. {
  11. b[i] = r;
  12. #pragma omp scan exclusive(r)
  13. r += a[i];
  14. }
  15. }
  16. template <typename T>
  17. __attribute__((noipa)) T
  18. bar ()
  19. {
  20. T &s = q;
  21. q = 0;
  22. #pragma omp parallel
  23. #pragma omp for reduction (inscan, +:s)
  24. for (int i = 0; i < 1024; i++)
  25. {
  26. b[i] = s;
  27. #pragma omp scan exclusive(s)
  28. s += 2 * a[i];
  29. }
  30. return s;
  31. }
  32. template <typename T>
  33. __attribute__((noipa)) void
  34. baz (T *a, T *b, T &r)
  35. {
  36. #pragma omp parallel for reduction (inscan, +:r)
  37. for (T i = 0; i < 1024; i++)
  38. {
  39. b[i] = r;
  40. #pragma omp scan exclusive(r)
  41. r += a[i];
  42. }
  43. }
  44. template <typename T>
  45. __attribute__((noipa)) int
  46. qux ()
  47. {
  48. T s = q;
  49. q = 0;
  50. #pragma omp parallel for reduction (inscan, +:s)
  51. for (int i = 0; i < 1024; i++)
  52. {
  53. b[i] = s;
  54. #pragma omp scan exclusive(s)
  55. s += 2 * a[i];
  56. }
  57. return s;
  58. }
  59. int
  60. main ()
  61. {
  62. int s = 0;
  63. for (int i = 0; i < 1024; ++i)
  64. {
  65. a[i] = i;
  66. b[i] = -1;
  67. asm ("" : "+g" (i));
  68. }
  69. #pragma omp parallel
  70. foo<int *, int &> (a, b, r);
  71. if (r != 1024 * 1023 / 2)
  72. abort ();
  73. for (int i = 0; i < 1024; ++i)
  74. {
  75. if (b[i] != s)
  76. abort ();
  77. else
  78. b[i] = 25;
  79. s += i;
  80. }
  81. if (bar<int> () != 1024 * 1023)
  82. abort ();
  83. s = 0;
  84. for (int i = 0; i < 1024; ++i)
  85. {
  86. if (b[i] != s)
  87. abort ();
  88. else
  89. b[i] = -1;
  90. s += 2 * i;
  91. }
  92. r = 0;
  93. baz<int> (a, b, r);
  94. if (r != 1024 * 1023 / 2)
  95. abort ();
  96. s = 0;
  97. for (int i = 0; i < 1024; ++i)
  98. {
  99. if (b[i] != s)
  100. abort ();
  101. else
  102. b[i] = -25;
  103. s += i;
  104. }
  105. if (qux<int &> () != 1024 * 1023)
  106. abort ();
  107. s = 0;
  108. for (int i = 0; i < 1024; ++i)
  109. {
  110. if (b[i] != s)
  111. abort ();
  112. s += 2 * i;
  113. }
  114. }