Home
last modified time | relevance | path

Searched refs:max (Results 1 – 25 of 37) sorted by relevance

12

/lib/
A Dstrnlen_user.c23 …_always_inline long do_strnlen_user(const char __user *src, unsigned long count, unsigned long max) in do_strnlen_user() argument
35 max += align; in do_strnlen_user()
49 if (unlikely(max <= sizeof(unsigned long))) in do_strnlen_user()
51 max -= sizeof(unsigned long); in do_strnlen_user()
111 unsigned long max = max_addr - src_addr; in strnlen_user() local
118 if (max > count) in strnlen_user()
119 max = count; in strnlen_user()
121 if (user_read_access_begin(str, max)) { in strnlen_user()
122 retval = do_strnlen_user(str, count, max); in strnlen_user()
A Dstrncpy_from_user.c29 unsigned long count, unsigned long max) in do_strncpy_from_user() argument
37 while (max >= sizeof(unsigned long)) { in do_strncpy_from_user()
65 max -= sizeof(unsigned long); in do_strncpy_from_user()
69 while (max) { in do_strncpy_from_user()
77 max--; in do_strncpy_from_user()
138 unsigned long max = max_addr - src_addr; in strncpy_from_user() local
145 if (max > count) in strncpy_from_user()
146 max = count; in strncpy_from_user()
148 if (user_read_access_begin(src, max)) { in strncpy_from_user()
149 retval = do_strncpy_from_user(dst, src, count, max); in strncpy_from_user()
A Dmaple_tree.c1144 mas->max = max; in mas_ascend()
2680 mast->l->max = mast->orig_r->max; in mast_cp_to_nodes()
2692 mast->r->max = mast->orig_r->max; in mast_cp_to_nodes()
2770 max = mas->max; in mtree_range_walk()
2954 mas->max = l_mas.max; in mas_spanning_rebalance()
3381 mast.r->max = mas->max; in mas_split()
3501 max = wr_mas->mas->max; in mas_is_span_wr()
4488 mas->max = max; in mas_prev_node()
4608 if (mas->max >= max) in mas_next_node()
4700 if (mas->max >= max) { in mas_next_slot()
[all …]
A Didr.c34 unsigned long max, gfp_t gfp) in idr_alloc_u32() argument
120 int err, max = end > 0 ? end - 1 : INT_MAX; in idr_alloc_cyclic() local
125 err = idr_alloc_u32(idr, ptr, &id, max, gfp); in idr_alloc_cyclic()
128 err = idr_alloc_u32(idr, ptr, &id, max, gfp); in idr_alloc_cyclic()
391 if ((int)max < 0) in ida_alloc_range()
392 max = INT_MAX; in ida_alloc_range()
400 if (xas.xa_index * IDA_BITMAP_BITS + bit > max) in ida_alloc_range()
503 if ((int)max < 0) in ida_find_first_range()
504 max = INT_MAX; in ida_find_first_range()
516 if (index * IDA_BITMAP_BITS + offset > max) { in ida_find_first_range()
[all …]
A Dnlattr.c129 range->max = U8_MAX; in nla_get_range_unsigned()
134 range->max = U16_MAX; in nla_get_range_unsigned()
138 range->max = U32_MAX; in nla_get_range_unsigned()
143 range->max = U64_MAX; in nla_get_range_unsigned()
154 range->max = pt->max; in nla_get_range_unsigned()
163 range->max = pt->max; in nla_get_range_unsigned()
248 range->max = S8_MAX; in nla_get_range_signed()
252 range->max = S16_MAX; in nla_get_range_signed()
256 range->max = S32_MAX; in nla_get_range_signed()
271 range->max = pt->max; in nla_get_range_signed()
[all …]
A Dxarray.c423 max |= mask; in xas_max()
424 if (mask == max) in xas_max()
425 max++; in xas_max()
429 return max; in xas_max()
575 if (max == 0) in xas_expand()
835 if (offset == max) in xas_store()
1399 if (xas->xa_index > max) in xas_find()
1471 goto max; in xas_find_marked()
1516 goto max; in xas_find_marked()
1535 goto max; in xas_find_marked()
[all …]
A Dstring.c116 size_t max = count; in sized_strscpy() local
130 if (limit < max) in sized_strscpy()
131 max = limit; in sized_strscpy()
136 max = 0; in sized_strscpy()
147 max = 0; in sized_strscpy()
149 while (max >= sizeof(unsigned long)) { in sized_strscpy()
171 max -= sizeof(unsigned long); in sized_strscpy()
A Drbtree_test.c226 u32 subtree, max = node->val; in check_augmented() local
230 if (max < subtree) in check_augmented()
231 max = subtree; in check_augmented()
236 if (max < subtree) in check_augmented()
237 max = subtree; in check_augmented()
239 WARN_ON_ONCE(node->augmented != max); in check_augmented()
A Dtest_objpool.c287 int max = num_possible_cpus() << 3; in ot_init_sync_m0() local
297 if (objpool_init(&sop->pool, max, test->objsz, in ot_init_sync_m0()
302 WARN_ON(max != sop->pool.nr_objs); in ot_init_sync_m0()
453 int max = num_possible_cpus() << 3; in ot_init_async_m0() local
463 if (objpool_init(&sop->pool, max, test->objsz, gfp, sop, in ot_init_async_m0()
468 WARN_ON(max != sop->pool.nr_objs); in ot_init_async_m0()
A Dtest_maple_tree.c230 unsigned long i = max, j; in check_rev_seq()
237 for (j = i; j <= max; j++) in check_rev_seq()
268 for (i = 0; i <= max; i++) { in check_seq()
391 unsigned long max; in check_find() local
487 max = 0; in check_find()
507 max++; in check_find()
508 MT_BUG_ON(mt, max > 25); in check_find()
1789 int i, max = 4000; in check_node_overwrite() local
1791 for (i = 0; i < max; i++) in check_node_overwrite()
1909 unsigned long max = 2500; in bench_mas_for_each() local
[all …]
A Dradix-tree.c606 unsigned long max = index; in __radix_tree_create() local
612 if (max > maxindex) { in __radix_tree_create()
613 int error = radix_tree_extend(root, gfp, max, shift); in __radix_tree_create()
1478 unsigned long max) in idr_get_free() argument
1488 start = max(start, maxindex + 1); in idr_get_free()
1489 if (start > max) in idr_get_free()
1523 if (start > max || start == 0) in idr_get_free()
1539 iter->next_index = 1 + min(max, (start | node_maxindex(node))); in idr_get_free()
A Dobjagg.c228 unsigned int min, max; in objagg_obj_root_id_alloc() local
239 max = hnode->root_id; in objagg_obj_root_id_alloc()
245 max = ~0; 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 Dkfifo.c380 unsigned int max = (1 << (recsize << 3)) - 1; in __kfifo_max_r() local
382 if (len > max) in __kfifo_max_r()
383 return max; in __kfifo_max_r()
/lib/zlib_inflate/
A Dinftrees.c28 unsigned min, max; /* minimum and maximum code lengths */ in zlib_inflate_table() local
100 for (max = MAXBITS; max >= 1; max--) in zlib_inflate_table()
101 if (count[max] != 0) break; in zlib_inflate_table()
102 if (root > max) root = max; in zlib_inflate_table()
103 if (max == 0) { /* no symbols to code at all */ in zlib_inflate_table()
123 if (left > 0 && (type == CODES || max != 1)) in zlib_inflate_table()
241 if (len == max) break; in zlib_inflate_table()
257 while (curr + drop < max) { in zlib_inflate_table()
/lib/zstd/compress/
A Dzstd_compress_sequences.c71 static size_t ZSTD_NCountCost(unsigned const* count, unsigned const max, in ZSTD_NCountCost() argument
76 const U32 tableLog = FSE_optimalTableLog(FSELog, nbSeq, max); in ZSTD_NCountCost()
78 return FSE_writeNCount(wksp, sizeof(wksp), norm, max, tableLog); in ZSTD_NCountCost()
91 for (s = 0; s <= max; ++s) { in ZSTD_entropyCost()
108 unsigned const max) in ZSTD_fseBitCost() argument
115 if (ZSTD_getFSEMaxSymbolValue(ctable) < max) { in ZSTD_fseBitCost()
117 ZSTD_getFSEMaxSymbolValue(ctable), max); in ZSTD_fseBitCost()
120 for (s = 0; s <= max; ++s) { in ZSTD_fseBitCost()
147 for (s = 0; s <= max; ++s) { in ZSTD_crossEntropyCost()
246 unsigned* count, U32 max, in ZSTD_buildCTable() argument
[all …]
A Dzstd_compress_sequences.h26 FSE_repeat* repeatMode, unsigned const* count, unsigned const max,
36 unsigned* count, U32 max,
52 unsigned const max);
55 unsigned const* count, unsigned const max);
A Dhist.c86 unsigned max=0; in HIST_count_parallel_wksp() local
134 if (Counting1[s] > max) max = Counting1[s]; in HIST_count_parallel_wksp()
143 return (size_t)max; in HIST_count_parallel_wksp()
A Dzstd_compress_superblock.c343 unsigned max = maxCode; in ZSTD_estimateSubBlockSize_symbolType() local
345 HIST_countFast_wksp(countWksp, &max, codeTable, nbSeq, workspace, wkspSize); /* can't fail */ in ZSTD_estimateSubBlockSize_symbolType()
348 assert(max <= defaultMax); in ZSTD_estimateSubBlockSize_symbolType()
349 cSymbolTypeSizeEstimateInBits = max <= defaultMax in ZSTD_estimateSubBlockSize_symbolType()
350 ? ZSTD_crossEntropyCost(defaultNorm, defaultNormLog, countWksp, max) in ZSTD_estimateSubBlockSize_symbolType()
355 cSymbolTypeSizeEstimateInBits = ZSTD_fseBitCost(fseCTable, countWksp, max); in ZSTD_estimateSubBlockSize_symbolType()
A Dfse_compress.c293 int const max = (2*threshold-1) - remaining; in FSE_writeNCount_generic() local
297 count += max; /* [0..max[ [max..threshold[ (...) [threshold+max 2*threshold[ */ in FSE_writeNCount_generic()
300 bitCount -= (count<max); in FSE_writeNCount_generic()
/lib/math/tests/
A Dprime_numbers_kunit.c21 const unsigned long max = 65536; in prime_numbers_test() local
24 for (last = 0, x = 2; x < max; x++) { in prime_numbers_test()
/lib/zstd/common/
A Dentropy_common.c133 int const max = (2*threshold-1) - remaining; in FSE_readNCount_body() local
136 if ((bitStream & (threshold-1)) < (U32)max) { in FSE_readNCount_body()
141 if (count >= threshold) count -= max; in FSE_readNCount_body()
A Dzstd_internal.h50 #define BOUNDED(min,val,max) (MAX(min,MIN(val,max))) argument
/lib/math/
A Dreciprocal_div.c29 R.sh2 = max(l - 1, 0); in reciprocal_value()
/lib/kunit/
A Dexecutor.c178 const size_t max = suite_set->end - suite_set->start; in kunit_filter_suites() local
180 copy = kcalloc(max, sizeof(*copy), GFP_KERNEL); in kunit_filter_suites()
A Dattributes.c115 const char * const str_list[], int max) in attr_enum_filter() argument
134 for (j = 0; j <= max; j++) { in attr_enum_filter()

Completed in 76 milliseconds

12