blob: 500c97f1c8596b07386689e7448c4fb9bdc23a7a [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
2 * net/tipc/bcast.h: Include file for TIPC broadcast code
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Per Liden9da1c8b2006-01-11 18:40:41 +01004 * Copyright (c) 2003-2006, Ericsson AB
Allan Stephens01d83ed2011-01-18 13:53:16 -05005 * Copyright (c) 2005, 2010-2011, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * 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
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * 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/**
David S. Miller6c000552008-09-02 23:38:32 -070044 * struct tipc_node_map - set of node identifiers
Per Lidenb97bf3f2006-01-02 19:04:38 +010045 * @count: # of nodes in set
46 * @map: bitmap of node identifiers that are in the set
47 */
48
David S. Miller6c000552008-09-02 23:38:32 -070049struct tipc_node_map {
Per Lidenb97bf3f2006-01-02 19:04:38 +010050 u32 count;
51 u32 map[MAX_NODES / WSIZE];
52};
53
Allan Stephens8f92df62010-12-31 18:59:19 +000054extern struct tipc_node_map tipc_bcast_nmap;
Per Lidenb97bf3f2006-01-02 19:04:38 +010055
56#define PLSIZE 32
57
58/**
59 * struct port_list - set of node local destination ports
60 * @count: # of ports in set (only valid for first entry in list)
61 * @next: pointer to next entry in list
62 * @ports: array of port references
63 */
64
65struct port_list {
66 int count;
67 struct port_list *next;
68 u32 ports[PLSIZE];
69};
70
71
David S. Miller6c000552008-09-02 23:38:32 -070072struct tipc_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010073
Stephen Hemminger4b704d52009-03-18 19:11:29 -070074extern const char tipc_bclink_name[];
Per Lidenb97bf3f2006-01-02 19:04:38 +010075
Allan Stephens3e22e622010-05-11 14:30:14 +000076void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
77void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
Per Lidenb97bf3f2006-01-02 19:04:38 +010078
79/**
Allan Stephensc68ca7b2010-05-11 14:30:12 +000080 * tipc_nmap_equal - test for equality of node maps
Per Lidenb97bf3f2006-01-02 19:04:38 +010081 */
82
David S. Miller6c000552008-09-02 23:38:32 -070083static inline int tipc_nmap_equal(struct tipc_node_map *nm_a, struct tipc_node_map *nm_b)
Per Lidenb97bf3f2006-01-02 19:04:38 +010084{
85 return !memcmp(nm_a, nm_b, sizeof(*nm_a));
86}
87
Allan Stephens43608ed2010-05-11 14:30:15 +000088void tipc_port_list_add(struct port_list *pl_ptr, u32 port);
89void tipc_port_list_free(struct port_list *pl_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010090
Per Liden4323add2006-01-18 00:38:21 +010091int tipc_bclink_init(void);
92void tipc_bclink_stop(void);
Allan Stephens01d83ed2011-01-18 13:53:16 -050093struct tipc_node *tipc_bclink_retransmit_to(void);
David S. Miller6c000552008-09-02 23:38:32 -070094void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked);
Per Liden4323add2006-01-18 00:38:21 +010095int tipc_bclink_send_msg(struct sk_buff *buf);
96void tipc_bclink_recv_pkt(struct sk_buff *buf);
97u32 tipc_bclink_get_last_sent(void);
David S. Miller6c000552008-09-02 23:38:32 -070098u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr);
99void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 seqno);
Per Liden4323add2006-01-18 00:38:21 +0100100int tipc_bclink_stats(char *stats_buf, const u32 buf_size);
101int tipc_bclink_reset_stats(void);
102int tipc_bclink_set_queue_limits(u32 limit);
103void tipc_bcbearer_sort(void);
104void tipc_bcbearer_push(void);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100105
106#endif