Home
last modified time | relevance | path

Searched refs:inum (Results 1 – 25 of 87) sorted by relevance

1234

/fs/bcachefs/
A Dio_misc.c24 subvol_inum inum, in bch2_extent_fallocate() argument
174 struct bpos end_pos = POS(inum.inum, end); in bch2_fpunch_at()
230 POS(inum.inum, start), in bch2_fpunch()
290 POS(inum.inum, round_up(new_i_size, block_bytes(c)) >> 9), in __bch2_resume_logged_op_truncate()
314 op.v.inum = cpu_to_le64(inum.inum); in bch2_truncate()
415 POS(inum.inum, 0), in __bch2_resume_logged_op_finsert()
446 struct bpos src_pos = POS(inum.inum, src_offset); in __bch2_resume_logged_op_finsert()
459 ? bch2_btree_iter_peek_prev_min(trans, &iter, POS(inum.inum, 0)) in __bch2_resume_logged_op_finsert()
465 k.k->p.inode != inum.inum || in __bch2_resume_logged_op_finsert()
466 bkey_le(k.k->p, POS(inum.inum, src_offset))) in __bch2_resume_logged_op_finsert()
[all …]
A Dstr_hash.h146 !inum.inum || in is_visible_key()
147 desc.is_visible(inum, k)); in is_visible_key()
155 subvol_inum inum, const void *key, in bch2_hash_lookup_in_snapshot() argument
163 SPOS(inum.inum, desc.hash_key(info, key), snapshot), in bch2_hash_lookup_in_snapshot()
164 POS(inum.inum, U64_MAX), in bch2_hash_lookup_in_snapshot()
186 subvol_inum inum, const void *key, in bch2_hash_lookup() argument
213 SPOS(inum.inum, desc.hash_key(info, key), snapshot), in bch2_hash_hole()
214 POS(inum.inum, U64_MAX), in bch2_hash_hole()
216 if (!is_visible_key(desc, inum, k)) in bch2_hash_hole()
340 subvol_inum inum, in bch2_hash_set() argument
[all …]
A Dnamei.c18 .inum = inode->bi_dir, in parent_inum()
243 name, inum.inum, in bch2_link_trans()
272 subvol_inum inum; in bch2_unlink_trans() local
451 if (dst_inum.inum) { in bch2_rename_trans()
564 if (src_dir.inum != dst_dir.inum) { in bch2_rename_trans()
571 if (dst_inum.inum) in bch2_rename_trans()
575 (src_dir.inum != dst_dir.inum in bch2_rename_trans()
579 (dst_inum.inum in bch2_rename_trans()
662 inum = inode.bi_dir; in __bch2_inum_to_path()
712 return __bch2_inum_to_path(trans, inum.subvol, inum.inum, 0, path); in bch2_inum_to_path()
[all …]
A Dinode.c349 SPOS(0, inum.inum, snapshot), in __bch2_inode_peek()
366 bch_err_msg(trans->c, ret, "looking up inum %llu:%llu:", inum.subvol, inum.inum); in __bch2_inode_peek()
392 subvol_inum inum, in bch2_inode_find_by_inum_nowarn_trans() argument
405 subvol_inum inum, in bch2_inode_find_by_inum_trans() argument
1078 struct bpos end = POS(inum.inum, U64_MAX); in bch2_inode_delete_keys()
1086 bch2_trans_iter_init(trans, &iter, id, POS(inum.inum, 0), in bch2_inode_delete_keys()
1159 SPOS(0, inum.inum, snapshot), in bch2_inode_rm()
1168 inum.inum, snapshot); in bch2_inode_rm()
1184 ret = delete_ancestor_snapshot_inodes(trans, SPOS(0, inum.inum, snapshot)); in bch2_inode_rm()
1338 inum, snapshot); in __bch2_inode_rm_snapshot()
[all …]
A Ddirent.c137 return le32_to_cpu(d.v->d_parent_subvol) == inum.subvol; in dirent_is_visible()
386 target->inum = le64_to_cpu(d.v->d_inum); in bch2_dirent_read_target()
392 target->inum = le64_to_cpu(s.inode); in bch2_dirent_read_target()
411 POS(dst_dir.inum, bch2_dirent_hash(dst_hash, dst_name)); in bch2_dirent_rename()
595 const struct qstr *name, subvol_inum *inum, in bch2_dirent_lookup_trans() argument
620 const struct qstr *name, subvol_inum *inum) in bch2_dirent_lookup() argument
674 target.inum, in bch2_dir_emit()
681 int bch2_readdir(struct bch_fs *c, subvol_inum inum, in bch2_readdir() argument
690 POS(inum.inum, ctx->pos), in bch2_readdir()
691 POS(inum.inum, U64_MAX), in bch2_readdir()
[all …]
A Dfs.c203 return siphash_2u64(inum->subvol, inum->inum, &k); in bch2_vfs_inode_hash_fn()
243 u64 inum = p.offset; in bch2_inode_or_descendents_is_open() local
276 if (inode->ei_inum.inum == inum) { in bch2_inode_or_descendents_is_open()
542 subvol_inum inum; in __bch2_create() local
590 inum.inum = inode_u.bi_inum; in __bch2_create()
1842 u64 inum; member
1867 .inum = inode->ei_inum.inum, in bch2_inode_to_fid()
1915 .inum = fid.inum, in bch2_nfs_get_inode()
2074 subvol_inum inum, in bch2_vfs_inode_init() argument
2079 inode->v.i_ino = inum.inum; in bch2_vfs_inode_init()
[all …]
A Dfsck.c171 u64 inum = 0; in lookup_lostfound() local
577 if (!inum) { in reconstruct_subvol()
858 BTREE_ID_inodes, POS(0, inum), SPOS(0, inum, U32_MAX), in get_inodes_all_snapshots()
1036 u64 inum; in inode_get_dirent() local
2511 u64 inum; in check_root_trans() local
2854 u64 inum; member
2883 .inum = inum, in add_nlink()
2895 return cmp_int(l->inum, r->inum); in nlink_cmp()
2903 .inum = inum, .snapshot = U32_MAX, in inc_link()
2906 if (inum < range_start || inum >= range_end) in inc_link()
[all …]
A Dinode.h126 subvol_inum inum, unsigned flags) in bch2_inode_peek_nowarn() argument
128 return __bch2_inode_peek(trans, iter, inode, inum, flags, false); in bch2_inode_peek_nowarn()
134 subvol_inum inum, unsigned flags) in bch2_inode_peek() argument
136 return __bch2_inode_peek(trans, iter, inode, inum, flags, true); in bch2_inode_peek()
149 int bch2_inode_find_snapshot_root(struct btree_trans *trans, u64 inum,
313 return a.subvol == b.subvol && a.inum == b.inum; in subvol_inum_eq()
A Ddisk_accounting_format.h113 x(inum, 8, 3)
195 __u64 inum; member
218 struct bch_acct_inum inum; member
A Derror.c733 subvol_inum inum, u64 offset) in bch2_inum_offset_err_msg_trans() argument
738 if (inum.subvol) { in bch2_inum_offset_err_msg_trans()
739 ret = bch2_inum_to_path(trans, inum, out); in bch2_inum_offset_err_msg_trans()
743 if (!inum.subvol || ret) in bch2_inum_offset_err_msg_trans()
744 prt_printf(out, "inum %llu:%llu", inum.subvol, inum.inum); in bch2_inum_offset_err_msg_trans()
751 subvol_inum inum, u64 offset) in bch2_inum_offset_err_msg() argument
753 bch2_trans_do(c, bch2_inum_offset_err_msg_trans(trans, out, inum, offset)); in bch2_inum_offset_err_msg()
A Drebalance.c235 int bch2_set_rebalance_needs_scan_trans(struct btree_trans *trans, u64 inum) in bch2_set_rebalance_needs_scan_trans() argument
244 SPOS(inum, REBALANCE_WORK_SCAN_OFFSET, U32_MAX), in bch2_set_rebalance_needs_scan_trans()
270 int bch2_set_rebalance_needs_scan(struct bch_fs *c, u64 inum) in bch2_set_rebalance_needs_scan() argument
274 bch2_set_rebalance_needs_scan_trans(trans, inum)); in bch2_set_rebalance_needs_scan()
284 static int bch2_clear_rebalance_needs_scan(struct btree_trans *trans, u64 inum, u64 cookie) in bch2_clear_rebalance_needs_scan() argument
292 SPOS(inum, REBALANCE_WORK_SCAN_OFFSET, U32_MAX), in bch2_clear_rebalance_needs_scan()
460 static int do_rebalance_scan(struct moving_context *ctxt, u64 inum, u64 cookie) in do_rebalance_scan() argument
469 if (!inum) { in do_rebalance_scan()
473 r->scan_start = BBPOS(BTREE_ID_extents, POS(inum, 0)); in do_rebalance_scan()
474 r->scan_end = BBPOS(BTREE_ID_extents, POS(inum, U64_MAX)); in do_rebalance_scan()
[all …]
A Dlogged_ops_format.h14 __le64 inum; member
29 __le64 inum; member
A Dxattr.c164 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()
214 inum, &xattr->k_i, in bch2_xattr_set()
222 hash_info, inum, &search); in bch2_xattr_set()
314 u64 offset = 0, inum = inode->ei_inode.bi_inum; in bch2_xattr_list() local
318 POS(inum, offset), in bch2_xattr_list()
319 POS(inum, U64_MAX), in bch2_xattr_list()
A Dacl.h43 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
A Dtests.c446 static int insert_test_overlapping_extent(struct bch_fs *c, u64 inum, u64 start, u32 len, u32 snapi… in insert_test_overlapping_extent() argument
452 k.k_i.k.p.inode = inum; in insert_test_overlapping_extent()
464 static int test_extent_create_overlapping(struct bch_fs *c, u64 inum) in test_extent_create_overlapping() argument
466 return insert_test_overlapping_extent(c, inum, 0, 16, U32_MAX - 2) ?: /* overwrite entire */ in test_extent_create_overlapping()
467 insert_test_overlapping_extent(c, inum, 2, 8, U32_MAX - 2) ?: in test_extent_create_overlapping()
468 insert_test_overlapping_extent(c, inum, 4, 4, U32_MAX) ?: in test_extent_create_overlapping()
469 insert_test_overlapping_extent(c, inum, 32, 8, U32_MAX - 2) ?: /* overwrite front/back */ in test_extent_create_overlapping()
470 insert_test_overlapping_extent(c, inum, 36, 8, U32_MAX) ?: in test_extent_create_overlapping()
471 insert_test_overlapping_extent(c, inum, 60, 8, U32_MAX - 2) ?: in test_extent_create_overlapping()
472 insert_test_overlapping_extent(c, inum, 64, 8, U32_MAX); in test_extent_create_overlapping()
A Dio_read.h158 subvol_inum inum) in bch2_read() argument
162 rbio->subvol = inum.subvol; in bch2_read()
165 __bch2_read(trans, rbio, rbio->bio.bi_iter, inum, NULL, NULL, in bch2_read()
A Dacl.c311 int bch2_set_acl_trans(struct btree_trans *trans, subvol_inum inum, in bch2_set_acl_trans() argument
329 inum, &xattr->k_i, 0); in bch2_set_acl_trans()
335 inum, &search); in bch2_set_acl_trans()
401 int bch2_acl_chmod(struct btree_trans *trans, subvol_inum inum, in bch2_acl_chmod() argument
412 &hash_info, inum, &search, BTREE_ITER_intent); in bch2_acl_chmod()
/fs/ubifs/
A Dkey.h93 key->u32[0] = inum; in ino_key_init()
104 ino_t inum) in ino_key_init_flash() argument
122 key->u32[0] = inum; in lowest_ino_key()
135 key->u32[0] = inum; in highest_ino_key()
153 key->u32[0] = inum; in dent_key_init()
170 key->u32[0] = inum; in dent_key_init_hash()
204 key->u32[0] = inum; in lowest_dent_key()
222 key->u32[0] = inum; in xent_key_init()
255 key->u32[0] = inum; in lowest_xent_key()
271 key->u32[0] = inum; in data_key_init()
[all …]
A Dorphan.c61 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()
105 if (inum < o->inum) in lookup_orphan()
107 else if (inum > o->inum) in lookup_orphan()
536 ino_t inum; in do_kill_orphans() local
764 orphan->inum = inum; in dbg_ins_check_orphan()
770 if (inum < o->inum) in dbg_ins_check_orphan()
772 else if (inum > o->inum) in dbg_ins_check_orphan()
792 if (inum < o->inum) in dbg_find_check_orphan()
[all …]
A Drecovery.c1231 ino_t inum; member
1255 if (inum < e->inum) in add_ino()
1265 e->inum = inum; in add_ino()
1288 if (inum < e->inum) in find_ino()
1290 else if (inum > e->inum) in find_ino()
1357 ino_t inum = key_inum(c, key); in ubifs_recover_size_accum() local
1364 remove_ino(c, inum); in ubifs_recover_size_accum()
1366 e = find_ino(c, inum); in ubifs_recover_size_accum()
1378 e = find_ino(c, inum); in ubifs_recover_size_accum()
1389 e = find_ino(c, inum); in ubifs_recover_size_accum()
[all …]
A Ddebug.c1788 ino_t inum; member
1835 if (inum < fscki->inum) in add_inode()
1837 else if (inum > fscki->inum) in add_inode()
1843 if (inum > c->highest_inum) { in add_inode()
1855 fscki->inum = inum; in add_inode()
1913 if (inum < fscki->inum) in search_inode()
1915 else if (inum > fscki->inum) in search_inode()
1948 ino_key_init(c, &key, inum); in read_add_inode()
1955 err, (unsigned long)inum); in read_add_inode()
2008 ino_t inum; in check_leaf() local
[all …]
/fs/gfs2/
A Dexport.c65 struct gfs2_inum_host inum; member
70 int length, loff_t offset, u64 inum, in get_name_filldir() argument
76 if (inum != gnfd->inum.no_addr) in get_name_filldir()
109 gnfd.inum.no_addr = ip->i_no_addr; in gfs2_get_name()
110 gnfd.inum.no_formal_ino = ip->i_no_formal_ino; in gfs2_get_name()
132 struct gfs2_inum_host *inum) in gfs2_get_dentry() argument
137 if (!inum->no_formal_ino) in gfs2_get_dentry()
139 inode = gfs2_lookup_by_inum(sdp, inum->no_addr, inum->no_formal_ino, in gfs2_get_dentry()
A Dtrace_gfs2.h455 __field( u64, inum )
466 __entry->inum = ip->i_no_addr;
475 (unsigned long long)__entry->inum,
492 __field( u64, inum )
500 __entry->inum = ip->i_no_addr;
508 (unsigned long long)__entry->inum,
521 __field( u64, inum )
532 __entry->inum = ip->i_no_addr;
563 __field( u64, inum )
575 __entry->inum = ip->i_no_addr;
[all …]
/fs/nfs/
A Dcallback.c54 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()
/fs/jfs/
A Djfs_imap.c442 ip->i_ino = inum; in diReadSpecial()
505 ino_t inum = ip->i_ino; in diWriteSpecial() local
532 if (inum == FILESYSTEM_I) in diWriteSpecial()
848 ino_t inum = ip->i_ino; in diFree() local
870 iagno = INOTOIAG(inum); in diFree()
1330 ino_t inum; in diAlloc() local
1377 inum = pip->i_ino + 1; in diAlloc()
1382 inum = pip->i_ino; in diAlloc()
1391 iagno = INOTOIAG(inum); in diAlloc()
2773 inum); in diUpdatePMap()
[all …]

Completed in 75 milliseconds

1234