chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/nbody.gcc-3.gcc

@@ -1,142 +0,0 @@
-/*
- * The Computer Language Benchmarks Game
- * http://shootout.alioth.debian.org/
- *
- * Contributed by Christoph Bauer
- * modified by Jorge Peixoto de Morais Neto
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-#include <err.h>
-
-#define SOLAR_MASS (4 * M_PI * M_PI)
-
-/*power-of-two alignment helps when indexing arrays */
-struct __attribute__ ((aligned(64))) planet_t {
-    double x, y, z;
-    double vx, vy, vz;
-    double mass;
-};
-typedef struct planet_t planet_t;
-
-static void advance (planet_t *bodies, int nb, double dt) {
-    int i, j;
-    for (i = nb - 1; i >= 0; i--) 
-     	for (j = 0; j < i; j++) { 
-    	    double dx = bodies[i].x - bodies[j].x;
-     	    double dy = bodies[i].y - bodies[j].y;
-     	    double dz = bodies[i].z - bodies[j].z;
-     	    double distance = sqrt (dx * dx + dy * dy + dz * dz);
-     	    double mag = dt / (distance * distance * distance);
-     	    bodies[i].vx -= bodies[j].mass * mag * dx;
-     	    bodies[i].vy -= bodies[j].mass * mag * dy;
-     	    bodies[i].vz -= bodies[j].mass * mag * dz;
-     	    bodies[j].vy += bodies[i].mass * mag * dy;
-     	    bodies[j].vz += bodies[i].mass * mag * dz;
-     	    bodies[j].vx += bodies[i].mass * mag * dx;
-     	}
-
-    for (i = nb - 1; i >= 0; i--) { 
-     	bodies[i].x += dt * bodies[i].vx; 
-     	bodies[i].y += dt * bodies[i].vy; 
-     	bodies[i].z += dt * bodies[i].vz;
-    } 
-}
-
-static inline double energy (planet_t const *bodies, int nb) {
-    double e = 0.0;
-    int i, j; 
-    for (i = nb - 1; i >= 0; i--)
-     	e += bodies[i].mass *
-	    (bodies[i].vx * bodies[i].vx + bodies[i].vy * bodies[i].vy + bodies[i].vz * bodies[i].vz); 
-
-    e /= 2;
-    for (i = nb - 1; i >= 0; i--) 
-	for (j = 0; j < i; j++) {
-	    double dx = bodies[i].x - bodies[j].x;  
-      	    double dy = bodies[i].y - bodies[j].y;  
-      	    double dz = bodies[i].z - bodies[j].z;  
-      	    double distance = sqrt (dx * dx + dy * dy + dz * dz);  
-      	    e -= bodies[i].mass * bodies[j].mass / distance;  
-      	} 
-    return e;
-}
-
-static inline void offset_momentum (planet_t *bodies, int nb) {
-    double py = 0.0, pz = 0.0, px = 0.0;
-    int i;
-    for (i = nb - 1; i >= 0; i--) {
-	py += bodies[i].vy * bodies[i].mass;
-	pz += bodies[i].vz * bodies[i].mass;
-	px += bodies[i].vx * bodies[i].mass;
-    }
-    /*bodies[0] is the Sun*/
-    bodies[0].vx = -px / SOLAR_MASS;
-    bodies[0].vy = -py / SOLAR_MASS;
-    bodies[0].vz = -pz / SOLAR_MASS;
-}
-
-int main (int argc, char **argv) {
-#define NBODIES 5
-#define DAYS_PER_YEAR 365.24
-    static planet_t bodies[NBODIES] = {
-	{                               /* sun */
-	    0, 0, 0, 0, 0, 0, SOLAR_MASS
-	},
-	{                               /* jupiter */
-	    4.84143144246472090e+00,
-	    -1.16032004402742839e+00,
-	    -1.03622044471123109e-01,
-	    1.66007664274403694e-03 * DAYS_PER_YEAR,
-	    7.69901118419740425e-03 * DAYS_PER_YEAR,
-	    -6.90460016972063023e-05 * DAYS_PER_YEAR,
-	    9.54791938424326609e-04 * SOLAR_MASS
-	},
-	{                               /* saturn */
-	    8.34336671824457987e+00,
-	    4.12479856412430479e+00,
-	    -4.03523417114321381e-01,
-	    -2.76742510726862411e-03 * DAYS_PER_YEAR,
-	    4.99852801234917238e-03 * DAYS_PER_YEAR,
-	    2.30417297573763929e-05 * DAYS_PER_YEAR,
-	    2.85885980666130812e-04 * SOLAR_MASS
-	},
-	{                               /* uranus */
-	    1.28943695621391310e+01,
-	    -1.51111514016986312e+01,
-	    -2.23307578892655734e-01,
-	    2.96460137564761618e-03 * DAYS_PER_YEAR,
-	    2.37847173959480950e-03 * DAYS_PER_YEAR,
-	    -2.96589568540237556e-05 * DAYS_PER_YEAR,
-	    4.36624404335156298e-05 * SOLAR_MASS
-	},
-	{                               /* neptune */
-	    1.53796971148509165e+01,
-	    -2.59193146099879641e+01,
-	    1.79258772950371181e-01,
-	    2.68067772490389322e-03 * DAYS_PER_YEAR,
-	    1.62824170038242295e-03 * DAYS_PER_YEAR,
-	    -9.51592254519715870e-05 * DAYS_PER_YEAR,
-	    5.15138902046611451e-05 * SOLAR_MASS
-	}
-    };
-    long n = 1000;
-    if (argc >= 2) {
-	char *tail;
-	char const *arg = argv[1];
-	n = strtol (arg, &tail, 0);
-	if (tail == arg)
-	    errx (1, "Could no convert \"%s\" to a long integer", arg);
-    }
-
-    offset_momentum (bodies, NBODIES);
-    printf ("%.9f\n", energy (bodies, NBODIES));
-    long i;
-    for (i = n; i > 0; i--)
-	advance (bodies, NBODIES, 0.01);
-
-    printf ("%.9f\n", energy (bodies, NBODIES));
-    return 0;
-}

data/sources/gcc/nestedloop.gcc

@@ -1,25 +0,0 @@
-/* -*- mode: c -*-
- * $Id: nestedloop.gcc,v 1.1.1.1 2004-05-19 18:10:56 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <unistd.h>
-
-int
-main(int argc, char *argv[]) {
-    int n = ((argc == 2) ? atoi(argv[1]) : 1);
-    int a, b, c, d, e, f, x=0;
-	
-    for (a=0; a<n; a++)
-	for (b=0; b<n; b++)
-	    for (c=0; c<n; c++)
-		for (d=0; d<n; d++)
-		    for (e=0; e<n; e++)
-			for (f=0; f<n; f++)
-			    x++;
-
-    printf("%d\n", x);
-    return(0);
-}

data/sources/gcc/nsieve.gcc

@@ -1,35 +0,0 @@
-// The Computer Language Shootout
-// http://shootout.alioth.debian.org/
-// Precedent C entry modified by bearophile for speed and size, 31 Jan 2006
-// Compile with:  -O3 -s -std=c99 -fomit-frame-pointer
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-typedef unsigned char boolean;
-
-
-static void nsieve(int m) {
-    unsigned int count = 0, i, j;
-    boolean * flags = (boolean *) malloc(m * sizeof(boolean));
-    memset(flags, 1, m);
-
-    for (i = 2; i < m; ++i)
-        if (flags[i]) {
-            ++count;
-            for (j = i << 1; j < m; j += i)
-//                if (flags[j]) 
-                   flags[j] = 0;
-    }
-
-    free(flags);
-    printf("Primes up to %8u %8u\n", m, count);
-}
-
-int main(int argc, char * argv[]) {
-    int m = atoi(argv[1]);
-    for (int i = 0; i < 3; i++)
-        nsieve(10000 << (m-i));
-    return 0;
-}

data/sources/gcc/nsievebits.gcc-2.gcc

@@ -1,37 +0,0 @@
-/*
-** The Great Computer Language Shootout
-** http://shootout.alioth.debian.org/
-** contributed by Mike Pall
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-typedef unsigned int bits;
-#define BBITS		(sizeof(bits) * 8)
-#define BSIZE(x)	(((x) / 8) + sizeof(bits))
-#define BMASK(x)	(1 << ((x) % BBITS))
-#define BTEST(p, x)	((p)[(x) / BBITS] & BMASK(x))
-#define BFLIP(p, x)	(p)[(x) / BBITS] ^= BMASK(x)
-
-int main(int argc, char **argv)
-{
-  unsigned int m, sz = 10000 << (argc > 1 ? atoi(argv[1]) : 1);
-  bits *primes = (bits *)malloc(BSIZE(sz));
-  if (!primes) return 1;
-  for (m = 0; m <= 2; m++) {
-    unsigned int i, j, count = 0, n = sz >> m;
-    memset(primes, 0xff, BSIZE(n));
-    for (i = 2; i <= n; i++)
-      if (BTEST(primes, i)) {
-	count++;
-	for (j = i + i; j <= n; j += i)
-	  if (BTEST(primes, j)) BFLIP(primes, j);
-      }
-    printf("Primes up to %8d %8d\n", n, count);
-  }
-  free(primes);
-  return 0;
-}
-

data/sources/gcc/nsievebits.gcc-3.gcc

@@ -1,53 +0,0 @@
-// The Computer Language Shootout
-// http://shootout.alioth.debian.org/
-// Precedent C entry modified by bearophile for speed and size, 31 Jan 2006
-// Modified to use bits to hold state by mukund
-// Compile with:  gcc -pipe -Wall -O3 -funroll-all-loops -march=athlon64 -m3dnow nsieve.c -o nsieve
-
-#include <stdio.h>
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define INDEX_INT(i) ((i) >> 5)
-#define INDEX_BIT(i) (1 << ((i) & 0x1f))
-#define INDEX_BITMASK(i) (~INDEX_BIT(i))
-
-int
-main (int argc, char *argv[])
-{
-  int n = atoi (argv[1]);
-  unsigned int count1 = 0, count2 = 0, count4 = 0;
-  unsigned int i, j, m, m2;
-  uint32_t *flags;
-
-  m = 10000 << n;
-
-  flags = (uint32_t *) malloc ((m / sizeof (uint32_t)) + 1);
-  memset (flags, 0xff, (m / sizeof (uint32_t)) + 1);
-
-  for (i = 2; i < m; ++i)
-    {
-      if (flags[INDEX_INT (i)] & INDEX_BIT (i))
-        {
-          for (j = i * 2; j <= m; j += i)
-            flags[INDEX_INT (j)] &= INDEX_BITMASK (j);
-
-          ++count1;
-          m2 = m >> 1;
-          if (i < m2)
-            ++count2;
-          m2 = m2 >> 1;
-          if (i < m2)
-            ++count4;
-        }
-    }
-
-  printf ("Primes up to %8u %8u\n", m, count1);
-  printf ("Primes up to %8u %8u\n", m / 2, count2);
-  printf ("Primes up to %8u %8u\n", m / 4, count4);
-
-  free (flags);
-
-  return 0;
-}

data/sources/gcc/objinst.gcc

@@ -1,95 +0,0 @@
-/* -*- mode: c -*-
- * $Id: objinst.gcc,v 1.1.1.1 2004-05-19 18:11:02 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-
-enum {false, true};
-
-#define TOGGLE \
-    char state; \
-    char (*value)(struct Toggle *); \
-    struct Toggle *(*activate)(struct Toggle *)
-
-#define DESTROY  free
-
-typedef struct Toggle {
-    TOGGLE;
-} Toggle;
-
-char toggle_value(Toggle *this) {
-    return(this->state);
-}
-Toggle *toggle_activate(Toggle *this) {
-    this->state = !this->state;
-    return(this);
-}
-Toggle *init_Toggle(Toggle *this, char start_state) {
-    this->state = start_state;
-    this->value = toggle_value;
-    this->activate = toggle_activate;
-    return(this);
-}
-Toggle *new_Toggle(char start_state) {
-    Toggle *this = (Toggle *)malloc(sizeof(Toggle));
-    return(init_Toggle(this, start_state));
-}
-
-
-typedef struct NthToggle {
-    TOGGLE;
-    int count_max;
-    int counter;
-} NthToggle;
-
-NthToggle *nth_toggle_activate(NthToggle *this) {
-    if (++this->counter >= this->count_max) {
-	this->state = !this->state;
-	this->counter = 0;
-    }
-    return(this);
-}
-NthToggle *init_NthToggle(NthToggle *this, int max_count) {
-    this->count_max = max_count;
-    this->counter = 0;
-    this->activate = (Toggle *(*)(Toggle *))nth_toggle_activate;
-    return(this);
-}
-NthToggle *new_NthToggle(char start_state, int max_count) {
-    NthToggle *this = (NthToggle *)malloc(sizeof(NthToggle));
-    this = (NthToggle *)init_Toggle((Toggle *)this, start_state);
-    return(init_NthToggle(this, max_count));
-}
-
-
-int main(int argc, char *argv[]) {
-    int i, n = ((argc == 2) ? atoi(argv[1]) : 1);
-    Toggle *tog;
-    NthToggle *ntog;
-
-    tog = new_Toggle(true);
-    for (i=0; i<5; i++) {
-	fputs((tog->activate(tog)->value(tog)) ? "true\n" : "false\n", stdout);
-    }
-    DESTROY(tog);
-    for (i=0; i<n; i++) {
-	tog = new_Toggle(true);
-	DESTROY(tog);
-    }
-    
-    fputs("\n", stdout);
-
-    ntog = new_NthToggle(true, 3);
-    for (i=0; i<8; i++) {
-	fputs((ntog->activate(ntog)->value(ntog)) ? "true\n" : "false\n", stdout);
-    }
-    DESTROY(ntog);
-    for (i=0; i<n; i++) {
-	ntog = new_NthToggle(true, 3);
-	DESTROY(ntog);
-    }
-    return 0;
-}

data/sources/gcc/partialsums.gcc

@@ -1,86 +0,0 @@
-/*
-** The Great Computer Language Shootout
-** http://shootout.alioth.debian.org/
-** contributed by Mike Pall
-**
-** compile with:
-**   gcc -O3 -fomit-frame-pointer -ffast-math -o partialsums partialsums.c -lm
-**   Adding -march=<yourcpu> may help, too.
-**   On a P4/K8 or later try adding: --march=<yourcpu> -mfpmath=sse -msse2 
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-
-int main(int argc, char **argv)
-{
-  int k, n = atoi(argv[1]);
-  double sum;
-
-/*
-** Yes, I tried using a double as a primary or secondary loop variable.
-** But the x86 ABI requires a cleared x87 FPU stack before every call
-** (e.g. to sin()) which nullifies any performance gains.
-**
-** Combining all loops does not pay off because the x87 FPU has to shuffle
-** stack slots and/or runs out of registers. This may not be entirely true
-** for SSE2 with fully inlined FPU code (-ffast-math required). Dito for
-** other CPUs with a register-based FPU and a sane FP ABI.
-**
-** Auto vectorization may be a bit easier with separate loops, too.
-*/
-#define kd ((double)k)
-
-  sum = 0.0;
-  for (k = 0; k <= n; k++) {  /* pow(2.0/3.0, kd) inlined */
-    double x = 1.0, q = 2.0/3.0;
-    int j = k;
-    for (;;) { if (j & 1) x *= q; if ((j >>= 1) == 0) break; q = q*q; }
-    sum += x;
-  }
-  printf("%.9f\t(2/3)^k\n", sum);
-
-  sum = 0.0;
-  for (k = 1 ; k <= n; k++) sum += 1/sqrt(kd);  /* aka pow(kd, -0.5) */
-  printf("%.9f\tk^-0.5\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n; k++) sum += 1.0/(kd*(kd+1.0));
-  printf("%.9f\t1/k(k+1)\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n; k++) {
-    double sk = sin(kd);
-    sum += 1.0/(kd*kd*kd*sk*sk);
-  }
-  printf("%.9f\tFlint Hills\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n; k++) {
-    double ck = cos(kd);
-    sum += 1.0/((kd*kd)*kd*ck*ck);
-  }
-  printf("%.9f\tCookson Hills\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n; k++) sum += 1.0/kd;
-  printf("%.9f\tHarmonic\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n; k++) sum += 1.0/(kd*kd);
-  printf("%.9f\tRiemann Zeta\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= n-1; k += 2) sum += 1.0/kd;
-  for (k = 2; k <= n; k += 2) sum -= 1.0/kd;
-  printf("%.9f\tAlternating Harmonic\n", sum);
-
-  sum = 0.0;
-  for (k = 1; k <= 2*n-1; k += 4) sum += 1.0/kd;
-  for (k = 3; k <= 2*n; k += 4) sum -= 1.0/kd;
-  printf("%.9f\tGregory\n", sum);
-
-  return 0;
-}
-