btrfs_inode.h 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /*
  3. * Copyright (C) 2007 Oracle. All rights reserved.
  4. */
  5. #ifndef BTRFS_INODE_H
  6. #define BTRFS_INODE_H
  7. #include <linux/hash.h>
  8. #include <linux/refcount.h>
  9. #include <linux/spinlock.h>
  10. #include <linux/mutex.h>
  11. #include <linux/rwsem.h>
  12. #include <linux/fs.h>
  13. #include <linux/mm.h>
  14. #include <linux/compiler.h>
  15. #include <linux/fscrypt.h>
  16. #include <linux/lockdep.h>
  17. #include <uapi/linux/btrfs_tree.h>
  18. #include <trace/events/btrfs.h>
  19. #include "ctree.h"
  20. #include "block-rsv.h"
  21. #include "extent_map.h"
  22. #include "extent-io-tree.h"
  23. struct posix_acl;
  24. struct iov_iter;
  25. struct writeback_control;
  26. struct btrfs_root;
  27. struct btrfs_fs_info;
  28. struct btrfs_trans_handle;
  29. struct btrfs_bio;
  30. struct btrfs_file_extent;
  31. struct btrfs_delayed_node;
  32. /*
  33. * Since we search a directory based on f_pos (struct dir_context::pos) we have
  34. * to start at 2 since '.' and '..' have f_pos of 0 and 1 respectively, so
  35. * everybody else has to start at 2 (see btrfs_real_readdir() and dir_emit_dots()).
  36. */
  37. #define BTRFS_DIR_START_INDEX 2
  38. /*
  39. * ordered_data_close is set by truncate when a file that used
  40. * to have good data has been truncated to zero. When it is set
  41. * the btrfs file release call will add this inode to the
  42. * ordered operations list so that we make sure to flush out any
  43. * new data the application may have written before commit.
  44. */
  45. enum {
  46. BTRFS_INODE_FLUSH_ON_CLOSE,
  47. BTRFS_INODE_DUMMY,
  48. BTRFS_INODE_IN_DEFRAG,
  49. BTRFS_INODE_HAS_ASYNC_EXTENT,
  50. /*
  51. * Always set under the VFS' inode lock, otherwise it can cause races
  52. * during fsync (we start as a fast fsync and then end up in a full
  53. * fsync racing with ordered extent completion).
  54. */
  55. BTRFS_INODE_NEEDS_FULL_SYNC,
  56. BTRFS_INODE_COPY_EVERYTHING,
  57. BTRFS_INODE_HAS_PROPS,
  58. BTRFS_INODE_SNAPSHOT_FLUSH,
  59. /*
  60. * Set and used when logging an inode and it serves to signal that an
  61. * inode does not have xattrs, so subsequent fsyncs can avoid searching
  62. * for xattrs to log. This bit must be cleared whenever a xattr is added
  63. * to an inode.
  64. */
  65. BTRFS_INODE_NO_XATTRS,
  66. /*
  67. * Set when we are in a context where we need to start a transaction and
  68. * have dirty pages with the respective file range locked. This is to
  69. * ensure that when reserving space for the transaction, if we are low
  70. * on available space and need to flush delalloc, we will not flush
  71. * delalloc for this inode, because that could result in a deadlock (on
  72. * the file range, inode's io_tree).
  73. */
  74. BTRFS_INODE_NO_DELALLOC_FLUSH,
  75. /*
  76. * Set when we are working on enabling verity for a file. Computing and
  77. * writing the whole Merkle tree can take a while so we want to prevent
  78. * races where two separate tasks attempt to simultaneously start verity
  79. * on the same file.
  80. */
  81. BTRFS_INODE_VERITY_IN_PROGRESS,
  82. /* Set when this inode is a free space inode. */
  83. BTRFS_INODE_FREE_SPACE_INODE,
  84. /* Set when there are no capabilities in XATTs for the inode. */
  85. BTRFS_INODE_NO_CAP_XATTR,
  86. /*
  87. * Set if an error happened when doing a COW write before submitting a
  88. * bio or during writeback. Used for both buffered writes and direct IO
  89. * writes. This is to signal a fast fsync that it has to wait for
  90. * ordered extents to complete and therefore not log extent maps that
  91. * point to unwritten extents (when an ordered extent completes and it
  92. * has the BTRFS_ORDERED_IOERR flag set, it drops extent maps in its
  93. * range).
  94. */
  95. BTRFS_INODE_COW_WRITE_ERROR,
  96. /*
  97. * Indicate this is a directory that points to a subvolume for which
  98. * there is no root reference item. That's a case like the following:
  99. *
  100. * $ btrfs subvolume create /mnt/parent
  101. * $ btrfs subvolume create /mnt/parent/child
  102. * $ btrfs subvolume snapshot /mnt/parent /mnt/snap
  103. *
  104. * If subvolume "parent" is root 256, subvolume "child" is root 257 and
  105. * snapshot "snap" is root 258, then there's no root reference item (key
  106. * BTRFS_ROOT_REF_KEY in the root tree) for the subvolume "child"
  107. * associated to root 258 (the snapshot) - there's only for the root
  108. * of the "parent" subvolume (root 256). In the chunk root we have a
  109. * (256 BTRFS_ROOT_REF_KEY 257) key but we don't have a
  110. * (258 BTRFS_ROOT_REF_KEY 257) key - the sames goes for backrefs, we
  111. * have a (257 BTRFS_ROOT_BACKREF_KEY 256) but we don't have a
  112. * (257 BTRFS_ROOT_BACKREF_KEY 258) key.
  113. *
  114. * So when opening the "child" dentry from the snapshot's directory,
  115. * we don't find a root ref item and we create a stub inode. This is
  116. * done at new_simple_dir(), called from btrfs_lookup_dentry().
  117. */
  118. BTRFS_INODE_ROOT_STUB,
  119. };
  120. /* in memory btrfs inode */
  121. struct btrfs_inode {
  122. /* which subvolume this inode belongs to */
  123. struct btrfs_root *root;
  124. #if BITS_PER_LONG == 32
  125. /*
  126. * The objectid of the corresponding BTRFS_INODE_ITEM_KEY.
  127. * On 64 bits platforms we can get it from vfs_inode.i_ino, which is an
  128. * unsigned long and therefore 64 bits on such platforms.
  129. */
  130. u64 objectid;
  131. #endif
  132. /* Cached value of inode property 'compression'. */
  133. u8 prop_compress;
  134. /*
  135. * Force compression on the file using the defrag ioctl, could be
  136. * different from prop_compress and takes precedence if set.
  137. */
  138. u8 defrag_compress;
  139. s8 defrag_compress_level;
  140. /*
  141. * Lock for counters and all fields used to determine if the inode is in
  142. * the log or not (last_trans, last_sub_trans, last_log_commit,
  143. * logged_trans), to access/update delalloc_bytes, new_delalloc_bytes,
  144. * defrag_bytes, disk_i_size, outstanding_extents, csum_bytes and to
  145. * update the VFS' inode number of bytes used.
  146. * Also protects setting struct file::private_data.
  147. */
  148. spinlock_t lock;
  149. /* the extent_tree has caches of all the extent mappings to disk */
  150. struct extent_map_tree extent_tree;
  151. /* the io_tree does range state (DIRTY, LOCKED etc) */
  152. struct extent_io_tree io_tree;
  153. /*
  154. * Keep track of where the inode has extent items mapped in order to
  155. * make sure the i_size adjustments are accurate. Not required when the
  156. * filesystem is NO_HOLES, the status can't be set while mounted as
  157. * it's a mkfs-time feature.
  158. */
  159. struct extent_io_tree *file_extent_tree;
  160. /* held while logging the inode in tree-log.c */
  161. struct mutex log_mutex;
  162. /*
  163. * Counters to keep track of the number of extent item's we may use due
  164. * to delalloc and such. outstanding_extents is the number of extent
  165. * items we think we'll end up using, and reserved_extents is the number
  166. * of extent items we've reserved metadata for. Protected by 'lock'.
  167. */
  168. unsigned outstanding_extents;
  169. /* used to order data wrt metadata */
  170. spinlock_t ordered_tree_lock;
  171. struct rb_root ordered_tree;
  172. struct rb_node *ordered_tree_last;
  173. /* list of all the delalloc inodes in the FS. There are times we need
  174. * to write all the delalloc pages to disk, and this list is used
  175. * to walk them all.
  176. */
  177. struct list_head delalloc_inodes;
  178. unsigned long runtime_flags;
  179. /* full 64 bit generation number, struct vfs_inode doesn't have a big
  180. * enough field for this.
  181. */
  182. u64 generation;
  183. /*
  184. * ID of the transaction handle that last modified this inode.
  185. * Protected by 'lock'.
  186. */
  187. u64 last_trans;
  188. /*
  189. * ID of the transaction that last logged this inode.
  190. * Protected by 'lock'.
  191. */
  192. u64 logged_trans;
  193. /*
  194. * Log transaction ID when this inode was last modified.
  195. * Protected by 'lock'.
  196. */
  197. int last_sub_trans;
  198. /* A local copy of root's last_log_commit. Protected by 'lock'. */
  199. int last_log_commit;
  200. union {
  201. /*
  202. * Total number of bytes pending delalloc, used by stat to
  203. * calculate the real block usage of the file. This is used
  204. * only for files. Protected by 'lock'.
  205. */
  206. u64 delalloc_bytes;
  207. /*
  208. * The lowest possible index of the next dir index key which
  209. * points to an inode that needs to be logged.
  210. * This is used only for directories.
  211. * Use the helpers btrfs_get_first_dir_index_to_log() and
  212. * btrfs_set_first_dir_index_to_log() to access this field.
  213. */
  214. u64 first_dir_index_to_log;
  215. };
  216. union {
  217. /*
  218. * Total number of bytes pending delalloc that fall within a file
  219. * range that is either a hole or beyond EOF (and no prealloc extent
  220. * exists in the range). This is always <= delalloc_bytes and this
  221. * is used only for files. Protected by 'lock'.
  222. */
  223. u64 new_delalloc_bytes;
  224. /*
  225. * The offset of the last dir index key that was logged.
  226. * This is used only for directories. Protected by 'log_mutex'.
  227. */
  228. u64 last_dir_index_offset;
  229. };
  230. union {
  231. /*
  232. * Total number of bytes pending defrag, used by stat to check whether
  233. * it needs COW. Protected by 'lock'.
  234. * Used by inodes other than the data relocation inode.
  235. */
  236. u64 defrag_bytes;
  237. /*
  238. * Logical address of the block group being relocated.
  239. * Used only by the data relocation inode.
  240. */
  241. u64 reloc_block_group_start;
  242. };
  243. /*
  244. * The size of the file stored in the metadata on disk. data=ordered
  245. * means the in-memory i_size might be larger than the size on disk
  246. * because not all the blocks are written yet. Protected by 'lock'.
  247. */
  248. u64 disk_i_size;
  249. union {
  250. /*
  251. * If this is a directory then index_cnt is the counter for the
  252. * index number for new files that are created. For an empty
  253. * directory, this must be initialized to BTRFS_DIR_START_INDEX.
  254. */
  255. u64 index_cnt;
  256. /*
  257. * If this is not a directory, this is the number of bytes
  258. * outstanding that are going to need csums. This is used in
  259. * ENOSPC accounting. Protected by 'lock'.
  260. */
  261. u64 csum_bytes;
  262. };
  263. /* Cache the directory index number to speed the dir/file remove */
  264. u64 dir_index;
  265. /* the fsync log has some corner cases that mean we have to check
  266. * directories to see if any unlinks have been done before
  267. * the directory was logged. See tree-log.c for all the
  268. * details
  269. */
  270. u64 last_unlink_trans;
  271. union {
  272. /*
  273. * The id/generation of the last transaction where this inode
  274. * was either the source or the destination of a clone/dedupe
  275. * operation. Used when logging an inode to know if there are
  276. * shared extents that need special care when logging checksum
  277. * items, to avoid duplicate checksum items in a log (which can
  278. * lead to a corruption where we end up with missing checksum
  279. * ranges after log replay). Protected by the VFS inode lock.
  280. * Used for regular files only.
  281. */
  282. u64 last_reflink_trans;
  283. /*
  284. * In case this a root stub inode (BTRFS_INODE_ROOT_STUB flag set),
  285. * the ID of that root.
  286. */
  287. u64 ref_root_id;
  288. };
  289. /* Backwards incompatible flags, lower half of inode_item::flags */
  290. u32 flags;
  291. /* Read-only compatibility flags, upper half of inode_item::flags */
  292. u32 ro_flags;
  293. struct btrfs_block_rsv block_rsv;
  294. struct btrfs_delayed_node *delayed_node;
  295. /* File creation time. */
  296. u64 i_otime_sec;
  297. u32 i_otime_nsec;
  298. /* Hook into fs_info->delayed_iputs */
  299. struct list_head delayed_iput;
  300. struct rw_semaphore i_mmap_lock;
  301. struct inode vfs_inode;
  302. };
  303. static inline u64 btrfs_get_first_dir_index_to_log(const struct btrfs_inode *inode)
  304. {
  305. return READ_ONCE(inode->first_dir_index_to_log);
  306. }
  307. static inline void btrfs_set_first_dir_index_to_log(struct btrfs_inode *inode,
  308. u64 index)
  309. {
  310. WRITE_ONCE(inode->first_dir_index_to_log, index);
  311. }
  312. /* Type checked and const-preserving VFS inode -> btrfs inode. */
  313. #define BTRFS_I(_inode) \
  314. _Generic(_inode, \
  315. struct inode *: container_of(_inode, struct btrfs_inode, vfs_inode), \
  316. const struct inode *: (const struct btrfs_inode *)container_of( \
  317. _inode, const struct btrfs_inode, vfs_inode))
  318. static inline unsigned long btrfs_inode_hash(u64 objectid,
  319. const struct btrfs_root *root)
  320. {
  321. u64 h = objectid ^ (root->root_key.objectid * GOLDEN_RATIO_PRIME);
  322. #if BITS_PER_LONG == 32
  323. h = (h >> 32) ^ (h & 0xffffffff);
  324. #endif
  325. return (unsigned long)h;
  326. }
  327. #if BITS_PER_LONG == 32
  328. /*
  329. * On 32 bit systems the i_ino of struct inode is 32 bits (unsigned long), so
  330. * we use the inode's location objectid which is a u64 to avoid truncation.
  331. */
  332. static inline u64 btrfs_ino(const struct btrfs_inode *inode)
  333. {
  334. u64 ino = inode->objectid;
  335. if (test_bit(BTRFS_INODE_ROOT_STUB, &inode->runtime_flags))
  336. ino = inode->vfs_inode.i_ino;
  337. return ino;
  338. }
  339. #else
  340. static inline u64 btrfs_ino(const struct btrfs_inode *inode)
  341. {
  342. return inode->vfs_inode.i_ino;
  343. }
  344. #endif
  345. static inline void btrfs_get_inode_key(const struct btrfs_inode *inode,
  346. struct btrfs_key *key)
  347. {
  348. key->objectid = btrfs_ino(inode);
  349. key->type = BTRFS_INODE_ITEM_KEY;
  350. key->offset = 0;
  351. }
  352. static inline void btrfs_set_inode_number(struct btrfs_inode *inode, u64 ino)
  353. {
  354. #if BITS_PER_LONG == 32
  355. inode->objectid = ino;
  356. #endif
  357. inode->vfs_inode.i_ino = ino;
  358. }
  359. static inline void btrfs_i_size_write(struct btrfs_inode *inode, u64 size)
  360. {
  361. i_size_write(&inode->vfs_inode, size);
  362. inode->disk_i_size = size;
  363. }
  364. static inline bool btrfs_is_free_space_inode(const struct btrfs_inode *inode)
  365. {
  366. return test_bit(BTRFS_INODE_FREE_SPACE_INODE, &inode->runtime_flags);
  367. }
  368. static inline bool is_data_inode(const struct btrfs_inode *inode)
  369. {
  370. return btrfs_ino(inode) != BTRFS_BTREE_INODE_OBJECTID;
  371. }
  372. static inline void btrfs_mod_outstanding_extents(struct btrfs_inode *inode,
  373. int mod)
  374. {
  375. lockdep_assert_held(&inode->lock);
  376. inode->outstanding_extents += mod;
  377. if (btrfs_is_free_space_inode(inode))
  378. return;
  379. trace_btrfs_inode_mod_outstanding_extents(inode->root, btrfs_ino(inode),
  380. mod, inode->outstanding_extents);
  381. }
  382. /*
  383. * Called every time after doing a buffered, direct IO or memory mapped write.
  384. *
  385. * This is to ensure that if we write to a file that was previously fsynced in
  386. * the current transaction, then try to fsync it again in the same transaction,
  387. * we will know that there were changes in the file and that it needs to be
  388. * logged.
  389. */
  390. static inline void btrfs_set_inode_last_sub_trans(struct btrfs_inode *inode)
  391. {
  392. spin_lock(&inode->lock);
  393. inode->last_sub_trans = inode->root->log_transid;
  394. spin_unlock(&inode->lock);
  395. }
  396. /*
  397. * Should be called while holding the inode's VFS lock in exclusive mode, or
  398. * while holding the inode's mmap lock (struct btrfs_inode::i_mmap_lock) in
  399. * either shared or exclusive mode, or in a context where no one else can access
  400. * the inode concurrently (during inode creation or when loading an inode from
  401. * disk).
  402. */
  403. static inline void btrfs_set_inode_full_sync(struct btrfs_inode *inode)
  404. {
  405. set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags);
  406. /*
  407. * The inode may have been part of a reflink operation in the last
  408. * transaction that modified it, and then a fsync has reset the
  409. * last_reflink_trans to avoid subsequent fsyncs in the same
  410. * transaction to do unnecessary work. So update last_reflink_trans
  411. * to the last_trans value (we have to be pessimistic and assume a
  412. * reflink happened).
  413. *
  414. * The ->last_trans is protected by the inode's spinlock and we can
  415. * have a concurrent ordered extent completion update it. Also set
  416. * last_reflink_trans to ->last_trans only if the former is less than
  417. * the later, because we can be called in a context where
  418. * last_reflink_trans was set to the current transaction generation
  419. * while ->last_trans was not yet updated in the current transaction,
  420. * and therefore has a lower value.
  421. */
  422. spin_lock(&inode->lock);
  423. if (inode->last_reflink_trans < inode->last_trans)
  424. inode->last_reflink_trans = inode->last_trans;
  425. spin_unlock(&inode->lock);
  426. }
  427. static inline bool btrfs_inode_in_log(struct btrfs_inode *inode, u64 generation)
  428. {
  429. bool ret = false;
  430. spin_lock(&inode->lock);
  431. if (inode->logged_trans == generation &&
  432. inode->last_sub_trans <= inode->last_log_commit &&
  433. inode->last_sub_trans <= btrfs_get_root_last_log_commit(inode->root))
  434. ret = true;
  435. spin_unlock(&inode->lock);
  436. return ret;
  437. }
  438. /*
  439. * Check if the inode has flags compatible with compression
  440. */
  441. static inline bool btrfs_inode_can_compress(const struct btrfs_inode *inode)
  442. {
  443. if (inode->flags & BTRFS_INODE_NODATACOW ||
  444. inode->flags & BTRFS_INODE_NODATASUM)
  445. return false;
  446. return true;
  447. }
  448. static inline void btrfs_assert_inode_locked(struct btrfs_inode *inode)
  449. {
  450. /* Immediately trigger a crash if the inode is not locked. */
  451. ASSERT(inode_is_locked(&inode->vfs_inode));
  452. /* Trigger a splat in dmesg if this task is not holding the lock. */
  453. lockdep_assert_held(&inode->vfs_inode.i_rwsem);
  454. }
  455. static inline void btrfs_update_inode_mapping_flags(struct btrfs_inode *inode)
  456. {
  457. if (inode->flags & BTRFS_INODE_NODATASUM)
  458. mapping_clear_stable_writes(inode->vfs_inode.i_mapping);
  459. else
  460. mapping_set_stable_writes(inode->vfs_inode.i_mapping);
  461. }
  462. static inline void btrfs_set_inode_mapping_order(struct btrfs_inode *inode)
  463. {
  464. /* Metadata inode should not reach here. */
  465. ASSERT(is_data_inode(inode));
  466. /* We only allow BITS_PER_LONGS blocks for each bitmap. */
  467. #ifdef CONFIG_BTRFS_EXPERIMENTAL
  468. mapping_set_folio_order_range(inode->vfs_inode.i_mapping,
  469. inode->root->fs_info->block_min_order,
  470. inode->root->fs_info->block_max_order);
  471. #endif
  472. }
  473. void btrfs_calculate_block_csum_folio(struct btrfs_fs_info *fs_info,
  474. const phys_addr_t paddr, u8 *dest);
  475. void btrfs_calculate_block_csum_pages(struct btrfs_fs_info *fs_info,
  476. const phys_addr_t paddrs[], u8 *dest);
  477. int btrfs_check_block_csum(struct btrfs_fs_info *fs_info, phys_addr_t paddr, u8 *csum,
  478. const u8 * const csum_expected);
  479. bool btrfs_data_csum_ok(struct btrfs_bio *bbio, struct btrfs_device *dev,
  480. u32 bio_offset, const phys_addr_t paddrs[]);
  481. noinline int can_nocow_extent(struct btrfs_inode *inode, u64 offset, u64 *len,
  482. struct btrfs_file_extent *file_extent,
  483. bool nowait);
  484. void btrfs_del_delalloc_inode(struct btrfs_inode *inode);
  485. struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry);
  486. int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index);
  487. int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
  488. struct btrfs_inode *dir, struct btrfs_inode *inode,
  489. const struct fscrypt_str *name);
  490. int btrfs_add_link(struct btrfs_trans_handle *trans,
  491. struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
  492. const struct fscrypt_str *name, bool add_backref, u64 index);
  493. int btrfs_delete_subvolume(struct btrfs_inode *dir, struct dentry *dentry);
  494. int btrfs_truncate_block(struct btrfs_inode *inode, u64 offset, u64 start, u64 end);
  495. int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context);
  496. int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
  497. bool in_reclaim_context);
  498. int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
  499. unsigned int extra_bits,
  500. struct extent_state **cached_state);
  501. struct btrfs_new_inode_args {
  502. /* Input */
  503. struct inode *dir;
  504. struct dentry *dentry;
  505. struct inode *inode;
  506. bool orphan;
  507. bool subvol;
  508. /* Output from btrfs_new_inode_prepare(), input to btrfs_create_new_inode(). */
  509. struct posix_acl *default_acl;
  510. struct posix_acl *acl;
  511. struct fscrypt_name fname;
  512. };
  513. int btrfs_new_inode_prepare(struct btrfs_new_inode_args *args,
  514. unsigned int *trans_num_items);
  515. int btrfs_create_new_inode(struct btrfs_trans_handle *trans,
  516. struct btrfs_new_inode_args *args);
  517. void btrfs_new_inode_args_destroy(struct btrfs_new_inode_args *args);
  518. struct inode *btrfs_new_subvol_inode(struct mnt_idmap *idmap,
  519. struct inode *dir);
  520. void btrfs_set_delalloc_extent(struct btrfs_inode *inode, struct extent_state *state,
  521. u32 bits);
  522. void btrfs_clear_delalloc_extent(struct btrfs_inode *inode,
  523. struct extent_state *state, u32 bits);
  524. void btrfs_merge_delalloc_extent(struct btrfs_inode *inode, struct extent_state *new,
  525. struct extent_state *other);
  526. void btrfs_split_delalloc_extent(struct btrfs_inode *inode,
  527. struct extent_state *orig, u64 split);
  528. void btrfs_evict_inode(struct inode *inode);
  529. struct inode *btrfs_alloc_inode(struct super_block *sb);
  530. void btrfs_destroy_inode(struct inode *inode);
  531. void btrfs_free_inode(struct inode *inode);
  532. int btrfs_drop_inode(struct inode *inode);
  533. int __init btrfs_init_cachep(void);
  534. void __cold btrfs_destroy_cachep(void);
  535. struct btrfs_inode *btrfs_iget_path(u64 ino, struct btrfs_root *root,
  536. struct btrfs_path *path);
  537. struct btrfs_inode *btrfs_iget(u64 ino, struct btrfs_root *root);
  538. struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
  539. struct folio *folio, u64 start, u64 len);
  540. int btrfs_update_inode(struct btrfs_trans_handle *trans,
  541. struct btrfs_inode *inode);
  542. int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
  543. struct btrfs_inode *inode);
  544. int btrfs_orphan_add(struct btrfs_trans_handle *trans, struct btrfs_inode *inode);
  545. int btrfs_orphan_cleanup(struct btrfs_root *root);
  546. int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size);
  547. void btrfs_add_delayed_iput(struct btrfs_inode *inode);
  548. void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info);
  549. int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info);
  550. int btrfs_prealloc_file_range(struct inode *inode, int mode,
  551. u64 start, u64 num_bytes, u64 min_size,
  552. loff_t actual_len, u64 *alloc_hint);
  553. int btrfs_prealloc_file_range_trans(struct inode *inode,
  554. struct btrfs_trans_handle *trans, int mode,
  555. u64 start, u64 num_bytes, u64 min_size,
  556. loff_t actual_len, u64 *alloc_hint);
  557. int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct folio *locked_folio,
  558. u64 start, u64 end, struct writeback_control *wbc);
  559. int btrfs_writepage_cow_fixup(struct folio *folio);
  560. int btrfs_encoded_io_compression_from_extent(struct btrfs_fs_info *fs_info,
  561. int compress_type);
  562. int btrfs_encoded_read_regular_fill_pages(struct btrfs_inode *inode,
  563. u64 disk_bytenr, u64 disk_io_size,
  564. struct page **pages, void *uring_ctx);
  565. ssize_t btrfs_encoded_read(struct kiocb *iocb, struct iov_iter *iter,
  566. struct btrfs_ioctl_encoded_io_args *encoded,
  567. struct extent_state **cached_state,
  568. u64 *disk_bytenr, u64 *disk_io_size);
  569. ssize_t btrfs_encoded_read_regular(struct kiocb *iocb, struct iov_iter *iter,
  570. u64 start, u64 lockend,
  571. struct extent_state **cached_state,
  572. u64 disk_bytenr, u64 disk_io_size,
  573. size_t count, bool compressed, bool *unlocked);
  574. ssize_t btrfs_do_encoded_write(struct kiocb *iocb, struct iov_iter *from,
  575. const struct btrfs_ioctl_encoded_io_args *encoded);
  576. struct btrfs_inode *btrfs_find_first_inode(struct btrfs_root *root, u64 min_ino);
  577. extern const struct dentry_operations btrfs_dentry_operations;
  578. /* Inode locking type flags, by default the exclusive lock is taken. */
  579. enum btrfs_ilock_type {
  580. ENUM_BIT(BTRFS_ILOCK_SHARED),
  581. ENUM_BIT(BTRFS_ILOCK_TRY),
  582. ENUM_BIT(BTRFS_ILOCK_MMAP),
  583. };
  584. int btrfs_inode_lock(struct btrfs_inode *inode, unsigned int ilock_flags);
  585. void btrfs_inode_unlock(struct btrfs_inode *inode, unsigned int ilock_flags);
  586. void btrfs_update_inode_bytes(struct btrfs_inode *inode, const u64 add_bytes,
  587. const u64 del_bytes);
  588. void btrfs_assert_inode_range_clean(struct btrfs_inode *inode, u64 start, u64 end);
  589. u64 btrfs_get_extent_allocation_hint(struct btrfs_inode *inode, u64 start,
  590. u64 num_bytes);
  591. struct extent_map *btrfs_create_io_em(struct btrfs_inode *inode, u64 start,
  592. const struct btrfs_file_extent *file_extent,
  593. int type);
  594. #endif