1 #include <linux/kernel.h>
2 #include <linux/slab.h>
3 #include <linux/init.h>
4 #include <linux/module.h>
5 #include <linux/proc_fs.h>
6 #include <linux/skbuff.h>
7 #include <linux/netfilter.h>
8 #include <linux/seq_file.h>
9 #include <linux/rcupdate.h>
10 #include <net/protocol.h>
11 #include <net/netfilter/nf_queue.h>
14 #include "nf_internals.h"
17 * A queue handler may be registered for each protocol. Each is protected by
18 * long term mutex. The handler must provide an an outfn() to accept packets
19 * for queueing and must reinject all packets it receives, no matter what.
21 static const struct nf_queue_handler __rcu
*queue_handler
[NFPROTO_NUMPROTO
] __read_mostly
;
23 static DEFINE_MUTEX(queue_handler_mutex
);
25 /* return EBUSY when somebody else is registered, return EEXIST if the
26 * same handler is registered, return 0 in case of success. */
27 int nf_register_queue_handler(u_int8_t pf
, const struct nf_queue_handler
*qh
)
30 const struct nf_queue_handler
*old
;
32 if (pf
>= ARRAY_SIZE(queue_handler
))
35 mutex_lock(&queue_handler_mutex
);
36 old
= rcu_dereference_protected(queue_handler
[pf
],
37 lockdep_is_held(&queue_handler_mutex
));
43 rcu_assign_pointer(queue_handler
[pf
], qh
);
46 mutex_unlock(&queue_handler_mutex
);
50 EXPORT_SYMBOL(nf_register_queue_handler
);
52 /* The caller must flush their queue before this */
53 int nf_unregister_queue_handler(u_int8_t pf
, const struct nf_queue_handler
*qh
)
55 const struct nf_queue_handler
*old
;
57 if (pf
>= ARRAY_SIZE(queue_handler
))
60 mutex_lock(&queue_handler_mutex
);
61 old
= rcu_dereference_protected(queue_handler
[pf
],
62 lockdep_is_held(&queue_handler_mutex
));
63 if (old
&& old
!= qh
) {
64 mutex_unlock(&queue_handler_mutex
);
68 rcu_assign_pointer(queue_handler
[pf
], NULL
);
69 mutex_unlock(&queue_handler_mutex
);
75 EXPORT_SYMBOL(nf_unregister_queue_handler
);
77 void nf_unregister_queue_handlers(const struct nf_queue_handler
*qh
)
81 mutex_lock(&queue_handler_mutex
);
82 for (pf
= 0; pf
< ARRAY_SIZE(queue_handler
); pf
++) {
83 if (rcu_dereference_protected(
85 lockdep_is_held(&queue_handler_mutex
)
87 rcu_assign_pointer(queue_handler
[pf
], NULL
);
89 mutex_unlock(&queue_handler_mutex
);
93 EXPORT_SYMBOL_GPL(nf_unregister_queue_handlers
);
95 static void nf_queue_entry_release_refs(struct nf_queue_entry
*entry
)
97 /* Release those devices we held, or Alexey will kill me. */
99 dev_put(entry
->indev
);
101 dev_put(entry
->outdev
);
102 #ifdef CONFIG_BRIDGE_NETFILTER
103 if (entry
->skb
->nf_bridge
) {
104 struct nf_bridge_info
*nf_bridge
= entry
->skb
->nf_bridge
;
106 if (nf_bridge
->physindev
)
107 dev_put(nf_bridge
->physindev
);
108 if (nf_bridge
->physoutdev
)
109 dev_put(nf_bridge
->physoutdev
);
112 /* Drop reference to owner of hook which queued us. */
113 module_put(entry
->elem
->owner
);
117 * Any packet that leaves via this function must come back
118 * through nf_reinject().
120 static int __nf_queue(struct sk_buff
*skb
,
121 struct list_head
*elem
,
122 u_int8_t pf
, unsigned int hook
,
123 struct net_device
*indev
,
124 struct net_device
*outdev
,
125 int (*okfn
)(struct sk_buff
*),
126 unsigned int queuenum
)
128 int status
= -ENOENT
;
129 struct nf_queue_entry
*entry
= NULL
;
130 #ifdef CONFIG_BRIDGE_NETFILTER
131 struct net_device
*physindev
;
132 struct net_device
*physoutdev
;
134 const struct nf_afinfo
*afinfo
;
135 const struct nf_queue_handler
*qh
;
137 /* QUEUE == DROP if no one is waiting, to be safe. */
140 qh
= rcu_dereference(queue_handler
[pf
]);
146 afinfo
= nf_get_afinfo(pf
);
150 entry
= kmalloc(sizeof(*entry
) + afinfo
->route_key_size
, GFP_ATOMIC
);
156 *entry
= (struct nf_queue_entry
) {
158 .elem
= list_entry(elem
, struct nf_hook_ops
, list
),
166 /* If it's going away, ignore hook. */
167 if (!try_module_get(entry
->elem
->owner
)) {
171 /* Bump dev refs so they don't vanish while packet is out */
176 #ifdef CONFIG_BRIDGE_NETFILTER
177 if (skb
->nf_bridge
) {
178 physindev
= skb
->nf_bridge
->physindev
;
181 physoutdev
= skb
->nf_bridge
->physoutdev
;
183 dev_hold(physoutdev
);
187 afinfo
->saveroute(skb
, entry
);
188 status
= qh
->outfn(entry
, queuenum
);
193 nf_queue_entry_release_refs(entry
);
206 int nf_queue(struct sk_buff
*skb
,
207 struct list_head
*elem
,
208 u_int8_t pf
, unsigned int hook
,
209 struct net_device
*indev
,
210 struct net_device
*outdev
,
211 int (*okfn
)(struct sk_buff
*),
212 unsigned int queuenum
)
214 struct sk_buff
*segs
;
218 if (!skb_is_gso(skb
))
219 return __nf_queue(skb
, elem
, pf
, hook
, indev
, outdev
, okfn
,
224 skb
->protocol
= htons(ETH_P_IP
);
227 skb
->protocol
= htons(ETH_P_IPV6
);
231 segs
= skb_gso_segment(skb
, 0);
232 /* Does not use PTR_ERR to limit the number of error codes that can be
233 * returned by nf_queue. For instance, callers rely on -ECANCELED to mean
234 * 'ignore this hook'.
242 struct sk_buff
*nskb
= segs
->next
;
246 err
= __nf_queue(segs
, elem
, pf
, hook
, indev
,
247 outdev
, okfn
, queuenum
);
255 /* also free orig skb if only some segments were queued */
256 if (unlikely(err
&& queued
))
263 void nf_reinject(struct nf_queue_entry
*entry
, unsigned int verdict
)
265 struct sk_buff
*skb
= entry
->skb
;
266 struct list_head
*elem
= &entry
->elem
->list
;
267 const struct nf_afinfo
*afinfo
;
272 nf_queue_entry_release_refs(entry
);
274 /* Continue traversal iff userspace said ok... */
275 if (verdict
== NF_REPEAT
) {
280 if (verdict
== NF_ACCEPT
) {
281 afinfo
= nf_get_afinfo(entry
->pf
);
282 if (!afinfo
|| afinfo
->reroute(skb
, entry
) < 0)
286 if (verdict
== NF_ACCEPT
) {
288 verdict
= nf_iterate(&nf_hooks
[entry
->pf
][entry
->hook
],
290 entry
->indev
, entry
->outdev
, &elem
,
291 entry
->okfn
, INT_MIN
);
294 switch (verdict
& NF_VERDICT_MASK
) {
302 err
= __nf_queue(skb
, elem
, entry
->pf
, entry
->hook
,
303 entry
->indev
, entry
->outdev
, entry
->okfn
,
304 verdict
>> NF_VERDICT_QBITS
);
306 if (err
== -ECANCELED
)
309 (verdict
& NF_VERDICT_FLAG_QUEUE_BYPASS
))
321 EXPORT_SYMBOL(nf_reinject
);
323 #ifdef CONFIG_PROC_FS
324 static void *seq_start(struct seq_file
*seq
, loff_t
*pos
)
326 if (*pos
>= ARRAY_SIZE(queue_handler
))
332 static void *seq_next(struct seq_file
*s
, void *v
, loff_t
*pos
)
336 if (*pos
>= ARRAY_SIZE(queue_handler
))
342 static void seq_stop(struct seq_file
*s
, void *v
)
347 static int seq_show(struct seq_file
*s
, void *v
)
351 const struct nf_queue_handler
*qh
;
354 qh
= rcu_dereference(queue_handler
[*pos
]);
356 ret
= seq_printf(s
, "%2lld NONE\n", *pos
);
358 ret
= seq_printf(s
, "%2lld %s\n", *pos
, qh
->name
);
364 static const struct seq_operations nfqueue_seq_ops
= {
371 static int nfqueue_open(struct inode
*inode
, struct file
*file
)
373 return seq_open(file
, &nfqueue_seq_ops
);
376 static const struct file_operations nfqueue_file_ops
= {
377 .owner
= THIS_MODULE
,
378 .open
= nfqueue_open
,
381 .release
= seq_release
,
386 int __init
netfilter_queue_init(void)
388 #ifdef CONFIG_PROC_FS
389 if (!proc_create("nf_queue", S_IRUGO
,
390 proc_net_netfilter
, &nfqueue_file_ops
))