net/netfilter/xt_NFQUEUE.c

   1 /* iptables module for using new netfilter netlink queue
   2  *
   3  * (C) 2005 by Harald Welte <laforge@netfilter.org>
   4  *
   5  * This program is free software; you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License version 2 as
   7  * published by the Free Software Foundation.
   8  *
   9  */
  10
  11 #include <linux/module.h>
  12 #include <linux/skbuff.h>
  13
  14 #include <linux/ip.h>
  15 #include <linux/ipv6.h>
  16 #include <linux/jhash.h>
  17
  18 #include <linux/netfilter.h>
  19 #include <linux/netfilter_arp.h>
  20 #include <linux/netfilter/x_tables.h>
  21 #include <linux/netfilter/xt_NFQUEUE.h>
  22
  23 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
  24 MODULE_DESCRIPTION("Xtables: packet forwarding to netlink");
  25 MODULE_LICENSE("GPL");
  26 MODULE_ALIAS("ipt_NFQUEUE");
  27 MODULE_ALIAS("ip6t_NFQUEUE");
  28 MODULE_ALIAS("arpt_NFQUEUE");
  29
  30 static u32 jhash_initval __read_mostly;
  31 static bool rnd_inited __read_mostly;
  32
  33 static unsigned int
  34 nfqueue_tg(struct sk_buff *skb, const struct xt_action_param *par)
  35 {
  36         const struct xt_NFQ_info *tinfo = par->targinfo;
  37
  38         return NF_QUEUE_NR(tinfo->queuenum);
  39 }
  40
  41 static u32 hash_v4(const struct sk_buff *skb)
  42 {
  43         const struct iphdr *iph = ip_hdr(skb);
  44         __be32 ipaddr;
  45
  46         /* packets in either direction go into same queue */
  47         ipaddr = iph->saddr ^ iph->daddr;
  48
  49         return jhash_2words((__force u32)ipaddr, iph->protocol, jhash_initval);
  50 }
  51
  52 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
  53 static u32 hash_v6(const struct sk_buff *skb)
  54 {
  55         const struct ipv6hdr *ip6h = ipv6_hdr(skb);
  56         __be32 addr[4];
  57
  58         addr[0] = ip6h->saddr.s6_addr32[0] ^ ip6h->daddr.s6_addr32[0];
  59         addr[1] = ip6h->saddr.s6_addr32[1] ^ ip6h->daddr.s6_addr32[1];
  60         addr[2] = ip6h->saddr.s6_addr32[2] ^ ip6h->daddr.s6_addr32[2];
  61         addr[3] = ip6h->saddr.s6_addr32[3] ^ ip6h->daddr.s6_addr32[3];
  62
  63         return jhash2((__force u32 *)addr, ARRAY_SIZE(addr), jhash_initval);
  64 }
  65 #endif
  66
  67 static unsigned int
  68 nfqueue_tg_v1(struct sk_buff *skb, const struct xt_action_param *par)
  69 {
  70         const struct xt_NFQ_info_v1 *info = par->targinfo;
  71         u32 queue = info->queuenum;
  72
  73         if (info->queues_total > 1) {
  74                 if (par->family == NFPROTO_IPV4)
  75                         queue = (((u64) hash_v4(skb) * info->queues_total) >>
  76                                  32) + queue;
  77 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
  78                 else if (par->family == NFPROTO_IPV6)
  79                         queue = (((u64) hash_v6(skb) * info->queues_total) >>
  80                                  32) + queue;
  81 #endif
  82         }
  83         return NF_QUEUE_NR(queue);
  84 }
  85
  86 static unsigned int
  87 nfqueue_tg_v2(struct sk_buff *skb, const struct xt_action_param *par)
  88 {
  89         const struct xt_NFQ_info_v2 *info = par->targinfo;
  90         unsigned int ret = nfqueue_tg_v1(skb, par);
  91
  92         if (info->bypass)
  93                 ret |= NF_VERDICT_FLAG_QUEUE_BYPASS;
  94         return ret;
  95 }
  96
  97 static int nfqueue_tg_check(const struct xt_tgchk_param *par)
  98 {
  99         const struct xt_NFQ_info_v2 *info = par->targinfo;
 100         u32 maxid;
 101
 102         if (unlikely(!rnd_inited)) {
 103                 get_random_bytes(&jhash_initval, sizeof(jhash_initval));
 104                 rnd_inited = true;
 105         }
 106         if (info->queues_total == 0) {
 107                 pr_err("NFQUEUE: number of total queues is 0\n");
 108                 return -EINVAL;
 109         }
 110         maxid = info->queues_total - 1 + info->queuenum;
 111         if (maxid > 0xffff) {
 112                 pr_err("NFQUEUE: number of queues (%u) out of range (got %u)\n",
 113                        info->queues_total, maxid);
 114                 return -ERANGE;
 115         }
 116         if (par->target->revision == 2 && info->bypass > 1)
 117                 return -EINVAL;
 118         return 0;
 119 }
 120
 121 static struct xt_target nfqueue_tg_reg[] __read_mostly = {
 122         {
 123                 .name           = "NFQUEUE",
 124                 .family         = NFPROTO_UNSPEC,
 125                 .target         = nfqueue_tg,
 126                 .targetsize     = sizeof(struct xt_NFQ_info),
 127                 .me             = THIS_MODULE,
 128         },
 129         {
 130                 .name           = "NFQUEUE",
 131                 .revision       = 1,
 132                 .family         = NFPROTO_UNSPEC,
 133                 .checkentry     = nfqueue_tg_check,
 134                 .target         = nfqueue_tg_v1,
 135                 .targetsize     = sizeof(struct xt_NFQ_info_v1),
 136                 .me             = THIS_MODULE,
 137         },
 138         {
 139                 .name           = "NFQUEUE",
 140                 .revision       = 2,
 141                 .family         = NFPROTO_UNSPEC,
 142                 .checkentry     = nfqueue_tg_check,
 143                 .target         = nfqueue_tg_v2,
 144                 .targetsize     = sizeof(struct xt_NFQ_info_v2),
 145                 .me             = THIS_MODULE,
 146         },
 147 };
 148
 149 static int __init nfqueue_tg_init(void)
 150 {
 151         return xt_register_targets(nfqueue_tg_reg, ARRAY_SIZE(nfqueue_tg_reg));
 152 }
 153
 154 static void __exit nfqueue_tg_exit(void)
 155 {
 156         xt_unregister_targets(nfqueue_tg_reg, ARRAY_SIZE(nfqueue_tg_reg));
 157 }
 158
 159 module_init(nfqueue_tg_init);
 160 module_exit(nfqueue_tg_exit);