| /openbmc/linux/include/linux/ |
| H A D | min_heap.h | 38 void *left, *right, *parent, *smallest; in min_heapify() local
47 smallest = parent; in min_heapify()
48 if (func->less(left, smallest)) in min_heapify()
49 smallest = left; in min_heapify()
53 if (func->less(right, smallest)) in min_heapify()
54 smallest = right; in min_heapify()
56 if (smallest == parent) in min_heapify()
58 func->swp(smallest, parent); in min_heapify()
59 if (smallest == left) in min_heapify()
|
| /openbmc/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 …]
|
| /openbmc/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
|
| /openbmc/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
230 /* compute the smallest latency that is a multiple of both */ in inv_icm42600_buffer_update_watermark()
|
| /openbmc/u-boot/doc/ |
| H A D | README.fuse | 13 A fuse word is the smallest group of fuses that can be read at once from the
16 A fuse bank is the smallest group of fuse words having a common ID, as defined
|
| H A D | README.ubi | 56 UBI: smallest flash I/O unit: 1
128 UBI: smallest flash I/O unit: 1
|
| /openbmc/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)
|
| /openbmc/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
|
| /openbmc/linux/fs/jffs2/ |
| H A D | Kconfig | 175 Tries all compressors and chooses the one which has the smallest
181 Tries all compressors and chooses the one which has the smallest
|
| /openbmc/openbmc/poky/meta/recipes-rt/rt-tests/files/ |
| H A D | rt_bmark.py | 33 # 3) The smallest value in that list is recorded.
36 # values in the original list. In this list the smallest value is
60 # Smallest value:
63 # 6) The generated list of smallest values is analyzed. In this case, it
340 # Track smallest max value
|
| /openbmc/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 …]
|
| /openbmc/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 */
|
| /openbmc/phosphor-host-ipmid/include/ipmid/ |
| H A D | iana.hpp | 7 using Number = std::uint32_t; // smallest standard size >= 24.
|
| /openbmc/qemu/target/m68k/ |
| H A D | cpu-param.h | 15 * use the smallest one
|
| /openbmc/u-boot/scripts/dtc/libfdt/ |
| H A D | libfdt_env.h | 123 * smallest.
126 * Output: length of the string or max_count (the smallest of the two)
|
| /openbmc/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()
|
| /openbmc/u-boot/fs/fat/ |
| H A D | Kconfig | 22 is the smallest amount of disk space that can be used to hold a
|
| /openbmc/qemu/tests/tcg/multiarch/libs/ |
| H A D | float_helpers.c | 104 0x1.004p+0, /* smallest float after 1.0 FP16 */
166 {1.0009765625}, /* smallest float after 1.0 FP16 */
|
| /openbmc/openbmc/poky/meta/recipes-core/udev/udev-extraconf/ |
| H A D | autonet.rules | 6 # %e the smallest number for that name which does not matches an existing node
|
| H A D | localextra.rules | 6 # %e the smallest number for that name which does not matches an existing node
|
| H A D | automount.rules | 6 # %e the smallest number for that name which does not matches an existing node
|
| /openbmc/openbmc/meta-openembedded/meta-perl/recipes-perl/libalgorithm/ |
| H A D | libalgorithm-diff-perl_1.15.bb | 6 program. It is guaranteed to find the *smallest possible* set of \
|
| /openbmc/openbmc/poky/meta/recipes-core/udev/eudev/ |
| H A D | local.rules | 6 # %e the smallest number for that name which does not matches an existing node
|
| /openbmc/openbmc/meta-openembedded/meta-oe/recipes-benchmark/glmark2/files/ |
| H A D | 0003-GLVisualConfig-By-default-don-t-care-about-the-stenc.patch | 58 * otherwise the smallest positive difference from target.
59 + * We also reward the smallest positive difference from the target,
|