xdp_umem.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273
  1. // SPDX-License-Identifier: GPL-2.0
  2. /* XDP user-space packet buffer
  3. * Copyright(c) 2018 Intel Corporation.
  4. */
  5. #include <linux/init.h>
  6. #include <linux/sched/mm.h>
  7. #include <linux/sched/signal.h>
  8. #include <linux/sched/task.h>
  9. #include <linux/uaccess.h>
  10. #include <linux/slab.h>
  11. #include <linux/bpf.h>
  12. #include <linux/mm.h>
  13. #include <linux/netdevice.h>
  14. #include <linux/rtnetlink.h>
  15. #include <linux/idr.h>
  16. #include <linux/vmalloc.h>
  17. #include "xdp_umem.h"
  18. #include "xsk_queue.h"
  19. static DEFINE_IDA(umem_ida);
  20. static void xdp_umem_unpin_pages(struct xdp_umem *umem)
  21. {
  22. unpin_user_pages_dirty_lock(umem->pgs, umem->npgs, true);
  23. kvfree(umem->pgs);
  24. umem->pgs = NULL;
  25. }
  26. static void xdp_umem_unaccount_pages(struct xdp_umem *umem)
  27. {
  28. if (umem->user) {
  29. atomic_long_sub(umem->npgs, &umem->user->locked_vm);
  30. free_uid(umem->user);
  31. }
  32. }
  33. static void xdp_umem_addr_unmap(struct xdp_umem *umem)
  34. {
  35. vunmap(umem->addrs);
  36. umem->addrs = NULL;
  37. }
  38. static int xdp_umem_addr_map(struct xdp_umem *umem, struct page **pages,
  39. u32 nr_pages)
  40. {
  41. umem->addrs = vmap(pages, nr_pages, VM_MAP, PAGE_KERNEL);
  42. if (!umem->addrs)
  43. return -ENOMEM;
  44. return 0;
  45. }
  46. static void xdp_umem_release(struct xdp_umem *umem)
  47. {
  48. umem->zc = false;
  49. ida_free(&umem_ida, umem->id);
  50. xdp_umem_addr_unmap(umem);
  51. xdp_umem_unpin_pages(umem);
  52. xdp_umem_unaccount_pages(umem);
  53. kfree(umem);
  54. }
  55. static void xdp_umem_release_deferred(struct work_struct *work)
  56. {
  57. struct xdp_umem *umem = container_of(work, struct xdp_umem, work);
  58. xdp_umem_release(umem);
  59. }
  60. void xdp_get_umem(struct xdp_umem *umem)
  61. {
  62. refcount_inc(&umem->users);
  63. }
  64. void xdp_put_umem(struct xdp_umem *umem, bool defer_cleanup)
  65. {
  66. if (!umem)
  67. return;
  68. if (refcount_dec_and_test(&umem->users)) {
  69. if (defer_cleanup) {
  70. INIT_WORK(&umem->work, xdp_umem_release_deferred);
  71. schedule_work(&umem->work);
  72. } else {
  73. xdp_umem_release(umem);
  74. }
  75. }
  76. }
  77. static int xdp_umem_pin_pages(struct xdp_umem *umem, unsigned long address)
  78. {
  79. unsigned int gup_flags = FOLL_WRITE;
  80. long npgs;
  81. int err;
  82. umem->pgs = kvzalloc_objs(*umem->pgs, umem->npgs,
  83. GFP_KERNEL | __GFP_NOWARN);
  84. if (!umem->pgs)
  85. return -ENOMEM;
  86. mmap_read_lock(current->mm);
  87. npgs = pin_user_pages(address, umem->npgs,
  88. gup_flags | FOLL_LONGTERM, &umem->pgs[0]);
  89. mmap_read_unlock(current->mm);
  90. if (npgs != umem->npgs) {
  91. if (npgs >= 0) {
  92. umem->npgs = npgs;
  93. err = -ENOMEM;
  94. goto out_pin;
  95. }
  96. err = npgs;
  97. goto out_pgs;
  98. }
  99. return 0;
  100. out_pin:
  101. xdp_umem_unpin_pages(umem);
  102. out_pgs:
  103. kvfree(umem->pgs);
  104. umem->pgs = NULL;
  105. return err;
  106. }
  107. static int xdp_umem_account_pages(struct xdp_umem *umem)
  108. {
  109. unsigned long lock_limit, new_npgs, old_npgs;
  110. if (capable(CAP_IPC_LOCK))
  111. return 0;
  112. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  113. umem->user = get_uid(current_user());
  114. do {
  115. old_npgs = atomic_long_read(&umem->user->locked_vm);
  116. new_npgs = old_npgs + umem->npgs;
  117. if (new_npgs > lock_limit) {
  118. free_uid(umem->user);
  119. umem->user = NULL;
  120. return -ENOBUFS;
  121. }
  122. } while (atomic_long_cmpxchg(&umem->user->locked_vm, old_npgs,
  123. new_npgs) != old_npgs);
  124. return 0;
  125. }
  126. #define XDP_UMEM_FLAGS_VALID ( \
  127. XDP_UMEM_UNALIGNED_CHUNK_FLAG | \
  128. XDP_UMEM_TX_SW_CSUM | \
  129. XDP_UMEM_TX_METADATA_LEN | \
  130. 0)
  131. static int xdp_umem_reg(struct xdp_umem *umem, struct xdp_umem_reg *mr)
  132. {
  133. bool unaligned_chunks = mr->flags & XDP_UMEM_UNALIGNED_CHUNK_FLAG;
  134. u32 chunk_size = mr->chunk_size, headroom = mr->headroom;
  135. u64 addr = mr->addr, size = mr->len;
  136. u32 chunks_rem, npgs_rem;
  137. u64 chunks, npgs;
  138. int err;
  139. if (chunk_size < XDP_UMEM_MIN_CHUNK_SIZE || chunk_size > PAGE_SIZE) {
  140. /* Strictly speaking we could support this, if:
  141. * - huge pages, or*
  142. * - using an IOMMU, or
  143. * - making sure the memory area is consecutive
  144. * but for now, we simply say "computer says no".
  145. */
  146. return -EINVAL;
  147. }
  148. if (mr->flags & ~XDP_UMEM_FLAGS_VALID)
  149. return -EINVAL;
  150. if (!unaligned_chunks && !is_power_of_2(chunk_size))
  151. return -EINVAL;
  152. if (!PAGE_ALIGNED(addr)) {
  153. /* Memory area has to be page size aligned. For
  154. * simplicity, this might change.
  155. */
  156. return -EINVAL;
  157. }
  158. if ((addr + size) < addr)
  159. return -EINVAL;
  160. npgs = div_u64_rem(size, PAGE_SIZE, &npgs_rem);
  161. if (npgs_rem)
  162. npgs++;
  163. if (npgs > U32_MAX)
  164. return -EINVAL;
  165. chunks = div_u64_rem(size, chunk_size, &chunks_rem);
  166. if (!chunks || chunks > U32_MAX)
  167. return -EINVAL;
  168. if (!unaligned_chunks && chunks_rem)
  169. return -EINVAL;
  170. if (headroom > chunk_size - XDP_PACKET_HEADROOM -
  171. SKB_DATA_ALIGN(sizeof(struct skb_shared_info)) - 128)
  172. return -EINVAL;
  173. if (mr->flags & XDP_UMEM_TX_METADATA_LEN) {
  174. if (mr->tx_metadata_len >= 256 || mr->tx_metadata_len % 8)
  175. return -EINVAL;
  176. umem->tx_metadata_len = mr->tx_metadata_len;
  177. }
  178. umem->size = size;
  179. umem->headroom = headroom;
  180. umem->chunk_size = chunk_size;
  181. umem->chunks = chunks;
  182. umem->npgs = npgs;
  183. umem->pgs = NULL;
  184. umem->user = NULL;
  185. umem->flags = mr->flags;
  186. INIT_LIST_HEAD(&umem->xsk_dma_list);
  187. refcount_set(&umem->users, 1);
  188. err = xdp_umem_account_pages(umem);
  189. if (err)
  190. return err;
  191. err = xdp_umem_pin_pages(umem, (unsigned long)addr);
  192. if (err)
  193. goto out_account;
  194. err = xdp_umem_addr_map(umem, umem->pgs, umem->npgs);
  195. if (err)
  196. goto out_unpin;
  197. return 0;
  198. out_unpin:
  199. xdp_umem_unpin_pages(umem);
  200. out_account:
  201. xdp_umem_unaccount_pages(umem);
  202. return err;
  203. }
  204. struct xdp_umem *xdp_umem_create(struct xdp_umem_reg *mr)
  205. {
  206. struct xdp_umem *umem;
  207. int err;
  208. umem = kzalloc_obj(*umem);
  209. if (!umem)
  210. return ERR_PTR(-ENOMEM);
  211. err = ida_alloc(&umem_ida, GFP_KERNEL);
  212. if (err < 0) {
  213. kfree(umem);
  214. return ERR_PTR(err);
  215. }
  216. umem->id = err;
  217. err = xdp_umem_reg(umem, mr);
  218. if (err) {
  219. ida_free(&umem_ida, umem->id);
  220. kfree(umem);
  221. return ERR_PTR(err);
  222. }
  223. return umem;
  224. }