1 /* SPDX-License-Identifier: GPL-2.0 */ 2 #ifndef _BCACHEFS_FS_H 3 #define _BCACHEFS_FS_H 4 5 #include "inode.h" 6 #include "opts.h" 7 #include "str_hash.h" 8 #include "quota_types.h" 9 #include "two_state_shared_lock.h" 10 11 #include <linux/seqlock.h> 12 #include <linux/stat.h> 13 14 struct bch_inode_info { 15 struct inode v; 16 struct list_head ei_vfs_inode_list; 17 unsigned long ei_flags; 18 19 struct mutex ei_update_lock; 20 u64 ei_quota_reserved; 21 unsigned long ei_last_dirtied; 22 two_state_lock_t ei_pagecache_lock; 23 24 struct mutex ei_quota_lock; 25 struct bch_qid ei_qid; 26 27 u32 ei_subvol; 28 29 /* 30 * When we've been doing nocow writes we'll need to issue flushes to the 31 * underlying block devices 32 * 33 * XXX: a device may have had a flush issued by some other codepath. It 34 * would be better to keep for each device a sequence number that's 35 * incremented when we isusue a cache flush, and track here the sequence 36 * number that needs flushing. 37 */ 38 struct bch_devs_mask ei_devs_need_flush; 39 40 /* copy of inode in btree: */ 41 struct bch_inode_unpacked ei_inode; 42 }; 43 44 #define bch2_pagecache_add_put(i) bch2_two_state_unlock(&i->ei_pagecache_lock, 0) 45 #define bch2_pagecache_add_tryget(i) bch2_two_state_trylock(&i->ei_pagecache_lock, 0) 46 #define bch2_pagecache_add_get(i) bch2_two_state_lock(&i->ei_pagecache_lock, 0) 47 48 #define bch2_pagecache_block_put(i) bch2_two_state_unlock(&i->ei_pagecache_lock, 1) 49 #define bch2_pagecache_block_get(i) bch2_two_state_lock(&i->ei_pagecache_lock, 1) 50 51 static inline subvol_inum inode_inum(struct bch_inode_info *inode) 52 { 53 return (subvol_inum) { 54 .subvol = inode->ei_subvol, 55 .inum = inode->ei_inode.bi_inum, 56 }; 57 } 58 59 struct bch_inode_info *__bch2_inode_hash_find(struct bch_fs *, subvol_inum); 60 61 /* 62 * Set if we've gotten a btree error for this inode, and thus the vfs inode and 63 * btree inode may be inconsistent: 64 */ 65 #define EI_INODE_ERROR 0 66 67 /* 68 * Set in the inode is in a snapshot subvolume - we don't do quota accounting in 69 * those: 70 */ 71 #define EI_INODE_SNAPSHOT 1 72 73 #define to_bch_ei(_inode) \ 74 container_of_or_null(_inode, struct bch_inode_info, v) 75 76 static inline int ptrcmp(void *l, void *r) 77 { 78 return cmp_int(l, r); 79 } 80 81 enum bch_inode_lock_op { 82 INODE_PAGECACHE_BLOCK = (1U << 0), 83 INODE_UPDATE_LOCK = (1U << 1), 84 }; 85 86 #define bch2_lock_inodes(_locks, ...) \ 87 do { \ 88 struct bch_inode_info *a[] = { NULL, __VA_ARGS__ }; \ 89 unsigned i; \ 90 \ 91 bubble_sort(&a[1], ARRAY_SIZE(a) - 1, ptrcmp); \ 92 \ 93 for (i = 1; i < ARRAY_SIZE(a); i++) \ 94 if (a[i] != a[i - 1]) { \ 95 if ((_locks) & INODE_PAGECACHE_BLOCK) \ 96 bch2_pagecache_block_get(a[i]);\ 97 if ((_locks) & INODE_UPDATE_LOCK) \ 98 mutex_lock_nested(&a[i]->ei_update_lock, i);\ 99 } \ 100 } while (0) 101 102 #define bch2_unlock_inodes(_locks, ...) \ 103 do { \ 104 struct bch_inode_info *a[] = { NULL, __VA_ARGS__ }; \ 105 unsigned i; \ 106 \ 107 bubble_sort(&a[1], ARRAY_SIZE(a) - 1, ptrcmp); \ 108 \ 109 for (i = 1; i < ARRAY_SIZE(a); i++) \ 110 if (a[i] != a[i - 1]) { \ 111 if ((_locks) & INODE_PAGECACHE_BLOCK) \ 112 bch2_pagecache_block_put(a[i]);\ 113 if ((_locks) & INODE_UPDATE_LOCK) \ 114 mutex_unlock(&a[i]->ei_update_lock); \ 115 } \ 116 } while (0) 117 118 static inline struct bch_inode_info *file_bch_inode(struct file *file) 119 { 120 return to_bch_ei(file_inode(file)); 121 } 122 123 static inline bool inode_attr_changing(struct bch_inode_info *dir, 124 struct bch_inode_info *inode, 125 enum inode_opt_id id) 126 { 127 return !(inode->ei_inode.bi_fields_set & (1 << id)) && 128 bch2_inode_opt_get(&dir->ei_inode, id) != 129 bch2_inode_opt_get(&inode->ei_inode, id); 130 } 131 132 static inline bool inode_attrs_changing(struct bch_inode_info *dir, 133 struct bch_inode_info *inode) 134 { 135 unsigned id; 136 137 for (id = 0; id < Inode_opt_nr; id++) 138 if (inode_attr_changing(dir, inode, id)) 139 return true; 140 141 return false; 142 } 143 144 struct bch_inode_unpacked; 145 146 #ifndef NO_BCACHEFS_FS 147 148 struct bch_inode_info * 149 __bch2_create(struct mnt_idmap *, struct bch_inode_info *, 150 struct dentry *, umode_t, dev_t, subvol_inum, unsigned); 151 152 int bch2_fs_quota_transfer(struct bch_fs *, 153 struct bch_inode_info *, 154 struct bch_qid, 155 unsigned, 156 enum quota_acct_mode); 157 158 static inline int bch2_set_projid(struct bch_fs *c, 159 struct bch_inode_info *inode, 160 u32 projid) 161 { 162 struct bch_qid qid = inode->ei_qid; 163 164 qid.q[QTYP_PRJ] = projid; 165 166 return bch2_fs_quota_transfer(c, inode, qid, 167 1 << QTYP_PRJ, 168 KEY_TYPE_QUOTA_PREALLOC); 169 } 170 171 struct inode *bch2_vfs_inode_get(struct bch_fs *, subvol_inum); 172 173 /* returns 0 if we want to do the update, or error is passed up */ 174 typedef int (*inode_set_fn)(struct btree_trans *, 175 struct bch_inode_info *, 176 struct bch_inode_unpacked *, void *); 177 178 void bch2_inode_update_after_write(struct btree_trans *, 179 struct bch_inode_info *, 180 struct bch_inode_unpacked *, 181 unsigned); 182 int __must_check bch2_write_inode(struct bch_fs *, struct bch_inode_info *, 183 inode_set_fn, void *, unsigned); 184 185 int bch2_setattr_nonsize(struct mnt_idmap *, 186 struct bch_inode_info *, 187 struct iattr *); 188 int __bch2_unlink(struct inode *, struct dentry *, bool); 189 190 void bch2_evict_subvolume_inodes(struct bch_fs *, snapshot_id_list *); 191 192 void bch2_vfs_exit(void); 193 int bch2_vfs_init(void); 194 195 #else 196 197 #define bch2_inode_update_after_write(_trans, _inode, _inode_u, _fields) ({ do {} while (0); }) 198 199 static inline struct bch_inode_info *__bch2_inode_hash_find(struct bch_fs *c, subvol_inum inum) 200 { 201 return NULL; 202 } 203 204 static inline void bch2_evict_subvolume_inodes(struct bch_fs *c, 205 snapshot_id_list *s) {} 206 static inline void bch2_vfs_exit(void) {} 207 static inline int bch2_vfs_init(void) { return 0; } 208 209 #endif /* NO_BCACHEFS_FS */ 210 211 #endif /* _BCACHEFS_FS_H */ 212