/Linux-v5.15/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 | 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()
|
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
|
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-v5.15/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
|
/Linux-v5.15/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
|
D | memset.S | 11 andi $r2, $r2, 3 ! How many bytes are less than a word 12 beqz $p1, byte_set ! When n is less than a word 25 byte_set: ! Less than 4 bytes left to set
|
/Linux-v5.15/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()
|
/Linux-v5.15/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()
|
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()
|
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-v5.15/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.
|
/Linux-v5.15/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
|
/Linux-v5.15/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…
|
/Linux-v5.15/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…
|
/Linux-v5.15/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()
|
/Linux-v5.15/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
|
/Linux-v5.15/drivers/net/wireless/ti/wl18xx/ |
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-v5.15/arch/csky/abiv2/ |
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. */
|
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. */
|
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. */
|
/Linux-v5.15/Documentation/devicetree/bindings/devfreq/ |
D | rk3399_dmc.txt | 65 When DDR frequency is less than DRAM_DLL_DISB_FREQ, 70 MHz (Mega Hz). When DDR frequency is less than 76 when the DDR frequency is less then ddr3_odt_dis_freq, 102 When DDR frequency is less then ddr3_odt_dis_freq, 128 MHz (Mega Hz). When the DDR frequency is less then
|
/Linux-v5.15/Documentation/networking/ |
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,
|