1/* 2 * net/tipc/node.h: Include file for TIPC node management routines 3 * 4 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB 5 * Copyright (c) 2005, 2010-2014, Wind River Systems 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions are met: 10 * 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. 19 * 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 34 * POSSIBILITY OF SUCH DAMAGE. 35 */ 36 37#ifndef _TIPC_NODE_H 38#define _TIPC_NODE_H 39 40#include "addr.h" 41#include "net.h" 42#include "bearer.h" 43#include "msg.h" 44 45/* Out-of-range value for node signature */ 46#define INVALID_NODE_SIG 0x10000 47 48#define NODE_HTABLE_SIZE 512 49 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 55 * TIPC_DISTRIBUTE_NAME: publish or withdraw link state name type 56 */ 57enum { 58 TIPC_MSG_EVT = 1, 59 TIPC_WAIT_PEER_LINKS_DOWN = (1 << 1), 60 TIPC_WAIT_OWN_LINKS_DOWN = (1 << 2), 61 TIPC_NOTIFY_NODE_DOWN = (1 << 3), 62 TIPC_NOTIFY_NODE_UP = (1 << 4), 63 TIPC_WAKEUP_BCAST_USERS = (1 << 5), 64 TIPC_NOTIFY_LINK_UP = (1 << 6), 65 TIPC_NOTIFY_LINK_DOWN = (1 << 7), 66 TIPC_NAMED_MSG_EVT = (1 << 8), 67 TIPC_BCAST_MSG_EVT = (1 << 9), 68 TIPC_BCAST_RESET = (1 << 10) 69}; 70 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 77 * @deferred_queue: deferred queue saved OOS b'cast message received from node 78 * @reasm_buf: broadcast reassembly queue head from node 79 * @inputq_map: bitmap indicating which inqueues should be kicked 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; 88 struct sk_buff_head deferdq; 89 struct sk_buff *reasm_buf; 90 int inputq_map; 91 bool recv_permitted; 92}; 93 94/** 95 * struct tipc_node - TIPC node structure 96 * @addr: network address of node 97 * @ref: reference counter to node object 98 * @lock: spinlock governing access to structure 99 * @net: the applicable net namespace 100 * @hash: links to adjacent nodes in unsorted hash chain 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 104 * @active_links: pointers to active links to node 105 * @links: pointers to all links to node 106 * @action_flags: bit mask of different types of node actions 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) 110 * @link_cnt: number of links to node 111 * @capabilities: bitmap, indicating peer node's functional capabilities 112 * @signature: node instance identifier 113 * @link_id: local and remote bearer ids of changing link, if any 114 * @publ_list: list of publications 115 * @rcu: rcu struct for tipc_node 116 */ 117struct tipc_node { 118 u32 addr; 119 struct kref kref; 120 spinlock_t lock; 121 struct net *net; 122 struct hlist_node hash; 123 struct sk_buff_head *inputq; 124 struct sk_buff_head *namedq; 125 struct tipc_link *active_links[2]; 126 u32 act_mtus[2]; 127 struct tipc_link *links[MAX_BEARERS]; 128 int action_flags; 129 struct tipc_node_bclink bclink; 130 struct list_head list; 131 int link_cnt; 132 u16 working_links; 133 u16 capabilities; 134 u32 signature; 135 u32 link_id; 136 struct list_head publ_list; 137 struct list_head conn_sks; 138 struct rcu_head rcu; 139}; 140 141struct tipc_node *tipc_node_find(struct net *net, u32 addr); 142void tipc_node_put(struct tipc_node *node); 143struct tipc_node *tipc_node_create(struct net *net, u32 addr); 144void tipc_node_stop(struct net *net); 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); 149int tipc_node_active_links(struct tipc_node *n_ptr); 150int tipc_node_is_up(struct tipc_node *n_ptr); 151int tipc_node_get_linkname(struct net *net, u32 bearer_id, u32 node, 152 char *linkname, size_t len); 153void tipc_node_unlock(struct tipc_node *node); 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); 156 157int tipc_nl_node_dump(struct sk_buff *skb, struct netlink_callback *cb); 158 159static inline void tipc_node_lock(struct tipc_node *node) 160{ 161 spin_lock_bh(&node->lock); 162} 163 164static inline bool tipc_node_blocked(struct tipc_node *node) 165{ 166 return (node->action_flags & (TIPC_WAIT_PEER_LINKS_DOWN | 167 TIPC_NOTIFY_NODE_DOWN | TIPC_WAIT_OWN_LINKS_DOWN)); 168} 169 170static inline uint tipc_node_get_mtu(struct net *net, u32 addr, u32 selector) 171{ 172 struct tipc_node *node; 173 u32 mtu; 174 175 node = tipc_node_find(net, addr); 176 177 if (likely(node)) { 178 mtu = node->act_mtus[selector & 1]; 179 tipc_node_put(node); 180 } else { 181 mtu = MAX_MSG_SIZE; 182 } 183 184 return mtu; 185} 186 187#endif 188