Home
last modified time | relevance | path

Searched refs:smallest (Results 1 - 25 of 25) sorted by relevance

/kernel/linux/linux-5.10/include/linux/
H A Dmin_heap.h38 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()
/kernel/linux/linux-6.6/include/linux/
H A Dmin_heap.h38 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()
/kernel/linux/linux-5.10/drivers/md/
H A Draid0.c69 struct md_rdev *smallest, *rdev1, *rdev2, *rdev, **dev; in create_strip_zones() local
161 smallest = NULL; in create_strip_zones()
198 if (!smallest || (rdev1->sectors < smallest->sectors)) in create_strip_zones()
199 smallest = rdev1; in create_strip_zones()
208 zone->zone_end = smallest->sectors * cnt; in create_strip_zones()
221 zone->dev_start = smallest->sectors; in create_strip_zones()
222 smallest = NULL; in create_strip_zones()
239 if (!smallest || rdev->sectors < smallest in create_strip_zones()
[all...]
/kernel/linux/linux-6.6/drivers/md/
H A Draid0.c67 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 in create_strip_zones()
[all...]
/kernel/linux/linux-5.10/arch/m68k/fpsp040/
H A Dutil.S475 | ;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 Dscale.S206 | 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
/kernel/linux/linux-6.6/arch/m68k/fpsp040/
H A Dutil.S475 | ;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 Dscale.S206 | 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
/kernel/linux/linux-5.10/lib/lz4/
H A Dlz4_compress.c864 const BYTE *smallest = (const BYTE *) source; in LZ4_compress_fast_continue() local
871 if ((streamPtr->dictSize > 0) && (smallest > dictEnd)) in LZ4_compress_fast_continue()
872 smallest = dictEnd; in LZ4_compress_fast_continue()
874 LZ4_renormDictT(streamPtr, smallest); in LZ4_compress_fast_continue()
/kernel/linux/linux-6.6/lib/lz4/
H A Dlz4_compress.c864 const BYTE *smallest = (const BYTE *) source; in LZ4_compress_fast_continue() local
871 if ((streamPtr->dictSize > 0) && (smallest > dictEnd)) in LZ4_compress_fast_continue()
872 smallest = dictEnd; in LZ4_compress_fast_continue()
874 LZ4_renormDictT(streamPtr, smallest); in LZ4_compress_fast_continue()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c2092 int smallest; in xfs_attr3_leaf_remove() local
2116 * find smallest free region in case we need to replace it, in xfs_attr3_leaf_remove()
2123 smallest = XFS_ATTR_LEAF_MAPSIZE - 1; in xfs_attr3_leaf_remove()
2141 smallest = i; in xfs_attr3_leaf_remove()
2147 * or replace the smallest region. in xfs_attr3_leaf_remove()
2163 * Replace smallest region (if it is smaller than free'd entry) in xfs_attr3_leaf_remove()
2165 if (ichdr.freemap[smallest].size < entsize) { in xfs_attr3_leaf_remove()
2166 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); in xfs_attr3_leaf_remove()
2167 ichdr.freemap[smallest].size = entsize; in xfs_attr3_leaf_remove()
2175 smallest in xfs_attr3_leaf_remove()
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c2138 int smallest; in xfs_attr3_leaf_remove() local
2162 * find smallest free region in case we need to replace it, in xfs_attr3_leaf_remove()
2169 smallest = XFS_ATTR_LEAF_MAPSIZE - 1; in xfs_attr3_leaf_remove()
2187 smallest = i; in xfs_attr3_leaf_remove()
2193 * or replace the smallest region. in xfs_attr3_leaf_remove()
2209 * Replace smallest region (if it is smaller than free'd entry) in xfs_attr3_leaf_remove()
2211 if (ichdr.freemap[smallest].size < entsize) { in xfs_attr3_leaf_remove()
2212 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx); in xfs_attr3_leaf_remove()
2213 ichdr.freemap[smallest].size = entsize; in xfs_attr3_leaf_remove()
2221 smallest in xfs_attr3_leaf_remove()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/sun/
H A Dsunvnet_common.c1785 int smallest = 0; in sunvnet_port_add_txq_common() local
1794 smallest = i; in sunvnet_port_add_txq_common()
1797 if (vp->q_used[i] < vp->q_used[smallest]) in sunvnet_port_add_txq_common()
1798 smallest = i; in sunvnet_port_add_txq_common()
1802 vp->q_used[smallest]++; in sunvnet_port_add_txq_common()
1803 port->q_index = smallest; in sunvnet_port_add_txq_common()
/kernel/linux/linux-6.6/drivers/net/ethernet/sun/
H A Dsunvnet_common.c1786 int smallest = 0; in sunvnet_port_add_txq_common() local
1795 smallest = i; in sunvnet_port_add_txq_common()
1798 if (vp->q_used[i] < vp->q_used[smallest]) in sunvnet_port_add_txq_common()
1799 smallest = i; in sunvnet_port_add_txq_common()
1803 vp->q_used[smallest]++; in sunvnet_port_add_txq_common()
1804 port->q_index = smallest; in sunvnet_port_add_txq_common()
/kernel/linux/linux-6.6/drivers/infiniband/hw/mlx5/
H A Dmr.c718 struct mlx5_cache_ent *cur, *smallest = NULL; in mkey_cache_ent_from_rb_key() local
722 * Find the smallest ent with order >= requested_order. in mkey_cache_ent_from_rb_key()
728 smallest = cur; in mkey_cache_ent_from_rb_key()
737 return (smallest && in mkey_cache_ent_from_rb_key()
738 smallest->rb_key.access_mode == rb_key.access_mode && in mkey_cache_ent_from_rb_key()
739 smallest->rb_key.access_flags == rb_key.access_flags && in mkey_cache_ent_from_rb_key()
740 smallest->rb_key.ats == rb_key.ats) ? in mkey_cache_ent_from_rb_key()
741 smallest : in mkey_cache_ent_from_rb_key()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dtree-mod-log.c476 bool smallest) in __tree_mod_log_search()
494 } else if (!smallest) { in __tree_mod_log_search()
501 /* We want the node with the smallest seq */ in __tree_mod_log_search()
517 * This returns the element from the log with the smallest time sequence
474 __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, bool smallest) __tree_mod_log_search() argument
/kernel/linux/linux-5.10/drivers/net/wireless/broadcom/b43legacy/
H A Dphy.c1332 u32 smallest; in b43legacy_phy_lo_g_measure_txctl2() local
1337 smallest = b43legacy_phy_lo_g_singledeviation(dev, 0); in b43legacy_phy_lo_g_measure_txctl2()
1342 if (tmp < smallest) { in b43legacy_phy_lo_g_measure_txctl2()
1343 smallest = tmp; in b43legacy_phy_lo_g_measure_txctl2()
/kernel/linux/linux-6.6/drivers/net/wireless/broadcom/b43legacy/
H A Dphy.c1332 u32 smallest; in b43legacy_phy_lo_g_measure_txctl2() local
1337 smallest = b43legacy_phy_lo_g_singledeviation(dev, 0); in b43legacy_phy_lo_g_measure_txctl2()
1342 if (tmp < smallest) { in b43legacy_phy_lo_g_measure_txctl2()
1343 smallest = tmp; in b43legacy_phy_lo_g_measure_txctl2()
/kernel/linux/linux-5.10/arch/x86/boot/
H A Dheader.S480 # has been achieved. The smallest block type encoding is always used.
/kernel/linux/linux-6.6/arch/x86/boot/
H A Dheader.S422 # has been achieved. The smallest block type encoding is always used.
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.c647 int smallest) in __tree_mod_log_search()
665 } else if (!smallest) { in __tree_mod_log_search()
672 /* we want the node with the smallest seq */ in __tree_mod_log_search()
688 * this returns the element from the log with the smallest time sequence
646 __tree_mod_log_search(struct btrfs_fs_info *fs_info, u64 start, u64 min_seq, int smallest) __tree_mod_log_search() argument
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/
H A Dfpsp.S962 # multiply operation is the smallest possible normalized number
995 # multiply operation is the smallest possible normalized number
1023 # multiply operation is the smallest possible normalized number
8496 mov.l (%a0),%d3 # D3 is exponent of smallest norm. #
14839 # result is equal to the smallest normalized number in the selected precision
14859 # ok, so now the result has a exponent equal to the smallest normalized
15292 # result is equal to the smallest normalized number in the selected precision
15312 # ok, so now the result has a exponent equal to the smallest normalized
15861 # plus two, then set the smallest exponent to a very small value as a #
20258 ori.l &0x00800000,%d1 # make smallest sg
[all...]
H A Dpfpsp.S961 # multiply operation is the smallest possible normalized number
994 # multiply operation is the smallest possible normalized number
1022 # multiply operation is the smallest possible normalized number
5407 # plus two, then set the smallest exponent to a very small value as a #
7159 ori.l &0x00800000,%d1 # make smallest sgl
7205 ori.l &0x00800000,%d1 # make smallest sgl
7252 ori.l &0x00800000,%d1 # make smallest sgl
11270 # result is equal to the smallest normalized number in the selected precision
11290 # ok, so now the result has a exponent equal to the smallest normalized
11723 # result is equal to the smallest normalize
[all...]
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/
H A Dfpsp.S962 # multiply operation is the smallest possible normalized number
995 # multiply operation is the smallest possible normalized number
1023 # multiply operation is the smallest possible normalized number
8496 mov.l (%a0),%d3 # D3 is exponent of smallest norm. #
14839 # result is equal to the smallest normalized number in the selected precision
14859 # ok, so now the result has a exponent equal to the smallest normalized
15292 # result is equal to the smallest normalized number in the selected precision
15312 # ok, so now the result has a exponent equal to the smallest normalized
15861 # plus two, then set the smallest exponent to a very small value as a #
20258 ori.l &0x00800000,%d1 # make smallest sg
[all...]
H A Dpfpsp.S961 # multiply operation is the smallest possible normalized number
994 # multiply operation is the smallest possible normalized number
1022 # multiply operation is the smallest possible normalized number
5407 # plus two, then set the smallest exponent to a very small value as a #
7159 ori.l &0x00800000,%d1 # make smallest sgl
7205 ori.l &0x00800000,%d1 # make smallest sgl
7252 ori.l &0x00800000,%d1 # make smallest sgl
11270 # result is equal to the smallest normalized number in the selected precision
11290 # ok, so now the result has a exponent equal to the smallest normalized
11723 # result is equal to the smallest normalize
[all...]

Completed in 101 milliseconds