aboutsummaryrefslogtreecommitdiffstats
path: root/net/tipc/cluster.h
diff options
context:
space:
mode:
Diffstat (limited to 'net/tipc/cluster.h')
-rw-r--r--net/tipc/cluster.h89
1 files changed, 89 insertions, 0 deletions
diff --git a/net/tipc/cluster.h b/net/tipc/cluster.h
new file mode 100644
index 000000000000..c12875ab46be
--- /dev/null
+++ b/net/tipc/cluster.h
@@ -0,0 +1,89 @@
1/*
2 * net/tipc/cluster.h: Include file for TIPC cluster management routines
3 *
4 * Copyright (c) 2003-2005, Ericsson Research Canada
5 * Copyright (c) 2005, Wind River Systems
6 * Copyright (c) 2005-2006, Ericsson AB
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
11 *
12 * Redistributions of source code must retain the above copyright notice, this
13 * list of conditions and the following disclaimer.
14 * Redistributions in binary form must reproduce the above copyright notice,
15 * this list of conditions and the following disclaimer in the documentation
16 * and/or other materials provided with the distribution.
17 * Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or promote products derived from this
19 * software without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
22 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
25 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
29 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
30 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
32 */
33
34#ifndef _TIPC_CLUSTER_H
35#define _TIPC_CLUSTER_H
36
37#include "addr.h"
38#include "zone.h"
39
40#define LOWEST_SLAVE 2048u
41
42/**
43 * struct cluster - TIPC cluster structure
44 * @addr: network address of cluster
45 * @owner: pointer to zone that cluster belongs to
46 * @nodes: array of pointers to all nodes within cluster
47 * @highest_node: id of highest numbered node within cluster
48 * @highest_slave: (used for secondary node support)
49 */
50
51struct cluster {
52 u32 addr;
53 struct _zone *owner;
54 struct node **nodes;
55 u32 highest_node;
56 u32 highest_slave;
57};
58
59
60extern struct node **local_nodes;
61extern u32 highest_allowed_slave;
62extern struct node_map cluster_bcast_nodes;
63
64void cluster_remove_as_router(struct cluster *c_ptr, u32 router);
65void cluster_send_ext_routes(struct cluster *c_ptr, u32 dest);
66struct node *cluster_select_node(struct cluster *c_ptr, u32 selector);
67u32 cluster_select_router(struct cluster *c_ptr, u32 ref);
68void cluster_recv_routing_table(struct sk_buff *buf);
69struct cluster *cluster_create(u32 addr);
70void cluster_delete(struct cluster *c_ptr);
71void cluster_attach_node(struct cluster *c_ptr, struct node *n_ptr);
72void cluster_send_slave_routes(struct cluster *c_ptr, u32 dest);
73void cluster_broadcast(struct sk_buff *buf);
74int cluster_init(void);
75u32 cluster_next_node(struct cluster *c_ptr, u32 addr);
76void cluster_bcast_new_route(struct cluster *c_ptr, u32 dest, u32 lo, u32 hi);
77void cluster_send_local_routes(struct cluster *c_ptr, u32 dest);
78void cluster_bcast_lost_route(struct cluster *c_ptr, u32 dest, u32 lo, u32 hi);
79
80static inline struct cluster *cluster_find(u32 addr)
81{
82 struct _zone *z_ptr = zone_find(addr);
83
84 if (z_ptr)
85 return z_ptr->clusters[1];
86 return 0;
87}
88
89#endif