Lines Matching defs:fab
118 struct xrep_find_ag_btree *fab)
123 return xfs_verify_agbno(mp, agno, fab->root) &&
124 fab->height <= XFS_BTREE_MAXLEVELS;
128 * Given the btree roots described by *fab, find the roots, check them for
129 * sanity, and pass the root data back out via *fab.
140 struct xrep_find_ag_btree *fab,
147 error = xrep_find_ag_btree_roots(sc, agf_bp, fab, agfl_bp);
152 if (!xrep_check_btree_root(sc, &fab[XREP_AGF_BNOBT]) ||
153 !xrep_check_btree_root(sc, &fab[XREP_AGF_CNTBT]) ||
154 !xrep_check_btree_root(sc, &fab[XREP_AGF_RMAPBT]))
161 if (fab[XREP_AGF_RMAPBT].root !=
167 !xrep_check_btree_root(sc, &fab[XREP_AGF_REFCOUNTBT]))
208 struct xrep_find_ag_btree *fab)
211 cpu_to_be32(fab[XREP_AGF_BNOBT].root);
213 cpu_to_be32(fab[XREP_AGF_BNOBT].height);
216 cpu_to_be32(fab[XREP_AGF_CNTBT].root);
218 cpu_to_be32(fab[XREP_AGF_CNTBT].height);
221 cpu_to_be32(fab[XREP_AGF_RMAPBT].root);
223 cpu_to_be32(fab[XREP_AGF_RMAPBT].height);
227 cpu_to_be32(fab[XREP_AGF_REFCOUNTBT].root);
229 cpu_to_be32(fab[XREP_AGF_REFCOUNTBT].height);
336 struct xrep_find_ag_btree fab[XREP_AGF_MAX] = {
407 error = xrep_agf_find_btrees(sc, agf_bp, fab, agfl_bp);
413 xrep_agf_set_roots(sc, agf, fab);
712 * Given the inode btree roots described by *fab, find the roots, check them
713 * for sanity, and pass the root data back out via *fab.
718 struct xrep_find_ag_btree *fab)
730 error = xrep_find_ag_btree_roots(sc, agf_bp, fab, NULL);
735 if (!xrep_check_btree_root(sc, &fab[XREP_AGI_INOBT]))
740 !xrep_check_btree_root(sc, &fab[XREP_AGI_FINOBT]))
784 struct xrep_find_ag_btree *fab)
786 agi->agi_root = cpu_to_be32(fab[XREP_AGI_INOBT].root);
787 agi->agi_level = cpu_to_be32(fab[XREP_AGI_INOBT].height);
790 agi->agi_free_root = cpu_to_be32(fab[XREP_AGI_FINOBT].root);
791 agi->agi_free_level = cpu_to_be32(fab[XREP_AGI_FINOBT].height);
877 struct xrep_find_ag_btree fab[XREP_AGI_MAX] = {
914 error = xrep_agi_find_btrees(sc, fab);
920 xrep_agi_set_roots(sc, agi, fab);