Home
last modified time | relevance | path

Searched refs:path (Results 1 – 25 of 327) sorted by relevance

12345678910>>...14

/fs/bcachefs/
A Dbtree_locking.h108 if (level < path->level) in btree_lock_want()
112 if (level == path->level) in btree_lock_want()
141 bch2_btree_node_unlock_write(trans, path, path->l[level].b); in btree_node_unlock()
166 btree_node_unlock(trans, path, btree_path_lowest_level_locked(path)); in __bch2_btree_path_unlock()
274 struct btree_path *path; in btree_node_lock_increment() local
355 return btree_node_locked(path, path->level) in bch2_btree_path_relock()
367 btree_node_locked_type(path, level) != __btree_lock_want(path, level)); in bch2_btree_node_relock()
408 return likely(path->locks_want >= new_locks_want && path->nodes_locked) in bch2_btree_path_upgrade()
417 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_set_should_be_locked()
418 EBUG_ON(path->uptodate); in btree_path_set_should_be_locked()
[all …]
A Dbtree_locking.c25 struct btree_path *path; in bch2_btree_node_lock_counts() local
35 if (path != skip && &path->l[level].b->c == b) { in bch2_btree_node_lock_counts()
483 f->b = path->l[l].b; in btree_path_get_locks()
594 for (l = path->level; in bch2_btree_path_relock_intent()
595 l < path->locks_want && btree_path_node(path, l); in bch2_btree_path_relock_intent()
652 path->locks_want = max_t(unsigned, path->locks_want, new_locks_want); in __bch2_btree_path_upgrade()
732 (l = btree_path_highest_level_locked(path)) >= path->locks_want) { in __bch2_btree_path_downgrade()
760 if (path->ref) in bch2_trans_downgrade()
870 bch2_btree_node_unlock_write(trans, path, path->l[l].b); in bch2_trans_unlock_write()
887 if (!path->nodes_locked && btree_path_node(path, path->level)) { in __bch2_btree_path_verify_locks()
[all …]
A Dbtree_iter.c685 path = next_btree_path(trans, path)) in bch2_trans_node_add()
781 path->l[path->level].b = b; in btree_path_lock_root()
1192 !btree_node_locked(path, path->level)); in bch2_btree_path_traverse_one()
1201 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1216 path->l[path->level].b = ERR_PTR(ret); in bch2_btree_path_traverse_one()
1525 if (!path->cached && btree_node_locked(path, path->level)) { in bch2_btree_path_to_text_short()
1903 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1924 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1977 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
2028 b = path->l[path->level].b; in bch2_btree_iter_next_node()
[all …]
/fs/
A Dinit.c19 struct path path; in init_mount() local
33 struct path path; in init_umount() local
46 struct path path; in init_chdir() local
61 struct path path; in init_chroot() local
85 struct path path; in init_chown() local
102 struct path path; in init_chmod() local
115 struct path path; in init_eaccess() local
129 struct path path; in init_stat() local
144 struct path path; in init_mknod() local
203 struct path path; in init_symlink() local
[all …]
A Dnamei.c633 struct path path; member
1080 nd->path = *path; in nd_jump_link()
1965 struct path path; in step_into() local
1986 nd->path = path; in step_into()
2009 struct path path; in follow_dotdot_rcu() local
2016 nd->path = path; in follow_dotdot_rcu()
2049 struct path path; in follow_dotdot() local
2055 nd->path = path; in follow_dotdot()
2676 struct path *path, struct path *root) in filename_lookup() argument
3995 struct path path; in do_tmpfile() local
[all …]
A Dinternal.h13 struct path;
56 struct path *path, struct path *root);
87 int path_mount(const char *dev_name, struct path *path,
89 int path_umount(struct path *path, int flags);
96 extern void chroot_fs_refs(const struct path *, const struct path *);
197 int chmod_common(const struct path *path, umode_t mode);
200 int chown_common(const struct path *path, uid_t user, gid_t group);
332 struct path *path);
344 static inline bool path_mounted(const struct path *path) in path_mounted() argument
346 return path->mnt->mnt_root == path->dentry; in path_mounted()
[all …]
/fs/nilfs2/
A Dbtree.c29 if (path == NULL) in nilfs_btree_alloc_path()
42 return path; in nilfs_btree_alloc_path()
873 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_carry_left()
921 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_carry_right()
968 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_split()
1003 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_grow()
1227 path[level].bp_op(btree, path, level, &key, &ptr); in nilfs_btree_commit_insert()
1374 path[level].bp_bh = path[level].bp_sib_bh; in nilfs_btree_concat_left()
1577 path[level].bp_op(btree, path, level, NULL, NULL); in nilfs_btree_commit_delete()
1944 path[level].bp_ctxt.bh = path[level].bp_bh; in nilfs_btree_prepare_update_v()
[all …]
/fs/ext4/
A Dextents.c635 path[0].p_idx = EXT_FIRST_INDEX(path[0].p_hdr); in ext4_ext_precache()
1881 path[1].p_maxdepth = path[0].p_maxdepth; in ext4_ext_try_to_merge_up()
1882 memcpy(path[0].p_hdr, path[1].p_hdr, s); in ext4_ext_try_to_merge_up()
2999 memset(path + i + 1, 0, sizeof(*path)); in ext4_ext_remove_space()
5949 ex = path[path->p_depth].p_ext; in ext4_ext_replay_update_ex()
5970 ex = path[path->p_depth].p_ext; in ext4_ext_replay_update_ex()
5986 ex = path[path->p_depth].p_ext; in ext4_ext_replay_update_ex()
6014 ex = path[path->p_depth].p_ext; in ext4_ext_replay_shrink_inode()
6066 ex = path[path->p_depth].p_ext; in ext4_ext_replay_set_iblocks()
6103 ex = path[path->p_depth].p_ext; in ext4_ext_replay_set_iblocks()
[all …]
/fs/btrfs/
A Dfile-item.c170 if (!path) in btrfs_insert_hole_extent()
296 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in search_csum_tree()
317 itemsize = btrfs_item_size(path->nodes[0], path->slots[0]); in search_csum_tree()
371 if (!path) in btrfs_lookup_bio_sums()
478 if (!path) in btrfs_lookup_csums_list()
551 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_lookup_csums_list()
621 if (!path) { in btrfs_lookup_csums_bitmap()
623 if (!path) in btrfs_lookup_csums_bitmap()
704 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_lookup_csums_bitmap()
887 if (!path) in btrfs_del_csums()
[all …]
A Dinode-item.c98 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
124 if (!path) in btrfs_del_inode_extref()
138 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
187 if (!path) in btrfs_del_inode_ref()
261 if (!path) in btrfs_insert_inode_extref()
312 if (!path) in btrfs_insert_inode_ref()
320 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
325 old_size = btrfs_item_size(path->nodes[0], path->slots[0]); in btrfs_insert_inode_ref()
327 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
345 ref = btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_insert_inode_ref()
[all …]
A Dfree-space-tree.c121 return btrfs_item_ptr(path->nodes[0], path->slots[0], in btrfs_search_free_space_info()
273 ret = btrfs_del_items(trans, root, path, path->slots[0], nr); in btrfs_convert_free_space_to_bitmaps()
736 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in remove_free_space_extent()
851 if (!path) { in btrfs_remove_from_free_space_tree()
1033 if (!path) { in btrfs_add_to_free_space_tree()
1075 if (!path) in populate_free_space_tree()
1236 if (!path) in clear_free_space_tree()
1423 if (!path) { in __add_block_group_free_space()
1425 if (!path) { in __add_block_group_free_space()
1484 if (!path) { in btrfs_remove_block_group_free_space()
[all …]
A Dctree.c1430 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); in unlock_up()
1662 ASSERT(path); in btrfs_find_item()
2382 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in btrfs_prev_leaf()
2383 btrfs_item_key(path->nodes[0], &found_key, path->slots[0]); in btrfs_prev_leaf()
2508 btrfs_item_key_to_cpu(path->nodes[0], key, path->slots[0]); in btrfs_search_backwards()
2535 btrfs_item_key_to_cpu(path->nodes[0], key, path->slots[0]); in btrfs_get_next_valid_item()
3612 if (path->slots[0] == 0 || path->slots[0] == nritems) in push_for_double_split()
4311 if (!path) in btrfs_insert_item()
4430 ret = btrfs_del_ptr(trans, root, path, 1, path->slots[1]); in btrfs_del_leaf()
4710 WARN_ON(!path->keep_locks && !path->skip_locking); in btrfs_find_next_key()
[all …]
A Droot-tree.c94 path->slots[0]--; in btrfs_find_root()
98 l = path->nodes[0]; in btrfs_find_root()
99 slot = path->slots[0]; in btrfs_find_root()
141 if (!path) in btrfs_update_root()
157 l = path->nodes[0]; in btrfs_update_root()
158 slot = path->slots[0]; in btrfs_update_root()
188 l = path->nodes[0]; in btrfs_update_root()
226 if (!path) in btrfs_find_orphan_roots()
325 if (!path) in btrfs_del_root()
355 if (!path) in btrfs_del_root_ref()
[all …]
A Dtree-log.c1020 if (!path) in backref_in_log()
1655 if (!path) in fixup_inode_link_count()
2103 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in find_dir_range()
2130 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in find_dir_range()
2462 if (!path) in replay_one_buffer()
2775 if (!path) in walk_log_tree()
3616 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in insert_dir_log_key()
4785 drop_args.path = path; in log_one_extent()
5510 if (!path) in log_new_dir_dentries()
6260 path->slots[0], slot - path->slots[0]); in batch_delete_dir_index_items()
[all …]
A Draid-stripe-tree.c36 leaf = path->nodes[0]; in btrfs_partially_delete_raid_extent()
37 slot = path->slots[0]; in btrfs_partially_delete_raid_extent()
96 if (!path) in btrfs_delete_raid_extent()
108 if (path->slots[0] == btrfs_header_nritems(path->nodes[0])) in btrfs_delete_raid_extent()
109 path->slots[0]--; in btrfs_delete_raid_extent()
111 leaf = path->nodes[0]; in btrfs_delete_raid_extent()
138 path->slots[0]--; in btrfs_delete_raid_extent()
200 path->slots[0]--; in btrfs_delete_raid_extent()
278 if (!path) in update_raid_extent_item()
395 if (!path) in btrfs_get_raid_extent_offset()
[all …]
A Ddir-item.c44 leaf = path->nodes[0]; in insert_with_overflow()
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
114 struct btrfs_path *path; in btrfs_insert_dir_item() local
127 if (!path) in btrfs_insert_dir_item()
145 leaf = path->nodes[0]; in btrfs_insert_dir_item()
166 btrfs_free_path(path); in btrfs_insert_dir_item()
242 if (!path) in btrfs_check_dir_item_collision()
269 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
270 slot = path->slots[0]; in btrfs_check_dir_item_collision()
381 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
[all …]
A Dfiemap.c313 path->slots[0]++; in fiemap_next_leaf_item()
314 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) in fiemap_next_leaf_item()
333 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in fiemap_next_leaf_item()
353 slot = path->slots[0]; in fiemap_next_leaf_item()
356 path->slots[0] = slot; in fiemap_next_leaf_item()
388 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0] - 1); in fiemap_search_slot()
390 path->slots[0]--; in fiemap_search_slot()
393 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in fiemap_search_slot()
398 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in fiemap_search_slot()
583 path->slots[0]--; in fiemap_find_last_extent_offset()
[all …]
A Duuid-tree.c43 if (!path) { in btrfs_uuid_tree_lookup()
57 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
58 slot = path->slots[0]; in btrfs_uuid_tree_lookup()
82 btrfs_free_path(path); in btrfs_uuid_tree_lookup()
111 if (!path) { in btrfs_uuid_tree_add()
120 eb = path->nodes[0]; in btrfs_uuid_tree_add()
129 eb = path->nodes[0]; in btrfs_uuid_tree_add()
172 if (!path) { in btrfs_uuid_tree_remove()
188 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
304 if (!path) { in btrfs_uuid_tree_iterate()
[all …]
A Dextent-tree.c77 if (!path) in btrfs_lookup_data_extent()
120 if (!path) in btrfs_lookup_extent_info()
138 path->slots[0]--; in btrfs_lookup_extent_info()
1499 if (!path) in __btrfs_inc_extent_ref()
1645 if (!path) in run_delayed_extent_op()
3113 if (!path) in __btrfs_free_extent()
4832 if (!path) in alloc_reserved_file_extent()
4909 if (!path) in alloc_reserved_tree_block()
5517 if (!path) in check_ref_exists()
6073 if (!path) { in btrfs_drop_snapshot()
[all …]
/fs/xfs/scrub/
A Ddirtree.c81 kfree(path); in xchk_dirtree_buf_cleanup()
158 struct xchk_dirpath *path, in xchk_dirpath_append() argument
187 path->nr_steps++; in xchk_dirpath_append()
243 if (!path) in xchk_dirtree_create_path()
248 path->nr_steps = 0; in xchk_dirtree_create_path()
263 kfree(path); in xchk_dirtree_create_path()
350 trace_xchk_dirpath_set_outcome(dl->sc, path->path_nr, path->nr_steps, in xchk_dirpath_set_outcome()
353 path->outcome = outcome; in xchk_dirpath_set_outcome()
680 for (i = 1, idx = path->second_step; i < path->nr_steps; i++, idx++) { in xchk_dirpath_is_stale()
744 kfree(path); in xchk_dirtree_reset()
[all …]
A Ddirtree_repair.c57 struct xchk_dirpath *path, in xrep_dirpath_set_outcome() argument
60 trace_xrep_dirpath_set_outcome(dl->sc, path->path_nr, path->nr_steps, in xrep_dirpath_set_outcome()
63 path->outcome = outcome; in xrep_dirpath_set_outcome()
72 struct xchk_dirpath *path; in xrep_dirtree_delete_all_paths() local
75 switch (path->outcome) { in xrep_dirtree_delete_all_paths()
122 switch (path->outcome) { in xrep_dirtree_find_surviving_path()
151 switch (path->outcome) { in xrep_dirtree_keep_one_good_path()
187 switch (path->outcome) { in xrep_dirtree_keep_one_suspect_path()
571 if (!path) in xrep_dirtree_create_adoption_path()
576 path->nr_steps = 0; in xrep_dirtree_create_adoption_path()
[all …]
/fs/btrfs/tests/
A Dfree-space-tree-tests.c50 if (path->slots[0] != 0) in __check_free_space_extents()
54 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in __check_free_space_extents()
55 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
85 path->slots[0] != 0) in __check_free_space_extents()
88 path->slots[0]++; in __check_free_space_extents()
89 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
99 btrfs_release_path(path); in __check_free_space_extents()
121 btrfs_release_path(path); in check_free_space_extents()
125 btrfs_release_path(path); in check_free_space_extents()
477 if (!path) { in run_test()
[all …]
A Dqgroup-tests.c23 struct btrfs_path *path; in insert_normal_tree_ref() local
36 if (!path) { in insert_normal_tree_ref()
44 btrfs_free_path(path); in insert_normal_tree_ref()
48 leaf = path->nodes[0]; in insert_normal_tree_ref()
64 btrfs_free_path(path); in insert_normal_tree_ref()
85 if (!path) { in add_tree_ref()
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in add_tree_ref()
115 btrfs_free_path(path); in add_tree_ref()
134 if (!path) { in remove_extent_item()
167 if (!path) { in remove_extent_ref()
[all …]
/fs/smb/server/
A Dvfs.h112 const struct path *path, const char *attr_name,
118 const struct path *path, char *attr_name,
122 struct path *path, bool caseless);
125 struct path *path, bool caseless);
126 void ksmbd_vfs_kern_path_unlock(struct path *path);
130 struct path *path);
148 const struct path *path);
152 const struct path *path,
160 const struct path *path,
167 struct path *path);
[all …]
/fs/autofs/
A Ddev-ioctl.c190 int test(const struct path *path, void *data), in find_autofs_mount() argument
193 struct path path; in find_autofs_mount() local
200 while (path.dentry == path.mnt->mnt_root) { in find_autofs_mount()
216 static int test_by_dev(const struct path *path, void *p) in test_by_dev() argument
221 static int test_by_type(const struct path *path, void *p) in test_by_type() argument
239 struct path path; in autofs_dev_ioctl_open_mountpoint() local
278 path = param->path; in autofs_dev_ioctl_openmount()
509 struct path path; in autofs_dev_ioctl_requester() local
592 struct path path; in autofs_dev_ioctl_ismountpoint() local
609 &path); in autofs_dev_ioctl_ismountpoint()
[all …]

Completed in 142 milliseconds

12345678910>>...14