| /linux/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 | srcline.c | 362 bool leftmost = true;
380 leftmost = false; in srcline__tree_insert()
384 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
455 bool leftmost = true; in inlines__tree_insert()
464 leftmost = false; in inlines__tree_insert()
468 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
368 bool leftmost = true; srcline__tree_insert() local
461 bool leftmost = true; inlines__tree_insert() local
|
| H A D | hist.c | 693 bool leftmost = true; in hists__findnew_entry()
742 leftmost = false; in hists__findnew_entry()
755 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1637 bool leftmost = true; in hierarchy_insert_entry()
1653 leftmost = false; in hierarchy_insert_entry()
1693 rb_insert_color_cached(&new->rb_node_in, root, leftmost);
1757 bool leftmost = true; in hists__collapse_insert_entry()
1795 leftmost = false; in hists__collapse_insert_entry()
1801 rb_insert_color_cached(&he->rb_node_in, root, leftmost);
1940 bool leftmost in hierarchy_insert_output_entry()
690 bool leftmost = true; hists__findnew_entry() local
1634 bool leftmost = true; hierarchy_insert_entry() local
1754 bool leftmost = true; hists__collapse_insert_entry() local
1937 bool leftmost = true; hierarchy_insert_output_entry() local
2024 bool leftmost = true; __hists__insert_output_entry() local
2358 bool leftmost = true; resort_filtered_entry() local
2549 bool leftmost = true; hists__add_dummy_entry() local
2597 bool leftmost = true; add_dummy_hierarchy_entry() local
[all...] |
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 110 * Leftmost-cached rbtrees.
131 bool leftmost) in rb_insert_color_cached() argument
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.
|
| /linux/lib/crc/s390/ |
| H A D | crc32le-vx.c | 166 * to move R4 into the rightmost doubleword and set the leftmost in crc32_le_vgfm_generic()
174 * of V1 is multiplied with R4. The leftmost doubleword of V1 is in crc32_le_vgfm_generic()
176 * Implicitly, the intermediate leftmost product becomes padded in crc32_le_vgfm_generic()
188 * half is loaded in the leftmost doubleword. in crc32_le_vgfm_generic()
190 * rightmost doubleword and the leftmost doubleword is zero to ignore in crc32_le_vgfm_generic()
191 * the leftmost product of V1. in crc32_le_vgfm_generic()
212 * Note: The leftmost doubleword of vector register containing in crc32_le_vgfm_generic()
|
| H A D | crc32be-vx.c | 86 /* Load the initial CRC value into the leftmost word of V0. */ in crc32_be_vgfm_16()
138 * intermediate result is then XORed with the product of the leftmost in crc32_be_vgfm_16()
157 * instruction to move the leftmost word into the leftmost doubleword in crc32_be_vgfm_16()
|
| /linux/lib/ |
| H A D | rbtree_test.c | 54 bool leftmost = true; in insert_cached() local
62 leftmost = false; in insert_cached()
67 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
117 bool leftmost = true; in insert_augmented_cached() local
128 leftmost = false; in insert_augmented_cached()
135 leftmost, &augment_callbacks); in insert_augmented_cached()
|
| /linux/include/linux/ |
| 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()
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | pixfmt-intro.rst | 30 leftmost pixel of the topmost row. Following that is the pixel
35 leftmost pixel of the second row from the top, and so on. The last row
|
| H A D | pixfmt-v4l2-mplane.rst | 44 - Distance in bytes between the leftmost pixels in two adjacent
|
| /linux/rust/syn/ |
| H A D | fixup.rs | 83 // If we have `m! {} - 1` as an expression, the leftmost subexpression
216 /// leftmost subexpression of the current expression.
218 /// The leftmost subexpression is any subexpression that has the same first
222 /// leftmost subexpression.
224 /// Not every expression has a leftmost subexpression. For example neither
259 /// leftmost subexpression followed by a `.` or `?` token, which confer
260 /// different statement boundary rules compared to other leftmost
|
| /linux/Documentation/translations/zh_TW/dev-tools/ |
| H A D | gdb-kernel-debugging.rst | 126 (gdb) set $leftmost = $lx_per_cpu(hrtimer_bases).clock_base[0].active.rb_root.rb_leftmost
127 (gdb) p *$container_of($leftmost, "struct hrtimer", "node")
|
| /linux/Documentation/translations/zh_CN/dev-tools/ |
| H A D | gdb-kernel-debugging.rst | 130 (gdb) set $leftmost = $lx_per_cpu(hrtimer_bases).clock_base[0].active.rb_root.rb_leftmost
131 (gdb) p *$container_of($leftmost, "struct hrtimer", "node")
|
| /linux/fs/ceph/ |
| H A D | subvolume_metrics.c | 81 bool leftmost = true; in __insert_entry() local
92 leftmost = false; in __insert_entry()
98 rb_insert_color_cached(&entry->node, &tracker->tree, leftmost); in __insert_entry()
|
| /linux/net/sched/ |
| H A 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/tools/lib/bpf/ |
| H A D | btf_relocate.c | 97 /* Binary search with a small twist; find leftmost element that matches
100 * leftmost "bb".
117 /* even if found, keep searching for leftmost match */ in search_btf_name_size()
|
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 281 * Iterate to find the leftmost such node N.
293 return node; /* node is leftmost match */
|
| /linux/fs/jfs/ |
| H A D | jfs_types.h | 48 * The leftmost 24 bits of len_addr are the extent length.
|
| H A D | jfs_btree.h | 34 #define BT_LEFTMOST 0x20 /* leftmost page */
|
| /linux/Documentation/bpf/ |
| H A D | map_lpm_trie.rst | 105 from leftmost leaf first. This means that iteration will return more
|
| /linux/Documentation/RCU/Design/Memory-Ordering/ |
| H A D | Tree-RCU-Memory-Ordering.rst | 360 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``
|
| /linux/kernel/sched/ |
| H A D | deadline.c | 583 struct rb_node *leftmost; in enqueue_pushable_dl_task() local
587 leftmost = rb_add_cached(&p->pushable_dl_tasks, in enqueue_pushable_dl_task()
590 if (leftmost) in enqueue_pushable_dl_task()
603 struct rb_node *leftmost; in dequeue_pushable_dl_task() local
608 leftmost = rb_erase_cached(&p->pushable_dl_tasks, root); in dequeue_pushable_dl_task()
609 if (leftmost) in dequeue_pushable_dl_task()
610 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()
2052 struct rb_node *leftmost = rb_first_cached(&dl_rq->root); in dec_dl_deadline() local
2053 struct sched_dl_entity *entry = __node_2_dle(leftmost); in dec_dl_deadline()
2669 * not being the leftmost task anymore. In that case NEED_RESCHED will in task_tick_dl()
|
| /linux/arch/s390/include/uapi/asm/ |
| H A D | pkey.h | 423 * set. The wkvp value is 32 bytes but only the leftmost 16 bytes are compared
424 * against the leftmost 16 byte of the wkvp of the apqn.
|
| /linux/arch/s390/include/asm/ |
| H A D | bitops.h | 128 * __flogr - find leftmost one
|
| /linux/net/tipc/ |
| H A D | name_table.c | 125 * Return: the leftmost service range node in the rbtree that overlaps the
141 /* A leftmost overlap range node must be one in the left
150 * an overlap i.e. leftmost.
|