include/linux/rbtree.h

243

rb_entry((_n), struct rb_node_linked, node)

include/linux/rbtree.h

251

struct rb_node_linked *nnew = __node_2_linked_node(node);

include/linux/rbtree.h

252

struct rb_node_linked *npar = __node_2_linked_node(parent);

include/linux/rbtree.h

278

rb_add_linked(struct rb_node_linked *node, struct rb_root_linked *tree,

include/linux/rbtree.h

46

extern bool rb_erase_linked(struct rb_node_linked *, struct rb_root_linked *);

include/linux/rbtree_types.h

14

struct rb_node_linked *prev;

include/linux/rbtree_types.h

15

struct rb_node_linked *next;

include/linux/rbtree_types.h

43

struct rb_node_linked *rb_leftmost;

include/linux/timerqueue_types.h

18

struct rb_node_linked node;

lib/rbtree.c

449

bool rb_erase_linked(struct rb_node_linked *node, struct rb_root_linked *root)

lib/timerqueue.c

87

container_of(rb_entry((_n), struct rb_node_linked, node), struct timerqueue_linked_node, node)