2006-01-02 18:04:38 +00:00
|
|
|
/*
|
|
|
|
* net/tipc/bcast.h: Include file for TIPC broadcast code
|
2007-02-09 14:25:21 +00:00
|
|
|
*
|
2015-02-05 13:36:43 +00:00
|
|
|
* Copyright (c) 2003-2006, 2014-2015, Ericsson AB
|
2011-01-18 18:53:16 +00:00
|
|
|
* Copyright (c) 2005, 2010-2011, Wind River Systems
|
2006-01-02 18:04:38 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
2006-01-02 18:04:38 +00:00
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the names of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
2006-01-02 18:04:38 +00:00
|
|
|
*
|
2006-01-11 12:30:43 +00:00
|
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
|
|
* Software Foundation.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
2006-01-02 18:04:38 +00:00
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _TIPC_BCAST_H
|
|
|
|
#define _TIPC_BCAST_H
|
|
|
|
|
2015-10-22 12:51:33 +00:00
|
|
|
#include "core.h"
|
2015-01-09 07:27:07 +00:00
|
|
|
|
|
|
|
struct tipc_node;
|
2015-10-22 12:51:33 +00:00
|
|
|
struct tipc_msg;
|
|
|
|
struct tipc_nl_msg;
|
|
|
|
struct tipc_node_map;
|
2006-01-02 18:04:38 +00:00
|
|
|
|
2015-10-22 12:51:33 +00:00
|
|
|
int tipc_bcast_init(struct net *net);
|
2015-10-22 12:51:35 +00:00
|
|
|
void tipc_bcast_reinit(struct net *net);
|
2015-10-22 12:51:33 +00:00
|
|
|
void tipc_bcast_stop(struct net *net);
|
tipc: simplify bearer level broadcast
Until now, we have been keeping track of the exact set of broadcast
destinations though the help structure tipc_node_map. This leads us to
have to maintain a whole infrastructure for supporting this, including
a pseudo-bearer and a number of functions to manipulate both the bearers
and the node map correctly. Apart from the complexity, this approach is
also limiting, as struct tipc_node_map only can support cluster local
broadcast if we want to avoid it becoming excessively large. We want to
eliminate this limitation, in order to enable introduction of scoped
multicast in the future.
A closer analysis reveals that it is unnecessary maintaining this "full
set" overview; it is sufficient to keep a counter per bearer, indicating
how many nodes can be reached via this bearer at the moment. The protocol
is now robust enough to handle transitional discrepancies between the
nominal number of reachable destinations, as expected by the broadcast
protocol itself, and the number which is actually reachable at the
moment. The initial broadcast synchronization, in conjunction with the
retransmission mechanism, ensures that all packets will eventually be
acknowledged by the correct set of destinations.
This commit introduces these changes.
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Reviewed-by: Ying Xue <ying.xue@windriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-10-22 12:51:42 +00:00
|
|
|
void tipc_bcast_add_peer(struct net *net, struct tipc_link *l,
|
2015-10-22 12:51:41 +00:00
|
|
|
struct sk_buff_head *xmitq);
|
tipc: simplify bearer level broadcast
Until now, we have been keeping track of the exact set of broadcast
destinations though the help structure tipc_node_map. This leads us to
have to maintain a whole infrastructure for supporting this, including
a pseudo-bearer and a number of functions to manipulate both the bearers
and the node map correctly. Apart from the complexity, this approach is
also limiting, as struct tipc_node_map only can support cluster local
broadcast if we want to avoid it becoming excessively large. We want to
eliminate this limitation, in order to enable introduction of scoped
multicast in the future.
A closer analysis reveals that it is unnecessary maintaining this "full
set" overview; it is sufficient to keep a counter per bearer, indicating
how many nodes can be reached via this bearer at the moment. The protocol
is now robust enough to handle transitional discrepancies between the
nominal number of reachable destinations, as expected by the broadcast
protocol itself, and the number which is actually reachable at the
moment. The initial broadcast synchronization, in conjunction with the
retransmission mechanism, ensures that all packets will eventually be
acknowledged by the correct set of destinations.
This commit introduces these changes.
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Reviewed-by: Ying Xue <ying.xue@windriver.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-10-22 12:51:42 +00:00
|
|
|
void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_bcl);
|
|
|
|
void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id);
|
|
|
|
void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id);
|
2015-01-09 07:27:07 +00:00
|
|
|
struct tipc_node *tipc_bclink_retransmit_to(struct net *tn);
|
2008-09-03 06:38:32 +00:00
|
|
|
void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked);
|
2015-01-09 07:27:04 +00:00
|
|
|
void tipc_bclink_rcv(struct net *net, struct sk_buff *buf);
|
2015-01-09 07:27:07 +00:00
|
|
|
u32 tipc_bclink_get_last_sent(struct net *net);
|
2008-09-03 06:38:32 +00:00
|
|
|
u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr);
|
2015-02-05 13:36:36 +00:00
|
|
|
void tipc_bclink_update_link_state(struct tipc_node *node,
|
2015-01-09 07:27:04 +00:00
|
|
|
u32 last_sent);
|
2015-01-09 07:27:06 +00:00
|
|
|
void tipc_bcbearer_sort(struct net *net, struct tipc_node_map *nm_ptr,
|
|
|
|
u32 node, bool action);
|
2015-10-22 12:51:33 +00:00
|
|
|
int tipc_bclink_reset_stats(struct net *net);
|
|
|
|
int tipc_bclink_set_queue_limits(struct net *net, u32 limit);
|
2015-10-22 12:51:43 +00:00
|
|
|
int tipc_bcast_get_mtu(struct net *net);
|
2015-10-22 12:51:33 +00:00
|
|
|
int tipc_bcast_xmit(struct net *net, struct sk_buff_head *list);
|
2015-10-22 12:51:41 +00:00
|
|
|
int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb);
|
|
|
|
void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l, u32 acked);
|
|
|
|
void tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l,
|
|
|
|
struct tipc_msg *hdr);
|
2015-01-09 07:27:05 +00:00
|
|
|
void tipc_bclink_wakeup_users(struct net *net);
|
2015-01-09 07:27:07 +00:00
|
|
|
int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg);
|
2015-05-06 11:58:55 +00:00
|
|
|
int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[]);
|
2015-02-05 13:36:44 +00:00
|
|
|
void tipc_bclink_input(struct net *net);
|
tipc: reduce locking scope during packet reception
We convert packet/message reception according to the same principle
we have been using for message sending and timeout handling:
We move the function tipc_rcv() to node.c, hence handling the initial
packet reception at the link aggregation level. The function grabs
the node lock, selects the receiving link, and accesses it via a new
call tipc_link_rcv(). This function appends buffers to the input
queue for delivery upwards, but it may also append outgoing packets
to the xmit queue, just as we do during regular message sending. The
latter will happen when buffers are forwarded from the link backlog,
or when retransmission is requested.
Upon return of this function, and after having released the node lock,
tipc_rcv() delivers/tranmsits the contents of those queues, but it may
also perform actions such as link activation or reset, as indicated by
the return flags from the link.
This reduces the number of cpu cycles spent inside the node spinlock,
and reduces contention on that lock.
Reviewed-by: Ying Xue <ying.xue@windriver.com>
Signed-off-by: Jon Maloy <jon.maloy@ericsson.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2015-07-16 20:54:31 +00:00
|
|
|
void tipc_bclink_sync_state(struct tipc_node *n, struct tipc_msg *msg);
|
2014-11-20 09:29:12 +00:00
|
|
|
|
2015-10-22 12:51:34 +00:00
|
|
|
static inline void tipc_bcast_lock(struct net *net)
|
|
|
|
{
|
|
|
|
spin_lock_bh(&tipc_net(net)->bclock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void tipc_bcast_unlock(struct net *net)
|
|
|
|
{
|
|
|
|
spin_unlock_bh(&tipc_net(net)->bclock);
|
|
|
|
}
|
|
|
|
|
2015-10-22 12:51:41 +00:00
|
|
|
static inline struct tipc_link *tipc_bc_sndlink(struct net *net)
|
|
|
|
{
|
|
|
|
return tipc_net(net)->bcl;
|
|
|
|
}
|
|
|
|
|
2006-01-02 18:04:38 +00:00
|
|
|
#endif
|