| /linux/include/linux/ |
| H A 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
77 * init_llist_node - initialize lock-less list node
130 * llist_for_each - iterate over some deleted entries of a lock-less list
134 * In general, some entries of the lock-less list can be traversed
138 * If being used on entries deleted from lock-less list directly, the
147 * llist_for_each_safe - iterate over some deleted entries of a lock-less list
153 * In general, some entries of the lock-less list can be traversed
157 * If being used on entries deleted from lock-less list directly, the
[all …]
|
| H A 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()
|
| H A D | prime_numbers.h | 17 * @max should be less than ULONG_MAX to ensure termination. To begin with
32 * @max should be less than ULONG_MAX, and @from less than @max, to ensure
|
| H A D | dtlk.h | 32 indicates that less than 300 free
37 indicates that less than 300 bytes
56 data buffer has less than 30 bytes
|
| /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(&groot, &n->node, less); in __add_three()
66 bpf_rbtree_add(&groot, &m->node, less); in __add_three()
75 bpf_rbtree_add(&groot, &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()
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()
|
| 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()
|
| /linux/Documentation/devicetree/bindings/sound/ |
| H A 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
|
| /linux/lib/ |
| H A 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
69 * llist_del_first_this - delete given entry of lock-less list if it is first
70 * @head: the head for your lock-less list
|
| /linux/tools/include/linux/ |
| H A 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()
|
| /linux/drivers/gpu/drm/i915/display/ |
| H A 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 …]
|
| /linux/fs/squashfs/ |
| H A 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()
|
| H A D | id.c | 90 * of the compressed id blocks. Each entry should be less than in squashfs_read_id_index_table()
92 * should be SQUASHFS_METADATA_SIZE or less. table[indexes - 1] in squashfs_read_id_index_table()
93 * should be less than id_table_start, and again the difference in squashfs_read_id_index_table()
94 * should be SQUASHFS_METADATA_SIZE or less in squashfs_read_id_index_table()
|
| H A D | export.c | 146 * less than the next (i.e. table[0] < table[1]), and the difference in squashfs_read_inode_lookup_table()
147 * between them should be SQUASHFS_METADATA_SIZE or less. in squashfs_read_inode_lookup_table()
148 * table[indexes - 1] should be less than lookup_table_start, and in squashfs_read_inode_lookup_table()
149 * again the difference should be SQUASHFS_METADATA_SIZE or less in squashfs_read_inode_lookup_table()
|
| /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.
|
| /linux/tools/lib/subcmd/ |
| H A 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()
|
| /linux/arch/csky/abiv2/ |
| H A D | memset.S | 10 /* Test if len less than 4 bytes. */
29 /* Test if len less than 16 bytes. */
52 /* Test if len less than 4 bytes. */
|
| H A D | memcpy.S | 9 /* Test if len less than 4 bytes. */
24 /* Test if len less than 16 bytes. */
67 /* Test if len less than 4 bytes. */
|
| H A D | memmove.S | 18 /* Test if len less than 4 bytes. */
29 /* Test if len less than 16 bytes. */
71 /* Test if len less than 4 bytes. */
|
| /linux/drivers/net/wireless/ti/wl18xx/ |
| H A D | wl18xx.h | 78 /* Should have less than this number of packets in queue of a slow
83 /* Should have less than this number of packets in queue of a fast
88 /* Should have less than this number of packets in queue of a slow
93 /* Should have less than this number of packets in queue of a fast
|
| /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/arch/arm/nwfpe/ |
| H A D | fpa11_cprt.c | 221 /* test for less than condition */ in PerformComparison()
247 /* test for less than condition */ in PerformComparison()
268 /* test for less than condition */ in PerformComparison()
294 /* test for less than condition */ in PerformComparison()
324 /* test for less than condition */ in PerformComparison()
|
| /linux/scripts/ |
| H A D | xz_wrap.sh | 138 # should hurt less than guessing too high.
152 # (and uses less RAM) than multithreaded mode.
156 # needs less than 1400 MiB of RAM in single-threaded mode.
|
| /linux/drivers/gpu/drm/kmb/ |
| H A D | kmb_crtc.c | 197 drm_dbg(dev, "height = %d less than %d", in kmb_crtc_mode_valid()
202 drm_dbg(dev, "width = %d less than %d", in kmb_crtc_mode_valid()
208 drm_dbg(dev, "refresh = %d less than %d or greater than %d", in kmb_crtc_mode_valid()
214 drm_dbg(dev, "vfp = %d less than %d", vfp, KMB_CRTC_MIN_VFP); in kmb_crtc_mode_valid()
|
| /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
161 estimation step. This less forceful approach limits the impacts on the
|