[TIPC] License header update
[deliverable/linux.git] / net / tipc / cluster.h
CommitLineData
b97bf3fd
PL
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 *
9ea1fd3c 9 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL
10 * modification, are permitted provided that the following conditions are met:
11 *
9ea1fd3c
PL
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or promote products derived from
19 * this software without specific prior written permission.
b97bf3fd 20 *
9ea1fd3c
PL
21 * Alternatively, this software may be distributed under the terms of the
22 * GNU General Public License ("GPL") version 2 as published by the Free
23 * Software Foundation.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
b97bf3fd
PL
35 * POSSIBILITY OF SUCH DAMAGE.
36 */
37
38#ifndef _TIPC_CLUSTER_H
39#define _TIPC_CLUSTER_H
40
41#include "addr.h"
42#include "zone.h"
43
44#define LOWEST_SLAVE 2048u
45
46/**
47 * struct cluster - TIPC cluster structure
48 * @addr: network address of cluster
49 * @owner: pointer to zone that cluster belongs to
50 * @nodes: array of pointers to all nodes within cluster
51 * @highest_node: id of highest numbered node within cluster
52 * @highest_slave: (used for secondary node support)
53 */
54
55struct cluster {
56 u32 addr;
57 struct _zone *owner;
58 struct node **nodes;
59 u32 highest_node;
60 u32 highest_slave;
61};
62
63
64extern struct node **local_nodes;
65extern u32 highest_allowed_slave;
66extern struct node_map cluster_bcast_nodes;
67
68void cluster_remove_as_router(struct cluster *c_ptr, u32 router);
69void cluster_send_ext_routes(struct cluster *c_ptr, u32 dest);
70struct node *cluster_select_node(struct cluster *c_ptr, u32 selector);
71u32 cluster_select_router(struct cluster *c_ptr, u32 ref);
72void cluster_recv_routing_table(struct sk_buff *buf);
73struct cluster *cluster_create(u32 addr);
74void cluster_delete(struct cluster *c_ptr);
75void cluster_attach_node(struct cluster *c_ptr, struct node *n_ptr);
76void cluster_send_slave_routes(struct cluster *c_ptr, u32 dest);
77void cluster_broadcast(struct sk_buff *buf);
78int cluster_init(void);
79u32 cluster_next_node(struct cluster *c_ptr, u32 addr);
80void cluster_bcast_new_route(struct cluster *c_ptr, u32 dest, u32 lo, u32 hi);
81void cluster_send_local_routes(struct cluster *c_ptr, u32 dest);
82void cluster_bcast_lost_route(struct cluster *c_ptr, u32 dest, u32 lo, u32 hi);
83
84static inline struct cluster *cluster_find(u32 addr)
85{
86 struct _zone *z_ptr = zone_find(addr);
87
88 if (z_ptr)
89 return z_ptr->clusters[1];
90 return 0;
91}
92
93#endif
This page took 0.028406 seconds and 5 git commands to generate.