1 // SPDX-License-Identifier: GPL-2.0-only 2 /* 3 * Framework for buffer objects that can be shared across devices/subsystems. 4 * 5 * Copyright(C) 2011 Linaro Limited. All rights reserved. 6 * Author: Sumit Semwal <sumit.semwal@ti.com> 7 * 8 * Many thanks to linaro-mm-sig list, and specially 9 * Arnd Bergmann <arnd@arndb.de>, Rob Clark <rob@ti.com> and 10 * Daniel Vetter <daniel@ffwll.ch> for their support in creation and 11 * refining of this idea. 12 */ 13 14 #include <linux/fs.h> 15 #include <linux/slab.h> 16 #include <linux/dma-buf.h> 17 #include <linux/dma-fence.h> 18 #include <linux/anon_inodes.h> 19 #include <linux/export.h> 20 #include <linux/debugfs.h> 21 #include <linux/module.h> 22 #include <linux/seq_file.h> 23 #include <linux/poll.h> 24 #include <linux/dma-resv.h> 25 #include <linux/mm.h> 26 #include <linux/mount.h> 27 #include <linux/pseudo_fs.h> 28 29 #include <uapi/linux/dma-buf.h> 30 #include <uapi/linux/magic.h> 31 32 static inline int is_dma_buf_file(struct file *); 33 34 struct dma_buf_list { 35 struct list_head head; 36 struct mutex lock; 37 }; 38 39 static struct dma_buf_list db_list; 40 41 static char *dmabuffs_dname(struct dentry *dentry, char *buffer, int buflen) 42 { 43 struct dma_buf *dmabuf; 44 char name[DMA_BUF_NAME_LEN]; 45 size_t ret = 0; 46 47 dmabuf = dentry->d_fsdata; 48 dma_resv_lock(dmabuf->resv, NULL); 49 if (dmabuf->name) 50 ret = strlcpy(name, dmabuf->name, DMA_BUF_NAME_LEN); 51 dma_resv_unlock(dmabuf->resv); 52 53 return dynamic_dname(dentry, buffer, buflen, "/%s:%s", 54 dentry->d_name.name, ret > 0 ? name : ""); 55 } 56 57 static const struct dentry_operations dma_buf_dentry_ops = { 58 .d_dname = dmabuffs_dname, 59 }; 60 61 static struct vfsmount *dma_buf_mnt; 62 63 static int dma_buf_fs_init_context(struct fs_context *fc) 64 { 65 struct pseudo_fs_context *ctx; 66 67 ctx = init_pseudo(fc, DMA_BUF_MAGIC); 68 if (!ctx) 69 return -ENOMEM; 70 ctx->dops = &dma_buf_dentry_ops; 71 return 0; 72 } 73 74 static struct file_system_type dma_buf_fs_type = { 75 .name = "dmabuf", 76 .init_fs_context = dma_buf_fs_init_context, 77 .kill_sb = kill_anon_super, 78 }; 79 80 static int dma_buf_release(struct inode *inode, struct file *file) 81 { 82 struct dma_buf *dmabuf; 83 84 if (!is_dma_buf_file(file)) 85 return -EINVAL; 86 87 dmabuf = file->private_data; 88 89 BUG_ON(dmabuf->vmapping_counter); 90 91 /* 92 * Any fences that a dma-buf poll can wait on should be signaled 93 * before releasing dma-buf. This is the responsibility of each 94 * driver that uses the reservation objects. 95 * 96 * If you hit this BUG() it means someone dropped their ref to the 97 * dma-buf while still having pending operation to the buffer. 98 */ 99 BUG_ON(dmabuf->cb_shared.active || dmabuf->cb_excl.active); 100 101 dmabuf->ops->release(dmabuf); 102 103 mutex_lock(&db_list.lock); 104 list_del(&dmabuf->list_node); 105 mutex_unlock(&db_list.lock); 106 107 if (dmabuf->resv == (struct dma_resv *)&dmabuf[1]) 108 dma_resv_fini(dmabuf->resv); 109 110 module_put(dmabuf->owner); 111 kfree(dmabuf); 112 return 0; 113 } 114 115 static int dma_buf_mmap_internal(struct file *file, struct vm_area_struct *vma) 116 { 117 struct dma_buf *dmabuf; 118 119 if (!is_dma_buf_file(file)) 120 return -EINVAL; 121 122 dmabuf = file->private_data; 123 124 /* check if buffer supports mmap */ 125 if (!dmabuf->ops->mmap) 126 return -EINVAL; 127 128 /* check for overflowing the buffer's size */ 129 if (vma->vm_pgoff + vma_pages(vma) > 130 dmabuf->size >> PAGE_SHIFT) 131 return -EINVAL; 132 133 return dmabuf->ops->mmap(dmabuf, vma); 134 } 135 136 static loff_t dma_buf_llseek(struct file *file, loff_t offset, int whence) 137 { 138 struct dma_buf *dmabuf; 139 loff_t base; 140 141 if (!is_dma_buf_file(file)) 142 return -EBADF; 143 144 dmabuf = file->private_data; 145 146 /* only support discovering the end of the buffer, 147 but also allow SEEK_SET to maintain the idiomatic 148 SEEK_END(0), SEEK_CUR(0) pattern */ 149 if (whence == SEEK_END) 150 base = dmabuf->size; 151 else if (whence == SEEK_SET) 152 base = 0; 153 else 154 return -EINVAL; 155 156 if (offset != 0) 157 return -EINVAL; 158 159 return base + offset; 160 } 161 162 /** 163 * DOC: fence polling 164 * 165 * To support cross-device and cross-driver synchronization of buffer access 166 * implicit fences (represented internally in the kernel with &struct fence) can 167 * be attached to a &dma_buf. The glue for that and a few related things are 168 * provided in the &dma_resv structure. 169 * 170 * Userspace can query the state of these implicitly tracked fences using poll() 171 * and related system calls: 172 * 173 * - Checking for EPOLLIN, i.e. read access, can be use to query the state of the 174 * most recent write or exclusive fence. 175 * 176 * - Checking for EPOLLOUT, i.e. write access, can be used to query the state of 177 * all attached fences, shared and exclusive ones. 178 * 179 * Note that this only signals the completion of the respective fences, i.e. the 180 * DMA transfers are complete. Cache flushing and any other necessary 181 * preparations before CPU access can begin still need to happen. 182 */ 183 184 static void dma_buf_poll_cb(struct dma_fence *fence, struct dma_fence_cb *cb) 185 { 186 struct dma_buf_poll_cb_t *dcb = (struct dma_buf_poll_cb_t *)cb; 187 unsigned long flags; 188 189 spin_lock_irqsave(&dcb->poll->lock, flags); 190 wake_up_locked_poll(dcb->poll, dcb->active); 191 dcb->active = 0; 192 spin_unlock_irqrestore(&dcb->poll->lock, flags); 193 } 194 195 static __poll_t dma_buf_poll(struct file *file, poll_table *poll) 196 { 197 struct dma_buf *dmabuf; 198 struct dma_resv *resv; 199 struct dma_resv_list *fobj; 200 struct dma_fence *fence_excl; 201 __poll_t events; 202 unsigned shared_count, seq; 203 204 dmabuf = file->private_data; 205 if (!dmabuf || !dmabuf->resv) 206 return EPOLLERR; 207 208 resv = dmabuf->resv; 209 210 poll_wait(file, &dmabuf->poll, poll); 211 212 events = poll_requested_events(poll) & (EPOLLIN | EPOLLOUT); 213 if (!events) 214 return 0; 215 216 retry: 217 seq = read_seqcount_begin(&resv->seq); 218 rcu_read_lock(); 219 220 fobj = rcu_dereference(resv->fence); 221 if (fobj) 222 shared_count = fobj->shared_count; 223 else 224 shared_count = 0; 225 fence_excl = rcu_dereference(resv->fence_excl); 226 if (read_seqcount_retry(&resv->seq, seq)) { 227 rcu_read_unlock(); 228 goto retry; 229 } 230 231 if (fence_excl && (!(events & EPOLLOUT) || shared_count == 0)) { 232 struct dma_buf_poll_cb_t *dcb = &dmabuf->cb_excl; 233 __poll_t pevents = EPOLLIN; 234 235 if (shared_count == 0) 236 pevents |= EPOLLOUT; 237 238 spin_lock_irq(&dmabuf->poll.lock); 239 if (dcb->active) { 240 dcb->active |= pevents; 241 events &= ~pevents; 242 } else 243 dcb->active = pevents; 244 spin_unlock_irq(&dmabuf->poll.lock); 245 246 if (events & pevents) { 247 if (!dma_fence_get_rcu(fence_excl)) { 248 /* force a recheck */ 249 events &= ~pevents; 250 dma_buf_poll_cb(NULL, &dcb->cb); 251 } else if (!dma_fence_add_callback(fence_excl, &dcb->cb, 252 dma_buf_poll_cb)) { 253 events &= ~pevents; 254 dma_fence_put(fence_excl); 255 } else { 256 /* 257 * No callback queued, wake up any additional 258 * waiters. 259 */ 260 dma_fence_put(fence_excl); 261 dma_buf_poll_cb(NULL, &dcb->cb); 262 } 263 } 264 } 265 266 if ((events & EPOLLOUT) && shared_count > 0) { 267 struct dma_buf_poll_cb_t *dcb = &dmabuf->cb_shared; 268 int i; 269 270 /* Only queue a new callback if no event has fired yet */ 271 spin_lock_irq(&dmabuf->poll.lock); 272 if (dcb->active) 273 events &= ~EPOLLOUT; 274 else 275 dcb->active = EPOLLOUT; 276 spin_unlock_irq(&dmabuf->poll.lock); 277 278 if (!(events & EPOLLOUT)) 279 goto out; 280 281 for (i = 0; i < shared_count; ++i) { 282 struct dma_fence *fence = rcu_dereference(fobj->shared[i]); 283 284 if (!dma_fence_get_rcu(fence)) { 285 /* 286 * fence refcount dropped to zero, this means 287 * that fobj has been freed 288 * 289 * call dma_buf_poll_cb and force a recheck! 290 */ 291 events &= ~EPOLLOUT; 292 dma_buf_poll_cb(NULL, &dcb->cb); 293 break; 294 } 295 if (!dma_fence_add_callback(fence, &dcb->cb, 296 dma_buf_poll_cb)) { 297 dma_fence_put(fence); 298 events &= ~EPOLLOUT; 299 break; 300 } 301 dma_fence_put(fence); 302 } 303 304 /* No callback queued, wake up any additional waiters. */ 305 if (i == shared_count) 306 dma_buf_poll_cb(NULL, &dcb->cb); 307 } 308 309 out: 310 rcu_read_unlock(); 311 return events; 312 } 313 314 /** 315 * dma_buf_set_name - Set a name to a specific dma_buf to track the usage. 316 * The name of the dma-buf buffer can only be set when the dma-buf is not 317 * attached to any devices. It could theoritically support changing the 318 * name of the dma-buf if the same piece of memory is used for multiple 319 * purpose between different devices. 320 * 321 * @dmabuf [in] dmabuf buffer that will be renamed. 322 * @buf: [in] A piece of userspace memory that contains the name of 323 * the dma-buf. 324 * 325 * Returns 0 on success. If the dma-buf buffer is already attached to 326 * devices, return -EBUSY. 327 * 328 */ 329 static long dma_buf_set_name(struct dma_buf *dmabuf, const char __user *buf) 330 { 331 char *name = strndup_user(buf, DMA_BUF_NAME_LEN); 332 long ret = 0; 333 334 if (IS_ERR(name)) 335 return PTR_ERR(name); 336 337 dma_resv_lock(dmabuf->resv, NULL); 338 if (!list_empty(&dmabuf->attachments)) { 339 ret = -EBUSY; 340 kfree(name); 341 goto out_unlock; 342 } 343 kfree(dmabuf->name); 344 dmabuf->name = name; 345 346 out_unlock: 347 dma_resv_unlock(dmabuf->resv); 348 return ret; 349 } 350 351 static long dma_buf_ioctl(struct file *file, 352 unsigned int cmd, unsigned long arg) 353 { 354 struct dma_buf *dmabuf; 355 struct dma_buf_sync sync; 356 enum dma_data_direction direction; 357 int ret; 358 359 dmabuf = file->private_data; 360 361 switch (cmd) { 362 case DMA_BUF_IOCTL_SYNC: 363 if (copy_from_user(&sync, (void __user *) arg, sizeof(sync))) 364 return -EFAULT; 365 366 if (sync.flags & ~DMA_BUF_SYNC_VALID_FLAGS_MASK) 367 return -EINVAL; 368 369 switch (sync.flags & DMA_BUF_SYNC_RW) { 370 case DMA_BUF_SYNC_READ: 371 direction = DMA_FROM_DEVICE; 372 break; 373 case DMA_BUF_SYNC_WRITE: 374 direction = DMA_TO_DEVICE; 375 break; 376 case DMA_BUF_SYNC_RW: 377 direction = DMA_BIDIRECTIONAL; 378 break; 379 default: 380 return -EINVAL; 381 } 382 383 if (sync.flags & DMA_BUF_SYNC_END) 384 ret = dma_buf_end_cpu_access(dmabuf, direction); 385 else 386 ret = dma_buf_begin_cpu_access(dmabuf, direction); 387 388 return ret; 389 390 case DMA_BUF_SET_NAME: 391 return dma_buf_set_name(dmabuf, (const char __user *)arg); 392 393 default: 394 return -ENOTTY; 395 } 396 } 397 398 static void dma_buf_show_fdinfo(struct seq_file *m, struct file *file) 399 { 400 struct dma_buf *dmabuf = file->private_data; 401 402 seq_printf(m, "size:\t%zu\n", dmabuf->size); 403 /* Don't count the temporary reference taken inside procfs seq_show */ 404 seq_printf(m, "count:\t%ld\n", file_count(dmabuf->file) - 1); 405 seq_printf(m, "exp_name:\t%s\n", dmabuf->exp_name); 406 dma_resv_lock(dmabuf->resv, NULL); 407 if (dmabuf->name) 408 seq_printf(m, "name:\t%s\n", dmabuf->name); 409 dma_resv_unlock(dmabuf->resv); 410 } 411 412 static const struct file_operations dma_buf_fops = { 413 .release = dma_buf_release, 414 .mmap = dma_buf_mmap_internal, 415 .llseek = dma_buf_llseek, 416 .poll = dma_buf_poll, 417 .unlocked_ioctl = dma_buf_ioctl, 418 .compat_ioctl = compat_ptr_ioctl, 419 .show_fdinfo = dma_buf_show_fdinfo, 420 }; 421 422 /* 423 * is_dma_buf_file - Check if struct file* is associated with dma_buf 424 */ 425 static inline int is_dma_buf_file(struct file *file) 426 { 427 return file->f_op == &dma_buf_fops; 428 } 429 430 static struct file *dma_buf_getfile(struct dma_buf *dmabuf, int flags) 431 { 432 struct file *file; 433 struct inode *inode = alloc_anon_inode(dma_buf_mnt->mnt_sb); 434 435 if (IS_ERR(inode)) 436 return ERR_CAST(inode); 437 438 inode->i_size = dmabuf->size; 439 inode_set_bytes(inode, dmabuf->size); 440 441 file = alloc_file_pseudo(inode, dma_buf_mnt, "dmabuf", 442 flags, &dma_buf_fops); 443 if (IS_ERR(file)) 444 goto err_alloc_file; 445 file->f_flags = flags & (O_ACCMODE | O_NONBLOCK); 446 file->private_data = dmabuf; 447 file->f_path.dentry->d_fsdata = dmabuf; 448 449 return file; 450 451 err_alloc_file: 452 iput(inode); 453 return file; 454 } 455 456 /** 457 * DOC: dma buf device access 458 * 459 * For device DMA access to a shared DMA buffer the usual sequence of operations 460 * is fairly simple: 461 * 462 * 1. The exporter defines his exporter instance using 463 * DEFINE_DMA_BUF_EXPORT_INFO() and calls dma_buf_export() to wrap a private 464 * buffer object into a &dma_buf. It then exports that &dma_buf to userspace 465 * as a file descriptor by calling dma_buf_fd(). 466 * 467 * 2. Userspace passes this file-descriptors to all drivers it wants this buffer 468 * to share with: First the filedescriptor is converted to a &dma_buf using 469 * dma_buf_get(). Then the buffer is attached to the device using 470 * dma_buf_attach(). 471 * 472 * Up to this stage the exporter is still free to migrate or reallocate the 473 * backing storage. 474 * 475 * 3. Once the buffer is attached to all devices userspace can initiate DMA 476 * access to the shared buffer. In the kernel this is done by calling 477 * dma_buf_map_attachment() and dma_buf_unmap_attachment(). 478 * 479 * 4. Once a driver is done with a shared buffer it needs to call 480 * dma_buf_detach() (after cleaning up any mappings) and then release the 481 * reference acquired with dma_buf_get by calling dma_buf_put(). 482 * 483 * For the detailed semantics exporters are expected to implement see 484 * &dma_buf_ops. 485 */ 486 487 /** 488 * dma_buf_export - Creates a new dma_buf, and associates an anon file 489 * with this buffer, so it can be exported. 490 * Also connect the allocator specific data and ops to the buffer. 491 * Additionally, provide a name string for exporter; useful in debugging. 492 * 493 * @exp_info: [in] holds all the export related information provided 494 * by the exporter. see &struct dma_buf_export_info 495 * for further details. 496 * 497 * Returns, on success, a newly created dma_buf object, which wraps the 498 * supplied private data and operations for dma_buf_ops. On either missing 499 * ops, or error in allocating struct dma_buf, will return negative error. 500 * 501 * For most cases the easiest way to create @exp_info is through the 502 * %DEFINE_DMA_BUF_EXPORT_INFO macro. 503 */ 504 struct dma_buf *dma_buf_export(const struct dma_buf_export_info *exp_info) 505 { 506 struct dma_buf *dmabuf; 507 struct dma_resv *resv = exp_info->resv; 508 struct file *file; 509 size_t alloc_size = sizeof(struct dma_buf); 510 int ret; 511 512 if (!exp_info->resv) 513 alloc_size += sizeof(struct dma_resv); 514 else 515 /* prevent &dma_buf[1] == dma_buf->resv */ 516 alloc_size += 1; 517 518 if (WARN_ON(!exp_info->priv 519 || !exp_info->ops 520 || !exp_info->ops->map_dma_buf 521 || !exp_info->ops->unmap_dma_buf 522 || !exp_info->ops->release)) { 523 return ERR_PTR(-EINVAL); 524 } 525 526 if (WARN_ON(exp_info->ops->cache_sgt_mapping && 527 exp_info->ops->dynamic_mapping)) 528 return ERR_PTR(-EINVAL); 529 530 if (!try_module_get(exp_info->owner)) 531 return ERR_PTR(-ENOENT); 532 533 dmabuf = kzalloc(alloc_size, GFP_KERNEL); 534 if (!dmabuf) { 535 ret = -ENOMEM; 536 goto err_module; 537 } 538 539 dmabuf->priv = exp_info->priv; 540 dmabuf->ops = exp_info->ops; 541 dmabuf->size = exp_info->size; 542 dmabuf->exp_name = exp_info->exp_name; 543 dmabuf->owner = exp_info->owner; 544 init_waitqueue_head(&dmabuf->poll); 545 dmabuf->cb_excl.poll = dmabuf->cb_shared.poll = &dmabuf->poll; 546 dmabuf->cb_excl.active = dmabuf->cb_shared.active = 0; 547 548 if (!resv) { 549 resv = (struct dma_resv *)&dmabuf[1]; 550 dma_resv_init(resv); 551 } 552 dmabuf->resv = resv; 553 554 file = dma_buf_getfile(dmabuf, exp_info->flags); 555 if (IS_ERR(file)) { 556 ret = PTR_ERR(file); 557 goto err_dmabuf; 558 } 559 560 file->f_mode |= FMODE_LSEEK; 561 dmabuf->file = file; 562 563 mutex_init(&dmabuf->lock); 564 INIT_LIST_HEAD(&dmabuf->attachments); 565 566 mutex_lock(&db_list.lock); 567 list_add(&dmabuf->list_node, &db_list.head); 568 mutex_unlock(&db_list.lock); 569 570 return dmabuf; 571 572 err_dmabuf: 573 kfree(dmabuf); 574 err_module: 575 module_put(exp_info->owner); 576 return ERR_PTR(ret); 577 } 578 EXPORT_SYMBOL_GPL(dma_buf_export); 579 580 /** 581 * dma_buf_fd - returns a file descriptor for the given dma_buf 582 * @dmabuf: [in] pointer to dma_buf for which fd is required. 583 * @flags: [in] flags to give to fd 584 * 585 * On success, returns an associated 'fd'. Else, returns error. 586 */ 587 int dma_buf_fd(struct dma_buf *dmabuf, int flags) 588 { 589 int fd; 590 591 if (!dmabuf || !dmabuf->file) 592 return -EINVAL; 593 594 fd = get_unused_fd_flags(flags); 595 if (fd < 0) 596 return fd; 597 598 fd_install(fd, dmabuf->file); 599 600 return fd; 601 } 602 EXPORT_SYMBOL_GPL(dma_buf_fd); 603 604 /** 605 * dma_buf_get - returns the dma_buf structure related to an fd 606 * @fd: [in] fd associated with the dma_buf to be returned 607 * 608 * On success, returns the dma_buf structure associated with an fd; uses 609 * file's refcounting done by fget to increase refcount. returns ERR_PTR 610 * otherwise. 611 */ 612 struct dma_buf *dma_buf_get(int fd) 613 { 614 struct file *file; 615 616 file = fget(fd); 617 618 if (!file) 619 return ERR_PTR(-EBADF); 620 621 if (!is_dma_buf_file(file)) { 622 fput(file); 623 return ERR_PTR(-EINVAL); 624 } 625 626 return file->private_data; 627 } 628 EXPORT_SYMBOL_GPL(dma_buf_get); 629 630 /** 631 * dma_buf_put - decreases refcount of the buffer 632 * @dmabuf: [in] buffer to reduce refcount of 633 * 634 * Uses file's refcounting done implicitly by fput(). 635 * 636 * If, as a result of this call, the refcount becomes 0, the 'release' file 637 * operation related to this fd is called. It calls &dma_buf_ops.release vfunc 638 * in turn, and frees the memory allocated for dmabuf when exported. 639 */ 640 void dma_buf_put(struct dma_buf *dmabuf) 641 { 642 if (WARN_ON(!dmabuf || !dmabuf->file)) 643 return; 644 645 fput(dmabuf->file); 646 } 647 EXPORT_SYMBOL_GPL(dma_buf_put); 648 649 /** 650 * dma_buf_dynamic_attach - Add the device to dma_buf's attachments list; optionally, 651 * calls attach() of dma_buf_ops to allow device-specific attach functionality 652 * @dmabuf: [in] buffer to attach device to. 653 * @dev: [in] device to be attached. 654 * @dynamic_mapping: [in] calling convention for map/unmap 655 * 656 * Returns struct dma_buf_attachment pointer for this attachment. Attachments 657 * must be cleaned up by calling dma_buf_detach(). 658 * 659 * Returns: 660 * 661 * A pointer to newly created &dma_buf_attachment on success, or a negative 662 * error code wrapped into a pointer on failure. 663 * 664 * Note that this can fail if the backing storage of @dmabuf is in a place not 665 * accessible to @dev, and cannot be moved to a more suitable place. This is 666 * indicated with the error code -EBUSY. 667 */ 668 struct dma_buf_attachment * 669 dma_buf_dynamic_attach(struct dma_buf *dmabuf, struct device *dev, 670 bool dynamic_mapping) 671 { 672 struct dma_buf_attachment *attach; 673 int ret; 674 675 if (WARN_ON(!dmabuf || !dev)) 676 return ERR_PTR(-EINVAL); 677 678 attach = kzalloc(sizeof(*attach), GFP_KERNEL); 679 if (!attach) 680 return ERR_PTR(-ENOMEM); 681 682 attach->dev = dev; 683 attach->dmabuf = dmabuf; 684 attach->dynamic_mapping = dynamic_mapping; 685 686 if (dmabuf->ops->attach) { 687 ret = dmabuf->ops->attach(dmabuf, attach); 688 if (ret) 689 goto err_attach; 690 } 691 dma_resv_lock(dmabuf->resv, NULL); 692 list_add(&attach->node, &dmabuf->attachments); 693 dma_resv_unlock(dmabuf->resv); 694 695 /* When either the importer or the exporter can't handle dynamic 696 * mappings we cache the mapping here to avoid issues with the 697 * reservation object lock. 698 */ 699 if (dma_buf_attachment_is_dynamic(attach) != 700 dma_buf_is_dynamic(dmabuf)) { 701 struct sg_table *sgt; 702 703 if (dma_buf_is_dynamic(attach->dmabuf)) 704 dma_resv_lock(attach->dmabuf->resv, NULL); 705 706 sgt = dmabuf->ops->map_dma_buf(attach, DMA_BIDIRECTIONAL); 707 if (!sgt) 708 sgt = ERR_PTR(-ENOMEM); 709 if (IS_ERR(sgt)) { 710 ret = PTR_ERR(sgt); 711 goto err_unlock; 712 } 713 if (dma_buf_is_dynamic(attach->dmabuf)) 714 dma_resv_unlock(attach->dmabuf->resv); 715 attach->sgt = sgt; 716 attach->dir = DMA_BIDIRECTIONAL; 717 } 718 719 return attach; 720 721 err_attach: 722 kfree(attach); 723 return ERR_PTR(ret); 724 725 err_unlock: 726 if (dma_buf_is_dynamic(attach->dmabuf)) 727 dma_resv_unlock(attach->dmabuf->resv); 728 729 dma_buf_detach(dmabuf, attach); 730 return ERR_PTR(ret); 731 } 732 EXPORT_SYMBOL_GPL(dma_buf_dynamic_attach); 733 734 /** 735 * dma_buf_attach - Wrapper for dma_buf_dynamic_attach 736 * @dmabuf: [in] buffer to attach device to. 737 * @dev: [in] device to be attached. 738 * 739 * Wrapper to call dma_buf_dynamic_attach() for drivers which still use a static 740 * mapping. 741 */ 742 struct dma_buf_attachment *dma_buf_attach(struct dma_buf *dmabuf, 743 struct device *dev) 744 { 745 return dma_buf_dynamic_attach(dmabuf, dev, false); 746 } 747 EXPORT_SYMBOL_GPL(dma_buf_attach); 748 749 /** 750 * dma_buf_detach - Remove the given attachment from dmabuf's attachments list; 751 * optionally calls detach() of dma_buf_ops for device-specific detach 752 * @dmabuf: [in] buffer to detach from. 753 * @attach: [in] attachment to be detached; is free'd after this call. 754 * 755 * Clean up a device attachment obtained by calling dma_buf_attach(). 756 */ 757 void dma_buf_detach(struct dma_buf *dmabuf, struct dma_buf_attachment *attach) 758 { 759 if (WARN_ON(!dmabuf || !attach)) 760 return; 761 762 if (attach->sgt) { 763 if (dma_buf_is_dynamic(attach->dmabuf)) 764 dma_resv_lock(attach->dmabuf->resv, NULL); 765 766 dmabuf->ops->unmap_dma_buf(attach, attach->sgt, attach->dir); 767 768 if (dma_buf_is_dynamic(attach->dmabuf)) 769 dma_resv_unlock(attach->dmabuf->resv); 770 } 771 772 dma_resv_lock(dmabuf->resv, NULL); 773 list_del(&attach->node); 774 dma_resv_unlock(dmabuf->resv); 775 if (dmabuf->ops->detach) 776 dmabuf->ops->detach(dmabuf, attach); 777 778 kfree(attach); 779 } 780 EXPORT_SYMBOL_GPL(dma_buf_detach); 781 782 /** 783 * dma_buf_map_attachment - Returns the scatterlist table of the attachment; 784 * mapped into _device_ address space. Is a wrapper for map_dma_buf() of the 785 * dma_buf_ops. 786 * @attach: [in] attachment whose scatterlist is to be returned 787 * @direction: [in] direction of DMA transfer 788 * 789 * Returns sg_table containing the scatterlist to be returned; returns ERR_PTR 790 * on error. May return -EINTR if it is interrupted by a signal. 791 * 792 * A mapping must be unmapped by using dma_buf_unmap_attachment(). Note that 793 * the underlying backing storage is pinned for as long as a mapping exists, 794 * therefore users/importers should not hold onto a mapping for undue amounts of 795 * time. 796 */ 797 struct sg_table *dma_buf_map_attachment(struct dma_buf_attachment *attach, 798 enum dma_data_direction direction) 799 { 800 struct sg_table *sg_table; 801 802 might_sleep(); 803 804 if (WARN_ON(!attach || !attach->dmabuf)) 805 return ERR_PTR(-EINVAL); 806 807 if (dma_buf_attachment_is_dynamic(attach)) 808 dma_resv_assert_held(attach->dmabuf->resv); 809 810 if (attach->sgt) { 811 /* 812 * Two mappings with different directions for the same 813 * attachment are not allowed. 814 */ 815 if (attach->dir != direction && 816 attach->dir != DMA_BIDIRECTIONAL) 817 return ERR_PTR(-EBUSY); 818 819 return attach->sgt; 820 } 821 822 if (dma_buf_is_dynamic(attach->dmabuf)) 823 dma_resv_assert_held(attach->dmabuf->resv); 824 825 sg_table = attach->dmabuf->ops->map_dma_buf(attach, direction); 826 if (!sg_table) 827 sg_table = ERR_PTR(-ENOMEM); 828 829 if (!IS_ERR(sg_table) && attach->dmabuf->ops->cache_sgt_mapping) { 830 attach->sgt = sg_table; 831 attach->dir = direction; 832 } 833 834 return sg_table; 835 } 836 EXPORT_SYMBOL_GPL(dma_buf_map_attachment); 837 838 /** 839 * dma_buf_unmap_attachment - unmaps and decreases usecount of the buffer;might 840 * deallocate the scatterlist associated. Is a wrapper for unmap_dma_buf() of 841 * dma_buf_ops. 842 * @attach: [in] attachment to unmap buffer from 843 * @sg_table: [in] scatterlist info of the buffer to unmap 844 * @direction: [in] direction of DMA transfer 845 * 846 * This unmaps a DMA mapping for @attached obtained by dma_buf_map_attachment(). 847 */ 848 void dma_buf_unmap_attachment(struct dma_buf_attachment *attach, 849 struct sg_table *sg_table, 850 enum dma_data_direction direction) 851 { 852 might_sleep(); 853 854 if (WARN_ON(!attach || !attach->dmabuf || !sg_table)) 855 return; 856 857 if (dma_buf_attachment_is_dynamic(attach)) 858 dma_resv_assert_held(attach->dmabuf->resv); 859 860 if (attach->sgt == sg_table) 861 return; 862 863 if (dma_buf_is_dynamic(attach->dmabuf)) 864 dma_resv_assert_held(attach->dmabuf->resv); 865 866 attach->dmabuf->ops->unmap_dma_buf(attach, sg_table, direction); 867 } 868 EXPORT_SYMBOL_GPL(dma_buf_unmap_attachment); 869 870 /** 871 * DOC: cpu access 872 * 873 * There are mutliple reasons for supporting CPU access to a dma buffer object: 874 * 875 * - Fallback operations in the kernel, for example when a device is connected 876 * over USB and the kernel needs to shuffle the data around first before 877 * sending it away. Cache coherency is handled by braketing any transactions 878 * with calls to dma_buf_begin_cpu_access() and dma_buf_end_cpu_access() 879 * access. 880 * 881 * Since for most kernel internal dma-buf accesses need the entire buffer, a 882 * vmap interface is introduced. Note that on very old 32-bit architectures 883 * vmalloc space might be limited and result in vmap calls failing. 884 * 885 * Interfaces:: 886 * void \*dma_buf_vmap(struct dma_buf \*dmabuf) 887 * void dma_buf_vunmap(struct dma_buf \*dmabuf, void \*vaddr) 888 * 889 * The vmap call can fail if there is no vmap support in the exporter, or if 890 * it runs out of vmalloc space. Fallback to kmap should be implemented. Note 891 * that the dma-buf layer keeps a reference count for all vmap access and 892 * calls down into the exporter's vmap function only when no vmapping exists, 893 * and only unmaps it once. Protection against concurrent vmap/vunmap calls is 894 * provided by taking the dma_buf->lock mutex. 895 * 896 * - For full compatibility on the importer side with existing userspace 897 * interfaces, which might already support mmap'ing buffers. This is needed in 898 * many processing pipelines (e.g. feeding a software rendered image into a 899 * hardware pipeline, thumbnail creation, snapshots, ...). Also, Android's ION 900 * framework already supported this and for DMA buffer file descriptors to 901 * replace ION buffers mmap support was needed. 902 * 903 * There is no special interfaces, userspace simply calls mmap on the dma-buf 904 * fd. But like for CPU access there's a need to braket the actual access, 905 * which is handled by the ioctl (DMA_BUF_IOCTL_SYNC). Note that 906 * DMA_BUF_IOCTL_SYNC can fail with -EAGAIN or -EINTR, in which case it must 907 * be restarted. 908 * 909 * Some systems might need some sort of cache coherency management e.g. when 910 * CPU and GPU domains are being accessed through dma-buf at the same time. 911 * To circumvent this problem there are begin/end coherency markers, that 912 * forward directly to existing dma-buf device drivers vfunc hooks. Userspace 913 * can make use of those markers through the DMA_BUF_IOCTL_SYNC ioctl. The 914 * sequence would be used like following: 915 * 916 * - mmap dma-buf fd 917 * - for each drawing/upload cycle in CPU 1. SYNC_START ioctl, 2. read/write 918 * to mmap area 3. SYNC_END ioctl. This can be repeated as often as you 919 * want (with the new data being consumed by say the GPU or the scanout 920 * device) 921 * - munmap once you don't need the buffer any more 922 * 923 * For correctness and optimal performance, it is always required to use 924 * SYNC_START and SYNC_END before and after, respectively, when accessing the 925 * mapped address. Userspace cannot rely on coherent access, even when there 926 * are systems where it just works without calling these ioctls. 927 * 928 * - And as a CPU fallback in userspace processing pipelines. 929 * 930 * Similar to the motivation for kernel cpu access it is again important that 931 * the userspace code of a given importing subsystem can use the same 932 * interfaces with a imported dma-buf buffer object as with a native buffer 933 * object. This is especially important for drm where the userspace part of 934 * contemporary OpenGL, X, and other drivers is huge, and reworking them to 935 * use a different way to mmap a buffer rather invasive. 936 * 937 * The assumption in the current dma-buf interfaces is that redirecting the 938 * initial mmap is all that's needed. A survey of some of the existing 939 * subsystems shows that no driver seems to do any nefarious thing like 940 * syncing up with outstanding asynchronous processing on the device or 941 * allocating special resources at fault time. So hopefully this is good 942 * enough, since adding interfaces to intercept pagefaults and allow pte 943 * shootdowns would increase the complexity quite a bit. 944 * 945 * Interface:: 946 * int dma_buf_mmap(struct dma_buf \*, struct vm_area_struct \*, 947 * unsigned long); 948 * 949 * If the importing subsystem simply provides a special-purpose mmap call to 950 * set up a mapping in userspace, calling do_mmap with dma_buf->file will 951 * equally achieve that for a dma-buf object. 952 */ 953 954 static int __dma_buf_begin_cpu_access(struct dma_buf *dmabuf, 955 enum dma_data_direction direction) 956 { 957 bool write = (direction == DMA_BIDIRECTIONAL || 958 direction == DMA_TO_DEVICE); 959 struct dma_resv *resv = dmabuf->resv; 960 long ret; 961 962 /* Wait on any implicit rendering fences */ 963 ret = dma_resv_wait_timeout_rcu(resv, write, true, 964 MAX_SCHEDULE_TIMEOUT); 965 if (ret < 0) 966 return ret; 967 968 return 0; 969 } 970 971 /** 972 * dma_buf_begin_cpu_access - Must be called before accessing a dma_buf from the 973 * cpu in the kernel context. Calls begin_cpu_access to allow exporter-specific 974 * preparations. Coherency is only guaranteed in the specified range for the 975 * specified access direction. 976 * @dmabuf: [in] buffer to prepare cpu access for. 977 * @direction: [in] length of range for cpu access. 978 * 979 * After the cpu access is complete the caller should call 980 * dma_buf_end_cpu_access(). Only when cpu access is braketed by both calls is 981 * it guaranteed to be coherent with other DMA access. 982 * 983 * Can return negative error values, returns 0 on success. 984 */ 985 int dma_buf_begin_cpu_access(struct dma_buf *dmabuf, 986 enum dma_data_direction direction) 987 { 988 int ret = 0; 989 990 if (WARN_ON(!dmabuf)) 991 return -EINVAL; 992 993 if (dmabuf->ops->begin_cpu_access) 994 ret = dmabuf->ops->begin_cpu_access(dmabuf, direction); 995 996 /* Ensure that all fences are waited upon - but we first allow 997 * the native handler the chance to do so more efficiently if it 998 * chooses. A double invocation here will be reasonably cheap no-op. 999 */ 1000 if (ret == 0) 1001 ret = __dma_buf_begin_cpu_access(dmabuf, direction); 1002 1003 return ret; 1004 } 1005 EXPORT_SYMBOL_GPL(dma_buf_begin_cpu_access); 1006 1007 /** 1008 * dma_buf_end_cpu_access - Must be called after accessing a dma_buf from the 1009 * cpu in the kernel context. Calls end_cpu_access to allow exporter-specific 1010 * actions. Coherency is only guaranteed in the specified range for the 1011 * specified access direction. 1012 * @dmabuf: [in] buffer to complete cpu access for. 1013 * @direction: [in] length of range for cpu access. 1014 * 1015 * This terminates CPU access started with dma_buf_begin_cpu_access(). 1016 * 1017 * Can return negative error values, returns 0 on success. 1018 */ 1019 int dma_buf_end_cpu_access(struct dma_buf *dmabuf, 1020 enum dma_data_direction direction) 1021 { 1022 int ret = 0; 1023 1024 WARN_ON(!dmabuf); 1025 1026 if (dmabuf->ops->end_cpu_access) 1027 ret = dmabuf->ops->end_cpu_access(dmabuf, direction); 1028 1029 return ret; 1030 } 1031 EXPORT_SYMBOL_GPL(dma_buf_end_cpu_access); 1032 1033 1034 /** 1035 * dma_buf_mmap - Setup up a userspace mmap with the given vma 1036 * @dmabuf: [in] buffer that should back the vma 1037 * @vma: [in] vma for the mmap 1038 * @pgoff: [in] offset in pages where this mmap should start within the 1039 * dma-buf buffer. 1040 * 1041 * This function adjusts the passed in vma so that it points at the file of the 1042 * dma_buf operation. It also adjusts the starting pgoff and does bounds 1043 * checking on the size of the vma. Then it calls the exporters mmap function to 1044 * set up the mapping. 1045 * 1046 * Can return negative error values, returns 0 on success. 1047 */ 1048 int dma_buf_mmap(struct dma_buf *dmabuf, struct vm_area_struct *vma, 1049 unsigned long pgoff) 1050 { 1051 struct file *oldfile; 1052 int ret; 1053 1054 if (WARN_ON(!dmabuf || !vma)) 1055 return -EINVAL; 1056 1057 /* check if buffer supports mmap */ 1058 if (!dmabuf->ops->mmap) 1059 return -EINVAL; 1060 1061 /* check for offset overflow */ 1062 if (pgoff + vma_pages(vma) < pgoff) 1063 return -EOVERFLOW; 1064 1065 /* check for overflowing the buffer's size */ 1066 if (pgoff + vma_pages(vma) > 1067 dmabuf->size >> PAGE_SHIFT) 1068 return -EINVAL; 1069 1070 /* readjust the vma */ 1071 get_file(dmabuf->file); 1072 oldfile = vma->vm_file; 1073 vma->vm_file = dmabuf->file; 1074 vma->vm_pgoff = pgoff; 1075 1076 ret = dmabuf->ops->mmap(dmabuf, vma); 1077 if (ret) { 1078 /* restore old parameters on failure */ 1079 vma->vm_file = oldfile; 1080 fput(dmabuf->file); 1081 } else { 1082 if (oldfile) 1083 fput(oldfile); 1084 } 1085 return ret; 1086 1087 } 1088 EXPORT_SYMBOL_GPL(dma_buf_mmap); 1089 1090 /** 1091 * dma_buf_vmap - Create virtual mapping for the buffer object into kernel 1092 * address space. Same restrictions as for vmap and friends apply. 1093 * @dmabuf: [in] buffer to vmap 1094 * 1095 * This call may fail due to lack of virtual mapping address space. 1096 * These calls are optional in drivers. The intended use for them 1097 * is for mapping objects linear in kernel space for high use objects. 1098 * Please attempt to use kmap/kunmap before thinking about these interfaces. 1099 * 1100 * Returns NULL on error. 1101 */ 1102 void *dma_buf_vmap(struct dma_buf *dmabuf) 1103 { 1104 void *ptr; 1105 1106 if (WARN_ON(!dmabuf)) 1107 return NULL; 1108 1109 if (!dmabuf->ops->vmap) 1110 return NULL; 1111 1112 mutex_lock(&dmabuf->lock); 1113 if (dmabuf->vmapping_counter) { 1114 dmabuf->vmapping_counter++; 1115 BUG_ON(!dmabuf->vmap_ptr); 1116 ptr = dmabuf->vmap_ptr; 1117 goto out_unlock; 1118 } 1119 1120 BUG_ON(dmabuf->vmap_ptr); 1121 1122 ptr = dmabuf->ops->vmap(dmabuf); 1123 if (WARN_ON_ONCE(IS_ERR(ptr))) 1124 ptr = NULL; 1125 if (!ptr) 1126 goto out_unlock; 1127 1128 dmabuf->vmap_ptr = ptr; 1129 dmabuf->vmapping_counter = 1; 1130 1131 out_unlock: 1132 mutex_unlock(&dmabuf->lock); 1133 return ptr; 1134 } 1135 EXPORT_SYMBOL_GPL(dma_buf_vmap); 1136 1137 /** 1138 * dma_buf_vunmap - Unmap a vmap obtained by dma_buf_vmap. 1139 * @dmabuf: [in] buffer to vunmap 1140 * @vaddr: [in] vmap to vunmap 1141 */ 1142 void dma_buf_vunmap(struct dma_buf *dmabuf, void *vaddr) 1143 { 1144 if (WARN_ON(!dmabuf)) 1145 return; 1146 1147 BUG_ON(!dmabuf->vmap_ptr); 1148 BUG_ON(dmabuf->vmapping_counter == 0); 1149 BUG_ON(dmabuf->vmap_ptr != vaddr); 1150 1151 mutex_lock(&dmabuf->lock); 1152 if (--dmabuf->vmapping_counter == 0) { 1153 if (dmabuf->ops->vunmap) 1154 dmabuf->ops->vunmap(dmabuf, vaddr); 1155 dmabuf->vmap_ptr = NULL; 1156 } 1157 mutex_unlock(&dmabuf->lock); 1158 } 1159 EXPORT_SYMBOL_GPL(dma_buf_vunmap); 1160 1161 #ifdef CONFIG_DEBUG_FS 1162 static int dma_buf_debug_show(struct seq_file *s, void *unused) 1163 { 1164 int ret; 1165 struct dma_buf *buf_obj; 1166 struct dma_buf_attachment *attach_obj; 1167 struct dma_resv *robj; 1168 struct dma_resv_list *fobj; 1169 struct dma_fence *fence; 1170 unsigned seq; 1171 int count = 0, attach_count, shared_count, i; 1172 size_t size = 0; 1173 1174 ret = mutex_lock_interruptible(&db_list.lock); 1175 1176 if (ret) 1177 return ret; 1178 1179 seq_puts(s, "\nDma-buf Objects:\n"); 1180 seq_printf(s, "%-8s\t%-8s\t%-8s\t%-8s\texp_name\t%-8s\n", 1181 "size", "flags", "mode", "count", "ino"); 1182 1183 list_for_each_entry(buf_obj, &db_list.head, list_node) { 1184 1185 ret = dma_resv_lock_interruptible(buf_obj->resv, NULL); 1186 if (ret) 1187 goto error_unlock; 1188 1189 seq_printf(s, "%08zu\t%08x\t%08x\t%08ld\t%s\t%08lu\t%s\n", 1190 buf_obj->size, 1191 buf_obj->file->f_flags, buf_obj->file->f_mode, 1192 file_count(buf_obj->file), 1193 buf_obj->exp_name, 1194 file_inode(buf_obj->file)->i_ino, 1195 buf_obj->name ?: ""); 1196 1197 robj = buf_obj->resv; 1198 while (true) { 1199 seq = read_seqcount_begin(&robj->seq); 1200 rcu_read_lock(); 1201 fobj = rcu_dereference(robj->fence); 1202 shared_count = fobj ? fobj->shared_count : 0; 1203 fence = rcu_dereference(robj->fence_excl); 1204 if (!read_seqcount_retry(&robj->seq, seq)) 1205 break; 1206 rcu_read_unlock(); 1207 } 1208 1209 if (fence) 1210 seq_printf(s, "\tExclusive fence: %s %s %ssignalled\n", 1211 fence->ops->get_driver_name(fence), 1212 fence->ops->get_timeline_name(fence), 1213 dma_fence_is_signaled(fence) ? "" : "un"); 1214 for (i = 0; i < shared_count; i++) { 1215 fence = rcu_dereference(fobj->shared[i]); 1216 if (!dma_fence_get_rcu(fence)) 1217 continue; 1218 seq_printf(s, "\tShared fence: %s %s %ssignalled\n", 1219 fence->ops->get_driver_name(fence), 1220 fence->ops->get_timeline_name(fence), 1221 dma_fence_is_signaled(fence) ? "" : "un"); 1222 dma_fence_put(fence); 1223 } 1224 rcu_read_unlock(); 1225 1226 seq_puts(s, "\tAttached Devices:\n"); 1227 attach_count = 0; 1228 1229 list_for_each_entry(attach_obj, &buf_obj->attachments, node) { 1230 seq_printf(s, "\t%s\n", dev_name(attach_obj->dev)); 1231 attach_count++; 1232 } 1233 dma_resv_unlock(buf_obj->resv); 1234 1235 seq_printf(s, "Total %d devices attached\n\n", 1236 attach_count); 1237 1238 count++; 1239 size += buf_obj->size; 1240 } 1241 1242 seq_printf(s, "\nTotal %d objects, %zu bytes\n", count, size); 1243 1244 mutex_unlock(&db_list.lock); 1245 return 0; 1246 1247 error_unlock: 1248 mutex_unlock(&db_list.lock); 1249 return ret; 1250 } 1251 1252 DEFINE_SHOW_ATTRIBUTE(dma_buf_debug); 1253 1254 static struct dentry *dma_buf_debugfs_dir; 1255 1256 static int dma_buf_init_debugfs(void) 1257 { 1258 struct dentry *d; 1259 int err = 0; 1260 1261 d = debugfs_create_dir("dma_buf", NULL); 1262 if (IS_ERR(d)) 1263 return PTR_ERR(d); 1264 1265 dma_buf_debugfs_dir = d; 1266 1267 d = debugfs_create_file("bufinfo", S_IRUGO, dma_buf_debugfs_dir, 1268 NULL, &dma_buf_debug_fops); 1269 if (IS_ERR(d)) { 1270 pr_debug("dma_buf: debugfs: failed to create node bufinfo\n"); 1271 debugfs_remove_recursive(dma_buf_debugfs_dir); 1272 dma_buf_debugfs_dir = NULL; 1273 err = PTR_ERR(d); 1274 } 1275 1276 return err; 1277 } 1278 1279 static void dma_buf_uninit_debugfs(void) 1280 { 1281 debugfs_remove_recursive(dma_buf_debugfs_dir); 1282 } 1283 #else 1284 static inline int dma_buf_init_debugfs(void) 1285 { 1286 return 0; 1287 } 1288 static inline void dma_buf_uninit_debugfs(void) 1289 { 1290 } 1291 #endif 1292 1293 static int __init dma_buf_init(void) 1294 { 1295 dma_buf_mnt = kern_mount(&dma_buf_fs_type); 1296 if (IS_ERR(dma_buf_mnt)) 1297 return PTR_ERR(dma_buf_mnt); 1298 1299 mutex_init(&db_list.lock); 1300 INIT_LIST_HEAD(&db_list.head); 1301 dma_buf_init_debugfs(); 1302 return 0; 1303 } 1304 subsys_initcall(dma_buf_init); 1305 1306 static void __exit dma_buf_deinit(void) 1307 { 1308 dma_buf_uninit_debugfs(); 1309 kern_unmount(dma_buf_mnt); 1310 } 1311 __exitcall(dma_buf_deinit); 1312