Home
last modified time | relevance | path

Searched refs:leftmost (Results 1 – 25 of 35) sorted by relevance

12

/linux/include/linux/
A Drbtree.h110 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()
A Dinterval_tree_generic.h44 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) \
A Dtimerqueue.h36 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()
/linux/tools/perf/util/
A Drblist.c17 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()
A Dhist.c593 bool leftmost = true; in hists__findnew_entry() local
642 leftmost = false; in hists__findnew_entry()
1458 bool leftmost = true; in hierarchy_insert_entry() local
1480 leftmost = false; in hierarchy_insert_entry()
1574 bool leftmost = true; in hists__collapse_insert_entry() local
1607 leftmost = false; in hists__collapse_insert_entry()
1770 leftmost = false; in hierarchy_insert_output_entry()
1870 leftmost = false; in __hists__insert_output_entry()
2181 leftmost = false; in resort_filtered_entry()
2364 leftmost = false; in hists__add_dummy_entry()
[all …]
A Dsrcline.c781 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()
A Dsymbol.c327 bool leftmost = true; in __symbols__insert() local
347 leftmost = false; in __symbols__insert()
351 rb_insert_color_cached(&sym->rb_node, symbols, leftmost); in __symbols__insert()
417 bool leftmost = true; in symbols__insert_by_name() local
428 leftmost = false; in symbols__insert_by_name()
432 rb_insert_color_cached(&symn->rb_node, symbols, leftmost); in symbols__insert_by_name()
A Dmachine.c272 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()
516 bool leftmost = true; in ____machine__findnew_thread() local
536 leftmost = false; in ____machine__findnew_thread()
546 rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost); in ____machine__findnew_thread()
/linux/fs/f2fs/
A Dextent_cache.c77 *leftmost = false; in f2fs_lookup_rb_tree_ext()
100 *leftmost = false; in f2fs_lookup_rb_tree_for_insert()
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
499 bool leftmost) in __insert_extent_tree() argument
511 leftmost = true; in __insert_extent_tree()
571 &leftmost); in f2fs_update_extent_tree_range()
[all …]
/linux/kernel/locking/
A Drtmutex_common.h106 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/tools/include/linux/
A Drbtree.h131 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/lib/
A Drbtree_test.c53 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/fs/btrfs/
A Ddelayed-ref.c289 bool leftmost = true; in htree_insert() local
302 leftmost = false; in htree_insert()
309 rb_insert_color_cached(node, root, leftmost); in htree_insert()
320 bool leftmost = true; in tree_insert() local
333 leftmost = false; in tree_insert()
340 rb_insert_color_cached(node, root, leftmost); in tree_insert()
A Dextent_map.c101 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()
A Ddelayed-inode.c408 bool leftmost = true; in __btrfs_add_delayed_item() local
427 leftmost = false; in __btrfs_add_delayed_item()
436 rb_insert_color_cached(node, root, leftmost); in __btrfs_add_delayed_item()
/linux/drivers/gpu/drm/
A Ddrm_mm.c170 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/Documentation/scheduler/
A Dsched-design-CFS.rst72 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/net/sched/
A Dsch_etf.c168 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/Documentation/userspace-api/media/v4l/
A Dpixfmt-intro.rst29 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
A Dpixfmt-v4l2-mplane.rst43 - Distance in bytes between the leftmost pixels in two adjacent
/linux/kernel/sched/
A Ddeadline.c534 struct rb_node *leftmost; in enqueue_pushable_dl_task() local
538 leftmost = rb_add_cached(&p->pushable_dl_tasks, in enqueue_pushable_dl_task()
541 if (leftmost) in enqueue_pushable_dl_task()
549 struct rb_node *leftmost; in dequeue_pushable_dl_task() local
554 leftmost = rb_erase_cached(&p->pushable_dl_tasks, root); in dequeue_pushable_dl_task()
555 if (leftmost) in dequeue_pushable_dl_task()
556 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()
1425 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline() local
1428 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()
/linux/Documentation/core-api/
A Drbtree.rst199 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/fs/
A Deventpoll.c1264 bool leftmost = true; in ep_rbtree_insert() local
1272 leftmost = false; in ep_rbtree_insert()
1277 rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost); in ep_rbtree_insert()
/linux/tools/perf/
A Dbuiltin-sched.c994 bool leftmost = true; in __thread_latency_insert() local
1009 leftmost = false; in __thread_latency_insert()
1014 rb_insert_color_cached(&data->node, root, leftmost); in __thread_latency_insert()
3118 bool leftmost = true; in __merge_work_atoms() local
3132 leftmost = false; in __merge_work_atoms()
3151 rb_insert_color_cached(&data->node, root, leftmost); in __merge_work_atoms()
/linux/Documentation/RCU/Design/Memory-Ordering/
A DTree-RCU-Memory-Ordering.rst360 The diagram below shows the path of ordering if the leftmost
363 leftmost ``rcu_node`` structure offlines its last CPU and if the next
547 | The leftmost drive to root stopped before it reached the root |
624 running on a CPU corresponding to the leftmost leaf ``rcu_node``

Completed in 78 milliseconds

12