| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| H A D | bset.h | 173 struct bkey_float *tree; global() member
[all...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gem/ |
| H A D | i915_gem_object_types.h | 115 struct rb_root tree; member
|
| /kernel/linux/linux-5.10/drivers/of/ |
| H A D | overlay.c | 730 init_overlay_changeset(struct overlay_changeset *ovcs, const void *fdt, struct device_node *tree) init_overlay_changeset() argument
914 of_overlay_apply(const void *fdt, struct device_node *tree, int *ovcs_id) of_overlay_apply() argument
1075 find_node(struct device_node *tree, struct device_node *np) find_node() argument
[all...] |
| /kernel/linux/linux-5.10/tools/objtool/ |
| H A D | elf.c | 46 static void rb_add(struct rb_root *tree, struct rb_node *node, in rb_add() argument
64 static struct rb_node *rb_find_first(const struct rb_root *tree, const void *key, in rb_find_first() argument
|
| /kernel/linux/linux-5.10/tools/perf/ui/stdio/ |
| H A D | hist.c | 305 static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, in callchain__fprintf_flat() argument
356 static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, in callchain__fprintf_folded() argument
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | srcline.c | 614 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() argument
644 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() argument
663 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() argument
705 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() argument
728 inlines__tree_find(struct rb_root_cached *tree, u64 addr) inlines__tree_find() argument
747 inlines__tree_delete(struct rb_root_cached *tree) inlines__tree_delete() argument
[all...] |
| /kernel/linux/linux-5.10/fs/jfs/ |
| H A D | jfs_dmap.h | 151 struct dmaptree tree; /* 360: dmap tree */ global() member
[all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ordered-data.c | 134 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
169 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; __btrfs_add_ordered_extent() local
291 struct btrfs_ordered_inode_tree *tree; btrfs_add_ordered_sum() local
316 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_first_ordered_pending() local
385 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_ordered_pending() local
469 struct btrfs_ordered_inode_tree *tree; btrfs_remove_ordered_extent() local
745 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_extent() local
771 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_range() local
812 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_get_ordered_extents_for_logging() local
840 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_first_ordered_extent() local
868 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_find_ordered_sum() local
[all...] |
| /kernel/linux/linux-5.10/lib/zlib_deflate/ |
| H A D | deftree.c | 317 pqdownheap( deflate_state *s, ct_data *tree, int k ) pqdownheap() argument
358 ct_data *tree = desc->dyn_tree; gen_bitlen() local
441 gen_codes( ct_data *tree, int max_code, ush *bl_count ) gen_codes() argument
489 ct_data *tree = desc->dyn_tree; build_tree() local
572 scan_tree( deflate_state *s, ct_data *tree, int max_code ) scan_tree() argument
618 send_tree( deflate_state *s, ct_data *tree, int max_code ) send_tree() argument
[all...] |
| /kernel/linux/linux-5.10/lib/zstd/ |
| H A D | huf_compress.c | 420 size_t HUF_buildCTable_wksp(HUF_CElt *tree, const U32 *count, U32 maxSymbolValue, U32 maxNbBits, void *workSpace, size_t wkspSize) in HUF_buildCTable_wksp() argument
|
| /kernel/linux/linux-5.10/kernel/ |
| H A D | auditfilter.c | 934 struct audit_tree *tree in audit_add_rule() local
1016 struct audit_tree *tree = entry->rule.tree; audit_del_rule() local
[all...] |
| H A D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local
111 get_tree(struct audit_tree *tree) get_tree() argument
116 put_tree(struct audit_tree *tree) put_tree() argument
123 audit_tree_path(struct audit_tree *tree) audit_tree_path() argument
261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) audit_tree_match() argument
397 create_chunk(struct inode *inode, struct audit_tree *tree) create_chunk() argument
458 tag_chunk(struct inode *inode, struct audit_tree *tree) tag_chunk() argument
542 kill_rules(struct audit_context *context, struct audit_tree *tree) kill_rules() argument
609 trim_marked(struct audit_tree *tree) trim_marked() argument
635 kill_rules(audit_context(), tree); trim_marked() local
649 struct audit_tree *tree; audit_remove_tree_rule() local
684 struct audit_tree *tree; audit_trim_trees() local
740 audit_put_tree(struct audit_tree *tree) audit_put_tree() argument
802 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
897 struct audit_tree *tree; audit_tag_tree() local
936 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /kernel/linux/linux-5.10/fs/xfs/ |
| H A D | xfs_dquot.c | 881 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget() local
970 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget_inode() local
770 xfs_qm_dqget_cache_lookup( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id) xfs_qm_dqget_cache_lookup() argument
811 xfs_qm_dqget_cache_insert( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id, struct xfs_dquot *dqp) xfs_qm_dqget_cache_insert() argument
[all...] |
| H A D | xfs_qm.c | 55 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dquot_walk() local
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | backref.h | 517 btrfs_backref_drop_node(struct btrfs_backref_cache *tree, struct btrfs_backref_node *node) btrfs_backref_drop_node() argument
[all...] |
| H A D | ordered-data.c | 127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, in tree_search() argument
212 struct btrfs_ordered_inode_tree *tree in insert_ordered_extent() local
291 struct btrfs_ordered_inode_tree *tree; btrfs_add_ordered_sum() local
408 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_mark_ordered_io_finished() local
501 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_dec_test_ordered_pending() local
582 struct btrfs_ordered_inode_tree *tree; btrfs_remove_ordered_extent() local
881 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_extent() local
910 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_ordered_range() local
953 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_get_ordered_extents_for_logging() local
982 struct btrfs_ordered_inode_tree *tree; btrfs_lookup_first_ordered_extent() local
1012 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_lookup_first_ordered_range() local
1153 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; btrfs_split_ordered_extent() local
[all...] |
| H A D | extent-io-tree.c | 57 __btrfs_debug_check_extent_io_range(const char *caller, struct extent_io_tree *tree, u64 start, u64 end) __btrfs_debug_check_extent_io_range() argument
96 extent_io_tree_init(struct btrfs_fs_info *fs_info, struct extent_io_tree *tree, unsigned int owner) extent_io_tree_init() argument
108 extent_io_tree_release(struct extent_io_tree *tree) extent_io_tree_release() argument
233 tree_search_for_insert(struct extent_io_tree *tree, u64 offset, struct rb_node ***node_ret, struct rb_node **parent_ret) tree_search_for_insert() argument
279 tree_search_prev_next(struct extent_io_tree *tree, u64 offset, struct extent_state **prev_ret, struct extent_state **next_ret) tree_search_prev_next() argument
319 tree_search(struct extent_io_tree *tree, u64 offset) tree_search() argument
324 extent_io_tree_panic(struct extent_io_tree *tree, int err) extent_io_tree_panic() argument
339 merge_state(struct extent_io_tree *tree, struct extent_state *state) merge_state() argument
368 set_state_bits(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) set_state_bits() argument
393 insert_state(struct extent_io_tree *tree, struct extent_state *state, u32 bits, struct extent_changeset *changeset) insert_state() argument
432 insert_state_fast(struct extent_io_tree *tree, struct extent_state *state, struct rb_node **node, struct rb_node *parent, unsigned bits, struct extent_changeset *changeset) insert_state_fast() argument
457 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) split_state() argument
502 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, u32 bits, int wake, struct extent_changeset *changeset) clear_state_bit() argument
557 __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state, struct extent_changeset *changeset) __clear_extent_bit() argument
729 wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) wait_extent_bit() argument
811 find_first_extent_bit_state(struct extent_io_tree *tree, u64 start, u32 bits) find_first_extent_bit_state() argument
837 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits, struct extent_state **cached_state) find_first_extent_bit() argument
889 find_contiguous_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) find_contiguous_extent_bit() argument
917 btrfs_find_delalloc_range(struct extent_io_tree *tree, u64 *start, u64 *end, u64 max_bytes, struct extent_state **cached_state) btrfs_find_delalloc_range() argument
980 __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, u64 *failed_start, struct extent_state **failed_state, struct extent_state **cached_state, struct extent_changeset *changeset) __set_extent_bit() argument
1205 set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_state **cached_state) set_extent_bit() argument
1230 convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, u32 clear_bits, struct extent_state **cached_state) convert_extent_bit() argument
1439 find_first_clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, u32 bits) find_first_clear_extent_bit() argument
1557 count_range_bits(struct extent_io_tree *tree, u64 *start, u64 search_end, u64 max_bytes, u32 bits, int contig, struct extent_state **cached_state) count_range_bits() argument
1647 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, int filled, struct extent_state *cached) test_range_bit() argument
1694 set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) set_record_extent_bits() argument
1708 clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, u32 bits, struct extent_changeset *changeset) clear_record_extent_bits() argument
1720 try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached) try_lock_extent() argument
1741 lock_extent(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state) lock_extent() argument
[all...] |
| H A D | extent_map.c | 35 void extent_map_tree_init(struct extent_map_tree *tree) in extent_map_tree_init() argument
231 static void try_merge_map(struct extent_map_tree *tree, struct extent_map *em) in try_merge_map() argument
295 unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len, u64 gen) unpin_extent_cache() argument
334 clear_em_logging(struct extent_map_tree *tree, struct extent_map *em) clear_em_logging() argument
343 setup_extent_mapping(struct extent_map_tree *tree, struct extent_map *em, int modified) setup_extent_mapping() argument
403 add_extent_mapping(struct extent_map_tree *tree, struct extent_map *em, int modified) add_extent_mapping() argument
424 __lookup_extent_mapping(struct extent_map_tree *tree, u64 start, u64 len, int strict) __lookup_extent_mapping() argument
461 lookup_extent_mapping(struct extent_map_tree *tree, u64 start, u64 len) lookup_extent_mapping() argument
479 search_extent_mapping(struct extent_map_tree *tree, u64 start, u64 len) search_extent_mapping() argument
494 remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em) remove_extent_mapping() argument
507 replace_extent_mapping(struct extent_map_tree *tree, struct extent_map *cur, struct extent_map *new, int modified) replace_extent_mapping() argument
675 drop_all_extent_maps_fast(struct extent_map_tree *tree) drop_all_extent_maps_fast() argument
940 struct extent_map_tree *tree = &inode->extent_tree; btrfs_replace_extent_map_range() local
[all...] |
| /kernel/linux/linux-6.6/fs/dlm/ |
| H A D | debug_fs.c | 478 struct rb_root *tree; in table_seq_start() local
562 struct rb_root *tree; in table_seq_next() local
[all...] |
| /kernel/linux/linux-6.6/fs/jfs/ |
| H A D | jfs_dmap.h | 151 struct dmaptree tree; /* 360: dmap tree */ global() member
[all...] |
| /kernel/linux/linux-6.6/fs/xfs/ |
| H A D | xfs_dquot.c | 855 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget() local
944 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget_inode() local
748 xfs_qm_dqget_cache_lookup( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id) xfs_qm_dqget_cache_lookup() argument
789 xfs_qm_dqget_cache_insert( struct xfs_mount *mp, struct xfs_quotainfo *qi, struct radix_tree_root *tree, xfs_dqid_t id, struct xfs_dquot *dqp) xfs_qm_dqget_cache_insert() argument
[all...] |
| H A D | xfs_qm.c | 58 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dquot_walk() local
|
| /kernel/linux/linux-6.6/kernel/ |
| H A D | auditfilter.c | 943 struct audit_tree *tree in audit_add_rule() local
1026 struct audit_tree *tree = entry->rule.tree; audit_del_rule() local
[all...] |
| H A D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local
111 get_tree(struct audit_tree *tree) get_tree() argument
116 put_tree(struct audit_tree *tree) put_tree() argument
123 audit_tree_path(struct audit_tree *tree) audit_tree_path() argument
261 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) audit_tree_match() argument
397 create_chunk(struct inode *inode, struct audit_tree *tree) create_chunk() argument
458 tag_chunk(struct inode *inode, struct audit_tree *tree) tag_chunk() argument
542 kill_rules(struct audit_context *context, struct audit_tree *tree) kill_rules() argument
609 trim_marked(struct audit_tree *tree) trim_marked() argument
635 kill_rules(audit_context(), tree); trim_marked() local
649 struct audit_tree *tree; audit_remove_tree_rule() local
684 struct audit_tree *tree; audit_trim_trees() local
740 audit_put_tree(struct audit_tree *tree) audit_put_tree() argument
802 struct audit_tree *seed = rule->tree, *tree; audit_add_tree_rule() local
897 struct audit_tree *tree; audit_tag_tree() local
934 struct audit_tree *tree; audit_tag_tree() local
[all...] |
| /kernel/linux/linux-6.6/kernel/module/ |
| H A D | internal.h | 311 static inline struct module *mod_find(unsigned long addr, struct mod_tree_root *tree) in mod_find() argument
|