| /linux/fs/btrfs/ |
| H A D | extent-io-tree.c | 57 #define btrfs_debug_check_extent_io_range(tree, start, end) \ argument 60 struct extent_io_tree *tree, in __btrfs_debug_check_extent_io_range() 84 const struct btrfs_inode *btrfs_extent_io_tree_to_inode(const struct extent_io_tree *tree) in btrfs_extent_io_tree_to_inode() 92 const struct btrfs_fs_info *btrfs_extent_io_tree_to_fs_info(const struct extent_io_tree *tree) in btrfs_extent_io_tree_to_fs_info() 100 struct extent_io_tree *tree, unsigned int owner) in btrfs_extent_io_tree_init() 115 void btrfs_extent_io_tree_release(struct extent_io_tree *tree) in btrfs_extent_io_tree_release() 237 static inline struct extent_state *tree_search_for_insert(struct extent_io_tree *tree, in tree_search_for_insert() 287 static struct extent_state *tree_search_prev_next(struct extent_io_tree *tree, in tree_search_prev_next() 327 static inline struct extent_state *tree_search(struct extent_io_tree *tree, u64 offset) in tree_search() 332 static void __cold extent_io_tree_panic(const struct extent_io_tree *tree, in extent_io_tree_panic() [all …]
|
| H A D | extent-io-tree.h | 149 static inline int btrfs_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, in btrfs_lock_extent() 155 static inline bool btrfs_try_lock_extent(struct extent_io_tree *tree, u64 start, in btrfs_try_lock_extent() 181 static inline int btrfs_clear_extent_bit(struct extent_io_tree *tree, u64 start, in btrfs_clear_extent_bit() 188 static inline int btrfs_unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, in btrfs_unlock_extent() 200 static inline int btrfs_clear_extent_dirty(struct extent_io_tree *tree, u64 start, in btrfs_clear_extent_dirty() 222 static inline int btrfs_lock_dio_extent(struct extent_io_tree *tree, u64 start, in btrfs_lock_dio_extent() 228 static inline bool btrfs_try_lock_dio_extent(struct extent_io_tree *tree, u64 start, in btrfs_try_lock_dio_extent() 234 static inline int btrfs_unlock_dio_extent(struct extent_io_tree *tree, u64 start, in btrfs_unlock_dio_extent()
|
| H A D | extent_map.c | 34 void btrfs_extent_map_tree_init(struct extent_map_tree *tree) in btrfs_extent_map_tree_init() 415 struct extent_map_tree *tree = &inode->extent_tree; in btrfs_unpin_extent_cache() local 491 struct extent_map_tree *tree = &inode->extent_tree; in add_extent_mapping() local 511 static struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree, in lookup_extent_mapping() 548 struct extent_map *btrfs_lookup_extent_mapping(struct extent_map_tree *tree, in btrfs_lookup_extent_mapping() 566 struct extent_map *btrfs_search_extent_mapping(struct extent_map_tree *tree, in btrfs_search_extent_mapping() 583 struct extent_map_tree *tree = &inode->extent_tree; in btrfs_remove_extent_mapping() local 600 struct extent_map_tree *tree = &inode->extent_tree; in replace_extent_mapping() local 763 struct extent_map_tree *tree = &inode->extent_tree; in drop_all_extent_maps_fast() local 1006 struct extent_map_tree *tree = &inode->extent_tree; in btrfs_replace_extent_map_range() local [all …]
|
| /linux/drivers/gpu/drm/xe/ |
| H A 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/fs/unicode/ |
| H A 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/kernel/ |
| H A D | audit_tree.c | 95 struct audit_tree *tree; in alloc_tree() local 113 static inline void get_tree(struct audit_tree *tree) in get_tree() 118 static inline void put_tree(struct audit_tree *tree) in put_tree() 125 const char *audit_tree_path(struct audit_tree *tree) in audit_tree_path() 263 bool audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) in audit_tree_match() 399 static int create_chunk(struct inode *inode, struct audit_tree *tree) in create_chunk() 460 static int tag_chunk(struct inode *inode, struct audit_tree *tree) in tag_chunk() 544 static void kill_rules(struct audit_context *context, struct audit_tree *tree) in kill_rules() 611 static void trim_marked(struct audit_tree *tree) in trim_marked() 651 struct audit_tree *tree; in audit_remove_tree_rule() local [all …]
|
| /linux/include/linux/ |
| H A D | rbtree.h | 193 rb_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_add_cached() 223 rb_add(struct rb_node *node, struct rb_root *tree, in rb_add() 251 rb_find_add_cached(struct rb_node *node, struct rb_root_cached *tree, in rb_find_add_cached() 288 rb_find_add(struct rb_node *node, struct rb_root *tree, in rb_find_add() 324 rb_find_add_rcu(struct rb_node *node, struct rb_root *tree, in rb_find_add_rcu() 357 rb_find(const void *key, const struct rb_root *tree, in rb_find() 388 rb_find_rcu(const void *key, const struct rb_root *tree, in rb_find_rcu() 416 rb_find_first(const void *key, const struct rb_root *tree, in rb_find_first() 462 #define rb_for_each(node, key, tree, cmp) \ argument
|
| H A D | vmpressure.h | 47 static inline void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree, in vmpressure()
|
| /linux/lib/zlib_deflate/ |
| H A 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/net/sched/ |
| H A 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/tools/include/linux/ |
| H A 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/tools/perf/util/ |
| H A D | srcline.c | 263 void srcline__tree_insert(struct rb_root_cached *tree, u64 addr, char *srcline) in srcline__tree_insert() 293 char *srcline__tree_find(struct rb_root_cached *tree, u64 addr) in srcline__tree_find() 312 void srcline__tree_delete(struct rb_root_cached *tree) in srcline__tree_delete() 354 void inlines__tree_insert(struct rb_root_cached *tree, in inlines__tree_insert() 377 struct inline_node *inlines__tree_find(struct rb_root_cached *tree, u64 addr) in inlines__tree_find() 396 void inlines__tree_delete(struct rb_root_cached *tree) in inlines__tree_delete()
|
| /linux/kernel/module/ |
| H A 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/scripts/dtc/ |
| H A D | fstree.c | 16 struct node *tree; in read_fstree() local 70 struct node *tree; in dt_from_fs() local
|
| /linux/tools/testing/radix-tree/ |
| H A 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/drivers/android/binder/range_alloc/ |
| H A D | tree.rs | 25 tree: RBTree<usize, Descriptor<T>>, field 39 let mut tree = TreeRangeAllocator { in from_array() localVariable 468 tree: KVec<RBTreeNodeReservation<usize, Descriptor<T>>>, field 476 let mut tree = KVec::with_capacity(num_descriptors, GFP_KERNEL)?; in try_new() localVariable
|
| /linux/fs/ocfs2/ |
| H A D | uptodate.c | 157 unsigned int tree, to_purge, purged; in ocfs2_metadata_cache_purge() local 350 struct ocfs2_meta_cache_item **tree) in ocfs2_expand_cache() 390 struct ocfs2_meta_cache_item *tree[OCFS2_CACHE_INFO_MAX_ARRAY] = in __ocfs2_set_buffer_uptodate() local
|
| H A D | refcounttree.c | 199 struct ocfs2_refcount_tree *tree = NULL; in ocfs2_find_refcount_tree() local 246 static void ocfs2_free_refcount_tree(struct ocfs2_refcount_tree *tree) in ocfs2_free_refcount_tree() 256 struct ocfs2_refcount_tree *tree) in ocfs2_erase_refcount_tree_from_list_no_lock() 264 struct ocfs2_refcount_tree *tree) in ocfs2_erase_refcount_tree_from_list() 273 struct ocfs2_refcount_tree *tree = in ocfs2_kref_remove_refcount_tree() local 280 ocfs2_refcount_tree_get(struct ocfs2_refcount_tree *tree) in ocfs2_refcount_tree_get() 286 ocfs2_refcount_tree_put(struct ocfs2_refcount_tree *tree) in ocfs2_refcount_tree_put() 329 struct ocfs2_refcount_tree *tree, *new = NULL; in ocfs2_get_refcount_tree() local 418 struct ocfs2_refcount_tree *tree, int rw) in __ocfs2_lock_refcount_tree() 451 struct ocfs2_refcount_tree *tree = NULL; in ocfs2_lock_refcount_tree() local [all …]
|
| /linux/sound/hda/core/ |
| H A D | sysfs.c | 322 struct hdac_widget_tree *tree = codec->widgets; in widget_tree_free() local 365 struct hdac_widget_tree *tree; in widget_tree_create() local 427 struct hdac_widget_tree *tree; in hda_widget_sysfs_reinit() local
|
| /linux/rust/kernel/ |
| H A D | maple_tree.rs | 31 tree: Opaque<bindings::maple_tree>, field 42 tree: MapleTree<T>, field 384 let tree = pin_init!(MapleTree { in new() localVariable
|
| /linux/drivers/infiniband/hw/mlx5/ |
| H A D | qp.h | 18 struct radix_tree_root tree; member
|
| /linux/drivers/infiniband/sw/rxe/ |
| H A D | rxe_mcast.c | 83 struct rb_root *tree = &mcg->rxe->mcg_tree; in __rxe_insert_mcg() local 126 struct rb_root *tree = &rxe->mcg_tree; in __rxe_lookup_mcg() local
|
| /linux/fs/smb/client/ |
| H A D | dfs.c | 339 char *tree, bool islink, in tree_connect_dfs_target() 395 char *tree; in cifs_tree_connect() local
|
| /linux/mm/ |
| H A D | zswap.c | 1003 struct xarray *tree; in zswap_writeback_entry() local 1567 struct xarray *tree; in zswap_store() local 1605 struct xarray *tree = swap_zswap_tree(swp); in zswap_load() local 1663 struct xarray *tree = swap_zswap_tree(swp); in zswap_invalidate() local 1676 struct xarray *trees, *tree; in zswap_swapon() local
|
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_active_types.h | 31 struct rb_root tree; member
|