Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/node.h: Include file for TIPC node management routines | |
c4307285 | 3 | * |
593a5f22 | 4 | * Copyright (c) 2000-2006, Ericsson AB |
672d99e1 | 5 | * Copyright (c) 2005, 2010-2011, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 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. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * 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 | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #ifndef _TIPC_NODE_H | |
38 | #define _TIPC_NODE_H | |
39 | ||
40 | #include "node_subscr.h" | |
8f92df6a AS |
41 | #include "addr.h" |
42 | #include "net.h" | |
b97bf3fd PL |
43 | #include "bearer.h" |
44 | ||
fc0eea69 AS |
45 | /* |
46 | * Out-of-range value for node signature | |
47 | */ | |
48 | #define INVALID_NODE_SIG 0x10000 | |
49 | ||
b4b56102 | 50 | /* Flags used to block (re)establishment of contact with a neighboring node */ |
b4b56102 AS |
51 | #define WAIT_PEER_DOWN 0x0001 /* wait to see that peer's links are down */ |
52 | #define WAIT_NAMES_GONE 0x0002 /* wait for peer's publications to be purged */ | |
53 | #define WAIT_NODE_DOWN 0x0004 /* wait until peer node is declared down */ | |
54 | ||
b97bf3fd | 55 | /** |
6c00055a | 56 | * struct tipc_node - TIPC node structure |
b97bf3fd PL |
57 | * @addr: network address of node |
58 | * @lock: spinlock governing access to structure | |
672d99e1 AS |
59 | * @hash: links to adjacent nodes in unsorted hash chain |
60 | * @list: links to adjacent nodes in sorted list of cluster's nodes | |
b97bf3fd PL |
61 | * @nsub: list of "node down" subscriptions monitoring node |
62 | * @active_links: pointers to active links to node | |
63 | * @links: pointers to all links to node | |
5392d646 | 64 | * @working_links: number of working links to node (both active and standby) |
b4b56102 | 65 | * @block_setup: bit mask of conditions preventing link establishment to node |
b97bf3fd PL |
66 | * @link_cnt: number of links to node |
67 | * @permit_changeover: non-zero if node has redundant links to this system | |
fc0eea69 | 68 | * @signature: node instance identifier |
b97bf3fd | 69 | * @bclink: broadcast-related info |
b97bf3fd PL |
70 | * @acked: sequence # of last outbound b'cast message acknowledged by node |
71 | * @last_in: sequence # of last in-sequence b'cast message received from node | |
7a54d4a9 AS |
72 | * @last_sent: sequence # of last b'cast message sent by node |
73 | * @oos_state: state tracker for handling OOS b'cast messages | |
74 | * @deferred_size: number of OOS b'cast messages in deferred queue | |
b97bf3fd PL |
75 | * @deferred_head: oldest OOS b'cast message received from node |
76 | * @deferred_tail: newest OOS b'cast message received from node | |
77 | * @defragm: list of partially reassembled b'cast message fragments from node | |
389dd9bc | 78 | * @recv_permitted: true if node is allowed to receive b'cast messages |
b97bf3fd | 79 | */ |
6c00055a | 80 | struct tipc_node { |
b97bf3fd PL |
81 | u32 addr; |
82 | spinlock_t lock; | |
672d99e1 AS |
83 | struct hlist_node hash; |
84 | struct list_head list; | |
b97bf3fd | 85 | struct list_head nsub; |
a18c4bc3 PG |
86 | struct tipc_link *active_links[2]; |
87 | struct tipc_link *links[MAX_BEARERS]; | |
b97bf3fd | 88 | int link_cnt; |
5392d646 | 89 | int working_links; |
b4b56102 | 90 | int block_setup; |
b97bf3fd | 91 | int permit_changeover; |
fc0eea69 | 92 | u32 signature; |
b97bf3fd | 93 | struct { |
b97bf3fd PL |
94 | u32 acked; |
95 | u32 last_in; | |
7a54d4a9 AS |
96 | u32 last_sent; |
97 | u32 oos_state; | |
98 | u32 deferred_size; | |
b97bf3fd PL |
99 | struct sk_buff *deferred_head; |
100 | struct sk_buff *deferred_tail; | |
101 | struct sk_buff *defragm; | |
389dd9bc | 102 | bool recv_permitted; |
b97bf3fd PL |
103 | } bclink; |
104 | }; | |
105 | ||
672d99e1 AS |
106 | extern struct list_head tipc_node_list; |
107 | ||
672d99e1 | 108 | struct tipc_node *tipc_node_find(u32 addr); |
6c00055a DM |
109 | struct tipc_node *tipc_node_create(u32 addr); |
110 | void tipc_node_delete(struct tipc_node *n_ptr); | |
a18c4bc3 PG |
111 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr); |
112 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr); | |
113 | void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr); | |
114 | void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr); | |
8f19afb2 PG |
115 | int tipc_node_active_links(struct tipc_node *n_ptr); |
116 | int tipc_node_redundant_links(struct tipc_node *n_ptr); | |
6c00055a | 117 | int tipc_node_is_up(struct tipc_node *n_ptr); |
4323add6 PL |
118 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space); |
119 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space); | |
b97bf3fd | 120 | |
6c00055a | 121 | static inline void tipc_node_lock(struct tipc_node *n_ptr) |
b97bf3fd PL |
122 | { |
123 | spin_lock_bh(&n_ptr->lock); | |
124 | } | |
125 | ||
6c00055a | 126 | static inline void tipc_node_unlock(struct tipc_node *n_ptr) |
b97bf3fd PL |
127 | { |
128 | spin_unlock_bh(&n_ptr->lock); | |
129 | } | |
130 | ||
131 | #endif |