| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* | 
| Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. | 
|  | 3 | * All Rights Reserved. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4 | * | 
| Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 5 | * This program is free software; you can redistribute it and/or | 
|  | 6 | * modify it under the terms of the GNU General Public License as | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 7 | * published by the Free Software Foundation. | 
|  | 8 | * | 
| Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 9 | * This program is distributed in the hope that it would be useful, | 
|  | 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|  | 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|  | 12 | * GNU General Public License for more details. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 13 | * | 
| Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 14 | * You should have received a copy of the GNU General Public License | 
|  | 15 | * along with this program; if not, write the Free Software Foundation, | 
|  | 16 | * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 17 | */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 18 | #include "xfs.h" | 
| Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 19 | #include "xfs_fs.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 20 | #include "xfs_types.h" | 
| Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 21 | #include "xfs_bit.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 22 | #include "xfs_log.h" | 
| Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 23 | #include "xfs_inum.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 24 | #include "xfs_trans.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | #include "xfs_sb.h" | 
| David Chinner | da353b0 | 2007-08-28 14:00:13 +1000 | [diff] [blame] | 26 | #include "xfs_ag.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 27 | #include "xfs_mount.h" | 
| Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 28 | #include "xfs_buf_item.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 29 | #include "xfs_trans_priv.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 30 | #include "xfs_error.h" | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 31 | #include "xfs_trace.h" | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 32 |  | 
|  | 33 |  | 
|  | 34 | kmem_zone_t	*xfs_buf_item_zone; | 
|  | 35 |  | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 36 | static inline struct xfs_buf_log_item *BUF_ITEM(struct xfs_log_item *lip) | 
|  | 37 | { | 
|  | 38 | return container_of(lip, struct xfs_buf_log_item, bli_item); | 
|  | 39 | } | 
|  | 40 |  | 
|  | 41 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 42 | #ifdef XFS_TRANS_DEBUG | 
|  | 43 | /* | 
|  | 44 | * This function uses an alternate strategy for tracking the bytes | 
|  | 45 | * that the user requests to be logged.  This can then be used | 
|  | 46 | * in conjunction with the bli_orig array in the buf log item to | 
|  | 47 | * catch bugs in our callers' code. | 
|  | 48 | * | 
|  | 49 | * We also double check the bits set in xfs_buf_item_log using a | 
|  | 50 | * simple algorithm to check that every byte is accounted for. | 
|  | 51 | */ | 
|  | 52 | STATIC void | 
|  | 53 | xfs_buf_item_log_debug( | 
|  | 54 | xfs_buf_log_item_t	*bip, | 
|  | 55 | uint			first, | 
|  | 56 | uint			last) | 
|  | 57 | { | 
|  | 58 | uint	x; | 
|  | 59 | uint	byte; | 
|  | 60 | uint	nbytes; | 
|  | 61 | uint	chunk_num; | 
|  | 62 | uint	word_num; | 
|  | 63 | uint	bit_num; | 
|  | 64 | uint	bit_set; | 
|  | 65 | uint	*wordp; | 
|  | 66 |  | 
|  | 67 | ASSERT(bip->bli_logged != NULL); | 
|  | 68 | byte = first; | 
|  | 69 | nbytes = last - first + 1; | 
|  | 70 | bfset(bip->bli_logged, first, nbytes); | 
|  | 71 | for (x = 0; x < nbytes; x++) { | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 72 | chunk_num = byte >> XFS_BLF_SHIFT; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 73 | word_num = chunk_num >> BIT_TO_WORD_SHIFT; | 
|  | 74 | bit_num = chunk_num & (NBWORD - 1); | 
|  | 75 | wordp = &(bip->bli_format.blf_data_map[word_num]); | 
|  | 76 | bit_set = *wordp & (1 << bit_num); | 
|  | 77 | ASSERT(bit_set); | 
|  | 78 | byte++; | 
|  | 79 | } | 
|  | 80 | } | 
|  | 81 |  | 
|  | 82 | /* | 
|  | 83 | * This function is called when we flush something into a buffer without | 
|  | 84 | * logging it.  This happens for things like inodes which are logged | 
|  | 85 | * separately from the buffer. | 
|  | 86 | */ | 
|  | 87 | void | 
|  | 88 | xfs_buf_item_flush_log_debug( | 
|  | 89 | xfs_buf_t	*bp, | 
|  | 90 | uint		first, | 
|  | 91 | uint		last) | 
|  | 92 | { | 
|  | 93 | xfs_buf_log_item_t	*bip; | 
|  | 94 | uint			nbytes; | 
|  | 95 |  | 
|  | 96 | bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*); | 
|  | 97 | if ((bip == NULL) || (bip->bli_item.li_type != XFS_LI_BUF)) { | 
|  | 98 | return; | 
|  | 99 | } | 
|  | 100 |  | 
|  | 101 | ASSERT(bip->bli_logged != NULL); | 
|  | 102 | nbytes = last - first + 1; | 
|  | 103 | bfset(bip->bli_logged, first, nbytes); | 
|  | 104 | } | 
|  | 105 |  | 
|  | 106 | /* | 
| Nathan Scott | c41564b | 2006-03-29 08:55:14 +1000 | [diff] [blame] | 107 | * This function is called to verify that our callers have logged | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 108 | * all the bytes that they changed. | 
|  | 109 | * | 
|  | 110 | * It does this by comparing the original copy of the buffer stored in | 
|  | 111 | * the buf log item's bli_orig array to the current copy of the buffer | 
| Nathan Scott | c41564b | 2006-03-29 08:55:14 +1000 | [diff] [blame] | 112 | * and ensuring that all bytes which mismatch are set in the bli_logged | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 113 | * array of the buf log item. | 
|  | 114 | */ | 
|  | 115 | STATIC void | 
|  | 116 | xfs_buf_item_log_check( | 
|  | 117 | xfs_buf_log_item_t	*bip) | 
|  | 118 | { | 
|  | 119 | char		*orig; | 
|  | 120 | char		*buffer; | 
|  | 121 | int		x; | 
|  | 122 | xfs_buf_t	*bp; | 
|  | 123 |  | 
|  | 124 | ASSERT(bip->bli_orig != NULL); | 
|  | 125 | ASSERT(bip->bli_logged != NULL); | 
|  | 126 |  | 
|  | 127 | bp = bip->bli_buf; | 
|  | 128 | ASSERT(XFS_BUF_COUNT(bp) > 0); | 
|  | 129 | ASSERT(XFS_BUF_PTR(bp) != NULL); | 
|  | 130 | orig = bip->bli_orig; | 
|  | 131 | buffer = XFS_BUF_PTR(bp); | 
|  | 132 | for (x = 0; x < XFS_BUF_COUNT(bp); x++) { | 
|  | 133 | if (orig[x] != buffer[x] && !btst(bip->bli_logged, x)) | 
|  | 134 | cmn_err(CE_PANIC, | 
|  | 135 | "xfs_buf_item_log_check bip %x buffer %x orig %x index %d", | 
|  | 136 | bip, bp, orig, x); | 
|  | 137 | } | 
|  | 138 | } | 
|  | 139 | #else | 
|  | 140 | #define		xfs_buf_item_log_debug(x,y,z) | 
|  | 141 | #define		xfs_buf_item_log_check(x) | 
|  | 142 | #endif | 
|  | 143 |  | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 144 | STATIC void	xfs_buf_do_callbacks(struct xfs_buf *bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 |  | 
|  | 146 | /* | 
|  | 147 | * This returns the number of log iovecs needed to log the | 
|  | 148 | * given buf log item. | 
|  | 149 | * | 
|  | 150 | * It calculates this as 1 iovec for the buf log format structure | 
|  | 151 | * and 1 for each stretch of non-contiguous chunks to be logged. | 
|  | 152 | * Contiguous chunks are logged in a single iovec. | 
|  | 153 | * | 
|  | 154 | * If the XFS_BLI_STALE flag has been set, then log nothing. | 
|  | 155 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 156 | STATIC uint | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 157 | xfs_buf_item_size( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 158 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 159 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 160 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 161 | struct xfs_buf		*bp = bip->bli_buf; | 
|  | 162 | uint			nvecs; | 
|  | 163 | int			next_bit; | 
|  | 164 | int			last_bit; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 165 |  | 
|  | 166 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | 
|  | 167 | if (bip->bli_flags & XFS_BLI_STALE) { | 
|  | 168 | /* | 
|  | 169 | * The buffer is stale, so all we need to log | 
|  | 170 | * is the buf log format structure with the | 
|  | 171 | * cancel flag in it. | 
|  | 172 | */ | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 173 | trace_xfs_buf_item_size_stale(bip); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 174 | ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 175 | return 1; | 
|  | 176 | } | 
|  | 177 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 178 | ASSERT(bip->bli_flags & XFS_BLI_LOGGED); | 
|  | 179 | nvecs = 1; | 
|  | 180 | last_bit = xfs_next_bit(bip->bli_format.blf_data_map, | 
|  | 181 | bip->bli_format.blf_map_size, 0); | 
|  | 182 | ASSERT(last_bit != -1); | 
|  | 183 | nvecs++; | 
|  | 184 | while (last_bit != -1) { | 
|  | 185 | /* | 
|  | 186 | * This takes the bit number to start looking from and | 
|  | 187 | * returns the next set bit from there.  It returns -1 | 
|  | 188 | * if there are no more bits set or the start bit is | 
|  | 189 | * beyond the end of the bitmap. | 
|  | 190 | */ | 
|  | 191 | next_bit = xfs_next_bit(bip->bli_format.blf_data_map, | 
|  | 192 | bip->bli_format.blf_map_size, | 
|  | 193 | last_bit + 1); | 
|  | 194 | /* | 
|  | 195 | * If we run out of bits, leave the loop, | 
|  | 196 | * else if we find a new set of bits bump the number of vecs, | 
|  | 197 | * else keep scanning the current set of bits. | 
|  | 198 | */ | 
|  | 199 | if (next_bit == -1) { | 
|  | 200 | last_bit = -1; | 
|  | 201 | } else if (next_bit != last_bit + 1) { | 
|  | 202 | last_bit = next_bit; | 
|  | 203 | nvecs++; | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 204 | } else if (xfs_buf_offset(bp, next_bit * XFS_BLF_CHUNK) != | 
|  | 205 | (xfs_buf_offset(bp, last_bit * XFS_BLF_CHUNK) + | 
|  | 206 | XFS_BLF_CHUNK)) { | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 207 | last_bit = next_bit; | 
|  | 208 | nvecs++; | 
|  | 209 | } else { | 
|  | 210 | last_bit++; | 
|  | 211 | } | 
|  | 212 | } | 
|  | 213 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 214 | trace_xfs_buf_item_size(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 215 | return nvecs; | 
|  | 216 | } | 
|  | 217 |  | 
|  | 218 | /* | 
|  | 219 | * This is called to fill in the vector of log iovecs for the | 
|  | 220 | * given log buf item.  It fills the first entry with a buf log | 
|  | 221 | * format structure, and the rest point to contiguous chunks | 
|  | 222 | * within the buffer. | 
|  | 223 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 224 | STATIC void | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 225 | xfs_buf_item_format( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 226 | struct xfs_log_item	*lip, | 
|  | 227 | struct xfs_log_iovec	*vecp) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 228 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 229 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 230 | struct xfs_buf	*bp = bip->bli_buf; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 231 | uint		base_size; | 
|  | 232 | uint		nvecs; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 233 | int		first_bit; | 
|  | 234 | int		last_bit; | 
|  | 235 | int		next_bit; | 
|  | 236 | uint		nbits; | 
|  | 237 | uint		buffer_offset; | 
|  | 238 |  | 
|  | 239 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | 
|  | 240 | ASSERT((bip->bli_flags & XFS_BLI_LOGGED) || | 
|  | 241 | (bip->bli_flags & XFS_BLI_STALE)); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 242 |  | 
|  | 243 | /* | 
|  | 244 | * The size of the base structure is the size of the | 
|  | 245 | * declared structure plus the space for the extra words | 
|  | 246 | * of the bitmap.  We subtract one from the map size, because | 
|  | 247 | * the first element of the bitmap is accounted for in the | 
|  | 248 | * size of the base structure. | 
|  | 249 | */ | 
|  | 250 | base_size = | 
|  | 251 | (uint)(sizeof(xfs_buf_log_format_t) + | 
|  | 252 | ((bip->bli_format.blf_map_size - 1) * sizeof(uint))); | 
| Christoph Hellwig | 4e0d5f9 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 253 | vecp->i_addr = &bip->bli_format; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 254 | vecp->i_len = base_size; | 
| Christoph Hellwig | 4139b3b | 2010-01-19 09:56:45 +0000 | [diff] [blame] | 255 | vecp->i_type = XLOG_REG_TYPE_BFORMAT; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 256 | vecp++; | 
|  | 257 | nvecs = 1; | 
|  | 258 |  | 
| Dave Chinner | ccf7c23 | 2010-05-20 23:19:42 +1000 | [diff] [blame] | 259 | /* | 
|  | 260 | * If it is an inode buffer, transfer the in-memory state to the | 
|  | 261 | * format flags and clear the in-memory state. We do not transfer | 
|  | 262 | * this state if the inode buffer allocation has not yet been committed | 
|  | 263 | * to the log as setting the XFS_BLI_INODE_BUF flag will prevent | 
|  | 264 | * correct replay of the inode allocation. | 
|  | 265 | */ | 
|  | 266 | if (bip->bli_flags & XFS_BLI_INODE_BUF) { | 
|  | 267 | if (!((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) && | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 268 | xfs_log_item_in_current_chkpt(lip))) | 
| Dave Chinner | ccf7c23 | 2010-05-20 23:19:42 +1000 | [diff] [blame] | 269 | bip->bli_format.blf_flags |= XFS_BLF_INODE_BUF; | 
|  | 270 | bip->bli_flags &= ~XFS_BLI_INODE_BUF; | 
|  | 271 | } | 
|  | 272 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 273 | if (bip->bli_flags & XFS_BLI_STALE) { | 
|  | 274 | /* | 
|  | 275 | * The buffer is stale, so all we need to log | 
|  | 276 | * is the buf log format structure with the | 
|  | 277 | * cancel flag in it. | 
|  | 278 | */ | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 279 | trace_xfs_buf_item_format_stale(bip); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 280 | ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 281 | bip->bli_format.blf_size = nvecs; | 
|  | 282 | return; | 
|  | 283 | } | 
|  | 284 |  | 
|  | 285 | /* | 
|  | 286 | * Fill in an iovec for each set of contiguous chunks. | 
|  | 287 | */ | 
|  | 288 | first_bit = xfs_next_bit(bip->bli_format.blf_data_map, | 
|  | 289 | bip->bli_format.blf_map_size, 0); | 
|  | 290 | ASSERT(first_bit != -1); | 
|  | 291 | last_bit = first_bit; | 
|  | 292 | nbits = 1; | 
|  | 293 | for (;;) { | 
|  | 294 | /* | 
|  | 295 | * This takes the bit number to start looking from and | 
|  | 296 | * returns the next set bit from there.  It returns -1 | 
|  | 297 | * if there are no more bits set or the start bit is | 
|  | 298 | * beyond the end of the bitmap. | 
|  | 299 | */ | 
|  | 300 | next_bit = xfs_next_bit(bip->bli_format.blf_data_map, | 
|  | 301 | bip->bli_format.blf_map_size, | 
|  | 302 | (uint)last_bit + 1); | 
|  | 303 | /* | 
|  | 304 | * If we run out of bits fill in the last iovec and get | 
|  | 305 | * out of the loop. | 
|  | 306 | * Else if we start a new set of bits then fill in the | 
|  | 307 | * iovec for the series we were looking at and start | 
|  | 308 | * counting the bits in the new one. | 
|  | 309 | * Else we're still in the same set of bits so just | 
|  | 310 | * keep counting and scanning. | 
|  | 311 | */ | 
|  | 312 | if (next_bit == -1) { | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 313 | buffer_offset = first_bit * XFS_BLF_CHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 314 | vecp->i_addr = xfs_buf_offset(bp, buffer_offset); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 315 | vecp->i_len = nbits * XFS_BLF_CHUNK; | 
| Christoph Hellwig | 4139b3b | 2010-01-19 09:56:45 +0000 | [diff] [blame] | 316 | vecp->i_type = XLOG_REG_TYPE_BCHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 317 | nvecs++; | 
|  | 318 | break; | 
|  | 319 | } else if (next_bit != last_bit + 1) { | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 320 | buffer_offset = first_bit * XFS_BLF_CHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 321 | vecp->i_addr = xfs_buf_offset(bp, buffer_offset); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 322 | vecp->i_len = nbits * XFS_BLF_CHUNK; | 
| Christoph Hellwig | 4139b3b | 2010-01-19 09:56:45 +0000 | [diff] [blame] | 323 | vecp->i_type = XLOG_REG_TYPE_BCHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 324 | nvecs++; | 
|  | 325 | vecp++; | 
|  | 326 | first_bit = next_bit; | 
|  | 327 | last_bit = next_bit; | 
|  | 328 | nbits = 1; | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 329 | } else if (xfs_buf_offset(bp, next_bit << XFS_BLF_SHIFT) != | 
|  | 330 | (xfs_buf_offset(bp, last_bit << XFS_BLF_SHIFT) + | 
|  | 331 | XFS_BLF_CHUNK)) { | 
|  | 332 | buffer_offset = first_bit * XFS_BLF_CHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 333 | vecp->i_addr = xfs_buf_offset(bp, buffer_offset); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 334 | vecp->i_len = nbits * XFS_BLF_CHUNK; | 
| Christoph Hellwig | 4139b3b | 2010-01-19 09:56:45 +0000 | [diff] [blame] | 335 | vecp->i_type = XLOG_REG_TYPE_BCHUNK; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 336 | /* You would think we need to bump the nvecs here too, but we do not | 
|  | 337 | * this number is used by recovery, and it gets confused by the boundary | 
|  | 338 | * split here | 
|  | 339 | *			nvecs++; | 
|  | 340 | */ | 
|  | 341 | vecp++; | 
|  | 342 | first_bit = next_bit; | 
|  | 343 | last_bit = next_bit; | 
|  | 344 | nbits = 1; | 
|  | 345 | } else { | 
|  | 346 | last_bit++; | 
|  | 347 | nbits++; | 
|  | 348 | } | 
|  | 349 | } | 
|  | 350 | bip->bli_format.blf_size = nvecs; | 
|  | 351 |  | 
|  | 352 | /* | 
|  | 353 | * Check to make sure everything is consistent. | 
|  | 354 | */ | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 355 | trace_xfs_buf_item_format(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 356 | xfs_buf_item_log_check(bip); | 
|  | 357 | } | 
|  | 358 |  | 
|  | 359 | /* | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 360 | * This is called to pin the buffer associated with the buf log item in memory | 
| Christoph Hellwig | 4d16e92 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 361 | * so it cannot be written out. | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 362 | * | 
|  | 363 | * We also always take a reference to the buffer log item here so that the bli | 
|  | 364 | * is held while the item is pinned in memory. This means that we can | 
|  | 365 | * unconditionally drop the reference count a transaction holds when the | 
|  | 366 | * transaction is completed. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 367 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 368 | STATIC void | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 369 | xfs_buf_item_pin( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 370 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 371 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 372 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 373 |  | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 374 | ASSERT(XFS_BUF_ISBUSY(bip->bli_buf)); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 375 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | 
|  | 376 | ASSERT((bip->bli_flags & XFS_BLI_LOGGED) || | 
|  | 377 | (bip->bli_flags & XFS_BLI_STALE)); | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 378 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 379 | trace_xfs_buf_item_pin(bip); | 
| Christoph Hellwig | 4d16e92 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 380 |  | 
|  | 381 | atomic_inc(&bip->bli_refcount); | 
|  | 382 | atomic_inc(&bip->bli_buf->b_pin_count); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 383 | } | 
|  | 384 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 385 | /* | 
|  | 386 | * This is called to unpin the buffer associated with the buf log | 
|  | 387 | * item which was previously pinned with a call to xfs_buf_item_pin(). | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 388 | * | 
|  | 389 | * Also drop the reference to the buf item for the current transaction. | 
|  | 390 | * If the XFS_BLI_STALE flag is set and we are the last reference, | 
|  | 391 | * then free up the buf log item and unlock the buffer. | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 392 | * | 
|  | 393 | * If the remove flag is set we are called from uncommit in the | 
|  | 394 | * forced-shutdown path.  If that is true and the reference count on | 
|  | 395 | * the log item is going to drop to zero we need to free the item's | 
|  | 396 | * descriptor in the transaction. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 397 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 398 | STATIC void | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 399 | xfs_buf_item_unpin( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 400 | struct xfs_log_item	*lip, | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 401 | int			remove) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 402 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 403 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 404 | xfs_buf_t	*bp = bip->bli_buf; | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 405 | struct xfs_ail	*ailp = lip->li_ailp; | 
| Dave Chinner | 8e12385 | 2010-03-08 11:26:03 +1100 | [diff] [blame] | 406 | int		stale = bip->bli_flags & XFS_BLI_STALE; | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 407 | int		freed; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 408 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 409 | ASSERT(XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t *) == bip); | 
|  | 410 | ASSERT(atomic_read(&bip->bli_refcount) > 0); | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 411 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 412 | trace_xfs_buf_item_unpin(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 413 |  | 
|  | 414 | freed = atomic_dec_and_test(&bip->bli_refcount); | 
| Christoph Hellwig | 4d16e92 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 415 |  | 
|  | 416 | if (atomic_dec_and_test(&bp->b_pin_count)) | 
|  | 417 | wake_up_all(&bp->b_waiters); | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 418 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 419 | if (freed && stale) { | 
|  | 420 | ASSERT(bip->bli_flags & XFS_BLI_STALE); | 
|  | 421 | ASSERT(XFS_BUF_VALUSEMA(bp) <= 0); | 
|  | 422 | ASSERT(!(XFS_BUF_ISDELAYWRITE(bp))); | 
|  | 423 | ASSERT(XFS_BUF_ISSTALE(bp)); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 424 | ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL); | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 425 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 426 | trace_xfs_buf_item_unpin_stale(bip); | 
|  | 427 |  | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 428 | if (remove) { | 
|  | 429 | /* | 
|  | 430 | * We have to remove the log item from the transaction | 
|  | 431 | * as we are about to release our reference to the | 
|  | 432 | * buffer.  If we don't, the unlock that occurs later | 
|  | 433 | * in xfs_trans_uncommit() will ry to reference the | 
|  | 434 | * buffer which we no longer have a hold on. | 
|  | 435 | */ | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 436 | xfs_trans_del_item(lip); | 
| Christoph Hellwig | 9412e31 | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 437 |  | 
|  | 438 | /* | 
|  | 439 | * Since the transaction no longer refers to the buffer, | 
|  | 440 | * the buffer should no longer refer to the transaction. | 
|  | 441 | */ | 
|  | 442 | XFS_BUF_SET_FSPRIVATE2(bp, NULL); | 
|  | 443 | } | 
|  | 444 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 445 | /* | 
|  | 446 | * If we get called here because of an IO error, we may | 
| David Chinner | 783a2f6 | 2008-10-30 17:39:58 +1100 | [diff] [blame] | 447 | * or may not have the item on the AIL. xfs_trans_ail_delete() | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 448 | * will take care of that situation. | 
| David Chinner | 783a2f6 | 2008-10-30 17:39:58 +1100 | [diff] [blame] | 449 | * xfs_trans_ail_delete() drops the AIL lock. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 450 | */ | 
|  | 451 | if (bip->bli_flags & XFS_BLI_STALE_INODE) { | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 452 | xfs_buf_do_callbacks(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 453 | XFS_BUF_SET_FSPRIVATE(bp, NULL); | 
|  | 454 | XFS_BUF_CLR_IODONE_FUNC(bp); | 
|  | 455 | } else { | 
| David Chinner | 783a2f6 | 2008-10-30 17:39:58 +1100 | [diff] [blame] | 456 | spin_lock(&ailp->xa_lock); | 
|  | 457 | xfs_trans_ail_delete(ailp, (xfs_log_item_t *)bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 458 | xfs_buf_item_relse(bp); | 
|  | 459 | ASSERT(XFS_BUF_FSPRIVATE(bp, void *) == NULL); | 
|  | 460 | } | 
|  | 461 | xfs_buf_relse(bp); | 
|  | 462 | } | 
|  | 463 | } | 
|  | 464 |  | 
|  | 465 | /* | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 466 | * This is called to attempt to lock the buffer associated with this | 
|  | 467 | * buf log item.  Don't sleep on the buffer lock.  If we can't get | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 468 | * the lock right away, return 0.  If we can get the lock, take a | 
|  | 469 | * reference to the buffer. If this is a delayed write buffer that | 
|  | 470 | * needs AIL help to be written back, invoke the pushbuf routine | 
|  | 471 | * rather than the normal success path. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 472 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 473 | STATIC uint | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 474 | xfs_buf_item_trylock( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 475 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 476 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 477 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 478 | struct xfs_buf		*bp = bip->bli_buf; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 479 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 480 | if (XFS_BUF_ISPINNED(bp)) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 481 | return XFS_ITEM_PINNED; | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 482 | if (!XFS_BUF_CPSEMA(bp)) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 483 | return XFS_ITEM_LOCKED; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 484 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 485 | /* take a reference to the buffer.  */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 486 | XFS_BUF_HOLD(bp); | 
|  | 487 |  | 
|  | 488 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 489 | trace_xfs_buf_item_trylock(bip); | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 490 | if (XFS_BUF_ISDELAYWRITE(bp)) | 
|  | 491 | return XFS_ITEM_PUSHBUF; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 492 | return XFS_ITEM_SUCCESS; | 
|  | 493 | } | 
|  | 494 |  | 
|  | 495 | /* | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 496 | * Release the buffer associated with the buf log item.  If there is no dirty | 
|  | 497 | * logged data associated with the buffer recorded in the buf log item, then | 
|  | 498 | * free the buf log item and remove the reference to it in the buffer. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 499 | * | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 500 | * This call ignores the recursion count.  It is only called when the buffer | 
|  | 501 | * should REALLY be unlocked, regardless of the recursion count. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 502 | * | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 503 | * We unconditionally drop the transaction's reference to the log item. If the | 
|  | 504 | * item was logged, then another reference was taken when it was pinned, so we | 
|  | 505 | * can safely drop the transaction reference now.  This also allows us to avoid | 
|  | 506 | * potential races with the unpin code freeing the bli by not referencing the | 
|  | 507 | * bli after we've dropped the reference count. | 
|  | 508 | * | 
|  | 509 | * If the XFS_BLI_HOLD flag is set in the buf log item, then free the log item | 
|  | 510 | * if necessary but do not unlock the buffer.  This is for support of | 
|  | 511 | * xfs_trans_bhold(). Make sure the XFS_BLI_HOLD field is cleared if we don't | 
|  | 512 | * free the item. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 513 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 514 | STATIC void | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 515 | xfs_buf_item_unlock( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 516 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 517 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 518 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 519 | struct xfs_buf		*bp = bip->bli_buf; | 
|  | 520 | int			aborted; | 
|  | 521 | uint			hold; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 522 |  | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 523 | /* Clear the buffer's association with this transaction. */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 524 | XFS_BUF_SET_FSPRIVATE2(bp, NULL); | 
|  | 525 |  | 
|  | 526 | /* | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 527 | * If this is a transaction abort, don't return early.  Instead, allow | 
|  | 528 | * the brelse to happen.  Normally it would be done for stale | 
|  | 529 | * (cancelled) buffers at unpin time, but we'll never go through the | 
|  | 530 | * pin/unpin cycle if we abort inside commit. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 531 | */ | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 532 | aborted = (lip->li_flags & XFS_LI_ABORTED) != 0; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 533 |  | 
|  | 534 | /* | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 535 | * Before possibly freeing the buf item, determine if we should | 
|  | 536 | * release the buffer at the end of this routine. | 
|  | 537 | */ | 
|  | 538 | hold = bip->bli_flags & XFS_BLI_HOLD; | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 539 |  | 
|  | 540 | /* Clear the per transaction state. */ | 
|  | 541 | bip->bli_flags &= ~(XFS_BLI_LOGGED | XFS_BLI_HOLD); | 
|  | 542 |  | 
|  | 543 | /* | 
|  | 544 | * If the buf item is marked stale, then don't do anything.  We'll | 
|  | 545 | * unlock the buffer and free the buf item when the buffer is unpinned | 
|  | 546 | * for the last time. | 
|  | 547 | */ | 
|  | 548 | if (bip->bli_flags & XFS_BLI_STALE) { | 
|  | 549 | trace_xfs_buf_item_unlock_stale(bip); | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 550 | ASSERT(bip->bli_format.blf_flags & XFS_BLF_CANCEL); | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 551 | if (!aborted) { | 
|  | 552 | atomic_dec(&bip->bli_refcount); | 
|  | 553 | return; | 
|  | 554 | } | 
|  | 555 | } | 
|  | 556 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 557 | trace_xfs_buf_item_unlock(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 558 |  | 
|  | 559 | /* | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 560 | * If the buf item isn't tracking any data, free it, otherwise drop the | 
|  | 561 | * reference we hold to it. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 562 | */ | 
| Eric Sandeen | 24ad33f | 2007-06-28 16:43:30 +1000 | [diff] [blame] | 563 | if (xfs_bitmap_empty(bip->bli_format.blf_data_map, | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 564 | bip->bli_format.blf_map_size)) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 565 | xfs_buf_item_relse(bp); | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 566 | else | 
|  | 567 | atomic_dec(&bip->bli_refcount); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 568 |  | 
| Dave Chinner | 64fc35d | 2010-05-07 11:04:34 +1000 | [diff] [blame] | 569 | if (!hold) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 570 | xfs_buf_relse(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 571 | } | 
|  | 572 |  | 
|  | 573 | /* | 
|  | 574 | * This is called to find out where the oldest active copy of the | 
|  | 575 | * buf log item in the on disk log resides now that the last log | 
|  | 576 | * write of it completed at the given lsn. | 
|  | 577 | * We always re-log all the dirty data in a buffer, so usually the | 
|  | 578 | * latest copy in the on disk log is the only one that matters.  For | 
|  | 579 | * those cases we simply return the given lsn. | 
|  | 580 | * | 
|  | 581 | * The one exception to this is for buffers full of newly allocated | 
|  | 582 | * inodes.  These buffers are only relogged with the XFS_BLI_INODE_BUF | 
|  | 583 | * flag set, indicating that only the di_next_unlinked fields from the | 
|  | 584 | * inodes in the buffers will be replayed during recovery.  If the | 
|  | 585 | * original newly allocated inode images have not yet been flushed | 
|  | 586 | * when the buffer is so relogged, then we need to make sure that we | 
|  | 587 | * keep the old images in the 'active' portion of the log.  We do this | 
|  | 588 | * by returning the original lsn of that transaction here rather than | 
|  | 589 | * the current one. | 
|  | 590 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 591 | STATIC xfs_lsn_t | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 592 | xfs_buf_item_committed( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 593 | struct xfs_log_item	*lip, | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 594 | xfs_lsn_t		lsn) | 
|  | 595 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 596 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 597 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 598 | trace_xfs_buf_item_committed(bip); | 
|  | 599 |  | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 600 | if ((bip->bli_flags & XFS_BLI_INODE_ALLOC_BUF) && lip->li_lsn != 0) | 
|  | 601 | return lip->li_lsn; | 
|  | 602 | return lsn; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 603 | } | 
|  | 604 |  | 
|  | 605 | /* | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 606 | * The buffer is locked, but is not a delayed write buffer. This happens | 
|  | 607 | * if we race with IO completion and hence we don't want to try to write it | 
|  | 608 | * again. Just release the buffer. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 609 | */ | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 610 | STATIC void | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 611 | xfs_buf_item_push( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 612 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 613 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 614 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 615 | struct xfs_buf		*bp = bip->bli_buf; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 616 |  | 
|  | 617 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 618 | ASSERT(!XFS_BUF_ISDELAYWRITE(bp)); | 
|  | 619 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 620 | trace_xfs_buf_item_push(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 621 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 622 | xfs_buf_relse(bp); | 
|  | 623 | } | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 624 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 625 | /* | 
|  | 626 | * The buffer is locked and is a delayed write buffer. Promote the buffer | 
|  | 627 | * in the delayed write queue as the caller knows that they must invoke | 
|  | 628 | * the xfsbufd to get this buffer written. We have to unlock the buffer | 
|  | 629 | * to allow the xfsbufd to write it, too. | 
|  | 630 | */ | 
|  | 631 | STATIC void | 
|  | 632 | xfs_buf_item_pushbuf( | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 633 | struct xfs_log_item	*lip) | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 634 | { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 635 | struct xfs_buf_log_item	*bip = BUF_ITEM(lip); | 
|  | 636 | struct xfs_buf		*bp = bip->bli_buf; | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 637 |  | 
|  | 638 | ASSERT(!(bip->bli_flags & XFS_BLI_STALE)); | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 639 | ASSERT(XFS_BUF_ISDELAYWRITE(bp)); | 
|  | 640 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 641 | trace_xfs_buf_item_pushbuf(bip); | 
|  | 642 |  | 
| Dave Chinner | d808f61 | 2010-02-02 10:13:42 +1100 | [diff] [blame] | 643 | xfs_buf_delwri_promote(bp); | 
|  | 644 | xfs_buf_relse(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 645 | } | 
|  | 646 |  | 
| Christoph Hellwig | ba0f32d | 2005-06-21 15:36:52 +1000 | [diff] [blame] | 647 | STATIC void | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 648 | xfs_buf_item_committing( | 
|  | 649 | struct xfs_log_item	*lip, | 
|  | 650 | xfs_lsn_t		commit_lsn) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 651 | { | 
|  | 652 | } | 
|  | 653 |  | 
|  | 654 | /* | 
|  | 655 | * This is the ops vector shared by all buf log items. | 
|  | 656 | */ | 
| David Chinner | 7989cb8 | 2007-02-10 18:34:56 +1100 | [diff] [blame] | 657 | static struct xfs_item_ops xfs_buf_item_ops = { | 
| Christoph Hellwig | 7bfa31d | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 658 | .iop_size	= xfs_buf_item_size, | 
|  | 659 | .iop_format	= xfs_buf_item_format, | 
|  | 660 | .iop_pin	= xfs_buf_item_pin, | 
|  | 661 | .iop_unpin	= xfs_buf_item_unpin, | 
|  | 662 | .iop_trylock	= xfs_buf_item_trylock, | 
|  | 663 | .iop_unlock	= xfs_buf_item_unlock, | 
|  | 664 | .iop_committed	= xfs_buf_item_committed, | 
|  | 665 | .iop_push	= xfs_buf_item_push, | 
|  | 666 | .iop_pushbuf	= xfs_buf_item_pushbuf, | 
|  | 667 | .iop_committing = xfs_buf_item_committing | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 668 | }; | 
|  | 669 |  | 
|  | 670 |  | 
|  | 671 | /* | 
|  | 672 | * Allocate a new buf log item to go with the given buffer. | 
|  | 673 | * Set the buffer's b_fsprivate field to point to the new | 
|  | 674 | * buf log item.  If there are other item's attached to the | 
|  | 675 | * buffer (see xfs_buf_attach_iodone() below), then put the | 
|  | 676 | * buf log item at the front. | 
|  | 677 | */ | 
|  | 678 | void | 
|  | 679 | xfs_buf_item_init( | 
|  | 680 | xfs_buf_t	*bp, | 
|  | 681 | xfs_mount_t	*mp) | 
|  | 682 | { | 
|  | 683 | xfs_log_item_t		*lip; | 
|  | 684 | xfs_buf_log_item_t	*bip; | 
|  | 685 | int			chunks; | 
|  | 686 | int			map_size; | 
|  | 687 |  | 
|  | 688 | /* | 
|  | 689 | * Check to see if there is already a buf log item for | 
|  | 690 | * this buffer.  If there is, it is guaranteed to be | 
|  | 691 | * the first.  If we do already have one, there is | 
|  | 692 | * nothing to do here so return. | 
|  | 693 | */ | 
| Dave Chinner | ebad861 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 694 | ASSERT(bp->b_target->bt_mount == mp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 695 | if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) { | 
|  | 696 | lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *); | 
|  | 697 | if (lip->li_type == XFS_LI_BUF) { | 
|  | 698 | return; | 
|  | 699 | } | 
|  | 700 | } | 
|  | 701 |  | 
|  | 702 | /* | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 703 | * chunks is the number of XFS_BLF_CHUNK size pieces | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 704 | * the buffer can be divided into. Make sure not to | 
|  | 705 | * truncate any pieces.  map_size is the size of the | 
|  | 706 | * bitmap needed to describe the chunks of the buffer. | 
|  | 707 | */ | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 708 | chunks = (int)((XFS_BUF_COUNT(bp) + (XFS_BLF_CHUNK - 1)) >> XFS_BLF_SHIFT); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 709 | map_size = (int)((chunks + NBWORD) >> BIT_TO_WORD_SHIFT); | 
|  | 710 |  | 
|  | 711 | bip = (xfs_buf_log_item_t*)kmem_zone_zalloc(xfs_buf_item_zone, | 
|  | 712 | KM_SLEEP); | 
| Dave Chinner | 43f5efc | 2010-03-23 10:10:00 +1100 | [diff] [blame] | 713 | xfs_log_item_init(mp, &bip->bli_item, XFS_LI_BUF, &xfs_buf_item_ops); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 714 | bip->bli_buf = bp; | 
| Lachlan McIlroy | e1f5dbd | 2008-09-17 16:52:13 +1000 | [diff] [blame] | 715 | xfs_buf_hold(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 716 | bip->bli_format.blf_type = XFS_LI_BUF; | 
|  | 717 | bip->bli_format.blf_blkno = (__int64_t)XFS_BUF_ADDR(bp); | 
|  | 718 | bip->bli_format.blf_len = (ushort)BTOBB(XFS_BUF_COUNT(bp)); | 
|  | 719 | bip->bli_format.blf_map_size = map_size; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 720 |  | 
|  | 721 | #ifdef XFS_TRANS_DEBUG | 
|  | 722 | /* | 
|  | 723 | * Allocate the arrays for tracking what needs to be logged | 
|  | 724 | * and what our callers request to be logged.  bli_orig | 
|  | 725 | * holds a copy of the original, clean buffer for comparison | 
|  | 726 | * against, and bli_logged keeps a 1 bit flag per byte in | 
|  | 727 | * the buffer to indicate which bytes the callers have asked | 
|  | 728 | * to have logged. | 
|  | 729 | */ | 
|  | 730 | bip->bli_orig = (char *)kmem_alloc(XFS_BUF_COUNT(bp), KM_SLEEP); | 
|  | 731 | memcpy(bip->bli_orig, XFS_BUF_PTR(bp), XFS_BUF_COUNT(bp)); | 
|  | 732 | bip->bli_logged = (char *)kmem_zalloc(XFS_BUF_COUNT(bp) / NBBY, KM_SLEEP); | 
|  | 733 | #endif | 
|  | 734 |  | 
|  | 735 | /* | 
|  | 736 | * Put the buf item into the list of items attached to the | 
|  | 737 | * buffer at the front. | 
|  | 738 | */ | 
|  | 739 | if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) { | 
|  | 740 | bip->bli_item.li_bio_list = | 
|  | 741 | XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *); | 
|  | 742 | } | 
|  | 743 | XFS_BUF_SET_FSPRIVATE(bp, bip); | 
|  | 744 | } | 
|  | 745 |  | 
|  | 746 |  | 
|  | 747 | /* | 
|  | 748 | * Mark bytes first through last inclusive as dirty in the buf | 
|  | 749 | * item's bitmap. | 
|  | 750 | */ | 
|  | 751 | void | 
|  | 752 | xfs_buf_item_log( | 
|  | 753 | xfs_buf_log_item_t	*bip, | 
|  | 754 | uint			first, | 
|  | 755 | uint			last) | 
|  | 756 | { | 
|  | 757 | uint		first_bit; | 
|  | 758 | uint		last_bit; | 
|  | 759 | uint		bits_to_set; | 
|  | 760 | uint		bits_set; | 
|  | 761 | uint		word_num; | 
|  | 762 | uint		*wordp; | 
|  | 763 | uint		bit; | 
|  | 764 | uint		end_bit; | 
|  | 765 | uint		mask; | 
|  | 766 |  | 
|  | 767 | /* | 
|  | 768 | * Mark the item as having some dirty data for | 
|  | 769 | * quick reference in xfs_buf_item_dirty. | 
|  | 770 | */ | 
|  | 771 | bip->bli_flags |= XFS_BLI_DIRTY; | 
|  | 772 |  | 
|  | 773 | /* | 
|  | 774 | * Convert byte offsets to bit numbers. | 
|  | 775 | */ | 
| Dave Chinner | c115541 | 2010-05-07 11:05:19 +1000 | [diff] [blame] | 776 | first_bit = first >> XFS_BLF_SHIFT; | 
|  | 777 | last_bit = last >> XFS_BLF_SHIFT; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 778 |  | 
|  | 779 | /* | 
|  | 780 | * Calculate the total number of bits to be set. | 
|  | 781 | */ | 
|  | 782 | bits_to_set = last_bit - first_bit + 1; | 
|  | 783 |  | 
|  | 784 | /* | 
|  | 785 | * Get a pointer to the first word in the bitmap | 
|  | 786 | * to set a bit in. | 
|  | 787 | */ | 
|  | 788 | word_num = first_bit >> BIT_TO_WORD_SHIFT; | 
|  | 789 | wordp = &(bip->bli_format.blf_data_map[word_num]); | 
|  | 790 |  | 
|  | 791 | /* | 
|  | 792 | * Calculate the starting bit in the first word. | 
|  | 793 | */ | 
|  | 794 | bit = first_bit & (uint)(NBWORD - 1); | 
|  | 795 |  | 
|  | 796 | /* | 
|  | 797 | * First set any bits in the first word of our range. | 
|  | 798 | * If it starts at bit 0 of the word, it will be | 
|  | 799 | * set below rather than here.  That is what the variable | 
|  | 800 | * bit tells us. The variable bits_set tracks the number | 
|  | 801 | * of bits that have been set so far.  End_bit is the number | 
|  | 802 | * of the last bit to be set in this word plus one. | 
|  | 803 | */ | 
|  | 804 | if (bit) { | 
|  | 805 | end_bit = MIN(bit + bits_to_set, (uint)NBWORD); | 
|  | 806 | mask = ((1 << (end_bit - bit)) - 1) << bit; | 
|  | 807 | *wordp |= mask; | 
|  | 808 | wordp++; | 
|  | 809 | bits_set = end_bit - bit; | 
|  | 810 | } else { | 
|  | 811 | bits_set = 0; | 
|  | 812 | } | 
|  | 813 |  | 
|  | 814 | /* | 
|  | 815 | * Now set bits a whole word at a time that are between | 
|  | 816 | * first_bit and last_bit. | 
|  | 817 | */ | 
|  | 818 | while ((bits_to_set - bits_set) >= NBWORD) { | 
|  | 819 | *wordp |= 0xffffffff; | 
|  | 820 | bits_set += NBWORD; | 
|  | 821 | wordp++; | 
|  | 822 | } | 
|  | 823 |  | 
|  | 824 | /* | 
|  | 825 | * Finally, set any bits left to be set in one last partial word. | 
|  | 826 | */ | 
|  | 827 | end_bit = bits_to_set - bits_set; | 
|  | 828 | if (end_bit) { | 
|  | 829 | mask = (1 << end_bit) - 1; | 
|  | 830 | *wordp |= mask; | 
|  | 831 | } | 
|  | 832 |  | 
|  | 833 | xfs_buf_item_log_debug(bip, first, last); | 
|  | 834 | } | 
|  | 835 |  | 
|  | 836 |  | 
|  | 837 | /* | 
|  | 838 | * Return 1 if the buffer has some data that has been logged (at any | 
|  | 839 | * point, not just the current transaction) and 0 if not. | 
|  | 840 | */ | 
|  | 841 | uint | 
|  | 842 | xfs_buf_item_dirty( | 
|  | 843 | xfs_buf_log_item_t	*bip) | 
|  | 844 | { | 
|  | 845 | return (bip->bli_flags & XFS_BLI_DIRTY); | 
|  | 846 | } | 
|  | 847 |  | 
| Lachlan McIlroy | e1f5dbd | 2008-09-17 16:52:13 +1000 | [diff] [blame] | 848 | STATIC void | 
|  | 849 | xfs_buf_item_free( | 
|  | 850 | xfs_buf_log_item_t	*bip) | 
|  | 851 | { | 
|  | 852 | #ifdef XFS_TRANS_DEBUG | 
|  | 853 | kmem_free(bip->bli_orig); | 
|  | 854 | kmem_free(bip->bli_logged); | 
|  | 855 | #endif /* XFS_TRANS_DEBUG */ | 
|  | 856 |  | 
| Lachlan McIlroy | e1f5dbd | 2008-09-17 16:52:13 +1000 | [diff] [blame] | 857 | kmem_zone_free(xfs_buf_item_zone, bip); | 
|  | 858 | } | 
|  | 859 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 860 | /* | 
|  | 861 | * This is called when the buf log item is no longer needed.  It should | 
|  | 862 | * free the buf log item associated with the given buffer and clear | 
|  | 863 | * the buffer's pointer to the buf log item.  If there are no more | 
|  | 864 | * items in the list, clear the b_iodone field of the buffer (see | 
|  | 865 | * xfs_buf_attach_iodone() below). | 
|  | 866 | */ | 
|  | 867 | void | 
|  | 868 | xfs_buf_item_relse( | 
|  | 869 | xfs_buf_t	*bp) | 
|  | 870 | { | 
|  | 871 | xfs_buf_log_item_t	*bip; | 
|  | 872 |  | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 873 | trace_xfs_buf_item_relse(bp, _RET_IP_); | 
|  | 874 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 875 | bip = XFS_BUF_FSPRIVATE(bp, xfs_buf_log_item_t*); | 
|  | 876 | XFS_BUF_SET_FSPRIVATE(bp, bip->bli_item.li_bio_list); | 
|  | 877 | if ((XFS_BUF_FSPRIVATE(bp, void *) == NULL) && | 
|  | 878 | (XFS_BUF_IODONE_FUNC(bp) != NULL)) { | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 879 | XFS_BUF_CLR_IODONE_FUNC(bp); | 
|  | 880 | } | 
| Lachlan McIlroy | e1f5dbd | 2008-09-17 16:52:13 +1000 | [diff] [blame] | 881 | xfs_buf_rele(bp); | 
|  | 882 | xfs_buf_item_free(bip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 883 | } | 
|  | 884 |  | 
|  | 885 |  | 
|  | 886 | /* | 
|  | 887 | * Add the given log item with its callback to the list of callbacks | 
|  | 888 | * to be called when the buffer's I/O completes.  If it is not set | 
|  | 889 | * already, set the buffer's b_iodone() routine to be | 
|  | 890 | * xfs_buf_iodone_callbacks() and link the log item into the list of | 
|  | 891 | * items rooted at b_fsprivate.  Items are always added as the second | 
|  | 892 | * entry in the list if there is a first, because the buf item code | 
|  | 893 | * assumes that the buf log item is first. | 
|  | 894 | */ | 
|  | 895 | void | 
|  | 896 | xfs_buf_attach_iodone( | 
|  | 897 | xfs_buf_t	*bp, | 
|  | 898 | void		(*cb)(xfs_buf_t *, xfs_log_item_t *), | 
|  | 899 | xfs_log_item_t	*lip) | 
|  | 900 | { | 
|  | 901 | xfs_log_item_t	*head_lip; | 
|  | 902 |  | 
|  | 903 | ASSERT(XFS_BUF_ISBUSY(bp)); | 
|  | 904 | ASSERT(XFS_BUF_VALUSEMA(bp) <= 0); | 
|  | 905 |  | 
|  | 906 | lip->li_cb = cb; | 
|  | 907 | if (XFS_BUF_FSPRIVATE(bp, void *) != NULL) { | 
|  | 908 | head_lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *); | 
|  | 909 | lip->li_bio_list = head_lip->li_bio_list; | 
|  | 910 | head_lip->li_bio_list = lip; | 
|  | 911 | } else { | 
|  | 912 | XFS_BUF_SET_FSPRIVATE(bp, lip); | 
|  | 913 | } | 
|  | 914 |  | 
|  | 915 | ASSERT((XFS_BUF_IODONE_FUNC(bp) == xfs_buf_iodone_callbacks) || | 
|  | 916 | (XFS_BUF_IODONE_FUNC(bp) == NULL)); | 
|  | 917 | XFS_BUF_SET_IODONE_FUNC(bp, xfs_buf_iodone_callbacks); | 
|  | 918 | } | 
|  | 919 |  | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 920 | /* | 
|  | 921 | * We can have many callbacks on a buffer. Running the callbacks individually | 
|  | 922 | * can cause a lot of contention on the AIL lock, so we allow for a single | 
|  | 923 | * callback to be able to scan the remaining lip->li_bio_list for other items | 
|  | 924 | * of the same type and callback to be processed in the first call. | 
|  | 925 | * | 
|  | 926 | * As a result, the loop walking the callback list below will also modify the | 
|  | 927 | * list. it removes the first item from the list and then runs the callback. | 
|  | 928 | * The loop then restarts from the new head of the list. This allows the | 
|  | 929 | * callback to scan and modify the list attached to the buffer and we don't | 
|  | 930 | * have to care about maintaining a next item pointer. | 
|  | 931 | */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 932 | STATIC void | 
|  | 933 | xfs_buf_do_callbacks( | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 934 | struct xfs_buf		*bp) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 935 | { | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 936 | struct xfs_log_item	*lip; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 937 |  | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 938 | while ((lip = XFS_BUF_FSPRIVATE(bp, xfs_log_item_t *)) != NULL) { | 
|  | 939 | XFS_BUF_SET_FSPRIVATE(bp, lip->li_bio_list); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 940 | ASSERT(lip->li_cb != NULL); | 
|  | 941 | /* | 
|  | 942 | * Clear the next pointer so we don't have any | 
|  | 943 | * confusion if the item is added to another buf. | 
|  | 944 | * Don't touch the log item after calling its | 
|  | 945 | * callback, because it could have freed itself. | 
|  | 946 | */ | 
|  | 947 | lip->li_bio_list = NULL; | 
|  | 948 | lip->li_cb(bp, lip); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 949 | } | 
|  | 950 | } | 
|  | 951 |  | 
|  | 952 | /* | 
|  | 953 | * This is the iodone() function for buffers which have had callbacks | 
|  | 954 | * attached to them by xfs_buf_attach_iodone().  It should remove each | 
|  | 955 | * log item from the buffer's list and call the callback of each in turn. | 
|  | 956 | * When done, the buffer's fsprivate field is set to NULL and the buffer | 
|  | 957 | * is unlocked with a call to iodone(). | 
|  | 958 | */ | 
|  | 959 | void | 
|  | 960 | xfs_buf_iodone_callbacks( | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 961 | struct xfs_buf		*bp) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 962 | { | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 963 | struct xfs_log_item	*lip = bp->b_fspriv; | 
|  | 964 | struct xfs_mount	*mp = lip->li_mountp; | 
|  | 965 | static ulong		lasttime; | 
|  | 966 | static xfs_buftarg_t	*lasttarg; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 967 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 968 | if (likely(!XFS_BUF_GETERROR(bp))) | 
|  | 969 | goto do_callbacks; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 970 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 971 | /* | 
|  | 972 | * If we've already decided to shutdown the filesystem because of | 
|  | 973 | * I/O errors, there's no point in giving this a retry. | 
|  | 974 | */ | 
|  | 975 | if (XFS_FORCED_SHUTDOWN(mp)) { | 
|  | 976 | XFS_BUF_SUPER_STALE(bp); | 
|  | 977 | trace_xfs_buf_item_iodone(bp, _RET_IP_); | 
|  | 978 | goto do_callbacks; | 
|  | 979 | } | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 980 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 981 | if (XFS_BUF_TARGET(bp) != lasttarg || | 
|  | 982 | time_after(jiffies, (lasttime + 5*HZ))) { | 
|  | 983 | lasttime = jiffies; | 
|  | 984 | cmn_err(CE_ALERT, "Device %s, XFS metadata write error" | 
|  | 985 | " block 0x%llx in %s", | 
|  | 986 | XFS_BUFTARG_NAME(XFS_BUF_TARGET(bp)), | 
|  | 987 | (__uint64_t)XFS_BUF_ADDR(bp), mp->m_fsname); | 
|  | 988 | } | 
|  | 989 | lasttarg = XFS_BUF_TARGET(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 990 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 991 | /* | 
|  | 992 | * If the write was asynchronous then noone will be looking for the | 
|  | 993 | * error.  Clear the error state and write the buffer out again. | 
|  | 994 | * | 
|  | 995 | * During sync or umount we'll write all pending buffers again | 
|  | 996 | * synchronous, which will catch these errors if they keep hanging | 
|  | 997 | * around. | 
|  | 998 | */ | 
|  | 999 | if (XFS_BUF_ISASYNC(bp)) { | 
|  | 1000 | XFS_BUF_ERROR(bp, 0); /* errno of 0 unsets the flag */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1001 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 1002 | if (!XFS_BUF_ISSTALE(bp)) { | 
|  | 1003 | XFS_BUF_DELAYWRITE(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1004 | XFS_BUF_DONE(bp); | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 1005 | XFS_BUF_SET_START(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1006 | } | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 1007 | ASSERT(XFS_BUF_IODONE_FUNC(bp)); | 
|  | 1008 | trace_xfs_buf_item_iodone_async(bp, _RET_IP_); | 
|  | 1009 | xfs_buf_relse(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1010 | return; | 
|  | 1011 | } | 
| Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 1012 |  | 
| Christoph Hellwig | bfc6017 | 2011-01-07 13:02:23 +0000 | [diff] [blame] | 1013 | /* | 
|  | 1014 | * If the write of the buffer was synchronous, we want to make | 
|  | 1015 | * sure to return the error to the caller of xfs_bwrite(). | 
|  | 1016 | */ | 
|  | 1017 | XFS_BUF_STALE(bp); | 
|  | 1018 | XFS_BUF_DONE(bp); | 
|  | 1019 | XFS_BUF_UNDELAYWRITE(bp); | 
|  | 1020 |  | 
|  | 1021 | trace_xfs_buf_error_relse(bp, _RET_IP_); | 
|  | 1022 | xfs_force_shutdown(mp, SHUTDOWN_META_IO_ERROR); | 
|  | 1023 |  | 
|  | 1024 | do_callbacks: | 
| Dave Chinner | c90821a | 2010-12-03 17:00:52 +1100 | [diff] [blame] | 1025 | xfs_buf_do_callbacks(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1026 | XFS_BUF_SET_FSPRIVATE(bp, NULL); | 
|  | 1027 | XFS_BUF_CLR_IODONE_FUNC(bp); | 
| Christoph Hellwig | 1a1a3e9 | 2010-10-06 18:41:18 +0000 | [diff] [blame] | 1028 | xfs_buf_ioend(bp, 0); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1029 | } | 
|  | 1030 |  | 
|  | 1031 | /* | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1032 | * This is the iodone() function for buffers which have been | 
|  | 1033 | * logged.  It is called when they are eventually flushed out. | 
|  | 1034 | * It should remove the buf item from the AIL, and free the buf item. | 
|  | 1035 | * It is called by xfs_buf_iodone_callbacks() above which will take | 
|  | 1036 | * care of cleaning up the buffer itself. | 
|  | 1037 | */ | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1038 | void | 
|  | 1039 | xfs_buf_iodone( | 
| Christoph Hellwig | ca30b2a | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 1040 | struct xfs_buf		*bp, | 
|  | 1041 | struct xfs_log_item	*lip) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1042 | { | 
| Christoph Hellwig | ca30b2a | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 1043 | struct xfs_ail		*ailp = lip->li_ailp; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1044 |  | 
| Christoph Hellwig | ca30b2a | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 1045 | ASSERT(BUF_ITEM(lip)->bli_buf == bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1046 |  | 
| Lachlan McIlroy | e1f5dbd | 2008-09-17 16:52:13 +1000 | [diff] [blame] | 1047 | xfs_buf_rele(bp); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1048 |  | 
|  | 1049 | /* | 
|  | 1050 | * If we are forcibly shutting down, this may well be | 
|  | 1051 | * off the AIL already. That's because we simulate the | 
|  | 1052 | * log-committed callbacks to unpin these buffers. Or we may never | 
|  | 1053 | * have put this item on AIL because of the transaction was | 
| David Chinner | 783a2f6 | 2008-10-30 17:39:58 +1100 | [diff] [blame] | 1054 | * aborted forcibly. xfs_trans_ail_delete() takes care of these. | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1055 | * | 
|  | 1056 | * Either way, AIL is useless if we're forcing a shutdown. | 
|  | 1057 | */ | 
| David Chinner | fc1829f | 2008-10-30 17:39:46 +1100 | [diff] [blame] | 1058 | spin_lock(&ailp->xa_lock); | 
| Christoph Hellwig | ca30b2a | 2010-06-23 18:11:15 +1000 | [diff] [blame] | 1059 | xfs_trans_ail_delete(ailp, lip); | 
|  | 1060 | xfs_buf_item_free(BUF_ITEM(lip)); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1061 | } |