1 /* 2 * net/tipc/name_table.h: Include file for TIPC name table code 3 * 4 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB 5 * Copyright (c) 2004-2005, 2010-2011, 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_NAME_TABLE_H 38 #define _TIPC_NAME_TABLE_H 39 40 struct tipc_subscription; 41 struct tipc_plist; 42 struct tipc_nlist; 43 44 /* 45 * TIPC name types reserved for internal TIPC use (both current and planned) 46 */ 47 #define TIPC_ZM_SRV 3 /* zone master service name type */ 48 #define TIPC_PUBL_SCOPE_NUM (TIPC_NODE_SCOPE + 1) 49 #define TIPC_NAMETBL_SIZE 1024 /* must be a power of 2 */ 50 51 /** 52 * struct publication - info about a published (name or) name sequence 53 * @type: name sequence type 54 * @lower: name sequence lower bound 55 * @upper: name sequence upper bound 56 * @scope: scope of publication 57 * @node: network address of publishing port's node 58 * @ref: publishing port 59 * @key: publication key 60 * @nodesub_list: subscription to "node down" event (off-node publication only) 61 * @local_list: adjacent entries in list of publications made by this node 62 * @pport_list: adjacent entries in list of publications made by this port 63 * @node_list: adjacent matching name seq publications with >= node scope 64 * @cluster_list: adjacent matching name seq publications with >= cluster scope 65 * @zone_list: adjacent matching name seq publications with >= zone scope 66 * @rcu: RCU callback head used for deferred freeing 67 * 68 * Note that the node list, cluster list, and zone list are circular lists. 69 */ 70 struct publication { 71 u32 type; 72 u32 lower; 73 u32 upper; 74 u32 scope; 75 u32 node; 76 u32 ref; 77 u32 key; 78 struct list_head nodesub_list; 79 struct list_head local_list; 80 struct list_head pport_list; 81 struct list_head node_list; 82 struct list_head cluster_list; 83 struct list_head zone_list; 84 struct rcu_head rcu; 85 }; 86 87 /** 88 * struct name_table - table containing all existing port name publications 89 * @seq_hlist: name sequence hash lists 90 * @publ_list: pulication lists 91 * @local_publ_count: number of publications issued by this node 92 */ 93 struct name_table { 94 struct hlist_head seq_hlist[TIPC_NAMETBL_SIZE]; 95 struct list_head publ_list[TIPC_PUBL_SCOPE_NUM]; 96 u32 local_publ_count; 97 }; 98 99 int tipc_nl_name_table_dump(struct sk_buff *skb, struct netlink_callback *cb); 100 101 u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, u32 *node); 102 int tipc_nametbl_mc_translate(struct net *net, u32 type, u32 lower, u32 upper, 103 u32 limit, struct list_head *dports); 104 void tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower, 105 u32 upper, u32 domain, 106 struct tipc_nlist *nodes); 107 struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower, 108 u32 upper, u32 scope, u32 port_ref, 109 u32 key); 110 int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref, 111 u32 key); 112 struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type, 113 u32 lower, u32 upper, u32 scope, 114 u32 node, u32 ref, u32 key); 115 struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type, 116 u32 lower, u32 node, u32 ref, 117 u32 key); 118 void tipc_nametbl_subscribe(struct tipc_subscription *s); 119 void tipc_nametbl_unsubscribe(struct tipc_subscription *s); 120 int tipc_nametbl_init(struct net *net); 121 void tipc_nametbl_stop(struct net *net); 122 123 struct u32_item { 124 struct list_head list; 125 u32 value; 126 }; 127 128 bool u32_push(struct list_head *l, u32 value); 129 u32 u32_pop(struct list_head *l); 130 bool u32_find(struct list_head *l, u32 value); 131 bool u32_del(struct list_head *l, u32 value); 132 void u32_list_purge(struct list_head *l); 133 int u32_list_len(struct list_head *l); 134 135 #endif 136