code/c/common/competitor.c code/c/common/competitor.h @@ -1,10 +1,105 @@ +/* ekg_sys.h + * Various niceties for programming. + */ + #define GET_CYCLES(x) do { \ unsigned lo, hi; \ __asm__ __volatile(".byte 0x0f, 0x31" : "=a"(lo), "=d"(hi)); \ x = ((unsigned long long)lo)|(((unsigned long long)hi)<<32); \ } while(0) +/* BIN2HEX + * A problem in C is converting a variable-length binary string + * into a character string containing hexidecimal representation + * of each byte. The size of the resultant string given input size n + * is exactly 2n. A version that allocates space and one that relies + * on the user are both implemented. + */ + +/* Initialization function for a 256-byte hex string table */ +inline uint8_t bin2hex_init(char lt[256][2]) +{ + uint16_t i; + if(!lt) return 0; + for(i=0;i<256;i++) { + // Upper nibble + //printf("Doing upper nibble for %u\n", i); fflush(stdout); + switch(i>>4) { + case 0x0: lt[i][0] = '0'; break; + case 0x1: lt[i][0] = '1'; break; + case 0x2: lt[i][0] = '2'; break; + case 0x3: lt[i][0] = '3'; break; + case 0x4: lt[i][0] = '4'; break; + case 0x5: lt[i][0] = '5'; break; + case 0x6: lt[i][0] = '6'; break; + case 0x7: lt[i][0] = '7'; break; + case 0x8: lt[i][0] = '8'; break; + case 0x9: lt[i][0] = '9'; break; + case 0xA: lt[i][0] = 'A'; break; + case 0xB: lt[i][0] = 'B'; break; + case 0xC: lt[i][0] = 'C'; break; + case 0xD: lt[i][0] = 'D'; break; + case 0xE: lt[i][0] = 'E'; break; + case 0xF: lt[i][0] = 'F'; break; + } + + // Lower nibble + //printf("Doing lower nibble for %u\n", i); fflush(stdout); + switch(i & 0x0F) { + case 0x0: lt[i][1] = '0'; break; + case 0x1: lt[i][1] = '1'; break; + case 0x2: lt[i][1] = '2'; break; + case 0x3: lt[i][1] = '3'; break; + case 0x4: lt[i][1] = '4'; break; + case 0x5: lt[i][1] = '5'; break; + case 0x6: lt[i][1] = '6'; break; + case 0x7: lt[i][1] = '7'; break; + case 0x8: lt[i][1] = '8'; break; + case 0x9: lt[i][1] = '9'; break; + case 0xA: lt[i][1] = 'A'; break; + case 0xB: lt[i][1] = 'B'; break; + case 0xC: lt[i][1] = 'C'; break; + case 0xD: lt[i][1] = 'D'; break; + case 0xE: lt[i][1] = 'E'; break; + case 0xF: lt[i][1] = 'F'; break; + } + } + return 1; +} + +/* Non-allocating */ +/* Params are Lookup Table, destination, source, and size of INPUT data */ +inline uint8_t bin2hex(char lt[256][2], char * destination, uint8_t * source, unsigned int size) +{ + unsigned int i = 0; + unsigned int pos = 0; + while(i < size) { + destination[pos] = lt[source[i]][0]; + destination[pos+1] = lt[source[i]][1]; + i++, pos += 2; + } + return pos-1; +} + +/* Allocating + * ONLY USE IF YOU'RE NOT LOOPING OVER THIS FUNCTION! + */ +/* Params are Lookup Table, destination, source, and size of INPUT data */ +inline uint8_t abin2hex(char * destination, uint8_t * source, unsigned int size) +{ + unsigned int i = 0; + unsigned int pos = 0; + char lt[256][2]; + bin2hex_init(lt); + while(i < size) { + destination[pos] = lt[source[i]][0]; + destination[pos+1] = lt[source[i]][1]; + i++, pos += 2; + } + return pos-1; +} +/* ------------------------------------------------------------------- */ /* FAST MEMCMP * Basically takes advantage of the registers on the processor to do * the full word comparisons of the bytes, then switches to stupid code/c/common/ekg_sys.h @@ -2,8 +2,85 @@ #include <stdlib.h> #include <stdint.h> #include "ekg_sys.h" +#include "competitor.h" -int main(int argc, char ** argv) { +#define CRAZY_SIZE (1<<10) + +int bin2hex_main(int argc, char ** argv) { + FILE * rand_fh; + char lt[256][2]; + unsigned int x,y; + char * newhex_dest; + union { + uint32_t u32; + uint8_t u8[4]; + } random_num; + uint16_t i; + printf("***************** BIN2HEX *****************\n"); + + if(bin2hex_init(lt) == 0) { + // Fail.. Leave + fprintf(stderr, "Unable to init lookup table.\n"); + return EXIT_FAILURE; + } + + rand_fh = fopen("/dev/urandom", "r"); + if(!rand_fh) { + fprintf(stderr, "Unable to open random buffer.\n"); + return EXIT_FAILURE; + } + + printf("Table created: \n"); + for(i=0; i<256; i++) { + printf("%c%c", lt[i][0], lt[i][1]); + if(i%15 == 0) printf("\n"); + else printf(" "); + } + + // Initialize crazy binary array + uint8_t * crazy_hex = malloc(CRAZY_SIZE); + for(i=0; i<CRAZY_SIZE-3; i++) { + if((fread(&random_num.u32, 4, 1, rand_fh) == 0)) { + fprintf(stderr, "Could not read 4 bytes from file.\n"); + return EXIT_FAILURE; + } + crazy_hex[i] = random_num.u8[0]; + crazy_hex[i+1] = random_num.u8[1]; + crazy_hex[i+2] = random_num.u8[2]; + crazy_hex[i+3] = random_num.u8[3]; + i += 4; + } + char hex_dest[2 + 2*CRAZY_SIZE]; + hex_dest[0] = '0'; + hex_dest[1] = 'x'; + GET_CYCLES(x); + bin2hex(lt, &hex_dest[2], crazy_hex, CRAZY_SIZE); + GET_CYCLES(y); + printf("time=%u, ", y-x); + printf("Output: %.*s\n", 2 + 2*CRAZY_SIZE, hex_dest); + printf("***************** BIN2HEX *****************\n"); + printf("***************** BIN2HEX Competition *****************\n"); + + size_t hex2ascii_len = 256; + char** hex2ascii; + hex2ascii = malloc(hex2ascii_len*sizeof(char*)); + for(i=0; i<hex2ascii_len; i++) { + hex2ascii[i] = malloc(3*sizeof(char)); + snprintf(hex2ascii[i], 3,"%02X", i); + } + size_t len = 8; + GET_CYCLES(x); + newhex_dest = char_to_hex((const unsigned char*)crazy_hex, CRAZY_SIZE, (char**)hex2ascii); + GET_CYCLES(y); + printf("time=%u, ", y-x); + printf("Output: 0x%s\n", newhex_dest); + + fclose(rand_fh); + + return EXIT_SUCCESS; +} + +int fmemcmp_main(int argc, char ** argv) { char * buf, * buf2; uint32_t buflen, failure = 0, i; unsigned int x,y; @@ -14,7 +91,7 @@ int main(int argc, char ** argv) { buflen = 1000000; } else { buflen = atoi(argv[1]); - if(buflen == 0) return 0; + if(buflen == 0) return EXIT_FAILURE; } if(!(buf = malloc(buflen))) { @@ -87,14 +164,11 @@ int main(int argc, char ** argv) { printf(":: fmemcmp is %g times faster than forloop memcmp.\n", ((float)speed[1])/speed[2]); printf("***************** FMEMCMP *****************\n"); - GET_CYCLES(x); - if(*(uint32_t *)buf != 0xFFFFFFFF) failure = 1; - GET_CYCLES(y); - printf("time=%u, ", y-x); - GET_CYCLES(x); - if((memcmp(buf, buf2, 4)) != 0) failure = 1; - GET_CYCLES(y); - printf("time=%u, ", y-x); - return 1; + return EXIT_SUCCESS; +} + +int main(int argc, char ** argv) { + //fmemcmp_main(argc, argv); + bin2hex_main(argc, argv); } code/c/common/test.c b2ddc1061c356ba75a7485d31e498dacb4178721 578f84490337451d4e00f9cfe205c3cb52131cae Erik Gregg ralree@gmail.com http://github.com/hank/life/commit/76351f2698c290990c17152c9436597aa9033563 76351f2698c290990c17152c9436597aa9033563 2009-10-30T00:49:07-07:00 2009-10-30T00:49:07-07:00 Merge branch 'master' of git@github.com:hank/life 904d7661740043d6c846453b99d7a4256ababc85 Erik Gregg ralree@gmail.com