Home
last modified time | relevance | path

Searched refs:min_order (Results 1 – 9 of 9) sorted by relevance

/linux-6.15/mm/
H A Dfail_page_alloc.c12 u32 min_order; member
17 .min_order = 1,
30 if (order < fail_page_alloc.min_order) in should_fail_alloc_page()
62 debugfs_create_u32("min-order", mode, dir, &fail_page_alloc.min_order); in fail_page_alloc_debugfs()
H A Dreadahead.c465 unsigned int min_order = mapping_min_folio_order(mapping); in page_cache_ra_order() local
487 new_order = max(new_order, min_order); in page_cache_ra_order()
507 while (order > min_order && index + (1UL << order) - 1 > limit) in page_cache_ra_order()
749 unsigned int min_order = mapping_min_folio_order(mapping); in readahead_expand() local
766 folio = ractl_alloc_folio(ractl, gfp_mask, min_order); in readahead_expand()
795 folio = ractl_alloc_folio(ractl, gfp_mask, min_order); in readahead_expand()
H A Dfilemap.c1941 unsigned int min_order = mapping_min_folio_order(mapping); in __filemap_get_folio() local
1942 unsigned int order = max(min_order, FGF_GET_ORDER(fgp_flags)); in __filemap_get_folio()
1967 if (order > min_order) in __filemap_get_folio()
1984 } while (order-- > min_order); in __filemap_get_folio()
2502 unsigned int min_order = mapping_min_folio_order(mapping); in filemap_create_folio() local
2508 folio = filemap_alloc_folio(mapping_gfp_mask(mapping), min_order); in filemap_create_folio()
2528 index = (iocb->ki_pos >> (PAGE_SHIFT + min_order)) << min_order; in filemap_create_folio()
H A Dhuge_memory.c3784 unsigned int min_order; in __folio_split() local
3800 min_order = mapping_min_folio_order(folio->mapping); in __folio_split()
3801 if (new_order < min_order) { in __folio_split()
3803 min_order); in __folio_split()
4458 unsigned int min_order; in split_huge_pages_in_file() local
4473 min_order = mapping_min_folio_order(mapping); in split_huge_pages_in_file()
4474 target_order = max(new_order, min_order); in split_huge_pages_in_file()
H A Dslub.c5430 unsigned int min_order, unsigned int max_order, in calc_slab_order() argument
5435 for (order = min_order; order <= max_order; order++) { in calc_slab_order()
5454 unsigned int min_order; in calculate_order() local
5476 min_order = max_t(unsigned int, slub_min_order, in calculate_order()
5478 if (order_objects(min_order, size) > MAX_OBJS_PER_PAGE) in calculate_order()
5497 order = calc_slab_order(size, min_order, slub_max_order, in calculate_order()
H A Dpage_alloc.c2195 int min_order = order; in __rmqueue_claim() local
2206 min_order = pageblock_order; in __rmqueue_claim()
2213 for (current_order = MAX_PAGE_ORDER; current_order >= min_order; in __rmqueue_claim()
/linux-6.15/drivers/gpu/drm/
H A Ddrm_buddy.c169 unsigned int min_order) in __force_merge() argument
174 if (!min_order) in __force_merge()
177 if (min_order > mm->max_order) in __force_merge()
180 for (i = min_order - 1; i >= 0; i--) { in __force_merge()
216 if (order >= min_order) in __force_merge()
990 unsigned int min_order, order; in drm_buddy_alloc_blocks() local
1040 BUG_ON(order < min_order); in drm_buddy_alloc_blocks()
1050 if (order-- == min_order) { in drm_buddy_alloc_blocks()
1053 !__force_merge(mm, start, end, min_order)) { in drm_buddy_alloc_blocks()
1056 min_order, in drm_buddy_alloc_blocks()
[all …]
/linux-6.15/fs/ext4/
H A Dmballoc.c998 int i, order, min_order; in ext4_mb_choose_next_group_best_avail() local
1015 min_order = order - sbi->s_mb_best_avail_max_trim_order; in ext4_mb_choose_next_group_best_avail()
1016 if (min_order < 0) in ext4_mb_choose_next_group_best_avail()
1017 min_order = 0; in ext4_mb_choose_next_group_best_avail()
1025 if (1 << min_order < num_stripe_clusters) in ext4_mb_choose_next_group_best_avail()
1030 min_order = fls(num_stripe_clusters) - 1; in ext4_mb_choose_next_group_best_avail()
1033 if (1 << min_order < ac->ac_o_ex.fe_len) in ext4_mb_choose_next_group_best_avail()
1034 min_order = fls(ac->ac_o_ex.fe_len); in ext4_mb_choose_next_group_best_avail()
1036 for (i = order; i >= min_order; i--) { in ext4_mb_choose_next_group_best_avail()
/linux-6.15/drivers/md/bcache/
H A Dbtree.c608 static int mca_reap(struct btree *b, unsigned int min_order, bool flush) in mca_reap() argument
620 if (b->keys.page_order < min_order) in mca_reap()