blob: 6ee587b469fd3fd9df70a7f086f1f5485dc5caa6 [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 */
David S. Miller6c000552008-09-02 23:38:32 -070048struct tipc_node_map {
Per Lidenb97bf3f2006-01-02 19:04:38 +010049 u32 count;
50 u32 map[MAX_NODES / WSIZE];
51};
52
Per Lidenb97bf3f2006-01-02 19:04:38 +010053#define PLSIZE 32
54
55/**
Paul Gortmaker45843102011-12-29 20:33:30 -050056 * struct tipc_port_list - set of node local destination ports
Per Lidenb97bf3f2006-01-02 19:04:38 +010057 * @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 */
Paul Gortmaker45843102011-12-29 20:33:30 -050061struct tipc_port_list {
Per Lidenb97bf3f2006-01-02 19:04:38 +010062 int count;
Paul Gortmaker45843102011-12-29 20:33:30 -050063 struct tipc_port_list *next;
Per Lidenb97bf3f2006-01-02 19:04:38 +010064 u32 ports[PLSIZE];
65};
66
67
David S. Miller6c000552008-09-02 23:38:32 -070068struct tipc_node;
Per Lidenb97bf3f2006-01-02 19:04:38 +010069
Stephen Hemminger4b704d52009-03-18 19:11:29 -070070extern const char tipc_bclink_name[];
Per Lidenb97bf3f2006-01-02 19:04:38 +010071
Allan Stephens3e22e622010-05-11 14:30:14 +000072void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
73void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
Per Lidenb97bf3f2006-01-02 19:04:38 +010074
75/**
Allan Stephensc68ca7b2010-05-11 14:30:12 +000076 * tipc_nmap_equal - test for equality of node maps
Per Lidenb97bf3f2006-01-02 19:04:38 +010077 */
Paul Gortmakerae8509c2013-06-17 10:54:47 -040078static inline int tipc_nmap_equal(struct tipc_node_map *nm_a,
79 struct tipc_node_map *nm_b)
Per Lidenb97bf3f2006-01-02 19:04:38 +010080{
81 return !memcmp(nm_a, nm_b, sizeof(*nm_a));
82}
83
Paul Gortmaker45843102011-12-29 20:33:30 -050084void tipc_port_list_add(struct tipc_port_list *pl_ptr, u32 port);
85void tipc_port_list_free(struct tipc_port_list *pl_ptr);
Per Lidenb97bf3f2006-01-02 19:04:38 +010086
Allan Stephensc47e9b92011-10-24 10:29:26 -040087void tipc_bclink_init(void);
Per Liden4323add2006-01-18 00:38:21 +010088void tipc_bclink_stop(void);
Allan Stephenscd3decd2011-10-24 11:18:12 -040089void tipc_bclink_add_node(u32 addr);
90void tipc_bclink_remove_node(u32 addr);
Allan Stephens01d83ed2011-01-18 13:53:16 -050091struct tipc_node *tipc_bclink_retransmit_to(void);
David S. Miller6c000552008-09-02 23:38:32 -070092void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked);
Per Liden4323add2006-01-18 00:38:21 +010093int tipc_bclink_send_msg(struct sk_buff *buf);
94void tipc_bclink_recv_pkt(struct sk_buff *buf);
95u32 tipc_bclink_get_last_sent(void);
David S. Miller6c000552008-09-02 23:38:32 -070096u32 tipc_bclink_acks_missing(struct tipc_node *n_ptr);
Allan Stephens7a54d4a2011-10-27 14:17:53 -040097void tipc_bclink_update_link_state(struct tipc_node *n_ptr, u32 last_sent);
Per Liden4323add2006-01-18 00:38:21 +010098int tipc_bclink_stats(char *stats_buf, const u32 buf_size);
99int tipc_bclink_reset_stats(void);
100int tipc_bclink_set_queue_limits(u32 limit);
101void tipc_bcbearer_sort(void);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100102
103#endif