| /linux-4.4.14/include/linux/ |
| H A D | kmemleak.h | 29 extern void kmemleak_alloc(const void *ptr, size_t size, int min_count,
43 int min_count, unsigned long flags, kmemleak_alloc_recursive()
47 kmemleak_alloc(ptr, size, min_count, gfp); kmemleak_alloc_recursive()
66 static inline void kmemleak_alloc(const void *ptr, size_t size, int min_count, kmemleak_alloc() argument
71 int min_count, unsigned long flags, kmemleak_alloc_recursive()
42 kmemleak_alloc_recursive(const void *ptr, size_t size, int min_count, unsigned long flags, gfp_t gfp) kmemleak_alloc_recursive() argument
70 kmemleak_alloc_recursive(const void *ptr, size_t size, int min_count, unsigned long flags, gfp_t gfp) kmemleak_alloc_recursive() argument
|
| /linux-4.4.14/mm/ |
| H A D | kmemleak.c | 160 int min_count; member in struct:kmemleak_object
264 int min_count; /* minimum reference count */ member in struct:early_log
316 * Object colors, encoded with count and min_count:
317 * - white - orphan object, not enough references to it (count < min_count)
318 * - gray - not orphan, not marked as false positive (min_count == 0) or
319 * sufficient references to it (count >= min_count)
321 * (min_count == -1). No function defined for this color.
328 object->count < object->min_count; color_white()
333 return object->min_count != KMEMLEAK_BLACK && color_gray()
334 object->count >= object->min_count; color_gray()
389 pr_notice(" min_count = %d\n", object->min_count); dump_object_info()
539 int min_count, gfp_t gfp) create_object()
560 object->min_count = min_count; create_object()
690 create_object(start, ptr - start, object->min_count, delete_object_part()
693 create_object(ptr + size, end - ptr - size, object->min_count, delete_object_part()
701 object->min_count = color; __paint_it()
820 int min_count) log_early()
846 log->min_count = min_count; log_early()
869 log->min_count, GFP_ATOMIC); early_alloc()
899 * @min_count: minimum number of references to this object. If during memory
900 * scanning a number of references less than @min_count is found,
901 * the object is reported as a memory leak. If @min_count is 0,
902 * the object is never reported as a leak. If @min_count is -1,
909 void __ref kmemleak_alloc(const void *ptr, size_t size, int min_count, kmemleak_alloc() argument
912 pr_debug("%s(0x%p, %zu, %d)\n", __func__, ptr, size, min_count); kmemleak_alloc()
915 create_object((unsigned long)ptr, size, min_count, gfp); kmemleak_alloc()
917 log_early(KMEMLEAK_ALLOC, ptr, size, min_count); kmemleak_alloc()
939 * (min_count is set to 0). kmemleak_alloc_percpu()
1431 object->count = object->min_count;
538 create_object(unsigned long ptr, size_t size, int min_count, gfp_t gfp) create_object() argument
819 log_early(int op_type, const void *ptr, size_t size, int min_count) log_early() argument
|
| H A D | nobootmem.c | 63 * The min_count is set to 0 so that bootmem allocated blocks __alloc_memory_core_early()
|
| H A D | memblock.c | 1151 * The min_count is set to 0 so that memblock allocations are memblock_alloc_range_nid()
1245 * In addition, function sets the min_count to 0 using kmemleak_alloc for
1310 * The min_count is set to 0 so that bootmem allocated blocks memblock_virt_alloc_internal()
|
| H A D | bootmem.c | 591 * The min_count is set to 0 so that bootmem allocated blocks alloc_bootmem_bdata()
|
| H A D | hugetlb.c | 2144 unsigned long min_count, ret; set_max_huge_pages() local
2201 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages; set_max_huge_pages()
2202 min_count = max(count, min_count); set_max_huge_pages()
2203 try_to_free_low(h, min_count, nodes_allowed); set_max_huge_pages()
2204 while (min_count < persistent_huge_pages(h)) { set_max_huge_pages()
|
| /linux-4.4.14/lib/zlib_deflate/ |
| H A D | deftree.c | 638 int min_count = 4; /* min repeat count */ scan_tree() local
640 if (nextlen == 0) max_count = 138, min_count = 3; scan_tree()
647 } else if (count < min_count) { scan_tree()
659 max_count = 138, min_count = 3; scan_tree()
661 max_count = 6, min_count = 3; scan_tree()
663 max_count = 7, min_count = 4; scan_tree()
684 int min_count = 4; /* min repeat count */ send_tree() local
687 if (nextlen == 0) max_count = 138, min_count = 3; send_tree()
693 } else if (count < min_count) { send_tree()
711 max_count = 138, min_count = 3; send_tree()
713 max_count = 6, min_count = 3; send_tree()
715 max_count = 7, min_count = 4; send_tree()
|
| /linux-4.4.14/drivers/staging/lustre/lustre/lov/ |
| H A D | lov_pool.c | 316 int lov_ost_pool_extend(struct ost_pool *op, unsigned int min_count) lov_ost_pool_extend() argument
321 LASSERT(min_count != 0); lov_ost_pool_extend()
326 new_size = max(min_count, 2 * op->op_size); lov_ost_pool_extend()
339 int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int min_count) lov_ost_pool_add() argument
345 rc = lov_ost_pool_extend(op, min_count); lov_ost_pool_add()
|
| H A D | lov_internal.h | 240 int lov_ost_pool_extend(struct ost_pool *op, unsigned int min_count);
241 int lov_ost_pool_add(struct ost_pool *op, __u32 idx, unsigned int min_count);
|
| /linux-4.4.14/drivers/net/wireless/ath/ |
| H A D | dfs_pri_detector.c | 226 u64 ts, u32 min_count) pseq_handler_create_sequences()
280 if (ps.count <= min_count) pseq_handler_create_sequences()
225 pseq_handler_create_sequences(struct pri_detector *pde, u64 ts, u32 min_count) pseq_handler_create_sequences() argument
|
| /linux-4.4.14/arch/ia64/kernel/ |
| H A D | iosapic.c | 487 int i, irq = -ENOSPC, min_count = -1; iosapic_find_sharable_irq() local
503 if (min_count == -1 || info->count < min_count) { iosapic_find_sharable_irq()
505 min_count = info->count; iosapic_find_sharable_irq()
|
| /linux-4.4.14/include/acpi/ |
| H A D | actbl2.h | 1348 u32 min_count; /* Minimum counter value */ member in struct:acpi_table_wdat
1418 u16 min_count; /* Minimum counter value supported */ member in struct:acpi_table_wddt
|