uio.h 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. /*
  2. * Berkeley style UIO structures - Alan Cox 1994.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License
  6. * as published by the Free Software Foundation; either version
  7. * 2 of the License, or (at your option) any later version.
  8. */
  9. #ifndef __LINUX_UIO_H
  10. #define __LINUX_UIO_H
  11. #include <linux/kernel.h>
  12. #include <uapi/linux/uio.h>
  13. struct page;
  14. struct kvec {
  15. void *iov_base; /* and that should *never* hold a userland pointer */
  16. size_t iov_len;
  17. };
  18. enum {
  19. ITER_IOVEC = 0,
  20. ITER_KVEC = 2,
  21. ITER_BVEC = 4,
  22. };
  23. struct iov_iter {
  24. int type;
  25. size_t iov_offset;
  26. size_t count;
  27. union {
  28. const struct iovec *iov;
  29. const struct kvec *kvec;
  30. const struct bio_vec *bvec;
  31. };
  32. unsigned long nr_segs;
  33. };
  34. /*
  35. * Total number of bytes covered by an iovec.
  36. *
  37. * NOTE that it is not safe to use this function until all the iovec's
  38. * segment lengths have been validated. Because the individual lengths can
  39. * overflow a size_t when added together.
  40. */
  41. static inline size_t iov_length(const struct iovec *iov, unsigned long nr_segs)
  42. {
  43. unsigned long seg;
  44. size_t ret = 0;
  45. for (seg = 0; seg < nr_segs; seg++)
  46. ret += iov[seg].iov_len;
  47. return ret;
  48. }
  49. static inline struct iovec iov_iter_iovec(const struct iov_iter *iter)
  50. {
  51. return (struct iovec) {
  52. .iov_base = iter->iov->iov_base + iter->iov_offset,
  53. .iov_len = min(iter->count,
  54. iter->iov->iov_len - iter->iov_offset),
  55. };
  56. }
  57. #define iov_for_each(iov, iter, start) \
  58. if (!((start).type & ITER_BVEC)) \
  59. for (iter = (start); \
  60. (iter).count && \
  61. ((iov = iov_iter_iovec(&(iter))), 1); \
  62. iov_iter_advance(&(iter), (iov).iov_len))
  63. unsigned long iov_shorten(struct iovec *iov, unsigned long nr_segs, size_t to);
  64. size_t iov_iter_copy_from_user_atomic(struct page *page,
  65. struct iov_iter *i, unsigned long offset, size_t bytes);
  66. void iov_iter_advance(struct iov_iter *i, size_t bytes);
  67. int iov_iter_fault_in_readable(struct iov_iter *i, size_t bytes);
  68. size_t iov_iter_single_seg_count(const struct iov_iter *i);
  69. size_t copy_page_to_iter(struct page *page, size_t offset, size_t bytes,
  70. struct iov_iter *i);
  71. size_t copy_page_from_iter(struct page *page, size_t offset, size_t bytes,
  72. struct iov_iter *i);
  73. size_t copy_to_iter(void *addr, size_t bytes, struct iov_iter *i);
  74. size_t copy_from_iter(void *addr, size_t bytes, struct iov_iter *i);
  75. size_t copy_from_iter_nocache(void *addr, size_t bytes, struct iov_iter *i);
  76. size_t iov_iter_zero(size_t bytes, struct iov_iter *);
  77. unsigned long iov_iter_alignment(const struct iov_iter *i);
  78. void iov_iter_init(struct iov_iter *i, int direction, const struct iovec *iov,
  79. unsigned long nr_segs, size_t count);
  80. void iov_iter_kvec(struct iov_iter *i, int direction, const struct kvec *iov,
  81. unsigned long nr_segs, size_t count);
  82. ssize_t iov_iter_get_pages(struct iov_iter *i, struct page **pages,
  83. size_t maxsize, unsigned maxpages, size_t *start);
  84. ssize_t iov_iter_get_pages_alloc(struct iov_iter *i, struct page ***pages,
  85. size_t maxsize, size_t *start);
  86. int iov_iter_npages(const struct iov_iter *i, int maxpages);
  87. static inline size_t iov_iter_count(struct iov_iter *i)
  88. {
  89. return i->count;
  90. }
  91. static inline bool iter_is_iovec(struct iov_iter *i)
  92. {
  93. return !(i->type & (ITER_BVEC | ITER_KVEC));
  94. }
  95. /*
  96. * Cap the iov_iter by given limit; note that the second argument is
  97. * *not* the new size - it's upper limit for such. Passing it a value
  98. * greater than the amount of data in iov_iter is fine - it'll just do
  99. * nothing in that case.
  100. */
  101. static inline void iov_iter_truncate(struct iov_iter *i, u64 count)
  102. {
  103. /*
  104. * count doesn't have to fit in size_t - comparison extends both
  105. * operands to u64 here and any value that would be truncated by
  106. * conversion in assignement is by definition greater than all
  107. * values of size_t, including old i->count.
  108. */
  109. if (i->count > count)
  110. i->count = count;
  111. }
  112. /*
  113. * reexpand a previously truncated iterator; count must be no more than how much
  114. * we had shrunk it.
  115. */
  116. static inline void iov_iter_reexpand(struct iov_iter *i, size_t count)
  117. {
  118. i->count = count;
  119. }
  120. size_t csum_and_copy_to_iter(void *addr, size_t bytes, __wsum *csum, struct iov_iter *i);
  121. size_t csum_and_copy_from_iter(void *addr, size_t bytes, __wsum *csum, struct iov_iter *i);
  122. #endif