polly/lib/External/isl/test_inputs/codegen/correlation.c

   1 for (int c0 = 0; c0 < m; c0 += 32)
   2   for (int c1 = (n >= 32 && m >= c0 + 2) || (m == 1 && c0 == 0) ? 0 : 32 * n - 32 * floord(31 * n + 31, 32); c1 <= ((n <= 0 && c0 == 0) || (m == 1 && n >= 1 && c0 == 0) ? max(0, n - 1) : n); c1 += 32)
   3     for (int c2 = c0; c2 <= (m >= 2 && c0 + 31 >= m && n >= c1 && c1 + 31 >= n ? 2 * m - 3 : (m >= 2 * c0 + 63 && c1 <= -32 && n >= c1 && c1 + 31 >= n) || (m >= c0 + 32 && 2 * c0 + 62 >= m && n >= c1 && c1 + 31 >= n) || (n >= 0 && c0 >= 32 && m >= 2 * c0 + 63 && c1 == n) || (m >= 63 && n >= 32 && c0 == 0 && c1 == n) ? 2 * c0 + 61 : m - 1); c2 += 32) {
   4       if (m >= 2) {
   5         if (n <= 0 && c0 == 0 && c1 == 0)
   6           for (int c5 = 0; c5 <= min(31, m - c2 - 1); c5 += 1)
   7             S_14(c2 + c5);
   8         if (n >= 0 && c1 == n) {
   9           for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
  10             for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
  11               S_29(-c0 + c2 - c3 + c5, c0 + c3);
  12         } else if (n >= c1 + 1 && c1 >= 0 && c1 + 31 >= n && c2 >= m) {
  13           for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
  14             for (int c5 = 0; c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
  15               S_29(-c0 + c2 - c3 + c5, c0 + c3);
  16         } else if (c1 <= -32 && n >= c1 && c1 + 31 >= n) {
  17           for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
  18             for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
  19               S_29(-c0 + c2 - c3 + c5, c0 + c3);
  20         } else if (n >= c1 + 1 && c1 >= 0 && m >= c2 + 1) {
  21           for (int c3 = 0; c3 <= min(min(31, m - c0 - 2), -c0 + c2 + 30); c3 += 1) {
  22             for (int c4 = 0; c4 <= min(31, n - c1 - 1); c4 += 1) {
  23               if (c0 == 0 && c2 == 0 && c3 == 0) {
  24                 if (c1 == 0 && c4 == 0)
  25                   S_14(0);
  26                 S_19(c1 + c4, 0);
  27               }
  28               for (int c5 = max(0, c0 - c2 + c3 + 1); c5 <= min(31, m - c2 - 1); c5 += 1) {
  29                 if (c0 == 0 && c1 == 0 && c3 == 0 && c4 == 0)
  30                   S_14(c2 + c5);
  31                 if (c0 == 0 && c3 == 0)
  32                   S_19(c1 + c4, c2 + c5);
  33                 S_27(c0 + c3, c2 + c5, c1 + c4);
  34               }
  35             }
  36             if (c1 + 31 >= n)
  37               for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
  38                 S_29(-c0 + c2 - c3 + c5, c0 + c3);
  39           }
  40         }
  41         if (c0 + 32 >= m && n >= c1 && c1 + 31 >= n) {
  42           for (int c5 = max(0, m - c2 - 1); c5 <= min(31, 2 * m - c2 - 3); c5 += 1)
  43             S_29(-m + c2 + c5 + 1, m - 1);
  44         } else if (m >= c0 + 33 && n >= c1 + 1 && c1 >= 0 && c1 + 31 >= n && c2 == c0) {
  45           S_29(0, c0 + 31);
  46         }
  47       } else if (c1 >= 32 && c2 == 0) {
  48         for (int c4 = 0; c4 <= min(31, n - c1 - 1); c4 += 1)
  49           S_19(c1 + c4, 0);
  50       } else if (c1 == 0 && c2 == 0) {
  51         S_14(0);
  52         for (int c4 = 0; c4 <= min(31, n - 1); c4 += 1)
  53           S_19(c4, 0);
  54       }
  55     }