pagevec.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/ceph/ceph_debug.h>
  3. #include <linux/module.h>
  4. #include <linux/sched.h>
  5. #include <linux/slab.h>
  6. #include <linux/file.h>
  7. #include <linux/namei.h>
  8. #include <linux/writeback.h>
  9. #include <linux/ceph/libceph.h>
  10. /*
  11. * build a vector of user pages
  12. */
  13. struct page **ceph_get_direct_page_vector(const void __user *data,
  14. int num_pages, bool write_page)
  15. {
  16. struct page **pages;
  17. int got = 0;
  18. int rc = 0;
  19. pages = kmalloc_array(num_pages, sizeof(*pages), GFP_NOFS);
  20. if (!pages)
  21. return ERR_PTR(-ENOMEM);
  22. while (got < num_pages) {
  23. rc = get_user_pages_fast(
  24. (unsigned long)data + ((unsigned long)got * PAGE_SIZE),
  25. num_pages - got, write_page, pages + got);
  26. if (rc < 0)
  27. break;
  28. BUG_ON(rc == 0);
  29. got += rc;
  30. }
  31. if (rc < 0)
  32. goto fail;
  33. return pages;
  34. fail:
  35. ceph_put_page_vector(pages, got, false);
  36. return ERR_PTR(rc);
  37. }
  38. EXPORT_SYMBOL(ceph_get_direct_page_vector);
  39. void ceph_put_page_vector(struct page **pages, int num_pages, bool dirty)
  40. {
  41. int i;
  42. for (i = 0; i < num_pages; i++) {
  43. if (dirty)
  44. set_page_dirty_lock(pages[i]);
  45. put_page(pages[i]);
  46. }
  47. kvfree(pages);
  48. }
  49. EXPORT_SYMBOL(ceph_put_page_vector);
  50. void ceph_release_page_vector(struct page **pages, int num_pages)
  51. {
  52. int i;
  53. for (i = 0; i < num_pages; i++)
  54. __free_pages(pages[i], 0);
  55. kfree(pages);
  56. }
  57. EXPORT_SYMBOL(ceph_release_page_vector);
  58. /*
  59. * allocate a vector new pages
  60. */
  61. struct page **ceph_alloc_page_vector(int num_pages, gfp_t flags)
  62. {
  63. struct page **pages;
  64. int i;
  65. pages = kmalloc_array(num_pages, sizeof(*pages), flags);
  66. if (!pages)
  67. return ERR_PTR(-ENOMEM);
  68. for (i = 0; i < num_pages; i++) {
  69. pages[i] = __page_cache_alloc(flags);
  70. if (pages[i] == NULL) {
  71. ceph_release_page_vector(pages, i);
  72. return ERR_PTR(-ENOMEM);
  73. }
  74. }
  75. return pages;
  76. }
  77. EXPORT_SYMBOL(ceph_alloc_page_vector);
  78. /*
  79. * copy user data into a page vector
  80. */
  81. int ceph_copy_user_to_page_vector(struct page **pages,
  82. const void __user *data,
  83. loff_t off, size_t len)
  84. {
  85. int i = 0;
  86. int po = off & ~PAGE_MASK;
  87. int left = len;
  88. int l, bad;
  89. while (left > 0) {
  90. l = min_t(int, PAGE_SIZE-po, left);
  91. bad = copy_from_user(page_address(pages[i]) + po, data, l);
  92. if (bad == l)
  93. return -EFAULT;
  94. data += l - bad;
  95. left -= l - bad;
  96. po += l - bad;
  97. if (po == PAGE_SIZE) {
  98. po = 0;
  99. i++;
  100. }
  101. }
  102. return len;
  103. }
  104. EXPORT_SYMBOL(ceph_copy_user_to_page_vector);
  105. void ceph_copy_to_page_vector(struct page **pages,
  106. const void *data,
  107. loff_t off, size_t len)
  108. {
  109. int i = 0;
  110. size_t po = off & ~PAGE_MASK;
  111. size_t left = len;
  112. while (left > 0) {
  113. size_t l = min_t(size_t, PAGE_SIZE-po, left);
  114. memcpy(page_address(pages[i]) + po, data, l);
  115. data += l;
  116. left -= l;
  117. po += l;
  118. if (po == PAGE_SIZE) {
  119. po = 0;
  120. i++;
  121. }
  122. }
  123. }
  124. EXPORT_SYMBOL(ceph_copy_to_page_vector);
  125. void ceph_copy_from_page_vector(struct page **pages,
  126. void *data,
  127. loff_t off, size_t len)
  128. {
  129. int i = 0;
  130. size_t po = off & ~PAGE_MASK;
  131. size_t left = len;
  132. while (left > 0) {
  133. size_t l = min_t(size_t, PAGE_SIZE-po, left);
  134. memcpy(data, page_address(pages[i]) + po, l);
  135. data += l;
  136. left -= l;
  137. po += l;
  138. if (po == PAGE_SIZE) {
  139. po = 0;
  140. i++;
  141. }
  142. }
  143. }
  144. EXPORT_SYMBOL(ceph_copy_from_page_vector);
  145. /*
  146. * Zero an extent within a page vector. Offset is relative to the
  147. * start of the first page.
  148. */
  149. void ceph_zero_page_vector_range(int off, int len, struct page **pages)
  150. {
  151. int i = off >> PAGE_SHIFT;
  152. off &= ~PAGE_MASK;
  153. dout("zero_page_vector_page %u~%u\n", off, len);
  154. /* leading partial page? */
  155. if (off) {
  156. int end = min((int)PAGE_SIZE, off + len);
  157. dout("zeroing %d %p head from %d\n", i, pages[i],
  158. (int)off);
  159. zero_user_segment(pages[i], off, end);
  160. len -= (end - off);
  161. i++;
  162. }
  163. while (len >= PAGE_SIZE) {
  164. dout("zeroing %d %p len=%d\n", i, pages[i], len);
  165. zero_user_segment(pages[i], 0, PAGE_SIZE);
  166. len -= PAGE_SIZE;
  167. i++;
  168. }
  169. /* trailing partial page? */
  170. if (len) {
  171. dout("zeroing %d %p tail to %d\n", i, pages[i], (int)len);
  172. zero_user_segment(pages[i], 0, len);
  173. }
  174. }
  175. EXPORT_SYMBOL(ceph_zero_page_vector_range);