chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/hash.gcc

@@ -1,31 +0,0 @@
-/* -*- mode: c -*-
- * $Id: hash.gcc,v 1.1.1.1 2004-05-19 18:09:55 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <unistd.h>
-#include "../../Include/simple_hash.h"
-
-int main(int argc, char *argv[]) {
-    int i, c=0, n = ((argc == 2) ? atoi(argv[1]) : 1);
-    char buf[32];
-	
-    struct ht_ht *ht = ht_create(n);
-    
-    for (i=1; i<=n; i++) {
-	sprintf(buf, "%x", i);
-	(ht_find_new(ht, buf))->val = i;
-    }
-
-    for (i=n; i>0; i--) {
-	sprintf(buf, "%d", i);
-	if (ht_find(ht, buf)) c++;
-    }
-
-    ht_destroy(ht);
-
-    printf("%d\n", c);
-    return(0);
-}

data/sources/gcc/hash2.gcc

@@ -1,38 +0,0 @@
-/* -*- mode: c -*-
- * $Id: hash2.gcc,v 1.1.1.1 2004-05-19 18:10:02 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <unistd.h>
-#include "../../Include/simple_hash.h"
-
-int main(int argc, char *argv[]) {
-    int i, n = ((argc == 2) ? atoi(argv[1]) : 1);
-    char buf[32];
-    struct ht_ht *ht1 = ht_create(10000);
-    struct ht_ht *ht2 = ht_create(10000);
-    struct ht_node *node;
-
-    for (i=0; i<=9999; ++i) {
-	sprintf(buf, "foo_%d", i);
-	ht_find_new(ht1, buf)->val = i;
-    }
-
-    for (i=0; i<n; ++i) {
-	for (node=ht_first(ht1); node; node=ht_next(ht1)) {
-	    ht_find_new(ht2, node->key)->val += node->val;
-	}
-    }
-
-    printf("%d %d %d %d\n",
-	   (ht_find(ht1, "foo_1"))->val,
-	   (ht_find(ht1, "foo_9999"))->val,
-	   (ht_find(ht2, "foo_1"))->val,
-	   (ht_find(ht2, "foo_9999"))->val);
-
-    ht_destroy(ht1);
-    ht_destroy(ht2);
-    return(0);
-}

data/sources/gcc/heapsort.gcc

@@ -1,72 +0,0 @@
-/* -*- mode: c -*-
- * $Id: heapsort.gcc,v 1.1.1.1 2004-05-19 18:10:08 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <stdlib.h>
-#include <math.h>
-#include <stdio.h>
-
-#define IM 139968
-#define IA   3877
-#define IC  29573
-
-double
-gen_random(double max) {
-    static long last = 42;
-    return( max * (last = (last * IA + IC) % IM) / IM );
-}
-
-void
-heapsort(int n, double *ra) {
-    int i, j;
-    int ir = n;
-    int l = (n >> 1) + 1;
-    double rra;
-
-    for (;;) {
-	if (l > 1) {
-	    rra = ra[--l];
-	} else {
-	    rra = ra[ir];
-	    ra[ir] = ra[1];
-	    if (--ir == 1) {
-		ra[1] = rra;
-		return;
-	    }
-	}
-	i = l;
-	j = l << 1;
-	while (j <= ir) {
-	    if (j < ir && ra[j] < ra[j+1]) { ++j; }
-	    if (rra < ra[j]) {
-		ra[i] = ra[j];
-		j += (i = j);
-	    } else {
-		j = ir + 1;
-	    }
-	}
-	ra[i] = rra;
-    }
-}
-
-int
-main(int argc, char *argv[]) {
-    int N = ((argc == 2) ? atoi(argv[1]) : 1);
-    double *ary;
-    int i;
-    
-    /* create an array of N random doubles */
-    ary = (double *)malloc((N+1) * sizeof(double));
-    for (i=1; i<=N; i++) {
-	ary[i] = gen_random(1);
-    }
-
-    heapsort(N, ary);
-
-    printf("%.10f\n", ary[N]);
-
-    free(ary);
-    return(0);
-}
-

data/sources/gcc/hello.gcc-2.gcc

@@ -1,12 +0,0 @@
-/* The Computer Language Benchmarks Game
- * http://shootout.alioth.debian.org/
- * contributed by Joe Tucek 2008-03-29 
- * Clearly printf is worse than fputs, which is worse than write...
- */
-
-#include <unistd.h>
-
-int main() {
-  write(1, "hello world\n", 12);
-  return(0);
-}

data/sources/gcc/hello.gcc-3.gcc

@@ -1,20 +0,0 @@
-/* The Computer Language Benchmarks Game
- * http://shootout.alioth.debian.org/
- * contributed by Joe Tucek 2008-03-31
- *
- * Tell GCC that we don't want atexit, we don't want to use the heap,
- * and we really don't want anything.  Can't even call write the "normal"
- * way, because write() isn't linked in....
- *
- * Compile flags are picky for this.  I used:
- * gcc -pipe -Wall -O3 -fomit-frame-pointer -march=pentium4 -ffreestanding -nostartfiles -s -static -o start3 start3.c
- */
-
-#include <sys/syscall.h>
-#include <unistd.h>
-
-int _start() {
-  syscall(__NR_write, 1, "hello world\n", 12);
-  syscall(__NR_exit, 0);
-  return(0);
-}

data/sources/gcc/knucleotide.gcc

@@ -1,173 +0,0 @@
-/* The Computer Language Benchmarks Game
-   http://shootout.alioth.debian.org/
-
-   Contributed by Josh Goldfoot
-   to compile, use gcc -O3
-
-   This revision uses "simple_hash.h," available from
-   http://alioth.debian.org/plugins/scmcvs/cvsweb.php/shootout/bench/Include/?cvsroot=shootout
-
-*/
-#include <stdio.h>
-#include <string.h>
-#include <ctype.h>
-#include <stdlib.h>
-#include "../../Include/simple_hash.h"
-
-long
-hash_table_size (int fl, long buflen)
-{
-  long maxsize1, maxsize2;
-
-  maxsize1 = buflen - fl;
-  maxsize2 = 4;
-  while (--fl > 0 && maxsize2 < maxsize1)
-    maxsize2 = maxsize2 * 4;
-  if (maxsize1 < maxsize2)
-    return maxsize1;
-  return maxsize2;
-}
-
-struct ht_ht *
-generate_frequencies (int fl, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-  char *reader;
-  long i;
-  char nulled;
-
-  if (fl > buflen)
-    return NULL;
-
-  ht = ht_create (hash_table_size (fl, buflen));
-  for (i = 0; i < buflen - fl + 1; i++)
-    {
-      reader = &(buffer[i]);
-      nulled = reader[fl];
-      reader[fl] = 0x00;
-      ht_find_new (ht, reader)->val++;
-      reader[fl] = nulled;
-    }
-  return ht;
-}
-
-typedef struct ssorter
-{
-  char *string;
-  int num;
-} sorter;
-
-void
-write_frequencies (int fl, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-  long total, i, j, size;
-  struct ht_node *nd;
-  sorter *s;
-  sorter tmp;
-
-  ht = generate_frequencies (fl, buffer, buflen);
-  total = 0;
-  size = 0;
-  for (nd = ht_first (ht); nd != NULL; nd = ht_next (ht))
-    {
-      total = total + nd->val;
-      size++;
-    }
-  s = calloc (size, sizeof (sorter));
-  i = 0;
-  for (nd = ht_first (ht); nd != NULL; nd = ht_next (ht))
-    {
-      s[i].string = nd->key;
-      s[i++].num = nd->val;
-    }
-  for (i = 0; i < size - 1; i++)
-    for (j = i + 1; j < size; j++)
-      if (s[i].num < s[j].num)
-	{
-	  memcpy (&tmp, &(s[i]), sizeof (sorter));
-	  memcpy (&(s[i]), &(s[j]), sizeof (sorter));
-	  memcpy (&(s[j]), &tmp, sizeof (sorter));
-	}
-  for (i = 0; i < size; i++)
-    printf ("%s %.3f\n", s[i].string, 100 * (float) s[i].num / total);
-  printf ("\n");
-  ht_destroy (ht);
-  free (s);
-}
-
-void
-write_count (char *searchFor, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-
-  ht = generate_frequencies (strlen (searchFor), buffer, buflen);
-  printf ("%d\t%s\n", ht_find_new (ht, searchFor)->val, searchFor);
-  ht_destroy (ht);
-}
-
-int
-main ()
-{
-  char c;
-  char *line, *buffer, *tmp, *x;
-  int i, linelen, nothree;
-  long buflen, seqlen;
-
-  line = malloc (256);
-  if (!line)
-    return -1;
-  seqlen = 0;
-  nothree = 1;
-
-  while (nothree && fgets (line, 255, stdin))
-    if (line[0] == '>' && line[1] == 'T' && line[2] == 'H')
-      nothree = 0;
-  free (line);
-
-  buflen = 10240;
-  buffer = malloc (buflen + 1);
-  if (!buffer)
-    return -1;
-  x = buffer;
-
-  while (fgets (x, 255, stdin))
-    {
-      linelen = strlen (x);
-      if (linelen)
-	{
-	  if (x[linelen - 1] == '\n')
-	    linelen--;
-	  c = x[0];
-	  if (c == '>')
-	    break;
-	  else if (c != ';')
-	    {
-	      seqlen = seqlen + linelen;
-	      if (seqlen + 512 >= buflen)
-		{
-		  buflen = buflen + 10240;
-		  tmp = realloc (buffer, buflen + 1);
-		  if (tmp == NULL)
-		    return -1;
-		  buffer = tmp;
-		  x = &(buffer[seqlen]);
-		}
-	      else
-		x = &(x[linelen]);
-	      x[0] = 0;
-	    }
-	}
-    }
-  for (i = 0; i < seqlen; i++)
-    buffer[i] = toupper (buffer[i]);
-  write_frequencies (1, buffer, seqlen);
-  write_frequencies (2, buffer, seqlen);
-  write_count ("GGT", buffer, seqlen);
-  write_count ("GGTA", buffer, seqlen);
-  write_count ("GGTATT", buffer, seqlen);
-  write_count ("GGTATTTTAATT", buffer, seqlen);
-  write_count ("GGTATTTTAATTTATAGT", buffer, seqlen);
-  free (buffer);
-  return 0;
-}

data/sources/gcc/knucleotide.gcc-2.gcc

@@ -1,168 +0,0 @@
-/* The Computer Language Benchmarks Game
-   http://shootout.alioth.debian.org/
-
-   Contributed by Josh Goldfoot
-*/
-
-#include <stdio.h>
-#include <string.h>
-#include <ctype.h>
-#include <stdlib.h>
-
-long
-hash_table_size (int fl, long buflen)
-{
-  long maxsize1, maxsize2;
-
-  maxsize1 = buflen - fl;
-  maxsize2 = 4;
-  while (--fl > 0 && maxsize2 < maxsize1)
-    maxsize2 = maxsize2 * 4;
-  if (maxsize1 < maxsize2)
-    return maxsize1;
-  return maxsize2;
-}
-
-struct ht_ht *
-generate_frequencies (int fl, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-  char *reader;
-  long i;
-  char nulled;
-
-  if (fl > buflen)
-    return NULL;
-
-  ht = ht_create (hash_table_size (fl, buflen));
-  for (i = 0; i < buflen - fl + 1; i++)
-    {
-      reader = &(buffer[i]);
-      nulled = reader[fl];
-      reader[fl] = 0x00;
-      ht_find_new (ht, reader)->val++;
-      reader[fl] = nulled;
-    }
-  return ht;
-}
-
-typedef struct ssorter
-{
-  char *string;
-  int num;
-} sorter;
-
-void
-write_frequencies (int fl, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-  long total, i, j, size;
-  struct ht_node *nd;
-  sorter *s;
-  sorter tmp;
-
-  ht = generate_frequencies (fl, buffer, buflen);
-  total = 0;
-  size = 0;
-  for (nd = ht_first (ht); nd != NULL; nd = ht_next (ht))
-    {
-      total = total + nd->val;
-      size++;
-    }
-  s = calloc (size, sizeof (sorter));
-  i = 0;
-  for (nd = ht_first (ht); nd != NULL; nd = ht_next (ht))
-    {
-      s[i].string = nd->key;
-      s[i++].num = nd->val;
-    }
-  for (i = 0; i < size - 1; i++)
-    for (j = i + 1; j < size; j++)
-      if (s[i].num < s[j].num)
-	{
-	  memcpy (&tmp, &(s[i]), sizeof (sorter));
-	  memcpy (&(s[i]), &(s[j]), sizeof (sorter));
-	  memcpy (&(s[j]), &tmp, sizeof (sorter));
-	}
-  for (i = 0; i < size; i++)
-    printf ("%s %.3f\n", s[i].string, 100 * (float) s[i].num / total);
-  printf ("\n");
-  ht_destroy (ht);
-  free (s);
-}
-
-void
-write_count (char *searchFor, char *buffer, long buflen)
-{
-  struct ht_ht *ht;
-
-  ht = generate_frequencies (strlen (searchFor), buffer, buflen);
-  printf ("%d\t%s\n", ht_find_new (ht, searchFor)->val, searchFor);
-  ht_destroy (ht);
-}
-
-int
-main ()
-{
-  char c;
-  char *line, *buffer, *tmp, *x;
-  int i, linelen, nothree;
-  long buflen, seqlen;
-
-  line = malloc (256);
-  if (!line)
-    return -1;
-  seqlen = 0;
-  nothree = 1;
-
-  while (nothree && fgets (line, 255, stdin))
-    if (line[0] == '>' && line[1] == 'T' && line[2] == 'H')
-      nothree = 0;
-  free (line);
-
-  buflen = 10240;
-  buffer = malloc (buflen + 1);
-  if (!buffer)
-    return -1;
-  x = buffer;
-
-  while (fgets (x, 255, stdin))
-    {
-      linelen = strlen (x);
-      if (linelen)
-	{
-	  if (x[linelen - 1] == '\n')
-	    linelen--;
-	  c = x[0];
-	  if (c == '>')
-	    break;
-	  else if (c != ';')
-	    {
-	      seqlen = seqlen + linelen;
-	      if (seqlen + 512 >= buflen)
-		{
-		  buflen = buflen + 10240;
-		  tmp = realloc (buffer, buflen + 1);
-		  if (tmp == NULL)
-		    return -1;
-		  buffer = tmp;
-		  x = &(buffer[seqlen]);
-		}
-	      else
-		x = &(x[linelen]);
-	      x[0] = 0;
-	    }
-	}
-    }
-  for (i = 0; i < seqlen; i++)
-    buffer[i] = toupper (buffer[i]);
-  write_frequencies (1, buffer, seqlen);
-  write_frequencies (2, buffer, seqlen);
-  write_count ("GGT", buffer, seqlen);
-  write_count ("GGTA", buffer, seqlen);
-  write_count ("GGTATT", buffer, seqlen);
-  write_count ("GGTATTTTAATT", buffer, seqlen);
-  write_count ("GGTATTTTAATTTATAGT", buffer, seqlen);
-  free (buffer);
-  return 0;
-}