Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 25 of 205) sorted by relevance

123456789

/kernel/linux/linux-6.6/fs/btrfs/
Dextent-io-tree.c55 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument
58 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range()
97 struct extent_io_tree *tree, unsigned int owner) in extent_io_tree_init()
108 void extent_io_tree_release(struct extent_io_tree *tree) in extent_io_tree_release()
233 static inline struct extent_state *tree_search_for_insert(struct extent_io_tree *tree, in tree_search_for_insert()
279 static struct extent_state *tree_search_prev_next(struct extent_io_tree *tree, in tree_search_prev_next()
319 static inline struct extent_state *tree_search(struct extent_io_tree *tree, u64 offset) in tree_search()
324 static void extent_io_tree_panic(struct extent_io_tree *tree, int err) in extent_io_tree_panic()
339 static void merge_state(struct extent_io_tree *tree, struct extent_state *state) in merge_state()
368 static void set_state_bits(struct extent_io_tree *tree, in set_state_bits()
[all …]
Dextent_map.c35 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init()
231 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map()
295 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache()
334 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) in clear_em_logging()
343 static inline void setup_extent_mapping(struct extent_map_tree *tree, in setup_extent_mapping()
403 int add_extent_mapping(struct extent_map_tree *tree, in add_extent_mapping()
424 __lookup_extent_mapping(struct extent_map_tree *tree, in __lookup_extent_mapping()
461 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping()
479 struct extent_map *search_extent_mapping(struct extent_map_tree *tree, in search_extent_mapping()
494 void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) in remove_extent_mapping()
[all …]
Dordered-data.c127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search()
218 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in insert_ordered_extent() local
297 struct btrfs_ordered_inode_tree *tree; in btrfs_add_ordered_sum() local
414 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_mark_ordered_io_finished() local
507 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_dec_test_ordered_pending() local
588 struct btrfs_ordered_inode_tree *tree; in btrfs_remove_ordered_extent() local
887 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_extent() local
916 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_range() local
959 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_get_ordered_extents_for_logging() local
988 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_first_ordered_extent() local
[all …]
/kernel/linux/linux-5.10/fs/btrfs/
Dextent-io-tree.h96 static inline int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) in lock_extent()
124 static inline int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end) in unlock_extent()
129 static inline int unlock_extent_cached(struct extent_io_tree *tree, u64 start, in unlock_extent_cached()
136 static inline int unlock_extent_cached_atomic(struct extent_io_tree *tree, in unlock_extent_cached_atomic()
143 static inline int clear_extent_bits(struct extent_io_tree *tree, u64 start, in clear_extent_bits()
162 static inline int set_extent_bits(struct extent_io_tree *tree, u64 start, in set_extent_bits()
168 static inline int clear_extent_uptodate(struct extent_io_tree *tree, u64 start, in clear_extent_uptodate()
175 static inline int set_extent_dirty(struct extent_io_tree *tree, u64 start, in set_extent_dirty()
182 static inline int clear_extent_dirty(struct extent_io_tree *tree, u64 start, in clear_extent_dirty()
194 static inline int set_extent_delalloc(struct extent_io_tree *tree, u64 start, in set_extent_delalloc()
[all …]
Dextent_map.c36 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init()
235 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map()
296 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, in unpin_extent_cache()
335 void clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) in clear_em_logging()
342 static inline void setup_extent_mapping(struct extent_map_tree *tree, in setup_extent_mapping()
397 int add_extent_mapping(struct extent_map_tree *tree, in add_extent_mapping()
418 __lookup_extent_mapping(struct extent_map_tree *tree, in __lookup_extent_mapping()
457 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping()
474 struct extent_map *search_extent_mapping(struct extent_map_tree *tree, in search_extent_mapping()
488 void remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) in remove_extent_mapping()
[all …]
Dordered-data.c134 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search()
169 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in __btrfs_add_ordered_extent() local
291 struct btrfs_ordered_inode_tree *tree; in btrfs_add_ordered_sum() local
316 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_dec_test_first_ordered_pending() local
385 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_dec_test_ordered_pending() local
469 struct btrfs_ordered_inode_tree *tree; in btrfs_remove_ordered_extent() local
745 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_extent() local
771 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_ordered_range() local
812 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; in btrfs_get_ordered_extents_for_logging() local
840 struct btrfs_ordered_inode_tree *tree; in btrfs_lookup_first_ordered_extent() local
[all …]
/kernel/linux/linux-5.10/fs/hfs/
Dbtree.c21 struct hfs_btree *tree; in hfs_btree_open() local
137 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
160 void hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
190 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
224 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
247 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
323 struct hfs_btree *tree; in hfs_bmap_free() local
/kernel/linux/linux-6.6/fs/hfs/
Dbtree.c21 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
Dbnode.c60 struct hfs_btree *tree; in hfs_bnode_read_key() local
187 struct hfs_btree *tree; in hfs_bnode_unlink() local
232 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
250 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
323 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
417 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
467 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
Dbrec.c67 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()
/kernel/linux/linux-6.6/fs/hfsplus/
Dbtree.c135 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
Dbnode.c59 struct hfs_btree *tree; in hfs_bnode_read_key() local
336 struct hfs_btree *tree; in hfs_bnode_unlink() local
382 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
399 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
473 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
568 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
618 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
650 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
Dbrec.c65 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()
/kernel/linux/linux-5.10/fs/hfsplus/
Dbtree.c135 struct hfs_btree *tree; in hfs_btree_open() local
258 void hfs_btree_close(struct hfs_btree *tree) in hfs_btree_close()
282 int hfs_btree_write(struct hfs_btree *tree) in hfs_btree_write()
314 struct hfs_btree *tree = prev->tree; in hfs_bmap_new_bmap() local
346 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes) in hfs_bmap_reserve()
373 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree) in hfs_bmap_alloc()
450 struct hfs_btree *tree; in hfs_bmap_free() local
Dbnode.c61 struct hfs_btree *tree; in hfs_bnode_read_key() local
337 struct hfs_btree *tree; in hfs_bnode_unlink() local
383 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash()
400 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create()
478 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find()
573 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create()
625 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
657 bool hfs_bnode_need_zeroout(struct hfs_btree *tree) in hfs_bnode_need_zeroout()
Dbrec.c65 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()
/kernel/linux/linux-5.10/fs/unicode/
Dmkutf8data.c345 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 …]
/kernel/linux/linux-6.6/fs/unicode/
Dmkutf8data.c345 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 …]
/kernel/linux/linux-5.10/kernel/
Daudit_tree.c95 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 …]
/kernel/linux/linux-6.6/kernel/
Daudit_tree.c95 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 …]
/kernel/linux/linux-6.6/lib/zlib_deflate/
Ddeftree.c150 # 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()
/kernel/linux/linux-5.10/lib/zlib_deflate/
Ddeftree.c150 # 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()
/kernel/linux/linux-6.6/include/linux/
Drbtree.h165 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()
256 rb_find(const void *key, const struct rb_root *tree, in rb_find()
284 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first()
330 #define rb_for_each(node, key, tree, cmp) \ argument
/kernel/linux/linux-6.6/net/sched/
Dematch.c162 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()
/kernel/linux/linux-5.10/net/sched/
Dematch.c162 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()

123456789