Loading...
1/*
2 * net/tipc/bcast.h: Include file for TIPC broadcast code
3 *
4 * Copyright (c) 2003-2006, 2014-2015, Ericsson AB
5 * Copyright (c) 2005, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#ifndef _TIPC_BCAST_H
38#define _TIPC_BCAST_H
39
40#include "core.h"
41
42struct tipc_node;
43struct tipc_msg;
44struct tipc_nl_msg;
45struct tipc_node_map;
46extern const char tipc_bclink_name[];
47
48int tipc_bcast_init(struct net *net);
49void tipc_bcast_stop(struct net *net);
50void tipc_bcast_add_peer(struct net *net, struct tipc_link *l,
51 struct sk_buff_head *xmitq);
52void tipc_bcast_remove_peer(struct net *net, struct tipc_link *rcv_bcl);
53void tipc_bcast_inc_bearer_dst_cnt(struct net *net, int bearer_id);
54void tipc_bcast_dec_bearer_dst_cnt(struct net *net, int bearer_id);
55int tipc_bcast_get_mtu(struct net *net);
56int tipc_bcast_xmit(struct net *net, struct sk_buff_head *list);
57int tipc_bcast_rcv(struct net *net, struct tipc_link *l, struct sk_buff *skb);
58void tipc_bcast_ack_rcv(struct net *net, struct tipc_link *l,
59 struct tipc_msg *hdr);
60int tipc_bcast_sync_rcv(struct net *net, struct tipc_link *l,
61 struct tipc_msg *hdr);
62int tipc_nl_add_bc_link(struct net *net, struct tipc_nl_msg *msg);
63int tipc_nl_bc_link_set(struct net *net, struct nlattr *attrs[]);
64int tipc_bclink_reset_stats(struct net *net);
65
66static inline void tipc_bcast_lock(struct net *net)
67{
68 spin_lock_bh(&tipc_net(net)->bclock);
69}
70
71static inline void tipc_bcast_unlock(struct net *net)
72{
73 spin_unlock_bh(&tipc_net(net)->bclock);
74}
75
76static inline struct tipc_link *tipc_bc_sndlink(struct net *net)
77{
78 return tipc_net(net)->bcl;
79}
80
81#endif
1/*
2 * net/tipc/bcast.h: Include file for TIPC broadcast code
3 *
4 * Copyright (c) 2003-2006, Ericsson AB
5 * Copyright (c) 2005, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
19 *
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#ifndef _TIPC_BCAST_H
38#define _TIPC_BCAST_H
39
40#define MAX_NODES 4096
41#define WSIZE 32
42
43/**
44 * struct tipc_node_map - set of node identifiers
45 * @count: # of nodes in set
46 * @map: bitmap of node identifiers that are in the set
47 */
48struct tipc_node_map {
49 u32 count;
50 u32 map[MAX_NODES / WSIZE];
51};
52
53#define PLSIZE 32
54
55/**
56 * struct tipc_port_list - set of node local destination ports
57 * @count: # of ports in set (only valid for first entry in list)
58 * @next: pointer to next entry in list
59 * @ports: array of port references
60 */
61struct tipc_port_list {
62 int count;
63 struct tipc_port_list *next;
64 u32 ports[PLSIZE];
65};
66
67
68struct tipc_node;
69
70extern const char tipc_bclink_name[];
71
72void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
73void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
74
75/**
76 * tipc_nmap_equal - test for equality of node maps
77 */
78static inline int tipc_nmap_equal(struct tipc_node_map *nm_a, struct tipc_node_map *nm_b)
79{
80 return !memcmp(nm_a, nm_b, sizeof(*nm_a));
81}
82
83void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port);
84void tipc_port_list_free(struct tipc_port_list *pl_ptr);
85
86void tipc_bclink_init(void);
87void tipc_bclink_stop(void);
88void tipc_bclink_add_node(u32 addr);
89void tipc_bclink_remove_node(u32 addr);
90struct tipc_node *tipc_bclink_retransmit_to(void);
91void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked);
92int tipc_bclink_send_msg(struct sk_buff *buf);
93void tipc_bclink_recv_pkt(struct sk_buff *buf);
94u32 tipc_bclink_get_last_sent(void);
95u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr);
96void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent);
97int tipc_bclink_stats(char *stats_buf, const u32 buf_size);
98int tipc_bclink_reset_stats(void);
99int tipc_bclink_set_queue_limits(u32 limit);
100void tipc_bcbearer_sort(void);
101
102#endif