message.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  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 "rds.h"
  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.op_nents; i++) {
  58. rdsdebug("putting data page %p\n", (void *)sg_page(&rm->data.op_sg[i]));
  59. /* XXX will have to put_page for page refs */
  60. __free_page(sg_page(&rm->data.op_sg[i]));
  61. }
  62. rm->data.op_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_read(&rm->m_refcount) == 0) {
  76. printk(KERN_CRIT "danger refcount zero on %p\n", rm);
  77. WARN_ON(1);
  78. }
  79. if (atomic_dec_and_test(&rm->m_refcount)) {
  80. BUG_ON(!list_empty(&rm->m_sock_item));
  81. BUG_ON(!list_empty(&rm->m_conn_item));
  82. rds_message_purge(rm);
  83. kfree(rm);
  84. }
  85. }
  86. EXPORT_SYMBOL_GPL(rds_message_put);
  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. EXPORT_SYMBOL_GPL(rds_message_populate_header);
  97. int rds_message_add_extension(struct rds_header *hdr, unsigned int type,
  98. const void *data, unsigned int len)
  99. {
  100. unsigned int ext_len = sizeof(u8) + len;
  101. unsigned char *dst;
  102. /* For now, refuse to add more than one extension header */
  103. if (hdr->h_exthdr[0] != RDS_EXTHDR_NONE)
  104. return 0;
  105. if (type >= __RDS_EXTHDR_MAX || 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. EXPORT_SYMBOL_GPL(rds_message_add_extension);
  116. /*
  117. * If a message has extension headers, retrieve them here.
  118. * Call like this:
  119. *
  120. * unsigned int pos = 0;
  121. *
  122. * while (1) {
  123. * buflen = sizeof(buffer);
  124. * type = rds_message_next_extension(hdr, &pos, buffer, &buflen);
  125. * if (type == RDS_EXTHDR_NONE)
  126. * break;
  127. * ...
  128. * }
  129. */
  130. int rds_message_next_extension(struct rds_header *hdr,
  131. unsigned int *pos, void *buf, unsigned int *buflen)
  132. {
  133. unsigned int offset, ext_type, ext_len;
  134. u8 *src = hdr->h_exthdr;
  135. offset = *pos;
  136. if (offset >= RDS_HEADER_EXT_SPACE)
  137. goto none;
  138. /* Get the extension type and length. For now, the
  139. * length is implied by the extension type. */
  140. ext_type = src[offset++];
  141. if (ext_type == RDS_EXTHDR_NONE || ext_type >= __RDS_EXTHDR_MAX)
  142. goto none;
  143. ext_len = rds_exthdr_size[ext_type];
  144. if (offset + ext_len > RDS_HEADER_EXT_SPACE)
  145. goto none;
  146. *pos = offset + ext_len;
  147. if (ext_len < *buflen)
  148. *buflen = ext_len;
  149. memcpy(buf, src + offset, *buflen);
  150. return ext_type;
  151. none:
  152. *pos = RDS_HEADER_EXT_SPACE;
  153. *buflen = 0;
  154. return RDS_EXTHDR_NONE;
  155. }
  156. int rds_message_add_rdma_dest_extension(struct rds_header *hdr, u32 r_key, u32 offset)
  157. {
  158. struct rds_ext_header_rdma_dest ext_hdr;
  159. ext_hdr.h_rdma_rkey = cpu_to_be32(r_key);
  160. ext_hdr.h_rdma_offset = cpu_to_be32(offset);
  161. return rds_message_add_extension(hdr, RDS_EXTHDR_RDMA_DEST, &ext_hdr, sizeof(ext_hdr));
  162. }
  163. EXPORT_SYMBOL_GPL(rds_message_add_rdma_dest_extension);
  164. /*
  165. * Each rds_message is allocated with extra space for the scatterlist entries
  166. * rds ops will need. This is to minimize memory allocation count. Then, each rds op
  167. * can grab SGs when initializing its part of the rds_message.
  168. */
  169. struct rds_message *rds_message_alloc(unsigned int extra_len, gfp_t gfp)
  170. {
  171. struct rds_message *rm;
  172. if (extra_len > KMALLOC_MAX_SIZE - sizeof(struct rds_message))
  173. return NULL;
  174. rm = kzalloc(sizeof(struct rds_message) + extra_len, gfp);
  175. if (!rm)
  176. goto out;
  177. rm->m_used_sgs = 0;
  178. rm->m_total_sgs = extra_len / sizeof(struct scatterlist);
  179. atomic_set(&rm->m_refcount, 1);
  180. INIT_LIST_HEAD(&rm->m_sock_item);
  181. INIT_LIST_HEAD(&rm->m_conn_item);
  182. spin_lock_init(&rm->m_rs_lock);
  183. init_waitqueue_head(&rm->m_flush_wait);
  184. out:
  185. return rm;
  186. }
  187. /*
  188. * RDS ops use this to grab SG entries from the rm's sg pool.
  189. */
  190. struct scatterlist *rds_message_alloc_sgs(struct rds_message *rm, int nents)
  191. {
  192. struct scatterlist *sg_first = (struct scatterlist *) &rm[1];
  193. struct scatterlist *sg_ret;
  194. WARN_ON(rm->m_used_sgs + nents > rm->m_total_sgs);
  195. WARN_ON(!nents);
  196. if (rm->m_used_sgs + nents > rm->m_total_sgs)
  197. return NULL;
  198. sg_ret = &sg_first[rm->m_used_sgs];
  199. sg_init_table(sg_ret, nents);
  200. rm->m_used_sgs += nents;
  201. return sg_ret;
  202. }
  203. struct rds_message *rds_message_map_pages(unsigned long *page_addrs, unsigned int total_len)
  204. {
  205. struct rds_message *rm;
  206. unsigned int i;
  207. int num_sgs = ceil(total_len, PAGE_SIZE);
  208. int extra_bytes = num_sgs * sizeof(struct scatterlist);
  209. rm = rds_message_alloc(extra_bytes, GFP_NOWAIT);
  210. if (!rm)
  211. return ERR_PTR(-ENOMEM);
  212. set_bit(RDS_MSG_PAGEVEC, &rm->m_flags);
  213. rm->m_inc.i_hdr.h_len = cpu_to_be32(total_len);
  214. rm->data.op_nents = ceil(total_len, PAGE_SIZE);
  215. rm->data.op_sg = rds_message_alloc_sgs(rm, num_sgs);
  216. if (!rm->data.op_sg) {
  217. rds_message_put(rm);
  218. return ERR_PTR(-ENOMEM);
  219. }
  220. for (i = 0; i < rm->data.op_nents; ++i) {
  221. sg_set_page(&rm->data.op_sg[i],
  222. virt_to_page(page_addrs[i]),
  223. PAGE_SIZE, 0);
  224. }
  225. return rm;
  226. }
  227. int rds_message_copy_from_user(struct rds_message *rm, struct iovec *first_iov,
  228. size_t total_len)
  229. {
  230. unsigned long to_copy;
  231. unsigned long iov_off;
  232. unsigned long sg_off;
  233. struct iovec *iov;
  234. struct scatterlist *sg;
  235. int ret = 0;
  236. rm->m_inc.i_hdr.h_len = cpu_to_be32(total_len);
  237. /*
  238. * now allocate and copy in the data payload.
  239. */
  240. sg = rm->data.op_sg;
  241. iov = first_iov;
  242. iov_off = 0;
  243. sg_off = 0; /* Dear gcc, sg->page will be null from kzalloc. */
  244. while (total_len) {
  245. if (!sg_page(sg)) {
  246. ret = rds_page_remainder_alloc(sg, total_len,
  247. GFP_HIGHUSER);
  248. if (ret)
  249. goto out;
  250. rm->data.op_nents++;
  251. sg_off = 0;
  252. }
  253. while (iov_off == iov->iov_len) {
  254. iov_off = 0;
  255. iov++;
  256. }
  257. to_copy = min(iov->iov_len - iov_off, sg->length - sg_off);
  258. to_copy = min_t(size_t, to_copy, total_len);
  259. rdsdebug("copying %lu bytes from user iov [%p, %zu] + %lu to "
  260. "sg [%p, %u, %u] + %lu\n",
  261. to_copy, iov->iov_base, iov->iov_len, iov_off,
  262. (void *)sg_page(sg), sg->offset, sg->length, sg_off);
  263. ret = rds_page_copy_from_user(sg_page(sg), sg->offset + sg_off,
  264. iov->iov_base + iov_off,
  265. to_copy);
  266. if (ret)
  267. goto out;
  268. iov_off += to_copy;
  269. total_len -= to_copy;
  270. sg_off += to_copy;
  271. if (sg_off == sg->length)
  272. sg++;
  273. }
  274. out:
  275. return ret;
  276. }
  277. int rds_message_inc_copy_to_user(struct rds_incoming *inc,
  278. struct iovec *first_iov, size_t size)
  279. {
  280. struct rds_message *rm;
  281. struct iovec *iov;
  282. struct scatterlist *sg;
  283. unsigned long to_copy;
  284. unsigned long iov_off;
  285. unsigned long vec_off;
  286. int copied;
  287. int ret;
  288. u32 len;
  289. rm = container_of(inc, struct rds_message, m_inc);
  290. len = be32_to_cpu(rm->m_inc.i_hdr.h_len);
  291. iov = first_iov;
  292. iov_off = 0;
  293. sg = rm->data.op_sg;
  294. vec_off = 0;
  295. copied = 0;
  296. while (copied < size && copied < len) {
  297. while (iov_off == iov->iov_len) {
  298. iov_off = 0;
  299. iov++;
  300. }
  301. to_copy = min(iov->iov_len - iov_off, sg->length - vec_off);
  302. to_copy = min_t(size_t, to_copy, size - copied);
  303. to_copy = min_t(unsigned long, to_copy, len - copied);
  304. rdsdebug("copying %lu bytes to user iov [%p, %zu] + %lu to "
  305. "sg [%p, %u, %u] + %lu\n",
  306. to_copy, iov->iov_base, iov->iov_len, iov_off,
  307. sg_page(sg), sg->offset, sg->length, vec_off);
  308. ret = rds_page_copy_to_user(sg_page(sg), sg->offset + vec_off,
  309. iov->iov_base + iov_off,
  310. to_copy);
  311. if (ret) {
  312. copied = ret;
  313. break;
  314. }
  315. iov_off += to_copy;
  316. vec_off += to_copy;
  317. copied += to_copy;
  318. if (vec_off == sg->length) {
  319. vec_off = 0;
  320. sg++;
  321. }
  322. }
  323. return copied;
  324. }
  325. /*
  326. * If the message is still on the send queue, wait until the transport
  327. * is done with it. This is particularly important for RDMA operations.
  328. */
  329. void rds_message_wait(struct rds_message *rm)
  330. {
  331. wait_event_interruptible(rm->m_flush_wait,
  332. !test_bit(RDS_MSG_MAPPED, &rm->m_flags));
  333. }
  334. void rds_message_unmapped(struct rds_message *rm)
  335. {
  336. clear_bit(RDS_MSG_MAPPED, &rm->m_flags);
  337. wake_up_interruptible(&rm->m_flush_wait);
  338. }
  339. EXPORT_SYMBOL_GPL(rds_message_unmapped);