bcast.h 4.51 KB
Newer Older
Per Liden's avatar
Per Liden committed
1 2
/*
 * net/tipc/bcast.h: Include file for TIPC broadcast code
3
 *
Per Liden's avatar
Per Liden committed
4
 * Copyright (c) 2003-2006, Ericsson AB
Per Liden's avatar
Per Liden committed
5 6 7
 * Copyright (c) 2005, Wind River Systems
 * All rights reserved.
 *
Per Liden's avatar
Per Liden committed
8
 * Redistribution and use in source and binary forms, with or without
Per Liden's avatar
Per Liden committed
9 10
 * modification, are permitted provided that the following conditions are met:
 *
Per Liden's avatar
Per Liden committed
11 12 13 14 15 16 17 18
 * 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.
Per Liden's avatar
Per Liden committed
19
 *
Per Liden's avatar
Per Liden committed
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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
Per Liden's avatar
Per Liden committed
34 35 36 37 38 39 40 41 42 43
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _TIPC_BCAST_H
#define _TIPC_BCAST_H

#define MAX_NODES 4096
#define WSIZE 32

/**
44
 * struct tipc_node_map - set of node identifiers
Per Liden's avatar
Per Liden committed
45 46 47 48
 * @count: # of nodes in set
 * @map: bitmap of node identifiers that are in the set
 */

49
struct tipc_node_map {
Per Liden's avatar
Per Liden committed
50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
	u32 count;
	u32 map[MAX_NODES / WSIZE];
};


#define PLSIZE 32

/**
 * struct port_list - set of node local destination ports
 * @count: # of ports in set (only valid for first entry in list)
 * @next: pointer to next entry in list
 * @ports: array of port references
 */

struct port_list {
	int count;
	struct port_list *next;
	u32 ports[PLSIZE];
};


71
struct tipc_node;
Per Liden's avatar
Per Liden committed
72

73
extern const char tipc_bclink_name[];
Per Liden's avatar
Per Liden committed
74

75 76
void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node);
void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node);
Per Liden's avatar
Per Liden committed
77 78

/**
79
 * tipc_nmap_equal - test for equality of node maps
Per Liden's avatar
Per Liden committed
80 81
 */

82
static inline int tipc_nmap_equal(struct tipc_node_map *nm_a, struct tipc_node_map *nm_b)
Per Liden's avatar
Per Liden committed
83 84 85 86
{
	return !memcmp(nm_a, nm_b, sizeof(*nm_a));
}

87 88
void tipc_nmap_diff(struct tipc_node_map *nm_a, struct tipc_node_map *nm_b,
				  struct tipc_node_map *nm_diff);
Per Liden's avatar
Per Liden committed
89 90

/**
91
 * tipc_port_list_add - add a port to a port list, ensuring no duplicates
Per Liden's avatar
Per Liden committed
92 93
 */

94
static inline void tipc_port_list_add(struct port_list *pl_ptr, u32 port)
Per Liden's avatar
Per Liden committed
95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
{
	struct port_list *item = pl_ptr;
	int i;
	int item_sz = PLSIZE;
	int cnt = pl_ptr->count;

	for (; ; cnt -= item_sz, item = item->next) {
		if (cnt < PLSIZE)
			item_sz = cnt;
		for (i = 0; i < item_sz; i++)
			if (item->ports[i] == port)
				return;
		if (i < PLSIZE) {
			item->ports[i] = port;
			pl_ptr->count++;
			return;
		}
		if (!item->next) {
			item->next = kmalloc(sizeof(*item), GFP_ATOMIC);
			if (!item->next) {
115
				warn("Incomplete multicast delivery, no memory\n");
Per Liden's avatar
Per Liden committed
116 117 118 119 120 121 122 123
				return;
			}
			item->next->next = NULL;
		}
	}
}

/**
124
 * tipc_port_list_free - free dynamically created entries in port_list chain
125
 *
Per Liden's avatar
Per Liden committed
126 127 128
 * Note: First item is on stack, so it doesn't need to be released
 */

129
static inline void tipc_port_list_free(struct port_list *pl_ptr)
Per Liden's avatar
Per Liden committed
130 131 132 133 134 135 136 137 138 139 140
{
	struct port_list *item;
	struct port_list *next;

	for (item = pl_ptr->next; item; item = next) {
		next = item->next;
		kfree(item);
	}
}


141 142
int  tipc_bclink_init(void);
void tipc_bclink_stop(void);
143
void tipc_bclink_acknowledge(struct tipc_node *n_ptr, u32 acked);
144 145 146
int  tipc_bclink_send_msg(struct sk_buff *buf);
void tipc_bclink_recv_pkt(struct sk_buff *buf);
u32  tipc_bclink_get_last_sent(void);
147 148
u32  tipc_bclink_acks_missing(struct tipc_node *n_ptr);
void tipc_bclink_check_gap(struct tipc_node *n_ptr, u32 seqno);
149 150 151 152 153
int  tipc_bclink_stats(char *stats_buf, const u32 buf_size);
int  tipc_bclink_reset_stats(void);
int  tipc_bclink_set_queue_limits(u32 limit);
void tipc_bcbearer_sort(void);
void tipc_bcbearer_push(void);
Per Liden's avatar
Per Liden committed
154 155

#endif