chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/ackermann.gcc-2.gcc

@@ -1,93 +0,0 @@
-/* -*- mode: c -*-
- * $Id: ackermann.gcc-2.gcc,v 1.1 2005-03-15 06:17:49 bfulgham Exp $
- * http://shootout.alioth.debian.org/
- *
- * Modified to use C inline and unroll of recursive functions
- * by Paul Hsieh
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <limits.h>
-#if (defined(__linux) || defined(__unix) || defined(__GNUC__))
-#include <unistd.h>
-#elif (defined(WIN32) || defined(_WIN32) || defined(__WIN32) || 
-defined(_WINDOWS) || defined(_WINDOWS_))
-#include <windows.h>
-#endif
-
-#define glueAckExpand(m) Ack##m
-#define glueAck(m) glueAckExpand(m)
-
-#define Ack0(N) ((N)+1)
-
-#define AckDecl(M,M1)                                 \
-static int glueAck(M) (int N) {                       \
-    if (0 == N) return glueAck(M1) (1);               \
-    if (1 == N) return glueAck(M1) (glueAck(M1) (1)); \
-    return glueAck(M1) (glueAck(M) (N-1));            \
-}
-
-AckDecl(1,0)
-AckDecl(2,1)
-AckDecl(3,2)
-AckDecl(4,3)
-
-/* Removes the overhead of passing around and M parameter, 
-   when it is low (which is the only way this can actually
-   complete execution.) */
-
-int Ack (int M, int N) {
-    switch (M) {
-        case 0: return Ack0 (N);
-        case 1: return Ack1 (N);
-        case 2: return Ack2 (N);
-        case 3: return Ack3 (N);
-        case 4: return Ack4 (N);
-    }
-
-    if (0 == N) return Ack (M-1, 1);
-    if (1 == N) return Ack (M-1, Ack (M-1, 1));
-    return Ack (M-1, Ack (M, N-1));
-}
-
-/* Not called.  Uses full mathematical simplfications when 
-   its possible and unravells the recursion on the N 
-   parameter into a for() loop (so the stack level never 
-   goes deeper than O(M)). */
-
-int AckCheat (int M, int N) {
-    switch (M) {
-        case 0: return Ack0 (N);
-        case 1: return N + 2;
-        case 2: return 2*N + 3;
-        case 3: if (N < (CHAR_BIT * sizeof(int) - 3)) 
-                    return (1 << (N+3))-3;
-    }
-
-    if (0 == N) return AckCheat (M-1, 1);
-    if (1 == N) return AckCheat (M-1, AckCheat (M-1, 1));
-
-    {
-        int a = AckCheat (M-1, 1);
-        for (;N; N--) a = AckCheat (M-1, a);
-        return a;
-    }
-}
-
-int main(int argc, char *argv[]) {
-    int m = ((argc >= 3) ? atoi(argv[argc-2]) : 3);
-    int n = ((argc >= 2) ? atoi(argv[argc-1]) : 1);
-
-    printf("Ack(%d,%d): %d\n", m, n, Ack (m, n));
-
-    /* sleep long enough so we can measure memory usage */
-#if (defined(__linux) || defined(__unix) || defined(__GNUC__))
-    sleep(1);
-#elif (defined(WIN32) || defined(_WIN32) || defined(__WIN32) || 
-defined(_WINDOWS) || defined(_WINDOWS_))
-    Sleep(1000);
-#endif
-
-    return(0);
-}

data/sources/gcc/ackermann.gcc-3.gcc

@@ -1,20 +0,0 @@
-/* -*- mode: c -*-
- * $Id: ackermann.gcc-3.gcc,v 1.1 2005-04-27 05:21:30 igouy-guest Exp $
- * http://www.bagley.org/~doug/shootout/
- *
- * modified by Isaac Gouy
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <unistd.h>
-
-int Ack(int M, int N) { return(M ? (Ack(M-1,N ? Ack(M,(N-1)) : 1)) : N+1); }
-
-int main(int argc, char *argv[]) {
-    int n = ((argc == 2) ? atoi(argv[1]) : 1);
-
-    printf("Ack(3,%d): %d\n", n, Ack(3, n));
-    return(0);
-}
-

data/sources/gcc/ary.gcc

@@ -1,40 +0,0 @@
-/* -*- mode: c -*-
- * $Id: ary.gcc,v 1.2 2004-05-22 07:25:00 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- *
- * this program is modified from:
- *   http://cm.bell-labs.com/cm/cs/who/bwk/interps/pap.html
- * Timing Trials, or, the Trials of Timing: Experiments with Scripting
- * and User-Interface Languages</a> by Brian W. Kernighan and
- * Christopher J. Van Wyk.
- *
- * I added free() to deallocate memory.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-int
-main(int argc, char *argv[]) {
-    int n = ((argc == 2) ? atoi(argv[1]) : 1);
-    int i, k, *x, *y;
-	
-    x = (int *) calloc(n, sizeof(int));
-    y = (int *) calloc(n, sizeof(int));
-
-    for (i = 0; i < n; i++) {
-	x[i] = i + 1;
-    }
-    for (k=0; k<1000; k++) {
-	for (i = n-1; i >= 0; i--) {
-	    y[i] += x[i];
-	}
-    }
-
-    fprintf(stdout, "%d %d\n", y[0], y[n-1]);
-
-    free(x);
-    free(y);
-
-    return(0);
-}

data/sources/gcc/binarytrees.gcc

@@ -1,136 +0,0 @@
-/* The Computer Language Shootout Benchmarks
-   http://shootout.alioth.debian.org/
-
-   contributed by Kevin Carson
-   compilation:
-       gcc -O3 -fomit-frame-pointer -funroll-loops -static binary-trees.c -lm
-       icc -O3 -ip -unroll -static binary-trees.c -lm
-*/
-
-#include <malloc.h>
-#include <math.h>
-#include <stdio.h>
-#include <stdlib.h>
-
-
-typedef struct tn {
-    struct tn*    left;
-    struct tn*    right;
-    long          item;
-} treeNode;
-
-
-treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
-{
-    treeNode*    new;
-
-    new = (treeNode*)malloc(sizeof(treeNode));
-
-    new->left = left;
-    new->right = right;
-    new->item = item;
-
-    return new;
-} /* NewTreeNode() */
-
-
-long ItemCheck(treeNode* tree)
-{
-    if (tree->left == NULL)
-        return tree->item;
-    else
-        return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
-} /* ItemCheck() */
-
-
-treeNode* BottomUpTree(long item, unsigned depth)
-{
-    if (depth > 0)
-        return NewTreeNode
-        (
-            BottomUpTree(2 * item - 1, depth - 1),
-            BottomUpTree(2 * item, depth - 1),
-            item
-        );
-    else
-        return NewTreeNode(NULL, NULL, item);
-} /* BottomUpTree() */
-
-
-void DeleteTree(treeNode* tree)
-{
-    if (tree->left != NULL)
-    {
-        DeleteTree(tree->left);
-        DeleteTree(tree->right);
-    }
-
-    free(tree);
-} /* DeleteTree() */
-
-
-int main(int argc, char* argv[])
-{
-    unsigned   N, depth, minDepth, maxDepth, stretchDepth;
-    treeNode   *stretchTree, *longLivedTree, *tempTree;
-
-    N = atol(argv[1]);
-
-    minDepth = 4;
-
-    if ((minDepth + 2) > N)
-        maxDepth = minDepth + 2;
-    else
-        maxDepth = N;
-
-    stretchDepth = maxDepth + 1;
-
-    stretchTree = BottomUpTree(0, stretchDepth);
-    printf
-    (
-        "stretch tree of depth %u\t check: %li\n",
-        stretchDepth,
-        ItemCheck(stretchTree)
-    );
-
-    DeleteTree(stretchTree);
-
-    longLivedTree = BottomUpTree(0, maxDepth);
-
-    for (depth = minDepth; depth <= maxDepth; depth += 2)
-    {
-        long    i, iterations, check;
-
-        iterations = pow(2, maxDepth - depth + minDepth);
-
-        check = 0;
-
-        for (i = 1; i <= iterations; i++)
-        {
-            tempTree = BottomUpTree(i, depth);
-            check += ItemCheck(tempTree);
-            DeleteTree(tempTree);
-
-            tempTree = BottomUpTree(-i, depth);
-            check += ItemCheck(tempTree);
-            DeleteTree(tempTree);
-        } /* for(i = 1...) */
-
-        printf
-        (
-            "%li\t trees of depth %u\t check: %li\n",
-            iterations * 2,
-            depth,
-            check
-        );
-    } /* for(depth = minDepth...) */
-
-    printf
-    (
-        "long lived tree of depth %u\t check: %li\n",
-        maxDepth,
-        ItemCheck(longLivedTree)
-    );
-
-    return 0;
-} /* main() */

data/sources/gcc/binarytrees.gcc-2.gcc

@@ -1,140 +0,0 @@
-/* The Computer Language Shootout Benchmarks
-http://shootout.alioth.debian.org/
-
-contributed by Benoit Hudson based on a contribution of Kevin Carson
-compilation:
-gcc -O3 -fomit-frame-pointer binary-trees-2.c
- */
-
-#include <stdlib.h>
-#include <stdio.h>
-
-typedef struct tn {
-  struct tn*    left;
-  struct tn*    right;
-  long          item;
-} treeNode;
-
-static treeNode *freelist = 0;
-
-treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
-{
-  treeNode*    new;
-
-  if (NULL == freelist) {
-    new = (treeNode*)malloc(sizeof(treeNode));
-  } else {
-    new = freelist;
-    freelist = freelist -> left;
-  }
-
-  new->left = left;
-  new->right = right;
-  new->item = item;
-
-  return new;
-} /* NewTreeNode() */
-
-
-long ItemCheck(treeNode* tree)
-{
-  if (tree->left == NULL)
-    return tree->item;
-  else
-    return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
-} /* ItemCheck() */
-
-
-treeNode* BottomUpTree(long item, unsigned depth)
-{
-  if (depth > 0)
-    return NewTreeNode
-      (
-       BottomUpTree(2 * item - 1, depth - 1),
-       BottomUpTree(2 * item, depth - 1),
-       item
-      );
-  else
-    return NewTreeNode(NULL, NULL, item);
-} /* BottomUpTree() */
-
-
-void DeleteTree(treeNode* tree)
-{
-  if (tree->left != NULL)
-  {
-    DeleteTree(tree->left);
-    DeleteTree(tree->right);
-  }
-
-  tree -> left = freelist;
-  freelist = tree;
-} /* DeleteTree() */
-
-
-int main(int argc, char* argv[])
-{
-  unsigned   N, depth, minDepth, maxDepth, stretchDepth;
-  treeNode   *stretchTree, *longLivedTree, *tempTree;
-
-  N = atol(argv[1]);
-
-  minDepth = 4;
-
-  if ((minDepth + 2) > N)
-    maxDepth = minDepth + 2;
-  else
-    maxDepth = N;
-
-  stretchDepth = maxDepth + 1;
-
-  stretchTree = BottomUpTree(0, stretchDepth);
-  printf
-    (
-     "stretch tree of depth %u\t check: %li\n",
-     stretchDepth,
-     ItemCheck(stretchTree)
-    );
-
-  DeleteTree(stretchTree);
-
-  longLivedTree = BottomUpTree(0, maxDepth);
-
-  for (depth = minDepth; depth <= maxDepth; depth += 2)
-  {
-    long    i, iterations, check;
-
-    iterations = 1 << (maxDepth - depth + minDepth);
-
-    check = 0;
-
-    for (i = 1; i <= iterations; i++)
-    {
-      tempTree = BottomUpTree(i, depth);
-      check += ItemCheck(tempTree);
-      DeleteTree(tempTree);
-
-      tempTree = BottomUpTree(-i, depth);
-      check += ItemCheck(tempTree);
-      DeleteTree(tempTree);
-    } /* for(i = 1...) */
-
-    printf
-      (
-       "%li\t trees of depth %u\t check: %li\n",
-       iterations * 2,
-       depth,
-       check
-      );
-  } /* for(depth = minDepth...) */
-
-  printf
-    (
-     "long lived tree of depth %u\t check: %li\n",
-     maxDepth,
-     ItemCheck(longLivedTree)
-    );
-
-  return 0;
-} /* main() */
-

data/sources/gcc/binarytrees.gcc-3.gcc

@@ -1,134 +0,0 @@
-/* The Computer Language Benchmarks Game
-   http://shootout.alioth.debian.org/
-
-   contributed by Kevin Carson
-   modified by Anthony Piron
-*/
-
-#include <malloc.h>
-#include <math.h>
-#include <stdio.h>
-#include <stdlib.h>
-
-
-typedef struct tn {
-    struct tn*    left;
-    struct tn*    right;
-    long          item;
-} treeNode;
-
-
-treeNode* InitTreeNode(treeNode* new, treeNode* left, treeNode* right, long item)
-{
-    new->left = left;
-    new->right = right;
-    new->item = item;
-
-    return new;
-} /* NewTreeNode() */
-
-
-long ItemCheck(treeNode* tree)
-{
-    if (tree->left == NULL)
-        return tree->item;
-    else
-        return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
-} /* ItemCheck() */
-
-
-treeNode* BottomUpTreeBis(treeNode array[], long index, 
-			  long item, unsigned depth)
-{
-    if (depth > 0)
-        return InitTreeNode
-        (
-	    array + index,
-            BottomUpTreeBis(array, index*2+1, 2 * item - 1, depth - 1),
-            BottomUpTreeBis(array,index*2+2,  2 * item, depth - 1),
-            item
-        );
-    else
-        return InitTreeNode( array+index,NULL, NULL, item);
-} /* BottomUpTree() */
-
-treeNode* BottomUpTree(long item, unsigned depth)
-{
-  treeNode* array = malloc(sizeof(treeNode)* pow(2,depth+1) );
-
-  return BottomUpTreeBis(array,0, item, depth);
-}
-
-void DeleteTree(treeNode* tree)
-{
-
-  free(tree);
-
-} /* DeleteTree() */
-
-
-int main(int argc, char* argv[])
-{
-    unsigned   N, depth, minDepth, maxDepth, stretchDepth;
-    treeNode   *stretchTree, *longLivedTree, *tempTree;
-
-    N = atol(argv[1]);
- 
-    minDepth = 4;
-
-    if ((minDepth + 2) > N)
-        maxDepth = minDepth + 2;
-    else
-        maxDepth = N;
-
-    stretchDepth = maxDepth + 1;
-
-    stretchTree = BottomUpTree(0, stretchDepth);
-    printf
-    (
-        "stretch tree of depth %u\t check: %li\n",
-        stretchDepth,
-        ItemCheck(stretchTree)
-    );
-
-    DeleteTree(stretchTree);
-
-    longLivedTree = BottomUpTree(0, maxDepth);
-
-    for (depth = minDepth; depth <= maxDepth; depth += 2)
-    {
-        long    i, iterations, check;
-
-        iterations = pow(2, maxDepth - depth + minDepth);
-
-        check = 0;
-
-        for (i = 1; i <= iterations; i++)
-        {
-            tempTree = BottomUpTree(i, depth);
-            check += ItemCheck(tempTree);
-            DeleteTree(tempTree);
-
-            tempTree = BottomUpTree(-i, depth);
-            check += ItemCheck(tempTree);
-            DeleteTree(tempTree);
-        } /* for(i = 1...) */
-
-        printf
-        (
-            "%li\t trees of depth %u\t check: %li\n",
-            iterations * 2,
-            depth,
-            check
-        );
-    } /* for(depth = minDepth...) */
-
-    printf
-    (
-        "long lived tree of depth %u\t check: %li\n",
-        maxDepth,
-        ItemCheck(longLivedTree)
-    );
-
-    return 0;
-} /* main() */