[linux.git] / net / tipc / name_distr.c

/*
 * net/tipc/name_distr.c: TIPC name distribution code
 *
 * Copyright (c) 2000-2006, Ericsson AB
 * Copyright (c) 2005, Wind River Systems
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
 *
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "cluster.h"
#include "dbg.h"
#include "link.h"
#include "msg.h"
#include "name_distr.h"

#define ITEM_SIZE sizeof(struct distr_item)

/**
 * struct distr_item - publication info distributed to other nodes
 * @type: name sequence type
 * @lower: name sequence lower bound
 * @upper: name sequence upper bound
 * @ref: publishing port reference
 * @key: publication key
 *
 * ===> All fields are stored in network byte order. <===
 *
 * First 3 fields identify (name or) name sequence being published.
 * Reference field uniquely identifies port that published name sequence.
 * Key field uniquely identifies publication, in the event a port has
 * multiple publications of the same name sequence.
 *
 * Note: There is no field that identifies the publishing node because it is
 * the same for all items contained within a publication message.
 */

struct distr_item {
	__be32 type;
	__be32 lower;
	__be32 upper;
	__be32 ref;
	__be32 key;
};

/**
 * List of externally visible publications by this node --
 * that is, all publications having scope > TIPC_NODE_SCOPE.
 */

static LIST_HEAD(publ_root);
static u32 publ_cnt = 0;

/**
 * publ_to_item - add publication info to a publication message
 */

static void publ_to_item(struct distr_item *i, struct publication *p)
{
	i->type = htonl(p->type);
	i->lower = htonl(p->lower);
	i->upper = htonl(p->upper);
	i->ref = htonl(p->ref);
	i->key = htonl(p->key);
	dbg("publ_to_item: %u, %u, %u\n", p->type, p->lower, p->upper);
}

/**
 * named_prepare_buf - allocate & initialize a publication message
 */

static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest)
{
	struct sk_buff *buf = buf_acquire(LONG_H_SIZE + size);
	struct tipc_msg *msg;

	if (buf != NULL) {
		msg = buf_msg(buf);
		msg_init(msg, NAME_DISTRIBUTOR, type, LONG_H_SIZE, dest);
		msg_set_size(msg, LONG_H_SIZE + size);
	}
	return buf;
}

/**
 * tipc_named_publish - tell other nodes about a new publication by this node
 */

void tipc_named_publish(struct publication *publ)
{
	struct sk_buff *buf;
	struct distr_item *item;

	list_add_tail(&publ->local_list, &publ_root);
	publ_cnt++;

	buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
	if (!buf) {
		warn("Publication distribution failure\n");
		return;
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
	dbg("tipc_named_withdraw: broadcasting publish msg\n");
	tipc_cltr_broadcast(buf);
}

/**
 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
 */

void tipc_named_withdraw(struct publication *publ)
{
	struct sk_buff *buf;
	struct distr_item *item;

	list_del(&publ->local_list);
	publ_cnt--;

	buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
	if (!buf) {
		warn("Withdrawl distribution failure\n");
		return;
	}

	item = (struct distr_item *)msg_data(buf_msg(buf));
	publ_to_item(item, publ);
	dbg("tipc_named_withdraw: broadcasting withdraw msg\n");
	tipc_cltr_broadcast(buf);
}

/**
 * tipc_named_node_up - tell specified node about all publications by this node
 */

void tipc_named_node_up(unsigned long node)
{
	struct publication *publ;
	struct distr_item *item = NULL;
	struct sk_buff *buf = NULL;
	u32 left = 0;
	u32 rest;
	u32 max_item_buf;

	read_lock_bh(&tipc_nametbl_lock);
	max_item_buf = TIPC_MAX_USER_MSG_SIZE / ITEM_SIZE;
	max_item_buf *= ITEM_SIZE;
	rest = publ_cnt * ITEM_SIZE;

	list_for_each_entry(publ, &publ_root, local_list) {
		if (!buf) {
			left = (rest <= max_item_buf) ? rest : max_item_buf;
			rest -= left;
			buf = named_prepare_buf(PUBLICATION, left, node);
			if (!buf) {
				warn("Bulk publication distribution failure\n");
				goto exit;
			}
			item = (struct distr_item *)msg_data(buf_msg(buf));
		}
		publ_to_item(item, publ);
		item++;
		left -= ITEM_SIZE;
		if (!left) {
			msg_set_link_selector(buf_msg(buf), node);
			dbg("tipc_named_node_up: sending publish msg to "
			    "<%u.%u.%u>\n", tipc_zone(node),
			    tipc_cluster(node), tipc_node(node));
			tipc_link_send(buf, node, node);
			buf = NULL;
		}
	}
exit:
	read_unlock_bh(&tipc_nametbl_lock);
}

/**
 * node_is_down - remove publication associated with a failed node
 *
 * Invoked for each publication issued by a newly failed node.
 * Removes publication structure from name table & deletes it.
 * In rare cases the link may have come back up again when this
 * function is called, and we have two items representing the same
 * publication. Nudge this item's key to distinguish it from the other.
 * (Note: Publication's node subscription is already unsubscribed.)
 */

static void node_is_down(struct publication *publ)
{
	struct publication *p;

	write_lock_bh(&tipc_nametbl_lock);
	dbg("node_is_down: withdrawing %u, %u, %u\n",
	    publ->type, publ->lower, publ->upper);
	publ->key += 1222345;
	p = tipc_nametbl_remove_publ(publ->type, publ->lower,
				     publ->node, publ->ref, publ->key);
	write_unlock_bh(&tipc_nametbl_lock);

	if (p != publ) {
		err("Unable to remove publication from failed node\n"
		    "(type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
		    publ->type, publ->lower, publ->node, publ->ref, publ->key);
	}

	if (p) {
		kfree(p);
	}
}

/**
 * tipc_named_recv - process name table update message sent by another node
 */

void tipc_named_recv(struct sk_buff *buf)
{
	struct publication *publ;
	struct tipc_msg *msg = buf_msg(buf);
	struct distr_item *item = (struct distr_item *)msg_data(msg);
	u32 count = msg_data_sz(msg) / ITEM_SIZE;

	write_lock_bh(&tipc_nametbl_lock);
	while (count--) {
		if (msg_type(msg) == PUBLICATION) {
			dbg("tipc_named_recv: got publication for %u, %u, %u\n",
			    ntohl(item->type), ntohl(item->lower),
			    ntohl(item->upper));
			publ = tipc_nametbl_insert_publ(ntohl(item->type),
							ntohl(item->lower),
							ntohl(item->upper),
							TIPC_CLUSTER_SCOPE,
							msg_orignode(msg),
							ntohl(item->ref),
							ntohl(item->key));
			if (publ) {
				tipc_nodesub_subscribe(&publ->subscr,
						       msg_orignode(msg),
						       publ,
						       (net_ev_handler)node_is_down);
			}
		} else if (msg_type(msg) == WITHDRAWAL) {
			dbg("tipc_named_recv: got withdrawl for %u, %u, %u\n",
			    ntohl(item->type), ntohl(item->lower),
			    ntohl(item->upper));
			publ = tipc_nametbl_remove_publ(ntohl(item->type),
							ntohl(item->lower),
							msg_orignode(msg),
							ntohl(item->ref),
							ntohl(item->key));

			if (publ) {
				tipc_nodesub_unsubscribe(&publ->subscr);
				kfree(publ);
			} else {
				err("Unable to remove publication by node 0x%x\n"
				    "(type=%u, lower=%u, ref=%u, key=%u)\n",
				    msg_orignode(msg),
				    ntohl(item->type), ntohl(item->lower),
				    ntohl(item->ref), ntohl(item->key));
			}
		} else {
			warn("Unrecognized name table message received\n");
		}
		item++;
	}
	write_unlock_bh(&tipc_nametbl_lock);
	buf_discard(buf);
}

/**
 * tipc_named_reinit - re-initialize local publication list
 *
 * This routine is called whenever TIPC networking is (re)enabled.
 * All existing publications by this node that have "cluster" or "zone" scope
 * are updated to reflect the node's current network address.
 * (If the node's address is unchanged, the update loop terminates immediately.)
 */

void tipc_named_reinit(void)
{
	struct publication *publ;

	write_lock_bh(&tipc_nametbl_lock);
	list_for_each_entry(publ, &publ_root, local_list) {
		if (publ->node == tipc_own_addr)
			break;
		publ->node = tipc_own_addr;
	}
	write_unlock_bh(&tipc_nametbl_lock);
}
Commit	Line	Data
b97bf3fd PL	1	/*
b97bf3fd PL	2	* net/tipc/name_distr.c: TIPC name distribution code
c4307285	3	*
593a5f22	4	* Copyright (c) 2000-2006, Ericsson AB
b97bf3fd	5	* Copyright (c) 2005, Wind River Systems
b97bf3fd PL	6	* All rights reserved.
b97bf3fd PL	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:
b97bf3fd PL	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	#include "core.h"
	38	#include "cluster.h"
	39	#include "dbg.h"
	40	#include "link.h"
	41	#include "msg.h"
	42	#include "name_distr.h"
	43
b97bf3fd PL	44	#define ITEM_SIZE sizeof(struct distr_item)
	45
	46	/**
	47	* struct distr_item - publication info distributed to other nodes
	48	* @type: name sequence type
	49	* @lower: name sequence lower bound
	50	* @upper: name sequence upper bound
	51	* @ref: publishing port reference
	52	* @key: publication key
c4307285	53	*
b97bf3fd	54	* ===> All fields are stored in network byte order. <===
c4307285	55	*
b97bf3fd PL	56	* First 3 fields identify (name or) name sequence being published.
	57	* Reference field uniquely identifies port that published name sequence.
	58	* Key field uniquely identifies publication, in the event a port has
	59	* multiple publications of the same name sequence.
c4307285 YH	60	*
c4307285 YH	61	* Note: There is no field that identifies the publishing node because it is
b97bf3fd PL	62	* the same for all items contained within a publication message.
	63	*/
	64
	65	struct distr_item {
3e6c8cd5 AV	66	__be32 type;
	67	__be32 lower;
	68	__be32 upper;
	69	__be32 ref;
	70	__be32 key;
b97bf3fd PL	71	};
	72
	73	/**
c4307285	74	* List of externally visible publications by this node --
b97bf3fd PL	75	* that is, all publications having scope > TIPC_NODE_SCOPE.
	76	*/
	77
	78	static LIST_HEAD(publ_root);
c4307285	79	static u32 publ_cnt = 0;
b97bf3fd PL	80
	81	/**
	82	* publ_to_item - add publication info to a publication message
	83	*/
	84
	85	static void publ_to_item(struct distr_item i, struct publication p)
	86	{
	87	i->type = htonl(p->type);
	88	i->lower = htonl(p->lower);
	89	i->upper = htonl(p->upper);
	90	i->ref = htonl(p->ref);
	91	i->key = htonl(p->key);
	92	dbg("publ_to_item: %u, %u, %u\n", p->type, p->lower, p->upper);
	93	}
	94
	95	/**
	96	* named_prepare_buf - allocate & initialize a publication message
	97	*/
	98
	99	static struct sk_buff *named_prepare_buf(u32 type, u32 size, u32 dest)
	100	{
c4307285	101	struct sk_buff *buf = buf_acquire(LONG_H_SIZE + size);
b97bf3fd PL	102	struct tipc_msg *msg;
	103
	104	if (buf != NULL) {
	105	msg = buf_msg(buf);
75715217	106	msg_init(msg, NAME_DISTRIBUTOR, type, LONG_H_SIZE, dest);
b97bf3fd PL	107	msg_set_size(msg, LONG_H_SIZE + size);
	108	}
	109	return buf;
	110	}
	111
	112	/**
4323add6	113	* tipc_named_publish - tell other nodes about a new publication by this node
b97bf3fd PL	114	*/
b97bf3fd PL	115
4323add6	116	void tipc_named_publish(struct publication *publ)
b97bf3fd PL	117	{
	118	struct sk_buff *buf;
	119	struct distr_item *item;
	120
08c31f71	121	list_add_tail(&publ->local_list, &publ_root);
b97bf3fd PL	122	publ_cnt++;
	123
	124	buf = named_prepare_buf(PUBLICATION, ITEM_SIZE, 0);
	125	if (!buf) {
a10bd924	126	warn("Publication distribution failure\n");
b97bf3fd PL	127	return;
	128	}
	129
	130	item = (struct distr_item *)msg_data(buf_msg(buf));
	131	publ_to_item(item, publ);
4323add6 PL	132	dbg("tipc_named_withdraw: broadcasting publish msg\n");
4323add6 PL	133	tipc_cltr_broadcast(buf);
b97bf3fd PL	134	}
	135
	136	/**
4323add6	137	* tipc_named_withdraw - tell other nodes about a withdrawn publication by this node
b97bf3fd PL	138	*/
b97bf3fd PL	139
4323add6	140	void tipc_named_withdraw(struct publication *publ)
b97bf3fd PL	141	{
	142	struct sk_buff *buf;
	143	struct distr_item *item;
	144
	145	list_del(&publ->local_list);
	146	publ_cnt--;
	147
	148	buf = named_prepare_buf(WITHDRAWAL, ITEM_SIZE, 0);
	149	if (!buf) {
a10bd924	150	warn("Withdrawl distribution failure\n");
b97bf3fd PL	151	return;
	152	}
	153
	154	item = (struct distr_item *)msg_data(buf_msg(buf));
	155	publ_to_item(item, publ);
4323add6 PL	156	dbg("tipc_named_withdraw: broadcasting withdraw msg\n");
4323add6 PL	157	tipc_cltr_broadcast(buf);
b97bf3fd PL	158	}
	159
	160	/**
4323add6	161	* tipc_named_node_up - tell specified node about all publications by this node
b97bf3fd PL	162	*/
b97bf3fd PL	163
4323add6	164	void tipc_named_node_up(unsigned long node)
b97bf3fd PL	165	{
b97bf3fd PL	166	struct publication *publ;
1fc54d8f SR	167	struct distr_item *item = NULL;
1fc54d8f SR	168	struct sk_buff *buf = NULL;
b97bf3fd PL	169	u32 left = 0;
	170	u32 rest;
	171	u32 max_item_buf;
	172
c4307285	173	read_lock_bh(&tipc_nametbl_lock);
b97bf3fd PL	174	max_item_buf = TIPC_MAX_USER_MSG_SIZE / ITEM_SIZE;
	175	max_item_buf *= ITEM_SIZE;
	176	rest = publ_cnt * ITEM_SIZE;
	177
	178	list_for_each_entry(publ, &publ_root, local_list) {
	179	if (!buf) {
	180	left = (rest <= max_item_buf) ? rest : max_item_buf;
	181	rest -= left;
c4307285	182	buf = named_prepare_buf(PUBLICATION, left, node);
a10bd924 AS	183	if (!buf) {
a10bd924 AS	184	warn("Bulk publication distribution failure\n");
b97bf3fd PL	185	goto exit;
	186	}
	187	item = (struct distr_item *)msg_data(buf_msg(buf));
	188	}
	189	publ_to_item(item, publ);
	190	item++;
	191	left -= ITEM_SIZE;
	192	if (!left) {
	193	msg_set_link_selector(buf_msg(buf), node);
4323add6	194	dbg("tipc_named_node_up: sending publish msg to "
c4307285	195	"<%u.%u.%u>\n", tipc_zone(node),
b97bf3fd	196	tipc_cluster(node), tipc_node(node));
4323add6	197	tipc_link_send(buf, node, node);
1fc54d8f	198	buf = NULL;
b97bf3fd PL	199	}
	200	}
	201	exit:
c4307285	202	read_unlock_bh(&tipc_nametbl_lock);
b97bf3fd PL	203	}
	204
	205	/**
	206	* node_is_down - remove publication associated with a failed node
c4307285 YH	207	*
c4307285 YH	208	* Invoked for each publication issued by a newly failed node.
b97bf3fd PL	209	* Removes publication structure from name table & deletes it.
	210	* In rare cases the link may have come back up again when this
	211	* function is called, and we have two items representing the same
	212	* publication. Nudge this item's key to distinguish it from the other.
	213	* (Note: Publication's node subscription is already unsubscribed.)
	214	*/
	215
	216	static void node_is_down(struct publication *publ)
	217	{
	218	struct publication *p;
f131072c	219
c4307285 YH	220	write_lock_bh(&tipc_nametbl_lock);
c4307285 YH	221	dbg("node_is_down: withdrawing %u, %u, %u\n",
b97bf3fd	222	publ->type, publ->lower, publ->upper);
c4307285 YH	223	publ->key += 1222345;
c4307285 YH	224	p = tipc_nametbl_remove_publ(publ->type, publ->lower,
4323add6	225	publ->node, publ->ref, publ->key);
4323add6	226	write_unlock_bh(&tipc_nametbl_lock);
f131072c	227
c4307285	228	if (p != publ) {
f131072c AS	229	err("Unable to remove publication from failed node\n"
	230	"(type=%u, lower=%u, node=0x%x, ref=%u, key=%u)\n",
	231	publ->type, publ->lower, publ->node, publ->ref, publ->key);
	232	}
	233
	234	if (p) {
	235	kfree(p);
	236	}
b97bf3fd PL	237	}
	238
	239	/**
4323add6	240	* tipc_named_recv - process name table update message sent by another node
b97bf3fd PL	241	*/
b97bf3fd PL	242
4323add6	243	void tipc_named_recv(struct sk_buff *buf)
b97bf3fd PL	244	{
	245	struct publication *publ;
	246	struct tipc_msg *msg = buf_msg(buf);
	247	struct distr_item item = (struct distr_item )msg_data(msg);
	248	u32 count = msg_data_sz(msg) / ITEM_SIZE;
	249
c4307285	250	write_lock_bh(&tipc_nametbl_lock);
b97bf3fd PL	251	while (count--) {
b97bf3fd PL	252	if (msg_type(msg) == PUBLICATION) {
c4307285	253	dbg("tipc_named_recv: got publication for %u, %u, %u\n",
b97bf3fd PL	254	ntohl(item->type), ntohl(item->lower),
b97bf3fd PL	255	ntohl(item->upper));
c4307285	256	publ = tipc_nametbl_insert_publ(ntohl(item->type),
4323add6 PL	257	ntohl(item->lower),
	258	ntohl(item->upper),
	259	TIPC_CLUSTER_SCOPE,
c4307285	260	msg_orignode(msg),
4323add6 PL	261	ntohl(item->ref),
4323add6 PL	262	ntohl(item->key));
b97bf3fd	263	if (publ) {
c4307285 YH	264	tipc_nodesub_subscribe(&publ->subscr,
c4307285 YH	265	msg_orignode(msg),
4323add6 PL	266	publ,
4323add6 PL	267	(net_ev_handler)node_is_down);
b97bf3fd PL	268	}
b97bf3fd PL	269	} else if (msg_type(msg) == WITHDRAWAL) {
c4307285	270	dbg("tipc_named_recv: got withdrawl for %u, %u, %u\n",
b97bf3fd PL	271	ntohl(item->type), ntohl(item->lower),
b97bf3fd PL	272	ntohl(item->upper));
4323add6 PL	273	publ = tipc_nametbl_remove_publ(ntohl(item->type),
	274	ntohl(item->lower),
	275	msg_orignode(msg),
	276	ntohl(item->ref),
	277	ntohl(item->key));
b97bf3fd PL	278
b97bf3fd PL	279	if (publ) {
4323add6	280	tipc_nodesub_unsubscribe(&publ->subscr);
c4307285	281	kfree(publ);
f131072c AS	282	} else {
	283	err("Unable to remove publication by node 0x%x\n"
	284	"(type=%u, lower=%u, ref=%u, key=%u)\n",
	285	msg_orignode(msg),
	286	ntohl(item->type), ntohl(item->lower),
	287	ntohl(item->ref), ntohl(item->key));
b97bf3fd PL	288	}
b97bf3fd PL	289	} else {
a10bd924	290	warn("Unrecognized name table message received\n");
b97bf3fd PL	291	}
	292	item++;
	293	}
c4307285	294	write_unlock_bh(&tipc_nametbl_lock);
b97bf3fd PL	295	buf_discard(buf);
	296	}
	297
	298	/**
4323add6	299	* tipc_named_reinit - re-initialize local publication list
c4307285	300	*
b97bf3fd PL	301	* This routine is called whenever TIPC networking is (re)enabled.
	302	* All existing publications by this node that have "cluster" or "zone" scope
	303	* are updated to reflect the node's current network address.
	304	* (If the node's address is unchanged, the update loop terminates immediately.)
	305	*/
	306
4323add6	307	void tipc_named_reinit(void)
b97bf3fd PL	308	{
	309	struct publication *publ;
	310
c4307285	311	write_lock_bh(&tipc_nametbl_lock);
b97bf3fd PL	312	list_for_each_entry(publ, &publ_root, local_list) {
	313	if (publ->node == tipc_own_addr)
	314	break;
	315	publ->node = tipc_own_addr;
	316	}
c4307285	317	write_unlock_bh(&tipc_nametbl_lock);
b97bf3fd	318	}