299 struct xbitmap32_node {  struct
319 xbitmap32_tree_insert(struct xbitmap32_node *node, struct rb_root_cached *root);  argument
322 xbitmap32_tree_remove(struct xbitmap32_node *node, struct rb_root_cached *root);
324 static inline __maybe_unused struct xbitmap32_node *
328 static inline __maybe_unused struct xbitmap32_node *
329 xbitmap32_tree_iter_next(struct xbitmap32_node *node, uint32_t start,
332 INTERVAL_TREE_DEFINE(struct xbitmap32_node, bn_rbnode, uint32_t,  in INTERVAL_TREE_DEFINE()  argument
339 				   struct xbitmap32_node, bn_rbnode); \  in INTERVAL_TREE_DEFINE()
342 				   struct xbitmap32_node, bn_rbnode))
351 	struct xbitmap32_node	*bn;
352 	struct xbitmap32_node	*new_bn;
365 			new_bn = kmalloc(sizeof(struct xbitmap32_node),
400 	struct xbitmap32_node	*left;  in xbitmap32_set()
401 	struct xbitmap32_node	*right;  in xbitmap32_set()
442 		left = kmalloc(sizeof(struct xbitmap32_node), XCHK_GFP_FLAGS);  in xbitmap32_set()
458 	struct xbitmap32_node	*bn;  in xbitmap32_destroy()
493 	struct xbitmap32_node	*bn;  in xbitmap32_disunion()
514 	struct xbitmap32_node	*bn;  in xbitmap32_hweight()
530 	struct xbitmap32_node	*bn;  in xbitmap32_walk()
557 	struct xbitmap32_node	*bn;  in xbitmap32_test()
577 	struct xbitmap32_node	*bn;  in xbitmap32_count_set_regions()