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