From: Matthias Braun <matze@braunis.de>
Date: Thu, 3 Aug 2006 14:18:32 +0000 (+0000)
Subject: reindent source
X-Git-Url: http://nsz.repo.hu/git/?a=commitdiff_plain;h=7d94f3c504a69a449e6695fecb409a7fb26eb9f6;p=libfirm

reindent source
---

diff --git a/ir/be/test/Sieve.c b/ir/be/test/Sieve.c
index 9dd68d895..fb2e4189a 100644
--- a/ir/be/test/Sieve.c
+++ b/ir/be/test/Sieve.c
@@ -22,54 +22,54 @@ static int SIZE = 500; //8190;
 /* Gl: 8190 takes too long for continuous testing. */
 
 static void mark_count(int c) {
-    printf("number of primes in [2..%d) : %d (correct: 2..500: 95)\n", SIZE, c);
+	printf("number of primes in [2..%d) : %d (correct: 2..500: 95)\n", SIZE, c);
 }
 
 static void runSieve(void) {
-  int ITERATIONS = 100000;
-  boolean *flags;
-  int i, prime, k, iter, p;
-  int iterations = 0;
-  int count;
+	int ITERATIONS = 100000;
+	boolean *flags;
+	int i, prime, k, iter, p;
+	int iterations = 0;
+	int count;
 
-  flags = (void *)malloc(sizeof(*flags) * SIZE);
+	flags = (void *)malloc(sizeof(*flags) * SIZE);
 
-  // loop around for measurements
-  while(ITERATIONS > iterations) {
-    for(i = 0; i < SIZE; i++)
-      flags[i] = true;
-    for(i = 2; i < SIZE; i++) {
-      if(flags[i]) {
-	prime = i;
-	for(k = i + prime; k < SIZE; k += prime)
-	  flags[k] = false;
-      }
-    }
-    iterations++;
-  }
-  // test correctness
-  count = 0;
-  for(i = 2; i < SIZE; i++) {
-    if(true == flags[i]) {
-      count++;
-    }
-  }
-  mark_count(count);
+	// loop around for measurements
+	while(ITERATIONS > iterations) {
+		for(i = 0; i < SIZE; i++)
+			flags[i] = true;
+		for(i = 2; i < SIZE; i++) {
+			if(flags[i]) {
+				prime = i;
+				for(k = i + prime; k < SIZE; k += prime)
+					flags[k] = false;
+			}
+		}
+		iterations++;
+	}
+	// test correctness
+	count = 0;
+	for(i = 2; i < SIZE; i++) {
+		if(true == flags[i]) {
+			count++;
+		}
+	}
+	mark_count(count);
 }
 
 int main(int argc, char *argv[]) {
-  int i;
+	int i;
 
-  printf("Sieve.c\n");
+	printf("Sieve.c\n");
 
-  if (argc <= 1) {
-      printf("\nUsage: Sieve n\n");
-      printf("Continuing with default input.\n");
-  } else {
-      SIZE = atoi(argv[1]);
-  }
+	if (argc <= 1) {
+		printf("\nUsage: Sieve n\n");
+		printf("Continuing with default input.\n");
+	} else {
+		SIZE = atoi(argv[1]);
+	}
 
-  runSieve();
+	runSieve();
 
-  return 0;
+	return 0;
 }