blob: 3be1e4b6cbfa50e18381667834af39a90c56a1f2 [file] [log] [blame]
Per Lidenb97bf3f2006-01-02 19:04:38 +01001/*
Allan Stephens5b06c85c2008-05-19 13:30:13 -07002 * net/tipc/subscr.c: TIPC network topology service
YOSHIFUJI Hideakic4307282007-02-09 23:25:21 +09003 *
Jon Maloydf79d042018-02-15 10:40:44 +01004 * Copyright (c) 2000-2017, Ericsson AB
Ying Xue13a2e892013-06-17 10:54:40 -04005 * Copyright (c) 2005-2007, 2010-2013, Wind River Systems
Per Lidenb97bf3f2006-01-02 19:04:38 +01006 * All rights reserved.
7 *
Per Liden9ea1fd32006-01-11 13:30:43 +01008 * Redistribution and use in source and binary forms, with or without
Per Lidenb97bf3f2006-01-02 19:04:38 +01009 * modification, are permitted provided that the following conditions are met:
10 *
Per Liden9ea1fd32006-01-11 13:30:43 +010011 * 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.
Per Lidenb97bf3f2006-01-02 19:04:38 +010019 *
Per Liden9ea1fd32006-01-11 13:30:43 +010020 * 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
Per Lidenb97bf3f2006-01-02 19:04:38 +010034 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#include "core.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010038#include "name_table.h"
Allan Stephens5b06c85c2008-05-19 13:30:13 -070039#include "subscr.h"
Per Lidenb97bf3f2006-01-02 19:04:38 +010040
Jon Maloyda0a75e2018-02-15 10:40:48 +010041static void tipc_sub_send_event(struct tipc_subscription *sub,
42 u32 found_lower, u32 found_upper,
43 u32 event, u32 port, u32 node)
Per Lidenb97bf3f2006-01-02 19:04:38 +010044{
Jon Maloy414574a2018-02-15 10:40:45 +010045 struct tipc_event *evt = &sub->evt;
Per Lidenb97bf3f2006-01-02 19:04:38 +010046
Jon Maloydf79d042018-02-15 10:40:44 +010047 if (sub->inactive)
48 return;
Jon Maloy8985ecc2018-02-15 10:40:46 +010049 tipc_evt_write(evt, event, event);
50 tipc_evt_write(evt, found_lower, found_lower);
51 tipc_evt_write(evt, found_upper, found_upper);
52 tipc_evt_write(evt, port.ref, port);
53 tipc_evt_write(evt, port.node, node);
Jon Maloy414574a2018-02-15 10:40:45 +010054 tipc_conn_queue_evt(sub->server, sub->conid, event, evt);
Per Lidenb97bf3f2006-01-02 19:04:38 +010055}
56
57/**
Jon Maloyda0a75e2018-02-15 10:40:48 +010058 * tipc_sub_check_overlap - test for subscription overlap with the
Ying Xue57f1d182015-05-04 10:36:44 +080059 * given values
Per Lidenb97bf3f2006-01-02 19:04:38 +010060 *
61 * Returns 1 if there is overlap, otherwise 0.
62 */
Jon Maloyda0a75e2018-02-15 10:40:48 +010063int tipc_sub_check_overlap(struct tipc_name_seq *seq, u32 found_lower,
64 u32 found_upper)
Per Lidenb97bf3f2006-01-02 19:04:38 +010065{
Parthasarathy Bhuvaragana4273c72016-02-02 10:52:10 +010066 if (found_lower < seq->lower)
67 found_lower = seq->lower;
68 if (found_upper > seq->upper)
69 found_upper = seq->upper;
Per Lidenb97bf3f2006-01-02 19:04:38 +010070 if (found_lower > found_upper)
71 return 0;
72 return 1;
73}
74
Jon Maloyda0a75e2018-02-15 10:40:48 +010075void tipc_sub_report_overlap(struct tipc_subscription *sub,
76 u32 found_lower, u32 found_upper,
77 u32 event, u32 port, u32 node,
78 u32 scope, int must)
Parthasarathy Bhuvaragana4273c72016-02-02 10:52:10 +010079{
Jon Maloy8985ecc2018-02-15 10:40:46 +010080 struct tipc_subscr *s = &sub->evt.s;
81 u32 filter = tipc_sub_read(s, filter);
Jon Maloyda0a75e2018-02-15 10:40:48 +010082 struct tipc_name_seq seq;
Parthasarathy Bhuvaragana4273c72016-02-02 10:52:10 +010083
Jon Maloy8985ecc2018-02-15 10:40:46 +010084 seq.type = tipc_sub_read(s, seq.type);
85 seq.lower = tipc_sub_read(s, seq.lower);
86 seq.upper = tipc_sub_read(s, seq.upper);
87
Jon Maloyda0a75e2018-02-15 10:40:48 +010088 if (!tipc_sub_check_overlap(&seq, found_lower, found_upper))
Per Lidenb97bf3f2006-01-02 19:04:38 +010089 return;
Jon Maloy8985ecc2018-02-15 10:40:46 +010090
Jon Maloy232d07b2018-01-08 21:03:30 +010091 if (!must && !(filter & TIPC_SUB_PORTS))
92 return;
93 if (filter & TIPC_SUB_CLUSTER_SCOPE && scope == TIPC_NODE_SCOPE)
94 return;
95 if (filter & TIPC_SUB_NODE_SCOPE && scope != TIPC_NODE_SCOPE)
Per Lidenb97bf3f2006-01-02 19:04:38 +010096 return;
Jon Maloydf79d042018-02-15 10:40:44 +010097 spin_lock(&sub->lock);
Jon Maloyda0a75e2018-02-15 10:40:48 +010098 tipc_sub_send_event(sub, found_lower, found_upper,
99 event, port, node);
Jon Maloydf79d042018-02-15 10:40:44 +0100100 spin_unlock(&sub->lock);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100101}
102
Jon Maloyda0a75e2018-02-15 10:40:48 +0100103static void tipc_sub_timeout(struct timer_list *t)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100104{
Kees Cook31b102b2017-10-30 14:06:45 -0700105 struct tipc_subscription *sub = from_timer(sub, t, timer);
Jon Maloydf79d042018-02-15 10:40:44 +0100106 struct tipc_subscr *s = &sub->evt.s;
Ying Xue557d054c2017-03-21 10:47:49 +0100107
Jon Maloydf79d042018-02-15 10:40:44 +0100108 spin_lock(&sub->lock);
Jon Maloyda0a75e2018-02-15 10:40:48 +0100109 tipc_sub_send_event(sub, s->seq.lower, s->seq.upper,
110 TIPC_SUBSCR_TIMEOUT, 0, 0);
Jon Maloydf79d042018-02-15 10:40:44 +0100111 sub->inactive = true;
112 spin_unlock(&sub->lock);
Ying Xue00bc00a92015-05-04 10:36:46 +0800113}
114
Jon Maloyda0a75e2018-02-15 10:40:48 +0100115static void tipc_sub_kref_release(struct kref *kref)
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100116{
Jon Maloy414574a2018-02-15 10:40:45 +0100117 struct tipc_subscription *sub;
118 struct tipc_net *tn;
119
120 sub = container_of(kref, struct tipc_subscription, kref);
121 tn = tipc_net(sub->server->net);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100122
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100123 atomic_dec(&tn->subscription_count);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100124 kfree(sub);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100125}
126
Jon Maloyda0a75e2018-02-15 10:40:48 +0100127void tipc_sub_put(struct tipc_subscription *subscription)
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100128{
Jon Maloyda0a75e2018-02-15 10:40:48 +0100129 kref_put(&subscription->kref, tipc_sub_kref_release);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100130}
131
Jon Maloyda0a75e2018-02-15 10:40:48 +0100132void tipc_sub_get(struct tipc_subscription *subscription)
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100133{
134 kref_get(&subscription->kref);
135}
136
Jon Maloy242e82c2018-02-15 10:40:47 +0100137struct tipc_subscription *tipc_sub_subscribe(struct tipc_server *srv,
138 struct tipc_subscr *s,
139 int conid)
Ying Xuea62fbcc2015-01-09 15:27:11 +0800140{
Jon Maloy414574a2018-02-15 10:40:45 +0100141 struct tipc_net *tn = tipc_net(srv->net);
Jon Maloy8985ecc2018-02-15 10:40:46 +0100142 u32 filter = tipc_sub_read(s, filter);
Jon Maloyda0a75e2018-02-15 10:40:48 +0100143 struct tipc_subscription *sub;
Jon Maloy242e82c2018-02-15 10:40:47 +0100144 u32 timeout;
Lijun Cheneb409462006-10-16 21:59:42 -0700145
Jon Maloy242e82c2018-02-15 10:40:47 +0100146 if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCR) {
147 pr_warn("Subscription rejected, max (%u)\n", TIPC_MAX_SUBSCR);
Parthasarathy Bhuvaragan7c13c622016-02-02 10:52:11 +0100148 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100149 }
Jon Maloy242e82c2018-02-15 10:40:47 +0100150 if ((filter & TIPC_SUB_PORTS && filter & TIPC_SUB_SERVICE) ||
151 (tipc_sub_read(s, seq.lower) > tipc_sub_read(s, seq.upper))) {
152 pr_warn("Subscription rejected, illegal request\n");
153 return NULL;
154 }
Allan Stephens28353e72008-05-19 13:29:47 -0700155 sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
Allan Stephensa10bd922006-06-25 23:52:17 -0700156 if (!sub) {
Erik Hugne2cf8aa12012-06-29 00:16:37 -0400157 pr_warn("Subscription rejected, no memory\n");
Parthasarathy Bhuvaragan7c13c622016-02-02 10:52:11 +0100158 return NULL;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100159 }
Jon Maloy414574a2018-02-15 10:40:45 +0100160 sub->server = srv;
Jon Maloydf79d042018-02-15 10:40:44 +0100161 sub->conid = conid;
162 sub->inactive = false;
Parthasarathy Bhuvaragan7c13c622016-02-02 10:52:11 +0100163 memcpy(&sub->evt.s, s, sizeof(*s));
Jon Maloydf79d042018-02-15 10:40:44 +0100164 spin_lock_init(&sub->lock);
Parthasarathy Bhuvaragan7c13c622016-02-02 10:52:11 +0100165 atomic_inc(&tn->subscription_count);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100166 kref_init(&sub->kref);
Jon Maloy8985ecc2018-02-15 10:40:46 +0100167 tipc_nametbl_subscribe(sub);
Jon Maloyda0a75e2018-02-15 10:40:48 +0100168 timer_setup(&sub->timer, tipc_sub_timeout, 0);
Jon Maloy8985ecc2018-02-15 10:40:46 +0100169 timeout = tipc_sub_read(&sub->evt.s, timeout);
Parthasarathy Bhuvaragand094c4d2017-01-24 13:00:44 +0100170 if (timeout != TIPC_WAIT_FOREVER)
171 mod_timer(&sub->timer, jiffies + msecs_to_jiffies(timeout));
Jon Maloydf79d042018-02-15 10:40:44 +0100172 return sub;
Per Lidenb97bf3f2006-01-02 19:04:38 +0100173}
174
Jon Maloy242e82c2018-02-15 10:40:47 +0100175void tipc_sub_unsubscribe(struct tipc_subscription *sub)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100176{
Jon Maloydf79d042018-02-15 10:40:44 +0100177 tipc_nametbl_unsubscribe(sub);
178 if (sub->evt.s.timeout != TIPC_WAIT_FOREVER)
179 del_timer_sync(&sub->timer);
Jon Maloyda0a75e2018-02-15 10:40:48 +0100180 list_del(&sub->sub_list);
181 tipc_sub_put(sub);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100182}
183
Ying Xue57f1d182015-05-04 10:36:44 +0800184int tipc_topsrv_start(struct net *net)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100185{
Ying Xuea62fbcc2015-01-09 15:27:11 +0800186 struct tipc_net *tn = net_generic(net, tipc_net_id);
187 const char name[] = "topology_server";
Ying Xuea62fbcc2015-01-09 15:27:11 +0800188 struct sockaddr_tipc *saddr;
Jon Maloyda0a75e2018-02-15 10:40:48 +0100189 struct tipc_server *topsrv;
Ying Xuea62fbcc2015-01-09 15:27:11 +0800190
191 saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
192 if (!saddr)
193 return -ENOMEM;
194 saddr->family = AF_TIPC;
195 saddr->addrtype = TIPC_ADDR_NAMESEQ;
196 saddr->addr.nameseq.type = TIPC_TOP_SRV;
197 saddr->addr.nameseq.lower = TIPC_TOP_SRV;
198 saddr->addr.nameseq.upper = TIPC_TOP_SRV;
199 saddr->scope = TIPC_NODE_SCOPE;
200
201 topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
202 if (!topsrv) {
203 kfree(saddr);
204 return -ENOMEM;
205 }
206 topsrv->net = net;
207 topsrv->saddr = saddr;
Ying Xuea62fbcc2015-01-09 15:27:11 +0800208 topsrv->max_rcvbuf_size = sizeof(struct tipc_subscr);
Ying Xuea62fbcc2015-01-09 15:27:11 +0800209
210 strncpy(topsrv->name, name, strlen(name) + 1);
211 tn->topsrv = topsrv;
212 atomic_set(&tn->subscription_count, 0);
213
214 return tipc_server_start(topsrv);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100215}
216
Ying Xue57f1d182015-05-04 10:36:44 +0800217void tipc_topsrv_stop(struct net *net)
Per Lidenb97bf3f2006-01-02 19:04:38 +0100218{
Ying Xuea62fbcc2015-01-09 15:27:11 +0800219 struct tipc_net *tn = net_generic(net, tipc_net_id);
220 struct tipc_server *topsrv = tn->topsrv;
221
222 tipc_server_stop(topsrv);
223 kfree(topsrv->saddr);
224 kfree(topsrv);
Per Lidenb97bf3f2006-01-02 19:04:38 +0100225}