subscr.c 11 KB

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