| /linux-6.1.9/tools/perf/util/ |
| 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()
|
| D | hist.c | 598 bool leftmost = true; in hists__findnew_entry() local
647 leftmost = false; in hists__findnew_entry()
660 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1463 bool leftmost = true; in hierarchy_insert_entry() local
1485 leftmost = false; in hierarchy_insert_entry()
1520 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1579 bool leftmost = true; in hists__collapse_insert_entry() local
1612 leftmost = false; in hists__collapse_insert_entry()
1618 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1765 bool leftmost = true; in hierarchy_insert_output_entry() local
[all …]
|
| D | srcline.c | 781 bool leftmost = true; in srcline__tree_insert() local
799 leftmost = false; in srcline__tree_insert()
803 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
874 bool leftmost = true; in inlines__tree_insert() local
883 leftmost = false; in inlines__tree_insert()
887 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
|
| D | symbol.c | 344 bool leftmost = true; in __symbols__insert() local
364 leftmost = false; in __symbols__insert()
368 rb_insert_color_cached(&sym->rb_node, symbols, leftmost); in __symbols__insert()
434 bool leftmost = true; in symbols__insert_by_name() local
445 leftmost = false; in symbols__insert_by_name()
449 rb_insert_color_cached(&symn->rb_node, symbols, leftmost); in symbols__insert_by_name()
|
| D | machine.c | 285 bool leftmost = true; in machines__add() local
302 leftmost = false; in machines__add()
307 rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost); in machines__add()
618 bool leftmost = true; in ____machine__findnew_thread() local
638 leftmost = false; in ____machine__findnew_thread()
648 rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost); in ____machine__findnew_thread()
|
| /linux-6.1.9/include/linux/ |
| D | rbtree.h | 110 bool leftmost) in rb_insert_color_cached() argument
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()
170 bool leftmost = true; in rb_add_cached() local
178 leftmost = false; in rb_add_cached()
183 rb_insert_color_cached(node, tree, leftmost); in rb_add_cached()
185 return leftmost ? node : NULL; in rb_add_cached()
|
| D | interval_tree_generic.h | 44 bool leftmost = true; \
55 leftmost = false; \
62 leftmost, &ITPREFIX ## _augment); \
122 ITSTRUCT *node, *leftmost; \
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
145 if (ITSTART(leftmost) > last) \
|
| 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()
|
| /linux-6.1.9/fs/f2fs/ |
| D | extent_cache.c | 64 unsigned long long key, bool *leftmost) in f2fs_lookup_rb_tree_ext() argument
77 *leftmost = false; in f2fs_lookup_rb_tree_ext()
87 unsigned int ofs, bool *leftmost) in f2fs_lookup_rb_tree_for_insert() argument
100 *leftmost = false; in f2fs_lookup_rb_tree_for_insert()
125 bool force, bool *leftmost) in f2fs_lookup_rb_tree_ret() argument
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() argument
[all …]
|
| /linux-6.1.9/kernel/locking/ |
| D | rtmutex_common.h | 106 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_waiter_is_top_waiter() local
108 return rb_entry(leftmost, struct rt_mutex_waiter, tree_entry) == waiter; in rt_mutex_waiter_is_top_waiter()
113 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter() local
116 if (leftmost) { in rt_mutex_top_waiter()
117 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
|
| /linux-6.1.9/tools/include/linux/ |
| D | rbtree.h | 131 bool leftmost) in rb_insert_color_cached() argument
133 if (leftmost) in rb_insert_color_cached()
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()
|
| /linux-6.1.9/lib/ |
| 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()
|
| /linux-6.1.9/fs/btrfs/ |
| D | delayed-ref.c | 310 bool leftmost = true; in htree_insert() local
323 leftmost = false; in htree_insert()
330 rb_insert_color_cached(node, root, leftmost); in htree_insert()
341 bool leftmost = true; in tree_insert() local
354 leftmost = false; in tree_insert()
361 rb_insert_color_cached(node, root, leftmost); in tree_insert()
|
| D | extent_map.c | 99 bool leftmost = true; in tree_insert() local
109 leftmost = false; in tree_insert()
135 rb_insert_color_cached(&em->rb_node, root, leftmost); in tree_insert()
|
| /linux-6.1.9/drivers/gpu/drm/ |
| D | drm_mm.c | 170 bool leftmost; in drm_mm_interval_tree_add_node() local
187 leftmost = false; in drm_mm_interval_tree_add_node()
191 leftmost = true; in drm_mm_interval_tree_add_node()
203 leftmost = false; in drm_mm_interval_tree_add_node()
208 rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost, in drm_mm_interval_tree_add_node()
|
| /linux-6.1.9/Documentation/scheduler/ |
| D | sched-design-CFS.rst | 72 p->se.vruntime key. CFS picks the "leftmost" task from this tree and sticks to it.
75 to become the "leftmost task" and thus get on the CPU within a deterministic
82 becomes the "leftmost task" of the time-ordered rbtree it maintains (plus a
83 small amount of "granularity" distance relative to the leftmost task so that we
84 do not over-schedule tasks and trash the cache), then the new leftmost task is
|
| /linux-6.1.9/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-intro.rst | 29 leftmost pixel of the topmost row. Following that is the pixel
34 leftmost pixel of the second row from the top, and so on. The last row
|
| D | pixfmt-v4l2-mplane.rst | 43 - Distance in bytes between the leftmost pixels in two adjacent
|
| /linux-6.1.9/net/sched/ |
| D | sch_etf.c | 168 bool leftmost = true; in etf_enqueue_timesortedlist() local
183 leftmost = false; in etf_enqueue_timesortedlist()
189 rb_insert_color_cached(&nskb->rbnode, &q->head, leftmost); in etf_enqueue_timesortedlist()
|
| /linux-6.1.9/kernel/sched/ |
| D | deadline.c | 608 struct rb_node *leftmost; in enqueue_pushable_dl_task() local
612 leftmost = rb_add_cached(&p->pushable_dl_tasks, in enqueue_pushable_dl_task()
615 if (leftmost) in enqueue_pushable_dl_task()
623 struct rb_node *leftmost; in dequeue_pushable_dl_task() local
628 leftmost = rb_erase_cached(&p->pushable_dl_tasks, root); in dequeue_pushable_dl_task()
629 if (leftmost) in dequeue_pushable_dl_task()
630 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()
1490 struct rb_node *leftmost = rb_first_cached(&dl_rq->root); in dec_dl_deadline() local
1491 struct sched_dl_entity *entry = __node_2_dle(leftmost); in dec_dl_deadline()
|
| /linux-6.1.9/Documentation/translations/zh_CN/core-api/ |
| D | rbtree.rst | 281 * Iterate to find the leftmost such node N.
293 return node; /* node is leftmost match */
|
| /linux-6.1.9/Documentation/core-api/ |
| D | rbtree.rst | 199 Computing the leftmost (smallest) node is quite a common task for binary
212 leftmost node. This allows rb_root_cached to exist wherever rb_root does,
319 * Iterate to find the leftmost such node N.
331 return node; /* node is leftmost match */
|
| /linux-6.1.9/fs/ |
| D | eventpoll.c | 1273 bool leftmost = true; in ep_rbtree_insert() local
1281 leftmost = false; in ep_rbtree_insert()
1286 rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost); in ep_rbtree_insert()
|
| /linux-6.1.9/tools/perf/ |
| D | builtin-sched.c | 1016 bool leftmost = true; in __thread_latency_insert() local
1031 leftmost = false; in __thread_latency_insert()
1036 rb_insert_color_cached(&data->node, root, leftmost); in __thread_latency_insert()
3147 bool leftmost = true; in __merge_work_atoms() local
3161 leftmost = false; in __merge_work_atoms()
3180 rb_insert_color_cached(&data->node, root, leftmost); in __merge_work_atoms()
|
| D | builtin-kwork.c | 287 bool leftmost = true; in work_insert() local
300 leftmost = false; in work_insert()
305 rb_insert_color_cached(&key->node, root, leftmost); in work_insert()
|