X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Ftest%2Flangshootout%2Frecursive.c;h=7f1b1a031a04148575377ed0ca584efb1751dfbb;hb=205396c4f4f5abe7abd6dc2350c8c398a7623afc;hp=cefabad085b8e687a58b95e36e8f97e03558a7e8;hpb=5272152e251ab5cb2f883aa711a25272adbc3bfa;p=libfirm

diff --git a/ir/be/test/langshootout/recursive.c b/ir/be/test/langshootout/recursive.c
index cefabad08..7f1b1a031 100644
--- a/ir/be/test/langshootout/recursive.c
+++ b/ir/be/test/langshootout/recursive.c
@@ -3,7 +3,7 @@
 // recursive test, by bearophile, Jan 24 2006
 // Compile with: -O3 -s -fomit-frame-pointer -funroll-loops
 
-#include <stdio.h>
+//#include <stdio.h>
 
 int Ack(int x, int y) {
     if (x == 0)
@@ -26,6 +26,7 @@ double FibFP(double n) {
 }
 
 int Tak(int x, int y, int z) {
+	printf("X %d Y %d Z %d\n", x, y, z);
     if (y < x)
         return Tak( Tak(x-1, y, z), Tak(y-1, z, x), Tak(z-1, x, y) );
     return z;
@@ -45,7 +46,9 @@ int main(int argc, char **argv) {
     printf("Ack(3,%d): %d\n", n+1, Ack(3, n+1));
     printf("Fib(%.1f): %.1f\n", 28.0+n, FibFP(28.0+n));
     printf("Tak(%d,%d,%d): %d\n", 3*n, 2*n, n, Tak(3*n, 2*n, n));
-    printf("Fib(3): %d\n", Fib(3));
-    printf("Tak(3.0,2.0,1.0): %.1f\n", TakFP(3.0, 2.0, 1.0));
+#if 0
+    fprintf(stderr, "Fib(3): %d\n", Fib(3));
+    fprintf(stderr, "Tak(3.0,2.0,1.0): %.1f\n", TakFP(3.0, 2.0, 1.0));
+#endif
     return 0;
 }