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-2002,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 | */ |
| 18 | #ifndef __XFS_TRANS_H__ |
| 19 | #define __XFS_TRANS_H__ |
| 20 | |
| 21 | /* |
| 22 | * This is the structure written in the log at the head of |
| 23 | * every transaction. It identifies the type and id of the |
| 24 | * transaction, and contains the number of items logged by |
| 25 | * the transaction so we know how many to expect during recovery. |
| 26 | * |
| 27 | * Do not change the below structure without redoing the code in |
| 28 | * xlog_recover_add_to_trans() and xlog_recover_add_to_cont_trans(). |
| 29 | */ |
| 30 | typedef struct xfs_trans_header { |
| 31 | uint th_magic; /* magic number */ |
| 32 | uint th_type; /* transaction type */ |
| 33 | __int32_t th_tid; /* transaction id (unused) */ |
| 34 | uint th_num_items; /* num items logged by trans */ |
| 35 | } xfs_trans_header_t; |
| 36 | |
| 37 | #define XFS_TRANS_HEADER_MAGIC 0x5452414e /* TRAN */ |
| 38 | |
| 39 | /* |
| 40 | * Log item types. |
| 41 | */ |
| 42 | #define XFS_LI_5_3_BUF 0x1234 /* v1 bufs, 1-block inode buffers */ |
| 43 | #define XFS_LI_5_3_INODE 0x1235 /* 1-block inode buffers */ |
| 44 | #define XFS_LI_EFI 0x1236 |
| 45 | #define XFS_LI_EFD 0x1237 |
| 46 | #define XFS_LI_IUNLINK 0x1238 |
| 47 | #define XFS_LI_6_1_INODE 0x1239 /* 4K non-aligned inode bufs */ |
| 48 | #define XFS_LI_6_1_BUF 0x123a /* v1, 4K inode buffers */ |
| 49 | #define XFS_LI_INODE 0x123b /* aligned ino chunks, var-size ibufs */ |
| 50 | #define XFS_LI_BUF 0x123c /* v2 bufs, variable sized inode bufs */ |
| 51 | #define XFS_LI_DQUOT 0x123d |
| 52 | #define XFS_LI_QUOTAOFF 0x123e |
| 53 | |
| 54 | /* |
| 55 | * Transaction types. Used to distinguish types of buffers. |
| 56 | */ |
| 57 | #define XFS_TRANS_SETATTR_NOT_SIZE 1 |
| 58 | #define XFS_TRANS_SETATTR_SIZE 2 |
| 59 | #define XFS_TRANS_INACTIVE 3 |
| 60 | #define XFS_TRANS_CREATE 4 |
| 61 | #define XFS_TRANS_CREATE_TRUNC 5 |
| 62 | #define XFS_TRANS_TRUNCATE_FILE 6 |
| 63 | #define XFS_TRANS_REMOVE 7 |
| 64 | #define XFS_TRANS_LINK 8 |
| 65 | #define XFS_TRANS_RENAME 9 |
| 66 | #define XFS_TRANS_MKDIR 10 |
| 67 | #define XFS_TRANS_RMDIR 11 |
| 68 | #define XFS_TRANS_SYMLINK 12 |
| 69 | #define XFS_TRANS_SET_DMATTRS 13 |
| 70 | #define XFS_TRANS_GROWFS 14 |
| 71 | #define XFS_TRANS_STRAT_WRITE 15 |
| 72 | #define XFS_TRANS_DIOSTRAT 16 |
| 73 | #define XFS_TRANS_WRITE_SYNC 17 |
| 74 | #define XFS_TRANS_WRITEID 18 |
| 75 | #define XFS_TRANS_ADDAFORK 19 |
| 76 | #define XFS_TRANS_ATTRINVAL 20 |
| 77 | #define XFS_TRANS_ATRUNCATE 21 |
| 78 | #define XFS_TRANS_ATTR_SET 22 |
| 79 | #define XFS_TRANS_ATTR_RM 23 |
| 80 | #define XFS_TRANS_ATTR_FLAG 24 |
| 81 | #define XFS_TRANS_CLEAR_AGI_BUCKET 25 |
| 82 | #define XFS_TRANS_QM_SBCHANGE 26 |
| 83 | /* |
| 84 | * Dummy entries since we use the transaction type to index into the |
| 85 | * trans_type[] in xlog_recover_print_trans_head() |
| 86 | */ |
| 87 | #define XFS_TRANS_DUMMY1 27 |
| 88 | #define XFS_TRANS_DUMMY2 28 |
| 89 | #define XFS_TRANS_QM_QUOTAOFF 29 |
| 90 | #define XFS_TRANS_QM_DQALLOC 30 |
| 91 | #define XFS_TRANS_QM_SETQLIM 31 |
| 92 | #define XFS_TRANS_QM_DQCLUSTER 32 |
| 93 | #define XFS_TRANS_QM_QINOCREATE 33 |
| 94 | #define XFS_TRANS_QM_QUOTAOFF_END 34 |
| 95 | #define XFS_TRANS_SB_UNIT 35 |
| 96 | #define XFS_TRANS_FSYNC_TS 36 |
| 97 | #define XFS_TRANS_GROWFSRT_ALLOC 37 |
| 98 | #define XFS_TRANS_GROWFSRT_ZERO 38 |
| 99 | #define XFS_TRANS_GROWFSRT_FREE 39 |
| 100 | #define XFS_TRANS_SWAPEXT 40 |
Tim Shimmin | 7e9c639 | 2005-09-02 16:42:05 +1000 | [diff] [blame] | 101 | #define XFS_TRANS_TYPE_MAX 40 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 102 | /* new transaction types need to be reflected in xfs_logprint(8) */ |
| 103 | |
| 104 | |
| 105 | #ifdef __KERNEL__ |
| 106 | struct xfs_buf; |
| 107 | struct xfs_buftarg; |
| 108 | struct xfs_efd_log_item; |
| 109 | struct xfs_efi_log_item; |
| 110 | struct xfs_inode; |
| 111 | struct xfs_item_ops; |
| 112 | struct xfs_log_iovec; |
| 113 | struct xfs_log_item; |
| 114 | struct xfs_log_item_desc; |
| 115 | struct xfs_mount; |
| 116 | struct xfs_trans; |
| 117 | struct xfs_dquot_acct; |
| 118 | |
| 119 | typedef struct xfs_ail_entry { |
| 120 | struct xfs_log_item *ail_forw; /* AIL forw pointer */ |
| 121 | struct xfs_log_item *ail_back; /* AIL back pointer */ |
| 122 | } xfs_ail_entry_t; |
| 123 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 124 | typedef struct xfs_log_item { |
| 125 | xfs_ail_entry_t li_ail; /* AIL pointers */ |
| 126 | xfs_lsn_t li_lsn; /* last on-disk lsn */ |
| 127 | struct xfs_log_item_desc *li_desc; /* ptr to current desc*/ |
| 128 | struct xfs_mount *li_mountp; /* ptr to fs mount */ |
| 129 | uint li_type; /* item type */ |
| 130 | uint li_flags; /* misc flags */ |
| 131 | struct xfs_log_item *li_bio_list; /* buffer item list */ |
| 132 | void (*li_cb)(struct xfs_buf *, |
| 133 | struct xfs_log_item *); |
| 134 | /* buffer item iodone */ |
| 135 | /* callback func */ |
| 136 | struct xfs_item_ops *li_ops; /* function list */ |
| 137 | } xfs_log_item_t; |
| 138 | |
| 139 | #define XFS_LI_IN_AIL 0x1 |
| 140 | #define XFS_LI_ABORTED 0x2 |
| 141 | |
| 142 | typedef struct xfs_item_ops { |
| 143 | uint (*iop_size)(xfs_log_item_t *); |
| 144 | void (*iop_format)(xfs_log_item_t *, struct xfs_log_iovec *); |
| 145 | void (*iop_pin)(xfs_log_item_t *); |
| 146 | void (*iop_unpin)(xfs_log_item_t *, int); |
| 147 | void (*iop_unpin_remove)(xfs_log_item_t *, struct xfs_trans *); |
| 148 | uint (*iop_trylock)(xfs_log_item_t *); |
| 149 | void (*iop_unlock)(xfs_log_item_t *); |
| 150 | xfs_lsn_t (*iop_committed)(xfs_log_item_t *, xfs_lsn_t); |
| 151 | void (*iop_push)(xfs_log_item_t *); |
| 152 | void (*iop_abort)(xfs_log_item_t *); |
| 153 | void (*iop_pushbuf)(xfs_log_item_t *); |
| 154 | void (*iop_committing)(xfs_log_item_t *, xfs_lsn_t); |
| 155 | } xfs_item_ops_t; |
| 156 | |
| 157 | #define IOP_SIZE(ip) (*(ip)->li_ops->iop_size)(ip) |
| 158 | #define IOP_FORMAT(ip,vp) (*(ip)->li_ops->iop_format)(ip, vp) |
| 159 | #define IOP_PIN(ip) (*(ip)->li_ops->iop_pin)(ip) |
| 160 | #define IOP_UNPIN(ip, flags) (*(ip)->li_ops->iop_unpin)(ip, flags) |
| 161 | #define IOP_UNPIN_REMOVE(ip,tp) (*(ip)->li_ops->iop_unpin_remove)(ip, tp) |
| 162 | #define IOP_TRYLOCK(ip) (*(ip)->li_ops->iop_trylock)(ip) |
| 163 | #define IOP_UNLOCK(ip) (*(ip)->li_ops->iop_unlock)(ip) |
| 164 | #define IOP_COMMITTED(ip, lsn) (*(ip)->li_ops->iop_committed)(ip, lsn) |
| 165 | #define IOP_PUSH(ip) (*(ip)->li_ops->iop_push)(ip) |
| 166 | #define IOP_ABORT(ip) (*(ip)->li_ops->iop_abort)(ip) |
| 167 | #define IOP_PUSHBUF(ip) (*(ip)->li_ops->iop_pushbuf)(ip) |
| 168 | #define IOP_COMMITTING(ip, lsn) (*(ip)->li_ops->iop_committing)(ip, lsn) |
| 169 | |
| 170 | /* |
| 171 | * Return values for the IOP_TRYLOCK() routines. |
| 172 | */ |
| 173 | #define XFS_ITEM_SUCCESS 0 |
| 174 | #define XFS_ITEM_PINNED 1 |
| 175 | #define XFS_ITEM_LOCKED 2 |
| 176 | #define XFS_ITEM_FLUSHING 3 |
| 177 | #define XFS_ITEM_PUSHBUF 4 |
| 178 | |
| 179 | #endif /* __KERNEL__ */ |
| 180 | |
| 181 | /* |
| 182 | * This structure is used to track log items associated with |
| 183 | * a transaction. It points to the log item and keeps some |
| 184 | * flags to track the state of the log item. It also tracks |
| 185 | * the amount of space needed to log the item it describes |
| 186 | * once we get to commit processing (see xfs_trans_commit()). |
| 187 | */ |
| 188 | typedef struct xfs_log_item_desc { |
| 189 | xfs_log_item_t *lid_item; |
| 190 | ushort lid_size; |
| 191 | unsigned char lid_flags; |
| 192 | unsigned char lid_index; |
| 193 | } xfs_log_item_desc_t; |
| 194 | |
| 195 | #define XFS_LID_DIRTY 0x1 |
| 196 | #define XFS_LID_PINNED 0x2 |
| 197 | #define XFS_LID_BUF_STALE 0x8 |
| 198 | |
| 199 | /* |
| 200 | * This structure is used to maintain a chunk list of log_item_desc |
| 201 | * structures. The free field is a bitmask indicating which descriptors |
| 202 | * in this chunk's array are free. The unused field is the first value |
| 203 | * not used since this chunk was allocated. |
| 204 | */ |
| 205 | #define XFS_LIC_NUM_SLOTS 15 |
| 206 | typedef struct xfs_log_item_chunk { |
| 207 | struct xfs_log_item_chunk *lic_next; |
| 208 | ushort lic_free; |
| 209 | ushort lic_unused; |
| 210 | xfs_log_item_desc_t lic_descs[XFS_LIC_NUM_SLOTS]; |
| 211 | } xfs_log_item_chunk_t; |
| 212 | |
| 213 | #define XFS_LIC_MAX_SLOT (XFS_LIC_NUM_SLOTS - 1) |
| 214 | #define XFS_LIC_FREEMASK ((1 << XFS_LIC_NUM_SLOTS) - 1) |
| 215 | |
| 216 | |
| 217 | /* |
| 218 | * Initialize the given chunk. Set the chunk's free descriptor mask |
| 219 | * to indicate that all descriptors are free. The caller gets to set |
| 220 | * lic_unused to the right value (0 matches all free). The |
| 221 | * lic_descs.lid_index values are set up as each desc is allocated. |
| 222 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 223 | #define XFS_LIC_INIT(cp) xfs_lic_init(cp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 224 | static inline void xfs_lic_init(xfs_log_item_chunk_t *cp) |
| 225 | { |
| 226 | cp->lic_free = XFS_LIC_FREEMASK; |
| 227 | } |
| 228 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 229 | #define XFS_LIC_INIT_SLOT(cp,slot) xfs_lic_init_slot(cp, slot) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 230 | static inline void xfs_lic_init_slot(xfs_log_item_chunk_t *cp, int slot) |
| 231 | { |
| 232 | cp->lic_descs[slot].lid_index = (unsigned char)(slot); |
| 233 | } |
| 234 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 235 | #define XFS_LIC_VACANCY(cp) xfs_lic_vacancy(cp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 236 | static inline int xfs_lic_vacancy(xfs_log_item_chunk_t *cp) |
| 237 | { |
| 238 | return cp->lic_free & XFS_LIC_FREEMASK; |
| 239 | } |
| 240 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 241 | #define XFS_LIC_ALL_FREE(cp) xfs_lic_all_free(cp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 242 | static inline void xfs_lic_all_free(xfs_log_item_chunk_t *cp) |
| 243 | { |
| 244 | cp->lic_free = XFS_LIC_FREEMASK; |
| 245 | } |
| 246 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 247 | #define XFS_LIC_ARE_ALL_FREE(cp) xfs_lic_are_all_free(cp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 248 | static inline int xfs_lic_are_all_free(xfs_log_item_chunk_t *cp) |
| 249 | { |
| 250 | return ((cp->lic_free & XFS_LIC_FREEMASK) == XFS_LIC_FREEMASK); |
| 251 | } |
| 252 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 253 | #define XFS_LIC_ISFREE(cp,slot) xfs_lic_isfree(cp,slot) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 254 | static inline int xfs_lic_isfree(xfs_log_item_chunk_t *cp, int slot) |
| 255 | { |
| 256 | return (cp->lic_free & (1 << slot)); |
| 257 | } |
| 258 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 259 | #define XFS_LIC_CLAIM(cp,slot) xfs_lic_claim(cp,slot) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 260 | static inline void xfs_lic_claim(xfs_log_item_chunk_t *cp, int slot) |
| 261 | { |
| 262 | cp->lic_free &= ~(1 << slot); |
| 263 | } |
| 264 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 265 | #define XFS_LIC_RELSE(cp,slot) xfs_lic_relse(cp,slot) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 266 | static inline void xfs_lic_relse(xfs_log_item_chunk_t *cp, int slot) |
| 267 | { |
| 268 | cp->lic_free |= 1 << slot; |
| 269 | } |
| 270 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 271 | #define XFS_LIC_SLOT(cp,slot) xfs_lic_slot(cp,slot) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 272 | static inline xfs_log_item_desc_t * |
| 273 | xfs_lic_slot(xfs_log_item_chunk_t *cp, int slot) |
| 274 | { |
| 275 | return &(cp->lic_descs[slot]); |
| 276 | } |
| 277 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 278 | #define XFS_LIC_DESC_TO_SLOT(dp) xfs_lic_desc_to_slot(dp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 279 | static inline int xfs_lic_desc_to_slot(xfs_log_item_desc_t *dp) |
| 280 | { |
| 281 | return (uint)dp->lid_index; |
| 282 | } |
| 283 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 284 | /* |
| 285 | * Calculate the address of a chunk given a descriptor pointer: |
| 286 | * dp - dp->lid_index give the address of the start of the lic_descs array. |
| 287 | * From this we subtract the offset of the lic_descs field in a chunk. |
| 288 | * All of this yields the address of the chunk, which is |
| 289 | * cast to a chunk pointer. |
| 290 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 291 | #define XFS_LIC_DESC_TO_CHUNK(dp) xfs_lic_desc_to_chunk(dp) |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 292 | static inline xfs_log_item_chunk_t * |
| 293 | xfs_lic_desc_to_chunk(xfs_log_item_desc_t *dp) |
| 294 | { |
| 295 | return (xfs_log_item_chunk_t*) \ |
| 296 | (((xfs_caddr_t)((dp) - (dp)->lid_index)) - \ |
| 297 | (xfs_caddr_t)(((xfs_log_item_chunk_t*)0)->lic_descs)); |
| 298 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 299 | |
| 300 | #ifdef __KERNEL__ |
| 301 | /* |
| 302 | * This structure is used to maintain a list of block ranges that have been |
| 303 | * freed in the transaction. The ranges are listed in the perag[] busy list |
| 304 | * between when they're freed and the transaction is committed to disk. |
| 305 | */ |
| 306 | |
| 307 | typedef struct xfs_log_busy_slot { |
| 308 | xfs_agnumber_t lbc_ag; |
| 309 | ushort lbc_idx; /* index in perag.busy[] */ |
| 310 | } xfs_log_busy_slot_t; |
| 311 | |
| 312 | #define XFS_LBC_NUM_SLOTS 31 |
| 313 | typedef struct xfs_log_busy_chunk { |
| 314 | struct xfs_log_busy_chunk *lbc_next; |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 315 | uint lbc_free; /* free slots bitmask */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 316 | ushort lbc_unused; /* first unused */ |
| 317 | xfs_log_busy_slot_t lbc_busy[XFS_LBC_NUM_SLOTS]; |
| 318 | } xfs_log_busy_chunk_t; |
| 319 | |
| 320 | #define XFS_LBC_MAX_SLOT (XFS_LBC_NUM_SLOTS - 1) |
| 321 | #define XFS_LBC_FREEMASK ((1U << XFS_LBC_NUM_SLOTS) - 1) |
| 322 | |
| 323 | #define XFS_LBC_INIT(cp) ((cp)->lbc_free = XFS_LBC_FREEMASK) |
| 324 | #define XFS_LBC_CLAIM(cp, slot) ((cp)->lbc_free &= ~(1 << (slot))) |
| 325 | #define XFS_LBC_SLOT(cp, slot) (&((cp)->lbc_busy[(slot)])) |
| 326 | #define XFS_LBC_VACANCY(cp) (((cp)->lbc_free) & XFS_LBC_FREEMASK) |
| 327 | #define XFS_LBC_ISFREE(cp, slot) ((cp)->lbc_free & (1 << (slot))) |
| 328 | |
| 329 | /* |
| 330 | * This is the type of function which can be given to xfs_trans_callback() |
| 331 | * to be called upon the transaction's commit to disk. |
| 332 | */ |
| 333 | typedef void (*xfs_trans_callback_t)(struct xfs_trans *, void *); |
| 334 | |
| 335 | /* |
| 336 | * This is the structure maintained for every active transaction. |
| 337 | */ |
| 338 | typedef struct xfs_trans { |
| 339 | unsigned int t_magic; /* magic number */ |
| 340 | xfs_log_callback_t t_logcb; /* log callback struct */ |
| 341 | struct xfs_trans *t_forw; /* async list pointers */ |
| 342 | struct xfs_trans *t_back; /* async list pointers */ |
| 343 | unsigned int t_type; /* transaction type */ |
| 344 | unsigned int t_log_res; /* amt of log space resvd */ |
| 345 | unsigned int t_log_count; /* count for perm log res */ |
| 346 | unsigned int t_blk_res; /* # of blocks resvd */ |
| 347 | unsigned int t_blk_res_used; /* # of resvd blocks used */ |
| 348 | unsigned int t_rtx_res; /* # of rt extents resvd */ |
| 349 | unsigned int t_rtx_res_used; /* # of resvd rt extents used */ |
| 350 | xfs_log_ticket_t t_ticket; /* log mgr ticket */ |
| 351 | sema_t t_sema; /* sema for commit completion */ |
| 352 | xfs_lsn_t t_lsn; /* log seq num of start of |
| 353 | * transaction. */ |
| 354 | xfs_lsn_t t_commit_lsn; /* log seq num of end of |
| 355 | * transaction. */ |
| 356 | struct xfs_mount *t_mountp; /* ptr to fs mount struct */ |
Nathan Scott | c41564b | 2006-03-29 08:55:14 +1000 | [diff] [blame] | 357 | struct xfs_dquot_acct *t_dqinfo; /* acctg info for dquots */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 358 | xfs_trans_callback_t t_callback; /* transaction callback */ |
| 359 | void *t_callarg; /* callback arg */ |
| 360 | unsigned int t_flags; /* misc flags */ |
| 361 | long t_icount_delta; /* superblock icount change */ |
| 362 | long t_ifree_delta; /* superblock ifree change */ |
| 363 | long t_fdblocks_delta; /* superblock fdblocks chg */ |
| 364 | long t_res_fdblocks_delta; /* on-disk only chg */ |
| 365 | long t_frextents_delta;/* superblock freextents chg*/ |
| 366 | long t_res_frextents_delta; /* on-disk only chg */ |
| 367 | long t_ag_freeblks_delta; /* debugging counter */ |
| 368 | long t_ag_flist_delta; /* debugging counter */ |
| 369 | long t_ag_btree_delta; /* debugging counter */ |
| 370 | long t_dblocks_delta;/* superblock dblocks change */ |
| 371 | long t_agcount_delta;/* superblock agcount change */ |
| 372 | long t_imaxpct_delta;/* superblock imaxpct change */ |
| 373 | long t_rextsize_delta;/* superblock rextsize chg */ |
| 374 | long t_rbmblocks_delta;/* superblock rbmblocks chg */ |
| 375 | long t_rblocks_delta;/* superblock rblocks change */ |
| 376 | long t_rextents_delta;/* superblocks rextents chg */ |
| 377 | long t_rextslog_delta;/* superblocks rextslog chg */ |
| 378 | unsigned int t_items_free; /* log item descs free */ |
| 379 | xfs_log_item_chunk_t t_items; /* first log item desc chunk */ |
| 380 | xfs_trans_header_t t_header; /* header for in-log trans */ |
| 381 | unsigned int t_busy_free; /* busy descs free */ |
| 382 | xfs_log_busy_chunk_t t_busy; /* busy/async free blocks */ |
Nathan Scott | 8758280 | 2006-03-14 13:18:19 +1100 | [diff] [blame] | 383 | unsigned long t_pflags; /* saved process flags state */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 384 | } xfs_trans_t; |
| 385 | |
| 386 | #endif /* __KERNEL__ */ |
| 387 | |
| 388 | |
| 389 | #define XFS_TRANS_MAGIC 0x5452414E /* 'TRAN' */ |
| 390 | /* |
| 391 | * Values for t_flags. |
| 392 | */ |
| 393 | #define XFS_TRANS_DIRTY 0x01 /* something needs to be logged */ |
| 394 | #define XFS_TRANS_SB_DIRTY 0x02 /* superblock is modified */ |
| 395 | #define XFS_TRANS_PERM_LOG_RES 0x04 /* xact took a permanent log res */ |
| 396 | #define XFS_TRANS_SYNC 0x08 /* make commit synchronous */ |
| 397 | #define XFS_TRANS_DQ_DIRTY 0x10 /* at least one dquot in trx dirty */ |
| 398 | #define XFS_TRANS_RESERVE 0x20 /* OK to use reserved data blocks */ |
| 399 | |
| 400 | /* |
| 401 | * Values for call flags parameter. |
| 402 | */ |
| 403 | #define XFS_TRANS_NOSLEEP 0x1 |
| 404 | #define XFS_TRANS_WAIT 0x2 |
| 405 | #define XFS_TRANS_RELEASE_LOG_RES 0x4 |
| 406 | #define XFS_TRANS_ABORT 0x8 |
| 407 | |
| 408 | /* |
| 409 | * Field values for xfs_trans_mod_sb. |
| 410 | */ |
| 411 | #define XFS_TRANS_SB_ICOUNT 0x00000001 |
| 412 | #define XFS_TRANS_SB_IFREE 0x00000002 |
| 413 | #define XFS_TRANS_SB_FDBLOCKS 0x00000004 |
| 414 | #define XFS_TRANS_SB_RES_FDBLOCKS 0x00000008 |
| 415 | #define XFS_TRANS_SB_FREXTENTS 0x00000010 |
| 416 | #define XFS_TRANS_SB_RES_FREXTENTS 0x00000020 |
| 417 | #define XFS_TRANS_SB_DBLOCKS 0x00000040 |
| 418 | #define XFS_TRANS_SB_AGCOUNT 0x00000080 |
| 419 | #define XFS_TRANS_SB_IMAXPCT 0x00000100 |
| 420 | #define XFS_TRANS_SB_REXTSIZE 0x00000200 |
| 421 | #define XFS_TRANS_SB_RBMBLOCKS 0x00000400 |
| 422 | #define XFS_TRANS_SB_RBLOCKS 0x00000800 |
| 423 | #define XFS_TRANS_SB_REXTENTS 0x00001000 |
| 424 | #define XFS_TRANS_SB_REXTSLOG 0x00002000 |
| 425 | |
| 426 | |
| 427 | /* |
| 428 | * Various log reservation values. |
| 429 | * These are based on the size of the file system block |
| 430 | * because that is what most transactions manipulate. |
| 431 | * Each adds in an additional 128 bytes per item logged to |
| 432 | * try to account for the overhead of the transaction mechanism. |
| 433 | * |
| 434 | * Note: |
| 435 | * Most of the reservations underestimate the number of allocation |
| 436 | * groups into which they could free extents in the xfs_bmap_finish() |
| 437 | * call. This is because the number in the worst case is quite high |
| 438 | * and quite unusual. In order to fix this we need to change |
| 439 | * xfs_bmap_finish() to free extents in only a single AG at a time. |
| 440 | * This will require changes to the EFI code as well, however, so that |
| 441 | * the EFI for the extents not freed is logged again in each transaction. |
| 442 | * See bug 261917. |
| 443 | */ |
| 444 | |
| 445 | /* |
| 446 | * Per-extent log reservation for the allocation btree changes |
| 447 | * involved in freeing or allocating an extent. |
| 448 | * 2 trees * (2 blocks/level * max depth - 1) * block size |
| 449 | */ |
| 450 | #define XFS_ALLOCFREE_LOG_RES(mp,nx) \ |
| 451 | ((nx) * (2 * XFS_FSB_TO_B((mp), 2 * XFS_AG_MAXLEVELS(mp) - 1))) |
| 452 | #define XFS_ALLOCFREE_LOG_COUNT(mp,nx) \ |
| 453 | ((nx) * (2 * (2 * XFS_AG_MAXLEVELS(mp) - 1))) |
| 454 | |
| 455 | /* |
| 456 | * Per-directory log reservation for any directory change. |
| 457 | * dir blocks: (1 btree block per level + data block + free block) * dblock size |
| 458 | * bmap btree: (levels + 2) * max depth * block size |
| 459 | * v2 directory blocks can be fragmented below the dirblksize down to the fsb |
| 460 | * size, so account for that in the DAENTER macros. |
| 461 | */ |
| 462 | #define XFS_DIROP_LOG_RES(mp) \ |
| 463 | (XFS_FSB_TO_B(mp, XFS_DAENTER_BLOCKS(mp, XFS_DATA_FORK)) + \ |
| 464 | (XFS_FSB_TO_B(mp, XFS_DAENTER_BMAPS(mp, XFS_DATA_FORK) + 1))) |
| 465 | #define XFS_DIROP_LOG_COUNT(mp) \ |
| 466 | (XFS_DAENTER_BLOCKS(mp, XFS_DATA_FORK) + \ |
| 467 | XFS_DAENTER_BMAPS(mp, XFS_DATA_FORK) + 1) |
| 468 | |
| 469 | /* |
| 470 | * In a write transaction we can allocate a maximum of 2 |
| 471 | * extents. This gives: |
| 472 | * the inode getting the new extents: inode size |
| 473 | * the inode\'s bmap btree: max depth * block size |
| 474 | * the agfs of the ags from which the extents are allocated: 2 * sector |
| 475 | * the superblock free block counter: sector size |
| 476 | * the allocation btrees: 2 exts * 2 trees * (2 * max depth - 1) * block size |
| 477 | * And the bmap_finish transaction can free bmap blocks in a join: |
| 478 | * the agfs of the ags containing the blocks: 2 * sector size |
| 479 | * the agfls of the ags containing the blocks: 2 * sector size |
| 480 | * the super block free block counter: sector size |
| 481 | * the allocation btrees: 2 exts * 2 trees * (2 * max depth - 1) * block size |
| 482 | */ |
| 483 | #define XFS_CALC_WRITE_LOG_RES(mp) \ |
| 484 | (MAX( \ |
| 485 | ((mp)->m_sb.sb_inodesize + \ |
| 486 | XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK)) + \ |
| 487 | (2 * (mp)->m_sb.sb_sectsize) + \ |
| 488 | (mp)->m_sb.sb_sectsize + \ |
| 489 | XFS_ALLOCFREE_LOG_RES(mp, 2) + \ |
| 490 | (128 * (4 + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) + XFS_ALLOCFREE_LOG_COUNT(mp, 2)))),\ |
| 491 | ((2 * (mp)->m_sb.sb_sectsize) + \ |
| 492 | (2 * (mp)->m_sb.sb_sectsize) + \ |
| 493 | (mp)->m_sb.sb_sectsize + \ |
| 494 | XFS_ALLOCFREE_LOG_RES(mp, 2) + \ |
| 495 | (128 * (5 + XFS_ALLOCFREE_LOG_COUNT(mp, 2)))))) |
| 496 | |
| 497 | #define XFS_WRITE_LOG_RES(mp) ((mp)->m_reservations.tr_write) |
| 498 | |
| 499 | /* |
| 500 | * In truncating a file we free up to two extents at once. We can modify: |
| 501 | * the inode being truncated: inode size |
| 502 | * the inode\'s bmap btree: (max depth + 1) * block size |
| 503 | * And the bmap_finish transaction can free the blocks and bmap blocks: |
| 504 | * the agf for each of the ags: 4 * sector size |
| 505 | * the agfl for each of the ags: 4 * sector size |
| 506 | * the super block to reflect the freed blocks: sector size |
| 507 | * worst case split in allocation btrees per extent assuming 4 extents: |
| 508 | * 4 exts * 2 trees * (2 * max depth - 1) * block size |
| 509 | * the inode btree: max depth * blocksize |
| 510 | * the allocation btrees: 2 trees * (max depth - 1) * block size |
| 511 | */ |
| 512 | #define XFS_CALC_ITRUNCATE_LOG_RES(mp) \ |
| 513 | (MAX( \ |
| 514 | ((mp)->m_sb.sb_inodesize + \ |
| 515 | XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) + 1) + \ |
| 516 | (128 * (2 + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK)))), \ |
| 517 | ((4 * (mp)->m_sb.sb_sectsize) + \ |
| 518 | (4 * (mp)->m_sb.sb_sectsize) + \ |
| 519 | (mp)->m_sb.sb_sectsize + \ |
| 520 | XFS_ALLOCFREE_LOG_RES(mp, 4) + \ |
| 521 | (128 * (9 + XFS_ALLOCFREE_LOG_COUNT(mp, 4))) + \ |
| 522 | (128 * 5) + \ |
| 523 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 524 | (128 * (2 + XFS_IALLOC_BLOCKS(mp) + XFS_IN_MAXLEVELS(mp) + \ |
| 525 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))))) |
| 526 | |
| 527 | #define XFS_ITRUNCATE_LOG_RES(mp) ((mp)->m_reservations.tr_itruncate) |
| 528 | |
| 529 | /* |
| 530 | * In renaming a files we can modify: |
| 531 | * the four inodes involved: 4 * inode size |
| 532 | * the two directory btrees: 2 * (max depth + v2) * dir block size |
| 533 | * the two directory bmap btrees: 2 * max depth * block size |
| 534 | * And the bmap_finish transaction can free dir and bmap blocks (two sets |
| 535 | * of bmap blocks) giving: |
| 536 | * the agf for the ags in which the blocks live: 3 * sector size |
| 537 | * the agfl for the ags in which the blocks live: 3 * sector size |
| 538 | * the superblock for the free block count: sector size |
| 539 | * the allocation btrees: 3 exts * 2 trees * (2 * max depth - 1) * block size |
| 540 | */ |
| 541 | #define XFS_CALC_RENAME_LOG_RES(mp) \ |
| 542 | (MAX( \ |
| 543 | ((4 * (mp)->m_sb.sb_inodesize) + \ |
| 544 | (2 * XFS_DIROP_LOG_RES(mp)) + \ |
| 545 | (128 * (4 + 2 * XFS_DIROP_LOG_COUNT(mp)))), \ |
| 546 | ((3 * (mp)->m_sb.sb_sectsize) + \ |
| 547 | (3 * (mp)->m_sb.sb_sectsize) + \ |
| 548 | (mp)->m_sb.sb_sectsize + \ |
| 549 | XFS_ALLOCFREE_LOG_RES(mp, 3) + \ |
| 550 | (128 * (7 + XFS_ALLOCFREE_LOG_COUNT(mp, 3)))))) |
| 551 | |
| 552 | #define XFS_RENAME_LOG_RES(mp) ((mp)->m_reservations.tr_rename) |
| 553 | |
| 554 | /* |
| 555 | * For creating a link to an inode: |
| 556 | * the parent directory inode: inode size |
| 557 | * the linked inode: inode size |
| 558 | * the directory btree could split: (max depth + v2) * dir block size |
| 559 | * the directory bmap btree could join or split: (max depth + v2) * blocksize |
| 560 | * And the bmap_finish transaction can free some bmap blocks giving: |
| 561 | * the agf for the ag in which the blocks live: sector size |
| 562 | * the agfl for the ag in which the blocks live: sector size |
| 563 | * the superblock for the free block count: sector size |
| 564 | * the allocation btrees: 2 trees * (2 * max depth - 1) * block size |
| 565 | */ |
| 566 | #define XFS_CALC_LINK_LOG_RES(mp) \ |
| 567 | (MAX( \ |
| 568 | ((mp)->m_sb.sb_inodesize + \ |
| 569 | (mp)->m_sb.sb_inodesize + \ |
| 570 | XFS_DIROP_LOG_RES(mp) + \ |
| 571 | (128 * (2 + XFS_DIROP_LOG_COUNT(mp)))), \ |
| 572 | ((mp)->m_sb.sb_sectsize + \ |
| 573 | (mp)->m_sb.sb_sectsize + \ |
| 574 | (mp)->m_sb.sb_sectsize + \ |
| 575 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 576 | (128 * (3 + XFS_ALLOCFREE_LOG_COUNT(mp, 1)))))) |
| 577 | |
| 578 | #define XFS_LINK_LOG_RES(mp) ((mp)->m_reservations.tr_link) |
| 579 | |
| 580 | /* |
| 581 | * For removing a directory entry we can modify: |
| 582 | * the parent directory inode: inode size |
| 583 | * the removed inode: inode size |
| 584 | * the directory btree could join: (max depth + v2) * dir block size |
| 585 | * the directory bmap btree could join or split: (max depth + v2) * blocksize |
| 586 | * And the bmap_finish transaction can free the dir and bmap blocks giving: |
| 587 | * the agf for the ag in which the blocks live: 2 * sector size |
| 588 | * the agfl for the ag in which the blocks live: 2 * sector size |
| 589 | * the superblock for the free block count: sector size |
| 590 | * the allocation btrees: 2 exts * 2 trees * (2 * max depth - 1) * block size |
| 591 | */ |
| 592 | #define XFS_CALC_REMOVE_LOG_RES(mp) \ |
| 593 | (MAX( \ |
| 594 | ((mp)->m_sb.sb_inodesize + \ |
| 595 | (mp)->m_sb.sb_inodesize + \ |
| 596 | XFS_DIROP_LOG_RES(mp) + \ |
| 597 | (128 * (2 + XFS_DIROP_LOG_COUNT(mp)))), \ |
| 598 | ((2 * (mp)->m_sb.sb_sectsize) + \ |
| 599 | (2 * (mp)->m_sb.sb_sectsize) + \ |
| 600 | (mp)->m_sb.sb_sectsize + \ |
| 601 | XFS_ALLOCFREE_LOG_RES(mp, 2) + \ |
| 602 | (128 * (5 + XFS_ALLOCFREE_LOG_COUNT(mp, 2)))))) |
| 603 | |
| 604 | #define XFS_REMOVE_LOG_RES(mp) ((mp)->m_reservations.tr_remove) |
| 605 | |
| 606 | /* |
| 607 | * For symlink we can modify: |
| 608 | * the parent directory inode: inode size |
| 609 | * the new inode: inode size |
| 610 | * the inode btree entry: 1 block |
| 611 | * the directory btree: (max depth + v2) * dir block size |
| 612 | * the directory inode\'s bmap btree: (max depth + v2) * block size |
| 613 | * the blocks for the symlink: 1 KB |
| 614 | * Or in the first xact we allocate some inodes giving: |
| 615 | * the agi and agf of the ag getting the new inodes: 2 * sectorsize |
| 616 | * the inode blocks allocated: XFS_IALLOC_BLOCKS * blocksize |
| 617 | * the inode btree: max depth * blocksize |
| 618 | * the allocation btrees: 2 trees * (2 * max depth - 1) * block size |
| 619 | */ |
| 620 | #define XFS_CALC_SYMLINK_LOG_RES(mp) \ |
| 621 | (MAX( \ |
| 622 | ((mp)->m_sb.sb_inodesize + \ |
| 623 | (mp)->m_sb.sb_inodesize + \ |
| 624 | XFS_FSB_TO_B(mp, 1) + \ |
| 625 | XFS_DIROP_LOG_RES(mp) + \ |
| 626 | 1024 + \ |
| 627 | (128 * (4 + XFS_DIROP_LOG_COUNT(mp)))), \ |
| 628 | (2 * (mp)->m_sb.sb_sectsize + \ |
| 629 | XFS_FSB_TO_B((mp), XFS_IALLOC_BLOCKS((mp))) + \ |
| 630 | XFS_FSB_TO_B((mp), XFS_IN_MAXLEVELS(mp)) + \ |
| 631 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 632 | (128 * (2 + XFS_IALLOC_BLOCKS(mp) + XFS_IN_MAXLEVELS(mp) + \ |
| 633 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))))) |
| 634 | |
| 635 | #define XFS_SYMLINK_LOG_RES(mp) ((mp)->m_reservations.tr_symlink) |
| 636 | |
| 637 | /* |
| 638 | * For create we can modify: |
| 639 | * the parent directory inode: inode size |
| 640 | * the new inode: inode size |
| 641 | * the inode btree entry: block size |
| 642 | * the superblock for the nlink flag: sector size |
| 643 | * the directory btree: (max depth + v2) * dir block size |
| 644 | * the directory inode\'s bmap btree: (max depth + v2) * block size |
| 645 | * Or in the first xact we allocate some inodes giving: |
| 646 | * the agi and agf of the ag getting the new inodes: 2 * sectorsize |
| 647 | * the superblock for the nlink flag: sector size |
| 648 | * the inode blocks allocated: XFS_IALLOC_BLOCKS * blocksize |
| 649 | * the inode btree: max depth * blocksize |
| 650 | * the allocation btrees: 2 trees * (max depth - 1) * block size |
| 651 | */ |
| 652 | #define XFS_CALC_CREATE_LOG_RES(mp) \ |
| 653 | (MAX( \ |
| 654 | ((mp)->m_sb.sb_inodesize + \ |
| 655 | (mp)->m_sb.sb_inodesize + \ |
| 656 | (mp)->m_sb.sb_sectsize + \ |
| 657 | XFS_FSB_TO_B(mp, 1) + \ |
| 658 | XFS_DIROP_LOG_RES(mp) + \ |
| 659 | (128 * (3 + XFS_DIROP_LOG_COUNT(mp)))), \ |
| 660 | (3 * (mp)->m_sb.sb_sectsize + \ |
| 661 | XFS_FSB_TO_B((mp), XFS_IALLOC_BLOCKS((mp))) + \ |
| 662 | XFS_FSB_TO_B((mp), XFS_IN_MAXLEVELS(mp)) + \ |
| 663 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 664 | (128 * (2 + XFS_IALLOC_BLOCKS(mp) + XFS_IN_MAXLEVELS(mp) + \ |
| 665 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))))) |
| 666 | |
| 667 | #define XFS_CREATE_LOG_RES(mp) ((mp)->m_reservations.tr_create) |
| 668 | |
| 669 | /* |
| 670 | * Making a new directory is the same as creating a new file. |
| 671 | */ |
| 672 | #define XFS_CALC_MKDIR_LOG_RES(mp) XFS_CALC_CREATE_LOG_RES(mp) |
| 673 | |
| 674 | #define XFS_MKDIR_LOG_RES(mp) ((mp)->m_reservations.tr_mkdir) |
| 675 | |
| 676 | /* |
| 677 | * In freeing an inode we can modify: |
| 678 | * the inode being freed: inode size |
| 679 | * the super block free inode counter: sector size |
| 680 | * the agi hash list and counters: sector size |
| 681 | * the inode btree entry: block size |
| 682 | * the on disk inode before ours in the agi hash list: inode cluster size |
| 683 | * the inode btree: max depth * blocksize |
| 684 | * the allocation btrees: 2 trees * (max depth - 1) * block size |
| 685 | */ |
| 686 | #define XFS_CALC_IFREE_LOG_RES(mp) \ |
| 687 | ((mp)->m_sb.sb_inodesize + \ |
| 688 | (mp)->m_sb.sb_sectsize + \ |
| 689 | (mp)->m_sb.sb_sectsize + \ |
| 690 | XFS_FSB_TO_B((mp), 1) + \ |
| 691 | MAX((__uint16_t)XFS_FSB_TO_B((mp), 1), XFS_INODE_CLUSTER_SIZE(mp)) + \ |
| 692 | (128 * 5) + \ |
| 693 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 694 | (128 * (2 + XFS_IALLOC_BLOCKS(mp) + XFS_IN_MAXLEVELS(mp) + \ |
| 695 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))) |
| 696 | |
| 697 | |
| 698 | #define XFS_IFREE_LOG_RES(mp) ((mp)->m_reservations.tr_ifree) |
| 699 | |
| 700 | /* |
| 701 | * When only changing the inode we log the inode and possibly the superblock |
| 702 | * We also add a bit of slop for the transaction stuff. |
| 703 | */ |
| 704 | #define XFS_CALC_ICHANGE_LOG_RES(mp) ((mp)->m_sb.sb_inodesize + \ |
| 705 | (mp)->m_sb.sb_sectsize + 512) |
| 706 | |
| 707 | #define XFS_ICHANGE_LOG_RES(mp) ((mp)->m_reservations.tr_ichange) |
| 708 | |
| 709 | /* |
| 710 | * Growing the data section of the filesystem. |
| 711 | * superblock |
| 712 | * agi and agf |
| 713 | * allocation btrees |
| 714 | */ |
| 715 | #define XFS_CALC_GROWDATA_LOG_RES(mp) \ |
| 716 | ((mp)->m_sb.sb_sectsize * 3 + \ |
| 717 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 718 | (128 * (3 + XFS_ALLOCFREE_LOG_COUNT(mp, 1)))) |
| 719 | |
| 720 | #define XFS_GROWDATA_LOG_RES(mp) ((mp)->m_reservations.tr_growdata) |
| 721 | |
| 722 | /* |
| 723 | * Growing the rt section of the filesystem. |
| 724 | * In the first set of transactions (ALLOC) we allocate space to the |
| 725 | * bitmap or summary files. |
| 726 | * superblock: sector size |
| 727 | * agf of the ag from which the extent is allocated: sector size |
| 728 | * bmap btree for bitmap/summary inode: max depth * blocksize |
| 729 | * bitmap/summary inode: inode size |
| 730 | * allocation btrees for 1 block alloc: 2 * (2 * maxdepth - 1) * blocksize |
| 731 | */ |
| 732 | #define XFS_CALC_GROWRTALLOC_LOG_RES(mp) \ |
| 733 | (2 * (mp)->m_sb.sb_sectsize + \ |
| 734 | XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK)) + \ |
| 735 | (mp)->m_sb.sb_inodesize + \ |
| 736 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 737 | (128 * \ |
| 738 | (3 + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) + \ |
| 739 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))) |
| 740 | |
| 741 | #define XFS_GROWRTALLOC_LOG_RES(mp) ((mp)->m_reservations.tr_growrtalloc) |
| 742 | |
| 743 | /* |
| 744 | * Growing the rt section of the filesystem. |
| 745 | * In the second set of transactions (ZERO) we zero the new metadata blocks. |
| 746 | * one bitmap/summary block: blocksize |
| 747 | */ |
| 748 | #define XFS_CALC_GROWRTZERO_LOG_RES(mp) \ |
| 749 | ((mp)->m_sb.sb_blocksize + 128) |
| 750 | |
| 751 | #define XFS_GROWRTZERO_LOG_RES(mp) ((mp)->m_reservations.tr_growrtzero) |
| 752 | |
| 753 | /* |
| 754 | * Growing the rt section of the filesystem. |
| 755 | * In the third set of transactions (FREE) we update metadata without |
| 756 | * allocating any new blocks. |
| 757 | * superblock: sector size |
| 758 | * bitmap inode: inode size |
| 759 | * summary inode: inode size |
| 760 | * one bitmap block: blocksize |
| 761 | * summary blocks: new summary size |
| 762 | */ |
| 763 | #define XFS_CALC_GROWRTFREE_LOG_RES(mp) \ |
| 764 | ((mp)->m_sb.sb_sectsize + \ |
| 765 | 2 * (mp)->m_sb.sb_inodesize + \ |
| 766 | (mp)->m_sb.sb_blocksize + \ |
| 767 | (mp)->m_rsumsize + \ |
| 768 | (128 * 5)) |
| 769 | |
| 770 | #define XFS_GROWRTFREE_LOG_RES(mp) ((mp)->m_reservations.tr_growrtfree) |
| 771 | |
| 772 | /* |
| 773 | * Logging the inode modification timestamp on a synchronous write. |
| 774 | * inode |
| 775 | */ |
| 776 | #define XFS_CALC_SWRITE_LOG_RES(mp) \ |
| 777 | ((mp)->m_sb.sb_inodesize + 128) |
| 778 | |
| 779 | #define XFS_SWRITE_LOG_RES(mp) ((mp)->m_reservations.tr_swrite) |
| 780 | |
| 781 | /* |
| 782 | * Logging the inode timestamps on an fsync -- same as SWRITE |
| 783 | * as long as SWRITE logs the entire inode core |
| 784 | */ |
| 785 | #define XFS_FSYNC_TS_LOG_RES(mp) ((mp)->m_reservations.tr_swrite) |
| 786 | |
| 787 | /* |
| 788 | * Logging the inode mode bits when writing a setuid/setgid file |
| 789 | * inode |
| 790 | */ |
| 791 | #define XFS_CALC_WRITEID_LOG_RES(mp) \ |
| 792 | ((mp)->m_sb.sb_inodesize + 128) |
| 793 | |
| 794 | #define XFS_WRITEID_LOG_RES(mp) ((mp)->m_reservations.tr_swrite) |
| 795 | |
| 796 | /* |
| 797 | * Converting the inode from non-attributed to attributed. |
| 798 | * the inode being converted: inode size |
| 799 | * agf block and superblock (for block allocation) |
| 800 | * the new block (directory sized) |
| 801 | * bmap blocks for the new directory block |
| 802 | * allocation btrees |
| 803 | */ |
| 804 | #define XFS_CALC_ADDAFORK_LOG_RES(mp) \ |
| 805 | ((mp)->m_sb.sb_inodesize + \ |
| 806 | (mp)->m_sb.sb_sectsize * 2 + \ |
| 807 | (mp)->m_dirblksize + \ |
| 808 | (XFS_DIR_IS_V1(mp) ? 0 : \ |
| 809 | XFS_FSB_TO_B(mp, (XFS_DAENTER_BMAP1B(mp, XFS_DATA_FORK) + 1))) + \ |
| 810 | XFS_ALLOCFREE_LOG_RES(mp, 1) + \ |
| 811 | (128 * (4 + \ |
| 812 | (XFS_DIR_IS_V1(mp) ? 0 : \ |
| 813 | XFS_DAENTER_BMAP1B(mp, XFS_DATA_FORK) + 1) + \ |
| 814 | XFS_ALLOCFREE_LOG_COUNT(mp, 1)))) |
| 815 | |
| 816 | #define XFS_ADDAFORK_LOG_RES(mp) ((mp)->m_reservations.tr_addafork) |
| 817 | |
| 818 | /* |
| 819 | * Removing the attribute fork of a file |
| 820 | * the inode being truncated: inode size |
| 821 | * the inode\'s bmap btree: max depth * block size |
| 822 | * And the bmap_finish transaction can free the blocks and bmap blocks: |
| 823 | * the agf for each of the ags: 4 * sector size |
| 824 | * the agfl for each of the ags: 4 * sector size |
| 825 | * the super block to reflect the freed blocks: sector size |
| 826 | * worst case split in allocation btrees per extent assuming 4 extents: |
| 827 | * 4 exts * 2 trees * (2 * max depth - 1) * block size |
| 828 | */ |
| 829 | #define XFS_CALC_ATTRINVAL_LOG_RES(mp) \ |
| 830 | (MAX( \ |
| 831 | ((mp)->m_sb.sb_inodesize + \ |
| 832 | XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_ATTR_FORK)) + \ |
| 833 | (128 * (1 + XFS_BM_MAXLEVELS(mp, XFS_ATTR_FORK)))), \ |
| 834 | ((4 * (mp)->m_sb.sb_sectsize) + \ |
| 835 | (4 * (mp)->m_sb.sb_sectsize) + \ |
| 836 | (mp)->m_sb.sb_sectsize + \ |
| 837 | XFS_ALLOCFREE_LOG_RES(mp, 4) + \ |
| 838 | (128 * (9 + XFS_ALLOCFREE_LOG_COUNT(mp, 4)))))) |
| 839 | |
| 840 | #define XFS_ATTRINVAL_LOG_RES(mp) ((mp)->m_reservations.tr_attrinval) |
| 841 | |
| 842 | /* |
| 843 | * Setting an attribute. |
| 844 | * the inode getting the attribute |
| 845 | * the superblock for allocations |
| 846 | * the agfs extents are allocated from |
| 847 | * the attribute btree * max depth |
| 848 | * the inode allocation btree |
| 849 | * Since attribute transaction space is dependent on the size of the attribute, |
| 850 | * the calculation is done partially at mount time and partially at runtime. |
| 851 | */ |
| 852 | #define XFS_CALC_ATTRSET_LOG_RES(mp) \ |
| 853 | ((mp)->m_sb.sb_inodesize + \ |
| 854 | (mp)->m_sb.sb_sectsize + \ |
| 855 | XFS_FSB_TO_B((mp), XFS_DA_NODE_MAXDEPTH) + \ |
| 856 | (128 * (2 + XFS_DA_NODE_MAXDEPTH))) |
| 857 | |
| 858 | #define XFS_ATTRSET_LOG_RES(mp, ext) \ |
| 859 | ((mp)->m_reservations.tr_attrset + \ |
| 860 | (ext * (mp)->m_sb.sb_sectsize) + \ |
| 861 | (ext * XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_ATTR_FORK))) + \ |
| 862 | (128 * (ext + (ext * XFS_BM_MAXLEVELS(mp, XFS_ATTR_FORK))))) |
| 863 | |
| 864 | /* |
| 865 | * Removing an attribute. |
| 866 | * the inode: inode size |
| 867 | * the attribute btree could join: max depth * block size |
| 868 | * the inode bmap btree could join or split: max depth * block size |
| 869 | * And the bmap_finish transaction can free the attr blocks freed giving: |
| 870 | * the agf for the ag in which the blocks live: 2 * sector size |
| 871 | * the agfl for the ag in which the blocks live: 2 * sector size |
| 872 | * the superblock for the free block count: sector size |
| 873 | * the allocation btrees: 2 exts * 2 trees * (2 * max depth - 1) * block size |
| 874 | */ |
| 875 | #define XFS_CALC_ATTRRM_LOG_RES(mp) \ |
| 876 | (MAX( \ |
| 877 | ((mp)->m_sb.sb_inodesize + \ |
| 878 | XFS_FSB_TO_B((mp), XFS_DA_NODE_MAXDEPTH) + \ |
| 879 | XFS_FSB_TO_B((mp), XFS_BM_MAXLEVELS(mp, XFS_ATTR_FORK)) + \ |
| 880 | (128 * (1 + XFS_DA_NODE_MAXDEPTH + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK)))), \ |
| 881 | ((2 * (mp)->m_sb.sb_sectsize) + \ |
| 882 | (2 * (mp)->m_sb.sb_sectsize) + \ |
| 883 | (mp)->m_sb.sb_sectsize + \ |
| 884 | XFS_ALLOCFREE_LOG_RES(mp, 2) + \ |
| 885 | (128 * (5 + XFS_ALLOCFREE_LOG_COUNT(mp, 2)))))) |
| 886 | |
| 887 | #define XFS_ATTRRM_LOG_RES(mp) ((mp)->m_reservations.tr_attrrm) |
| 888 | |
| 889 | /* |
| 890 | * Clearing a bad agino number in an agi hash bucket. |
| 891 | */ |
| 892 | #define XFS_CALC_CLEAR_AGI_BUCKET_LOG_RES(mp) \ |
| 893 | ((mp)->m_sb.sb_sectsize + 128) |
| 894 | |
| 895 | #define XFS_CLEAR_AGI_BUCKET_LOG_RES(mp) ((mp)->m_reservations.tr_clearagi) |
| 896 | |
| 897 | |
| 898 | /* |
| 899 | * Various log count values. |
| 900 | */ |
| 901 | #define XFS_DEFAULT_LOG_COUNT 1 |
| 902 | #define XFS_DEFAULT_PERM_LOG_COUNT 2 |
| 903 | #define XFS_ITRUNCATE_LOG_COUNT 2 |
| 904 | #define XFS_INACTIVE_LOG_COUNT 2 |
| 905 | #define XFS_CREATE_LOG_COUNT 2 |
| 906 | #define XFS_MKDIR_LOG_COUNT 3 |
| 907 | #define XFS_SYMLINK_LOG_COUNT 3 |
| 908 | #define XFS_REMOVE_LOG_COUNT 2 |
| 909 | #define XFS_LINK_LOG_COUNT 2 |
| 910 | #define XFS_RENAME_LOG_COUNT 2 |
| 911 | #define XFS_WRITE_LOG_COUNT 2 |
| 912 | #define XFS_ADDAFORK_LOG_COUNT 2 |
| 913 | #define XFS_ATTRINVAL_LOG_COUNT 1 |
| 914 | #define XFS_ATTRSET_LOG_COUNT 3 |
| 915 | #define XFS_ATTRRM_LOG_COUNT 3 |
| 916 | |
| 917 | /* |
| 918 | * Here we centralize the specification of XFS meta-data buffer |
| 919 | * reference count values. This determine how hard the buffer |
| 920 | * cache tries to hold onto the buffer. |
| 921 | */ |
| 922 | #define XFS_AGF_REF 4 |
| 923 | #define XFS_AGI_REF 4 |
| 924 | #define XFS_AGFL_REF 3 |
| 925 | #define XFS_INO_BTREE_REF 3 |
| 926 | #define XFS_ALLOC_BTREE_REF 2 |
| 927 | #define XFS_BMAP_BTREE_REF 2 |
| 928 | #define XFS_DIR_BTREE_REF 2 |
| 929 | #define XFS_ATTR_BTREE_REF 1 |
| 930 | #define XFS_INO_REF 1 |
| 931 | #define XFS_DQUOT_REF 1 |
| 932 | |
| 933 | #ifdef __KERNEL__ |
| 934 | /* |
| 935 | * XFS transaction mechanism exported interfaces that are |
| 936 | * actually macros. |
| 937 | */ |
| 938 | #define xfs_trans_get_log_res(tp) ((tp)->t_log_res) |
| 939 | #define xfs_trans_get_log_count(tp) ((tp)->t_log_count) |
| 940 | #define xfs_trans_get_block_res(tp) ((tp)->t_blk_res) |
| 941 | #define xfs_trans_set_sync(tp) ((tp)->t_flags |= XFS_TRANS_SYNC) |
| 942 | |
| 943 | #ifdef DEBUG |
| 944 | #define xfs_trans_agblocks_delta(tp, d) ((tp)->t_ag_freeblks_delta += (long)d) |
| 945 | #define xfs_trans_agflist_delta(tp, d) ((tp)->t_ag_flist_delta += (long)d) |
| 946 | #define xfs_trans_agbtree_delta(tp, d) ((tp)->t_ag_btree_delta += (long)d) |
| 947 | #else |
| 948 | #define xfs_trans_agblocks_delta(tp, d) |
| 949 | #define xfs_trans_agflist_delta(tp, d) |
| 950 | #define xfs_trans_agbtree_delta(tp, d) |
| 951 | #endif |
| 952 | |
| 953 | /* |
| 954 | * XFS transaction mechanism exported interfaces. |
| 955 | */ |
| 956 | void xfs_trans_init(struct xfs_mount *); |
| 957 | xfs_trans_t *xfs_trans_alloc(struct xfs_mount *, uint); |
| 958 | xfs_trans_t *_xfs_trans_alloc(struct xfs_mount *, uint); |
| 959 | xfs_trans_t *xfs_trans_dup(xfs_trans_t *); |
| 960 | int xfs_trans_reserve(xfs_trans_t *, uint, uint, uint, |
| 961 | uint, uint); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 962 | void xfs_trans_mod_sb(xfs_trans_t *, uint, long); |
| 963 | struct xfs_buf *xfs_trans_get_buf(xfs_trans_t *, struct xfs_buftarg *, xfs_daddr_t, |
| 964 | int, uint); |
| 965 | int xfs_trans_read_buf(struct xfs_mount *, xfs_trans_t *, |
| 966 | struct xfs_buftarg *, xfs_daddr_t, int, uint, |
| 967 | struct xfs_buf **); |
| 968 | struct xfs_buf *xfs_trans_getsb(xfs_trans_t *, struct xfs_mount *, int); |
| 969 | |
| 970 | void xfs_trans_brelse(xfs_trans_t *, struct xfs_buf *); |
| 971 | void xfs_trans_bjoin(xfs_trans_t *, struct xfs_buf *); |
| 972 | void xfs_trans_bhold(xfs_trans_t *, struct xfs_buf *); |
Tim Shimmin | efa092f | 2005-09-05 08:29:01 +1000 | [diff] [blame] | 973 | void xfs_trans_bhold_release(xfs_trans_t *, struct xfs_buf *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 974 | void xfs_trans_binval(xfs_trans_t *, struct xfs_buf *); |
| 975 | void xfs_trans_inode_buf(xfs_trans_t *, struct xfs_buf *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 976 | void xfs_trans_stale_inode_buf(xfs_trans_t *, struct xfs_buf *); |
| 977 | void xfs_trans_dquot_buf(xfs_trans_t *, struct xfs_buf *, uint); |
| 978 | void xfs_trans_inode_alloc_buf(xfs_trans_t *, struct xfs_buf *); |
| 979 | int xfs_trans_iget(struct xfs_mount *, xfs_trans_t *, |
| 980 | xfs_ino_t , uint, uint, struct xfs_inode **); |
| 981 | void xfs_trans_ijoin(xfs_trans_t *, struct xfs_inode *, uint); |
| 982 | void xfs_trans_ihold(xfs_trans_t *, struct xfs_inode *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 983 | void xfs_trans_log_buf(xfs_trans_t *, struct xfs_buf *, uint, uint); |
| 984 | void xfs_trans_log_inode(xfs_trans_t *, struct xfs_inode *, uint); |
| 985 | struct xfs_efi_log_item *xfs_trans_get_efi(xfs_trans_t *, uint); |
| 986 | void xfs_efi_release(struct xfs_efi_log_item *, uint); |
| 987 | void xfs_trans_log_efi_extent(xfs_trans_t *, |
| 988 | struct xfs_efi_log_item *, |
| 989 | xfs_fsblock_t, |
| 990 | xfs_extlen_t); |
| 991 | struct xfs_efd_log_item *xfs_trans_get_efd(xfs_trans_t *, |
| 992 | struct xfs_efi_log_item *, |
| 993 | uint); |
| 994 | void xfs_trans_log_efd_extent(xfs_trans_t *, |
| 995 | struct xfs_efd_log_item *, |
| 996 | xfs_fsblock_t, |
| 997 | xfs_extlen_t); |
Christoph Hellwig | f538d4d | 2005-11-02 10:26:59 +1100 | [diff] [blame] | 998 | int _xfs_trans_commit(xfs_trans_t *, |
| 999 | uint flags, |
| 1000 | xfs_lsn_t *, |
| 1001 | int *); |
| 1002 | #define xfs_trans_commit(tp, flags, lsn) \ |
| 1003 | _xfs_trans_commit(tp, flags, lsn, NULL) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1004 | void xfs_trans_cancel(xfs_trans_t *, int); |
| 1005 | void xfs_trans_ail_init(struct xfs_mount *); |
| 1006 | xfs_lsn_t xfs_trans_push_ail(struct xfs_mount *, xfs_lsn_t); |
| 1007 | xfs_lsn_t xfs_trans_tail_ail(struct xfs_mount *); |
| 1008 | void xfs_trans_unlocked_item(struct xfs_mount *, |
| 1009 | xfs_log_item_t *); |
| 1010 | xfs_log_busy_slot_t *xfs_trans_add_busy(xfs_trans_t *tp, |
| 1011 | xfs_agnumber_t ag, |
| 1012 | xfs_extlen_t idx); |
| 1013 | |
| 1014 | #endif /* __KERNEL__ */ |
| 1015 | |
| 1016 | #endif /* __XFS_TRANS_H__ */ |