Home
last modified time | relevance | path

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

12345678910>>...105

/linux/drivers/video/fbdev/mmp/
H A Dcore.c16 static struct mmp_overlay *path_get_overlay(struct mmp_path *path, in path_get_overlay() argument
19 if (path && overlay_id < path->overlay_num) in path_get_overlay()
20 return &path->overlays[overlay_id]; in path_get_overlay()
24 static int path_check_status(struct mmp_path *path) in path_check_status() argument
27 for (i = 0; i < path->overlay_num; i++) in path_check_status()
28 if (path->overlays[i].status) in path_check_status()
41 static int path_get_modelist(struct mmp_path *path, in path_get_modelist() argument
44 BUG_ON(!path || !modelist); in path_get_modelist()
46 if (path->panel && path->panel->get_modelist) in path_get_modelist()
47 return path->panel->get_modelist(path->panel, modelist); in path_get_modelist()
[all …]
/linux/tools/testing/selftests/openat2/
H A Dresolve_test.c112 const char *path; member
117 const char *path; member
139 .path = "/", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
142 .path = "cheeky/absself", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
145 .path = "abscheeky/absself", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
148 .path = "..", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
151 .path = "../root/", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
154 .path = "cheeky/self", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
157 .path = "abscheeky/self", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
160 .path = "cheeky/garbageself", .how.resolve = RESOLVE_BENEATH, in test_openat2_opath_tests()
[all …]
/linux/drivers/thunderbolt/
H A Dpath.c3 * Thunderbolt driver - path/tunnel functionality
50 tb_port_warn(port, "failed to read path at %d\n", hopid); in tb_path_find_dst_port()
81 * tb_path_discover() - Discover a path
82 * @src: First input port of a path
83 * @src_hopid: Starting HopID of a path (%-1 if don't care)
84 * @dst: Expected destination port of the path (%NULL if don't care)
87 * @name: Name of the path
90 * Follows a path starting from @src and @src_hopid to the last output
91 * port of the path. Allocates HopIDs for the visited ports (if
92 * @alloc_hopid is true). Call tb_path_free() to release the path an
108 struct tb_path *path; tb_path_discover() local
244 struct tb_path *path; tb_path_alloc() local
358 tb_path_free(struct tb_path * path) tb_path_free() argument
379 __tb_path_deallocate_nfc(struct tb_path * path,int first_hop) __tb_path_deallocate_nfc() argument
462 __tb_path_deactivate_hops(struct tb_path * path,int first_hop) __tb_path_deactivate_hops() argument
477 tb_path_deactivate(struct tb_path * path) tb_path_deactivate() argument
503 tb_path_activate(struct tb_path * path) tb_path_activate() argument
597 tb_path_is_invalid(struct tb_path * path) tb_path_is_invalid() argument
617 tb_path_port_on_path(const struct tb_path * path,const struct tb_port * port) tb_path_port_on_path() argument
[all...]
/linux/fs/bcachefs/
H A Dbtree_locking.h21 static inline bool is_btree_node(struct btree_path *path, unsigned l) in is_btree_node() argument
23 return l < BTREE_MAX_DEPTH && !IS_ERR_OR_NULL(path->l[l].b); in is_btree_node()
41 static inline int btree_node_locked_type(struct btree_path *path, in btree_node_locked_type() argument
44 return BTREE_NODE_UNLOCKED + ((path->nodes_locked >> (level << 1)) & 3); in btree_node_locked_type()
47 static inline bool btree_node_write_locked(struct btree_path *path, unsigned l) in btree_node_write_locked() argument
49 return btree_node_locked_type(path, l) == BTREE_NODE_WRITE_LOCKED; in btree_node_write_locked()
52 static inline bool btree_node_intent_locked(struct btree_path *path, unsigned l) in btree_node_intent_locked() argument
54 return btree_node_locked_type(path, l) == BTREE_NODE_INTENT_LOCKED; in btree_node_intent_locked()
57 static inline bool btree_node_read_locked(struct btree_path *path, unsigned l) in btree_node_read_locked() argument
59 return btree_node_locked_type(path, l) == BTREE_NODE_READ_LOCKED; in btree_node_read_locked()
[all …]
H A Dbtree_locking.c24 struct btree_path *path; in bch2_btree_node_lock_counts() local
33 trans_for_each_path(trans, path, i) in bch2_btree_node_lock_counts()
34 if (path != skip && &path->l[level].b->c == b) { in bch2_btree_node_lock_counts()
35 int t = btree_node_locked_type(path, level); in bch2_btree_node_lock_counts()
47 struct btree_path *path, struct btree *b) in bch2_btree_node_unlock_write() argument
49 bch2_btree_node_unlock_write_inlined(trans, path, b); in bch2_btree_node_unlock_write()
325 struct btree_path *path = paths + path_idx; in bch2_check_for_deadlock() local
326 if (!path->nodes_locked) in bch2_check_for_deadlock()
338 int lock_held = btree_node_locked_type(path, top->level); in bch2_check_for_deadlock()
343 b = &READ_ONCE(path->l[top->level].b)->c; in bch2_check_for_deadlock()
[all …]
H A Dbtree_iter.c97 static inline bool btree_path_pos_before_node(struct btree_path *path, in btree_path_pos_before_node() argument
100 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
103 static inline bool btree_path_pos_after_node(struct btree_path *path, in btree_path_pos_after_node() argument
106 return bpos_gt(path->pos, b->key.k.p); in btree_path_pos_after_node()
109 static inline bool btree_path_pos_in_node(struct btree_path *path, in btree_path_pos_in_node() argument
112 return path->btree_id == b->c.btree_id && in btree_path_pos_in_node()
113 !btree_path_pos_before_node(path, b) && in btree_path_pos_in_node()
114 !btree_path_pos_after_node(path, b); in btree_path_pos_in_node()
122 struct btree_path *path) in bch2_btree_path_verify_cached() argument
125 bool locked = btree_node_locked(path, 0); in bch2_btree_path_verify_cached()
[all …]
/linux/fs/
H A Dinit.c19 struct path path; in init_mount() local
22 ret = kern_path(dir_name, LOOKUP_FOLLOW, &path); in init_mount()
25 ret = path_mount(dev_name, &path, type_page, flags, data_page); in init_mount()
26 path_put(&path); in init_mount()
33 struct path path; in init_umount() local
38 ret = kern_path(name, lookup_flags, &path); in init_umount()
41 return path_umount(&path, flags); in init_umount()
46 struct path path; in init_chdir() local
49 error = kern_path(filename, LOOKUP_FOLLOW | LOOKUP_DIRECTORY, &path); in init_chdir()
52 error = path_permission(&path, MAY_EXEC | MAY_CHDIR); in init_chdir()
[all …]
/linux/drivers/net/wireless/realtek/rtw89/
H A Drtw8852a_rfk.c94 u8 path; in _wait_rx_mode() local
98 for (path = 0; path < RF_PATH_MAX; path++) { in _wait_rx_mode()
99 if (!(kpath & BIT(path))) in _wait_rx_mode()
103 2, 5000, false, rtwdev, path, 0x00, in _wait_rx_mode()
107 path, ret); in _wait_rx_mode()
254 enum rtw89_rf_path path, u8 index) in _dack_reload_by_path() argument
266 if (path == RF_PATH_A) in _dack_reload_by_path()
275 tmp |= dack->msbk_d[path][index][i + 12] << (i * 8); in _dack_reload_by_path()
283 tmp |= dack->msbk_d[path][index][i + 8] << (i * 8); in _dack_reload_by_path()
291 tmp |= dack->msbk_d[path][index][i + 4] << (i * 8); in _dack_reload_by_path()
[all …]
H A Drtw8852b_rfk.c235 enum rtw89_rf_path path, bool is_bybb) in _rfk_rf_direct_cntrl() argument
238 rtw89_write_rf(rtwdev, path, RR_RSV1, RR_RSV1_RST, 0x1); in _rfk_rf_direct_cntrl()
240 rtw89_write_rf(rtwdev, path, RR_RSV1, RR_RSV1_RST, 0x0); in _rfk_rf_direct_cntrl()
244 enum rtw89_rf_path path, bool is_bybb) in _rfk_drf_direct_cntrl() argument
247 rtw89_write_rf(rtwdev, path, RR_BBDC, RR_BBDC_SEL, 0x1); in _rfk_drf_direct_cntrl()
249 rtw89_write_rf(rtwdev, path, RR_BBDC, RR_BBDC_SEL, 0x0); in _rfk_drf_direct_cntrl()
252 static bool _iqk_check_cal(struct rtw89_dev *rtwdev, u8 path) in _iqk_check_cal() argument
269 rtw89_debug(rtwdev, RTW89_DBG_RFK, "[IQK]S%x, ret=%d\n", path, ret); in _iqk_check_cal()
271 rtw89_debug(rtwdev, RTW89_DBG_RFK, "[IQK]S%x, 0x8008 = 0x%x\n", path, val); in _iqk_check_cal()
295 enum rtw89_rf_path path) in _set_rx_dck() argument
[all …]
H A Drtw8852bt_rfk.c134 static void _rfk_get_thermal(struct rtw89_dev *rtwdev, u8 kidx, enum rtw89_rf_path path) in _rfk_get_thermal() argument
138 rtw89_write_rf(rtwdev, path, RR_TM, RR_TM_TRI, 0x1); in _rfk_get_thermal()
139 rtw89_write_rf(rtwdev, path, RR_TM, RR_TM_TRI, 0x0); in _rfk_get_thermal()
140 rtw89_write_rf(rtwdev, path, RR_TM, RR_TM_TRI, 0x1); in _rfk_get_thermal()
144 dpk->bp[path][kidx].ther_dpk = rtw89_read_rf(rtwdev, path, RR_TM, RR_TM_VAL); in _rfk_get_thermal()
147 dpk->bp[path][kidx].ther_dpk); in _rfk_get_thermal()
252 void _txck_force(struct rtw89_dev *rtwdev, enum rtw89_rf_path path, bool force, in _txck_force() argument
255 rtw89_phy_write32_mask(rtwdev, R_P0_RXCK | (path << 13), B_P0_TXCK_ON, 0x0); in _txck_force()
260 rtw89_phy_write32_mask(rtwdev, R_P0_RXCK | (path << 13), B_P0_TXCK_VAL, ck); in _txck_force()
261 rtw89_phy_write32_mask(rtwdev, R_P0_RXCK | (path << 13), B_P0_TXCK_ON, 0x1); in _txck_force()
[all …]
/linux/fs/nilfs2/
H A Dbtree.c25 struct nilfs_btree_path *path; in nilfs_btree_alloc_path() local
28 path = kmem_cache_alloc(nilfs_btree_path_cache, GFP_NOFS); in nilfs_btree_alloc_path()
29 if (path == NULL) in nilfs_btree_alloc_path()
33 path[level].bp_bh = NULL; in nilfs_btree_alloc_path()
34 path[level].bp_sib_bh = NULL; in nilfs_btree_alloc_path()
35 path[level].bp_index = 0; in nilfs_btree_alloc_path()
36 path[level].bp_oldreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
37 path[level].bp_newreq.bpr_ptr = NILFS_BMAP_INVALID_PTR; in nilfs_btree_alloc_path()
38 path[level].bp_op = NULL; in nilfs_btree_alloc_path()
42 return path; in nilfs_btree_alloc_path()
45 nilfs_btree_free_path(struct nilfs_btree_path * path) nilfs_btree_free_path() argument
417 nilfs_btree_get_nonroot_node(const struct nilfs_btree_path * path,int level) nilfs_btree_get_nonroot_node() argument
423 nilfs_btree_get_sib_node(const struct nilfs_btree_path * path,int level) nilfs_btree_get_sib_node() argument
435 nilfs_btree_get_node(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,int level,int * ncmaxp) nilfs_btree_get_node() argument
548 nilfs_btree_do_lookup(const struct nilfs_bmap * btree,struct nilfs_btree_path * path,__u64 key,__u64 * ptrp,int minlevel,int readahead) nilfs_btree_do_lookup() argument
610 nilfs_btree_do_lookup_last(const struct nilfs_bmap * btree,struct nilfs_btree_path * path,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_lookup_last() argument
659 nilfs_btree_get_next_key(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,int minlevel,__u64 * nextkey) nilfs_btree_get_next_key() argument
689 struct nilfs_btree_path *path; nilfs_btree_lookup() local
707 struct nilfs_btree_path *path; nilfs_btree_lookup_contig() local
793 nilfs_btree_promote_key(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 key) nilfs_btree_promote_key() argument
815 nilfs_btree_do_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_insert() argument
842 nilfs_btree_carry_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_left() argument
888 nilfs_btree_carry_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_carry_right() argument
935 nilfs_btree_split(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_split() argument
985 nilfs_btree_grow(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_grow() argument
1014 nilfs_btree_find_near(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path) nilfs_btree_find_near() argument
1043 nilfs_btree_find_target_v(const struct nilfs_bmap * btree,const struct nilfs_btree_path * path,__u64 key) nilfs_btree_find_target_v() argument
1063 nilfs_btree_prepare_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int * levelp,__u64 key,__u64 ptr,struct nilfs_bmap_stats * stats) nilfs_btree_prepare_insert() argument
1212 nilfs_btree_commit_insert(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,__u64 key,__u64 ptr) nilfs_btree_commit_insert() argument
1237 struct nilfs_btree_path *path; nilfs_btree_insert() local
1265 nilfs_btree_do_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_do_delete() argument
1290 nilfs_btree_borrow_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_left() argument
1322 nilfs_btree_borrow_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_borrow_right() argument
1355 nilfs_btree_concat_left(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_left() argument
1381 nilfs_btree_concat_right(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_concat_right() argument
1406 nilfs_btree_shrink(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_shrink() argument
1430 nilfs_btree_nop(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,__u64 * keyp,__u64 * ptrp) nilfs_btree_nop() argument
1436 nilfs_btree_prepare_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int * levelp,struct nilfs_bmap_stats * stats,struct inode * dat) nilfs_btree_prepare_delete() argument
1571 nilfs_btree_commit_delete(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int maxlevel,struct inode * dat) nilfs_btree_commit_delete() argument
1588 struct nilfs_btree_path *path; nilfs_btree_delete() local
1619 struct nilfs_btree_path *path; nilfs_btree_seek_key() local
1639 struct nilfs_btree_path *path; nilfs_btree_last_key() local
1914 nilfs_btree_propagate_p(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_p() argument
1926 nilfs_btree_prepare_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_prepare_update_v() argument
1961 nilfs_btree_commit_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_commit_update_v() argument
1985 nilfs_btree_abort_update_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct inode * dat) nilfs_btree_abort_update_v() argument
1997 nilfs_btree_prepare_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int minlevel,int * maxlevelp,struct inode * dat) nilfs_btree_prepare_propagate_v() argument
2032 nilfs_btree_commit_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int minlevel,int maxlevel,struct buffer_head * bh,struct inode * dat) nilfs_btree_commit_propagate_v() argument
2047 nilfs_btree_propagate_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head * bh) nilfs_btree_propagate_v() argument
2084 struct nilfs_btree_path *path; nilfs_btree_propagate() local
2204 nilfs_btree_assign_p(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign_p() argument
2246 nilfs_btree_assign_v(struct nilfs_bmap * btree,struct nilfs_btree_path * path,int level,struct buffer_head ** bh,sector_t blocknr,union nilfs_binfo * binfo) nilfs_btree_assign_v() argument
2281 struct nilfs_btree_path *path; nilfs_btree_assign() local
2345 struct nilfs_btree_path *path; nilfs_btree_mark() local
[all...]
/linux/fs/btrfs/
H A Dfile-item.c166 struct btrfs_path *path; in btrfs_insert_hole_extent() local
169 path = btrfs_alloc_path(); in btrfs_insert_hole_extent()
170 if (!path) in btrfs_insert_hole_extent()
176 ret = btrfs_insert_empty_item(trans, root, path, &file_key, in btrfs_insert_hole_extent()
180 leaf = path->nodes[0]; in btrfs_insert_hole_extent()
181 item = btrfs_item_ptr(leaf, path->slots[0], in btrfs_insert_hole_extent()
194 btrfs_free_path(path); in btrfs_insert_hole_extent()
201 struct btrfs_path *path, in btrfs_lookup_csum() argument
217 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow); in btrfs_lookup_csum()
220 leaf = path->nodes[0]; in btrfs_lookup_csum()
[all …]
H A Dinode-item.c84 struct btrfs_path *path, in btrfs_lookup_inode_extref() argument
96 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_inode_extref()
101 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
112 struct btrfs_path *path; in btrfs_del_inode_extref() local
126 path = btrfs_alloc_path(); in btrfs_del_inode_extref()
127 if (!path) in btrfs_del_inode_extref()
130 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_del_inode_extref()
141 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
149 leaf = path->nodes[0]; in btrfs_del_inode_extref()
150 item_size = btrfs_item_size(leaf, path->slots[0]); in btrfs_del_inode_extref()
[all …]
H A Dfree-space-tree.c22 struct btrfs_path *path);
71 struct btrfs_path *path) in add_new_free_space_info() argument
83 ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(*info)); in add_new_free_space_info()
87 leaf = path->nodes[0]; in add_new_free_space_info()
88 info = btrfs_item_ptr(leaf, path->slots[0], in add_new_free_space_info()
95 btrfs_release_path(path); in add_new_free_space_info()
103 struct btrfs_path *path, int cow) in search_free_space_info() argument
114 ret = btrfs_search_slot(trans, root, &key, path, 0, cow); in search_free_space_info()
124 return btrfs_item_ptr(path->nodes[0], path->slots[0], in search_free_space_info()
206 struct btrfs_path *path) in convert_free_space_to_bitmaps() argument
[all …]
H A Dctree.c30 *root, struct btrfs_path *path, int level);
32 const struct btrfs_key *ins_key, struct btrfs_path *path,
851 struct btrfs_path *path, int level) in balance_level() argument
861 int orig_slot = path->slots[level]; in balance_level()
866 mid = path->nodes[level]; in balance_level()
868 WARN_ON(path->locks[level] != BTRFS_WRITE_LOCK); in balance_level()
874 parent = path->nodes[level + 1]; in balance_level()
875 pslot = path->slots[level + 1]; in balance_level()
916 path->locks[level] = 0; in balance_level()
917 path->nodes[level] = NULL; in balance_level()
[all …]
H A Droot-tree.c68 struct btrfs_path *path, struct btrfs_root_item *root_item, in btrfs_find_root() argument
76 ret = btrfs_search_slot(NULL, root, search_key, path, 0, 0); in btrfs_find_root()
92 if (path->slots[0] == 0) in btrfs_find_root()
94 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()
113 btrfs_release_path(path); in btrfs_find_root()
133 struct btrfs_path *path; in btrfs_update_root() local
140 path = btrfs_alloc_path(); in btrfs_update_root()
141 if (!path) in btrfs_update_root()
[all …]
H A Dtree-log.c110 struct btrfs_path *path, u64 objectid);
114 struct btrfs_path *path,
394 struct btrfs_path *path, in overwrite_item() argument
419 ret = btrfs_search_slot(NULL, root, key, path, 0, 0); in overwrite_item()
426 u32 dst_size = btrfs_item_size(path->nodes[0], in overwrite_item()
427 path->slots[0]); in overwrite_item()
432 btrfs_release_path(path); in overwrite_item()
438 btrfs_release_path(path); in overwrite_item()
446 dst_ptr = btrfs_item_ptr_offset(path->nodes[0], path->slots[0]); in overwrite_item()
447 read_extent_buffer(path->nodes[0], dst_copy, dst_ptr, in overwrite_item()
[all …]
/linux/fs/ext4/
H A Dextents.c89 struct ext4_ext_path *path,
108 static inline void ext4_ext_path_brelse(struct ext4_ext_path *path) in ext4_ext_path_brelse() argument
110 brelse(path->p_bh); in ext4_ext_path_brelse()
111 path->p_bh = NULL; in ext4_ext_path_brelse()
114 static void ext4_ext_drop_refs(struct ext4_ext_path *path) in ext4_ext_drop_refs() argument
118 if (IS_ERR_OR_NULL(path)) in ext4_ext_drop_refs()
120 depth = path->p_depth; in ext4_ext_drop_refs()
121 for (i = 0; i <= depth; i++, path++) in ext4_ext_drop_refs()
122 ext4_ext_path_brelse(path); in ext4_ext_drop_refs()
125 void ext4_free_ext_path(struct ext4_ext_path *path) in ext4_free_ext_path() argument
[all …]
/linux/drivers/video/fbdev/mmp/hw/
H A Dmmp_ctrl.c122 struct mmp_path *path = overlay->path; in dmafetch_set_fmt() local
123 tmp = readl_relaxed(ctrl_regs(path) + dma_ctrl(0, path->id)); in dmafetch_set_fmt()
126 writel_relaxed(tmp, ctrl_regs(path) + dma_ctrl(0, path->id)); in dmafetch_set_fmt()
131 struct lcd_regs *regs = path_regs(overlay->path); in overlay_set_win()
171 struct mmp_path *path = overlay->path; in dmafetch_onoff() local
174 tmp = readl_relaxed(ctrl_regs(path) + dma_ctrl(0, path->id)); in dmafetch_onoff()
177 writel(tmp, ctrl_regs(path) + dma_ctrl(0, path->id)); in dmafetch_onoff()
181 static void path_enabledisable(struct mmp_path *path, int on) in path_enabledisable() argument
184 mutex_lock(&path->access_ok); in path_enabledisable()
185 tmp = readl_relaxed(ctrl_regs(path) + LCD_SCLK(path)); in path_enabledisable()
[all …]
/linux/security/tomoyo/
H A Dtomoyo.c121 static int tomoyo_inode_getattr(const struct path *path) in tomoyo_inode_getattr() argument
123 return tomoyo_path_perm(TOMOYO_TYPE_GETATTR, path, NULL); in tomoyo_inode_getattr()
133 static int tomoyo_path_truncate(const struct path *path) in tomoyo_path_truncate() argument
135 return tomoyo_path_perm(TOMOYO_TYPE_TRUNCATE, path, NULL); in tomoyo_path_truncate()
158 static int tomoyo_path_unlink(const struct path *parent, struct dentry *dentry) in tomoyo_path_unlink()
160 struct path path = { .mnt = parent->mnt, .dentry = dentry }; in tomoyo_path_unlink() local
162 return tomoyo_path_perm(TOMOYO_TYPE_UNLINK, &path, NULL); in tomoyo_path_unlink()
174 static int tomoyo_path_mkdir(const struct path *parent, struct dentry *dentry, in tomoyo_path_mkdir()
177 struct path path = { .mnt = parent->mnt, .dentry = dentry }; in tomoyo_path_mkdir() local
179 return tomoyo_path_number_perm(TOMOYO_TYPE_MKDIR, &path, in tomoyo_path_mkdir()
[all …]
/linux/tools/perf/util/
H A Dtrace-event-info.c90 char *path = get_events_file("header_page"); in record_header_files() local
94 if (!path) { in record_header_files()
99 if (stat(path, &st) < 0) { in record_header_files()
100 pr_debug("can't read '%s'", path); in record_header_files()
109 if (record_file(path, 8) < 0) { in record_header_files()
114 put_events_file(path); in record_header_files()
116 path = get_events_file("header_event"); in record_header_files()
117 if (!path) { in record_header_files()
123 if (stat(path, &st) < 0) { in record_header_files()
124 pr_debug("can't read '%s'", path); in record_header_files()
[all …]
/linux/drivers/net/ethernet/mediatek/
H A Dmtk_eth_path.c18 int (*set_path)(struct mtk_eth *eth, u64 path);
21 static const char *mtk_eth_path_name(u64 path) in mtk_eth_path_name() argument
23 switch (path) { in mtk_eth_path_name()
43 static int set_mux_gdm1_to_gmac1_esw(struct mtk_eth *eth, u64 path) in set_mux_gdm1_to_gmac1_esw() argument
48 switch (path) { in set_mux_gdm1_to_gmac1_esw()
71 mtk_eth_path_name(path), __func__, updated); in set_mux_gdm1_to_gmac1_esw()
76 static int set_mux_gmac2_gmac0_to_gephy(struct mtk_eth *eth, u64 path) in set_mux_gmac2_gmac0_to_gephy() argument
81 switch (path) { in set_mux_gmac2_gmac0_to_gephy()
94 mtk_eth_path_name(path), __func__, updated); in set_mux_gmac2_gmac0_to_gephy()
99 static int set_mux_u3_gmac2_to_qphy(struct mtk_eth *eth, u64 path) in set_mux_u3_gmac2_to_qphy() argument
[all …]
/linux/fs/btrfs/tests/
H A Dfree-space-tree-tests.c23 struct btrfs_path *path, in __check_free_space_extents() argument
35 info = search_free_space_info(trans, cache, path, 0); in __check_free_space_extents()
41 flags = btrfs_free_space_flags(path->nodes[0], info); in __check_free_space_extents()
42 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in __check_free_space_extents()
50 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()
60 bit = free_space_test_bit(cache, path, offset); in __check_free_space_extents()
84 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 || in __check_free_space_extents()
85 path->slots[0] != 0) in __check_free_space_extents()
[all …]
/linux/tools/lib/api/fs/
H A Dfs.c94 char *path; member
158 char path[PATH_MAX + 1]; in fs__read_mounts() local
165 path, type) == 2) { in fs__read_mounts()
168 fs->path = strdup(path); in fs__read_mounts()
170 return fs->path != NULL; in fs__read_mounts()
196 fs->path = strdup(*ptr); in fs__check_mounts()
197 if (!fs->path) in fs__check_mounts()
236 fs->path = strdup(override_path); in fs__env_override()
237 if (!fs->path) in fs__env_override()
387 char path[PATH_MAX]; procfs__read_str() local
401 char path[PATH_MAX]; sysfs__read_ull_base() local
424 char path[PATH_MAX]; sysfs__read_int() local
437 char path[PATH_MAX]; sysfs__read_str() local
453 char path[PATH_MAX]; sysfs__read_bool() local
485 char path[PATH_MAX]; sysctl__read_int() local
498 char path[PATH_MAX]; sysfs__write_int() local
[all...]
/linux/tools/testing/selftests/mm/
H A Dthp_settings.c46 int read_file(const char *path, char *buf, size_t buflen) in read_file() argument
51 fd = open(path, O_RDONLY); in read_file()
67 int write_file(const char *path, const char *buf, size_t buflen) in write_file() argument
72 fd = open(path, O_WRONLY); in write_file()
74 printf("open(%s)\n", path); in write_file()
90 unsigned long read_num(const char *path) in read_num() argument
94 if (read_file(path, buf, sizeof(buf)) < 0) { in read_num()
102 void write_num(const char *path, unsigned long num) in write_num() argument
107 if (!write_file(path, buf, strlen(buf) + 1)) { in write_num()
108 perror(path); in write_num()
115 char path[PATH_MAX]; thp_read_string() local
160 char path[PATH_MAX]; thp_write_string() local
177 char path[PATH_MAX]; thp_read_num() local
190 char path[PATH_MAX]; thp_write_num() local
205 char path[PATH_MAX]; thp_read_settings() local
257 char path[PATH_MAX]; thp_write_settings() local
338 thp_set_read_ahead_path(char * path) thp_set_read_ahead_path() argument
353 char path[PATH_MAX]; __thp_supported_orders() local
[all...]

12345678910>>...105