| /linux/tools/testing/selftests/bpf/progs/ |
| H A D | rbtree.c | 36 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
65 bpf_rbtree_add(root, &n->node, less); in __add_three()
66 bpf_rbtree_add(root, &m->node, less); in __add_three()
75 bpf_rbtree_add(root, &n->node, less); in __add_three()
109 bpf_rbtree_add(&groot, &n->node, less); in rbtree_add_and_remove()
110 bpf_rbtree_add(&groot, &m->node, less); in rbtree_add_and_remove()
151 bpf_rbtree_add(&groot_array[i], &nodes[i][j]->node, less); in rbtree_add_and_remove_array()
153 bpf_rbtree_add(&groot_array_one[0], &nodes[2][j]->node, less); in rbtree_add_and_remove_array()
214 bpf_rbtree_add(&groot, &n->node, less); in rbtree_first_and_remove()
215 bpf_rbtree_add(&groot, &m->node, less); in rbtree_first_and_remove()
[all …]
|
| H A 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()
147 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_to_multiple_trees()
150 bpf_rbtree_add(&groot2, &n->node, less); in rbtree_api_add_to_multiple_trees()
172 bpf_rbtree_add(&groot, res, less); in rbtree_api_use_unchecked_remove_retval()
192 bpf_rbtree_add(&groot, &n->node, less); in rbtree_api_add_release_unlock_escape()
238 bpf_rbtree_add(&groot, &node_a->node, less); in less__bad_fn_call_add()
|
| H A 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()
90 bpf_rbtree_add(&groot, &n->node, less); in rbtree_refcounted_node_ref_escapes_owning_input()
111 bpf_rbtree_add(&groot, &n->node, less); in BPF_PROG()
|
| H A D | refcounted_kptr.c | 51 static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b) in less() function
88 if (bpf_rbtree_add(root, &n->r, less)) { in __insert_in_tree_and_list()
131 if (bpf_rbtree_add(root, &m->r, less)) { in __stash_map_insert_tree()
468 bpf_rbtree_add(&broot, &n->r, less); in rbtree_wrong_owner_remove_fail_b()
518 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
552 bpf_rbtree_add(&root, &n->r, less); in BPF_PROG()
|
| H A D | local_kptr_stash.c | 78 static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b) in less() function
176 bpf_rbtree_add(&res->r, &n->node, less); in stash_local_with_root()
|
| /linux/Documentation/core-api/ |
| H A D | min_heap.rst | 14 each node is less than or equal to the values of its children, ensuring that
72 bool (*less)(const void *lhs, const void *rhs, void *args);
76 - **less** is the comparison function used to establish the order of elements.
132 `less` and `swp` functions.
133 - **args**: Optional arguments passed to the `less` and `swp` functions.
149 `less` and `swp` functions.
150 - **args**: Optional arguments passed to the `less` and `swp` functions.
170 `less` and `swp` functions.
171 - **args**: Optional arguments passed to the `less` and `swp` functions.
186 `less` and `swp` functions.
[all …]
|
| /linux/include/linux/ |
| H A D | rbtree_latch.h | 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()
|
| H A D | rbtree.h | 194 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
202 if (less(node, parent)) { in rb_add_cached()
224 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
231 if (less(node, parent)) in rb_add()
|
| H A D | min_heap.h | 48 bool (*less)(const void *lhs, const void *rhs, void *args); member
273 b = func->less(data + c, data + d, args) ? c : d; in __min_heap_sift_down_inline()
280 while (b != a && func->less(data + a, data + b, args)) in __min_heap_sift_down_inline()
311 if (func->less(data + b, data + a, args)) in __min_heap_sift_up_inline()
|
| /linux/Documentation/ABI/testing/ |
| H A 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.
|
| H A D | sysfs-bus-iio-light-isl29018 | 14 The sign bit is extended for resolutions less than 16. While
16 is less affected by the ambient IR noise variation.
|
| /linux/lib/tests/ |
| H A D | min_heap_kunit.c | 72 .less = params->min_heap ? less_than : greater_than, in test_heapify_all()
102 .less = params->min_heap ? less_than : greater_than, in test_heap_push()
133 .less = params->min_heap ? less_than : greater_than, in test_heap_pop_push()
171 .less = params->min_heap ? less_than : greater_than, in test_heap_del()
|
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 179 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
187 if (less(node, parent)) { in rb_add_cached()
207 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
214 if (less(node, parent)) in rb_add()
|
| /linux/drivers/iio/temperature/ |
| H A 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
80 tristate "MLX90635 contact-less infrared sensor with medical accuracy"
85 MLX90635 contact-less infrared sensor with medical accuracy
|
| /linux/Documentation/hwmon/ |
| H A D | aspeed-g6-pwm-tach.rst | 24 The larger divisor, the less rpm accuracy and the less
|
| /linux/Documentation/translations/zh_CN/staging/ |
| H A D | speculation.rst | 38 B.LT less
41 less:
|
| /linux/crypto/ |
| H A D | algif_aead.c | 145 size_t less = outlen - usedpages; in _aead_recvmsg() local
147 if (used < less) { in _aead_recvmsg()
151 used -= less; in _aead_recvmsg()
152 outlen -= less; in _aead_recvmsg()
|
| /linux/Documentation/networking/ |
| H A D | plip.rst | 77 On these machines, the PLIP driver can be used in IRQ-less mode, where
79 and if such data is available, process it. This mode is less efficient than
82 indicate that there isn't a noticeable performance drop when using IRQ-less
89 data) is, by default, 500usec. As IRQ delivery is more or less immediate,
92 When in IRQ-less mode, the PLIP driver polls the parallel port HZ times
99 10^6/HZ usecs. If both sides of a PLIP connection are used in IRQ-less mode,
|
| /linux/net/tipc/ |
| H A D | core.h | 195 static inline int less(u16 left, u16 right) in less() function
202 return !less(val, min) && !more(val, max); in tipc_in_range()
|
| /linux/drivers/net/ethernet/toshiba/ |
| H A D | Kconfig | 37 If you have the wireless-less model of PS3 or have no plan to
40 safely enable this option even if you have a wireless-less model.
|
| /linux/Documentation/usb/ |
| H A D | ohci.rst | 20 - improved robustness; bugfixes; and less overhead
23 - less code, by using the upper level "hcd" framework
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | multigen_lru.rst | 79 ``N=3000`` make janks less noticeable at the risk of premature OOM
147 generations less than or equal to ``min_gen_nr``.
151 ``min_gen_nr`` should be less than ``max_gen_nr-1``, since
162 estimation step. This less forceful approach limits the impacts on the
|
| /linux/tools/build/tests/ex/empty2/ |
| H A D | README | 2 to test proper nesting into Build-less directories.
|
| /linux/drivers/media/rc/img-ir/ |
| H A D | Kconfig | 17 less reliable (due to lack of timestamps) and consumes more
26 signals in hardware. This is more reliable, consumes less processing
|
| /linux/Documentation/staging/ |
| H A D | speculation.rst | 35 B.LT less
38 less:
|