subscr.c 10.6 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
 * @kref: reference counter to tipc_subscription object
44
 * @conid: connection identifier to server connecting to subscriber
S
stephen hemminger 已提交
45
 * @lock: control access to subscriber
46
 * @subscrp_list: list of subscription objects for this subscriber
P
Per Liden 已提交
47
 */
48
struct tipc_subscriber {
49
	struct kref kref;
50 51
	int conid;
	spinlock_t lock;
52
	struct list_head subscrp_list;
P
Per Liden 已提交
53 54
};

55 56 57
static void tipc_subscrp_delete(struct tipc_subscription *sub);
static void tipc_subscrb_put(struct tipc_subscriber *subscriber);

58 59 60 61 62 63 64 65 66 67 68 69
/**
 * 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;
}

70 71 72
static void tipc_subscrp_send_event(struct tipc_subscription *sub,
				    u32 found_lower, u32 found_upper,
				    u32 event, u32 port_ref, u32 node)
P
Per Liden 已提交
73
{
74
	struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
75 76
	struct tipc_subscriber *subscriber = sub->subscriber;
	struct kvec msg_sect;
P
Per Liden 已提交
77 78 79

	msg_sect.iov_base = (void *)&sub->evt;
	msg_sect.iov_len = sizeof(struct tipc_event);
80 81 82 83 84
	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);
85 86
	tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
			  msg_sect.iov_base, msg_sect.iov_len);
P
Per Liden 已提交
87 88 89
}

/**
90 91
 * tipc_subscrp_check_overlap - test for subscription overlap with the
 * given values
P
Per Liden 已提交
92 93 94
 *
 * Returns 1 if there is overlap, otherwise 0.
 */
95 96
int tipc_subscrp_check_overlap(struct tipc_subscription *sub, u32 found_lower,
			       u32 found_upper)
P
Per Liden 已提交
97 98 99 100 101 102 103 104 105 106
{
	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;
}

107 108 109
void tipc_subscrp_report_overlap(struct tipc_subscription *sub, u32 found_lower,
				 u32 found_upper, u32 event, u32 port_ref,
				 u32 node, int must)
P
Per Liden 已提交
110
{
111
	if (!tipc_subscrp_check_overlap(sub, found_lower, found_upper))
P
Per Liden 已提交
112
		return;
113
	if (!must && !(sub->filter & TIPC_SUB_PORTS))
P
Per Liden 已提交
114
		return;
115

116 117
	tipc_subscrp_send_event(sub, found_lower, found_upper, event, port_ref,
				node);
P
Per Liden 已提交
118 119
}

120
static void tipc_subscrp_timeout(unsigned long data)
P
Per Liden 已提交
121
{
122
	struct tipc_subscription *sub = (struct tipc_subscription *)data;
123
	struct tipc_subscriber *subscriber = sub->subscriber;
124 125

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

129 130 131 132 133
	spin_lock_bh(&subscriber->lock);
	tipc_subscrp_delete(sub);
	spin_unlock_bh(&subscriber->lock);

	tipc_subscrb_put(subscriber);
P
Per Liden 已提交
134 135
}

136
static void tipc_subscrb_kref_release(struct kref *kref)
137
{
138 139
	struct tipc_subscriber *subcriber = container_of(kref,
					    struct tipc_subscriber, kref);
140

141 142 143 144 145 146 147 148 149 150 151
	kfree(subcriber);
}

static void tipc_subscrb_put(struct tipc_subscriber *subscriber)
{
	kref_put(&subscriber->kref, tipc_subscrb_kref_release);
}

static void tipc_subscrb_get(struct tipc_subscriber *subscriber)
{
	kref_get(&subscriber->kref);
152 153
}

154 155 156 157 158 159 160 161 162
static struct tipc_subscriber *tipc_subscrb_create(int conid)
{
	struct tipc_subscriber *subscriber;

	subscriber = kzalloc(sizeof(*subscriber), GFP_ATOMIC);
	if (!subscriber) {
		pr_warn("Subscriber rejected, no memory\n");
		return NULL;
	}
163
	kref_init(&subscriber->kref);
164 165 166 167 168 169 170
	INIT_LIST_HEAD(&subscriber->subscrp_list);
	subscriber->conid = conid;
	spin_lock_init(&subscriber->lock);

	return subscriber;
}

171
static void tipc_subscrb_delete(struct tipc_subscriber *subscriber)
172
{
173
	struct tipc_subscription *sub, *temp;
P
Per Liden 已提交
174

175
	spin_lock_bh(&subscriber->lock);
P
Per Liden 已提交
176
	/* Destroy any existing subscriptions for subscriber */
177
	list_for_each_entry_safe(sub, temp, &subscriber->subscrp_list,
178
				 subscrp_list) {
179 180 181
		if (del_timer(&sub->timer)) {
			tipc_subscrp_delete(sub);
			tipc_subscrb_put(subscriber);
P
Per Liden 已提交
182 183
		}
	}
184
	spin_unlock_bh(&subscriber->lock);
185

186 187 188 189 190 191 192 193 194 195 196
	tipc_subscrb_put(subscriber);
}

static void tipc_subscrp_delete(struct tipc_subscription *sub)
{
	struct tipc_net *tn = net_generic(sub->net, tipc_net_id);

	tipc_nametbl_unsubscribe(sub);
	list_del(&sub->subscrp_list);
	kfree(sub);
	atomic_dec(&tn->subscription_count);
P
Per Liden 已提交
197 198
}

199 200
static void tipc_subscrp_cancel(struct tipc_subscr *s,
				struct tipc_subscriber *subscriber)
201
{
202
	struct tipc_subscription *sub, *temp;
203

204
	spin_lock_bh(&subscriber->lock);
205
	/* Find first matching subscription, exit if not found */
206
	list_for_each_entry_safe(sub, temp, &subscriber->subscrp_list,
207
				 subscrp_list) {
208
		if (!memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr))) {
209 210 211 212
			if (del_timer(&sub->timer)) {
				tipc_subscrp_delete(sub);
				tipc_subscrb_put(subscriber);
			}
213 214
			break;
		}
215
	}
216
	spin_unlock_bh(&subscriber->lock);
217 218
}

219 220 221
static int tipc_subscrp_create(struct net *net, struct tipc_subscr *s,
			       struct tipc_subscriber *subscriber,
			       struct tipc_subscription **sub_p)
222 223
{
	struct tipc_net *tn = net_generic(net, tipc_net_id);
224
	struct tipc_subscription *sub;
225 226 227 228
	int swap;

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

	/* Detect & process a subscription cancellation request */
231 232
	if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
		s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
233
		tipc_subscrp_cancel(s, subscriber);
234
		return 0;
235 236
	}

P
Per Liden 已提交
237
	/* Refuse subscription if global limit exceeded */
238
	if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
239
		pr_warn("Subscription rejected, limit reached (%u)\n",
240
			TIPC_MAX_SUBSCRIPTIONS);
241
		return -EINVAL;
P
Per Liden 已提交
242 243 244
	}

	/* Allocate subscription object */
245
	sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
246
	if (!sub) {
247
		pr_warn("Subscription rejected, no memory\n");
248
		return -ENOMEM;
P
Per Liden 已提交
249 250 251
	}

	/* Initialize subscription object */
252
	sub->net = net;
253 254 255
	sub->seq.type = htohl(s->seq.type, swap);
	sub->seq.lower = htohl(s->seq.lower, swap);
	sub->seq.upper = htohl(s->seq.upper, swap);
256
	sub->timeout = msecs_to_jiffies(htohl(s->timeout, swap));
257
	sub->filter = htohl(s->filter, swap);
258 259
	if ((!(sub->filter & TIPC_SUB_PORTS) ==
	     !(sub->filter & TIPC_SUB_SERVICE)) ||
260
	    (sub->seq.lower > sub->seq.upper)) {
261
		pr_warn("Subscription rejected, illegal request\n");
P
Per Liden 已提交
262
		kfree(sub);
263
		return -EINVAL;
P
Per Liden 已提交
264
	}
265
	spin_lock_bh(&subscriber->lock);
266
	list_add(&sub->subscrp_list, &subscriber->subscrp_list);
267
	spin_unlock_bh(&subscriber->lock);
268
	sub->subscriber = subscriber;
269
	sub->swap = swap;
270
	memcpy(&sub->evt.s, s, sizeof(*s));
271
	atomic_inc(&tn->subscription_count);
272 273 274 275 276
	setup_timer(&sub->timer, tipc_subscrp_timeout, (unsigned long)sub);
	if (sub->timeout != TIPC_WAIT_FOREVER)
		sub->timeout += jiffies;
	if (!mod_timer(&sub->timer, sub->timeout))
		tipc_subscrb_get(subscriber);
277 278
	*sub_p = sub;
	return 0;
P
Per Liden 已提交
279 280
}

281
/* Handle one termination request for the subscriber */
282
static void tipc_subscrb_shutdown_cb(int conid, void *usr_data)
P
Per Liden 已提交
283
{
284
	tipc_subscrb_delete((struct tipc_subscriber *)usr_data);
P
Per Liden 已提交
285 286
}

287
/* Handle one request to create a new subscription for the subscriber */
288 289 290
static void tipc_subscrb_rcv_cb(struct net *net, int conid,
				struct sockaddr_tipc *addr, void *usr_data,
				void *buf, size_t len)
P
Per Liden 已提交
291
{
292
	struct tipc_subscriber *subscrb = usr_data;
293
	struct tipc_subscription *sub = NULL;
294
	struct tipc_net *tn = net_generic(net, tipc_net_id);
295

296 297 298 299
	if (tipc_subscrp_create(net, (struct tipc_subscr *)buf, subscrb, &sub))
		return tipc_conn_terminate(tn->topsrv, subscrb->conid);

	tipc_nametbl_subscribe(sub);
P
Per Liden 已提交
300 301
}

302
/* Handle one request to establish a new subscriber */
303
static void *tipc_subscrb_connect_cb(int conid)
P
Per Liden 已提交
304
{
305
	return (void *)tipc_subscrb_create(conid);
P
Per Liden 已提交
306 307
}

308
int tipc_topsrv_start(struct net *net)
P
Per Liden 已提交
309
{
310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334
	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);
335 336 337
	topsrv->tipc_conn_recvmsg	= tipc_subscrb_rcv_cb;
	topsrv->tipc_conn_new		= tipc_subscrb_connect_cb;
	topsrv->tipc_conn_shutdown	= tipc_subscrb_shutdown_cb;
338 339 340 341 342 343

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

	return tipc_server_start(topsrv);
P
Per Liden 已提交
344 345
}

346
void tipc_topsrv_stop(struct net *net)
P
Per Liden 已提交
347
{
348 349 350 351 352 353
	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 已提交
354
}