/linux-4.1.27/include/linux/ |
D | kmemleak.h | 29 extern void kmemleak_alloc(const void *ptr, size_t size, int min_count, 43 int min_count, unsigned long flags, in kmemleak_alloc_recursive() argument 47 kmemleak_alloc(ptr, size, min_count, gfp); in kmemleak_alloc_recursive() 66 static inline void kmemleak_alloc(const void *ptr, size_t size, int min_count, in kmemleak_alloc() argument 71 int min_count, unsigned long flags, in kmemleak_alloc_recursive() argument
|
/linux-4.1.27/mm/ |
D | kmemleak.c | 153 int min_count; member 257 int min_count; /* minimum reference count */ member 330 object->count < object->min_count; in color_white() 335 return object->min_count != KMEMLEAK_BLACK && in color_gray() 336 object->count >= object->min_count; in color_gray() 391 pr_notice(" min_count = %d\n", object->min_count); in dump_object_info() 521 int min_count, gfp_t gfp) in create_object() argument 542 object->min_count = min_count; in create_object() 678 create_object(start, ptr - start, object->min_count, in delete_object_part() 681 create_object(ptr + size, end - ptr - size, object->min_count, in delete_object_part() [all …]
|
D | hugetlb.c | 1730 unsigned long min_count, ret; in set_max_huge_pages() local 1787 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages; in set_max_huge_pages() 1788 min_count = max(count, min_count); in set_max_huge_pages() 1789 try_to_free_low(h, min_count, nodes_allowed); in set_max_huge_pages() 1790 while (min_count < persistent_huge_pages(h)) { in set_max_huge_pages()
|
/linux-4.1.27/lib/zlib_deflate/ |
D | deftree.c | 638 int min_count = 4; /* min repeat count */ in scan_tree() local 640 if (nextlen == 0) max_count = 138, min_count = 3; in scan_tree() 647 } else if (count < min_count) { in scan_tree() 659 max_count = 138, min_count = 3; in scan_tree() 661 max_count = 6, min_count = 3; in scan_tree() 663 max_count = 7, min_count = 4; in scan_tree() 684 int min_count = 4; /* min repeat count */ in send_tree() local 687 if (nextlen == 0) max_count = 138, min_count = 3; in send_tree() 693 } else if (count < min_count) { in send_tree() 711 max_count = 138, min_count = 3; in send_tree() [all …]
|
/linux-4.1.27/drivers/staging/lustre/lustre/lov/ |
D | lov_pool.c | 339 int lov_ost_pool_extend(struct ost_pool *op, unsigned int min_count) in lov_ost_pool_extend() argument 344 LASSERT(min_count != 0); in lov_ost_pool_extend() 349 new_size = max(min_count, 2 * op->op_size); in lov_ost_pool_extend() 362 int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int min_count) in lov_ost_pool_add() argument 368 rc = lov_ost_pool_extend(op, min_count); in lov_ost_pool_add()
|
D | lov_internal.h | 285 int lov_ost_pool_extend(struct ost_pool *op, unsigned int min_count); 286 int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int min_count);
|
/linux-4.1.27/drivers/net/wireless/ath/ |
D | dfs_pri_detector.c | 223 u64 ts, u32 min_count) in pseq_handler_create_sequences() argument 276 if (ps.count < min_count) in pseq_handler_create_sequences()
|
/linux-4.1.27/arch/ia64/kernel/ |
D | iosapic.c | 487 int i, irq = -ENOSPC, min_count = -1; in iosapic_find_sharable_irq() local 503 if (min_count == -1 || info->count < min_count) { in iosapic_find_sharable_irq() 505 min_count = info->count; in iosapic_find_sharable_irq()
|
/linux-4.1.27/include/acpi/ |
D | actbl2.h | 1163 u32 min_count; /* Minimum counter value */ member 1233 u16 min_count; /* Minimum counter value supported */ member
|