git://developer.intra2net.com / ipt_ACCOUNT / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
sync with netfilter pom-ng
[ipt_ACCOUNT] / linux / net / ipv4 / netfilter / ipt_ACCOUNT.c
... / ...
CommitLineData
1/***************************************************************************
2 * This is a module which is used for counting packets. *
3 * See http://www.intra2net.com/opensource/ipt_account *
4 * for further information *
5 * *
6 * Copyright (C) 2004-2005 by Intra2net AG *
7 * opensource@intra2net.com *
8 * *
9 * This program is free software; you can redistribute it and/or modify *
10 * it under the terms of the GNU General Public License *
11 * version 2 as published by the Free Software Foundation; *
12 * *
13 ***************************************************************************/
14
15#include <linux/module.h>
16#include <linux/skbuff.h>
17#include <linux/ip.h>
18#include <linux/spinlock.h>
19#include <net/icmp.h>
20#include <net/udp.h>
21#include <net/tcp.h>
22#include <linux/netfilter_ipv4/ip_tables.h>
23#include <linux/kernel.h>
24#include <linux/mm.h>
25#include <linux/string.h>
26#include <asm/uaccess.h>
27
28#include <net/route.h>
29#include <linux/netfilter_ipv4/ipt_ACCOUNT.h>
30
31#if 0
32#define DEBUGP printk
33#else
34#define DEBUGP(format, args...)
35#endif
36
37#if (PAGE_SIZE < 4096)
38#error "ipt_ACCOUNT needs at least a PAGE_SIZE of 4096"
39#endif
40
41static struct ipt_acc_table *ipt_acc_tables = NULL;
42static struct ipt_acc_handle *ipt_acc_handles = NULL;
43static void *ipt_acc_tmpbuf = NULL;
44
45/* Spinlock used for manipulating the current accounting tables/data */
46static spinlock_t ipt_acc_lock = SPIN_LOCK_UNLOCKED;
47/* Spinlock used for manipulating userspace handles/snapshot data */
48static spinlock_t ipt_acc_userspace_lock = SPIN_LOCK_UNLOCKED;
49
50
51/* Recursive free of all data structures */
52static void ipt_acc_data_free(void *data, unsigned char depth)
53{
54 /* Empty data set */
55 if (!data)
56 return;
57
58 /* Free for 8 bit network */
59 if (depth == 0) {
60 free_page((unsigned long)data);
61 return;
62 }
63
64 /* Free for 16 bit network */
65 if (depth == 1) {
66 struct ipt_acc_mask_16 *mask_16 = (struct ipt_acc_mask_16 *)data;
67 u_int32_t b;
68 for (b=0; b <= 255; b++) {
69 if (mask_16->mask_24[b] != 0) {
70 free_page((unsigned long)mask_16->mask_24[b]);
71 }
72 }
73 free_page((unsigned long)data);
74 return;
75 }
76
77 /* Free for 24 bit network */
78 if (depth == 2) {
79 u_int32_t a, b;
80 for (a=0; a <= 255; a++) {
81 if (((struct ipt_acc_mask_8 *)data)->mask_16[a]) {
82 struct ipt_acc_mask_16 *mask_16 = (struct ipt_acc_mask_16*)
83 ((struct ipt_acc_mask_8 *)data)->mask_16[a];
84
85 for (b=0; b <= 255; b++) {
86 if (mask_16->mask_24[b]) {
87 free_page((unsigned long)mask_16->mask_24[b]);
88 }
89 }
90 free_page((unsigned long)mask_16);
91 }
92 }
93 free_page((unsigned long)data);
94 return;
95 }
96
97 printk("ACCOUNT: ipt_acc_data_free called with unknown depth: %d\n",
98 depth);
99 return;
100}
101
102/* Look for existing table / insert new one.
103 Return internal ID or -1 on error */
104static int ipt_acc_table_insert(char *name, u_int32_t ip, u_int32_t netmask)
105{
106 u_int32_t i;
107
108 DEBUGP("ACCOUNT: ipt_acc_table_insert: %s, %u.%u.%u.%u/%u.%u.%u.%u\n",
109 name, NIPQUAD(ip), NIPQUAD(netmask));
110
111 /* Look for existing table */
112 for (i = 0; i < ACCOUNT_MAX_TABLES; i++) {
113 if (strncmp(ipt_acc_tables[i].name, name,
114 ACCOUNT_TABLE_NAME_LEN) == 0) {
115 DEBUGP("ACCOUNT: Found existing slot: %d - "
116 "%u.%u.%u.%u/%u.%u.%u.%u\n", i,
117 NIPQUAD(ipt_acc_tables[i].ip),
118 NIPQUAD(ipt_acc_tables[i].netmask));
119
120 if (ipt_acc_tables[i].ip != ip
121 || ipt_acc_tables[i].netmask != netmask) {
122 printk("ACCOUNT: Table %s found, but IP/netmask mismatch. "
123 "IP/netmask found: %u.%u.%u.%u/%u.%u.%u.%u\n",
124 name, NIPQUAD(ipt_acc_tables[i].ip),
125 NIPQUAD(ipt_acc_tables[i].netmask));
126 return -1;
127 }
128
129 ipt_acc_tables[i].refcount++;
130 DEBUGP("ACCOUNT: Refcount: %d\n", ipt_acc_tables[i].refcount);
131 return i;
132 }
133 }
134
135 /* Insert new table */
136 for (i = 0; i < ACCOUNT_MAX_TABLES; i++) {
137 /* Found free slot */
138 if (ipt_acc_tables[i].name[0] == 0) {
139 u_int32_t j, calc_mask, netsize=0;
140
141 DEBUGP("ACCOUNT: Found free slot: %d\n", i);
142 strncpy (ipt_acc_tables[i].name, name, ACCOUNT_TABLE_NAME_LEN-1);
143
144 ipt_acc_tables[i].ip = ip;
145 ipt_acc_tables[i].netmask = netmask;
146
147 /* Calculate netsize */
148 calc_mask = htonl(netmask);
149 for (j = 31; j >= 0; j--) {
150 if (calc_mask&(1<<j))
151 netsize++;
152 else
153 break;
154 }
155
156 /* Calculate depth from netsize */
157 if (netsize >= 24)
158 ipt_acc_tables[i].depth = 0;
159 else if (netsize >= 16)
160 ipt_acc_tables[i].depth = 1;
161 else if(netsize >= 8)
162 ipt_acc_tables[i].depth = 2;
163
164 DEBUGP("ACCOUNT: calculated netsize: %u -> "
165 "ipt_acc_table depth %u\n", netsize,
166 ipt_acc_tables[i].depth);
167
168 ipt_acc_tables[i].refcount++;
169 if ((ipt_acc_tables[i].data
170 = (void *)get_zeroed_page(GFP_ATOMIC)) == NULL) {
171 printk("ACCOUNT: out of memory for data of table: %s\n", name);
172 memset(&ipt_acc_tables[i], 0,
173 sizeof(struct ipt_acc_table));
174 return -1;
175 }
176
177 return i;
178 }
179 }
180
181 /* No free slot found */
182 printk("ACCOUNT: No free table slot found (max: %d). "
183 "Please increase ACCOUNT_MAX_TABLES.\n", ACCOUNT_MAX_TABLES);
184 return -1;
185}
186
187static int ipt_acc_checkentry(const char *tablename,
188 const struct ipt_entry *e,
189 void *targinfo,
190 unsigned int targinfosize,
191 unsigned int hook_mask)
192{
193 struct ipt_acc_info *info = targinfo;
194 int table_nr;
195
196 if (targinfosize != IPT_ALIGN(sizeof(struct ipt_acc_info))) {
197 DEBUGP("ACCOUNT: targinfosize %u != %u\n",
198 targinfosize, IPT_ALIGN(sizeof(struct ipt_acc_info)));
199 return 0;
200 }
201
202 spin_lock_bh(&ipt_acc_lock);
203 table_nr = ipt_acc_table_insert(info->table_name, info->net_ip,
204 info->net_mask);
205 if (table_nr == -1) {
206 printk("ACCOUNT: Table insert problem. Aborting\n");
207 spin_unlock_bh(&ipt_acc_lock);
208 return 0;
209 }
210 /* Table nr caching so we don't have to do an extra string compare
211 for every packet */
212 info->table_nr = table_nr;
213
214 spin_unlock_bh(&ipt_acc_lock);
215
216 return 1;
217}
218
219static void ipt_acc_deleteentry(void *targinfo, unsigned int targinfosize)
220{
221 u_int32_t i;
222 struct ipt_acc_info *info = targinfo;
223
224 if (targinfosize != IPT_ALIGN(sizeof(struct ipt_acc_info))) {
225 DEBUGP("ACCOUNT: targinfosize %u != %u\n",
226 targinfosize, IPT_ALIGN(sizeof(struct ipt_acc_info)));
227 }
228
229 spin_lock_bh(&ipt_acc_lock);
230
231 DEBUGP("ACCOUNT: ipt_acc_deleteentry called for table: %s (#%d)\n",
232 info->table_name, info->table_nr);
233
234 info->table_nr = -1; /* Set back to original state */
235
236 /* Look for table */
237 for (i = 0; i < ACCOUNT_MAX_TABLES; i++) {
238 if (strncmp(ipt_acc_tables[i].name, info->table_name,
239 ACCOUNT_TABLE_NAME_LEN) == 0) {
240 DEBUGP("ACCOUNT: Found table at slot: %d\n", i);
241
242 ipt_acc_tables[i].refcount--;
243 DEBUGP("ACCOUNT: Refcount left: %d\n",
244 ipt_acc_tables[i].refcount);
245
246 /* Table not needed anymore? */
247 if (ipt_acc_tables[i].refcount == 0) {
248 DEBUGP("ACCOUNT: Destroying table at slot: %d\n", i);
249 ipt_acc_data_free(ipt_acc_tables[i].data,
250 ipt_acc_tables[i].depth);
251 memset(&ipt_acc_tables[i], 0,
252 sizeof(struct ipt_acc_table));
253 }
254
255 spin_unlock_bh(&ipt_acc_lock);
256 return;
257 }
258 }
259
260 /* Table not found */
261 printk("ACCOUNT: Table %s not found for destroy\n", info->table_name);
262 spin_unlock_bh(&ipt_acc_lock);
263}
264
265static void ipt_acc_depth0_insert(struct ipt_acc_mask_24 *mask_24,
266 u_int32_t net_ip, u_int32_t netmask,
267 u_int32_t src_ip, u_int32_t dst_ip,
268 u_int32_t size, u_int32_t *itemcount)
269{
270 unsigned char is_src = 0, is_dst = 0, src_slot, dst_slot;
271 char is_src_new_ip = 0, is_dst_new_ip = 0; /* Check if this entry is new */
272
273 DEBUGP("ACCOUNT: ipt_acc_depth0_insert: %u.%u.%u.%u/%u.%u.%u.%u "
274 "for net %u.%u.%u.%u/%u.%u.%u.%u, size: %u\n", NIPQUAD(src_ip),
275 NIPQUAD(dst_ip), NIPQUAD(net_ip), NIPQUAD(netmask), size);
276
277 /* Check if src/dst is inside our network. */
278 /* Special: net_ip = 0.0.0.0/0 gets stored as src in slot 0 */
279 if (!netmask)
280 src_ip = 0;
281 if ((net_ip&netmask) == (src_ip&netmask))
282 is_src = 1;
283 if ((net_ip&netmask) == (dst_ip&netmask) && netmask)
284 is_dst = 1;
285
286 if (!is_src && !is_dst) {
287 DEBUGP("ACCOUNT: Skipping packet %u.%u.%u.%u/%u.%u.%u.%u "
288 "for net %u.%u.%u.%u/%u.%u.%u.%u\n", NIPQUAD(src_ip),
289 NIPQUAD(dst_ip), NIPQUAD(net_ip), NIPQUAD(netmask));
290 return;
291 }
292
293 /* Calculate array positions */
294 src_slot = (unsigned char)((src_ip&0xFF000000) >> 24);
295 dst_slot = (unsigned char)((dst_ip&0xFF000000) >> 24);
296
297 /* Increase size counters */
298 if (is_src) {
299 /* Calculate network slot */
300 DEBUGP("ACCOUNT: Calculated SRC 8 bit network slot: %d\n", src_slot);
301 if (!mask_24->ip[src_slot].src_packets
302 && !mask_24->ip[src_slot].dst_packets)
303 is_src_new_ip = 1;
304
305 mask_24->ip[src_slot].src_packets++;
306 mask_24->ip[src_slot].src_bytes+=size;
307 }
308 if (is_dst) {
309 DEBUGP("ACCOUNT: Calculated DST 8 bit network slot: %d\n", dst_slot);
310 if (!mask_24->ip[dst_slot].src_packets
311 && !mask_24->ip[dst_slot].dst_packets)
312 is_dst_new_ip = 1;
313
314 mask_24->ip[dst_slot].dst_packets++;
315 mask_24->ip[dst_slot].dst_bytes+=size;
316 }
317
318 /* Increase itemcounter */
319 DEBUGP("ACCOUNT: Itemcounter before: %d\n", *itemcount);
320 if (src_slot == dst_slot) {
321 if (is_src_new_ip || is_dst_new_ip) {
322 DEBUGP("ACCOUNT: src_slot == dst_slot: %d, %d\n",
323 is_src_new_ip, is_dst_new_ip);
324 (*itemcount)++;
325 }
326 } else {
327 if (is_src_new_ip) {
328 DEBUGP("ACCOUNT: New src_ip: %u.%u.%u.%u\n", NIPQUAD(src_ip));
329 (*itemcount)++;
330 }
331 if (is_dst_new_ip) {
332 DEBUGP("ACCOUNT: New dst_ip: %u.%u.%u.%u\n", NIPQUAD(dst_ip));
333 (*itemcount)++;
334 }
335 }
336 DEBUGP("ACCOUNT: Itemcounter after: %d\n", *itemcount);
337}
338
339static void ipt_acc_depth1_insert(struct ipt_acc_mask_16 *mask_16,
340 u_int32_t net_ip, u_int32_t netmask,
341 u_int32_t src_ip, u_int32_t dst_ip,
342 u_int32_t size, u_int32_t *itemcount)
343{
344 /* Do we need to process src IP? */
345 if ((net_ip&netmask) == (src_ip&netmask)) {
346 unsigned char slot = (unsigned char)((src_ip&0x00FF0000) >> 16);
347 DEBUGP("ACCOUNT: Calculated SRC 16 bit network slot: %d\n", slot);
348
349 /* Do we need to create a new mask_24 bucket? */
350 if (!mask_16->mask_24[slot] && (mask_16->mask_24[slot] =
351 (void *)get_zeroed_page(GFP_ATOMIC)) == NULL) {
352 printk("ACCOUNT: Can't process packet because out of memory!\n");
353 return;
354 }
355
356 ipt_acc_depth0_insert((struct ipt_acc_mask_24 *)mask_16->mask_24[slot],
357 net_ip, netmask, src_ip, 0, size, itemcount);
358 }
359
360 /* Do we need to process dst IP? */
361 if ((net_ip&netmask) == (dst_ip&netmask)) {
362 unsigned char slot = (unsigned char)((dst_ip&0x00FF0000) >> 16);
363 DEBUGP("ACCOUNT: Calculated DST 16 bit network slot: %d\n", slot);
364
365 /* Do we need to create a new mask_24 bucket? */
366 if (!mask_16->mask_24[slot] && (mask_16->mask_24[slot]
367 = (void *)get_zeroed_page(GFP_ATOMIC)) == NULL) {
368 printk("ACCOUT: Can't process packet because out of memory!\n");
369 return;
370 }
371
372 ipt_acc_depth0_insert((struct ipt_acc_mask_24 *)mask_16->mask_24[slot],
373 net_ip, netmask, 0, dst_ip, size, itemcount);
374 }
375}
376
377static void ipt_acc_depth2_insert(struct ipt_acc_mask_8 *mask_8,
378 u_int32_t net_ip, u_int32_t netmask,
379 u_int32_t src_ip, u_int32_t dst_ip,
380 u_int32_t size, u_int32_t *itemcount)
381{
382 /* Do we need to process src IP? */
383 if ((net_ip&netmask) == (src_ip&netmask)) {
384 unsigned char slot = (unsigned char)((src_ip&0x0000FF00) >> 8);
385 DEBUGP("ACCOUNT: Calculated SRC 24 bit network slot: %d\n", slot);
386
387 /* Do we need to create a new mask_24 bucket? */
388 if (!mask_8->mask_16[slot] && (mask_8->mask_16[slot]
389 = (void *)get_zeroed_page(GFP_ATOMIC)) == NULL) {
390 printk("ACCOUNT: Can't process packet because out of memory!\n");
391 return;
392 }
393
394 ipt_acc_depth1_insert((struct ipt_acc_mask_16 *)mask_8->mask_16[slot],
395 net_ip, netmask, src_ip, 0, size, itemcount);
396 }
397
398 /* Do we need to process dst IP? */
399 if ((net_ip&netmask) == (dst_ip&netmask)) {
400 unsigned char slot = (unsigned char)((dst_ip&0x0000FF00) >> 8);
401 DEBUGP("ACCOUNT: Calculated DST 24 bit network slot: %d\n", slot);
402
403 /* Do we need to create a new mask_24 bucket? */
404 if (!mask_8->mask_16[slot] && (mask_8->mask_16[slot]
405 = (void *)get_zeroed_page(GFP_ATOMIC)) == NULL) {
406 printk("ACCOUNT: Can't process packet because out of memory!\n");
407 return;
408 }
409
410 ipt_acc_depth1_insert((struct ipt_acc_mask_16 *)mask_8->mask_16[slot],
411 net_ip, netmask, 0, dst_ip, size, itemcount);
412 }
413}
414
415static unsigned int ipt_acc_target(struct sk_buff **pskb,
416 unsigned int hooknum,
417 const struct net_device *in,
418 const struct net_device *out,
419 const void *targinfo,
420 void *userinfo)
421{
422 const struct ipt_acc_info *info =
423 (const struct ipt_acc_info *)targinfo;
424 u_int32_t src_ip = (*pskb)->nh.iph->saddr;
425 u_int32_t dst_ip = (*pskb)->nh.iph->daddr;
426 u_int32_t size = ntohs((*pskb)->nh.iph->tot_len);
427
428 spin_lock_bh(&ipt_acc_lock);
429
430 if (ipt_acc_tables[info->table_nr].name[0] == 0) {
431 printk("ACCOUNT: ipt_acc_target: Invalid table id %u. "
432 "IPs %u.%u.%u.%u/%u.%u.%u.%u\n", info->table_nr,
433 NIPQUAD(src_ip), NIPQUAD(dst_ip));
434 spin_unlock_bh(&ipt_acc_lock);
435 return IPT_CONTINUE;
436 }
437
438 /* 8 bit network or "any" network */
439 if (ipt_acc_tables[info->table_nr].depth == 0) {
440 /* Count packet and check if the IP is new */
441 ipt_acc_depth0_insert(
442 (struct ipt_acc_mask_24 *)ipt_acc_tables[info->table_nr].data,
443 ipt_acc_tables[info->table_nr].ip,
444 ipt_acc_tables[info->table_nr].netmask,
445 src_ip, dst_ip, size, &ipt_acc_tables[info->table_nr].itemcount);
446 spin_unlock_bh(&ipt_acc_lock);
447 return IPT_CONTINUE;
448 }
449
450 /* 16 bit network */
451 if (ipt_acc_tables[info->table_nr].depth == 1) {
452 ipt_acc_depth1_insert(
453 (struct ipt_acc_mask_16 *)ipt_acc_tables[info->table_nr].data,
454 ipt_acc_tables[info->table_nr].ip,
455 ipt_acc_tables[info->table_nr].netmask,
456 src_ip, dst_ip, size, &ipt_acc_tables[info->table_nr].itemcount);
457 spin_unlock_bh(&ipt_acc_lock);
458 return IPT_CONTINUE;
459 }
460
461 /* 24 bit network */
462 if (ipt_acc_tables[info->table_nr].depth == 2) {
463 ipt_acc_depth2_insert(
464 (struct ipt_acc_mask_8 *)ipt_acc_tables[info->table_nr].data,
465 ipt_acc_tables[info->table_nr].ip,
466 ipt_acc_tables[info->table_nr].netmask,
467 src_ip, dst_ip, size, &ipt_acc_tables[info->table_nr].itemcount);
468 spin_unlock_bh(&ipt_acc_lock);
469 return IPT_CONTINUE;
470 }
471
472 printk("ACCOUNT: ipt_acc_target: Unable to process packet. "
473 "Table id %u. IPs %u.%u.%u.%u/%u.%u.%u.%u\n",
474 info->table_nr, NIPQUAD(src_ip), NIPQUAD(dst_ip));
475
476 spin_unlock_bh(&ipt_acc_lock);
477 return IPT_CONTINUE;
478}
479
480/*
481 Functions dealing with "handles":
482 Handles are snapshots of a accounting state.
483
484 read snapshots are only for debugging the code
485 and are very expensive concerning speed/memory
486 compared to read_and_flush.
487
488 The functions aren't protected by spinlocks themselves
489 as this is done in the ioctl part of the code.
490*/
491
492/*
493 Find a free handle slot. Normally only one should be used,
494 but there could be two or more applications accessing the data
495 at the same time.
496*/
497static int ipt_acc_handle_find_slot(void)
498{
499 u_int32_t i;
500 /* Insert new table */
501 for (i = 0; i < ACCOUNT_MAX_HANDLES; i++) {
502 /* Found free slot */
503 if (ipt_acc_handles[i].data == NULL) {
504 /* Don't "mark" data as used as we are protected by a spinlock
505 by the calling function. handle_find_slot() is only a function
506 to prevent code duplication. */
507 return i;
508 }
509 }
510
511 /* No free slot found */
512 printk("ACCOUNT: No free handle slot found (max: %u). "
513 "Please increase ACCOUNT_MAX_HANDLES.\n", ACCOUNT_MAX_HANDLES);
514 return -1;
515}
516
517static int ipt_acc_handle_free(u_int32_t handle)
518{
519 if (handle >= ACCOUNT_MAX_HANDLES) {
520 printk("ACCOUNT: Invalid handle for ipt_acc_handle_free() specified:"
521 " %u\n", handle);
522 return -EINVAL;
523 }
524
525 ipt_acc_data_free(ipt_acc_handles[handle].data,
526 ipt_acc_handles[handle].depth);
527 memset (&ipt_acc_handles[handle], 0, sizeof (struct ipt_acc_handle));
528 return 0;
529}
530
531/* Prepare data for read without flush. Use only for debugging!
532 Real applications should use read&flush as it's way more efficent */
533static int ipt_acc_handle_prepare_read(char *tablename, u_int32_t *count)
534{
535 int handle, i, table_nr=-1;
536 unsigned char depth;
537
538 for (i = 0; i < ACCOUNT_MAX_TABLES; i++)
539 if (strncmp(ipt_acc_tables[i].name, tablename,
540 ACCOUNT_TABLE_NAME_LEN) == 0) {
541 table_nr = i;
542 break;
543 }
544
545 if (table_nr == -1) {
546 printk("ACCOUNT: ipt_acc_handle_prepare_read(): "
547 "Table %s not found\n", tablename);
548 return -1;
549 }
550
551 /* Can't find a free handle slot? */
552 if ((handle = ipt_acc_handle_find_slot()) == -1)
553 return -1;
554
555 /* Fill up handle structure */
556 ipt_acc_handles[handle].ip = ipt_acc_tables[table_nr].ip;
557 ipt_acc_handles[handle].depth = ipt_acc_tables[table_nr].depth;
558 ipt_acc_handles[handle].itemcount = ipt_acc_tables[table_nr].itemcount;
559
560 /* allocate "root" table */
561 if ((ipt_acc_handles[handle].data =
562 (void*)get_zeroed_page(GFP_ATOMIC)) == NULL) {
563 printk("ACCOUNT: out of memory for root table "
564 "in ipt_acc_handle_prepare_read()\n");
565 memset (&ipt_acc_handles[handle], 0,
566 sizeof(struct ipt_acc_handle));
567 return -1;
568 }
569
570 /* Recursive copy of complete data structure */
571 depth = ipt_acc_handles[handle].depth;
572 if (depth == 0) {
573 memcpy(ipt_acc_handles[handle].data,
574 ipt_acc_tables[table_nr].data,
575 sizeof(struct ipt_acc_mask_24));
576 } else if (depth == 1) {
577 struct ipt_acc_mask_16 *src_16 =
578 (struct ipt_acc_mask_16 *)ipt_acc_tables[table_nr].data;
579 struct ipt_acc_mask_16 *network_16 =
580 (struct ipt_acc_mask_16 *)ipt_acc_handles[handle].data;
581 u_int32_t b;
582
583 for (b = 0; b <= 255; b++) {
584 if (src_16->mask_24[b]) {
585 if ((network_16->mask_24[b] =
586 (void*)get_zeroed_page(GFP_ATOMIC)) == NULL) {
587 printk("ACCOUNT: out of memory during copy of 16 bit "
588 "network in ipt_acc_handle_prepare_read()\n");
589 ipt_acc_data_free(ipt_acc_handles[handle].data, depth);
590 memset (&ipt_acc_handles[handle], 0,
591 sizeof(struct ipt_acc_handle));
592 return -1;
593 }
594
595 memcpy(network_16->mask_24[b], src_16->mask_24[b],
596 sizeof(struct ipt_acc_mask_24));
597 }
598 }
599 } else if(depth == 2) {
600 struct ipt_acc_mask_8 *src_8 =
601 (struct ipt_acc_mask_8 *)ipt_acc_tables[table_nr].data;
602 struct ipt_acc_mask_8 *network_8 =
603 (struct ipt_acc_mask_8 *)ipt_acc_handles[handle].data;
604 u_int32_t a;
605
606 for (a = 0; a <= 255; a++) {
607 if (src_8->mask_16[a]) {
608 if ((network_8->mask_16[a] =
609 (void*)get_zeroed_page(GFP_ATOMIC)) == NULL) {
610 printk("ACCOUNT: out of memory during copy of 24 bit network"
611 " in ipt_acc_handle_prepare_read()\n");
612 ipt_acc_data_free(ipt_acc_handles[handle].data, depth);
613 memset (&ipt_acc_handles[handle], 0,
614 sizeof(struct ipt_acc_handle));
615 return -1;
616 }
617
618 memcpy(network_8->mask_16[a], src_8->mask_16[a],
619 sizeof(struct ipt_acc_mask_16));
620
621 struct ipt_acc_mask_16 *src_16 = src_8->mask_16[a];
622 struct ipt_acc_mask_16 *network_16 = network_8->mask_16[a];
623 u_int32_t b;
624
625 for (b = 0; b <= 255; b++) {
626 if (src_16->mask_24[b]) {
627 if ((network_16->mask_24[b] =
628 (void*)get_zeroed_page(GFP_ATOMIC)) == NULL) {
629 printk("ACCOUNT: out of memory during copy of 16 bit"
630 " network in ipt_acc_handle_prepare_read()\n");
631 ipt_acc_data_free(ipt_acc_handles[handle].data,
632 depth);
633 memset (&ipt_acc_handles[handle], 0,
634 sizeof(struct ipt_acc_handle));
635 return -1;
636 }
637
638 memcpy(network_16->mask_24[b], src_16->mask_24[b],
639 sizeof(struct ipt_acc_mask_24));
640 }
641 }
642 }
643 }
644 }
645
646 *count = ipt_acc_tables[table_nr].itemcount;
647 return handle;
648}
649
650/* Prepare data for read and flush it */
651static int ipt_acc_handle_prepare_read_flush(char *tablename, u_int32_t *count)
652{
653 int handle, i, table_nr=-1;
654 void *new_data_page;
655
656 for (i = 0; i < ACCOUNT_MAX_TABLES; i++)
657 if (strncmp(ipt_acc_tables[i].name, tablename,
658 ACCOUNT_TABLE_NAME_LEN) == 0) {
659 table_nr = i;
660 break;
661 }
662
663 if (table_nr == -1) {
664 printk("ACCOUNT: ipt_acc_handle_prepare_read_flush(): "
665 "Table %s not found\n", tablename);
666 return -1;
667 }
668
669 /* Can't find a free handle slot? */
670 if ((handle = ipt_acc_handle_find_slot()) == -1)
671 return -1;
672
673 /* Try to allocate memory */
674 if (!(new_data_page = (void*)get_zeroed_page(GFP_ATOMIC))) {
675 printk("ACCOUNT: ipt_acc_handle_prepare_read_flush(): "
676 "Out of memory!\n");
677 return -1;
678 }
679
680 /* Fill up handle structure */
681 ipt_acc_handles[handle].ip = ipt_acc_tables[table_nr].ip;
682 ipt_acc_handles[handle].depth = ipt_acc_tables[table_nr].depth;
683 ipt_acc_handles[handle].itemcount = ipt_acc_tables[table_nr].itemcount;
684 ipt_acc_handles[handle].data = ipt_acc_tables[table_nr].data;
685 *count = ipt_acc_tables[table_nr].itemcount;
686
687 /* "Flush" table data */
688 ipt_acc_tables[table_nr].data = new_data_page;
689 ipt_acc_tables[table_nr].itemcount = 0;
690
691 return handle;
692}
693
694/* Copy 8 bit network data into a prepared buffer.
695 We only copy entries != 0 to increase performance.
696*/
697static int ipt_acc_handle_copy_data(void *to_user, u_int32_t *to_user_pos,
698 u_int32_t *tmpbuf_pos,
699 struct ipt_acc_mask_24 *data,
700 u_int32_t net_ip, u_int32_t net_OR_mask)
701{
702 struct ipt_acc_handle_ip handle_ip;
703 u_int32_t handle_ip_size = sizeof (struct ipt_acc_handle_ip);
704 u_int32_t i;
705
706 for (i = 0; i <= 255; i++) {
707 if (data->ip[i].src_packets || data->ip[i].dst_packets) {
708 handle_ip.ip = net_ip | net_OR_mask | (i<<24);
709
710 handle_ip.src_packets = data->ip[i].src_packets;
711 handle_ip.src_bytes = data->ip[i].src_bytes;
712 handle_ip.dst_packets = data->ip[i].dst_packets;
713 handle_ip.dst_bytes = data->ip[i].dst_bytes;
714
715 /* Temporary buffer full? Flush to userspace */
716 if (*tmpbuf_pos+handle_ip_size >= PAGE_SIZE) {
717 if (copy_to_user(to_user + *to_user_pos, ipt_acc_tmpbuf,
718 *tmpbuf_pos))
719 return -EFAULT;
720 *to_user_pos = *to_user_pos + *tmpbuf_pos;
721 *tmpbuf_pos = 0;
722 }
723 memcpy(ipt_acc_tmpbuf+*tmpbuf_pos, &handle_ip, handle_ip_size);
724 *tmpbuf_pos += handle_ip_size;
725 }
726 }
727
728 return 0;
729}
730
731/* Copy the data from our internal structure
732 We only copy entries != 0 to increase performance.
733 Overwrites ipt_acc_tmpbuf.
734*/
735static int ipt_acc_handle_get_data(u_int32_t handle, void *to_user)
736{
737 u_int32_t to_user_pos=0, tmpbuf_pos=0, net_ip;
738 unsigned char depth;
739
740 if (handle >= ACCOUNT_MAX_HANDLES) {
741 printk("ACCOUNT: invalid handle for ipt_acc_handle_get_data() "
742 "specified: %u\n", handle);
743 return -1;
744 }
745
746 if (ipt_acc_handles[handle].data == NULL) {
747 printk("ACCOUNT: handle %u is BROKEN: Contains no data\n", handle);
748 return -1;
749 }
750
751 net_ip = ipt_acc_handles[handle].ip;
752 depth = ipt_acc_handles[handle].depth;
753
754 /* 8 bit network */
755 if (depth == 0) {
756 struct ipt_acc_mask_24 *network =
757 (struct ipt_acc_mask_24*)ipt_acc_handles[handle].data;
758 if (ipt_acc_handle_copy_data(to_user, &to_user_pos, &tmpbuf_pos,
759 network, net_ip, 0))
760 return -1;
761
762 /* Flush remaining data to userspace */
763 if (tmpbuf_pos)
764 if (copy_to_user(to_user+to_user_pos, ipt_acc_tmpbuf, tmpbuf_pos))
765 return -1;
766
767 return 0;
768 }
769
770 /* 16 bit network */
771 if (depth == 1) {
772 struct ipt_acc_mask_16 *network_16 =
773 (struct ipt_acc_mask_16*)ipt_acc_handles[handle].data;
774 u_int32_t b;
775 for (b = 0; b <= 255; b++) {
776 if (network_16->mask_24[b]) {
777 struct ipt_acc_mask_24 *network =
778 (struct ipt_acc_mask_24*)network_16->mask_24[b];
779 if (ipt_acc_handle_copy_data(to_user, &to_user_pos,
780 &tmpbuf_pos, network, net_ip, (b << 16)))
781 return -1;
782 }
783 }
784
785 /* Flush remaining data to userspace */
786 if (tmpbuf_pos)
787 if (copy_to_user(to_user+to_user_pos, ipt_acc_tmpbuf, tmpbuf_pos))
788 return -1;
789
790 return 0;
791 }
792
793 /* 24 bit network */
794 if (depth == 2) {
795 struct ipt_acc_mask_8 *network_8 =
796 (struct ipt_acc_mask_8*)ipt_acc_handles[handle].data;
797 u_int32_t a, b;
798 for (a = 0; a <= 255; a++) {
799 if (network_8->mask_16[a]) {
800 struct ipt_acc_mask_16 *network_16 =
801 (struct ipt_acc_mask_16*)network_8->mask_16[a];
802 for (b = 0; b <= 255; b++) {
803 if (network_16->mask_24[b]) {
804 struct ipt_acc_mask_24 *network =
805 (struct ipt_acc_mask_24*)network_16->mask_24[b];
806 if (ipt_acc_handle_copy_data(to_user,
807 &to_user_pos, &tmpbuf_pos,
808 network, net_ip, (a << 8) | (b << 16)))
809 return -1;
810 }
811 }
812 }
813 }
814
815 /* Flush remaining data to userspace */
816 if (tmpbuf_pos)
817 if (copy_to_user(to_user+to_user_pos, ipt_acc_tmpbuf, tmpbuf_pos))
818 return -1;
819
820 return 0;
821 }
822
823 return -1;
824}
825
826static int ipt_acc_set_ctl(struct sock *sk, int cmd,
827 void *user, u_int32_t len)
828{
829 struct ipt_acc_handle_sockopt handle;
830 int ret = -EINVAL;
831
832 if (!capable(CAP_NET_ADMIN))
833 return -EPERM;
834
835 switch (cmd) {
836 case IPT_SO_SET_ACCOUNT_HANDLE_FREE:
837 if (len != sizeof(struct ipt_acc_handle_sockopt)) {
838 printk("ACCOUNT: ipt_acc_set_ctl: wrong data size (%u != %u) "
839 "for IPT_SO_SET_HANDLE_FREE\n",
840 len, sizeof(struct ipt_acc_handle_sockopt));
841 break;
842 }
843
844 if (copy_from_user (&handle, user, len)) {
845 printk("ACCOUNT: ipt_acc_set_ctl: copy_from_user failed for "
846 "IPT_SO_SET_HANDLE_FREE\n");
847 break;
848 }
849
850 spin_lock_bh(&ipt_acc_userspace_lock);
851 ret = ipt_acc_handle_free(handle.handle_nr);
852 spin_unlock_bh(&ipt_acc_userspace_lock);
853 break;
854 case IPT_SO_SET_ACCOUNT_HANDLE_FREE_ALL: {
855 u_int32_t i;
856 spin_lock_bh(&ipt_acc_userspace_lock);
857 for (i = 0; i < ACCOUNT_MAX_HANDLES; i++)
858 ipt_acc_handle_free(i);
859 spin_unlock_bh(&ipt_acc_userspace_lock);
860 ret = 0;
861 break;
862 }
863 default:
864 printk("ACCOUNT: ipt_acc_set_ctl: unknown request %i\n", cmd);
865 }
866
867 return ret;
868}
869
870static int ipt_acc_get_ctl(struct sock *sk, int cmd, void *user, int *len)
871{
872 struct ipt_acc_handle_sockopt handle;
873 int ret = -EINVAL;
874
875 if (!capable(CAP_NET_ADMIN))
876 return -EPERM;
877
878 switch (cmd) {
879 case IPT_SO_GET_ACCOUNT_PREPARE_READ_FLUSH:
880 case IPT_SO_GET_ACCOUNT_PREPARE_READ:
881 if (*len < sizeof(struct ipt_acc_handle_sockopt)) {
882 printk("ACCOUNT: ipt_acc_get_ctl: wrong data size (%u != %u) "
883 "for IPT_SO_GET_ACCOUNT_PREPARE_READ/READ_FLUSH\n",
884 *len, sizeof(struct ipt_acc_handle_sockopt));
885 break;
886 }
887
888 if (copy_from_user (&handle, user,
889 sizeof(struct ipt_acc_handle_sockopt))) {
890 return -EFAULT;
891 break;
892 }
893
894 spin_lock_bh(&ipt_acc_lock);
895 spin_lock_bh(&ipt_acc_userspace_lock);
896 if (cmd == IPT_SO_GET_ACCOUNT_PREPARE_READ_FLUSH)
897 handle.handle_nr = ipt_acc_handle_prepare_read_flush(
898 handle.name, &handle.itemcount);
899 else
900 handle.handle_nr = ipt_acc_handle_prepare_read(
901 handle.name, &handle.itemcount);
902 spin_unlock_bh(&ipt_acc_userspace_lock);
903 spin_unlock_bh(&ipt_acc_lock);
904
905 if (handle.handle_nr == -1) {
906 return -EINVAL;
907 break;
908 }
909
910 if (copy_to_user(user, &handle,
911 sizeof(struct ipt_acc_handle_sockopt))) {
912 return -EFAULT;
913 break;
914 }
915 ret = 0;
916 break;
917 case IPT_SO_GET_ACCOUNT_GET_DATA:
918 if (*len < sizeof(struct ipt_acc_handle_sockopt)) {
919 printk("ACCOUNT: ipt_acc_get_ctl: wrong data size (%u != %u)"
920 " for IPT_SO_GET_ACCOUNT_PREPARE_READ/READ_FLUSH\n",
921 *len, sizeof(struct ipt_acc_handle_sockopt));
922 break;
923 }
924
925 if (copy_from_user (&handle, user,
926 sizeof(struct ipt_acc_handle_sockopt))) {
927 return -EFAULT;
928 break;
929 }
930
931 if (handle.handle_nr >= ACCOUNT_MAX_HANDLES) {
932 return -EINVAL;
933 break;
934 }
935
936 if (*len < ipt_acc_handles[handle.handle_nr].itemcount
937 * sizeof(struct ipt_acc_handle_ip)) {
938 printk("ACCOUNT: ipt_acc_get_ctl: not enough space (%u < %u)"
939 " to store data from IPT_SO_GET_ACCOUNT_GET_DATA\n",
940 *len, ipt_acc_handles[handle.handle_nr].itemcount
941 * sizeof(struct ipt_acc_handle_ip));
942 ret = -ENOMEM;
943 break;
944 }
945
946 spin_lock_bh(&ipt_acc_userspace_lock);
947 ret = ipt_acc_handle_get_data(handle.handle_nr, user);
948 spin_unlock_bh(&ipt_acc_userspace_lock);
949 if (ret) {
950 printk("ACCOUNT: ipt_acc_get_ctl: ipt_acc_handle_get_data"
951 " failed for handle %u\n", handle.handle_nr);
952 break;
953 }
954
955 ret = 0;
956 break;
957 case IPT_SO_GET_ACCOUNT_GET_HANDLE_USAGE: {
958 u_int32_t i;
959 if (*len < sizeof(struct ipt_acc_handle_sockopt)) {
960 printk("ACCOUNT: ipt_acc_get_ctl: wrong data size (%u != %u)"
961 " for IPT_SO_GET_ACCOUNT_GET_HANDLE_USAGE\n",
962 *len, sizeof(struct ipt_acc_handle_sockopt));
963 break;
964 }
965
966 /* Find out how many handles are in use */
967 handle.itemcount = 0;
968 spin_lock_bh(&ipt_acc_userspace_lock);
969 for (i = 0; i < ACCOUNT_MAX_HANDLES; i++)
970 if (ipt_acc_handles[i].data)
971 handle.itemcount++;
972 spin_unlock_bh(&ipt_acc_userspace_lock);
973
974 if (copy_to_user(user, &handle,
975 sizeof(struct ipt_acc_handle_sockopt))) {
976 return -EFAULT;
977 break;
978 }
979 ret = 0;
980 break;
981 }
982 case IPT_SO_GET_ACCOUNT_GET_TABLE_NAMES: {
983 u_int32_t size = 0, i;
984 char *tnames;
985
986 spin_lock_bh(&ipt_acc_lock);
987
988 /* Determine size of table names */
989 for (i = 0; i < ACCOUNT_MAX_TABLES; i++) {
990 if (ipt_acc_tables[i].name[0] != 0)
991 size += strlen (ipt_acc_tables[i].name) + 1;
992 }
993 size += 1; /* Terminating NULL character */
994
995 if (*len < size) {
996 spin_unlock_bh(&ipt_acc_lock);
997 printk("ACCOUNT: ipt_acc_get_ctl: not enough space (%u < %u)"
998 " to store table names\n", *len, size);
999 ret = -ENOMEM;
1000 break;
1001 }
1002 /* Copy table names to userspace */
1003 tnames = user;
1004 for (i = 0; i < ACCOUNT_MAX_TABLES; i++) {
1005 if (ipt_acc_tables[i].name[0] != 0) {
1006 int len = strlen (ipt_acc_tables[i].name) + 1;
1007 /* copy string + terminating zero */
1008 if (copy_to_user(tnames, ipt_acc_tables[i].name, len)) {
1009 spin_unlock_bh(&ipt_acc_lock);
1010 return -EFAULT;
1011 }
1012 tnames += len;
1013 }
1014 }
1015 /* Append terminating zero */
1016 i = 0;
1017 ret = copy_to_user(tnames, &i, 1);
1018 spin_unlock_bh(&ipt_acc_lock);
1019 if (ret)
1020 return -EFAULT;
1021 ret = 0;
1022 break;
1023 }
1024 default:
1025 printk("ACCOUNT: ipt_acc_get_ctl: unknown request %i\n", cmd);
1026 }
1027
1028 return ret;
1029}
1030
1031static struct ipt_target ipt_acc_reg = {
1032 .name = "ACCOUNT",
1033 .target = ipt_acc_target,
1034 .checkentry = ipt_acc_checkentry,
1035 .destroy = ipt_acc_deleteentry,
1036 .me = THIS_MODULE
1037};
1038
1039static struct nf_sockopt_ops ipt_acc_sockopts = {
1040 .pf = PF_INET,
1041 .set_optmin = IPT_SO_SET_ACCOUNT_HANDLE_FREE,
1042 .set_optmax = IPT_SO_SET_ACCOUNT_MAX+1,
1043 .set = ipt_acc_set_ctl,
1044 .get_optmin = IPT_SO_GET_ACCOUNT_PREPARE_READ,
1045 .get_optmax = IPT_SO_GET_ACCOUNT_MAX+1,
1046 .get = ipt_acc_get_ctl
1047};
1048
1049static int __init init(void)
1050{
1051 if ((ipt_acc_tables =
1052 kmalloc(ACCOUNT_MAX_TABLES *
1053 sizeof(struct ipt_acc_table), GFP_KERNEL)) == NULL) {
1054 printk("ACCOUNT: Out of memory allocating account_tables structure");
1055 goto error_cleanup;
1056 }
1057 memset(ipt_acc_tables, 0,
1058 ACCOUNT_MAX_TABLES * sizeof(struct ipt_acc_table));
1059
1060 if ((ipt_acc_handles =
1061 kmalloc(ACCOUNT_MAX_HANDLES *
1062 sizeof(struct ipt_acc_handle), GFP_KERNEL)) == NULL) {
1063 printk("ACCOUNT: Out of memory allocating account_handles structure");
1064 goto error_cleanup;
1065 }
1066 memset(ipt_acc_handles, 0,
1067 ACCOUNT_MAX_HANDLES * sizeof(struct ipt_acc_handle));
1068
1069 /* Allocate one page as temporary storage */
1070 if ((ipt_acc_tmpbuf = (void*)__get_free_page(GFP_KERNEL)) == NULL) {
1071 printk("ACCOUNT: Out of memory for temporary buffer page\n");
1072 goto error_cleanup;
1073 }
1074
1075 /* Register setsockopt */
1076 if (nf_register_sockopt(&ipt_acc_sockopts) < 0) {
1077 printk("ACCOUNT: Can't register sockopts. Aborting\n");
1078 goto error_cleanup;
1079 }
1080
1081 if (ipt_register_target(&ipt_acc_reg))
1082 goto error_cleanup;
1083
1084 return 0;
1085
1086error_cleanup:
1087 if(ipt_acc_tables)
1088 kfree(ipt_acc_tables);
1089 if(ipt_acc_handles)
1090 kfree(ipt_acc_handles);
1091 if (ipt_acc_tmpbuf)
1092 free_page((unsigned long)ipt_acc_tmpbuf);
1093
1094 return -EINVAL;
1095}
1096
1097static void __exit fini(void)
1098{
1099 ipt_unregister_target(&ipt_acc_reg);
1100
1101 nf_unregister_sockopt(&ipt_acc_sockopts);
1102
1103 kfree(ipt_acc_tables);
1104 kfree(ipt_acc_handles);
1105 free_page((unsigned long)ipt_acc_tmpbuf);
1106}
1107
1108module_init(init);
1109module_exit(fini);
1110MODULE_LICENSE("GPL");
high performance accounting for netfilter