| /linux-6.12.1/fs/btrfs/ |
| D | extent-io-tree.c | 56 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
59 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range()
87 static bool is_inode_io_tree(const struct extent_io_tree *tree) in is_inode_io_tree()
93 struct btrfs_inode *extent_io_tree_to_inode(struct extent_io_tree *tree) in extent_io_tree_to_inode()
101 const struct btrfs_inode *extent_io_tree_to_inode_const(const struct extent_io_tree *tree) in extent_io_tree_to_inode_const()
109 const struct btrfs_fs_info *extent_io_tree_to_fs_info(const struct extent_io_tree *tree) in extent_io_tree_to_fs_info()
117 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init()
132 void extent_io_tree_release(struct extent_io_tree *tree) in extent_io_tree_release()
258 static inline struct extent_state *tree_search_for_insert(struct extent_io_tree *tree, in tree_search_for_insert()
304 static struct extent_state *tree_search_prev_next(struct extent_io_tree *tree, in tree_search_prev_next()
[all …]
|
| D | extent-io-tree.h | 145 static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end, in lock_extent()
151 static inline bool try_lock_extent(struct extent_io_tree *tree, u64 start, in try_lock_extent()
175 static inline int clear_extent_bit(struct extent_io_tree *tree, u64 start, in clear_extent_bit()
182 static inline int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, in unlock_extent()
188 static inline int clear_extent_bits(struct extent_io_tree *tree, u64 start, in clear_extent_bits()
199 static inline int clear_extent_uptodate(struct extent_io_tree *tree, u64 start, in clear_extent_uptodate()
206 static inline int clear_extent_dirty(struct extent_io_tree *tree, u64 start, in clear_extent_dirty()
228 static inline int lock_dio_extent(struct extent_io_tree *tree, u64 start, in lock_dio_extent()
234 static inline bool try_lock_dio_extent(struct extent_io_tree *tree, u64 start, in try_lock_dio_extent()
240 static inline int unlock_dio_extent(struct extent_io_tree *tree, u64 start, in unlock_dio_extent()
|
| D | extent_map.c | 34 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init()
342 struct extent_map_tree *tree = &inode->extent_tree; in try_merge_map() local
417 struct extent_map_tree *tree = &inode->extent_tree; in unpin_extent_cache() local
493 struct extent_map_tree *tree = &inode->extent_tree; in add_extent_mapping() local
514 __lookup_extent_mapping(struct extent_map_tree *tree, in __lookup_extent_mapping()
551 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping()
569 struct extent_map *search_extent_mapping(struct extent_map_tree *tree, in search_extent_mapping()
586 struct extent_map_tree *tree = &inode->extent_tree; in remove_extent_mapping() local
605 struct extent_map_tree *tree = &inode->extent_tree; in replace_extent_mapping() local
768 struct extent_map_tree *tree = &inode->extent_tree; in drop_all_extent_maps_fast() local
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/xe/ |
| D | xe_range_fence.c | 24 struct xe_range_fence_tree *tree = rfence->tree; in xe_range_fence_signal_notify() local
29 static bool __xe_range_fence_tree_cleanup(struct xe_range_fence_tree *tree) in __xe_range_fence_tree_cleanup()
54 int xe_range_fence_insert(struct xe_range_fence_tree *tree, in xe_range_fence_insert()
89 static void xe_range_fence_tree_remove_all(struct xe_range_fence_tree *tree) in xe_range_fence_tree_remove_all()
110 void xe_range_fence_tree_init(struct xe_range_fence_tree *tree) in xe_range_fence_tree_init()
119 void xe_range_fence_tree_fini(struct xe_range_fence_tree *tree) in xe_range_fence_tree_fini()
134 xe_range_fence_tree_first(struct xe_range_fence_tree *tree, u64 start, in xe_range_fence_tree_first()
|
| /linux-6.12.1/fs/hfs/ |
| D | btree.c | 21 struct hfs_btree *tree; in hfs_btree_open() local
139 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
162 void hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
193 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
227 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
250 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
326 struct hfs_btree *tree; in hfs_bmap_free() local
|
| D | bnode.c | 60 struct hfs_btree *tree; in hfs_bnode_read_key() local
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
226 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
244 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
317 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
411 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
461 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
|
| D | brec.c | 67 struct hfs_btree *tree; in hfs_brec_insert() local
179 struct hfs_btree *tree; in hfs_brec_remove() local
233 struct hfs_btree *tree; in hfs_bnode_split() local
354 struct hfs_btree *tree; in hfs_brec_update_parent() local
458 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
|
| D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init()
109 struct hfs_btree *tree; in hfs_brec_find() local
176 struct hfs_btree *tree; in hfs_brec_goto() local
|
| /linux-6.12.1/fs/unicode/ |
| D | mkutf8data.c | 345 struct tree { struct
350 struct tree *next; argument
355 int *(*leaf_index)(struct tree *, void *); argument
378 * Example lookup function for a tree. argument
380 static void *lookup(struct tree *tree, const char *key) in lookup()
417 static void tree_walk(struct tree *tree) in tree_walk()
533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert()
654 static void prune(struct tree *tree) in prune()
815 static void mark_nodes(struct tree *tree) in mark_nodes()
942 static int index_nodes(struct tree *tree, int index) in index_nodes()
[all …]
|
| /linux-6.12.1/fs/hfsplus/ |
| D | btree.c | 135 struct hfs_btree *tree; in hfs_btree_open() local
259 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
283 int hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
315 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
347 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
374 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
451 struct hfs_btree *tree; in hfs_bmap_free() local
|
| D | bnode.c | 59 struct hfs_btree *tree; in hfs_bnode_read_key() local
330 struct hfs_btree *tree; in hfs_bnode_unlink() local
376 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
393 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
467 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
562 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
612 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
644 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
|
| D | brec.c | 65 struct hfs_btree *tree; in hfs_brec_insert() local
181 struct hfs_btree *tree; in hfs_brec_remove() local
237 struct hfs_btree *tree; in hfs_bnode_split() local
358 struct hfs_btree *tree; in hfs_brec_update_parent() local
462 static int hfs_btree_inc_height(struct hfs_btree *tree) in hfs_btree_inc_height()
|
| D | bfind.c | 15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init()
155 struct hfs_btree *tree; in hfs_brec_find() local
222 struct hfs_btree *tree; in hfs_brec_goto() local
|
| /linux-6.12.1/kernel/ |
| D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local
111 static inline void get_tree(struct audit_tree *tree) in get_tree()
116 static inline void put_tree(struct audit_tree *tree) in put_tree()
123 const char *audit_tree_path(struct audit_tree *tree) in audit_tree_path()
261 bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) in audit_tree_match()
397 static int create_chunk(struct inode *inode, struct audit_tree *tree) in create_chunk()
458 static int tag_chunk(struct inode *inode, struct audit_tree *tree) in tag_chunk()
542 static void kill_rules(struct audit_context *context, struct audit_tree *tree) in kill_rules()
609 static void trim_marked(struct audit_tree *tree) in trim_marked()
649 struct audit_tree *tree; in audit_remove_tree_rule() local
[all …]
|
| /linux-6.12.1/include/linux/ |
| D | rbtree.h | 165 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
195 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
223 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add()
259 rb_find_add_rcu(struct rb_node *node, struct rb_root *tree, in rb_find_add_rcu()
292 rb_find(const void *key, const struct rb_root *tree, in rb_find()
323 rb_find_rcu(const void *key, const struct rb_root *tree, in rb_find_rcu()
351 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first()
397 #define rb_for_each(node, key, tree, cmp) \ argument
|
| /linux-6.12.1/lib/zlib_deflate/ |
| D | deftree.c | 150 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
154 # define send_code(s, c, tree) \ argument
296 #define pqremove(s, tree, top) \ argument
307 #define smaller(tree, n, m, depth) \ argument
319 ct_data *tree, /* the tree to restore */ in pqdownheap()
358 ct_data *tree = desc->dyn_tree; in gen_bitlen() local
442 ct_data *tree, /* the tree to decorate */ in gen_codes()
489 ct_data *tree = desc->dyn_tree; in build_tree() local
574 ct_data *tree, /* the tree to be scanned */ in scan_tree()
620 ct_data *tree, /* the tree to be scanned */ in send_tree()
|
| /linux-6.12.1/net/sched/ |
| D | ematch.c | 162 static inline struct tcf_ematch *tcf_em_get_match(struct tcf_ematch_tree *tree, in tcf_em_get_match()
306 struct tcf_ematch_tree *tree) in tcf_em_tree_validate()
400 void tcf_em_tree_destroy(struct tcf_ematch_tree *tree) in tcf_em_tree_destroy()
437 int tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) in tcf_em_tree_dump()
500 int __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, in __tcf_em_tree_match()
|
| /linux-6.12.1/tools/include/linux/ |
| D | rbtree.h | 178 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached()
206 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add()
234 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add()
267 rb_find(const void *key, const struct rb_root *tree, in rb_find()
295 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first()
341 #define rb_for_each(node, key, tree, cmp) \ argument
|
| /linux-6.12.1/fs/ext4/ |
| D | extents_status.c | 172 void ext4_es_init_tree(struct ext4_es_tree *tree) in ext4_es_init_tree()
181 struct ext4_es_tree *tree; in ext4_es_print_tree() local
262 struct ext4_es_tree *tree = NULL; in __es_find_extent_range() local
571 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_left() local
595 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in ext4_es_try_to_merge_right() local
790 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in __es_insert_extent() local
1002 struct ext4_es_tree *tree; in ext4_es_lookup_extent() local
1259 struct ext4_pending_tree *tree = &EXT4_I(inode)->i_pending_tree; in get_rsvd() local
1386 struct ext4_es_tree *tree = &EXT4_I(inode)->i_es_tree; in __es_remove_extent() local
1789 struct ext4_es_tree *tree = &ei->i_es_tree; in es_do_reclaim_extents() local
[all …]
|
| /linux-6.12.1/kernel/module/ |
| D | tree_lookup.c | 64 static noinline void __mod_tree_insert(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_insert()
69 static void __mod_tree_remove(struct mod_tree_node *node, struct mod_tree_root *tree) in __mod_tree_remove()
103 struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find()
|
| /linux-6.12.1/scripts/dtc/ |
| D | fstree.c | 16 struct node *tree; in read_fstree() local
70 struct node *tree; in dt_from_fs() local
|
| D | livetree.c | 400 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info()
448 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label()
474 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label()
513 struct node *get_node_by_path(struct node *tree, const char *path) in get_node_by_path()
539 struct node *get_node_by_label(struct node *tree, const char *label) in get_node_by_label()
559 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
583 struct node *get_node_by_ref(struct node *tree, const char *ref) in get_node_by_ref()
658 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
|
| /linux-6.12.1/fs/smb/client/ |
| D | dfs.c | 391 static void __tree_connect_ipc(const unsigned int xid, char *tree, in __tree_connect_ipc()
429 static void tree_connect_ipc(const unsigned int xid, char *tree, in tree_connect_ipc()
440 struct cifs_sb_info *cifs_sb, char *tree, bool islink, in __tree_connect_dfs_target()
525 struct cifs_sb_info *cifs_sb, char *tree, bool islink, in tree_connect_dfs_target()
558 char *tree; in cifs_tree_connect() local
|
| /linux-6.12.1/tools/testing/radix-tree/ |
| D | tag_check.c | 14 __simple_checks(struct radix_tree_root *tree, unsigned long index, int tag) in __simple_checks()
131 static void gang_check(struct radix_tree_root *tree, in gang_check()
157 static void do_thrash(struct radix_tree_root *tree, char *thrash_state, int tag) in do_thrash()
|
| /linux-6.12.1/drivers/gpu/drm/amd/display/dc/mpc/dcn10/ |
| D | dcn10_mpc.c | 127 struct mpcc *mpc1_get_mpcc_for_dpp(struct mpc_tree *tree, int dpp_id) in mpc1_get_mpcc_for_dpp()
197 struct mpc_tree *tree, in mpc1_insert_plane()
289 struct mpc_tree *tree, in mpc1_remove_mpcc()
414 struct mpc_tree *tree) in mpc1_init_mpcc_list_from_hw()
|