[linux-2.6-block.git] / tools / testing / radix-tree / test.h

/* SPDX-License-Identifier: GPL-2.0 */
#include <linux/gfp.h>
#include <linux/types.h>
#include <linux/radix-tree.h>
#include <linux/rcupdate.h>

struct item {
	unsigned long index;
	unsigned int order;
};

struct item *item_create(unsigned long index, unsigned int order);
int __item_insert(struct radix_tree_root *root, struct item *item);
int item_insert(struct radix_tree_root *root, unsigned long index);
int item_insert_order(struct radix_tree_root *root, unsigned long index,
			unsigned order);
int item_delete(struct radix_tree_root *root, unsigned long index);
struct item *item_lookup(struct radix_tree_root *root, unsigned long index);

void item_check_present(struct radix_tree_root *root, unsigned long index);
void item_check_absent(struct radix_tree_root *root, unsigned long index);
void item_gang_check_present(struct radix_tree_root *root,
			unsigned long start, unsigned long nr,
			int chunk, int hop);
void item_full_scan(struct radix_tree_root *root, unsigned long start,
			unsigned long nr, int chunk);
void item_kill_tree(struct radix_tree_root *root);

int tag_tagged_items(struct radix_tree_root *, pthread_mutex_t *,
			unsigned long start, unsigned long end, unsigned batch,
			unsigned iftag, unsigned thentag);
unsigned long find_item(struct radix_tree_root *, void *item);

void tag_check(void);
void multiorder_checks(void);
void iteration_test(unsigned order, unsigned duration);
void benchmark(void);
void idr_checks(void);
void ida_checks(void);
void ida_thread_tests(void);

struct item *
item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
struct item *
item_tag_clear(struct radix_tree_root *root, unsigned long index, int tag);
int item_tag_get(struct radix_tree_root *root, unsigned long index, int tag);
void tree_verify_min_height(struct radix_tree_root *root, int maxindex);
void verify_tag_consistency(struct radix_tree_root *root, unsigned int tag);

extern int nr_allocated;

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