| /kernel/linux/linux-5.10/include/linux/ |
| D | llist.h | 5 * Lock-less NULL terminated single linked list
66 * init_llist_head - initialize lock-less list head
67 * @head: the head for your lock-less list
101 * llist_for_each - iterate over some deleted entries of a lock-less list
105 * In general, some entries of the lock-less list can be traversed
109 * If being used on entries deleted from lock-less list directly, the
118 * llist_for_each_safe - iterate over some deleted entries of a lock-less list
124 * In general, some entries of the lock-less list can be traversed
128 * If being used on entries deleted from lock-less list directly, the
137 * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
[all …]
|
| D | rbtree_latch.h | 51 * @less: used for insertion; provides the (partial) order between two elements.
56 * comp(a->key,b) < 0 := less(a,b)
57 * comp(a->key,b) > 0 := less(b,a)
58 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a)
65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b); member
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
89 if (less(ltn, ltp)) in __lt_insert()
149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()
151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
|
| D | min_heap.h | 24 * @less: Partial order function for this heap.
29 bool (*less)(const void *lhs, const void *rhs); member
48 if (func->less(left, smallest)) in min_heapify()
53 if (func->less(right, smallest)) in min_heapify()
128 if (func->less(parent, child)) in min_heap_push()
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | llist.h | 5 * Lock-less NULL terminated single linked list
68 * init_llist_head - initialize lock-less list head
69 * @head: the head for your lock-less list
103 * llist_for_each - iterate over some deleted entries of a lock-less list
107 * In general, some entries of the lock-less list can be traversed
111 * If being used on entries deleted from lock-less list directly, the
120 * llist_for_each_safe - iterate over some deleted entries of a lock-less list
126 * In general, some entries of the lock-less list can be traversed
130 * If being used on entries deleted from lock-less list directly, the
139 * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
[all …]
|
| D | rbtree_latch.h | 51 * @less: used for insertion; provides the (partial) order between two elements.
56 * comp(a->key,b) < 0 := less(a,b)
57 * comp(a->key,b) > 0 := less(b,a)
58 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a)
65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b); member
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
89 if (less(ltn, ltp)) in __lt_insert()
149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()
151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
|
| D | rbtree.h | 144 * comp(a->key,b) < 0 := less(a,b)
145 * comp(a->key,b) > 0 := less(b,a)
146 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a)
160 * @less: operator defining the (partial) node order
166 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
174 if (less(node, parent)) { in rb_add_cached()
192 * @less: operator defining the (partial) node order
196 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
203 if (less(node, parent)) in rb_add()
|
| D | min_heap.h | 24 * @less: Partial order function for this heap.
29 bool (*less)(const void *lhs, const void *rhs); member
48 if (func->less(left, smallest)) in min_heapify()
53 if (func->less(right, smallest)) in min_heapify()
128 if (func->less(parent, child)) in min_heap_push()
|
| /kernel/linux/linux-6.6/tools/testing/selftests/bpf/progs/ |
| D | rbtree.c | 24 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
53 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
54 bpf_rbtree_add(&groot, &m->node, less); in __add_three()
63 bpf_rbtree_add(&groot, &n->node, less); in __add_three()
91 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
92 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
137 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
138 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
139 bpf_rbtree_add(&groot, &o->node, less); in rbtree_first_and_remove()
193 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_release_aliasing()
|
| D | rbtree_fail.c | 20 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
41 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_add()
56 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_nolock_remove()
89 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_remove_unadded_node()
146 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_to_multiple_trees()
149 bpf_rbtree_add(&groot2, &n->node, less); in rbtree_api_add_to_multiple_trees()
171 bpf_rbtree_add(&groot, res, less); in rbtree_api_use_unchecked_remove_retval()
191 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_release_unlock_escape()
237 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
|
| D | refcounted_kptr_fail.c | 23 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
45 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes()
71 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
92 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/sound/ |
| D | wlf,arizona.yaml | 33 default. If present, values must be specified less than or equal
34 to the number of input signals. If values less than the number of
52 should be less than or equal to the number of outputs, if less values
67 of values should be less than or equal to the number of inputs,
82 be handled normally. If present, number of cells must be less than
83 or equal to the number of AIFs. If less than the number of AIFs, for
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/sound/ |
| D | wlf,arizona.yaml | 30 default. If present, values must be specified less than or equal
31 to the number of input signals. If values less than the number of
49 should be less than or equal to the number of outputs, if less values
64 of values should be less than or equal to the number of inputs,
79 be handled normally. If present, number of cells must be less than
80 or equal to the number of AIFs. If less than the number of AIFs, for
|
| /kernel/linux/linux-5.10/arch/nds32/lib/ |
| D | memmove.S | 29 andi $r2, $r2, #3 ! How many bytes are less than a word
31 beqz $p1, byte_cpy ! When n is less than a word
44 andi $r2, $r2, #3 ! How many bytes are less than a word
46 beqz $p1, reverse_byte_cpy ! When n is less than a word
58 byte_cpy: ! Less than 4 bytes to copy now
|
| /kernel/linux/linux-6.6/tools/include/linux/ |
| D | rbtree.h | 159 * comp(a->key,b) < 0 := less(a,b)
160 * comp(a->key,b) > 0 := less(b,a)
161 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a)
175 * @less: operator defining the (partial) node order
179 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
187 if (less(node, parent)) { in rb_add_cached()
203 * @less: operator defining the (partial) node order
207 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
214 if (less(node, parent)) in rb_add()
|
| /kernel/linux/linux-6.6/drivers/gpu/drm/i915/display/ |
| D | intel_tv_regs.h | 247 /* Offset of the start of vsync in field 1, measured in one less than the
253 * Offset of the start of vsync in field 2, measured in one less than the
265 /* Offset of the start of equalization in field 1, measured in one less than
271 * Offset of the start of equalization in field 2, measured in one less than
279 * Offset to start of vertical colorburst, measured in one less than the
285 * Offset to the end of vertical colorburst, measured in one less than the
293 * Offset to start of vertical colorburst, measured in one less than the
299 * Offset to the end of vertical colorburst, measured in one less than the
307 * Offset to start of vertical colorburst, measured in one less than the
313 * Offset to the end of vertical colorburst, measured in one less than the
[all …]
|
| /kernel/linux/linux-6.6/fs/squashfs/ |
| D | xattr_id.c | 100 * of the compressed xattr id blocks. Each entry should be less than in squashfs_read_xattr_id_table()
102 * should be SQUASHFS_METADATA_SIZE or less. table[indexes - 1] in squashfs_read_xattr_id_table()
103 * should be less than table_start, and again the difference in squashfs_read_xattr_id_table()
104 * shouls be SQUASHFS_METADATA_SIZE or less. in squashfs_read_xattr_id_table()
106 * Finally xattr_table_start should be less than table[0]. in squashfs_read_xattr_id_table()
|
| /kernel/linux/linux-5.10/fs/squashfs/ |
| D | xattr_id.c | 100 * of the compressed xattr id blocks. Each entry should be less than in squashfs_read_xattr_id_table()
102 * should be SQUASHFS_METADATA_SIZE or less. table[indexes - 1] in squashfs_read_xattr_id_table()
103 * should be less than table_start, and again the difference in squashfs_read_xattr_id_table()
104 * shouls be SQUASHFS_METADATA_SIZE or less. in squashfs_read_xattr_id_table()
106 * Finally xattr_table_start should be less than table[0]. in squashfs_read_xattr_id_table()
|
| /kernel/linux/linux-6.6/Documentation/ABI/testing/ |
| D | sysfs-bus-iio-light-si1133 | 5 Unit-less infrared intensity. The intensity is measured from 1
13 Unit-less infrared intensity. The intensity is measured from 4
21 Unit-less light intensity with more diodes.
|
| /kernel/linux/linux-5.10/Documentation/ABI/testing/ |
| D | sysfs-bus-iio-light-si1133 | 5 Unit-less infrared intensity. The intensity is measured from 1
13 Unit-less infrared intensity. The intensity is measured from 4
21 Unit-less light intensity with more diodes.
|
| /kernel/linux/linux-5.10/lib/ |
| D | llist.c | 3 * Lock-less NULL terminated single linked list
22 * @head: the head for your lock-less list
40 * llist_del_first - delete the first entry of lock-less list
41 * @head: the head for your lock-less list
|
| /kernel/linux/linux-6.6/lib/ |
| D | llist.c | 3 * Lock-less NULL terminated single linked list
22 * @head: the head for your lock-less list
40 * llist_del_first - delete the first entry of lock-less list
41 * @head: the head for your lock-less list
|
| /kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/jaketown/ |
| D | uncore-power.json | 10 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
20 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
30 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
40 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
50 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
61 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
72 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
83 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
|
| /kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/ivytown/ |
| D | uncore-power.json | 10 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
20 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
30 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
40 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
50 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
61 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
72 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
83 …). One can also use inversion (filter_inv=1) to track cycles when we were less than the configured…
|
| /kernel/linux/linux-5.10/tools/lib/subcmd/ |
| D | pager.c | 36 * Work around bug in "less" by not starting it until we in pager_preexec()
48 setenv("LESS", "FRSX", 0); in pager_preexec()
86 if (!(pager || access("/usr/bin/less", X_OK))) in setup_pager()
87 pager = "/usr/bin/less"; in setup_pager()
|
| /kernel/linux/linux-5.10/drivers/iio/temperature/ |
| D | Kconfig | 58 tristate "MLX90614 contact-less infrared sensor"
62 MLX90614 contact-less infrared sensor connected with I2C.
68 tristate "MLX90632 contact-less infrared sensor with medical accuracy"
73 MLX90632 contact-less infrared sensor with medical accuracy
|