Lines Matching refs:order
143 * 2 blocks and the order of allocation is >= sbi->s_mb_order2_reqs. The
409 static void *mb_find_buddy(struct ext4_buddy *e4b, int order, int *max)
416 if (order > e4b->bd_blkbits + 1) {
421 /* at order 0 we see each particular block */
423 if (order == 0)
426 bb = EXT4_MB_BUDDY(e4b) + EXT4_SB(e4b->bd_sb)->s_mb_offsets[order];
427 *max = EXT4_SB(e4b->bd_sb)->s_mb_maxs[order];
524 int order = e4b->bd_blkbits + 1;
544 while (order > 1) {
545 buddy = mb_find_buddy(e4b, order, &max);
547 buddy2 = mb_find_buddy(e4b, order - 1, &max2);
571 for (j = 0; j < (1 << order); j++) {
572 k = (i * (1 << order)) + j;
578 MB_CHECK_ASSERT(e4b->bd_info->bb_counters[order] == count);
579 order--;
662 * Cache the order of the largest free extent we have available in this block
1204 int order = 1;
1211 while (order <= e4b->bd_blkbits + 1) {
1214 /* this block is part of buddy of order 'order' */
1215 return order;
1217 bb += 1 << (e4b->bd_blkbits - order);
1218 order++;
1264 int order;
1291 order = 0;
1305 e4b->bd_info->bb_counters[order]++;
1308 buddy = mb_find_buddy(e4b, order, &max);
1317 buddy2 = mb_find_buddy(e4b, order + 1, &max);
1322 if (order > 0) {
1328 e4b->bd_info->bb_counters[order]--;
1329 e4b->bd_info->bb_counters[order]--;
1332 order++;
1333 e4b->bd_info->bb_counters[order]++;
1343 static int mb_find_extent(struct ext4_buddy *e4b, int order, int block,
1354 buddy = mb_find_buddy(e4b, order, &max);
1364 if (likely(order == 0)) {
1365 /* find actual order */
1366 order = mb_find_order_for_block(e4b, block);
1367 block = block >> order;
1370 ex->fe_len = 1 << order;
1371 ex->fe_start = block << order;
1380 (buddy = mb_find_buddy(e4b, order, &max))) {
1385 next = (block + 1) * (1 << order);
1391 order = ord;
1392 block = next >> order;
1393 ex->fe_len += 1 << order;
1709 * The routine scans buddy structures (not bitmap!) from given order
1710 * to max order and tries to find big enough chunk to satisfy the req
1753 * In order to optimize scanning, caller must pass number of
2019 * We search using buddy data only if the order of the request
2412 /* order 0 is regular bitmap */
2981 /* define goal start in order to merge */
3129 int order, i;
3176 order = fls(ac->ac_o_ex.fe_len) - 1;
3177 if (order > PREALLOC_TB_SIZE - 1)
3179 order = PREALLOC_TB_SIZE - 1;
3186 for (i = order; i < PREALLOC_TB_SIZE; i++) {
4013 int order, int total_entries)
4029 list_for_each_entry_rcu(pa, &lg->lg_prealloc_list[order],
4100 int order, added = 0, lg_prealloc_count = 1;
4105 order = fls(pa->pa_free) - 1;
4106 if (order > PREALLOC_TB_SIZE - 1)
4108 order = PREALLOC_TB_SIZE - 1;
4111 list_for_each_entry_rcu(tmp_pa, &lg->lg_prealloc_list[order],
4133 &lg->lg_prealloc_list[order]);
4139 order, lg_prealloc_count);