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