1b97bf3fdSPer Liden /* 2b97bf3fdSPer Liden * net/tipc/name_distr.c: TIPC name distribution code 3b97bf3fdSPer Liden * 4593a5f22SPer Liden * Copyright (c) 2000-2006, Ericsson AB 5431697ebSAllan Stephens * Copyright (c) 2005, 2010-2011, Wind River Systems 6b97bf3fdSPer Liden * All rights reserved. 7b97bf3fdSPer Liden * 8b97bf3fdSPer Liden * Redistribution and use in source and binary forms, with or without 9b97bf3fdSPer Liden * modification, are permitted provided that the following conditions are met: 10b97bf3fdSPer Liden * 119ea1fd3cSPer Liden * 1. Redistributions of source code must retain the above copyright 129ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer. 139ea1fd3cSPer Liden * 2. Redistributions in binary form must reproduce the above copyright 149ea1fd3cSPer Liden * notice, this list of conditions and the following disclaimer in the 159ea1fd3cSPer Liden * documentation and/or other materials provided with the distribution. 169ea1fd3cSPer Liden * 3. Neither the names of the copyright holders nor the names of its 179ea1fd3cSPer Liden * contributors may be used to endorse or promote products derived from 189ea1fd3cSPer Liden * this software without specific prior written permission. 199ea1fd3cSPer Liden * 209ea1fd3cSPer Liden * Alternatively, this software may be distributed under the terms of the 219ea1fd3cSPer Liden * GNU General Public License ("GPL") version 2 as published by the Free 229ea1fd3cSPer Liden * Software Foundation. 23b97bf3fdSPer Liden * 24b97bf3fdSPer Liden * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 25b97bf3fdSPer Liden * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26b97bf3fdSPer Liden * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27b97bf3fdSPer Liden * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 28b97bf3fdSPer Liden * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 29b97bf3fdSPer Liden * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 30b97bf3fdSPer Liden * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 31b97bf3fdSPer Liden * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 32b97bf3fdSPer Liden * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 33b97bf3fdSPer Liden * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 34b97bf3fdSPer Liden * POSSIBILITY OF SUCH DAMAGE. 35b97bf3fdSPer Liden */ 36b97bf3fdSPer Liden 37b97bf3fdSPer Liden #include "core.h" 38b97bf3fdSPer Liden #include "link.h" 39b97bf3fdSPer Liden #include "name_distr.h" 40b97bf3fdSPer Liden 41b97bf3fdSPer Liden #define ITEM_SIZE sizeof(struct distr_item) 42b97bf3fdSPer Liden 43b97bf3fdSPer Liden /** 44b97bf3fdSPer Liden * struct distr_item - publication info distributed to other nodes 45b97bf3fdSPer Liden * @type: name sequence type 46b97bf3fdSPer Liden * @lower: name sequence lower bound 47b97bf3fdSPer Liden * @upper: name sequence upper bound 48b97bf3fdSPer Liden * @ref: publishing port reference 49b97bf3fdSPer Liden * @key: publication key 50b97bf3fdSPer Liden * 51b97bf3fdSPer Liden * ===> All fields are stored in network byte order. <=== 52b97bf3fdSPer Liden * 53b97bf3fdSPer Liden * First 3 fields identify (name or) name sequence being published. 54b97bf3fdSPer Liden * Reference field uniquely identifies port that published name sequence. 55b97bf3fdSPer Liden * Key field uniquely identifies publication, in the event a port has 56b97bf3fdSPer Liden * multiple publications of the same name sequence. 57b97bf3fdSPer Liden * 58b97bf3fdSPer Liden * Note: There is no field that identifies the publishing node because it is 59b97bf3fdSPer Liden * the same for all items contained within a publication message. 60b97bf3fdSPer Liden */ 61b97bf3fdSPer Liden 62b97bf3fdSPer Liden struct distr_item { 633e6c8cd5SAl Viro __be32 type; 643e6c8cd5SAl Viro __be32 lower; 653e6c8cd5SAl Viro __be32 upper; 663e6c8cd5SAl Viro __be32 ref; 673e6c8cd5SAl Viro __be32 key; 68b97bf3fdSPer Liden }; 69b97bf3fdSPer Liden 70b97bf3fdSPer Liden /** 713f8375feSAllan Stephens * struct publ_list - list of publications made by this node 723f8375feSAllan Stephens * @list: circular list of publications 733f8375feSAllan Stephens * @list_size: number of entries in list 74b97bf3fdSPer Liden */ 753f8375feSAllan Stephens struct publ_list { 763f8375feSAllan Stephens struct list_head list; 773f8375feSAllan Stephens u32 size; 783f8375feSAllan Stephens }; 79b97bf3fdSPer Liden 80*a909804fSAllan Stephens static struct publ_list publ_zone = { 81*a909804fSAllan Stephens .list = LIST_HEAD_INIT(publ_zone.list), 82*a909804fSAllan Stephens .size = 0, 83*a909804fSAllan Stephens }; 84*a909804fSAllan Stephens 853f8375feSAllan Stephens static struct publ_list publ_cluster = { 863f8375feSAllan Stephens .list = LIST_HEAD_INIT(publ_cluster.list), 873f8375feSAllan Stephens .size = 0, 883f8375feSAllan Stephens }; 89b97bf3fdSPer Liden 90*a909804fSAllan Stephens static struct publ_list publ_node = { 91*a909804fSAllan Stephens .list = LIST_HEAD_INIT(publ_node.list), 92*a909804fSAllan Stephens .size = 0, 93*a909804fSAllan Stephens }; 94*a909804fSAllan Stephens 95*a909804fSAllan Stephens static struct publ_list *publ_lists[] = { 96*a909804fSAllan Stephens NULL, 97*a909804fSAllan Stephens &publ_zone, /* publ_lists[TIPC_ZONE_SCOPE] */ 98*a909804fSAllan Stephens &publ_cluster, /* publ_lists[TIPC_CLUSTER_SCOPE] */ 99*a909804fSAllan Stephens &publ_node /* publ_lists[TIPC_NODE_SCOPE] */ 100*a909804fSAllan Stephens }; 101*a909804fSAllan Stephens 102*a909804fSAllan Stephens 103b97bf3fdSPer Liden /** 104b97bf3fdSPer Liden * publ_to_item - add publication info to a publication message 105b97bf3fdSPer Liden */ 106b97bf3fdSPer Liden 107b97bf3fdSPer Liden static void publ_to_item(struct distr_item *i, struct publication *p) 108b97bf3fdSPer Liden { 109b97bf3fdSPer Liden i->type = htonl(p->type); 110b97bf3fdSPer Liden i->lower = htonl(p->lower); 111b97bf3fdSPer Liden i->upper = htonl(p->upper); 112b97bf3fdSPer Liden i->ref = htonl(p->ref); 113b97bf3fdSPer Liden i->key = htonl(p->key); 114b97bf3fdSPer Liden } 115b97bf3fdSPer Liden 116b97bf3fdSPer Liden /** 117b97bf3fdSPer Liden * named_prepare_buf - allocate & initialize a publication message 118b97bf3fdSPer Liden */ 119b97bf3fdSPer Liden 120b97bf3fdSPer Liden static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest) 121b97bf3fdSPer Liden { 122741d9eb7SAllan Stephens struct sk_buff *buf = tipc_buf_acquire(INT_H_SIZE + size); 123b97bf3fdSPer Liden struct tipc_msg *msg; 124b97bf3fdSPer Liden 125b97bf3fdSPer Liden if (buf != NULL) { 126b97bf3fdSPer Liden msg = buf_msg(buf); 127741d9eb7SAllan Stephens tipc_msg_init(msg, NAME_DISTRIBUTOR, type, INT_H_SIZE, dest); 128741d9eb7SAllan Stephens msg_set_size(msg, INT_H_SIZE + size); 129b97bf3fdSPer Liden } 130b97bf3fdSPer Liden return buf; 131b97bf3fdSPer Liden } 132b97bf3fdSPer Liden 1338f92df6aSAllan Stephens static void named_cluster_distribute(struct sk_buff *buf) 1348f92df6aSAllan Stephens { 1358f92df6aSAllan Stephens struct sk_buff *buf_copy; 1368f92df6aSAllan Stephens struct tipc_node *n_ptr; 1378f92df6aSAllan Stephens 138672d99e1SAllan Stephens list_for_each_entry(n_ptr, &tipc_node_list, list) { 1398f19afb2SPaul Gortmaker if (tipc_node_active_links(n_ptr)) { 1408f92df6aSAllan Stephens buf_copy = skb_copy(buf, GFP_ATOMIC); 1418f92df6aSAllan Stephens if (!buf_copy) 1428f92df6aSAllan Stephens break; 1438f92df6aSAllan Stephens msg_set_destnode(buf_msg(buf_copy), n_ptr->addr); 1448f92df6aSAllan Stephens tipc_link_send(buf_copy, n_ptr->addr, n_ptr->addr); 1458f92df6aSAllan Stephens } 1468f92df6aSAllan Stephens } 1478f92df6aSAllan Stephens 1485f6d9123SAllan Stephens kfree_skb(buf); 1498f92df6aSAllan Stephens } 1508f92df6aSAllan Stephens 151b97bf3fdSPer Liden /** 1524323add6SPer Liden * tipc_named_publish - tell other nodes about a new publication by this node 153b97bf3fdSPer Liden */ 154b97bf3fdSPer Liden 1554323add6SPer Liden void tipc_named_publish(struct publication *publ) 156b97bf3fdSPer Liden { 157b97bf3fdSPer Liden struct sk_buff *buf; 158b97bf3fdSPer Liden struct distr_item *item; 159b97bf3fdSPer Liden 160*a909804fSAllan Stephens list_add_tail(&publ->local_list, &publ_lists[publ->scope]->list); 161*a909804fSAllan Stephens publ_lists[publ->scope]->size++; 162b97bf3fdSPer Liden 163b97bf3fdSPer Liden buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0); 164b97bf3fdSPer Liden if (!buf) { 165a10bd924SAllan Stephens warn("Publication distribution failure\n"); 166b97bf3fdSPer Liden return; 167b97bf3fdSPer Liden } 168b97bf3fdSPer Liden 169b97bf3fdSPer Liden item = (struct distr_item *)msg_data(buf_msg(buf)); 170b97bf3fdSPer Liden publ_to_item(item, publ); 1718f92df6aSAllan Stephens named_cluster_distribute(buf); 172b97bf3fdSPer Liden } 173b97bf3fdSPer Liden 174b97bf3fdSPer Liden /** 1754323add6SPer Liden * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node 176b97bf3fdSPer Liden */ 177b97bf3fdSPer Liden 1784323add6SPer Liden void tipc_named_withdraw(struct publication *publ) 179b97bf3fdSPer Liden { 180b97bf3fdSPer Liden struct sk_buff *buf; 181b97bf3fdSPer Liden struct distr_item *item; 182b97bf3fdSPer Liden 183b97bf3fdSPer Liden list_del(&publ->local_list); 184*a909804fSAllan Stephens publ_lists[publ->scope]->size--; 185b97bf3fdSPer Liden 186b97bf3fdSPer Liden buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0); 187b97bf3fdSPer Liden if (!buf) { 18825985edcSLucas De Marchi warn("Withdrawal distribution failure\n"); 189b97bf3fdSPer Liden return; 190b97bf3fdSPer Liden } 191b97bf3fdSPer Liden 192b97bf3fdSPer Liden item = (struct distr_item *)msg_data(buf_msg(buf)); 193b97bf3fdSPer Liden publ_to_item(item, publ); 1948f92df6aSAllan Stephens named_cluster_distribute(buf); 195b97bf3fdSPer Liden } 196b97bf3fdSPer Liden 197e11aa059SAllan Stephens /* 198e11aa059SAllan Stephens * named_distribute - prepare name info for bulk distribution to another node 199e11aa059SAllan Stephens */ 200e11aa059SAllan Stephens static void named_distribute(struct list_head *message_list, u32 node, 201e11aa059SAllan Stephens struct publ_list *pls, u32 max_item_buf) 202e11aa059SAllan Stephens { 203e11aa059SAllan Stephens struct publication *publ; 204e11aa059SAllan Stephens struct sk_buff *buf = NULL; 205e11aa059SAllan Stephens struct distr_item *item = NULL; 206e11aa059SAllan Stephens u32 left = 0; 207e11aa059SAllan Stephens u32 rest = pls->size * ITEM_SIZE; 208e11aa059SAllan Stephens 209e11aa059SAllan Stephens list_for_each_entry(publ, &pls->list, local_list) { 210e11aa059SAllan Stephens if (!buf) { 211e11aa059SAllan Stephens left = (rest <= max_item_buf) ? rest : max_item_buf; 212e11aa059SAllan Stephens rest -= left; 213e11aa059SAllan Stephens buf = named_prepare_buf(PUBLICATION, left, node); 214e11aa059SAllan Stephens if (!buf) { 215e11aa059SAllan Stephens warn("Bulk publication failure\n"); 216e11aa059SAllan Stephens return; 217e11aa059SAllan Stephens } 218e11aa059SAllan Stephens item = (struct distr_item *)msg_data(buf_msg(buf)); 219e11aa059SAllan Stephens } 220e11aa059SAllan Stephens publ_to_item(item, publ); 221e11aa059SAllan Stephens item++; 222e11aa059SAllan Stephens left -= ITEM_SIZE; 223e11aa059SAllan Stephens if (!left) { 224e11aa059SAllan Stephens list_add_tail((struct list_head *)buf, message_list); 225e11aa059SAllan Stephens buf = NULL; 226e11aa059SAllan Stephens } 227e11aa059SAllan Stephens } 228e11aa059SAllan Stephens } 229e11aa059SAllan Stephens 230b97bf3fdSPer Liden /** 2314323add6SPer Liden * tipc_named_node_up - tell specified node about all publications by this node 232b97bf3fdSPer Liden */ 233b97bf3fdSPer Liden 2341c553bb5SPaul Gortmaker void tipc_named_node_up(unsigned long nodearg) 235b97bf3fdSPer Liden { 236149ce37cSAllan Stephens struct tipc_node *n_ptr; 237a18c4bc3SPaul Gortmaker struct tipc_link *l_ptr; 2389aa88c2aSAllan Stephens struct list_head message_list; 2391c553bb5SPaul Gortmaker u32 node = (u32)nodearg; 240149ce37cSAllan Stephens u32 max_item_buf = 0; 241149ce37cSAllan Stephens 242149ce37cSAllan Stephens /* compute maximum amount of publication data to send per message */ 243149ce37cSAllan Stephens 244149ce37cSAllan Stephens read_lock_bh(&tipc_net_lock); 2451c553bb5SPaul Gortmaker n_ptr = tipc_node_find(node); 246149ce37cSAllan Stephens if (n_ptr) { 247149ce37cSAllan Stephens tipc_node_lock(n_ptr); 248149ce37cSAllan Stephens l_ptr = n_ptr->active_links[0]; 249149ce37cSAllan Stephens if (l_ptr) 250149ce37cSAllan Stephens max_item_buf = ((l_ptr->max_pkt - INT_H_SIZE) / 251149ce37cSAllan Stephens ITEM_SIZE) * ITEM_SIZE; 252149ce37cSAllan Stephens tipc_node_unlock(n_ptr); 253149ce37cSAllan Stephens } 254149ce37cSAllan Stephens read_unlock_bh(&tipc_net_lock); 255149ce37cSAllan Stephens if (!max_item_buf) 256149ce37cSAllan Stephens return; 257b97bf3fdSPer Liden 2589aa88c2aSAllan Stephens /* create list of publication messages, then send them as a unit */ 2599aa88c2aSAllan Stephens 2609aa88c2aSAllan Stephens INIT_LIST_HEAD(&message_list); 2619aa88c2aSAllan Stephens 2624323add6SPer Liden read_lock_bh(&tipc_nametbl_lock); 263e11aa059SAllan Stephens named_distribute(&message_list, node, &publ_cluster, max_item_buf); 264*a909804fSAllan Stephens named_distribute(&message_list, node, &publ_zone, max_item_buf); 2654323add6SPer Liden read_unlock_bh(&tipc_nametbl_lock); 2669aa88c2aSAllan Stephens 2679aa88c2aSAllan Stephens tipc_link_send_names(&message_list, (u32)node); 268b97bf3fdSPer Liden } 269b97bf3fdSPer Liden 270b97bf3fdSPer Liden /** 271f1379173SAllan Stephens * named_purge_publ - remove publication associated with a failed node 272b97bf3fdSPer Liden * 273b97bf3fdSPer Liden * Invoked for each publication issued by a newly failed node. 274b97bf3fdSPer Liden * Removes publication structure from name table & deletes it. 275b97bf3fdSPer Liden */ 276b97bf3fdSPer Liden 277f1379173SAllan Stephens static void named_purge_publ(struct publication *publ) 278b97bf3fdSPer Liden { 279b97bf3fdSPer Liden struct publication *p; 280f131072cSAllan Stephens 2814323add6SPer Liden write_lock_bh(&tipc_nametbl_lock); 2824323add6SPer Liden p = tipc_nametbl_remove_publ(publ->type, publ->lower, 283b97bf3fdSPer Liden publ->node, publ->ref, publ->key); 284431697ebSAllan Stephens if (p) 285431697ebSAllan Stephens tipc_nodesub_unsubscribe(&p->subscr); 2864323add6SPer Liden write_unlock_bh(&tipc_nametbl_lock); 287f131072cSAllan Stephens 288f131072cSAllan Stephens if (p != publ) { 289f131072cSAllan Stephens err("Unable to remove publication from failed node\n" 290f131072cSAllan Stephens "(type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n", 291f131072cSAllan Stephens publ->type, publ->lower, publ->node, publ->ref, publ->key); 292f131072cSAllan Stephens } 293f131072cSAllan Stephens 294f131072cSAllan Stephens kfree(p); 295f131072cSAllan Stephens } 296b97bf3fdSPer Liden 297b97bf3fdSPer Liden /** 2984323add6SPer Liden * tipc_named_recv - process name table update message sent by another node 299b97bf3fdSPer Liden */ 300b97bf3fdSPer Liden 3014323add6SPer Liden void tipc_named_recv(struct sk_buff *buf) 302b97bf3fdSPer Liden { 303b97bf3fdSPer Liden struct publication *publ; 304b97bf3fdSPer Liden struct tipc_msg *msg = buf_msg(buf); 305b97bf3fdSPer Liden struct distr_item *item = (struct distr_item *)msg_data(msg); 306b97bf3fdSPer Liden u32 count = msg_data_sz(msg) / ITEM_SIZE; 307b97bf3fdSPer Liden 3084323add6SPer Liden write_lock_bh(&tipc_nametbl_lock); 309b97bf3fdSPer Liden while (count--) { 310b97bf3fdSPer Liden if (msg_type(msg) == PUBLICATION) { 3114323add6SPer Liden publ = tipc_nametbl_insert_publ(ntohl(item->type), 312b97bf3fdSPer Liden ntohl(item->lower), 313b97bf3fdSPer Liden ntohl(item->upper), 314b97bf3fdSPer Liden TIPC_CLUSTER_SCOPE, 315b97bf3fdSPer Liden msg_orignode(msg), 316b97bf3fdSPer Liden ntohl(item->ref), 317b97bf3fdSPer Liden ntohl(item->key)); 318b97bf3fdSPer Liden if (publ) { 3194323add6SPer Liden tipc_nodesub_subscribe(&publ->subscr, 320b97bf3fdSPer Liden msg_orignode(msg), 321b97bf3fdSPer Liden publ, 322f1379173SAllan Stephens (net_ev_handler) 323f1379173SAllan Stephens named_purge_publ); 324b97bf3fdSPer Liden } 325b97bf3fdSPer Liden } else if (msg_type(msg) == WITHDRAWAL) { 3264323add6SPer Liden publ = tipc_nametbl_remove_publ(ntohl(item->type), 327b97bf3fdSPer Liden ntohl(item->lower), 328b97bf3fdSPer Liden msg_orignode(msg), 329b97bf3fdSPer Liden ntohl(item->ref), 330b97bf3fdSPer Liden ntohl(item->key)); 331b97bf3fdSPer Liden 332b97bf3fdSPer Liden if (publ) { 3334323add6SPer Liden tipc_nodesub_unsubscribe(&publ->subscr); 334b97bf3fdSPer Liden kfree(publ); 335f131072cSAllan Stephens } else { 336f131072cSAllan Stephens err("Unable to remove publication by node 0x%x\n" 337f131072cSAllan Stephens "(type=%u, lower=%u, ref=%u, key=%u)\n", 338f131072cSAllan Stephens msg_orignode(msg), 339f131072cSAllan Stephens ntohl(item->type), ntohl(item->lower), 340f131072cSAllan Stephens ntohl(item->ref), ntohl(item->key)); 341b97bf3fdSPer Liden } 342b97bf3fdSPer Liden } else { 343a10bd924SAllan Stephens warn("Unrecognized name table message received\n"); 344b97bf3fdSPer Liden } 345b97bf3fdSPer Liden item++; 346b97bf3fdSPer Liden } 3474323add6SPer Liden write_unlock_bh(&tipc_nametbl_lock); 3485f6d9123SAllan Stephens kfree_skb(buf); 349b97bf3fdSPer Liden } 350b97bf3fdSPer Liden 351b97bf3fdSPer Liden /** 3524323add6SPer Liden * tipc_named_reinit - re-initialize local publication list 353b97bf3fdSPer Liden * 354945af1c3SAllan Stephens * This routine is called whenever TIPC networking is enabled. 355b97bf3fdSPer Liden * All existing publications by this node that have "cluster" or "zone" scope 356945af1c3SAllan Stephens * are updated to reflect the node's new network address. 357b97bf3fdSPer Liden */ 358b97bf3fdSPer Liden 3594323add6SPer Liden void tipc_named_reinit(void) 360b97bf3fdSPer Liden { 361b97bf3fdSPer Liden struct publication *publ; 362*a909804fSAllan Stephens int scope; 363b97bf3fdSPer Liden 3644323add6SPer Liden write_lock_bh(&tipc_nametbl_lock); 365945af1c3SAllan Stephens 366*a909804fSAllan Stephens for (scope = TIPC_ZONE_SCOPE; scope <= TIPC_CLUSTER_SCOPE; scope++) 367*a909804fSAllan Stephens list_for_each_entry(publ, &publ_lists[scope]->list, local_list) 368b97bf3fdSPer Liden publ->node = tipc_own_addr; 369945af1c3SAllan Stephens 3704323add6SPer Liden write_unlock_bh(&tipc_nametbl_lock); 371b97bf3fdSPer Liden } 372