Home
last modified time | relevance | path

Searched refs:rb_entry (Results 1 – 7 of 7) sorted by relevance

/include/linux/
Dinterval_tree_generic.h48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \
89 ITSTRUCT *left = rb_entry(node->ITRB.rb_left, \
108 node = rb_entry(node->ITRB.rb_right, \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
165 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
177 node = rb_entry(rb, ITSTRUCT, ITRB); \
Drbtree_augmented.h80 RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD); \
89 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
90 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
96 RBSTRUCT *old = rb_entry(rb_old, RBSTRUCT, RBFIELD); \
97 RBSTRUCT *new = rb_entry(rb_new, RBSTRUCT, RBFIELD); \
127 child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD); \
132 child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD); \
Dtimerqueue.h38 return rb_entry(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
Drbtree.h38 #define rb_entry(ptr, type, member) container_of(ptr, type, member) macro
89 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
Delevator.h164 #define rb_entry_rq(node) rb_entry((node), struct request, rb_node)
Dperf_event.h674 struct list_head rb_entry; member
/include/linux/ceph/
Dlibceph.h199 type *cur = rb_entry(*n, type, nodefld); \
233 type *cur = rb_entry(n, type, nodefld); \