| /Linux-v5.10/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 | 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 = true; in hierarchy_insert_output_entry() local
[all …]
|
| 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()
|
| D | symbol.c | 320 bool leftmost = true; in __symbols__insert() local
340 leftmost = false; in __symbols__insert()
344 rb_insert_color_cached(&sym->rb_node, symbols, leftmost); in __symbols__insert()
410 bool leftmost = true; in symbols__insert_by_name() local
421 leftmost = false; in symbols__insert_by_name()
425 rb_insert_color_cached(&symn->rb_node, symbols, leftmost); in symbols__insert_by_name()
|
| D | machine.c | 272 bool leftmost = true; in machines__add() local
289 leftmost = false; in machines__add()
294 rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost); in machines__add()
507 bool leftmost = true; in ____machine__findnew_thread() local
527 leftmost = false; in ____machine__findnew_thread()
537 rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost); in ____machine__findnew_thread()
|
| /Linux-v5.10/include/linux/ |
| 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(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
|
| D | rbtree.h | 137 bool leftmost) in rb_insert_color_cached() argument
139 if (leftmost) in rb_insert_color_cached()
|
| /Linux-v5.10/lib/ |
| 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()
|
| 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-v5.10/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-v5.10/kernel/locking/ |
| 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()
|
| 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()
|
| /Linux-v5.10/tools/include/linux/ |
| D | rbtree.h | 131 bool leftmost) in rb_insert_color_cached() argument
133 if (leftmost) in rb_insert_color_cached()
|
| /Linux-v5.10/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-v5.10/drivers/gpu/drm/ |
| D | drm_mm.c | 173 bool leftmost; in drm_mm_interval_tree_add_node() local
190 leftmost = false; in drm_mm_interval_tree_add_node()
194 leftmost = true; in drm_mm_interval_tree_add_node()
206 leftmost = false; in drm_mm_interval_tree_add_node()
211 rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost, in drm_mm_interval_tree_add_node()
|
| /Linux-v5.10/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-v5.10/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-v5.10/fs/btrfs/ |
| D | delayed-ref.c | 285 bool leftmost = true; in htree_insert() local
298 leftmost = false; in htree_insert()
305 rb_insert_color_cached(node, root, leftmost); in htree_insert()
316 bool leftmost = true; in tree_insert() local
329 leftmost = false; in tree_insert()
336 rb_insert_color_cached(node, root, leftmost); in tree_insert()
|
| D | extent_map.c | 101 bool leftmost = true; in tree_insert() local
111 leftmost = false; in tree_insert()
137 rb_insert_color_cached(&em->rb_node, root, leftmost); in tree_insert()
|
| /Linux-v5.10/kernel/sched/ |
| D | deadline.c | 514 bool leftmost = true; in enqueue_pushable_dl_task() local
526 leftmost = false; in enqueue_pushable_dl_task()
530 if (leftmost) in enqueue_pushable_dl_task()
535 &dl_rq->pushable_dl_tasks_root, leftmost); in enqueue_pushable_dl_task()
1418 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline() local
1421 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()
1468 int leftmost = 1; in __enqueue_dl_entity() local
1479 leftmost = 0; in __enqueue_dl_entity()
1484 rb_insert_color_cached(&dl_se->rb_node, &dl_rq->root, leftmost); in __enqueue_dl_entity()
|
| /Linux-v5.10/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-v5.10/fs/ |
| D | eventpoll.c | 1336 bool leftmost = true; in ep_rbtree_insert() local
1344 leftmost = false; in ep_rbtree_insert()
1349 rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost); in ep_rbtree_insert()
|
| /Linux-v5.10/Documentation/RCU/Design/Memory-Ordering/ |
| D | Tree-RCU-Memory-Ordering.rst | 336 The diagram below shows the path of ordering if the leftmost
339 leftmost ``rcu_node`` structure offlines its last CPU and if the next
523 | The leftmost drive to root stopped before it reached the root |
600 running on a CPU corresponding to the leftmost leaf ``rcu_node``
|
