Home
last modified time | relevance | path

Searched refs:limit (Results 1 – 20 of 20) sorted by relevance

/lib/
A Ddynamic_queue_limits.c85 unsigned int inprogress, prev_inprogress, limit; in dql_completed() local
102 limit = dql->limit; in dql_completed()
103 ovlimit = POSDIFF(num_queued - dql->num_completed, limit); in dql_completed()
125 limit += POSDIFF(completed, dql->prev_num_queued) + in dql_completed()
154 slack = POSDIFF(limit + dql->prev_ovlimit, in dql_completed()
166 limit = POSDIFF(limit, dql->lowest_slack); in dql_completed()
173 limit = clamp(limit, dql->min_limit, dql->max_limit); in dql_completed()
175 if (limit != dql->limit) { in dql_completed()
176 dql->limit = limit; in dql_completed()
180 dql->adj_limit = limit + completed; in dql_completed()
[all …]
A Dpercpu_counter.c328 s64 limit, s64 amount, s32 batch) in __percpu_counter_limited_add() argument
344 ((amount > 0 && fbc->count + unknown <= limit) || in __percpu_counter_limited_add()
345 (amount < 0 && fbc->count - unknown >= limit))) { in __percpu_counter_limited_add()
356 if (count - unknown > limit) in __percpu_counter_limited_add()
358 if (count + unknown <= limit) in __percpu_counter_limited_add()
361 if (count + unknown < limit) in __percpu_counter_limited_add()
363 if (count - unknown >= limit) in __percpu_counter_limited_add()
376 if (count > limit) in __percpu_counter_limited_add()
379 if (count < limit) in __percpu_counter_limited_add()
A Ddecompress_bunzip2.c84 int limit[MAX_HUFCODE_BITS+1]; member
160 int *limit = NULL; in get_next_block() local
305 limit = hufGroup->limit-1; in get_next_block()
310 temp[i] = limit[i] = 0; in get_next_block()
337 limit[i] = (pp << (maxLen - i)) - 1; in get_next_block()
341 limit[maxLen+1] = INT_MAX; /* Sentinel value for in get_next_block()
343 limit[maxLen] = pp+temp[maxLen]-1; in get_next_block()
367 limit = hufGroup->limit-1; in get_next_block()
397 while (j > limit[i]) in get_next_block()
A Dxxhash.c109 const uint8_t *const limit = b_end - 16; in xxh32() local
124 } while (p <= limit); in xxh32()
179 const uint8_t *const limit = b_end - 32; in xxh64() local
194 } while (p <= limit); in xxh64()
305 const uint8_t *const limit = b_end - 32; in xxh64_update() local
320 } while (p <= limit); in xxh64_update()
A Ducs2_string.c139 unsigned long limit = ucs2_strnlen(src, maxlength); in ucs2_as_utf8() local
141 for (i = 0; maxlength && i < limit; i++) { in ucs2_as_utf8()
A Dxarray.c134 if (find_next_bit(marks, limit, xas->xa_offset + 1) != limit) { in xas_squash_marks()
1986 struct xa_limit limit, gfp_t gfp) in __xa_alloc() argument
1999 xas.xa_index = limit.min; in __xa_alloc()
2000 xas_find_marked(&xas, limit.max, XA_FREE_MARK); in __xa_alloc()
2038 struct xa_limit limit, u32 *next, gfp_t gfp) in __xa_alloc_cyclic() argument
2040 u32 min = limit.min; in __xa_alloc_cyclic()
2043 limit.min = max(min, *next); in __xa_alloc_cyclic()
2044 ret = __xa_alloc(xa, id, entry, limit, gfp); in __xa_alloc_cyclic()
2050 if (ret < 0 && limit.min > min) { in __xa_alloc_cyclic()
2051 limit.min = min; in __xa_alloc_cyclic()
[all …]
A Dref_tracker.c72 ref_tracker_get_stats(struct ref_tracker_dir *dir, unsigned int limit) in ref_tracker_get_stats() argument
77 stats = kmalloc(struct_size(stats, stacks, limit), in ref_tracker_get_stats()
92 if (i >= limit) in ref_tracker_get_stats()
A Dstring.c129 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1)); in sized_strscpy() local
130 if (limit < max) in sized_strscpy()
131 max = limit; in sized_strscpy()
A Dstackdepot.c106 const long long limit = (1LL << (DEPOT_POOL_INDEX_BITS)) - 1; in parse_max_pools() local
120 if (max_pools > limit) { in parse_max_pools()
122 limit, stack_max_pools); in parse_max_pools()
A Ddebugobjects.c597 static int limit; in debug_print_object() local
608 if (limit < 5 && descr != descr_test) { in debug_print_object()
611 limit++; in debug_print_object()
638 static int limit; in debug_object_is_on_stack() local
640 if (limit > 4) in debug_object_is_on_stack()
647 limit++; in debug_object_is_on_stack()
A Dtest_xarray.c1038 struct xa_limit limit = XA_LIMIT(1, 0x3fff); in check_xa_alloc_3() local
1045 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, xa_mk_index(1), limit, in check_xa_alloc_3()
1050 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, xa_mk_index(0x3ffd), limit, in check_xa_alloc_3()
1062 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, entry, limit, in check_xa_alloc_3()
A Dtest_maple_tree.c1325 unsigned long limit = 30, i = 0; in check_next_entry() local
1330 check_seq(mt, limit, false); in check_next_entry()
1335 for ( ; i <= limit + 1; i++) { in check_next_entry()
1336 entry = mas_next(&mas, limit); in check_next_entry()
1337 if (i > limit) in check_next_entry()
A DKconfig.debug997 below a certain limit.
/lib/xz/
A Dxz_dec_lzma2.c60 size_t limit; member
298 dict->limit = 0; in dict_reset()
306 dict->limit = dict->end; in dict_limit()
560 } while (symbol < limit); in rc_bittree()
580 } while (++i < limit); in rc_bittree_reverse()
595 } while (--limit > 0); in rc_direct()
654 uint32_t limit; in lzma_len() local
658 limit = LEN_LOW_SYMBOLS; in lzma_len()
673 s->lzma.len += rc_bittree(&s->rc, probs, limit) - limit; in lzma_len()
681 uint32_t limit; in lzma_match() local
[all …]
/lib/lzo/
A Dlzo1x_compress.c65 const unsigned char *limit = min(ip_end, ip + MAX_ZERO_RUN_LENGTH + 1); in LZO_SAFE() local
70 for (; (ir + 32) <= limit; ir += 32) { in LZO_SAFE()
78 for (; (ir + 8) <= limit; ir += 8) { in LZO_SAFE()
94 (ir < limit) && (*ir == 0)) in LZO_SAFE()
97 for (; (ir + 4) <= limit; ir += 4) { in LZO_SAFE()
112 while (likely(ir < limit) && unlikely(*ir == 0)) in LZO_SAFE()
/lib/lz4/
A Dlz4hc_compress.c344 limitedOutput_directive limit in LZ4HC_compress_generic() argument
402 &anchor, ml, ref, limit, oend)) in LZ4HC_compress_generic()
468 ml, ref, limit, oend)) in LZ4HC_compress_generic()
472 ml2, ref2, limit, oend)) in LZ4HC_compress_generic()
498 ml, ref, limit, oend)) in LZ4HC_compress_generic()
539 ref, limit, oend)) in LZ4HC_compress_generic()
557 if ((limit) in LZ4HC_compress_generic()
673 limitedOutput_directive limit) in LZ4_compressHC_continue_generic() argument
713 inputSize, maxOutputSize, ctxPtr->compressionLevel, limit); in LZ4_compressHC_continue_generic()
A Dlz4_compress.c339 const BYTE *limit; in LZ4_compress_generic() local
342 limit = ip + (dictEnd - match); in LZ4_compress_generic()
344 if (limit > matchlimit) in LZ4_compress_generic()
345 limit = matchlimit; in LZ4_compress_generic()
348 match + MINMATCH, limit); in LZ4_compress_generic()
352 if (ip == limit) { in LZ4_compress_generic()
/lib/zstd/compress/
A Dzstd_preSplit.c61 size_t limit = srcSize - HASHLENGTH + 1; in addEvents_generic() local
64 for (n = 0; n < limit; n+=samplingRate) { in addEvents_generic()
67 fp->nbEvents += limit/samplingRate; in addEvents_generic()
A Dzstd_compress.c6939 const __m256i limit = _mm256_set1_epi32(65535); in convertSequences_noRepcodes() local
6996 __m256i ll_cmp = _mm256_cmpgt_epi32(vadd, limit); /* 0xFFFFFFFF for element > 65535 */ in convertSequences_noRepcodes()
/lib/zlib_deflate/
A Ddeflate.c573 IPos limit = s->strstart > (IPos)MAX_DIST(s) ? in longest_match() local
694 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()

Completed in 80 milliseconds