chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/partialsums.gcc-3.gcc

@@ -1,81 +0,0 @@
-/*
-** The Computer Language Shootout
-** http://shootout.alioth.debian.org/
-** contributed by Mike Pall
-** de-optimized by Isaac Gouy
-**
-** 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, a;
-
-/*
-** Yes, I (Mike Pall) 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++) sum += pow(2.0/3.0, kd);
-  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; a = -1.0;
-  for (k = 1; k <= n; k++) sum += (a = -a)/kd;
-  printf("%.9f\tAlternating Harmonic\n", sum);
-
-  sum = 0.0;  a = -1.0;
-  for (k = 1; k <= n; k++) sum += (a = -a)/(2.0*kd - 1.0);
-  printf("%.9f\tGregory\n", sum);
-
-  return 0;
-}
-

data/sources/gcc/partialsums.gcc-4.gcc

@@ -1,68 +0,0 @@
-//  The Computer Language Shootout
-//  http://shootout.alioth.debian.org/
-//  contributed by Greg Buchholz
-//  
-//  compile with:  -O3 -msse2 -lm
-
-#include<math.h>
-#include<stdio.h>
-
-typedef double v2df __attribute__ ((vector_size (16)));
-
-v2df make_vec(double a, double b)
-{
-    v2df v;
-    double *tmp;
-    tmp = (double *)&v; *(tmp) = a; *(tmp+1) = b;
-    return v;
-}
-
-double sum_vec(v2df x)
-{
-    double *tmp = (double *)&x; 
-    return *(tmp) + *(tmp+1);
-}
-
-int main(int argc, char* argv[])
-{
-    double  twoThrd = 0, sqrts = 0, Flint = 0, Cookson = 0;
-    v2df    Harmonic, zeta, poly, alt, Gregory;
-    v2df    zero, one, two, init, m_one, kv, av;
-    
-    double  k, k3, s, c;
-    int n;  n = atoi(argv[1]);
-
-    zero  = make_vec( 0.0,  0.0);  one   = make_vec( 1.0,  1.0);
-    two   = make_vec( 2.0,  2.0);  m_one = make_vec(-1.0, -1.0);
-    init  = make_vec( 1.0,  2.0);  av    = make_vec( 1.0, -1.0);
-    
-    Harmonic = zeta = poly = alt = Gregory = zero; 
-
-    for (k=1; k<=n; k++)
-    {
-        twoThrd += pow(2.0/3.0, k-1);
-        sqrts   += 1.0/sqrt(k);
-              k3 = k*k*k;
-              s  = sin(k); c = cos(k); 
-        Flint   += 1.0/(k3 * s*s);        
-        Cookson += 1.0/(k3 * c*c);
-    } 
-
-    for (kv=init; *(double *)(&kv)<=n; kv+=two)
-    {
-        poly    += one /(kv*(kv+one)); 
-        Harmonic+= one / kv;
-        zeta    += one /(kv*kv);
-        alt     +=  av / kv;  
-        Gregory +=  av /(two*kv - one);
-    }
-    
-#define psum(name,num) printf("%.9f\t%s\n",num,name)
-    psum("(2/3)^k",           twoThrd); psum("k^-0.5",      sqrts);
-    psum("1/k(k+1)",    sum_vec(poly)); psum("Flint Hills", Flint);
-    psum("Cookson Hills",     Cookson); psum("Harmonic", sum_vec(Harmonic));  
-    psum("Riemann Zeta",sum_vec(zeta)); psum("Alternating Harmonic",sum_vec(alt));
-    psum("Gregory",  sum_vec(Gregory));
-    
-    return 0;
-}

data/sources/gcc/pidigits.gcc

@@ -1,105 +0,0 @@
-/*
-** The Computer Language Shootout
-** http://shootout.alioth.debian.org/
-** contributed by Mike Pall
-**
-**   gcc -O3 -fomit-frame-pointer -o pidigits pidigits.c -lgmp
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <gmp.h>
-
-typedef struct ctx_s {
-  mpz_t q, r, s, t;	/* Transformation matrix components. */
-  mpz_t u, v, w;	/* Temporary numbers. */
-  int d, i, n;		/* Counters. */
-  char digits[10+1];	/* Accumulated digits for one line. */
-} ctx_t;
-
-/* Compose matrix with numbers on the right. */
-static void compose_r(ctx_t *c, int bq, int br, int bs, int bt)
-{
-  mpz_mul_si(c->u, c->r, bs);
-  mpz_mul_si(c->r, c->r, bq);
-  mpz_mul_si(c->v, c->t, br);
-  mpz_add(c->r, c->r, c->v);
-  mpz_mul_si(c->t, c->t, bt);
-  mpz_add(c->t, c->t, c->u);
-  mpz_mul_si(c->s, c->s, bt);
-  mpz_mul_si(c->u, c->q, bs);
-  mpz_add(c->s, c->s, c->u);
-  mpz_mul_si(c->q, c->q, bq);
-}
-
-/* Compose matrix with numbers on the left. */
-static void compose_l(ctx_t *c, int bq, int br, int bs, int bt)
-{
-  mpz_mul_si(c->r, c->r, bt);
-  mpz_mul_si(c->u, c->q, br);
-  mpz_add(c->r, c->r, c->u);
-  mpz_mul_si(c->u, c->t, bs);
-  mpz_mul_si(c->t, c->t, bt);
-  mpz_mul_si(c->v, c->s, br);
-  mpz_add(c->t, c->t, c->v);
-  mpz_mul_si(c->s, c->s, bq);
-  mpz_add(c->s, c->s, c->u);
-  mpz_mul_si(c->q, c->q, bq);
-}
-
-/* Extract one digit. */
-static int extract(ctx_t *c, unsigned int j)
-{
-  mpz_mul_ui(c->u, c->q, j);
-  mpz_add(c->u, c->u, c->r);
-  mpz_mul_ui(c->v, c->s, j);
-  mpz_add(c->v, c->v, c->t);
-  mpz_tdiv_q(c->w, c->u, c->v);
-  return mpz_get_ui(c->w);
-}
-
-/* Print one digit. Returns 1 for the last digit. */
-static int prdigit(ctx_t *c, int y)
-{
-  c->digits[c->d++] = '0'+y;
-  if (++c->i % 10 == 0 || c->i == c->n) {
-    c->digits[c->d] = '\0';
-    printf("%-10s\t:%d\n", c->digits, c->i);
-    c->d = 0;
-  }
-  return c->i == c->n;
-}
-
-/* Generate successive digits of PI. */
-static void pidigits(ctx_t *c)
-{
-  int k = 1;
-  c->d = 0;
-  c->i = 0;
-  mpz_init_set_ui(c->q, 1);
-  mpz_init_set_ui(c->r, 0);
-  mpz_init_set_ui(c->s, 0);
-  mpz_init_set_ui(c->t, 1);
-  mpz_init(c->u);
-  mpz_init(c->v);
-  mpz_init(c->w);
-  for (;;) {
-    int y = extract(c, 3);
-    if (y == extract(c, 4)) {
-      if (prdigit(c, y)) return;
-      compose_r(c, 10, -10*y, 0, 1);
-    } else {
-      compose_l(c, k, 4*k+2, 0, 2*k+1);
-      k++;
-    }
-  }
-}
-
-int main(int argc, char **argv)
-{
-  ctx_t c;
-  c.n = argc > 1 ? atoi(argv[1]) : 27;
-  pidigits(&c);
-  return 0;
-}
-

data/sources/gcc/primes.gcc

@@ -1,75 +0,0 @@
-/* The Computer Language Benchmarks Game
-   http://shootout.alioth.debian.org/
-   contributed by Steven Noonan
-*/
- 
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-
-int
-isPrime ( unsigned long _candidate )
-{
-    unsigned long i, limit;
-
-	/* 0 and 1 aren't prime. */
-    if ( _candidate < 2 ) return 0;
-
-    /* All numbers less than 4 are prime, except '1' */
-    if ( _candidate < 4 ) return -1;
-
-    /* Other than 2, even numbers are not prime */
-    if ( _candidate % 2 == 0 ) return 0;
-
-	/* All primes are of the form 6k+i (where i = -1 or 1), except for 2 or 3. */
-    if ( ( _candidate + 1 ) % 6 != 0
-      && ( _candidate - 1 ) % 6 != 0 )
-    	return 0;
-
-    /*
-       if n is composite then it can be factored into two values,
-       at least one of which is less than or equal to sqrt(n)
-     */
-    limit = (unsigned long)sqrt ((double)_candidate);
-
-    /* Now test all other odd numbers up to sqrt(n) */
-    for ( i = 3; i <= limit; i += 2 ) if ( _candidate % i == 0 ) return 0;
-
-    return 1;
-}
-
-unsigned long
-nthPrime ( unsigned long _primeToFind )
-{
-    unsigned long count = 0, num;
-    for ( num = 1; count < _primeToFind; num++ )
-    {
-        if ( isPrime ( num ) )
-        {
-            count++;
-        }
-    }
-    
-    /* Returning num-1 because we hit a num++ between isPrime and here. */
-    return num - 1;
-}
-
-int
-main ( int argc, char **argv )
-{
-	unsigned long i, n;
-	
-	if ( argc < 2 ) return -1;
-
-	n = atoi(argv[1]);
-	
-	printf ( "1st prime is %d\n", nthPrime ( 1 ) );
-	printf ( "2nd prime is %d\n", nthPrime ( 2 ) );
-
-    for ( i = 10 * n; i <= 50 * n; i += 10 * n )
-    {
-        printf ( "%uth prime is %u\n", i, nthPrime ( i ) );
-    }
-
-    return 0;
-}

data/sources/gcc/prodcons.gcc

@@ -1,86 +0,0 @@
-/* -*- mode: c -*-
- * $Id: prodcons.gcc,v 1.1.1.1 2004-05-19 18:11:09 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-#include <signal.h>
-#include <errno.h>
-#include <sys/types.h>
-#include <pthread.h>
-
-pthread_mutex_t mutex;
-pthread_cond_t control;
-void producer(int *arg);
-void consumer(int *arg);
-int count, data, consumed, produced;
-
-
-int
-main(int argc, char *argv[]) {
-    int n = ((argc == 2) ? atoi(argv[1]) : 1);
-    pthread_t t1, t2;
-    
-    count = data = consumed = produced = 0;
-
-    if (pthread_mutex_init(&mutex, NULL)) {
-	perror("pthread_mutex_init");
-	exit(1);
-    }
-    if (pthread_cond_init(&control, NULL)) {
-	perror("pthread_cond_init");
-	exit(1);
-    }
-    if (pthread_create(&t1, (pthread_attr_t *)NULL,
-		       (void * (*)(void *))producer, (void *)&n)) {
-	perror("pthread_create");
-	exit(1);
-    }
-    if (pthread_create(&t2, (pthread_attr_t *)NULL,
-		       (void * (*)(void *))consumer, (void *)&n)) {
-	perror("pthread_create");
-	exit(1);
-    }
-  
-    pthread_join(t1, NULL);
-    pthread_join(t2, NULL);
-    fprintf(stdout, "%d %d\n", produced, consumed);
-    return(0);
-}
-
-
-void producer(int *arg) {
-    int i, n = *arg;
-    for (i=1; i<=n; i++) {
-	pthread_mutex_lock(&mutex);
-	while (count == 1) {
-	    pthread_cond_wait(&control, &mutex);
-	}
-	data = i;
-	count = 1;
-	pthread_cond_signal(&control);
-	pthread_mutex_unlock(&mutex);
-	produced++;
-    }
-}
- 
-
-void consumer(int *arg) {
-    int i = 0, n = *arg;
-    while (1) {
-	pthread_mutex_lock(&mutex);
-	while (count == 0) {
-	    pthread_cond_wait(&control, &mutex);
-	}
-	i = data;
-	count = 0;
-	pthread_cond_signal(&control);
-	pthread_mutex_unlock(&mutex);
-	consumed++;
-	if (i == n) return;
-    }
-}
-

data/sources/gcc/random.gcc

@@ -1,29 +0,0 @@
-/* -*- mode: c -*-
- * $Id: random.gcc,v 1.1.1.1 2004-05-19 18:11:15 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <math.h>
-#include <stdio.h>
-#include <stdlib.h>
-
-#define IM 139968
-#define IA 3877
-#define IC 29573
-
-inline double gen_random(double max) {
-    static long last = 42;
-    
-    last = (last * IA + IC) % IM;
-    return( max * last / IM );
-}
-
-int main(int argc, char *argv[]) {
-    int N = ((argc == 2) ? atoi(argv[1]) : 1) - 1;
-    
-    while (N--) {
-	gen_random(100.0);
-    }
-    printf("%.9f\n", gen_random(100.0));
-    return(0);
-}