reformatted/improved some testapps

[libfirm] / ir / be / test / biggest_prime.c

diff --git a/ir/be/test/biggest_prime.c b/ir/be/test/biggest_prime.c
index 0f564f8..c7c7eb8 100644 (file)
--- a/ir/be/test/biggest_prime.c
+++ b/ir/be/test/biggest_prime.c
@@ -2,42 +2,49 @@ int m = 754974721, N, t[1 << 22], a, *p, i, e = 1 << 22, j, s, b, c, U;
 
 f (d)
 {
-  for (s = 1 << 23; s; s /= 2, d = d * 1L * d % m)
-    if (s < N)
-      for (p = t; p < t + N; p += s)
-        for (i = s, c = 1; i; i--)
-          b = *p + p[s], p[s] = (m + *p - p[s]) *
-          1L * c % m, *p++ = b % m, c = c * 1L * d % m;
-  for (j = 0; i < N - 1;)
-    {
-      for (s = N / 2; !((j ^= s) & s); s /= 2);
-      if (++i < j)
-        a = t[i], t[i] = t[j], t[j] = a;
-    }
+       for (s = 1 << 23; s; s /= 2, d = d * 1L * d % m)
+               if (s < N)
+                       for (p = t; p < t + N; p += s)
+                               for (i = s, c = 1; i; i--)
+                                       b = *p + p[s], p[s] = (m + *p - p[s]) *
+                                               1L * c % m, *p++ = b % m, c = c * 1L * d % m;
+
+       for (j = 0; i < N - 1;)
+       {
+               for (s = N / 2; !((j ^= s) & s); s /= 2)
+                       ;
+
+               if (++i < j)
+                       a = t[i], t[i] = t[j], t[j] = a;
+       }
 }
 
 int main ()
 {
-  *t = 2;
-  U = N = 1;
-  while (e /= 2)
-    {
-      N *= 2;
-      U = U * 1L * (m + 1) / 2 % m;
-      f (362);
-      for (p = t; p < t + N;)
-       *p++ = (*p * 1L ** p % m) * U % m;
-      f (415027540);
-      for (a = 0, p = t; p < t + N;)
-       a += (6972593 & e ? 2 : 1) ** p, *p++ = a % 10, a /= 10;
-    }
-  while (!*--p);
-  t[0]--;
+       *t = 2;
+       U = N = 1;
+
+       while (e /= 2) {
+               N *= 2;
+               U = U * 1L * (m + 1) / 2 % m;
+               f (362);
+               for (p = t; p < t + N;)
+                       *p++ = (*p * 1L ** p % m) * U % m;
+
+               f (415027540);
+               for (a = 0, p = t; p < t + N;)
+                       a += (6972593 & e ? 2 : 1) ** p, *p++ = a % 10, a /= 10;
+       }
+
+       while (!*--p)
+               ;
+
+       t[0]--;
        {
                int qs = 0;
-      while (p >= t)
-                               qs += *p--;
-    printf ("Checksumme = %d\n", qs);
+               while (p >= t)
+                       qs += *p--;
+               printf ("Checksumme = %d\n", qs);
        }
        return 0;
 }