Home
last modified time | relevance | path

Searched refs:next_free (Results 1 - 25 of 26) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/md/
H A Ddm-snap-transient.c23 sector_t next_free; member
45 if (size < (tc->next_free + store->chunk_size)) in transient_prepare_exception()
48 e->new_chunk = sector_to_chunk(store, tc->next_free); in transient_prepare_exception()
49 tc->next_free += store->chunk_size; in transient_prepare_exception()
68 *sectors_allocated = ((struct transient_c *) store->context)->next_free; in transient_usage()
81 tc->next_free = 0; in transient_ctr()
H A Ddm-snap-persistent.c151 chunk_t next_free; member
276 chunk_t next_free = ps->next_free; in skip_metadata() local
277 if (sector_div(next_free, stride) == NUM_SNAPSHOT_HDR_CHUNKS) in skip_metadata()
278 ps->next_free++; in skip_metadata()
472 if (ps->next_free <= e.new_chunk) in insert_exceptions()
473 ps->next_free = e.new_chunk + 1; in insert_exceptions()
575 *sectors_allocated = ps->next_free * store->chunk_size; in persistent_usage()
676 if (size < ((ps->next_free + 1) * store->chunk_size)) in persistent_prepare_exception()
679 e->new_chunk = ps->next_free; in persistent_prepare_exception()
[all...]
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-snap-transient.c26 sector_t next_free; member
48 if (size < (tc->next_free + store->chunk_size)) in transient_prepare_exception()
51 e->new_chunk = sector_to_chunk(store, tc->next_free); in transient_prepare_exception()
52 tc->next_free += store->chunk_size; in transient_prepare_exception()
71 *sectors_allocated = ((struct transient_c *) store->context)->next_free; in transient_usage()
84 tc->next_free = 0; in transient_ctr()
H A Ddm-snap-persistent.c154 chunk_t next_free; member
278 chunk_t next_free = ps->next_free; in skip_metadata() local
280 if (sector_div(next_free, stride) == NUM_SNAPSHOT_HDR_CHUNKS) in skip_metadata()
281 ps->next_free++; in skip_metadata()
474 if (ps->next_free <= e.new_chunk) in insert_exceptions()
475 ps->next_free = e.new_chunk + 1; in insert_exceptions()
580 *sectors_allocated = ps->next_free * store->chunk_size; in persistent_usage()
681 if (size < ((ps->next_free + 1) * store->chunk_size)) in persistent_prepare_exception()
684 e->new_chunk = ps->next_free; in persistent_prepare_exception()
[all...]
/kernel/linux/linux-5.10/arch/powerpc/kernel/
H A Drtas_flash.c315 int next_free, rc; in rtas_flash_write() local
336 next_free = fl->num_blocks; in rtas_flash_write()
337 if (next_free == FLASH_BLOCKS_PER_NODE) { in rtas_flash_write()
343 next_free = 0; in rtas_flash_write()
357 fl->blocks[next_free].data = p; in rtas_flash_write()
358 fl->blocks[next_free].length = count; in rtas_flash_write()
/kernel/linux/linux-6.6/arch/powerpc/kernel/
H A Drtas_flash.c315 int next_free, rc; in rtas_flash_write() local
336 next_free = fl->num_blocks; in rtas_flash_write()
337 if (next_free == FLASH_BLOCKS_PER_NODE) { in rtas_flash_write()
343 next_free = 0; in rtas_flash_write()
357 fl->blocks[next_free].data = p; in rtas_flash_write()
358 fl->blocks[next_free].length = count; in rtas_flash_write()
/kernel/linux/linux-5.10/fs/ocfs2/
H A Dalloc.c1597 int next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_shift_records_right() local
1601 BUG_ON(!next_free); in ocfs2_shift_records_right()
1603 BUG_ON(next_free >= count); in ocfs2_shift_records_right()
1605 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free; in ocfs2_shift_records_right()
1613 int i, insert_index, next_free, has_empty, num_bytes; in ocfs2_rotate_leaf() local
1617 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_rotate_leaf()
1620 BUG_ON(!next_free); in ocfs2_rotate_leaf()
1627 * empty extent and temporarily decrement next_free. in ocfs2_rotate_leaf()
1631 * If next_free was 1 (only an empty extent), this in ocfs2_rotate_leaf()
1635 for(i = 0; i < (next_free in ocfs2_rotate_leaf()
1714 int next_free = le16_to_cpu(el->l_next_free_rec); ocfs2_create_empty_extent() local
2312 int next_free; ocfs2_rotate_requires_path_adjustment() local
2325 int next_free = le16_to_cpu(el->l_next_free_rec); ocfs2_leftmost_rec_contains() local
2822 int next_free; ocfs2_find_cpos_for_right_leaf() local
3348 int ret, next_free, i; ocfs2_merge_rec_right() local
3954 int i, next_free; ocfs2_adjust_rightmost_records() local
3992 int ret, next_free; ocfs2_append_rec_to_path() local
5452 int next_free; ocfs2_truncate_rec() local
[all...]
H A Dresize.c416 u16 next_free = le16_to_cpu(di->id2.i_chain.cl_next_free_rec); in ocfs2_verify_group_and_input() local
425 else if (next_free != cl_count && next_free != input->chain) in ocfs2_verify_group_and_input()
427 "the add group should be in chain %u\n", next_free); in ocfs2_verify_group_and_input()
H A Dextent_map.c279 int ret, next_free; in ocfs2_last_eb_is_empty() local
303 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_last_eb_is_empty()
305 if (next_free == 0 || in ocfs2_last_eb_is_empty()
306 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) in ocfs2_last_eb_is_empty()
H A Docfs2_trace.h563 int has_empty, int next_free,
566 next_free, l_count),
571 __field(int, next_free)
578 __entry->next_free = next_free;
583 __entry->next_free, __entry->l_count)
/kernel/linux/linux-6.6/fs/ocfs2/
H A Dalloc.c1595 int next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_shift_records_right() local
1599 BUG_ON(!next_free); in ocfs2_shift_records_right()
1601 BUG_ON(next_free >= count); in ocfs2_shift_records_right()
1603 num_bytes = sizeof(struct ocfs2_extent_rec) * next_free; in ocfs2_shift_records_right()
1611 int i, insert_index, next_free, has_empty, num_bytes; in ocfs2_rotate_leaf() local
1615 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_rotate_leaf()
1618 BUG_ON(!next_free); in ocfs2_rotate_leaf()
1625 * empty extent and temporarily decrement next_free. in ocfs2_rotate_leaf()
1629 * If next_free was 1 (only an empty extent), this in ocfs2_rotate_leaf()
1633 for(i = 0; i < (next_free in ocfs2_rotate_leaf()
1712 int next_free = le16_to_cpu(el->l_next_free_rec); ocfs2_create_empty_extent() local
2310 int next_free; ocfs2_rotate_requires_path_adjustment() local
2323 int next_free = le16_to_cpu(el->l_next_free_rec); ocfs2_leftmost_rec_contains() local
2820 int next_free; ocfs2_find_cpos_for_right_leaf() local
3346 int ret, next_free, i; ocfs2_merge_rec_right() local
3952 int i, next_free; ocfs2_adjust_rightmost_records() local
3990 int ret, next_free; ocfs2_append_rec_to_path() local
5450 int next_free; ocfs2_truncate_rec() local
[all...]
H A Dresize.c414 u16 next_free = le16_to_cpu(di->id2.i_chain.cl_next_free_rec); in ocfs2_verify_group_and_input() local
423 else if (next_free != cl_count && next_free != input->chain) in ocfs2_verify_group_and_input()
425 "the add group should be in chain %u\n", next_free); in ocfs2_verify_group_and_input()
H A Dextent_map.c277 int ret, next_free; in ocfs2_last_eb_is_empty() local
301 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_last_eb_is_empty()
303 if (next_free == 0 || in ocfs2_last_eb_is_empty()
304 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) in ocfs2_last_eb_is_empty()
H A Docfs2_trace.h563 int has_empty, int next_free,
566 next_free, l_count),
571 __field(int, next_free)
578 __entry->next_free = next_free;
583 __entry->next_free, __entry->l_count)
/kernel/linux/linux-6.6/fs/ntfs3/
H A Dfsntfs.c696 if (sbi->mft.next_free < MFT_REC_USER) in ntfs_look_free_mft()
697 sbi->mft.next_free = MFT_REC_USER; in ntfs_look_free_mft()
700 if (sbi->mft.next_free >= sbi->mft.bitmap.nbits) { in ntfs_look_free_mft()
702 sbi->mft.next_free = sbi->mft.bitmap.nbits; in ntfs_look_free_mft()
705 sbi->mft.next_free = *rno + 1; in ntfs_look_free_mft()
757 else if (rno < sbi->mft.next_free && rno >= MFT_REC_USER) in ntfs_mark_rec_free()
758 sbi->mft.next_free = rno; in ntfs_mark_rec_free()
H A Dntfs_fs.h263 size_t next_free; // The next record to allocate from member
/kernel/linux/linux-5.10/fs/btrfs/
H A Dscrub.c98 int next_free; member
605 sctx->bios[i]->next_free = i + 1; in scrub_setup_ctx()
607 sctx->bios[i]->next_free = -1; in scrub_setup_ctx()
1980 sctx->first_free = sctx->bios[sctx->curr]->next_free; in scrub_add_page_to_rd_bio()
1981 sctx->bios[sctx->curr]->next_free = -1; in scrub_add_page_to_rd_bio()
2283 sbio->next_free = sctx->first_free; in scrub_bio_end_io_worker()
/kernel/linux/linux-5.10/drivers/net/ethernet/ibm/
H A Dibmvnic.c340 index = pool->free_map[pool->next_free]; in replenish_rx_pool()
352 pool->free_map[pool->next_free] = IBMVNIC_INVALID_MAP; in replenish_rx_pool()
381 pool->next_free = (pool->next_free + 1) % pool->size; in replenish_rx_pool()
389 pool->free_map[pool->next_free] = index; in replenish_rx_pool()
518 rx_pool->next_free = 0; in reset_rx_pools()
621 rx_pool->next_free = 0; in init_rx_pools()
H A Dibmvnic.h921 int next_free; member
/kernel/linux/linux-5.10/drivers/net/ethernet/mediatek/
H A Dmtk_eth_soc.h640 * @next_free: Pointer to the next free descriptor
650 struct mtk_tx_dma *next_free; member
H A Dmtk_eth_soc.c967 itxd = ring->next_free; in mtk_tx_map()
1079 ring->next_free = mtk_qdma_phys_to_virt(ring, txd->txd2); in mtk_tx_map()
1624 ring->next_free = &ring->dma[0]; in mtk_tx_alloc()
/kernel/linux/linux-6.6/drivers/net/ethernet/ibm/
H A Dibmvnic.c787 bufidx = pool->free_map[pool->next_free]; in replenish_rx_pool()
805 pool->free_map[pool->next_free] = IBMVNIC_INVALID_MAP; in replenish_rx_pool()
806 pool->next_free = (pool->next_free + 1) % pool->size; in replenish_rx_pool()
863 pool->next_free = pool->next_free == 0 ? in replenish_rx_pool()
864 pool->size - 1 : pool->next_free - 1; in replenish_rx_pool()
869 pool->free_map[pool->next_free] = bufidx; in replenish_rx_pool()
1152 rx_pool->next_free = 0; in init_rx_pools()
H A Dibmvnic.h875 int next_free; member
/kernel/linux/linux-6.6/drivers/net/ethernet/mediatek/
H A Dmtk_eth_soc.c1410 itxd = ring->next_free; in mtk_tx_map()
1498 ring->next_free = mtk_qdma_phys_to_virt(ring, txd->txd2); in mtk_tx_map()
1814 txd = ring->next_free; in mtk_xdp_submit_frame()
1865 ring->next_free = mtk_qdma_phys_to_virt(ring, txd->txd2); in mtk_xdp_submit_frame()
2508 ring->next_free = ring->dma; in mtk_tx_alloc()
H A Dmtk_eth_soc.h891 * @next_free: Pointer to the next free descriptor
902 struct mtk_tx_dma *next_free; member

Completed in 64 milliseconds

12