Home
last modified time | relevance | path

Searched refs:next_free (Results 1 – 15 of 15) sorted by relevance

/openbmc/linux/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()
690 ps->next_free++; in persistent_prepare_exception()
[all …]
/openbmc/qemu/hw/ipmi/
H A Dipmi_bmc_sim.c114 unsigned int next_free; member
126 unsigned int next_free; member
329 (struct ipmi_sdr_header *) &ibs->sdr.sdr[ibs->sdr.next_free]; in sdr_add_entry()
339 if (ibs->sdr.next_free + len > MAX_SDR_SIZE) { in sdr_add_entry()
354 ibs->sdr.next_free += len; in sdr_add_entry()
364 while (pos < sdr->next_free) { in sdr_find_entry()
372 if (nextpos >= sdr->next_free) { in sdr_find_entry()
422 if (ibs->sel.next_free == MAX_SEL_SIZE) { in sel_add_event()
426 event[0] = ibs->sel.next_free & 0xff; in sel_add_event()
427 event[1] = (ibs->sel.next_free >> 8) & 0xff; in sel_add_event()
[all …]
/openbmc/linux/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()
/openbmc/linux/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()
1633 for(i = 0; i < (next_free - 1); i++) in ocfs2_rotate_leaf()
1636 next_free--; in ocfs2_rotate_leaf()
1642 for(i = 0; i < next_free; i++) { in ocfs2_rotate_leaf()
[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)
/openbmc/linux/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
H A Dsuper.c1311 sbi->mft.next_free = MFT_REC_USER; in ntfs_fill_super()
/openbmc/linux/drivers/net/ethernet/ibm/
H A Dibmvnic.c788 bufidx = pool->free_map[pool->next_free]; in replenish_rx_pool()
806 pool->free_map[pool->next_free] = IBMVNIC_INVALID_MAP; in replenish_rx_pool()
807 pool->next_free = (pool->next_free + 1) % pool->size; in replenish_rx_pool()
864 pool->next_free = pool->next_free == 0 ? in replenish_rx_pool()
865 pool->size - 1 : pool->next_free - 1; in replenish_rx_pool()
870 pool->free_map[pool->next_free] = bufidx; in replenish_rx_pool()
1153 rx_pool->next_free = 0; in init_rx_pools()
H A Dibmvnic.h876 int next_free; member
/openbmc/linux/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.h902 struct mtk_tx_dma *next_free; member