2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Forwarding decision
|
|
|
|
* Linux ethernet bridge
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Lennert Buytenhek <buytenh@gnu.org>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2010-02-27 19:41:43 +00:00
|
|
|
#include <linux/err.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/netdevice.h>
|
2010-05-06 07:48:24 +00:00
|
|
|
#include <linux/netpoll.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/skbuff.h>
|
2006-04-26 09:39:19 +00:00
|
|
|
#include <linux/if_vlan.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/netfilter_bridge.h>
|
|
|
|
#include "br_private.h"
|
|
|
|
|
2010-03-16 21:37:47 +00:00
|
|
|
static int deliver_clone(const struct net_bridge_port *prev,
|
|
|
|
struct sk_buff *skb,
|
2010-03-16 07:26:22 +00:00
|
|
|
void (*__packet_hook)(const struct net_bridge_port *p,
|
|
|
|
struct sk_buff *skb));
|
|
|
|
|
2013-12-16 13:32:46 +00:00
|
|
|
/* Don't forward packets to originating port or forwarding disabled */
|
2007-02-09 14:24:35 +00:00
|
|
|
static inline int should_deliver(const struct net_bridge_port *p,
|
2005-04-16 22:20:36 +00:00
|
|
|
const struct sk_buff *skb)
|
|
|
|
{
|
bridge: vlan: add per-vlan struct and move to rhashtables
This patch changes the bridge vlan implementation to use rhashtables
instead of bitmaps. The main motivation behind this change is that we
need extensible per-vlan structures (both per-port and global) so more
advanced features can be introduced and the vlan support can be
extended. I've tried to break this up but the moment net_port_vlans is
changed and the whole API goes away, thus this is a larger patch.
A few short goals of this patch are:
- Extensible per-vlan structs stored in rhashtables and a sorted list
- Keep user-visible behaviour (compressed vlans etc)
- Keep fastpath ingress/egress logic the same (optimizations to come
later)
Here's a brief list of some of the new features we'd like to introduce:
- per-vlan counters
- vlan ingress/egress mapping
- per-vlan igmp configuration
- vlan priorities
- avoid fdb entries replication (e.g. local fdb scaling issues)
The structure is kept single for both global and per-port entries so to
avoid code duplication where possible and also because we'll soon introduce
"port0 / aka bridge as port" which should simplify things further
(thanks to Vlad for the suggestion!).
Now we have per-vlan global rhashtable (bridge-wide) and per-vlan port
rhashtable, if an entry is added to a port it'll get a pointer to its
global context so it can be quickly accessed later. There's also a
sorted vlan list which is used for stable walks and some user-visible
behaviour such as the vlan ranges, also for error paths.
VLANs are stored in a "vlan group" which currently contains the
rhashtable, sorted vlan list and the number of "real" vlan entries.
A good side-effect of this change is that it resembles how hw keeps
per-vlan data.
One important note after this change is that if a VLAN is being looked up
in the bridge's rhashtable for filtering purposes (or to check if it's an
existing usable entry, not just a global context) then the new helper
br_vlan_should_use() needs to be used if the vlan is found. In case the
lookup is done only with a port's vlan group, then this check can be
skipped.
Things tested so far:
- basic vlan ingress/egress
- pvids
- untagged vlans
- undef CONFIG_BRIDGE_VLAN_FILTERING
- adding/deleting vlans in different scenarios (with/without global ctx,
while transmitting traffic, in ranges etc)
- loading/removing the module while having/adding/deleting vlans
- extracting bridge vlan information (user ABI), compressed requests
- adding/deleting fdbs on vlans
- bridge mac change, promisc mode
- default pvid change
- kmemleak ON during the whole time
Signed-off-by: Nikolay Aleksandrov <nikolay@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-25 17:00:11 +00:00
|
|
|
struct net_bridge_vlan_group *vg;
|
|
|
|
|
|
|
|
vg = nbp_vlan_group(p);
|
2013-12-19 05:28:11 +00:00
|
|
|
return ((p->flags & BR_HAIRPIN_MODE) || skb->dev != p->dev) &&
|
bridge: vlan: add per-vlan struct and move to rhashtables
This patch changes the bridge vlan implementation to use rhashtables
instead of bitmaps. The main motivation behind this change is that we
need extensible per-vlan structures (both per-port and global) so more
advanced features can be introduced and the vlan support can be
extended. I've tried to break this up but the moment net_port_vlans is
changed and the whole API goes away, thus this is a larger patch.
A few short goals of this patch are:
- Extensible per-vlan structs stored in rhashtables and a sorted list
- Keep user-visible behaviour (compressed vlans etc)
- Keep fastpath ingress/egress logic the same (optimizations to come
later)
Here's a brief list of some of the new features we'd like to introduce:
- per-vlan counters
- vlan ingress/egress mapping
- per-vlan igmp configuration
- vlan priorities
- avoid fdb entries replication (e.g. local fdb scaling issues)
The structure is kept single for both global and per-port entries so to
avoid code duplication where possible and also because we'll soon introduce
"port0 / aka bridge as port" which should simplify things further
(thanks to Vlad for the suggestion!).
Now we have per-vlan global rhashtable (bridge-wide) and per-vlan port
rhashtable, if an entry is added to a port it'll get a pointer to its
global context so it can be quickly accessed later. There's also a
sorted vlan list which is used for stable walks and some user-visible
behaviour such as the vlan ranges, also for error paths.
VLANs are stored in a "vlan group" which currently contains the
rhashtable, sorted vlan list and the number of "real" vlan entries.
A good side-effect of this change is that it resembles how hw keeps
per-vlan data.
One important note after this change is that if a VLAN is being looked up
in the bridge's rhashtable for filtering purposes (or to check if it's an
existing usable entry, not just a global context) then the new helper
br_vlan_should_use() needs to be used if the vlan is found. In case the
lookup is done only with a port's vlan group, then this check can be
skipped.
Things tested so far:
- basic vlan ingress/egress
- pvids
- untagged vlans
- undef CONFIG_BRIDGE_VLAN_FILTERING
- adding/deleting vlans in different scenarios (with/without global ctx,
while transmitting traffic, in ranges etc)
- loading/removing the module while having/adding/deleting vlans
- extracting bridge vlan information (user ABI), compressed requests
- adding/deleting fdbs on vlans
- bridge mac change, promisc mode
- default pvid change
- kmemleak ON during the whole time
Signed-off-by: Nikolay Aleksandrov <nikolay@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-25 17:00:11 +00:00
|
|
|
br_allowed_egress(vg, skb) && p->state == BR_STATE_FORWARDING;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2015-09-16 01:04:18 +00:00
|
|
|
int br_dev_queue_push_xmit(struct net *net, struct sock *sk, struct sk_buff *skb)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-07-28 10:05:37 +00:00
|
|
|
if (!is_skb_forwardable(skb->dev, skb))
|
|
|
|
goto drop;
|
|
|
|
|
|
|
|
skb_push(skb, ETH_HLEN);
|
|
|
|
br_drop_fake_rtable(skb);
|
|
|
|
skb_sender_cpu_clear(skb);
|
|
|
|
|
|
|
|
if (skb->ip_summed == CHECKSUM_PARTIAL &&
|
|
|
|
(skb->protocol == htons(ETH_P_8021Q) ||
|
|
|
|
skb->protocol == htons(ETH_P_8021AD))) {
|
|
|
|
int depth;
|
|
|
|
|
|
|
|
if (!__vlan_get_protocol(skb, skb->protocol, &depth))
|
|
|
|
goto drop;
|
|
|
|
|
|
|
|
skb_set_network_header(skb, depth);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2015-07-28 10:05:37 +00:00
|
|
|
dev_queue_xmit(skb);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
drop:
|
|
|
|
kfree_skb(skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2014-09-18 09:29:03 +00:00
|
|
|
EXPORT_SYMBOL_GPL(br_dev_queue_push_xmit);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-09-16 01:04:18 +00:00
|
|
|
int br_forward_finish(struct net *net, struct sock *sk, struct sk_buff *skb)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2015-09-16 01:04:16 +00:00
|
|
|
return NF_HOOK(NFPROTO_BRIDGE, NF_BR_POST_ROUTING,
|
|
|
|
net, sk, skb, NULL, skb->dev,
|
2006-05-25 22:58:54 +00:00
|
|
|
br_dev_queue_push_xmit);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
}
|
2014-09-18 09:29:03 +00:00
|
|
|
EXPORT_SYMBOL_GPL(br_forward_finish);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
static void __br_deliver(const struct net_bridge_port *to, struct sk_buff *skb)
|
|
|
|
{
|
bridge: vlan: add per-vlan struct and move to rhashtables
This patch changes the bridge vlan implementation to use rhashtables
instead of bitmaps. The main motivation behind this change is that we
need extensible per-vlan structures (both per-port and global) so more
advanced features can be introduced and the vlan support can be
extended. I've tried to break this up but the moment net_port_vlans is
changed and the whole API goes away, thus this is a larger patch.
A few short goals of this patch are:
- Extensible per-vlan structs stored in rhashtables and a sorted list
- Keep user-visible behaviour (compressed vlans etc)
- Keep fastpath ingress/egress logic the same (optimizations to come
later)
Here's a brief list of some of the new features we'd like to introduce:
- per-vlan counters
- vlan ingress/egress mapping
- per-vlan igmp configuration
- vlan priorities
- avoid fdb entries replication (e.g. local fdb scaling issues)
The structure is kept single for both global and per-port entries so to
avoid code duplication where possible and also because we'll soon introduce
"port0 / aka bridge as port" which should simplify things further
(thanks to Vlad for the suggestion!).
Now we have per-vlan global rhashtable (bridge-wide) and per-vlan port
rhashtable, if an entry is added to a port it'll get a pointer to its
global context so it can be quickly accessed later. There's also a
sorted vlan list which is used for stable walks and some user-visible
behaviour such as the vlan ranges, also for error paths.
VLANs are stored in a "vlan group" which currently contains the
rhashtable, sorted vlan list and the number of "real" vlan entries.
A good side-effect of this change is that it resembles how hw keeps
per-vlan data.
One important note after this change is that if a VLAN is being looked up
in the bridge's rhashtable for filtering purposes (or to check if it's an
existing usable entry, not just a global context) then the new helper
br_vlan_should_use() needs to be used if the vlan is found. In case the
lookup is done only with a port's vlan group, then this check can be
skipped.
Things tested so far:
- basic vlan ingress/egress
- pvids
- untagged vlans
- undef CONFIG_BRIDGE_VLAN_FILTERING
- adding/deleting vlans in different scenarios (with/without global ctx,
while transmitting traffic, in ranges etc)
- loading/removing the module while having/adding/deleting vlans
- extracting bridge vlan information (user ABI), compressed requests
- adding/deleting fdbs on vlans
- bridge mac change, promisc mode
- default pvid change
- kmemleak ON during the whole time
Signed-off-by: Nikolay Aleksandrov <nikolay@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-25 17:00:11 +00:00
|
|
|
struct net_bridge_vlan_group *vg;
|
|
|
|
|
|
|
|
vg = nbp_vlan_group(to);
|
|
|
|
skb = br_handle_vlan(to->br, vg, skb);
|
2013-02-13 12:00:14 +00:00
|
|
|
if (!skb)
|
|
|
|
return;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
skb->dev = to->dev;
|
2010-06-10 16:12:50 +00:00
|
|
|
|
2012-08-10 01:24:45 +00:00
|
|
|
if (unlikely(netpoll_tx_running(to->br->dev))) {
|
2014-03-27 21:32:30 +00:00
|
|
|
if (!is_skb_forwardable(skb->dev, skb))
|
2010-06-10 16:12:50 +00:00
|
|
|
kfree_skb(skb);
|
|
|
|
else {
|
|
|
|
skb_push(skb, ETH_HLEN);
|
|
|
|
br_netpoll_send_skb(to, skb);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2015-09-16 01:04:16 +00:00
|
|
|
NF_HOOK(NFPROTO_BRIDGE, NF_BR_LOCAL_OUT,
|
|
|
|
dev_net(skb->dev), NULL, skb,NULL, skb->dev,
|
2010-03-23 03:07:21 +00:00
|
|
|
br_forward_finish);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void __br_forward(const struct net_bridge_port *to, struct sk_buff *skb)
|
|
|
|
{
|
bridge: vlan: add per-vlan struct and move to rhashtables
This patch changes the bridge vlan implementation to use rhashtables
instead of bitmaps. The main motivation behind this change is that we
need extensible per-vlan structures (both per-port and global) so more
advanced features can be introduced and the vlan support can be
extended. I've tried to break this up but the moment net_port_vlans is
changed and the whole API goes away, thus this is a larger patch.
A few short goals of this patch are:
- Extensible per-vlan structs stored in rhashtables and a sorted list
- Keep user-visible behaviour (compressed vlans etc)
- Keep fastpath ingress/egress logic the same (optimizations to come
later)
Here's a brief list of some of the new features we'd like to introduce:
- per-vlan counters
- vlan ingress/egress mapping
- per-vlan igmp configuration
- vlan priorities
- avoid fdb entries replication (e.g. local fdb scaling issues)
The structure is kept single for both global and per-port entries so to
avoid code duplication where possible and also because we'll soon introduce
"port0 / aka bridge as port" which should simplify things further
(thanks to Vlad for the suggestion!).
Now we have per-vlan global rhashtable (bridge-wide) and per-vlan port
rhashtable, if an entry is added to a port it'll get a pointer to its
global context so it can be quickly accessed later. There's also a
sorted vlan list which is used for stable walks and some user-visible
behaviour such as the vlan ranges, also for error paths.
VLANs are stored in a "vlan group" which currently contains the
rhashtable, sorted vlan list and the number of "real" vlan entries.
A good side-effect of this change is that it resembles how hw keeps
per-vlan data.
One important note after this change is that if a VLAN is being looked up
in the bridge's rhashtable for filtering purposes (or to check if it's an
existing usable entry, not just a global context) then the new helper
br_vlan_should_use() needs to be used if the vlan is found. In case the
lookup is done only with a port's vlan group, then this check can be
skipped.
Things tested so far:
- basic vlan ingress/egress
- pvids
- untagged vlans
- undef CONFIG_BRIDGE_VLAN_FILTERING
- adding/deleting vlans in different scenarios (with/without global ctx,
while transmitting traffic, in ranges etc)
- loading/removing the module while having/adding/deleting vlans
- extracting bridge vlan information (user ABI), compressed requests
- adding/deleting fdbs on vlans
- bridge mac change, promisc mode
- default pvid change
- kmemleak ON during the whole time
Signed-off-by: Nikolay Aleksandrov <nikolay@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-25 17:00:11 +00:00
|
|
|
struct net_bridge_vlan_group *vg;
|
2005-04-16 22:20:36 +00:00
|
|
|
struct net_device *indev;
|
|
|
|
|
2009-02-09 23:07:18 +00:00
|
|
|
if (skb_warn_if_lro(skb)) {
|
|
|
|
kfree_skb(skb);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
bridge: vlan: add per-vlan struct and move to rhashtables
This patch changes the bridge vlan implementation to use rhashtables
instead of bitmaps. The main motivation behind this change is that we
need extensible per-vlan structures (both per-port and global) so more
advanced features can be introduced and the vlan support can be
extended. I've tried to break this up but the moment net_port_vlans is
changed and the whole API goes away, thus this is a larger patch.
A few short goals of this patch are:
- Extensible per-vlan structs stored in rhashtables and a sorted list
- Keep user-visible behaviour (compressed vlans etc)
- Keep fastpath ingress/egress logic the same (optimizations to come
later)
Here's a brief list of some of the new features we'd like to introduce:
- per-vlan counters
- vlan ingress/egress mapping
- per-vlan igmp configuration
- vlan priorities
- avoid fdb entries replication (e.g. local fdb scaling issues)
The structure is kept single for both global and per-port entries so to
avoid code duplication where possible and also because we'll soon introduce
"port0 / aka bridge as port" which should simplify things further
(thanks to Vlad for the suggestion!).
Now we have per-vlan global rhashtable (bridge-wide) and per-vlan port
rhashtable, if an entry is added to a port it'll get a pointer to its
global context so it can be quickly accessed later. There's also a
sorted vlan list which is used for stable walks and some user-visible
behaviour such as the vlan ranges, also for error paths.
VLANs are stored in a "vlan group" which currently contains the
rhashtable, sorted vlan list and the number of "real" vlan entries.
A good side-effect of this change is that it resembles how hw keeps
per-vlan data.
One important note after this change is that if a VLAN is being looked up
in the bridge's rhashtable for filtering purposes (or to check if it's an
existing usable entry, not just a global context) then the new helper
br_vlan_should_use() needs to be used if the vlan is found. In case the
lookup is done only with a port's vlan group, then this check can be
skipped.
Things tested so far:
- basic vlan ingress/egress
- pvids
- untagged vlans
- undef CONFIG_BRIDGE_VLAN_FILTERING
- adding/deleting vlans in different scenarios (with/without global ctx,
while transmitting traffic, in ranges etc)
- loading/removing the module while having/adding/deleting vlans
- extracting bridge vlan information (user ABI), compressed requests
- adding/deleting fdbs on vlans
- bridge mac change, promisc mode
- default pvid change
- kmemleak ON during the whole time
Signed-off-by: Nikolay Aleksandrov <nikolay@cumulusnetworks.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-09-25 17:00:11 +00:00
|
|
|
vg = nbp_vlan_group(to);
|
|
|
|
skb = br_handle_vlan(to->br, vg, skb);
|
2013-02-13 12:00:14 +00:00
|
|
|
if (!skb)
|
|
|
|
return;
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
indev = skb->dev;
|
|
|
|
skb->dev = to->dev;
|
2007-03-27 06:22:20 +00:00
|
|
|
skb_forward_csum(skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2015-09-16 01:04:16 +00:00
|
|
|
NF_HOOK(NFPROTO_BRIDGE, NF_BR_FORWARD,
|
|
|
|
dev_net(indev), NULL, skb, indev, skb->dev,
|
2010-03-23 03:07:21 +00:00
|
|
|
br_forward_finish);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* called with rcu_read_lock */
|
|
|
|
void br_deliver(const struct net_bridge_port *to, struct sk_buff *skb)
|
|
|
|
{
|
2011-12-08 07:17:49 +00:00
|
|
|
if (to && should_deliver(to, skb)) {
|
2005-04-16 22:20:36 +00:00
|
|
|
__br_deliver(to, skb);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
kfree_skb(skb);
|
|
|
|
}
|
2014-10-25 16:40:26 +00:00
|
|
|
EXPORT_SYMBOL_GPL(br_deliver);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* called with rcu_read_lock */
|
2010-03-16 07:26:22 +00:00
|
|
|
void br_forward(const struct net_bridge_port *to, struct sk_buff *skb, struct sk_buff *skb0)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2009-02-09 23:07:18 +00:00
|
|
|
if (should_deliver(to, skb)) {
|
2010-03-16 07:26:22 +00:00
|
|
|
if (skb0)
|
|
|
|
deliver_clone(to, skb, __br_forward);
|
|
|
|
else
|
|
|
|
__br_forward(to, skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2010-03-16 07:26:22 +00:00
|
|
|
if (!skb0)
|
|
|
|
kfree_skb(skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2010-03-16 21:37:47 +00:00
|
|
|
static int deliver_clone(const struct net_bridge_port *prev,
|
|
|
|
struct sk_buff *skb,
|
2010-02-27 19:41:43 +00:00
|
|
|
void (*__packet_hook)(const struct net_bridge_port *p,
|
|
|
|
struct sk_buff *skb))
|
|
|
|
{
|
2010-06-16 04:43:07 +00:00
|
|
|
struct net_device *dev = BR_INPUT_SKB_CB(skb)->brdev;
|
|
|
|
|
2010-02-27 19:41:43 +00:00
|
|
|
skb = skb_clone(skb, GFP_ATOMIC);
|
|
|
|
if (!skb) {
|
|
|
|
dev->stats.tx_dropped++;
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
__packet_hook(prev, skb);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct net_bridge_port *maybe_deliver(
|
|
|
|
struct net_bridge_port *prev, struct net_bridge_port *p,
|
|
|
|
struct sk_buff *skb,
|
|
|
|
void (*__packet_hook)(const struct net_bridge_port *p,
|
|
|
|
struct sk_buff *skb))
|
|
|
|
{
|
|
|
|
int err;
|
|
|
|
|
|
|
|
if (!should_deliver(p, skb))
|
|
|
|
return prev;
|
|
|
|
|
|
|
|
if (!prev)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
err = deliver_clone(prev, skb, __packet_hook);
|
|
|
|
if (err)
|
|
|
|
return ERR_PTR(err);
|
|
|
|
|
|
|
|
out:
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/* called under bridge lock */
|
2007-09-16 23:20:48 +00:00
|
|
|
static void br_flood(struct net_bridge *br, struct sk_buff *skb,
|
2010-02-27 19:41:41 +00:00
|
|
|
struct sk_buff *skb0,
|
|
|
|
void (*__packet_hook)(const struct net_bridge_port *p,
|
2013-06-05 14:08:01 +00:00
|
|
|
struct sk_buff *skb),
|
|
|
|
bool unicast)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct net_bridge_port *p;
|
|
|
|
struct net_bridge_port *prev;
|
|
|
|
|
|
|
|
prev = NULL;
|
|
|
|
|
|
|
|
list_for_each_entry_rcu(p, &br->port_list, list) {
|
2013-06-05 14:08:01 +00:00
|
|
|
/* Do not flood unicast traffic to ports that turn it off */
|
|
|
|
if (unicast && !(p->flags & BR_FLOOD))
|
|
|
|
continue;
|
2014-10-23 21:49:17 +00:00
|
|
|
|
|
|
|
/* Do not flood to ports that enable proxy ARP */
|
|
|
|
if (p->flags & BR_PROXYARP)
|
|
|
|
continue;
|
2015-03-04 10:54:21 +00:00
|
|
|
if ((p->flags & BR_PROXYARP_WIFI) &&
|
|
|
|
BR_INPUT_SKB_CB(skb)->proxyarp_replied)
|
|
|
|
continue;
|
2014-10-23 21:49:17 +00:00
|
|
|
|
2010-02-27 19:41:43 +00:00
|
|
|
prev = maybe_deliver(prev, p, skb, __packet_hook);
|
|
|
|
if (IS_ERR(prev))
|
|
|
|
goto out;
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2010-02-27 19:41:41 +00:00
|
|
|
if (!prev)
|
|
|
|
goto out;
|
|
|
|
|
2010-02-27 19:41:43 +00:00
|
|
|
if (skb0)
|
|
|
|
deliver_clone(prev, skb, __packet_hook);
|
|
|
|
else
|
|
|
|
__packet_hook(prev, skb);
|
2010-02-27 19:41:41 +00:00
|
|
|
return;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-02-27 19:41:41 +00:00
|
|
|
out:
|
|
|
|
if (!skb0)
|
|
|
|
kfree_skb(skb);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* called with rcu_read_lock */
|
2013-06-05 14:08:01 +00:00
|
|
|
void br_flood_deliver(struct net_bridge *br, struct sk_buff *skb, bool unicast)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-06-05 14:08:01 +00:00
|
|
|
br_flood(br, skb, NULL, __br_deliver, unicast);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* called under bridge lock */
|
2010-02-27 19:41:41 +00:00
|
|
|
void br_flood_forward(struct net_bridge *br, struct sk_buff *skb,
|
2013-06-05 14:08:01 +00:00
|
|
|
struct sk_buff *skb2, bool unicast)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2013-06-05 14:08:01 +00:00
|
|
|
br_flood(br, skb, skb2, __br_forward, unicast);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2010-02-27 19:41:46 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_BRIDGE_IGMP_SNOOPING
|
|
|
|
/* called with rcu_read_lock */
|
|
|
|
static void br_multicast_flood(struct net_bridge_mdb_entry *mdst,
|
|
|
|
struct sk_buff *skb, struct sk_buff *skb0,
|
|
|
|
void (*__packet_hook)(
|
|
|
|
const struct net_bridge_port *p,
|
|
|
|
struct sk_buff *skb))
|
|
|
|
{
|
|
|
|
struct net_device *dev = BR_INPUT_SKB_CB(skb)->brdev;
|
|
|
|
struct net_bridge *br = netdev_priv(dev);
|
2010-04-27 15:01:07 +00:00
|
|
|
struct net_bridge_port *prev = NULL;
|
2010-02-27 19:41:46 +00:00
|
|
|
struct net_bridge_port_group *p;
|
|
|
|
struct hlist_node *rp;
|
|
|
|
|
2010-11-15 06:38:10 +00:00
|
|
|
rp = rcu_dereference(hlist_first_rcu(&br->router_list));
|
2010-04-27 15:01:06 +00:00
|
|
|
p = mdst ? rcu_dereference(mdst->ports) : NULL;
|
2010-02-27 19:41:46 +00:00
|
|
|
while (p || rp) {
|
2010-04-27 15:01:07 +00:00
|
|
|
struct net_bridge_port *port, *lport, *rport;
|
|
|
|
|
2010-02-27 19:41:46 +00:00
|
|
|
lport = p ? p->port : NULL;
|
|
|
|
rport = rp ? hlist_entry(rp, struct net_bridge_port, rlist) :
|
|
|
|
NULL;
|
|
|
|
|
|
|
|
port = (unsigned long)lport > (unsigned long)rport ?
|
|
|
|
lport : rport;
|
|
|
|
|
|
|
|
prev = maybe_deliver(prev, port, skb, __packet_hook);
|
|
|
|
if (IS_ERR(prev))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if ((unsigned long)lport >= (unsigned long)port)
|
2010-04-27 15:01:06 +00:00
|
|
|
p = rcu_dereference(p->next);
|
2010-02-27 19:41:46 +00:00
|
|
|
if ((unsigned long)rport >= (unsigned long)port)
|
2010-11-15 06:38:10 +00:00
|
|
|
rp = rcu_dereference(hlist_next_rcu(rp));
|
2010-02-27 19:41:46 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!prev)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (skb0)
|
|
|
|
deliver_clone(prev, skb, __packet_hook);
|
|
|
|
else
|
|
|
|
__packet_hook(prev, skb);
|
|
|
|
return;
|
|
|
|
|
|
|
|
out:
|
|
|
|
if (!skb0)
|
|
|
|
kfree_skb(skb);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* called with rcu_read_lock */
|
|
|
|
void br_multicast_deliver(struct net_bridge_mdb_entry *mdst,
|
|
|
|
struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
br_multicast_flood(mdst, skb, NULL, __br_deliver);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* called with rcu_read_lock */
|
|
|
|
void br_multicast_forward(struct net_bridge_mdb_entry *mdst,
|
|
|
|
struct sk_buff *skb, struct sk_buff *skb2)
|
|
|
|
{
|
|
|
|
br_multicast_flood(mdst, skb, skb2, __br_forward);
|
|
|
|
}
|
|
|
|
#endif
|