Searched refs:tree_entry (Results 1 – 5 of 5) sorted by relevance
| /linux-4.4.14/kernel/locking/ |
| D | rtmutex.c | 189 entry = rb_entry(parent, struct rt_mutex_waiter, tree_entry); in rt_mutex_enqueue()
199 lock->waiters_leftmost = &waiter->tree_entry; in rt_mutex_enqueue()
201 rb_link_node(&waiter->tree_entry, parent, link); in rt_mutex_enqueue()
202 rb_insert_color(&waiter->tree_entry, &lock->waiters); in rt_mutex_enqueue()
208 if (RB_EMPTY_NODE(&waiter->tree_entry)) in rt_mutex_dequeue()
211 if (lock->waiters_leftmost == &waiter->tree_entry) in rt_mutex_dequeue()
212 lock->waiters_leftmost = rb_next(&waiter->tree_entry); in rt_mutex_dequeue()
214 rb_erase(&waiter->tree_entry, &lock->waiters); in rt_mutex_dequeue()
215 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_dequeue()
1179 RB_CLEAR_NODE(&waiter.tree_entry); in rt_mutex_slowlock()
|
| D | rtmutex_common.h | 26 struct rb_node tree_entry; member
52 tree_entry); in rt_mutex_top_waiter()
|
| /linux-4.4.14/fs/btrfs/ |
| D | extent_io.c | 113 struct tree_entry { struct
265 struct tree_entry *entry; in tree_insert()
276 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
302 struct tree_entry *entry; in __etree_search()
303 struct tree_entry *prev_entry = NULL; in __etree_search()
307 entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
327 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
334 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
337 prev_entry = rb_entry(prev, struct tree_entry, rb_node); in __etree_search()
|
| D | relocation.c | 38 struct tree_entry { struct
294 struct tree_entry *entry; in tree_insert()
298 entry = rb_entry(parent, struct tree_entry, rb_node); in tree_insert()
316 struct tree_entry *entry; in tree_search()
319 entry = rb_entry(n, struct tree_entry, rb_node); in tree_search()
|
| /linux-4.4.14/kernel/ |
| D | futex.c | 2721 RB_CLEAR_NODE(&rt_waiter.tree_entry); in futex_wait_requeue_pi()
|