| /linux/drivers/md/ |
| H A D | raid0.c | 67 struct md_rdev *smallest, *rdev1, *rdev2, *rdev, **dev; in create_strip_zones() local
157 smallest = NULL; in create_strip_zones()
194 if (!smallest || (rdev1->sectors < smallest->sectors)) in create_strip_zones()
195 smallest = rdev1; in create_strip_zones()
204 zone->zone_end = smallest->sectors * cnt; in create_strip_zones()
217 zone->dev_start = smallest->sectors; in create_strip_zones()
218 smallest = NULL; in create_strip_zones()
235 if (!smallest || rdev->sectors < smallest->sectors) { in create_strip_zones()
236 smallest = rdev; in create_strip_zones()
237 pr_debug("md/raid0:%s: (%llu) is smallest!.\n", in create_strip_zones()
[all …]
|
| /linux/arch/m68k/fpsp040/ |
| H A D | util.S | 475 | ;smallest +ext denorm
477 | ;smallest +sgl denorm
479 | ;smallest +dbl denorm
533 leal EXT_PSML,%a1 |answer is negative smallest denorm
548 leal EXT_PSML,%a1 |answer is positive smallest denorm
565 leal DBL_PSML,%a1 |answer is smallest denormalized negative
580 leal DBL_PSML,%a1 |answer is smallest denormalized negative
597 leal SGL_PSML,%a1 |answer is smallest denormalized negative
612 leal SGL_PSML,%a1 |answer is smallest denormalized positive
|
| H A D | scale.S | 206 | mode is rp, and the zero is positive, return smallest denorm.
207 | If the mode is rm, and the zero is negative, return smallest
231 | The rounding mode changed the zero to a smallest denorm. Call
269 bras sm_dnrm |return smallest denorm
277 bra sm_dnrm |return smallest denorm
|
| /linux/drivers/iio/imu/inv_icm42600/ |
| H A D | inv_icm42600_buffer.c | 189 * latency, use the smallest setting between the 2. It means choosing the
190 * smallest latency but this is not as simple as choosing the smallest watermark
192 * 1) compute gyro and accel latencies and choose the smallest value.
199 * dividing this computed latency by the smallest period, which corresponds
235 /* compute the smallest latency that is a multiple of both */ in inv_icm42600_buffer_update_watermark()
|
| /linux/drivers/input/mouse/ |
| H A D | byd.c | 147 * 0 - 7 : smallest to largest width
152 * 0 - 9 : smallest to largest height
157 * 1 - 6 : smallest to largest
162 * 0 - 7 : smallest to largest width
167 * 0 - 9 : smallest to largest height
|
| /linux/scripts/dtc/libfdt/ |
| H A D | libfdt_env.h | 80 * smallest.
83 * Output: length of the string or max_count (the smallest of the two)
|
| /linux/drivers/net/wireless/intel/iwlwifi/mvm/tests/ |
| H A D | scan.c | 19 .desc = "Smallest possible value, all filled",
37 .desc = "Smallest possible value, partial filled",
|
| /linux/lib/zlib_deflate/ |
| H A D | deftree.c | 288 #define SMALLEST 1 macro
293 * Remove the smallest element from the heap and recreate the heap with
298 top = s->heap[SMALLEST]; \
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
300 pqdownheap(s, tree, SMALLEST); \
313 * exchanging a node with the smallest of its two sons if necessary, stopping
326 /* Set j to the smallest of the two sons: */ in pqdownheap()
334 /* Exchange v with the smallest son */ in pqdownheap()
497 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. in build_tree()
536 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
[all …]
|
| /linux/fs/jffs2/ |
| H A D | Kconfig | 176 Tries all compressors and chooses the one which has the smallest
182 Tries all compressors and chooses the one which has the smallest
|
| /linux/arch/x86/math-emu/ |
| H A D | fpu_emu.h | 31 #define EXP_OVER Const(0x4000) /* smallest invalid large exponent */
33 #define EXP_WAY_UNDER Const(-0x6000) /* Below the smallest denormal, but
39 #define EXTENDED_Emin (-0x3ffe) /* smallest valid exponent */
|
| /linux/drivers/net/ethernet/intel/ixgbe/ |
| H A D | ixgbe_dcb.c | 13 * are the smallest unit programmable into the underlying
83 /* Find smallest link percentage */ in ixgbe_dcb_calculate_tc_credits()
99 * larger than the max frame size so here we find the smallest in ixgbe_dcb_calculate_tc_credits()
|
| /linux/Documentation/admin-guide/media/ |
| H A D | si470x.rst | 39 - Si4708: Smallest FM receivers
40 - Si4709: Smallest FM receivers, RDS Support
|
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_priolist_types.h | 27 /* Smallest priority value that cannot be bumped. */
|
| /linux/Documentation/userspace-api/ |
| H A D | ELF.rst | 10 "First" program header is the one with the smallest offset in the file:
|
| /linux/arch/mips/include/asm/mach-loongson2ef/ |
| H A D | pci.h | 25 /* the smallest LOONGSON_CPU_MEM_SRC can be 512M */
|
| /linux/include/asm-generic/ |
| H A D | getorder.h | 24 * The order returned is used to find the smallest allocation granule required
|
| /linux/include/uapi/linux/ |
| H A D | aspeed-lpc-ctrl.h | 40 * size: The size of the mapping. The smallest possible size is 64K.
|
| /linux/lib/math/ |
| H A D | rational-test.c | 19 { 1, 19, 100, 10, 1, 10, "Closest to smallest non-zero" },
|
| /linux/drivers/scsi/megaraid/ |
| H A D | megaraid_mm.h | 34 // The smallest dma pool
|
| /linux/arch/arm/kernel/ |
| H A D | head-inflate-data.c | 27 * We mimic the code in lib/decompress_inflate.c to use the smallest work
|
| /linux/tools/testing/selftests/net/packetdrill/ |
| H A D | tcp_zerocopy_small.pkt | 5 // packets of all sizes, including the smallest payload, 1B.
|
| /linux/include/linux/ |
| H A D | dqblk_qtree.h | 11 /* Numbers of blocks needed for updates - we count with the smallest
|
| /linux/include/drm/ |
| H A D | drm_mm.h | 65 * smallest hole to reuse, the lowest or highest address to reuse, or simply
74 * Search for the smallest hole (within the search range) that fits
139 * Only check the lowest hole (the hole with the smallest address) and
|
| /linux/arch/sh/kernel/ |
| H A D | head_32.S | 111 * The uncached mapping is constructed using the smallest possible
215 * smallest for constructing the cached mapping.
|
| /linux/net/netlabel/ |
| H A D | netlabel_addrlist.c | 159 * address mask such that the entry with the widest mask (smallest in netlbl_af4list_add()
197 * address mask such that the entry with the widest mask (smallest in netlbl_af6list_add()
|