]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - net/tipc/node.h
Merge tag 'for-linus' of git://git.kernel.org/pub/scm/virt/kvm/kvm
[mirror_ubuntu-bionic-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
48#define NODE_HTABLE_SIZE 512
fc0eea69 49
aecb9bb8
YX
50/* Flags used to take different actions according to flag type
51 * TIPC_WAIT_PEER_LINKS_DOWN: wait to see that peer's links are down
52 * TIPC_WAIT_OWN_LINKS_DOWN: wait until peer node is declared down
53 * TIPC_NOTIFY_NODE_DOWN: notify node is down
54 * TIPC_NOTIFY_NODE_UP: notify node is up
7b8613e0 55 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type
10f465c4
YX
56 */
57enum {
c637c103 58 TIPC_MSG_EVT = 1,
aecb9bb8
YX
59 TIPC_WAIT_PEER_LINKS_DOWN = (1 << 1),
60 TIPC_WAIT_OWN_LINKS_DOWN = (1 << 2),
61 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
50100a5e 62 TIPC_NOTIFY_NODE_UP = (1 << 4),
c637c103
JPM
63 TIPC_WAKEUP_BCAST_USERS = (1 << 5),
64 TIPC_NOTIFY_LINK_UP = (1 << 6),
65 TIPC_NOTIFY_LINK_DOWN = (1 << 7),
cb1b7280 66 TIPC_NAMED_MSG_EVT = (1 << 8),
b952b2be
YX
67 TIPC_BCAST_MSG_EVT = (1 << 9),
68 TIPC_BCAST_RESET = (1 << 10)
10f465c4 69};
b4b56102 70
486f930a
YX
71/**
72 * struct tipc_node_bclink - TIPC node bclink structure
73 * @acked: sequence # of last outbound b'cast message acknowledged by node
74 * @last_in: sequence # of last in-sequence b'cast message received from node
75 * @last_sent: sequence # of last b'cast message sent by node
76 * @oos_state: state tracker for handling OOS b'cast messages
bc6fecd4 77 * @deferred_queue: deferred queue saved OOS b'cast message received from node
37e22164 78 * @reasm_buf: broadcast reassembly queue head from node
cb1b7280 79 * @inputq_map: bitmap indicating which inqueues should be kicked
486f930a
YX
80 * @recv_permitted: true if node is allowed to receive b'cast messages
81 */
82struct tipc_node_bclink {
83 u32 acked;
84 u32 last_in;
85 u32 last_sent;
86 u32 oos_state;
87 u32 deferred_size;
05dcc5aa 88 struct sk_buff_head deferdq;
37e22164 89 struct sk_buff *reasm_buf;
cb1b7280 90 int inputq_map;
486f930a
YX
91 bool recv_permitted;
92};
93
b97bf3fd 94/**
6c00055a 95 * struct tipc_node - TIPC node structure
b97bf3fd 96 * @addr: network address of node
8a0f6ebe 97 * @ref: reference counter to node object
b97bf3fd 98 * @lock: spinlock governing access to structure
f2f9800d 99 * @net: the applicable net namespace
672d99e1 100 * @hash: links to adjacent nodes in unsorted hash chain
c637c103
JPM
101 * @inputq: pointer to input queue containing messages for msg event
102 * @namedq: pointer to name table input queue with name table messages
103 * @curr_link: the link holding the node lock, if any
b97bf3fd
PL
104 * @active_links: pointers to active links to node
105 * @links: pointers to all links to node
aecb9bb8 106 * @action_flags: bit mask of different types of node actions
486f930a
YX
107 * @bclink: broadcast-related info
108 * @list: links to adjacent nodes in sorted list of cluster's nodes
109 * @working_links: number of working links to node (both active and standby)
b97bf3fd 110 * @link_cnt: number of links to node
7764d6e8 111 * @capabilities: bitmap, indicating peer node's functional capabilities
fc0eea69 112 * @signature: node instance identifier
7b8613e0 113 * @link_id: local and remote bearer ids of changing link, if any
a8f48af5 114 * @publ_list: list of publications
6c7a762e 115 * @rcu: rcu struct for tipc_node
b97bf3fd 116 */
6c00055a 117struct tipc_node {
b97bf3fd 118 u32 addr;
8a0f6ebe 119 struct kref kref;
b97bf3fd 120 spinlock_t lock;
f2f9800d 121 struct net *net;
672d99e1 122 struct hlist_node hash;
c637c103
JPM
123 struct sk_buff_head *inputq;
124 struct sk_buff_head *namedq;
a18c4bc3 125 struct tipc_link *active_links[2];
16e166b8 126 u32 act_mtus[2];
a18c4bc3 127 struct tipc_link *links[MAX_BEARERS];
c637c103 128 int action_flags;
486f930a
YX
129 struct tipc_node_bclink bclink;
130 struct list_head list;
b97bf3fd 131 int link_cnt;
7764d6e8
JPM
132 u16 working_links;
133 u16 capabilities;
fc0eea69 134 u32 signature;
7b8613e0 135 u32 link_id;
a8f48af5 136 struct list_head publ_list;
02be61a9 137 struct list_head conn_sks;
6c7a762e 138 struct rcu_head rcu;
b97bf3fd
PL
139};
140
f2f9800d 141struct tipc_node *tipc_node_find(struct net *net, u32 addr);
8a0f6ebe 142void tipc_node_put(struct tipc_node *node);
f2f9800d
YX
143struct tipc_node *tipc_node_create(struct net *net, u32 addr);
144void tipc_node_stop(struct net *net);
a18c4bc3
PG
145void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
146void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
147void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
148void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
8f19afb2 149int tipc_node_active_links(struct tipc_node *n_ptr);
6c00055a 150int tipc_node_is_up(struct tipc_node *n_ptr);
f2f9800d
YX
151int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node,
152 char *linkname, size_t len);
9db9fdd1 153void tipc_node_unlock(struct tipc_node *node);
f2f9800d
YX
154int tipc_node_add_conn(struct net *net, u32 dnode, u32 port, u32 peer_port);
155void tipc_node_remove_conn(struct net *net, u32 dnode, u32 port);
b97bf3fd 156
3e4b6ab5
RA
157int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);
158
9db9fdd1 159static inline void tipc_node_lock(struct tipc_node *node)
b97bf3fd 160{
9db9fdd1 161 spin_lock_bh(&node->lock);
b97bf3fd
PL
162}
163
10f465c4
YX
164static inline bool tipc_node_blocked(struct tipc_node *node)
165{
aecb9bb8
YX
166 return (node->action_flags & (TIPC_WAIT_PEER_LINKS_DOWN |
167 TIPC_NOTIFY_NODE_DOWN | TIPC_WAIT_OWN_LINKS_DOWN));
10f465c4
YX
168}
169
f2f9800d 170static inline uint tipc_node_get_mtu(struct net *net, u32 addr, u32 selector)
16e166b8
JPM
171{
172 struct tipc_node *node;
173 u32 mtu;
174
f2f9800d 175 node = tipc_node_find(net, addr);
16e166b8 176
8a0f6ebe 177 if (likely(node)) {
16e166b8 178 mtu = node->act_mtus[selector & 1];
8a0f6ebe
YX
179 tipc_node_put(node);
180 } else {
16e166b8 181 mtu = MAX_MSG_SIZE;
8a0f6ebe 182 }
16e166b8
JPM
183
184 return mtu;
185}
186
b97bf3fd 187#endif