message.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  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 "rds.h"
  36. static DECLARE_WAIT_QUEUE_HEAD(rds_message_flush_waitq);
  37. static unsigned int rds_exthdr_size[__RDS_EXTHDR_MAX] = {
  38. [RDS_EXTHDR_NONE] = 0,
  39. [RDS_EXTHDR_VERSION] = sizeof(struct rds_ext_header_version),
  40. [RDS_EXTHDR_RDMA] = sizeof(struct rds_ext_header_rdma),
  41. [RDS_EXTHDR_RDMA_DEST] = sizeof(struct rds_ext_header_rdma_dest),
  42. };
  43. void rds_message_addref(struct rds_message *rm)
  44. {
  45. rdsdebug("addref rm %p ref %d\n", rm, atomic_read(&rm->m_refcount));
  46. atomic_inc(&rm->m_refcount);
  47. }
  48. EXPORT_SYMBOL_GPL(rds_message_addref);
  49. /*
  50. * This relies on dma_map_sg() not touching sg[].page during merging.
  51. */
  52. static void rds_message_purge(struct rds_message *rm)
  53. {
  54. unsigned long i;
  55. if (unlikely(test_bit(RDS_MSG_PAGEVEC, &rm->m_flags)))
  56. return;
  57. for (i = 0; i < rm->data.m_nents; i++) {
  58. rdsdebug("putting data page %p\n", (void *)sg_page(&rm->data.m_sg[i]));
  59. /* XXX will have to put_page for page refs */
  60. __free_page(sg_page(&rm->data.m_sg[i]));
  61. }
  62. rm->data.m_nents = 0;
  63. if (rm->rdma.op_active)
  64. rds_rdma_free_op(&rm->rdma);
  65. if (rm->rdma.op_rdma_mr)
  66. rds_mr_put(rm->rdma.op_rdma_mr);
  67. if (rm->atomic.op_active)
  68. rds_atomic_free_op(&rm->atomic);
  69. if (rm->atomic.op_rdma_mr)
  70. rds_mr_put(rm->atomic.op_rdma_mr);
  71. }
  72. void rds_message_put(struct rds_message *rm)
  73. {
  74. rdsdebug("put rm %p ref %d\n", rm, atomic_read(&rm->m_refcount));
  75. if (atomic_dec_and_test(&rm->m_refcount)) {
  76. BUG_ON(!list_empty(&rm->m_sock_item));
  77. BUG_ON(!list_empty(&rm->m_conn_item));
  78. rds_message_purge(rm);
  79. kfree(rm);
  80. }
  81. }
  82. EXPORT_SYMBOL_GPL(rds_message_put);
  83. void rds_message_populate_header(struct rds_header *hdr, __be16 sport,
  84. __be16 dport, u64 seq)
  85. {
  86. hdr->h_flags = 0;
  87. hdr->h_sport = sport;
  88. hdr->h_dport = dport;
  89. hdr->h_sequence = cpu_to_be64(seq);
  90. hdr->h_exthdr[0] = RDS_EXTHDR_NONE;
  91. }
  92. EXPORT_SYMBOL_GPL(rds_message_populate_header);
  93. int rds_message_add_extension(struct rds_header *hdr,
  94. unsigned int type, const void *data, unsigned int len)
  95. {
  96. unsigned int ext_len = sizeof(u8) + len;
  97. unsigned char *dst;
  98. /* For now, refuse to add more than one extension header */
  99. if (hdr->h_exthdr[0] != RDS_EXTHDR_NONE)
  100. return 0;
  101. if (type >= __RDS_EXTHDR_MAX || len != rds_exthdr_size[type])
  102. return 0;
  103. if (ext_len >= RDS_HEADER_EXT_SPACE)
  104. return 0;
  105. dst = hdr->h_exthdr;
  106. *dst++ = type;
  107. memcpy(dst, data, len);
  108. dst[len] = RDS_EXTHDR_NONE;
  109. return 1;
  110. }
  111. EXPORT_SYMBOL_GPL(rds_message_add_extension);
  112. /*
  113. * If a message has extension headers, retrieve them here.
  114. * Call like this:
  115. *
  116. * unsigned int pos = 0;
  117. *
  118. * while (1) {
  119. * buflen = sizeof(buffer);
  120. * type = rds_message_next_extension(hdr, &pos, buffer, &buflen);
  121. * if (type == RDS_EXTHDR_NONE)
  122. * break;
  123. * ...
  124. * }
  125. */
  126. int rds_message_next_extension(struct rds_header *hdr,
  127. unsigned int *pos, void *buf, unsigned int *buflen)
  128. {
  129. unsigned int offset, ext_type, ext_len;
  130. u8 *src = hdr->h_exthdr;
  131. offset = *pos;
  132. if (offset >= RDS_HEADER_EXT_SPACE)
  133. goto none;
  134. /* Get the extension type and length. For now, the
  135. * length is implied by the extension type. */
  136. ext_type = src[offset++];
  137. if (ext_type == RDS_EXTHDR_NONE || ext_type >= __RDS_EXTHDR_MAX)
  138. goto none;
  139. ext_len = rds_exthdr_size[ext_type];
  140. if (offset + ext_len > RDS_HEADER_EXT_SPACE)
  141. goto none;
  142. *pos = offset + ext_len;
  143. if (ext_len < *buflen)
  144. *buflen = ext_len;
  145. memcpy(buf, src + offset, *buflen);
  146. return ext_type;
  147. none:
  148. *pos = RDS_HEADER_EXT_SPACE;
  149. *buflen = 0;
  150. return RDS_EXTHDR_NONE;
  151. }
  152. int rds_message_add_version_extension(struct rds_header *hdr, unsigned int version)
  153. {
  154. struct rds_ext_header_version ext_hdr;
  155. ext_hdr.h_version = cpu_to_be32(version);
  156. return rds_message_add_extension(hdr, RDS_EXTHDR_VERSION, &ext_hdr, sizeof(ext_hdr));
  157. }
  158. int rds_message_get_version_extension(struct rds_header *hdr, unsigned int *version)
  159. {
  160. struct rds_ext_header_version ext_hdr;
  161. unsigned int pos = 0, len = sizeof(ext_hdr);
  162. /* We assume the version extension is the only one present */
  163. if (rds_message_next_extension(hdr, &pos, &ext_hdr, &len) != RDS_EXTHDR_VERSION)
  164. return 0;
  165. *version = be32_to_cpu(ext_hdr.h_version);
  166. return 1;
  167. }
  168. int rds_message_add_rdma_dest_extension(struct rds_header *hdr, u32 r_key, u32 offset)
  169. {
  170. struct rds_ext_header_rdma_dest ext_hdr;
  171. ext_hdr.h_rdma_rkey = cpu_to_be32(r_key);
  172. ext_hdr.h_rdma_offset = cpu_to_be32(offset);
  173. return rds_message_add_extension(hdr, RDS_EXTHDR_RDMA_DEST, &ext_hdr, sizeof(ext_hdr));
  174. }
  175. EXPORT_SYMBOL_GPL(rds_message_add_rdma_dest_extension);
  176. /*
  177. * Each rds_message is allocated with extra space for the scatterlist entries
  178. * rds ops will need. This is to minimize memory allocation count. Then, each rds op
  179. * can grab SGs when initializing its part of the rds_message.
  180. */
  181. struct rds_message *rds_message_alloc(unsigned int extra_len, gfp_t gfp)
  182. {
  183. struct rds_message *rm;
  184. rm = kzalloc(sizeof(struct rds_message) + extra_len, gfp);
  185. if (!rm)
  186. goto out;
  187. rm->m_used_sgs = 0;
  188. rm->m_total_sgs = extra_len / sizeof(struct scatterlist);
  189. atomic_set(&rm->m_refcount, 1);
  190. INIT_LIST_HEAD(&rm->m_sock_item);
  191. INIT_LIST_HEAD(&rm->m_conn_item);
  192. spin_lock_init(&rm->m_rs_lock);
  193. out:
  194. return rm;
  195. }
  196. /*
  197. * RDS ops use this to grab SG entries from the rm's sg pool.
  198. */
  199. struct scatterlist *rds_message_alloc_sgs(struct rds_message *rm, int nents)
  200. {
  201. struct scatterlist *sg_first = (struct scatterlist *) &rm[1];
  202. struct scatterlist *sg_ret;
  203. WARN_ON(rm->m_used_sgs + nents > rm->m_total_sgs);
  204. sg_ret = &sg_first[rm->m_used_sgs];
  205. sg_init_table(sg_ret, nents);
  206. rm->m_used_sgs += nents;
  207. return sg_ret;
  208. }
  209. struct rds_message *rds_message_map_pages(unsigned long *page_addrs, unsigned int total_len)
  210. {
  211. struct rds_message *rm;
  212. unsigned int i;
  213. int num_sgs = ceil(total_len, PAGE_SIZE);
  214. int extra_bytes = num_sgs * sizeof(struct scatterlist);
  215. rm = rds_message_alloc(extra_bytes, GFP_KERNEL);
  216. if (!rm)
  217. return ERR_PTR(-ENOMEM);
  218. set_bit(RDS_MSG_PAGEVEC, &rm->m_flags);
  219. rm->m_inc.i_hdr.h_len = cpu_to_be32(total_len);
  220. rm->data.m_nents = ceil(total_len, PAGE_SIZE);
  221. rm->data.m_sg = rds_message_alloc_sgs(rm, num_sgs);
  222. for (i = 0; i < rm->data.m_nents; ++i) {
  223. sg_set_page(&rm->data.m_sg[i],
  224. virt_to_page(page_addrs[i]),
  225. PAGE_SIZE, 0);
  226. }
  227. return rm;
  228. }
  229. int rds_message_copy_from_user(struct rds_message *rm, struct iovec *first_iov,
  230. size_t total_len)
  231. {
  232. unsigned long to_copy;
  233. unsigned long iov_off;
  234. unsigned long sg_off;
  235. struct iovec *iov;
  236. struct scatterlist *sg;
  237. int ret = 0;
  238. rm->m_inc.i_hdr.h_len = cpu_to_be32(total_len);
  239. /*
  240. * now allocate and copy in the data payload.
  241. */
  242. sg = rm->data.m_sg;
  243. iov = first_iov;
  244. iov_off = 0;
  245. sg_off = 0; /* Dear gcc, sg->page will be null from kzalloc. */
  246. while (total_len) {
  247. if (!sg_page(sg)) {
  248. ret = rds_page_remainder_alloc(sg, total_len,
  249. GFP_HIGHUSER);
  250. if (ret)
  251. goto out;
  252. rm->data.m_nents++;
  253. sg_off = 0;
  254. }
  255. while (iov_off == iov->iov_len) {
  256. iov_off = 0;
  257. iov++;
  258. }
  259. to_copy = min(iov->iov_len - iov_off, sg->length - sg_off);
  260. to_copy = min_t(size_t, to_copy, total_len);
  261. rdsdebug("copying %lu bytes from user iov [%p, %zu] + %lu to "
  262. "sg [%p, %u, %u] + %lu\n",
  263. to_copy, iov->iov_base, iov->iov_len, iov_off,
  264. (void *)sg_page(sg), sg->offset, sg->length, sg_off);
  265. ret = rds_page_copy_from_user(sg_page(sg), sg->offset + sg_off,
  266. iov->iov_base + iov_off,
  267. to_copy);
  268. if (ret)
  269. goto out;
  270. iov_off += to_copy;
  271. total_len -= to_copy;
  272. sg_off += to_copy;
  273. if (sg_off == sg->length)
  274. sg++;
  275. }
  276. rm->data.op_active = 1;
  277. out:
  278. return ret;
  279. }
  280. int rds_message_inc_copy_to_user(struct rds_incoming *inc,
  281. struct iovec *first_iov, size_t size)
  282. {
  283. struct rds_message *rm;
  284. struct iovec *iov;
  285. struct scatterlist *sg;
  286. unsigned long to_copy;
  287. unsigned long iov_off;
  288. unsigned long vec_off;
  289. int copied;
  290. int ret;
  291. u32 len;
  292. rm = container_of(inc, struct rds_message, m_inc);
  293. len = be32_to_cpu(rm->m_inc.i_hdr.h_len);
  294. iov = first_iov;
  295. iov_off = 0;
  296. sg = rm->data.m_sg;
  297. vec_off = 0;
  298. copied = 0;
  299. while (copied < size && copied < len) {
  300. while (iov_off == iov->iov_len) {
  301. iov_off = 0;
  302. iov++;
  303. }
  304. to_copy = min(iov->iov_len - iov_off, sg->length - vec_off);
  305. to_copy = min_t(size_t, to_copy, size - copied);
  306. to_copy = min_t(unsigned long, to_copy, len - copied);
  307. rdsdebug("copying %lu bytes to user iov [%p, %zu] + %lu to "
  308. "sg [%p, %u, %u] + %lu\n",
  309. to_copy, iov->iov_base, iov->iov_len, iov_off,
  310. sg_page(sg), sg->offset, sg->length, vec_off);
  311. ret = rds_page_copy_to_user(sg_page(sg), sg->offset + vec_off,
  312. iov->iov_base + iov_off,
  313. to_copy);
  314. if (ret) {
  315. copied = ret;
  316. break;
  317. }
  318. iov_off += to_copy;
  319. vec_off += to_copy;
  320. copied += to_copy;
  321. if (vec_off == sg->length) {
  322. vec_off = 0;
  323. sg++;
  324. }
  325. }
  326. return copied;
  327. }
  328. /*
  329. * If the message is still on the send queue, wait until the transport
  330. * is done with it. This is particularly important for RDMA operations.
  331. */
  332. void rds_message_wait(struct rds_message *rm)
  333. {
  334. wait_event(rds_message_flush_waitq,
  335. !test_bit(RDS_MSG_MAPPED, &rm->m_flags));
  336. }
  337. void rds_message_unmapped(struct rds_message *rm)
  338. {
  339. clear_bit(RDS_MSG_MAPPED, &rm->m_flags);
  340. if (waitqueue_active(&rds_message_flush_waitq))
  341. wake_up(&rds_message_flush_waitq);
  342. }
  343. EXPORT_SYMBOL_GPL(rds_message_unmapped);