subscr.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377
  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. #include "core.h"
  37. #include "name_table.h"
  38. #include "subscr.h"
  39. /**
  40. * struct tipc_subscriber - TIPC network topology subscriber
  41. * @conid: connection identifier to server connecting to subscriber
  42. * @lock: control access to subscriber
  43. * @subscription_list: list of subscription objects for this subscriber
  44. */
  45. struct tipc_subscriber {
  46. int conid;
  47. spinlock_t lock;
  48. struct list_head subscription_list;
  49. };
  50. /**
  51. * htohl - convert value to endianness used by destination
  52. * @in: value to convert
  53. * @swap: non-zero if endianness must be reversed
  54. *
  55. * Returns converted value
  56. */
  57. static u32 htohl(u32 in, int swap)
  58. {
  59. return swap ? swab32(in) : in;
  60. }
  61. static void subscr_send_event(struct tipc_subscription *sub, u32 found_lower,
  62. u32 found_upper, u32 event, u32 port_ref,
  63. u32 node)
  64. {
  65. struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
  66. struct tipc_subscriber *subscriber = sub->subscriber;
  67. struct kvec msg_sect;
  68. msg_sect.iov_base = (void *)&sub->evt;
  69. msg_sect.iov_len = sizeof(struct tipc_event);
  70. sub->evt.event = htohl(event, sub->swap);
  71. sub->evt.found_lower = htohl(found_lower, sub->swap);
  72. sub->evt.found_upper = htohl(found_upper, sub->swap);
  73. sub->evt.port.ref = htohl(port_ref, sub->swap);
  74. sub->evt.port.node = htohl(node, sub->swap);
  75. tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
  76. msg_sect.iov_base, msg_sect.iov_len);
  77. }
  78. /**
  79. * tipc_subscr_overlap - test for subscription overlap with the given values
  80. *
  81. * Returns 1 if there is overlap, otherwise 0.
  82. */
  83. int tipc_subscr_overlap(struct tipc_subscription *sub, u32 found_lower,
  84. u32 found_upper)
  85. {
  86. if (found_lower < sub->seq.lower)
  87. found_lower = sub->seq.lower;
  88. if (found_upper > sub->seq.upper)
  89. found_upper = sub->seq.upper;
  90. if (found_lower > found_upper)
  91. return 0;
  92. return 1;
  93. }
  94. /**
  95. * tipc_subscr_report_overlap - issue event if there is subscription overlap
  96. *
  97. * Protected by nameseq.lock in name_table.c
  98. */
  99. void tipc_subscr_report_overlap(struct tipc_subscription *sub, u32 found_lower,
  100. u32 found_upper, u32 event, u32 port_ref,
  101. u32 node, int must)
  102. {
  103. if (!tipc_subscr_overlap(sub, found_lower, found_upper))
  104. return;
  105. if (!must && !(sub->filter & TIPC_SUB_PORTS))
  106. return;
  107. subscr_send_event(sub, found_lower, found_upper, event, port_ref, node);
  108. }
  109. static void subscr_timeout(unsigned long data)
  110. {
  111. struct tipc_subscription *sub = (struct tipc_subscription *)data;
  112. struct tipc_subscriber *subscriber = sub->subscriber;
  113. struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
  114. /* The spin lock per subscriber is used to protect its members */
  115. spin_lock_bh(&subscriber->lock);
  116. /* Validate timeout (in case subscription is being cancelled) */
  117. if (sub->timeout == TIPC_WAIT_FOREVER) {
  118. spin_unlock_bh(&subscriber->lock);
  119. return;
  120. }
  121. /* Unlink subscription from name table */
  122. tipc_nametbl_unsubscribe(sub);
  123. /* Unlink subscription from subscriber */
  124. list_del(&sub->subscription_list);
  125. spin_unlock_bh(&subscriber->lock);
  126. /* Notify subscriber of timeout */
  127. subscr_send_event(sub, sub->evt.s.seq.lower, sub->evt.s.seq.upper,
  128. TIPC_SUBSCR_TIMEOUT, 0, 0);
  129. /* Now destroy subscription */
  130. kfree(sub);
  131. atomic_dec(&tn->subscription_count);
  132. }
  133. /**
  134. * subscr_del - delete a subscription within a subscription list
  135. *
  136. * Called with subscriber lock held.
  137. */
  138. static void subscr_del(struct tipc_subscription *sub)
  139. {
  140. struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
  141. tipc_nametbl_unsubscribe(sub);
  142. list_del(&sub->subscription_list);
  143. kfree(sub);
  144. atomic_dec(&tn->subscription_count);
  145. }
  146. static void subscr_release(struct tipc_subscriber *subscriber)
  147. {
  148. struct tipc_subscription *sub;
  149. struct tipc_subscription *sub_temp;
  150. spin_lock_bh(&subscriber->lock);
  151. /* Destroy any existing subscriptions for subscriber */
  152. list_for_each_entry_safe(sub, sub_temp, &subscriber->subscription_list,
  153. subscription_list) {
  154. if (sub->timeout != TIPC_WAIT_FOREVER) {
  155. spin_unlock_bh(&subscriber->lock);
  156. del_timer_sync(&sub->timer);
  157. spin_lock_bh(&subscriber->lock);
  158. }
  159. subscr_del(sub);
  160. }
  161. spin_unlock_bh(&subscriber->lock);
  162. /* Now destroy subscriber */
  163. kfree(subscriber);
  164. }
  165. /**
  166. * subscr_cancel - handle subscription cancellation request
  167. *
  168. * Called with subscriber lock held. Routine must temporarily release lock
  169. * to enable the subscription timeout routine to finish without deadlocking;
  170. * the lock is then reclaimed to allow caller to release it upon return.
  171. *
  172. * Note that fields of 's' use subscriber's endianness!
  173. */
  174. static void subscr_cancel(struct tipc_subscr *s,
  175. struct tipc_subscriber *subscriber)
  176. {
  177. struct tipc_subscription *sub;
  178. struct tipc_subscription *sub_temp;
  179. int found = 0;
  180. /* Find first matching subscription, exit if not found */
  181. list_for_each_entry_safe(sub, sub_temp, &subscriber->subscription_list,
  182. subscription_list) {
  183. if (!memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr))) {
  184. found = 1;
  185. break;
  186. }
  187. }
  188. if (!found)
  189. return;
  190. /* Cancel subscription timer (if used), then delete subscription */
  191. if (sub->timeout != TIPC_WAIT_FOREVER) {
  192. sub->timeout = TIPC_WAIT_FOREVER;
  193. spin_unlock_bh(&subscriber->lock);
  194. del_timer_sync(&sub->timer);
  195. spin_lock_bh(&subscriber->lock);
  196. }
  197. subscr_del(sub);
  198. }
  199. /**
  200. * subscr_subscribe - create subscription for subscriber
  201. *
  202. * Called with subscriber lock held.
  203. */
  204. static int subscr_subscribe(struct net *net, struct tipc_subscr *s,
  205. struct tipc_subscriber *subscriber,
  206. struct tipc_subscription **sub_p)
  207. {
  208. struct tipc_net *tn = net_generic(net, tipc_net_id);
  209. struct tipc_subscription *sub;
  210. int swap;
  211. /* Determine subscriber's endianness */
  212. swap = !(s->filter & (TIPC_SUB_PORTS | TIPC_SUB_SERVICE));
  213. /* Detect & process a subscription cancellation request */
  214. if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
  215. s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
  216. subscr_cancel(s, subscriber);
  217. return 0;
  218. }
  219. /* Refuse subscription if global limit exceeded */
  220. if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
  221. pr_warn("Subscription rejected, limit reached (%u)\n",
  222. TIPC_MAX_SUBSCRIPTIONS);
  223. return -EINVAL;
  224. }
  225. /* Allocate subscription object */
  226. sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
  227. if (!sub) {
  228. pr_warn("Subscription rejected, no memory\n");
  229. return -ENOMEM;
  230. }
  231. /* Initialize subscription object */
  232. sub->net = net;
  233. sub->seq.type = htohl(s->seq.type, swap);
  234. sub->seq.lower = htohl(s->seq.lower, swap);
  235. sub->seq.upper = htohl(s->seq.upper, swap);
  236. sub->timeout = msecs_to_jiffies(htohl(s->timeout, swap));
  237. sub->filter = htohl(s->filter, swap);
  238. if ((!(sub->filter & TIPC_SUB_PORTS) ==
  239. !(sub->filter & TIPC_SUB_SERVICE)) ||
  240. (sub->seq.lower > sub->seq.upper)) {
  241. pr_warn("Subscription rejected, illegal request\n");
  242. kfree(sub);
  243. return -EINVAL;
  244. }
  245. list_add(&sub->subscription_list, &subscriber->subscription_list);
  246. sub->subscriber = subscriber;
  247. sub->swap = swap;
  248. memcpy(&sub->evt.s, s, sizeof(struct tipc_subscr));
  249. atomic_inc(&tn->subscription_count);
  250. if (sub->timeout != TIPC_WAIT_FOREVER) {
  251. setup_timer(&sub->timer, subscr_timeout, (unsigned long)sub);
  252. mod_timer(&sub->timer, jiffies + sub->timeout);
  253. }
  254. *sub_p = sub;
  255. return 0;
  256. }
  257. /* Handle one termination request for the subscriber */
  258. static void subscr_conn_shutdown_event(int conid, void *usr_data)
  259. {
  260. subscr_release((struct tipc_subscriber *)usr_data);
  261. }
  262. /* Handle one request to create a new subscription for the subscriber */
  263. static void subscr_conn_msg_event(struct net *net, int conid,
  264. struct sockaddr_tipc *addr, void *usr_data,
  265. void *buf, size_t len)
  266. {
  267. struct tipc_subscriber *subscriber = usr_data;
  268. struct tipc_subscription *sub = NULL;
  269. struct tipc_net *tn = net_generic(net, tipc_net_id);
  270. spin_lock_bh(&subscriber->lock);
  271. subscr_subscribe(net, (struct tipc_subscr *)buf, subscriber, &sub);
  272. if (sub)
  273. tipc_nametbl_subscribe(sub);
  274. else
  275. tipc_conn_terminate(tn->topsrv, subscriber->conid);
  276. spin_unlock_bh(&subscriber->lock);
  277. }
  278. /* Handle one request to establish a new subscriber */
  279. static void *subscr_named_msg_event(int conid)
  280. {
  281. struct tipc_subscriber *subscriber;
  282. /* Create subscriber object */
  283. subscriber = kzalloc(sizeof(struct tipc_subscriber), GFP_ATOMIC);
  284. if (subscriber == NULL) {
  285. pr_warn("Subscriber rejected, no memory\n");
  286. return NULL;
  287. }
  288. INIT_LIST_HEAD(&subscriber->subscription_list);
  289. subscriber->conid = conid;
  290. spin_lock_init(&subscriber->lock);
  291. return (void *)subscriber;
  292. }
  293. int tipc_subscr_start(struct net *net)
  294. {
  295. struct tipc_net *tn = net_generic(net, tipc_net_id);
  296. const char name[] = "topology_server";
  297. struct tipc_server *topsrv;
  298. struct sockaddr_tipc *saddr;
  299. saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
  300. if (!saddr)
  301. return -ENOMEM;
  302. saddr->family = AF_TIPC;
  303. saddr->addrtype = TIPC_ADDR_NAMESEQ;
  304. saddr->addr.nameseq.type = TIPC_TOP_SRV;
  305. saddr->addr.nameseq.lower = TIPC_TOP_SRV;
  306. saddr->addr.nameseq.upper = TIPC_TOP_SRV;
  307. saddr->scope = TIPC_NODE_SCOPE;
  308. topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
  309. if (!topsrv) {
  310. kfree(saddr);
  311. return -ENOMEM;
  312. }
  313. topsrv->net = net;
  314. topsrv->saddr = saddr;
  315. topsrv->imp = TIPC_CRITICAL_IMPORTANCE;
  316. topsrv->type = SOCK_SEQPACKET;
  317. topsrv->max_rcvbuf_size = sizeof(struct tipc_subscr);
  318. topsrv->tipc_conn_recvmsg = subscr_conn_msg_event;
  319. topsrv->tipc_conn_new = subscr_named_msg_event;
  320. topsrv->tipc_conn_shutdown = subscr_conn_shutdown_event;
  321. strncpy(topsrv->name, name, strlen(name) + 1);
  322. tn->topsrv = topsrv;
  323. atomic_set(&tn->subscription_count, 0);
  324. return tipc_server_start(topsrv);
  325. }
  326. void tipc_subscr_stop(struct net *net)
  327. {
  328. struct tipc_net *tn = net_generic(net, tipc_net_id);
  329. struct tipc_server *topsrv = tn->topsrv;
  330. tipc_server_stop(topsrv);
  331. kfree(topsrv->saddr);
  332. kfree(topsrv);
  333. }