Home
last modified time | relevance | path

Searched refs:blk2 (Results 1 - 11 of 11) sorted by relevance

/kernel/linux/linux-5.10/arch/powerpc/lib/
H A Drheap.c614 rh_block_t *blk, *blk2; in rh_free() local
621 blk2 = list_entry(l, rh_block_t, list); in rh_free()
622 if (start < blk2->start) in rh_free()
624 blk = blk2; in rh_free()
681 rh_block_t *blk, *blk2; in rh_set_owner() local
688 blk2 = list_entry(l, rh_block_t, list); in rh_set_owner()
689 if (start < blk2->start) in rh_set_owner()
691 blk = blk2; in rh_set_owner()
/kernel/linux/linux-6.6/arch/powerpc/lib/
H A Drheap.c614 rh_block_t *blk, *blk2; in rh_free() local
621 blk2 = list_entry(l, rh_block_t, list); in rh_free()
622 if (start < blk2->start) in rh_free()
624 blk = blk2; in rh_free()
681 rh_block_t *blk, *blk2; in rh_set_owner() local
688 blk2 = list_entry(l, rh_block_t, list); in rh_set_owner()
689 if (start < blk2->start) in rh_set_owner()
691 blk = blk2; in rh_set_owner()
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c55 xfs_da_state_blk_t *blk2);
1669 struct xfs_da_state_blk *blk2) in xfs_attr3_leaf_rebalance()
1688 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); in xfs_attr3_leaf_rebalance()
1690 leaf2 = blk2->bp->b_addr; in xfs_attr3_leaf_rebalance()
1705 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { in xfs_attr3_leaf_rebalance()
1706 swap(blk1, blk2); in xfs_attr3_leaf_rebalance()
1712 leaf2 = blk2->bp->b_addr; in xfs_attr3_leaf_rebalance()
1725 blk2, &ichdr2, in xfs_attr3_leaf_rebalance()
1748 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); in xfs_attr3_leaf_rebalance()
1789 xfs_trans_log_buf(args->trans, blk2 in xfs_attr3_leaf_rebalance()
1666 xfs_attr3_leaf_rebalance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_attr3_leaf_rebalance() argument
1856 xfs_attr3_leaf_figure_balance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_attr3_icleaf_hdr *ichdr1, struct xfs_da_state_blk *blk2, struct xfs_attr3_icleaf_hdr *ichdr2, int *countarg, int *usedbytesarg) xfs_attr3_leaf_figure_balance() argument
[all...]
H A Dxfs_dir2_node.c31 xfs_da_state_blk_t *blk2);
1064 xfs_da_state_blk_t *blk2) /* second btree block */ in xfs_dir2_leafn_rebalance()
1087 swap_blocks = xfs_dir2_leafn_order(dp, blk1->bp, blk2->bp); in xfs_dir2_leafn_rebalance()
1089 swap(blk1, blk2); in xfs_dir2_leafn_rebalance()
1092 leaf2 = blk2->bp->b_addr; in xfs_dir2_leafn_rebalance()
1131 hdr1.count - count, blk2->bp, in xfs_dir2_leafn_rebalance()
1134 xfs_dir3_leafn_moveents(args, blk2->bp, &hdr2, ents2, 0, in xfs_dir2_leafn_rebalance()
1145 xfs_dir3_leaf_log_header(args, blk2->bp); in xfs_dir2_leafn_rebalance()
1148 xfs_dir3_leaf_check(dp, blk2->bp); in xfs_dir2_leafn_rebalance()
1163 blk2 in xfs_dir2_leafn_rebalance()
1061 xfs_dir2_leafn_rebalance( xfs_da_state_t *state, xfs_da_state_blk_t *blk1, xfs_da_state_blk_t *blk2) xfs_dir2_leafn_rebalance() argument
[all...]
H A Dxfs_da_btree.c636 struct xfs_da_state_blk *blk2) in xfs_da3_root_split()
737 btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da3_root_split()
738 btree[1].before = cpu_to_be32(blk2->blkno); in xfs_da3_root_split()
747 ASSERT(blk2->blkno >= args->geo->leafblk && in xfs_da3_root_split()
748 blk2->blkno < args->geo->freeblk); in xfs_da3_root_split()
857 * NOTE: if blk2 is empty, then it will get the upper half of blk1.
863 struct xfs_da_state_blk *blk2) in xfs_da3_node_rebalance()
883 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
971 xfs_trans_log_buf(tp, blk2->bp, in xfs_da3_node_rebalance()
982 node2 = blk2 in xfs_da3_node_rebalance()
633 xfs_da3_root_split( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_da3_root_split() argument
860 xfs_da3_node_rebalance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_da3_node_rebalance() argument
[all...]
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_attr_leaf.c57 xfs_da_state_blk_t *blk2);
1715 struct xfs_da_state_blk *blk2) in xfs_attr3_leaf_rebalance()
1734 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC); in xfs_attr3_leaf_rebalance()
1736 leaf2 = blk2->bp->b_addr; in xfs_attr3_leaf_rebalance()
1751 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) { in xfs_attr3_leaf_rebalance()
1752 swap(blk1, blk2); in xfs_attr3_leaf_rebalance()
1758 leaf2 = blk2->bp->b_addr; in xfs_attr3_leaf_rebalance()
1771 blk2, &ichdr2, in xfs_attr3_leaf_rebalance()
1794 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp); in xfs_attr3_leaf_rebalance()
1835 xfs_trans_log_buf(args->trans, blk2 in xfs_attr3_leaf_rebalance()
1712 xfs_attr3_leaf_rebalance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_attr3_leaf_rebalance() argument
1902 xfs_attr3_leaf_figure_balance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_attr3_icleaf_hdr *ichdr1, struct xfs_da_state_blk *blk2, struct xfs_attr3_icleaf_hdr *ichdr2, int *countarg, int *usedbytesarg) xfs_attr3_leaf_figure_balance() argument
[all...]
H A Dxfs_dir2_node.c31 xfs_da_state_blk_t *blk2);
1064 xfs_da_state_blk_t *blk2) /* second btree block */ in xfs_dir2_leafn_rebalance()
1087 swap_blocks = xfs_dir2_leafn_order(dp, blk1->bp, blk2->bp); in xfs_dir2_leafn_rebalance()
1089 swap(blk1, blk2); in xfs_dir2_leafn_rebalance()
1092 leaf2 = blk2->bp->b_addr; in xfs_dir2_leafn_rebalance()
1131 hdr1.count - count, blk2->bp, in xfs_dir2_leafn_rebalance()
1134 xfs_dir3_leafn_moveents(args, blk2->bp, &hdr2, ents2, 0, in xfs_dir2_leafn_rebalance()
1145 xfs_dir3_leaf_log_header(args, blk2->bp); in xfs_dir2_leafn_rebalance()
1148 xfs_dir3_leaf_check(dp, blk2->bp); in xfs_dir2_leafn_rebalance()
1163 blk2 in xfs_dir2_leafn_rebalance()
1061 xfs_dir2_leafn_rebalance( xfs_da_state_t *state, xfs_da_state_blk_t *blk1, xfs_da_state_blk_t *blk2) xfs_dir2_leafn_rebalance() argument
[all...]
H A Dxfs_da_btree.c651 struct xfs_da_state_blk *blk2) in xfs_da3_root_split()
752 btree[1].hashval = cpu_to_be32(blk2->hashval); in xfs_da3_root_split()
753 btree[1].before = cpu_to_be32(blk2->blkno); in xfs_da3_root_split()
762 ASSERT(blk2->blkno >= args->geo->leafblk && in xfs_da3_root_split()
763 blk2->blkno < args->geo->freeblk); in xfs_da3_root_split()
872 * NOTE: if blk2 is empty, then it will get the upper half of blk1.
878 struct xfs_da_state_blk *blk2) in xfs_da3_node_rebalance()
897 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
983 xfs_trans_log_buf(tp, blk2->bp, in xfs_da3_node_rebalance()
994 node2 = blk2 in xfs_da3_node_rebalance()
648 xfs_da3_root_split( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_da3_root_split() argument
875 xfs_da3_node_rebalance( struct xfs_da_state *state, struct xfs_da_state_blk *blk1, struct xfs_da_state_blk *blk2) xfs_da3_node_rebalance() argument
[all...]
/kernel/liteos_a/fs/rootfs/
H A Dlos_rootfs.c130 INT32 blk2 = 2; in AddPartitions() local
138 ret = add_mtd_partition(FLASH_TYPE, userAddr, userSize, blk2); in AddPartitions()
/kernel/linux/linux-6.6/fs/xfs/
H A Dxfs_log_recover.c32 #define BLK_AVG(blk1, blk2) ((blk1+blk2) >> 1)
/kernel/linux/linux-5.10/fs/xfs/
H A Dxfs_log_recover.c29 #define BLK_AVG(blk1, blk2) ((blk1+blk2) >> 1)

Completed in 24 milliseconds