summaryrefslogtreecommitdiff
path: root/test
diff options
context:
space:
mode:
Diffstat (limited to 'test')
-rwxr-xr-xtest/benchmarks/bit_count1.c30
-rwxr-xr-xtest/benchmarks/bit_count2.c36
-rw-r--r--test/benchmarks/crc32.c106
-rw-r--r--test/benchmarks/gen-rand.c25
-rw-r--r--test/benchmarks/ins-sort.c71
-rw-r--r--test/benchmarks/murmur.c138
-rw-r--r--test/benchmarks/search-kmp.c89
-rw-r--r--test/benchmarks/search-naive.c68
-rw-r--r--test/benchmarks/search-rabin-karp.c81
9 files changed, 644 insertions, 0 deletions
diff --git a/test/benchmarks/bit_count1.c b/test/benchmarks/bit_count1.c
new file mode 100755
index 0000000..c900524
--- /dev/null
+++ b/test/benchmarks/bit_count1.c
@@ -0,0 +1,30 @@
+/*
+ * Bit counter by Ratko Tomic
+ */
+
+long atol(char *);
+int printf(char *s, ...);
+
+int bit_count(long x)
+{
+ int n = 0;
+ if (x) do
+ n++;
+ while (0 != (x = x&(x-1))) ;
+ return(n);
+}
+
+int main(int argc, char **argv)
+{
+ long n = atol(*++argv);
+ long i;
+ int sum = 0;
+
+ if (n == 0)
+ return 1;
+
+ for (i = 0; i < n; ++i)
+ sum += bit_count(i);
+ printf("%d\n", sum);
+ return 0;
+}
diff --git a/test/benchmarks/bit_count2.c b/test/benchmarks/bit_count2.c
new file mode 100755
index 0000000..a57c123
--- /dev/null
+++ b/test/benchmarks/bit_count2.c
@@ -0,0 +1,36 @@
+/* +++Date last modified: 05-Jul-1997 */
+
+int bitcount(long i)
+{
+ i = ((i & 0xAAAAAAAAL) >> 1) + (i & 0x55555555L);
+ i = ((i & 0xCCCCCCCCL) >> 2) + (i & 0x33333333L);
+ i = ((i & 0xF0F0F0F0L) >> 4) + (i & 0x0F0F0F0FL);
+ i = ((i & 0xFF00FF00L) >> 8) + (i & 0x00FF00FFL);
+ i = ((i & 0xFFFF0000L) >> 16) + (i & 0x0000FFFFL);
+ return (int)i;
+}
+
+long atol(char *);
+int printf(char *s, ...);
+
+
+int bit_count(long x)
+{
+ int n = 0;
+ if (x) do
+ n++;
+ while (0 != (x = x&(x-1))) ;
+ return(n);
+}
+
+int main(int argc, char **argv)
+{
+ long n = atol(*++argv);
+ long i;
+
+ int sum = 0;
+ for (i = 0; i < n; ++i)
+ sum += bit_count(i);
+ printf("%d\n", sum);
+ return 0;
+}
diff --git a/test/benchmarks/crc32.c b/test/benchmarks/crc32.c
new file mode 100644
index 0000000..eb35162
--- /dev/null
+++ b/test/benchmarks/crc32.c
@@ -0,0 +1,106 @@
+void *malloc(unsigned long);
+int printf(char *, ...);
+long atol(char *);
+
+int open(char *, int, int);
+int read(int, char *, unsigned long);
+void exit(int);
+
+static unsigned int crc32[256] =
+ {
+ 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F,
+ 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
+ 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2,
+ 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+ 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9,
+ 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
+ 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C,
+ 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+ 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423,
+ 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
+ 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106,
+ 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+ 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D,
+ 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
+ 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950,
+ 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+ 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7,
+ 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
+ 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA,
+ 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+ 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81,
+ 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
+ 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84,
+ 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+ 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB,
+ 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
+ 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E,
+ 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+ 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55,
+ 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
+ 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28,
+ 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+ 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F,
+ 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
+ 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242,
+ 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+ 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69,
+ 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
+ 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC,
+ 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+ 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693,
+ 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
+ 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D };
+
+static void CRC32_update_byte(unsigned int *crc, unsigned char byte)
+{
+ *crc = crc32[(*crc ^ byte) & 0xFF] ^ (*crc >> 8);
+}
+
+static void CRC32_update_buf(unsigned int *crc, unsigned char *buffer,
+ int size)
+{
+ int i;
+ unsigned int c = *crc;
+
+ for(i = 0; i < size; ++i)
+ c = crc32[(c^buffer[i]) & 0xFF] ^ ( c >> 8 );
+ *crc = c;
+}
+
+char *read_file(int fd, int *len)
+{
+ int size = 1500 * 1024 * 1024;
+ unsigned char *arr = malloc(size);
+ int i;
+ for (i = 0; ;) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd < 0)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv)
+{
+ unsigned int crc = 0xffffffff;
+ long i;
+ char *arr;
+ int len;
+
+ int fd = open(argv[1], 0, 0);
+ if (fd == -1)
+ return 1;
+
+ arr = read_file(fd, &len);
+
+ CRC32_update_buf(&crc, arr, len);
+
+ printf("%u\n", crc);
+ return 0;
+}
diff --git a/test/benchmarks/gen-rand.c b/test/benchmarks/gen-rand.c
new file mode 100644
index 0000000..4c356e8
--- /dev/null
+++ b/test/benchmarks/gen-rand.c
@@ -0,0 +1,25 @@
+#include <unistd.h>
+#include <stdlib.h>
+#include <stdio.h>
+
+int main(int argc, char **argv)
+{
+ int seed, size, i;
+ if (argc != 3)
+ return 1;
+ seed = atoi(argv[1]);
+ if (seed == 0) {
+ printf("invalid seed value\n");
+ return 1;
+ }
+ size = atoi(argv[2]);
+ if (size == 0) {
+ printf("invalid size value\n");
+ return 1;
+ }
+ srandom(seed);
+
+ for (i = 0; i < size; ++i)
+ putchar(random());
+ return 0;
+}
diff --git a/test/benchmarks/ins-sort.c b/test/benchmarks/ins-sort.c
new file mode 100644
index 0000000..939be81
--- /dev/null
+++ b/test/benchmarks/ins-sort.c
@@ -0,0 +1,71 @@
+void *malloc(unsigned long);
+int printf(char *, ...);
+long atol(char *);
+void exit(int);
+int open(char *, int, int);
+long read(int, void *, unsigned long);
+
+void insertion_sort(int *a, long n)
+{
+ long i, j;
+ for (i = 1; i < n; ++i) {
+ for (j = i; j > 0; --j) {
+ if (a[j] < a[j-1]) {
+ int tmp = a[j];
+ a[j] = a[j-1];
+ a[j-1] = tmp;
+ } else {
+ break;
+ }
+ }
+ }
+}
+
+void *read_arr(int fd, int *len)
+{
+ int size = 1024 * 1024 * 20;
+ int i;
+ char *arr = malloc(size);
+
+ for (i = 0; ; ) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd == -1)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+ printf("input is collected\n");
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv)
+{
+ int i, len;
+ unsigned int sum = 0;
+ int *arr;
+ int fd;
+
+ if (argc != 2) {
+ printf("%d\n", argc);
+ return 1;
+ }
+
+ len = atol(argv[1]);
+ fd = open(argv[1], 0, 0);
+ if (fd == -1)
+ return 1;
+ arr = read_arr(fd, &len);
+
+ len /= 4;
+
+ if (len != 64000)
+ return 10;
+
+ insertion_sort(arr, len);
+ for (i = 0; i < len; ++i)
+ sum = 2 * sum + arr[i];
+ printf("%u\n", sum);
+ return 0;
+}
diff --git a/test/benchmarks/murmur.c b/test/benchmarks/murmur.c
new file mode 100644
index 0000000..09a9441
--- /dev/null
+++ b/test/benchmarks/murmur.c
@@ -0,0 +1,138 @@
+int open(char *, int, int);
+long read(int, unsigned char *, unsigned long);
+int printf(char *, ...);
+void *malloc(unsigned long);
+void exit(int);
+
+void PMurHash32_Process(unsigned int *ph1, unsigned int *pcarry, void *key,
+ int len) {
+ unsigned int h1 = *ph1;
+ unsigned int c = *pcarry;
+ int n = c & 3;
+ int i = (4 - n) & 3;
+
+ unsigned char *ptr = (unsigned char *)key;
+ unsigned char *end;
+
+
+ if (i && i <= len) {
+ do {
+ int _i = i;
+ while (_i--) {
+ c = c >> 8 | *ptr++ << 24;
+ n++;
+ len--;
+ if (n == 4) {
+ do {
+ c *= (0xcc9e2d51);
+ c = (((unsigned int)c << 15) | ((unsigned int)c >> (32 - 15)));
+ c *= (0x1b873593);
+ h1 ^= c;
+ h1 = (((unsigned int)h1 << 13) | ((unsigned int)h1 >> (32 - 13)));
+ h1 = h1 * 5 + 0xe6546b64;
+ } while (0);
+ n = 0;
+ }
+ }
+ } while (0);
+ }
+
+ end = ptr + len / 4 * 4;
+ for (; ptr < end; ptr += 4) {
+ unsigned int k1;
+
+ k1 = (ptr[0] | ptr[1] << 8 | ptr[2] << 16 | ptr[3] << 24);
+ do {
+ k1 *= (0xcc9e2d51);
+ k1 = (((unsigned int)k1 << 15) | ((unsigned int)k1 >> (32 - 15)));
+ k1 *= (0x1b873593);
+ h1 ^= k1;
+ h1 = (((unsigned int)h1 << 13) | ((unsigned int)h1 >> (32 - 13)));
+ h1 = h1 * 5 + 0xe6546b64;
+ } while (0);
+ }
+ len -= len / 4 * 4;
+
+ do {
+ int _i = len;
+ while (_i--) {
+ c = c >> 8 | *ptr++ << 24;
+ n++;
+ len--;
+ if (n == 4) {
+ do {
+ c *= (0xcc9e2d51);
+ c = (((unsigned int)c << 15) | ((unsigned int)c >> (32 - 15)));
+ c *= (0x1b873593);
+ h1 ^= c;
+ h1 = (((unsigned int)h1 << 13) | ((unsigned int)h1 >> (32 - 13)));
+ h1 = h1 * 5 + 0xe6546b64;
+ } while (0);
+ n = 0;
+ }
+ }
+ } while (0);
+
+ *ph1 = h1;
+ *pcarry = (c & ~0xff) | n;
+}
+
+unsigned int PMurHash32_Result(unsigned int h, unsigned int carry,
+ unsigned int total_length) {
+ unsigned int k1;
+ int n = carry & 3;
+ if (n) {
+ k1 = carry >> (4 - n) * 8;
+ k1 *= (0xcc9e2d51);
+ k1 = (((unsigned int)k1 << 15) | ((unsigned int)k1 >> (32 - 15)));
+ k1 *= (0x1b873593);
+ h ^= k1;
+ }
+ h ^= total_length;
+
+ h ^= h >> 16;
+ h *= 0x85ebca6b;
+ h ^= h >> 13;
+ h *= 0xc2b2ae35;
+ h ^= h >> 16;
+
+ return h;
+}
+
+unsigned int PMurHash32(unsigned int seed, void *key, int len) {
+ unsigned int h1 = seed, carry = 0;
+ PMurHash32_Process(&h1, &carry, key, len);
+ return PMurHash32_Result(h1, carry, len);
+}
+
+void *read_file(int fd, int *len)
+{
+ int size = 1500 * 1024 * 1024;
+ unsigned char *arr = malloc(size);
+ int i;
+ for (i = 0; ;) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd < 0)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv) {
+ int fd, len;
+ char *buf;
+
+ fd = open(argv[1], 0, 0);
+ if (fd == -1)
+ return 1;
+ buf = read_file(fd, &len);
+ printf("len: %d\n", len);
+
+ printf("%u\n", PMurHash32(0, buf, len));
+ return 0;
+}
diff --git a/test/benchmarks/search-kmp.c b/test/benchmarks/search-kmp.c
new file mode 100644
index 0000000..79ba9c8
--- /dev/null
+++ b/test/benchmarks/search-kmp.c
@@ -0,0 +1,89 @@
+struct result_buf {
+ unsigned long array[24*1024*1024];
+ int len;
+};
+
+struct result_buf rbuf;
+
+int read(int fd, void *buf, unsigned long len);
+void *malloc(unsigned long);
+long strlen(char *);
+int open(char *, int flags, long mode);
+int printf(char *, ...);
+void exit(int);
+
+static void compute_pi(char *p, int len, int *pibuf)
+{
+ int k = 0;
+ int q;
+ pibuf[0] = 0;
+ for (q = 1; q < len; ++q) {
+ while (k > 0 && p[k] != p[q])
+ k = pibuf[k];
+ if (p[k] == p[q])
+ ++k;
+ pibuf[q] = k;
+ }
+}
+
+void kmp(char *p, int plen, char *t, int tlen)
+{
+ int i, q = 0;
+ int *pibuf = malloc(sizeof(int) * plen);
+
+ compute_pi(p, plen, pibuf);
+
+ for (i = 0; i < tlen; ++i) {
+ while (q > 0 && p[q] != t[i])
+ q = pibuf[q-1];
+ if (p[q] == t[i])
+ ++q;
+ if (q == plen) {
+ rbuf.array[rbuf.len] = i + 1 - plen;
+ ++rbuf.len;
+ q = pibuf[q-1];
+ }
+ }
+
+}
+
+void *read_file(int fd, int *len)
+{
+ int size = 1500 * 1024 * 1024;
+ unsigned char *arr = malloc(size);
+ int i;
+ for (i = 0; ;) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd < 0)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv)
+{
+ int i, slen;
+ long sum = 0;
+ char *needle, *buf;
+ int fd = open(argv[1], 0, 0);
+
+ if (fd == -1)
+ return 1;
+
+ needle = argv[2];
+ buf = read_file(fd, &slen);
+ printf("len: %d\n", slen);
+
+ kmp(needle, strlen(needle), buf, slen);
+
+ for (i = 0; i < rbuf.len; ++i)
+ sum += rbuf.array[i];
+ printf("%ld\n", sum);
+
+ return 0;
+}
diff --git a/test/benchmarks/search-naive.c b/test/benchmarks/search-naive.c
new file mode 100644
index 0000000..420ffc9
--- /dev/null
+++ b/test/benchmarks/search-naive.c
@@ -0,0 +1,68 @@
+struct result_buf {
+ unsigned long array[24*1024*1024];
+ int len;
+};
+
+struct result_buf rbuf;
+
+int read(int fd, void *buf, unsigned long len);
+void *malloc(unsigned long);
+long strlen(char *);
+int open(char *, int flags, long mode);
+int printf(char *, ...);
+void exit(int);
+
+void str_search(char *h, int hlen, char *n, int nlen)
+{
+ int i;
+ for (i = 0; i < hlen - nlen; ++i) {
+ int j;
+ for (j = 0; j < nlen; ++j) {
+ if (h[i + j] != n[j])
+ break;
+ }
+ if (j == nlen)
+ rbuf.array[rbuf.len++] = i;
+ }
+}
+
+void *read_file(int fd, int *len)
+{
+ int size = 1500 * 1024 * 1024;
+ unsigned char *arr = malloc(size);
+ int i;
+ for (i = 0; ;) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd < 0)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv)
+{
+ int i, slen;
+ long sum = 0;
+ int fd;
+ char *buf;
+ char *needle = argv[2];
+
+ fd = open(argv[1], 0, 0);
+ if (fd == -1)
+ return 1;
+ buf = read_file(fd, &slen);
+ printf("len: %d\n", slen);
+
+ str_search(buf, slen, needle, strlen(needle));
+
+ for (i = 0; i < rbuf.len; ++i)
+ sum += rbuf.array[i];
+ printf("%ld\n", sum);
+
+ return 0;
+}
diff --git a/test/benchmarks/search-rabin-karp.c b/test/benchmarks/search-rabin-karp.c
new file mode 100644
index 0000000..d9860ee
--- /dev/null
+++ b/test/benchmarks/search-rabin-karp.c
@@ -0,0 +1,81 @@
+struct result_buf {
+ unsigned long array[24*1024*1024];
+ int len;
+};
+
+struct result_buf rbuf;
+
+int read(int fd, void *buf, unsigned long len);
+void *malloc(unsigned long);
+long strlen(char *);
+int open(char *, int flags, long mode);
+int printf(char *, ...);
+void exit(int);
+int strncmp(char *, char *, unsigned long);
+
+void rabin_karp(char *p, int plen, char *t, int tlen)
+{
+ unsigned long d = 129;
+ unsigned long h = 1, p_h = 0, t_h = 0;
+ int i;
+ for (i = 0; i < plen - 1; ++i)
+ h = (h * d);
+
+ for (i = 0; i < plen; ++i) {
+ p_h = (d*p_h + p[i]);
+ t_h = (d*t_h + t[i]);
+ }
+
+
+ for (i = 0; i <= tlen - plen; ++i) {
+
+ if (p_h == t_h && strncmp(t + i, p, plen) == 0) {
+ rbuf.array[rbuf.len] = i;
+ ++rbuf.len;
+ }
+ if (i < tlen - plen) {
+ t_h = (d*(t_h - t[i]*h)) + t[i + plen];
+ }
+ }
+}
+
+void *read_file(int fd, int *len)
+{
+ int size = 1500 * 1024 * 1024;
+ unsigned char *arr = malloc(size);
+ int i;
+ for (i = 0; ;) {
+ int rd = read(fd, arr + i, size - i);
+ if (rd < 0)
+ exit(2);
+ if (rd == 0)
+ break;
+ i += rd;
+ }
+
+ *len = i;
+ return arr;
+}
+
+int main(int argc, char **argv)
+{
+ int i, slen;
+ long sum = 0;
+ int fd;
+ char *buf;
+ char *needle = argv[2];
+
+ fd = open(argv[1], 0, 0);
+ if (fd == -1)
+ return 1;
+ buf = read_file(fd, &slen);
+ printf("len: %d\n", slen);
+
+ rabin_karp(needle, strlen(needle), buf, slen);
+
+ for (i = 0; i < rbuf.len; ++i)
+ sum += rbuf.array[i];
+ printf("%ld\n", sum);
+
+ return 0;
+}
generated by cgit v1.2.3 (git 2.39.1) at 2025-10-22 19:16:57 +0000