| /linux/fs/bcachefs/ |
| H A D | io_misc.c | 24 subvol_inum inum, in bch2_extent_fallocate() argument
111 ret = bch2_extent_update(trans, inum, iter, new.k, &disk_res, in bch2_extent_fallocate()
118 inum.inum, in bch2_extent_fallocate()
139 subvol_inum inum, u64 end, in bch2_fpunch_at() argument
144 struct bpos end_pos = POS(inum.inum, end); in bch2_fpunch_at()
160 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot); in bch2_fpunch_at()
184 ret = bch2_extent_update(trans, inum, iter, &delete, in bch2_fpunch_at()
192 int bch2_fpunch(struct bch_fs *c, subvol_inum inum, u64 start, u64 end, in bch2_fpunch() argument
200 POS(inum.inum, start), in bch2_fpunch()
203 ret = bch2_fpunch_at(trans, &iter, inum, end, i_sectors_delta); in bch2_fpunch()
[all …]
|
| H A D | str_hash.h | 140 bool (*is_visible)(subvol_inum inum, struct bkey_s_c);
143 static inline bool is_visible_key(struct bch_hash_desc desc, subvol_inum inum, struct bkey_s_c k) in is_visible_key() argument
147 !inum.inum || in is_visible_key()
148 desc.is_visible(inum, k)); in is_visible_key()
156 subvol_inum inum, const void *key, in bch2_hash_lookup_in_snapshot() argument
164 SPOS(inum.inum, desc.hash_key(info, key), snapshot), in bch2_hash_lookup_in_snapshot()
165 POS(inum.inum, U64_MAX), in bch2_hash_lookup_in_snapshot()
167 if (is_visible_key(desc, inum, k)) { in bch2_hash_lookup_in_snapshot()
187 subvol_inum inum, const void *key, in bch2_hash_lookup() argument
191 int ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot); in bch2_hash_lookup()
[all …]
|
| H A D | fs-common.c | 69 if (!snapshot_src.inum) { in bch2_create_trans()
78 snapshot_src.inum = le64_to_cpu(s.inode); in bch2_create_trans()
104 new_inum.inum = new_inode->bi_inum; in bch2_create_trans()
188 subvol_inum inum, struct bch_inode_unpacked *inode_u, in bch2_link_trans() argument
199 if (dir.subvol != inum.subvol) in bch2_link_trans()
202 ret = bch2_inode_peek(trans, &inode_iter, inode_u, inum, BTREE_ITER_intent); in bch2_link_trans()
226 name, inum.inum, &dir_offset, in bch2_link_trans()
231 inode_u->bi_dir = dir.inum; in bch2_link_trans()
254 subvol_inum inum; in bch2_unlink_trans() local
266 name, &inum, BTREE_ITER_intent); in bch2_unlink_trans()
[all …]
|
| H A D | inode.c | 338 subvol_inum inum, unsigned flags, in __bch2_inode_peek() argument
342 int ret = __bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot, warn); in __bch2_inode_peek()
347 SPOS(0, inum.inum, snapshot), in __bch2_inode_peek()
364 bch_err_msg(trans->c, ret, "looking up inum %llu:%llu:", inum.subvol, inum.inum); in __bch2_inode_peek()
944 subvol_inum inum, enum btree_id id) in bch2_inode_delete_keys() argument
949 struct bpos end = POS(inum.inum, U64_MAX); in bch2_inode_delete_keys()
957 bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0), in bch2_inode_delete_keys()
963 ret = bch2_subvolume_get_snapshot(trans, inum.subvol, &snapshot); in bch2_inode_delete_keys()
997 int bch2_inode_rm(struct bch_fs *c, subvol_inum inum) in bch2_inode_rm() argument
1015 ret = bch2_inode_delete_keys(trans, inum, BTREE_ID_extents) ?: in bch2_inode_rm()
[all …]
|
| H A D | dirent.c | 84 static bool dirent_is_visible(subvol_inum inum, struct bkey_s_c k) in dirent_is_visible() argument
89 return le32_to_cpu(d.v->d_parent_subvol) == inum.subvol; in dirent_is_visible()
212 subvol_inum dir_inum = { .subvol = dir_subvol, .inum = dir }; in bch2_dirent_create_snapshot()
265 target->inum = le64_to_cpu(d.v->d_inum); in bch2_dirent_read_target()
271 target->inum = le64_to_cpu(s.inode); in bch2_dirent_read_target()
289 POS(dst_dir.inum, bch2_dirent_hash(dst_hash, dst_name)); in bch2_dirent_rename()
465 const struct qstr *name, subvol_inum *inum, in bch2_dirent_lookup_trans() argument
474 ret = bch2_dirent_read_target(trans, dir, bkey_s_c_to_dirent(k), inum); in bch2_dirent_lookup_trans()
485 const struct qstr *name, subvol_inum *inum) in bch2_dirent_lookup() argument
491 bch2_dirent_lookup_trans(trans, &iter, dir, hash_info, name, inum, 0)); in bch2_dirent_lookup()
[all …]
|
| H A D | fs.c | 114 inode_inum(inode).inum); in bch2_write_inode()
157 return a.subvol == b.subvol && a.inum == b.inum; in subvol_inum_eq()
162 const subvol_inum *inum = data; in bch2_vfs_inode_hash_fn() local
164 return jhash(&inum->inum, sizeof(inum->inum), seed); in bch2_vfs_inode_hash_fn()
197 subvol_inum inum = (subvol_inum) { .inum = p.offset }; in bch2_inode_or_descendents_is_open()
224 hash = rht_key_hashfn(ht, tbl, &inum, bch2_vfs_inodes_params); in bch2_inode_or_descendents_is_open()
230 if (inode->ei_inum.inum == inum.inum) { in bch2_inode_or_descendents_is_open()
271 static struct bch_inode_info *__bch2_inode_hash_find(struct bch_fs *c, subvol_inum inum) in __bch2_inode_hash_find() argument
273 return rhashtable_lookup_fast(&c->vfs_inodes_table, &inum, bch2_vfs_inodes_params); in __bch2_inode_hash_find()
278 subvol_inum inum) in __wait_on_freeing_inode() argument
[all …]
|
| H A D | fsck.c | 71 static s64 bch2_count_inode_sectors(struct btree_trans *trans, u64 inum, in bch2_count_inode_sectors() argument
77 SPOS(inum, 0, snapshot), in bch2_count_inode_sectors()
78 POS(inum, U64_MAX), in bch2_count_inode_sectors()
88 static s64 bch2_count_subdirs(struct btree_trans *trans, u64 inum, in bch2_count_subdirs() argument
94 SPOS(inum, 0, snapshot), in bch2_count_subdirs()
95 POS(inum, U64_MAX), in bch2_count_subdirs()
107 u32 *snapshot, u64 *inum) in subvol_lookup() argument
113 *inum = le64_to_cpu(s.inode); in subvol_lookup()
213 u64 inum = 0; in lookup_lostfound() local
246 root_inum.inum = le64_to_cpu(subvol.inode); in lookup_lostfound()
[all …]
|
| H A D | rebalance.c | 36 static int __bch2_set_rebalance_needs_scan(struct btree_trans *trans, u64 inum) in __bch2_set_rebalance_needs_scan() argument
45 SPOS(inum, REBALANCE_WORK_SCAN_OFFSET, U32_MAX), in __bch2_set_rebalance_needs_scan()
71 int bch2_set_rebalance_needs_scan(struct bch_fs *c, u64 inum) in bch2_set_rebalance_needs_scan() argument
76 __bch2_set_rebalance_needs_scan(trans, inum)); in bch2_set_rebalance_needs_scan()
86 static int bch2_clear_rebalance_needs_scan(struct btree_trans *trans, u64 inum, u64 cookie) in bch2_clear_rebalance_needs_scan() argument
94 SPOS(inum, REBALANCE_WORK_SCAN_OFFSET, U32_MAX), in bch2_clear_rebalance_needs_scan()
274 static int do_rebalance_scan(struct moving_context *ctxt, u64 inum, u64 cookie) in do_rebalance_scan() argument
283 if (!inum) { in do_rebalance_scan()
287 r->scan_start = BBPOS(BTREE_ID_extents, POS(inum, 0)); in do_rebalance_scan()
288 r->scan_end = BBPOS(BTREE_ID_extents, POS(inum, U64_MAX)); in do_rebalance_scan()
[all …]
|
| H A D | disk_accounting_format.h | 107 x(inum, 8)
141 __u64 inum; member
160 struct bch_acct_inum inum; member
|
| H A D | inode.h | 117 subvol_inum inum, unsigned flags) in bch2_inode_peek_nowarn() argument
119 return __bch2_inode_peek(trans, iter, inode, inum, flags, false); in bch2_inode_peek_nowarn()
125 subvol_inum inum, unsigned flags) in bch2_inode_peek() argument
127 return __bch2_inode_peek(trans, iter, inode, inum, flags, true); in bch2_inode_peek()
128 int ret = bch2_inode_peek_nowarn(trans, iter, inode, inum, flags); in bch2_inode_peek()
|
| H A D | logged_ops_format.h | 9 __le64 inum; member
24 __le64 inum; member
|
| H A D | io_read.h | 128 subvol_inum inum) in bch2_read() argument
136 rbio->subvol = inum.subvol; in bch2_read()
138 __bch2_read(c, rbio, rbio->bio.bi_iter, inum, &failed, in bch2_read()
|
| H A D | acl.h | 43 static inline int bch2_set_acl_trans(struct btree_trans *trans, subvol_inum inum, in bch2_set_acl_trans() argument
50 static inline int bch2_acl_chmod(struct btree_trans *trans, subvol_inum inum, in bch2_acl_chmod() argument
|
| H A D | xattr.c | 164 int bch2_xattr_set(struct btree_trans *trans, subvol_inum inum, in bch2_xattr_set() argument
174 ret = bch2_subvol_is_ro_trans(trans, inum.subvol) ?: in bch2_xattr_set()
175 bch2_inode_peek(trans, &inode_iter, inode_u, inum, BTREE_ITER_intent); in bch2_xattr_set()
209 inum, &xattr->k_i, in bch2_xattr_set()
217 hash_info, inum, &search); in bch2_xattr_set()
309 u64 offset = 0, inum = inode->ei_inode.bi_inum; in bch2_xattr_list() local
313 POS(inum, offset), in bch2_xattr_list()
314 POS(inum, U64_MAX), in bch2_xattr_list()
|
| /linux/fs/ubifs/ |
| H A D | key.h | 91 union ubifs_key *key, ino_t inum) in ino_key_init() argument
93 key->u32[0] = inum; in ino_key_init()
104 ino_t inum) in ino_key_init_flash() argument
108 key->j32[0] = cpu_to_le32(inum); in ino_key_init_flash()
120 union ubifs_key *key, ino_t inum) in lowest_ino_key() argument
122 key->u32[0] = inum; in lowest_ino_key()
133 union ubifs_key *key, ino_t inum) in highest_ino_key() argument
135 key->u32[0] = inum; in highest_ino_key()
147 union ubifs_key *key, ino_t inum, in dent_key_init() argument
153 key->u32[0] = inum; in dent_key_init()
[all …]
|
| H A D | orphan.c | 53 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum) in ubifs_add_orphan() argument
61 orphan->inum = inum; in ubifs_add_orphan()
74 if (inum < o->inum) in ubifs_add_orphan()
76 else if (inum > o->inum) in ubifs_add_orphan()
79 ubifs_err(c, "ino %lu orphaned twice", (unsigned long)inum); in ubifs_add_orphan()
93 dbg_gen("ino %lu", (unsigned long)inum); in ubifs_add_orphan()
97 static struct ubifs_orphan *lookup_orphan(struct ubifs_info *c, ino_t inum) in lookup_orphan() argument
105 if (inum < o->inum) in lookup_orphan()
107 else if (inum > o->inum) in lookup_orphan()
133 dbg_gen("deleted twice ino %lu", (unsigned long)orph->inum); in orphan_delete()
[all …]
|
| H A D | recovery.c | 1231 ino_t inum; member
1246 static int add_ino(struct ubifs_info *c, ino_t inum, loff_t i_size, in add_ino() argument
1255 if (inum < e->inum) in add_ino()
1265 e->inum = inum; in add_ino()
1281 static struct size_entry *find_ino(struct ubifs_info *c, ino_t inum) in find_ino() argument
1288 if (inum < e->inum) in find_ino()
1290 else if (inum > e->inum) in find_ino()
1303 static void remove_ino(struct ubifs_info *c, ino_t inum) in remove_ino() argument
1305 struct size_entry *e = find_ino(c, inum); in remove_ino()
1357 ino_t inum = key_inum(c, key); in ubifs_recover_size_accum() local
[all …]
|
| H A D | debug.c | 281 count++, (unsigned long long) le64_to_cpu(dent->inum), in ubifs_dump_inode()
481 (unsigned long long)le64_to_cpu(dent->inum)); in ubifs_dump_node()
521 pr_err("\tinum %u\n", le32_to_cpu(trun->inum)); in ubifs_dump_node()
1785 ino_t inum; member
1824 ino_t inum = key_inum_flash(c, &ino->key); in add_inode() local
1832 if (inum < fscki->inum) in add_inode()
1834 else if (inum > fscki->inum) in add_inode()
1840 if (inum > c->highest_inum) { in add_inode()
1850 inode = ilookup(c->vfs_sb, inum); in add_inode()
1852 fscki->inum = inum; in add_inode()
[all …]
|
| /linux/include/linux/ |
| H A D | proc_ns.h | 54 extern void proc_free_inum(unsigned int inum);
58 static inline int proc_alloc_inum(unsigned int *inum) in proc_alloc_inum() argument
60 *inum = 1; in proc_alloc_inum()
63 static inline void proc_free_inum(unsigned int inum) {} in proc_free_inum() argument
70 return proc_alloc_inum(&ns->inum); in ns_alloc_inum()
73 #define ns_free_inum(ns) proc_free_inum((ns)->inum)
|
| /linux/fs/gfs2/ |
| H A D | trace_gfs2.h | 447 __field( u64, inum )
458 __entry->inum = ip->i_no_addr;
467 (unsigned long long)__entry->inum,
484 __field( u64, inum )
492 __entry->inum = ip->i_no_addr;
500 (unsigned long long)__entry->inum,
513 __field( u64, inum )
524 __entry->inum = ip->i_no_addr;
536 (unsigned long long)__entry->inum,
555 __field( u64, inum )
[all …]
|
| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | type_cast.c | 20 unsigned int inum; variable
31 inum = dev->nd_net.net->ns.inum; in md_xdp()
|
| /linux/include/trace/events/ |
| H A D | handshake.h | 105 __entry->netns_ino = net->ns.inum;
138 __entry->netns_ino = net->ns.inum;
172 __entry->netns_ino = net->ns.inum;
210 __entry->netns_ino = sock_net(sk)->ns.inum;
260 __entry->netns_ino = net->ns.inum;
301 __entry->netns_ino = sock_net(sk)->ns.inum;
|
| /linux/fs/nfs/ |
| H A D | callback.c | 54 nn->nfs_callback_tcpport, PF_INET, net->ns.inum); in nfs4_callback_up_net()
62 nn->nfs_callback_tcpport6, PF_INET6, net->ns.inum); in nfs4_callback_up_net()
138 dprintk("NFS: destroy per-net callback data; net=%x\n", net->ns.inum); in nfs_callback_down_net()
151 dprintk("NFS: create per-net callback data; net=%x\n", net->ns.inum); in nfs_callback_up_net()
178 "net = %x\n", ret, net->ns.inum); in nfs_callback_up_net()
|
| /linux/fs/jfs/ |
| H A D | jfs_imap.c | 418 struct inode *diReadSpecial(struct super_block *sb, ino_t inum, int secondary) in diReadSpecial() argument
440 ASSERT(inum < INOSPEREXT); in diReadSpecial()
442 ip->i_ino = inum; in diReadSpecial()
444 address += inum >> 3; /* 8 inodes per 4K page */ in diReadSpecial()
456 dp += inum % 8; /* 8 inodes per 4K page */ in diReadSpecial()
475 if ((inum == FILESYSTEM_I) && (JFS_IP(ip)->ipimap == sbi->ipaimap)) { in diReadSpecial()
505 ino_t inum = ip->i_ino; in diWriteSpecial() local
513 ASSERT(inum < INOSPEREXT); in diWriteSpecial()
515 address += inum >> 3; /* 8 inodes per 4K page */ in diWriteSpecial()
526 dp += inum % 8; /* 8 inodes per 4K page */ in diWriteSpecial()
[all …]
|
| /linux/fs/xfs/scrub/ |
| H A D | common.h | 176 int xchk_iget(struct xfs_scrub *sc, xfs_ino_t inum, struct xfs_inode **ipp);
177 int xchk_iget_agi(struct xfs_scrub *sc, xfs_ino_t inum,
188 xchk_iget_safe(struct xfs_scrub *sc, xfs_ino_t inum, struct xfs_inode **ipp) in xchk_iget_safe() argument
197 error = xchk_iget(sc, inum, ipp); in xchk_iget_safe()
|