subscr.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  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. * @kref: reference counter to tipc_subscription object
  42. * @conid: connection identifier to server connecting to subscriber
  43. * @lock: control access to subscriber
  44. * @subscrp_list: list of subscription objects for this subscriber
  45. */
  46. struct tipc_subscriber {
  47. struct kref kref;
  48. int conid;
  49. spinlock_t lock;
  50. struct list_head subscrp_list;
  51. };
  52. static void tipc_subscrp_delete(struct tipc_subscription *sub);
  53. static void tipc_subscrb_put(struct tipc_subscriber *subscriber);
  54. static void tipc_subscrp_put(struct tipc_subscription *subscription);
  55. static void tipc_subscrp_get(struct tipc_subscription *subscription);
  56. /**
  57. * htohl - convert value to endianness used by destination
  58. * @in: value to convert
  59. * @swap: non-zero if endianness must be reversed
  60. *
  61. * Returns converted value
  62. */
  63. static u32 htohl(u32 in, int swap)
  64. {
  65. return swap ? swab32(in) : in;
  66. }
  67. static void tipc_subscrp_send_event(struct tipc_subscription *sub,
  68. u32 found_lower, u32 found_upper,
  69. u32 event, u32 port_ref, u32 node)
  70. {
  71. struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
  72. struct tipc_subscriber *subscriber = sub->subscriber;
  73. struct kvec msg_sect;
  74. msg_sect.iov_base = (void *)&sub->evt;
  75. msg_sect.iov_len = sizeof(struct tipc_event);
  76. sub->evt.event = htohl(event, sub->swap);
  77. sub->evt.found_lower = htohl(found_lower, sub->swap);
  78. sub->evt.found_upper = htohl(found_upper, sub->swap);
  79. sub->evt.port.ref = htohl(port_ref, sub->swap);
  80. sub->evt.port.node = htohl(node, sub->swap);
  81. tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
  82. msg_sect.iov_base, msg_sect.iov_len);
  83. }
  84. /**
  85. * tipc_subscrp_check_overlap - test for subscription overlap with the
  86. * given values
  87. *
  88. * Returns 1 if there is overlap, otherwise 0.
  89. */
  90. int tipc_subscrp_check_overlap(struct tipc_name_seq *seq, u32 found_lower,
  91. u32 found_upper)
  92. {
  93. if (found_lower < seq->lower)
  94. found_lower = seq->lower;
  95. if (found_upper > seq->upper)
  96. found_upper = seq->upper;
  97. if (found_lower > found_upper)
  98. return 0;
  99. return 1;
  100. }
  101. u32 tipc_subscrp_convert_seq_type(u32 type, int swap)
  102. {
  103. return htohl(type, swap);
  104. }
  105. void tipc_subscrp_convert_seq(struct tipc_name_seq *in, int swap,
  106. struct tipc_name_seq *out)
  107. {
  108. out->type = htohl(in->type, swap);
  109. out->lower = htohl(in->lower, swap);
  110. out->upper = htohl(in->upper, swap);
  111. }
  112. void tipc_subscrp_report_overlap(struct tipc_subscription *sub, u32 found_lower,
  113. u32 found_upper, u32 event, u32 port_ref,
  114. u32 node, int must)
  115. {
  116. struct tipc_name_seq seq;
  117. tipc_subscrp_get(sub);
  118. tipc_subscrp_convert_seq(&sub->evt.s.seq, sub->swap, &seq);
  119. if (!tipc_subscrp_check_overlap(&seq, found_lower, found_upper))
  120. return;
  121. if (!must &&
  122. !(htohl(sub->evt.s.filter, sub->swap) & TIPC_SUB_PORTS))
  123. return;
  124. tipc_subscrp_send_event(sub, found_lower, found_upper, event, port_ref,
  125. node);
  126. tipc_subscrp_put(sub);
  127. }
  128. static void tipc_subscrp_timeout(unsigned long data)
  129. {
  130. struct tipc_subscription *sub = (struct tipc_subscription *)data;
  131. struct tipc_subscriber *subscriber = sub->subscriber;
  132. spin_lock_bh(&subscriber->lock);
  133. tipc_nametbl_unsubscribe(sub);
  134. spin_unlock_bh(&subscriber->lock);
  135. /* Notify subscriber of timeout */
  136. tipc_subscrp_send_event(sub, sub->evt.s.seq.lower, sub->evt.s.seq.upper,
  137. TIPC_SUBSCR_TIMEOUT, 0, 0);
  138. tipc_subscrp_put(sub);
  139. }
  140. static void tipc_subscrb_kref_release(struct kref *kref)
  141. {
  142. kfree(container_of(kref,struct tipc_subscriber, kref));
  143. }
  144. static void tipc_subscrb_put(struct tipc_subscriber *subscriber)
  145. {
  146. kref_put(&subscriber->kref, tipc_subscrb_kref_release);
  147. }
  148. static void tipc_subscrb_get(struct tipc_subscriber *subscriber)
  149. {
  150. kref_get(&subscriber->kref);
  151. }
  152. static void tipc_subscrp_kref_release(struct kref *kref)
  153. {
  154. struct tipc_subscription *sub = container_of(kref,
  155. struct tipc_subscription,
  156. kref);
  157. struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
  158. struct tipc_subscriber *subscriber = sub->subscriber;
  159. spin_lock_bh(&subscriber->lock);
  160. list_del(&sub->subscrp_list);
  161. atomic_dec(&tn->subscription_count);
  162. spin_unlock_bh(&subscriber->lock);
  163. kfree(sub);
  164. tipc_subscrb_put(subscriber);
  165. }
  166. static void tipc_subscrp_put(struct tipc_subscription *subscription)
  167. {
  168. kref_put(&subscription->kref, tipc_subscrp_kref_release);
  169. }
  170. static void tipc_subscrp_get(struct tipc_subscription *subscription)
  171. {
  172. kref_get(&subscription->kref);
  173. }
  174. /* tipc_subscrb_subscrp_delete - delete a specific subscription or all
  175. * subscriptions for a given subscriber.
  176. */
  177. static void tipc_subscrb_subscrp_delete(struct tipc_subscriber *subscriber,
  178. struct tipc_subscr *s)
  179. {
  180. struct list_head *subscription_list = &subscriber->subscrp_list;
  181. struct tipc_subscription *sub, *temp;
  182. spin_lock_bh(&subscriber->lock);
  183. list_for_each_entry_safe(sub, temp, subscription_list, subscrp_list) {
  184. if (s && memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr)))
  185. continue;
  186. tipc_nametbl_unsubscribe(sub);
  187. tipc_subscrp_get(sub);
  188. spin_unlock_bh(&subscriber->lock);
  189. tipc_subscrp_delete(sub);
  190. tipc_subscrp_put(sub);
  191. spin_lock_bh(&subscriber->lock);
  192. if (s)
  193. break;
  194. }
  195. spin_unlock_bh(&subscriber->lock);
  196. }
  197. static struct tipc_subscriber *tipc_subscrb_create(int conid)
  198. {
  199. struct tipc_subscriber *subscriber;
  200. subscriber = kzalloc(sizeof(*subscriber), GFP_ATOMIC);
  201. if (!subscriber) {
  202. pr_warn("Subscriber rejected, no memory\n");
  203. return NULL;
  204. }
  205. INIT_LIST_HEAD(&subscriber->subscrp_list);
  206. kref_init(&subscriber->kref);
  207. subscriber->conid = conid;
  208. spin_lock_init(&subscriber->lock);
  209. return subscriber;
  210. }
  211. static void tipc_subscrb_delete(struct tipc_subscriber *subscriber)
  212. {
  213. tipc_subscrb_subscrp_delete(subscriber, NULL);
  214. tipc_subscrb_put(subscriber);
  215. }
  216. static void tipc_subscrp_delete(struct tipc_subscription *sub)
  217. {
  218. u32 timeout = htohl(sub->evt.s.timeout, sub->swap);
  219. if (timeout == TIPC_WAIT_FOREVER || del_timer(&sub->timer))
  220. tipc_subscrp_put(sub);
  221. }
  222. static void tipc_subscrp_cancel(struct tipc_subscr *s,
  223. struct tipc_subscriber *subscriber)
  224. {
  225. tipc_subscrb_subscrp_delete(subscriber, s);
  226. }
  227. static struct tipc_subscription *tipc_subscrp_create(struct net *net,
  228. struct tipc_subscr *s,
  229. int swap)
  230. {
  231. struct tipc_net *tn = net_generic(net, tipc_net_id);
  232. struct tipc_subscription *sub;
  233. u32 filter = htohl(s->filter, swap);
  234. /* Refuse subscription if global limit exceeded */
  235. if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
  236. pr_warn("Subscription rejected, limit reached (%u)\n",
  237. TIPC_MAX_SUBSCRIPTIONS);
  238. return NULL;
  239. }
  240. /* Allocate subscription object */
  241. sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
  242. if (!sub) {
  243. pr_warn("Subscription rejected, no memory\n");
  244. return NULL;
  245. }
  246. /* Initialize subscription object */
  247. sub->net = net;
  248. if (((filter & TIPC_SUB_PORTS) && (filter & TIPC_SUB_SERVICE)) ||
  249. (htohl(s->seq.lower, swap) > htohl(s->seq.upper, swap))) {
  250. pr_warn("Subscription rejected, illegal request\n");
  251. kfree(sub);
  252. return NULL;
  253. }
  254. sub->swap = swap;
  255. memcpy(&sub->evt.s, s, sizeof(*s));
  256. atomic_inc(&tn->subscription_count);
  257. kref_init(&sub->kref);
  258. return sub;
  259. }
  260. static void tipc_subscrp_subscribe(struct net *net, struct tipc_subscr *s,
  261. struct tipc_subscriber *subscriber, int swap)
  262. {
  263. struct tipc_net *tn = net_generic(net, tipc_net_id);
  264. struct tipc_subscription *sub = NULL;
  265. u32 timeout;
  266. sub = tipc_subscrp_create(net, s, swap);
  267. if (!sub)
  268. return tipc_conn_terminate(tn->topsrv, subscriber->conid);
  269. spin_lock_bh(&subscriber->lock);
  270. list_add(&sub->subscrp_list, &subscriber->subscrp_list);
  271. sub->subscriber = subscriber;
  272. tipc_nametbl_subscribe(sub);
  273. tipc_subscrb_get(subscriber);
  274. spin_unlock_bh(&subscriber->lock);
  275. setup_timer(&sub->timer, tipc_subscrp_timeout, (unsigned long)sub);
  276. timeout = htohl(sub->evt.s.timeout, swap);
  277. if (timeout != TIPC_WAIT_FOREVER)
  278. mod_timer(&sub->timer, jiffies + msecs_to_jiffies(timeout));
  279. }
  280. /* Handle one termination request for the subscriber */
  281. static void tipc_subscrb_release_cb(int conid, void *usr_data)
  282. {
  283. tipc_subscrb_delete((struct tipc_subscriber *)usr_data);
  284. }
  285. /* Handle one request to create a new subscription for the subscriber */
  286. static void tipc_subscrb_rcv_cb(struct net *net, int conid,
  287. struct sockaddr_tipc *addr, void *usr_data,
  288. void *buf, size_t len)
  289. {
  290. struct tipc_subscriber *subscriber = usr_data;
  291. struct tipc_subscr *s = (struct tipc_subscr *)buf;
  292. int swap;
  293. /* Determine subscriber's endianness */
  294. swap = !(s->filter & (TIPC_SUB_PORTS | TIPC_SUB_SERVICE |
  295. TIPC_SUB_CANCEL));
  296. /* Detect & process a subscription cancellation request */
  297. if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
  298. s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
  299. return tipc_subscrp_cancel(s, subscriber);
  300. }
  301. tipc_subscrp_subscribe(net, s, subscriber, swap);
  302. }
  303. /* Handle one request to establish a new subscriber */
  304. static void *tipc_subscrb_connect_cb(int conid)
  305. {
  306. return (void *)tipc_subscrb_create(conid);
  307. }
  308. int tipc_topsrv_start(struct net *net)
  309. {
  310. struct tipc_net *tn = net_generic(net, tipc_net_id);
  311. const char name[] = "topology_server";
  312. struct tipc_server *topsrv;
  313. struct sockaddr_tipc *saddr;
  314. saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
  315. if (!saddr)
  316. return -ENOMEM;
  317. saddr->family = AF_TIPC;
  318. saddr->addrtype = TIPC_ADDR_NAMESEQ;
  319. saddr->addr.nameseq.type = TIPC_TOP_SRV;
  320. saddr->addr.nameseq.lower = TIPC_TOP_SRV;
  321. saddr->addr.nameseq.upper = TIPC_TOP_SRV;
  322. saddr->scope = TIPC_NODE_SCOPE;
  323. topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
  324. if (!topsrv) {
  325. kfree(saddr);
  326. return -ENOMEM;
  327. }
  328. topsrv->net = net;
  329. topsrv->saddr = saddr;
  330. topsrv->imp = TIPC_CRITICAL_IMPORTANCE;
  331. topsrv->type = SOCK_SEQPACKET;
  332. topsrv->max_rcvbuf_size = sizeof(struct tipc_subscr);
  333. topsrv->tipc_conn_recvmsg = tipc_subscrb_rcv_cb;
  334. topsrv->tipc_conn_new = tipc_subscrb_connect_cb;
  335. topsrv->tipc_conn_release = tipc_subscrb_release_cb;
  336. strncpy(topsrv->name, name, strlen(name) + 1);
  337. tn->topsrv = topsrv;
  338. atomic_set(&tn->subscription_count, 0);
  339. return tipc_server_start(topsrv);
  340. }
  341. void tipc_topsrv_stop(struct net *net)
  342. {
  343. struct tipc_net *tn = net_generic(net, tipc_net_id);
  344. struct tipc_server *topsrv = tn->topsrv;
  345. tipc_server_stop(topsrv);
  346. kfree(topsrv->saddr);
  347. kfree(topsrv);
  348. }