| /Linux-v5.4/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 | 575 bool leftmost = true; in hists__findnew_entry() local
624 leftmost = false; in hists__findnew_entry()
637 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1405 bool leftmost = true; in hierarchy_insert_entry() local
1427 leftmost = false; in hierarchy_insert_entry()
1462 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1521 bool leftmost = true; in hists__collapse_insert_entry() local
1554 leftmost = false; in hists__collapse_insert_entry()
1560 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1707 bool leftmost = true; in hierarchy_insert_output_entry() local
[all …]
|
| D | srcline.c | 605 bool leftmost = true; in srcline__tree_insert() local
623 leftmost = false; in srcline__tree_insert()
627 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
698 bool leftmost = true; in inlines__tree_insert() local
707 leftmost = false; in inlines__tree_insert()
711 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
|
| D | symbol.c | 324 bool leftmost = true; in __symbols__insert() local
344 leftmost = false; in __symbols__insert()
348 rb_insert_color_cached(&sym->rb_node, symbols, leftmost); in __symbols__insert()
414 bool leftmost = true; in symbols__insert_by_name() local
425 leftmost = false; in symbols__insert_by_name()
429 rb_insert_color_cached(&symn->rb_node, symbols, leftmost); in symbols__insert_by_name()
|
| D | machine.c | 266 bool leftmost = true; in machines__add() local
283 leftmost = false; in machines__add()
288 rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost); in machines__add()
501 bool leftmost = true; in ____machine__findnew_thread() local
521 leftmost = false; in ____machine__findnew_thread()
531 rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost); in ____machine__findnew_thread()
|
| /Linux-v5.4/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.4/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.4/fs/f2fs/ |
| D | extent_cache.c | 64 unsigned int ofs, bool *leftmost) in f2fs_lookup_rb_tree_for_insert() argument
77 *leftmost = false; in f2fs_lookup_rb_tree_for_insert()
102 bool force, bool *leftmost) in f2fs_lookup_rb_tree_ret() argument
121 if (leftmost) in f2fs_lookup_rb_tree_ret()
122 *leftmost = true; in f2fs_lookup_rb_tree_ret()
132 if (leftmost) in f2fs_lookup_rb_tree_ret()
133 *leftmost = false; in f2fs_lookup_rb_tree_ret()
205 bool leftmost) in __attach_extent_node() argument
218 rb_insert_color_cached(&en->rb_node, &et->root, leftmost); in __attach_extent_node()
465 bool leftmost) in __insert_extent_tree() argument
[all …]
|
| /Linux-v5.4/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 | 278 bool leftmost = true; in rt_mutex_enqueue() local
287 leftmost = false; in rt_mutex_enqueue()
292 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()
311 bool leftmost = true; in rt_mutex_enqueue_pi() local
320 leftmost = false; in rt_mutex_enqueue_pi()
325 rb_insert_color_cached(&waiter->pi_tree_entry, &task->pi_waiters, leftmost); in rt_mutex_enqueue_pi()
|
| /Linux-v5.4/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.4/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.4/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.4/net/sched/ |
| D | sch_etf.c | 167 bool leftmost = true; in etf_enqueue_timesortedlist() local
182 leftmost = false; in etf_enqueue_timesortedlist()
188 rb_insert_color_cached(&nskb->rbnode, &q->head, leftmost); in etf_enqueue_timesortedlist()
|
| /Linux-v5.4/fs/btrfs/ |
| D | delayed-ref.c | 286 bool leftmost = true; in htree_insert() local
299 leftmost = false; in htree_insert()
306 rb_insert_color_cached(node, root, leftmost); in htree_insert()
317 bool leftmost = true; in tree_insert() local
330 leftmost = false; in tree_insert()
337 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.4/Documentation/media/uapi/v4l/ |
| D | pixfmt-intro.rst | 36 leftmost pixel of the topmost row. Following that is the pixel
41 leftmost pixel of the second row from the top, and so on. The last row
|
| D | pixfmt-v4l2-mplane.rst | 50 - Distance in bytes between the leftmost pixels in two adjacent
|
| /Linux-v5.4/kernel/sched/ |
| D | deadline.c | 451 bool leftmost = true; in enqueue_pushable_dl_task() local
463 leftmost = false; in enqueue_pushable_dl_task()
467 if (leftmost) in enqueue_pushable_dl_task()
472 &dl_rq->pushable_dl_tasks_root, leftmost); in enqueue_pushable_dl_task()
1358 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline() local
1361 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()
1408 int leftmost = 1; in __enqueue_dl_entity() local
1419 leftmost = 0; in __enqueue_dl_entity()
1424 rb_insert_color_cached(&dl_se->rb_node, &dl_rq->root, leftmost); in __enqueue_dl_entity()
|
| /Linux-v5.4/Documentation/ |
| D | rbtree.txt | 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.4/fs/ |
| D | eventpoll.c | 1343 bool leftmost = true; in ep_rbtree_insert() local
1351 leftmost = false; in ep_rbtree_insert()
1356 rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost); in ep_rbtree_insert()
|
| /Linux-v5.4/tools/perf/ |
| D | builtin-sched.c | 990 bool leftmost = true; in __thread_latency_insert() local
1005 leftmost = false; in __thread_latency_insert()
1010 rb_insert_color_cached(&data->node, root, leftmost); in __thread_latency_insert()
3088 bool leftmost = true; in __merge_work_atoms() local
3102 leftmost = false; in __merge_work_atoms()
3120 rb_insert_color_cached(&data->node, root, leftmost); in __merge_work_atoms()
|
