Orange Pi5 kernel

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