message.c 9.8 KB

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