Searched refs:xfs_da_state_blk_t (Results 1 – 5 of 5) sorted by relevance
| /fs/xfs/libxfs/ |
| D | xfs_da_btree.h | 121 } xfs_da_state_blk_t; typedef
125 xfs_da_state_blk_t blk[XFS_DA_NODE_MAXDEPTH];
136 xfs_da_state_blk_t extrablk; /* for double-splits on leaves */
185 int xfs_da3_blk_link(xfs_da_state_t *state, xfs_da_state_blk_t *old_blk,
186 xfs_da_state_blk_t *new_blk);
|
| D | xfs_dir2_node.c | 44 xfs_da_state_blk_t *blk1,
45 xfs_da_state_blk_t *blk2);
47 int index, xfs_da_state_blk_t *dblk,
50 xfs_da_state_blk_t *fblk);
999 xfs_da_state_blk_t *blk1, /* first btree block */ in xfs_dir2_leafn_rebalance()
1000 xfs_da_state_blk_t *blk2) /* second btree block */ in xfs_dir2_leafn_rebalance()
1024 xfs_da_state_blk_t *tmp; /* temp for block swap */ in xfs_dir2_leafn_rebalance()
1206 xfs_da_state_blk_t *dblk, /* data block */ in xfs_dir2_leafn_remove()
1363 xfs_da_state_blk_t *oldblk, /* original block */ in xfs_dir2_leafn_split()
1364 xfs_da_state_blk_t *newblk) /* newly created block */ in xfs_dir2_leafn_split()
[all …]
|
| D | xfs_da_btree.c | 58 xfs_da_state_blk_t *existing_root,
59 xfs_da_state_blk_t *new_child);
61 xfs_da_state_blk_t *existing_blk,
62 xfs_da_state_blk_t *split_blk,
63 xfs_da_state_blk_t *blk_to_add,
67 xfs_da_state_blk_t *node_blk_1,
68 xfs_da_state_blk_t *node_blk_2);
70 xfs_da_state_blk_t *old_node_blk,
71 xfs_da_state_blk_t *new_node_blk);
77 xfs_da_state_blk_t *root_blk);
[all …]
|
| D | xfs_attr.c | 834 xfs_da_state_blk_t *blk; in xfs_attr_node_addname()
1070 xfs_da_state_blk_t *blk; in xfs_attr_node_removename()
1210 xfs_da_state_blk_t *blk; in xfs_attr_fillstate()
1258 xfs_da_state_blk_t *blk; in xfs_attr_refillstate()
1315 xfs_da_state_blk_t *blk; in xfs_attr_node_get()
|
| D | xfs_attr_leaf.c | 69 xfs_da_state_blk_t *blk1,
70 xfs_da_state_blk_t *blk2);
72 xfs_da_state_blk_t *leaf_blk_1,
74 xfs_da_state_blk_t *leaf_blk_2,
|