3 * File name: test/Sieve.c
4 * Purpose: Eratosthenes Sieve prime number benchmark in Java
5 * Author: Boris Boesler
6 * Modified by: Michael Beck (for GCC-firm)
9 * Copyright: (c) 2001 Universitaet Karlsruhe
21 static int SIZE = 500; //8190;
22 /* Gl: 8190 takes too long for continuous testing. */
24 static void mark_count(int c) {
25 printf("number of primes in [2..%d) : %d (correct: 2..500: 95)\n", SIZE, c);
28 static void runSieve(void) {
29 int ITERATIONS = 100000;
31 int i, prime, k, iter, p;
35 flags = (void *)malloc(sizeof(*flags) * SIZE);
37 // loop around for measurements
38 while(ITERATIONS > iterations) {
39 for(i = 0; i < SIZE; i++)
41 for(i = 2; i < SIZE; i++) {
44 for(k = i + prime; k < SIZE; k += prime)
52 for(i = 2; i < SIZE; i++) {
53 if(true == flags[i]) {
60 int main(int argc, char *argv[]) {
66 printf("\nUsage: Sieve n\n");
67 printf("Continuing with default input.\n");