]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * ircd-ratbox: A slightly useful ircd | |
3 | * reject.c: reject users with prejudice | |
4 | * | |
5 | * Copyright (C) 2003 Aaron Sethman <androsyn@ratbox.org> | |
6 | * Copyright (C) 2003-2005 ircd-ratbox development team | |
7 | * | |
8 | * This program is free software; you can redistribute it and/or modify | |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License | |
19 | * along with this program; if not, write to the Free Software | |
20 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 | |
21 | * USA | |
22 | */ | |
23 | ||
24 | #include "stdinc.h" | |
25 | #include "client.h" | |
26 | #include "s_conf.h" | |
27 | #include "reject.h" | |
28 | #include "s_stats.h" | |
29 | #include "ircd.h" | |
30 | #include "send.h" | |
31 | #include "numeric.h" | |
32 | #include "parse.h" | |
33 | #include "hostmask.h" | |
34 | #include "match.h" | |
35 | #include "hash.h" | |
36 | ||
37 | static rb_patricia_tree_t *reject_tree; | |
38 | static rb_dlink_list delay_exit; | |
39 | static rb_dlink_list reject_list; | |
40 | static rb_dlink_list throttle_list; | |
41 | static rb_patricia_tree_t *throttle_tree; | |
42 | static void throttle_expires(void *unused); | |
43 | ||
44 | ||
45 | typedef struct _reject_data | |
46 | { | |
47 | rb_dlink_node rnode; | |
48 | struct ConfItem *aconf; | |
49 | const char *reason; | |
50 | time_t time; | |
51 | unsigned int count; | |
52 | uint32_t mask_hashv; | |
53 | } reject_t; | |
54 | ||
55 | typedef struct _delay_data | |
56 | { | |
57 | rb_dlink_node node; | |
58 | rb_fde_t *F; | |
59 | struct ConfItem *aconf; | |
60 | const char *reason; | |
61 | } delay_t; | |
62 | ||
63 | typedef struct _throttle | |
64 | { | |
65 | rb_dlink_node node; | |
66 | time_t last; | |
67 | int count; | |
68 | } throttle_t; | |
69 | ||
70 | unsigned long | |
71 | delay_exit_length(void) | |
72 | { | |
73 | return rb_dlink_list_length(&delay_exit); | |
74 | } | |
75 | ||
76 | static void | |
77 | reject_free(reject_t *rdata) | |
78 | { | |
79 | struct ConfItem *aconf = rdata->aconf; | |
80 | ||
81 | if (aconf) | |
82 | deref_conf(aconf); | |
83 | ||
84 | rb_free(rdata); | |
85 | } | |
86 | ||
87 | static void | |
88 | reject_exit(void *unused) | |
89 | { | |
90 | static char dynamic_reason[BUFSIZE]; | |
91 | rb_dlink_node *ptr, *ptr_next; | |
92 | delay_t *ddata; | |
93 | static const char *errbuf = "ERROR :Closing Link: (*** Banned (cache))\r\n"; | |
94 | ||
95 | RB_DLINK_FOREACH_SAFE(ptr, ptr_next, delay_exit.head) | |
96 | { | |
97 | ddata = ptr->data; | |
98 | ||
99 | *dynamic_reason = '\0'; | |
100 | ||
101 | if (ddata->aconf) | |
102 | { | |
103 | snprintf(dynamic_reason, BUFSIZE, form_str(ERR_YOUREBANNEDCREEP) "\r\n", | |
104 | me.name, "*", get_user_ban_reason(ddata->aconf)); | |
105 | rb_write(ddata->F, dynamic_reason, strlen(dynamic_reason)); | |
106 | ||
107 | deref_conf(ddata->aconf); | |
108 | } | |
109 | else if (ddata->reason) | |
110 | { | |
111 | snprintf(dynamic_reason, BUFSIZE, ":%s 465 %s :%s\r\n", | |
112 | me.name, "*", ddata->reason); | |
113 | rb_write(ddata->F, dynamic_reason, strlen(dynamic_reason)); | |
114 | } | |
115 | ||
116 | rb_write(ddata->F, errbuf, strlen(errbuf)); | |
117 | rb_close(ddata->F); | |
118 | rb_free(ddata); | |
119 | } | |
120 | ||
121 | delay_exit.head = delay_exit.tail = NULL; | |
122 | delay_exit.length = 0; | |
123 | } | |
124 | ||
125 | static void | |
126 | reject_expires(void *unused) | |
127 | { | |
128 | rb_dlink_node *ptr, *next; | |
129 | rb_patricia_node_t *pnode; | |
130 | reject_t *rdata; | |
131 | ||
132 | RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head) | |
133 | { | |
134 | pnode = ptr->data; | |
135 | rdata = pnode->data; | |
136 | ||
137 | if(rdata->time + ConfigFileEntry.reject_duration > rb_current_time()) | |
138 | continue; | |
139 | ||
140 | rb_dlinkDelete(ptr, &reject_list); | |
141 | reject_free(rdata); | |
142 | rb_patricia_remove(reject_tree, pnode); | |
143 | } | |
144 | } | |
145 | ||
146 | void | |
147 | init_reject(void) | |
148 | { | |
149 | reject_tree = rb_new_patricia(PATRICIA_BITS); | |
150 | throttle_tree = rb_new_patricia(PATRICIA_BITS); | |
151 | rb_event_add("reject_exit", reject_exit, NULL, DELAYED_EXIT_TIME); | |
152 | rb_event_add("reject_expires", reject_expires, NULL, 60); | |
153 | rb_event_add("throttle_expires", throttle_expires, NULL, 10); | |
154 | } | |
155 | ||
156 | unsigned long | |
157 | throttle_size(void) | |
158 | { | |
159 | unsigned long count; | |
160 | rb_dlink_node *ptr; | |
161 | rb_patricia_node_t *pnode; | |
162 | throttle_t *t; | |
163 | ||
164 | count = 0; | |
165 | RB_DLINK_FOREACH(ptr, throttle_list.head) | |
166 | { | |
167 | pnode = ptr->data; | |
168 | t = pnode->data; | |
169 | if (t->count > ConfigFileEntry.throttle_count) | |
170 | count++; | |
171 | } | |
172 | ||
173 | return count; | |
174 | } | |
175 | ||
176 | void | |
177 | add_reject(struct Client *client_p, const char *mask1, const char *mask2, struct ConfItem *aconf, const char *reason) | |
178 | { | |
179 | rb_patricia_node_t *pnode; | |
180 | reject_t *rdata; | |
181 | uint32_t hashv; | |
182 | ||
183 | /* Reject is disabled */ | |
184 | if(ConfigFileEntry.reject_after_count == 0 || ConfigFileEntry.reject_duration == 0) | |
185 | return; | |
186 | ||
187 | hashv = 0; | |
188 | if (mask1 != NULL) | |
189 | hashv ^= fnv_hash_upper((const unsigned char *)mask1, 32); | |
190 | if (mask2 != NULL) | |
191 | hashv ^= fnv_hash_upper((const unsigned char *)mask2, 32); | |
192 | ||
193 | if((pnode = rb_match_ip(reject_tree, (struct sockaddr *)&client_p->localClient->ip)) != NULL) | |
194 | { | |
195 | rdata = pnode->data; | |
196 | rdata->time = rb_current_time(); | |
197 | rdata->count++; | |
198 | } | |
199 | else | |
200 | { | |
201 | int bitlen = 32; | |
202 | if(GET_SS_FAMILY(&client_p->localClient->ip) == AF_INET6) | |
203 | bitlen = 128; | |
204 | pnode = make_and_lookup_ip(reject_tree, (struct sockaddr *)&client_p->localClient->ip, bitlen); | |
205 | pnode->data = rdata = rb_malloc(sizeof(reject_t)); | |
206 | rb_dlinkAddTail(pnode, &rdata->rnode, &reject_list); | |
207 | rdata->time = rb_current_time(); | |
208 | rdata->count = 1; | |
209 | rdata->aconf = NULL; | |
210 | rdata->reason = NULL; | |
211 | } | |
212 | rdata->mask_hashv = hashv; | |
213 | ||
214 | if (aconf != NULL && aconf != rdata->aconf && (aconf->status & CONF_KILL) && aconf->passwd) | |
215 | { | |
216 | if (rdata->aconf != NULL) | |
217 | deref_conf(rdata->aconf); | |
218 | aconf->clients++; | |
219 | rdata->aconf = aconf; | |
220 | } | |
221 | else if (reason != NULL) | |
222 | { | |
223 | if (rdata->aconf != NULL) | |
224 | deref_conf(rdata->aconf); | |
225 | rdata->aconf = NULL; | |
226 | rdata->reason = reason; | |
227 | } | |
228 | } | |
229 | ||
230 | int | |
231 | check_reject(rb_fde_t *F, struct sockaddr *addr) | |
232 | { | |
233 | rb_patricia_node_t *pnode; | |
234 | reject_t *rdata; | |
235 | delay_t *ddata; | |
236 | ||
237 | /* Reject is disabled */ | |
238 | if (ConfigFileEntry.reject_after_count == 0 || ConfigFileEntry.reject_duration == 0) | |
239 | return 0; | |
240 | ||
241 | pnode = rb_match_ip(reject_tree, addr); | |
242 | if (pnode == NULL) | |
243 | return 0; | |
244 | ||
245 | rdata = pnode->data; | |
246 | rdata->time = rb_current_time(); | |
247 | ||
248 | if (rdata->count <= (unsigned long)ConfigFileEntry.reject_after_count) | |
249 | return 0; | |
250 | ||
251 | if (rdata->aconf != NULL && rdata->aconf->status & CONF_ILLEGAL) | |
252 | { | |
253 | rb_dlinkDelete(&rdata->rnode, &reject_list); | |
254 | reject_free(rdata); | |
255 | rb_patricia_remove(reject_tree, pnode); | |
256 | return 0; | |
257 | } | |
258 | ||
259 | ddata = rb_malloc(sizeof(delay_t)); | |
260 | ServerStats.is_rej++; | |
261 | rb_setselect(F, RB_SELECT_WRITE | RB_SELECT_READ, NULL, NULL); | |
262 | if (rdata->aconf) | |
263 | { | |
264 | ddata->aconf = rdata->aconf; | |
265 | ddata->aconf->clients++; | |
266 | ddata->reason = NULL; | |
267 | } | |
268 | else if (rdata->reason) | |
269 | { | |
270 | ddata->reason = rdata->reason; | |
271 | ddata->aconf = NULL; | |
272 | } | |
273 | else | |
274 | { | |
275 | ddata->aconf = NULL; | |
276 | ddata->reason = NULL; | |
277 | } | |
278 | ddata->F = F; | |
279 | rb_dlinkAdd(ddata, &ddata->node, &delay_exit); | |
280 | return 1; | |
281 | } | |
282 | ||
283 | int | |
284 | is_reject_ip(struct sockaddr *addr) | |
285 | { | |
286 | rb_patricia_node_t *pnode; | |
287 | reject_t *rdata; | |
288 | int duration; | |
289 | ||
290 | /* Reject is disabled */ | |
291 | if(ConfigFileEntry.reject_after_count == 0 || ConfigFileEntry.reject_duration == 0) | |
292 | return 0; | |
293 | ||
294 | pnode = rb_match_ip(reject_tree, addr); | |
295 | if(pnode != NULL) | |
296 | { | |
297 | rdata = pnode->data; | |
298 | ||
299 | if(rdata->count > (unsigned long)ConfigFileEntry.reject_after_count) | |
300 | { | |
301 | duration = rdata->time + ConfigFileEntry.reject_duration - rb_current_time(); | |
302 | return duration > 0 ? duration : 1; | |
303 | } | |
304 | } | |
305 | return 0; | |
306 | } | |
307 | ||
308 | void | |
309 | flush_reject(void) | |
310 | { | |
311 | rb_dlink_node *ptr, *next; | |
312 | rb_patricia_node_t *pnode; | |
313 | reject_t *rdata; | |
314 | ||
315 | RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head) | |
316 | { | |
317 | pnode = ptr->data; | |
318 | rdata = pnode->data; | |
319 | rb_dlinkDelete(ptr, &reject_list); | |
320 | reject_free(rdata); | |
321 | rb_patricia_remove(reject_tree, pnode); | |
322 | } | |
323 | } | |
324 | ||
325 | int | |
326 | remove_reject_ip(const char *ip) | |
327 | { | |
328 | rb_patricia_node_t *pnode; | |
329 | ||
330 | /* Reject is disabled */ | |
331 | if(ConfigFileEntry.reject_after_count == 0 || ConfigFileEntry.reject_duration == 0) | |
332 | return -1; | |
333 | ||
334 | if((pnode = rb_match_string(reject_tree, ip)) != NULL) | |
335 | { | |
336 | reject_t *rdata = pnode->data; | |
337 | rb_dlinkDelete(&rdata->rnode, &reject_list); | |
338 | reject_free(rdata); | |
339 | rb_patricia_remove(reject_tree, pnode); | |
340 | return 1; | |
341 | } | |
342 | return 0; | |
343 | } | |
344 | ||
345 | int | |
346 | remove_reject_mask(const char *mask1, const char *mask2) | |
347 | { | |
348 | rb_dlink_node *ptr, *next; | |
349 | rb_patricia_node_t *pnode; | |
350 | reject_t *rdata; | |
351 | uint32_t hashv; | |
352 | int n = 0; | |
353 | ||
354 | hashv = 0; | |
355 | if (mask1 != NULL) | |
356 | hashv ^= fnv_hash_upper((const unsigned char *)mask1, 32); | |
357 | if (mask2 != NULL) | |
358 | hashv ^= fnv_hash_upper((const unsigned char *)mask2, 32); | |
359 | RB_DLINK_FOREACH_SAFE(ptr, next, reject_list.head) | |
360 | { | |
361 | pnode = ptr->data; | |
362 | rdata = pnode->data; | |
363 | if (rdata->mask_hashv == hashv) | |
364 | { | |
365 | rb_dlinkDelete(ptr, &reject_list); | |
366 | reject_free(rdata); | |
367 | rb_patricia_remove(reject_tree, pnode); | |
368 | n++; | |
369 | } | |
370 | } | |
371 | return n; | |
372 | } | |
373 | ||
374 | int | |
375 | throttle_add(struct sockaddr *addr) | |
376 | { | |
377 | throttle_t *t; | |
378 | rb_patricia_node_t *pnode; | |
379 | ||
380 | if((pnode = rb_match_ip(throttle_tree, addr)) != NULL) | |
381 | { | |
382 | t = pnode->data; | |
383 | ||
384 | if(t->count > ConfigFileEntry.throttle_count) | |
385 | { | |
386 | ServerStats.is_thr++; | |
387 | return 1; | |
388 | } | |
389 | /* Stop penalizing them after they've been throttled */ | |
390 | t->last = rb_current_time(); | |
391 | t->count++; | |
392 | ||
393 | } else { | |
394 | int bitlen = 32; | |
395 | if(GET_SS_FAMILY(addr) == AF_INET6) | |
396 | bitlen = 128; | |
397 | t = rb_malloc(sizeof(throttle_t)); | |
398 | t->last = rb_current_time(); | |
399 | t->count = 1; | |
400 | pnode = make_and_lookup_ip(throttle_tree, addr, bitlen); | |
401 | pnode->data = t; | |
402 | rb_dlinkAdd(pnode, &t->node, &throttle_list); | |
403 | } | |
404 | return 0; | |
405 | } | |
406 | ||
407 | int | |
408 | is_throttle_ip(struct sockaddr *addr) | |
409 | { | |
410 | throttle_t *t; | |
411 | rb_patricia_node_t *pnode; | |
412 | int duration; | |
413 | ||
414 | if((pnode = rb_match_ip(throttle_tree, addr)) != NULL) | |
415 | { | |
416 | t = pnode->data; | |
417 | if(t->count > ConfigFileEntry.throttle_count) | |
418 | { | |
419 | duration = t->last + ConfigFileEntry.throttle_duration - rb_current_time(); | |
420 | return duration > 0 ? duration : 1; | |
421 | } | |
422 | } | |
423 | return 0; | |
424 | } | |
425 | ||
426 | void | |
427 | flush_throttle(void) | |
428 | { | |
429 | rb_dlink_node *ptr, *next; | |
430 | rb_patricia_node_t *pnode; | |
431 | throttle_t *t; | |
432 | ||
433 | RB_DLINK_FOREACH_SAFE(ptr, next, throttle_list.head) | |
434 | { | |
435 | pnode = ptr->data; | |
436 | t = pnode->data; | |
437 | ||
438 | rb_dlinkDelete(ptr, &throttle_list); | |
439 | rb_free(t); | |
440 | rb_patricia_remove(throttle_tree, pnode); | |
441 | } | |
442 | } | |
443 | ||
444 | static void | |
445 | throttle_expires(void *unused) | |
446 | { | |
447 | rb_dlink_node *ptr, *next; | |
448 | rb_patricia_node_t *pnode; | |
449 | throttle_t *t; | |
450 | ||
451 | RB_DLINK_FOREACH_SAFE(ptr, next, throttle_list.head) | |
452 | { | |
453 | pnode = ptr->data; | |
454 | t = pnode->data; | |
455 | ||
456 | if(t->last + ConfigFileEntry.throttle_duration > rb_current_time()) | |
457 | continue; | |
458 | ||
459 | rb_dlinkDelete(ptr, &throttle_list); | |
460 | rb_free(t); | |
461 | rb_patricia_remove(throttle_tree, pnode); | |
462 | } | |
463 | } | |
464 |