Lines Matching refs:bb_free
151 * is computed as ext4_group_info->bb_free / ext4_group_info->bb_fragments.
850 grp->bb_free / grp->bb_fragments);
1138 * rb tree sorted by bb_free. But until that happens, we should
1173 if (grp->bb_largest_free_order >= 0 && grp->bb_free) {
1216 if (free != grp->bb_free) {
1220 free, grp->bb_free);
1223 * corrupt and update bb_free using bitmap value
1225 grp->bb_free = free;
1953 e4b->bd_info->bb_free += count;
2065 e4b->bd_info->bb_free -= len;
2343 if (grp->bb_free == 0)
2461 free = e4b->bd_info->bb_free;
2591 free = grp->bb_free;
2666 free = grp->bb_free;
3072 seq_printf(seq, "#%-5u: %-5u %-5u %-5u [", group, sg.info.bb_free,
3365 * initialize bb_free to be able to skip
3370 meta_group_info[i]->bb_free =
3373 meta_group_info[i]->bb_free =
5500 mb_debug(sb, "discarded (%d) blocks preallocated for group %u bb_free (%d)\n",
5501 free, group, grp->bb_free);
5681 mb_debug(sb, "%u: %d/%d\n", i, grp->bb_free,
6838 if ((e4b->bd_info->bb_free - free_count) < minblocks)
6972 if (grp->bb_free >= minlen) {