]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - net/tipc/node.h
tipc: let broadcast transmission use new link transmit function
[mirror_ubuntu-jammy-kernel.git] / net / tipc / node.h
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/node.h: Include file for TIPC node management routines
c4307285 3 *
cb1b7280 4 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
46651c59 5 * Copyright (c) 2005, 2010-2014, 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
8f92df6a
AS
40#include "addr.h"
41#include "net.h"
b97bf3fd 42#include "bearer.h"
16e166b8 43#include "msg.h"
b97bf3fd 44
f2f9800d
YX
45/* Out-of-range value for node signature */
46#define INVALID_NODE_SIG 0x10000
47
36e78a46
JPM
48#define INVALID_BEARER_ID -1
49
aecb9bb8 50/* Flags used to take different actions according to flag type
aecb9bb8
YX
51 * TIPC_NOTIFY_NODE_DOWN: notify node is down
52 * TIPC_NOTIFY_NODE_UP: notify node is up
7b8613e0 53 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
10f465c4
YX
54 */
55enum {
aecb9bb8 56 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
50100a5e 57 TIPC_NOTIFY_NODE_UP = (1 << 4),
c637c103
JPM
58 TIPC_WAKEUP_BCAST_USERS = (1 << 5),
59 TIPC_NOTIFY_LINK_UP = (1 << 6),
60 TIPC_NOTIFY_LINK_DOWN = (1 << 7),
b952b2be
YX
61 TIPC_BCAST_MSG_EVT = (1 << 9),
62 TIPC_BCAST_RESET = (1 << 10)
10f465c4 63};
b4b56102 64
486f930a
YX
65/**
66 * struct tipc_node_bclink - TIPC node bclink structure
67 * @acked: sequence # of last outbound b'cast message acknowledged by node
68 * @last_in: sequence # of last in-sequence b'cast message received from node
69 * @last_sent: sequence # of last b'cast message sent by node
70 * @oos_state: state tracker for handling OOS b'cast messages
bc6fecd4 71 * @deferred_queue: deferred queue saved OOS b'cast message received from node
37e22164 72 * @reasm_buf: broadcast reassembly queue head from node
cb1b7280 73 * @inputq_map: bitmap indicating which inqueues should be kicked
486f930a
YX
74 * @recv_permitted: true if node is allowed to receive b'cast messages
75 */
76struct tipc_node_bclink {
77 u32 acked;
78 u32 last_in;
79 u32 last_sent;
80 u32 oos_state;
81 u32 deferred_size;
05dcc5aa 82 struct sk_buff_head deferdq;
37e22164 83 struct sk_buff *reasm_buf;
d39bbd44 84 struct sk_buff_head namedq;
486f930a
YX
85 bool recv_permitted;
86};
87
9d13ec65
JPM
88struct tipc_link_entry {
89 struct tipc_link *link;
90 u32 mtu;
d39bbd44 91 struct sk_buff_head inputq;
d3a43b90 92 struct tipc_media_addr maddr;
9d13ec65
JPM
93};
94
b97bf3fd 95/**
6c00055a 96 * struct tipc_node - TIPC node structure
b97bf3fd 97 * @addr: network address of node
8a0f6ebe 98 * @ref: reference counter to node object
b97bf3fd 99 * @lock: spinlock governing access to structure
f2f9800d 100 * @net: the applicable net namespace
672d99e1 101 * @hash: links to adjacent nodes in unsorted hash chain
c637c103
JPM
102 * @inputq: pointer to input queue containing messages for msg event
103 * @namedq: pointer to name table input queue with name table messages
36e78a46 104 * @active_links: bearer ids of active links, used as index into links[] array
9d13ec65 105 * @links: array containing references to all links to node
aecb9bb8 106 * @action_flags: bit mask of different types of node actions
486f930a 107 * @bclink: broadcast-related info
6e498158
JPM
108 * @state: connectivity state vs peer node
109 * @sync_point: sequence number where synch/failover is finished
486f930a
YX
110 * @list: links to adjacent nodes in sorted list of cluster's nodes
111 * @working_links: number of working links to node (both active and standby)
b97bf3fd 112 * @link_cnt: number of links to node
7764d6e8 113 * @capabilities: bitmap, indicating peer node's functional capabilities
fc0eea69 114 * @signature: node instance identifier
7b8613e0 115 * @link_id: local and remote bearer ids of changing link, if any
a8f48af5 116 * @publ_list: list of publications
6c7a762e 117 * @rcu: rcu struct for tipc_node
b97bf3fd 118 */
6c00055a 119struct tipc_node {
b97bf3fd 120 u32 addr;
8a0f6ebe 121 struct kref kref;
b97bf3fd 122 spinlock_t lock;
f2f9800d 123 struct net *net;
672d99e1 124 struct hlist_node hash;
36e78a46 125 int active_links[2];
9d13ec65 126 struct tipc_link_entry links[MAX_BEARERS];
c637c103 127 int action_flags;
486f930a
YX
128 struct tipc_node_bclink bclink;
129 struct list_head list;
1a20cc25 130 int state;
6e498158 131 u16 sync_point;
b97bf3fd 132 int link_cnt;
7764d6e8
JPM
133 u16 working_links;
134 u16 capabilities;
fc0eea69 135 u32 signature;
7b8613e0 136 u32 link_id;
a8f48af5 137 struct list_head publ_list;
02be61a9 138 struct list_head conn_sks;
8a1577c9
JPM
139 unsigned long keepalive_intv;
140 struct timer_list timer;
6c7a762e 141 struct rcu_head rcu;
b97bf3fd
PL
142};
143
f2f9800d 144struct tipc_node *tipc_node_find(struct net *net, u32 addr);
8a0f6ebe 145void tipc_node_put(struct tipc_node *node);
f2f9800d 146void tipc_node_stop(struct net *net);
cf148816
JPM
147void tipc_node_check_dest(struct net *net, u32 onode,
148 struct tipc_bearer *bearer,
149 u16 capabilities, u32 signature,
150 struct tipc_media_addr *maddr,
151 bool *respond, bool *dupl_addr);
6144a996 152void tipc_node_delete_links(struct net *net, int bearer_id);
a18c4bc3
PG
153void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
154void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
9d13ec65 155bool tipc_node_is_up(struct tipc_node *n);
f2f9800d
YX
156int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
157 char *linkname, size_t len);
9db9fdd1 158void tipc_node_unlock(struct tipc_node *node);
af9b028e
JPM
159int tipc_node_xmit(struct net *net, struct sk_buff_head *list, u32 dnode,
160 int selector);
161int tipc_node_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
162 u32 selector);
f2f9800d
YX
163int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port);
164void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port);
3e4b6ab5
RA
165int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);
166
9db9fdd1 167static inline void tipc_node_lock(struct tipc_node *node)
b97bf3fd 168{
9db9fdd1 169 spin_lock_bh(&node->lock);
b97bf3fd
PL
170}
171
9d13ec65 172static inline struct tipc_link *node_active_link(struct tipc_node *n, int sel)
16e166b8 173{
36e78a46
JPM
174 int bearer_id = n->active_links[sel & 1];
175
176 if (unlikely(bearer_id == INVALID_BEARER_ID))
177 return NULL;
16e166b8 178
36e78a46 179 return n->links[bearer_id].link;
9d13ec65 180}
16e166b8 181
36e78a46 182static inline unsigned int tipc_node_get_mtu(struct net *net, u32 addr, u32 sel)
9d13ec65
JPM
183{
184 struct tipc_node *n;
36e78a46 185 int bearer_id;
9d13ec65 186 unsigned int mtu = MAX_MSG_SIZE;
16e166b8 187
9d13ec65
JPM
188 n = tipc_node_find(net, addr);
189 if (unlikely(!n))
190 return mtu;
36e78a46
JPM
191
192 bearer_id = n->active_links[sel & 1];
193 if (likely(bearer_id != INVALID_BEARER_ID))
194 mtu = n->links[bearer_id].mtu;
9d13ec65 195 tipc_node_put(n);
16e166b8
JPM
196 return mtu;
197}
198
b97bf3fd 199#endif