cregit-Linux how code gets into the kernel

Release 4.11 fs/xfs/xfs_trans_buf.c

Directory: fs/xfs
/*
 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */
#include "xfs.h"
#include "xfs_fs.h"
#include "xfs_shared.h"
#include "xfs_format.h"
#include "xfs_log_format.h"
#include "xfs_trans_resv.h"
#include "xfs_mount.h"
#include "xfs_inode.h"
#include "xfs_trans.h"
#include "xfs_buf_item.h"
#include "xfs_trans_priv.h"
#include "xfs_error.h"
#include "xfs_trace.h"

/*
 * Check to see if a buffer matching the given parameters is already
 * a part of the given transaction.
 */

STATIC struct xfs_buf * xfs_trans_buf_item_match( struct xfs_trans *tp, struct xfs_buftarg *target, struct xfs_buf_map *map, int nmaps) { struct xfs_log_item_desc *lidp; struct xfs_buf_log_item *blip; int len = 0; int i; for (i = 0; i < nmaps; i++) len += map[i].bm_len; list_for_each_entry(lidp, &tp->t_items, lid_trans) { blip = (struct xfs_buf_log_item *)lidp->lid_item; if (blip->bli_item.li_type == XFS_LI_BUF && blip->bli_buf->b_target == target && XFS_BUF_ADDR(blip->bli_buf) == map[0].bm_bn && blip->bli_buf->b_length == len) { ASSERT(blip->bli_buf->b_map_count == nmaps); return blip->bli_buf; } } return NULL; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig9463.51%350.00%
Dave Chinner5033.78%116.67%
Chandra Seetharaman21.35%116.67%
David Chinner21.35%116.67%
Total148100.00%6100.00%

/* * Add the locked buffer to the transaction. * * The buffer must be locked, and it cannot be associated with any * transaction. * * If the buffer does not yet have a buf log item associated with it, * then allocate one for it. Then add the buf item to the transaction. */
STATIC void _xfs_trans_bjoin( struct xfs_trans *tp, struct xfs_buf *bp, int reset_recur) { struct xfs_buf_log_item *bip; ASSERT(bp->b_transp == NULL); /* * The xfs_buf_log_item pointer is stored in b_fsprivate. If * it doesn't have one yet, then allocate one and initialize it. * The checks to see if one is there are in xfs_buf_item_init(). */ xfs_buf_item_init(bp, tp->t_mountp); bip = bp->b_fspriv; ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED)); if (reset_recur) bip->bli_recur = 0; /* * Take a reference for this transaction on the buf item. */ atomic_inc(&bip->bli_refcount); /* * Get a log_item_desc to point at the new item. */ xfs_trans_add_item(tp, &bip->bli_item); /* * Initialize b_fsprivate2 so we can find it with incore_match() * in xfs_trans_get_buf() and friends above. */ bp->b_transp = tp; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig12298.39%466.67%
Mark Tinguely10.81%116.67%
Dave Chinner10.81%116.67%
Total124100.00%6100.00%


void xfs_trans_bjoin( struct xfs_trans *tp, struct xfs_buf *bp) { _xfs_trans_bjoin(tp, bp, 0); trace_xfs_trans_bjoin(bp->b_fspriv); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig31100.00%1100.00%
Total31100.00%1100.00%

/* * Get and lock the buffer for the caller if it is not already * locked within the given transaction. If it is already locked * within the transaction, just increment its lock recursion count * and return a pointer to it. * * If the transaction pointer is NULL, make this just a normal * get_buf() call. */
struct xfs_buf * xfs_trans_get_buf_map( struct xfs_trans *tp, struct xfs_buftarg *target, struct xfs_buf_map *map, int nmaps, xfs_buf_flags_t flags) { xfs_buf_t *bp; xfs_buf_log_item_t *bip; if (!tp) return xfs_buf_get_map(target, map, nmaps, flags); /* * If we find the buffer in the cache with this transaction * pointer in its b_fsprivate2 field, then we know we already * have it locked. In this case we just increment the lock * recursion count and return the buffer to the caller. */ bp = xfs_trans_buf_item_match(tp, target, map, nmaps); if (bp != NULL) { ASSERT(xfs_buf_islocked(bp)); if (XFS_FORCED_SHUTDOWN(tp->t_mountp)) { xfs_buf_stale(bp); bp->b_flags |= XBF_DONE; } ASSERT(bp->b_transp == tp); bip = bp->b_fspriv; ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_recur++; trace_xfs_trans_get_buf_recur(bip); return bp; } bp = xfs_buf_get_map(target, map, nmaps, flags); if (bp == NULL) { return NULL; } ASSERT(!bp->b_error); _xfs_trans_bjoin(tp, bp, 1); trace_xfs_trans_get_buf(bp->b_fspriv); return bp; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig17284.31%872.73%
Dave Chinner3014.71%218.18%
Chandra Seetharaman20.98%19.09%
Total204100.00%11100.00%

/* * Get and lock the superblock buffer of this file system for the * given transaction. * * We don't need to use incore_match() here, because the superblock * buffer is a private buffer which we keep a pointer to in the * mount structure. */
xfs_buf_t * xfs_trans_getsb(xfs_trans_t *tp, struct xfs_mount *mp, int flags) { xfs_buf_t *bp; xfs_buf_log_item_t *bip; /* * Default to just trying to lock the superblock buffer * if tp is NULL. */ if (tp == NULL) return xfs_getsb(mp, flags); /* * If the superblock buffer already has this transaction * pointer in its b_fsprivate2 field, then we know we already * have it locked. In this case we just increment the lock * recursion count and return the buffer to the caller. */ bp = mp->m_sb_bp; if (bp->b_transp == tp) { bip = bp->b_fspriv; ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_recur++; trace_xfs_trans_getsb_recur(bip); return bp; } bp = xfs_getsb(mp, flags); if (bp == NULL) return NULL; _xfs_trans_bjoin(tp, bp, 1); trace_xfs_trans_getsb(bp->b_fspriv); return bp; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig134100.00%5100.00%
Total134100.00%5100.00%

/* * Get and lock the buffer for the caller if it is not already * locked within the given transaction. If it has not yet been * read in, read it from disk. If it is already locked * within the transaction and already read in, just increment its * lock recursion count and return a pointer to it. * * If the transaction pointer is NULL, make this just a normal * read_buf() call. */
int xfs_trans_read_buf_map( struct xfs_mount *mp, struct xfs_trans *tp, struct xfs_buftarg *target, struct xfs_buf_map *map, int nmaps, xfs_buf_flags_t flags, struct xfs_buf **bpp, const struct xfs_buf_ops *ops) { struct xfs_buf *bp = NULL; struct xfs_buf_log_item *bip; int error; *bpp = NULL; /* * If we find the buffer in the cache with this transaction * pointer in its b_fsprivate2 field, then we know we already * have it locked. If it is already read in we just increment * the lock recursion count and return the buffer to the caller. * If the buffer is not yet read in, then we read it in, increment * the lock recursion count, and return it to the caller. */ if (tp) bp = xfs_trans_buf_item_match(tp, target, map, nmaps); if (bp) { ASSERT(xfs_buf_islocked(bp)); ASSERT(bp->b_transp == tp); ASSERT(bp->b_fspriv != NULL); ASSERT(!bp->b_error); ASSERT(bp->b_flags & XBF_DONE); /* * We never locked this buf ourselves, so we shouldn't * brelse it either. Just get out. */ if (XFS_FORCED_SHUTDOWN(mp)) { trace_xfs_trans_read_buf_shut(bp, _RET_IP_); return -EIO; } bip = bp->b_fspriv; bip->bli_recur++; ASSERT(atomic_read(&bip->bli_refcount) > 0); trace_xfs_trans_read_buf_recur(bip); *bpp = bp; return 0; } bp = xfs_buf_read_map(target, map, nmaps, flags, ops); if (!bp) { if (!(flags & XBF_TRYLOCK)) return -ENOMEM; return tp ? 0 : -EAGAIN; } /* * If we've had a read error, then the contents of the buffer are * invalid and should not be used. To ensure that a followup read tries * to pull the buffer from disk again, we clear the XBF_DONE flag and * mark the buffer stale. This ensures that anyone who has a current * reference to the buffer will interpret it's contents correctly and * future cache lookups will also treat it as an empty, uninitialised * buffer. */ if (bp->b_error) { error = bp->b_error; if (!XFS_FORCED_SHUTDOWN(mp)) xfs_buf_ioerror_alert(bp, __func__); bp->b_flags &= ~XBF_DONE; xfs_buf_stale(bp); if (tp && (tp->t_flags & XFS_TRANS_DIRTY)) xfs_force_shutdown(tp->t_mountp, SHUTDOWN_META_IO_ERROR); xfs_buf_relse(bp); /* bad CRC means corrupted metadata */ if (error == -EFSBADCRC) error = -EFSCORRUPTED; return error; } if (XFS_FORCED_SHUTDOWN(mp)) { xfs_buf_relse(bp); trace_xfs_trans_read_buf_shut(bp, _RET_IP_); return -EIO; } if (tp) { _xfs_trans_bjoin(tp, bp, 1); trace_xfs_trans_read_buf(bp->b_fspriv); } *bpp = bp; return 0; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig25067.57%736.84%
Dave Chinner10929.46%947.37%
Chandra Seetharaman92.43%15.26%
Nathan Scott20.54%210.53%
Total370100.00%19100.00%

/* * Release the buffer bp which was previously acquired with one of the * xfs_trans_... buffer allocation routines if the buffer has not * been modified within this transaction. If the buffer is modified * within this transaction, do decrement the recursion count but do * not release the buffer even if the count goes to 0. If the buffer is not * modified within the transaction, decrement the recursion count and * release the buffer if the recursion count goes to 0. * * If the buffer is to be released and it was not modified before * this transaction began, then free the buf_log_item associated with it. * * If the transaction pointer is NULL, make this just a normal * brelse() call. */
void xfs_trans_brelse(xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip; /* * Default to a normal brelse() call if the tp is NULL. */ if (tp == NULL) { ASSERT(bp->b_transp == NULL); xfs_buf_relse(bp); return; } ASSERT(bp->b_transp == tp); bip = bp->b_fspriv; ASSERT(bip->bli_item.li_type == XFS_LI_BUF); ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); ASSERT(atomic_read(&bip->bli_refcount) > 0); trace_xfs_trans_brelse(bip); /* * If the release is just for a recursive lock, * then decrement the count and return. */ if (bip->bli_recur > 0) { bip->bli_recur--; return; } /* * If the buffer is dirty within this transaction, we can't * release it until we commit. */ if (bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY) return; /* * If the buffer has been invalidated, then we can't release * it until the transaction commits to disk unless it is re-dirtied * as part of this transaction. This prevents us from pulling * the item from the AIL before we should. */ if (bip->bli_flags & XFS_BLI_STALE) return; ASSERT(!(bip->bli_flags & XFS_BLI_LOGGED)); /* * Free up the log item descriptor tracking the released item. */ xfs_trans_del_item(&bip->bli_item); /* * Clear the hold flag in the buf log item if it is set. * We wouldn't want the next user of the buffer to * get confused. */ if (bip->bli_flags & XFS_BLI_HOLD) { bip->bli_flags &= ~XFS_BLI_HOLD; } /* * Drop our reference to the buf log item. */ atomic_dec(&bip->bli_refcount); /* * If the buf item is not tracking data in the log, then * we must free it before releasing the buffer back to the * free pool. Before releasing the buffer to the free pool, * clear the transaction pointer in b_fsprivate2 to dissolve * its relation to this transaction. */ if (!xfs_buf_item_dirty(bip)) { /*** ASSERT(bp->b_pincount == 0); ***/ ASSERT(atomic_read(&bip->bli_refcount) == 0); ASSERT(!(bip->bli_item.li_flags & XFS_LI_IN_AIL)); ASSERT(!(bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF)); xfs_buf_item_relse(bp); } bp->b_transp = NULL; xfs_buf_relse(bp); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig26498.88%562.50%
Mark Tinguely10.37%112.50%
Russell Cattelan10.37%112.50%
Dave Chinner10.37%112.50%
Total267100.00%8100.00%

/* * Mark the buffer as not needing to be unlocked when the buf item's * iop_unlock() routine is called. The buffer must already be locked * and associated with the given transaction. */ /* ARGSUSED */
void xfs_trans_bhold(xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_flags |= XFS_BLI_HOLD; trace_xfs_trans_bhold(bip); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig8597.70%466.67%
Dave Chinner11.15%116.67%
Mark Tinguely11.15%116.67%
Total87100.00%6100.00%

/* * Cancel the previous buffer hold request made on this buffer * for this transaction. */
void xfs_trans_bhold_release(xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_CANCEL)); ASSERT(atomic_read(&bip->bli_refcount) > 0); ASSERT(bip->bli_flags & XFS_BLI_HOLD); bip->bli_flags &= ~XFS_BLI_HOLD; trace_xfs_trans_bhold_release(bip); }

Contributors

PersonTokensPropCommitsCommitProp
Timothy Shimmin8789.69%116.67%
Christoph Hellwig88.25%350.00%
Mark Tinguely11.03%116.67%
Dave Chinner11.03%116.67%
Total97100.00%6100.00%

/* * This is called to mark bytes first through last inclusive of the given * buffer as needing to be logged when the transaction is committed. * The buffer must already be associated with the given transaction. * * First and last are numbers relative to the beginning of this buffer, * so the first byte in the buffer is numbered 0 regardless of the * value of b_blkno. */
void xfs_trans_log_buf(xfs_trans_t *tp, xfs_buf_t *bp, uint first, uint last) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(first <= last && last < BBTOB(bp->b_length)); ASSERT(bp->b_iodone == NULL || bp->b_iodone == xfs_buf_iodone_callbacks); /* * Mark the buffer as needing to be written out eventually, * and set its iodone function to remove the buffer's buf log * item from the AIL and free it when the buffer is flushed * to disk. See xfs_buf_attach_iodone() for more details * on li_cb and xfs_buf_iodone_callbacks(). * If we end up aborting this transaction, we trap this buffer * inside the b_bdstrat callback so that this won't get written to * disk. */ bp->b_flags |= XBF_DONE; ASSERT(atomic_read(&bip->bli_refcount) > 0); bp->b_iodone = xfs_buf_iodone_callbacks; bip->bli_item.li_cb = xfs_buf_iodone; trace_xfs_trans_log_buf(bip); /* * If we invalidated the buffer within this transaction, then * cancel the invalidation now that we're dirtying the buffer * again. There are no races with the code in xfs_buf_item_unpin(), * because we have a reference to the buffer this entire time. */ if (bip->bli_flags & XFS_BLI_STALE) { bip->bli_flags &= ~XFS_BLI_STALE; ASSERT(bp->b_flags & XBF_STALE); bp->b_flags &= ~XBF_STALE; bip->__bli_format.blf_flags &= ~XFS_BLF_CANCEL; } tp->t_flags |= XFS_TRANS_DIRTY; bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY; /* * If we have an ordered buffer we are not logging any dirty range but * it still needs to be marked dirty and that it has been logged. */ bip->bli_flags |= XFS_BLI_DIRTY | XFS_BLI_LOGGED; if (!(bip->bli_flags & XFS_BLI_ORDERED)) xfs_buf_item_log(bip, first, last); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig16984.08%650.00%
David Chinner178.46%216.67%
Dave Chinner146.97%325.00%
Mark Tinguely10.50%18.33%
Total201100.00%12100.00%

/* * Invalidate a buffer that is being used within a transaction. * * Typically this is because the blocks in the buffer are being freed, so we * need to prevent it from being written out when we're done. Allowing it * to be written again might overwrite data in the free blocks if they are * reallocated to a file. * * We prevent the buffer from being written out by marking it stale. We can't * get rid of the buf log item at this point because the buffer may still be * pinned by another transaction. If that is the case, then we'll wait until * the buffer is committed to disk for the last time (we can tell by the ref * count) and free it in xfs_buf_item_unpin(). Until that happens we will * keep the buffer locked so that the buffer and buf log item are not reused. * * We also set the XFS_BLF_CANCEL flag in the buf log format structure and log * the buf item. This will be used at recovery time to determine that copies * of the buffer in the log before this should not be replayed. * * We mark the item descriptor and the transaction dirty so that we'll hold * the buffer until after the commit. * * Since we're invalidating the buffer, we also clear the state about which * parts of the buffer have been logged. We also clear the flag indicating * that this is an inode buffer since the data in the buffer will no longer * be valid. * * We set the stale bit in the buffer as well since we're getting rid of it. */
void xfs_trans_binval( xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; int i; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); trace_xfs_trans_binval(bip); if (bip->bli_flags & XFS_BLI_STALE) { /* * If the buffer is already invalidated, then * just return. */ ASSERT(bp->b_flags & XBF_STALE); ASSERT(!(bip->bli_flags & (XFS_BLI_LOGGED | XFS_BLI_DIRTY))); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLF_INODE_BUF)); ASSERT(!(bip->__bli_format.blf_flags & XFS_BLFT_MASK)); ASSERT(bip->__bli_format.blf_flags & XFS_BLF_CANCEL); ASSERT(bip->bli_item.li_desc->lid_flags & XFS_LID_DIRTY); ASSERT(tp->t_flags & XFS_TRANS_DIRTY); return; } xfs_buf_stale(bp); bip->bli_flags |= XFS_BLI_STALE; bip->bli_flags &= ~(XFS_BLI_INODE_BUF | XFS_BLI_LOGGED | XFS_BLI_DIRTY); bip->__bli_format.blf_flags &= ~XFS_BLF_INODE_BUF; bip->__bli_format.blf_flags |= XFS_BLF_CANCEL; bip->__bli_format.blf_flags &= ~XFS_BLFT_MASK; for (i = 0; i < bip->bli_format_count; i++) { memset(bip->bli_formats[i].blf_data_map, 0, (bip->bli_formats[i].blf_map_size * sizeof(uint))); } bip->bli_item.li_desc->lid_flags |= XFS_LID_DIRTY; tp->t_flags |= XFS_TRANS_DIRTY; }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig22282.53%750.00%
Mark Tinguely3211.90%214.29%
Dave Chinner124.46%428.57%
Nathan Scott31.12%17.14%
Total269100.00%14100.00%

/* * This call is used to indicate that the buffer contains on-disk inodes which * must be handled specially during recovery. They require special handling * because only the di_next_unlinked from the inodes in the buffer should be * recovered. The rest of the data in the buffer is logged via the inodes * themselves. * * All we do is set the XFS_BLI_INODE_BUF flag in the items flags so it can be * transferred to the buffer's log format structure so that we'll know what to * do at recovery time. */
void xfs_trans_inode_buf( xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_flags |= XFS_BLI_INODE_BUF; xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig6295.38%466.67%
Dave Chinner34.62%233.33%
Total65100.00%6100.00%

/* * This call is used to indicate that the buffer is going to * be staled and was an inode buffer. This means it gets * special processing during unpin - where any inodes * associated with the buffer should be removed from ail. * There is also special processing during recovery, * any replay of the inodes in the buffer needs to be * prevented as the buffer may have been reused. */
void xfs_trans_stale_inode_buf( xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_flags |= XFS_BLI_STALE_INODE; bip->bli_item.li_cb = xfs_buf_iodone; xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig5980.82%466.67%
Stephen Lord1317.81%116.67%
Dave Chinner11.37%116.67%
Total73100.00%6100.00%

/* * Mark the buffer as being one which contains newly allocated * inodes. We need to make sure that even if this buffer is * relogged as an 'inode buf' we still recover all of the inode * images in the face of a crash. This works in coordination with * xfs_buf_item_committed() to ensure that the buffer remains in the * AIL at its original location even after it has been relogged. */ /* ARGSUSED */
void xfs_trans_inode_alloc_buf( xfs_trans_t *tp, xfs_buf_t *bp) { xfs_buf_log_item_t *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_flags |= XFS_BLI_INODE_ALLOC_BUF; xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DINO_BUF); }

Contributors

PersonTokensPropCommitsCommitProp
Stephen Lord4061.54%116.67%
Christoph Hellwig2436.92%466.67%
Dave Chinner11.54%116.67%
Total65100.00%6100.00%

/* * Mark the buffer as ordered for this transaction. This means * that the contents of the buffer are not recorded in the transaction * but it is tracked in the AIL as though it was. This allows us * to record logical changes in transactions rather than the physical * changes we make to the buffer without changing writeback ordering * constraints of metadata buffers. */
void xfs_trans_ordered_buf( struct xfs_trans *tp, struct xfs_buf *bp) { struct xfs_buf_log_item *bip = bp->b_fspriv; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); bip->bli_flags |= XFS_BLI_ORDERED; trace_xfs_buf_item_ordered(bip); }

Contributors

PersonTokensPropCommitsCommitProp
David Chinner64100.00%1100.00%
Total64100.00%1100.00%

/* * Set the type of the buffer for log recovery so that it can correctly identify * and hence attach the correct buffer ops to the buffer after replay. */
void xfs_trans_buf_set_type( struct xfs_trans *tp, struct xfs_buf *bp, enum xfs_blft type) { struct xfs_buf_log_item *bip = bp->b_fspriv; if (!tp) return; ASSERT(bp->b_transp == tp); ASSERT(bip != NULL); ASSERT(atomic_read(&bip->bli_refcount) > 0); xfs_blft_to_flags(&bip->__bli_format, type); }

Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig6284.93%466.67%
Dave Chinner1115.07%233.33%
Total73100.00%6100.00%


void xfs_trans_buf_copy_type( struct xfs_buf *dst_bp, struct xfs_buf *src_bp) { struct xfs_buf_log_item *sbip = src_bp->b_fspriv; struct xfs_buf_log_item *dbip = dst_bp->b_fspriv; enum xfs_blft type; type = xfs_blft_from_flags(&sbip->__bli_format); xfs_blft_to_flags(&dbip->__bli_format, type); }

Contributors

PersonTokensPropCommitsCommitProp
Dave Chinner57100.00%2100.00%
Total57100.00%2100.00%

/* * Similar to xfs_trans_inode_buf(), this marks the buffer as a cluster of * dquots. However, unlike in inode buffer recovery, dquot buffers get * recovered in their entirety. (Hence, no XFS_BLI_DQUOT_ALLOC_BUF flag). * The only thing that makes dquot buffers different from regular * buffers is that we must not replay dquot bufs when recovering * if a _corresponding_ quotaoff has happened. We also have to distinguish * between usr dquot bufs and grp dquot bufs, because usr and grp quotas * can be turned off independently. */ /* ARGSUSED */
void xfs_trans_dquot_buf( xfs_trans_t *tp, xfs_buf_t *bp, uint type) { struct xfs_buf_log_item *bip = bp->b_fspriv; ASSERT(type == XFS_BLF_UDQUOT_BUF || type == XFS_BLF_PDQUOT_BUF || type == XFS_BLF_GDQUOT_BUF); bip->__bli_format.blf_flags |= type; switch (type) { case XFS_BLF_UDQUOT_BUF: type = XFS_BLFT_UDQUOT_BUF; break; case XFS_BLF_PDQUOT_BUF: type = XFS_BLFT_PDQUOT_BUF; break; case XFS_BLF_GDQUOT_BUF: type = XFS_BLFT_GDQUOT_BUF; break; default: type = XFS_BLFT_UNKNOWN_BUF; break; } xfs_trans_buf_set_type(tp, bp, type); }

Contributors

PersonTokensPropCommitsCommitProp
Dave Chinner5356.99%150.00%
Christoph Hellwig4043.01%150.00%
Total93100.00%2100.00%


Overall Contributors

PersonTokensPropCommitsCommitProp
Christoph Hellwig181373.08%1429.17%
Dave Chinner35614.35%1939.58%
Timothy Shimmin883.55%12.08%
David Chinner843.39%24.17%
Stephen Lord552.22%12.08%
Mark Tinguely371.49%24.17%
Russell Cattelan220.89%24.17%
Chandra Seetharaman130.52%24.17%
Nathan Scott130.52%510.42%
Total2481100.00%48100.00%
Directory: fs/xfs
Information contained on this website is for historical information purposes only and does not indicate or represent copyright ownership.
Created with cregit.