message.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  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/kernel.h>
  34. #include <linux/slab.h>
  35. #include <linux/export.h>
  36. #include <linux/skbuff.h>
  37. #include <linux/list.h>
  38. #include <linux/errqueue.h>
  39. #include "rds.h"
  40. static unsigned int rds_exthdr_size[__RDS_EXTHDR_MAX] = {
  41. [RDS_EXTHDR_NONE] = 0,
  42. [RDS_EXTHDR_VERSION] = sizeof(struct rds_ext_header_version),
  43. [RDS_EXTHDR_RDMA] = sizeof(struct rds_ext_header_rdma),
  44. [RDS_EXTHDR_RDMA_DEST] = sizeof(struct rds_ext_header_rdma_dest),
  45. [RDS_EXTHDR_NPATHS] = sizeof(u16),
  46. [RDS_EXTHDR_GEN_NUM] = sizeof(u32),
  47. };
  48. void rds_message_addref(struct rds_message *rm)
  49. {
  50. rdsdebug("addref rm %p ref %d\n", rm, refcount_read(&rm->m_refcount));
  51. refcount_inc(&rm->m_refcount);
  52. }
  53. EXPORT_SYMBOL_GPL(rds_message_addref);
  54. static inline bool skb_zcookie_add(struct sk_buff *skb, u32 cookie)
  55. {
  56. struct sock_exterr_skb *serr = SKB_EXT_ERR(skb);
  57. int ncookies;
  58. u32 *ptr;
  59. if (serr->ee.ee_origin != SO_EE_ORIGIN_ZCOOKIE)
  60. return false;
  61. ncookies = serr->ee.ee_data;
  62. if (ncookies == SO_EE_ORIGIN_MAX_ZCOOKIES)
  63. return false;
  64. ptr = skb_put(skb, sizeof(u32));
  65. *ptr = cookie;
  66. serr->ee.ee_data = ++ncookies;
  67. return true;
  68. }
  69. static void rds_rm_zerocopy_callback(struct rds_sock *rs,
  70. struct rds_znotifier *znotif)
  71. {
  72. struct sock *sk = rds_rs_to_sk(rs);
  73. struct sk_buff *skb, *tail;
  74. struct sock_exterr_skb *serr;
  75. unsigned long flags;
  76. struct sk_buff_head *q;
  77. u32 cookie = znotif->z_cookie;
  78. q = &sk->sk_error_queue;
  79. spin_lock_irqsave(&q->lock, flags);
  80. tail = skb_peek_tail(q);
  81. if (tail && skb_zcookie_add(tail, cookie)) {
  82. spin_unlock_irqrestore(&q->lock, flags);
  83. mm_unaccount_pinned_pages(&znotif->z_mmp);
  84. consume_skb(rds_skb_from_znotifier(znotif));
  85. sk->sk_error_report(sk);
  86. return;
  87. }
  88. skb = rds_skb_from_znotifier(znotif);
  89. serr = SKB_EXT_ERR(skb);
  90. memset(&serr->ee, 0, sizeof(serr->ee));
  91. serr->ee.ee_errno = 0;
  92. serr->ee.ee_origin = SO_EE_ORIGIN_ZCOOKIE;
  93. serr->ee.ee_info = 0;
  94. WARN_ON(!skb_zcookie_add(skb, cookie));
  95. __skb_queue_tail(q, skb);
  96. spin_unlock_irqrestore(&q->lock, flags);
  97. sk->sk_error_report(sk);
  98. mm_unaccount_pinned_pages(&znotif->z_mmp);
  99. }
  100. /*
  101. * This relies on dma_map_sg() not touching sg[].page during merging.
  102. */
  103. static void rds_message_purge(struct rds_message *rm)
  104. {
  105. unsigned long i, flags;
  106. bool zcopy = false;
  107. if (unlikely(test_bit(RDS_MSG_PAGEVEC, &rm->m_flags)))
  108. return;
  109. spin_lock_irqsave(&rm->m_rs_lock, flags);
  110. if (rm->m_rs) {
  111. struct rds_sock *rs = rm->m_rs;
  112. if (rm->data.op_mmp_znotifier) {
  113. zcopy = true;
  114. rds_rm_zerocopy_callback(rs, rm->data.op_mmp_znotifier);
  115. rm->data.op_mmp_znotifier = NULL;
  116. }
  117. sock_put(rds_rs_to_sk(rs));
  118. rm->m_rs = NULL;
  119. }
  120. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  121. for (i = 0; i < rm->data.op_nents; i++) {
  122. /* XXX will have to put_page for page refs */
  123. if (!zcopy)
  124. __free_page(sg_page(&rm->data.op_sg[i]));
  125. else
  126. put_page(sg_page(&rm->data.op_sg[i]));
  127. }
  128. rm->data.op_nents = 0;
  129. if (rm->rdma.op_active)
  130. rds_rdma_free_op(&rm->rdma);
  131. if (rm->rdma.op_rdma_mr)
  132. rds_mr_put(rm->rdma.op_rdma_mr);
  133. if (rm->atomic.op_active)
  134. rds_atomic_free_op(&rm->atomic);
  135. if (rm->atomic.op_rdma_mr)
  136. rds_mr_put(rm->atomic.op_rdma_mr);
  137. }
  138. void rds_message_put(struct rds_message *rm)
  139. {
  140. rdsdebug("put rm %p ref %d\n", rm, refcount_read(&rm->m_refcount));
  141. WARN(!refcount_read(&rm->m_refcount), "danger refcount zero on %p\n", rm);
  142. if (refcount_dec_and_test(&rm->m_refcount)) {
  143. BUG_ON(!list_empty(&rm->m_sock_item));
  144. BUG_ON(!list_empty(&rm->m_conn_item));
  145. rds_message_purge(rm);
  146. kfree(rm);
  147. }
  148. }
  149. EXPORT_SYMBOL_GPL(rds_message_put);
  150. void rds_message_populate_header(struct rds_header *hdr, __be16 sport,
  151. __be16 dport, u64 seq)
  152. {
  153. hdr->h_flags = 0;
  154. hdr->h_sport = sport;
  155. hdr->h_dport = dport;
  156. hdr->h_sequence = cpu_to_be64(seq);
  157. hdr->h_exthdr[0] = RDS_EXTHDR_NONE;
  158. }
  159. EXPORT_SYMBOL_GPL(rds_message_populate_header);
  160. int rds_message_add_extension(struct rds_header *hdr, unsigned int type,
  161. const void *data, unsigned int len)
  162. {
  163. unsigned int ext_len = sizeof(u8) + len;
  164. unsigned char *dst;
  165. /* For now, refuse to add more than one extension header */
  166. if (hdr->h_exthdr[0] != RDS_EXTHDR_NONE)
  167. return 0;
  168. if (type >= __RDS_EXTHDR_MAX || len != rds_exthdr_size[type])
  169. return 0;
  170. if (ext_len >= RDS_HEADER_EXT_SPACE)
  171. return 0;
  172. dst = hdr->h_exthdr;
  173. *dst++ = type;
  174. memcpy(dst, data, len);
  175. dst[len] = RDS_EXTHDR_NONE;
  176. return 1;
  177. }
  178. EXPORT_SYMBOL_GPL(rds_message_add_extension);
  179. /*
  180. * If a message has extension headers, retrieve them here.
  181. * Call like this:
  182. *
  183. * unsigned int pos = 0;
  184. *
  185. * while (1) {
  186. * buflen = sizeof(buffer);
  187. * type = rds_message_next_extension(hdr, &pos, buffer, &buflen);
  188. * if (type == RDS_EXTHDR_NONE)
  189. * break;
  190. * ...
  191. * }
  192. */
  193. int rds_message_next_extension(struct rds_header *hdr,
  194. unsigned int *pos, void *buf, unsigned int *buflen)
  195. {
  196. unsigned int offset, ext_type, ext_len;
  197. u8 *src = hdr->h_exthdr;
  198. offset = *pos;
  199. if (offset >= RDS_HEADER_EXT_SPACE)
  200. goto none;
  201. /* Get the extension type and length. For now, the
  202. * length is implied by the extension type. */
  203. ext_type = src[offset++];
  204. if (ext_type == RDS_EXTHDR_NONE || ext_type >= __RDS_EXTHDR_MAX)
  205. goto none;
  206. ext_len = rds_exthdr_size[ext_type];
  207. if (offset + ext_len > RDS_HEADER_EXT_SPACE)
  208. goto none;
  209. *pos = offset + ext_len;
  210. if (ext_len < *buflen)
  211. *buflen = ext_len;
  212. memcpy(buf, src + offset, *buflen);
  213. return ext_type;
  214. none:
  215. *pos = RDS_HEADER_EXT_SPACE;
  216. *buflen = 0;
  217. return RDS_EXTHDR_NONE;
  218. }
  219. int rds_message_add_rdma_dest_extension(struct rds_header *hdr, u32 r_key, u32 offset)
  220. {
  221. struct rds_ext_header_rdma_dest ext_hdr;
  222. ext_hdr.h_rdma_rkey = cpu_to_be32(r_key);
  223. ext_hdr.h_rdma_offset = cpu_to_be32(offset);
  224. return rds_message_add_extension(hdr, RDS_EXTHDR_RDMA_DEST, &ext_hdr, sizeof(ext_hdr));
  225. }
  226. EXPORT_SYMBOL_GPL(rds_message_add_rdma_dest_extension);
  227. /*
  228. * Each rds_message is allocated with extra space for the scatterlist entries
  229. * rds ops will need. This is to minimize memory allocation count. Then, each rds op
  230. * can grab SGs when initializing its part of the rds_message.
  231. */
  232. struct rds_message *rds_message_alloc(unsigned int extra_len, gfp_t gfp)
  233. {
  234. struct rds_message *rm;
  235. if (extra_len > KMALLOC_MAX_SIZE - sizeof(struct rds_message))
  236. return NULL;
  237. rm = kzalloc(sizeof(struct rds_message) + extra_len, gfp);
  238. if (!rm)
  239. goto out;
  240. rm->m_used_sgs = 0;
  241. rm->m_total_sgs = extra_len / sizeof(struct scatterlist);
  242. refcount_set(&rm->m_refcount, 1);
  243. INIT_LIST_HEAD(&rm->m_sock_item);
  244. INIT_LIST_HEAD(&rm->m_conn_item);
  245. spin_lock_init(&rm->m_rs_lock);
  246. init_waitqueue_head(&rm->m_flush_wait);
  247. out:
  248. return rm;
  249. }
  250. /*
  251. * RDS ops use this to grab SG entries from the rm's sg pool.
  252. */
  253. struct scatterlist *rds_message_alloc_sgs(struct rds_message *rm, int nents)
  254. {
  255. struct scatterlist *sg_first = (struct scatterlist *) &rm[1];
  256. struct scatterlist *sg_ret;
  257. WARN_ON(rm->m_used_sgs + nents > rm->m_total_sgs);
  258. WARN_ON(!nents);
  259. if (rm->m_used_sgs + nents > rm->m_total_sgs)
  260. return NULL;
  261. sg_ret = &sg_first[rm->m_used_sgs];
  262. sg_init_table(sg_ret, nents);
  263. rm->m_used_sgs += nents;
  264. return sg_ret;
  265. }
  266. struct rds_message *rds_message_map_pages(unsigned long *page_addrs, unsigned int total_len)
  267. {
  268. struct rds_message *rm;
  269. unsigned int i;
  270. int num_sgs = ceil(total_len, PAGE_SIZE);
  271. int extra_bytes = num_sgs * sizeof(struct scatterlist);
  272. rm = rds_message_alloc(extra_bytes, GFP_NOWAIT);
  273. if (!rm)
  274. return ERR_PTR(-ENOMEM);
  275. set_bit(RDS_MSG_PAGEVEC, &rm->m_flags);
  276. rm->m_inc.i_hdr.h_len = cpu_to_be32(total_len);
  277. rm->data.op_nents = ceil(total_len, PAGE_SIZE);
  278. rm->data.op_sg = rds_message_alloc_sgs(rm, num_sgs);
  279. if (!rm->data.op_sg) {
  280. rds_message_put(rm);
  281. return ERR_PTR(-ENOMEM);
  282. }
  283. for (i = 0; i < rm->data.op_nents; ++i) {
  284. sg_set_page(&rm->data.op_sg[i],
  285. virt_to_page(page_addrs[i]),
  286. PAGE_SIZE, 0);
  287. }
  288. return rm;
  289. }
  290. int rds_message_copy_from_user(struct rds_message *rm, struct iov_iter *from,
  291. bool zcopy)
  292. {
  293. unsigned long to_copy, nbytes;
  294. unsigned long sg_off;
  295. struct scatterlist *sg;
  296. int ret = 0;
  297. int length = iov_iter_count(from);
  298. rm->m_inc.i_hdr.h_len = cpu_to_be32(iov_iter_count(from));
  299. /*
  300. * now allocate and copy in the data payload.
  301. */
  302. sg = rm->data.op_sg;
  303. sg_off = 0; /* Dear gcc, sg->page will be null from kzalloc. */
  304. if (zcopy) {
  305. int total_copied = 0;
  306. struct sk_buff *skb;
  307. skb = alloc_skb(SO_EE_ORIGIN_MAX_ZCOOKIES * sizeof(u32),
  308. GFP_KERNEL);
  309. if (!skb)
  310. return -ENOMEM;
  311. rm->data.op_mmp_znotifier = RDS_ZCOPY_SKB(skb);
  312. if (mm_account_pinned_pages(&rm->data.op_mmp_znotifier->z_mmp,
  313. length)) {
  314. ret = -ENOMEM;
  315. goto err;
  316. }
  317. while (iov_iter_count(from)) {
  318. struct page *pages;
  319. size_t start;
  320. ssize_t copied;
  321. copied = iov_iter_get_pages(from, &pages, PAGE_SIZE,
  322. 1, &start);
  323. if (copied < 0) {
  324. struct mmpin *mmp;
  325. int i;
  326. for (i = 0; i < rm->data.op_nents; i++)
  327. put_page(sg_page(&rm->data.op_sg[i]));
  328. mmp = &rm->data.op_mmp_znotifier->z_mmp;
  329. mm_unaccount_pinned_pages(mmp);
  330. ret = -EFAULT;
  331. goto err;
  332. }
  333. total_copied += copied;
  334. iov_iter_advance(from, copied);
  335. length -= copied;
  336. sg_set_page(sg, pages, copied, start);
  337. rm->data.op_nents++;
  338. sg++;
  339. }
  340. WARN_ON_ONCE(length != 0);
  341. return ret;
  342. err:
  343. consume_skb(skb);
  344. rm->data.op_mmp_znotifier = NULL;
  345. return ret;
  346. } /* zcopy */
  347. while (iov_iter_count(from)) {
  348. if (!sg_page(sg)) {
  349. ret = rds_page_remainder_alloc(sg, iov_iter_count(from),
  350. GFP_HIGHUSER);
  351. if (ret)
  352. return ret;
  353. rm->data.op_nents++;
  354. sg_off = 0;
  355. }
  356. to_copy = min_t(unsigned long, iov_iter_count(from),
  357. sg->length - sg_off);
  358. rds_stats_add(s_copy_from_user, to_copy);
  359. nbytes = copy_page_from_iter(sg_page(sg), sg->offset + sg_off,
  360. to_copy, from);
  361. if (nbytes != to_copy)
  362. return -EFAULT;
  363. sg_off += to_copy;
  364. if (sg_off == sg->length)
  365. sg++;
  366. }
  367. return ret;
  368. }
  369. int rds_message_inc_copy_to_user(struct rds_incoming *inc, struct iov_iter *to)
  370. {
  371. struct rds_message *rm;
  372. struct scatterlist *sg;
  373. unsigned long to_copy;
  374. unsigned long vec_off;
  375. int copied;
  376. int ret;
  377. u32 len;
  378. rm = container_of(inc, struct rds_message, m_inc);
  379. len = be32_to_cpu(rm->m_inc.i_hdr.h_len);
  380. sg = rm->data.op_sg;
  381. vec_off = 0;
  382. copied = 0;
  383. while (iov_iter_count(to) && copied < len) {
  384. to_copy = min_t(unsigned long, iov_iter_count(to),
  385. sg->length - vec_off);
  386. to_copy = min_t(unsigned long, to_copy, len - copied);
  387. rds_stats_add(s_copy_to_user, to_copy);
  388. ret = copy_page_to_iter(sg_page(sg), sg->offset + vec_off,
  389. to_copy, to);
  390. if (ret != to_copy)
  391. return -EFAULT;
  392. vec_off += to_copy;
  393. copied += to_copy;
  394. if (vec_off == sg->length) {
  395. vec_off = 0;
  396. sg++;
  397. }
  398. }
  399. return copied;
  400. }
  401. /*
  402. * If the message is still on the send queue, wait until the transport
  403. * is done with it. This is particularly important for RDMA operations.
  404. */
  405. void rds_message_wait(struct rds_message *rm)
  406. {
  407. wait_event_interruptible(rm->m_flush_wait,
  408. !test_bit(RDS_MSG_MAPPED, &rm->m_flags));
  409. }
  410. void rds_message_unmapped(struct rds_message *rm)
  411. {
  412. clear_bit(RDS_MSG_MAPPED, &rm->m_flags);
  413. wake_up_interruptible(&rm->m_flush_wait);
  414. }
  415. EXPORT_SYMBOL_GPL(rds_message_unmapped);