Home
last modified time | relevance | path

Searched refs:min (Results 1 – 25 of 53) sorted by relevance

123

/lib/zlib_inflate/
A Dinftrees.c28 unsigned min, max; /* minimum and maximum code lengths */ in zlib_inflate_table() local
112 for (min = 1; min < MAXBITS; min++) in zlib_inflate_table()
113 if (count[min] != 0) break; in zlib_inflate_table()
114 if (root < min) root = min; in zlib_inflate_table()
189 len = min; /* starting code length */ in zlib_inflate_table()
221 min = fill; /* save offset to next table */ in zlib_inflate_table()
252 next += min; /* here min is 1 << curr */ in zlib_inflate_table()
/lib/
A Dlinear_ranges.c72 return r->min + (r->max_sel - r->min_sel) * r->step; in linear_range_get_max_value()
93 *val = r->min + (selector - r->min_sel) * r->step; in linear_range_get_value()
144 if (r->min > val) in linear_range_get_selector_low()
157 *selector = (val - r->min) / r->step + r->min_sel; in linear_range_get_selector_low()
228 if (r->min > val) { in linear_range_get_selector_high()
238 *selector = DIV_ROUND_UP(val - r->min, r->step) + r->min_sel; in linear_range_get_selector_high()
258 if (r->min > val) { in linear_range_get_selector_within()
271 *selector = (val - r->min) / r->step + r->min_sel; in linear_range_get_selector_within()
A Dmaple_tree.c1108 min = mas->min; in mas_ascend()
1145 mas->min = min; in mas_ascend()
2258 mast->l->min = mast->orig_l->min; in mast_rebalance_prev()
2678 mast->l->min = mast->orig_l->min; in mast_cp_to_nodes()
2769 min = mas->min; in mtree_range_walk()
2953 mas->min = l_mas.min; in mas_spanning_rebalance()
4530 if (mas->min <= min) { in mas_prev_slot()
4663 mas->min = min; in mas_next_node()
4849 mas->min = min; in mas_rev_awalk()
4906 mas->min = min; in mas_anode_descend()
[all …]
A Didr.c384 unsigned bit = min % IDA_BITMAP_BITS; in ida_alloc_range()
388 if ((int)min < 0) in ida_alloc_range()
398 if (xas.xa_index > min / IDA_BITMAP_BITS) in ida_alloc_range()
455 xas.xa_index = min / IDA_BITMAP_BITS; in ida_alloc_range()
456 bit = min % IDA_BITMAP_BITS; in ida_alloc_range()
469 xas_set(&xas, min / IDA_BITMAP_BITS); in ida_alloc_range()
470 bit = min % IDA_BITMAP_BITS; in ida_alloc_range()
493 unsigned long index = min / IDA_BITMAP_BITS; in ida_find_first_range()
494 unsigned int offset = min % IDA_BITMAP_BITS; in ida_find_first_range()
501 if ((int)min < 0) in ida_find_first_range()
[all …]
A Dnlattr.c123 (pt->min < 0 || pt->max < 0)); in nla_get_range_unsigned()
125 range->min = 0; in nla_get_range_unsigned()
153 range->min = pt->min; in nla_get_range_unsigned()
160 range->min = pt->min; in nla_get_range_unsigned()
226 if (value < range.min || value > range.max) { in nla_validate_range_unsigned()
247 range->min = S8_MIN; in nla_get_range_signed()
251 range->min = S16_MIN; in nla_get_range_signed()
255 range->min = S32_MIN; in nla_get_range_signed()
260 range->min = S64_MIN; in nla_get_range_signed()
270 range->min = pt->min; in nla_get_range_signed()
[all …]
A Diov_iter.c93 size_t n = min(size, iov_iter_count(i)); in fault_in_iov_iter_readable()
97 size_t count = min(size, iov_iter_count(i)); in fault_in_iov_iter_readable()
103 size_t len = min(count, p->iov_len - skip); in fault_in_iov_iter_readable()
136 size_t n = min(size, iov_iter_count(i)); in fault_in_iov_iter_writeable()
140 size_t count = min(size, iov_iter_count(i)); in fault_in_iov_iter_writeable()
146 size_t len = min(count, p->iov_len - skip); in fault_in_iov_iter_writeable()
1248 size_t len = min(p->iov_len - skip, size); in iov_npages()
1268 size_t len = min(p->bv_len - skip, size); in bvec_npages()
1285 return min(npages, maxpages); in iov_iter_npages()
1295 return min(npages, maxpages); in iov_iter_npages()
[all …]
A Dkfifo.c103 l = min(len, size - off); in kfifo_copy_in()
142 l = min(len, size - off); in kfifo_copy_out()
204 l = min(len, size - off); in kfifo_copy_from_user()
264 l = min(len, size - off); in kfifo_copy_to_user()
342 len_to_end = min(len, size - off); in setup_sgl()
481 return min(n, __kfifo_peek_n(fifo, recsize)); in __kfifo_out_linear_r()
A Dtest_xarray.c600 XA_BUG_ON(xa, xa_load(xa, min) != xa_mk_index(min)); in check_multi_store_1()
605 xa_erase_index(xa, min); in check_multi_store_1()
1148 unsigned int min = 1 << i; in check_store_iter() local
1152 __check_store_iter(xa, min, i, 0); in check_store_iter()
1155 xa_store_index(xa, min, GFP_KERNEL); in check_store_iter()
1156 __check_store_iter(xa, min, i, 1); in check_store_iter()
1159 __check_store_iter(xa, min, i, 1); in check_store_iter()
1162 for (j = 0; j < min; j++) in check_store_iter()
1164 __check_store_iter(xa, 0, i, min); in check_store_iter()
1166 for (j = 0; j < min; j++) in check_store_iter()
[all …]
A Dfind_bit.c36 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(val)), sz); \
67 sz = min(idx * BITS_PER_LONG + __ffs(MUNGE(tmp)), sz); \
A Dseq_buf.c277 start_len = min(len, MAX_MEMHEX_BYTES);
415 linelen = min(remaining, rowsize);
A Dkstrtox.c404 count = min(count, sizeof(buf) - 1); in kstrtobool_from_user()
418 count = min(count, sizeof(buf) - 1); \
A Dobjagg.c228 unsigned int min, max; in objagg_obj_root_id_alloc() local
238 min = hnode->root_id; in objagg_obj_root_id_alloc()
244 min = objagg->hints->root_count; in objagg_obj_root_id_alloc()
248 root_id = ida_alloc_range(&objagg->root_ida, min, max, GFP_KERNEL); in objagg_obj_root_id_alloc()
A Dxarray.c1999 xas.xa_index = limit.min; in __xa_alloc()
2040 u32 min = limit.min; in __xa_alloc_cyclic() local
2043 limit.min = max(min, *next); in __xa_alloc_cyclic()
2050 if (ret < 0 && limit.min > min) { in __xa_alloc_cyclic()
2051 limit.min = min; in __xa_alloc_cyclic()
/lib/crypto/
A Daescfb.c49 crypto_xor_cpy(dst, src, ks, min(len, AES_BLOCK_SIZE)); in aescfb_encrypt()
86 crypto_xor_cpy(dst, src, ks[i], min(len, AES_BLOCK_SIZE)); in aescfb_decrypt()
A Daesgcm.c67 crypto_xor((u8 *)ghash, src, min(len, GHASH_BLOCK_SIZE)); in aesgcm_ghash()
123 crypto_xor_cpy(dst, src, buf, min(len, AES_BLOCK_SIZE)); in aesgcm_crypt()
/lib/zstd/common/
A Dzstd_internal.h50 #define BOUNDED(min,val,max) (MAX(min,MIN(val,max))) argument
/lib/crc/sparc/
A Dcrc32.h30 n = min(n, len); in crc32c_arch()
/lib/math/
A Drational.c88 t = min(t, (max_numerator - n0) / n1); in rational_best_approximation()
A Dreciprocal_div.c28 R.sh1 = min(l, 1); in reciprocal_value()
/lib/crypto/arm64/
A Dchacha-neon-glue.c45 int l = min(bytes, CHACHA_BLOCK_SIZE * 5); in chacha_doneon()
/lib/zstd/compress/
A Dhuf_compress.c330 { U16 min = 0; in HUF_readCTable() local
332 valPerRank[n] = min; /* get starting value within each rank */ in HUF_readCTable()
333 min += nbPerRank[n]; in HUF_readCTable()
334 min >>= 1; in HUF_readCTable()
739 { U16 min = 0; in HUF_buildCTableFromTree() local
741 valPerRank[n] = min; /* get starting value within each rank */ in HUF_buildCTableFromTree()
742 min += nbPerRank[n]; in HUF_buildCTableFromTree()
743 min >>= 1; in HUF_buildCTableFromTree()
/lib/lz4/
A Dlz4_decompress.c341 length = min(length, (size_t)(oend - op)); in LZ4_decompress_generic()
387 size_t const mlen = min(length, (size_t)(oend - op)); in LZ4_decompress_generic()
471 dstCapacity = min(targetOutputSize, dstCapacity); in LZ4_decompress_safe_partial()
/lib/crypto/arm/
A Dchacha-glue.c46 unsigned int l = min(bytes, CHACHA_BLOCK_SIZE * 4U); in chacha_doneon()
/lib/xz/
A Dxz_dec_test.c123 buffers.in_size = min(remaining, sizeof(buffer_in)); in xz_dec_test_write()
/lib/crc/riscv/
A Dcrc-clmul-template.h207 align = min(sizeof(unsigned long) - align, len); in crc_clmul()

Completed in 63 milliseconds

123