Searched refs:tree_entry (Results 1 – 4 of 4) sorted by relevance
| /Linux-v4.19/kernel/locking/ |
| D | rtmutex_common.h | 28 struct rb_node tree_entry; member
59 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
|
| D | rtmutex.c | 281 entry = rb_entry(parent, struct rt_mutex_waiter, tree_entry); in rt_mutex_enqueue()
290 rb_link_node(&waiter->tree_entry, parent, link); in rt_mutex_enqueue()
291 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()
297 if (RB_EMPTY_NODE(&waiter->tree_entry)) in rt_mutex_dequeue()
300 rb_erase_cached(&waiter->tree_entry, &lock->waiters); in rt_mutex_dequeue()
301 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_dequeue()
1153 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_init_waiter()
|
| /Linux-v4.19/fs/btrfs/ |
| D | extent_io.c | 105 struct tree_entry { struct
247 struct tree_entry *entry; in tree_insert()
258 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
284 struct tree_entry *entry; in __etree_search()
285 struct tree_entry *prev_entry = NULL; in __etree_search()
289 entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
309 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
316 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
319 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
|
| D | relocation.c | 27 struct tree_entry { struct
283 struct tree_entry *entry; in tree_insert()
287 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
305 struct tree_entry *entry; in tree_search()
308 entry = rb_entry(n, struct tree_entry, rb_node); in tree_search()
|
