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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* Elastic Binary Trees - example of application to match multiple strings
* (C) 2010 - Willy Tarreau <w@1wt.eu>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <ebsttree.h>
struct eb_root tree = EB_ROOT_UNIQUE; /* EB_ROOT || EB_ROOT_UNIQUE */
int input, match;
void insert_url(const char *url)
{
struct ebmb_node *node;
int l;
l = strlen(url);
while (l && url[l-1] == '\n')
l--;
node = calloc(1, sizeof(*node) + l + 1);
memcpy(node->key, url, l);
node->key[l] = 0;
ebst_insert(&tree, node);
}
void read_urls_from_file(FILE *f)
{
char str[256];
while (fgets(str, sizeof(str), f) != NULL)
insert_url(str);
}
void match_logs_from_stdin()
{
int field;
char line[256];
char *str, *url, *end;
struct ebmb_node *node;
match = 0; input = 0;
/* Note: this construct allows easier use of halog's fgets() */
while ((str = fgets(line, sizeof(line), stdin)) != NULL) {
/* URL is on the 7th field */
url = str;
for (field = 0; field < 6; field++) {
while (*url && *url != ' ')
url++;
while (*url == ' ')
url++;
}
end = url;
while (*end && *end != ' ')
end++;
*end = 0;
if (end == url)
continue;
input++;
node = ebst_lookup(&tree, url);
if (node) {
match++;
puts(str);
}
}
}
int main(int argc, char **argv)
{
FILE *f;
int matches;
if (argc != 2) {
fprintf(stderr,
"Usage:\n"
" $0 url_file < squid_access.log\n"
" Will output all lines referencing one of the URLs from url_file.\n"
);
exit(1);
}
f = fopen(argv[1], "r");
if (!f) {
perror("fopen");
exit(1);
}
read_urls_from_file(f);
fclose(f);
match_logs_from_stdin();
fprintf(stderr, "Matches: %d/%d\n", match, input);
return 0;
}
|
