dma-buf.rst 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  1. Buffer Sharing and Synchronization
  2. ==================================
  3. The dma-buf subsystem provides the framework for sharing buffers for
  4. hardware (DMA) access across multiple device drivers and subsystems, and
  5. for synchronizing asynchronous hardware access.
  6. This is used, for example, by drm "prime" multi-GPU support, but is of
  7. course not limited to GPU use cases.
  8. The three main components of this are: (1) dma-buf, representing a
  9. sg_table and exposed to userspace as a file descriptor to allow passing
  10. between devices, (2) fence, which provides a mechanism to signal when
  11. one device has finished access, and (3) reservation, which manages the
  12. shared or exclusive fence(s) associated with the buffer.
  13. Shared DMA Buffers
  14. ------------------
  15. This document serves as a guide to device-driver writers on what is the dma-buf
  16. buffer sharing API, how to use it for exporting and using shared buffers.
  17. Any device driver which wishes to be a part of DMA buffer sharing, can do so as
  18. either the 'exporter' of buffers, or the 'user' or 'importer' of buffers.
  19. Say a driver A wants to use buffers created by driver B, then we call B as the
  20. exporter, and A as buffer-user/importer.
  21. The exporter
  22. - implements and manages operations in :c:type:`struct dma_buf_ops
  23. <dma_buf_ops>` for the buffer,
  24. - allows other users to share the buffer by using dma_buf sharing APIs,
  25. - manages the details of buffer allocation, wrapped in a :c:type:`struct
  26. dma_buf <dma_buf>`,
  27. - decides about the actual backing storage where this allocation happens,
  28. - and takes care of any migration of scatterlist - for all (shared) users of
  29. this buffer.
  30. The buffer-user
  31. - is one of (many) sharing users of the buffer.
  32. - doesn't need to worry about how the buffer is allocated, or where.
  33. - and needs a mechanism to get access to the scatterlist that makes up this
  34. buffer in memory, mapped into its own address space, so it can access the
  35. same area of memory. This interface is provided by :c:type:`struct
  36. dma_buf_attachment <dma_buf_attachment>`.
  37. Any exporters or users of the dma-buf buffer sharing framework must have a
  38. 'select DMA_SHARED_BUFFER' in their respective Kconfigs.
  39. Userspace Interface Notes
  40. ~~~~~~~~~~~~~~~~~~~~~~~~~
  41. Mostly a DMA buffer file descriptor is simply an opaque object for userspace,
  42. and hence the generic interface exposed is very minimal. There's a few things to
  43. consider though:
  44. - Since kernel 3.12 the dma-buf FD supports the llseek system call, but only
  45. with offset=0 and whence=SEEK_END|SEEK_SET. SEEK_SET is supported to allow
  46. the usual size discover pattern size = SEEK_END(0); SEEK_SET(0). Every other
  47. llseek operation will report -EINVAL.
  48. If llseek on dma-buf FDs isn't support the kernel will report -ESPIPE for all
  49. cases. Userspace can use this to detect support for discovering the dma-buf
  50. size using llseek.
  51. - In order to avoid fd leaks on exec, the FD_CLOEXEC flag must be set
  52. on the file descriptor. This is not just a resource leak, but a
  53. potential security hole. It could give the newly exec'd application
  54. access to buffers, via the leaked fd, to which it should otherwise
  55. not be permitted access.
  56. The problem with doing this via a separate fcntl() call, versus doing it
  57. atomically when the fd is created, is that this is inherently racy in a
  58. multi-threaded app[3]. The issue is made worse when it is library code
  59. opening/creating the file descriptor, as the application may not even be
  60. aware of the fd's.
  61. To avoid this problem, userspace must have a way to request O_CLOEXEC
  62. flag be set when the dma-buf fd is created. So any API provided by
  63. the exporting driver to create a dmabuf fd must provide a way to let
  64. userspace control setting of O_CLOEXEC flag passed in to dma_buf_fd().
  65. - Memory mapping the contents of the DMA buffer is also supported. See the
  66. discussion below on `CPU Access to DMA Buffer Objects`_ for the full details.
  67. - The DMA buffer FD is also pollable, see `Implicit Fence Poll Support`_ below for
  68. details.
  69. - The DMA buffer FD also supports a few dma-buf-specific ioctls, see
  70. `DMA Buffer ioctls`_ below for details.
  71. Basic Operation and Device DMA Access
  72. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  73. .. kernel-doc:: drivers/dma-buf/dma-buf.c
  74. :doc: dma buf device access
  75. CPU Access to DMA Buffer Objects
  76. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  77. .. kernel-doc:: drivers/dma-buf/dma-buf.c
  78. :doc: cpu access
  79. Implicit Fence Poll Support
  80. ~~~~~~~~~~~~~~~~~~~~~~~~~~~
  81. .. kernel-doc:: drivers/dma-buf/dma-buf.c
  82. :doc: implicit fence polling
  83. DMA-BUF statistics
  84. ~~~~~~~~~~~~~~~~~~
  85. .. kernel-doc:: drivers/dma-buf/dma-buf-sysfs-stats.c
  86. :doc: overview
  87. DMA Buffer ioctls
  88. ~~~~~~~~~~~~~~~~~
  89. .. kernel-doc:: include/uapi/linux/dma-buf.h
  90. Kernel Functions and Structures Reference
  91. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  92. .. kernel-doc:: drivers/dma-buf/dma-buf.c
  93. :export:
  94. .. kernel-doc:: include/linux/dma-buf.h
  95. :internal:
  96. Reservation Objects
  97. -------------------
  98. .. kernel-doc:: drivers/dma-buf/dma-resv.c
  99. :doc: Reservation Object Overview
  100. .. kernel-doc:: drivers/dma-buf/dma-resv.c
  101. :export:
  102. .. kernel-doc:: include/linux/dma-resv.h
  103. :internal:
  104. DMA Fences
  105. ----------
  106. .. kernel-doc:: drivers/dma-buf/dma-fence.c
  107. :doc: DMA fences overview
  108. DMA Fence Cross-Driver Contract
  109. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  110. .. kernel-doc:: drivers/dma-buf/dma-fence.c
  111. :doc: fence cross-driver contract
  112. DMA Fence Signalling Annotations
  113. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  114. .. kernel-doc:: drivers/dma-buf/dma-fence.c
  115. :doc: fence signalling annotation
  116. DMA Fences Functions Reference
  117. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  118. .. kernel-doc:: drivers/dma-buf/dma-fence.c
  119. :export:
  120. .. kernel-doc:: include/linux/dma-fence.h
  121. :internal:
  122. DMA Fence Array
  123. ~~~~~~~~~~~~~~~
  124. .. kernel-doc:: drivers/dma-buf/dma-fence-array.c
  125. :export:
  126. .. kernel-doc:: include/linux/dma-fence-array.h
  127. :internal:
  128. DMA Fence Chain
  129. ~~~~~~~~~~~~~~~
  130. .. kernel-doc:: drivers/dma-buf/dma-fence-chain.c
  131. :export:
  132. .. kernel-doc:: include/linux/dma-fence-chain.h
  133. :internal:
  134. DMA Fence unwrap
  135. ~~~~~~~~~~~~~~~~
  136. .. kernel-doc:: include/linux/dma-fence-unwrap.h
  137. :internal:
  138. DMA Fence uABI/Sync File
  139. ~~~~~~~~~~~~~~~~~~~~~~~~
  140. .. kernel-doc:: drivers/dma-buf/sync_file.c
  141. :export:
  142. .. kernel-doc:: include/linux/sync_file.h
  143. :internal:
  144. Indefinite DMA Fences
  145. ~~~~~~~~~~~~~~~~~~~~~
  146. At various times struct dma_fence with an indefinite time until dma_fence_wait()
  147. finishes have been proposed. Examples include:
  148. * Future fences, used in HWC1 to signal when a buffer isn't used by the display
  149. any longer, and created with the screen update that makes the buffer visible.
  150. The time this fence completes is entirely under userspace's control.
  151. * Proxy fences, proposed to handle &drm_syncobj for which the fence has not yet
  152. been set. Used to asynchronously delay command submission.
  153. * Userspace fences or gpu futexes, fine-grained locking within a command buffer
  154. that userspace uses for synchronization across engines or with the CPU, which
  155. are then imported as a DMA fence for integration into existing winsys
  156. protocols.
  157. * Long-running compute command buffers, while still using traditional end of
  158. batch DMA fences for memory management instead of context preemption DMA
  159. fences which get reattached when the compute job is rescheduled.
  160. Common to all these schemes is that userspace controls the dependencies of these
  161. fences and controls when they fire. Mixing indefinite fences with normal
  162. in-kernel DMA fences does not work, even when a fallback timeout is included to
  163. protect against malicious userspace:
  164. * Only the kernel knows about all DMA fence dependencies, userspace is not aware
  165. of dependencies injected due to memory management or scheduler decisions.
  166. * Only userspace knows about all dependencies in indefinite fences and when
  167. exactly they will complete, the kernel has no visibility.
  168. Furthermore the kernel has to be able to hold up userspace command submission
  169. for memory management needs, which means we must support indefinite fences being
  170. dependent upon DMA fences. If the kernel also support indefinite fences in the
  171. kernel like a DMA fence, like any of the above proposal would, there is the
  172. potential for deadlocks.
  173. .. kernel-render:: DOT
  174. :alt: Indefinite Fencing Dependency Cycle
  175. :caption: Indefinite Fencing Dependency Cycle
  176. digraph "Fencing Cycle" {
  177. node [shape=box bgcolor=grey style=filled]
  178. kernel [label="Kernel DMA Fences"]
  179. userspace [label="userspace controlled fences"]
  180. kernel -> userspace [label="memory management"]
  181. userspace -> kernel [label="Future fence, fence proxy, ..."]
  182. { rank=same; kernel userspace }
  183. }
  184. This means that the kernel might accidentally create deadlocks
  185. through memory management dependencies which userspace is unaware of, which
  186. randomly hangs workloads until the timeout kicks in. Workloads, which from
  187. userspace's perspective, do not contain a deadlock. In such a mixed fencing
  188. architecture there is no single entity with knowledge of all dependencies.
  189. Thefore preventing such deadlocks from within the kernel is not possible.
  190. The only solution to avoid dependencies loops is by not allowing indefinite
  191. fences in the kernel. This means:
  192. * No future fences, proxy fences or userspace fences imported as DMA fences,
  193. with or without a timeout.
  194. * No DMA fences that signal end of batchbuffer for command submission where
  195. userspace is allowed to use userspace fencing or long running compute
  196. workloads. This also means no implicit fencing for shared buffers in these
  197. cases.
  198. Recoverable Hardware Page Faults Implications
  199. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  200. Modern hardware supports recoverable page faults, which has a lot of
  201. implications for DMA fences.
  202. First, a pending page fault obviously holds up the work that's running on the
  203. accelerator and a memory allocation is usually required to resolve the fault.
  204. But memory allocations are not allowed to gate completion of DMA fences, which
  205. means any workload using recoverable page faults cannot use DMA fences for
  206. synchronization. Synchronization fences controlled by userspace must be used
  207. instead.
  208. On GPUs this poses a problem, because current desktop compositor protocols on
  209. Linux rely on DMA fences, which means without an entirely new userspace stack
  210. built on top of userspace fences, they cannot benefit from recoverable page
  211. faults. Specifically this means implicit synchronization will not be possible.
  212. The exception is when page faults are only used as migration hints and never to
  213. on-demand fill a memory request. For now this means recoverable page
  214. faults on GPUs are limited to pure compute workloads.
  215. Furthermore GPUs usually have shared resources between the 3D rendering and
  216. compute side, like compute units or command submission engines. If both a 3D
  217. job with a DMA fence and a compute workload using recoverable page faults are
  218. pending they could deadlock:
  219. - The 3D workload might need to wait for the compute job to finish and release
  220. hardware resources first.
  221. - The compute workload might be stuck in a page fault, because the memory
  222. allocation is waiting for the DMA fence of the 3D workload to complete.
  223. There are a few options to prevent this problem, one of which drivers need to
  224. ensure:
  225. - Compute workloads can always be preempted, even when a page fault is pending
  226. and not yet repaired. Not all hardware supports this.
  227. - DMA fence workloads and workloads which need page fault handling have
  228. independent hardware resources to guarantee forward progress. This could be
  229. achieved through e.g. through dedicated engines and minimal compute unit
  230. reservations for DMA fence workloads.
  231. - The reservation approach could be further refined by only reserving the
  232. hardware resources for DMA fence workloads when they are in-flight. This must
  233. cover the time from when the DMA fence is visible to other threads up to
  234. moment when fence is completed through dma_fence_signal().
  235. - As a last resort, if the hardware provides no useful reservation mechanics,
  236. all workloads must be flushed from the GPU when switching between jobs
  237. requiring DMA fences or jobs requiring page fault handling: This means all DMA
  238. fences must complete before a compute job with page fault handling can be
  239. inserted into the scheduler queue. And vice versa, before a DMA fence can be
  240. made visible anywhere in the system, all compute workloads must be preempted
  241. to guarantee all pending GPU page faults are flushed.
  242. - Only a fairly theoretical option would be to untangle these dependencies when
  243. allocating memory to repair hardware page faults, either through separate
  244. memory blocks or runtime tracking of the full dependency graph of all DMA
  245. fences. This results very wide impact on the kernel, since resolving the page
  246. on the CPU side can itself involve a page fault. It is much more feasible and
  247. robust to limit the impact of handling hardware page faults to the specific
  248. driver.
  249. Note that workloads that run on independent hardware like copy engines or other
  250. GPUs do not have any impact. This allows us to keep using DMA fences internally
  251. in the kernel even for resolving hardware page faults, e.g. by using copy
  252. engines to clear or copy memory needed to resolve the page fault.
  253. In some ways this page fault problem is a special case of the `Infinite DMA
  254. Fences` discussions: Infinite fences from compute workloads are allowed to
  255. depend on DMA fences, but not the other way around. And not even the page fault
  256. problem is new, because some other CPU thread in userspace might
  257. hit a page fault which holds up a userspace fence - supporting page faults on
  258. GPUs doesn't anything fundamentally new.