Lines Matching defs:max
36 * - track min/max extents in each group for better group selection
427 ext4_grpblk_t max, ext4_grpblk_t minblocks);
500 static inline int mb_find_next_zero_bit(void *addr, int max, int start)
504 tmpmax = max + fix;
508 if (ret > max)
509 return max;
513 static inline int mb_find_next_bit(void *addr, int max, int start)
517 tmpmax = max + fix;
521 if (ret > max)
522 return max;
526 static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max)
531 BUG_ON(max == NULL);
534 *max = 0;
540 *max = 1 << (e4b->bd_blkbits + 3);
545 *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order];
684 int max;
701 buddy = mb_find_buddy(e4b, order, &max);
706 MB_CHECK_ASSERT(max * 2 == max2);
709 for (i = 0; i < max; i++) {
736 buddy = mb_find_buddy(e4b, 0, &max);
737 for (i = 0; i < max; i++) {
791 ext4_grpblk_t max;
801 max = ffs(first | border) - 1;
806 if (max < min)
807 min = max;
1185 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
1195 i = mb_find_next_zero_bit(bitmap, max, 0);
1197 while (i < max) {
1200 i = mb_find_next_bit(bitmap, max, i);
1207 if (i < max)
1208 i = mb_find_next_zero_bit(bitmap, max, i);
1740 int order = 1, max;
1747 bb = mb_find_buddy(e4b, order, &max);
1836 int max;
1838 void *buddy = mb_find_buddy(e4b, order, &max);
1880 buddy2 = mb_find_buddy(e4b, order, &max);
1984 int max, order;
1990 buddy = mb_find_buddy(e4b, 0, &max);
1992 BUG_ON(block >= max);
2014 mb_find_buddy(e4b, order, &max)) {
2016 if (block + 1 >= max)
2048 int max = 0;
2072 max = !mb_test_bit(start + len, e4b->bd_bitmap);
2073 if (mlen && max)
2075 else if (!mlen && !max)
2087 buddy = mb_find_buddy(e4b, ord, &max);
2090 BUG_ON((start >> ord) >= max);
2105 buddy = mb_find_buddy(e4b, ord, &max);
2111 buddy = mb_find_buddy(e4b, ord, &max);
2222 * upto a max of sbi->s_mb_max_to_scan times (default 200). After
2226 * upto a max of sbi->s_mb_min_to_scan times (default 10) before
2298 int max;
2310 max = mb_find_extent(e4b, ex.fe_start, ex.fe_len, &ex);
2312 if (max > 0) {
2327 int max;
2348 max = mb_find_extent(e4b, ac->ac_g_ex.fe_start,
2352 if (max >= ac->ac_g_ex.fe_len &&
2363 } else if (max >= ac->ac_g_ex.fe_len) {
2370 } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) {
2389 * to max order and tries to find big enough chunk to satisfy the req
2400 int max;
2407 buddy = mb_find_buddy(e4b, i, &max);
2412 k = mb_find_next_zero_bit(buddy, max, 0);
2413 if (k >= max) {
2539 int max;
2554 max = mb_find_extent(e4b, i, stripe, &ex);
2555 if (max >= stripe) {
3580 unsigned max;
3609 max = sb->s_blocksize << 2;
3612 sbi->s_mb_maxs[i] = max;
3615 max = max >> 1;
3682 sbi->s_mb_group_prealloc = max(MB_DEFAULT_GROUP_PREALLOC >>
4431 int bsbits, max;
4465 /* max size of free chunks */
4466 max = 2 << bsbits;
4468 #define NRL_CHECK_SIZE(req, size, max, chunk_size) \
4469 (req <= (size) || max <= (chunk_size))
4488 } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) {
4492 } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) {
4497 (8<<20)>>bsbits, max, 8 * 1024)) {
4515 start = max(start, rounddown(ac->ac_o_ex.fe_logical,
4959 /* The max size of hash table is PREALLOC_TB_SIZE */
5777 size = max(size, isize);
5950 /* The max size of hash table is PREALLOC_TB_SIZE */
6093 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
6114 i = mb_find_next_zero_bit(bitmap_bh->b_data, max,
6116 if (i >= max)
6126 if (i < max)
6135 if (i >= max) {
6940 ext4_grpblk_t max, ext4_grpblk_t minblocks)
6950 if (start == 0 && max >= last)
6953 start = max(e4b->bd_info->bb_first_free, start);
6957 while (start <= max) {
6958 start = mb_find_next_zero_bit(bitmap, max + 1, start);
6959 if (start > max)
7000 * @max: last group block to examine
7010 ext4_grpblk_t start, ext4_grpblk_t max,
7016 trace_ext4_trim_all_free(sb, group, start, max);
7029 ret = ext4_try_to_trim_range(sb, &e4b, start, max, minblocks);
7166 start = max(e4b.bd_info->bb_first_free, start);