Loading...
1/*
2 * net/tipc/subscr.c: TIPC network topology service
3 *
4 * Copyright (c) 2000-2017, Ericsson AB
5 * Copyright (c) 2005-2007, 2010-2013, Wind River Systems
6 * Copyright (c) 2020-2021, Red Hat Inc
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or promote products derived from
19 * this software without specific prior written permission.
20 *
21 * Alternatively, this software may be distributed under the terms of the
22 * GNU General Public License ("GPL") version 2 as published by the Free
23 * Software Foundation.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
36 */
37
38#include "core.h"
39#include "name_table.h"
40#include "subscr.h"
41
42static void tipc_sub_send_event(struct tipc_subscription *sub,
43 struct publication *p,
44 u32 event)
45{
46 struct tipc_subscr *s = &sub->evt.s;
47 struct tipc_event *evt = &sub->evt;
48
49 if (sub->inactive)
50 return;
51 tipc_evt_write(evt, event, event);
52 if (p) {
53 tipc_evt_write(evt, found_lower, p->sr.lower);
54 tipc_evt_write(evt, found_upper, p->sr.upper);
55 tipc_evt_write(evt, port.ref, p->sk.ref);
56 tipc_evt_write(evt, port.node, p->sk.node);
57 } else {
58 tipc_evt_write(evt, found_lower, s->seq.lower);
59 tipc_evt_write(evt, found_upper, s->seq.upper);
60 tipc_evt_write(evt, port.ref, 0);
61 tipc_evt_write(evt, port.node, 0);
62 }
63 tipc_topsrv_queue_evt(sub->net, sub->conid, event, evt);
64}
65
66/**
67 * tipc_sub_check_overlap - test for subscription overlap with the given values
68 * @subscribed: the service range subscribed for
69 * @found: the service range we are checking for match
70 *
71 * Returns true if there is overlap, otherwise false.
72 */
73static bool tipc_sub_check_overlap(struct tipc_service_range *subscribed,
74 struct tipc_service_range *found)
75{
76 u32 found_lower = found->lower;
77 u32 found_upper = found->upper;
78
79 if (found_lower < subscribed->lower)
80 found_lower = subscribed->lower;
81 if (found_upper > subscribed->upper)
82 found_upper = subscribed->upper;
83 return found_lower <= found_upper;
84}
85
86void tipc_sub_report_overlap(struct tipc_subscription *sub,
87 struct publication *p,
88 u32 event, bool must)
89{
90 struct tipc_service_range *sr = &sub->s.seq;
91 u32 filter = sub->s.filter;
92
93 if (!tipc_sub_check_overlap(sr, &p->sr))
94 return;
95 if (!must && !(filter & TIPC_SUB_PORTS))
96 return;
97 if (filter & TIPC_SUB_CLUSTER_SCOPE && p->scope == TIPC_NODE_SCOPE)
98 return;
99 if (filter & TIPC_SUB_NODE_SCOPE && p->scope != TIPC_NODE_SCOPE)
100 return;
101 spin_lock(&sub->lock);
102 tipc_sub_send_event(sub, p, event);
103 spin_unlock(&sub->lock);
104}
105
106static void tipc_sub_timeout(struct timer_list *t)
107{
108 struct tipc_subscription *sub = from_timer(sub, t, timer);
109
110 spin_lock(&sub->lock);
111 tipc_sub_send_event(sub, NULL, TIPC_SUBSCR_TIMEOUT);
112 sub->inactive = true;
113 spin_unlock(&sub->lock);
114}
115
116static void tipc_sub_kref_release(struct kref *kref)
117{
118 kfree(container_of(kref, struct tipc_subscription, kref));
119}
120
121void tipc_sub_put(struct tipc_subscription *subscription)
122{
123 kref_put(&subscription->kref, tipc_sub_kref_release);
124}
125
126void tipc_sub_get(struct tipc_subscription *subscription)
127{
128 kref_get(&subscription->kref);
129}
130
131struct tipc_subscription *tipc_sub_subscribe(struct net *net,
132 struct tipc_subscr *s,
133 int conid)
134{
135 u32 lower = tipc_sub_read(s, seq.lower);
136 u32 upper = tipc_sub_read(s, seq.upper);
137 u32 filter = tipc_sub_read(s, filter);
138 struct tipc_subscription *sub;
139 u32 timeout;
140
141 if ((filter & TIPC_SUB_PORTS && filter & TIPC_SUB_SERVICE) ||
142 lower > upper) {
143 pr_warn("Subscription rejected, illegal request\n");
144 return NULL;
145 }
146 sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
147 if (!sub) {
148 pr_warn("Subscription rejected, no memory\n");
149 return NULL;
150 }
151 INIT_LIST_HEAD(&sub->service_list);
152 INIT_LIST_HEAD(&sub->sub_list);
153 sub->net = net;
154 sub->conid = conid;
155 sub->inactive = false;
156 memcpy(&sub->evt.s, s, sizeof(*s));
157 sub->s.seq.type = tipc_sub_read(s, seq.type);
158 sub->s.seq.lower = lower;
159 sub->s.seq.upper = upper;
160 sub->s.filter = filter;
161 sub->s.timeout = tipc_sub_read(s, timeout);
162 memcpy(sub->s.usr_handle, s->usr_handle, 8);
163 spin_lock_init(&sub->lock);
164 kref_init(&sub->kref);
165 if (!tipc_nametbl_subscribe(sub)) {
166 kfree(sub);
167 return NULL;
168 }
169 timer_setup(&sub->timer, tipc_sub_timeout, 0);
170 timeout = tipc_sub_read(&sub->evt.s, timeout);
171 if (timeout != TIPC_WAIT_FOREVER)
172 mod_timer(&sub->timer, jiffies + msecs_to_jiffies(timeout));
173 return sub;
174}
175
176void tipc_sub_unsubscribe(struct tipc_subscription *sub)
177{
178 tipc_nametbl_unsubscribe(sub);
179 if (sub->evt.s.timeout != TIPC_WAIT_FOREVER)
180 del_timer_sync(&sub->timer);
181 list_del(&sub->sub_list);
182 tipc_sub_put(sub);
183}
1/*
2 * net/tipc/subscr.c: TIPC network topology service
3 *
4 * Copyright (c) 2000-2006, Ericsson AB
5 * Copyright (c) 2005-2007, 2010-2013, 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#include "core.h"
38#include "name_table.h"
39#include "subscr.h"
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
45 * @lock: control access to subscriber
46 * @subscrp_list: list of subscription objects for this subscriber
47 */
48struct tipc_subscriber {
49 struct kref kref;
50 int conid;
51 spinlock_t lock;
52 struct list_head subscrp_list;
53};
54
55static void tipc_subscrp_delete(struct tipc_subscription *sub);
56static void tipc_subscrb_put(struct tipc_subscriber *subscriber);
57static void tipc_subscrp_put(struct tipc_subscription *subscription);
58static void tipc_subscrp_get(struct tipc_subscription *subscription);
59
60/**
61 * htohl - convert value to endianness used by destination
62 * @in: value to convert
63 * @swap: non-zero if endianness must be reversed
64 *
65 * Returns converted value
66 */
67static u32 htohl(u32 in, int swap)
68{
69 return swap ? swab32(in) : in;
70}
71
72static void tipc_subscrp_send_event(struct tipc_subscription *sub,
73 u32 found_lower, u32 found_upper,
74 u32 event, u32 port_ref, u32 node)
75{
76 struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
77 struct tipc_subscriber *subscriber = sub->subscriber;
78 struct kvec msg_sect;
79
80 msg_sect.iov_base = (void *)&sub->evt;
81 msg_sect.iov_len = sizeof(struct tipc_event);
82 sub->evt.event = htohl(event, sub->swap);
83 sub->evt.found_lower = htohl(found_lower, sub->swap);
84 sub->evt.found_upper = htohl(found_upper, sub->swap);
85 sub->evt.port.ref = htohl(port_ref, sub->swap);
86 sub->evt.port.node = htohl(node, sub->swap);
87 tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
88 msg_sect.iov_base, msg_sect.iov_len);
89}
90
91/**
92 * tipc_subscrp_check_overlap - test for subscription overlap with the
93 * given values
94 *
95 * Returns 1 if there is overlap, otherwise 0.
96 */
97int tipc_subscrp_check_overlap(struct tipc_name_seq *seq, u32 found_lower,
98 u32 found_upper)
99{
100 if (found_lower < seq->lower)
101 found_lower = seq->lower;
102 if (found_upper > seq->upper)
103 found_upper = seq->upper;
104 if (found_lower > found_upper)
105 return 0;
106 return 1;
107}
108
109u32 tipc_subscrp_convert_seq_type(u32 type, int swap)
110{
111 return htohl(type, swap);
112}
113
114void tipc_subscrp_convert_seq(struct tipc_name_seq *in, int swap,
115 struct tipc_name_seq *out)
116{
117 out->type = htohl(in->type, swap);
118 out->lower = htohl(in->lower, swap);
119 out->upper = htohl(in->upper, swap);
120}
121
122void tipc_subscrp_report_overlap(struct tipc_subscription *sub, u32 found_lower,
123 u32 found_upper, u32 event, u32 port_ref,
124 u32 node, int must)
125{
126 struct tipc_name_seq seq;
127
128 tipc_subscrp_get(sub);
129 tipc_subscrp_convert_seq(&sub->evt.s.seq, sub->swap, &seq);
130 if (!tipc_subscrp_check_overlap(&seq, found_lower, found_upper))
131 return;
132 if (!must &&
133 !(htohl(sub->evt.s.filter, sub->swap) & TIPC_SUB_PORTS))
134 return;
135
136 tipc_subscrp_send_event(sub, found_lower, found_upper, event, port_ref,
137 node);
138 tipc_subscrp_put(sub);
139}
140
141static void tipc_subscrp_timeout(unsigned long data)
142{
143 struct tipc_subscription *sub = (struct tipc_subscription *)data;
144
145 /* Notify subscriber of timeout */
146 tipc_subscrp_send_event(sub, sub->evt.s.seq.lower, sub->evt.s.seq.upper,
147 TIPC_SUBSCR_TIMEOUT, 0, 0);
148
149 tipc_subscrp_put(sub);
150}
151
152static void tipc_subscrb_kref_release(struct kref *kref)
153{
154 kfree(container_of(kref,struct tipc_subscriber, kref));
155}
156
157static void tipc_subscrb_put(struct tipc_subscriber *subscriber)
158{
159 kref_put(&subscriber->kref, tipc_subscrb_kref_release);
160}
161
162static void tipc_subscrb_get(struct tipc_subscriber *subscriber)
163{
164 kref_get(&subscriber->kref);
165}
166
167static void tipc_subscrp_kref_release(struct kref *kref)
168{
169 struct tipc_subscription *sub = container_of(kref,
170 struct tipc_subscription,
171 kref);
172 struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
173 struct tipc_subscriber *subscriber = sub->subscriber;
174
175 spin_lock_bh(&subscriber->lock);
176 tipc_nametbl_unsubscribe(sub);
177 list_del(&sub->subscrp_list);
178 atomic_dec(&tn->subscription_count);
179 spin_unlock_bh(&subscriber->lock);
180 kfree(sub);
181 tipc_subscrb_put(subscriber);
182}
183
184static void tipc_subscrp_put(struct tipc_subscription *subscription)
185{
186 kref_put(&subscription->kref, tipc_subscrp_kref_release);
187}
188
189static void tipc_subscrp_get(struct tipc_subscription *subscription)
190{
191 kref_get(&subscription->kref);
192}
193
194/* tipc_subscrb_subscrp_delete - delete a specific subscription or all
195 * subscriptions for a given subscriber.
196 */
197static void tipc_subscrb_subscrp_delete(struct tipc_subscriber *subscriber,
198 struct tipc_subscr *s)
199{
200 struct list_head *subscription_list = &subscriber->subscrp_list;
201 struct tipc_subscription *sub, *temp;
202
203 spin_lock_bh(&subscriber->lock);
204 list_for_each_entry_safe(sub, temp, subscription_list, subscrp_list) {
205 if (s && memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr)))
206 continue;
207
208 tipc_subscrp_get(sub);
209 spin_unlock_bh(&subscriber->lock);
210 tipc_subscrp_delete(sub);
211 tipc_subscrp_put(sub);
212 spin_lock_bh(&subscriber->lock);
213
214 if (s)
215 break;
216 }
217 spin_unlock_bh(&subscriber->lock);
218}
219
220static struct tipc_subscriber *tipc_subscrb_create(int conid)
221{
222 struct tipc_subscriber *subscriber;
223
224 subscriber = kzalloc(sizeof(*subscriber), GFP_ATOMIC);
225 if (!subscriber) {
226 pr_warn("Subscriber rejected, no memory\n");
227 return NULL;
228 }
229 INIT_LIST_HEAD(&subscriber->subscrp_list);
230 kref_init(&subscriber->kref);
231 subscriber->conid = conid;
232 spin_lock_init(&subscriber->lock);
233
234 return subscriber;
235}
236
237static void tipc_subscrb_delete(struct tipc_subscriber *subscriber)
238{
239 tipc_subscrb_subscrp_delete(subscriber, NULL);
240 tipc_subscrb_put(subscriber);
241}
242
243static void tipc_subscrp_delete(struct tipc_subscription *sub)
244{
245 u32 timeout = htohl(sub->evt.s.timeout, sub->swap);
246
247 if (timeout == TIPC_WAIT_FOREVER || del_timer(&sub->timer))
248 tipc_subscrp_put(sub);
249}
250
251static void tipc_subscrp_cancel(struct tipc_subscr *s,
252 struct tipc_subscriber *subscriber)
253{
254 tipc_subscrb_subscrp_delete(subscriber, s);
255}
256
257static struct tipc_subscription *tipc_subscrp_create(struct net *net,
258 struct tipc_subscr *s,
259 int swap)
260{
261 struct tipc_net *tn = net_generic(net, tipc_net_id);
262 struct tipc_subscription *sub;
263 u32 filter = htohl(s->filter, swap);
264
265 /* Refuse subscription if global limit exceeded */
266 if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
267 pr_warn("Subscription rejected, limit reached (%u)\n",
268 TIPC_MAX_SUBSCRIPTIONS);
269 return NULL;
270 }
271
272 /* Allocate subscription object */
273 sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
274 if (!sub) {
275 pr_warn("Subscription rejected, no memory\n");
276 return NULL;
277 }
278
279 /* Initialize subscription object */
280 sub->net = net;
281 if (((filter & TIPC_SUB_PORTS) && (filter & TIPC_SUB_SERVICE)) ||
282 (htohl(s->seq.lower, swap) > htohl(s->seq.upper, swap))) {
283 pr_warn("Subscription rejected, illegal request\n");
284 kfree(sub);
285 return NULL;
286 }
287
288 sub->swap = swap;
289 memcpy(&sub->evt.s, s, sizeof(*s));
290 atomic_inc(&tn->subscription_count);
291 kref_init(&sub->kref);
292 return sub;
293}
294
295static void tipc_subscrp_subscribe(struct net *net, struct tipc_subscr *s,
296 struct tipc_subscriber *subscriber, int swap)
297{
298 struct tipc_net *tn = net_generic(net, tipc_net_id);
299 struct tipc_subscription *sub = NULL;
300 u32 timeout;
301
302 sub = tipc_subscrp_create(net, s, swap);
303 if (!sub)
304 return tipc_conn_terminate(tn->topsrv, subscriber->conid);
305
306 spin_lock_bh(&subscriber->lock);
307 list_add(&sub->subscrp_list, &subscriber->subscrp_list);
308 sub->subscriber = subscriber;
309 tipc_nametbl_subscribe(sub);
310 tipc_subscrb_get(subscriber);
311 spin_unlock_bh(&subscriber->lock);
312
313 setup_timer(&sub->timer, tipc_subscrp_timeout, (unsigned long)sub);
314 timeout = htohl(sub->evt.s.timeout, swap);
315
316 if (timeout != TIPC_WAIT_FOREVER)
317 mod_timer(&sub->timer, jiffies + msecs_to_jiffies(timeout));
318}
319
320/* Handle one termination request for the subscriber */
321static void tipc_subscrb_release_cb(int conid, void *usr_data)
322{
323 tipc_subscrb_delete((struct tipc_subscriber *)usr_data);
324}
325
326/* Handle one request to create a new subscription for the subscriber */
327static void tipc_subscrb_rcv_cb(struct net *net, int conid,
328 struct sockaddr_tipc *addr, void *usr_data,
329 void *buf, size_t len)
330{
331 struct tipc_subscriber *subscriber = usr_data;
332 struct tipc_subscr *s = (struct tipc_subscr *)buf;
333 int swap;
334
335 /* Determine subscriber's endianness */
336 swap = !(s->filter & (TIPC_SUB_PORTS | TIPC_SUB_SERVICE |
337 TIPC_SUB_CANCEL));
338
339 /* Detect & process a subscription cancellation request */
340 if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
341 s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
342 return tipc_subscrp_cancel(s, subscriber);
343 }
344
345 tipc_subscrp_subscribe(net, s, subscriber, swap);
346}
347
348/* Handle one request to establish a new subscriber */
349static void *tipc_subscrb_connect_cb(int conid)
350{
351 return (void *)tipc_subscrb_create(conid);
352}
353
354int tipc_topsrv_start(struct net *net)
355{
356 struct tipc_net *tn = net_generic(net, tipc_net_id);
357 const char name[] = "topology_server";
358 struct tipc_server *topsrv;
359 struct sockaddr_tipc *saddr;
360
361 saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
362 if (!saddr)
363 return -ENOMEM;
364 saddr->family = AF_TIPC;
365 saddr->addrtype = TIPC_ADDR_NAMESEQ;
366 saddr->addr.nameseq.type = TIPC_TOP_SRV;
367 saddr->addr.nameseq.lower = TIPC_TOP_SRV;
368 saddr->addr.nameseq.upper = TIPC_TOP_SRV;
369 saddr->scope = TIPC_NODE_SCOPE;
370
371 topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
372 if (!topsrv) {
373 kfree(saddr);
374 return -ENOMEM;
375 }
376 topsrv->net = net;
377 topsrv->saddr = saddr;
378 topsrv->imp = TIPC_CRITICAL_IMPORTANCE;
379 topsrv->type = SOCK_SEQPACKET;
380 topsrv->max_rcvbuf_size = sizeof(struct tipc_subscr);
381 topsrv->tipc_conn_recvmsg = tipc_subscrb_rcv_cb;
382 topsrv->tipc_conn_new = tipc_subscrb_connect_cb;
383 topsrv->tipc_conn_release = tipc_subscrb_release_cb;
384
385 strncpy(topsrv->name, name, strlen(name) + 1);
386 tn->topsrv = topsrv;
387 atomic_set(&tn->subscription_count, 0);
388
389 return tipc_server_start(topsrv);
390}
391
392void tipc_topsrv_stop(struct net *net)
393{
394 struct tipc_net *tn = net_generic(net, tipc_net_id);
395 struct tipc_server *topsrv = tn->topsrv;
396
397 tipc_server_stop(topsrv);
398 kfree(topsrv->saddr);
399 kfree(topsrv);
400}