subscr.c 11.3 KB
Newer Older
P
Per Liden 已提交
1
/*
2
 * net/tipc/subscr.c: TIPC network topology service
3
 *
P
Per Liden 已提交
4
 * Copyright (c) 2000-2006, Ericsson AB
5
 * Copyright (c) 2005-2007, 2010-2013, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 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.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * 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
P
Per Liden 已提交
34 35 36 37 38
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "core.h"
#include "name_table.h"
39
#include "subscr.h"
P
Per Liden 已提交
40 41

/**
42
 * struct tipc_subscriber - TIPC network topology subscriber
43
 * @conid: connection identifier to server connecting to subscriber
S
stephen hemminger 已提交
44
 * @lock: control access to subscriber
P
Per Liden 已提交
45 46
 * @subscription_list: list of subscription objects for this subscriber
 */
47
struct tipc_subscriber {
48 49
	int conid;
	spinlock_t lock;
P
Per Liden 已提交
50 51 52
	struct list_head subscription_list;
};

53 54 55 56 57 58 59 60 61 62 63 64
/**
 * htohl - convert value to endianness used by destination
 * @in: value to convert
 * @swap: non-zero if endianness must be reversed
 *
 * Returns converted value
 */
static u32 htohl(u32 in, int swap)
{
	return swap ? swab32(in) : in;
}

65 66
static void subscr_send_event(struct tipc_subscription *sub, u32 found_lower,
			      u32 found_upper, u32 event, u32 port_ref,
P
Per Liden 已提交
67 68
			      u32 node)
{
69
	struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
70 71
	struct tipc_subscriber *subscriber = sub->subscriber;
	struct kvec msg_sect;
P
Per Liden 已提交
72 73 74

	msg_sect.iov_base = (void *)&sub->evt;
	msg_sect.iov_len = sizeof(struct tipc_event);
75 76 77 78 79
	sub->evt.event = htohl(event, sub->swap);
	sub->evt.found_lower = htohl(found_lower, sub->swap);
	sub->evt.found_upper = htohl(found_upper, sub->swap);
	sub->evt.port.ref = htohl(port_ref, sub->swap);
	sub->evt.port.node = htohl(node, sub->swap);
80 81
	tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
			  msg_sect.iov_base, msg_sect.iov_len);
P
Per Liden 已提交
82 83 84
}

/**
85
 * tipc_subscr_overlap - test for subscription overlap with the given values
P
Per Liden 已提交
86 87 88
 *
 * Returns 1 if there is overlap, otherwise 0.
 */
89
int tipc_subscr_overlap(struct tipc_subscription *sub, u32 found_lower,
90
			u32 found_upper)
P
Per Liden 已提交
91 92 93 94 95 96 97 98 99 100 101
{
	if (found_lower < sub->seq.lower)
		found_lower = sub->seq.lower;
	if (found_upper > sub->seq.upper)
		found_upper = sub->seq.upper;
	if (found_lower > found_upper)
		return 0;
	return 1;
}

/**
102
 * tipc_subscr_report_overlap - issue event if there is subscription overlap
103
 *
P
Per Liden 已提交
104 105
 * Protected by nameseq.lock in name_table.c
 */
106 107 108
void tipc_subscr_report_overlap(struct tipc_subscription *sub, u32 found_lower,
				u32 found_upper, u32 event, u32 port_ref,
				u32 node, int must)
P
Per Liden 已提交
109
{
110
	if (!tipc_subscr_overlap(sub, found_lower, found_upper))
P
Per Liden 已提交
111
		return;
112
	if (!must && !(sub->filter & TIPC_SUB_PORTS))
P
Per Liden 已提交
113
		return;
114

115
	subscr_send_event(sub, found_lower, found_upper, event, port_ref, node);
P
Per Liden 已提交
116 117
}

118
static void subscr_timeout(unsigned long data)
P
Per Liden 已提交
119
{
120
	struct tipc_subscription *sub = (struct tipc_subscription *)data;
121
	struct tipc_subscriber *subscriber = sub->subscriber;
122
	struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
P
Per Liden 已提交
123

124 125 126
	/* The spin lock per subscriber is used to protect its members */
	spin_lock_bh(&subscriber->lock);

127 128
	/* Validate timeout (in case subscription is being cancelled) */
	if (sub->timeout == TIPC_WAIT_FOREVER) {
129
		spin_unlock_bh(&subscriber->lock);
130 131 132
		return;
	}

P
Per Liden 已提交
133
	/* Unlink subscription from name table */
134
	tipc_nametbl_unsubscribe(sub);
P
Per Liden 已提交
135

136
	/* Unlink subscription from subscriber */
P
Per Liden 已提交
137 138
	list_del(&sub->subscription_list);

139
	spin_unlock_bh(&subscriber->lock);
140 141 142 143 144

	/* Notify subscriber of timeout */
	subscr_send_event(sub, sub->evt.s.seq.lower, sub->evt.s.seq.upper,
			  TIPC_SUBSCR_TIMEOUT, 0, 0);

P
Per Liden 已提交
145 146
	/* Now destroy subscription */
	kfree(sub);
147
	atomic_dec(&tn->subscription_count);
P
Per Liden 已提交
148 149
}

150 151 152
/**
 * subscr_del - delete a subscription within a subscription list
 *
153
 * Called with subscriber lock held.
154
 */
155
static void subscr_del(struct tipc_subscription *sub)
156
{
157 158
	struct tipc_net *tn = net_generic(sub->net, tipc_net_id);

159 160 161
	tipc_nametbl_unsubscribe(sub);
	list_del(&sub->subscription_list);
	kfree(sub);
162
	atomic_dec(&tn->subscription_count);
163 164
}

165 166
static void subscr_release(struct tipc_subscriber *subscriber)
{
167 168
	struct tipc_subscription *sub;
	struct tipc_subscription *sub_temp;
P
Per Liden 已提交
169

170
	spin_lock_bh(&subscriber->lock);
P
Per Liden 已提交
171 172 173 174 175

	/* Destroy any existing subscriptions for subscriber */
	list_for_each_entry_safe(sub, sub_temp, &subscriber->subscription_list,
				 subscription_list) {
		if (sub->timeout != TIPC_WAIT_FOREVER) {
176
			spin_unlock_bh(&subscriber->lock);
177
			del_timer_sync(&sub->timer);
178
			spin_lock_bh(&subscriber->lock);
P
Per Liden 已提交
179
		}
180
		subscr_del(sub);
P
Per Liden 已提交
181
	}
182
	spin_unlock_bh(&subscriber->lock);
183 184

	/* Now destroy subscriber */
P
Per Liden 已提交
185 186 187
	kfree(subscriber);
}

188 189 190
/**
 * subscr_cancel - handle subscription cancellation request
 *
191
 * Called with subscriber lock held. Routine must temporarily release lock
192 193 194 195 196 197
 * to enable the subscription timeout routine to finish without deadlocking;
 * the lock is then reclaimed to allow caller to release it upon return.
 *
 * Note that fields of 's' use subscriber's endianness!
 */
static void subscr_cancel(struct tipc_subscr *s,
198
			  struct tipc_subscriber *subscriber)
199
{
200 201
	struct tipc_subscription *sub;
	struct tipc_subscription *sub_temp;
202 203 204 205 206
	int found = 0;

	/* Find first matching subscription, exit if not found */
	list_for_each_entry_safe(sub, sub_temp, &subscriber->subscription_list,
				 subscription_list) {
207 208 209 210
		if (!memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr))) {
			found = 1;
			break;
		}
211 212 213 214 215 216 217
	}
	if (!found)
		return;

	/* Cancel subscription timer (if used), then delete subscription */
	if (sub->timeout != TIPC_WAIT_FOREVER) {
		sub->timeout = TIPC_WAIT_FOREVER;
218
		spin_unlock_bh(&subscriber->lock);
219
		del_timer_sync(&sub->timer);
220
		spin_lock_bh(&subscriber->lock);
221 222 223 224
	}
	subscr_del(sub);
}

P
Per Liden 已提交
225 226
/**
 * subscr_subscribe - create subscription for subscriber
227
 *
228
 * Called with subscriber lock held.
P
Per Liden 已提交
229
 */
230
static int subscr_subscribe(struct net *net, struct tipc_subscr *s,
231
			    struct tipc_subscriber *subscriber,
232 233 234
			    struct tipc_subscription **sub_p)
{
	struct tipc_net *tn = net_generic(net, tipc_net_id);
235
	struct tipc_subscription *sub;
236 237 238 239
	int swap;

	/* Determine subscriber's endianness */
	swap = !(s->filter & (TIPC_SUB_PORTS | TIPC_SUB_SERVICE));
240 241

	/* Detect & process a subscription cancellation request */
242 243
	if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
		s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
244
		subscr_cancel(s, subscriber);
245
		return 0;
246 247
	}

P
Per Liden 已提交
248
	/* Refuse subscription if global limit exceeded */
249
	if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
250
		pr_warn("Subscription rejected, limit reached (%u)\n",
251
			TIPC_MAX_SUBSCRIPTIONS);
252
		return -EINVAL;
P
Per Liden 已提交
253 254 255
	}

	/* Allocate subscription object */
256
	sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
257
	if (!sub) {
258
		pr_warn("Subscription rejected, no memory\n");
259
		return -ENOMEM;
P
Per Liden 已提交
260 261 262
	}

	/* Initialize subscription object */
263
	sub->net = net;
264 265 266
	sub->seq.type = htohl(s->seq.type, swap);
	sub->seq.lower = htohl(s->seq.lower, swap);
	sub->seq.upper = htohl(s->seq.upper, swap);
267
	sub->timeout = msecs_to_jiffies(htohl(s->timeout, swap));
268
	sub->filter = htohl(s->filter, swap);
269 270
	if ((!(sub->filter & TIPC_SUB_PORTS) ==
	     !(sub->filter & TIPC_SUB_SERVICE)) ||
271
	    (sub->seq.lower > sub->seq.upper)) {
272
		pr_warn("Subscription rejected, illegal request\n");
P
Per Liden 已提交
273
		kfree(sub);
274
		return -EINVAL;
P
Per Liden 已提交
275 276
	}
	list_add(&sub->subscription_list, &subscriber->subscription_list);
277
	sub->subscriber = subscriber;
278
	sub->swap = swap;
279
	memcpy(&sub->evt.s, s, sizeof(struct tipc_subscr));
280
	atomic_inc(&tn->subscription_count);
P
Per Liden 已提交
281
	if (sub->timeout != TIPC_WAIT_FOREVER) {
282 283
		setup_timer(&sub->timer, subscr_timeout, (unsigned long)sub);
		mod_timer(&sub->timer, jiffies + sub->timeout);
P
Per Liden 已提交
284
	}
285 286
	*sub_p = sub;
	return 0;
P
Per Liden 已提交
287 288
}

289 290
/* Handle one termination request for the subscriber */
static void subscr_conn_shutdown_event(int conid, void *usr_data)
P
Per Liden 已提交
291
{
292
	subscr_release((struct tipc_subscriber *)usr_data);
P
Per Liden 已提交
293 294
}

295
/* Handle one request to create a new subscription for the subscriber */
296 297 298
static void subscr_conn_msg_event(struct net *net, int conid,
				  struct sockaddr_tipc *addr, void *usr_data,
				  void *buf, size_t len)
P
Per Liden 已提交
299
{
300
	struct tipc_subscriber *subscriber = usr_data;
301
	struct tipc_subscription *sub = NULL;
302
	struct tipc_net *tn = net_generic(net, tipc_net_id);
303

304
	spin_lock_bh(&subscriber->lock);
305
	subscr_subscribe(net, (struct tipc_subscr *)buf, subscriber, &sub);
306 307
	if (sub)
		tipc_nametbl_subscribe(sub);
308 309
	else
		tipc_conn_terminate(tn->topsrv, subscriber->conid);
310
	spin_unlock_bh(&subscriber->lock);
P
Per Liden 已提交
311 312
}

313 314
/* Handle one request to establish a new subscriber */
static void *subscr_named_msg_event(int conid)
P
Per Liden 已提交
315
{
316
	struct tipc_subscriber *subscriber;
P
Per Liden 已提交
317 318

	/* Create subscriber object */
319
	subscriber = kzalloc(sizeof(struct tipc_subscriber), GFP_ATOMIC);
P
Per Liden 已提交
320
	if (subscriber == NULL) {
321
		pr_warn("Subscriber rejected, no memory\n");
322
		return NULL;
P
Per Liden 已提交
323 324
	}
	INIT_LIST_HEAD(&subscriber->subscription_list);
325 326
	subscriber->conid = conid;
	spin_lock_init(&subscriber->lock);
327

328
	return (void *)subscriber;
P
Per Liden 已提交
329 330
}

331
int tipc_subscr_start(struct net *net)
P
Per Liden 已提交
332
{
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366
	struct tipc_net *tn = net_generic(net, tipc_net_id);
	const char name[] = "topology_server";
	struct tipc_server *topsrv;
	struct sockaddr_tipc *saddr;

	saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
	if (!saddr)
		return -ENOMEM;
	saddr->family			= AF_TIPC;
	saddr->addrtype			= TIPC_ADDR_NAMESEQ;
	saddr->addr.nameseq.type	= TIPC_TOP_SRV;
	saddr->addr.nameseq.lower	= TIPC_TOP_SRV;
	saddr->addr.nameseq.upper	= TIPC_TOP_SRV;
	saddr->scope			= TIPC_NODE_SCOPE;

	topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
	if (!topsrv) {
		kfree(saddr);
		return -ENOMEM;
	}
	topsrv->net			= net;
	topsrv->saddr			= saddr;
	topsrv->imp			= TIPC_CRITICAL_IMPORTANCE;
	topsrv->type			= SOCK_SEQPACKET;
	topsrv->max_rcvbuf_size		= sizeof(struct tipc_subscr);
	topsrv->tipc_conn_recvmsg	= subscr_conn_msg_event;
	topsrv->tipc_conn_new		= subscr_named_msg_event;
	topsrv->tipc_conn_shutdown	= subscr_conn_shutdown_event;

	strncpy(topsrv->name, name, strlen(name) + 1);
	tn->topsrv = topsrv;
	atomic_set(&tn->subscription_count, 0);

	return tipc_server_start(topsrv);
P
Per Liden 已提交
367 368
}

369
void tipc_subscr_stop(struct net *net)
P
Per Liden 已提交
370
{
371 372 373 374 375 376
	struct tipc_net *tn = net_generic(net, tipc_net_id);
	struct tipc_server *topsrv = tn->topsrv;

	tipc_server_stop(topsrv);
	kfree(topsrv->saddr);
	kfree(topsrv);
P
Per Liden 已提交
377
}