]>
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 | ||
45 | /** | |
6c00055a | 46 | * struct tipc_node - TIPC node structure |
b97bf3fd PL |
47 | * @addr: network address of node |
48 | * @lock: spinlock governing access to structure | |
672d99e1 AS |
49 | * @hash: links to adjacent nodes in unsorted hash chain |
50 | * @list: links to adjacent nodes in sorted list of cluster's nodes | |
b97bf3fd PL |
51 | * @nsub: list of "node down" subscriptions monitoring node |
52 | * @active_links: pointers to active links to node | |
53 | * @links: pointers to all links to node | |
5392d646 | 54 | * @working_links: number of working links to node (both active and standby) |
5a68d5ee | 55 | * @cleanup_required: non-zero if cleaning up after a prior loss of contact |
b97bf3fd PL |
56 | * @link_cnt: number of links to node |
57 | * @permit_changeover: non-zero if node has redundant links to this system | |
b97bf3fd PL |
58 | * @bclink: broadcast-related info |
59 | * @supported: non-zero if node supports TIPC b'cast capability | |
60 | * @acked: sequence # of last outbound b'cast message acknowledged by node | |
61 | * @last_in: sequence # of last in-sequence b'cast message received from node | |
62 | * @gap_after: sequence # of last message not requiring a NAK request | |
63 | * @gap_to: sequence # of last message requiring a NAK request | |
64 | * @nack_sync: counter that determines when NAK requests should be sent | |
65 | * @deferred_head: oldest OOS b'cast message received from node | |
66 | * @deferred_tail: newest OOS b'cast message received from node | |
67 | * @defragm: list of partially reassembled b'cast message fragments from node | |
68 | */ | |
c4307285 | 69 | |
6c00055a | 70 | struct tipc_node { |
b97bf3fd PL |
71 | u32 addr; |
72 | spinlock_t lock; | |
672d99e1 AS |
73 | struct hlist_node hash; |
74 | struct list_head list; | |
b97bf3fd PL |
75 | struct list_head nsub; |
76 | struct link *active_links[2]; | |
77 | struct link *links[MAX_BEARERS]; | |
78 | int link_cnt; | |
5392d646 | 79 | int working_links; |
5a68d5ee | 80 | int cleanup_required; |
b97bf3fd | 81 | int permit_changeover; |
b97bf3fd PL |
82 | struct { |
83 | int supported; | |
84 | u32 acked; | |
85 | u32 last_in; | |
c4307285 YH |
86 | u32 gap_after; |
87 | u32 gap_to; | |
b97bf3fd PL |
88 | u32 nack_sync; |
89 | struct sk_buff *deferred_head; | |
90 | struct sk_buff *deferred_tail; | |
91 | struct sk_buff *defragm; | |
92 | } bclink; | |
93 | }; | |
94 | ||
672d99e1 AS |
95 | #define NODE_HTABLE_SIZE 512 |
96 | extern struct list_head tipc_node_list; | |
97 | ||
98 | /* | |
99 | * A trivial power-of-two bitmask technique is used for speed, since this | |
100 | * operation is done for every incoming TIPC packet. The number of hash table | |
101 | * entries has been chosen so that no hash chain exceeds 8 nodes and will | |
102 | * usually be much smaller (typically only a single node). | |
103 | */ | |
104 | static inline unsigned int tipc_hashfn(u32 addr) | |
105 | { | |
106 | return addr & (NODE_HTABLE_SIZE - 1); | |
107 | } | |
108 | ||
b97bf3fd PL |
109 | extern u32 tipc_own_tag; |
110 | ||
672d99e1 | 111 | struct tipc_node *tipc_node_find(u32 addr); |
6c00055a DM |
112 | struct tipc_node *tipc_node_create(u32 addr); |
113 | void tipc_node_delete(struct tipc_node *n_ptr); | |
37b9c08a | 114 | void tipc_node_attach_link(struct tipc_node *n_ptr, struct link *l_ptr); |
6c00055a DM |
115 | void tipc_node_detach_link(struct tipc_node *n_ptr, struct link *l_ptr); |
116 | void tipc_node_link_down(struct tipc_node *n_ptr, struct link *l_ptr); | |
117 | void tipc_node_link_up(struct tipc_node *n_ptr, struct link *l_ptr); | |
8f19afb2 PG |
118 | int tipc_node_active_links(struct tipc_node *n_ptr); |
119 | int tipc_node_redundant_links(struct tipc_node *n_ptr); | |
6c00055a | 120 | int tipc_node_is_up(struct tipc_node *n_ptr); |
4323add6 PL |
121 | struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space); |
122 | struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space); | |
b97bf3fd | 123 | |
6c00055a | 124 | static inline void tipc_node_lock(struct tipc_node *n_ptr) |
b97bf3fd PL |
125 | { |
126 | spin_lock_bh(&n_ptr->lock); | |
127 | } | |
128 | ||
6c00055a | 129 | static inline void tipc_node_unlock(struct tipc_node *n_ptr) |
b97bf3fd PL |
130 | { |
131 | spin_unlock_bh(&n_ptr->lock); | |
132 | } | |
133 | ||
134 | #endif |