Searched refs:tree_entry (Results 1 – 4 of 4) sorted by relevance
| /Linux-v5.4/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 | 282 entry = rb_entry(parent, struct rt_mutex_waiter, tree_entry); in rt_mutex_enqueue()
291 rb_link_node(&waiter->tree_entry, parent, link); in rt_mutex_enqueue()
292 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()
298 if (RB_EMPTY_NODE(&waiter->tree_entry)) in rt_mutex_dequeue()
301 rb_erase_cached(&waiter->tree_entry, &lock->waiters); in rt_mutex_dequeue()
302 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_dequeue()
1152 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_init_waiter()
|
| /Linux-v5.4/fs/btrfs/ |
| D | extent_io.c | 112 struct tree_entry { struct
335 struct tree_entry *entry; in tree_insert()
346 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
390 struct tree_entry *entry; in __etree_search()
391 struct tree_entry *prev_entry = NULL; in __etree_search()
395 entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
415 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
422 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
425 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
|
| D | relocation.c | 29 struct tree_entry { struct
287 struct tree_entry *entry; in tree_insert()
291 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
309 struct tree_entry *entry; in tree_search()
312 entry = rb_entry(n, struct tree_entry, rb_node); in tree_search()
|
