Commit f6440f72 authored by Christoph Gerum's avatar Christoph Gerum

Build all benchmarks

parent b5ec667f
FILE = bitcnt_1.c bitcnt_2.c bitcnt_3.c bitcnt_4.c bitcnts.c bitfiles.c bitstrng.c bstr_i.c FILE = bitcnt_1.c bitcnt_2.c bitcnt_3.c bitcnt_4.c bitcnts.c bitfiles.c bitstrng.c bstr_i.c
bitcnts: ${FILE} Makefile bitcnts: ${FILE} Makefile
gcc -static ${FILE} -O3 -o bitcnts arm-linux-gnueabihf-gcc -static ${FILE} -O3 -o bitcnts
clean: clean:
rm -rf bitcnts output* rm -rf bitcnts output*
...@@ -34,8 +34,8 @@ main(int argc, char *argv[]) ...@@ -34,8 +34,8 @@ main(int argc, char *argv[])
n = atol(*++argv); n = atol(*++argv);
i = bit_count(n); i = bit_count(n);
printf("%ld contains %d bit%s set\n", //printf("%ld contains %d bit%s set\n",
n, i, plural_text(i)); // n, i, plural_text(i));
} }
return 0; return 0;
} }
......
...@@ -105,11 +105,11 @@ main(int argc, char *argv[]) ...@@ -105,11 +105,11 @@ main(int argc, char *argv[])
n = atol(*++argv); n = atol(*++argv);
i = BW_btbl_bitcount(n); i = BW_btbl_bitcount(n);
printf("%ld contains %d bit%s set\n", //printf("%ld contains %d bit%s set\n",
n, i, plural_text(i)); // n, i, plural_text(i));
i = AR_btbl_bitcount(n); i = AR_btbl_bitcount(n);
printf("%ld contains %d bit%s set\n", //printf("%ld contains %d bit%s set\n",
n, i, plural_text(i)); // n, i, plural_text(i));
} }
return 0; return 0;
} }
......
...@@ -73,8 +73,8 @@ main(int argc, char *argv[]) ...@@ -73,8 +73,8 @@ main(int argc, char *argv[])
n = atol(*++argv); n = atol(*++argv);
i = btbl_bitcnt(n); i = btbl_bitcnt(n);
printf("%ld contains %d bit%s set\n", //printf("%ld contains %d bit%s set\n",
n, i, plural_text(i)); // n, i, plural_text(i));
} }
return 0; return 0;
} }
......
...@@ -70,10 +70,10 @@ int main(int argc, char *argv[]) ...@@ -70,10 +70,10 @@ int main(int argc, char *argv[])
cmaxix = i; cmaxix = i;
} }
printf("%-38s> Time: %7.3f sec.; Bits: %ld\n", text[i], ct, n); //printf("%-38s> Time: %7.3f sec.; Bits: %ld\n", text[i], ct, n);
} }
printf("\nBest > %s\n", text[cminix]); //printf("\nBest > %s\n", text[cminix]);
printf("Worst > %s\n", text[cmaxix]); //printf("Worst > %s\n", text[cmaxix]);
return 0; return 0;
} }
......
...@@ -54,7 +54,7 @@ int main(void) ...@@ -54,7 +54,7 @@ int main(void)
for (j = 1L; j <= 16L; j++) for (j = 1L; j <= 16L; j++)
{ {
bitstring(s, (long)j, (int)j, 16); bitstring(s, (long)j, (int)j, 16);
printf("%2ld: %s\n", j, s); //printf("%2ld: %s\n", j, s);
} }
return EXIT_SUCCESS; return EXIT_SUCCESS;
} }
......
...@@ -34,7 +34,7 @@ int main(int argc, char *argv[]) ...@@ -34,7 +34,7 @@ int main(int argc, char *argv[])
while (--argc) while (--argc)
{ {
x = bstr_i(arg = *++argv); x = bstr_i(arg = *++argv);
printf("Binary %s = %d = %04Xh\n", arg, x, x); //printf("Binary %s = %d = %04Xh\n", arg, x, x);
} }
return EXIT_SUCCESS; return EXIT_SUCCESS;
} }
......
...@@ -4,9 +4,9 @@ FILE2 = qsort_large.c ...@@ -4,9 +4,9 @@ FILE2 = qsort_large.c
all: qsort_small qsort_large all: qsort_small qsort_large
qsort_small: qsort_small.c Makefile qsort_small: qsort_small.c Makefile
gcc -static qsort_small.c -O3 -o qsort_small -lm arm-linux-gnueabihf-gcc -static qsort_small.c -O3 -o qsort_small -lm
qsort_large: qsort_large.c Makefile qsort_large: qsort_large.c Makefile
gcc -static qsort_large.c -O3 -o qsort_large -lm arm-linux-gnueabihf-gcc -static qsort_large.c -O3 -o qsort_large -lm
clean: clean:
rm -rf qsort_small qsort_large output* rm -rf qsort_small qsort_large output*
...@@ -49,7 +49,7 @@ main(int argc, char *argv[]) { ...@@ -49,7 +49,7 @@ main(int argc, char *argv[]) {
printf("\nSorting %d vectors based on distance from the origin.\n\n",count); printf("\nSorting %d vectors based on distance from the origin.\n\n",count);
qsort(array,count,sizeof(struct my3DVertexStruct),compare); qsort(array,count,sizeof(struct my3DVertexStruct),compare);
for(i=0;i<count;i++) //for(i=0;i<count;i++)
printf("%d %d %d\n", array[i].x, array[i].y, array[i].z); // printf("%d %d %d\n", array[i].x, array[i].y, array[i].z);
return 0; return 0;
} }
...@@ -39,7 +39,7 @@ main(int argc, char *argv[]) { ...@@ -39,7 +39,7 @@ main(int argc, char *argv[]) {
printf("\nSorting %d elements.\n\n",count); printf("\nSorting %d elements.\n\n",count);
qsort(array,count,sizeof(struct myStringStruct),compare); qsort(array,count,sizeof(struct myStringStruct),compare);
for(i=0;i<count;i++) //for(i=0;i<count;i++)
printf("%s\n", array[i].qstring); // printf("%s\n", array[i].qstring);
return 0; return 0;
} }
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment