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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
Copyright (C) 2017 Paweł Redman
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 3
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 Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "shared.h"
typedef enum {
ENTRY_REVDNS,
ENTRY_WHOIS
} entry_type_t;
typedef struct {
entry_type_t type;
char *pattern;
int niceness;
eli_header list;
} entry_t;
static entry_t *entry_list;
static size_t total_entries;
static int parse_entry(lexer_state_t *lexer, vstr_t *token, entry_type_t type)
{
entry_t *entry;
int niceness;
char *pattern;
if (lexer_get_token(lexer)) {
lexer_perror_eg(lexer, "the niceness adjustment");
return 1;
}
niceness = atoi(vstr_to_cstr(token));
if (lexer_get_token(lexer)) {
lexer_perror_eg(lexer, "the pattern");
return 1;
}
pattern = vstr_strdup(token);
if (!pattern) {
lexer_perror(lexer, "out of memory\n");
return 1;
}
entry = malloc(sizeof(entry_t));
if (!entry) {
free(pattern);
lexer_perror(lexer, "out of memory\n");
return 1;
}
entry->type = type;
entry->niceness = niceness;
entry->pattern = pattern;
eli_append(&entry_list, entry, list);
total_entries++;
return 0;
}
// FIXME: Make this MT-safe (lock the list before adding shit to it)
int lists_load(const char *file, size_t depth)
{
int error = 1, rv;
lexer_state_t lexer;
vstr_t token = VSTR_INITIALIZER;
if (depth > 20) {
eprintf("%s: error: deep recursion (probably a circular dependency)\n", file);
return 1;
}
if ((rv = lexer_open(&lexer, file, &token))) {
perror(file);
return 1;
}
while (!lexer_get_token(&lexer)) {
if (!vstr_cmp(&token, "include")) {
if (lexer_get_token(&lexer)) {
lexer_perror_eg(&lexer, "the filename");
goto out;
}
// FIXME: relative paths
if (lists_load(vstr_to_cstr(&token), depth + 1)) {
lexer_perror(&lexer, "included from here\n");
goto out;
}
} else if (!vstr_cmp(&token, "revdns")) {
if (parse_entry(&lexer, &token, ENTRY_REVDNS))
goto out;
} else if (!vstr_cmp(&token, "whois")) {
if (parse_entry(&lexer, &token, ENTRY_WHOIS))
goto out;
} else {
lexer_perror_eg(&lexer, "'whois' or 'revdns'");
goto out;
}
}
if (depth == 0)
DEBUG("loaded entries: %zu\n", total_entries);
error = 0;
out:
lexer_close(&lexer);
return error;
}
void lists_destroy(void)
{
// TODO...
}
int lists_test(const char *revdns, const char *whois)
{
entry_t *entry;
int total = 0;
eli_for(entry, entry_list, list) {
// TODO: regexps
if (entry->type == ENTRY_REVDNS &&
!strstr(revdns, entry->pattern))
continue;
if (entry->type == ENTRY_WHOIS &&
!strstr(whois, entry->pattern))
continue;
// TODO: avoid overflows
total += entry->niceness;
}
return total;
}
|
