dax.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  1. #ifndef _LINUX_DAX_H
  2. #define _LINUX_DAX_H
  3. #include <linux/fs.h>
  4. #include <linux/mm.h>
  5. #include <linux/radix-tree.h>
  6. #include <asm/pgtable.h>
  7. struct iomap_ops;
  8. struct dax_device;
  9. struct dax_operations {
  10. /*
  11. * direct_access: translate a device-relative
  12. * logical-page-offset into an absolute physical pfn. Return the
  13. * number of pages available for DAX at that pfn.
  14. */
  15. long (*direct_access)(struct dax_device *, pgoff_t, long,
  16. void **, pfn_t *);
  17. /* copy_from_iter: dax-driver override for default copy_from_iter */
  18. size_t (*copy_from_iter)(struct dax_device *, pgoff_t, void *, size_t,
  19. struct iov_iter *);
  20. };
  21. #if IS_ENABLED(CONFIG_DAX)
  22. struct dax_device *dax_get_by_host(const char *host);
  23. void put_dax(struct dax_device *dax_dev);
  24. #else
  25. static inline struct dax_device *dax_get_by_host(const char *host)
  26. {
  27. return NULL;
  28. }
  29. static inline void put_dax(struct dax_device *dax_dev)
  30. {
  31. }
  32. #endif
  33. int bdev_dax_pgoff(struct block_device *, sector_t, size_t, pgoff_t *pgoff);
  34. #if IS_ENABLED(CONFIG_FS_DAX)
  35. int __bdev_dax_supported(struct super_block *sb, int blocksize);
  36. static inline int bdev_dax_supported(struct super_block *sb, int blocksize)
  37. {
  38. return __bdev_dax_supported(sb, blocksize);
  39. }
  40. static inline struct dax_device *fs_dax_get_by_host(const char *host)
  41. {
  42. return dax_get_by_host(host);
  43. }
  44. static inline void fs_put_dax(struct dax_device *dax_dev)
  45. {
  46. put_dax(dax_dev);
  47. }
  48. #else
  49. static inline int bdev_dax_supported(struct super_block *sb, int blocksize)
  50. {
  51. return -EOPNOTSUPP;
  52. }
  53. static inline struct dax_device *fs_dax_get_by_host(const char *host)
  54. {
  55. return NULL;
  56. }
  57. static inline void fs_put_dax(struct dax_device *dax_dev)
  58. {
  59. }
  60. #endif
  61. int dax_read_lock(void);
  62. void dax_read_unlock(int id);
  63. struct dax_device *alloc_dax(void *private, const char *host,
  64. const struct dax_operations *ops);
  65. bool dax_alive(struct dax_device *dax_dev);
  66. void kill_dax(struct dax_device *dax_dev);
  67. void *dax_get_private(struct dax_device *dax_dev);
  68. long dax_direct_access(struct dax_device *dax_dev, pgoff_t pgoff, long nr_pages,
  69. void **kaddr, pfn_t *pfn);
  70. size_t dax_copy_from_iter(struct dax_device *dax_dev, pgoff_t pgoff, void *addr,
  71. size_t bytes, struct iov_iter *i);
  72. /*
  73. * We use lowest available bit in exceptional entry for locking, one bit for
  74. * the entry size (PMD) and two more to tell us if the entry is a huge zero
  75. * page (HZP) or an empty entry that is just used for locking. In total four
  76. * special bits.
  77. *
  78. * If the PMD bit isn't set the entry has size PAGE_SIZE, and if the HZP and
  79. * EMPTY bits aren't set the entry is a normal DAX entry with a filesystem
  80. * block allocation.
  81. */
  82. #define RADIX_DAX_SHIFT (RADIX_TREE_EXCEPTIONAL_SHIFT + 4)
  83. #define RADIX_DAX_ENTRY_LOCK (1 << RADIX_TREE_EXCEPTIONAL_SHIFT)
  84. #define RADIX_DAX_PMD (1 << (RADIX_TREE_EXCEPTIONAL_SHIFT + 1))
  85. #define RADIX_DAX_HZP (1 << (RADIX_TREE_EXCEPTIONAL_SHIFT + 2))
  86. #define RADIX_DAX_EMPTY (1 << (RADIX_TREE_EXCEPTIONAL_SHIFT + 3))
  87. static inline unsigned long dax_radix_sector(void *entry)
  88. {
  89. return (unsigned long)entry >> RADIX_DAX_SHIFT;
  90. }
  91. static inline void *dax_radix_locked_entry(sector_t sector, unsigned long flags)
  92. {
  93. return (void *)(RADIX_TREE_EXCEPTIONAL_ENTRY | flags |
  94. ((unsigned long)sector << RADIX_DAX_SHIFT) |
  95. RADIX_DAX_ENTRY_LOCK);
  96. }
  97. ssize_t dax_iomap_rw(struct kiocb *iocb, struct iov_iter *iter,
  98. const struct iomap_ops *ops);
  99. int dax_iomap_fault(struct vm_fault *vmf, enum page_entry_size pe_size,
  100. const struct iomap_ops *ops);
  101. int dax_delete_mapping_entry(struct address_space *mapping, pgoff_t index);
  102. int dax_invalidate_mapping_entry_sync(struct address_space *mapping,
  103. pgoff_t index);
  104. void dax_wake_mapping_entry_waiter(struct address_space *mapping,
  105. pgoff_t index, void *entry, bool wake_all);
  106. #ifdef CONFIG_FS_DAX
  107. int __dax_zero_page_range(struct block_device *bdev,
  108. struct dax_device *dax_dev, sector_t sector,
  109. unsigned int offset, unsigned int length);
  110. #else
  111. static inline int __dax_zero_page_range(struct block_device *bdev,
  112. struct dax_device *dax_dev, sector_t sector,
  113. unsigned int offset, unsigned int length)
  114. {
  115. return -ENXIO;
  116. }
  117. #endif
  118. #ifdef CONFIG_FS_DAX_PMD
  119. static inline unsigned int dax_radix_order(void *entry)
  120. {
  121. if ((unsigned long)entry & RADIX_DAX_PMD)
  122. return PMD_SHIFT - PAGE_SHIFT;
  123. return 0;
  124. }
  125. #else
  126. static inline unsigned int dax_radix_order(void *entry)
  127. {
  128. return 0;
  129. }
  130. #endif
  131. int dax_pfn_mkwrite(struct vm_fault *vmf);
  132. static inline bool vma_is_dax(struct vm_area_struct *vma)
  133. {
  134. return vma->vm_file && IS_DAX(vma->vm_file->f_mapping->host);
  135. }
  136. static inline bool dax_mapping(struct address_space *mapping)
  137. {
  138. return mapping->host && IS_DAX(mapping->host);
  139. }
  140. struct writeback_control;
  141. int dax_writeback_mapping_range(struct address_space *mapping,
  142. struct block_device *bdev, struct writeback_control *wbc);
  143. #endif