]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - net/tipc/node.h
tipc: use generic SKB list APIs to manage link transmission queue
[mirror_ubuntu-zesty-kernel.git] / net / tipc / node.h
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/node.h: Include file for TIPC node management routines
c4307285 3 *
3e4b6ab5 4 * Copyright (c) 2000-2006, 2014, 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
fc0eea69
AS
45/*
46 * Out-of-range value for node signature
47 */
48#define INVALID_NODE_SIG 0x10000
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 {
aecb9bb8
YX
58 TIPC_WAIT_PEER_LINKS_DOWN = (1 << 1),
59 TIPC_WAIT_OWN_LINKS_DOWN = (1 << 2),
60 TIPC_NOTIFY_NODE_DOWN = (1 << 3),
50100a5e 61 TIPC_NOTIFY_NODE_UP = (1 << 4),
908344cd 62 TIPC_WAKEUP_USERS = (1 << 5),
7b8613e0
YX
63 TIPC_WAKEUP_BCAST_USERS = (1 << 6),
64 TIPC_NOTIFY_LINK_UP = (1 << 7),
65 TIPC_NOTIFY_LINK_DOWN = (1 << 8)
10f465c4 66};
b4b56102 67
486f930a
YX
68/**
69 * struct tipc_node_bclink - TIPC node bclink structure
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
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
75 * @deferred_head: oldest OOS b'cast message received from node
76 * @deferred_tail: newest OOS b'cast message received from node
37e22164 77 * @reasm_buf: broadcast reassembly queue head from node
486f930a
YX
78 * @recv_permitted: true if node is allowed to receive b'cast messages
79 */
80struct tipc_node_bclink {
81 u32 acked;
82 u32 last_in;
83 u32 last_sent;
84 u32 oos_state;
85 u32 deferred_size;
86 struct sk_buff *deferred_head;
87 struct sk_buff *deferred_tail;
37e22164 88 struct sk_buff *reasm_buf;
486f930a
YX
89 bool recv_permitted;
90};
91
b97bf3fd 92/**
6c00055a 93 * struct tipc_node - TIPC node structure
b97bf3fd
PL
94 * @addr: network address of node
95 * @lock: spinlock governing access to structure
672d99e1 96 * @hash: links to adjacent nodes in unsorted hash chain
b97bf3fd
PL
97 * @active_links: pointers to active links to node
98 * @links: pointers to all links to node
aecb9bb8 99 * @action_flags: bit mask of different types of node actions
486f930a
YX
100 * @bclink: broadcast-related info
101 * @list: links to adjacent nodes in sorted list of cluster's nodes
102 * @working_links: number of working links to node (both active and standby)
b97bf3fd 103 * @link_cnt: number of links to node
fc0eea69 104 * @signature: node instance identifier
7b8613e0 105 * @link_id: local and remote bearer ids of changing link, if any
a8f48af5 106 * @publ_list: list of publications
6c7a762e 107 * @rcu: rcu struct for tipc_node
b97bf3fd 108 */
6c00055a 109struct tipc_node {
b97bf3fd
PL
110 u32 addr;
111 spinlock_t lock;
672d99e1 112 struct hlist_node hash;
a18c4bc3 113 struct tipc_link *active_links[2];
16e166b8 114 u32 act_mtus[2];
a18c4bc3 115 struct tipc_link *links[MAX_BEARERS];
aecb9bb8 116 unsigned int action_flags;
486f930a
YX
117 struct tipc_node_bclink bclink;
118 struct list_head list;
b97bf3fd 119 int link_cnt;
5392d646 120 int working_links;
fc0eea69 121 u32 signature;
7b8613e0 122 u32 link_id;
a8f48af5 123 struct list_head publ_list;
50100a5e 124 struct sk_buff_head waiting_sks;
02be61a9 125 struct list_head conn_sks;
6c7a762e 126 struct rcu_head rcu;
b97bf3fd
PL
127};
128
672d99e1
AS
129extern struct list_head tipc_node_list;
130
672d99e1 131struct tipc_node *tipc_node_find(u32 addr);
6c00055a 132struct tipc_node *tipc_node_create(u32 addr);
46651c59 133void tipc_node_stop(void);
a18c4bc3
PG
134void tipc_node_attach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
135void tipc_node_detach_link(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
136void tipc_node_link_down(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
137void tipc_node_link_up(struct tipc_node *n_ptr, struct tipc_link *l_ptr);
8f19afb2 138int tipc_node_active_links(struct tipc_node *n_ptr);
6c00055a 139int tipc_node_is_up(struct tipc_node *n_ptr);
4323add6
PL
140struct sk_buff *tipc_node_get_links(const void *req_tlv_area, int req_tlv_space);
141struct sk_buff *tipc_node_get_nodes(const void *req_tlv_area, int req_tlv_space);
78acb1f9 142int tipc_node_get_linkname(u32 bearer_id, u32 node, char *linkname, size_t len);
9db9fdd1 143void tipc_node_unlock(struct tipc_node *node);
02be61a9
JPM
144int tipc_node_add_conn(u32 dnode, u32 port, u32 peer_port);
145void tipc_node_remove_conn(u32 dnode, u32 port);
b97bf3fd 146
3e4b6ab5
RA
147int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb);
148
9db9fdd1 149static inline void tipc_node_lock(struct tipc_node *node)
b97bf3fd 150{
9db9fdd1 151 spin_lock_bh(&node->lock);
b97bf3fd
PL
152}
153
10f465c4
YX
154static inline bool tipc_node_blocked(struct tipc_node *node)
155{
aecb9bb8
YX
156 return (node->action_flags & (TIPC_WAIT_PEER_LINKS_DOWN |
157 TIPC_NOTIFY_NODE_DOWN | TIPC_WAIT_OWN_LINKS_DOWN));
10f465c4
YX
158}
159
16e166b8
JPM
160static inline uint tipc_node_get_mtu(u32 addr, u32 selector)
161{
162 struct tipc_node *node;
163 u32 mtu;
164
165 node = tipc_node_find(addr);
166
167 if (likely(node))
168 mtu = node->act_mtus[selector & 1];
169 else
170 mtu = MAX_MSG_SIZE;
171
172 return mtu;
173}
174
b97bf3fd 175#endif