[net-next-2.6.git] / net / netfilter / nf_conntrack_amanda.c

/* Amanda extension for IP connection tracking
 *
 * (C) 2002 by Brian J. Murrell <netfilter@interlinx.bc.ca>
 * based on HW's ip_conntrack_irc.c as well as other modules
 *
 * 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.
 */
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/textsearch.h>
#include <linux/skbuff.h>
#include <linux/in.h>
#include <linux/udp.h>
#include <linux/netfilter.h>

#include <net/netfilter/nf_conntrack.h>
#include <net/netfilter/nf_conntrack_expect.h>
#include <net/netfilter/nf_conntrack_ecache.h>
#include <net/netfilter/nf_conntrack_helper.h>
#include <linux/netfilter/nf_conntrack_amanda.h>

static unsigned int master_timeout __read_mostly = 300;
static char *ts_algo = "kmp";

MODULE_AUTHOR("Brian J. Murrell <netfilter@interlinx.bc.ca>");
MODULE_DESCRIPTION("Amanda connection tracking module");
MODULE_LICENSE("GPL");
MODULE_ALIAS("ip_conntrack_amanda");
MODULE_ALIAS_NFCT_HELPER("amanda");

module_param(master_timeout, uint, 0600);
MODULE_PARM_DESC(master_timeout, "timeout for the master connection");
module_param(ts_algo, charp, 0400);
MODULE_PARM_DESC(ts_algo, "textsearch algorithm to use (default kmp)");

unsigned int (*nf_nat_amanda_hook)(struct sk_buff *skb,
				   enum ip_conntrack_info ctinfo,
				   unsigned int matchoff,
				   unsigned int matchlen,
				   struct nf_conntrack_expect *exp)
				   __read_mostly;
EXPORT_SYMBOL_GPL(nf_nat_amanda_hook);

enum amanda_strings {
	SEARCH_CONNECT,
	SEARCH_NEWLINE,
	SEARCH_DATA,
	SEARCH_MESG,
	SEARCH_INDEX,
};

static struct {
	const char		*string;
	size_t			len;
	struct ts_config	*ts;
} search[] __read_mostly = {
	[SEARCH_CONNECT] = {
		.string	= "CONNECT ",
		.len	= 8,
	},
	[SEARCH_NEWLINE] = {
		.string	= "\n",
		.len	= 1,
	},
	[SEARCH_DATA] = {
		.string	= "DATA ",
		.len	= 5,
	},
	[SEARCH_MESG] = {
		.string	= "MESG ",
		.len	= 5,
	},
	[SEARCH_INDEX] = {
		.string = "INDEX ",
		.len	= 6,
	},
};

static int amanda_help(struct sk_buff *skb,
		       unsigned int protoff,
		       struct nf_conn *ct,
		       enum ip_conntrack_info ctinfo)
{
	struct ts_state ts;
	struct nf_conntrack_expect *exp;
	struct nf_conntrack_tuple *tuple;
	unsigned int dataoff, start, stop, off, i;
	char pbuf[sizeof("65535")], *tmp;
	u_int16_t len;
	__be16 port;
	int ret = NF_ACCEPT;
	typeof(nf_nat_amanda_hook) nf_nat_amanda;

	/* Only look at packets from the Amanda server */
	if (CTINFO2DIR(ctinfo) == IP_CT_DIR_ORIGINAL)
		return NF_ACCEPT;

	/* increase the UDP timeout of the master connection as replies from
	 * Amanda clients to the server can be quite delayed */
	nf_ct_refresh(ct, skb, master_timeout * HZ);

	/* No data? */
	dataoff = protoff + sizeof(struct udphdr);
	if (dataoff >= skb->len) {
		if (net_ratelimit())
			printk("amanda_help: skblen = %u\n", skb->len);
		return NF_ACCEPT;
	}

	memset(&ts, 0, sizeof(ts));
	start = skb_find_text(skb, dataoff, skb->len,
			      search[SEARCH_CONNECT].ts, &ts);
	if (start == UINT_MAX)
		goto out;
	start += dataoff + search[SEARCH_CONNECT].len;

	memset(&ts, 0, sizeof(ts));
	stop = skb_find_text(skb, start, skb->len,
			     search[SEARCH_NEWLINE].ts, &ts);
	if (stop == UINT_MAX)
		goto out;
	stop += start;

	for (i = SEARCH_DATA; i <= SEARCH_INDEX; i++) {
		memset(&ts, 0, sizeof(ts));
		off = skb_find_text(skb, start, stop, search[i].ts, &ts);
		if (off == UINT_MAX)
			continue;
		off += start + search[i].len;

		len = min_t(unsigned int, sizeof(pbuf) - 1, stop - off);
		if (skb_copy_bits(skb, off, pbuf, len))
			break;
		pbuf[len] = '\0';

		port = htons(simple_strtoul(pbuf, &tmp, 10));
		len = tmp - pbuf;
		if (port == 0 || len > 5)
			break;

		exp = nf_ct_expect_alloc(ct);
		if (exp == NULL) {
			ret = NF_DROP;
			goto out;
		}
		tuple = &ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple;
		nf_ct_expect_init(exp, NF_CT_EXPECT_CLASS_DEFAULT,
				  nf_ct_l3num(ct),
				  &tuple->src.u3, &tuple->dst.u3,
				  IPPROTO_TCP, NULL, &port);

		nf_nat_amanda = rcu_dereference(nf_nat_amanda_hook);
		if (nf_nat_amanda && ct->status & IPS_NAT_MASK)
			ret = nf_nat_amanda(skb, ctinfo, off - dataoff,
					    len, exp);
		else if (nf_ct_expect_related(exp) != 0)
			ret = NF_DROP;
		nf_ct_expect_put(exp);
	}

out:
	return ret;
}

static const struct nf_conntrack_expect_policy amanda_exp_policy = {
	.max_expected		= 3,
	.timeout		= 180,
};

static struct nf_conntrack_helper amanda_helper[2] __read_mostly = {
	{
		.name			= "amanda",
		.me			= THIS_MODULE,
		.help			= amanda_help,
		.tuple.src.l3num	= AF_INET,
		.tuple.src.u.udp.port	= cpu_to_be16(10080),
		.tuple.dst.protonum	= IPPROTO_UDP,
		.expect_policy		= &amanda_exp_policy,
	},
	{
		.name			= "amanda",
		.me			= THIS_MODULE,
		.help			= amanda_help,
		.tuple.src.l3num	= AF_INET6,
		.tuple.src.u.udp.port	= cpu_to_be16(10080),
		.tuple.dst.protonum	= IPPROTO_UDP,
		.expect_policy		= &amanda_exp_policy,
	},
};

static void __exit nf_conntrack_amanda_fini(void)
{
	int i;

	nf_conntrack_helper_unregister(&amanda_helper[0]);
	nf_conntrack_helper_unregister(&amanda_helper[1]);
	for (i = 0; i < ARRAY_SIZE(search); i++)
		textsearch_destroy(search[i].ts);
}

static int __init nf_conntrack_amanda_init(void)
{
	int ret, i;

	for (i = 0; i < ARRAY_SIZE(search); i++) {
		search[i].ts = textsearch_prepare(ts_algo, search[i].string,
						  search[i].len,
						  GFP_KERNEL, TS_AUTOLOAD);
		if (IS_ERR(search[i].ts)) {
			ret = PTR_ERR(search[i].ts);
			goto err1;
		}
	}
	ret = nf_conntrack_helper_register(&amanda_helper[0]);
	if (ret < 0)
		goto err1;
	ret = nf_conntrack_helper_register(&amanda_helper[1]);
	if (ret < 0)
		goto err2;
	return 0;

err2:
	nf_conntrack_helper_unregister(&amanda_helper[0]);
err1:
	while (--i >= 0)
		textsearch_destroy(search[i].ts);

	return ret;
}

module_init(nf_conntrack_amanda_init);
module_exit(nf_conntrack_amanda_fini);
Commit	Line	Data
16958900 PM	1	/* Amanda extension for IP connection tracking
	2	*
	3	* (C) 2002 by Brian J. Murrell <netfilter@interlinx.bc.ca>
	4	* based on HW's ip_conntrack_irc.c as well as other modules
	5	*
	6	* This program is free software; you can redistribute it and/or
	7	* modify it under the terms of the GNU General Public License
	8	* as published by the Free Software Foundation; either version
	9	* 2 of the License, or (at your option) any later version.
	10	*/
	11	#include <linux/kernel.h>
	12	#include <linux/module.h>
	13	#include <linux/moduleparam.h>
	14	#include <linux/textsearch.h>
	15	#include <linux/skbuff.h>
	16	#include <linux/in.h>
	17	#include <linux/udp.h>
1863f096	18	#include <linux/netfilter.h>
16958900 PM	19
	20	#include <net/netfilter/nf_conntrack.h>
	21	#include <net/netfilter/nf_conntrack_expect.h>
	22	#include <net/netfilter/nf_conntrack_ecache.h>
	23	#include <net/netfilter/nf_conntrack_helper.h>
	24	#include <linux/netfilter/nf_conntrack_amanda.h>
	25
	26	static unsigned int master_timeout __read_mostly = 300;
	27	static char *ts_algo = "kmp";
	28
	29	MODULE_AUTHOR("Brian J. Murrell <netfilter@interlinx.bc.ca>");
	30	MODULE_DESCRIPTION("Amanda connection tracking module");
	31	MODULE_LICENSE("GPL");
	32	MODULE_ALIAS("ip_conntrack_amanda");
4dc06f96	33	MODULE_ALIAS_NFCT_HELPER("amanda");
16958900 PM	34
	35	module_param(master_timeout, uint, 0600);
	36	MODULE_PARM_DESC(master_timeout, "timeout for the master connection");
	37	module_param(ts_algo, charp, 0400);
	38	MODULE_PARM_DESC(ts_algo, "textsearch algorithm to use (default kmp)");
	39
3db05fea	40	unsigned int (nf_nat_amanda_hook)(struct sk_buff skb,
16958900 PM	41	enum ip_conntrack_info ctinfo,
	42	unsigned int matchoff,
	43	unsigned int matchlen,
	44	struct nf_conntrack_expect *exp)
	45	__read_mostly;
	46	EXPORT_SYMBOL_GPL(nf_nat_amanda_hook);
	47
	48	enum amanda_strings {
	49	SEARCH_CONNECT,
	50	SEARCH_NEWLINE,
	51	SEARCH_DATA,
	52	SEARCH_MESG,
	53	SEARCH_INDEX,
	54	};
	55
	56	static struct {
58c0fb0d	57	const char *string;
16958900 PM	58	size_t len;
	59	struct ts_config *ts;
	60	} search[] __read_mostly = {
	61	[SEARCH_CONNECT] = {
	62	.string = "CONNECT ",
	63	.len = 8,
	64	},
	65	[SEARCH_NEWLINE] = {
	66	.string = "\n",
	67	.len = 1,
	68	},
	69	[SEARCH_DATA] = {
	70	.string = "DATA ",
	71	.len = 5,
	72	},
	73	[SEARCH_MESG] = {
	74	.string = "MESG ",
	75	.len = 5,
	76	},
	77	[SEARCH_INDEX] = {
	78	.string = "INDEX ",
	79	.len = 6,
	80	},
	81	};
	82
3db05fea	83	static int amanda_help(struct sk_buff *skb,
16958900 PM	84	unsigned int protoff,
	85	struct nf_conn *ct,
	86	enum ip_conntrack_info ctinfo)
	87	{
	88	struct ts_state ts;
	89	struct nf_conntrack_expect *exp;
	90	struct nf_conntrack_tuple *tuple;
	91	unsigned int dataoff, start, stop, off, i;
	92	char pbuf[sizeof("65535")], *tmp;
	93	u_int16_t len;
	94	__be16 port;
16958900 PM	95	int ret = NF_ACCEPT;
	96	typeof(nf_nat_amanda_hook) nf_nat_amanda;
	97
	98	/* Only look at packets from the Amanda server */
	99	if (CTINFO2DIR(ctinfo) == IP_CT_DIR_ORIGINAL)
	100	return NF_ACCEPT;
	101
	102	/* increase the UDP timeout of the master connection as replies from
	103	* Amanda clients to the server can be quite delayed */
3db05fea	104	nf_ct_refresh(ct, skb, master_timeout * HZ);
16958900 PM	105
	106	/* No data? */
	107	dataoff = protoff + sizeof(struct udphdr);
3db05fea	108	if (dataoff >= skb->len) {
16958900	109	if (net_ratelimit())
3db05fea	110	printk("amanda_help: skblen = %u\n", skb->len);
16958900 PM	111	return NF_ACCEPT;
	112	}
	113
	114	memset(&ts, 0, sizeof(ts));
3db05fea	115	start = skb_find_text(skb, dataoff, skb->len,
16958900 PM	116	search[SEARCH_CONNECT].ts, &ts);
	117	if (start == UINT_MAX)
	118	goto out;
	119	start += dataoff + search[SEARCH_CONNECT].len;
	120
	121	memset(&ts, 0, sizeof(ts));
3db05fea	122	stop = skb_find_text(skb, start, skb->len,
16958900 PM	123	search[SEARCH_NEWLINE].ts, &ts);
	124	if (stop == UINT_MAX)
	125	goto out;
	126	stop += start;
	127
	128	for (i = SEARCH_DATA; i <= SEARCH_INDEX; i++) {
	129	memset(&ts, 0, sizeof(ts));
3db05fea	130	off = skb_find_text(skb, start, stop, search[i].ts, &ts);
16958900 PM	131	if (off == UINT_MAX)
	132	continue;
	133	off += start + search[i].len;
	134
	135	len = min_t(unsigned int, sizeof(pbuf) - 1, stop - off);
3db05fea	136	if (skb_copy_bits(skb, off, pbuf, len))
16958900 PM	137	break;
	138	pbuf[len] = '\0';
	139
	140	port = htons(simple_strtoul(pbuf, &tmp, 10));
	141	len = tmp - pbuf;
	142	if (port == 0 \|\| len > 5)
	143	break;
	144
6823645d	145	exp = nf_ct_expect_alloc(ct);
16958900 PM	146	if (exp == NULL) {
	147	ret = NF_DROP;
	148	goto out;
	149	}
	150	tuple = &ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple;
5e8fbe2a PM	151	nf_ct_expect_init(exp, NF_CT_EXPECT_CLASS_DEFAULT,
5e8fbe2a PM	152	nf_ct_l3num(ct),
6002f266	153	&tuple->src.u3, &tuple->dst.u3,
6823645d	154	IPPROTO_TCP, NULL, &port);
16958900 PM	155
	156	nf_nat_amanda = rcu_dereference(nf_nat_amanda_hook);
	157	if (nf_nat_amanda && ct->status & IPS_NAT_MASK)
3db05fea	158	ret = nf_nat_amanda(skb, ctinfo, off - dataoff,
16958900	159	len, exp);
6823645d	160	else if (nf_ct_expect_related(exp) != 0)
16958900	161	ret = NF_DROP;
6823645d	162	nf_ct_expect_put(exp);
16958900 PM	163	}
	164
	165	out:
	166	return ret;
	167	}
	168
6002f266 PM	169	static const struct nf_conntrack_expect_policy amanda_exp_policy = {
	170	.max_expected = 3,
	171	.timeout = 180,
	172	};
	173
16958900 PM	174	static struct nf_conntrack_helper amanda_helper[2] __read_mostly = {
	175	{
	176	.name = "amanda",
16958900 PM	177	.me = THIS_MODULE,
	178	.help = amanda_help,
	179	.tuple.src.l3num = AF_INET,
09640e63	180	.tuple.src.u.udp.port = cpu_to_be16(10080),
16958900	181	.tuple.dst.protonum = IPPROTO_UDP,
6002f266	182	.expect_policy = &amanda_exp_policy,
16958900 PM	183	},
	184	{
	185	.name = "amanda",
16958900 PM	186	.me = THIS_MODULE,
	187	.help = amanda_help,
	188	.tuple.src.l3num = AF_INET6,
09640e63	189	.tuple.src.u.udp.port = cpu_to_be16(10080),
16958900	190	.tuple.dst.protonum = IPPROTO_UDP,
6002f266	191	.expect_policy = &amanda_exp_policy,
16958900 PM	192	},
	193	};
	194
	195	static void __exit nf_conntrack_amanda_fini(void)
	196	{
	197	int i;
	198
	199	nf_conntrack_helper_unregister(&amanda_helper[0]);
	200	nf_conntrack_helper_unregister(&amanda_helper[1]);
	201	for (i = 0; i < ARRAY_SIZE(search); i++)
	202	textsearch_destroy(search[i].ts);
	203	}
	204
	205	static int __init nf_conntrack_amanda_init(void)
	206	{
	207	int ret, i;
	208
16958900 PM	209	for (i = 0; i < ARRAY_SIZE(search); i++) {
	210	search[i].ts = textsearch_prepare(ts_algo, search[i].string,
	211	search[i].len,
	212	GFP_KERNEL, TS_AUTOLOAD);
c764c9ad AM	213	if (IS_ERR(search[i].ts)) {
c764c9ad AM	214	ret = PTR_ERR(search[i].ts);
16958900	215	goto err1;
c764c9ad	216	}
16958900 PM	217	}
	218	ret = nf_conntrack_helper_register(&amanda_helper[0]);
	219	if (ret < 0)
	220	goto err1;
	221	ret = nf_conntrack_helper_register(&amanda_helper[1]);
	222	if (ret < 0)
	223	goto err2;
	224	return 0;
	225
	226	err2:
	227	nf_conntrack_helper_unregister(&amanda_helper[0]);
	228	err1:
c764c9ad AM	229	while (--i >= 0)
	230	textsearch_destroy(search[i].ts);
	231
16958900 PM	232	return ret;
	233	}
	234
	235	module_init(nf_conntrack_amanda_init);
	236	module_exit(nf_conntrack_amanda_fini);