1b97bf3fdSPer Liden /* 2b97bf3fdSPer Liden * net/tipc/name_distr.c: TIPC name distribution code 3b97bf3fdSPer Liden * 4b97bf3fdSPer Liden * Copyright (c) 2003-2005, Ericsson Research Canada 5b97bf3fdSPer Liden * Copyright (c) 2005, Wind River Systems 6b97bf3fdSPer Liden * Copyright (c) 2005-2006, Ericsson AB 7b97bf3fdSPer Liden * All rights reserved. 8b97bf3fdSPer Liden * 9b97bf3fdSPer Liden * Redistribution and use in source and binary forms, with or without 10b97bf3fdSPer Liden * modification, are permitted provided that the following conditions are met: 11b97bf3fdSPer Liden * 12*9ea1fd3cSPer Liden * 1. Redistributions of source code must retain the above copyright 13*9ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer. 14*9ea1fd3cSPer Liden * 2. Redistributions in binary form must reproduce the above copyright 15*9ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer in the 16*9ea1fd3cSPer Liden * documentation and/or other materials provided with the distribution. 17*9ea1fd3cSPer Liden * 3. Neither the names of the copyright holders nor the names of its 18*9ea1fd3cSPer Liden * contributors may be used to endorse or promote products derived from 19*9ea1fd3cSPer Liden * this software without specific prior written permission. 20*9ea1fd3cSPer Liden * 21*9ea1fd3cSPer Liden * Alternatively, this software may be distributed under the terms of the 22*9ea1fd3cSPer Liden * GNU General Public License ("GPL") version 2 as published by the Free 23*9ea1fd3cSPer Liden * Software Foundation. 24b97bf3fdSPer Liden * 25b97bf3fdSPer Liden * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 26b97bf3fdSPer Liden * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27b97bf3fdSPer Liden * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28b97bf3fdSPer Liden * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 29b97bf3fdSPer Liden * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 30b97bf3fdSPer Liden * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 31b97bf3fdSPer Liden * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 32b97bf3fdSPer Liden * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 33b97bf3fdSPer Liden * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 34b97bf3fdSPer Liden * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 35b97bf3fdSPer Liden * POSSIBILITY OF SUCH DAMAGE. 36b97bf3fdSPer Liden */ 37b97bf3fdSPer Liden 38b97bf3fdSPer Liden #include "core.h" 39b97bf3fdSPer Liden #include "cluster.h" 40b97bf3fdSPer Liden #include "dbg.h" 41b97bf3fdSPer Liden #include "link.h" 42b97bf3fdSPer Liden #include "msg.h" 43b97bf3fdSPer Liden #include "name_distr.h" 44b97bf3fdSPer Liden 45b97bf3fdSPer Liden #undef DBG_OUTPUT 46b97bf3fdSPer Liden #define DBG_OUTPUT NULL 47b97bf3fdSPer Liden 48b97bf3fdSPer Liden #define ITEM_SIZE sizeof(struct distr_item) 49b97bf3fdSPer Liden 50b97bf3fdSPer Liden /** 51b97bf3fdSPer Liden * struct distr_item - publication info distributed to other nodes 52b97bf3fdSPer Liden * @type: name sequence type 53b97bf3fdSPer Liden * @lower: name sequence lower bound 54b97bf3fdSPer Liden * @upper: name sequence upper bound 55b97bf3fdSPer Liden * @ref: publishing port reference 56b97bf3fdSPer Liden * @key: publication key 57b97bf3fdSPer Liden * 58b97bf3fdSPer Liden * ===> All fields are stored in network byte order. <=== 59b97bf3fdSPer Liden * 60b97bf3fdSPer Liden * First 3 fields identify (name or) name sequence being published. 61b97bf3fdSPer Liden * Reference field uniquely identifies port that published name sequence. 62b97bf3fdSPer Liden * Key field uniquely identifies publication, in the event a port has 63b97bf3fdSPer Liden * multiple publications of the same name sequence. 64b97bf3fdSPer Liden * 65b97bf3fdSPer Liden * Note: There is no field that identifies the publishing node because it is 66b97bf3fdSPer Liden * the same for all items contained within a publication message. 67b97bf3fdSPer Liden */ 68b97bf3fdSPer Liden 69b97bf3fdSPer Liden struct distr_item { 70b97bf3fdSPer Liden u32 type; 71b97bf3fdSPer Liden u32 lower; 72b97bf3fdSPer Liden u32 upper; 73b97bf3fdSPer Liden u32 ref; 74b97bf3fdSPer Liden u32 key; 75b97bf3fdSPer Liden }; 76b97bf3fdSPer Liden 77b97bf3fdSPer Liden /** 78b97bf3fdSPer Liden * List of externally visible publications by this node -- 79b97bf3fdSPer Liden * that is, all publications having scope > TIPC_NODE_SCOPE. 80b97bf3fdSPer Liden */ 81b97bf3fdSPer Liden 82b97bf3fdSPer Liden static LIST_HEAD(publ_root); 83b97bf3fdSPer Liden static u32 publ_cnt = 0; 84b97bf3fdSPer Liden 85b97bf3fdSPer Liden /** 86b97bf3fdSPer Liden * publ_to_item - add publication info to a publication message 87b97bf3fdSPer Liden */ 88b97bf3fdSPer Liden 89b97bf3fdSPer Liden static void publ_to_item(struct distr_item *i, struct publication *p) 90b97bf3fdSPer Liden { 91b97bf3fdSPer Liden i->type = htonl(p->type); 92b97bf3fdSPer Liden i->lower = htonl(p->lower); 93b97bf3fdSPer Liden i->upper = htonl(p->upper); 94b97bf3fdSPer Liden i->ref = htonl(p->ref); 95b97bf3fdSPer Liden i->key = htonl(p->key); 96b97bf3fdSPer Liden dbg("publ_to_item: %u, %u, %u\n", p->type, p->lower, p->upper); 97b97bf3fdSPer Liden } 98b97bf3fdSPer Liden 99b97bf3fdSPer Liden /** 100b97bf3fdSPer Liden * named_prepare_buf - allocate & initialize a publication message 101b97bf3fdSPer Liden */ 102b97bf3fdSPer Liden 103b97bf3fdSPer Liden static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest) 104b97bf3fdSPer Liden { 105b97bf3fdSPer Liden struct sk_buff *buf = buf_acquire(LONG_H_SIZE + size); 106b97bf3fdSPer Liden struct tipc_msg *msg; 107b97bf3fdSPer Liden 108b97bf3fdSPer Liden if (buf != NULL) { 109b97bf3fdSPer Liden msg = buf_msg(buf); 110b97bf3fdSPer Liden msg_init(msg, NAME_DISTRIBUTOR, type, TIPC_OK, 111b97bf3fdSPer Liden LONG_H_SIZE, dest); 112b97bf3fdSPer Liden msg_set_size(msg, LONG_H_SIZE + size); 113b97bf3fdSPer Liden } 114b97bf3fdSPer Liden return buf; 115b97bf3fdSPer Liden } 116b97bf3fdSPer Liden 117b97bf3fdSPer Liden /** 118b97bf3fdSPer Liden * named_publish - tell other nodes about a new publication by this node 119b97bf3fdSPer Liden */ 120b97bf3fdSPer Liden 121b97bf3fdSPer Liden void named_publish(struct publication *publ) 122b97bf3fdSPer Liden { 123b97bf3fdSPer Liden struct sk_buff *buf; 124b97bf3fdSPer Liden struct distr_item *item; 125b97bf3fdSPer Liden 126b97bf3fdSPer Liden list_add(&publ->local_list, &publ_root); 127b97bf3fdSPer Liden publ_cnt++; 128b97bf3fdSPer Liden 129b97bf3fdSPer Liden buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0); 130b97bf3fdSPer Liden if (!buf) { 131b97bf3fdSPer Liden warn("Memory squeeze; failed to distribute publication\n"); 132b97bf3fdSPer Liden return; 133b97bf3fdSPer Liden } 134b97bf3fdSPer Liden 135b97bf3fdSPer Liden item = (struct distr_item *)msg_data(buf_msg(buf)); 136b97bf3fdSPer Liden publ_to_item(item, publ); 137b97bf3fdSPer Liden dbg("named_withdraw: broadcasting publish msg\n"); 138b97bf3fdSPer Liden cluster_broadcast(buf); 139b97bf3fdSPer Liden } 140b97bf3fdSPer Liden 141b97bf3fdSPer Liden /** 142b97bf3fdSPer Liden * named_withdraw - tell other nodes about a withdrawn publication by this node 143b97bf3fdSPer Liden */ 144b97bf3fdSPer Liden 145b97bf3fdSPer Liden void named_withdraw(struct publication *publ) 146b97bf3fdSPer Liden { 147b97bf3fdSPer Liden struct sk_buff *buf; 148b97bf3fdSPer Liden struct distr_item *item; 149b97bf3fdSPer Liden 150b97bf3fdSPer Liden list_del(&publ->local_list); 151b97bf3fdSPer Liden publ_cnt--; 152b97bf3fdSPer Liden 153b97bf3fdSPer Liden buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0); 154b97bf3fdSPer Liden if (!buf) { 155b97bf3fdSPer Liden warn("Memory squeeze; failed to distribute withdrawal\n"); 156b97bf3fdSPer Liden return; 157b97bf3fdSPer Liden } 158b97bf3fdSPer Liden 159b97bf3fdSPer Liden item = (struct distr_item *)msg_data(buf_msg(buf)); 160b97bf3fdSPer Liden publ_to_item(item, publ); 161b97bf3fdSPer Liden dbg("named_withdraw: broadcasting withdraw msg\n"); 162b97bf3fdSPer Liden cluster_broadcast(buf); 163b97bf3fdSPer Liden } 164b97bf3fdSPer Liden 165b97bf3fdSPer Liden /** 166b97bf3fdSPer Liden * named_node_up - tell specified node about all publications by this node 167b97bf3fdSPer Liden */ 168b97bf3fdSPer Liden 169b97bf3fdSPer Liden void named_node_up(unsigned long node) 170b97bf3fdSPer Liden { 171b97bf3fdSPer Liden struct publication *publ; 172b97bf3fdSPer Liden struct distr_item *item = 0; 173b97bf3fdSPer Liden struct sk_buff *buf = 0; 174b97bf3fdSPer Liden u32 left = 0; 175b97bf3fdSPer Liden u32 rest; 176b97bf3fdSPer Liden u32 max_item_buf; 177b97bf3fdSPer Liden 178b97bf3fdSPer Liden assert(in_own_cluster(node)); 179b97bf3fdSPer Liden read_lock_bh(&nametbl_lock); 180b97bf3fdSPer Liden max_item_buf = TIPC_MAX_USER_MSG_SIZE / ITEM_SIZE; 181b97bf3fdSPer Liden max_item_buf *= ITEM_SIZE; 182b97bf3fdSPer Liden rest = publ_cnt * ITEM_SIZE; 183b97bf3fdSPer Liden 184b97bf3fdSPer Liden list_for_each_entry(publ, &publ_root, local_list) { 185b97bf3fdSPer Liden if (!buf) { 186b97bf3fdSPer Liden left = (rest <= max_item_buf) ? rest : max_item_buf; 187b97bf3fdSPer Liden rest -= left; 188b97bf3fdSPer Liden buf = named_prepare_buf(PUBLICATION, left, node); 189b97bf3fdSPer Liden if (buf == NULL) { 190b97bf3fdSPer Liden warn("Memory Squeeze; could not send publication\n"); 191b97bf3fdSPer Liden goto exit; 192b97bf3fdSPer Liden } 193b97bf3fdSPer Liden item = (struct distr_item *)msg_data(buf_msg(buf)); 194b97bf3fdSPer Liden } 195b97bf3fdSPer Liden publ_to_item(item, publ); 196b97bf3fdSPer Liden item++; 197b97bf3fdSPer Liden left -= ITEM_SIZE; 198b97bf3fdSPer Liden if (!left) { 199b97bf3fdSPer Liden msg_set_link_selector(buf_msg(buf), node); 200b97bf3fdSPer Liden dbg("named_node_up: sending publish msg to " 201b97bf3fdSPer Liden "<%u.%u.%u>\n", tipc_zone(node), 202b97bf3fdSPer Liden tipc_cluster(node), tipc_node(node)); 203b97bf3fdSPer Liden link_send(buf, node, node); 204b97bf3fdSPer Liden buf = 0; 205b97bf3fdSPer Liden } 206b97bf3fdSPer Liden } 207b97bf3fdSPer Liden exit: 208b97bf3fdSPer Liden read_unlock_bh(&nametbl_lock); 209b97bf3fdSPer Liden } 210b97bf3fdSPer Liden 211b97bf3fdSPer Liden /** 212b97bf3fdSPer Liden * node_is_down - remove publication associated with a failed node 213b97bf3fdSPer Liden * 214b97bf3fdSPer Liden * Invoked for each publication issued by a newly failed node. 215b97bf3fdSPer Liden * Removes publication structure from name table & deletes it. 216b97bf3fdSPer Liden * In rare cases the link may have come back up again when this 217b97bf3fdSPer Liden * function is called, and we have two items representing the same 218b97bf3fdSPer Liden * publication. Nudge this item's key to distinguish it from the other. 219b97bf3fdSPer Liden * (Note: Publication's node subscription is already unsubscribed.) 220b97bf3fdSPer Liden */ 221b97bf3fdSPer Liden 222b97bf3fdSPer Liden static void node_is_down(struct publication *publ) 223b97bf3fdSPer Liden { 224b97bf3fdSPer Liden struct publication *p; 225b97bf3fdSPer Liden write_lock_bh(&nametbl_lock); 226b97bf3fdSPer Liden dbg("node_is_down: withdrawing %u, %u, %u\n", 227b97bf3fdSPer Liden publ->type, publ->lower, publ->upper); 228b97bf3fdSPer Liden publ->key += 1222345; 229b97bf3fdSPer Liden p = nametbl_remove_publ(publ->type, publ->lower, 230b97bf3fdSPer Liden publ->node, publ->ref, publ->key); 231b97bf3fdSPer Liden assert(p == publ); 232b97bf3fdSPer Liden write_unlock_bh(&nametbl_lock); 233b97bf3fdSPer Liden if (publ) 234b97bf3fdSPer Liden kfree(publ); 235b97bf3fdSPer Liden } 236b97bf3fdSPer Liden 237b97bf3fdSPer Liden /** 238b97bf3fdSPer Liden * named_recv - process name table update message sent by another node 239b97bf3fdSPer Liden */ 240b97bf3fdSPer Liden 241b97bf3fdSPer Liden void named_recv(struct sk_buff *buf) 242b97bf3fdSPer Liden { 243b97bf3fdSPer Liden struct publication *publ; 244b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 245b97bf3fdSPer Liden struct distr_item *item = (struct distr_item *)msg_data(msg); 246b97bf3fdSPer Liden u32 count = msg_data_sz(msg) / ITEM_SIZE; 247b97bf3fdSPer Liden 248b97bf3fdSPer Liden write_lock_bh(&nametbl_lock); 249b97bf3fdSPer Liden while (count--) { 250b97bf3fdSPer Liden if (msg_type(msg) == PUBLICATION) { 251b97bf3fdSPer Liden dbg("named_recv: got publication for %u, %u, %u\n", 252b97bf3fdSPer Liden ntohl(item->type), ntohl(item->lower), 253b97bf3fdSPer Liden ntohl(item->upper)); 254b97bf3fdSPer Liden publ = nametbl_insert_publ(ntohl(item->type), 255b97bf3fdSPer Liden ntohl(item->lower), 256b97bf3fdSPer Liden ntohl(item->upper), 257b97bf3fdSPer Liden TIPC_CLUSTER_SCOPE, 258b97bf3fdSPer Liden msg_orignode(msg), 259b97bf3fdSPer Liden ntohl(item->ref), 260b97bf3fdSPer Liden ntohl(item->key)); 261b97bf3fdSPer Liden if (publ) { 262b97bf3fdSPer Liden nodesub_subscribe(&publ->subscr, 263b97bf3fdSPer Liden msg_orignode(msg), 264b97bf3fdSPer Liden publ, 265b97bf3fdSPer Liden (net_ev_handler)node_is_down); 266b97bf3fdSPer Liden } 267b97bf3fdSPer Liden } else if (msg_type(msg) == WITHDRAWAL) { 268b97bf3fdSPer Liden dbg("named_recv: got withdrawl for %u, %u, %u\n", 269b97bf3fdSPer Liden ntohl(item->type), ntohl(item->lower), 270b97bf3fdSPer Liden ntohl(item->upper)); 271b97bf3fdSPer Liden publ = nametbl_remove_publ(ntohl(item->type), 272b97bf3fdSPer Liden ntohl(item->lower), 273b97bf3fdSPer Liden msg_orignode(msg), 274b97bf3fdSPer Liden ntohl(item->ref), 275b97bf3fdSPer Liden ntohl(item->key)); 276b97bf3fdSPer Liden 277b97bf3fdSPer Liden if (publ) { 278b97bf3fdSPer Liden nodesub_unsubscribe(&publ->subscr); 279b97bf3fdSPer Liden kfree(publ); 280b97bf3fdSPer Liden } 281b97bf3fdSPer Liden } else { 282b97bf3fdSPer Liden warn("named_recv: unknown msg\n"); 283b97bf3fdSPer Liden } 284b97bf3fdSPer Liden item++; 285b97bf3fdSPer Liden } 286b97bf3fdSPer Liden write_unlock_bh(&nametbl_lock); 287b97bf3fdSPer Liden buf_discard(buf); 288b97bf3fdSPer Liden } 289b97bf3fdSPer Liden 290b97bf3fdSPer Liden /** 291b97bf3fdSPer Liden * named_reinit - re-initialize local publication list 292b97bf3fdSPer Liden * 293b97bf3fdSPer Liden * This routine is called whenever TIPC networking is (re)enabled. 294b97bf3fdSPer Liden * All existing publications by this node that have "cluster" or "zone" scope 295b97bf3fdSPer Liden * are updated to reflect the node's current network address. 296b97bf3fdSPer Liden * (If the node's address is unchanged, the update loop terminates immediately.) 297b97bf3fdSPer Liden */ 298b97bf3fdSPer Liden 299b97bf3fdSPer Liden void named_reinit(void) 300b97bf3fdSPer Liden { 301b97bf3fdSPer Liden struct publication *publ; 302b97bf3fdSPer Liden 303b97bf3fdSPer Liden write_lock_bh(&nametbl_lock); 304b97bf3fdSPer Liden list_for_each_entry(publ, &publ_root, local_list) { 305b97bf3fdSPer Liden if (publ->node == tipc_own_addr) 306b97bf3fdSPer Liden break; 307b97bf3fdSPer Liden publ->node = tipc_own_addr; 308b97bf3fdSPer Liden } 309b97bf3fdSPer Liden write_unlock_bh(&nametbl_lock); 310b97bf3fdSPer Liden } 311