Searched defs:path (Results 276 - 300 of 858) sorted by path

<<11121314151617181920>>

/linux-master/fs/afs/
H A Dinode.c581 int afs_getattr(struct mnt_idmap *idmap, const struct path *path, argument
H A Dmntpt.c176 struct vfsmount *afs_d_automount(struct path *path) argument
/linux-master/fs/autofs/
H A Ddev-ioctl.c188 struct path pat local
183 find_autofs_mount(const char *pathname, struct path *res, int test(const struct path *path, void *data), void *data) argument
211 test_by_dev(const struct path *path, void *p) argument
216 test_by_type(const struct path *path, void *p) argument
234 struct path path; local
262 const char *path; local
425 struct path path; local
508 struct path path; local
[all...]
H A Dexpire.c33 struct path path = {.mnt = mnt, .dentry = dentry}; local
486 int autofs_expire_wait(const struct path *path, in argument
585 const struct path path = { .mnt = mnt, .dentry = dentry }; local
[all...]
H A Droot.c245 static int autofs_mount_wait(const struct path *path, bool rcu_walk) argument
265 static int do_expire_wait(const struct path *path, boo argument
289 autofs_mountpoint_changed(struct path *path) argument
331 autofs_d_automount(struct path *path) argument
419 autofs_d_manage(const struct path *path, bool rcu_walk) argument
[all...]
H A Dwaitq.c202 validate_request(struct autofs_wait_queue **wait, struct autofs_sb_info *sbi, const struct qstr *qstr, const struct path *path, enum autofs_notify notify) argument
303 autofs_wait(struct autofs_sb_info *sbi, const struct path *path, enum autofs_notify notify) argument
/linux-master/fs/
H A Dbad_inode.c98 bad_inode_getattr(struct mnt_idmap *idmap, const struct path *path, struct kstat *stat, u32 request_mask, unsigned int query_flags) argument
/linux-master/fs/bcachefs/
H A Dalloc_background.c934 struct btree_path *path = btree_iter_path(iter->trans, iter); local
H A Dbtree_cache.c841 static struct btree *__bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, argument
701 bch2_btree_node_fill(struct btree_trans *trans, struct btree_path *path, const struct bkey_i *k, enum btree_id btree_id, unsigned level, enum six_lock_type lock_type, bool sync) argument
962 bch2_btree_node_get(struct btree_trans *trans, struct btree_path *path, const struct bkey_i *k, unsigned level, enum six_lock_type lock_type, unsigned long trace_ip) argument
1122 bch2_btree_node_prefetch(struct btree_trans *trans, struct btree_path *path, const struct bkey_i *k, enum btree_id btree_id, unsigned level) argument
[all...]
H A Dbtree_iter.c97 static inline bool btree_path_pos_before_node(struct btree_path *path, argument
103 static inline bool btree_path_pos_after_node(struct btree_path *path, argument
109 static inline bool btree_path_pos_in_node(struct btree_path *path, argument
121 bch2_btree_path_verify_cached(struct btree_trans *trans, struct btree_path *path) argument
138 bch2_btree_path_verify_level(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
220 bch2_btree_path_verify(struct btree_trans *trans, struct btree_path *path) argument
243 struct btree_path *path; local
335 struct btree_path *path; local
374 bch2_btree_path_verify_level(struct btree_trans *trans, struct btree_path *path, unsigned l) argument
376 bch2_btree_path_verify(struct btree_trans *trans, struct btree_path *path) argument
403 __bch2_btree_path_fix_key_modified(struct btree_path *path, struct btree *b, struct bkey_packed *where) argument
420 struct btree_path *path; local
429 __bch2_btree_node_iter_fix(struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bset_tree *t, struct bkey_packed *where, unsigned clobber_u64s, unsigned new_u64s) argument
520 bch2_btree_node_iter_fix(struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_packed *where, unsigned clobber_u64s, unsigned new_u64s) argument
575 btree_path_level_peek(struct btree_trans *trans, struct btree_path *path, struct btree_path_level *l, struct bkey *u) argument
589 btree_path_level_prev(struct btree_trans *trans, struct btree_path *path, struct btree_path_level *l, struct bkey *u) argument
603 btree_path_advance_to_pos(struct btree_path *path, struct btree_path_level *l, int max_advance) argument
622 __btree_path_level_init(struct btree_path *path, unsigned level) argument
637 bch2_btree_path_level_init(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
681 bch2_trans_node_add(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
718 struct btree_path *path; local
729 btree_path_lock_root(struct btree_trans *trans, struct btree_path *path, unsigned depth_want, unsigned long trace_ip) argument
790 btree_path_prefetch(struct btree_trans *trans, struct btree_path *path) argument
826 btree_path_prefetch_j(struct btree_trans *trans, struct btree_path *path, struct btree_and_journal_iter *jiter) argument
861 btree_node_mem_ptr_set(struct btree_trans *trans, struct btree_path *path, unsigned plevel, struct btree *b) argument
883 btree_node_iter_and_journal_peek(struct btree_trans *trans, struct btree_path *path, unsigned flags, struct bkey_buf *out) argument
908 btree_path_down(struct btree_trans *trans, struct btree_path *path, unsigned flags, unsigned long trace_ip) argument
982 struct btree_path *path; local
1053 btree_path_check_pos_in_node(struct btree_path *path, unsigned l, int check_pos) argument
1063 btree_path_good_node(struct btree_trans *trans, struct btree_path *path, unsigned l, int check_pos) argument
1072 btree_path_set_level_down(struct btree_trans *trans, struct btree_path *path, unsigned new_level) argument
1088 __btree_path_up_until_good_node(struct btree_trans *trans, struct btree_path *path, int check_pos) argument
1111 btree_path_up_until_good_node(struct btree_trans *trans, struct btree_path *path, int check_pos) argument
1135 struct btree_path *path = &trans->paths[path_idx]; local
1233 __bch2_btree_path_make_mut(struct btree_trans *trans, btree_path_idx_t path, bool intent, unsigned long ip) argument
1254 struct btree_path *path = trans->paths + path_idx; local
1300 have_path_at_pos(struct btree_trans *trans, struct btree_path *path) argument
1315 have_node_at_pos(struct btree_trans *trans, struct btree_path *path) argument
1330 __bch2_path_free(struct btree_trans *trans, btree_path_idx_t path) argument
1339 struct btree_path *path = trans->paths + path_idx, *dup; local
1364 bch2_path_put_nokeep(struct btree_trans *trans, btree_path_idx_t path, bool intent) argument
1433 struct btree_path *path = trans->paths + path_idx; local
1595 struct btree_path *path = &trans->paths[idx]; local
1610 struct btree_path *path; local
1681 bch2_btree_path_peek_slot(struct btree_path *path, struct bkey *u) argument
1745 struct btree_path *path = btree_iter_path(trans, iter); local
1766 struct btree_path *path = btree_iter_path(trans, iter); local
1811 struct btree_path *path = btree_iter_path(trans, iter); local
1924 struct btree_path *path = btree_iter_path(trans, iter); local
1954 struct btree_path *path = btree_iter_path(trans, iter); local
1967 struct btree_path *path = btree_iter_path(trans, iter); local
1983 struct btree_path *path = btree_iter_path(trans, iter); local
2067 struct btree_path *path = btree_iter_path(trans, iter); local
2344 struct btree_path *path = btree_iter_path(trans, iter); local
2603 struct btree_path *path; local
2623 struct btree_path *path, *prev = NULL; local
2683 btree_path_list_remove(struct btree_trans *trans, struct btree_path *path) argument
2704 struct btree_path *path = trans->paths + path_idx; local
2770 struct btree_path *path = btree_iter_path(trans, iter); local
2880 struct btree_path *path; local
2914 struct btree_path *path; local
3079 struct btree_path *path; local
3207 struct btree_path *path = paths + idx; local
[all...]
H A Dbtree_iter.h16 static inline void __btree_path_get(struct btree_path *path, bool intent) argument
22 static inline bool __btree_path_put(struct btree_path *path, bool intent) argument
30 static inline void btree_path_set_dirty(struct btree_path *path, argument
36 btree_path_node(struct btree_path *path, unsigned level) argument
42 btree_node_lock_seq_matches(const struct btree_path *path, const struct btree *b, unsigned level) argument
48 btree_node_parent(struct btree_path *path, struct btree *b) argument
118 next_btree_path(struct btree_trans *trans, struct btree_path *path) argument
129 prev_btree_path(struct btree_trans *trans, struct btree_path *path) argument
161 __path_has_node(const struct btree_path *path, const struct btree *b) argument
172 struct btree_path *path; local
190 bch2_btree_path_make_mut(struct btree_trans *trans, btree_path_idx_t path, bool intent, unsigned long ip) argument
206 bch2_btree_path_set_pos(struct btree_trans *trans, btree_path_idx_t path, struct bpos new_pos, bool intent, unsigned long ip) argument
219 bch2_btree_path_traverse(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) argument
236 bch2_btree_path_peek_slot_exact(struct btree_path *path, struct bkey *u) argument
335 bch2_btree_path_downgrade(struct btree_trans *trans, struct btree_path *path) argument
504 struct btree_path *path = btree_iter_path(trans, iter); local
[all...]
H A Dbtree_key_cache.c199 bkey_cached_alloc(struct btree_trans *trans, struct btree_path *path, argument
322 btree_key_cache_create(struct btree_trans *trans, struct btree_path *path) argument
466 bch2_btree_path_traverse_cached_slowpath(struct btree_trans *trans, struct btree_path *path, unsigned flags) argument
557 bch2_btree_path_traverse_cached(struct btree_trans *trans, struct btree_path *path, unsigned flags) argument
687 struct btree_path *path = btree_iter_path(trans, &c_iter); local
805 bch2_btree_key_cache_drop(struct btree_trans *trans, struct btree_path *path) argument
[all...]
H A Dbtree_locking.c33 struct btree_path *path; local
323 struct btree_path *path = paths + path_idx; local
55 bch2_btree_node_unlock_write(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
415 __bch2_btree_node_lock_write(struct btree_trans *trans, struct btree_path *path, struct btree_bkey_cached_common *b, bool lock_may_not_fail) argument
439 bch2_btree_node_lock_write_nofail(struct btree_trans *trans, struct btree_path *path, struct btree_bkey_cached_common *b) argument
449 btree_path_get_locks(struct btree_trans *trans, struct btree_path *path, bool upgrade, struct get_locks_fail *f) argument
500 __bch2_btree_node_relock(struct btree_trans *trans, struct btree_path *path, unsigned level, bool trace) argument
524 bch2_btree_node_upgrade(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
588 bch2_btree_path_relock_intent(struct btree_trans *trans, struct btree_path *path) argument
608 bch2_btree_path_relock_norestart(struct btree_trans *trans, struct btree_path *path) argument
615 __bch2_btree_path_relock(struct btree_trans *trans, struct btree_path *path, unsigned long trace_ip) argument
626 bch2_btree_path_upgrade_noupgrade_sibs(struct btree_trans *trans, struct btree_path *path, unsigned new_locks_want, struct get_locks_fail *f) argument
638 __bch2_btree_path_upgrade(struct btree_trans *trans, struct btree_path *path, unsigned new_locks_want, struct get_locks_fail *f) argument
682 __bch2_btree_path_downgrade(struct btree_trans *trans, struct btree_path *path, unsigned new_locks_want) argument
717 struct btree_path *path; local
730 struct btree_path *path; local
774 struct btree_path *path; local
790 struct btree_path *path; local
799 struct btree_path *path; local
814 struct btree_path *path; local
837 bch2_btree_path_verify_locks(struct btree_path *path) argument
862 struct btree_path *path; local
[all...]
H A Dbtree_locking.h26 static inline bool is_btree_node(struct btree_path *path, unsigned l) argument
46 static inline int btree_node_locked_type(struct btree_path *path, argument
52 static inline bool btree_node_write_locked(struct btree_path *path, unsigned l) argument
57 static inline bool btree_node_intent_locked(struct btree_path *path, unsigned l) argument
62 static inline bool btree_node_read_locked(struct btree_path *path, unsigned l) argument
67 btree_node_locked(struct btree_path *path, unsigned level) argument
72 mark_btree_node_locked_noreset(struct btree_path *path, unsigned level, enum btree_node_locked_type type) argument
84 mark_btree_node_unlocked(struct btree_path *path, unsigned level) argument
91 mark_btree_node_locked(struct btree_trans *trans, struct btree_path *path, unsigned level, enum btree_node_locked_type type) argument
102 __btree_lock_want(struct btree_path *path, int level) argument
110 btree_lock_want(struct btree_path *path, int level) argument
121 btree_trans_lock_hold_time_update(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
133 btree_node_unlock(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
147 btree_path_lowest_level_locked(struct btree_path *path) argument
152 btree_path_highest_level_locked(struct btree_path *path) argument
157 __bch2_btree_path_unlock(struct btree_trans *trans, struct btree_path *path) argument
171 bch2_btree_node_unlock_write_inlined(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
242 struct btree_path *path; local
255 btree_node_lock(struct btree_trans *trans, struct btree_path *path, struct btree_bkey_cached_common *b, unsigned level, enum six_lock_type type, unsigned long ip) argument
280 __btree_node_lock_write(struct btree_trans *trans, struct btree_path *path, struct btree_bkey_cached_common *b, bool lock_may_not_fail) argument
302 bch2_btree_node_lock_write(struct btree_trans *trans, struct btree_path *path, struct btree_bkey_cached_common *b) argument
319 bch2_btree_path_relock(struct btree_trans *trans, struct btree_path *path, unsigned long trace_ip) argument
329 bch2_btree_node_relock(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
341 bch2_btree_node_relock_notrace(struct btree_trans *trans, struct btree_path *path, unsigned level) argument
363 bch2_btree_path_upgrade(struct btree_trans *trans, struct btree_path *path, unsigned new_locks_want) argument
384 btree_path_set_should_be_locked(struct btree_path *path) argument
392 __btree_path_set_level_up(struct btree_trans *trans, struct btree_path *path, unsigned l) argument
400 btree_path_set_level_up(struct btree_trans *trans, struct btree_path *path) argument
420 bch2_btree_path_verify_locks(struct btree_path *path) argument
[all...]
H A Dbtree_trans_commit.c64 bch2_btree_node_prep_for_write(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
128 bch2_btree_bset_insert_key(struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument
264 bch2_btree_insert_key_leaf(struct btree_trans *trans, struct btree_path *path, struct bkey_i *insert, u64 journal_seq) argument
310 struct btree_path *path = trans->paths + i->path; local
357 btree_key_can_insert_cached_slowpath(struct btree_trans *trans, unsigned flags, struct btree_path *path, unsigned new_u64s) argument
393 btree_key_can_insert_cached(struct btree_trans *trans, unsigned flags, struct btree_path *path, unsigned u64s) argument
741 struct btree_path *path = trans->paths + i->path; local
1055 struct btree_path *path = trans->paths + i->path; local
[all...]
H A Dbtree_types.h267 static inline struct btree_path_level *path_l(struct btree_path *path) argument
272 static inline unsigned long btree_path_ip_allocated(struct btree_path *path) argument
290 btree_path_idx_t path; member in struct:btree_iter
359 btree_path_idx_t path; member in struct:btree_insert_entry
[all...]
H A Dbtree_update.c393 struct btree_path *path = trans->paths + path_idx; local
467 bch2_trans_update_get_key_cache(struct btree_trans *trans, struct btree_iter *iter, struct btree_path *path) argument
530 struct btree_path *path = trans->paths + path_idx; local
[all...]
H A Dbtree_update_interior.c51 struct btree_path *path = trans->paths + path_idx; local
244 bch2_btree_node_free_inmem(struct btree_trans *trans, struct btree_path *path, struct btree *b) argument
270 struct btree_path *path; local
740 struct btree_path *path = trans->paths + path_idx; local
1132 bch2_btree_update_start(struct btree_trans *trans, struct btree_path *path, unsigned level_start, bool split, unsigned flags) argument
1307 bch2_btree_set_root(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, bool nofail) argument
1348 bch2_insert_fixup_btree_ptr(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument
1410 bch2_btree_insert_keys_interior(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter node_iter, struct keylist *keys) argument
1563 struct btree_path *path = trans->paths + path_idx; local
1577 btree_split(struct btree_update *as, struct btree_trans *trans, btree_path_idx_t path, struct btree *b, struct keylist *keys) argument
1772 struct btree_path *path = trans->paths + path_idx, *linked; local
1840 bch2_btree_split_leaf(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) argument
1876 struct btree_path *path = trans->paths + path_idx; local
1913 bch2_btree_increase_depth(struct btree_trans *trans, btree_path_idx_t path, unsigned flags) argument
1931 __bch2_foreground_maybe_merge(struct btree_trans *trans, btree_path_idx_t path, unsigned level, unsigned flags, enum btree_node_sibling sib) argument
2138 struct btree_path *path = btree_iter_path(trans, iter); local
2424 struct btree_path *path = btree_iter_path(trans, iter); local
[all...]
H A Dbtree_update_interior.h142 struct btree_path *path = trans->paths + path_idx; local
154 bch2_foreground_maybe_merge(struct btree_trans *trans, btree_path_idx_t path, unsigned level, unsigned flags) argument
H A Dbtree_write_buffer.c118 struct btree_path *path = btree_iter_path(trans, iter); local
137 struct btree_path *path; local
313 struct btree_path *path = btree_iter_path(trans, &iter); local
362 struct btree_path *path = btree_iter_path(trans, &iter); local
[all...]
H A Dchardev.c44 char *path; local
312 char *path; local
355 char *path; local
[all...]
H A Ddisk_groups.c386 u16 path[32]; local
437 u16 path[32]; local
H A Dfs-ioctl.c446 struct path path; local
H A Dfs.c1681 static struct bch_fs *bch2_path_to_fs(const char *path) argument
826 bch2_getattr(struct mnt_idmap *idmap, const struct path *path, struct kstat *stat, u32 request_mask, unsigned query_flags) argument
H A Dfsck.c2557 pathbuf path = { 0, }; local

Completed in 327 milliseconds

<<11121314151617181920>>