1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
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;
}
|
