chrislo-sourceclassifier 0.2.0 → 0.2.1

data/sources/gcc/regexmatch.gcc

@@ -1,136 +0,0 @@
-/* -*- mode: c -*-
- * $Id: regexmatch.gcc,v 1.1.1.1 2004-05-19 18:11:23 bfulgham Exp $
- * http://www.bagley.org/~doug/shootout/
- */
-
-#include <sys/types.h>
-#include <sys/stat.h>
-#include <fcntl.h>
-#include <stdio.h>
-#include <pcre.h>
-#include <string.h>
-
-#define MAXLINES   100
-#define MAXLINELEN 132
-
-char *pattern = 
-"(?:^|[^\\d\\(])"		/* must be preceeded by non-digit */
-"(\\()?"			/* match 1: possible initial left paren */
-"(\\d\\d\\d)"			/* match 2: area code is 3 digits */
-"(?(1)\\))"			/* if match1 then match right paren */
-"[ ]"				/* area code followed by one space */
-"(\\d\\d\\d)"			/* match 3: prefix of 3 digits */
-"[ -]"				/* separator is either space or dash */
-"(\\d\\d\\d\\d)"		/* match 4: last 4 digits */
-"\\D"				/* must be followed by a non-digit */
-;
-
-
-int
-main(int argc, char *argv[]) {
-    int NUM = ((argc == 2) ? atoi(argv[1]) : 1);
-    int count;
-    char *cptr = "";
-    char **phones;
-    pcre *re;
-    int erroffset;
-    const char *errptr;
-    int n, lines = 0;
-    char num[256];
-    int i, j, k, matchlen;
-    char *matchoffset;
-    int nmatches;
-    int *ovec, ovecsize;
-    pcre_extra *study;
-
-    phones = (char **)malloc(MAXLINES * sizeof(char *));
-    if (!phones) {
-	fprintf(stderr, "malloc for phones array failed\n");
-	exit(1);
-    }
-    lines = 0;
-    while (cptr) {
-	phones[lines] = (char *)malloc(MAXLINELEN);
-	if (!phones[lines]) {
-	    fprintf(stderr, "malloc to hold line #%d failed\n", lines);
-	    exit(1);
-	}
-	cptr = fgets(phones[lines], MAXLINELEN, stdin);
-	lines++;
-	if (lines > MAXLINES) {
-	    fprintf(stderr, "MAXLINES is too small\n");
-	    exit(1);
-	}
-    }
-
-    re = pcre_compile(pattern, 0, &errptr, &erroffset, NULL);
-    if (!re) {
-	fprintf(stderr, "can't open compile regexp\n");
-	exit(1);
-    }
-
-    study = pcre_study(re, 0, &errptr);
-
-    if (pcre_fullinfo(re, NULL, PCRE_INFO_CAPTURECOUNT, &nmatches) != 0) {
-	fprintf(stderr, "pcre_fullinfo failed\n");
-	exit(1);
-    }
-    nmatches++;			/* add match of entire pattern */
-
-    ovecsize = sizeof(int) * nmatches * 3;
-    ovec = (int *)malloc(ovecsize);
-    if (!ovec) {
-	fprintf(stderr, "malloc for ovec array failed\n");
-	exit(1);
-    }
-
-    count = 0;
-    while (NUM--) {
-	for (i=0; i<lines; i++) {
-	    n = pcre_exec(re, study,
-			  phones[i], strlen(phones[i]), 0,
-			  0, ovec, ovecsize);
-	    if (n == nmatches) {
-		/* stuff the match into the buffer "num" */
-		k = 2*2;	/* initial offset into ovec */
-		/* areacode */
-		j = 0;
-		num[j++] = '(';
-		matchoffset = phones[i] + ovec[k];
-		matchlen = ovec[k+1] - ovec[k];
-		strncpy(num+j, matchoffset, matchlen);
-		j += matchlen; k += 2;
-		num[j++] = ')';
-		/* space separator */
-		num[j++] = ' ';
-		/* exchange */
-		matchoffset = phones[i] + ovec[k];
-		matchlen = ovec[k+1] - ovec[k];
-		strncpy(num+j, matchoffset, matchlen);
-		j += matchlen; k += 2;
-		/* dash */
-		num[j++] = '-';
-		/* last 4 digits */
-		matchoffset = phones[i] + ovec[k];
-		matchlen = ovec[k+1] - ovec[k];
-		strncpy(num+j, matchoffset, matchlen);
-		j += matchlen; k += 2;
-		/* with a cherry on top */
-		num[j] = 0;
-		if (0 == NUM) {
-		    count++;
-		    printf("%d: %s\n", count, num);
-		}
-	    }
-	}
-    }
-
-    for (i=0; i<MAXLINES; i++) {
-	free(phones[i]);
-    }
-    free(phones);
-    free(ovec);
-
-    return(0);
-}
-

data/sources/gcc/revcomp.gcc

@@ -1,85 +0,0 @@
-/* The Computer Language Benchmarks Game
-   http://shootout.alioth.debian.org
-   contributed by Arek Bochinski
-*/
-
-
-#define _GNU_SOURCE 1
-#include <stdio.h>
-#include <string.h>
-#include <limits.h>
-
-//conversion table
-static const char FtoCOMP[128] = {
-   0,0,0,0,0,0,0,0,0,0,0,0,0,'\n',0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-   0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
-   0,'T','V','G','H',0,0,'C','D',0,0,'M',0,'K','N',0,
-   0,0,'Y','S','A',0,'B','W',0,'R',0, 0, 0,0,0,0,
-   0,'T','V','G','H',0,0,'C','D',0,0,'M',0,'K','N',0,
-   0,0,'Y','S','A',0,'B','W',0,'R',0,0,0,0,0,0
-};
-
-int main (int argc, char * argv[]) {
-    char buffer[10240];
-    int itotal=0,forward=0,end=0;
-    char peek;
-    //print header
-   printf("%s",fgets_unlocked(buffer,61,stdin));
-   while(fgets_unlocked(buffer+itotal,10239,stdin))
-   {
-      //if header is next
-      if((peek=fgetc_unlocked(stdin))=='>')
-      {
-         //get total
-         itotal+=strlen(buffer+itotal);
-         //set the reverse indexes
-         forward=0;
-         end=itotal-2;
-         //reverse the buffer and complement it
-         while(forward<end)
-         {
-            if(buffer[forward]=='\n')++forward;
-            if(buffer[end]=='\n')--end;
-            buffer[forward]^=buffer[end];
-            buffer[end]^=buffer[forward];
-            buffer[forward]^=buffer[end];
-            buffer[end]=FtoCOMP[buffer[end]];
-            buffer[forward]=FtoCOMP[buffer[forward]];
-            ++forward;
-            --end;
-         }
-         //print it out
-         puts(buffer);
-         //print out the next header if there
-         printf("%c%s",'>',fgets_unlocked(buffer,10239,stdin));
-         //reset total
-         itotal=0;
-      }
-      else{
-         //header is not next, plase character back into stdin
-         ungetc(peek,stdin);
-         //sum up the total lenght of characters in the buffer
-         itotal+=strlen(buffer+itotal);
-      }
-   }
-   //print last sequence at end of stdin 
-   itotal+=strlen(buffer+itotal);
-   //set the reverse indexes
-   forward=0;
-   end=itotal-2;
-   //reverse the buffer and complement it
-   while(forward<end)
-   {
-      if(buffer[forward]=='\n')++forward;
-      if(buffer[end]=='\n')--end;
-      buffer[forward]^=buffer[end];
-      buffer[end]^=buffer[forward];
-      buffer[forward]^=buffer[end];
-      buffer[end]=FtoCOMP[buffer[end]];
-      buffer[forward]=FtoCOMP[buffer[forward]];
-      ++forward;
-      --end;
-   }
-   puts(buffer);
-   return 0;
-}

data/sources/gcc/revcomp.gcc-2.gcc

@@ -1,88 +0,0 @@
-#include <stdio.h>
-#include <string.h>
-#include <limits.h>
-
-static unsigned char iubpairs[][2] = {
-    {    'A',    'T'    },
-    {    'C',    'G'    },
-    {    'B',    'V'    },
-    {    'D',    'H'    },
-    {    'K',    'M'    },
-    {    'R',    'Y'    },
-    {    '\0',   '\0'   }
-};
-
-static unsigned char iubComplement[1+UCHAR_MAX];
-
-static void buildIubComplement (void) {
-    int i;
-    for (i=0; i <= UCHAR_MAX; i++) iubComplement[i] = (unsigned char) i;
-    for (i=0; iubpairs[i][0] != '\0'; i++) {
-    	iubComplement[iubpairs[i][0]] = iubpairs[i][1];
-    	iubComplement[iubpairs[i][1]] = iubpairs[i][0];
-    	iubComplement[tolower (iubpairs[i][0])] = iubpairs[i][1];
-    	iubComplement[tolower (iubpairs[i][1])] = iubpairs[i][0];
-    }
-}
-
-static void inPlaceReverse (unsigned char * strand, int len) {
-    int i;
-    for (i=0, len--; i < len; i++,len--) {
-    	unsigned char c = strand[i];
-    	strand[i] = iubComplement[strand[len]];
-    	strand[len] = iubComplement[c];
-    }
-    if (i == len) strand[i] = iubComplement[strand[i]];
-}
-
-static void process (char * strand, int len) {
-    char * s, c;
-
-    inPlaceReverse ((unsigned char *) strand, len);
-    s = strand;
-
-    while (len > 60) {
-    	c = s[60];
-    	s[60] = '\0';
-    	puts (s);
-    	s[60] = c;
-    	s += 60;
-    	len -= 60;
-    }
-
-    s[len] = '\0';
-    puts (s);
-}
-
-int main (int argc, char * argv[]) {
-    static char buffer[1024];
-    char * inp = (char *) malloc (129);
-    int mlen = 128;
-    int slen = 0;
-
-    buildIubComplement ();
-
-    while (NULL != fgets (buffer, 1023, stdin)) {
-    	if (buffer[0] == '>') {
-    	    if (slen > 0) {
-    	    	process (inp, slen);
-    	    	slen = 0;
-    	    }
-    	    printf ("%s", buffer);
-    	} else {
-    	    int l = strlen (buffer);
-    	    while (l > 0 && !isalpha (buffer[l-1])) l--;
-    	    while (slen + l > mlen) {
-    	    	mlen += mlen;
-    	    	inp = (char *) realloc (inp, mlen + 1);
-    	    }
-
-    	    memcpy (inp + slen, buffer, l);
-    	    slen += l;
-    	}
-    }
-    if (slen > 0) process (inp, slen);
-    free (inp);
-    return 0;
-}
-

data/sources/gcc/revcomp.gcc-4.gcc

@@ -1,71 +0,0 @@
-/*
- * The Computer Language Benchmarks Game
- * http://shootout.alioth.debian.org
- *
- * contributed by Bob W 
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-
-#define JBFSIZE 82      // line input buffer size
-#define QBFSIZE 5200     // output buffer initial size
-#define Z16     "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0"
-#define V32     "\0TVGH\0\0CD\0\0M\0KN\0\0\0YSA\0BW\0R\0\0\0\0\0\0"
-#define VALL    Z16 Z16 Z16 Z16 V32 V32 Z16 Z16 Z16 Z16 Z16 Z16 Z16 Z16
-
-int errex(char *s, int n) {      // error message+value, return 1
-  fprintf(stderr,"\n*** Error: %s [%d]!\n", s, n);
-  return 1;
-}
-
-int main () {                    // ***** main *****
-  char *pj, *pq, *pr;            // buffer pointers: inp,out,/out
-  char *jjj = malloc(JBFSIZE);   // allocate input line buffer
-  char *qqq = malloc(QBFSIZE);   // output buffer (dyn. size)
-  char *pqstop = qqq+QBFSIZE;    // end-of-buffer pointer
-  char xtab[256] = VALL;         // char conversion table
-
-  if (!jjj || !qqq)
-    return errex("Buffer allocation", !jjj + !qqq);
-  pj = fgets(jjj,JBFSIZE,stdin);         // fetch 1st line
-  if (!pj)
-    return errex("No input data",0);
-  if (*jjj != '>')
-    return errex("1st char not '>'", 0);
-
-  while (pj) {                           // MAIN LOOP: process data
-    fputs(jjj, stdout);                  // output ID line
-
-    for (pq=qqq+1, pr=pqstop; ; pq++) {  // LOOP: fill output buffer
-      pj = fgets(jjj, JBFSIZE, stdin);   // get line from stdin
-      if (!pj || (*jjj=='>'))  break;    // EOF or new ID line
-      if (pr <= (pq+61)) {               // need to resize buffer
-        char *newstop = pqstop + 12777888;
-        char *newptr  = realloc(qqq, newstop-qqq);
-        if (!newptr)
-          return errex("Out of memory", 0);
-        if (newptr != qqq) {             // new base: adj. pointers
-          size_t x = newptr-qqq;         // offset for pointer update
-          pq+=x;  pr+=x;  qqq+=x;
-          newstop+=x;  pqstop+=x;
-        }
-        pr = __builtin_memmove(newstop-(pqstop-pr), pr, pqstop-pr);
-        pqstop = newstop;                // buffer resize complete
-      }
-      while (*pj) {                      // LOOP: conv. & revert line
-        char c = xtab[(unsigned char)(*pj++)];
-        if (c)                           // conversion valid
-          *(--pr) = c;
-      }
-    }
-
-    for (pq = qqq; pr<pqstop; ) {        // LOOP: format output
-      size_t x = (pqstop-pr)<60 ? pqstop-pr : 60;
-      __builtin_memmove(pq,pr,x);        // move line to free space
-      pr+=x;  pq+=x;  *(pq++) = 0xA;     // adjust pointers, add LF
-    }
-    fwrite(qqq, 1, pq-qqq, stdout);      // output converted data
-  }
-  return 0;
-}

data/sources/gcc/reversefile.gcc

@@ -1,103 +0,0 @@
-/* -*- mode: c -*-
- * $Id: reversefile.gcc,v 1.5 2004-10-18 07:15:07 bfulgham Exp $
- * http://shootout.alioth.debian.org/
- * 
- * from Alan Post <apost@recalcitrant.org>
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <unistd.h>
-#include <assert.h>
-#include <limits.h>
-#include <sys/uio.h>
-
-#define MAXREAD 4096
-#define IOV_MAX 1024
-
-typedef struct buf_t { char d[MAXREAD];
-                       size_t len;
-                       struct buf_t *next;} buf_t;
-
-static print_string( char *data, size_t len,
-                     struct iovec *vec, size_t *p_ivec )
-{
-    vec[ *p_ivec ].iov_base = data;
-    vec[ *p_ivec ].iov_len = (int) len;
-    ++ *p_ivec;
-    if ( *p_ivec == IOV_MAX )
-    {
-        writev( STDOUT_FILENO, vec, *p_ivec );
-        *p_ivec = 0;
-    }
-}
-
-static print_line( char *pos, char *end, buf_t **p_loh,
-                   struct iovec *vec, size_t *p_ivec )
-{
-    print_string( pos, end - pos, vec, p_ivec );
-    for (; *p_loh != NULL; *p_loh = (*p_loh)->next )
-        print_string( (*p_loh)->d, (*p_loh)->len, vec, p_ivec );
-}
-
-static void rev_print( buf_t *head )
-{
-    buf_t *loh = NULL;
-    buf_t *curr = head;
-
-    struct iovec vec[ IOV_MAX ];
-    size_t ivec = 0;
-
-    while ( 1 )
-    {
-        char *buf = curr->d;
-        char *end = buf + curr->len;
-        char *pos = end;
-        for (;; pos--)
-        {
-            if ( pos <= buf )
-            {
-                buf_t *new_curr = curr->next;
-
-                if ( new_curr == NULL )
-                {
-                    print_line( pos, end, &loh, vec, &ivec );
-                    writev( STDOUT_FILENO, vec, ivec );
-                    return;
-                }
-
-                curr->len = end - buf;
-                curr->next = loh;
-                loh = curr;
-                
-                curr = new_curr;
-                break;
-            }
-            if ( *(pos-1) == '\n' )
-            {
-                print_line( pos, end, &loh, vec, &ivec );
-                end = pos;
-            }
-        }
-    }
-    assert( NULL == "unreachable" );
-}
-
-static void f( buf_t *tail )
-{
-    buf_t head;
-
-    head.next = tail;
-    head.len = read( STDIN_FILENO, head.d, MAXREAD );
-
-    if ( head.len == MAXREAD ) f( &head );
-    else rev_print( &head );
-}
-
-int main(int argc, char *argv[])
-{
-    f( NULL );
-    return EXIT_SUCCESS;
-}
-