| /linux/include/linux/ |
| H A D | rbtree.h | 138 bool leftmost) in rb_insert_color_cached() argument
140 if (leftmost) in rb_insert_color_cached()
149 struct rb_node *leftmost = NULL; in rb_erase_cached() local
152 leftmost = root->rb_leftmost = rb_next(node); in rb_erase_cached()
156 return leftmost; in rb_erase_cached()
185 * rb_add_cached() - insert @node into the leftmost cached tree @tree
187 * @tree: leftmost cached tree to insert @node into
190 * Returns @node when it is the new leftmost, or NULL.
198 bool leftmost = true; in rb_add_cached() local
206 leftmost = false; in rb_add_cached()
[all …]
|
| H A D | timerqueue.h | 25 struct rb_node *leftmost = rb_first_cached(&head->rb_root); in timerqueue_getnext() local
27 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
|
| 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()
|
| H A D | rbtree_types.h | 17 * Leftmost-cached rbtrees.
|
| /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 | 268 bool leftmost = true; in srcline__tree_insert() local
286 leftmost = false; in srcline__tree_insert()
290 rb_insert_color_cached(&node->rb_node, tree, leftmost); in srcline__tree_insert()
361 bool leftmost = true; in inlines__tree_insert() local
370 leftmost = false; in inlines__tree_insert()
374 rb_insert_color_cached(&inlines->rb_node, tree, leftmost); in inlines__tree_insert()
|
| H A D | hist.c | 690 bool leftmost = true; in hists__findnew_entry() local
739 leftmost = false; in hists__findnew_entry()
752 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); in hists__findnew_entry()
1634 bool leftmost = true; in hierarchy_insert_entry() local
1650 leftmost = false; in hierarchy_insert_entry()
1690 rb_insert_color_cached(&new->rb_node_in, root, leftmost); in hierarchy_insert_entry()
1754 bool leftmost = true; in hists__collapse_insert_entry() local
1792 leftmost = false; in hists__collapse_insert_entry()
1798 rb_insert_color_cached(&he->rb_node_in, root, leftmost); in hists__collapse_insert_entry()
1937 bool leftmost = true; in hierarchy_insert_output_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/fs/f2fs/ |
| H A D | extent_cache.c | 223 bool *leftmost) in __lookup_extent_node_ret() argument
240 *leftmost = true; in __lookup_extent_node_ret()
250 *leftmost = false; in __lookup_extent_node_ret()
293 bool leftmost) in __attach_extent_node() argument
307 rb_insert_color_cached(&en->rb_node, &et->root, leftmost); in __attach_extent_node()
581 bool leftmost) in __insert_extent_tree() argument
594 leftmost = true; in __insert_extent_tree()
605 leftmost = false; in __insert_extent_tree()
618 en = __attach_extent_node(sbi, et, ei, parent, p, leftmost); in __insert_extent_tree()
668 bool leftmost = false; in __update_extent_tree_range() local
[all …]
|
| /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/kernel/bpf/ |
| H A D | range_tree.c | 90 bool leftmost = true; in __range_size_insert()
98 leftmost = false; in __range_size_insert()
103 rb_insert_color_cached(&rn->rb_range_size, root, leftmost); in __range_size_insert()
91 bool leftmost = true; __range_size_insert() local
|
| /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/Documentation/core-api/ |
| H A 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/Documentation/process/debugging/ |
| H A D | gdb-kernel-debugging.rst | 137 (gdb) set $leftmost = $lx_per_cpu(hrtimer_bases).clock_base[0].active.rb_root.rb_leftmost
138 (gdb) p *$container_of($leftmost, "struct hrtimer", "node")
|
| /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_dtree.c | 1168 * the entire key must be retained for the next-to-leftmost in dtSplitUp()
1193 /* next to leftmost entry of in dtSplitUp()
2416 /* reset key of new leftmost entry of level (for consistency) */ in dtDeleteUp()
2843 * pn > 0: Real entries, pn=1 -> leftmost page in jfs_readdir()
3058 * function: get the leftmost page of the directory
3074 * descend leftmost path of the tree in dtReadFirst()
3084 * leftmost leaf page in dtReadFirst()
3087 /* return leftmost entry */ in dtReadFirst()
3097 * descend down to leftmost child page in dtReadFirst()
3108 /* get the leftmost entry */ in dtReadFirst()
[all …]
|
| 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 */
|