Lines Matching defs:before
183 state->extraafter = 0; /* before newblk */
349 node->btree[0].before = cpu_to_be32(blk1->blkno);
351 node->btree[1].before = cpu_to_be32(blk2->blkno);
589 * We may need to make some room before we insert the new node.
598 btree->before = cpu_to_be32(newblk->blkno);
731 child = be32_to_cpu(oldroot->btree[0].before);
1126 blkno = be32_to_cpu(node->btree[max-1].before);
1129 blkno = be32_to_cpu(btree->before);
1190 int before=0, error;
1209 before = xfs_attr_leaf_order(old_blk->bp, new_blk->bp);
1212 before = xfs_dir2_leafn_order(old_blk->bp, new_blk->bp);
1215 before = xfs_da_node_order(old_blk->bp, new_blk->bp);
1222 if (before) {
1224 * Link new block in before existing block.
1418 blkno = be32_to_cpu(node->btree[blk->index].before);
1422 blkno = be32_to_cpu(node->btree[blk->index].before);
1465 blkno = be32_to_cpu(node->btree[blk->index].before);
1791 par_blkno = be32_to_cpu(par_node->btree[entno].before);
1804 be32_to_cpu(par_node->btree[entno].before) != last_blkno;
1834 par_node->btree[entno].before = cpu_to_be32(dead_blkno);
1836 XFS_DA_LOGRANGE(par_node, &par_node->btree[entno].before,
1837 sizeof(par_node->btree[entno].before)));
2403 * Have to free up the dabuf before the buffers are released,