HomeSort by: relevance | last modified time | path
    Searched defs:max_count (Results 1 - 5 of 5) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_allocator_local_cache.h 60 // max_count will be zero, leading to check failure.
63 if (UNLIKELY(c->count == c->max_count))
64 Drain(c, allocator, class_id, c->max_count / 2);
87 u32 max_count; member in struct:SizeClassAllocator64LocalCache::PerClass
95 if (LIKELY(c->max_count))
100 c->max_count = 2 * SizeClassMap::MaxCachedHint(size);
103 DCHECK_NE(c->max_count, 0UL);
109 const uptr num_requested_chunks = c->max_count / 2;
179 // max_count will be zero, leading to check failure.
182 if (UNLIKELY(c->count == c->max_count))
209 uptr max_count; member in struct:SizeClassAllocator32LocalCache::PerClass
    [all...]
sanitizer_allocator_primary32.h 305 TransferBatch **current_batch, uptr max_count,
320 if (b->Count() == max_count) {
340 const uptr max_count = TransferBatch::MaxCached(size); local in function:SizeClassAllocator32::PopulateFreeList
341 DCHECK_GT(max_count, 0);
349 if (UNLIKELY(!PopulateBatches(c, sci, class_id, &b, max_count,
356 if (UNLIKELY(!PopulateBatches(c, sci, class_id, &b, max_count,
  /src/common/dist/zlib/
trees.c 718 int max_count = 7; /* max repeat count */ local in function:scan_tree
721 if (nextlen == 0) max_count = 138, min_count = 3;
726 if (++count < max_count && curlen == nextlen) {
740 max_count = 138, min_count = 3;
742 max_count = 6, min_count = 3;
744 max_count = 7, min_count = 4;
759 int max_count = 7; /* max repeat count */ local in function:send_tree
763 if (nextlen == 0) max_count = 138, min_count = 3;
767 if (++count < max_count && curlen == nextlen) {
787 max_count = 138, min_count = 3
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/selftests/
test-drm_mm.c 1044 const unsigned int max_count = min(8192u, max_prime); local in function:igt_align
1055 nodes = vzalloc(array_size(max_count, sizeof(*nodes)));
1064 for_each_prime_number_from(prime, 1, max_count) {
  /src/sys/net/
zlib.c 2807 int max_count = 7; /* max repeat count */ local in function:scan_tree
2810 if (nextlen == 0) max_count = 138, min_count = 3;
2815 if (++count < max_count && curlen == nextlen) {
2829 max_count = 138, min_count = 3;
2831 max_count = 6, min_count = 3;
2833 max_count = 7, min_count = 4;
2851 int max_count = 7; /* max repeat count */ local in function:send_tree
2855 if (nextlen == 0) max_count = 138, min_count = 3;
2859 if (++count < max_count && curlen == nextlen) {
2879 max_count = 138, min_count = 3
    [all...]

Completed in 34 milliseconds