| /lib/ |
| D | dynamic_queue_limits.c | 20 unsigned int inprogress, prev_inprogress, limit; in dql_completed() local
30 limit = dql->limit; in dql_completed()
31 ovlimit = POSDIFF(num_queued - dql->num_completed, limit); in dql_completed()
53 limit += POSDIFF(completed, dql->prev_num_queued) + in dql_completed()
82 slack = POSDIFF(limit + dql->prev_ovlimit, in dql_completed()
94 limit = POSDIFF(limit, dql->lowest_slack); in dql_completed()
101 limit = clamp(limit, dql->min_limit, dql->max_limit); in dql_completed()
103 if (limit != dql->limit) { in dql_completed()
104 dql->limit = limit; in dql_completed()
108 dql->adj_limit = limit + completed; in dql_completed()
[all …]
|
| D | decompress_bunzip2.c | 84 int limit[MAX_HUFCODE_BITS+1]; member
160 int *limit = NULL; in get_next_block() local
304 limit = hufGroup->limit-1; in get_next_block()
309 temp[i] = limit[i] = 0; in get_next_block()
336 limit[i] = (pp << (maxLen - i)) - 1; in get_next_block()
340 limit[maxLen+1] = INT_MAX; /* Sentinal value for in get_next_block()
342 limit[maxLen] = pp+temp[maxLen]-1; in get_next_block()
366 limit = hufGroup->limit-1; in get_next_block()
396 while (j > limit[i]) in get_next_block()
|
| D | xxhash.c | 109 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()
307 const uint8_t *const limit = b_end - 16; in xxh32_update() local
322 } while (p <= limit); in xxh32_update()
412 const uint8_t *const limit = b_end - 32; in xxh64_update() local
427 } while (p <= limit); in xxh64_update()
|
| D | ucs2_string.c | 87 unsigned long limit = ucs2_strnlen(src, maxlength); in ucs2_as_utf8() local
89 for (i = 0; maxlength && i < limit; i++) { in ucs2_as_utf8()
|
| D | xarray.c | 127 unsigned int limit = xas->xa_offset + xas->xa_sibs + 1; in xas_squash_marks() local
134 if (find_next_bit(marks, limit, xas->xa_offset + 1) == limit) in xas_squash_marks()
1809 struct xa_limit limit, gfp_t gfp) in __xa_alloc() argument
1822 xas.xa_index = limit.min; in __xa_alloc()
1823 xas_find_marked(&xas, limit.max, XA_FREE_MARK); in __xa_alloc()
1858 struct xa_limit limit, u32 *next, gfp_t gfp) in __xa_alloc_cyclic() argument
1860 u32 min = limit.min; in __xa_alloc_cyclic()
1863 limit.min = max(min, *next); in __xa_alloc_cyclic()
1864 ret = __xa_alloc(xa, id, entry, limit, gfp); in __xa_alloc_cyclic()
1870 if (ret < 0 && limit.min > min) { in __xa_alloc_cyclic()
[all …]
|
| D | debugobjects.c | 502 static int limit; in debug_print_object() local
513 if (limit < 5 && descr != descr_test) { in debug_print_object()
516 limit++; in debug_print_object()
543 static int limit; in debug_object_is_on_stack() local
545 if (limit > 4) in debug_object_is_on_stack()
552 limit++; in debug_object_is_on_stack()
|
| D | string.c | 195 size_t limit = PAGE_SIZE - ((long)src & (PAGE_SIZE - 1)); in strscpy() local
196 if (limit < max) in strscpy()
197 max = limit; in strscpy()
|
| D | test_xarray.c | 805 struct xa_limit limit = XA_LIMIT(1, 0x3fff); in check_xa_alloc_3() local
811 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, xa_mk_index(1), limit, in check_xa_alloc_3()
816 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, xa_mk_index(0x3ffd), limit, in check_xa_alloc_3()
828 XA_BUG_ON(xa, xa_alloc_cyclic(xa, &id, entry, limit, in check_xa_alloc_3()
|
| D | Kconfig.debug | 871 below a certain limit.
|
| /lib/xz/ |
| D | xz_dec_lzma2.c | 61 size_t limit; member
295 dict->limit = 0; in dict_reset()
303 dict->limit = dict->end; in dict_limit()
305 dict->limit = dict->pos + out_max; in dict_limit()
311 return dict->pos < dict->limit; in dict_has_space()
354 left = min_t(size_t, dict->limit - dict->pos, *len); in dict_repeat()
537 uint16_t *probs, uint32_t limit) in rc_bittree() argument
546 } while (symbol < limit); in rc_bittree()
554 uint32_t *dest, uint32_t limit) in rc_bittree_reverse() argument
566 } while (++i < limit); in rc_bittree_reverse()
[all …]
|
| /lib/lzo/ |
| D | lzo1x_compress.c | 53 const unsigned char *limit = ip_end in lzo1x_1_do_compress() local
60 for (; (ir + 32) <= limit; ir += 32) { in lzo1x_1_do_compress()
68 for (; (ir + 8) <= limit; ir += 8) { in lzo1x_1_do_compress()
84 (ir < limit) && (*ir == 0)) in lzo1x_1_do_compress()
87 for (; (ir + 4) <= limit; ir += 4) { in lzo1x_1_do_compress()
102 while (likely(ir < limit) && unlikely(*ir == 0)) in lzo1x_1_do_compress()
|
| /lib/lz4/ |
| D | lz4hc_compress.c | 345 limitedOutput_directive limit in LZ4HC_compress_generic() argument
403 &anchor, ml, ref, limit, oend)) in LZ4HC_compress_generic()
469 ml, ref, limit, oend)) in LZ4HC_compress_generic()
473 ml2, ref2, limit, oend)) in LZ4HC_compress_generic()
499 ml, ref, limit, oend)) in LZ4HC_compress_generic()
540 ref, limit, oend)) in LZ4HC_compress_generic()
558 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()
|
| D | lz4_compress.c | 340 const BYTE *limit; in LZ4_compress_generic() local
343 limit = ip + (dictEnd - match); in LZ4_compress_generic()
345 if (limit > matchlimit) in LZ4_compress_generic()
346 limit = matchlimit; in LZ4_compress_generic()
349 match + MINMATCH, limit); in LZ4_compress_generic()
353 if (ip == limit) { in LZ4_compress_generic()
|
| /lib/zlib_deflate/ |
| D | deflate.c | 569 IPos limit = s->strstart > (IPos)MAX_DIST(s) ? in longest_match() local
690 } while ((cur_match = prev[cur_match & wmask]) > limit in longest_match()
|