Lines Matching refs:path
99 * XXX (dchinner): name path state saving and refilling is an optimisation to
119 xfs_da_state_path_t *path;
126 * Roll down the "path" in the state structure, storing the on-disk
127 * block number for those buffers in the "path".
129 path = &state->path;
130 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
131 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
144 path = &state->altpath;
145 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
146 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
167 xfs_da_state_path_t *path;
174 * Roll down the "path" in the state structure, storing the on-disk
175 * block number for those buffers in the "path".
177 path = &state->path;
178 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
179 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
195 path = &state->altpath;
196 ASSERT((path->active >= 0) && (path->active < XFS_DA_NODE_MAXDEPTH));
197 for (blk = path->blk, level = 0; level < path->active; blk++, level++) {
364 * NOTE: this is also the error path (EEXIST, etc).
617 ASSERT(state->path.blk[state->path.active - 1].bp != NULL);
618 ASSERT(state->path.blk[state->path.active - 1].magic ==
667 * path when the node format collapses to a single block and so we have to check
1428 blk = &state->path.blk[state->path.active-1];
1433 if (state->path.active == 1) {
1455 xfs_da3_fixhashpath(state, &state->path);
1475 blk = &state->path.blk[state->path.active-1];
1478 xfs_da3_fixhashpath(state, &state->path);
1507 if (retval && (state->path.active > 1)) {
1552 blk = &state->path.blk[state->path.active - 1];
1559 for (i = 0; i < state->path.active; i++) {
1560 xfs_trans_brelse(args->trans, state->path.blk[i].bp);
1561 state->path.blk[i].bp = NULL;