Home
last modified time | relevance | path

Searched refs:tree_entry (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/kernel/kernel/locking/
H A Drtmutex_common.h28 struct rb_node tree_entry; member
59 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
H A Drtmutex.c281 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()
1151 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_init_waiter()
/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dextent_io.c128 struct tree_entry { struct
364 struct tree_entry *entry; in tree_insert()
375 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
419 struct tree_entry *entry; in __etree_search()
420 struct tree_entry *prev_entry = NULL; in __etree_search()
424 entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
444 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
451 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
454 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()