sdcc/support/regression/tests/sieve.c

   1 /*
   2    sieve.c
   3
   4    This variant of the sieve of Eratosthenes was, following its 1981 publication in Byte Magazine,
   5    a popular benchmark for array acces throughout the 1980s and 1990s.
   6 */
   7
   8 #include <testfwk.h>
   9
  10 #if !defined (__SDCC_mcs51) && !defined (__SDCC_sm83) && !defined (__SDCC_pdk13) && !defined (__SDCC_pdk14) && !defined (__SDCC_pdk15) && !defined (__SDCC_pdk16) && !defined (__SDCC_stm8) && !defined (__SDCC_f8) // Lack of data memory
  11 #define true 1
  12 #define false 0
  13 #define size 8190
  14 #define sizepl 8191
  15 char flags[sizepl];
  16 #endif
  17 void testSieve() {
  18 #if !defined (__SDCC_mcs51) && !defined (__SDCC_sm83) && !defined (__SDCC_pdk13) && !defined (__SDCC_pdk14) && !defined (__SDCC_pdk15) && !defined (__SDCC_pdk16) && !defined (__SDCC_stm8) && !defined (__SDCC_f8) // Lack of data memory
  19     int i, prime, k, count, iter;
  20     for (iter = 1; iter <= 10; iter ++) {
  21         count=0 ;
  22         for (i = 0; i <= size; i++)
  23             flags[i] = true;
  24         for (i = 0; i <= size; i++) {
  25             if (flags[i]) {
  26                 prime = i + i + 3;
  27                 k = i + prime;
  28                 while (k <= size) {
  29                     flags[k] = false;
  30                     k += prime;
  31                 }
  32                 count = count + 1;
  33             }
  34         }
  35     }
  36     ASSERT (count == 1899);
  37 #endif
  38 }
  39