Lines Matching defs:max
36 * - track min/max extents in each group for better group selection
426 static inline int mb_find_next_zero_bit(void *addr, int max, int start)
430 tmpmax = max + fix;
434 if (ret > max)
435 return max;
439 static inline int mb_find_next_bit(void *addr, int max, int start)
443 tmpmax = max + fix;
447 if (ret > max)
448 return max;
452 static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max)
457 BUG_ON(max == NULL);
460 *max = 0;
466 *max = 1 << (e4b->bd_blkbits + 3);
471 *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order];
610 int max;
627 buddy = mb_find_buddy(e4b, order, &max);
632 MB_CHECK_ASSERT(max * 2 == max2);
635 for (i = 0; i < max; i++) {
665 buddy = mb_find_buddy(e4b, 0, &max);
666 for (i = 0; i < max; i++) {
720 ext4_grpblk_t max;
730 max = ffs(first | border) - 1;
735 if (max < min)
736 min = max;
777 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
787 i = mb_find_next_zero_bit(bitmap, max, 0);
789 while (i < max) {
792 i = mb_find_next_bit(bitmap, max, i);
799 if (i < max)
800 i = mb_find_next_zero_bit(bitmap, max, i);
1422 int max;
1424 void *buddy = mb_find_buddy(e4b, order, &max);
1466 if (first == last || !(buddy2 = mb_find_buddy(e4b, order, &max))) {
1565 int max, order;
1571 buddy = mb_find_buddy(e4b, 0, &max);
1573 BUG_ON(block >= max);
1595 mb_find_buddy(e4b, order, &max)) {
1597 if (block + 1 >= max)
1629 int max = 0;
1652 max = !mb_test_bit(start + len, e4b->bd_bitmap);
1653 if (mlen && max)
1655 else if (!mlen && !max)
1665 buddy = mb_find_buddy(e4b, ord, &max);
1666 BUG_ON((start >> ord) >= max);
1681 buddy = mb_find_buddy(e4b, ord, &max);
1687 buddy = mb_find_buddy(e4b, ord, &max);
1761 int max;
1785 max = mb_find_extent(e4b, bex->fe_start, gex->fe_len, &ex);
1786 if (max >= gex->fe_len) {
1868 int max;
1880 max = mb_find_extent(e4b, ex.fe_start, ex.fe_len, &ex);
1882 if (max > 0) {
1899 int max;
1920 max = mb_find_extent(e4b, ac->ac_g_ex.fe_start,
1924 if (max >= ac->ac_g_ex.fe_len && ac->ac_g_ex.fe_len == sbi->s_stripe) {
1935 } else if (max >= ac->ac_g_ex.fe_len) {
1942 } else if (max > 0 && (ac->ac_flags & EXT4_MB_HINT_MERGE)) {
1961 * to max order and tries to find big enough chunk to satisfy the req
1972 int max;
1979 buddy = mb_find_buddy(e4b, i, &max);
1982 k = mb_find_next_zero_bit(buddy, max, 0);
1983 if (k >= max) {
2090 int max;
2103 max = mb_find_extent(e4b, i, sbi->s_stripe, &ex);
2104 if (max >= sbi->s_stripe) {
2932 unsigned max;
2961 max = sb->s_blocksize << 2;
2964 sbi->s_mb_maxs[i] = max;
2967 max = max >> 1;
2993 sbi->s_mb_group_prealloc = max(MB_DEFAULT_GROUP_PREALLOC >>
3540 int bsbits, max;
3576 /* max size of free chunks */
3577 max = 2 << bsbits;
3579 #define NRL_CHECK_SIZE(req, size, max, chunk_size) \
3580 (req <= (size) || max <= (chunk_size))
3599 } else if (NRL_CHECK_SIZE(size, 4 * 1024 * 1024, max, 2 * 1024)) {
3603 } else if (NRL_CHECK_SIZE(size, 8 * 1024 * 1024, max, 4 * 1024)) {
3608 (8<<20)>>bsbits, max, 8 * 1024)) {
3626 start = max(start, rounddown(ac->ac_o_ex.fe_logical,
3945 /* The max size of hash table is PREALLOC_TB_SIZE */
4743 size = max(size, isize);
4912 /* The max size of hash table is PREALLOC_TB_SIZE */
5343 ext4_grpblk_t max = EXT4_CLUSTERS_PER_GROUP(sb);
5364 max(ext4_group_first_block_no(sb, group), goal),
5367 i = mb_find_next_zero_bit(bitmap_bh->b_data, max,
5369 if (i >= max)
5378 if (i < max)
5382 if (group >= ext4_get_groups_count(sb) || i >= max) {
5940 ext4_grpblk_t max, ext4_grpblk_t minblocks)
5948 if (start == 0 && max >= last)
5951 start = max(e4b->bd_info->bb_first_free, start);
5955 while (start <= max) {
5956 start = mb_find_next_zero_bit(bitmap, max + 1, start);
5957 if (start > max)
5998 * @max: last group block to examine
6013 ext4_grpblk_t start, ext4_grpblk_t max,
6019 trace_ext4_trim_all_free(sb, group, start, max);
6032 ret = ext4_try_to_trim_range(sb, &e4b, start, max, minblocks);
6169 start = max(e4b.bd_info->bb_first_free, start);