Home
last modified time | relevance | path

Searched refs:radix_tree_root (Results 1 – 25 of 56) sorted by relevance

123

/linux/include/linux/
A Dradix-tree.h25 #define radix_tree_root xarray macro
82 struct radix_tree_root name = RADIX_TREE_INIT(name, mask)
228 void radix_tree_iter_replace(struct radix_tree_root *,
230 void radix_tree_replace_slot(struct radix_tree_root *,
232 void radix_tree_iter_delete(struct radix_tree_root *,
242 void *radix_tree_tag_set(struct radix_tree_root *,
244 void *radix_tree_tag_clear(struct radix_tree_root *,
246 int radix_tree_tag_get(const struct radix_tree_root *,
248 void radix_tree_iter_tag_clear(struct radix_tree_root *,
263 void __rcu **idr_get_free(struct radix_tree_root *root,
[all …]
A Diocontext.h109 struct radix_tree_root icq_tree;
A Dbacking-dev-defs.h193 struct radix_tree_root cgwb_tree; /* radix tree of active cgroup wbs */
A Didr.h20 struct radix_tree_root idr_rt;
/linux/tools/testing/radix-tree/
A Dtest.h14 int item_insert(struct radix_tree_root *root, unsigned long index);
17 int item_delete(struct radix_tree_root *root, unsigned long index);
19 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
21 void item_check_present(struct radix_tree_root *root, unsigned long index);
22 void item_check_absent(struct radix_tree_root *root, unsigned long index);
23 void item_gang_check_present(struct radix_tree_root *root,
26 void item_full_scan(struct radix_tree_root *root, unsigned long start,
28 void item_kill_tree(struct radix_tree_root *root);
47 void tree_verify_min_height(struct radix_tree_root *root, int maxindex);
54 void radix_tree_dump(struct radix_tree_root *root);
[all …]
A Dtest.c12 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_set()
18 item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_clear()
23 int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag) in item_tag_get()
37 int item_insert(struct radix_tree_root *root, unsigned long index) in item_insert()
61 int item_delete(struct radix_tree_root *root, unsigned long index) in item_delete()
91 void item_check_present(struct radix_tree_root *root, unsigned long index) in item_check_present()
100 struct item *item_lookup(struct radix_tree_root *root, unsigned long index) in item_lookup()
105 void item_check_absent(struct radix_tree_root *root, unsigned long index) in item_check_absent()
116 void item_gang_check_present(struct radix_tree_root *root, in item_gang_check_present()
143 void item_full_scan(struct radix_tree_root *root, unsigned long start, in item_full_scan()
[all …]
A Dbenchmark.c14 static long long benchmark_iter(struct radix_tree_root *root, bool tagged) in benchmark_iter()
52 static void benchmark_insert(struct radix_tree_root *root, in benchmark_insert()
73 static void benchmark_tagging(struct radix_tree_root *root, in benchmark_tagging()
94 static void benchmark_delete(struct radix_tree_root *root, in benchmark_delete()
A Dtag_check.c14 __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()
A Dmultiorder.c168 struct radix_tree_root *tree = ptr; in creator_func()
/linux/lib/
A Dradix-tree.c141 static inline bool is_idr(const struct radix_tree_root *root) in is_idr()
232 struct radix_tree_root *root, in radix_tree_node_alloc()
541 static bool delete_node(struct radix_tree_root *root, in delete_node()
848 static int calculate_count(struct radix_tree_root *root, in calculate_count()
873 void __radix_tree_replace(struct radix_tree_root *root, in __radix_tree_replace()
936 static void node_tag_set(struct radix_tree_root *root, in node_tag_set()
965 void *radix_tree_tag_set(struct radix_tree_root *root, in radix_tree_tag_set()
993 static void node_tag_clear(struct radix_tree_root *root, in node_tag_clear()
1027 void *radix_tree_tag_clear(struct radix_tree_root *root, in radix_tree_tag_clear()
1393 void radix_tree_iter_delete(struct radix_tree_root *root, in radix_tree_iter_delete()
[all …]
/linux/fs/xfs/
A Dxfs_qm.h52 struct radix_tree_root qi_uquota_tree;
53 struct radix_tree_root qi_gquota_tree;
54 struct radix_tree_root qi_pquota_tree;
74 static inline struct radix_tree_root *
A Dxfs_dquot.c777 struct radix_tree_root *tree, in xfs_qm_dqget_cache_lookup()
818 struct radix_tree_root *tree, in xfs_qm_dqget_cache_insert()
882 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget()
971 struct radix_tree_root *tree = xfs_dquot_tree(qi, type); in xfs_qm_dqget_inode()
/linux/drivers/pinctrl/
A Dcore.h45 struct radix_tree_root pin_desc_tree;
47 struct radix_tree_root pin_group_tree;
51 struct radix_tree_root pin_function_tree;
/linux/arch/s390/include/asm/
A Dgmap.h50 struct radix_tree_root guest_to_host;
51 struct radix_tree_root host_to_guest;
62 struct radix_tree_root host_to_rmap;
/linux/drivers/block/null_blk/
A Dnull_blk.h64 struct radix_tree_root data; /* data stored in the disk */
65 struct radix_tree_root cache; /* disk cache data */
/linux/drivers/gpu/drm/i915/gem/
A Di915_gem_context_types.h390 struct radix_tree_root handles_vma;
A Di915_gem_object_types.h203 struct radix_tree_root radix;
/linux/fs/f2fs/
A Dgc.h55 struct radix_tree_root iroot;
/linux/drivers/net/ethernet/mellanox/mlx5/core/lib/
A Deq.h21 struct radix_tree_root tree;
/linux/drivers/infiniband/core/
A Drdma_core.h115 struct radix_tree_root radix;
/linux/fs/xfs/libxfs/
A Dxfs_ag.h89 struct radix_tree_root pag_ici_root; /* incore inode cache root */
/linux/drivers/net/ethernet/netronome/nfp/abm/
A Dmain.h222 struct radix_tree_root qdiscs;
/linux/fs/btrfs/
A Dvolumes.h130 struct radix_tree_root reada_zones;
131 struct radix_tree_root reada_extents;
/linux/drivers/sh/intc/
A Dinternals.h57 struct radix_tree_root tree;
/linux/drivers/gpu/drm/i915/gvt/
A Dgtt.h215 struct radix_tree_root spt_tree;

Completed in 33 milliseconds

123