af_rds.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640
  1. /*
  2. * Copyright (c) 2006 Oracle. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. */
  33. #include <linux/module.h>
  34. #include <linux/errno.h>
  35. #include <linux/kernel.h>
  36. #include <linux/gfp.h>
  37. #include <linux/in.h>
  38. #include <linux/poll.h>
  39. #include <net/sock.h>
  40. #include "rds.h"
  41. /* this is just used for stats gathering :/ */
  42. static DEFINE_SPINLOCK(rds_sock_lock);
  43. static unsigned long rds_sock_count;
  44. static LIST_HEAD(rds_sock_list);
  45. DECLARE_WAIT_QUEUE_HEAD(rds_poll_waitq);
  46. /*
  47. * This is called as the final descriptor referencing this socket is closed.
  48. * We have to unbind the socket so that another socket can be bound to the
  49. * address it was using.
  50. *
  51. * We have to be careful about racing with the incoming path. sock_orphan()
  52. * sets SOCK_DEAD and we use that as an indicator to the rx path that new
  53. * messages shouldn't be queued.
  54. */
  55. static int rds_release(struct socket *sock)
  56. {
  57. struct sock *sk = sock->sk;
  58. struct rds_sock *rs;
  59. if (!sk)
  60. goto out;
  61. rs = rds_sk_to_rs(sk);
  62. sock_orphan(sk);
  63. /* Note - rds_clear_recv_queue grabs rs_recv_lock, so
  64. * that ensures the recv path has completed messing
  65. * with the socket. */
  66. rds_clear_recv_queue(rs);
  67. rds_cong_remove_socket(rs);
  68. /*
  69. * the binding lookup hash uses rcu, we need to
  70. * make sure we synchronize_rcu before we free our
  71. * entry
  72. */
  73. rds_remove_bound(rs);
  74. synchronize_rcu();
  75. rds_send_drop_to(rs, NULL);
  76. rds_rdma_drop_keys(rs);
  77. rds_notify_queue_get(rs, NULL);
  78. spin_lock_bh(&rds_sock_lock);
  79. list_del_init(&rs->rs_item);
  80. rds_sock_count--;
  81. spin_unlock_bh(&rds_sock_lock);
  82. rds_trans_put(rs->rs_transport);
  83. sock->sk = NULL;
  84. sock_put(sk);
  85. out:
  86. return 0;
  87. }
  88. /*
  89. * Careful not to race with rds_release -> sock_orphan which clears sk_sleep.
  90. * _bh() isn't OK here, we're called from interrupt handlers. It's probably OK
  91. * to wake the waitqueue after sk_sleep is clear as we hold a sock ref, but
  92. * this seems more conservative.
  93. * NB - normally, one would use sk_callback_lock for this, but we can
  94. * get here from interrupts, whereas the network code grabs sk_callback_lock
  95. * with _lock_bh only - so relying on sk_callback_lock introduces livelocks.
  96. */
  97. void rds_wake_sk_sleep(struct rds_sock *rs)
  98. {
  99. unsigned long flags;
  100. read_lock_irqsave(&rs->rs_recv_lock, flags);
  101. __rds_wake_sk_sleep(rds_rs_to_sk(rs));
  102. read_unlock_irqrestore(&rs->rs_recv_lock, flags);
  103. }
  104. static int rds_getname(struct socket *sock, struct sockaddr *uaddr,
  105. int *uaddr_len, int peer)
  106. {
  107. struct sockaddr_in *sin = (struct sockaddr_in *)uaddr;
  108. struct rds_sock *rs = rds_sk_to_rs(sock->sk);
  109. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  110. /* racey, don't care */
  111. if (peer) {
  112. if (!rs->rs_conn_addr)
  113. return -ENOTCONN;
  114. sin->sin_port = rs->rs_conn_port;
  115. sin->sin_addr.s_addr = rs->rs_conn_addr;
  116. } else {
  117. sin->sin_port = rs->rs_bound_port;
  118. sin->sin_addr.s_addr = rs->rs_bound_addr;
  119. }
  120. sin->sin_family = AF_INET;
  121. *uaddr_len = sizeof(*sin);
  122. return 0;
  123. }
  124. /*
  125. * RDS' poll is without a doubt the least intuitive part of the interface,
  126. * as POLLIN and POLLOUT do not behave entirely as you would expect from
  127. * a network protocol.
  128. *
  129. * POLLIN is asserted if
  130. * - there is data on the receive queue.
  131. * - to signal that a previously congested destination may have become
  132. * uncongested
  133. * - A notification has been queued to the socket (this can be a congestion
  134. * update, or a RDMA completion).
  135. *
  136. * POLLOUT is asserted if there is room on the send queue. This does not mean
  137. * however, that the next sendmsg() call will succeed. If the application tries
  138. * to send to a congested destination, the system call may still fail (and
  139. * return ENOBUFS).
  140. */
  141. static unsigned int rds_poll(struct file *file, struct socket *sock,
  142. poll_table *wait)
  143. {
  144. struct sock *sk = sock->sk;
  145. struct rds_sock *rs = rds_sk_to_rs(sk);
  146. unsigned int mask = 0;
  147. unsigned long flags;
  148. poll_wait(file, sk_sleep(sk), wait);
  149. if (rs->rs_seen_congestion)
  150. poll_wait(file, &rds_poll_waitq, wait);
  151. read_lock_irqsave(&rs->rs_recv_lock, flags);
  152. if (!rs->rs_cong_monitor) {
  153. /* When a congestion map was updated, we signal POLLIN for
  154. * "historical" reasons. Applications can also poll for
  155. * WRBAND instead. */
  156. if (rds_cong_updated_since(&rs->rs_cong_track))
  157. mask |= (POLLIN | POLLRDNORM | POLLWRBAND);
  158. } else {
  159. spin_lock(&rs->rs_lock);
  160. if (rs->rs_cong_notify)
  161. mask |= (POLLIN | POLLRDNORM);
  162. spin_unlock(&rs->rs_lock);
  163. }
  164. if (!list_empty(&rs->rs_recv_queue) ||
  165. !list_empty(&rs->rs_notify_queue))
  166. mask |= (POLLIN | POLLRDNORM);
  167. if (rs->rs_snd_bytes < rds_sk_sndbuf(rs))
  168. mask |= (POLLOUT | POLLWRNORM);
  169. read_unlock_irqrestore(&rs->rs_recv_lock, flags);
  170. /* clear state any time we wake a seen-congested socket */
  171. if (mask)
  172. rs->rs_seen_congestion = 0;
  173. return mask;
  174. }
  175. static int rds_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
  176. {
  177. return -ENOIOCTLCMD;
  178. }
  179. static int rds_cancel_sent_to(struct rds_sock *rs, char __user *optval,
  180. int len)
  181. {
  182. struct sockaddr_in sin;
  183. int ret = 0;
  184. /* racing with another thread binding seems ok here */
  185. if (rs->rs_bound_addr == 0) {
  186. ret = -ENOTCONN; /* XXX not a great errno */
  187. goto out;
  188. }
  189. if (len < sizeof(struct sockaddr_in)) {
  190. ret = -EINVAL;
  191. goto out;
  192. }
  193. if (copy_from_user(&sin, optval, sizeof(sin))) {
  194. ret = -EFAULT;
  195. goto out;
  196. }
  197. rds_send_drop_to(rs, &sin);
  198. out:
  199. return ret;
  200. }
  201. static int rds_set_bool_option(unsigned char *optvar, char __user *optval,
  202. int optlen)
  203. {
  204. int value;
  205. if (optlen < sizeof(int))
  206. return -EINVAL;
  207. if (get_user(value, (int __user *) optval))
  208. return -EFAULT;
  209. *optvar = !!value;
  210. return 0;
  211. }
  212. static int rds_cong_monitor(struct rds_sock *rs, char __user *optval,
  213. int optlen)
  214. {
  215. int ret;
  216. ret = rds_set_bool_option(&rs->rs_cong_monitor, optval, optlen);
  217. if (ret == 0) {
  218. if (rs->rs_cong_monitor) {
  219. rds_cong_add_socket(rs);
  220. } else {
  221. rds_cong_remove_socket(rs);
  222. rs->rs_cong_mask = 0;
  223. rs->rs_cong_notify = 0;
  224. }
  225. }
  226. return ret;
  227. }
  228. static int rds_set_transport(struct rds_sock *rs, char __user *optval,
  229. int optlen)
  230. {
  231. int t_type;
  232. if (rs->rs_transport)
  233. return -EOPNOTSUPP; /* previously attached to transport */
  234. if (optlen != sizeof(int))
  235. return -EINVAL;
  236. if (copy_from_user(&t_type, (int __user *)optval, sizeof(t_type)))
  237. return -EFAULT;
  238. if (t_type < 0 || t_type >= RDS_TRANS_COUNT)
  239. return -EINVAL;
  240. rs->rs_transport = rds_trans_get(t_type);
  241. return rs->rs_transport ? 0 : -ENOPROTOOPT;
  242. }
  243. static int rds_setsockopt(struct socket *sock, int level, int optname,
  244. char __user *optval, unsigned int optlen)
  245. {
  246. struct rds_sock *rs = rds_sk_to_rs(sock->sk);
  247. int ret;
  248. if (level != SOL_RDS) {
  249. ret = -ENOPROTOOPT;
  250. goto out;
  251. }
  252. switch (optname) {
  253. case RDS_CANCEL_SENT_TO:
  254. ret = rds_cancel_sent_to(rs, optval, optlen);
  255. break;
  256. case RDS_GET_MR:
  257. ret = rds_get_mr(rs, optval, optlen);
  258. break;
  259. case RDS_GET_MR_FOR_DEST:
  260. ret = rds_get_mr_for_dest(rs, optval, optlen);
  261. break;
  262. case RDS_FREE_MR:
  263. ret = rds_free_mr(rs, optval, optlen);
  264. break;
  265. case RDS_RECVERR:
  266. ret = rds_set_bool_option(&rs->rs_recverr, optval, optlen);
  267. break;
  268. case RDS_CONG_MONITOR:
  269. ret = rds_cong_monitor(rs, optval, optlen);
  270. break;
  271. case SO_RDS_TRANSPORT:
  272. lock_sock(sock->sk);
  273. ret = rds_set_transport(rs, optval, optlen);
  274. release_sock(sock->sk);
  275. break;
  276. default:
  277. ret = -ENOPROTOOPT;
  278. }
  279. out:
  280. return ret;
  281. }
  282. static int rds_getsockopt(struct socket *sock, int level, int optname,
  283. char __user *optval, int __user *optlen)
  284. {
  285. struct rds_sock *rs = rds_sk_to_rs(sock->sk);
  286. int ret = -ENOPROTOOPT, len;
  287. int trans;
  288. if (level != SOL_RDS)
  289. goto out;
  290. if (get_user(len, optlen)) {
  291. ret = -EFAULT;
  292. goto out;
  293. }
  294. switch (optname) {
  295. case RDS_INFO_FIRST ... RDS_INFO_LAST:
  296. ret = rds_info_getsockopt(sock, optname, optval,
  297. optlen);
  298. break;
  299. case RDS_RECVERR:
  300. if (len < sizeof(int))
  301. ret = -EINVAL;
  302. else
  303. if (put_user(rs->rs_recverr, (int __user *) optval) ||
  304. put_user(sizeof(int), optlen))
  305. ret = -EFAULT;
  306. else
  307. ret = 0;
  308. break;
  309. case SO_RDS_TRANSPORT:
  310. if (len < sizeof(int)) {
  311. ret = -EINVAL;
  312. break;
  313. }
  314. trans = (rs->rs_transport ? rs->rs_transport->t_type :
  315. RDS_TRANS_NONE); /* unbound */
  316. if (put_user(trans, (int __user *)optval) ||
  317. put_user(sizeof(int), optlen))
  318. ret = -EFAULT;
  319. else
  320. ret = 0;
  321. break;
  322. default:
  323. break;
  324. }
  325. out:
  326. return ret;
  327. }
  328. static int rds_connect(struct socket *sock, struct sockaddr *uaddr,
  329. int addr_len, int flags)
  330. {
  331. struct sock *sk = sock->sk;
  332. struct sockaddr_in *sin = (struct sockaddr_in *)uaddr;
  333. struct rds_sock *rs = rds_sk_to_rs(sk);
  334. int ret = 0;
  335. lock_sock(sk);
  336. if (addr_len != sizeof(struct sockaddr_in)) {
  337. ret = -EINVAL;
  338. goto out;
  339. }
  340. if (sin->sin_family != AF_INET) {
  341. ret = -EAFNOSUPPORT;
  342. goto out;
  343. }
  344. if (sin->sin_addr.s_addr == htonl(INADDR_ANY)) {
  345. ret = -EDESTADDRREQ;
  346. goto out;
  347. }
  348. rs->rs_conn_addr = sin->sin_addr.s_addr;
  349. rs->rs_conn_port = sin->sin_port;
  350. out:
  351. release_sock(sk);
  352. return ret;
  353. }
  354. static struct proto rds_proto = {
  355. .name = "RDS",
  356. .owner = THIS_MODULE,
  357. .obj_size = sizeof(struct rds_sock),
  358. };
  359. static const struct proto_ops rds_proto_ops = {
  360. .family = AF_RDS,
  361. .owner = THIS_MODULE,
  362. .release = rds_release,
  363. .bind = rds_bind,
  364. .connect = rds_connect,
  365. .socketpair = sock_no_socketpair,
  366. .accept = sock_no_accept,
  367. .getname = rds_getname,
  368. .poll = rds_poll,
  369. .ioctl = rds_ioctl,
  370. .listen = sock_no_listen,
  371. .shutdown = sock_no_shutdown,
  372. .setsockopt = rds_setsockopt,
  373. .getsockopt = rds_getsockopt,
  374. .sendmsg = rds_sendmsg,
  375. .recvmsg = rds_recvmsg,
  376. .mmap = sock_no_mmap,
  377. .sendpage = sock_no_sendpage,
  378. };
  379. static void rds_sock_destruct(struct sock *sk)
  380. {
  381. struct rds_sock *rs = rds_sk_to_rs(sk);
  382. WARN_ON((&rs->rs_item != rs->rs_item.next ||
  383. &rs->rs_item != rs->rs_item.prev));
  384. }
  385. static int __rds_create(struct socket *sock, struct sock *sk, int protocol)
  386. {
  387. struct rds_sock *rs;
  388. sock_init_data(sock, sk);
  389. sock->ops = &rds_proto_ops;
  390. sk->sk_protocol = protocol;
  391. sk->sk_destruct = rds_sock_destruct;
  392. rs = rds_sk_to_rs(sk);
  393. spin_lock_init(&rs->rs_lock);
  394. rwlock_init(&rs->rs_recv_lock);
  395. INIT_LIST_HEAD(&rs->rs_send_queue);
  396. INIT_LIST_HEAD(&rs->rs_recv_queue);
  397. INIT_LIST_HEAD(&rs->rs_notify_queue);
  398. INIT_LIST_HEAD(&rs->rs_cong_list);
  399. spin_lock_init(&rs->rs_rdma_lock);
  400. rs->rs_rdma_keys = RB_ROOT;
  401. spin_lock_bh(&rds_sock_lock);
  402. list_add_tail(&rs->rs_item, &rds_sock_list);
  403. rds_sock_count++;
  404. spin_unlock_bh(&rds_sock_lock);
  405. return 0;
  406. }
  407. static int rds_create(struct net *net, struct socket *sock, int protocol,
  408. int kern)
  409. {
  410. struct sock *sk;
  411. if (sock->type != SOCK_SEQPACKET || protocol)
  412. return -ESOCKTNOSUPPORT;
  413. sk = sk_alloc(net, AF_RDS, GFP_ATOMIC, &rds_proto, kern);
  414. if (!sk)
  415. return -ENOMEM;
  416. return __rds_create(sock, sk, protocol);
  417. }
  418. void rds_sock_addref(struct rds_sock *rs)
  419. {
  420. sock_hold(rds_rs_to_sk(rs));
  421. }
  422. void rds_sock_put(struct rds_sock *rs)
  423. {
  424. sock_put(rds_rs_to_sk(rs));
  425. }
  426. static const struct net_proto_family rds_family_ops = {
  427. .family = AF_RDS,
  428. .create = rds_create,
  429. .owner = THIS_MODULE,
  430. };
  431. static void rds_sock_inc_info(struct socket *sock, unsigned int len,
  432. struct rds_info_iterator *iter,
  433. struct rds_info_lengths *lens)
  434. {
  435. struct rds_sock *rs;
  436. struct rds_incoming *inc;
  437. unsigned int total = 0;
  438. len /= sizeof(struct rds_info_message);
  439. spin_lock_bh(&rds_sock_lock);
  440. list_for_each_entry(rs, &rds_sock_list, rs_item) {
  441. read_lock(&rs->rs_recv_lock);
  442. /* XXX too lazy to maintain counts.. */
  443. list_for_each_entry(inc, &rs->rs_recv_queue, i_item) {
  444. total++;
  445. if (total <= len)
  446. rds_inc_info_copy(inc, iter, inc->i_saddr,
  447. rs->rs_bound_addr, 1);
  448. }
  449. read_unlock(&rs->rs_recv_lock);
  450. }
  451. spin_unlock_bh(&rds_sock_lock);
  452. lens->nr = total;
  453. lens->each = sizeof(struct rds_info_message);
  454. }
  455. static void rds_sock_info(struct socket *sock, unsigned int len,
  456. struct rds_info_iterator *iter,
  457. struct rds_info_lengths *lens)
  458. {
  459. struct rds_info_socket sinfo;
  460. struct rds_sock *rs;
  461. len /= sizeof(struct rds_info_socket);
  462. spin_lock_bh(&rds_sock_lock);
  463. if (len < rds_sock_count)
  464. goto out;
  465. list_for_each_entry(rs, &rds_sock_list, rs_item) {
  466. sinfo.sndbuf = rds_sk_sndbuf(rs);
  467. sinfo.rcvbuf = rds_sk_rcvbuf(rs);
  468. sinfo.bound_addr = rs->rs_bound_addr;
  469. sinfo.connected_addr = rs->rs_conn_addr;
  470. sinfo.bound_port = rs->rs_bound_port;
  471. sinfo.connected_port = rs->rs_conn_port;
  472. sinfo.inum = sock_i_ino(rds_rs_to_sk(rs));
  473. rds_info_copy(iter, &sinfo, sizeof(sinfo));
  474. }
  475. out:
  476. lens->nr = rds_sock_count;
  477. lens->each = sizeof(struct rds_info_socket);
  478. spin_unlock_bh(&rds_sock_lock);
  479. }
  480. static void rds_exit(void)
  481. {
  482. sock_unregister(rds_family_ops.family);
  483. proto_unregister(&rds_proto);
  484. rds_conn_exit();
  485. rds_cong_exit();
  486. rds_sysctl_exit();
  487. rds_threads_exit();
  488. rds_stats_exit();
  489. rds_page_exit();
  490. rds_info_deregister_func(RDS_INFO_SOCKETS, rds_sock_info);
  491. rds_info_deregister_func(RDS_INFO_RECV_MESSAGES, rds_sock_inc_info);
  492. }
  493. module_exit(rds_exit);
  494. static int rds_init(void)
  495. {
  496. int ret;
  497. ret = rds_conn_init();
  498. if (ret)
  499. goto out;
  500. ret = rds_threads_init();
  501. if (ret)
  502. goto out_conn;
  503. ret = rds_sysctl_init();
  504. if (ret)
  505. goto out_threads;
  506. ret = rds_stats_init();
  507. if (ret)
  508. goto out_sysctl;
  509. ret = proto_register(&rds_proto, 1);
  510. if (ret)
  511. goto out_stats;
  512. ret = sock_register(&rds_family_ops);
  513. if (ret)
  514. goto out_proto;
  515. rds_info_register_func(RDS_INFO_SOCKETS, rds_sock_info);
  516. rds_info_register_func(RDS_INFO_RECV_MESSAGES, rds_sock_inc_info);
  517. goto out;
  518. out_proto:
  519. proto_unregister(&rds_proto);
  520. out_stats:
  521. rds_stats_exit();
  522. out_sysctl:
  523. rds_sysctl_exit();
  524. out_threads:
  525. rds_threads_exit();
  526. out_conn:
  527. rds_conn_exit();
  528. rds_cong_exit();
  529. rds_page_exit();
  530. out:
  531. return ret;
  532. }
  533. module_init(rds_init);
  534. #define DRV_VERSION "4.0"
  535. #define DRV_RELDATE "Feb 12, 2009"
  536. MODULE_AUTHOR("Oracle Corporation <rds-devel@oss.oracle.com>");
  537. MODULE_DESCRIPTION("RDS: Reliable Datagram Sockets"
  538. " v" DRV_VERSION " (" DRV_RELDATE ")");
  539. MODULE_VERSION(DRV_VERSION);
  540. MODULE_LICENSE("Dual BSD/GPL");
  541. MODULE_ALIAS_NETPROTO(PF_RDS);