Home
last modified time | relevance | path

Searched refs:min_count (Results 1 – 5 of 5) sorted by relevance

/linux/include/linux/
H A Dkmemleak.h18 extern void kmemleak_alloc(const void *ptr, size_t size, int min_count,
40 int min_count, slab_flags_t flags, in kmemleak_alloc_recursive() argument
44 kmemleak_alloc(ptr, size, min_count, gfp); in kmemleak_alloc_recursive()
63 static inline void kmemleak_alloc(const void *ptr, size_t size, int min_count, in kmemleak_alloc() argument
68 int min_count, slab_flags_t flags, in kmemleak_alloc_recursive() argument
/linux/mm/
H A Dkmemleak.c151 int min_count; member
342 object->count < object->min_count; in color_white()
347 return object->min_count != KMEMLEAK_BLACK && in color_gray()
348 object->count >= object->min_count; in color_gray()
417 pr_notice(" min_count = %d\n", object->min_count); in dump_object_info()
729 size_t size, int min_count, unsigned int objflags) in __link_object() argument
740 object->min_count = min_count; in __link_object()
795 int min_count, gfp_t gfp, unsigned int objflags) in __create_object() argument
806 ret = __link_object(object, ptr, size, min_count, objflags); in __create_object()
814 int min_count, gfp_t gfp) in create_object() argument
[all …]
H A Dhugetlb.c3772 unsigned long min_count; in set_max_huge_pages() local
3923 min_count = h->resv_huge_pages + persistent_huge_pages(h) - persistent_free_count; in set_max_huge_pages()
3924 min_count = max(count, min_count); in set_max_huge_pages()
3925 try_to_free_low(h, min_count, nodes_allowed); in set_max_huge_pages()
3930 while (min_count < persistent_huge_pages(h)) { in set_max_huge_pages()
/linux/lib/zlib_deflate/
H A Ddeftree.c584 int min_count = 4; /* min repeat count */ in scan_tree() local
586 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree()
593 } else if (count < min_count) { in scan_tree()
605 max_count = 138, min_count = 3; in scan_tree()
607 max_count = 6, min_count = 3; in scan_tree()
609 max_count = 7, min_count = 4; in scan_tree()
630 int min_count = 4; /* min repeat count */ in send_tree() local
633 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree()
639 } else if (count < min_count) { in send_tree()
657 max_count = 138, min_count = 3; in send_tree()
[all …]
/linux/drivers/net/wireless/ath/
H A Ddfs_pri_detector.c225 u64 ts, u32 min_count) in pseq_handler_create_sequences() argument
279 if (ps.count <= min_count) in pseq_handler_create_sequences()