1/* SPDX-License-Identifier: GPL-2.0 */
 2#include <linux/gfp.h>
 3#include <linux/types.h>
 4#include <linux/radix-tree.h>
 5#include <linux/rcupdate.h>
 6
 7struct item {
 8	struct rcu_head	rcu_head;
 9	unsigned long index;
10	unsigned int order;
11};
12
13struct item *item_create(unsigned long index, unsigned int order);
 
14int item_insert(struct radix_tree_root *root, unsigned long index);
15void item_sanity(struct item *item, unsigned long index);
16void item_free(struct item *item, unsigned long index);
 
17int item_delete(struct radix_tree_root *root, unsigned long index);
18int item_delete_rcu(struct xarray *xa, unsigned long index);
19struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
20
21void item_check_present(struct radix_tree_root *root, unsigned long index);
22void item_check_absent(struct radix_tree_root *root, unsigned long index);
23void item_gang_check_present(struct radix_tree_root *root,
24			unsigned long start, unsigned long nr,
25			int chunk, int hop);
26void item_full_scan(struct radix_tree_root *root, unsigned long start,
27			unsigned long nr, int chunk);
28void item_kill_tree(struct radix_tree_root *root);
29
30int tag_tagged_items(struct xarray *, unsigned long start, unsigned long end,
31		unsigned batch, xa_mark_t iftag, xa_mark_t thentag);
 
 
32
33void xarray_tests(void);
34void tag_check(void);
35void multiorder_checks(void);
36void iteration_test(unsigned order, unsigned duration);
37void iteration_test2(unsigned duration);
38void benchmark(void);
39void idr_checks(void);
40void ida_tests(void);
 
41
42struct item *
43item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
44struct item *
45item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag);
46int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag);
47void tree_verify_min_height(struct radix_tree_root *root, int maxindex);
48void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag);
49
50extern int nr_allocated;
51
52/* Normally private parts of lib/radix-tree.c */
53struct radix_tree_node *entry_to_node(void *ptr);
54void radix_tree_dump(struct radix_tree_root *root);
55int root_tag_get(struct radix_tree_root *root, unsigned int tag);
56unsigned long node_maxindex(struct radix_tree_node *);
57unsigned long shift_maxindex(unsigned int shift);
58int radix_tree_cpu_dead(unsigned int cpu);
 
 
 
 
59extern struct radix_tree_preload radix_tree_preloads;

 1/* SPDX-License-Identifier: GPL-2.0 */
 2#include <linux/gfp.h>
 3#include <linux/types.h>
 4#include <linux/radix-tree.h>
 5#include <linux/rcupdate.h>
 6
 7struct item {
 8	struct rcu_head	rcu_head;
 9	unsigned long index;
10	unsigned int order;
11};
12
13struct item *item_create(unsigned long index, unsigned int order);
14int __item_insert(struct radix_tree_root *root, struct item *item);
15int item_insert(struct radix_tree_root *root, unsigned long index);
16void item_sanity(struct item *item, unsigned long index);
17int item_insert_order(struct radix_tree_root *root, unsigned long index,
18			unsigned order);
19int item_delete(struct radix_tree_root *root, unsigned long index);
20int item_delete_rcu(struct radix_tree_root *root, unsigned long index);
21struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
22
23void item_check_present(struct radix_tree_root *root, unsigned long index);
24void item_check_absent(struct radix_tree_root *root, unsigned long index);
25void item_gang_check_present(struct radix_tree_root *root,
26			unsigned long start, unsigned long nr,
27			int chunk, int hop);
28void item_full_scan(struct radix_tree_root *root, unsigned long start,
29			unsigned long nr, int chunk);
30void item_kill_tree(struct radix_tree_root *root);
31
32int tag_tagged_items(struct radix_tree_root *, pthread_mutex_t *,
33			unsigned long start, unsigned long end, unsigned batch,
34			unsigned iftag, unsigned thentag);
35unsigned long find_item(struct radix_tree_root *, void *item);
36
 
37void tag_check(void);
38void multiorder_checks(void);
39void iteration_test(unsigned order, unsigned duration);
 
40void benchmark(void);
41void idr_checks(void);
42void ida_checks(void);
43void ida_thread_tests(void);
44
45struct item *
46item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
47struct item *
48item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag);
49int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag);
50void tree_verify_min_height(struct radix_tree_root *root, int maxindex);
51void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag);
52
53extern int nr_allocated;
54
55/* Normally private parts of lib/radix-tree.c */
56struct radix_tree_node *entry_to_node(void *ptr);
57void radix_tree_dump(struct radix_tree_root *root);
58int root_tag_get(struct radix_tree_root *root, unsigned int tag);
59unsigned long node_maxindex(struct radix_tree_node *);
60unsigned long shift_maxindex(unsigned int shift);
61int radix_tree_cpu_dead(unsigned int cpu);
62struct radix_tree_preload {
63	unsigned nr;
64	struct radix_tree_node *nodes;
65};
66extern struct radix_tree_preload radix_tree_preloads;