chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/tcprequest.gcc

@@ -1,122 +0,0 @@
-/* 
- The Great Computer Language Shootout
-  http://shootout.alioth.debian.org/
-
-  contributed by John O'Hare 05 August 2005.
-*/
-
-
-#include <stdio.h>
-#include <sys/socket.h>
-#include <arpa/inet.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-
-#define PORT_NUMBER 12341
-#define M 100
-#define REPLY_SIZE 4096
-#define REQUEST_SIZE 64
-#define BUFFER_SIZE 1024
-
-void server()
-{
-	int sock;
-	int conn;
-	struct sockaddr_in servaddr;
-	struct sockaddr_in cliaddr;
-	unsigned int cliaddr_len;
-	char* reply = malloc(REPLY_SIZE);
-	char* buf = malloc(BUFFER_SIZE);
-
-	memset(reply, '<', REPLY_SIZE);
-
-	if ((sock = socket(PF_INET, SOCK_STREAM, IPPROTO_TCP)) < 0)
-		exit(10);
-
-	memset(&servaddr, 0, sizeof(servaddr));
-	servaddr.sin_family = AF_INET;
-	servaddr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
-	servaddr.sin_port = htons(PORT_NUMBER);
-
-	if (bind(sock, (struct sockaddr *) &servaddr, sizeof(servaddr)) < 0)
-		exit(11);
-
-	if (listen(sock, 1) < 0)
-		exit(12);
-
-	if ((conn = accept(sock, (struct sockaddr *) &cliaddr, &cliaddr_len)) < 0)
-		exit(13);
-
-	while (recv(conn, buf, BUFFER_SIZE, 0) > 0) {
-		if (send(conn, reply, REPLY_SIZE, 0) != REPLY_SIZE)
-			exit(14);
-	}
-
-	close(conn);
-	close(sock);
-
-	free(buf);
-}
-
-void client(int n)
-{
-	int sock;
-	struct sockaddr_in servaddr;
-	char* request = malloc(REQUEST_SIZE);
-	char* buf = malloc(BUFFER_SIZE);
-	int tmpbytes;
-	int bytes = 0;
-	int replies = 0;
-
-	memset(request, '>', REQUEST_SIZE);
-
-	sleep(2); //wait for server to start
-
-	if ((sock = socket(PF_INET, SOCK_STREAM, IPPROTO_TCP)) < 0) 
-		exit(2);
-
-	memset(&servaddr, 0, sizeof(servaddr));
-	servaddr.sin_family = AF_INET;
-	servaddr.sin_addr.s_addr = htonl(INADDR_LOOPBACK);
-	servaddr.sin_port = htons(PORT_NUMBER);
-
-	if (connect(sock, (struct sockaddr *) &servaddr, sizeof(servaddr)) < 0)
-		exit(3);
-
-	while (n-- > 0) {
-		tmpbytes = 0;
-
-		if (send(sock, request, REQUEST_SIZE, 0) != REQUEST_SIZE)
-			exit(4);
-
-		while (tmpbytes < REPLY_SIZE)
-			tmpbytes += recv(sock, buf, BUFFER_SIZE - 1, 0);
-		bytes += tmpbytes;
-		replies++;
-	}
-	close(sock);
-
-	printf("replies: %d\tbytes: %d\n", replies, bytes);
-
-	free(request);
-	free(buf);
-}
-
-int main (int argc, char** argv)
-{	
-	int pid;
-	int n;
-
-	n = (argc == 2 ? atoi(argv[1]) : 1);
-
-	if ((pid = fork()) < 0) {
-		return 1;
-	}
-	if (pid == 0) {
-		client(M * n);
-	} else {
-		server();
-	}
-	return 0;
-}

data/sources/gcc/threadring.gcc

@@ -1,73 +0,0 @@
-/*
-* The Computer Language Benchmarks Game
-* http://shootout.alioth.debian.org/
-
-* contributed by Premysl Hruby
-*/
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <pthread.h>
-#include <string.h>
-#include <limits.h>
-
-#define THREADS (503)
-
-
-struct stack {
-   char x[PTHREAD_STACK_MIN];
-};
-
-
-/* staticaly initialize mutex[0] mutex */
-static pthread_mutex_t mutex[THREADS]; 
-static int data[THREADS];
-static struct stack stacks[THREADS];
-/* stacks must be defined staticaly, or my i386 box run of virtual memory for this
- * process while creating thread +- #400 */
-
-static void* thread(void *num)
-{
-   int l = (int)num;
-   int r = (l+1) % THREADS;
-   int token;
-
-   while(1) {
-      pthread_mutex_lock(mutex + l);
-      token = data[l];
-      if (token) {
-         data[r] = token - 1;
-         pthread_mutex_unlock(mutex + r);
-      }
-      else {
-         printf("%i\n", l+1);
-         exit(0);
-      }
-   }
-}
-
-
-
-int main(int argc, char **argv)
-{
-   int i;
-   pthread_t cthread;
-   pthread_attr_t stack_attr;
-
-   if (argc != 2)
-      exit(255);
-   data[0] = atoi(argv[1]);
-
-   pthread_attr_init(&stack_attr);
-      
-   for (i = 0; i < THREADS; i++) {
-      pthread_mutex_init(mutex + i, NULL);
-      pthread_mutex_lock(mutex + i);
-
-      pthread_attr_setstack(&stack_attr, &stacks[i], sizeof(struct stack)); 
-      pthread_create(&cthread, &stack_attr, thread, (void*)i);
-   }
-
-   pthread_mutex_unlock(mutex + 0);
-   pthread_join(cthread, NULL);   
-}

data/sources/gcc/wc.gcc

@@ -1,52 +0,0 @@
-/* -*- mode: c -*-
- * $Id: wc.gcc,v 1.2 2004-06-18 07:02:55 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- *
- * Author: Waldemar Hebisch (hebisch@math.uni.wroc.pl)
- * Optimizations: Michael Herf (mike@herfconsulting.com)
- * Further Revisions: Paul Hsieh (qed@pobox.com)
- */
-
-#include <stdio.h>
-#include <unistd.h>
-#include <limits.h>
-
-#define BSIZ 4096
-
-unsigned long ws[UCHAR_MAX + 1];
-unsigned long nws[UCHAR_MAX + 1];
-char buff[BSIZ];
-
-int main(void) {
-    unsigned long prev_nws = 0x10000L, w_cnt = 0, l_cnt = 0, b_cnt = 0, cnt;
-
-    /* Fill tables */
-    for (cnt = 0; cnt <= UCHAR_MAX; cnt++) {
-         ws[cnt] =  (cnt == ' ' || cnt == '\n' || cnt == '\t') + (0x10000L & -(cnt == '\n'));
-	nws[cnt] = !(cnt == ' ' || cnt == '\n' || cnt == '\t') +  0x10000L;
-    }
-
-    
-    /* Main loop */
-    while (0 != (cnt = read (0, buff, BSIZ))) {
-        unsigned long vect_count = 0;
-	unsigned char *pp, *pe;
-
-	b_cnt += cnt;
-	pe = buff + cnt;
-	pp = buff;
-
-	while (pp < pe) {
-	    vect_count +=  ws[*pp] & prev_nws;
-	    prev_nws    = nws[*pp];
-	    pp ++;
-	}
-	w_cnt += vect_count  & 0xFFFFL;
-	l_cnt += vect_count >> 16;
-    }
-
-    w_cnt += 1 & prev_nws;
-
-    printf ("%d %d %d\n", l_cnt, w_cnt, b_cnt);
-    return 0;
-}

data/sources/gcc/wc.gcc-2.gcc

@@ -1,40 +0,0 @@
-/* -*- mode: c -*-
- * $Id: wc.gcc-2.gcc,v 1.1 2004-11-10 06:42:03 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.
- *
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-enum {
-    OUT,			/* outside a word */
-    IN				/* inside a word */
-};
-
-int
-main() {
-    int c, nl, nw, nc, state;
-
-    state = OUT;
-    nl = nw = nc = 0;
-    while ((c = getchar()) != EOF) {
-	++nc;
-	if (c == '\n')
-	    ++nl;
-	if (c == ' ' || c == '\n' || c == '\t')
-	    state = OUT;
-	else if (state == OUT) {
-	    state = IN;
-	    ++nw;
-	}
-    }
-    printf("%d %d %d\n", nl, nw, nc);
-    return(0);
-}

data/sources/gcc/wc.gcc-3.gcc

@@ -1,46 +0,0 @@
-/* -*- mode: c -*-
- * $Id: wc.gcc-3.gcc,v 1.1 2004-11-10 06:42:03 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.
- *
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <unistd.h>
-
-enum {
-    OUT,			/* outside a word */
-    IN				/* inside a word */
-};
-
-
-int
-main() {
-    int i, c, nl, nw, nc, state, nread;
-    char buf[4096];
-
-    state = OUT;
-    nl = nw = nc = 0;
-    while ((nread = read(0, buf, sizeof(buf))) > 0) {
-	nc += nread;
-	for (i=0; i<nread; i++) {
-	    c = buf[i];
-	    if (c == '\n')
-		++nl;
-	    if (c == ' ' || c == '\n' || c == '\t')
-		state = OUT;
-	    else if (state == OUT) {
-		state = IN;
-		++nw;
-	    }
-	}
-    }
-    printf("%d %d %d\n", nl, nw, nc);
-    return(0);
-}

data/sources/gcc/wordfreq.gcc-2.gcc

@@ -1,85 +0,0 @@
-/* -*- mode: c -*-
- * $Id: wordfreq.gcc-2.gcc,v 1.1 2004-11-10 06:40:32 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- * From Kerry Clendinning
- */
-
-#include <stdio.h>
-#include <ctype.h>
-#include <malloc.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define NALPHA 26		/* number of letters in the alphabet */
-struct onebytehash {
-    int count;
-    struct onebytehash *next_chain,*next_hash[NALPHA];
-    char string[1];		/* one of those stretchy string-things */
-};
-
-int compare(struct onebytehash **a, struct onebytehash **b);
-typedef int (*comparator)(const void *, const void *);
-
-int
-main()
-{
-    int c, nextc, i = 0, curbufsz = 200, used_hash_count = 0;
-    struct onebytehash the_hash = {0,NULL},
-	*current_hash = &the_hash, *chain = NULL;
-    struct onebytehash **sort_array, **sort_tmp;
-    char *buf;
-
-    buf = malloc(curbufsz + 1);
-    c = getchar();
-    while ( (nextc = getchar()) > 0 ) {
-        if (isalpha(c)) {
-            buf[i++] = tolower(c);
-            buf[i] = '\0';
-            c = tolower(c) - 'a';
-            if (!current_hash->next_hash[c]) {
-                if (i >= curbufsz) {
-		    curbufsz *= 2;
-		    buf = realloc(buf,curbufsz + 1);
-                } 
-                current_hash->next_hash[c] =
-		    malloc(sizeof(struct onebytehash) + i+1);
-                bzero(current_hash->next_hash[c],sizeof(struct onebytehash));
-                current_hash->next_hash[c]->next_chain = chain;
-                chain = current_hash->next_hash[c];
-                strcpy(chain->string,buf);
-            }
-            current_hash = current_hash->next_hash[c];
-            if (!isalpha(nextc)) {
-                if (!current_hash->count) used_hash_count++;
-                current_hash->count++;
-            }
-        } else {
-            current_hash = &the_hash;
-            i = 0;
-        }
-        c = nextc;
-    }
-
-    sort_array = sort_tmp =
-	malloc(sizeof(struct onebytehash *) * used_hash_count);
-    while (chain) {
-	if (chain->count) *sort_tmp++ = chain;
-	chain = chain->next_chain;
-    }
-
-    qsort(sort_array, used_hash_count, sizeof(struct onebytehash *),
-	  (comparator) compare);
-
-    for (i=0;i<used_hash_count;i++)
-	printf("%7d\t%s\n", sort_array[i]->count,sort_array[i]->string); 
-
-    /* don't forget to free allocated memory here */
-
-    return(0);
-}
-
-int compare(struct onebytehash **a, struct onebytehash **b)
-{
-    if ((*b)->count == (*a)->count) return (strcmp((*b)->string,(*a)->string));
-    return ((*b)->count - (*a)->count);
-}

data/sources/perl/ackermann.perl

@@ -1,28 +0,0 @@
-#!/usr/bin/perl
-# $Id: ackermann.perl,v 1.3 2005-04-04 14:56:35 bfulgham Exp $
-# http://www.bagley.org/~doug/shootout/
-
-# With help from Ernesto Hernandez-Novich
-use integer;
-
-# It's prettier but slower to do this
-#sub Ack {
-#    my($M, $N) = @_;
-#    return( $N + 1 )         if ($M == 0);
-#    return( Ack($M - 1, 1) ) if ($N == 0);
-#    Ack($M - 1, Ack($M, $N - 1));
-#}
-
-# in our quest for speed, we must get ugly:
-# it helps reduce stack frame size a little bit
-# from Leif Stensson
-sub Ack {
-    return $_[0] ? ($_[1] ? Ack($_[0]-1, Ack($_[0], $_[1]-1))
-		    : Ack($_[0]-1, 1))
-	: $_[1]+1;
-}
-
-my $NUM = $ARGV[0];
-$NUM = 1 if ($NUM < 1);
-my $ack = Ack(3, $NUM);
-print "Ack(3,$NUM): $ack\n";