next_free 315 arch/powerpc/kernel/rtas_flash.c int next_free, rc; next_free 336 arch/powerpc/kernel/rtas_flash.c next_free = fl->num_blocks; next_free 337 arch/powerpc/kernel/rtas_flash.c if (next_free == FLASH_BLOCKS_PER_NODE) { next_free 343 arch/powerpc/kernel/rtas_flash.c next_free = 0; next_free 357 arch/powerpc/kernel/rtas_flash.c fl->blocks[next_free].data = p; next_free 358 arch/powerpc/kernel/rtas_flash.c fl->blocks[next_free].length = count; next_free 151 drivers/md/dm-snap-persistent.c chunk_t next_free; next_free 276 drivers/md/dm-snap-persistent.c chunk_t next_free = ps->next_free; next_free 277 drivers/md/dm-snap-persistent.c if (sector_div(next_free, stride) == NUM_SNAPSHOT_HDR_CHUNKS) next_free 278 drivers/md/dm-snap-persistent.c ps->next_free++; next_free 479 drivers/md/dm-snap-persistent.c if (ps->next_free <= e.new_chunk) next_free 480 drivers/md/dm-snap-persistent.c ps->next_free = e.new_chunk + 1; next_free 582 drivers/md/dm-snap-persistent.c *sectors_allocated = ps->next_free * store->chunk_size; next_free 683 drivers/md/dm-snap-persistent.c if (size < ((ps->next_free + 1) * store->chunk_size)) next_free 686 drivers/md/dm-snap-persistent.c e->new_chunk = ps->next_free; next_free 692 drivers/md/dm-snap-persistent.c ps->next_free++; next_free 838 drivers/md/dm-snap-persistent.c ps->next_free = area_location(ps, ps->current_area) + next_free 869 drivers/md/dm-snap-persistent.c ps->next_free = NUM_SNAPSHOT_HDR_CHUNKS + 1; /* header and 1st area */ next_free 23 drivers/md/dm-snap-transient.c sector_t next_free; next_free 45 drivers/md/dm-snap-transient.c if (size < (tc->next_free + store->chunk_size)) next_free 48 drivers/md/dm-snap-transient.c e->new_chunk = sector_to_chunk(store, tc->next_free); next_free 49 drivers/md/dm-snap-transient.c tc->next_free += store->chunk_size; next_free 68 drivers/md/dm-snap-transient.c *sectors_allocated = ((struct transient_c *) store->context)->next_free; next_free 81 drivers/md/dm-snap-transient.c tc->next_free = 0; next_free 274 drivers/net/ethernet/ibm/ibmvnic.c index = pool->free_map[pool->next_free]; next_free 286 drivers/net/ethernet/ibm/ibmvnic.c pool->free_map[pool->next_free] = IBMVNIC_INVALID_MAP; next_free 316 drivers/net/ethernet/ibm/ibmvnic.c pool->next_free = (pool->next_free + 1) % pool->size; next_free 324 drivers/net/ethernet/ibm/ibmvnic.c pool->free_map[pool->next_free] = index; next_free 451 drivers/net/ethernet/ibm/ibmvnic.c rx_pool->next_free = 0; next_free 556 drivers/net/ethernet/ibm/ibmvnic.c rx_pool->next_free = 0; next_free 925 drivers/net/ethernet/ibm/ibmvnic.h int next_free; next_free 921 drivers/net/ethernet/mediatek/mtk_eth_soc.c itxd = ring->next_free; next_free 1033 drivers/net/ethernet/mediatek/mtk_eth_soc.c ring->next_free = mtk_qdma_phys_to_virt(ring, txd->txd2); next_free 1575 drivers/net/ethernet/mediatek/mtk_eth_soc.c ring->next_free = &ring->dma[0]; next_free 626 drivers/net/ethernet/mediatek/mtk_eth_soc.h struct mtk_tx_dma *next_free; next_free 97 fs/btrfs/scrub.c int next_free; next_free 605 fs/btrfs/scrub.c sctx->bios[i]->next_free = i + 1; next_free 607 fs/btrfs/scrub.c sctx->bios[i]->next_free = -1; next_free 2048 fs/btrfs/scrub.c sctx->first_free = sctx->bios[sctx->curr]->next_free; next_free 2049 fs/btrfs/scrub.c sctx->bios[sctx->curr]->next_free = -1; next_free 2351 fs/btrfs/scrub.c sbio->next_free = sctx->first_free; next_free 1598 fs/ocfs2/alloc.c int next_free = le16_to_cpu(el->l_next_free_rec); next_free 1602 fs/ocfs2/alloc.c BUG_ON(!next_free); next_free 1604 fs/ocfs2/alloc.c BUG_ON(next_free >= count); next_free 1606 fs/ocfs2/alloc.c num_bytes = sizeof(struct ocfs2_extent_rec) * next_free; next_free 1614 fs/ocfs2/alloc.c int i, insert_index, next_free, has_empty, num_bytes; next_free 1618 fs/ocfs2/alloc.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 1621 fs/ocfs2/alloc.c BUG_ON(!next_free); next_free 1636 fs/ocfs2/alloc.c for(i = 0; i < (next_free - 1); i++) next_free 1639 fs/ocfs2/alloc.c next_free--; next_free 1645 fs/ocfs2/alloc.c for(i = 0; i < next_free; i++) { next_free 1654 fs/ocfs2/alloc.c has_empty, next_free, next_free 1659 fs/ocfs2/alloc.c BUG_ON(insert_index > next_free); next_free 1664 fs/ocfs2/alloc.c if (insert_index != next_free) { next_free 1665 fs/ocfs2/alloc.c BUG_ON(next_free >= le16_to_cpu(el->l_count)); next_free 1667 fs/ocfs2/alloc.c num_bytes = next_free - insert_index; next_free 1679 fs/ocfs2/alloc.c next_free++; next_free 1680 fs/ocfs2/alloc.c el->l_next_free_rec = cpu_to_le16(next_free); next_free 1715 fs/ocfs2/alloc.c int next_free = le16_to_cpu(el->l_next_free_rec); next_free 1719 fs/ocfs2/alloc.c if (next_free == 0) next_free 2313 fs/ocfs2/alloc.c int next_free; next_free 2316 fs/ocfs2/alloc.c next_free = le16_to_cpu(left_el->l_next_free_rec); next_free 2317 fs/ocfs2/alloc.c rec = &left_el->l_recs[next_free - 1]; next_free 2326 fs/ocfs2/alloc.c int next_free = le16_to_cpu(el->l_next_free_rec); next_free 2330 fs/ocfs2/alloc.c if (next_free == 0) next_free 2336 fs/ocfs2/alloc.c if (next_free == 1) next_free 2823 fs/ocfs2/alloc.c int next_free; next_free 2831 fs/ocfs2/alloc.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 2834 fs/ocfs2/alloc.c if (j == (next_free - 1)) { next_free 3349 fs/ocfs2/alloc.c int ret, next_free, i; next_free 3373 fs/ocfs2/alloc.c next_free = le16_to_cpu(right_el->l_next_free_rec); next_free 3374 fs/ocfs2/alloc.c BUG_ON(next_free <= 0); next_free 3377 fs/ocfs2/alloc.c BUG_ON(next_free <= 1); next_free 3955 fs/ocfs2/alloc.c int i, next_free; next_free 3967 fs/ocfs2/alloc.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 3968 fs/ocfs2/alloc.c if (next_free == 0) { next_free 3975 fs/ocfs2/alloc.c rec = &el->l_recs[next_free - 1]; next_free 3993 fs/ocfs2/alloc.c int ret, next_free; next_free 4011 fs/ocfs2/alloc.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 4012 fs/ocfs2/alloc.c if (next_free == 0 || next_free 4013 fs/ocfs2/alloc.c (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) { next_free 5453 fs/ocfs2/alloc.c int next_free; next_free 5458 fs/ocfs2/alloc.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 5459 fs/ocfs2/alloc.c if (is_rightmost_tree_rec && next_free > 1) { next_free 5464 fs/ocfs2/alloc.c rec = &el->l_recs[next_free - 1]; next_free 279 fs/ocfs2/extent_map.c int ret, next_free; next_free 303 fs/ocfs2/extent_map.c next_free = le16_to_cpu(el->l_next_free_rec); next_free 305 fs/ocfs2/extent_map.c if (next_free == 0 || next_free 306 fs/ocfs2/extent_map.c (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) next_free 563 fs/ocfs2/ocfs2_trace.h int has_empty, int next_free, next_free 566 fs/ocfs2/ocfs2_trace.h next_free, l_count), next_free 571 fs/ocfs2/ocfs2_trace.h __field(int, next_free) next_free 578 fs/ocfs2/ocfs2_trace.h __entry->next_free = next_free; next_free 583 fs/ocfs2/ocfs2_trace.h __entry->next_free, __entry->l_count) next_free 416 fs/ocfs2/resize.c u16 next_free = le16_to_cpu(di->id2.i_chain.cl_next_free_rec); next_free 425 fs/ocfs2/resize.c else if (next_free != cl_count && next_free != input->chain) next_free 427 fs/ocfs2/resize.c "the add group should be in chain %u\n", next_free);