pagevec.c 4.5 KB

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