prio_tree.h:static inline void prio_tree_iter_init(struct prio_tree_iter
*iter,
prio_tree.h:static inline int prio_tree_empty(const struct
prio_tree_root *root)
prio_tree.h:static inline int prio_tree_root(const struct prio_tree_node
*node)
prio_tree.h:static inline int prio_tree_left_empty(const struct
prio_tree_node *node)
prio_tree.h:static inline int prio_tree_right_empty(const struct
prio_tree_node *node)
radix-tree.h:static inline void *radix_tree_ptr_to_indirect(void *ptr)
radix-tree.h:static inline void *radix_tree_indirect_to_ptr(void *ptr)
radix-tree.h:static inline int radix_tree_is_indirect_ptr(void *ptr)
radix-tree.h:static inline void *radix_tree_deref_slot(void **pslot)
radix-tree.h:static inline void radix_tree_replace_slot(void **pslot,
void *item)
radix-tree.h:static inline void radix_tree_preload_end(void)
rbtree.h:static inline struct page * rb_search_page_cache(struct inode *
inode,
rbtree.h:static inline struct page * __rb_insert_page_cache(struct inode
* inode,
rbtree.h:static inline struct page * rb_insert_page_cache(struct inode *
inode,
rbtree.h:static inline void rb_set_parent(struct rb_node *rb, struct
rb_node *p)
rbtree.h:static inline void rb_set_color(struct rb_node *rb, int color)
rbtree.h:static inline void rb_link_node(struct rb_node * node, struct
rb_node * parent,
