page.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  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/highmem.h>
  34. #include <linux/gfp.h>
  35. #include <linux/cpu.h>
  36. #include <linux/export.h>
  37. #include "rds.h"
  38. struct rds_page_remainder {
  39. struct page *r_page;
  40. unsigned long r_offset;
  41. };
  42. static DEFINE_PER_CPU_SHARED_ALIGNED(struct rds_page_remainder,
  43. rds_page_remainders);
  44. /*
  45. * returns 0 on success or -errno on failure.
  46. *
  47. * We don't have to worry about flush_dcache_page() as this only works
  48. * with private pages. If, say, we were to do directed receive to pinned
  49. * user pages we'd have to worry more about cache coherence. (Though
  50. * the flush_dcache_page() in get_user_pages() would probably be enough).
  51. */
  52. int rds_page_copy_user(struct page *page, unsigned long offset,
  53. void __user *ptr, unsigned long bytes,
  54. int to_user)
  55. {
  56. unsigned long ret;
  57. void *addr;
  58. addr = kmap(page);
  59. if (to_user) {
  60. rds_stats_add(s_copy_to_user, bytes);
  61. ret = copy_to_user(ptr, addr + offset, bytes);
  62. } else {
  63. rds_stats_add(s_copy_from_user, bytes);
  64. ret = copy_from_user(addr + offset, ptr, bytes);
  65. }
  66. kunmap(page);
  67. return ret ? -EFAULT : 0;
  68. }
  69. EXPORT_SYMBOL_GPL(rds_page_copy_user);
  70. /*
  71. * Message allocation uses this to build up regions of a message.
  72. *
  73. * @bytes - the number of bytes needed.
  74. * @gfp - the waiting behaviour of the allocation
  75. *
  76. * @gfp is always ored with __GFP_HIGHMEM. Callers must be prepared to
  77. * kmap the pages, etc.
  78. *
  79. * If @bytes is at least a full page then this just returns a page from
  80. * alloc_page().
  81. *
  82. * If @bytes is a partial page then this stores the unused region of the
  83. * page in a per-cpu structure. Future partial-page allocations may be
  84. * satisfied from that cached region. This lets us waste less memory on
  85. * small allocations with minimal complexity. It works because the transmit
  86. * path passes read-only page regions down to devices. They hold a page
  87. * reference until they are done with the region.
  88. */
  89. int rds_page_remainder_alloc(struct scatterlist *scat, unsigned long bytes,
  90. gfp_t gfp)
  91. {
  92. struct rds_page_remainder *rem;
  93. unsigned long flags;
  94. struct page *page;
  95. int ret;
  96. gfp |= __GFP_HIGHMEM;
  97. /* jump straight to allocation if we're trying for a huge page */
  98. if (bytes >= PAGE_SIZE) {
  99. page = alloc_page(gfp);
  100. if (!page) {
  101. ret = -ENOMEM;
  102. } else {
  103. sg_set_page(scat, page, PAGE_SIZE, 0);
  104. ret = 0;
  105. }
  106. goto out;
  107. }
  108. rem = &per_cpu(rds_page_remainders, get_cpu());
  109. local_irq_save(flags);
  110. while (1) {
  111. /* avoid a tiny region getting stuck by tossing it */
  112. if (rem->r_page && bytes > (PAGE_SIZE - rem->r_offset)) {
  113. rds_stats_inc(s_page_remainder_miss);
  114. __free_page(rem->r_page);
  115. rem->r_page = NULL;
  116. }
  117. /* hand out a fragment from the cached page */
  118. if (rem->r_page && bytes <= (PAGE_SIZE - rem->r_offset)) {
  119. sg_set_page(scat, rem->r_page, bytes, rem->r_offset);
  120. get_page(sg_page(scat));
  121. if (rem->r_offset != 0)
  122. rds_stats_inc(s_page_remainder_hit);
  123. rem->r_offset += bytes;
  124. if (rem->r_offset == PAGE_SIZE) {
  125. __free_page(rem->r_page);
  126. rem->r_page = NULL;
  127. }
  128. ret = 0;
  129. break;
  130. }
  131. /* alloc if there is nothing for us to use */
  132. local_irq_restore(flags);
  133. put_cpu();
  134. page = alloc_page(gfp);
  135. rem = &per_cpu(rds_page_remainders, get_cpu());
  136. local_irq_save(flags);
  137. if (!page) {
  138. ret = -ENOMEM;
  139. break;
  140. }
  141. /* did someone race to fill the remainder before us? */
  142. if (rem->r_page) {
  143. __free_page(page);
  144. continue;
  145. }
  146. /* otherwise install our page and loop around to alloc */
  147. rem->r_page = page;
  148. rem->r_offset = 0;
  149. }
  150. local_irq_restore(flags);
  151. put_cpu();
  152. out:
  153. rdsdebug("bytes %lu ret %d %p %u %u\n", bytes, ret,
  154. ret ? NULL : sg_page(scat), ret ? 0 : scat->offset,
  155. ret ? 0 : scat->length);
  156. return ret;
  157. }
  158. EXPORT_SYMBOL_GPL(rds_page_remainder_alloc);
  159. static int rds_page_remainder_cpu_notify(struct notifier_block *self,
  160. unsigned long action, void *hcpu)
  161. {
  162. struct rds_page_remainder *rem;
  163. long cpu = (long)hcpu;
  164. rem = &per_cpu(rds_page_remainders, cpu);
  165. rdsdebug("cpu %ld action 0x%lx\n", cpu, action);
  166. switch (action) {
  167. case CPU_DEAD:
  168. if (rem->r_page)
  169. __free_page(rem->r_page);
  170. rem->r_page = NULL;
  171. break;
  172. }
  173. return 0;
  174. }
  175. static struct notifier_block rds_page_remainder_nb = {
  176. .notifier_call = rds_page_remainder_cpu_notify,
  177. };
  178. void rds_page_exit(void)
  179. {
  180. int i;
  181. for_each_possible_cpu(i)
  182. rds_page_remainder_cpu_notify(&rds_page_remainder_nb,
  183. (unsigned long)CPU_DEAD,
  184. (void *)(long)i);
  185. }