| /kernel/linux/linux-6.6/include/linux/ |
| H A D | rbtree.h | 110 bool leftmost) in rb_insert_color_cached()
112 if (leftmost) in rb_insert_color_cached()
121 struct rb_node *leftmost = NULL; in rb_erase_cached() local
124 leftmost = root->rb_leftmost = rb_next(node); in rb_erase_cached()
128 return leftmost; in rb_erase_cached()
157 * rb_add_cached() - insert @node into the leftmost cached tree @tree
159 * @tree: leftmost cached tree to insert @node into
162 * Returns @node when it is the new leftmost, or NULL.
170 bool leftmost = true; in rb_add_cached() local
178 leftmost in rb_add_cached()
108 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
[all...] |
| H A D | interval_tree_generic.h | 44 bool leftmost = true; \
55 leftmost = false; \
62 leftmost, &ITPREFIX ## _augment); \
94 * Iterate to find the leftmost such node N. \
106 return node; /* node is leftmost match */ \
122 ITSTRUCT *node, *leftmost; \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
145 if (ITSTART(leftmost) > last) \
|
| H A D | timerqueue.h | 36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext() local
38 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
|
| H A D | rbtree_augmented.h | 70 bool leftmost = true; in rb_add_augmented_cached() local
78 leftmost = false; in rb_add_augmented_cached()
84 rb_insert_augmented_cached(node, tree, leftmost, augment); in rb_add_augmented_cached()
86 return leftmost ? node : NULL; in rb_add_augmented_cached()
276 * Case 3: node's successor is leftmost under in __rb_erase_augmented()
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | rblist.c | 17 bool leftmost = true; in rblist__add_node() local
29 leftmost = false; in rblist__add_node()
40 rb_insert_color_cached(new_node, &rblist->entries, leftmost); in rblist__add_node()
59 bool leftmost = true; in __rblist__findnew() local
71 leftmost = false; in __rblist__findnew()
82 &rblist->entries, leftmost); in __rblist__findnew()
|
| H A D | hist.c | 590 bool leftmost = true; in hists__findnew_entry() local
639 leftmost = false; in hists__findnew_entry()
652 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1452 bool leftmost = true; in hierarchy_insert_entry() local
1474 leftmost = false; in hierarchy_insert_entry()
1509 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1568 bool leftmost = true; in hists__collapse_insert_entry() local
1601 leftmost = false; in hists__collapse_insert_entry()
1607 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1754 bool leftmost in hierarchy_insert_output_entry() local
1841 bool leftmost = true; __hists__insert_output_entry() local
2165 bool leftmost = true; resort_filtered_entry() local
2331 bool leftmost = true; hists__add_dummy_entry() local
2380 bool leftmost = true; add_dummy_hierarchy_entry() local
[all...] |
| H A D | srcline.c | 619 bool leftmost = true; in srcline__tree_insert() local
637 leftmost = false; in srcline__tree_insert()
641 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
712 bool leftmost = true; in inlines__tree_insert() local
721 leftmost = false; in inlines__tree_insert()
725 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | interval_tree_generic.h | 44 bool leftmost = true; \
55 leftmost = false; \
62 leftmost, &ITPREFIX ## _augment); \
94 * Iterate to find the leftmost such node N. \
106 return node; /* node is leftmost match */ \
122 ITSTRUCT *node, *leftmost; \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
145 if (ITSTART(leftmost) > last) \
|
| H A D | timerqueue.h | 36 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext() local
38 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
|
| H A D | rbtree.h | 137 bool leftmost) in rb_insert_color_cached()
139 if (leftmost) in rb_insert_color_cached()
135 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| H A D | rblist.c | 17 bool leftmost = true; in rblist__add_node() local
29 leftmost = false; in rblist__add_node()
40 rb_insert_color_cached(new_node, &rblist->entries, leftmost); in rblist__add_node()
59 bool leftmost = true; in __rblist__findnew() local
71 leftmost = false; in __rblist__findnew()
82 &rblist->entries, leftmost); in __rblist__findnew()
|
| H A D | hist.c | 601 bool leftmost = true; in hists__findnew_entry() local
651 leftmost = false; in hists__findnew_entry()
664 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1485 bool leftmost = true; in hierarchy_insert_entry() local
1507 leftmost = false; in hierarchy_insert_entry()
1542 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1606 bool leftmost = true; in hists__collapse_insert_entry() local
1643 leftmost = false; in hists__collapse_insert_entry()
1649 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1796 bool leftmost in hierarchy_insert_output_entry() local
1883 bool leftmost = true; __hists__insert_output_entry() local
2207 bool leftmost = true; resort_filtered_entry() local
2383 bool leftmost = true; hists__add_dummy_entry() local
2432 bool leftmost = true; add_dummy_hierarchy_entry() local
[all...] |
| H A D | srcline.c | 922 bool leftmost = true; in srcline__tree_insert() local
940 leftmost = false; in srcline__tree_insert()
944 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
1015 bool leftmost = true; in inlines__tree_insert() local
1024 leftmost = false; in inlines__tree_insert()
1028 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
|
| /kernel/linux/linux-6.6/tools/include/linux/ |
| H A D | interval_tree_generic.h | 44 bool leftmost = true; \
55 leftmost = false; \
62 leftmost, &ITPREFIX ## _augment); \
94 * Iterate to find the leftmost such node N. \
106 return node; /* node is leftmost match */ \
122 ITSTRUCT *node, *leftmost; \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
145 if (ITSTART(leftmost) > last) \
|
| H A D | rbtree.h | 131 bool leftmost) in rb_insert_color_cached()
133 if (leftmost) in rb_insert_color_cached()
172 * rb_add_cached() - insert @node into the leftmost cached tree @tree
174 * @tree: leftmost cached tree to insert @node into
183 bool leftmost = true; in rb_add_cached() local
191 leftmost = false; in rb_add_cached()
196 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
292 * Returns the leftmost node matching @key, or NULL.
129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
|
| /kernel/linux/linux-5.10/lib/ |
| H A D | timerqueue.c | 32 bool leftmost = true; in timerqueue_add() local
44 leftmost = false; in timerqueue_add()
48 rb_insert_color_cached(&node->node, &head->rb_root, leftmost); in timerqueue_add()
50 return leftmost; in timerqueue_add()
|
| H A D | rbtree_test.c | 53 bool leftmost = true; in insert_cached() local
61 leftmost = false; in insert_cached()
66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
116 bool leftmost = true; in insert_augmented_cached() local
127 leftmost = false; in insert_augmented_cached()
134 leftmost, &augment_callbacks); in insert_augmented_cached()
|
| /kernel/linux/linux-5.10/fs/f2fs/ |
| H A D | extent_cache.c | 64 unsigned long long key, bool *leftmost) in f2fs_lookup_rb_tree_ext()
77 *leftmost = false; in f2fs_lookup_rb_tree_ext()
87 unsigned int ofs, bool *leftmost) in f2fs_lookup_rb_tree_for_insert()
100 *leftmost = false; in f2fs_lookup_rb_tree_for_insert()
125 bool force, bool *leftmost) in f2fs_lookup_rb_tree_ret()
144 if (leftmost) in f2fs_lookup_rb_tree_ret()
145 *leftmost = true; in f2fs_lookup_rb_tree_ret()
155 if (leftmost) in f2fs_lookup_rb_tree_ret()
156 *leftmost = false; in f2fs_lookup_rb_tree_ret()
238 bool leftmost) in __attach_extent_node()
61 f2fs_lookup_rb_tree_ext(struct f2fs_sb_info *sbi, struct rb_root_cached *root, struct rb_node **parent, unsigned long long key, bool *leftmost) f2fs_lookup_rb_tree_ext() argument
84 f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi, struct rb_root_cached *root, struct rb_node **parent, unsigned int ofs, bool *leftmost) f2fs_lookup_rb_tree_for_insert() argument
118 f2fs_lookup_rb_tree_ret(struct rb_root_cached *root, struct rb_entry *cached_re, unsigned int ofs, struct rb_entry **prev_entry, struct rb_entry **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent, bool force, bool *leftmost) f2fs_lookup_rb_tree_ret() argument
235 __attach_extent_node(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node *parent, struct rb_node **p, bool leftmost) __attach_extent_node() argument
495 __insert_extent_tree(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node **insert_p, struct rb_node *insert_parent, bool leftmost) __insert_extent_tree() argument
542 bool leftmost = false; f2fs_update_extent_tree_range() local
[all...] |
| /kernel/linux/linux-6.6/kernel/locking/ |
| H A D | rtmutex_common.h | 118 * leftmost entry which might be about to vanish.
123 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_waiter_is_top_waiter() local
125 return rb_entry(leftmost, struct rt_mutex_waiter, tree.entry) == waiter; in rt_mutex_waiter_is_top_waiter()
130 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter() local
135 if (leftmost) { in rt_mutex_top_waiter()
136 w = rb_entry(leftmost, struct rt_mutex_waiter, tree.entry); in rt_mutex_top_waiter()
|
| /kernel/linux/linux-5.10/kernel/locking/ |
| H A D | rtmutex_common.h | 55 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter() local
58 if (leftmost) { in rt_mutex_top_waiter()
59 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
|
| H A D | rtmutex.c | 276 bool leftmost = true; in rt_mutex_enqueue() local
285 leftmost = false; in rt_mutex_enqueue()
290 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()
309 bool leftmost = true; in rt_mutex_enqueue_pi() local
318 leftmost = false; in rt_mutex_enqueue_pi()
323 rb_insert_color_cached(&waiter->pi_tree_entry, &task->pi_waiters, leftmost); in rt_mutex_enqueue_pi()
|
| /kernel/linux/linux-6.6/fs/f2fs/ |
| H A D | extent_cache.c | 201 bool *leftmost) in __lookup_extent_node_ret()
218 *leftmost = true; in __lookup_extent_node_ret()
228 *leftmost = false; in __lookup_extent_node_ret()
271 bool leftmost) in __attach_extent_node()
285 rb_insert_color_cached(&en->rb_node, &et->root, leftmost); in __attach_extent_node()
548 bool leftmost) in __insert_extent_tree()
561 leftmost = true; in __insert_extent_tree()
572 leftmost = false; in __insert_extent_tree()
579 en = __attach_extent_node(sbi, et, ei, parent, p, leftmost); in __insert_extent_tree()
605 bool leftmost in __update_extent_tree_range() local
194 __lookup_extent_node_ret(struct rb_root_cached *root, struct extent_node *cached_en, unsigned int fofs, struct extent_node **prev_entry, struct extent_node **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent, bool *leftmost) __lookup_extent_node_ret() argument
268 __attach_extent_node(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node *parent, struct rb_node **p, bool leftmost) __attach_extent_node() argument
544 __insert_extent_tree(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node **insert_p, struct rb_node *insert_parent, bool leftmost) __insert_extent_tree() argument
766 bool leftmost = false; f2fs_update_read_extent_tree_range_compressed() local
[all...] |
| /kernel/linux/linux-6.6/lib/ |
| H A D | rbtree_test.c | 53 bool leftmost = true; in insert_cached() local
61 leftmost = false; in insert_cached()
66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
116 bool leftmost = true; in insert_augmented_cached() local
127 leftmost = false; in insert_augmented_cached()
134 leftmost, &augment_callbacks); in insert_augmented_cached()
|
| /kernel/linux/linux-5.10/tools/include/linux/ |
| H A D | rbtree.h | 131 bool leftmost) in rb_insert_color_cached()
133 if (leftmost) in rb_insert_color_cached()
129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | delayed-ref.c | 296 bool leftmost = true; in htree_insert() local
309 leftmost = false; in htree_insert()
316 rb_insert_color_cached(node, root, leftmost); in htree_insert()
327 bool leftmost = true; in tree_insert() local
340 leftmost = false; in tree_insert()
347 rb_insert_color_cached(node, root, leftmost); in tree_insert()
|