message.c 9.4 KB

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